diff --git "a/SubWikics.json" "b/SubWikics.json" new file mode 100644--- /dev/null +++ "b/SubWikics.json" @@ -0,0 +1,66478 @@ +[ + { + "node_id": 0, + "label": 9, + "text": "Locomotive_BASIC:locomotive basic locomotive basic proprietary dialect basic programming language written locomotive software amstrad cpc built-in rom also gem application amstrad pc1512 1640 main ancestor mallard basic interpreter cp/m supplied amstrad pcw two versions locomotive basic 1.0 came cpc model 464 1.1 shipped versions special update\u2014or rather rom extension\u2014was available amstrad cpc plus series machines added specialised basic commands taking advantage extra capabilities machines development based existing work recently undertaken writing mallard basic acorn computers z80 addon bbc micro reported taken around 12 weeks enhance existing code influenced bbc basic though adding additional functions things would required assembly language bbc rather simple powerful basic implementation standards day featuring dedicated commands handling graphics draw plot ink paper versions plus fill v1.1 even allowing creation multiple screens windows like although color system palette handling awkward table giving numeric codes 27 system colors printed built-in 3 disk drive casing 664 later machines simple stand however among basics time offering timer-based software interrupt mechanism using every commands offered timed repeating once-off call respectively basic line number choice also compared home computers time amstrad via locomotive basic granted relatively high level control cpc sound chip ay-3-8912 3 melodic channels 1 noise channel chip also used late-model zx spectrums well atari st msx computers none complete built-in sound command many things selecting particular channel combination channels setting envelopes volume pitch noise could done single sound command 7 parameters granted especially complex and/or low-level techniques could done basic due requiring precise direct access hardware e.g especially complex music trackers including simulated chords using arpeggios etc playback digitally sampled sounds game robocop example disk tape file management managed basic usually good enough simple file management commands get put erase save merge run cat load etc fact years basic supplied standard every low-cost home computer also acted less simple operating system also available special commands memory allocation handling like memory parametric load command allowing example load file containing raw picture data video memory causing displayed couple basic instructions adding right memory address es parameter commands load save would allow easy loading raw uncompressed 16 kb screen pictures calling another address gave forced system reset call 0 famous press key call bb18 eliminating flicker animation allowing synchronize monitor raster scan via sync frame-flyback call bd19 given dedicated command basic 1.1 frame peek poke call provided interface assembly language programming basic locomotive basic compared commodore 64 basic commodore basic dedicated commands graphics sound allowed pretty much anything within standard capabilities machine unimportant machines era using full graphics sound limited assembler programmers msx spectrum others offered similar less complete command set sound graphics capabilities things going clearly beyond basic capabilities overscan modes used games demos 27-color graphics modes digital sound playback smooth scrolling unlike sinclair basic commodore 64 basic various keyboard command shortcuts specialized keys choosing symbols colors locomotive basic keywords typed full interpreter parsed recognized tokenised however abbreviations like print shortcuts programs could saved onto cassette tape floppy disk retrieved binary ascii files", + "neighbors": [ + 8, + 78, + 236, + 273, + 510, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1306, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1, + "label": 2, + "text": "NOS_(software):nos software nos network operating system discontinued operating system time-sharing capabilities written control data corporation 1970s nos ran 60-bit cdc 6000 series mainframe computers successors nos replaced earlier cdc kronos operating system 1970s nos intended sole operating system cdc machines fact cdc promoted heavily nos replaced nos/ve 64-bit cyber-180 systems mid-1980s version 1 nos continued updated 1981 nos version 2 released early 1982 nos version 1 terminal user instant manual cdc 1975-1980", + "neighbors": [ + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 373, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 763, + 797, + 860, + 884, + 891, + 925, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 2, + "label": 3, + "text": "Psychic_World:psychic world psychic world platform game wherein player character luc\u00eda runs one stage using esp booster blast monstrous enemies obtaining item power-ups jumping various ledges platforms booster gauge often certain items abilities used health replenished power-ups weapons upgradeable merely picking item particular weapon new weapons obtained mini-bosses end-level bosses player use lucia psionic weapons strategically levels using different elements advantage ice stage rocks doused falling water frozen used stable platform luc\u00eda jump blasting rock ice shot sonic wave weapon destroy certain foreground objects blocking path taking place remote laboratory year 19xx three-staff research team consisting dr. knavik assistants twin sisters cecile lucia studying exploration usage esp one day lucia getting ready work explosion burst lab time lucia got dr. knavik right cecile disappeared dr. knavik explains part experiments involved running tests variety monsters eventually subjects rebelled took cecile lucia follows monster track dr. knavik gives esp booster device created enable user wield psychic powers psychic world master system given mixed mostly positive reviews 70 raze 69 video games game gear version received score 83 joystick", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 3, + "label": 2, + "text": "Nokia_N77:nokia n77 nokia n77 3g smartphone nokia introduced 12 february 2007 released june 2007 runs symbian 9.1 s60 3rd edition n77 specs somewhat basic compared nseries devices time included dvb-h television tuner stated nokia press release n77 designed low-cost mobile tv accelerate dvb-h adoption sporting candybar design similar n73 company second dvb-h device n92 though smaller screen n77 thus available limited dvb-h markets hard come", + "neighbors": [ + 21, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 4, + "label": 7, + "text": "Piktochart:piktochart piktochart web-based infographic application allows users without intensive experience graphic designers easily create infographics visuals using themed templates march 2012 first iteration piktochart launched co-founders goh ai ching andrea zaggia penang malaysia end year piktochart grew user base 170,000 users received 140,000 grant malaysian government \u2019 cradle fund well announcing raised seed funding number investors userbase grew addition new formats reports banners presentations resulted 3 million users mid-2015 piktochart described forbes magazine infographic tool graphically challenged simply time-crunch 2018 piktochart used 11 million people worldwide grown become semi-distributed team 53 team members office based penang whereas companies like lucidchart trendalyzer gliffy others previously focused data-representation tools would useful intra-corporate collaboration aids speeches presentations creation internal communications documents piktochart described focused empowering users create infographics would web-publisher ready able stand alone piece multimedia content piktochart provides 600 templates users edit using advanced functions customize desired current version piktochart released 2017 includes html publisher allows users create visuals viewed online embedded website well allowing user include multiple interactive elements charts videos map visualization animated icons", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 5, + "label": 3, + "text": "Stop_the_Express:stop express stop express also known bousou tokkyuu sos \u66b4\u8d70\u7279\u6025sos runaway express sos japan video game created hudson soft 1983 made sharp x1 first later ported zx spectrum commodore 64 msx remade nintendo family computer challenger \u30c1\u30e3\u30ec\u30f3\u30b8\u30e3\u30fc 1985 stage 1 player runs along top express train jumping carriages avoiding enemy knives obstacles halfway along train player enters train stage 2 begins player must proceed carriages towards front train stopped upon completion level game displays engrish message congraturation sucsess game repeats stage 1 enemies enemies known redmen initially pursue rear roof train front inside throw knives player must dodge ducking jumping addition inside train player jump hang overhead straps way redmen however ghosts flit carriages making extremely dangerous stay long levels completed redmen approach front rear player two weapons disposal roof train catch birds fly overhead release run along carriage knock redmen well high kicking whilst inside high kick option stop express rated 4th best spectrum game sinclair list top 100 spectrum games 2004 remake stop express jetmans dad took second place retro remakes competition remake faithful original respects although aspects gameplay tweaked slightly player pick knives discarded redmen assist task ghosts replaced robot sentries also fire lasers higher levels nes/famicom port planned due first train level three levels added became challenger released japan", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 6, + "label": 1, + "text": "National_Academic_Depository:national academic depository national academic depository nad digital database academic awards provided government india nad inter-operable system storage retrieval authentication verification academic awards nad allows logging academic awards addition ensuring authenticity integrity confidentiality database nad act deterrent fake forged paper certificates reduce administrative efforts eliminate need institutions preserve physical records academic institutions held responsible authenticity nad data requests access academic awards potential employers require consent recipient academic institutions include following national academic depository bill originally introduced lok sabha 5 september 2011 former human resource development minister shri kapil sibal bill referred standing committee human resource development law lapsed 2014 change government union cabinet prime minister shri narendra modi approved ministry human resource development proposal nad establishment operation 27 october 2016 serviced nsdl database management limited ndml cdsl ventures ltd. cvl \u2013 wholly owned subsidiaries depositories registered securities exchange board india sebi act 1992 fulfilment commitment made finance minister budget speech 2016-17 government designated university grants commission ugc authorized body enter tripartite agreement ndml cvl nad bill proposed make mandatory specified academic institutions log every academic award system established network facilitation centers candidates submit dematerialization requests past academic certificates applications educational institutions may become depository agents system would necessary security ensure authorized users access expenditure government side expected would charge-based service provision users represented educational institutions employers stakeholders present academic institutions authorized upload certificates nad 24 may 2019", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 7, + "label": 8, + "text": "AppJet:appjet appjet website let users create web-based applications client web browser client software appjet founded 3 mit graduates 2 engineers google starting appjet launched initial public beta december 12 2007 allowing anyone create web app appjet received funding combinator summer 2007 project closed 1 july 2009 focus attention etherpad product appjet acquired google december 4 2009 undisclosed amount jgate cloud-based service beta free jan 2011 allows appjet applications run august 14 2008 appjet released programming tutorial aimed absolute beginners tutorial used appjet ide provide programming sandbox examples allowing readers experiment sample code one first online tutorials embed ide exposing complete server-side web app framework inline text appjet also refers server-side javascript framework powers appjet applications example recent trend web development run javascript client server allowing developers code entire web apps one language instead using separate language server-side client-side scripting virtual machine powers appjet apps based java virtual machine using rhino javascript implementation scala libraries also used appjet often updated bug-fixes improvements features major update site graphical change implemented july 10 2008 update also added feature comment users apps comments messages apps left url comments.appname.appjet.net another update occurred may 2 2008 update lets apps hosted custom domains", + "neighbors": [ + 36, + 50, + 69, + 81, + 117, + 201, + 308, + 509, + 538, + 567, + 593, + 632, + 682, + 686, + 712, + 869, + 916, + 959, + 1225, + 1227, + 1235, + 1242, + 1264, + 1269, + 1302, + 1311, + 1481, + 1566 + ], + "mask": "Test" + }, + { + "node_id": 8, + "label": 9, + "text": "WinWrap_Basic:winwrap basic winwrap basic wwb polar engineering inc. third-party macro language based visual basic used programmes various types vendor touts alternative activex e.g vbscript jscript perlscript rexx-based wsh engines others visual basic applications vsta purpose wwb software package used conjunction microsoft development tools including visual studio visual studio.net activex scripting engines default file extension programmes written language .wwb wwb 10 windows scripting host functionality i.e contains scripting engine similar default third-party language implementations wsh engine able access .net framework component object model current version 10.01 available different combinations os platform time four types wwb wwb.net .net object model used visual studio.net 2005 2008 vista .wwb-com com object model visual studio visual studio.net earlier versions used windows 32 64-bit operating systems windows 95 windows vista two packages windows ce pocketpc windows mobile earlier versions wwb ran windows 3.1 ostensibly os/2 warp 3 well wwb integrated many software packages including categories pc server software e.g earlier versions host explorer uses two proprietary scripting languages hummingbird quickscript hummingbird basic well software used run various types equipment like mass spectrometers lab equipment", + "neighbors": [ + 0, + 236, + 273, + 510, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1156, + 1204, + 1306, + 1390, + 1417, + 1584 + ], + "mask": "Test" + }, + { + "node_id": 9, + "label": 2, + "text": "Harmony_OS:harmony os harmony os styled harmonyos upcoming open source microkernel-based distributed operating system similar qnx google fuchsia developed huawei unveiled 9 august 2019 platform designed primarily internet things iot devices prior unveiling originally speculated mobile operating system could replace android future huawei devices response financial sanctions imposed huawei united states government may 2019 july 2019 huawei executives describing harmony industrial embedded operating system designed iot hardware discarding previous statements mobile operating system reports surrounding in-house operating system developed huawei date back far 2012 intensified may 2019 huawei subjected export restrictions united states government violations united states sanctions iran huawei executive richard yu described in-house platform plan b case prevented using android future smartphone products media outlets reported os referred hongmeng os could released china either august september 2019 worldwide release second quarter 2020 24 may 2019 huawei registered hongmeng os trademark china day huawei registered trademarks surrounding ark os variants european union intellectual property office july 2019 reported huawei also registered trademarks surrounding word harmony desktop mobile operating system software indicating either different name component os name hongmeng came chinese mythology symbolizes primordial chaos world creation july 2019 huawei chairman liang hua stated os intended industrial use huawei decided yet hongmeng os developed smartphone operating system future preferring continued use android devices building upon statement huawei senior vice president catherine chen stated embedded operating system designed internet things iot hardware 9 august 2019 huawei officially unveiled harmony os inaugural developers conference dongguan huawei described harmony open source microkernel-based distributed operating system various types hardware faster inter-process communication qnx google fuchsia microkernel real-time resource allocation ark compiler used port android apk packages os huawei stated developers would able flexibly deploy harmony os software across various device categories company focused primarily iot devices including smart displays wearable devices in-car entertainment systems explicitly position harmony os mobile os huawei stated harmony os would initially used devices targeting chinese market company subsidiary brand honor unveiled honor vision line smart tvs first consumer electronics devices run harmony os", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 162, + 170, + 171, + 185, + 187, + 265, + 322, + 337, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 10, + "label": 3, + "text": "Terminus_(1986_video_game):terminus 1986 video game terminus also known terminus prison planet video game mastertronic released 1986 zx spectrum msx amstrad cpc game set inside futuristic prison consisting 512 screens purpose release brain leader teenage gang called wanglers player controls one four characters mobod xann move flying spex moves around bouncing magno uses reverse gravity cling roofs feature used 2010 windows os x game vvvvvv player change characters using one transports hidden around prison must unlock sections prison using teleports game player must also avoid traps include lava pools needle beams creatures compressor rooms activated touching wall sensors well numerous guards energy restored using recharge units located around prison complex", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 11, + "label": 4, + "text": "Backdoor_(computing):backdoor computing backdoor method often secret bypassing normal authentication encryption computer system product embedded device e.g home router embodiment e.g part cryptosystem algorithm chipset homunculus computer \u2014a tiny computer-within-a-computer found intel amt technology backdoors often used securing remote access computer obtaining access plaintext cryptographic systems backdoor may used gain access passwords delete data hard drives transfer information within cloud backdoor may take form hidden part program separate program e.g back orifice may subvert system rootkit code firmware hardware parts operating system windows trojan horses used create vulnerabilities device trojan horse may appear entirely legitimate program executed triggers activity may install backdoor although secretly installed backdoors deliberate widely known kinds backdoors legitimate uses providing manufacturer way restore user passwords many systems store information within cloud fail create accurate security measures many systems connected within cloud hackers gain access platforms vulnerable system default passwords default credentials function backdoors changed user debugging features also act backdoors removed release version 1993 united states government attempted deploy encryption system clipper chip explicit backdoor law enforcement national security access chip unsuccessful threat backdoors surfaced multiuser networked operating systems became widely adopted petersen turn discussed computer subversion paper published proceedings 1967 afips conference noted class active infiltration attacks use trapdoor entry points system bypass security facilities permit direct access data use word trapdoor clearly coincides recent definitions backdoor however since advent public key cryptography term trapdoor acquired different meaning see trapdoor function thus term backdoor preferred term trapdoor went use generally security breaches discussed length rand corporation task force report published arpa sponsorship j.p. anderson d.j edwards 1970 backdoor login system might take form hard coded user password combination gives access system example sort backdoor used plot device 1983 film wargames architect wopr computer system inserted hardcoded password gave user access system undocumented parts system particular video game-like simulation mode direct interaction artificial intelligence although number backdoors systems using proprietary software software whose source code publicly available widely credited nevertheless frequently exposed programmers even succeeded secretly installing large amounts benign code easter eggs programs although cases may involve official forbearance actual permission countermeasure backdoors open-source software source code examined potential backdoors usually harder \u2033hide\u2033 backdoor combined reproducible builds one also sure provided binary corresponds publicly available source code number cloak dagger considerations come play apportioning responsibility covert backdoors sometimes masquerade inadvertent defects bugs reasons plausible deniability cases might begin life actual bug inadvertent error discovered deliberately left unfixed undisclosed whether rogue employee personal advantage c-level executive awareness oversight also possible entirely above-board corporation technology base covertly untraceably tainted external agents hackers though level sophistication thought exist mainly level nation state actors example photomask obtained photomask supplier differs gates photomask specification chip manufacturer would hard-pressed detect otherwise functionally silent covert rootkit running photomask etching equipment could enact discrepancy unbeknown photomask manufacturer either means one backdoor potentially leads another hypothetical scenario essentially silicon version undetectable compiler backdoor discussed general terms long dependency-chains modern highly specialized technological economy innumerable human-elements process control-points make difficult conclusively pinpoint responsibility time covert backdoor becomes unveiled even direct admissions responsibility must scrutinized carefully confessing party beholden powerful interests many computer worms sobig mydoom install backdoor affected computer generally pc broadband running microsoft windows microsoft outlook backdoors appear installed spammers send junk e-mail infected machines others sony/bmg rootkit placed secretly millions music cds late 2005 intended drm measures\u2014and case data-gathering agents since surreptitious programs installed routinely contacted central servers sophisticated attempt plant backdoor linux kernel exposed november 2003 added small subtle code change subverting revision control system case two-line change appeared check root access permissions caller sys_wait4 function used assignment codice_1 instead equality checking codice_2 actually granted permissions system difference easily overlooked could even interpreted accidental typographical error rather intentional attack january 2014 backdoor discovered certain samsung android products like galaxy devices samsung proprietary android versions fitted backdoor provides remote access data stored device particular samsung android software charge handling communications modem using samsung ipc protocol implements class requests known remote file server rfs commands allows backdoor operator perform via modem remote i/o operations device hard disk storage modem running samsung proprietary android software likely offers over-the-air remote control could used issue rfs commands thus access file system device harder detect backdoors involve modifying object code rather source code \u2013 object code much harder inspect designed machine-readable human-readable backdoors inserted either directly on-disk object code inserted point compilation assembly linking loading \u2013 latter case backdoor never appears disk memory object code backdoors difficult detect inspection object code easily detected simply checking changes differences notably length checksum cases detected analyzed disassembling object code object code backdoors removed assuming source code available simply recompiling source thus backdoors avoid detection extant copies binary must subverted validation checksums must also compromised source must unavailable prevent recompilation alternatively tools length checks diff checksumming disassemblers compromised conceal backdoor example detecting subverted binary checksummed returning expected value actual value conceal subversions tools must also conceal changes \u2013 example subverted checksummer must also detect checksumming subverted tools return false values leads extensive changes system tools needed conceal single change object code regenerated recompiling reassembling relinking original source code making persistent object code backdoor without modifying source code requires subverting compiler \u2013 detects compiling program attack inserts backdoor \u2013 alternatively assembler linker loader requires subverting compiler turn fixed recompiling compiler removing backdoor insertion code defense turn subverted putting source meta-backdoor compiler detects compiling inserts meta-backdoor generator together original backdoor generator original program attack done source meta-backdoor removed compiler recompiled original source compromised compiler executable backdoor bootstrapped attack dates popularized thompson 1984 article entitled reflections trusting trust hence colloquially known trusting trust attack see compiler backdoors details analogous attacks target lower levels system operating system inserted system booting process also mentioned exist form boot sector viruses traditional backdoor symmetric backdoor anyone finds backdoor turn use notion asymmetric backdoor introduced adam young moti yung proceedings advances cryptology crypto '96 asymmetric backdoor used attacker plants even full implementation backdoor becomes public e.g. via publishing discovered disclosed reverse engineering etc. also computationally intractable detect presence asymmetric backdoor black-box queries class attacks termed kleptography carried software hardware example smartcards combination two theory asymmetric backdoors part larger field called cryptovirology notably nsa inserted kleptographic backdoor dual_ec_drbg standard exists experimental asymmetric backdoor rsa key generation openssl rsa backdoor designed young yung utilizes twisted pair elliptic curves made available sophisticated form black box backdoor compiler backdoor compiler subverted insert backdoor program login program modified detect compiling inserts backdoor insertion code targeting program code-modifying self-compilation like mechanism retroviruses infect host done modifying source code resulting compromised compiler object code compile original unmodified source code insert exploit boot-strapped attack originally presented united states air force security analysis multics described attack pl/i compiler call compiler trap door also mention variant system initialization code modified insert backdoor booting complex poorly understood call initialization trapdoor known boot sector virus attack actually implemented popularized ken thompson turing award acceptance speech 1983 published 1984 reflections trusting trust points trust relative software one truly trust code every step bootstrapping inspected backdoor mechanism based fact people review source human-written code compiled machine code object code program called compiler used create second first compiler usually trusted honest job thompson paper describes modified version unix c compiler would compiler compiled program users would extremely unlikely notice machine code instructions performed tasks second task compiler source code would appear clean worse thompson proof concept implementation subverted compiler also subverted analysis program disassembler anyone examined binaries usual way would actually see real code running something else instead updated analysis original exploit given historical overview survey literature given thompson version officially never released wild believed however version distributed bbn least one use backdoor recorded scattered anecdotal reports backdoors subsequent years attack recently august 2009 discovered sophos labs w32/induc-a virus infected program compiler delphi windows programming language virus introduced code compilation new delphi programs allowing infect propagate many systems without knowledge software programmer attack propagates building trojan horse especially hard discover believed induc-a virus propagating least year discovered system compromised backdoor trojan horse trusting trust compiler hard rightful user regain control system \u2013 typically one rebuild clean system transfer data executables however several practical weaknesses trusting trust scheme suggested example sufficiently motivated user could painstakingly review machine code untrusted compiler using mentioned ways hide trojan horse subverting disassembler ways counter defense writing disassembler scratch generic method counter trusting trust attacks called diverse double-compiling ddc method requires different compiler source code compiler-under-test source compiled compilers results two different stage-1 compilers however behavior thus source compiled stage-1 compilers must result two identical stage-2 compilers formal proof given latter comparison guarantees purported source code executable compiler-under-test correspond assumptions method applied author verify c compiler gcc suite v. 3.0.4 contained trojan using icc v. 11.0 different compiler practice verifications done end users except extreme circumstances intrusion detection analysis due rarity sophisticated attacks programs typically distributed binary form removing backdoors including compiler backdoors typically done simply rebuilding clean system however sophisticated verifications interest operating system vendors ensure distributing compromised system high-security settings attacks realistic concern", + "neighbors": [ + 144, + 149, + 190, + 201, + 232, + 260, + 292, + 293, + 306, + 310, + 317, + 338, + 343, + 364, + 379, + 413, + 439, + 450, + 479, + 487, + 509, + 518, + 528, + 531, + 542, + 564, + 576, + 624, + 631, + 641, + 675, + 692, + 698, + 703, + 739, + 740, + 746, + 750, + 762, + 763, + 800, + 818, + 868, + 898, + 938, + 961, + 1003, + 1039, + 1043, + 1044, + 1090, + 1112, + 1138, + 1217, + 1303, + 1309, + 1325, + 1327, + 1355, + 1358, + 1361, + 1368, + 1373, + 1379, + 1436, + 1444, + 1472, + 1558, + 1585 + ], + "mask": "Train" + }, + { + "node_id": 12, + "label": 8, + "text": "Web_crawler:web crawler web crawler sometimes called spider spiderbot often shortened crawler internet bot systematically browses world wide web typically purpose web indexing web spidering web search engines sites use web crawling spidering software update web content indices others sites web content web crawlers copy pages processing search engine indexes downloaded pages users search efficiently crawlers consume resources visited systems often visit sites without approval issues schedule load politeness come play large collections pages accessed mechanisms exist public sites wishing crawled make known crawling agent example including robots.txt file request bots index parts website nothing number internet pages extremely large even largest crawlers fall short making complete index reason search engines struggled give relevant search results early years world wide web 2000 today relevant results given almost instantly crawlers validate hyperlinks html code also used web scraping see also data-driven programming web crawler also known spider ant automatic indexer foaf software context web scutter web crawler starts list urls visit called seeds crawler visits urls identifies hyperlinks pages adds list urls visit called crawl frontier urls frontier recursively visited according set policies crawler performing archiving websites copies saves information goes archives usually stored way viewed read navigated live web preserved \u2018 snapshots archive known repository designed store manage collection web pages repository stores html pages pages stored distinct files repository similar system stores data like modern day database difference repository need functionality offered database system repository stores recent version web page retrieved crawler large volume implies crawler download limited number web pages within given time needs prioritize downloads high rate change imply pages might already updated even deleted number possible urls crawled generated server-side software also made difficult web crawlers avoid retrieving duplicate content endless combinations http get url-based parameters exist small selection actually return unique content example simple online photo gallery may offer three options users specified http get parameters url exist four ways sort images three choices thumbnail size two file formats option disable user-provided content set content accessed 48 different urls may linked site mathematical combination creates problem crawlers must sort endless combinations relatively minor scripted changes order retrieve unique content edwards et al noted given bandwidth conducting crawls neither infinite free becoming essential crawl web scalable efficient way reasonable measure quality freshness maintained crawler must carefully choose step pages visit next behavior web crawler outcome combination policies given current size web even large search engines cover portion publicly available part 2009 study showed even large-scale search engines index 40-70 indexable web previous study steve lawrence lee giles showed search engine indexed 16 web 1999 crawler always downloads fraction web pages highly desirable downloaded fraction contain relevant pages random sample web requires metric importance prioritizing web pages importance page function intrinsic quality popularity terms links visits even url latter case vertical search engines restricted single top-level domain search engines restricted fixed web site designing good selection policy added difficulty must work partial information complete set web pages known crawling junghoo cho et al made first study policies crawling scheduling data set 180,000-pages crawl stanford.edu domain crawling simulation done different strategies ordering metrics tested breadth-first backlink count partial pagerank calculations one conclusions crawler wants download pages high pagerank early crawling process partial pagerank strategy better followed breadth-first backlink-count however results single domain cho also wrote ph.d. dissertation stanford web crawling najork wiener performed actual crawl 328 million pages using breadth-first ordering found breadth-first crawl captures pages high pagerank early crawl compare strategy strategies explanation given authors result important pages many links numerous hosts links found early regardless host page crawl originates abiteboul designed crawling strategy based algorithm called opic on-line page importance computation opic page given initial sum cash distributed equally among pages points similar pagerank computation faster done one step opic-driven crawler downloads first pages crawling frontier higher amounts cash experiments carried 100,000-pages synthetic graph power-law distribution in-links however comparison strategies experiments real web boldi et al used simulation subsets web 40 million pages .it domain 100 million pages webbase crawl testing breadth-first depth-first random ordering omniscient strategy comparison based well pagerank computed partial crawl approximates true pagerank value surprisingly visits accumulate pagerank quickly notably breadth-first omniscient visit provide poor progressive approximations baeza-yates et al used simulation two subsets web 3 million pages .gr .cl domain testing several crawling strategies showed opic strategy strategy uses length per-site queues better breadth-first crawling also effective use previous crawl available guide current one daneshpajouh et al designed community based algorithm discovering good seeds method crawls web pages high pagerank different communities less iteration comparison crawl starting random seeds one extract good seed previously-crawled-web graph using new method using seeds new crawl effective crawler may want seek html pages avoid mime types order request html resources crawler may make http head request determine web resource mime type requesting entire resource get request avoid making numerous head requests crawler may examine url request resource url ends certain characters .html .htm .asp .aspx .php .jsp .jspx slash strategy may cause numerous html web resources unintentionally skipped crawlers may also avoid requesting resources dynamically produced order avoid spider traps may cause crawler download infinite number urls web site strategy unreliable site uses url rewriting simplify urls crawlers usually perform type url normalization order avoid crawling resource term url normalization also called url canonicalization refers process modifying standardizing url consistent manner several types normalization may performed including conversion urls lowercase removal .. segments adding trailing slashes non-empty path component crawlers intend download/upload many resources possible particular web site path-ascending crawler introduced would ascend every path url intends crawl example given seed url nowiki http //llama.org/hamster/monkey/page.html /nowiki attempt crawl /hamster/monkey/ /hamster/ cothey found path-ascending crawler effective finding isolated resources resources inbound link would found regular crawling importance page crawler also expressed function similarity page given query web crawlers attempt download pages similar called focused crawler topical crawlers concepts topical focused crawling first introduced filippo menczer soumen chakrabarti et al main problem focused crawling context web crawler would like able predict similarity text given page query actually downloading page possible predictor anchor text links approach taken pinkerton first web crawler early days web diligenti et al propose using complete content pages already visited infer similarity driving query pages visited yet performance focused crawling depends mostly richness links specific topic searched focused crawling usually relies general web search engine providing starting points example focused crawlers academic crawlers crawls free-access academic related documents citeseerxbot crawler citeseer search engine academic search engines google scholar microsoft academic search etc academic papers published pdf formats kind crawler particularly interested crawling pdf postscript files microsoft word including zipped formats general open source crawlers heritrix must customized filter mime types middleware used extract documents import focused crawl database repository identifying whether documents academic challenging add significant overhead crawling process performed post crawling process using machine learning regular expression algorithms academic documents usually obtained home pages faculties students publication page research institutes academic documents takes small fraction entire web pages good seed selection important boosting efficiencies web crawlers academic crawlers may download plain text html files contains metadata academic papers titles papers abstracts increases overall number papers significant fraction may provide free pdf downloads another type focused crawlers semantic focused crawler makes use domain ontologies represent topical maps link web pages relevant ontological concepts selection categorization purposes addition ontologies automatically updated crawling process dong et al introduced ontology-learning-based crawler using support vector machine update content ontological concepts crawling web pages web dynamic nature crawling fraction web take weeks months time web crawler finished crawl many events could happened including creations updates deletions search engine point view cost associated detecting event thus outdated copy resource most-used cost functions freshness age freshness binary measure indicates whether local copy accurate freshness page p repository time defined age measure indicates outdated local copy age page p repository time defined coffman et al worked definition objective web crawler equivalent freshness use different wording propose crawler must minimize fraction time pages remain outdated also noted problem web crawling modeled multiple-queue single-server polling system web crawler server web sites queues page modifications arrival customers switch-over times interval page accesses single web site model mean waiting time customer polling system equivalent average age web crawler objective crawler keep average freshness pages collection high possible keep average age pages low possible objectives equivalent first case crawler concerned many pages out-dated second case crawler concerned old local copies pages two simple re-visiting policies studied cho garcia-molina cases repeated crawling order pages done either random fixed order cho garcia-molina proved surprising result terms average freshness uniform policy outperforms proportional policy simulated web real web crawl intuitively reasoning web crawlers limit many pages crawl given time frame 1 allocate many new crawls rapidly changing pages expense less frequently updating pages 2 freshness rapidly changing pages lasts shorter period less frequently changing pages words proportional policy allocates resources crawling frequently updating pages experiences less overall freshness time improve freshness crawler penalize elements change often optimal re-visiting policy neither uniform policy proportional policy optimal method keeping average freshness high includes ignoring pages change often optimal keeping average age low use access frequencies monotonically sub-linearly increase rate change page cases optimal closer uniform policy proportional policy coffman et al note order minimize expected obsolescence time accesses particular page kept evenly spaced possible explicit formulas re-visit policy attainable general obtained numerically depend distribution page changes cho garcia-molina show exponential distribution good fit describing page changes ipeirotis et al show use statistical tools discover parameters affect distribution note re-visiting policies considered regard pages homogeneous terms quality pages web worth something realistic scenario information web page quality included achieve better crawling policy crawlers retrieve data much quicker greater depth human searchers crippling impact performance site needless say single crawler performing multiple requests per second and/or downloading large files server would hard time keeping requests multiple crawlers noted koster use web crawlers useful number tasks comes price general community costs using web crawlers include partial solution problems robots exclusion protocol also known robots.txt protocol standard administrators indicate parts web servers accessed crawlers standard include suggestion interval visits server even though interval effective way avoiding server overload recently commercial search engines like google ask jeeves msn yahoo search able use extra crawl-delay parameter robots.txt file indicate number seconds delay requests first proposed interval successive pageloads 60 seconds however pages downloaded rate website 100,000 pages perfect connection zero latency infinite bandwidth would take 2 months download entire web site also fraction resources web server would used seem acceptable cho uses 10 seconds interval accesses wire crawler uses 15 seconds default mercatorweb crawler follows adaptive politeness policy took seconds download document given server crawler waits 10 seconds downloading next page dill et al use 1 second using web crawlers research purposes detailed cost-benefit analysis needed ethical considerations taken account deciding crawl fast crawl anecdotal evidence access logs shows access intervals known crawlers vary 20 seconds 3\u20134 minutes worth noticing even polite taking safeguards avoid overloading web servers complaints web server administrators received brin page note ... running crawler connects half million servers ... generates fair amount e-mail phone calls vast number people coming line always know crawler first one seen parallel crawler crawler runs multiple processes parallel goal maximize download rate minimizing overhead parallelization avoid repeated downloads page avoid downloading page crawling system requires policy assigning new urls discovered crawling process url found two different crawling processes crawler must good crawling strategy noted previous sections also highly optimized architecture shkapenyuk suel noted web crawlers central part search engines details algorithms architecture kept business secrets crawler designs published often important lack detail prevents others reproducing work also emerging concerns search engine spamming prevent major search engines publishing ranking algorithms website owners keen pages indexed broadly possible strong presence search engines web crawling also unintended consequences lead compromise data breach search engine indexes resources n't publicly available pages revealing potentially vulnerable versions software apart standard web application security recommendations website owners reduce exposure opportunistic hacking allowing search engines index public parts websites robots.txt explicitly blocking indexing transactional parts login pages private pages etc. web crawlers typically identify web server using user-agent field http request web site administrators typically examine web servers log use user agent field determine crawlers visited web server often user agent field may include url web site administrator may find information crawler examining web server log tedious task therefore administrators use tools identify track verify web crawlers spambots malicious web crawlers unlikely place identifying information user agent field may mask identity browser well-known crawler important web crawlers identify web site administrators contact owner needed cases crawlers may accidentally trapped crawler trap may overloading web server requests owner needs stop crawler identification also useful administrators interested knowing may expect web pages indexed particular search engine vast amount web pages lie deep invisible web pages typically accessible submitting queries database regular crawlers unable find pages links point google sitemaps protocol mod oai intended allow discovery deep-web resources deep web crawling also multiplies number web links crawled crawlers take urls codice_1 form cases googlebot web crawling done text contained inside hypertext content tags text strategic approaches may taken target deep web content technique called screen scraping specialized software may customized automatically repeatedly query given web form intention aggregating resulting data software used span multiple web forms across multiple websites data extracted results one web form submission taken applied input another web form thus establishing continuity across deep web way possible traditional web crawlers pages built ajax among causing problems web crawlers google proposed format ajax calls bot recognize index recent study based large scale analysis robots.txt files showed certain web crawlers preferred others googlebot preferred web crawler number visual web scraper/crawler products available web crawl pages structure data columns rows based users requirements one main difference classic visual crawler level programming ability required set crawler latest generation visual scrapers like diffbot outwithub import.io remove majority programming skill needed able program start crawl scrape web data visual scraping/crawling method relies user teaching piece crawler technology follows patterns semi-structured data sources dominant method teaching visual crawler highlighting data browser training columns rows technology new example basis needlebase bought google part larger acquisition ita labs continued growth investment area investors end-users following list published crawler architectures general-purpose crawlers excluding focused web crawlers brief description includes names given different components outstanding features", + "neighbors": [ + 12, + 14, + 124, + 182, + 186, + 306, + 684, + 896, + 1129, + 1142, + 1159, + 1209, + 1225, + 1232, + 1233, + 1235, + 1246, + 1465, + 1472, + 1528 + ], + "mask": "Test" + }, + { + "node_id": 13, + "label": 7, + "text": "Single_system_image:single system image distributed computing single system image ssi cluster cluster machines appears one single system concept often considered synonymous distributed operating system single image may presented limited purposes job scheduling instance may achieved means additional layer software conventional operating system images running node interest ssi clusters based perception may simpler use administer specialized clusters different ssi systems may provide less complete illusion single system different ssi systems may depending intended usage provide subset features many ssi systems provide process migration processes may start one node moved another node possibly resource balancing administrative reasons processes moved one node another associated resources example ipc resources may moved ssi systems allow checkpointing running processes allowing current state saved reloaded later date checkpointing seen related migration migrating process one node another implemented first checkpointing process restarting another node alternatively checkpointing considered migration disk ssi systems provide illusion processes running machine process management tools e.g ps kill unix like systems operate processes cluster ssi systems provide single view file system may achieved simple nfs server shared disk devices even file replication advantage single root view processes may run available node access needed files special precautions cluster implements process migration single root view enables direct accesses files node process currently running ssi systems provide way breaking illusion node-specific files even single root hp trucluster provides context dependent symbolic link cdsl points different files depending node accesses hp vmscluster provides search list logical name node specific files occluding cluster shared files necessary capability may necessary deal heterogeneous clusters nodes configuration complex configurations multiple nodes multiple architectures multiple sites several local disks may combine form logical single root ssi systems allow nodes access i/o devices e.g tapes disks serial lines nodes may restrictions kinds accesses allowed example openssi ca n't mount disk devices one node another node ssi systems allow processes different nodes communicate using inter-process communications mechanisms running machine ssi systems even include shared memory emulated software distributed shared memory cases inter-node ipc slower ipc machine possibly drastically slower shared memory ssi clusters include special hardware reduce slowdown ssi systems provide cluster address single address visible outside cluster used contact cluster one machine used load balancing inbound calls cluster directing lightly loaded nodes redundancy moving cluster address one machine another nodes join leave cluster examples vary commercial platforms scaling capabilities packages/frameworks creating distributed systems well actually implement single system image", + "neighbors": [ + 134, + 340, + 362, + 755, + 1087, + 1102, + 1138, + 1219, + 1274 + ], + "mask": "Test" + }, + { + "node_id": 14, + "label": 8, + "text": "World_Wide_Web:world wide web world wide web www commonly known web information system documents web resources identified uniform resource locators urls nowiki https //www.example.com/ /nowiki may interlinked hypertext accessible internet resources www may accessed users software application called web browser english scientist tim berners-lee invented world wide web 1989 wrote first web browser 1990 employed cern near geneva switzerland browser released outside cern 1991 first research institutions starting january 1991 general public august 1991 world wide web central development information age primary tool billions people use interact internet web resources may type downloaded media web pages hypertext media formatted hypertext markup language html formatting allows embedded hyperlinks contain urls permit users navigate web resources addition text web pages may contain images video audio software components rendered user web browser coherent pages multimedia content multiple web resources common theme common domain name make website websites stored computers running program called web server responds requests made internet web browsers running user computer website content largely provided publisher interactively users contribute content content depends upon users actions websites may provided myriad informative entertainment commercial governmental non-governmental reasons tim berners-lee vision global hyperlinked information system became possibility second half 1980s 1985 global internet began proliferate europe domain name system upon uniform resource locator built came 1988 first direct ip connection europe north america made berners-lee began openly discuss possibility web-like system cern working cern berners-lee became frustrated inefficiencies difficulties posed finding information stored different computers march 12 1989 submitted memorandum titled information management proposal management cern system called mesh referenced enquire database software project built 1980 used term web described elaborate information management system based links embedded text imagine references document associated network address thing referred reading document could skip click mouse system explained could referred using one existing meanings word hypertext term says coined 1950s reason proposal continues hypertext links could encompass multimedia documents including graphics speech video berners-lee goes use term hypermedia help colleague fellow hypertext enthusiast robert cailliau published formal proposal 12 november 1990 build hypertext project called worldwideweb one word web hypertext documents viewed browsers using client\u2013server architecture point html http already development two months first web server month completing first successful test proposal estimated read-only web would developed within three months would take six months achieve creation new links new material readers authorship becomes universal well automatic notification reader new material interest him/her become available read-only goal met accessible authorship web content took longer mature wiki concept webdav blogs web 2.0 rss/atom proposal modelled sgml reader dynatext electronic book technology spin-off institute research information scholarship brown university dynatext system licensed cern key player extension sgml iso 8879:1986 hypermedia within hytime considered expensive inappropriate licensing policy use general high energy physics community namely fee document document alteration next computer used berners-lee world first web server also write first web browser worldwideweb 1990 christmas 1990 berners-lee built tools necessary working web first web browser web editor well first web server first web site described project published 20 december 1990 first web page may lost paul jones unc-chapel hill north carolina announced may 2013 berners-lee gave says oldest known web page 1991 visit unc jones stored magneto-optical drive next computer 6 august 1991 berners-lee published short summary world wide web project newsgroup alt.hypertext date sometimes confused public availability first web servers occurred months earlier another example confusion several news media reported first photo web published berners-lee 1992 image cern house band les horribles cernettes taken silvano de gennaro gennaro disclaimed story writing media totally distorting words sake cheap sensationalism first server outside europe installed stanford linear accelerator center slac palo alto california host spires-hep database accounts differ substantially date event world wide web consortium timeline says december 1992 whereas slac claims december 1991 w3c document titled little history world wide web underlying concept hypertext originated previous projects 1960s hypertext editing system hes brown university ted nelson project xanadu douglas engelbart on-line system nls nelson engelbart turn inspired vannevar bush microfilm-based memex described 1945 essay may think berners-lee breakthrough marry hypertext internet book explains repeatedly suggested marriage two technologies possible members technical communities one took invitation finally assumed project process developed three essential technologies world wide web several differences hypertext systems available time web required unidirectional links rather bidirectional ones making possible someone link another resource without action owner resource also significantly reduced difficulty implementing web servers browsers comparison earlier systems turn presented chronic problem link rot unlike predecessors hypercard world wide web non-proprietary making possible develop servers clients independently add extensions without licensing restrictions 30 april 1993 cern announced world wide web would free anyone fees due coming two months announcement server implementation gopher protocol longer free use produced rapid shift away gopher towards web early popular web browser violawww unix x window system scholars generally agree turning point world wide web began introduction mosaic web browser 1993 graphical browser developed team national center supercomputing applications university illinois urbana\u2013champaign ncsa-uiuc led marc andreessen funding mosaic came us high-performance computing communications initiative high performance computing act 1991 one several computing developments initiated us senator al gore prior release mosaic graphics commonly mixed text web pages web popularity less older protocols use internet gopher wide area information servers wais mosaic graphical user interface allowed web become far popular internet protocol world wide web consortium w3c founded tim berners-lee left european organization nuclear research cern october 1994 founded massachusetts institute technology laboratory computer science mit/lcs support defense advanced research projects agency darpa pioneered internet year later second site founded inria french national computer research lab support european commission dg infso 1996 third continental site created japan keio university end 1994 total number websites still relatively small many notable websites already active foreshadowed inspired today popular services connected internet websites created around world motivated international standards development protocols formatting berners-lee continued stay involved guiding development web standards markup languages compose web pages advocated vision semantic web world wide web enabled spread information internet easy-to-use flexible format thus played important role popularising use internet although two terms sometimes conflated popular use world wide web synonymous internet web information space containing hyperlinked documents resources identified uris implemented client server software using internet protocols tcp/ip http berners-lee knighted 2004 queen elizabeth ii services global development internet never patented invention terms internet world wide web often used without much distinction however two terms mean thing internet global system interconnected computer networks contrast world wide web global collection documents resources linked hyperlinks uris web resources accessed using http https application-level internet protocols use internet transport protocols viewing web page world wide web normally begins either typing url page web browser following hyperlink page resource web browser initiates series background communication messages fetch display requested page 1990s using browser view web pages\u2014and move one web page another hyperlinks\u2014came known 'browsing 'web surfing channel surfing 'navigating web early studies new behaviour investigated user patterns using web browsers one study example found five user patterns exploratory surfing window surfing evolved surfing bounded navigation targeted navigation following example demonstrates functioning web browser accessing page url codice_1 browser resolves server name url codice_2 internet protocol address using globally distributed domain name system dns lookup returns ip address 203.0.113.4 2001 db8:2e :7334 browser requests resource sending http request across internet computer address requests service specific tcp port number well known http service receiving host distinguish http request network protocols may servicing http protocol normally uses port number 80 https protocol normally port number 443 content http request simple two lines text computer receiving http request delivers web server software listening requests port 80 web server fulfil request sends http response back browser indicating success followed content requested page hypertext markup language html basic web page might look like web browser parses html interprets markup paragraph surrounds words format text screen many web pages use html reference urls resources images embedded media scripts affect page behaviour cascading style sheets affect page layout browser makes additional http requests web server internet media types receives content web server browser progressively renders page onto screen specified html additional resources hypertext markup language html standard markup language creating web pages web applications cascading style sheets css javascript forms triad cornerstone technologies world wide web web browsers receive html documents web server local storage render documents multimedia web pages html describes structure web page semantically originally included cues appearance document html elements building blocks html pages html constructs images objects interactive forms may embedded rendered page html provides means create structured documents denoting structural semantics text headings paragraphs lists links quotes items html elements delineated tags written using angle brackets tags directly introduce content page tags surround provide information document text may include tags sub-elements browsers display html tags use interpret content page html embed programs written scripting language javascript affects behavior content web pages inclusion css defines look layout content world wide web consortium w3c maintainer html css standards encouraged use css explicit presentational html web pages contain hyperlinks related pages perhaps downloadable files source documents definitions web resources underlying html hyperlink looks like collection useful related resources interconnected via hypertext links dubbed web information publication internet created tim berners-lee first called worldwideweb original camelcase subsequently discarded november 1990 hyperlink structure www described webgraph nodes web graph correspond web pages urls directed edges hyperlinks time many web resources pointed hyperlinks disappear relocate replaced different content makes hyperlinks obsolete phenomenon referred circles link rot hyperlinks affected often called dead links ephemeral nature web prompted many efforts archive web sites internet archive active since 1996 best known efforts many hostnames used world wide web begin www long-standing practice naming internet hosts according services provide hostname web server often www way may ftp ftp server news nntp usenet news server host names appear domain name system dns subdomain names www.example.com use www required technical policy standard many web sites use first web server nxoc01.cern.ch according paolo palazzi worked cern along tim berners-lee popular use www subdomain accidental world wide web project page intended published www.cern.ch info.cern.ch intended cern home page however dns records never switched practice prepending www institution website domain name subsequently copied many established websites still use prefix employ subdomain names www2 secure en special purposes many web servers set main domain name e.g. example.com www subdomain e.g. www.example.com refer site others require one form may map different web sites use subdomain name useful load balancing incoming web traffic creating cname record points cluster web servers since currently subdomain used cname result achieved using bare domain root user submits incomplete domain name web browser address bar input field web browsers automatically try adding prefix www beginning possibly .com .org .net end depending might missing example entering may transformed nowiki http //www.microsoft.com/ /nowiki 'openoffice nowiki http //www.openoffice.org /nowiki feature started appearing early versions firefox still working title 'firebird early 2003 earlier practice browsers lynx reported microsoft granted us patent idea 2008 mobile devices english www usually read double-u double-u double-u users pronounce dub-dub-dub particularly new zealand stephen fry podgrams series podcasts pronounces wuh wuh wuh english writer douglas adams quipped independent sunday 1999 world wide web thing know whose shortened form takes three times longer say short mandarin chinese world wide web commonly translated via phono-semantic matching w\u00e0n w\u00e9i w\u01ceng satisfies www literally means myriad dimensional net translation reflects design concept proliferation world wide web tim berners-lee web-space states world wide web officially spelled three separate words capitalised intervening hyphens use www prefix declining especially web 2.0 web applications sought brand domain names make easily pronounceable mobile web grew popularity services like gmail.com outlook.com myspace.com facebook.com twitter.com often mentioned without adding www indeed .com domain scheme specifiers codice_3 codice_4 start web uri refer hypertext transfer protocol http secure respectively specify communication protocol use request response http protocol fundamental operation world wide web added encryption layer https essential browsers send retrieve confidential data passwords banking information web browsers usually automatically prepend nowiki http // /nowiki user-entered uris omitted web page also written webpage document suitable world wide web web browsers web browser displays web page monitor mobile device term web page usually refers visible may also refer contents computer file usually text file containing hypertext written html comparable markup language typical web pages provide hypertext browsing web pages via hyperlinks often referred links web browsers frequently access multiple web resource elements reading style sheets scripts images presenting web page network web browser retrieve web page remote web server web server may restrict access private network corporate intranet web browser uses hypertext transfer protocol http make requests web server static web page delivered exactly stored web content web server file system contrast dynamic web page generated web application usually driven server-side software dynamic web pages help browser client enhance web page user input server static web page sometimes called flat page/stationary page web page delivered user exactly stored contrast dynamic web pages generated web application consequently static web page displays information users contexts subject modern capabilities web server negotiate content-type language document versions available server configured server-side dynamic web page web page whose construction controlled application server processing server-side scripts server-side scripting parameters determine assembly every new web page proceeds including setting client-side processing client-side dynamic web page processes web page using html scripting running browser loads javascript scripting languages determine way html received page parsed document object model dom represents loaded web page client-side techniques dynamically update change dom way dynamic web page reloaded user computer program change variable content updating information could come server changes made page dom may may truncate browsing history create saved version go back dynamic web page update using ajax technologies neither create page go back truncate web browsing history forward displayed page using ajax technologies end user gets one dynamic page managed single page web browser actual web content rendered page vary ajax engine sits browser requesting parts dom dom client application server dhtml umbrella term technologies methods used create web pages static web pages though fallen common use since popularization ajax term rarely used client-side-scripting server-side scripting combination make dynamic web experience browser javascript scripting language initially developed 1995 brendan eich netscape use within web pages standardised version ecmascript make web pages interactive web applications also use javascript techniques ajax asynchronous javascript xml client-side script delivered page make additional http requests server either response user actions mouse movements clicks based elapsed time server responses used modify current page rather creating new page response server needs provide limited incremental information multiple ajax requests handled time users interact page data retrieved web pages may also regularly poll server check whether new information available website collection related web resources including web pages multimedia content typically identified common domain name published least one web server notable examples wikipedia.org google.com amazon.com website may accessible via public internet protocol ip network internet private local area network lan referencing uniform resource locator url identifies site websites many functions used various fashions website personal website corporate website company government website organization website etc websites typically dedicated particular topic purpose ranging entertainment social networking providing news education publicly accessible websites collectively constitute world wide web private websites company website employees typically part intranet web pages building blocks websites documents typically composed plain text interspersed formatting instructions hypertext markup language html xhtml may incorporate elements websites suitable markup anchors web pages accessed transported hypertext transfer protocol http may optionally employ encryption http secure https provide security privacy user user application often web browser renders page content according html markup instructions onto display terminal hyperlinking web pages conveys reader site structure guides navigation site often starts home page containing directory site web content websites require user registration subscription access content examples subscription websites include many business sites news websites academic journal websites gaming websites file-sharing websites message boards web-based email social networking websites websites providing real-time stock market data well sites providing various services end users access websites range devices including desktop laptop computers tablet computers smartphones smart tvs web browser commonly referred browser software user agent accessing information world wide web connect website server display pages user needs web browser program program user runs download format display web page user computer addition allowing users find displaying moving web pages web browser usually features like keeping bookmarks recording history managing cookies see home pages may facilities recording passwords logging web sites popular browsers chrome firefox safari internet explorer edge web server server software hardware dedicated running said software satisfy world wide web client requests web server general contain one websites web server processes incoming network requests http several related protocols primary function web server store process deliver web pages clients communication client server takes place using hypertext transfer protocol http pages delivered frequently html documents may include images style sheets scripts addition text content user agent commonly web browser web crawler initiates communication making request specific resource using http server responds content resource error message unable resource typically real file server secondary storage necessarily case depends web server implemented primary function serve content full implementation http also includes ways receiving content clients feature used submitting web forms including uploading files many generic web servers also support server-side scripting using active server pages asp php hypertext preprocessor scripting languages means behaviour web server scripted separate files actual server software remains unchanged usually function used generate html documents dynamically on-the-fly opposed returning static documents former primarily used retrieving modifying information databases latter typically much faster easily cached deliver dynamic content web servers also frequently found embedded devices printers routers webcams serving local network web server may used part system monitoring administering device question usually means additional software installed client computer since web browser required included operating systems http cookie also called web cookie internet cookie browser cookie simply cookie small piece data sent website stored user computer user web browser user browsing cookies designed reliable mechanism websites remember stateful information items added shopping cart online store record user browsing activity including clicking particular buttons logging recording pages visited past also used remember arbitrary pieces information user previously entered form fields names addresses passwords credit card numbers cookies perform essential functions modern web perhaps importantly authentication cookies common method used web servers know whether user logged account logged without mechanism site would know whether send page containing sensitive information require user authenticate logging security authentication cookie generally depends security issuing website user web browser whether cookie data encrypted security vulnerabilities may allow cookie data read hacker used gain access user data used gain access user credentials website cookie belongs see cross-site scripting cross-site request forgery examples tracking cookies especially third-party tracking cookies commonly used ways compile long-term records individuals browsing histories potential privacy concern prompted european u.s. lawmakers take action 2011 european law requires websites targeting european union member states gain informed consent users storing non-essential cookies device google project zero researcher jann horn describes ways cookies read intermediaries like wi-fi hotspot providers recommends use browser incognito mode circumstances web search engine internet search engine software system designed carry web search internet search means search world wide web systematic way particular information specified web search query search results generally presented line results often referred search engine results pages serps information may mix web pages images videos infographics articles research papers types files search engines also mine data available databases open directories unlike web directories maintained human editors search engines also maintain real-time information running algorithm web crawler internet content capable searched web search engine generally described deep web deep web invisible web hidden web parts world wide web whose contents indexed standard web search engines opposite term deep web surface web accessible anyone using internet computer scientist michael k. bergman credited coining term deep web 2001 search indexing term content deep web hidden behind http forms includes many common uses web mail online banking services users must pay protected paywall video demand online magazines newspapers among others content deep web located accessed direct url ip address may require password security access past public website page web cache server computer located either public internet within enterprise stores recently accessed web pages improve response time users content requested within certain time original request web browsers also implement browser cache writing recently obtained data local data storage device http requests browser may ask data changed since last access web pages resources may contain expiration information control caching secure sensitive data online banking facilitate frequently updated sites news media even sites highly dynamic content may permit basic resources refreshed occasionally web site designers find worthwhile collate resources css data javascript site-wide files cached efficiently enterprise firewalls often cache web resources requested one user benefit many users search engines store cached content frequently accessed websites criminals web become venue spread malware engage range cybercrimes including identity theft fraud espionage intelligence gathering web-based vulnerabilities outnumber traditional computer security concerns measured google one ten web pages may contain malicious code web-based attacks take place legitimate websites measured sophos hosted united states china russia common malware threats sql injection attacks websites html uris web vulnerable attacks like cross-site scripting xss came introduction javascript exacerbated degree web 2.0 ajax web design favours use scripts today one estimate 70 websites open xss attacks users phishing another common threat web february 2013 rsa security division emc estimated global losses phishing 1.5 billion 2012 two well-known phishing methods covert redirect open redirect proposed solutions vary large security companies like mcafee already design governance compliance suites meet post-9/11 regulations like finjan recommended active real-time inspection programming code content regardless source argued enterprises see web security business opportunity rather cost centre others call ubiquitous always-on digital rights management enforced infrastructure replace hundreds companies secure data networks jonathan zittrain said users sharing responsibility computing safety far preferable locking internet every time client requests web page server identify request ip address usually logs also unless set web browsers record requested web pages viewable history feature usually cache much content locally unless server-browser communication uses https encryption web requests responses travel plain text across internet viewed recorded cached intermediate systems another way hide personally identifiable information using vpn vpn encrypts online traffic masks original ip address lowering chance user identification web page asks user supplies personally identifiable information\u2014such real name address e-mail address etc.\u2014web-based entities associate current web traffic individual website uses http cookies username password authentication tracking techniques relate web visits identifiable information provided way possible web-based organisation develop build profile individual people use site sites may able build record individual includes information leisure activities shopping interests profession aspects demographic profile profiles obviously potential interest marketeers advertisers others depending website terms conditions local laws apply information profiles may sold shared passed organisations without user informed many ordinary people means little unexpected e-mails in-box uncannily relevant advertising future web page others mean time spent indulging unusual interest result deluge targeted marketing may unwelcome law enforcement counter terrorism espionage agencies also identify target track individuals based interests proclivities web social networking sites try get users use real names interests locations rather pseudonyms executives believe makes social networking experience engaging users hand uploaded photographs unguarded statements identified individual may regret exposure employers schools parents relatives may influenced aspects social networking profiles text posts digital photos posting individual intend audiences on-line bullies may make use personal information harass stalk users modern social networking websites allow fine grained control privacy settings individual posting complex easy find use especially beginners photographs videos posted onto websites caused particular problems add person face on-line profile modern potential facial recognition technology may possible relate face previously anonymous images events scenarios imaged elsewhere due image caching mirroring copying difficult remove image world wide web web standards include many interdependent standards specifications govern aspects internet world wide web even web-focused standards directly indirectly affect development administration web sites web services considerations include interoperability accessibility usability web pages web sites web standards broader sense consist following web standards fixed sets rules constantly evolving set finalized technical specifications web technologies web standards developed standards organizations\u2014groups interested often competing parties chartered task standardization\u2014not technologies developed declared standard single individual company crucial distinguish specifications development ones already reached final development status case w3c specifications highest maturity level methods accessing web alternative mediums formats facilitate use individuals disabilities disabilities may visual auditory physical speech-related cognitive neurological combination accessibility features also help people temporary disabilities like broken arm ageing users abilities change web receives information well providing information interacting society world wide web consortium claims essential web accessible provide equal access equal opportunity people disabilities tim berners-lee noted power web universality access everyone regardless disability essential aspect many countries regulate web accessibility requirement websites international co-operation w3c web accessibility initiative led simple guidelines web content authors well software developers use make web accessible persons may may using assistive technology w3c internationalisation activity assures web technology works languages scripts cultures beginning 2004 2005 unicode gained ground eventually december 2007 surpassed ascii western european web frequently used character encoding originally allowed resources identified uri subset us-ascii allows characters\u2014any character universal character set\u2014and resource identified iri language", + "neighbors": [ + 12, + 16, + 64, + 77, + 83, + 101, + 103, + 107, + 120, + 123, + 144, + 162, + 166, + 182, + 211, + 227, + 257, + 258, + 277, + 282, + 304, + 320, + 330, + 345, + 346, + 365, + 372, + 379, + 384, + 425, + 429, + 436, + 442, + 444, + 452, + 491, + 503, + 505, + 509, + 528, + 530, + 547, + 549, + 553, + 576, + 582, + 596, + 623, + 627, + 646, + 668, + 678, + 684, + 692, + 701, + 703, + 713, + 771, + 796, + 800, + 834, + 844, + 852, + 878, + 886, + 939, + 959, + 1026, + 1058, + 1084, + 1096, + 1132, + 1138, + 1145, + 1159, + 1166, + 1195, + 1200, + 1210, + 1227, + 1228, + 1235, + 1246, + 1258, + 1264, + 1269, + 1280, + 1291, + 1309, + 1324, + 1372, + 1376, + 1395, + 1398, + 1403, + 1413, + 1416, + 1417, + 1423, + 1433, + 1465, + 1472, + 1528, + 1534, + 1549, + 1550, + 1552, + 1596, + 1615, + 1621, + 1635, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 15, + "label": 3, + "text": "Seikima_II_Akuma_no_Gyakush\u016b!:seikima ii akuma gyakush\u016b 1987 game re-released msx2 title detailed sprites backgrounds also featured actual seikima-ii music game based then-popular japanese heavy metal band formed damian hamada called seikima-ii band lasted creation 1982 dissolution december 31 1999 history prophesied group demons preaching religion order propagate satan use heavy metal member demon different hierarchical class excellency demon kogure leader demons majesty damian hamada crown prince hell accordance prophecy completing world conquest band would disband end century december 12 1999 23:59:59 japan standard time 09:59:99 eastern standard time", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 16, + "label": 8, + "text": "World_Wide_Web_Consortium:world wide web consortium world wide web consortium w3c main international standards organization world wide web abbreviated www w3 founded currently led tim berners-lee consortium made member organizations maintain full-time staff purpose working together development standards world wide web world wide web consortium w3c 444 members w3c also engages education outreach develops software serves open forum discussion web world wide web consortium w3c founded tim berners-lee left european organization nuclear research cern october 1994 founded massachusetts institute technology laboratory computer science mit/lcs support european commission defense advanced research projects agency darpa pioneered arpanet one predecessors internet located technology square 2004 moved csail stata center organization tries foster compatibility agreement among industry members adoption new standards defined w3c incompatible versions html offered different vendors causing inconsistency web pages displayed consortium tries get vendors implement set core principles components chosen consortium originally intended cern host european branch w3c however cern wished focus particle physics information technology april 1995 french institute research computer science automation inria became european host w3c keio university research institute sfc kris becoming asian host september 1996 starting 1997 w3c created regional offices around world september 2009 eighteen world offices covering australia benelux countries netherlands luxembourg belgium brazil china finland germany austria greece hong kong hungary india israel italy south korea morocco south africa spain sweden 2016 united kingdom ireland october 2012 w3c convened community major web players publishers establish mediawiki wiki seeks document open web standards called webplatform webplatform docs january 2013 beihang university became chinese host sometimes specification becomes large split independent modules mature pace subsequent editions module specification known levels denoted first integer title e.g css3 level 3 subsequent revisions level denoted integer following decimal point e.g css2.1 revision 1 w3c standard formation process defined within w3c process document outlining four maturity levels new standard recommendation must progress enough content gathered 'editor drafts discussion may published working draft wd review community wd document first form standard publicly available commentary virtually anyone accepted though promises made regard action particular element commented upon stage standard document may significant differences final form anyone implements wd standards ready significantly modify implementations standard matures candidate recommendation version standard mature wd point group responsible standard satisfied standard meets goal purpose cr elicit aid development community implementable standard standard document may change point significant features mostly decided design features still change due feedback implementors proposed recommendation version standard passed prior two levels users standard provide input stage document submitted w3c advisory council final approval step important rarely causes significant changes standard passes next phase mature stage development point standard undergone extensive review testing theoretical practical conditions standard endorsed w3c indicating readiness deployment public encouraging widespread support among implementors authors recommendations sometimes implemented incorrectly partially many standards define two levels conformance developers must follow wish label product w3c-compliant recommendation may updated extended separately-published non-technical errata editor drafts sufficient substantial edits accumulate producing new edition level recommendation additionally w3c publishes various kinds informative notes used references unlike isoc international standards bodies w3c certification program w3c decided suitable start program owing risk creating drawbacks community benefits consortium jointly administered mit computer science artificial intelligence laboratory csail located stata center united states european research consortium informatics mathematics ercim sophia antipolis france keio university japan beihang university china w3c also world offices eighteen regions around world w3c offices work regional web communities promote w3c technologies local languages broaden w3c geographical base encourage international participation w3c activities w3c staff team 70\u201380 worldwide w3c run management team allocates resources designs strategy led ceo jeffrey jaffe march 2010 former cto novell also includes advisory board supports strategy legal matters helps resolve conflicts majority standardization work done external experts w3c various working groups consortium governed membership list members available public members include businesses nonprofit organizations universities governmental entities individuals membership requirements transparent except one requirement application membership must reviewed approved w3c many guidelines requirements stated detail final guideline process standards membership might finally approved denied cost membership given sliding scale depending character organization applying country located countries categorized world bank recent grouping gni gross national income per capita 2012 2013 w3c started considering adding drm-specific encrypted media extensions eme html5 criticised openness interoperability vendor neutrality distinguished websites built using w3c standards requiring proprietary plug-ins like flash september 18 2017 w3c published eme specification recommendation leading electronic frontier foundation resignation w3c w3c/ietf standards internet protocol suite", + "neighbors": [ + 14, + 16, + 402, + 436, + 509, + 623, + 680, + 684, + 779, + 939, + 1100, + 1106, + 1132, + 1235, + 1280, + 1416, + 1417, + 1465, + 1470, + 1528, + 1550, + 1635 + ], + "mask": "Test" + }, + { + "node_id": 17, + "label": 4, + "text": "Trend_Micro:trend micro founder eva chen serves trend micro chief executive officer position held since 2005 succeeded founding ceo steve chang serves chairman company founded 1988 los angeles steve chang \u5f35\u660e\u6b63 chang ming-cheng wife jenny chang sister eva chen \u9673\u6021\u6a3a company established proceeds steve chang previous sale copy protection dongle united states-based rainbow technologies shortly establishing company founders moved headquarters taipei 1992 trend micro took japanese software firm form trend micro devices established headquarters japan made agreement cpu maker intel produced anti-virus product local area networks lans sale intel brand intel paid royalties trend micro sales landesk virus protect united states europe trend paid royalties intel sales asia 1993 novell began bundling product network operating system 1996 two companies agreed two-year continuation agreement trend allowed globally market serverprotect product brand alongside intel landesk brand trend micro listed tokyo stock exchange 1998 ticker 4704 company began trading united states-based nasdaq stock exchange july 1999 2004 founding chief executive officer steve chang decided split responsibilities ceo chairman company company co-founder eva chen succeeded steve chang chief executive officer trend micro january 2005 chen recently served company chief technology officer since 1996 executive vice president since company founding october 1989 steve chang retained position company chairman may trend micro acquired braintree massachusetts-based antispyware company intermute 15 million trend micro fully integrated intermute spysubtract antispyware program antispyware product offerings end year june 2005 trend micro acquired kelkea san jose california-based developer antispam software kelkea developed mail abuse prevention system maps ip filtering software allowed internet service providers block spam phishing scams kelkea chief executive officer dave rand retained trend micro chief technologist content security march 2007 trend micro acquired freeware antispyware program hijackthis creator merijn bellekom undisclosed sum trend micro delisted depository shares nasdaq stock exchange may later year october trend micro acquired mountain view california-based data loss prevention software developer provilla provilla creator leakproof software allowed companies block transmission sensitive data warn security managers transmission attempts trend micro acquired identum february 2008 undisclosed sum identum founded later spun-off university bristol cryptography department developed id-based email encryption software identum chairman serial entrepreneur steve purdham two companies originally talks trend micro license identum technology trend micro later decided purchase firm outright identum renamed trend micro bristol encryption technology integrated existing trend micro products existing identum products continued sold trend micro brand also year trend micro sued barracuda networks latter distribution clamav part security package trend micro claimed barracuda use clamav infringed software patent owned trend micro filtering viruses internet gateway 19 may 2011 u.s. patent trademark office issued final rejection reexamination trend micro u.s. patent 5,623,600 april 2009 trend micro acquired ottawa ontario canada-based third brigade undisclosed sum third brigade developed host-based intrusion prevention firewall software used trend micro trend officescan anti-malware suite two years prior acquiring third brigade third brigade reincorporated trend micro canada technologies trend micro acquired leeds england based humyo june 2010 undisclosed sum humyo provided cloud-based data storage synchronization services small businesses individuals later year november trend micro acquired mobile armor mobile armor developer full disk file folder removable media encryption mobile devices trend micro integrated company technology centrally-managed platform mobile device security june 2012 trend micro acquired marlborough massachusetts-based secure sockets layer ssl certificate provider affirmtrust undisclosed sum trend micro followed another acquisition taiwanese advanced network-security firm broadweb october 2012 broadweb developer deep packet inspection technology ability block malicious data packets real-time technology integrated trend micro custom defense solution suite designed provide network-wide visibility protection advanced attacks threats trend micro relocated us headquarters las colinas area irving texas september 2013 relocation allowed company consolidate operations previously housed cupertino california arlington texas september 2014 trend micro began partnership interpol wherein trend micro shared international police organization information cybercrime threats via company threat intelligence service according interpol information helped international police organization 190 member countries decrease cybercrime global scale trend micro also provided cybercrime investigation training program interpol also 2014 trend micro expanded cloud app security protect microsoft office 365 threats caught native microsoft security 2016 cloud app security software expanded cover box dropbox google drive october 2015 trend micro reached agreement buy tippingpoint network software security developer hp inc. 300 million included bug bounty program zero day initiative incorporated trend micro research \u2019 focus existing threats vulnerabilities future potential security issues year trend micro certified vce validation ready solution vblock ready vce technology alliance partner program later trend micro joined vce select program allowed trend micro deep security bundled vce converged hyper-converged infrastructure systems gartner named trend micro leaders ranking magic quadrant rating endpoint protection platforms 2015 2016 2017 2016 trend micro discovered variant virus affecting android phones able infect smart tvs trend announced launch 100 million venture capital investment fund june 2017 focused next generation technology including internet things iot september 2017 trend micro awarded reimbursement u.s. district court portion legal fees incurred rejected patent claims filed intellectual ventures company subsequently launched trend forward capital venture initial investments included business-to-business payment company veem wearable device company muse telemetry company mojio brain health technology company interaxon november 2017 trend micro acquired immunio adding new capabilities hybrid cloud security fit neatly devops life cycle immunio introduced early detection protection application vulnerabilities container image scanning allowing publishing protection secure container images december 2017 trend partnered telco systems develop virtual network cybersecurity platform combining trend virtual network function suite telco nfvtime software april 2018 trend micro joined cybersecurity tech accord public agreement companies defend customers malicious attacks cybercriminal gangs nation states august 2018 researchers discovered several trend micro consumer products macos capturing browser history data including passwords sending remote server initial analysis designed enhance security products identified dr. cleaner dr. cleaner pro dr. antivirus dr. unarchiver dr battery duplicate finder open file consequence apple removed trend micro products mac app store trend micro admitted products captured uploaded data also apologized community concern might felt went excuse activity humbly result use common code libraries event appropriation users data explicitly disclosed applicable eulas august 2018 trend micro announced fourth annual capture flag ctf competition invites teams around world demonstrate skills challenge knowledge today \u2019 critical areas cybersecurity protection september 2018 trend micro hitrust announced partnership launch new center provides advanced cyber risk management november 2018 trend micro moxa inc. announced formation joint-venture corporation\u2014txone networks\u2014which focus security needs present industrial internet things iot environments june 2008 trend micro introduced trend micro smart protection network cloud-client content security infrastructure delivers global threat intelligence protect customers online threats data stealing malware phishing attacks web email mobile threats 2012 trend micro added big data analytics smart protection network big data analytics allow network use behavioral-based identification methods identify new security threats network also combines in-the-cloud technologies client-based antivirus technologies reduce dependency conventional pattern file downloads endpoint threat information trend micro smart protection network deployed real time company security software portfolio trend micro report eu general data protection regulation showed increase extortion attempts organizations try comply eu privacy laws trend micro receives threat intelligence trendlabs company research development support center trendlabs ten labs worldwide headquartered philippines employs 1,200 security experts engineers company singapore-based lab provides malware forensics analysis february 2018 trend micro partnered panasonic build secure systems electronic control units automated cars april 2018 company released tool helps identify individual writing styles combat email fraud", + "neighbors": [ + 94, + 120, + 257, + 293, + 297, + 476, + 487, + 522, + 585, + 611, + 708, + 717, + 842, + 910, + 938, + 944, + 965, + 1019, + 1038, + 1101, + 1196, + 1239, + 1291, + 1350, + 1358, + 1406, + 1433, + 1444, + 1514, + 1542 + ], + "mask": "Validation" + }, + { + "node_id": 18, + "label": 9, + "text": "Cypher_(Query_Language):cypher query language cypher declarative graph query language allows expressive efficient querying updating property graph cypher largely invention andr\u00e9s taylor working neo4j inc. formerly neo technology 2011 cypher originally intended used graph database neo4j opened opencypher project october 2015 cypher based property graph model addition standard graph elements nodes edges called relationships cypher adds labels properties concepts nodes may zero labels relationship exactly one relationship type nodes relationships also zero properties property key-value binding string key value cypher type system cypher type system includes nodes relationships paths maps lists integers floating-point numbers booleans strings cypher contains variety clauses among common match functions slightly different sql match used describing structure pattern searched primarily based relationships used add additional constraints patterns example query return movies actor named 'nicole kidman acted produced certain year sent parameter cypher additionally contains clauses writing updating deleting data create delete used create delete nodes relationships set remove used set values properties add labels nodes nodes deleted relationships still existing example opencypher project effort started standardize cypher query language graph processing one part process first opencypher implementers meeting ocim first announced december 2016", + "neighbors": [ + 18, + 154, + 874 + ], + "mask": "Train" + }, + { + "node_id": 19, + "label": 9, + "text": "Foreach_loop:foreach loop foreach control flow statement traversing items collection class|collection foreach usually used place standard loop|for statement programming |statement unlike loop constructs however foreach loops usually maintain explicit counter essentially say everything set rather x times avoids potential off-by-one error makes code simpler read object-oriented languages iterator even implicit often used means traversal foreach statement languages defined order processing item collection first last foreach statement many languages especially array programming languages particular order simplifies loop optimization general particular allows vector processing items collection concurrently syntax varies among languages use simple word codice_1 roughly follows programming language support foreach loops include abc programming language |abc actionscript ada programming language |ada c++11 c sharp programming language |c coldfusion markup language cfml cobra programming language |cobra programming language |d daplex query language ecmascript erlang programming language |erlang java programming language |java since 1.5 using reserved word codice_1 loop foreach loop javascript lua programming language |lua objective-c since 2.0 parasail programming language |parasail perl php python programming language |python realbasic ruby programming language |ruby scala programming language |scala smalltalk swift programming language |swift tcl tcsh unix shell visual basic .net windows powershell notable languages without foreach c programming language |c c++ pre-c++11 ada programming language |ada supports foreach loops part normal loop say x array data structure|array syntax used mostly arrays also work types full iteration needed ada 2012 generalized loops foreach loops kind container array lists maps ... language c programming language |c collections foreach construct however several standard data structures used collections foreach made easily c macro|macro however two obvious problems occur c string collection char c int array collection int array size known compile-time general string array collection collection size known run-time c sharp programming language |c assuming myarray array integers language integrated query linq provides following syntax accepting delegate cli |delegate lambda programming |lambda expression c++11 provides foreach loop syntax similar foreach loop java|java c++11 range-based statements implemented gnu compiler collection gcc since version 4.6 clang since version 3.0 visual c++ 2012 version 11 range-based syntactic sugar equivalent compiler uses argument-dependent lookup resolve begin end functions c++ standard library also supports for_each applies element function predefined function lambda expression range-based beginning end range direction change direction range altering first two parameters qt software |qt c++ framework offers macro providing foreach loops using stl iterator interface boost c++ libraries |boost set free peer-reviewed portable c++ libraries also provides foreach loops c++/cli language proposes construct similar c assuming myarray array integers cfml incorrectly identifies value index construct codice_4 variable receive actual value array element index common lisp provides foreach ability either dolist macro powerful loop macro iterate data types even mapcar function foreach support added delphi programming language |delphi 2005 uses enumerator variable must declared var section iteration foreach form eiffel programming language |eiffel loop construct introduced keyword codice_5 example every element structure codice_6 printed local entity codice_7 instance library class codice_8 cursor feature codice_9 provides access structure element descendants class codice_8 created handle specialized iteration algorithms types objects iterated across codice_6 example based classes inherit library class codice_12 iteration form eiffel loop also used boolean expression keyword codice_13 replaced either codice_14 effecting universal quantification codice_15 effecting existential quantification iteration boolean expression true items codice_6 counts greater three following true least one item count greater three go programming language |go foreach loop used loop array slice string map channel using two-value form get index/key first element value second element using one-value form get index/key first element groovy programming language |groovy supports loops collections like arrays lists ranges groovy also supports c-style loop array index collections groovy also iterated using keyword closure default loop dummy named haskell programming language |haskell allows looping lists monad functional programming |monadic actions using codice_17 codice_18 codice_17 arguments flipped control.monad also possible generalize functions work applicative functors rather monads data structure traversable using codice_20 codice_1 arguments flipped codice_22 codice_23 arguments flipped data.traversable java programming language |java foreach-construct introduced java development kit jdk 1.5.0 official sources use several names construct referred enhanced loop for-each loop foreach statement ecmascript 6 standard codice_24 index-less iteration generators arrays alternatively function-based style unordered iteration keys object javascript features codice_25 loop limit iteration object properties excluding inherited prototype chain sometimes useful add hasownproperty test comparison layout engines ecmascript object object|if supported javascript engine webkit/safari means version 3 later ecmascript 5 provided object.keys method transfer keys object array iterate numerical index values index value ipairs array end iterate index values index value pairs array end mathematica codice_26 simply evaluate expression element list without returning value common use codice_27 returns result evaluation new list loops supported mint possessing following syntax codice_28 codice_29 infinite loop mint written using loop infinite set|infinitely long list foreach loops called objective-c fast enumeration|fast enumeration supported starting objective-c 2.0 used iterate object implements nsfastenumeration protocol including nsarray nsdictionary iterates keys nsset etc nsarrays also broadcast message members blocks c language extension |blocks available nsarray automatically perform block every contained item type collection iterated dictate item returned iteration example ocaml functional language thus equivalent foreach loop achieved library function lists arrays lists short way arrays short way parasail programming language |parasail parallel programming language supports several kinds iterators including general iterator container parasail also supports filters iterators ability refer key value map forward iteration elements my_map selecting elements keys my_set pascal programming language |pascal iso standard 10206:1990 introduced iteration pascal programming language set types|set types thus perl foreach equivalent shorter used traverse elements list expression denotes collection loop evaluated list-context item resulting list turn aliased loop variable list literal example array examples hash example direct modification collection members perl 6 distinct language perl 5 must used traverse elements list foreach longer allowed expression denotes collection loop evaluated list-context flattened default item resulting list turn aliased loop variable list literal example array examples loop statement modifier form hash example direct modification collection members doubly pointy block also possible extract keys values using alternate syntax direct modification collection members python tuple assignment fully available foreach loop also makes trivial iterate key value pairs associative array codice_30 kind loop python equivalent counter loop found languages ... ... though using codice_31 function considered pythonic using conventional scheme codice_32 function codice_33 one-argument function also used hash codice_33 one-argument function swift programming language |swift uses codice_1\u2026codice_36 construct iterate members collection codice_1\u2026codice_36 loop often used closed half-open range constructs iterate loop body certain number times systemverilog supports iteration vector array type dimensionality using codice_39 keyword trivial example iterates array integers complex example iterates associative array arrays integers tcl uses foreach iterate lists possible specify one iterator variable case assigned sequential values list also possible iterate one list simultaneously following codice_40 assumes sequential values first list codice_41 sequential values second list without type inference invoke hypothetical codice_42 command three times giving color name time pipeline category articles example ada code category articles example perl code category articles example php code category articles example python code category articles example racket code category articles example smalltalk code category articles example tcl code category control flow category programming language comparisons category articles example java code category articles example haskell code ru \u0446\u0438\u043a\u043b \u043f\u0440\u043e\u0441\u043c\u043e\u0442\u0440\u0430", + "neighbors": [ + 19, + 65, + 117, + 152, + 176, + 216, + 306, + 308, + 392, + 509, + 538, + 567, + 594, + 597, + 682, + 742, + 790, + 1028, + 1221, + 1225, + 1227, + 1235, + 1264, + 1311, + 1430, + 1508 + ], + "mask": "Test" + }, + { + "node_id": 20, + "label": 1, + "text": "International_Road_Traffic_and_Accident_Database:international road traffic accident database international road traffic accident database irtad data collection maintained organisation economic co-operation development oecd international transport forum itf paris covering safety data countries within outside europe database started 1988 federal institution roads bast bergisch gladbach germany response demands international comparative data grown important resource comparing road safety metrics various developed countries present 37 countries included argentina australia austria belgium cambodia canada chile colombia czech republic denmark finland france germany greece hungary iceland ireland israel italy japan korea south korea lithuania luxembourg malaysia netherlands new zealand nigeria norway poland portugal serbia slovenia spain sweden switzerland united kingdom united states following statistics available general use", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 21, + "label": 2, + "text": "Nokia_N92:nokia n92 nokia n92 smartphone part multimedia nseries announced november 2 2005 world first mobile phone integrated dvb-h tuner excluding experimental 7710 result nokia marketed phone watching tv go featured swivel design n90 runs symbian os v9.1 s60 3rd edition interface interesting features handset dvb-h receiver include program guide recording facility phone constant 30 second rolling record function instant replay record broadcasts memory card providers may charge features elsewhere n92 also advanced featuring large 2.8 display largest time excluding communicators dedicated multimedia keys 3g wi-fi upnp 2 megapixel camera flash cpu runs clock speed 268 mhz however considerably heavy 191 g despite size upon release q2 2006 retailed 600 euros n92 one rarest devices nokia go high prices second hand market keypad unusual numbers viewable portrait landscape modes accommodate screen opened two different positions unusual keypad users refer confusing", + "neighbors": [ + 3, + 162, + 238, + 253, + 264, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 22, + "label": 2, + "text": "DR-DOS:dr-dos dr-dos dr dos without hyphen including version 6.0 operating system dos family written ibm pc-compatible personal computers originally developed gary a. kildall digital research derived concurrent pc dos 6.0 advanced successor cp/m-86 ownership changed various later versions produced names including novell dos caldera opendos digital research original cp/m 8-bit intel 8080- z-80-based systems spawned numerous spin-off versions notably cp/m-86 intel 8086/8088 family processors although cp/m dominated market shipped vast majority non-proprietary-architecture personal computers ibm pc 1981 brought beginning eventually massive change ibm originally approached digital research seeking x86 version cp/m however disagreements contract ibm withdrew instead deal struck microsoft purchased another operating system 86-dos seattle computer products scp became microsoft ms-dos ibm pc dos 86-dos command structure application programming interface imitated cp/m digital research threatened legal action claiming pc dos/ms-dos similar cp/m ibm settled agreeing sell digital research x86 version cp/m cp/m-86 alongside pc dos however pc dos sold cp/m-86 price tag proportion pc buyers prepared spend six times much buy cp/m-86 small availability compatible application software first decisively digital research favor temporary digital research fought long losing battle promote cp/m-86 multi-tasking multi-user successors mp/m-86 concurrent cp/m-86 eventually decided could beat microsoft-ibm lead application software availability modified concurrent cp/m-86 allow run applications ms-dos pc dos shown publicly december 1983 shipped march 1984 concurrent dos 3.1 a.k.a cdos bdos 3.1 hardware vendors concurrent dos continued evolve various flavours years eventually become multiuser dos real/32 specifically tailored desktop market expensive single-user applications therefore time two attempts made sideline product 1985 digital research developed dos plus 1.0 2.1 stripped-down modified single-user derivative concurrent dos 4.1 5.0 ran applications platforms allowed switching several tasks original cp/m-86 dos compatibility limited digital research made another attempt time native dos system new disk operating system launched 1988 dr dos although dri based pacific grove later monterey california usa work dos plus started newbury berkshire uk digital research europe oem support group located since 1983 since 1986 operating system work concurrent dos 386 xm multiuser dos dr dos palmdos done digital research european development centre edc hungerford berkshire uk later work also done digital research gmbh m\u00fcnchen germany requested several oems digital research started plan develop new dos operating system addressing shortcomings left ms-dos 1987 particular importance million dollar deal kazuhiko kay nishi ascii corporation previously instrumental opening japanese oem market microsoft first dr dos version released 28 may 1988 version numbers chosen reflect features relative ms-dos first version promoted public dr dos 3.31 offered features comparable compaq ms-dos 3.31 large disk support fat16b a.k.a bigdos dr dos 3.31 reported ibm pc dos 3.31 internal bdos basic disk operating system kernel version reported 6.0 single-user nature reflecting origin derivative concurrent dos 6.0 multitasking multiuser capabilities well cp/m api support stripped xios replaced ibm-compatible dos-bios system files named drbios.sys dos-bios drbdos.sys bdos kernel disk oem label used digital\u2420 dr dos offered extended command line tools command line help verbose error messages sophisticated command line history editing history directive well support file directory passwords built right kernel also cheaper license ms-dos romable right start romed version dr dos also named ros rom operating system dri approached number pc manufacturers interested third-party dos prompted several updates system time ms-dos available oems bundled hardware consequently dr dos achieved immediate success became possible consumers buy normal retail channels since 3.4x known versions dr dos 3.31 bdos 6.0 june 1988 oem 3.32 bdos 6.0 17 august 1988 oem 3.33 bdos 6.0 1 september 1988 oem 3.34 bdos 6.0 oem 3.35 bdos 6.0 21 october 1988 oem 3.40 bdos 6.0 25 january 1989 3.41 bdos 6.3 june 1989 oem retail like ms-dos produced several variants different hardware oems kept dr dos name designation one oem version known called ez-dos 3.41 dr dos version 5.0 code-named leopard released may 1990 still reporting pc dos 3.31 compatibility purposes internally indicating single-user bdos 6.4 kernel version 4 skipped avoid associated relatively unpopular ms-dos 4.0 introduced viewmax gem-based gui file management shell viewmax startup screen would present slogan digital research make computers work dr dos 5.0 also introduced patented batterymax power management system bundled disk-caching software drcache remote file transfer tool filelink cursor shape configuration utility cursor offered vastly improved memory management system memorymax compatibility purposes dr dos 5.0 system files named ibmbio.com dos-bios ibmdos.com bdos kernel due advanced loader boot sector could physically stored anywhere disk oem label boot sectors changed ibm\u2420\u24203.3 dr dos 5.0 first dos include load-high capabilities kernel data structures disk buffers could relocated high memory area hma first 64 kb extended memory accessible real mode freed equivalent amount critical base conventional memory first 640 kb pc ram \u2013 area dos applications run additionally intel 80386 machines dr dos ems memory manager allowed operating system load dos device drivers upper memory blocks freeing base memory dr dos 5.0 first dos integrate functionality base os loading device drivers upper memory blocks already possible using third-party software like qemm allowed 286 systems supported chipsets 386 systems provide significantly free conventional memory dos drivers mouse multimedia hardware network stack loaded ms-dos/pc dos machine typically might 300 400 kb free conventional memory \u2013 little run much late-1980s software contrast dr dos 5.0 little manual tweaking could load still keep conventional memory free \u2013 allowing necessary dos data structures much 620 kb 640 kb memmax +v conventional memory region could even extended unused portions graphics adapter card typically providing another 64 96 kb free dos memory dr dos left much conventional memory available old programs utilizing certain address wrapping techniques failed run properly loaded unexpectedly ms-dos impossibly low memory \u2013 inside first 64 kb segment known low memory therefore dr dos 5.0 new memmax -l command worked around pre-allocating chunk memory start memory map order programs load barrier less usable conventional memory default memmax configured +l applications could take advantage extra memory faced substantial competition dos arena microsoft responded announcement yet-to-be released ms-dos 5.0 may 1990 would released june 1991 include similar advanced features dr dos included matches dr enhancements memory management almost immediately september 1991 digital research responded dr dos 6.0 code-named buxton dr dos 6.0 already bdos level 6.7 internally would still report ibm pc dos 3.31 normal dos applications compatibility purposes bundled superstor on-the-fly disk compression maximize available hard disk space file deletion tracking undelete functionality roger gross dr dos 6.0 also included task-switcher named taskmax support industry-standard task-switching api run multiple applications time contrast digital research multiuser dos successor concurrent dos multi-user products line would run dos applications pre-emptively multitasked virtual dos machines dr dos 6.0 task switcher would freeze background applications brought back foreground ran x86-machines able swap xms memory 286+ machines taskmax support copy paste facility applications via task-switcher api graphical user interfaces viewmax pc/geos could register task manager menu thereby replace taskmax text mode menu users could switch tasks within gui microsoft responded ms-dos 6.0 matched features dr dos 6.0 since december 1991 pre-release version windows 3.1 designed return non-fatal error message detected non-microsoft dos check came known aard code detection code disabled windows ran perfectly dr dos successor novell dos code present disabled released version windows 3.1 july 1992 digital research japan released dr dos 6.0/v japanese dos/v compatible version dr dos 6.0 korean version appears available well simple matter digital research patch dr dos 6.0 circumvent aard 'authenticity check windows 3.1 beta rearranging order two internal tables memory changes functionality patched version named business update streets within six weeks release windows 3.1 1992 digital research still old name already bought novell july 1991 also embarked spin-off product code-named merlin later released netware palmdos 1 name implies resource-light dr dos 6.0 derivative aimed emerging palmtop/pda market palmdos first operating system family sport new bdos 7.0 kernel native dos compatible internal data structures instead emulations thereof replacing dos emulation top cp/m kernel true dos compatible kernel helped lot improving compatibility applications using dos internal data structures also key reducing resident size kernel code even particular requirement pda market hand introducing genuine current directory structure cds imposed limit depth working directories 66 characters ms-dos/pc dos whereas previous issues dr dos limitation due internal organization directories relative links parent directories instead absolute paths palmdos still reported pc dos 3.31 applications order keep kernel small run compatibility problems windows would expect dosmgr api implemented dos version since 5.0 well rom-executing kernel palmdos palmtop-type support features pcmcia pc cards dpms support power management batterymax idle device driver patented dynamic idle detection gross john p. constant minimax task switcher support pim personal information modules applications stored executed rom via xip execute-in-place etc pcmcia stack palmdos partially written ian h. s. cullimore novell dos novell corporation name dr dos period novell sold dr dos acquisition digital research 1991 regarding features performance typically least one release ahead ms-dos 1993 pc dos 6.1 ms-dos 6.2 pc dos 6.3 trumped novell novell ceo robert j. frankenberg strategy included major trimming selling products like transactional database btrieve killing others novell dos wordperfect multimedia main street children titles novell licensed technology stac electronics use novell dos network operating system netware novell sold product line caldera 23 july 1996 approached novell looking dos operating system bundle openlinux distribution novell dos described techrepublic john sheesley failure marc perkel claimed inspired novell february 1991 buy digital research develop something envisioned novos novell actually bought digital research july 1991 view using dr product line lever comprehensive strategy break microsoft monopoly part massive ultimately disastrous spending spree novell bought wordperfect corporation time borland products invested heavily unix well planned dr dos 7.0 internally named panther intended trump microsoft troubled ms-dos 6.0 repeatedly delayed novell working optionally loadable unix-like multi-user security extension loaded file commands like attrib backup delpurge move touch tree undelete xcopy xdel xdir supporting otherwise disabled /u name command line option select specific users groups compatible multiuser dos two new graphical user interfaces viewmax 3 derivative gem star trek true port apple system 7.1 run new dr dos multitasker named vladivar dr dos eventually arrived december 1993 localized versions released march 1994 renamed novell dos 7 a.k.a nwdos without three components disappointment larger lacked finishing touches germany novell dos 7 aggressively marketed slogan n't trust dos 7 press free demo floppies computer magazines campaign aimed 20 dos market resulted 1.5 million copies sold february 1994 3000 dealers interested carry product novell dos 7 available various oems dedicated mail order shop authorized dealers major functional addition novell second attempt peer-to-peer networking system personal netware pnw better predecessor netware lite nwl incompatible microsoft networking system growing popular support windows workgroups os/2 windows nt considerable amount manual configuration needed get co-exist pc personal netware never achieved much success since novell dos 7 implemented dosmgr api internal data structures updated bdos 7.2 kernel could report dos version 6.0 oem id ibm without risking compatibility problems windows tools would report pc dos 6.1 ibm pc dos 6.1 also reported dos 6.0 applications novell dos 7 introduced much advanced memory management including new support dpmi dos protected mode interface dpms dos protected mode services well flexible loadhigh options also introduced support true pre-emptive multitasking multiple dos applications virtual dos machines vdm component originally named multimax similar multiuser dos basis natively dos compatible environment similar windows 386 enhanced mode without gui default bundled taskmgr would behave similar former dr dos 6.0 taskmax however emm386 loaded option /multi emm386 would load natively 32-bit 386 protected mode operating system core providing api support pre-emptive multitasking multi-threading hardware virtualization domain management virtual dos machines api could used dr dos-aware applications taskmgr run later would use api instance current 16-bit dos system environment create virtual dos machines run applications instead using real mode task-switcher support multitasker compatible windows tasks started launching windows could seen tasks windows well novell dos 7 personal netware 1.0 also shipped netwars network-enabled 3d arcade game novell dos 7 personal netware required several bug-fix releases completely stable next development occurred beta versions microsoft chicago would later become windows 95 sight novell wound development novell dos 7 september 1994 stopped maintenance january 1996 15 updates caldera approached novell looking dos operating system bundle openlinux distribution novell sold product line caldera 23 july 1996 time little commercial value caldera-owned dr-dos competition ibm pc dos 6.3 microsoft moved make impossible use buy subsequent windows version windows 95 dos product claimed purely technical change later subject major lawsuit brought salt lake city caldera help canopy group microsoft lawyers tried repeatedly case dismissed without success immediately completion pre-trial deposition stage parties list evidence intend present out-of-court settlement 7 january 2000 undisclosed sum revealed november 2009 august 1996 us-based caldera inc. approached roger gross one original dr-dos engineers proposal restart dr-dos development make windows 95 run dr-dos would help court case following meeting september 1996 lindon utah gross ransom h. love bryan wayne sparks raymond john noorda gross hired tasked set new subsidiary uk 10 september 1996 caldera announced coming release opendos cod intent also release source code system caldera uk ltd. incorporated 20 september 1996 gross hired original developers operating system novell edc well new talents continue work operating system converted barn periphery andover hampshire uk nearby former digital research novell edc besides improvements enhancements system string new key features added subsequently course next two years including tcp/ip stack derived lan workplace dos netware mobile graphical 32-bit dos protected mode html 3.2 web-browser dr-webspyder originally based source code arachne web browser michal pol\u00e1k lan modem dialup posix pthreads extension multi-tasker andy t. wightman long filename longname support edward n. hill jr. well lba fat32 support drfat32 matthias r. paul gross also hired andrew schulman geoff chappell instrumental identifying aard code 1992 work consultant andover assist paul work winglue secret project create version dr-dos compatible windows 95 98 98 se replace ms-dos 7.xx component demonstrated cebit march 1998 later small team developed winbolt versions dr-dos remained unreleased played important role court case caldera uk officially released caldera opendos 7.01 3 february 1997 version novell dos 7 update 10 december 1994 compiled necessary adaptations incorporate new name display messages well environment variable file names missing year worth patches developed novell dos updates 11 january 1995 15.2 january 1996 due parts novell dos sources lost novell meanwhile consequently version still reported internal bdos version 7.2 identical novell dos 7 new suite also lacked setfifo command added one novell dos updates well fifth generation search destroy virus scanner fastback plus 2.0 utility previously came bundled novell dos instead came bundled newer version pnunpack brought much advanced version netwars parts opendos 7.01 released open source form m.r.s kit machine readable sources may 1997 license terms mostly incompatible existing open-source licenses source closed gross felt would undermine commercial aspirations system beta releases september november 1997 next official release came december 1997 name changed caldera dr-opendos 7.02 soon followed release march 1998 dr-dos name returned caldera dr-dos 7.02 first time written hyphen version 7.02 reporting bdos 7.3 incorporated improved bios bdos issues developed paul adding many new boot configuration options integrating many compatibility enhancements bug-fixes optimizations size speed re-implementing fixes missing novell dos updates bios improved coexistence dr-dos windows 9x support third-party disk compression drivers microsoft drivespace introduced diagnostics mode activated scroll lock integrated debugger support debug=on debugger loaded within config.sys flexible config.sys tracing capabilities via /// hotkeys trace timeout commands thereby also improving integration alternative command line shells 4dos together loader sys /dr ext chain directive brought enhanced multi-configuration support dr/d/config.ext files came enhancements basic-like config.sys language powerful boot menus convenient user interaction programmatical acting upon conditions cpu386 return codes error levels error onerror also allowed change scrollock capslock insert verify settings well switchar yeschar nochar resumechar characters various behavioural details could controlled new parameters /q quiet /l lowercase /y yes /s switch switches provided optional support lpt4 device allowed configure built-in comx lptx devices well change prn aux defaults handling environment variables config.sys improved new load-high facilities included hifiles/fileshigh hifcbs/fcbshigh options relocate file handles fcb structures umbs typically gave 1 4 kb 15 kb free conventional memory compared previous versions hishell/shellhigh size directive control pre-allocation hma memory command.com helped avoid memory fragmentation thereby typically gave 5 8 kb continuous hma memory hma-capable third-party drivers work conjunction third-party command line shells could load hma command.com /mh option reduced memory footprint version 7.02 also brought enhanced nls 4.xx sub-system paul allow multiple distributed possibly user-configured country.sys files used system time hierarchical model also gave dynamic parser support ms-dos/pc dos country.sys file formats addition dr-dos country.sys formats introduced support iso 8601 international date format including automatic detection then-new euro currency dr-dos files ibmbio.com ibmdos.com country.sys carried misleading file extensions compatibility reasons dr-dos 7.02 enhanced incorporate fat binary-style safety feature devised paul would exit gracefully called inappropriately dr-dos 7.02 fully year 2000 compliant provided special support work buggy system bioses also came updated fdisk could partition format fat32 volumes yet work lba sources novell patches external tools drivers meanwhile found germany could thus retro-fitted system well dr-dos 7.02 finally caught novell dos 7 true step forward release followed various updates june august september 1998 updated internal bdos version number introduced new problem legacy third-party applications special support novell dos longer updated stopped working setver already allowed novell dos disguise dos versions file name globally specifying magic sub-version 255 would even disable internal bdos version check order cope programs specifically probing dr-dos modified kernel setver driver paul would hierarchical model also support load paths order distinguish multiple executables file name introduced extended mode setver could fake dos versions also bdos kernel versions sub-versions 128 255 would reported dos sub-versions 0 127 applications bdos version check disabled sub-versions 100 127 could used fake different bdos versions whereas dos revision number typically set 0 static pre-boot patchable data structure would taken reported sub-version instead setver /g /x 6.114 would allow versions dr-dos since 7.02 still report dos 6.0 faked bdos version 7.2 114 decimal 72 hexadecimal thereby masquerading novell dos 7 opendos 7.01 otherwise beneficial new hifiles triggered compatibility problem dos-up feature third-party memory manager qemm 8 hard-wired expect chunk five handle structures conventional memory dr-dos previous versions 7.01 whereas version 7.02 design left eight handles low memory loading high files order maintain full compatibility older versions windows 3.xx compatibility windows workgroups 3.11 affected maintenance fix devised patch single byte ibmbio.com order switch behaviour optionally re-invoke old chunking freed 150 bytes conventional memory enabled full compatibility dos-up time broke compatibility older versions windows 3.xx using hifiles feature vice versa patch named ibmbio85.scr continued work newer versions dr-dos august 1998 us-based caldera inc. created two new subsidiaries caldera systems inc. linux business caldera thin clients inc. embedded thin-client market another version dr-dos 7.03 still bdos 7.3 reporting applications pc dos 6.0 compatibility purposes pre-released christmas 1998 officially released 6 january 1999 caldera uk came significantly improved memory managers particular enhanced dpmi support conjunction multitasker enhancements added devload drmouse utilities changed oem label boot sector volumes formatted dr-dos could also cause problems operating systems circumvented novoltrk dr-dos 7.03 would become last version dr-dos also tailored desktop use caldera inc. wanted relocate dr-dos business us closed highly successful uk operation february 1999 gross resigned set icentrix develop marionet split web browser development moved us never worked due total lack expertise field caldera us dr-dos line fell branch company caldera thin clients renamed lineo inc. 20 july 1999 dr-webspyder renamed embrowser said ported linux lineo re-released dr-dos 7.03 june september 1999 still branded caldera dr-dos without changes otherwise focussed linux embedded systems based stripped-down version openlinux named embedix among latest independently-developed versions dr-dos oem dr-dos 7.04 19 august 1999 7.05 30 november 1999 still branded caldera dr-dos variants system consisting kernel command shell specialized native implementation fat32 large hard disk support could found bundled ontrack easy recovery 5 2000 replacing dynamically-loadable drfat32 redirector driver still came easy recovery 4 also used seagate technology seatools cd imaging software nero burning rom still reporting bdos 7.3 internally first versions report pc dos 7.10 applications order indicate integrated fat32 support designed mostly backwards-compatible dr-dos 7.04/7.05 ibmbio.com could combined dr-dos 7.03 ibmdos.com order give desktop-approved dr-dos 7.03 kernel lba capabilities work drives larger 8 gb specific oem requirements dr-dos 7.06 14 december 1999 wightman combined kernel files single binary executable similar io.sys windows 98 could booted ms-dos 7.10 boot sectors longer dr-dos boot sectors dr-dos 7.07 bdos 7.4/7.7 paul introduced new bootstrap loaders updated disk tools order combine support chs lba disk access fat12 fat16 fat32 file systems differing bootstrapping conventions dr-dos pc dos ms-dos windows real/32 loader single newldr mbr boot sector code would continue load version dr-dos 3.31 since dr-dos 7.04 also fat32 support could also used launch pc dos ms-dos system files including windows 9x pc dos 7.10 time kernel could booted new sectors also previously dr-dos formatted disks well disks existing pc dos ms-dos boot sectors variety boot-loaders thereby easing coexistence setup multi-boot scenarios conjunction operating systems 2002 lineo bought lineo former managers purchased name formed new company drdos inc. dba devicelogics l.l.c continued sell dr-dos use embedded systems dr-dos 8.0 released 30 march 2004 featuring fat32 large disk support ability boot rom flash multitasking dpmi memory manager version based kernel version 7.03 company later released dr-dos 8.1 better fat32 support autumn 2005 version instead based opendos 7.01.xx dr-dos 8.1 withdrawn gpl violations see controversies aside selling copies operating system drdos inc. website lists buyout option dr-dos asking price opendos 7.01 source code base dr-dos/opendos enhancement project set july 2002 attempt bring functionality dr-dos parity modern pc non-windows operating systems project added native support large disks lba fat32 file system several enhancements including improved memory management support new fat32+ file system extension allows files 256 gb size normal fat partitions dr-dos 7.01.08 released 21 july 2011 october 2005 discovered dr-dos 8.1 included several utilities freedos well sources kernel outdated version enhanced dr-dos kernel dr dos inc. failed comply gnu general public license gpl crediting freedos utilities authors including source code complaints freedos developers including suggestion provide source code hence comply gpl dr dos inc. instead withdrew version 8.1 also unaffected 8.0 website append assign batch dbg delq era eraq subst among internal commands supported since dr dos 3.31 dr dos 5.0 removed batch added hiload gosub idle return switch added internal commands dr dos 6.0 assign subst changed become external commands dr dos 6.0 echoerr pauseerr existed internal commands dr dos 6.0 multiuser dos normally enabled remained internal command including palmdos changed external command novell dos 7 dbg removed novell dos 7 loadhigh lh truename added internal commands append still internal command dr dos 6.0 changed external command novell dos 7 following list internal commands supported dr dos 6.0 batch processing subcommands dr dos 6.0 include dr dos 6.0 supports following external commands", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 58, + 64, + 85, + 99, + 134, + 170, + 171, + 187, + 234, + 322, + 326, + 377, + 413, + 434, + 465, + 477, + 583, + 639, + 664, + 728, + 735, + 754, + 796, + 797, + 860, + 868, + 870, + 891, + 920, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1110, + 1138, + 1155, + 1187, + 1188, + 1202, + 1224, + 1287, + 1301, + 1304, + 1346, + 1394, + 1398, + 1415, + 1430, + 1441, + 1445, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 23, + "label": 3, + "text": "Elidon:elidon elidon action game developed published orpheus ltd. amstrad cpc commodore 64 msx computers 1985 elidon well received press including review scores 78 amtix 15/20 computer gamer 83 zzap 64", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 24, + "label": 2, + "text": "Google_Nexus:google nexus google nexus line consumer electronic devices ran android operating system google managed design development marketing support devices development manufacturing carried partnering original equipment manufacturers oems line also included tablets streaming media players though neither type device currently available recent tablet nexus 9 made htc recent streaming media player nexus player made asus devices nexus line considered google flagship android products contained little manufacturer wireless carrier modifications android custom user interfaces although devices sold carriers may sim locked extra branding nexus 6 devices sold example sim locked featured custom boot splash screen logo back device despite otherwise identical hardware unlocked variant verizon galaxy nexus featured verizon logo back received software updates slower pace unlocked variant though featured different hardware accommodate verizon cdma network nexus devices featured unlockable bootloader allow development end-user modification nexus devices often among first android devices receive updates operating system expansion google pixel product line late 2016 google stated \u2019 want close door completely plan right nexus devices 2017 google partnered hmd global making new nokia phones considered revival nexus nexus one manufactured htc released january 2010 first nexus phone released android 2.1 eclair updated may 2010 first phone android 2.2 froyo updated android 2.3 gingerbread announced google would cease support nexus one whose graphics processing unit gpu poor rendering new 2d acceleration engine ui android 4.0 ice cream sandwich nexus newer models hardware designed handle new rendering nexus device card storage expandability sd nexus manufactured samsung released december 2010 coincide release android 2.3 gingerbread december 2011 updated android 4.0 ice cream sandwich variations later updatable android 4.1 jelly bean july 2012 device support ended 4.1 jelly bean longer receives updates google galaxy nexus manufactured samsung released november 2011 gsm version us version released december 15 2011 coincide release android 4.0 ice cream sandwich device support ended 4.3 jelly bean longer receives updates google device known brazil galaxy x due trademark nexus brand also last nexus device removable battery nexus 4 smartphone also known lg nexus 4 lg mako released november 2012 manufactured lg first android device used android 4.2 jelly bean update version nexus 4 first nexus device wireless charging capabilities updated android 4.3 june 2013 android 4.4 november 2013 run android 5.1 april 2015 nexus 4 following characteristics nexus 5 smartphone manufactured lg scheduled sale october 31 2013 us 349 google play store first device run android 4.4 kitkat nexus 5 receive official android 7.0 nougat update meaning android 6.0.1 marshmallow last officially supported android version device nexus 5 following characteristics nexus 6 smartphone developed motorola originally running android 5.0 lollipop upgradeable android 7.1.1 nougat first announced october 15 2014 along nexus 9 nexus player nexus 5x smartphone developed lg originally running android 6.0 marshmallow first announced september 29 2015 along nexus 6p several google devices pixel c tablet nexus 6p smartphone developed huawei originally running android 6.0 marshmallow first announced september 29 2015 along nexus 5x several google devices pixel c tablet june 27 2012 i/o 2012 keynote presentation google introduced nexus 7 7-inch tablet computer developed manufactured asus released july 2012 first device run android 4.1 jelly bean latest android version supported google device android 5.1.1 lollipop july 24 2013 google breakfast sundar pichai press conference pichai introduced second generation nexus 7 co-developed asus keeping google nexus tradition simultaneously released latest version android 4.3 jelly bean made available july 26 2013 select retailers google play store united states november 20 2013 available google play stores hong kong india day nexus wireless charger made available united states canada december 2015 google released android 6.0.1 marshmallow device nexus 7 2013 receive official android 7.0 nougat update meaning android 6.0.1 marshmallow last officially supported android version tablet nexus 10 10.1-inch tablet manufactured samsung revealed late october 2012 exif data photos taken google executive vic gundotra along leaks manual comprehensive series photos leaked photos revealed design similar samsung galaxy note 10.1 10.1-inch 2560\u00d71600 display 16 32 gb storage android 4.2 dual-core 1.7 ghz exynos 5 processor nexus 10 expected unveiled officially google press event october 29 2012 event postponed due hurricane sandy nexus 10 would receive official updates beyond android 5.1.1 nexus 9 8.9-inch tablet running android 5.0 lollipop developed collaboration google htc first announced october 15 2014 along nexus 6 nexus player nexus q discontinued digital media player ran android integrated google play sell us 299 united states complaints lack features price nexus q shelved indefinitely google said needed time make product even better nexus q unofficially replaced chromecast nexus player nexus player streaming media player created collaboration google asus first device running android tv first announced october 15 2014 along nexus 6 nexus 9 may 24 2016 google discontinued sales nexus player march 2018 google confirmed nexus player would receive upcoming version android android pie security updates also ended device upon announcement first nexus device nexus one estate science fiction author philip k. dick claimed nexus one name capitalized intellectual property dick 1968 novel androids dream electric sheep choice name direct reference nexus-6 series androids novel", + "neighbors": [ + 41, + 113, + 131, + 162, + 176, + 182, + 211, + 216, + 298, + 306, + 337, + 398, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 927, + 936, + 962, + 1061, + 1082, + 1129, + 1138, + 1183, + 1185, + 1232, + 1259, + 1265, + 1276, + 1310, + 1313, + 1371, + 1384, + 1411, + 1419, + 1480, + 1483, + 1500, + 1503, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 25, + "label": 7, + "text": "Advanced_Resource_Connector:advanced resource connector advanced resource connector arc grid computing middleware introduced nordugrid provides common interface submission computational tasks different distributed computing systems thus enable grid infrastructures varying size complexity set services utilities providing interface known arc computing element arc-ce arc-ce functionality includes data staging caching developed order support data-intensive distributed computing arc open source software distributed apache license 2.0 arc appeared still often referred nordugrid middleware originally proposed architecture top globus toolkit optimized needs high-energy physics computing large hadron collider experiments first deployment arc nordugrid testbed took place summer 2002 2003 used support complex computations. ref name= eprint arxiv physics/0306013 /ref first stable release arc version 0.4 came april 2004 gnu general public license name advanced resource connector introduced release distinguish middleware infrastructure year swedish national grid project swegrid became first large cross-discipline infrastructure based arc 2005 nordugrid formally established collaboration support coordinate arc development 2006 two closely related projects launched nordic data grid facility deploying pan-nordic e-science infrastructure based arc knowarc focused transforming arc next generation grid middleware arc v0.6 released may 2007 becoming second stable release key feature introduction client library enabling easy development higher-level applications also first arc release making use open standards included support jsdl later year first technology preview next generation arc middleware made available though distributed arc new approach involved switching web service based architecture general substantial re-factorisation core code 2008 nordugrid consortium adopted apache license arc components last stable release 0-line arc v0.8 shipped september 2009 eventually included preview version new execution service a-rex several components like chelonia isis charon arcjobtool gui parallel arc v0.8 eu knowarc project released november 2009 conceptual arc nox suite complete grid solution fully based web service technologies name nox actually indicates release date november year ox may 2011 nordugrid released arc v11.05 adopting ubuntu versioning scheme time release marked complete transition old execution service a-rex accompanying services backwards compatibility existing infrastructures old interfaces execution service information system retained arc free software available nordugrid public repository binary packages variety linux systems source source code also openly available nordugrid svn repository open source development arc middleware coordinated nordugrid collaboration contributions software documentation dissemination activities coming community various projects eu knowarc emi projects ndgf neic various national infrastructure research projects since 2011 arc adopted ubuntu-like versioning schema bundled releases consisting individual components individual components versioning corresponding code tags version core arc packages often used instead formal release number everyday communication arc implements several open grid forum standards particular jsdl glue2 bes ur/rus star 2010-2013 several key arc components notably hed a-rex clients libraries included european middleware initiative emi software stack emi arc became part unified middleware distribution umd european grid infrastructure egi arc basis computing infrastructure nordic data grid facility ndgf 2006-2010 ndgf actively contributed arc development since 2010 provides arc deployment expertise within egi since 2012 ndgf became part nordic e-infrastructure collaboration grid-enabled know-how sharing technology based arc services open standards knowarc sixth framework programme specific targeted research project funded priority ist-2005-2.5.4 advanced grid technologies systems services june 2006 november 2009 many ways project shaped arc main goal make arc based open community standards among key results creation standardized hosting environment arc services hed apart main aim developing arc contributed development standards increased grid arc usage medicine bioinformatics july 2009 knowarc announced contributed integration grid technologies official linux repositories adding globus toolkit components fedora debian repositories", + "neighbors": [ + 134, + 390, + 760, + 802, + 847, + 961, + 1131, + 1138, + 1159, + 1416, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 26, + "label": 2, + "text": "Windows_XP_visual_styles:windows xp visual styles windows xp visual styles customizations graphical user interface windows xp luna royale zune embedded codenames official visual styles designed windows xp microsoft since windows xp themes include choice visual styles well default luna preinstalled windows xp home professional editions royale preinstalled windows xp media center edition embedded preinstalled windows embedded standard 2009 windows embedded posready 2009 addition preinstalled visual styles microsoft released additional ones download third parties also released visual styles though require modification core windows components work visual styles compatible windows xp editions compared previous versions windows new styles greater emphasis graphical appeal operating system using saturated colors bitmaps throughout interface rounded corners windows visual styles api substantially expanded windows vista later particular common controls styled well nevertheless api remained heavily underdocumented luna moon latin various languages codename default visual style windows xp officially known windows xp style available three color schemes blue default olive green silver critics like theme characterized fisher-price interface officially titled windows classic style less cpu-intensive offers better performance greater color font customization options windows xp includes 22 preset color schemes visual style four optimized visually impaired windows standard scheme default color scheme windows windows 2000 appeared windows vista windows 7 although latter renamed windows classic slightly darker variant standard scheme called windows classic default color scheme windows 98 albeit dark blue desktop background instead green much like pre-release versions windows 2000 appeared windows vista windows 7 schemes appeared previous versions windows windows classic style automatically used safe mode win32 console windows also appears windows server 2003 2008 r2 windows classic theme removed windows server 2012 windows 8 normal use still exists kernel royale also known media center style energy blue originally designed windows xp media center edition 2005 ported windows xp tablet pc edition 2005 accompanied new wallpaper inspired windows xp bliss presents relucent vivid faux-reflective color scheme intense blue green colors royale originally made available december 2004 april 7 2005 microsoft new zealand made royale theme wallpapers new zealand theme available download editions xp windows genuine advantage website longer exists 2019 freeware nature package also available software download websites softpedia one time microsoft also release windows media player visualization skin one time skin released experience pack tablet pc available free installer installed windows xp tablet pc edition devices licensed royale noir looks like darkened version royale blackish bluish purple tint royale noir black start button changes green mouse hovers royale noir leaked finalized microsoft noted imperfections weeks royale noir leaked zune officially released theme package accompany release microsoft new zune media player terms style zune resembles royale royale noir particularly latter displays brown light shadow style first visual style windows xp include differently colored start button green xp windows embedded standard 2009 windows embedded posready 2009 came dedicated visual style called embedded similar royale featuring mix dark blue colors windows loads visual style bears valid microsoft digital certificate third-party visual styles used one windows files called uxtheme.dll altered allow unsigned visual styles microsoft aware practice suggests obtaining newer revision patched uxtheme.dll file case problems occur microsoft updates file applied typically os service pack third-party applications configured work visual styles default title bar window borders windows forms-based applications rendered using user preferred visual style rest application graphical user interface gui rendered classic style two different parts gui rendered using two different software libraries title bar window borders non-client area user controls use windows user remaining controls client area common controls use version 5.8 common controls library version 6.0 common controls library contains user controls common controls developers may configure application user interface displayed user currently-selected visual style forcing rendered using version 6.0 library", + "neighbors": [ + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 815, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1193, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 27, + "label": 9, + "text": "Kent_Pitman:kent pitman kent m. pitman kmp programmer involved many years design implementation use systems based programming languages lisp scheme president hypermeta inc. pitman chair ad hoc group part x3j13 designed common lisp error condition system author proposal document ultimately adopted many papers lisp programming computer programming general high school saw output one guess animal pseudo-artificial intelligence ai games popular considered implementing version program basic massachusetts institute technology mit instead implemented several dialects lisp including maclisp technical contributor x3j13 american national standards institute ansi subcommittee standardized common lisp contributed design programming language prepared document became ansi common lisp common lisp hyperspec hypertext conversion standard document became international organization standardization iso islisp often found usenet newsgroup comp.lang.lisp involved discussions lisp computer programming insider perspectives lisp evolution common lisp standardization posts expressed opinion open-source software including open source implementations lisp scheme something judged individually essential merits rather automatically considered good merely free open", + "neighbors": [ + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 491, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 28, + "label": 2, + "text": "Microsoft_Speech_API:microsoft speech api speech application programming interface sapi api developed microsoft allow use speech recognition speech synthesis within windows applications date number versions api released shipped either part speech sdk part windows os applications use sapi include microsoft office microsoft agent microsoft speech server general versions api designed software developer write application perform speech recognition synthesis using standard set interfaces accessible variety programming languages addition possible 3rd-party company produce speech recognition text-to-speech engines adapt existing engines work sapi principle long engines conform defined interfaces used instead microsoft-supplied engines general speech api freely redistributable component shipped windows application wishes use speech technology many versions although speech recognition synthesis engines also freely redistributable two main 'families microsoft speech api sapi versions 1 4 similar extra features newer version sapi 5 however completely new interface released 2000 since several sub-versions api released speech api viewed interface piece middleware sits applications speech engines recognition synthesis sapi versions 1 4 applications could directly communicate engines api included abstract interface definition applications engines conformed applications could also use simplified higher-level objects rather directly call methods engines sapi 5 however applications engines directly communicate instead talks runtime component sapi.dll api implemented component applications use another set interfaces engines typically sapi 5 applications issue calls api example load recognition grammar start recognition provide text synthesized sapi.dll runtime component interprets commands processes necessary calling engine engine interfaces example loading grammar file done runtime grammar data passed recognition engine actually use recognition recognition synthesis engines also generate events processing example indicate utterance recognized indicate word boundaries synthesized speech pass reverse direction engines runtime dll event sink application addition actual api definition runtime dll components shipped versions sapi make complete speech software development kit following components among included versions speech sdk xuedong huang key person led microsoft early sapi efforts first version sapi released 1995 supported windows 95 windows nt 3.51 version included low-level direct speech recognition direct text speech apis applications could use directly control engines well simplified 'higher-level voice command voice talk apis sapi 3.0 released 1997 added limited support dictation speech recognition discrete speech continuous additional sample applications audio sources sapi 4.0 released 1998 version sapi included core com api together c++ wrapper classes make programming c++ easier activex controls allow drag-and-drop visual basic development shipped part sdk included recognition synthesis engines also shipped synthesis engines windows 2000 main components sapi 4 api available c++ com activex flavors speech sdk version 5.0 incorporating sapi 5.0 runtime released 2000 complete redesign previous versions neither engines applications used older versions sapi could use new version without considerable modification design new api included concept strictly separating application engine calls routed runtime sapi.dll change intended make api 'engine-independent preventing applications inadvertently depending features specific engine addition change aimed making much easier incorporate speech technology application moving management initialization code runtime new api initially pure com api could used easily c/c++ support vb scripting languages added later operating systems windows 98 nt 4.0 upwards supported major features api include version shipped late 2000 part speech sdk version 5.0 together version 5.0 recognition synthesis engines recognition engines supported continuous dictation command control released u.s. english japanese simplified chinese versions u.s. english system special acoustic models available children speech telephony speech synthesis engine available english chinese version api recognition engines also shipped microsoft office xp 2001 version shipped late 2001 part speech sdk version 5.1 automation-compliant interfaces added api allow use visual basic scripting languages jscript managed code version api tts engines shipped windows xp windows xp tablet pc edition office 2003 also include version substantially improved version 6 recognition engine traditional chinese special version api use microsoft speech server shipped 2004 added support srgs ssml mark-up languages well additional server features performance improvements speech server also shipped version 6 desktop recognition engine version 7 server recognition engine version api ships windows vista together new recognition synthesis engines windows speech recognition integrated operating system speech sdk apis part windows sdk sapi 5.3 includes following new features updated version api ships windows 7 microsoft sam speech articulation module commonly shipped sapi 5 voice addition microsoft office xp office 2003 installed l h michael michelle voices sapi 5.1 sdk installs 2 voices mike mary windows vista includes microsoft anna replaces microsoft sam sounds natural intelligible also installed windows xp microsoft streets trips 2006 later versions chinese version vista later windows client versions also include female voice named microsoft lili managed code api ships part .net framework 3.0 similar functionality sapi 5 suitable used managed code applications new api available windows xp windows server 2003 windows vista windows server 2008 existing sapi 5 api also used managed code limited extent creating com interop code helper code designed assist accessing com interfaces classes works well scenarios however new api provide seamless experience equivalent using managed code library however major obstacle towards transitioning com interop fact managed implementation subtle memory leaks lead memory fragmentation exclude use library non-trivial applications workaround microsoft suggested using different api fewer voices windows vista includes number new speech-related features including microsoft agent notably microsoft speech applications use sapi 5 speech api compatible following operating systems", + "neighbors": [ + 268, + 412, + 435, + 472, + 503, + 509, + 521, + 680, + 689, + 815, + 961, + 1068, + 1151, + 1177, + 1417, + 1428, + 1486, + 1502, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 29, + "label": 9, + "text": "List_of_educational_programming_languages:list educational programming languages educational programming language programming language designed mostly instrument learning less tool writing programs perform work many educational programming languages position inside learning path sequence languages designed build others moving student easy understand entertaining environments full professional environments better known presented originally machine code first way program computers assembly language next type language used thus one oldest families computer languages use today many dialects implementations available usually computer processor architecture basic termed low level programming language one difficult languages work untyped rigid computers work low level several simplified dialects exist education low level languages must written specific processor architecture written taught isolation without referencing processor written unlike higher level languages using educational assembly language needs representation processor whether virtualized physical assembly helpful language use learning fundamental computer processor operation basic stands beginner all-purpose symbolic instruction code invented 1964 provide computer access non-science students became popular minicomputers 1960s became standard computing language microcomputers late 1970s early 1980s goals basic focused needs learning program easily easy beginners use interactive provide clear friendly error messages respond quickly require understanding computer hardware operating systems made basic particularly useful education small size programs useful programs illustrate concept could written dozen lines time basic require mathematical computer science sophistication basic continues day frequently self-taught excellent tutorials implementations see list basic dialects platform complete list basic offers learning path learning oriented basics microsoft small basic basic-256 simple full featured basics like visual basic .net gambas sun microsystems recommended path greenfoot bluej netbeans-bluej netbeans-java lisp second oldest family programming languages use today dialects implementations wide range difficulties lisp originally created practical mathematical notation computer programs based lambda calculus makes particularly well suited teaching theories computing one earliest languages lisp pioneered many ideas computer science including tree data structures automatic storage management dynamic typing object-oriented programming self-hosting compiler useful learning computer science name lisp derives list processing language linked lists one languages major data structures lisp source code made lists thus lisp programs manipulate source code data structure giving rise macro systems allow programmers create new syntax even new domain-specific languages embedded lisp lisps useful learning language design creating custom languages reasonable learning path would logo followed educational variant scheme newlisp followed professional variant common lisp part one laptop per child project sequence smalltalk-based languages developed designed act introduction next structure scratch etoys squeak smalltalk provides graphical environments may used teach programming concepts kids also physics mathematics simulations story-telling exercises etc. use constructive learning smalltalk squeak fully featured application development languages around well respected decades scratch children learning tool following chart helps summarize information parents teachers", + "neighbors": [ + 78, + 194, + 251, + 270, + 292, + 347, + 392, + 396, + 457, + 509, + 567, + 796, + 820, + 824, + 828, + 831, + 919, + 926, + 934, + 978, + 984, + 1016, + 1044, + 1221, + 1225, + 1231, + 1311, + 1320, + 1324, + 1388, + 1398, + 1402, + 1404, + 1430, + 1582, + 1588 + ], + "mask": "Test" + }, + { + "node_id": 30, + "label": 3, + "text": "Saint_Dragon:saint dragon storm software development team sales curve silkworm ninja warriors affiliated accolade conversion project managed dan marchant programming andrew taylor music tony williams graphics sean mcclurg working zx spectrum conversion taylor spent two weeks reading reviews scrolling games studied videos arcade board gameplay noted several challenges huge sprites half size screen use vast amount memory thing st dragon alien seems make much complicated series moves say r-type 've got try reproduce pretty complicated also wanted achieve smooth scrolling rather by-character-block movement r-type without sacrificing speed method called pre-shifts eventually used several versions sprite held memory slightly different position cycled give appearance smooth movement used memory restricted game 128k models spectrum larger sprites leaping puma handled dividing strips separate co-ordinated entities saint dragon side-scrolling shoot 'em player controls cyborg saint dragon rebelled tyrannical monster cyborg army saint dragon initially armed plasma bolts fiery breath collecting tokens dragon firepower upgraded pulse torpedoes laser bouncing bombs ring lasers turret tokens upgrade dragon speed weapon power initiate hyper mode endows maximum firepower invulnerability addition dragon armoured tail follows player movement allowing used defensive shield five levels culminating battle large end-of-level guardian zx spectrum conversion well received initial release crash awarded 92 finding dragon theme refreshing change genre graphics highlighted well animated smooth colourful sinclair awarded 80 criticizing uneven difficulty low number levels praising pretty tough blast-a-minute budget re-release 1992 sinclair adjusted rating 29 criticizing hideously slow graphically abysmal impossibly tedious load old junk stuart campbell took issue cassette multi-load invisible border reduced playing area framerate drop multiple sprites screen", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 31, + "label": 9, + "text": "Elm_(programming_language):elm programming language elm domain-specific programming language declaratively creating web browser-based graphical user interfaces elm purely functional developed emphasis usability performance robustness advertises runtime exceptions practice made possible elm compiler static type checking elm initially designed evan czaplicki thesis 2012 first release elm came many examples online editor made easy try web browser evan czaplicki joined prezi 2013 work elm 2016 moved noredink open source engineer also starting elm software foundation initial implementation elm compiler targets html css javascript set core tools continued expand including repl package manager time-traveling debugger installers mac windows elm also ecosystem community created libraries advanced online editor allows saved work inclusion community libraries elm small expressive set language constructs including traditional if-expressions let-expressions local state case-expressions pattern matching functional language supports anonymous functions functions arguments partial application currying default semantics include immutable values stateless functions static typing type inference elm programs render html virtual dom may interoperate code using javascript service values elm immutable meaning value modified created elm uses persistent data structures implement codice_1 codice_2 codice_3 libraries elm statically typed type annotations optional due type inference strongly encouraged annotations exist line definition unlike c-family languages types names interspersed elm uses single colon mean type types include primitives like integers strings basic data structures lists tuples records functions types written arrows example codice_4 custom types allow programmer create custom types represent data way matches problem domain types refer types example codice_5 types always capitalized lowercase names type variables example codice_6 list values unknown type type empty list argument codice_7 agnostic list elements special types programmers create interact elm runtime example codice_8 represents virtual dom tree whose event handlers produce messages type codice_9 rather allow value implicitly nullable javascript codice_10 null pointer elm standard library defines codice_11 type code produces handles optional value explicitly using type code guaranteed value claimed type actually present elm module system allows users break code smaller parts called modules modules hide implementation details helper functions group related code together modules serve namespace imported code codice_12 third party libraries packages consist one modules available elm public library libraries versioned according semver enforced compiler tools removing function changing type done major release elm uses abstraction called ports communicate javascript allows values flow elm programs making possible communicate elm javascript elm library called elm/html programmer use write html css within elm uses virtual dom approach make updates efficient unlike haskell purescript elm support higher-kinded types thus provide generic abstractions many common operations example generic codice_13 codice_14 codice_15 codice_16 function instead names used prefixed module codice_17 codice_18", + "neighbors": [ + 78, + 176, + 216, + 275, + 306, + 373, + 509, + 538, + 567, + 579, + 682, + 716, + 825, + 919, + 948, + 1028, + 1120, + 1221, + 1225, + 1227, + 1235, + 1280, + 1311, + 1324, + 1457, + 1532 + ], + "mask": "Validation" + }, + { + "node_id": 32, + "label": 4, + "text": "Power_analysis:power analysis cryptography power analysis form side channel attack attacker studies power consumption cryptographic hardware device smart card tamper-resistant black box integrated circuit attack non-invasively extract cryptographic keys secret information device simple power analysis spa involves visually interpreting power traces graphs electrical activity time differential power analysis dpa advanced form power analysis allow attacker compute intermediate values within cryptographic computations statistical analysis data collected multiple cryptographic operations spa dpa introduced open cryptology community 1998 paul kocher joshua jaffe benjamin jun simple power analysis spa side-channel attack involves visual examination graphs current used device time variations power consumption occur device performs different operations example different instructions performed microprocessor differing power consumption profiles result power trace smart card using des encryption sixteen rounds seen clearly similarly squaring multiplication operations rsa implementations often distinguished enabling adversary compute secret key even magnitude variations power consumption small standard digital oscilloscopes easily show data-induced variations frequency filters averaging functions built oscilloscopes often used filter high-frequency components differential power analysis dpa side-channel attack involves statistically analyzing power consumption measurements cryptosystem attack exploits biases varying power consumption microprocessors hardware performing operations using secret keys dpa attacks signal processing error correction properties extract secrets measurements contain much noise analyzed using simple power analysis using dpa adversary obtain secret keys analyzing power consumption measurements multiple cryptographic operations performed vulnerable smart card device high-order differential power analysis ho-dpa advanced form dpa attack ho-dpa enables multiple data sources different time offsets incorporated analysis ho-dpa less widely practiced spa dpa analysis complex vulnerable devices broken easily spa dpa power analysis provides way see inside otherwise 'tamperproof hardware example des key schedule involves rotating 28-bit key registers many implementations check least significant bit see 1 device shifts register right prepends 1 left end bit zero register shifted right without prepending 1 power analysis distinguish processes enabling adversary determine bits secret key implementations algorithms aes triple des believed mathematically strong may trivially breakable using power analysis attacks result power analysis attacks combine elements algorithmic cryptanalysis implementation security applications devices may fall physical possession adversary protection power analysis generally major design requirement power analyses also reportedly used conditional access modules used pay television systems equipment necessary performing power analysis attacks widely available example digital storage oscilloscopes provide necessary data collection functionality data analysis typically performed using conventional pcs commercial products designed testing labs also available power analysis attacks generally detected device since adversary monitoring normally passive addition attack non-invasive result physical enclosures auditing capabilities attack detectors ineffective instead cryptosystem engineers must ensure devices power variations reveal information usable adversaries simple power analysis easily distinguish outcome conditional branches execution cryptographic software since device different things consuming different power depending whether conditional branch taken reason care taken ensure secret values affect conditional branches within cryptographic software implementations sources variation microcode differences branches introduced compilers power consumption variations multipliers also commonly lead spa vulnerabilities differential power analysis difficult prevent since even small biases power consumption lead exploitable weaknesses countermeasure strategies involve algorithmic modifications cryptographic operations occur data related actual value mathematical relationship survives cryptographic operation one approach involves blinding parameters randomize value countermeasure strategies reduce effectiveness dpa attacks involve hardware modifications varying chip internal clock frequency considered desynchronize electric signals lead return algorithmic enhancements traditional dpa many techniques prevent spa dpa attacks proposed academic literature public key systems like rsa typically protected exploiting properties underlying algebraic structures case rsa would multiplicatively homomorphic property symmetrically keyed primitives like blockciphers require different methods e.g. masking companies like rambus claim intellectual property dpa defense mechanisms", + "neighbors": [ + 104, + 174, + 284, + 289, + 382, + 633, + 969, + 995, + 1071, + 1181, + 1351 + ], + "mask": "Train" + }, + { + "node_id": 33, + "label": 2, + "text": "App_Store_(macOS):app store macos app store also known mac app store digital distribution platform macos apps created maintained apple inc platform announced october 20 2010 apple back mac event apple began accepting app submissions registered developers november 3 2010 preparation launch mac app store launched january 6 2011 part free mac os x 10.6.6 update current snow leopard users 24 hours release apple announced one million downloads june 4 2018 apple announced new version app store would included macos mojave like app store ios mac app store regulated apple submit app consideration developer must member apple developer program june 2019 membership fee us 99 year apps must approved apple becoming available store disallowed types apps revealed apple include apps ios app store apple rates applications worldwide based content determines age group appropriate macos allow blocking objectionable apps system preferences following ratings apple detailed since opening mac app store apple increasingly used primary means distribution in-house software products expense boxed versions sold retail stores position increased july 2011 release os x lion first release os x sold form dvd boxes method limited reach distribution operating system currently use mac os x 10.6.6+ although means offered apple release included usb flash drive containing operating system digital in-store download operating system apple store locations starting os x mountain lion apple \u2019 operating systems downloaded mac app store however apple still sells mac os x snow leopard dvds june 2019 owners older macs get mac app store upgrade latest available version also affected apple prior means distribution website downloads gallery removed july 2011 replaced links mac app store information page however affected dashboard widget gallery affected safari extensions gallery remain online web-based however safari 12 old kind extensions deprecated replaced new safe one available exclusively mac app store apple support download section also remains online provides mostly security updates current older software applications operating systems many dating back 1998 long independent game developer wolfire games placed game lugaru mac app store lugaru hd 9.99 developer noticed counterfeit copy game also sold app store 0.99 usd developer contacted apple january 31 2011 february 10 2011 counterfeit copy game removed app store number news sites remarked scrutiny apple places apps listed store counterfeit copy existing app made process days since developer alerted apple counterfeit software disconcerting developers mac app store launched 1000 apps january 6 2011 including apple iwork '09 ilife '11 aperture third-party applications ported ios angry birds flight control things twitter mac apps belonged games category nearly three times many apps next largest category utilities common price point 20\u201350 angry birds popular video game ios app store number one paid app mac app store first day update mac app store os x mountain lion introduced easter egg one downloads app mac app store goes one app folder app finished downloading one see app timestamp january 24 1984 2:00 date original macintosh went sale first time easter egg appeared piece apple software since steve jobs declared ban easter eggs \u2019 returned apple 1997 november 11 2015 number apps purchased mac app store began fail launch users worldwide got error messages forced delete re-download affected apps discovered next day tapbots developer paul haddad issue expired security certificate november 17 apple sent email explanations developers company stated issues resolved troubleshooting information provided applecare support team december 17 2015 responsibility overseeing app store given phil schiller apple senior vice president worldwide marketing previously app store led eddy cue apple senior vice president internet software services january 1 2018 apple announced longer accepting 32-bit apps mac app store existing 32-bit apps app store must updated fit 64-bit architecture june 1 2018", + "neighbors": [ + 71, + 75, + 99, + 121, + 130, + 134, + 207, + 214, + 228, + 269, + 275, + 301, + 337, + 345, + 356, + 395, + 403, + 459, + 477, + 509, + 511, + 521, + 551, + 596, + 610, + 625, + 634, + 696, + 716, + 796, + 797, + 810, + 858, + 877, + 899, + 902, + 917, + 927, + 945, + 956, + 961, + 1001, + 1004, + 1046, + 1100, + 1138, + 1178, + 1189, + 1214, + 1225, + 1227, + 1235, + 1237, + 1262, + 1292, + 1301, + 1305, + 1311, + 1322, + 1334, + 1339, + 1366, + 1373, + 1409, + 1458, + 1488, + 1496, + 1544, + 1547, + 1563, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 34, + "label": 6, + "text": "Ext4:ext4 ext4 journaling file system fourth extended filesystem journaling file system linux developed successor ext3 default file system linux distributions ext4 initially series backward-compatible extensions ext3 many originally developed cluster file systems lustre file system 2003 2006 meant extend storage limits add performance improvements however linux kernel developers opposed accepting extensions ext3 stability reasons proposed fork source code ext3 rename ext4 perform development without affecting current ext3 users proposal accepted 28 june 2006 theodore ts ext3 maintainer announced new plan development ext4 preliminary development version ext4 included version 2.6.19 linux kernel 11 october 2008 patches mark ext4 stable code merged linux 2.6.28 source code repositories denoting end development phase recommending ext4 adoption kernel 2.6.28 containing ext4 filesystem finally released 25 december 2008 15 january 2010 google announced would upgrade storage infrastructure ext2 ext4 14 december 2010 google also announced would use ext4 instead yaffs android 2.3 2008 principal developer ext3 ext4 file systems theodore ts stated although ext4 improved features major advance uses old technology stop-gap ts believes btrfs better direction offers improvements scalability reliability ease management btrfs also number design ideas reiser3/4 however ext4 continued gain new features file encryption metadata checksums ext4 file system honor secure deletion file attribute supposed cause overwriting files upon deletion patch implement secure deletion proposed 2011 solve problem sensitive data ending file system journal delayed allocation changes behavior programmers relying ext3 feature poses additional risk data loss cases system crashes loses power data written disk due ext4 kernel versions 2.6.30 later automatically handles cases ext3 typical scenario might occur program replacing contents file without forcing write disk fsync two common ways replacing contents file unix systems using codice_14 often reduce risk ext4 could lead performance penalties ext3 filesystems mounted codice_15 flag default linux distributions given file systems use time complicates matters end-user application developers response ext4 linux kernels 2.6.30 newer detect occurrence common cases force files allocated immediately small cost performance provides semantics similar ext3 ordered mode increases chance either version file survive crash new behavior enabled default disabled noauto_da_alloc mount option new patches become part mainline kernel 2.6.30 various distributions chose backport 2.6.28 2.6.29 patches n't completely prevent potential data loss help new files way safe write use software codice_14 needs performance problems minimized limiting crucial disk writes need codice_14 occur less frequently linux kernel virtual file system subsystem layer inside linux kernel result serious attempt integrate multiple file systems orderly single structure key idea dates back pioneering work done sun microsystems employees 1986 abstract part file system common file systems put code separate layer calls underlying concrete file systems actually manage data system calls related files pseudo files directed linux kernel virtual file system initial processing calls coming user processes standard posix calls codice_18 codice_19 codice_20 codice_21 etc ext4 yet much support ext2 ext3 non-linux operating systems ext2 ext3 stable drivers ext2ifs yet available ext4 possible create compatible ext4 filesystems disabling extents feature sometimes specifying inode size another option using ext4 windows use ext2fsd open-source driver supports writing ext4 partitions limited journaling viewing copying files ext4 windows even extents enabled also possible ext2read software recently paragon released commercial product extfs windows allows read/write capabilities ext2/3/4 macos full ext2/3/4 read\u2013write capability paragon extfs software commercial product free software ext4fuse read-only support limited functionality", + "neighbors": [ + 40, + 55, + 63, + 82, + 131, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 412, + 438, + 495, + 524, + 540, + 553, + 557, + 558, + 570, + 575, + 723, + 728, + 837, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1179, + 1185, + 1187, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1449, + 1459, + 1538, + 1565, + 1569, + 1578, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 35, + "label": 6, + "text": "StegFS:stegfs stegfs free file system linux licensed gpl principally developed andrew d. mcdonald markus g. kuhn steganographic file system based ext2 filesystem last version stegfs 1.1.4 released february 14 2001 development release known bugs file corruption bug stable release last website activity 2004 2003 andreas c. petter sebastian urbach intended continue development stegfs created site sourceforge.net development moved using fuse library working releases available development homepage", + "neighbors": [ + 134, + 813, + 892, + 922, + 1003, + 1138, + 1232 + ], + "mask": "Train" + }, + { + "node_id": 36, + "label": 9, + "text": "Chakra_(JavaScript_engine):chakra javascript engine chakra javascript engine developed microsoft microsoft edge web browser fork jscript engine used internet explorer like edge layout engine unlike previous versions internet explorer declared intention reflect living web december 5 2015 announced core components chakra open-sourced chakracore chakra supports ecmascript 5.1 partial support ecmascript 6 following initial announcement december 5 2015 microsoft open sourced chakra engine chakracore including key components javascript engine powering microsoft edge github page mit license january 13 2016 chakracore essentially chakra engine powers microsoft edge browser platform-agnostic bindings i.e without specific interfaces utilised within windows universal app platform microsoft also created project github allows node.js use chakracore javascript engine instead v8", + "neighbors": [ + 7, + 50, + 69, + 81, + 132, + 509, + 593, + 632, + 686, + 869, + 959, + 961, + 1138, + 1264, + 1302, + 1547, + 1555, + 1566, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 37, + "label": 2, + "text": "TOPS-20:tops-20 tops-20 operating system digital equipment corporation dec proprietary os used dec 36-bit mainframe computers hardware reference manual described decsystem-10/decsystem-20 processor meaning dec pdp-10 decsystem-20 tops-20 began 1969 tenex operating system bolt beranek newman bbn shipped product dec starting 1976 tops-20 almost entirely unrelated similarly named tops-10 shipped pa1050 tops-10 monitor calls emulation facility allowed tops-10 executables run unchanged matter policy dec update pa1050 support later tops-10 additions except required dec software tops-20 competed tops-10 waits\u2014all available pdp-10 notable time-sharing systems timeframe tops-20 based upon tenex operating system created bbn technologies digital pdp-10 computer digital started development ki-10 version pdp-10 issue arose point tenex popular customer-written pdp-10 operating systems would run new faster ki-10s correct problem dec pdp-10 sales manager purchased rights tenex bbn set project port new machine end little original tenex code remained digital ultimately named resulting operating system tops-20 came tops-20 merely emulation tops-10 operating system calls known uuo standing unimplemented user operation needed compilers 20-specific run well user-programs written languages package mapped user address space named pa1050 pa pat compatibility 10 dec pdp 10 50 pdp 10 model 50 10/50 1050 sometimes pa1050 referred pat name good fit fact pa1050 simply unprivileged user-mode code performed requested action using jsys calls necessary major ways get tops-20 capabilities made tops-20 important exec accomplished work primarily using rather advanced day tops-20-specific features one could type find operands permitted/required following list commands supported tops-20 command processor jsys stands jump system operands times memory addresses tops-20 allows use 18-bit 30-bit addresses monitor calls require one kind calls accept either kind monitor calls use 18 bits hold address calls interpret 18-bit addresses locations current section internally files first identified using gtjfn get job file number jsys jfn number used open openf manipulate file contents paul allen maintained several publicly accessible historic computer systems death including xkl toad-2 running tops-20 request account try running tops-20 hardware emulated pdp-10", + "neighbors": [ + 1, + 9, + 22, + 42, + 55, + 58, + 64, + 78, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 349, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 753, + 754, + 763, + 797, + 860, + 884, + 891, + 925, + 941, + 954, + 961, + 966, + 996, + 998, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1213, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 38, + "label": 2, + "text": "Busdma:busdma computing busdma bus_dma bus_space set application programming interfaces designed help make device drivers less dependent platform-specific code thereby allowing host operating system easily ported new computer hardware accomplished abstractions direct memory access dma mapping across popular machine-independent computer buses like pci used distinct architectures ia-32 netbsd/i386 dec alpha netbsd/alpha additionally devices may come multiple flavours supporting one bus e.g. isa eisa vesa local bus pci still sharing core logic irrespective bus device drivers would also benefit abstraction thus rationale busdma facilitate maximum code reuse across wide range platforms circa 2006 bus dma abstractions made possible netbsd support 50 hardware platforms 14 cpu architectures single source tree compared forking model used linux ports originally implemented bus_dma apis developers netbsd operating system busdma adopted openbsd freebsd derivatives freebsd incorporating busdma umbrella without underscore netbsd openbsd additional bus_space apis amalgamated version busdma incorporated freebsd dragonfly bsd developers also slowly converting drivers use busdma", + "neighbors": [ + 101, + 116, + 134, + 189, + 272, + 290, + 323, + 326, + 377, + 457, + 477, + 899, + 992, + 1003, + 1124, + 1138, + 1202, + 1257, + 1278, + 1322, + 1366, + 1397, + 1521 + ], + "mask": "Test" + }, + { + "node_id": 39, + "label": 3, + "text": "BMX_Simulator:bmx simulator bmx simulator racing video game released codemasters 1986 commodore 64 ported home computers followed two sequels bmx simulator 2 professional bmx simulator part series games included atv simulator grand prix simulator professional ski simulator bmx simulator overhead race game similar super sprint player must race another player computer around series seven different bicycle motocross bmx tracks also time limit beaten two cyclists compete race race viewed slow-motion action replay afterwards sinclair user called classy conversion commodore original full price game budget clothing zx computing said fun start finish rated monster hit", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 40, + "label": 6, + "text": "Tux3:tux3 tux3 open-source versioning filesystem created daniel phillips introduced filesystem public replacement tux2 filesystem encountered licensing issues due filing several patents phillips previously created htree directory indexing system eventually became official feature ext3 technical details tux3 first publicized email 23 july 2008 broad outline tux3 follows conventional unix-style inode/file/directory design tux3 inode table b-tree versioned attributes leaves file inode attribute b-tree versioned extents leaves directory indexes mapped directory file blocks htree free space mapped b-tree extents leaves attempts avoid traditional journaling introducing recovery logic allows recover upon remounting tux3 inode variable sized object consisting list attributes labeled version attribute added changed removed b-tree index inodes referenced versioned b-tree index large file also versioned except leaves index contain lists extents labeled version referenced file data added changed style versioning essentially inverse tree versioning methods used write anywhere file layout wafl zfs btrfs multiple tree roots entire filesystem created order express differences versions filesystem claimed advantage tux3 style versioned entities bytes need added represent single changes inode attributes index new versions file data blocks compared number index blocks needing allocated written tree-versioned filesystems august 2008 tux3 capable performing basic file i/o files end 2008 tux3 capable running within kernel able sustain repeated runs file system exerciser fsx-linux big accomplishment 17 february 2009 linux booted tux3 root filesystem first time 18 january 2013 initial fsck support added far checks physical referential integrity developers confident make fully functional e2fsck-quality fsck soon 17 may 2014 daniel phillips made plea kernel maintainer review code implement kernel goal stabilize code kernel finally get stable 9 october 2017 daniel phillips sent tux3 update shardmap mailing list", + "neighbors": [ + 34, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1187, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 41, + "label": 2, + "text": "Android_Cupcake:android cupcake android cupcake version 1.5 third version android developed google major platform release deployable android-powered handsets starting april 2009 longer supported release includes new features users developers well changes android framework api developers android 1.5 platform available downloadable component android sdk android 1.5 included new features on-screen keyboard bluetooth support well improvements existing features ui changes application management several google apps", + "neighbors": [ + 24, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 42, + "label": 2, + "text": "FreeDOS:freedos freedos formerly free-dos pd-dos free operating system ibm pc compatible computers intends provide complete dos-compatible environment running legacy software supporting embedded systems freedos booted floppy disk usb flash drive designed run well virtualization x86 emulation unlike versions ms-dos freedos composed free open-source software licensed terms gnu general public license therefore base distribution require license fees royalties creation custom distributions permitted however packages form part freedos project include non-gpl software considered worth preserving 4dos distributed modified mit license freedos project began 29 june 1994 microsoft announced would longer sell support ms-dos jim hall time student posted manifesto proposing development pd-dos public domain version dos within weeks programmers including pat villani tim norman joined project kernel villani command.com command line interpreter villani norman core utilities hall created pooling code written found available project maintained morgan hannibal toal many official pre-release distributions freedos final freedos 1.0 distribution gnu/dos unofficial distribution freedos discontinued version 1.0 released freedos 1.1 released 2 january 2012 available download cd-rom image limited install disc contains kernel basic applications full disc contains many applications games networking development etc available newer fuller 1.2 legacy version 1.0 2006 consisted two cds one 8mb install cd targeted regular users larger 49mb live cd also held source code project freedos used several companies freedos also used multiple independent projects freedos requires pc/xt machine least 640 kb memory programs bundled freedos often require additional system resources freedos mostly compatible ms-dos supports com executables standard dos executables borland 16-bit dpmi executables also possible run 32-bit dpmi executables using dos extenders operating system several improvements relative ms-dos mostly involving support newer standards technologies exist microsoft ended support ms-dos internationalization advanced power management tsrs furthermore use hx dos extender many windows console applications function properly freedos rare gui programs like qemm bochs freedos able run microsoft windows 1.0 2.0 releases windows 3.x releases support i386 processors fully run 386 enhanced mode except partially experimental freedos kernel 2037 problems running windows result microsoft efforts prevent products running non-microsoft dos implementations windows 95 windows 98 windows use stripped-down version ms-dos freedos used replacement undocumented interfaces ms-dos 7.0-8.0 windows 4.xx emulated freedos however installed used beside systems using boot manager program bootmgr metakern included freedos windows nt-based operating systems including windows 2000 xp vista 7 desktops windows server 2003 2008 2008 r2 servers make use ms-dos core component system systems make use fat file systems used ms-dos earlier versions windows however typically use ntfs new technology file system default security reasons freedos co-exist systems separate partition partition fat systems freedos kernel booted adding windows 2000 xp nt boot loader configuration file boot.ini freeldr.ini equivalent reactos fat32 fully supported preferred format boot drive depending bios used four logical block addressing lba hard disks 128 gb 2 tb size supported little testing large disks bioses support lba produce errors disks larger 32 gb driver ontrack ez-drive resolves problem freedos also used driver called lfndos enable support windows 95-style long file names old programs windows 95 support lfns even driver loaded unless recompiled planned support ntfs ext2 exfat several external third-party drivers available purpose access ext2 file systems ltools counterpart mtools sometimes used copy data ext2 file system drives blinky fish mascot freedos designed bas snabilie", + "neighbors": [ + 1, + 9, + 22, + 37, + 58, + 64, + 85, + 99, + 134, + 170, + 171, + 187, + 211, + 234, + 306, + 322, + 326, + 377, + 413, + 465, + 477, + 558, + 583, + 631, + 639, + 664, + 728, + 754, + 755, + 796, + 797, + 860, + 868, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1188, + 1202, + 1224, + 1243, + 1278, + 1301, + 1304, + 1318, + 1398, + 1401, + 1415, + 1441, + 1457, + 1474, + 1494, + 1530, + 1538, + 1546, + 1558, + 1578, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 43, + "label": 4, + "text": "Vault_7:vault 7 vault 7 series documents wikileaks began publish 7 march 2017 detail activities capabilities united states central intelligence agency perform electronic surveillance cyber warfare files dated 2013\u20132016 include details agency software capabilities ability compromise cars smart tvs web browsers including google chrome microsoft edge mozilla firefox opera software asa operating systems smartphones including apple ios google android well operating systems microsoft windows macos linux february 2017 wikileaks began teasing release vault 7 series cryptic messages twitter according media reports later february wikileaks released classified documents describing cia monitored 2012 french presidential election press release leak stated published context forthcoming cia vault 7 series march 2017 us intelligence law enforcement officials said international wire agency reuters aware cia security breach led vault 7 since late-2016 two officials said focusing contractors possible source leaks 2017 federal law enforcement identified cia software engineer joshua adam schulte suspected source vault 7 first batch documents named year zero published wikileaks 7 march 2017 consisting 7,818 web pages 943 attachments purportedly center cyber intelligence already contains pages former nsa contractor leaker edward snowden nsa release wikileaks name source said files circulated among former u.s. government hackers contractors unauthorized manner one provided wikileaks portions archive according wikileaks source wishes initiate public debate security creation use proliferation democratic control cyberweapons since tools raise questions urgently need debated public including whether c.i.a hacking capabilities exceed mandated powers problem public oversight agency wikileaks redacted names identifying information documents release attempting allow connections people drawn via unique identifiers generated wikileaks also said would postpone releasing source code cyber weapons reportedly several hundred million lines long consensus emerges technical political nature c.i.a program 'weapons analyzed disarmed published wikileaks founder julian assange claimed part larger series cia released statement saying american public deeply troubled wikileaks disclosure designed damage intelligence community ability protect america terrorists adversaries disclosures jeopardize us personnel operations also equip adversaries tools information us harm assange held press conference 9 march offer share unpublished data vault 7 technology companies enable fix vulnerabilities detailed therein stated 1 total leak released much remainder leak included unpatched vulnerabilities working microsoft apple google get vulnerabilities patched would release information would put public risk fixes released manufacturers would release details vulnerabilities none vulnerabilities currently released zero-day exploits press release assange also read official statement microsoft stated microsoft desire next geneva convention would protect people government cyber weapons way previous geneva conventions protected noncombatants warfare statement issued 19 march 2017 assange said technology companies contacted agreed disagreed questioned termed wikileaks standard industry disclosure plan standard disclosure time vulnerability 90 days company responsible patching software given full details flaw according wikileaks mozilla provided information vulnerabilities google companies confirmed receiving initial notification wikileaks stated lagging companies conflicts interest due classified work us government agencies practice associations limit industry staff us security clearances fixing holes based leaked information cia companies choose secure users cia nsa attacks users may prefer organizations mozilla european companies prioritize users government contracts 23 march 2017 wikileaks published vault 7 part 2 dark matter publication includes documentation several cia efforts hack apple iphones macs 31 march 2017 wikileaks published vault 7 part 3 marble contained 676 source code files cia marble framework used obfuscate scramble malware code attempt make anti-virus firms investigators understand code attribute source according wikileaks code also included de-obfuscator reverse obfuscation effects 7 april 2017 wikileaks published vault 7 part 4 dubbed grasshopper publication contains 27 documents cia grasshopper framework used cia build customized persistent malware payloads microsoft windows operating systems grasshopper focused personal security product psp avoidance psps antivirus software ms security essentials symantec endpoint kaspersky 14 april 2017 wikileaks published vault 7 part 5 titled hive based cia top-secret virus program created embedded development branch edb six documents published wikileaks related hive multi-platform cia malware suite cia back-end infrastructure public-facing https interface used cia transfer information target desktop computers smartphones cia open devices receive commands cia operators execute specific tasks also called listening post lp command control c2 hiding presence behind unsuspicious-looking public domains masking interface known switchblade 21 april 2017 wikileaks published vault 7 part 6 code-named weeping angel hacking tool co-developed cia mi5 used exploit series smart tvs purpose covert intelligence gathering installed suitable televisions usb stick hacking tool enables televisions built-in microphones possibly video cameras record surroundings televisions falsely appear turned recorded data either stored locally television memory sent internet cia allegedly cia mi5 agencies collaborated develop malware coordinated work joint development workshops part 6 publication weeping angel second major cia hacking tool notably references british television show dr. alongside sonic screwdriver dark matter 28 april 2017 wikileaks published vault 7 part 7 scribbles leak includes documentation source code tool intended track documents leaked whistleblowers journalists embedding web beacon tags classified documents trace leaked tool affects microsoft office documents specifically microsoft office 2013 windows 8.1 x64 documents office versions 97-2016 office 95 documents work ocuments locked encrypted password-protected cia watermarked document opened invisible image within document hosted agency server loaded generating http request request logged server giving intelligence agency information opening opened however watermarked document opened alternative word processor image may visible viewer documentation also states document viewed offline protected view watermarked image able contact home server overridden user enables editing 5 may 2017 wikileaks published vault 7 part 8 archimedes according u.s. sans institute instructor jake williams analyzed published documents archimedes virus previously codenamed fulcrum according cyber security expert enisa member pierluigi paganini cia operators use archimedes redirect local area network lan web browser sessions targeted computer computer controlled cia sessions routed users type attack known man-in-the-middle mitm publication wikileaks included number hashes claim used potentially identify archimedes virus guard future paganini stated potential targeted computers search hashes systems check systems attacked cia 12 may 2017 wikileaks published vault 7 part 9 aftermidnight assassin aftermidnight malware installed target personal computer disguises dll file executed user computer reboots triggers connection cia command control c2 computer downloads various modules run assassin similar aftermidnight counterpart deceptively runs inside windows service process cia operators reportedly use assassin c2 execute series tasks collect periodically send user data cia listening post lp similar backdoor trojan behavior aftermidnight assassin run windows operating system persistent periodically beacon configured lp either request tasks send private information cia well automatically uninstall set date time 19 may 2017 wikileaks published vault 7 part 10 athena published user guide demo related documents created september 2015 february 2016 malware allegedly developed cia august 2015 roughly one month microsoft released windows 10 firm statements difficult compromise primary athena malware secondary malware named hera similar theory grasshopper aftermidnight malware significant differences one differences athena hera developed cia new hampshire private corporation called siege technologies bloomberg 2014 interview founder siege technologies confirmed justified development malware athena malware completely hijacks windows remote access services hera hijacks windows dnscache service also athena hera affect current versions windows including limited windows server 2012 windows 10 another difference types encryption used infected computers cia listening posts lp similarities exploit persistent dll files create backdoor communicate cia lp steal private data send cia servers delete private data target computer well command control c2 cia operatives send additional malicious software run specific tasks attacked computer designed deceive computer security software beside published detailed documents wikileaks provided evidence suggesting cia used athena 1 june 2017 wikileaks published vault 7 part 11 pandemic tool serves persistent implant affecting windows machines shared folders functions file system filter driver infected computer listens server message block traffic detecting download attempts computers local network pandemic answer download request behalf infected computer however replace legitimate file malware order obfuscate activities pandemic modifies replaces legitimate file transit leaving original server unchanged implant allows 20 files modified time maximum individual file size 800mb stated leaked documentation possible newly infected computers could become pandemic file servers allowing implant reach new targets local network 15 june 2017 wikileaks published vault 7 part 12 cherry blossom 22 june 2017 wikileaks published vault 7 part 13 brutal kangaroo 28 june 2017 wikileaks published vault 7 part 14 elsa 29 june 2017 wikileaks published vault 7 part 15 outlawcountry 6 july 2017 wikileaks published vault 7 part 16 bothanspy 13 july 2017 wikileaks published vault 7 part 17 highrise ucl raytheon 19 july 2017 imperial 27 july 2017 dumbo 3 august 2017 couchpotato 10 august 2017 wikileaks publishes secret documents expresslane project cia documents show one cyber operations cia conducts liaison services -- includes among many others national security agency nsa department homeland security dhs federal bureau investigation fbi ots office technical services branch within cia biometric collection system provided liaison services around world -- expectation sharing biometric takes collected systems 'voluntary sharing obviously work considered insufficient cia expresslane covert information collection tool used cia secretly exfiltrate data collections systems provided liaison services expresslane installed run cover upgrading biometric software ots agents visit liaison sites liaison officers overseeing procedure remain unsuspicious data exfiltration disguises behind windows installation splash screen core components ots system based products cross match us company specializing biometric software law enforcement intelligence community company hit headlines 2011 reported us military used cross match product identify osama bin laden assassination operation pakistan.- 24 august 2017 angelfire 31 august 2017 protego 7 september 2017 asked authenticity former director central intelligence agency michael hayden replied organization comment authenticity content purported intelligence documents however speaking condition anonymity current former intelligence officials said documents appear genuine edward snowden tweeted shortly documents release looked authentic robert m. chesney law professor university texas director technology public policy program center strategic international studies csis likened vault 7 nsa hacking tools disclosed 2016 group calling shadow brokers 15 march 2017 president donald trump stated interview cia hacked lot things taken following day statement democratic congressman adam schiff ranking member house intelligence committee wrote news release effort blame obama president appeared discussed something true accurate would otherwise considered classified information schiff also said president power declassify whatever wants wikileaks said documents came isolated high-security network situated inside cia center cyber intelligence cci langley virginia documents allowed wikileaks partially determine structure organization cci cci reportedly entire unit devoted compromising apple products cybersecurity firm symantec analyzed vault 7 documents found described software closely matched cyberattacks longhorn monitored since 2014 symantec previously suspected longhorn government-sponsored tracked usage 40 targets 16 countries first portion documents made public 7 march 2017 vault 7 year zero revealed top secret cia unit used german city frankfurt starting point hacking attacks europe china middle east according documents u.s. government uses consulate general office frankfurt hacker base cyber operations wikileaks documents reveal frankfurt hackers part center cyber intelligence europe ccie given cover identities diplomatic passports obfuscate customs officers gain entry germany chief public prosecutor general federal court justice karlsruhe peter frank announced 8 march 2017 government conducting preliminary investigation see launch major probe activities conducted consulate also broadly whether people germany attacked cia germany foreign minister sigmar gabriel social democratic party responded documents vault 7 year zero cia used frankfurt base digital espionage operations saying germany information cyber attacks documents reportedly revealed agency amassed large collection cyberattack techniques malware produced hackers library reportedly maintained cia remote devices branch umbrage group examples using techniques source code contained umbrage component library git repository according wikileaks recycling techniques third-parties umbrage cia increase total number attacks also mislead forensic investigators disguising attacks work groups nations among techniques borrowed umbrage file wiping implementation used shamoon according pc world techniques code snippets used cia internal projects whose end result inferred leaks pc world noted practice planting false flags deter attribution new development cyberattacks russian north korean israeli hacker groups among suspected using false flags according study kim zetter intercept umbrage probably much focused speeding development repurposing existing tools rather planting false flags robert graham ceo errata security told intercept source code referenced umbrage documents extremely public likely used multitude groups state actors graham added conclusively say evidence documents 're creating snippets code use projects 're reusing methods code find internet ... elsewhere talk obscuring attacks ca n't see coming concrete plan false flag operation 're trying say 'we 're going make look like russia day vault 7 documents first released wikileaks described umbrage substantial library attack techniques 'stolen malware produced states including russian federation tweeted cia steals groups virus malware facilitating false flag attacks conspiracy theory soon emerged alleging cia framed russian government interfering 2016 u.s. elections conservative commentators sean hannity ann coulter speculated possibility twitter rush limbaugh discussed radio show russian foreign minister sergey lavrov said vault 7 showed cia could get access 'fingerprints use cybersecurity writers ben buchanan kevin poulsen skeptical theories poulsen wrote leaked catalog n't organized country origin specific malware used russian dnc hackers nowhere list documents describe marble framework string obfuscator used hide text fragments malware visual inspection part program foreign languages used cover source cia hacks according wikileaks reached 1.0 2015 used cia throughout 2016 release wikileaks described primary purpose marble insert foreign language text malware mask viruses trojans hacking attacks making difficult tracked cia cause forensic investigators falsely attribute code wrong nation source code revealed marble examples chinese russian korean arabic persian languages us main cyber-adversaries \u2013 china russia north korea iran analysts called wikileaks description marble main purpose inaccurate telling hill main purpose probably avoid detection antivirus programs marble also contained deobfuscator tool cia could reverse text obfuscation security researcher nicholas weaver international computer science institute berkeley told washington post appears one technically damaging leaks ever done wikileaks seems designed directly disrupt ongoing cia operations hammerdrill cd/dvd collection tool collects directory walks files configured directory filename pattern well logging cd/dvd insertion removal events v2.0 adds gap jumping capability trojans 32-bit executables burned disc nero additionally v2.0 adds status termination on-demand collection feature controlled hammerdrillstatus.dll hammerdrillkiller.dll hammerdrillcollector.dll logging also fingerprints discs hashing first two blocks iso image enables unique identification multi-sessions discs even data added removed log also logs anytime hammerdrill trojaned binary seen disc wikileaks released first installment vault 7 year zero apple stated many issues leaked today already patched latest ios company continue work rapidly address identified vulnerabilities 23 march 2017 wikileaks released dark matter second batch documents vault 7 series detailing hacking techniques tools focusing apple products developed embedded development branch edb cia leak also revealed cia targeting iphone since 2008 year device released edb projects attacked apple firmware meaning attack code would persist even device rebooted dark matter archive included documents 2009 2013 apple issued second statement assuring based initial analysis alleged iphone vulnerability affected iphone 3g fixed 2009 iphone 3gs released additionally preliminary assessment showed alleged mac vulnerabilities previously fixed macs launched 2013 wikileaks said 19 march 2017 twitter cia secretly exploiting vulnerability huge range cisco router models discovered thanks vault 7 documents cia learned year ago exploit flaws cisco widely used internet switches direct electronic traffic enable eavesdropping cisco quickly reassigned staff projects turn focus solely analyzing attack figure cia hacking worked could help customers patch systems prevent criminal hackers spies using similar methods 20 march cisco researchers confirmed study vault 7 documents showed cia developed malware could exploit flaw found 318 cisco switch models alter take control network cisco issued warning security risks patches available cisco provided mitigation advice electronic tools reportedly compromise apple ios google android operating systems adding malware android operating system tools could gain access secure communications made device according wikileaks android smartphone penetrated agency collect audio message traffic encryption applied agency software reportedly able gain access messages sent instant messaging services method accessing messages differs obtaining access decrypting already encrypted message encryption messengers offer end-to-end encryption telegram whatsapp signal n't reported cracked encryption bypassed capturing input encryption applied methods keylogging recording touch input user commentators among snowden cryptographer security pundit bruce schneier observed wikileaks incorrectly implied messaging apps underlying encryption compromised implication turn reported period new york times mainstream outlets one document reportedly showed cia researching ways infect vehicle control systems wikileaks stated purpose control specified would permit cia engage nearly undetectable assassinations statement brought renewed attention conspiracy theories surrounding death michael hastings documents refer windows fax dll injection exploit windows xp windows vista windows 7 operating systems would allow user malicious intents hide malware dll another application however computer must already compromised another method injection take place 7 march 2017 edward snowden commented importance release stating reveals united states government developing vulnerabilities us products intentionally keeping holes open considers highly reckless 7 march 2017 nathan white senior legislative manager internet advocacy group access writes 8 march 2017 lee mathews contributor forbes wrote hacking techniques described vault 7 already known many cybersecurity experts 8 march 2017 note revealed techniques tools likely used targeted surveillance revealed edward snowden press conference assange stated leaks content least means engage targeted attacks expensive might trail also stated exposed cia automated implant branch develops uses viruses also automates done may approach level bulk intersection 8 april 2017 ashley gorski american civil liberties union staff attorney called critical understand vulnerabilities exploited government foreign governments cyber criminals around world justin cappos professor computer science engineering department new york university asks government knows problem phone bad guys could use hack phone ability spy weakness use counterterrorism spying capabilities problem fix everyone 8 april 2017 cindy cohn executive director international non-profit digital rights group based san francisco electronic frontier foundation said c.i.a walking past front door saw lock broken least tell maybe even help get fixed worse lost track information kept criminals hostile foreign governments know broken lock furthermore stated cia failed accurately assess risk disclosing vulnerabilities even spy agencies like cia responsibility protect security privacy americans freedom private conversation \u2013 free worry hostile government rogue government agent competitor criminal listening \u2013 central free society strict privacy laws europe fourth amendment us constitution guarantee right free unreasonable searches seizures 12 may 2017 microsoft president chief legal officer brad smith wrote emerging pattern 2017 seen vulnerabilities stored cia show wikileaks words smith expressed concern fact cia stockpiled computer vulnerabilities turn stolen failed inform microsoft timely fashion security breach result privacy security customers around world potentially negatively affected extended period caused widespread damage", + "neighbors": [ + 43, + 91, + 134, + 141, + 158, + 162, + 186, + 232, + 261, + 281, + 290, + 293, + 325, + 376, + 414, + 533, + 550, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 675, + 692, + 708, + 783, + 818, + 842, + 910, + 915, + 961, + 1101, + 1121, + 1138, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1368, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 44, + "label": 1, + "text": "Australian_Heritage_Database:australian heritage database australian heritage database listing heritage sites australia maintained department environment water heritage arts australia consultation australian heritage council twenty thousand entries database includes natural historic indigenous places lists covered database", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 45, + "label": 8, + "text": "Dynata:dynata dynata formerly research global online sampling digital data collection company providing market research insights clients initially founded 1999 dallas texas hal brierley mort meyerson company called e-rewards inc. e-rewards grown fast 100,000 clients months named 2007 inc. magazine one america fastest growing companies december 2009 e-rewards inc. acquired research plc co-founded chris havemann andrew cooper headquartered london england time research publicly listed london stock exchange \u2019 aim market integration process company re-branded globally one name research company went acquire smaller businesses including peanut labs inc. 2010 2015 january 2015 private equity firm court square acquired research group inc. similar time private equity firm hggc acquired majority stake rival market research firm survey sampling international ssi 2017 two pe firms announced would merging two market research firms january 2019 combined research ssi renamed dynata dynata used track online consumer website history look collect data purchasing behavior company also composes proposes surveys users get accurate clarified responses broad-based consumers gathered data company conducts up-to-date market research determine trends occurring around world aside gathering information purchasing behaviors company guarantees protect consumer unauthorized personal data since handheld technology developed become core part society company started look mobile research tools company gives surveys mobile users get idea mobile panel tastes", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 46, + "label": 9, + "text": "Robert_Tappan_Morris:robert tappan morris robert tappan morris born november 8 1965 american computer scientist entrepreneur best known creating morris worm 1988 considered first computer worm internet morris prosecuted releasing worm became first person convicted then-new computer fraud abuse act went co-found online store viaweb one first web-based applications later funding firm combinator\u2014both paul graham later joined faculty department electrical engineering computer science massachusetts institute technology received tenure 2006 elected national academy engineering 2019 morris born 1965 parents robert morris anne farlow morris senior morris computer scientist bell labs helped design multics unix later became chief scientist national computer security center division national security agency nsa morris grew millington section long hill township new jersey graduated delbarton school 1983 morris attended harvard university later went graduate school cornell first year designed computer worm disrupted many computers fledgling internet led indicted year later serving conviction term returned harvard complete ph.d. supervision h.t kung completed ph.d. 1999 morris worm developed 1988 graduate student cornell university released worm mit rather cornell worm exploited several vulnerabilities gain entry targeted systems including worm programmed check computer found determine infection already present however morris believed administrators might try defeat worm instructing computer report false positive compensate possibility morris directed worm copy anyway 14 time matter response infection-status interrogation level persistence design flaw created system loads brought attention system administrators also disrupted target computers ensuing trial estimated cost potential loss productivity caused worm efforts remove different systems ranged 200 53,000 1989 morris indicted violating united states code title 18 computer fraud abuse act first person indicted act december 1990 sentenced three years probation 400 hours community service fine 10,050 plus costs supervision appealed motion rejected following march morris stated motive trial demonstrate inadequacies current security measures computer networks exploiting security defects discovered completed sentence 1994 morris principal research interest computer network architectures includes work distributed hash tables chord wireless mesh networks roofnet longtime friend collaborator paul graham addition founding two companies together graham dedicated book ansi common lisp morris named programming language generates online stores web pages rtml honor graham lists morris one personal heroes saying never wrong", + "neighbors": [ + 27, + 56, + 173, + 194, + 203, + 225, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 379, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 564, + 565, + 601, + 649, + 653, + 693, + 703, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 47, + "label": 9, + "text": "RAMIS_(software):ramis software ramis random access management information system fourth-generation programming language 4gl capable creating maintaining databases consisting named files containing numeric alphabetic fields subsequently producing detailed simple complex reports using simple english like language easily mastered non-programmers typical program either create maintain database create quite complex reports would normally consist handful lines code could written understood non-professional programmers end users became known end users could trained use ramis matter days large companies would often several hundred users scattered throughout company ramis initially developed mid 1960s company mathematica consulting contract marketing study team headed gerald cohen subsequently developed marketed general purpose data management analysis tool late 1960s cohen fell management mathematica left form company shortly thereafter new company released new product called focus similar ramis bugs misspelled error messages national css ncss time-sharing vendor licensed rights make ramis available vp/css system point mathematica changed licensing price interested parties programming team remained mathematica almost sales force time ramis double digits client companies us european division headquartered london mathematica decided create new division called mathematica products group rename product ramis ii time company decided recall frank fish originally mathematica consultant assigned lead european consulting team subsequently formed european ramis group head ramis ii design team international sales sales ramis ii focus continued grow 1980s throughout western world ramis ii generally outselling focus mainframes though detailed figures available ramis ii eventually installed 40 countries worldwide mathematica eventually grew 500 staff roughly 200 involved ramis ii company largely owned group professors mathematics economics princeton university group aged opted cash selling martin marietta corporation subsequently lockheed martin 1983 ramis ii continued grow another 4 years top people ramis ii design sales quit reaction policy changes imposed lockheed martin roughly 2 years later lockheed martin sold ramis ii group another software firm whose background culture different mathematica unable make success product turn sold product another company maintenance revenue 1987 ramis sold on-line software international acquired current owners computer associates time company purchased computer associates ca technologies results ramis syntax described initial timesharing/mainframe product positively accepted initial pc version n't get reception", + "neighbors": [ + 592 + ], + "mask": "Train" + }, + { + "node_id": 48, + "label": 3, + "text": "Nightshade_(1985_video_game):nightshade 1985 video game nightshade action video game developed published ultimate play game first released zx spectrum 1985 ported amstrad cpc bbc micro later year also ported msx exclusively japan 1986 game player assumes role knight sets destroy four demons plague-infested village game features flip-screen isometric gameplay similar vein predecessors knight lore alien 8 addition nightshade features enhanced version ultimate play game filmation game engine branded filmation ii game received positive reviews upon release critics praised gameplay traits graphics colours however one critic divided perceived similarities predecessors game presented isometric format player assumes role knight enters plague-infested village nightshade vanquish four demons reside within additionally residents village transformed vampires supernatural creatures contact monsters infects knight repeated contact turning character white yellow green lead character death knight may hit three times enemy however fourth hit result life deducted objective game locate destroy four specific demons demon vulnerable particular object must collected player hammer bible crucifix hourglass four items collected player must track specific demon cast correct item order destroy four demons destroyed game end order defend enemies vampires monsters player arm antibodies thrown enemies antibodies found houses around village slowly deplete used player collectible items include extra lives boots latter enables player character run faster speed ultimate play game founded brothers tim chris stamper along tim wife carol headquarters ashby-de-la-zouch 1982 began producing multiple video games zx spectrum throughout early 1980s company known reluctance reveal details operations upcoming projects little known development process except used work separate teams one team would work graphics whilst would concentrate aspects sound programming journalist reviewing nightshade crash asked tim chris stamper object game responded oh ca n't tell game developed isometric projection game engine known filmation ii upgraded version filmation engine filmation engine created stamper brothers portray 3d imagery filmation ii used image masking technique drew filled holes background allowing game create composite structures pixelated drawings without visual overlay despite limitations platforms zx spectrum offered nightshade first released united kingdom zx spectrum 1985 ported amstrad cpc bbc micro later year also ported msx exclusively japan 1986 game received positive reviews upon release chris bourne sinclair user praised game new graphics system opining wonderfully detailed juiced contrast predecessors knight lore alien 8 reviewer writing computer video games praised graphics great stated sound effects standard considering dumb zx spectrum philippa irving crash thought visuals use colours stunning ultimate play game usual standards however notice instances attribute clash reviewer writing computer gamer asserted graphics good ever however admitted game seemed lacking comparison ultimate play game recent releases chris jenkins popular computing weekly opined game interior visuals looked like featureless squares however admitted game background drops detailed gameplay also praised reviewers bourne opined game well-paced similar vein arcade-style games however noted sense d\u00e9j\u00e0 vu game concept stating developer games starting wear thin reviewer computer video games appreciated nightshade nice touches summarising instant classic ultimate play game irving criticised lack instructions hints came game stated nightshade set new standards programming unlike knight lore alien 8 however irving admitted game still another technically brilliant game reviewer computer gamer enjoyed wide range gameplay elements stating enough hold attention hours reviewer home computing weekly stated gameplay addictive knight lore alien 8 due game lack obstacles jenkins praised game use new engine filmation ii stating ahead everything else zx spectrum", + "neighbors": [ + 321, + 618, + 822, + 1307, + 1312 + ], + "mask": "Test" + }, + { + "node_id": 49, + "label": 3, + "text": "Bugaboo_(The_Flea):bugaboo flea bugaboo flea later published spain la pulga computer game created 1983 spanish team programmers paco paco zx spectrum later versions commodore 64 amstrad msx produced bugaboo besides first video game made spain one first computer games include cut scenes publication marked official beginning golden era spanish software ported amstrad cpc name roland caves exploit cpc recurring roland character sequel released spain opera soft title poogaboo made paco suarez one authors original game paco portalo member paco paco left project publication original game zx spectrum player takes control flea fallen cavern must escape game begins animation depicting bugaboo small yellow creature two extremely long legs jumping around colourful planet accidentally falling crack planet surface falling bottom cavern player must control bugaboo guide back top cavern safety planet surface two control keys left right key held gauge bottom screen begins fill key released bugaboo jump direction strength jump determined long key held cavern made various rocky ledges bugaboo may land however stand flat area jump mistimed bugaboo may end angled area rock miss ledge altogether cause fall straight landing whatever bugaboo may fall distance without dying way player lose life bugaboo make contact large yellow dragon wanders around cave bugaboo escape dragon carefully leaping away taking refuge inside one smaller caverns located around play area reviews overwhelmingly positive crash giving game 92 computer video games awarding 8/10 game month personal computer games giving 7/10 computer number one january 1984 crash said bugaboo high quality arcade standard game highly addictive game definitely top seller personal computer games said ... like challenge patient though easy get back top computer video games praised game breath-taking graphics perfect animation decided ... fresh original approach game design combined produce yet another top rate game tony hetherington computer gamer magazine included game spectrum collection 15 classic games spectrum owners game popularity spawned creation book 2009 entitled bugaboo un hito en la historia del software espa\u00f1ol francisco portalo calero i.e. paco portalo one original authors game published universidad de extremadura available online", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 50, + "label": 9, + "text": "JavaScript_engine:javascript engine javascript engine computer program executes javascript code first javascript engines mere interpreters relevant modern engines utilize just-in-time compilation improved performance javascript engines typically developed web browser vendors every major browser one browser javascript engine runs concert rendering engine via document object model use javascript engines limited browsers example chrome v8 engine core component popular node.js runtime system since ecmascript standardized specification javascript ecmascript engine another name engines first javascript engine created brendan eich 1995 netscape navigator web browser rudimentary interpreter nascent language eich invented evolved spidermonkey engine still used firefox browser first modern javascript engine v8 created google chrome browser v8 debuted part chrome 2008 performance much better prior engine key innovation just-in-time compilation significantly improve execution times browser vendors needed overhaul interpreters compete apple developed nitro engine safari browser 30 better performance predecessor mozilla leveraged portions nitro improve spidermonkey engine opera replaced interpreter carakan engine twice fast cases since 2017 browsers added support webassembly enables use pre-compiled executables performance-critical portions page scripts javascript engines execute webassembly code sandbox regular javascript code", + "neighbors": [ + 7, + 36, + 69, + 81, + 132, + 176, + 503, + 509, + 593, + 632, + 686, + 716, + 869, + 872, + 959, + 1228, + 1231, + 1264, + 1280, + 1302, + 1372, + 1566 + ], + "mask": "Validation" + }, + { + "node_id": 51, + "label": 3, + "text": "Single_instruction,_multiple_threads:single instruction multiple threads single instruction multiple thread simt execution model used parallel computing single instruction multiple data simd combined multithreading processors say number seem execute many tasks achieved processor multiple threads work-items sequence simd lane operations execute lock-step analogous simd lanes simt execution model implemented several gpus relevant general-purpose computing graphics processing units gpgpu e.g supercomputers combine cpus gpus simt introduced nvidia ati technologies amd released competing product slightly later may 14 2007 terascale 1-based r600 gpu chip access time widespread ram types e.g ddr sdram gddr sdram xdr dram etc still relatively high engineers came idea hide latency inevitably comes memory access strictly latency-hiding feature zero-overhead scheduling implemented modern gpus might might considered property 'simt simt intended limit instruction fetching overhead i.e latency comes memory access used modern gpus nvidia amd combination 'latency hiding enable high-performance execution despite considerable latency memory-access operations processor oversubscribed computation tasks able quickly switch tasks would otherwise wait memory strategy comparable multithreading cpus confused multi-core downside simt execution fact thread-specific control-flow performed using masking leading poor utilization processor threads follow different control-flow paths instance handle else block various threads processor execute different paths threads must actually process paths threads processor always execute lock-step masking used disable enable various threads appropriate masking avoided control flow coherent threads processor i.e follow path execution masking strategy distinguishes simt ordinary simd benefit inexpensive synchronization threads processor", + "neighbors": [ + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 208, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 280, + 300, + 314, + 335, + 340, + 359, + 362, + 375, + 388, + 445, + 457, + 460, + 508, + 589, + 611, + 643, + 659, + 719, + 737, + 752, + 776, + 803, + 821, + 846, + 847, + 907, + 917, + 937, + 946, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1099, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1469, + 1503, + 1505, + 1507, + 1518, + 1525, + 1557, + 1608, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 52, + "label": 5, + "text": "Internet_layer:internet layer internet layer group internetworking methods protocols specifications internet protocol suite used transport network packets originating host across network boundaries necessary destination host specified ip address internet layer derives name function facilitating internetworking concept connecting multiple networks gateways internet layer include protocols fulfill purpose maintaining link states local nodes usually use protocols based framing packets specific link types protocols belong link layer internet-layer protocols use ip-based packets common design aspect internet layer robustness principle liberal accept conservative send misbehaving host deny internet service many users internet layer three basic functions version 4 internet protocol ipv4 transmit receive operations ip capable automatic intentional fragmentation defragmentation packets based example maximum transmission unit mtu link elements however feature dropped ipv6 communications end points hosts perform path mtu discovery assure end-to-end transmissions n't exceed maximum discovered operation internet layer responsible reliable transmission provides unreliable service best effort delivery means network makes guarantees proper arrival packets accordance end-to-end principle change previous protocols used early arpanet since packet delivery across diverse networks inherently unreliable failure-prone operation burden providing reliability placed end points communication path i.e. hosts rather network one reasons resiliency internet individual link failures proven scalability function providing reliability service duty higher level protocols transmission control protocol tcp transport layer ipv4 checksum used protect header datagram checksum ensures information received header accurate however ipv4 attempt detect errors may occurred data packet ipv6 include header checksum instead relying link layer assure data integrity entire packet including checksum primary protocols internet layer internet protocol ip implemented two versions ipv4 ipv6 internet control message protocol icmp primarily used error diagnostic functions different implementations exist ipv4 ipv6 internet group management protocol igmp used ipv4 hosts adjacent ip multicast routers establish multicast group memberships internet protocol security ipsec suite protocols securing ip communications authenticating encrypting ip packet data stream ipsec also includes protocols key exchange ipsec originally designed base specification ipv6 1995 later adapted ipv4 found widespread use securing virtual private networks internet layer tcp/ip model easily compared directly network layer layer 3 open systems interconnection osi protocol stack internet layer often improperly called network layer although overlap two models use different classification methods", + "neighbors": [ + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 813, + 856, + 1099, + 1116, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 53, + "label": 3, + "text": "Opcode:opcode computing opcode abbreviated operation code also known instruction syllable instruction parcel opstring portion machine language instruction specifies operation performed beside opcode instructions also specify data process form operands addition opcodes used instruction set architectures various cpus hardware devices also used abstract computing machines part byte code specifications specifications format opcodes laid instruction set architecture isa processor question may general cpu specialized processing unit opcodes given instruction set described use opcode table detailing possible opcode bytes apart opcode instruction normally also one specifiers operands i.e data operation act although operations may implicit operands none instruction sets nearly uniform fields opcode operand specifiers well others x86 architecture instance complicated variable-length structure instruction sets extended use opcode prefixes add subset new instructions made existing opcodes following reserved byte sequences depending architecture operands may register values values stack memory values i/o ports etc. specified accessed using less complex addressing modes types operations include arithmetics data copying logical operations program control well special instructions cpuid others assembly language assembly low-level programming language uses mnemonics instructions operands represent machine code enhances readability still giving precise control machine instructions programming currently done using high-level programming languages typically easier read write languages need compiled translated assembly language run compiled programs opcodes also found so-called byte codes representations intended software interpreter rather hardware device software-based instruction sets often employ slightly higher-level data types operations hardware counterparts nevertheless constructed along similar lines examples include byte code found java class files interpreted java virtual machine jvm byte code used gnu emacs compiled lisp code .net common intermediate language cil many others", + "neighbors": [ + 78, + 85, + 137, + 165, + 225, + 270, + 331, + 413, + 639, + 643, + 752, + 803, + 919, + 979, + 1044, + 1160, + 1235, + 1319, + 1320, + 1483, + 1558, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 54, + "label": 1, + "text": "VOCEDplus:vocedplus vocedplus free international research database tertiary education maintained developed staff national centre vocational education research ncver adelaide south australia focus database content relation post-compulsory education training workforce needs skills development social inclusion content vocedplus database encompasses vocational education training vet higher education lifelong learning informal learning vet schools adult community education apprenticeships/traineeships international education providers education training workforce development international scope contains 77,000 english language records many links full text documents vocedplus contains extensive australian materials includes wide range international information covering outcomes tertiary education shape published research practice policy statistics entries included following types publications reports annual reports papers discussion papers occasional papers working papers books book chapters conference papers conference proceedings journals journal articles policy documents published statistics theses podcasts teaching training materials database entry contains standard bibliographic information abstract many entries include full text access via publisher website digitised copy early years vocedplus known voced original database produced network clearinghouses across australia aim sharing activities technical education tafe sector voced produced hardcopy electronic version distributed diskette 1997 first web version voced made available national centre vocational education research ncver organisational website 1998 major project upgrade database expand international coverage commenced 2001 creation voced first website 2001 voced endorsed unesco international database technical vocational education training tvet research information many changes database website occurred period focus continuous improvement meet needs users utilise emerging technologies 2006 materials produced two adult literacy learning programs funded australian department education employment workplace relations deewr workplace english language learning well programme adult literacy national project alnp included voced 2007 australian clearinghouse network transferred hardcopy collections ncver form centralised repository resources 2009 materials produced reframing future rtf vocational education training workforce development initiative australian state territory governments included voced major rebuild database website undertaken period take advantage potential new technologies provide improved services incorporate web 2.0 technologies rss feeds share bookmark tools 2009 scope expanded fully encompass higher education sector 2011 launch vocedplus 2012 major retrospective digitisation project commenced end 2012-2013 financial year total 9,328 publications 593,534 pages/microfiche frames digitised ensuring publications available electronically free 2015 release refreshed look adopt new ncver branding plus number search enhancements guided search expert search glossary search added 2015 first series 'focus ... pages released 2016 launch 'pod network convenient efficient platform allows instant access research multitude resources range subjects 2017 completion 'pod network consisting 20 pods broad subjects including apprenticeships traineeships foundation skills teaching learning career development students 74 podlets narrow topics including online learning social media vet schools stem skills adult literacy 2018 launch 'timeline australian vet policy initiatives 1998-2017 'vet knowledge bank contains suite products capturing australia diverse complex ever-changing vet system", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 55, + "label": 6, + "text": "Kernfs_(BSD):kernfs bsd berkeley software distribution bsd descendants kernfs pseudo file system provides access information currently running kernel file system content dynamically generated operating system booted kernfs often mounted directory result nature kernfs consist actual files storage device allowing instead processes retrieve system information accessing virtual files kernfs first appeared 4.4bsd netbsd 6.0 continues use kernfs default mounting canonical mount point", + "neighbors": [ + 1, + 9, + 34, + 37, + 40, + 58, + 63, + 64, + 99, + 134, + 170, + 171, + 187, + 222, + 233, + 278, + 295, + 322, + 326, + 334, + 349, + 358, + 413, + 438, + 465, + 477, + 495, + 524, + 553, + 557, + 558, + 570, + 583, + 664, + 723, + 728, + 754, + 797, + 860, + 887, + 891, + 892, + 900, + 908, + 912, + 922, + 941, + 942, + 961, + 966, + 982, + 997, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1155, + 1157, + 1187, + 1201, + 1202, + 1224, + 1234, + 1252, + 1283, + 1301, + 1322, + 1381, + 1398, + 1415, + 1441, + 1445, + 1459, + 1474, + 1494, + 1530, + 1546, + 1565, + 1578, + 1616, + 1631, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 56, + "label": 9, + "text": "TI_Explorer:ti explorer texas instruments explorer family lisp machine computers computers sold texas instruments 1980s explorer based design lisp machines incorporated based mit lisp machine explorer used development deployment artificial-intelligence software notable also early use nubus system bus explorer computer family explorer used development deployment artificial-intelligence software later models based special 32-bit microprocessor developed texas instruments supported execution lisp software hardware operating system explorer written lisp machine lisp also supported common lisp notable application spike scheduling system hubble space telescope spike developed texas instruments explorer workstations", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 57, + "label": 3, + "text": "Future_Knight:future knight future knight video game released gremlin graphics 1986 several home computer systems space cruiser s.s. rustbucket crashed planet 2749 zragg system passengers taken hostage spegbott terrible minions among princess amelia beloved future knight randolph teleported wreck rustbucket defeat spegbott rescue future knight 2d flip screen platform game player must guide randolph twenty levels hostile robots aliens defeating spegbott rescuing amelia undocumented level editor included spectrum version accessed main menu pressing key combination edit-f-k game reviewed 1990 dragon 158 hartley patricia kirk lesser role computers column part mastertronic mega pack 10 games previously released europe reviewers gave game 1 5 stars stating \u2019 inside spaceship trying find princess distress really dumb game", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 58, + "label": 2, + "text": "OSv:osv osv stylized os cloud computing focused computer operating system released september 16 2013 special-purpose operating system built run guest top virtual machine thus include drivers bare-metal hardware unikernel designed run single linux executable application written one supported runtime environments java reason support notion users multiuser system processes everything runs kernel address space using single address space removes time-consuming operations associated context switching uses large amounts code freebsd operating system particular network stack zfs file system osv managed using rest management api optional command line interface written lua", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 611, + 650, + 664, + 682, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1208, + 1224, + 1278, + 1301, + 1304, + 1318, + 1322, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1538, + 1546, + 1558, + 1578, + 1582, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 59, + "label": 4, + "text": "Watermark_(data_file):watermark data file watermark stored data file refers method ensuring data integrity combines aspects data hashing digital watermarking useful tamper detection though advantages disadvantages typical data hash process input file produce alphanumeric string unique data file file modified one bit changes occur within original file hash process modified file produce different alphanumeric method trusted source calculate hash original data file subscribers verify integrity data subscriber simply compares hash received data file known hash trusted source lead two situations hash hash different hash results systems involved appropriate degree confidence integrity received data hand hash results different conclude received data file altered process common p2p networks example bittorrent protocol part file downloaded data checked hash key known hash check upon result data kept discarded digital watermarking distinctly different data hashing process altering original data file allowing subsequent recovery embedded auxiliary data referred watermark subscriber knowledge watermark recovered determine certain extent whether significant changes occurred within data file depending specific method used recovery embedded auxiliary data robust post-processing lossy compression data file retrieved image provider embed watermark protection purposes process allows tolerance change still maintaining association original image file researchers also developed techniques embed components image within image help identify portions image may contain unauthorized changes even help recovering lost data disadvantage digital watermarking subscriber significantly alter files without sacrificing quality utility data true various files including image data audio data computer code", + "neighbors": [ + 660 + ], + "mask": "Validation" + }, + { + "node_id": 60, + "label": 4, + "text": "Restriction_of_Hazardous_Substances_Directive:restriction hazardous substances directive restriction hazardous substances directive 2002/95/ec rohs 1 short directive restriction use certain hazardous substances electrical electronic equipment adopted february 2003 european union rohs 1 directive took effect 1 july 2006 required enforced became law member state directive restricts exceptions use six hazardous materials manufacture various types electronic electrical equipment closely linked waste electrical electronic equipment directive weee 2002/96/ec sets collection recycling recovery targets electrical goods part legislative initiative solve problem huge amounts toxic electronic waste speech rohs often spelled pronounced refers eu standard unless otherwise qualified european union member state adopt enforcement implementation policies using directive guide rohs often referred lead-free directive restricts use following ten substances dehp bbp dbp dibp added part directive eu 2015/863 published 31 march 2015 pbb pbde flame retardants used several plastics hexavalent chromium used chrome plating chromate coatings primers chromic acid maximum permitted concentrations non-exempt products 0.1 1000 ppm except cadmium limited 0.01 100 ppm weight restrictions homogeneous material product means limits apply weight finished product even component single substance could theoretically separated mechanically \u2014 example sheath cable tinning component lead example radio composed case screws washers circuit board speakers etc screws washers case may made homogenous materials components comprise multiple sub-components many different types material instance circuit board composed bare printed circuit board pcb integrated circuits ic resistors capacitors switches etc switch composed case lever spring contacts pins etc. may made different materials contact might composed copper strip surface coating loudspeaker composed permanent magnet copper wire paper etc everything identified homogeneous material must meet limit turns case made plastic 2,300 ppm 0.23 pbb used flame retardant entire radio would fail requirements directive effort close rohs 1 loopholes may 2006 european commission asked review two currently excluded product categories monitoring control equipment medical devices future inclusion products must fall rohs compliance addition commission entertains requests deadline extensions exclusions substance categories substance location weight new legislation published official journal july 2011 supersedes exemption note batteries included within scope rohs however europe batteries european commission 1991 battery directive 91/157/eec recently increased scope approved form new battery directive version 2003/0282 cod official submitted published eu official journal first battery directive addressed possible trade barrier issues brought disparate european member states implementation new directive explicitly highlights improving protecting environment negative effects waste contained batteries also contains programme ambitious recycling industrial automotive consumer batteries gradually increasing rate manufacturer-provided collection sites 45 2016 also sets limits 5 ppm mercury 20 ppm cadmium batteries except used medical emergency portable power-tool devices though setting quantitative limits quantities lead lead\u2013acid nickel nickel\u2013cadmium batteries cites need restrict substances provide recycling 75 batteries substances also provisions marking batteries symbols regard metal content recycling collection information directive applies equipment defined section weee directive following numeric categories apply apply fixed industrial plant tools compliance responsibility company puts product market defined directive components sub-assemblies responsible product compliance course given fact regulation applied homogeneous material level data substance concentrations needs transferred supply chain final producer ipc standard recently developed published facilitate data exchange ipc-1752 enabled two pdf forms free use rohs applies products eu whether made within eu imported certain exemptions apply updated occasion eu rohs restricted substances used broad array consumer electronics products examples components contained lead include cadmium found many components examples include plastic pigmentation nickel\u2013cadmium nicd batteries cds photocells used night lights mercury used lighting applications automotive switches examples include fluorescent lamps mercury tilt switches rarely used nowadays hexavalent chromium used metal finishes prevent corrosion polybrominated biphenyls diphenyl ethers/oxides used primarily flame retardants rohs efforts reduce hazardous materials electronics motivated part address global issue consumer electronics waste newer technology arrives ever-increasing rate consumers discarding obsolete products sooner ever waste ends landfills countries like china recycled fashion-conscious mobile market 98 million u.s. cell phones took last call 2005 told epa estimates u.s. year 1.5 1.9 million tons computers tvs vcrs monitors cell phones equipment discarded sources electronic waste tallied could total 50 million tons year worldwide according un environment programme american electronics sent offshore countries like ghana west africa guise recycling may harm good adult child workers jobs poisoned heavy metals metals returning u.s. u.s. right shipping large quantities leaded materials china china world major manufacturing center dr. jeffrey weidenhamer says chemistry professor ashland university ohio surprising things coming full circle 're getting contaminated products back addition high-tech waste problem rohs reflects contemporary research past 50 years biological toxicology acknowledges long-term effects low-level chemical exposure populations new testing capable detecting much smaller concentrations environmental toxicants researchers associating exposures neurological developmental reproductive changes rohs environmental laws contrast historical contemporary law seek address acute toxicology direct exposure large amounts toxic substances causing severe injury death united states environmental protection agency epa published life-cycle assessment lca environmental impacts lead-free tin\u2013lead solder used electronic products bar solders lead-free solders considered tin/copper alternative lowest best scores paste solders bismuth/tin/silver lowest impact scores among lead-free alternatives every category except non-renewable resource consumption paste bar solders lead-free solder alternatives lower better lca score toxicity categories tin/lead solder primarily due toxicity lead amount lead leaches printed wiring board assemblies determined leachability study conducted partnership study results providing industry objective analysis life-cycle environmental effects leading candidate alternative lead-free solders allowing industry consider environmental concerns along traditionally evaluated parameters cost performance assessment also allowing industry redirect efforts toward products processes reduce solders environmental footprint including energy consumption releases toxic chemicals potential risks human health environment another life-cycle assessment ikp university stuttgart shows similar results epa study ban concentrations brominated flame retardants bfr 0.1 plastics affected plastics recycling products include recycled plastics become critical know bfr concentration plastics either tracing origins recycled plastics establish bfr concentrations measuring bfr concentrations samples plastics high bfr concentrations costly handle discard whereas plastics levels 0.1 value recyclable materials number analytical techniques rapid measurement bfr concentrations x-ray fluorescence spectroscopy confirm presence bromine br indicate bfr concentration specific molecule ion attachment mass spectrometry iams used measure bfr concentrations plastics bfr ban significantly affected upstream plastic material selection downstream plastic material recycling rohs 2 directive 2011/65/eu evolution original directive became law 21 july 2011 took effect 2 january 2013 addresses substances original directive improving regulatory conditions legal clarity requires periodic re-evaluations facilitate gradual broadening requirements cover additional electronic electrical equipment cables spare parts ce logo indicates compliance rohs 2 declaration conformity detailed see 2012 final report european commission revealed eu member states considered toys scope primary rohs 1 directive 2002/95/ec irrespective whether primary secondary functions using electric currents electromagnetic fields implementation rohs 2 rohs recast directive 2011/65/eu concerned member states comply new regulation key difference recast necessary demonstrate conformity similar way lvd emc directives able show compliance sufficiently detailed files ensuring implemented production criminal offence like ce marking directives mandates production control traceability technical files describes 2 methods achieving presumption conformity directive 2011/65/eu article 16.2 either technical files include test data materials standard accepted official journal directive used currently standard en50581 risk based method reduce amount test data required harmonised standards list rohs2 ojeu c363/6 one consequences requirement demonstrate conformity requirement know exemption use component otherwise possible know compliance product placed market point time product must 'compliant many understand 'compliance varies depending exemptions force quite possible make non-compliant product 'compliant components compliance must calculated day placing market reality means knowing exemption status components using stock old status parts expire date exemptions directive 2011/65/eu article 7.b referring decision 768/2008/ec module internal production control system manage could seen lack diligence criminal prosecution could occur uk instrument 2012 n. 3032 section 39 penalties rohs 2 also dynamic approach exemptions creating automatic expiration exemptions renewed requests industry additionally new substances added controlled list 4 new substances expected controlled 2019 mean greater information control update systems required differences include new responsibilities importers distributors markings improve traceability technical files part nlf directives make supply chain active part policing directive 2011/65/eu articles 7 9 10 recent additional amendment 2017/2102 2011/65 rohs 2 directive 2011/65/eu contains allowance add new materials 4 materials highlighted attention original version amendment 2015/863 adds four additional substances annex ii 2011/65/eu 3/4 new restrictions recommended investigation original directive ref para 10 preamble another reason simple component rohs compliance statements acceptable compliance requirements vary depending date product placed market ref en50581:2012 additional four substances restriction evidence requirements shall applied products placed market 22 july 2019 except exemptions permit stated annex iii. although time writing exemptions exist applied materials four additional substances maximum permitted concentrations non-exempt products 0.1 new substances also listed reach candidate list dehp authorised manufacturing use substance eu annexe xiv reach 80 exemptions quite broad exemptions automatically expire 5 7 years unless renewed according hewlett packard european union gradually narrowing scope expiring many current rohs exemptions addition likely new substance restrictions introduced next several years exemptions medical devices exempt original directive rohs 2 narrowed exemption scope active implantable medical devices category 4h vitro diagnostic devices ivdd medical devices included automotive vehicles exempt category 4f vehicles instead addressed end life vehicles directive directive 2000/53/ec products within scope rohs 2 directive must display ce mark manufacturers name address serial batch number parties needing know detailed compliance information find eu declaration conformity product created manufacturer brand owner responsible design eu representative regulation also requires actors supply chain product importer distributors keep check document well ensuring conformance process followed correct language translation instructions provided manufacturer must keep certain documentation demonstrate conformity known technical file technical records directive requires manufacturer demonstrate conformity use test data materials following harmonised standard en50581:2012 standard time writing regulators may request file likely specific data likely large rohs require specific product labelling many manufacturers adopted compliance marks reduce confusion visual indicators included explicit rohs compliant labels green leaves check marks pb-free markings chinese rohs labels lower case e within circle arrows also imply compliance rohs 2 attempts address issue requiring aforementioned ce mark whose use policed trading standards enforcement agency states permitted indication rohs compliance ce mark closely related weee waste electrical electronic equipment directive became law simultaneously rohs depicts waste-can logo x often accompanies ce mark new substance restrictions considered introduction next years include phthalates brominated flame retardants bfrs chlorinated flame retardants cfrs pvc california passed electronic waste recycling act 2003 ewra law prohibits sale electronic devices 1 january 2007 prohibited sold eu rohs directive across much narrower scope includes lcds crts like covers four heavy metals restricted rohs ewra also restricted material disclosure requirement effective 1 january 2010 california lighting efficiency toxics reduction act applies rohs general purpose lights i.e lamps bulbs tubes electric devices provide functional illumination indoor residential indoor commercial outdoor use us states cities debating whether adopt similar laws several states mercury pbde bans already worldwide standards certification available qc 080000 standard governed national standards authority ireland ensure control hazardous substances industrial applications 2012 sweden chemicals agency kemi electrical safety authority tested 63 consumer electronics products found 12 compliance kemi claims similar testing results prior years eleven products contained prohibited levels lead one polybrominated diphenyl ether flame retardants details seven companies passed swedish prosecutors kemi says levels non-compliance rohs similar previous years remain high rohs environmental standard electronic product developers aware manufacturers find cheaper single bill materials product distributed worldwide instead customising product fit country specific environmental laws therefore develop standards allow strictest allowable substances example ibm forces suppliers complete product content declaration form document compliance environmental standard 'baseline environmental requirements materials parts products ibm logo hardware products thus ibm banned decabde even though formerly rohs exemption material overturned european court 2008 similarly hewlett-packard environmental standard adverse effects product quality reliability plus high cost compliance especially small business cited criticisms directive well early research indicating life cycle benefits lead-free solder versus traditional solder materials mixed criticism earlier came industry resistant change misunderstanding solders soldering processes deliberate misinformation espoused resist perceived non-tariff barrier created european bureaucrats many believe industry stronger experience better understanding science technologies involved one criticism rohs restriction lead cadmium address prolific applications costly electronics industry comply specifically total lead used electronics makes 2 world lead consumption 90 lead used batteries covered battery directive mentioned requires recycling limits use mercury cadmium restrict lead another criticism less 4 lead landfills due electronic components circuit boards approximately 36 due leaded glass cathode ray tube monitors televisions contain 2 kg per screen common lead-free solder systems higher melting point e.g 30 \u00b0c typical difference tin-silver-copper alloys wave soldering temperatures approximately ~255 \u00b0c however temperature typical lead free solders longer wetting times eutectic pb/sn 37:63 solder additionally wetting force typically lower disadvantageous hole filling advantageous situations closely spaced components care must taken selection rohs solders formulations harder less ductility increasing likelihood cracks instead plastic deformation typical lead-containing solders cracks occur due thermal mechanical forces acting components circuit board former common manufacturing latter field rohs solders exhibit advantages disadvantages respects dependent packaging formulation editor conformity magazine wondered 2005 transition lead-free solder would affect long-term reliability electronic devices systems especially applications mission-critical consumer products citing possible breaches due environmental factors like oxidation 2005 farnell/newark inone rohs legislation technical manual cites lead-free solder issues potential reliability concerns addressed annex item 7 rohs directive granting specific exemptions regulation 2010 issues raised directive first implemented 2003 reliability effects less known another potential problem lead-free high tin-based solders may face growth tin whiskers thin strands tin grow make contact adjacent trace developing short circuit historically tin whiskers associated handful failures including nuclear power plant shutdown pacemaker incident pure tin plating used however failures pre-date rohs also involve consumer electronics therefore may employ rohs-restricted substances desired help mitigate potential problems lead-free manufacturers using variety approaches tin-zinc formulations produce non-conducting whiskers formulations reduce growth although halt growth completely circumstances fortunately experience thus far suggests deployed instances rohs compliant products failing due whisker growth dr. ronald lasky dartmouth college reports rohs force 15 months 400b rohs-compliant products produced products field significant numbers tin whisker-related failures reported whisker growth occurs slowly time unpredictable fully understood time may true test efforts whisker growth even observable lead-based solders albeit much smaller scale countries exempted medical telecommunication infrastructure products legislation however may moot point since electronic component manufacturers convert production lines producing lead-free parts conventional parts eutectic tin-lead solder simply available even military aerospace industrial users extent solder involved least partially mitigated many lead-free components compatibility lead-containing solder processes leadframe-based components quad flat packages qfp small outline integrated circuits soic small outline packages sop gull wing leads generally compatible since finish part leads contributes small amount material finished joint however components ball grid arrays bga come lead-free solder balls leadless parts often compatible lead-containing processes de minimis exemptions e.g. micro-businesses economic effect anticipated least attempts mitigating effect made another form economic effect cost product failures switch rohs compliance example tin whiskers responsible 5 failure rate certain components swiss swatch watches 2006 prior july implementation rohs reportedly triggering us 1 billion recall swatch responded applying exemption rohs compliance denied rohs helps reduce damage people environment third-world countries much today high-tech waste ends use lead-free solders components reduces risks electronics industry workers prototype manufacturing operations contact solder paste longer represents health hazard used contrary predictions widespread component failure reduced reliability rohs first anniversary july 2007 passed little fanfare contemporary consumer electronics rohs compliant 2013 millions compliant products use worldwide many electronics companies keep rohs status pages corporate websites example amd website states although lead containing solder completely eliminated applications today amd engineers developed effective technical solutions reduce lead content microprocessors chipsets ensure rohs compliance minimizing costs maintaining product features change fit functional electrical performance specifications quality reliability standards rohs compliant products expected identical compared current packages rohs printed circuit board finishing technologies surpassing traditional formulations fabrication thermal shock solder paste printability contact resistance aluminium wire bonding performance nearing performance attributes properties lead-free solder high temperature resilience used prevent failures harsh field conditions conditions include operating temperatures test cycles range \u221240 \u00b0c +150 \u00b0c severe vibration shock requirements automobile manufacturers turning rohs solutions electronics move engine bay one major differences lead-containing lead-free solder pastes flow solder liquid state lead-containing solder lower surface tension tends move slightly attach exposed metal surfaces touch part liquid solder lead-free solder conversely tends stay place liquid state attaches exposed metal surfaces liquid solder touches lack flow \u2013 typically seen disadvantage lead lower quality electrical connections \u2013 used place components tightly used placed due properties lead-containing solders example motorola reports new rohs wireless device assembly techniques ... enabling smaller thinner lighter unit motorola q phone would possible without new solder lead-free solder allows tighter pad spacing research new alloys technologies allowing companies release rohs products currently exempt compliance e.g computer servers ibm announced rohs solution high lead solder joints thought remain permanent exemption lead-free packaging technology ... offers economical advantages relation traditional bumping processes solder waste reduction use bulk alloys quicker time-to-market products much lower chemical usage rate test measurement vendors national instruments also started produce rohs-compliant products despite devices category exempt rohs directive", + "neighbors": [ + 231, + 420, + 535, + 755 + ], + "mask": "Test" + }, + { + "node_id": 61, + "label": 3, + "text": "Load\u2013store_architecture:load\u2013store architecture computer engineering load\u2013store architecture instruction set architecture divides instructions two categories memory access load store memory registers alu operations occur registers risc instruction set architectures powerpc sparc risc-v arm mips load\u2013store architectures instance load\u2013store approach operands destination add operation must registers differs register\u2013memory architecture example cisc instruction set architecture x86 one operands add operation may memory register earliest example load\u2013store architecture cdc 6600 almost vector processors including many gpus use load\u2013store approach", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 314, + 331, + 335, + 388, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1469, + 1505, + 1507, + 1518, + 1525, + 1557, + 1608, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 62, + "label": 2, + "text": "BlackBerry_Mobile:blackberry mobile blackberry mobile trading name used tcl communication sell blackberry branded devices world markets excluding indonesia india bangladesh sri lanka nepal blackberry limited creator blackberry brand decided 2016 cease competing smartphone market directly focus making security software due tcl communication charge manufacturing distributing designing blackberry-branded devices global market blackberry keyone first device made blackberry mobile brand although partially designed blackberry limited devices made blackberry mobile continue shipped running android along security software provided blackberry limited suite software includes dtek blackberry messenger blackberry hub also software secure boot start-up ensure android system tampered many features comparable blackberry 10 blackberry ltd former flagship operating system early 2000s research motion limited known rim became dominant mobile industry blackberry brand global dominance smartphone industry 2007 rim highest growth blackberry brand afterward slowly lost dominance many consumers moving towards devices like iphone apple samsung galaxy due all-touchscreen form factor later physical qwerty keyboard smartphone became significant feature blackberry brand named rim renamed blackberry limited set new strategy one focusing improving brand blackberry priv launched 2015 first device running android device came full touchscreen qwerty keyboard underneath 2016 blackberry ltd outsourced production tcl manufacture blackberry dtek50 dtek60 later 2016 blackberry announced moving away in-house manufacturing production moving become software security company december 2016 tcl chosen global licensee blackberry brand ces 2017 tcl showed rumored blackberry 'mercury although stating specifications device ahead mobile world congress barcelona spain tcl officially announced device stating official name blackberry keyone device designed blackberry ltd. rather tcl device sold blackberry mobile brand", + "neighbors": [ + 337, + 459, + 927, + 1295, + 1373 + ], + "mask": "Validation" + }, + { + "node_id": 63, + "label": 6, + "text": "OpenZFS:openzfs openzfs umbrella project aimed bringing together individuals companies use zfs file system work improvements aiming well making zfs widely used developed open-source manner openzfs brings together developers illumos linux freebsd macos platforms wide range companies high-level goals project include raising awareness quality utility availability open-source implementations zfs encouraging open communication ongoing efforts toward improving open-source variants zfs ensuring consistent reliability functionality performance distributions zfs illumos derived opensolaris provides upstream source code zfs implementations various differences illumos zfs codebase open-source implementations zfs openzfs strategically reducing existing platform-related differences order ease sharing source code founding members openzfs include matt ahrens one main architects zfs zfs file system originally developed sun microsystems solaris operating system zfs source code released 2005 common development distribution license cddl part opensolaris operating system later ported operating systems environments fsf claimed cddl gpl legal incompatibility 2005 sun implementation zfs file system n't used basis development linux kernel module n't merged linux kernel mainline linux distributions include precompiled kernel module workaround fuse framework allows file systems run userspace used linux separation layer licensing issues effect although set issues include performance penalty however april 2016 release ubuntu 16.04 lts includes cddl-licensed zfs linux kernel module maintained separate project outside linux kernel mainline claiming license compatibility following list key events development zfs various implementations leading creation openzfs umbrella project originally version numbers pool file system incremented new features introduced order designate on-disk file system format available features worked well single entity controlled development zfs versioning scheme still use zfs oracle solaris distributed development model single version number far ideal implementations openzfs would need agree changes on-disk file system format solution selected openzfs introduce feature flags new versioning system tags on-disk format changes unique names supports completely independent format changes format changes depend pool moved used openzfs implementations long feature flags use pool supported implementations openzfs uses pool version 5000 indicate use feature flags pool version unchanging number expected never conflict version numbers used oracle proprietary zfs versions legacy version numbers still exist pool versions 1\u201328 implied pool version 5000 initial proposal use 1000 pool version future on-disk format changes enabled disabled independently via feature flags feature flags exposed pool properties following naming scheme rules example valid property name could shortened pool feature either disabled enabled active state disabled features used on-disk format changes made result features backward-compatible enabled features used on-disk format changes made yet software may make changes time features still backward-compatible active features made backward-incompatible on-disk format changes pool pool feature enabled legacy version pool automatically upgraded 5000 prerequisite features also enabled default new pools created supported features enabled general state feature changed active back enabled undoing way performed on-disk format changes making pool compatible older openzfs implementation however features might possible on-disk format changes associated either features write features read former features openzfs implementation must support capable writing pool supporting features mandatory opening pool read-only mode latter features openzfs implementation must support able read pool open opening pool possible without actually reading example feature adds new on-disk data structure keep track freed datasets openzfs implementation need know data structure access pool read-only mode additionally writing pool features active state possible openzfs implementation support features list feature flags operating systems support available open-zfs.org web site", + "neighbors": [ + 34, + 40, + 55, + 106, + 134, + 195, + 222, + 233, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 438, + 443, + 475, + 477, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 899, + 900, + 901, + 908, + 912, + 922, + 942, + 957, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1301, + 1322, + 1381, + 1415, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 64, + "label": 2, + "text": "MUSIC/SP:music/sp music/sp multi-user system interactive computing/system product originally mcgill university system interactive computing developed mcgill university 1970s early ibm time-sharing system called rax remote access computing system system ran ibm s/360 s/370 4300-series mainframe hardware offered novel features time file access control data compression designed allow academics students create run programs interactively terminals era mainframe computing still done punched cards years development continued system evolved embrace email internet eventually world wide web peak late 1980s 250 universities colleges high school districts used system north south america europe asia file system music/sp file system unique number respects single system-wide file index owner userid file name hashed locate file index file system could located single i/o operation however presented flat file system user lacked directory structure commonly offered dos microsoft windows unix systems 1990 tree-structured directory view file system overlaid bringing system line file systems available default information stored files compressed offered considerable saving disk space file system fairly sophisticated access control scheme allowing owner control could read write append execute file also concept public file visible users private file visible owner version 2.3 even private files listed common library result two users could files name 4.0 limitation removed virtual memory initial versions system provided support virtual memory address translation one active user could reside core memory time swapping disk used time-share different users variable-length timeslice used virtual memory support introduced 1985 allowed multiple users core memory time removed many restrictions size programs could run provided significant performance improvement system performance also improved pre-loading commonly used modules virtual memory startup time could available users simultaneously programming languages system designed support academic computing teaching computer science rich suite programming languages available system nucleus written ibm/370 assembler native applications written fortran system supported waterloo watfiv watbol compilers also provided compilers pascal c pl/i basic apl algol rpg gpss system missing command scripting language rexx ported cms 1984 later 1986 complete user interface written entirely rexx e-mail internet e-mail one major applications music/sp e-mail interface initially provided access local e-mail networks developed expanded provide access bitnet internet based e-mail music/sp direct access internet 1990 university wisconsin wiscnet tcp/ip code ported system allowing system provide access internet services compatibility ibm systems major feature system ability run programs designed run ibm mainstream operating system mvs accomplished using mvs emulator intercepted system calls supervisor call instruction svc level third-party applications ran mode rather write version application music/sp developers would usually start mvs version rebuild run mvs emulation mode since mvs emulation limited subset real thing applications generally ran efficiently music/sp features one major advantage system educational environments use special lines called control cards top file source files supported language could automatically directed appropriate compiler fortran default compiled linked executed compilation linkage execution options also specified control cards simply entering filename command line wide variety terminals supported 1980 including ebcdic-based units using ibm-proprietary protocols asynchronous ascii-based units since terminals connected various types front-end processors per common ibm timesharing practice could therefore function without cpu attention considerable amount time music used variable-length time slices could compute-bound processing reach maximum several seconds per time slice conversely user filled output buffer reached conversational read timeslice would end immediately sim390 emulator runs microsoft windows contains demonstration system music/sp freely available demonstration system also run hercules users run windows", + "neighbors": [ + 1, + 9, + 14, + 22, + 37, + 42, + 55, + 58, + 99, + 134, + 142, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 373, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 891, + 925, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1087, + 1138, + 1155, + 1187, + 1202, + 1217, + 1221, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 65, + "label": 9, + "text": "Ada_(programming_language):ada programming language ada structured statically typed imperative object-oriented high-level computer programming language extended pascal languages built-in language support design-by-contract extremely strong typing explicit concurrency tasks synchronous message passing protected objects non-determinism ada improves code safety maintainability using compiler find errors favor runtime errors ada international standard current version known ada 2012 defined iso/iec 8652:2012 ada originally designed team led french computer scientist jean ichbiah cii honeywell bull contract united states department defense dod 1977 1983 supersede 450 programming languages used dod time ada named ada lovelace 1815\u20131852 credited first computer programmer ada originally targeted embedded real-time systems ada 95 revision designed s. tucker taft intermetrics 1992 1995 improved support systems numerical financial object-oriented programming oop features ada include strong typing modularity mechanisms packages run-time checking parallel processing tasks synchronous message passing protected objects nondeterministic select statements exception handling generics ada 95 added support object-oriented programming including dynamic dispatch syntax ada minimizes choices ways perform basic operations prefers english keywords else symbols || ada uses basic arithmetical operators avoids using symbols code blocks delimited words declare begin end end cases followed identifier block closes e.g. ... end loop ... end loop case conditional blocks avoids dangling else could pair wrong nested if-expression languages like c java ada designed development large software systems ada packages compiled separately ada package specifications package interface also compiled separately without implementation check consistency makes possible detect problems early design phase implementation starts large number compile-time checks supported help avoid bugs would detectable run-time languages would require explicit checks added source code example syntax requires explicitly named closing blocks prevent errors due mismatched end tokens adherence strong typing allows detection many common software errors wrong parameters range violations invalid references mismatched types etc either compile-time otherwise run-time concurrency part language specification compiler cases detect potential deadlocks compilers also commonly check misspelled identifiers visibility packages redundant declarations etc provide warnings useful suggestions fix error ada also supports run-time checks protect access unallocated memory buffer overflow errors range violations off-by-one errors array access errors detectable bugs checks disabled interest runtime efficiency often compiled efficiently also includes facilities help program verification reasons ada widely used critical systems anomaly might lead serious consequences e.g. accidental death injury severe financial loss examples systems ada used include avionics air traffic control railways banking military space technology ada dynamic memory management high-level type-safe ada generic untyped pointers implicitly declare pointer type instead dynamic memory allocation deallocation must take place explicitly declared access types access type associated storage pool handles low-level details memory management programmer either use default storage pool define new ones particularly relevant non-uniform memory access even possible declare several different access types designate type use different storage pools also language provides accessibility checks compile time run time ensures access value outlive type object points though semantics language allow automatic garbage collection inaccessible objects implementations support default would cause unpredictable behaviour real-time systems ada support limited form region-based memory management also creative use storage pools provide limited form automatic garbage collection since destroying storage pool also destroys objects pool double-dash -- resembling em dash denotes comment text comments stop end line prevent unclosed comments accidentally voiding whole sections source code disabling whole block code requires prefixing line column individually -- clearly denoting disabled code column repeated -- page renders experimental dis/re-enablement large blocks drawn process semicolon statement terminator null no-operation statement codice_1 single codice_2 without statement terminate allowed unlike iso standards ada language definition known ada reference manual arm sometimes language reference manual lrm free content thus common reference ada programmers programmers implementing ada compilers apart reference manual also extensive rationale document explains language design use various language constructs document also widely used programmers language revised new rationale document written one notable free software tool used many ada programmers aid writing ada source code gnat programming studio 1970s us department defense dod concerned number different programming languages used embedded computer system projects many obsolete hardware-dependent none supported safe modular programming 1975 working group high order language working group holwg formed intent reduce number finding creating programming language generally suitable department uk ministry defence requirements many iterations beginning original straw man proposal eventual programming language named ada total number high-level programming languages use projects fell 450 1983 37 1996 holwg working group crafted steelman language requirements series documents stating requirements felt programming language satisfy many existing languages formally reviewed team concluded 1977 existing language met specifications requests proposals new programming language issued four contractors hired develop proposals names red intermetrics led benjamin brosgol green cii honeywell bull led jean ichbiah blue softech led john goodenough yellow sri international led jay spitzen april 1978 public scrutiny red green proposals passed next phase may 1979 green proposal designed jean ichbiah cii honeywell bull chosen given name ada\u2014after augusta ada countess lovelace proposal influenced programming language lis ichbiah group developed 1970s preliminary ada reference manual published acm sigplan notices june 1979 military standard reference manual approved december 10 1980 ada lovelace birthday given number mil-std-1815 honor ada lovelace birth year 1981 c. a. r. hoare took advantage turing award speech criticize ada overly complex hence unreliable subsequently seemed recant foreword wrote ada textbook ada attracted much attention programming community whole early days backers others predicted might become dominant language general purpose programming defense-related work ichbiah publicly stated within ten years two programming languages would remain ada lisp early ada compilers struggled implement large complex language compile-time run-time performance tended slow tools primitive compiler vendors expended efforts passing massive language-conformance-testing government-required acvc validation suite required another novel feature ada language effort jargon file dictionary computer hacker slang originating 1975-1983 notes entry ada precisely one might expect given kind endorsement fiat designed committee ... difficult use overall disastrous multi-billion-dollar boondoggle ... ada lovelace ... would almost certainly blanch use name latterly put kindest thing said probably good small language screaming get inside vast elephantine bulk first validated ada implementation nyu ada/ed translator certified april 11 1983 nyu ada/ed implemented high-level set language setl number commercial companies began offering ada compilers associated development tools including alsys telesoft ddc-i advanced computer techniques tartan laboratories tld systems verdix others 1991 us department defense began require use ada ada mandate software though exceptions rule often granted department defense ada mandate effectively removed 1997 dod began embrace cots technology similar requirements existed nato countries ada required nato systems involving command control functions ada mandated preferred language defense-related applications countries sweden germany canada late 1980s early 1990s ada compilers improved performance still barriers full exploitation ada abilities including tasking model different real-time programmers used ada safety-critical support features used military applications also commercial projects software bug severe consequences e.g. avionics air traffic control commercial rockets ariane 4 5 satellites space systems railway transport banking example airplane information management system fly-by-wire system software boeing 777 written ada developed honeywell air transport systems collaboration consultants ddc-i became arguably best-known ada project civilian military canadian automated air traffic system written 1 million lines ada sloc count featured advanced distributed processing distributed ada database object-oriented design ada also used air traffic systems e.g. uk next-generation interim future area control tools support ifacts air traffic control system designed implemented using spark ada also used french tvm in-cab signalling system tgv high-speed rail system metro suburban trains paris london hong kong new york city language became ansi standard 1983 ansi/mil-std 1815a translation french without changes english became iso standard 1987 iso-8652:1987 version language commonly known ada 83 date adoption ansi sometimes referred also ada 87 date adoption iso ada 95 joint iso/ansi standard iso-8652:1995 published february 1995 making ada 95 first iso standard object-oriented programming language help standard revision future acceptance us air force funded development gnat compiler presently gnat compiler part gnu compiler collection work continued improving updating technical content ada programming language technical corrigendum ada 95 published october 2001 major amendment iso/iec 8652:1995/amd 1:2007 published march 9 2007 ada-europe 2012 conference stockholm ada resource association ara ada-europe announced completion design latest version ada programming language submission reference manual international organization standardization iso approval iso/iec 8652:2012 published december 2012 related standards include iso 8651-3:1988 information processing systems\u2014computer graphics\u2014graphical kernel system gks language bindings\u2014part 3 ada ada algol-like programming language featuring control structures reserved words else however ada also many data structuring facilities abstractions included original algol 60 type definitions records pointers enumerations constructs part inherited inspired pascal common example language syntax hello world program ada.text_io use ada.text_io procedure hello begin end hello program compiled using freely available open source compiler gnat executing gnatmake hello.adb ada type system based set predefined primitive types allows users declare types declaration turn based internal representation type describing goal achieved allows compiler determine suitable memory size type check violations type definition compile time run time i.e. range violations buffer overruns type consistency etc. ada supports numerical types defined range modulo types aggregate types records arrays enumeration types access types define reference instance specified type untyped pointers permitted special types provided language task types protected types example date might represented type day_type range 1 .. 31 type month_type range 1 .. 12 type year_type range 1800 .. 2100 type hours mod 24 type weekday monday tuesday wednesday thursday friday saturday sunday type date types refined declaring subtypes subtype working_hours hours range 0 .. 12 -- 12 hours work day subtype working_day weekday range monday .. friday -- days work work_load constant array working_day working_hours -- implicit type declaration types modifiers limited abstract private etc private types accessed limited types modified copied within scope package defines ada 95 adds additional features object-oriented extension types ada structured programming language meaning flow control structured standard statements standard constructs deep-level early exit supported use also supported go commands seldom needed -- equal b loop /= b loop end loop b else end 1 .. 10 loop end loop loop end loop case end case aweekday weekday'range loop -- loop enumeration end loop among parts ada program packages procedures functions example package specification example.ads package example end example package body example.adb ada.text_io package body example -- package initialization executed package elaborated begin end example program compiled e.g. using freely available open-source compiler gnat executing gnatmake -z example.adb packages procedures functions nest depth also logical outermost block package procedure function declarations constants types variables procedures functions packages declared order ada language support task-based concurrency fundamental concurrent unit ada task built-in limited type tasks specified two parts \u2013 task declaration defines task interface similar type declaration task body specifies implementation task depending implementation ada tasks either mapped operating system threads processes scheduled internally ada runtime tasks entries synchronisation form synchronous message passing task entries declared task specification task entry one accept statements within task body control flow task reaches accept statement task blocked corresponding entry called another task similarly calling task blocked called task reaches corresponding accept statement task entries parameters similar procedures allowing tasks synchronously exchange data conjunction select statements possible define guards accept statements similar dijkstra guarded commands ada also offers protected objects mutual exclusion protected objects monitor-like construct use guards instead conditional variables signaling similar conditional critical regions protected objects combine data encapsulation safe mutual exclusion monitors entry guards conditional critical regions main advantage classical monitors conditional variables required signaling avoiding potential deadlocks due incorrect locking semantics like tasks protected object built-in limited type also declaration part body protected object consists encapsulated private data accessed within protected object procedures functions entries guaranteed mutually exclusive exception functions required side effect free therefore run concurrently functions task calling protected object blocked another task currently executing inside protected object released task leaves protected object blocked tasks queued protected object ordered time arrival protected object entries similar procedures additionally guards guard evaluates false calling task blocked added queue entry another task admitted protected object task currently executing inside protected object guards re-evaluated whenever task leaves protected object time evaluation guards changed calls entries requeued entries signature task requeued blocked added queue target entry means protected object released allows admission another task select statement ada used implement non-blocking entry calls accepts non-deterministic selection entries also guards time-outs aborts following example illustrates concepts concurrent programming ada ada.text_io use ada.text_io procedure traffic begin end traffic pragma compiler directive conveys information compiler allow specific manipulation compiled output certain pragmas built language others implementation-specific examples common usage compiler pragmas would disable certain features run-time type checking array subscript boundary checking instruct compiler insert object code instead function call c/c++ inline functions", + "neighbors": [ + 19, + 78, + 134, + 152, + 216, + 225, + 249, + 292, + 306, + 308, + 347, + 373, + 412, + 509, + 538, + 544, + 567, + 579, + 594, + 597, + 682, + 704, + 782, + 790, + 796, + 805, + 819, + 820, + 825, + 873, + 919, + 941, + 948, + 1028, + 1088, + 1118, + 1120, + 1138, + 1152, + 1221, + 1225, + 1227, + 1235, + 1311, + 1319, + 1324, + 1388, + 1437, + 1457, + 1477, + 1532, + 1538, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 66, + "label": 2, + "text": "Action_Center:action center action center notification center included windows phone 8.1 windows 10 windows 10 mobile first introduced windows phone 8.1 july 2014 introduced desktop launch windows 10 july 29 2015 action center replaces charms windows 10 action center allows four quick settings windows 10 users expand view show quick settings notifications sorted categories app users swipe right clear notifications action center also supports actionable notifications starting windows 10 mobile version user swipe top bottom invoke action center features introduced windows phone 8.1 include ability change simple settings volume controls new notifications area design allows user example change wireless networks turn bluetooth airplane mode access driving mode four customisable boxes top screen beneath four horizontally placed boxes include recent text messages social integration desktop version user invoke action center clicking icon taskbar lower right corner screen swiping right microsoft announced microsoft build 2016 cortana would able mirror notifications actions centers windows 10 mobile windows 10 cortana would also able synchronize notifications android devices windows 10 action center", + "neighbors": [ + 26, + 79, + 93, + 111, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1001, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 67, + "label": 8, + "text": "Aviary_(image_editor):aviary image editor aviary photo-editing platform ios android windows web web application aviary powers numerous mobile applications including self-titled ios android apps windows app called photo editor contains large collection easy-to-use editing tools custom photo filters frames graphics overlays aviary platform also free sdk provides developers customizable photo editor embedded apps ios android windows os x web company founded 2007 goal providing professional-quality photo-editing tools general public aviary since received millions dollars funding investors spark capital bezos september 22 2014 aviary acquired adobe systems later november 13 2014 aviary integrated suite adobe creative cloud december 2018 adobe announced remove aviary download stores end support product", + "neighbors": [ + 1061, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 68, + "label": 7, + "text": "Jem_The_Bee:jem bee jem bee java cloud-aware application implements batch execution environment help manage execution jobs described job control language jcl jem bee performs following functions core applications usually performed batch processing involves executing one batch jobs sequential flow job entry manager jem helps receive jobs schedule processing determine job output processed like ibm jes2 many batch jobs run parallel jcl used control operation job correct use jcl parameters allows parallel asynchronous execution jobs may need access data sets one goal jem process work making best use system resources achieve goal resource management needed key phases jem clustering based hazelcast cluster member called node rights responsibilities others exception oldest member going see details hazelcast implements peer-to-peer clustering master node node starts checks see already cluster network two ways find cluster found node first member cluster multicast enabled starts multicast listener respond incoming join requests otherwise listen join request coming via tcp/ip existing cluster already oldest member cluster receive join request checks request right group oldest member cluster start join process join process oldest member every member cluster member list order first member oldest member oldest member dies second member list becomes first member list new oldest member oldest member considered jem cluster coordinator execute actions must executed single member i.e locks releasing due member crash aside normal nodes another kind nodes cluster called supernodes supernode lite member hazelcast supernodes members storage join cluster lite members data partition data nodes get super fast access cluster like regular member nodes used web application running apache tomcat well application server diagram various nodes statuses execution environment set logical definition related cluster must used address job right member executed jem implements 3 kinds coordinates used tags named node belongs jcl defined run jem manages several queues used maintain life-cycle job queues implemented using hazelcast data sharing explanation job moved output queue submitter receive job ended notification via topic addition memory data sharing one important requirements jem use global file system gfs main goal able store data common file system jobs could manage reading writing nevertheless gfs mandatory desire data spread machines configuring jem separate environment specific domains affinities anyway gfs suggested used put keys keystores encryption licenses used jem following folders configured paths mount shared file system may different shared file systems one path needed nodes cluster refers files way avoid redundancy always date relative libraries versions binary versions etc ... documentation referred jem gfs global file system referring paths", + "neighbors": [ + 272, + 438, + 528, + 611, + 847 + ], + "mask": "Validation" + }, + { + "node_id": 69, + "label": 9, + "text": "List_of_ECMAScript_engines:list ecmascript engines ecmascript engine program executes source code written version ecmascript language standard example javascript new generation ecmascript engines web browsers implementing just-in-time compilation jit variations idea performance benefits just-in-time compilation make much suitable web applications written javascript", + "neighbors": [ + 7, + 36, + 50, + 81, + 132, + 176, + 473, + 509, + 593, + 632, + 686, + 716, + 869, + 872, + 959, + 1228, + 1231, + 1264, + 1280, + 1302, + 1413, + 1566 + ], + "mask": "Test" + }, + { + "node_id": 70, + "label": 3, + "text": "SPARCstation_ZX:sparcstation zx sparcstation zx computer workstation produced sun microsystems launched august 1993 end-of-lifed march 1994 original price usd 19,995.00 sparcstation zx identical sparcstation lx addition sun zx also known leo accelerated 3d framebuffer card double-width double-decked sbus card providing 24-bit color performance 750,000 3d vectors per second 310,000 triangle mesh/second", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 71, + "label": 2, + "text": "IPad_(4th_generation):ipad 4th generation fourth-generation ipad marketed ipad retina display colloquially referred ipad 4 tablet computer produced marketed apple inc compared predecessor third-generation ipad fourth-generation ipad maintained retina display featured new upgraded components apple a6x chip lightning connector introduced september 12 2012 shipped ios 6.0 provides platform audio-visual media including electronic books periodicals films music computer games presentations web content like ipad 2 third-generation ipad supported five major ios releases case ios 6 7 8 9 10. ios 11 released 19 september 2017 support fourth-generation ipad ios 11 drops support 32-bit devices announced media conference october 23 2012 fourth generation ipad line first released november 2 2012 35 countries december ten countries including china india brazil third generation discontinued following fourth announcement seven months general availability device available either black white front glass panel various connectivity storage options storage size options include 16 gb 32 gb 64 gb 128 gb available connectivity options wi-fi wi-fi cellular lte capabilities fourth-generation ipad received primarily positive reviews praised hardware improvements well retina display also featured device predecessor furthermore benchmarks reveal fourth-generation ipad able perform cpu-reliant tasks twice fast predecessor first weekend sales aggregated amount 3 million fourth-generation ipads ipad minis sold rumors regarding next-generation ipad emerged shortly release third-generation ipad point speculated next ipad released would smaller size speculations emerged july 2012 digitimes help unspecified sources claimed apple made small revisions upcoming ipad scheduled release late 2012 october 16 2012 apple announced media event scheduled october 23 california theatre san jose california company pre-disclose subject event widely expected regarding ipad mini photographic images device dock connector front camera emerged shortly media event media event apple ceo tim cook introduced new version ibooks new generations macbook pro mac mini imac unveiling fourth-generation ipad lower-end ipad mini unveiling apple stated fourth-generation ipad would available pre-order online selected number countries starting october 26 november 2 apple released wi-fi model device 35 countries across europe east asia north america cellular model released in-store weeks initial release device release fourth-generation ipad led discontinuation predecessor angered many third-generation ipad users response apple extended 14-day return policy 30 days itproportal noted since price models identical consumers purchased third-generation ipad within time frame effectively allowed exchange discontinued device fourth-generation model january 29 2013 apple announced scheduled launch 128 gb variant 4th generation ipad released february 5 2013 following announcement ipad air october 22 2013 sales fourth-generation ipad discontinued fourth-generation ipad reintroduced march 18 2014 following discontinuation ipad 2 order make reintroduction low-end device ipad air price cut 20 original launch price october 16 2014 fourth-generation ipad discontinued favor ipad air 2 ipad air took place entry-level ipad time fourth-generation ipad shipped ios 6.0 later ios 7 act hotspot carriers sharing internet connection wi-fi bluetooth usb also access apple app store digital application distribution platform ios service allows users browse download applications itunes store developed xcode ios sdk published apple app store garageband imovie iphoto iwork apps pages keynote numbers available ipad comes several pre-installed applications including siri safari mail photos video music itunes app store maps notes calendar game center photo booth contacts like ios devices ipad sync content data mac pc using itunes although ios 5 later managed backed without computer although tablet designed make phone calls cellular network users use headset built-in speaker microphone place phone calls wi-fi cellular using voip application skype device dictation application using voice recognition technology iphone 4s user speaks ipad types say screen though ipad must internet connection available via wi-fi cellular network due feature reliance apple servers translate speech fourth-generation ipad optional ibooks application displays books epub-format content downloaded ibookstore several major book publishers including penguin books harpercollins simon schuster macmillan committed publishing books device despite direct competitor amazon kindle barnes noble nook amazon.com barnes noble offer e-reader apps ipad 4th generation ipad unlike immediate predecessor 3rd generation ipad supported ios 10 however announced apple wwdc 2017 4th generation ipad along iphone 5/5c support ios 11. ios 10.3.3 latest final version ios include support wifi models devices ios 10.3.4 latest final version ios include support cellular models devices device apple a6x soc comprises 32-bit apple dual-core cpu running 1.4 ghz quad-core powervr sgx554mp4 gpu 1 gb ram also features 5-megapixel rear-facing camera capable 1080p video recording 720p hd front-facing videophone camera designed facetime device features 9.7 diagonal display resolution 2,048 1,536 qxga resulting 3.1 million pixels gives display pixel density 264 ppi total number pixels used display fourth-generation ipad four times ipad 2 \u2013 providing even scaling prior model previous generations iphone ipad hardware four buttons one switch fourth-generation ipad device portrait orientation home button face device display returns user home screen wake/sleep button top edge device two buttons upper right side device performing volume up/down functions switch whose function varies according device settings generally functioning either switch device silent mode lock/unlock orientation screen externally fourth-generation ipad identical predecessor apart differences dock connectors used change manufacturers produce display addition wi-fi version weighs 652 grams cellular model weighs 662 grams \u2013 2 grams heavier respective predecessors display responds sensors ambient light sensor adjust screen brightness 3-axis accelerometer sense orientation switch portrait landscape modes unlike iphone ipod touch built-in applications work three orientations portrait landscape-left landscape-right ipad built-in applications support screen rotation four orientations including upside-down consequently device intrinsic native orientation relative position home button changes tablet manufactured either without capability communicate cellular network models connect wireless lan via wi-fi fourth-generation ipad available 16 32 64 128 gb internal flash memory expansion option apple sells camera connection kit sd card reader used transfer photos videos audio playback fourth-generation ipad frequency response 20 hz 20,000 hz without third-party software play following audio formats he-aac aac protected aac mp3 mp3 vbr audible formats 2 3 4 aea aax aax+ alac aiff wav ipad uses internal rechargeable lithium-ion polymer lipo battery hold charge 11,560 mah batteries made taiwan simplo technology 60 dynapack international technology 40 ipad designed charged relatively high current 2 amps using included 12 w usb power adapter lightning connector charged older usb port computer limited 500 milliamps 0.5 amps result ipad use powered computer may charge slowly high-power usb ports found newer computers accessories provide full charging capabilities apple claims battery provide 10 hours video audio playback web surfing wi-fi 9 hours web surfing cellular connection one month standby like rechargeable battery ipad battery loses capacity time however ipad battery user-replaceable program similar ipod iphone battery-replacement programs apple promised replace ipad hold electrical charge refurbished unit fee battery replacement process user data preserved/transferred repaired refurbished units come new case warranty refurbished unit may vary jurisdictions smart cover introduced ipad 2 screen protector magnetically attaches face ipad cover three folds allow convert stand also held together magnets smart cover also assume positions folding smart covers microfiber bottom cleans front ipad wakes unit cover removed comes five colors polyurethane expensive leather apple offers several accessories adapters proprietary lightning connector port besides headphone jack dock holds ipad angle dock connector audio line-out port ipad use bluetooth keyboards also work macs pcs ipad charged standalone power adapter wall charger compatible ipods iphones 12 watt charger included fourth-generation ipad received primarily favorable reviews critics commentators review gareth beavis techradar praised device high resolution retina display techradar wrote ... one impressive 've seen tablet date however reviewer also wrote screen lacks 'punch seen super amoled screens seen devices like samsung galaxy note 2 review also praised interface ipad simple design easy use layout additionally aspects design ipad updated soc noted praised review critically beavis noted ipad still moderately heat medium usage however extent seen third-generation ipad tim stevens engadget praised retina display labelled best screen available tablets benchmarks tests conducted engadget resulted stevens concluding fourth-generation ipad fastest apple mobile device available surpassing record iphone 5 held brief period benchmark tests conducted slashgear concluded soc fourth-generation ipad able perform cpu-reliant tasks twice fast third-generation ipad series benchmark tests conducted graphics performance fourth-generation ipad anandtech resulted device achieving highest score compared consumer mobile devices including samsung galaxy iii nexus 10 third-generation ipad performance increase fourth-generation ipad varies tests however increase nonetheless evident furthermore battery longevity tests conducted organization suggests battery fourth-generation ipad able last longer predecessor however battery updated ipad 2 able outlast fourth-generation ipad first weekend sales ipad mini fourth-generation ipad apple reported sold aggregated number 3 million units techradar noted first weekend sales figures fourth-generation ipad lower corresponding figures third-generation ipad sold 3 million units first weekend subsequent reports analysis david hsieh technology analyst suggest ipad mini selling better fourth-generation ipad despite noted slump sales apple stock price direct response figures released rose 1.4 584.62 november 5 repairability review conducted ifixit fourth-generation ipad scored 2 10 10 easiest repair due use adhesive attach components however reviewers noted several components screen battery could removed easily replacement", + "neighbors": [ + 33, + 75, + 99, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1503, + 1507, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 72, + "label": 0, + "text": "DiShIn:dishin described dishin disjunctive shared information method calculate shared information content complementing value informative common ancestor mica disjunctive ancestors exploring multiple inheritance ontology shared information content two terms ontology information science popular technique measure semantic similarity.. dishin re-defines shared information content two concepts average disjunctive ancestors assuming ancestor disjunctive difference number distinct paths concepts different informative ancestor words disjunctive ancestor informative ancestor representing given set parallel interpretations dishin improvement grasm terms computational efficiency management parallel interpretations example palladium platinum silver gold considered precious metals silver gold copper considered coinage metals thus calculating semantic similarity platinum gold dishin starts calculating number paths difference common ancestors metal two paths gold one platinum path difference one precious one path concept path difference zero since path difference distinct common ancestors metal precious considered disjunctive common ancestors calculating semantic similarity platinum palladium dishin starts calculating number paths difference common ancestors metal precious one path concept path difference zero common ancestors thus common ancestor precious informative considered disjunctive common ancestor given node-based semantic similarity measures proportional average information content common disjunctive ancestors metal precious case platinum gold precious case platinum palladium means dishin palladium platinum similar platinum gold calculating semantic similarity silver gold dishin starts calculating number paths difference common ancestors case platinum palladium common ancestors path difference zero since silver gold share relationships therefore parallel interpretations thus informative common ancestor precious coinage considered disjunctive common ancestor means dishin similarity silver gold greater equal similarity pair leaf concepts thus dishin penalize parallel interpretations grasm", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 73, + "label": 1, + "text": "Circumpolar_Health_Bibliographic_Database:circumpolar health bibliographic database circumpolar health bibliographic database chbd free electronic database abstracts citations geographic subject indexing library codes links full text publications peer-reviewed gray literature established 2007 contains sixty five hundred records describe human health circumpolar region chbd circumpolar chronic disease prevention project canadian institutes health research maintained university calgary calgary alberta canada chbd initially constructed records arctic institute north america database mainly northern canadian records expected take several years add non-canadian records chbd circumpolar health observatory proposed may 2008 norway would disseminate data chbd funding database increased 50 period 2008-2009", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 74, + "label": 4, + "text": "Fiddler_(software):fiddler software fiddler http debugging proxy server application originally written eric lawrence formerly program manager internet explorer development team microsoft fiddler captures http https traffic logs user review logging performed implementing man-in-the-middle interception using self-signed certificates 6 october 2003 eric lawrence released first official version fiddler 12 september 2012 fiddler acquired telerik lawrence joined company work fiddler full-time basis 23 december 2015 lawrence left telerik google chrome security team telerik continued develop fiddler june 2018 lawrence returned microsoft principal program manager", + "neighbors": [ + 134, + 138, + 160, + 319, + 329, + 521, + 678, + 684, + 692, + 1138, + 1337 + ], + "mask": "Test" + }, + { + "node_id": 75, + "label": 2, + "text": "IPhone_3G:iphone 3g iphone 3g smartphone designed marketed apple inc. second generation iphone successor original iphone introduced june 9 2008 wwdc 2008 moscone center san francisco united states iphone 3g internally similar predecessor included several new hardware features gps 3g data tri-band umts/hsdpa device originally loaded concurrently launched iphone os 2.0 addition features including push email turn-by-turn navigation new operating system introduced app storeapple new distribution platform third-party applications july 11 2008 apple released iphone 3g across twenty-two countries two storage options 8gb 16gb 16gb model produced either black white following release successor iphone 3gs model one year later iphone 3g remained sale became apple budget phone offer price cut half 99 iphone 3g required two-year contract available black 8 gb storage came bundled then-new iphone os 3.0 firmware june 7 2010 iphone 3g finally discontinued replaced apple budget phone 8gb iphone 3gs selling price 99 2-year contract iphone 3g came preloaded latest version iphone os continued receive updates software two years major iterations released annual basis however phone access decreasing proportion new features update hardware became superseded later models launched iphone 3g came preloaded iphone os 2.0 introduced app store microsoft exchange activesync support apple \u2019 mobileme service push email support along new features bug fixes june 2009 iphone 3g users received iphone os 3.0 software update introduced long-awaited mms feature copy paste landscape support applications bluetooth stereo support improvements june 2010 apple released ios 4.0 software update unlike successor models iphone 3g support prominent features ios 4.0 multitasking ability set home screen wallpaper bluetooth keyboard support however provide access unified mailbox feature homescreen folders better organize apps playlist creation enhancements update widely criticized slow performance iphone 3g though september 2010 ios 4.1 release resolved problem however unlike modern ios devices update provide iphone 3g owners access important features case game center application november 22 2010 iphone 3g received ios 4.2 software update ios 4.2.1 introduced features youtube voting security fixes however iphone 3g unable use many features included update airplay safari text search last ios release support iphone model ios 4.3 later compatible iphone model due hardware limitations performance issues iphone 3g back featured redesigned polycarbonate plastic housing replacing aluminum back first generation buttons changed plastic metal edges phone tapered providing better grip iphone 3g introduced first official color options outer casing 16gb version available black white dimensions iphone 3g marginally larger original iphone high wide deep compared predecessor high wide deep iphone 3g sported capacitive touchscreen 480\u00d7320 hvga resolution 163 ppi scratch-resistant glass sits top display like original iphone touchscreen designed bare finger multiple fingers multi-touch sensing device featured sensors predecessor proximity sensor deactivates display calls face near repositioned save battery power prevent inadvertent inputs user \u2019 face ears ambient light sensor included adjust display brightness different lighting conditions helps save battery power 3-axis accelerometer included sense orientation phone change screen accordingly allowing user easily switch portrait landscape mode iphone 3g internal hardware based original iphone still includes samsung 32-bit risc arm11 620 mhz processor underclocked 412 mhz powervr mbx lite 3d gpu 128 mb package package pop dram rear device iphone 3g features fixed-focus 2.0 megapixel camera predecessor camera optical zoom flash autofocus native video recording although various applications became available allow video recording device iphone 3g operating system supports geotagging photographs addition edge iphone 3g supports assisted gps 3g data tri-band umts/hsdpa enhancements allow faster data downloads turn-by-turn navigation maps compared previous devices like predecessor iphone 3g features proprietary 30-pin dock connector charging device also used synchronize device computer connect various accessories iphone 3g features flush-mounted 3.5 mm headphone jack instead recessed headphone jack included original iphone could therefore used headphones provided apple iphone 3g features internal rechargeable battery rated 1150 mah like predecessor user-replaceable apple stated iphone 3g \u2019 battery capable providing six hours web browsing via wi-fi five hours via 3g 25 hours audio playback alternatively said provide 300 hours standby time walt mossberg wall street journal described device capable version already excellent device however said hidden costs ios 4 still compatible iphone 3g released june 21 2010 article wall street journal digits column july 28 2010 reported iphone 3g phones updating ios 4 responded slowly diminished battery life became excessively hot", + "neighbors": [ + 33, + 71, + 99, + 112, + 130, + 162, + 214, + 228, + 252, + 269, + 270, + 337, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1140, + 1178, + 1237, + 1262, + 1292, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1503, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 76, + "label": 3, + "text": "Load\u2013store_unit:load\u2013store unit computer engineering load\u2013store unit lsu specialized execution unit responsible executing load store instructions generating virtual addresses load store operations loading data memory storing back memory registers load\u2013store unit usually includes queue acts waiting area memory instructions unit operates independently processor units load\u2013store units may also used vector processing cases term load\u2013store vector may used load-store units also capable executing simple fixed-point and/or integer operations", + "neighbors": [ + 51, + 61, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 77, + "label": 7, + "text": "Software_as_a_service:software service software service saas software licensing delivery model software licensed subscription basis centrally hosted sometimes referred on-demand software formerly referred software plus services microsoft saas typically accessed users using thin client e.g via web browser saas become common delivery model many business applications including office software messaging software payroll processing software dbms software management software cad software development software gamification virtualization accounting collaboration customer relationship management crm management information systems mis enterprise resource planning erp invoicing human resource management hrm talent acquisition learning management systems content management cm geographic information systems gis service desk management saas incorporated strategy nearly leading enterprise software companies according gartner estimate saas sales 2018 expected grow 23 72 billion saas applications also known web-based software on-demand software hosted software term software service saas considered part nomenclature cloud computing along infrastructure service iaas platform service paas desktop service daas managed software service msaas mobile backend service mbaas information technology management service itmaas centralized hosting business applications dates back 1960s starting decade ibm mainframe providers conducted service bureau business often referred time-sharing utility computing services included offering computing power database storage banks large organizations worldwide data centers expansion internet 1990s brought new class centralized computing called application service providers asp asps provided businesses service hosting managing specialized business applications goal reducing costs central administration solution provider specialization particular business application two world pioneers largest asps usi headquartered washington dc area futurelink corporation headquartered irvine california software service essentially extends idea asp model term software service saas however commonly used specific settings acronym first appeared goods services description uspto trademark filed september 23 1985 dbaas database service emerged sub-variety saas type cloud database cloud saas model physical need indirect distribution distributed physically deployed almost instantaneously thereby negating need traditional partners middlemen however market grown saas managed service players forced try redefine role unlike traditional software conventionally sold perpetual license up-front cost optional ongoing support fee saas providers generally price applications using subscription fee commonly monthly fee annual fee consequently initial setup cost saas typically lower equivalent enterprise software saas vendors typically price applications based usage parameters number users using application however saas environment customers data reside saas vendor opportunities also exist charge per transaction event unit value number processors required relatively low cost user provisioning i.e. setting new customer multitenant environment enables saas vendors offer applications using freemium model model free service made available limited functionality scope fees charged enhanced functionality larger scope saas applications completely free users revenue derived alternative sources advertising key driver saas growth saas vendors ability provide price competitive on-premises software consistent traditional rationale outsourcing systems involves applying economies scale application operation i.e. outside service provider may able offer better cheaper reliable applications vast majority saas solutions based multitenant architecture model single version application single configuration hardware network operating system used customers tenants support scalability application installed multiple machines called horizontal scaling cases second version application set offer select group customers access pre-release versions applications e.g. beta version testing purposes contrasted traditional software multiple physical copies software \u2014 potentially different version potentially different configuration often customized \u2014 installed across various customer sites traditional model version application based unique code although exception rather norm saas solutions use multitenancy use mechanisms\u2014such virtualization\u2014to cost-effectively manage large number customers place multitenancy whether multitenancy necessary component software service topic controversy two main varieties saas although software-as-a-service applications share traits characteristics common among many saas applications saas applications similarly support traditionally known application configuration words like traditional enterprise software single customer alter set configuration options a.k.a parameters affect functionality look-and-feel customer may settings parameter values configuration options application customized degree designed based set predefined configuration options example support customers common need change application look-and-feel application appears customer brand or\u2014if desired\u2014co-branded many saas applications let customers provide self service interface working application provider staff custom logo sometimes set custom colors customer however change page layout unless option designed saas applications often updated frequently traditional software many cases weekly monthly basis enabled several factors accelerated feature delivery enabled agile software development methodologies methodologies evolved mid-1990s provide set software development tools practices support frequent software releases saas applications access company internal systems databases internal services predominantly offer integration protocols application programming interfaces apis operate wide area network typically protocols based http rest soap ubiquity saas applications internet services standardization api technology spawned development mashups lightweight applications combine data presentation functionality multiple services creating compound service mashups differentiate saas applications on-premises software latter easily integrated outside company firewall inspired success online social networks so-called web 2.0 functionality many saas applications offer features let users collaborate share information example many project management applications delivered saas model offer\u2014in addition traditional project planning functionality\u2014collaboration features letting users comment tasks plans share documents within outside organization several saas applications let users vote offer new feature ideas although collaboration-related functionality also integrated on-premises software implicit explicit collaboration users different customers possible centrally hosted software opensaas refers software service saas based open source code similar saas applications open saas web-based application hosted supported maintained service provider roadmap open saas applications defined community users upgrades product enhancements managed central provider term coined 2011 dries buytaert creator drupal content management framework andrew hoppin former chief information officer new york state senate vocal advocate opensaas government calling future government innovation points wordpress unified successful example opensaas software delivery model gives customers best worlds options fact open source means start building websites self-hosting wordpress customizing website heart \u2019 content concurrently fact wordpress saas means \u2019 manage website -- simply pay wordpress.com host drupal gardens free web hosting platform based open source drupal content management system offers another example forbes contributor dan woods calls new open source model saas according woods open source provides escape hatch drupal gardens users able press button get source code version drupal code runs site along data database take code put one hosting companies anything would like several important changes software market technology landscape facilitated acceptance growth saas solutions limitations slow acceptance saas prohibit used cases standard model also limitations engineering simulation software traditionally delivered on-premises solution user desktop ideal candidate saas delivery market saas engineering simulation software infancy interest concept growing similar reasons interest saas growing industries main driver traditional engineering simulation software required large up-front investment order access simulation software large investment kept engineering simulation inaccessible many startups middle market companies reluctant unable risk large software expenditure unproven projects according survey himss analytics 83 us healthcare organizations using cloud services 9.3 planning whereas 67 healthcare organizations currently running saas-based applications software service data escrow process keeping copy critical software-as-a-service application data independent third party similar source code escrow critical software source code stored independent third party saas data escrow applies logic data within saas application allows companies protect insure data resides within saas applications protecting data loss many varied reasons considering saas data escrow including concerns vendor bankruptcy unplanned service outages potential data loss corruption many businesses also keen ensure complying data governance standards want improved reporting business analytics saas data research conducted clearpace software ltd. growth saas showed 85 percent participants wanted take copy saas data third participants wanted copy daily basis one notable criticism saas comes richard stallman free software foundation refers service software substitute saass considers use saass violation principles free software according stallman saas products face problem 2010 forbes contributor dan woods noted drupal gardens web hosting platform based open source drupal content management system new open source model saas added similarly mediawiki wordpress many extensions increasingly used wide variety internal applications well public web services obtaining code relatively simple integration existing extensions plug-ins templates etc actual customizations rare usually quickly replaced standard publicly available extensions additionally guarantee software source code obtained means accurately reflects software system claims reflect andrew hoppin former chief information officer new york state senate refers combination saas open source software opensaas points wordpress another successful example opensaas software delivery model gives customers best worlds options fact open source means start building websites self-hosting wordpress customizing website heart \u2019 content concurrently fact wordpress saas means \u2019 manage website \u2013 simply pay wordpress.com host cloud saas model physical need indirect distribution distributed physically deployed almost instantaneously thereby negating need traditional partners middlemen", + "neighbors": [ + 14, + 157, + 227, + 250, + 259, + 293, + 310, + 379, + 429, + 480, + 487, + 505, + 509, + 513, + 556, + 611, + 671, + 755, + 847, + 857, + 910, + 936, + 968, + 1019, + 1036, + 1099, + 1106, + 1138, + 1235, + 1238, + 1287, + 1377, + 1431, + 1447, + 1470, + 1509, + 1554, + 1582 + ], + "mask": "Train" + }, + { + "node_id": 78, + "label": 9, + "text": "Assembly_language:assembly language assembly language assembler language often abbreviated asm low-level programming language strong correspondence instructions language architecture machine code instructions assembly language may also called symbolic machine code assembly code converted executable machine code utility program referred assembler conversion process referred assembly assembling source code assembly language usually one statement per machine instruction 1:1 comments statements assembler directives macros symbolic labels program memory locations often also supported assembly language specific particular computer architecture sometimes operating system however assembly languages provide specific syntax operating system calls assembly languages used universally operating system language provides access real capabilities processor upon system call mechanisms ultimately rest contrast assembly languages high-level programming languages generally portable across multiple architectures require interpreting compiling much complicated task assembling assembly language uses mnemonic represent low-level machine instruction opcode typically also architectural register flag etc many operations require one operands order form complete instruction assemblers permit named constants registers labels program memory locations calculate expressions operands thus programmers freed tedious repetitive calculations assembler programs much readable machine code depending architecture elements may also combined specific instructions addressing modes using offsets data well fixed addresses many assemblers offer additional mechanisms facilitate program development control assembly process aid debugging assembler program creates object code translating combinations mnemonics syntax operations addressing modes numerical equivalents representation typically includes operation code opcode well control bits data assembler also calculates constant expressions resolves symbolic names memory locations entities use symbolic references key feature assemblers saving tedious calculations manual address updates program modifications assemblers also include macro facilities performing textual substitution \u2013 e.g. generate common short sequences instructions inline instead called subroutines assemblers may also able perform simple types instruction set-specific optimizations one concrete example may ubiquitous x86 assemblers various vendors able perform jump-instruction replacements long jumps replaced short relative jumps number passes request others may even simple rearrangement insertion instructions assemblers risc architectures help optimize sensible instruction scheduling exploit cpu pipeline efficiently possible like early programming languages fortran algol cobol lisp assemblers available since 1950s first generations text based computer interfaces however assemblers came first far simpler write compilers high-level languages mnemonic along addressing modes operands instruction translates rather directly numeric representations particular instruction without much context analysis also several classes translators semi automatic code generators properties similar assembly high level languages speedcode perhaps one better known examples may several assemblers different syntax particular cpu instruction set architecture instance instruction add memory data register x86-family processor might codice_1 original intel syntax whereas would written codice_2 syntax used gnu assembler despite different appearances different syntactic forms generally generate numeric machine code see single assembler may also different modes order support variations syntactic forms well exact semantic interpretations fasm-syntax tasm-syntax ideal mode etc. special case x86 assembly programming two types assemblers based many passes source needed many times assembler reads source produce object file cases assembler must able determine size instruction initial passes order calculate addresses subsequent symbols means size operation referring operand defined later depends type distance operand assembler make pessimistic estimate first encountering operation necessary pad one no-operation instructions later pass errata assembler peephole optimization addresses may recalculated passes allow replacing pessimistic code code tailored exact distance target original reason use one-pass assemblers speed assembly \u2013 often second pass would require rewinding rereading program source tape rereading deck cards punched paper tape later computers much larger memories especially disc storage space perform necessary processing without re-reading advantage multi-pass assembler absence errata makes linking process program load assembler directly produces executable code faster example following code snippet one-pass assembler would able determine address backward reference bkwd assembling statement s2 would able determine address forward reference fwd assembling branch statement s1 indeed fwd may undefined two-pass assembler would determine addresses pass 1 would known generating code pass 2 sophisticated high-level assemblers provide language abstractions see language design details program written assembly language consists series mnemonic processor instructions meta-statements known variously directives pseudo-instructions pseudo-ops comments data assembly language instructions usually consist opcode mnemonic followed list data arguments parameters translated assembler machine language instructions loaded memory executed example instruction tells x86/ia-32 processor move immediate 8-bit value register binary code instruction 10110 followed 3-bit identifier register use identifier al register 000 following machine code loads al register data 01100001 binary computer code made human-readable expressing hexadecimal follows codice_3 means 'move copy following value al codice_4 hexadecimal representation value 01100001 97 decimal assembly language 8086 family provides mnemonic mov abbreviation move instructions machine code written follows assembly language complete explanatory comment required semicolon much easier read remember mov al 61h load al 97 decimal 61 hex assembly languages including one mnemonic mov may used family related instructions loading copying moving data whether immediate values values registers memory locations pointed values registers immediate a/k/a direct addresses assemblers may use separate opcode mnemonics l move memory register st move register memory lr move register register mvi move immediate operand memory etc mnemonic used different instructions means mnemonic corresponds several different binary instruction codes excluding data e.g codice_5 example depending operands follow mnemonic example x86/ia-32 cpus intel assembly language syntax codice_6 represents instruction moves contents register ah register al hexadecimal form instruction first byte 88h identifies move byte-sized register either another register memory second byte e0h encoded three bit-fields specify operands registers source ah destination al case like mnemonic represent one binary instruction assembler determines instruction generate examining operands first example operand codice_5 valid hexadecimal numeric constant valid register name codice_3 instruction applicable second example operand codice_9 valid register name valid numeric constant hexadecimal decimal octal binary codice_10 instruction applicable assembly languages always designed sort unambiguousness universally enforced syntax example intel x86 assembly language hexadecimal constant must start numeral digit hexadecimal number equal decimal ten would written codice_11 codice_12 codice_9 specifically appear name register ah rule also prevents ambiguity names registers bh ch dh well user-defined symbol ends letter h otherwise contains characters hexadecimal digits word beach returning original example x86 opcode 10110000 codice_3 copies 8-bit value al register 10110001 codice_15 moves cl 10110010 codice_16 dl assembly language examples follow mov al 1h load al immediate value 1 mov cl 2h load cl immediate value 2 mov dl 3h load dl immediate value 3 syntax mov also complex following examples show mov eax ebx move 4 bytes memory address contained ebx eax mov esi+eax cl move contents cl byte address esi+eax mov ds dx move contents dx segment register ds case mov mnemonic translated directly one opcodes 88-8c 8e a0-a3 b0-bf c6 c7 assembler programmer normally know remember transforming assembly language machine code job assembler reverse least partially achieved disassembler unlike high-level languages one-to-one correspondence many simple assembly statements machine language instructions however cases assembler may provide pseudoinstructions essentially macros expand several machine language instructions provide commonly needed functionality example machine lacks branch greater equal instruction assembler may provide pseudoinstruction expands machine set less branch zero result set instruction full-featured assemblers also provide rich macro language discussed used vendors programmers generate complex code data sequences since information pseudoinstructions macros defined assembler environment present object program disassembler reconstruct macro pseudoinstruction invocations disassemble actual machine instructions assembler generated abstract assembly-language entities likewise since comments assembly language source file ignored assembler effect object code generates disassembler always completely unable recover source comments computer architecture machine language computers differ number type operations support different sizes numbers registers representations data storage general-purpose computers able carry essentially functionality ways differ corresponding assembly languages reflect differences multiple sets mnemonics assembly-language syntax may exist single instruction set typically instantiated different assembler programs cases popular one usually supplied cpu manufacturer used documentation two examples cpus two different sets mnemonics intel 8080 family intel 8086/8088 intel claimed copyright assembly language mnemonics page documentation published 1970s early 1980s least companies independently produced cpus compatible intel instruction sets invented mnemonics zilog z80 cpu enhancement intel 8080a supports 8080a instructions plus many zilog invented entirely new assembly language new instructions also 8080a instructions example intel uses mnemonics mov mvi lda sta lxi ldax stax lhld shld various data transfer instructions z80 assembly language uses mnemonic ld similar case nec v30 v20 cpus enhanced copies intel 8086 8088 respectively like zilog z80 nec invented new mnemonics 8086 8088 instructions avoid accusations infringement intel copyright questionable whether copyrights valid later cpu companies amd cyrix republished intel x86/ia-32 instruction mnemonics exactly neither permission legal penalty doubtful whether practice many people programmed v20 v30 actually wrote nec assembly language rather intel since two assembly languages instruction set architecture isomorphic somewhat like english pig latin requirement use manufacturer published assembly language manufacturer products large degree diversity way authors assemblers categorize statements nomenclature use particular describe anything machine mnemonic extended mnemonic pseudo-operation pseudo-op typical assembly language consists 3 types instruction statements used define program operations instructions statements assembly language generally simple unlike high-level languages generally mnemonic symbolic name single executable machine language instruction opcode least one opcode mnemonic defined machine language instruction instruction typically consists operation opcode plus zero operands instructions refer single value pair values operands immediate value coded instruction registers specified instruction implied addresses data located elsewhere storage determined underlying processor architecture assembler merely reflects architecture works extended mnemonics often used specify combination opcode specific operand e.g. system/360 assemblers use extended mnemonic mask 15 operation \u2013 nothing one step mask 0 extended mnemonics often used support specialized uses instructions often purposes obvious instruction name example many cpu explicit nop instruction instructions used purpose 8086 cpus instruction used pseudo-opcode encode instruction disassemblers recognize decode instruction similarly ibm assemblers system/360 system/370 use extended mnemonics zero masks sparc architecture known synthetic instructions assemblers also support simple built-in macro-instructions generate two machine instructions instance z80 assemblers instruction recognized generate followed sometimes known pseudo-opcodes mnemonics arbitrary symbols 1985 ieee published standard 694 uniform set mnemonics used assemblers standard since withdrawn instructions used define data elements hold data variables define type data length alignment data instructions also define whether data available outside programs programs assembled separately program data section defined assemblers classify pseudo-ops assembly directives also called pseudo-opcodes pseudo-operations pseudo-ops commands given assembler directing perform operations assembling instructions. directives affect assembler operates may affect object code symbol table listing file values internal assembler parameters sometimes term pseudo-opcode reserved directives generate object code generate data names pseudo-ops often start dot distinguish machine instructions pseudo-ops make assembly program dependent parameters input programmer one program assembled different ways perhaps different applications pseudo-op used manipulate presentation program make easier read maintain another common use pseudo-ops reserve storage areas run-time data optionally initialize contents known values symbolic assemblers let programmers associate arbitrary names labels symbols memory locations various constants usually every constant variable given name instructions reference locations name thus promoting self-documenting code executable code name subroutine associated entry point calls subroutine use name inside subroutines goto destinations given labels assemblers support local symbols lexically distinct normal symbols e.g. use 10 goto destination assemblers nasm provide flexible symbol management letting programmers manage different namespaces automatically calculate offsets within data structures assign labels refer literal values result simple computations performed assembler labels also used initialize constants variables relocatable addresses assembly languages like computer languages allow comments added program source code ignored assembly judicious commenting essential assembly language programs meaning purpose sequence binary machine instructions difficult determine raw uncommented assembly language generated compilers disassemblers quite difficult read changes must made many assemblers support predefined macros others support programmer-defined repeatedly re-definable macros involving sequences text lines variables constants embedded macro definition commonly mixture assembler statements e.g. directives symbolic machine instructions templates assembler statements sequence text lines may include opcodes directives macro defined name may used place mnemonic assembler processes statement replaces statement text lines associated macro processes existed source code file including assemblers expansion macros existing replacement text macros sense date ibm autocoders 1950s assembly language term macro represents comprehensive concept contexts c programming language define directive typically used create short single line macros assembler macro instructions like macros pl/i languages lengthy programs executed interpretation assembler assembly since macros 'short names expand several indeed many lines code used make assembly language programs appear far shorter requiring fewer lines source code higher level languages also used add higher levels structure assembly programs optionally introduce embedded debugging code via parameters similar features macro assemblers often allow macros take parameters assemblers include quite sophisticated macro languages incorporating high-level language elements optional parameters symbolic variables conditionals string manipulation arithmetic operations usable execution given macro allowing macros save context exchange information thus macro might generate numerous assembly language instructions data definitions based macro arguments could used generate record-style data structures unrolled loops example could generate entire algorithms based complex parameters instance sort macro could accept specification complex sort key generate code crafted specific key needing run-time tests would required general procedure interpreting specification organization using assembly language heavily extended using macro suite considered working higher-level language since programmers working computer lowest-level conceptual elements underlining point macros used implement early virtual machine snobol4 1967 written snobol implementation language sil assembly language virtual machine target machine would translate native code using macro assembler allowed high degree portability time macros used customize large scale software systems specific customers mainframe era also used customer personnel satisfy employers needs making specific versions manufacturer operating systems done example systems programmers working ibm conversational monitor system virtual machine vm/cms ibm real time transaction processing add-ons customer information control system cics acp/tpf airline/financial system began 1970s still runs many large computer reservation systems crs credit card systems today also possible use solely macro processing abilities assembler generate code written completely different languages example generate version program cobol using pure macro assembler program containing lines cobol code inside assembly time operators instructing assembler generate arbitrary code ibm os/360 uses macros perform system generation user specifies options coding series assembler macros assembling macros generates job stream build system including job control language utility control statements realized 1960s concept macro processing independent concept assembly former modern terms word processing text processing generating object code concept macro processing appeared appears c programming language supports preprocessor instructions set variables make conditional tests values note unlike certain previous macro processors inside assemblers c preprocessor turing-complete lacks ability either loop go latter allowing programs loop despite power macro processing fell disuse many high level languages major exceptions c c++ pl/i remaining perennial assemblers macro parameter substitution strictly name macro processing time value parameter textually substituted name famous class bugs resulting use parameter expression simple name macro writer expected name macro intention caller would provide name variable global variable constant b would used multiply foo called parameter codice_17 macro expansion codice_18 occurs avoid possible ambiguity users macro processors parenthesize formal parameters inside macro definitions callers parenthesize input parameters assemblers incorporated structured programming elements encode execution flow earliest example approach concept-14 macro set originally proposed dr. harlan mills march 1970 implemented marvin kessler ibm federal systems division extended s/360 macro assembler if/else/endif similar control flow blocks way reduce eliminate use goto operations assembly code one main factors causing spaghetti code assembly language approach widely accepted early '80s latter days large-scale assembly language use curious design a-natural stream-oriented assembler 8080/z80 processors whitesmiths ltd. developers unix-like idris operating system reported first commercial c compiler language classified assembler worked raw machine elements opcodes registers memory references incorporated expression syntax indicate execution order parentheses special symbols along block-oriented structured programming constructs controlled sequence generated instructions a-natural built object language c compiler rather hand-coding logical syntax fans little apparent demand sophisticated assemblers since decline large-scale assembly language development spite still developed applied cases resource constraints peculiarities target system architecture prevent effective use higher-level languages assemblers strong macro engine allow structured programming via macros switch macro provided masm32 package note code complete program assembly languages available time stored-program computer introduced kathleen booth credited inventing assembly language based theoretical work began 1947 working arc2 birkbeck university london following consultation then-future husband andrew booth john von neumann herman goldstine institute advanced study late 1948 electronic delay storage automatic calculator edsac assembler named initial orders integrated bootstrap program used one-letter mnemonics developed david wheeler credited ieee computer society creator first assembler reports edsac introduced term assembly process combining fields instruction word soap symbolic optimal assembly program assembly language ibm 650 computer written stan poley 1955 assembly languages eliminate much error-prone tedious time-consuming first-generation programming needed earliest computers freeing programmers tedium remembering numeric codes calculating addresses widely used sorts programming however 1980s 1990s microcomputers use largely supplanted higher-level languages search improved programming productivity today assembly language still used direct hardware manipulation access specialized processor instructions address critical performance issues typical uses device drivers low-level embedded systems real-time systems historically numerous programs written entirely assembly language burroughs mcp 1961 first computer operating system developed entirely assembly language written executive systems problem oriented language espol algol dialect many commercial applications written assembly language well including large amount ibm mainframe software written large corporations cobol fortran pl/i eventually displaced much work although number large organizations retained assembly-language application infrastructures well 1990s early microcomputers relied hand-coded assembly language including operating systems large applications systems severe resource constraints imposed idiosyncratic memory display architectures provided limited buggy system services perhaps important lack first-class high-level language compilers suitable microcomputer use psychological factor may also played role first generation microcomputer programmers retained hobbyist wires pliers attitude commercial context biggest reasons using assembly language minimal bloat size minimal overhead greater speed reliability typical examples large assembly language programs time ibm pc dos operating systems turbo pascal compiler early applications spreadsheet program lotus 1-2-3 assembly language used get best performance sega saturn console notoriously challenging develop program games 1993 arcade game nba jam another example assembly language long primary development language many popular home computers 1980s 1990s msx sinclair zx spectrum commodore 64 commodore amiga atari st large part interpreted basic dialects systems offered insufficient execution speed well insufficient facilities take full advantage available hardware systems systems even integrated development environment ide highly advanced debugging macro facilities compilers available radio shack trs-80 successors capability combine inline assembly source high-level program statements upon compilation built-in assembler produced inline machine code always debates usefulness performance assembly language relative high-level languages although assembly language specific niche uses important see tools optimization tiobe index programming language popularity ranks assembly language 11 ahead visual basic example assembler used optimize speed optimize size case speed optimization modern optimizing compilers claimed render high-level languages code run fast hand-written assembly despite counter-examples found complexity modern processors memory sub-systems makes effective optimization increasingly difficult compilers well assembly programmers moreover increasing processor performance meant cpus sit idle time delays caused predictable bottlenecks cache misses i/o operations paging made raw code execution speed non-issue many programmers situations developers might choose use assembly language assembly language still taught computer science electronic engineering programs although programmers today regularly work assembly language tool underlying concepts remain important fundamental topics binary arithmetic memory allocation stack processing character set encoding interrupt processing compiler design would hard study detail without grasp computer operates hardware level since computer behavior fundamentally defined instruction set logical way learn concepts study assembly language modern computers similar instruction sets therefore studying single assembly language sufficient learn basic concepts ii recognize situations use assembly language might appropriate iii see efficient executable code created high-level languages", + "neighbors": [ + 0, + 29, + 31, + 37, + 53, + 65, + 78, + 85, + 99, + 108, + 117, + 123, + 134, + 142, + 152, + 170, + 176, + 185, + 187, + 216, + 234, + 246, + 270, + 292, + 306, + 331, + 347, + 373, + 378, + 386, + 388, + 396, + 412, + 413, + 503, + 506, + 509, + 538, + 567, + 571, + 579, + 592, + 599, + 649, + 682, + 704, + 752, + 753, + 756, + 805, + 810, + 825, + 860, + 870, + 873, + 891, + 897, + 918, + 919, + 940, + 948, + 961, + 966, + 979, + 984, + 998, + 1003, + 1005, + 1009, + 1022, + 1028, + 1044, + 1066, + 1090, + 1120, + 1138, + 1146, + 1152, + 1160, + 1181, + 1204, + 1213, + 1217, + 1221, + 1225, + 1227, + 1235, + 1287, + 1311, + 1319, + 1320, + 1324, + 1372, + 1388, + 1394, + 1398, + 1417, + 1457, + 1511, + 1532, + 1538, + 1546, + 1626, + 1631, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 79, + "label": 2, + "text": "Your_Phone:phone phone app developed microsoft windows 10 connect android ios devices first shown microsoft build 2018 allows see recent photos taken android phone directly windows 10 pc/tablet also used sending sms messages right pc comes preinstalled windows 10 october 2018 update replaces old phone companion phone app used mirror screen android phone however currently phones supported feature beta.at samsung \u2019 galaxy note10 launch event microsoft teased new phone app feature might soon allow make receive phone calls may 26 2015 microsoft announced phone companion designed help users connect pc whatever smartphone use \u2014 windows phone android ios also confirmed cortana digital assistant app arrive android ios previously available windows devices may 7 2018 microsoft announced phone app build 2018 event allows see recent photos send sms messages", + "neighbors": [ + 26, + 66, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 80, + "label": 1, + "text": "IPUMS:ipums integrated public use microdata series ipums world largest individual-level population database ipums consists microdata samples united states ipums-usa international ipums-international census records well data u.s. international surveys records converted consistent format made available researchers web-based data dissemination system ipums housed institute social research data innovation interdisciplinary research center university minnesota direction professor steven ruggles ipums includes persons enumerated united states censuses 1790 2010 1890 census missing destroyed fire american community survey since 2000 current population survey since 1962 ipums provides consistent variable names coding schemes documentation across samples facilitating analysis long-term change ipums-international includes countries africa asia europe latin america 1960 forward database currently includes billion individuals enumerated 365 censuses 94 countries around world ipums-international converts census microdata multiple countries consistent format allowing comparisons across countries time periods special efforts made simplify use data losing meaningful information comprehensive documentation provided coherent form facilitate comparative analyses social economic change additional databases ipums family include journal american history described effort one great archival projects past two decades liens socio french portal social sciences gave ipums \u201c best site \u201d designation gone non-french website writing \u201c ipums est un projet absolument extraordinaire ... \u00e9poustouflante mind-blowing \u201d official motto ipums use good never evil ipums data documentation available online free charge", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 81, + "label": 9, + "text": "Asm.js:asm.js asm.js subset javascript designed allow computer software written languages c run web applications maintaining performance characteristics considerably better standard javascript typical language used applications asm.js consists strict subset javascript code written statically-typed languages manual memory management c translated source-to-source compiler emscripten based llvm performance improved limiting language features amenable ahead-of-time optimization performance improvements mozilla firefox first web browser implement asm.js-specific optimizations starting version 22. asm.js enables significant performance improvements web applications aim improve performance hand-written javascript code enable anything enhanced performance intended performance characteristics closer native code standard javascript limiting language features amenable ahead-of-time optimization performance improvements using subset javascript asm.js largely supported major web browsers unlike alternative approaches google native client asm.js typically written directly instead intermediate language generated use compiler takes source code language c++ outputs asm.js example given following c code int f int emscripten would output following js code function f note addition codice_1 lack type specifiers javascript bitwise operators convert operands 32-bit signed integers give integer results means bitwise zero otherwise useless operation converts value integer parameter ensures function called outside code value converted correct type also used return value case ensure result adding 1 integer otherwise could become large mark return type function conversions required asm.js optimising compiler produce highly efficient native code ahead-of-time optimising compiler conversions performed asm.js code calls asm.js code required type specifiers mean guaranteed values already correct type furthermore rather performing floating-point addition converting integer simply native integer operation together leads significant performance benefits another example calculate length string would result following asm.js code generated code variable mem8 actually byte-by-byte view typed buffer serves heap asm.js code since asm.js runs browser performance heavily depends browser hardware preliminary benchmarks c programs compiled asm.js usually within factor 2 slowdown native compilation clang much performance gain normal javascript due 100 type consistency virtually garbage collection memory manually managed large typed array simpler model dynamic behavior memory allocation deallocation narrow set well-defined integer floating point operations enables much greater performance potential optimization mozilla benchmark december 2013 showed significant improvements firefox float32 optimizations run benchmarks around 1.5\u00d7 slower native better mozilla points performance natively compiled code single measure rather range different native compilers case clang gcc delivering code differing performance fact benchmarks like box2d fasta copy asm.js close closer clang clang gcc one case asm.js even beats clang slight amount box2d emscripten project provides tools used compile c c++ codebases languages converted llvm ir asm.js browsers support newest edition javascript able run asm.js code subset specification however since features added edition enable full asm.js support older browsers lacking features may encounter problems browser implementations especially optimised asm.js almost current applications based asm.js c/c++ applications compiled asm.js using emscripten mandreel mind kind applications going target asm.js near future benefit portability running browser level complexity direct port javascript would infeasible far number programming languages application frameworks programs libraries games game engines software already ported given", + "neighbors": [ + 7, + 36, + 50, + 69, + 107, + 132, + 176, + 258, + 292, + 347, + 412, + 427, + 509, + 593, + 632, + 682, + 686, + 713, + 716, + 782, + 869, + 872, + 886, + 959, + 1120, + 1138, + 1166, + 1210, + 1225, + 1227, + 1264, + 1280, + 1302, + 1311, + 1376, + 1423, + 1511, + 1539, + 1566, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 82, + "label": 4, + "text": "Partclone:partclone partclone partition clone restore tool provides utilities back restore partitions designed higher compatibility file system library developed nchc free software labs taiwan default backup application clonezilla fog version 1.00 redo backup recovery simply front end partclone supports many file systems good performance skips portions file system marked free space partclone currently supports following filesystems ext2 ext3 ext4 hfs+ reiserfs reiser4 btrfs vmfs v3 v5 xfs jfs ufs ntfs fat 12/16/32 exfat run partclone particular filesystem one uses command 'partclone. fstype similar manner mkfs command partclone partition image tool attempts backup used data blocks written c focuses cloning filesystems opposed cloning disks basic features", + "neighbors": [ + 34, + 134, + 306, + 558, + 796, + 997, + 1138, + 1252 + ], + "mask": "Validation" + }, + { + "node_id": 83, + "label": 5, + "text": "Netscape_(web_browser):netscape web browser netscape web browser general name series web browsers formerly produced netscape communications corporation former subsidiary aol original browser dominant browser terms usage share result first browser war lost virtually share internet explorer netscape discontinued support netscape browsers client products terminated march 1 2008 netscape navigator name netscape web browser versions 1.0 4.8 first beta release versions browser released 1994 known mosaic mosaic netscape legal challenge national center supercomputing applications makers ncsa mosaic many netscape founders spent time developing led name change netscape navigator company name also changed mosaic communications corporation netscape communications corporation browser easily advanced available therefore instant success becoming market leader still beta netscape feature-count market share continued grow rapidly version 1.0 released version 2.0 added full mail reader called netscape mail thus transforming netscape mere web browser internet suite period browser suite known netscape navigator around time aol started bundling software microsoft internet explorer version 3.0 netscape first beta codenamed atlas first face serious competition form microsoft internet explorer 3.0 netscape easily held microsoft challenge remained number one browser time version 3.0 also available gold version featured wysiwyg html editor later added netscape communicator standard feature sold retail software profit netscape 3.0 introduced many new features new plug-ins background colors tables archive attribute applet element netscape navigator 3 huge success undisputed web browser giant time 90 share later eroded free internet explorer included windows 95 highest version line 3.04 netscape 4 addressed problem netscape navigator used name suite browser contained within renaming suite netscape communicator releasing five preview releases 1996\u20131997 netscape corp. released final version netscape communicator june 1997 new version less based netscape navigator 3 code updated added new features support certain css1 elements minimal dynamic font support proprietary object element new suite successful despite increasing competition internet explorer 4.0 problems outdated browser core communicator suite made netscape navigator netscape mail newsgroups netscape address book netscape composer html editor later became mozilla composer eventually split completely separate product nvu october 1998 version 4.5 netscape communicator released new version featured various functionality improvements especially mail/news component update browser core functionality basically identical version 4.08 one month later netscape communications corporation bought aol standalone version netscape navigator still available discontinued version 4.08 windows standalone versions operating systems unix/linux maintained version 4.8 january 1998 netscape communications corporation announced future versions software would free charge developed open source community mozilla netscape communicator 5.0 announced codenamed gromit significant delays release netscape next major version communicator therefore aged badly many years still used result advanced support html 4 css dom ecmascript internet explorer starting version 4 up-to-date internet explorer 5.0 became market leader november 1998 work netscape 5.0 cancelled favor developing completely new program scratch netscape 5.0 codenamed gromit continuation 4.x code two pre-alpha versions written one based original communicator code layout engine stability performance enhancements 4.0 codebase codenamed mariner another using gecko layout engine though netscape originally intended deploy mariner later replace gecko developed scratch netscape 5 mariner scrapped completely however versions continued numbered released netscape formed mozilla foundation developed mozilla application suite using gecko open-source mozilla browser turn used basis netscape 6 1998 informal group called mozilla organization formed largely funded netscape vast majority programmers working code paid netscape coordinate development netscape 5 codenamed gromit would based communicator source code aging communicator code proved difficult work decision made late october drop code branch communicator 4.5 core rendering engine start scratch using standards-compliant gecko rendering engine gecko featured mozilla web browser additions netscape 6 based decision meant netscape next major version severely delayed meantime netscape taken aol acting pressure web standards project forced new division release netscape 6.0 2000 public beta versions released april august october netscape 6.0 released november 2000 suite consisted netscape navigator communicator components addition built-in aol instant messenger client branded netscape instant messenger however clear netscape 6 yet ready release flopped badly based mozilla 0.6 ready used general public yet due many serious bugs would cause crash often render web pages slowly later versions netscape 6 much improved 6.2.x regarded especially good release browser still struggled make impact disappointed community netscape 7.0 codenamed mach five based mozilla 1.0.1 released august 2002 direct continuation netscape 6 similar components picked users still much minority browser one problems mozilla worthy adversary addition aol decided deactivate mozilla popup-blocker functionality netscape 7.0 created outrage community response complaints aol integrated pop-up blocker netscape 7.01 addition netscape introduced new aol-free-version without usual aol addons browser suite netscape 7.1 codenamed buffy based mozilla 1.4 released june 2003 2003 aol closed netscape division laid-off reassigned netscape employees mozilla.org continued independent mozilla foundation taking many netscape ex-employees aol continued develop netscape in-house due staff committed improvements minimal one year later august 2004 last version based mozilla released netscape 7.2 based mozilla 1.7.2 2005 2007 netscape releases became known netscape browser aol chose base netscape browser relatively successful mozilla firefox re-written version mozilla produced mozilla foundation release full internet suite solely web browser controversial decisions include versions made microsoft windows featuring gecko rendering engine previous releases trident engine used internet explorer aol acquisition netscape years earlier made less surprise company laid netscape team outsourced development mercurial communications netscape browser 8.1.3 released april 2 2007 included general bug fixes identified versions 8.0\u20138.1.2 netscape confirmed 23 january 2007 netscape browser versions 8.0-8.1.2 succeeded new stand-alone browser release netscape navigator 9 features said include newsfeed support become integrated propeller internet portal alongside enhanced methods discussion submission voting web pages also sees browser return multi-platform support across windows linux mac os x like netscape version 8.x new release based upon popular mozilla firefox version 2.0 full support firefox add-ons plugins netscape provided also first time since 2004 browser produced in-house programming staff beta program first released 5 june 2007 final version released october 15 2007 december 28 2007 netscape developers announced aol would discontinue web browser february 1 2008 due low market share january 28 2008 netscape revised date march 1 2008 offered support migration flock mozilla firefox", + "neighbors": [ + 14, + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 452, + 491, + 509, + 530, + 531, + 580, + 582, + 623, + 627, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1264, + 1280, + 1288, + 1331, + 1376, + 1378, + 1408, + 1417, + 1423, + 1424, + 1528, + 1550, + 1569, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 84, + "label": 3, + "text": "Amaurote:amaurote amaurote british video game 8-bit computer systems released 1987 mastertronic mastertronic added dimension label music game written david whittaker game instructions player controls arachnus 4 armoured fighting-machine moves four legs player must first select sector play via map screen control arachnus wanders isometric top-down commodore 64 version view cityscape attacking marauding insects searching insect queen using scanner arachnus attacks launching bouncing bombs launch one time bomb misses intended target player wait hits scenery bounces fence play area fire queen located player radio-in supa-bomb used destroy queen player also radio-in supplies additional bombs even ask pulled combat zone extra weaponry costs player dosh in-game currency game favourably reviewed crash magazine said graphically impressive well designed fun play given 92 overall rating zzap 64 less impressed commodore 64 version criticised dull gameplay programming bugs rated 39 overall origin city name amaurote derives utopia sir thomas 1478\u20131535 second book cities namely amaurote following description given cities knoweth one knoweth like one another farforth nature place permitteth describe therefore one skilleth greatly rather amaurote worthiest dignity", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 85, + "label": 3, + "text": "X86:x86 x86 family instruction set architectures based intel 8086 microprocessor 8088 variant 8086 introduced 1978 fully 16-bit extension intel 8-bit 8080 microprocessor memory segmentation solution addressing memory covered plain 16-bit address term x86 came names several successors intel 8086 processor end 86 including 80186 80286 80386 80486 processors many additions extensions added x86 instruction set years almost consistently full backward compatibility architecture implemented processors intel cyrix amd via many companies also open implementations zet soc platform nevertheless intel amd via hold x86 architectural licenses producing modern 64-bit designs term synonymous ibm pc compatibility implies multitude computer hardware embedded systems well general-purpose computers used x86 chips pc-compatible market started ibm pc 1981 2018 majority personal computers laptops sold based x86 architecture categories\u2014especially high-volume mobile categories smartphones tablets\u2014are dominated arm high end x86 continues dominate compute-intensive workstation cloud computing segments 1980s early 1990s 8088 80286 still common use term x86 usually represented 8086 compatible cpu today however x86 usually implies binary compatibility also 32-bit instruction set 80386 due fact instruction set become something lowest common denominator many modern operating systems probably also term became common introduction 80386 1985 years introduction 8086 8088 intel added complexity naming scheme terminology iapx ambitious ill-fated intel iapx 432 processor tried successful 8086 family chips applied kind system-level prefix 8086 system including coprocessors 8087 8089 well simpler intel-specific system chips thereby described iapx 86 system also terms irmx operating systems isbc single-board computers isbx multimodule boards based 8086-architecture together heading microsystem 80 however naming scheme quite temporary lasting years early 1980s although 8086 primarily developed embedded systems small multi-user single-user computers largely response successful 8080-compatible zilog z80 x86 line soon grew features processing power today x86 ubiquitous stationary portable personal computers also used midrange computers workstations servers new supercomputer clusters top500 list large amount software including large list using x86-based hardware modern x86 relatively uncommon embedded systems however small low power applications using tiny batteries well low-cost microprocessor markets home appliances toys lack significant x86 presence simple 8-bit 16-bit based architectures common although x86-compatible via c7 via nano amd geode athlon neo intel atom examples 32- 64-bit designs used relatively low power low cost segments several attempts including intel end market dominance inelegant x86 architecture designed directly first simple 8-bit microprocessors examples iapx 432 project originally named intel 8800 intel 960 intel 860 intel/hewlett-packard itanium architecture however continuous refinement x86 microarchitectures circuitry semiconductor manufacturing would make hard replace x86 many segments amd 64-bit extension x86 intel eventually responded compatible design scalability x86 chips eight-core intel xeon 12-core amd opteron underlining x86 example continuous refinement established industry standards resist competition completely new architectures table lists processor models model series implementing variations x86 instruction set chronological order line item characterized significantly improved commercially successful processor microarchitecture designs various times companies ibm nec amd ti stm fujitsu oki siemens cyrix intersil c nexgen umc dm p started design manufacture x86 processors cpus intended personal computers well embedded systems x86 implementations seldom simple copies often employ different internal microarchitectures well different solutions electronic physical levels quite naturally early compatible microprocessors 16-bit 32-bit designs developed much later personal computer market real quantities started appear around 1990 i386 i486 compatible processors often named similarly intel original chips companies designed manufactured x86 x87 processors include itt corporation national semiconductor ulsi system technology weitek following fully pipelined i486 intel introduced pentium brand name unlike numbers could trademarked new set superscalar x86 designs x86 naming scheme legally cleared x86 vendors choose different names x86-compatible products initially chose continue variations numbering scheme ibm partnered cyrix produce 5x86 efficient 6x86 m1 6x86mx mii lines cyrix designs first x86 microprocessors implementing register renaming enable speculative execution amd meanwhile designed manufactured advanced delayed 5k86 k5 internally closely based amd earlier 29k risc design similar nexgen nx586 used strategy dedicated pipeline stages decode x86 instructions uniform easily handled micro-operations method remained basis x86 designs day early versions microprocessors heat dissipation problems 6x86 also affected minor compatibility problems nx586 lacked floating point unit fpu crucial pin-compatibility k5 somewhat disappointing performance eventually introduced customer ignorance alternatives pentium series contributed designs comparatively unsuccessful despite fact k5 good pentium compatibility 6x86 significantly faster pentium integer code amd later managed establish serious contender k6 set processors gave way successful athlon opteron also contenders centaur technology formerly idt rise technology transmeta via technologies energy efficient c3 c7 processors designed centaur company sold many years centaur newest design via nano first processor superscalar speculative execution introduced time intel first in-order processor since p5 pentium intel atom instruction set architecture twice extended larger word size 1985 intel released 32-bit 80386 later known i386 gradually replaced earlier 16-bit chips computers although typically embedded systems following years extended programming model originally referred i386 architecture like first implementation intel later dubbed ia-32 introducing unrelated ia-64 architecture 1999-2003 amd extended 32-bit architecture 64 bits referred x86-64 early documents later amd64 intel soon adopted amd architectural extensions name ia-32e later using name em64t finally using intel 64 microsoft sun microsystems/oracle also use term x64 many linux distributions bsds also use amd64 term microsoft windows example designates 32-bit versions x86 64-bit versions x64 installation files 64-bit windows versions required placed directory called amd64 x86 architecture variable instruction length primarily cisc design emphasis backward compatibility instruction set typical cisc however basically extended version simple eight-bit 8008 8080 architectures byte-addressing enabled words stored memory little-endian byte order memory access unaligned addresses allowed valid word sizes largest native size integer arithmetic memory addresses offsets 16 32 64 bits depending architecture generation newer processors include direct support smaller integers well multiple scalar values handled simultaneously via simd unit present later generations described immediate addressing offsets immediate data may expressed 8-bit quantities frequently occurring cases contexts -128..127 range enough typical instructions therefore 2 3 bytes length although much longer single-byte conserve encoding space registers expressed opcodes using three four bits latter via opcode prefix 64-bit mode one operand instruction memory location however memory operand may also destination combined source destination operand source either register immediate among factors contributes code size rivals eight-bit machines enables efficient use instruction cache memory relatively small number general registers also inherited 8-bit ancestors made register-relative addressing using small immediate offsets important method accessing operands especially stack much work therefore invested making accesses fast register accesses i.e one cycle instruction throughput circumstances accessed data available top-level cache dedicated floating point processor 80-bit internal registers 8087 developed original 8086 microprocessor subsequently developed extended 80387 later processors incorporated backward compatible version functionality microprocessor main processor addition modern x86 designs also contain simd-unit see sse instructions work parallel one two 128-bit words containing two four floating point numbers 64 32 bits wide respectively alternatively 2 4 8 16 integers 64 32 16 8 bits wide respectively presence wide simd registers means existing x86 processors load store 128 bits memory data single instruction also perform bitwise operations although integer arithmetic full 128-bits quantities parallel intel sandy bridge processors added avx advanced vector extensions instructions widening simd registers 256 bits knights corner architecture used intel xeon phi co-processors uses 512-bit wide simd registers execution current x86 processors employ extra decoding steps split instructions smaller pieces called micro-operations handed control unit buffers schedules compliance x86-semantics executed partly parallel one several less specialized execution units modern x86 designs thus pipelined superscalar also capable order speculative execution via branch prediction register renaming memory dependence prediction means may execute multiple partial complete x86 instructions simultaneously necessarily order given instruction stream intel amd starting amd zen cpus also capable simultaneous multithreading two threads per core xeon phi four threads per core case intel transactional memory tsx introduced mid-1990s method sometimes referred risc core risc translation partly marketing reasons also micro-operations share properties certain types risc instructions however traditional microcode used since 1950s also inherently shares many properties new method differs mainly translation micro-operations occurs asynchronously synchronize execution units decode steps opens possibilities analysis buffered code stream therefore permits detection operations performed parallel simultaneously feeding one execution unit latest processors also opposite appropriate combine certain x86 sequences compare followed conditional jump complex micro-op fits execution model better thus executed faster less machine resources involved another way try improve performance cache decoded micro-operations processor directly access decoded micro-operations special cache instead decoding intel followed approach execution trace cache feature netburst microarchitecture pentium 4 processors later decoded stream buffer core-branded processors since sandy bridge transmeta used completely different method x86 compatible cpus used just-in-time translation convert x86 instructions cpu native vliw instruction set transmeta argued approach allows power efficient designs since cpu forgo complicated decode step traditional x86 implementations minicomputers late 1970s running 16-bit 64-kb address limit memory become cheaper minicomputers like pdp-11 used complex bank-switching schemes case digital vax redesigned much expensive processors could directly handle 32-bit addressing data original 8086 developed simple 8080 microprocessor primarily aiming small inexpensive computers specialized devices instead adopted simple segment registers increased memory address width 4 bits multiplying 64-kb address 16 20-bit address could address total one megabyte 1,048,576 bytes quite large amount small computer time concept segment registers new many mainframes used segment registers swap quickly different tasks practice x86 much-criticized implementation greatly complicated many common programming tasks compilers however architecture soon allowed linear 32-bit addressing starting 80386 late 1985 major actors microsoft took several years convert 16-bit based systems 80386 80486 therefore largely used fast still 16-bit based 8086 many years data code could managed within near 16-bit segments within 64 kb portions total 1 mb address space compiler could operate far mode using 32-bit codice_1 pairs reaching 1 mb would also prove quite limiting mid-1980s working emerging pc market made simple translate software older 8008 8080 8085 z80 newer processor 1985 16-bit segment addressing model effectively factored introduction 32-bit offset registers 386 design real mode segmentation achieved shifting segment address left 4 bits adding offset order receive final 20-bit address example ds a000h si 5677h ds si point absolute address ds \u00d7 10h si a5677h thus total address space real mode 2 bytes 1 mb quite impressive figure 1978 memory addresses consist segment offset every type access code data stack default segment register associated data register usually ds code cs stack ss data accesses segment register explicitly specified using segment override prefix use four segment registers scheme two different segment/offset pairs point single absolute location thus ds a111h si 4567h ds si point a5677h scheme makes impossible use four segments cs ss vital correct functioning program ds es used point data segments outside program precisely outside currently executing segment program stack protected mode introduced 80286 segment register longer contains physical address beginning segment contain selector points system-level structure called segment descriptor segment descriptor contains physical address beginning segment length segment access permissions segment offset checked length segment offsets referring locations outside segment causing exception offsets referring locations inside segment combined physical address beginning segment get physical address corresponding offset segmented nature make programming compiler design difficult use near far pointers affects performance addressing modes 16-bit x86 processors summarized formula addressing modes 32-bit x86 processors 32-bit code 64-bit x86 processors summarized formula addressing modes 64-bit code 64-bit x86 processors summarized formula instruction relative addressing 64-bit code rip displacement rip instruction pointer register simplifies implementation position-independent code used shared libraries operating systems 8086 eight-bit alternatively i/o space one segment stack memory supported computer hardware words two bytes pushed stack stack grows toward numerically lower addresses pointing recently pushed item 256 interrupts invoked hardware software interrupts cascade using stack store return address original intel 8086 8088 fourteen 16-bit registers four ax bx cx dx general-purpose registers gprs although may additional purpose example cx used counter loop instruction accessed two separate bytes thus bx high byte accessed bh low byte bl two pointer registers special roles sp stack pointer points top stack bp base pointer often used point place stack typically local variables see frame pointer registers si di bx bp address registers may also used array indexing four segment registers cs ds ss es used form memory address flags register contains flags carry flag overflow flag zero flag finally instruction pointer ip points next instruction fetched memory executed register directly accessed read written program intel 80186 80188 essentially upgraded 8086 8088 cpu respectively on-chip peripherals added cpu registers 8086 8088 addition interface registers peripherals 8086 8088 80186 80188 use optional floating-point coprocessor 8087 8087 appears programmer part cpu adds eight 80-bit wide registers st 0 st 7 hold numeric data one seven formats 32- 64- 80-bit floating point 16- 32- 64-bit binary integer 80-bit packed decimal integer intel 80286 support protected mode three special registers hold descriptor table addresses gdtr ldtr idtr fourth task register tr used task switching 80287 floating-point coprocessor 80286 registers 8087 data formats advent 32-bit 80386 processor 16-bit general-purpose registers base registers index registers instruction pointer flags register segment registers expanded 32 bits nomenclature represented prefixing e extended register names x86 assembly language thus ax register corresponds lowest 16 bits new 32-bit eax register si corresponds lowest 16 bits esi general-purpose registers base registers index registers used base addressing modes registers except stack pointer used index addressing modes two new segment registers fs gs added greater number registers instructions operands machine code format expanded provide backward compatibility segments executable code marked containing either 16-bit 32-bit instructions special prefixes allow inclusion 32-bit instructions 16-bit segment vice versa 80386 optional floating-point coprocessor 80387 eight 80-bit wide registers st 0 st 7 like 8087 80287 80386 could also use 80287 coprocessor 80486 subsequent x86 models floating-point processing unit fpu integrated on-chip pentium mmx added eight 64-bit mmx integer registers mmx0 mmx7 share lower bits 80-bit-wide fpu stack pentium iii intel added 32-bit streaming simd extensions sse control/status register mxcsr eight 128-bit sse floating point registers xmm0 xmm7 starting amd opteron processor x86 architecture extended 32-bit registers 64-bit registers way similar 16 32-bit extension took place r-prefix identifies 64-bit registers rax rbx rcx rdx rsi rdi rbp rsp rflags rip eight additional 64-bit general registers r8-r15 also introduced creation x86-64 however extensions usable 64-bit mode one two modes available long mode addressing modes dramatically changed 32-bit mode except addressing extended 64 bits virtual addresses sign extended 64 bits order disallow mode bits virtual addresses selector details dramatically reduced addition addressing mode added allow memory references relative rip instruction pointer ease implementation position-independent code used shared libraries operating systems simd registers xmm0\u2013xmm15 simd registers ymm0\u2013ymm15 simd registers zmm0\u2013zmm31 x86 processors protected mode i.e 80286 later processors also three descriptor registers gdtr ldtr idtr task register tr 32-bit x86 processors starting 80386 also include various special/miscellaneous registers control registers cr0 4 cr8 64-bit debug registers dr0 3 plus 6 7 test registers tr3 7 80486 model-specific registers msrs appearing pentium although main registers exception instruction pointer general-purpose 32-bit 64-bit versions instruction set used anything originally envisioned used following purposes segment registers particular purposes envisioned 8 registers available 64-bit mode instructions compile execute efficiently using registers designed purpose example using al accumulator adding immediate byte value produces efficient add al opcode 04h whilst using bl register produces generic longer add register opcode 80c3h another example double precision division multiplication works specifically ax dx registers modern compilers benefited introduction sib byte scale-index-base byte allows registers treated uniformly minicomputer-like however using sib byte universally non-optimal produces longer encodings using selectively necessary main benefit sib byte orthogonality powerful addressing modes provides make possible save instructions use registers address calculations scaling index special instructions lost priority hardware design became slower equivalent small code sequences notable example lodsw instruction note pl registers available 64-bit mode note il registers available 64-bit mode real address mode commonly called real mode operating mode 8086 later x86-compatible cpus real mode characterized 20-bit segmented memory address space meaning 1 mib memory addressed\u2014actually slightly direct software access peripheral hardware concept memory protection multitasking hardware level x86 cpus 80286 series later start real mode power-on 80186 cpus earlier one operational mode equivalent real mode later chips ibm pc platform direct software access ibm bios routines available real mode since bios written real mode however characteristic x86 cpu ibm bios design order use 64 kb memory segment registers must used created great complications compiler implementors introduced odd pointer modes near far huge leverage implicit nature segmented architecture different degrees pointers containing 16-bit offsets within implied segments pointers containing segment addresses offsets within segments technically possible use 256 kb memory code data 64 kb code setting four segment registers using 16-bit offsets optionally default-segment override prefixes address memory puts substantial restrictions way data addressed memory operands combined violates architectural intent intel designers separate data items e.g arrays structures code units contained separate segments addressed segment addresses new programs ported earlier 8-bit processors 16-bit address spaces addition real mode intel 80286 supports protected mode expanding addressable physical memory 16 mb addressable virtual memory 1 gb providing protected memory prevents programs corrupting one another done using segment registers storing index descriptor table stored memory two tables global descriptor table gdt local descriptor table ldt holding 8192 segment descriptors segment giving access 64 kb memory 80286 segment descriptor provides 24-bit base address base address added 16-bit offset create absolute address base address table fulfills role literal value segment register fulfills real mode segment registers converted direct registers indirect registers segment assigned one four ring levels used hardware-based computer security segment descriptor also contains segment limit field specifies maximum offset may used segment offsets 16 bits segments still limited 64 kb 80286 protected mode time segment register loaded protected mode 80286 must read 6-byte segment descriptor memory set hidden internal registers therefore loading segment registers much slower protected mode real mode changing segments frequently avoided actual memory operations using protected mode segments slowed much 80286 later hardware check offset segment limit parallel instruction execution intel 80386 extended offsets also segment limit field segment descriptor 32 bits enabling segment span entire memory space also introduced support protected mode paging mechanism making possible use paged virtual memory 4 kb page size paging allows cpu map page virtual memory space page physical memory space uses additional mapping tables memory called page tables protected mode 80386 operate paging either enabled disabled segmentation mechanism always active generates virtual addresses mapped paging mechanism enabled segmentation mechanism also effectively disabled setting segments base address 0 size limit equal whole address space also requires minimally-sized segment descriptor table four descriptors since fs gs segments need used paging used extensively modern multitasking operating systems linux 386bsd windows nt developed 386 first intel architecture cpu support paging 32-bit segment offsets 386 architecture became basis development x86 series x86 processors support protected mode boot real mode backward compatibility older 8086 class processors upon power-on a.k.a booting processor initializes real mode begins executing instructions operating system boot code might stored rom may place processor protected mode enable paging features instruction set protected mode similar used real mode however certain constraints apply real mode able use ax cx dx addressing apply protected mode conversely segment arithmetic common practice real mode code allowed protected mode also sub-mode operation 32-bit protected mode a.k.a 80386 protected mode called virtual 8086 mode also known v86 mode basically special hybrid operating mode allows real mode programs operating systems run control protected mode supervisor operating system allows great deal flexibility running protected mode programs real mode programs simultaneously mode exclusively available 32-bit version protected mode exist 16-bit version protected mode long mode mid 1990s obvious 32-bit address space x86 architecture limiting performance applications requiring large data sets 32-bit address space would allow processor directly address 4 gb data size surpassed applications video processing database engines using 64-bit addresses possible directly address 16 eib data although 64-bit architectures support access full 64-bit address space example amd64 supports 48 bits 64-bit address split four paging levels 1999 amd published nearly complete specification 64-bit extension x86 architecture called x86-64 claimed intentions produce design currently used almost x86 processors exceptions intended embedded systems mass-produced x86-64 chips general market available four years later 2003 time spent working prototypes tested refined time initial name x86-64 changed amd64 success amd64 line processors coupled lukewarm reception ia-64 architecture forced intel release implementation amd64 instruction set intel previously implemented support amd64 opted enable hopes amd would bring amd64 market itanium new ia-64 instruction set widely adopted branded implementation amd64 em64t later re-branded intel 64 literature product version names microsoft sun refer amd64/intel 64 collectively x64 windows solaris operating systems linux distributions refer either x86-64 variant x86_64 amd64 bsd systems use amd64 macos uses x86_64 long mode mostly extension 32-bit instruction set unlike 16\u2013to\u201332-bit transition many instructions dropped 64-bit mode affect actual binary backward compatibility would execute legacy code modes retain support instructions changes way assembler compilers new code work first time major extension x86 architecture initiated originated manufacturer intel also first time intel accepted technology nature outside source early x86 processors could extended floating-point hardware form series floating point numerical co-processors names like 8087 80287 80387 abbreviated x87 also known npx numeric processor extension apt name since coprocessors used mainly floating-point calculations also performed integer operations binary decimal formats exceptions 80486 subsequent x86 processors integrated x87 functionality chip made x87 instructions de facto integral part x86 instruction set x87 register known st 0 st 7 80 bits wide stores numbers ieee floating-point standard double extended precision format registers organized stack st 0 top done order conserve opcode space registers therefore randomly accessible either operand register-to-register instruction st0 must always one two operands either source destination regardless whether operand st x memory operand however random access stack registers obtained instruction exchanges specified st x st 0 operations include arithmetic transcendental functions including trigonometric exponential functions well instructions load common constants 0 1 e base natural logarithm log2 10 log10 2 one stack registers integer capability often overlooked x87 operate larger integers single instruction 8086 80286 80386 x86 cpu without 64-bit extensions repeated integer calculations even small values e.g 16-bit accelerated executing integer instructions x86 cpu x87 parallel x86 cpu keeps running x87 coprocessor calculates x87 sets signal x86 finished interrupts x86 needs attention error mmx simd instruction set designed intel introduced 1997 pentium mmx microprocessor mmx instruction set developed similar concept first used intel i860 supported subsequent ia-32 processors intel vendors mmx typically used video processing multimedia applications instance mmx added 8 new registers architecture known mm0 mm7 henceforth referred mmn reality new registers aliases existing x87 fpu stack registers hence anything done floating point stack would also affect mmx registers unlike fp stack mmn registers fixed relative therefore randomly accessible instruction set adopt stack-like semantics existing operating systems could still correctly save restore register state multitasking without modifications mmn registers 64-bit integers however one main concepts mmx instruction set concept packed data types means instead using whole register single 64-bit integer quadword one may use contain two 32-bit integers doubleword four 16-bit integers word eight 8-bit integers byte given mmx 64-bit mmn registers aliased fpu stack floating point registers 80 bits wide upper 16 bits floating point registers unused mmx bits set ones mmx instruction correspond floating point representation nans infinities 1997 amd introduced 3dnow introduction technology coincided rise 3d entertainment applications designed improve cpu vector processing performance graphic-intensive applications 3d video game developers 3d graphics hardware vendors use 3dnow enhance performance amd k6 athlon series processors 3dnow designed natural evolution mmx integers floating point uses exactly register naming convention mmx mm0 mm7 difference instead packing integers registers two single precision floating point numbers packed register advantage aliasing fpu registers instruction data structures used save state fpu registers also used save 3dnow register states thus special modifications required made operating systems would otherwise know 1999 intel introduced streaming simd extensions sse instruction set following 2000 sse2 first addition allowed offloading basic floating-point operations x87 stack second made mmx almost obsolete allowed instructions realistically targeted conventional compilers introduced 2004 along prescott revision pentium 4 processor sse3 added specific memory thread-handling instructions boost performance intel hyperthreading technology amd licensed sse3 instruction set implemented sse3 instructions revision e later athlon 64 processors athlon 64 support hyperthreading lacks sse3 instructions used hyperthreading sse discarded legacy connections fpu stack also meant instruction set discarded legacy connections previous generations simd instruction sets like mmx freed designers allowing use larger registers limited size fpu registers designers created eight 128-bit registers named xmm0 xmm7 note amd64 number sse xmm registers increased 8 16 however downside operating systems awareness new set instructions order able save register states intel created slightly modified version protected mode called enhanced mode enables usage sse instructions whereas stay disabled regular protected mode os aware sse activate enhanced mode whereas unaware os enter traditional protected mode sse simd instruction set works floating point values like 3dnow however unlike 3dnow severs legacy connection fpu stack larger registers 3dnow sse pack twice number single precision floats registers original sse limited single-precision numbers like 3dnow sse2 introduced capability pack double precision numbers 3dnow possibility since double precision number 64-bit size would full size single 3dnow mmn register 128 bits sse xmmn registers could pack two double precision floats one register thus sse2 much suitable scientific calculations either sse1 3dnow limited single precision sse3 introduce additional registers physical address extension pae first added intel pentium pro later amd athlon processors allow 64 gb ram addressed without pae physical ram 32-bit protected mode usually limited 4 gb pae defines different page table structure wider page table entries third level page table allowing additional bits physical address although initial implementations 32-bit processors theoretically supported 64 gb ram chipset platform limitations often restricted could actually used x64 processors define page table structures theoretically allow 52 bits physical address although chipset platform concerns like number dimm slots available maximum ram possible per dimm prevent large physical address space realized x64 processors pae mode must active switch long mode must remain active long mode active long mode non-pae mode pae mode affect width linear virtual addresses 2000s 32-bit x86 processors limitations memory addressing obstacle utilization high-performance computing clusters powerful desktop workstations aged 32-bit x86 competing much advanced 64-bit risc architectures could address much memory intel whole x86 ecosystem needed 64-bit memory addressing x86 survive 64-bit computing era workstation desktop software applications soon start hitting limitations present 32-bit memory addressing however intel felt right time make bold step use transition 64-bit desktop computers transition away x86 architecture general experiment ultimately failed 2001 intel attempted introduce non-x86 64-bit architecture named ia-64 itanium processor initially aiming high-performance computing market hoping would eventually replace 32-bit x86 ia-64 incompatible x86 itanium processor provide emulation capabilities translating x86 instructions ia-64 affected performance x86 programs badly rarely ever actually useful users programmers rewrite x86 programs ia-64 architecture performance itanium would orders magnitude worse true x86 processor market rejected itanium processor since broke backward compatibility preferred continue using x86 chips programs rewritten ia-64 amd decided take another path toward 64-bit memory addressing making sure backward compatibility would suffer april 2003 amd released first x86 processor 64-bit general-purpose registers opteron capable addressing much 4 gb virtual memory using new x86-64 extension also known amd64 x64 64-bit extensions x86 architecture enabled newly introduced long mode therefore 32-bit 16-bit applications operating systems could simply continue using amd64 processor protected modes without even slightest sacrifice performance full compatibility back original instructions 16-bit intel 8086 market responded positively adopting 64-bit amd processors high-performance applications business home computers seeing market rejecting incompatible itanium processor microsoft supporting amd64 intel respond introduced x86-64 processor prescott pentium 4 july 2004 result itanium processor ia-64 instruction set rarely used x86 x86-64 incarnation still dominant cpu architecture non-embedded computers x86-64 also introduced nx bit offers protection security bugs caused buffer overruns result amd 64-bit contribution x86 lineage subsequent acceptance intel 64-bit risc architectures ceased threat x86 ecosystem almost disappeared workstation market x86-64 began utilized powerful supercomputers amd opteron intel xeon incarnations market previously natural habitat 64-bit risc designs ibm power microprocessors sparc processors great leap toward 64-bit computing maintenance backward compatibility 32-bit 16-bit software enabled x86 architecture become extremely flexible platform today x86 chips utilized small low-power systems example intel quark intel atom fast gaming desktop computers example intel core i7 amd fx/ryzen even dominate large supercomputing clusters effectively leaving arm 32-bit 64-bit risc architecture competitor smartphone tablet market prior 2005 x86 architecture processors unable meet popek goldberg requirements specification virtualization created 1974 gerald j. popek robert p. goldberg however proprietary open-source x86 virtualization hypervisor products developed using software-based virtualization proprietary systems include hyper-v parallels workstation vmware esx vmware workstation vmware workstation player windows virtual pc free open-source systems include qemu kqemu virtualbox xen introduction amd-v intel vt-x instruction sets 2005 allowed x86 processors meet popek goldberg virtualization requirements", + "neighbors": [ + 22, + 42, + 51, + 53, + 61, + 76, + 78, + 85, + 86, + 99, + 105, + 106, + 108, + 120, + 123, + 127, + 134, + 137, + 162, + 165, + 175, + 185, + 193, + 206, + 210, + 212, + 219, + 224, + 227, + 230, + 234, + 270, + 271, + 272, + 294, + 308, + 314, + 322, + 331, + 335, + 352, + 379, + 386, + 388, + 392, + 413, + 434, + 445, + 448, + 457, + 460, + 465, + 486, + 508, + 521, + 529, + 571, + 589, + 611, + 615, + 639, + 641, + 643, + 659, + 661, + 679, + 719, + 731, + 738, + 752, + 754, + 776, + 787, + 797, + 803, + 805, + 821, + 830, + 837, + 846, + 847, + 868, + 870, + 891, + 907, + 918, + 925, + 937, + 938, + 941, + 946, + 957, + 961, + 979, + 980, + 984, + 988, + 994, + 996, + 1002, + 1009, + 1013, + 1016, + 1040, + 1044, + 1052, + 1061, + 1072, + 1081, + 1109, + 1111, + 1113, + 1123, + 1125, + 1138, + 1152, + 1158, + 1160, + 1161, + 1174, + 1188, + 1193, + 1196, + 1208, + 1213, + 1219, + 1221, + 1222, + 1224, + 1231, + 1256, + 1259, + 1263, + 1272, + 1274, + 1276, + 1284, + 1287, + 1290, + 1301, + 1302, + 1304, + 1320, + 1322, + 1346, + 1351, + 1360, + 1363, + 1394, + 1398, + 1417, + 1427, + 1466, + 1468, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1524, + 1525, + 1538, + 1557, + 1558, + 1605, + 1608, + 1616, + 1621, + 1631, + 1632, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 86, + "label": 3, + "text": "Stream_processing:stream processing stream processing computer programming paradigm equivalent dataflow programming event stream processing reactive programming allows applications easily exploit limited form parallel processing applications use multiple computational units floating point unit graphics processing unit field-programmable gate arrays fpgas without explicitly managing allocation synchronization communication among units stream processing paradigm simplifies parallel software hardware restricting parallel computation performed given sequence data stream series operations kernel functions applied element stream kernel functions usually pipelined optimal local on-chip memory reuse attempted order minimize loss bandwidth accredited external memory interaction uniform streaming one kernel function applied elements stream typical since kernel stream abstractions expose data dependencies compiler tools fully automate optimize on-chip management tasks stream processing hardware use scoreboarding example initiate direct memory access dma dependencies become known elimination manual dma management reduces software complexity associated elimination hardware cached i/o reduces data area expanse involved service specialized computational units arithmetic logic units 1980s stream processing explored within dataflow programming example language sisal streams iteration single assignment language stream processing essentially compromise driven data-centric model works well traditional dsp gpu-type applications image video digital signal processing less general purpose processing randomized data access databases sacrificing flexibility model implications allow easier faster efficient execution depending context processor design may tuned maximum efficiency trade-off flexibility stream processing especially suitable applications exhibit three application characteristics examples records within streams include record read input perform operations write output permissible multiple inputs multiple outputs never piece memory readable writable basic computers started sequential execution paradigm traditional cpus sisd based means conceptually perform one operation time computing needs world evolved amount data managed increased quickly obvious sequential programming model could cope increased need processing power various efforts spent finding alternative ways perform massive amounts computations solution exploit level parallel execution result efforts simd programming paradigm allowed applying one instruction multiple instances different data time simd used swar environment using complicated structures one could also mimd parallelism although two paradigms efficient real-world implementations plagued limitations memory alignment problems synchronization issues limited parallelism simd processors survived stand-alone components embedded standard cpus consider simple program adding two arrays containing 100 4-component vectors i.e 400 numbers total sequential paradigm familiar variations exist inner loops structures ultimately boil construct actually oversimplified assumes instruction codice_1 works although happens instruction intrinsics much information actually taken account number vector components data format done clarity see however method reduces number decoded instructions numelements componentsperelement numelements number jump instructions also decreased loop run fewer times gains result parallel execution four mathematical operations happened however packed simd register holds certain amount data possible get parallelism speed somewhat limited assumption made performing four parallel operations please note common altivec sse paradigm whole dataset defined rather component block defined separately describing set data assumed first two rows result inferred sources kernel simplicity 1:1 mapping input output data need applied kernels also much complex implementation paradigm unroll loop internally allows throughput scale chip complexity easily utilizing hundreds alus elimination complex data patterns makes much extra power available stream processing branch simd/mimd processing must confused although simd implementations often work streaming manner performance comparable model envisions different usage pattern allows far greater performance noted applied generic processors standard cpu 1.5x speedup reached contrast ad-hoc stream processors easily reach 10x performance mainly attributed efficient memory access higher levels parallel processing although various degrees flexibility allowed model stream processors usually impose limitations kernel stream size example consumer hardware often lacks ability perform high-precision math lacks complex indirection chains presents lower limits number instructions executed stanford university stream processing projects included stanford real-time programmable shading project started 1999 prototype called imagine developed 2002 project called merrimac ran 2004 also researched stream-enhanced processors graphics processing units rapidly evolved speed functionality since early days dozens stream processing languages developed well specialized hardware immediate challenge realm parallel processing lie much type hardware architecture used easy program system question real-world environment acceptable performance machines like imagine use straightforward single-threaded model automated dependencies memory allocation dma scheduling result research mit stanford finding optimal layering tasks programmer tools hardware programmers beat tools mapping algorithms parallel hardware tools beat programmers figuring smartest memory allocation schemes etc particular concern mimd designs cell programmer needs deal application partitioning across multiple cores deal process synchronization load balancing efficient multi-core programming tools severely lacking today drawback simd programming issue array-of-structures aos structure-of-arrays soa programmers often wanted build data structures 'real meaning example happened structures assembled arrays keep things nicely organized array structures aos structure laid memory compiler produce interleaved data sense structures contiguous constant offset say size attribute structure instance element following instance offset depends structure definition possibly things considered compiler policies also problems example three position variables simd-ized way sure allocated continuous memory space make sure simd operations work shall grouped 'packed memory location least array another problem lies color xyz defined three-component vector quantities simd processors usually support 4-component operations exceptions however kinds problems limitations made simd acceleration standard cpus quite nasty proposed solution structure arrays soa follows readers experienced c '* identifier means pointer case used point first element array allocated later java programmers roughly equivalent drawback various attributes could spread memory make sure cause cache misses 'll update various reds greens blues stream processors usage structures encouraged application point view attributes defined flexibility taking gpus reference set attributes least 16 available attribute application state number components format components primitive data types supported various attributes attached memory block possibly defining stride 'consecutive elements attributes effectively allowing interleaved data gpu begins stream processing gather various attributes single set parameters usually looks like structure magic global variable performs operations scatters results memory area later processing retrieving modern stream processing frameworks provide fifo like interface structure data literal stream abstraction provides means specify data dependencies implicitly enabling runtime/hardware take full advantage knowledge efficient computation one simplest efficient stream processing modalities date c++ raftlib enables linking independent compute kernels together data flow graph using c++ stream operators example apart specifying streaming applications high-level language models computation mocs also widely used dataflow models process-based models historically cpus began implementing various tiers memory access optimizations ever-increasing performance compared relatively slow growing external memory bandwidth gap widened big amounts die area dedicated hiding memory latencies since fetching information opcodes alus expensive little die area dedicated actual mathematical machinery rough estimation consider less 10 similar architecture exists stream processors thanks new programming model amount transistors dedicated management actually little beginning whole system point view stream processors usually exist controlled environment gpus exist add-in board seems also apply imagine cpus dirty job managing system resources running applications stream processor usually equipped fast efficient proprietary memory bus crossbar switches common multi-buses employed past exact amount memory lanes dependent market range written still 64-bit wide interconnections around entry-level mid-range models use fast 128-bit crossbar switch matrix 4 2 segments high-end models deploy huge amounts memory actually 512 mb slightly slower crossbar 256 bits wide contrast standard processors intel pentium athlon 64 single 64-bit wide data bus memory access patterns much predictable arrays exist dimension fixed kernel invocation thing closely matches multiple pointer indirection indirection chain however guaranteed finally read write specific memory area inside stream simd nature stream processor execution units alus clusters read/write operations expected happen bulk memories optimized high bandwidth rather low latency difference rambus ddr sdram example also allows efficient memory bus negotiations 90 stream processor work done on-chip requiring 1 global data stored memory knowing kernel temporaries dependencies pays internally stream processor features clever communication management circuits interesting stream register file srf conceptually large cache stream data stored transferred external memory bulks cache-like software-controlled structure various alus srf shared various alu clusters key concept innovation done stanford imagine chip compiler able automate allocate memory optimal way fully transparent programmer dependencies kernel functions data known programming model enables compiler perform flow analysis optimally pack srfs commonly cache dma management take majority project schedule something stream processor least imagine totally automates tests done stanford showed compiler well better job scheduling memory hand tuned thing much effort proof lot clusters inter-cluster communication assumed rare internally however cluster efficiently exploit much lower amount alus intra-cluster communication common thus needs highly efficient keep alus fetched data alu equipped local register files lrfs basically usable registers three-tiered data access pattern makes easy keep temporary data away slow memories thus making silicon implementation highly efficient power-saving although order magnitude speedup reasonably expected even mainstream gpus computing streaming manner applications benefit communication latencies actually biggest problem although pci express improved full-duplex communications getting gpu possibly generic stream processor work possibly take long amounts time means usually counter-productive use small datasets changing kernel rather expensive operation stream architecture also incurs penalties small streams behaviour referred short stream effect pipelining widespread heavily used practice stream processors gpus featuring pipelines exceeding 200 stages cost switching settings dependent setting modified considered always expensive avoid problems various levels pipeline many techniques deployed \u00fcber shaders texture atlases techniques game-oriented nature gpus concepts interesting generic stream processing well programming languages stream processors start java c c++ add extensions provide specific instructions allow application developers tag kernels and/or streams also applies shading languages considered stream programming languages certain degree non-commercial examples stream programming languages include commercial implementations either general purpose tied specific hardware vendor examples general purpose languages include vendor-specific languages include event-based processing batch file-based processing emulates actual stream processing much lower performance general continuous operator stream processing stream processing services", + "neighbors": [ + 51, + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 208, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 280, + 300, + 306, + 314, + 335, + 340, + 355, + 362, + 375, + 388, + 445, + 457, + 460, + 465, + 508, + 589, + 611, + 643, + 659, + 719, + 737, + 752, + 776, + 803, + 821, + 846, + 847, + 876, + 893, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1099, + 1111, + 1113, + 1125, + 1158, + 1161, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1329, + 1469, + 1503, + 1505, + 1507, + 1518, + 1525, + 1557, + 1608, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 87, + "label": 9, + "text": "Alan_Kay:alan kay alan curtis kay born may 17 1940 american computer scientist elected fellow american academy arts sciences national academy engineering royal society arts best known pioneering work object-oriented programming windowing graphical user interface design president viewpoints research institute adjunct professor computer science university california los angeles also advisory board tti/vanguard mid-2005 senior fellow hp labs visiting professor kyoto university adjunct professor massachusetts institute technology mit kay also former professional jazz guitarist composer theatrical designer amateur classical pipe organist interview education america davis group ltd. kay said originally springfield massachusetts kay family relocated several times due father career physiology ultimately settling new york metropolitan area nine attended prestigious brooklyn technical high school suspended due insubordination senior year already accumulated enough credits graduate kay attended bethany college bethany west virginia majored biology minored mathematics asked leave administration protesting institution jewish quota thereafter kay taught guitar denver colorado year hastily enlisted united states air force local draft board inquired nonstudent status assigned computer programmer rare billet dominated women due secretarial connotations field era passing aptitude test devised early cross-platform file transfer system following discharge kay enrolled university colorado boulder earning bachelor degree mathematics molecular biology 1966 time worked professional jazz guitarist studies cu wrote music adaptation hobbit campus theatricals autumn 1966 began graduate school university utah college engineering earned m.s electrical engineering 1968 taking ph.d. computer science 1969 doctoral dissertation flex flexible extendable language described invention computer language known flex worked fathers computer graphics david c. evans recently recruited university california berkeley start utah computer science department ivan sutherland best known writing pioneering programs sketchpad mentorship greatly inspired kay evolving views objects programming grew busier darpa research ended musical career 1968 met seymour papert learned logo programming language dialect lisp optimized educational purposes led learn work jean piaget jerome bruner lev vygotsky constructionist learning influencing professional orientation leaving utah associate professor computer science 1969 kay became visiting researcher stanford artificial intelligence laboratory anticipation accepting professorship carnegie mellon university instead 1970 joined xerox parc research staff palo alto california throughout decade developed prototypes networked workstations using programming language smalltalk inventions later commercialized apple lisa macintosh computers kay one fathers idea object-oriented programming named along colleagues parc original object-oriented concepts including use words 'object 'class developed simula 67 norwegian computing center later said 'm sorry long ago coined term objects topic gets many people focus lesser idea big idea messaging parc kay conceived dynabook concept key progenitor laptop tablet computers e-book also architect modern overlapping windowing graphical user interface gui dynabook conceived educational platform kay considered one first researchers mobile learning many features dynabook concept adopted design one laptop per child educational platform kay actively involved field computing awaiting new revolution happen according kay educational communities parents children see set tools invented douglas engelbart medium marshall mcluhan sense wrote simulas leading oop encounter finally hit destiny personal computing really going personal dynamic vehicle engelbart metaphor opposed ibm railroads something much profound personal dynamic medium vehicle one could wait high school give drivers ed medium extend world childhood 1981 1984 kay atari chief scientist became apple fellow 1984 following closure company advanced technology group 1997 recruited friend bran ferren head research development disney join walt disney imagineering disney fellow remained ferren left start applied minds inc imagineer danny hillis leading cessation fellows program 2001 founded viewpoints research institute non-profit organization dedicated children learning advanced software development first ten years kay viewpoints group based applied minds glendale california ferren continued work together various projects kay also senior fellow hewlett-packard hp disbanded advanced software research team july 20 2005 kay taught fall 2011 class powerful ideas useful tools understand world new york university interactive telecommunications program itp along full-time itp faculty member nancy hechinger goal class devise new forms teaching/learning based fundamental powerful concepts rather traditional rote learning december 1995 still apple kay collaborated many others start open source squeak version smalltalk continues work part effort november 1996 team began research became etoys system recently started along david a. smith david p. reed andreas raab rick mcgeer julian lombardi mark mccahill croquet project open source networked 2d 3d environment collaborative work 2001 became clear etoy architecture squeak reached limits morphic interface infrastructure could andreas raab researcher working kay group hewlett-packard proposed defining script process providing default scheduling mechanism avoids several general problems result new user interface proposed replace squeak morphic user interface future tweak added mechanisms islands asynchronous messaging players costumes language extensions projects tile scripting underlying object system class-based users programming acts like prototype-based tweak objects created run tweak project windows november 2005 world summit information society mit research laboratories unveiled new laptop computer educational use around world many names 100 laptop one laptop per child program children machine xo-1 program begun sustained kay friend nicholas negroponte based kay dynabook ideal kay prominent co-developer computer focusing educational software using squeak etoys kay lectured extensively idea computer revolution new good ideas universally implemented lectures oopsla 1997 conference acm turing award talk entitled computer revolution n't happened yet informed experiences sketchpad simula smalltalk bloated code commercial software august 31 2006 kay proposal united states national science foundation nsf granted thus funding viewpoints research institute several years proposal title steps toward reinvention programming compact practical model personal computing self-exploratorium sense kay trying comes quote abstract seminar given intel research labs berkeley conglomeration commercial open source software consumes neighborhood several hundreds millions lines code days wonder small could understandable practical model design covers functionality 1m lines code 200k loc 100k loc 20k loc alan kay received many awards honors among honors include j-d warnier prix d'informatique acm systems software award nec computers communication foundation prize funai foundation prize lewis branscomb technology award acm sigcse award outstanding contributions computer science education", + "neighbors": [ + 345, + 378, + 755, + 789, + 919, + 934, + 1095, + 1146, + 1324, + 1404, + 1409, + 1606, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 88, + "label": 4, + "text": "Certificate_authority:certificate authority cryptography certificate authority certification authority ca entity issues digital certificates digital certificate certifies ownership public key named subject certificate allows others relying parties rely upon signatures assertions made private key corresponds certified public key ca acts trusted third party\u2014trusted subject owner certificate party relying upon certificate format certificates specified x.509 standard one particularly common use certificate authorities sign certificates used https secure browsing protocol world wide web another common use issuing identity cards national governments use electronically signing documents trusted certificates used create secure connections server via internet certificate essential order circumvent malicious party happens route target server acts target scenario commonly referred man-in-the-middle attack client uses ca certificate authenticate ca signature server certificate part authorizations launching secure connection usually client software\u2014for example browsers\u2014include set trusted ca certificates makes sense many users need trust client software malicious compromised client skip security check still fool users believing otherwise clients ca server supervisors call certificate servers bestow users commercial cas charge issue certificates customers anticipate ca certificate contained within majority web browsers safe connections certified servers work efficiently out-of-the-box quantity internet browsers devices applications trust particular certificate authority referred ubiquity mozilla non-profit business issues several commercial ca certificates products mozilla developed policy ca/browser forum developed similar guidelines ca trust single ca certificate may shared among multiple cas resellers root ca certificate may base issue multiple intermediate ca certificates varying validation requirements addition commercial cas non-profits issue digital certificates public without charge notable examples cacert let encrypt large organizations government bodies may pkis public key infrastructure containing cas site using self-signed certificates acts ca browsers clients sorts characteristically allow users add away ca certificates server certificates regularly last relatively short period ca certificates extended repeatedly visited servers less error-prone importing trusting ca issued rather confirm security exemption time server certificate renewed less often trustworthy certificates used encrypting signing messages cas dispense end-user certificates used s/mime however encryption entails receiver public key since authors receivers encrypted messages apparently know one another usefulness trusted third party remains confined signature verification messages sent public mailing lists worldwide certificate authority business fragmented national regional providers dominating home market many uses digital certificates legally binding digital signatures linked local law regulations accreditation schemes certificate authorities however market globally trusted tls/ssl server certificates largely held small number multinational companies market significant barriers entry due technical requirements legally required new providers may choose undergo annual security audits webtrust certificate authorities north america etsi europe included trusted root web browser operating system 180 root certificates trusted mozilla firefox web browser representing approximately eighty organizations 200 root certificates trusted macos android 4.2 jelly bean android currently contains 100 cas updated release november 18 2014 group companies nonprofit organizations including electronic frontier foundation mozilla cisco akamai announced let encrypt nonprofit certificate authority provides free domain validated x.509 certificates well software enable installation maintenance certificates let encrypt operated newly formed internet security research group california nonprofit recognized tax-exempt section 501 c 3 according netcraft may 2015 industry standard monitoring active tls certificates states although global tls ecosystem competitive dominated handful major cas \u2014 three certificate authorities symantec comodo godaddy account three-quarters issued tls certificates public-facing web servers top spot held symantec verisign purchased symantec ever since survey began currently accounting third certificates illustrate effect differing methodologies amongst million busiest sites symantec issued 44 valid trusted certificates use \u2014 significantly overall market share w3techs survey may 2015 shows w3techs survey november 2017 shows w3techs survey may 2018 shows identrust cross-signer let encrypt intermediates risen popular ssl certificate authority symantec dropped chart due security services acquired digicert commercial cas issue bulk certificates https servers typically use technique called domain validation authenticate recipient certificate techniques used domain validation vary cas general domain validation techniques meant prove certificate applicant controls given domain name information applicant identity many certificate authorities also offer extended validation ev certificates rigorous alternative domain validated certificates extended validation intended verify control domain name additional identity information included certificate browsers display additional identity information green box url bar one limitation ev solution weaknesses domain validation attackers could still obtain domain validated certificate victim domain deploy attack occurred difference observable victim user would absence green bar company name question whether users would likely recognise absence indicative attack progress test using internet explorer 7 2009 showed absence ie7 ev warnings noticed users however microsoft current browser edge shows significantly greater difference ev domain validated certificates domain validated certificates hollow grey lock domain validation suffers certain structural security limitations particular always vulnerable attacks allow adversary observe domain validation probes cas send include attacks dns tcp bgp protocols lack cryptographic protections tls/ssl compromise routers attacks possible either network near ca near victim domain one common domain validation techniques involves sending email containing authentication token link email address likely administratively responsible domain could technical contact email address listed domain whois entry administrative email like admin administrator webmaster hostmaster postmaster domain certificate authorities may accept confirmation using root info support domain theory behind domain validation legitimate owner domain would able read emails sent administrative addresses domain validation implementations sometimes source security vulnerabilities one instance security researchers showed attackers could obtain certificates webmail sites ca willing use email address like ssladmin domain.com domain.com webmail systems reserved ssladmin username prevent attackers registering prior 2011 standard list email addresses could used domain validation clear email administrators addresses needed reserved first version ca/browser forum baseline requirements adopted november 2011 specified list addresses allowed mail hosts reserve addresses administrative use though precautions still universal january 2015 finnish man registered username hostmaster finnish version microsoft live able obtain domain-validated certificate live.fi despite owner domain name ca issues digital certificates contain public key identity owner matching private key made available publicly kept secret end user generated key pair certificate also confirmation validation ca public key contained certificate belongs person organization server entity noted certificate ca obligation schemes verify applicant credentials users relying parties trust information ca certificates cas use variety standards tests essence certificate authority responsible saying yes person say ca certify user trusts ca verify ca signature also assume certain public key indeed belong whoever identified certificate public-key cryptography used encrypt data communicated two parties typically happen user logs site implements http secure protocol example let us suppose user logs bank homepage www.bank.example online banking user opens www.bank.example homepage receive public key along data web-browser displays public key could used encrypt data client server safe procedure use protocol determines temporary shared symmetric encryption key messages key exchange protocol enciphered bank public key way bank server private key read rest communication proceeds using new disposable symmetric key user enters information bank page submits page sends information back bank data user entered page encrypted web browser therefore even someone access encrypted data communicated user www.bank.example eavesdropper read decipher mechanism safe user sure bank see web browser user types www.bank.example communication hijacked fake website pretends bank website sends page information back user browser fake web-page send fake public key user fake site owns matching private key user fill form personal data submit page fake web-page get access user data certificate authority mechanism intended prevent certificate authority ca organization stores public keys owners every party communication trusts organization knows public key user web browser receives public key www.bank.example also receives digital signature key information so-called x.509 certificate browser already possesses public key ca consequently verify signature trust certificate public key since www.bank.example uses public key certification authority certifies fake www.bank.example use public key since fake www.bank.example know corresponding private key create signature needed verify authenticity difficult assure correctness match data entity data presented ca perhaps electronic network credentials person/company/program asking certificate likewise presented commercial cas often use combination authentication techniques including leveraging government bureaus payment infrastructure third parties databases services custom heuristics enterprise systems local forms authentication kerberos used obtain certificate turn used external relying parties notaries required cases personally know party whose signature notarized higher standard reached many cas according american bar association outline online transaction management primary points us federal state statutes enacted regarding digital signatures prevent conflicting overly burdensome local regulation establish electronic writings satisfy traditional requirements associated paper documents us e-sign statute suggested ueta code help ensure despite security measures undertaken correctly verify identities people companies risk single ca issuing bogus certificate imposter also possible register individuals companies similar names may lead confusion minimize hazard certificate transparency initiative proposes auditing certificates public unforgeable log could help prevention phishing large-scale deployments alice may familiar bob certificate authority perhaps different ca server bob certificate may also include ca public key signed different ca presumably recognizable alice process typically leads hierarchy mesh cas ca certificates authority revocation list arl form certificate revocation list crl containing certificates issued certificate authorities contrary crls contain revoked end-entity certificates ca/browser forum publishes baseline requirements list policies technical requirements cas follow requirement inclusion certificate stores firefox safari ca subverted security entire system lost potentially subverting entities trust compromised ca example suppose attacker eve manages get ca issue certificate claims represent alice certificate would publicly state represents alice might include information alice information alice employer name might true increasing certificate credibility eve however would all-important private key associated certificate eve could use certificate send digitally signed email bob tricking bob believing email alice bob might even respond encrypted email believing could read alice eve actually able decrypt using private key notable case ca subversion like occurred 2001 certificate authority verisign issued two certificates person claiming represent microsoft certificates name microsoft corporation could used spoof someone believing updates microsoft software came microsoft actually fraud detected early 2001 microsoft verisign took steps limit impact problem 2011 fraudulent certificates obtained comodo diginotar allegedly iranian hackers evidence fraudulent diginotar certificates used man-in-the-middle attack iran 2012 became known trustwave issued subordinate root certificate used transparent traffic management man-in-the-middle effectively permitted enterprise sniff ssl internal network traffic using subordinate certificate attacker steals certificate authority private keys able forge certificates ca without needed ongoing access ca systems key theft therefore one main risks certificate authorities defend publicly trusted cas almost always store keys hardware security module hsm allows sign certificates key generally prevent extraction key physical software controls cas typically take precaution keeping key long-term root certificates hsm kept offline except needed sign shorter-lived intermediate certificates intermediate certificates stored online hsm day-to-day work signing end-entity certificates keeping revocation information date cas sometimes use key ceremony generating signing keys order ensure keys tampered copied critical weakness way current x.509 scheme implemented ca trusted particular party issue certificates domain choose certificates accepted valid trusting party whether legitimate authorized serious shortcoming given commonly encountered technology employing x.509 trusted third parties https protocol major web browsers distributed end-users pre-configured list trusted cas numbers dozens means one pre-approved trusted cas issue valid certificate domain whatsoever industry response muted given contents browser pre-configured trusted ca list determined independently party distributing causing installed browser application really nothing cas issue driving impetus behind development dns-based authentication named entities dane protocol adopted conjunction domain name system security extensions dnssec dane greatly reduce completely eliminate role trusted third parties domain pki various software available operate certificate authority generally software required sign certificates maintain revocation information operate ocsp crl services examples", + "neighbors": [ + 88, + 148, + 172, + 235, + 257, + 260, + 261, + 319, + 333, + 533, + 539, + 542, + 554, + 692, + 818, + 826, + 864, + 965, + 1003, + 1089, + 1121, + 1151, + 1240, + 1266, + 1331, + 1452, + 1534, + 1597, + 1624, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 89, + "label": 1, + "text": "BBC_Genome_Project:bbc genome project bbc genome project digitised searchable database programme listings initially based upon contents radio times first issue 1923 2009 tv listings post 2009 accessed via bbc programmes site bbc genome bbc first online searchable database april 2006 bbc gave public access infax bbc programme database time infax contained around 900,000 entries every programme ever broadcast ceased operation december 2007 front page website still available see via internet archive infax ceased message website said would incorporating information individual programme pages 2012 replaced database fabric internal use within bbc december 2012 bbc completed digitisation exercise scanning listings radio times bbc programmes 1923-2009 entire run 4,500 copies magazine identified around five million programmes involving 8.5 million actors presenters writers technical staff listings published advance include late changes cancellations reflected infax however include huge numbers early radio television broadcasts dj shows bbc radio 1 bbc radio 2 rarely kept officially listed infax also usually include repeats archived programmes prior 1976 bbc archives issues scanned high resolution producing tif images optical character recognition ocr used turn text page searchable text genome database bbc genome released public use 15 october 2014 aim project allow researchers able find information easier help bbc archives build picture exists currently missing archive corrections ocr errors changes advertised schedules crowdsourced 440,910 user generated edits accepted editorial review mid-december 2018 listing entry unique identifier may expressed url example first screening doctor http //genome.ch.bbc.co.uk/8f81c193ba224e84981f353cae480d49 broadcast programme may one identifier broadcast thus listed repeat occasions different regions digitised editions entire magazines including front covers prose articles advertisements non-listings content 1920s added march 2017 1930s december 2017 1940s december 2018", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 90, + "label": 4, + "text": "Administrative_domain:administrative domain administrative domain service provider holding security repository permitting easily authenticate authorize clients credentials particularly applies computer network security concept captured 'admindomain class glue information model administrative domain mainly used intranet environments may implemented collection hosts routers interconnecting network managed single administrative authority interoperation different administrative domains different security repositories different security software different security policies notoriously difficult therefore administrative domains wishing ad hoc interoperation full interoperability build federation", + "neighbors": [ + 149, + 378, + 646, + 762, + 847, + 968, + 1039, + 1131 + ], + "mask": "Test" + }, + { + "node_id": 91, + "label": 4, + "text": "CryptoLocker:cryptolocker cryptolocker ransomware attack cyberattack using cryptolocker ransomware occurred 5 september 2013 late may 2014 attack utilized trojan targeted computers running microsoft windows believed first posted internet 5 september 2013 propagated via infected email attachments via existing gameover zeus botnet activated malware encrypted certain types files stored local mounted network drives using rsa public-key cryptography private key stored malware control servers malware displayed message offered decrypt data payment either bitcoin pre-paid cash voucher made stated deadline threatened delete private key deadline passes deadline met malware offered decrypt data via online service provided malware operators significantly higher price bitcoin guarantee payment would release encrypted content although cryptolocker easily removed affected files remained encrypted way researchers considered unfeasible break many said ransom paid offer way recover files others said paying ransom way recover files backed victims claimed paying ransom always lead files decrypted cryptolocker isolated late may 2014 via operation tovar took gameover zeus botnet used distribute malware operation security firm involved process obtained database private keys used cryptolocker turn used build online tool recovering keys files without paying ransom believed operators cryptolocker successfully extorted total around 3 million victims trojan instances encryption-based ransomware followed used cryptolocker name variations otherwise unrelated cryptolocker typically propagated attachment seemingly innocuous e-mail message appears sent legitimate company zip file attached email message contains executable file filename icon disguised pdf file taking advantage windows default behaviour hiding extension file names disguise real .exe extension cryptolocker also propagated using gameover zeus trojan botnet first run payload installs user profile folder adds key registry causes run startup attempts contact one several designated command control servers connected server generates 2048-bit rsa key pair sends public key back infected computer server may local proxy go others frequently relocated different countries make tracing difficult payload encrypts files across local hard drives mapped network drives public key logs file encrypted registry key process encrypts data files certain extensions including microsoft office opendocument documents pictures autocad files payload displays message informing user files encrypted demands payment 400 usd euro anonymous pre-paid cash voucher i.e moneypak ukash equivalent amount bitcoin btc within 72 100 hours starting 2 btc ransom price adjusted 0.3 btc operators reflect fluctuating value bitcoin else private key server would destroyed nobody never able restore files payment ransom allows user download decryption program pre-loaded user private key infected victims claim paid attackers files decrypted november 2013 operators cryptolocker launched online service claimed allow users decrypt files without cryptolocker program purchase decryption key deadline expired process involved uploading encrypted file site sample waiting service find match site claimed match would found within 24 hours found user could pay key online 72-hour deadline passed cost increased 10 bitcoin 2 june 2014 united states department justice officially announced previous weekend operation tovar\u2014a consortium constituting group law enforcement agencies including fbi interpol security software vendors several universities disrupted gameover zeus botnet used distribute cryptolocker malware department justice also publicly issued indictment russian hacker evgeniy bogachev alleged involvement botnet part operation dutch security firm fox-it able procure database private keys used cryptolocker august 2014 fox-it fellow firm fireeye introduced online service allows infected users retrieve private key uploading sample file receive decryption tool security software designed detect threats might detect cryptolocker encryption underway complete particularly new version unknown protective software distributed attack suspected detected early stages takes time encryption take place immediate removal malware relatively simple process completed would limit damage data experts suggested precautionary measures using software security policies block cryptolocker payload launching due nature cryptolocker operation experts reluctantly suggested paying ransom way recover files cryptolocker absence current backups offline backups made infection inaccessible infected computers attacked cryptolocker due length key employed cryptolocker experts considered practically impossible use brute-force attack obtain key needed decrypt files without paying ransom similar 2008 trojan gpcode.ak used 1024-bit key believed large enough computationally infeasible break without concerted distributed effort discovery flaw could used break encryption sophos security analyst paul ducklin speculated cryptolocker online decryption service involved dictionary attack encryption using database keys explaining requirement wait 24 hours receive result december 2013 zdnet traced four bitcoin addresses posted users infected cryptolocker attempt gauge operators takings four addresses showed movement 41,928 btc 15 october 18 december us 27 million time survey researchers university kent 41 claimed victims said decided pay ransom proportion much larger expected symantec estimated 3 victims paid dell secureworks estimated 0.4 victims paid following shutdown botnet used distribute cryptolocker calculated 1.3 infected paid ransom many able recover files backed others believed lost huge amounts data nonetheless operators believed extorted total around 3 million success cryptolocker spawned number unrelated similarly named ransomware trojans working essentially way including refer cryptolocker \u2014but according security researchers unrelated original cryptolocker september 2014 clones cryptowall torrentlocker whose payload identifies cryptolocker named use registry key named bit torrent application began spreading australia ransomware uses infected e-mails purportedly sent government departments e.g australia post indicate failed parcel delivery payload evade detection automatic e-mail scanners follow links variant designed require users visit web page enter captcha code payload actually downloaded symantec determined new variants identified cryptolocker.f tied original", + "neighbors": [ + 43, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 494, + 505, + 528, + 533, + 550, + 564, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 678, + 708, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1112, + 1138, + 1162, + 1186, + 1240, + 1270, + 1291, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 92, + "label": 1, + "text": "AustLit:_The_Australian_Literature_Resource:austlit australian literature resource austlit australian literature resource internet-based collaboration researchers librarians australian universities designed comprehensively record history australian literary story making cultures austlit encyclopaedia australian writers writing austlit founded 2000 resource research infrastructure literary studies funded participating universities australian research council university queensland leads consortium partner universities include university new south wales university sydney flinders university university wollongong james cook university university western australia significant levels research teaching field undertaken partner universities austlit publishes biographical entries brief essays australian writers critics storytellers organisational histories relating publishers theatre companies arts organisations complete bibliographical histories works fiction criticism also active digitisation program generate full text versions out-of-print literary works critical articles australian literature austlit research communities support detailed explorations particular aspects australia literary culture researchers work within austlit create datasets around specific field projects range across book magazine publishing histories subject specific surveys regionally based publishing thematically based subsets research history australian popular pulp fiction supported alongside research theatre history drama multicultural writers blackwords landmark austlit research project details lives work indigenous australian authors includes australian aboriginal torres strait islander writers storytellers austlit become key information resource study australian literature related fields status comprehensive record nation publishing history austlit become important source data analysing australian literary history", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 93, + "label": 2, + "text": "Windows_SideShow:windows sideshow windows sideshow technology developed microsoft introduced windows vista operating system designed provide information number unread e-mail messages rss feeds secondary display windows-based device displays may integrated part device included part separate component connected personal computer sideshow integrates windows gadgets feature windows vista windows 7 also integrate applications windows media center sideshow discontinued windows 8.1 auxiliary displays listed microsoft among forms information indicators personal computers windows hardware engineering conference 2003 auxiliary display feature later presented microsoft winhec 2004 scheduled included windows vista known codename longhorn intended tablet pcs mobile devices provide users up-to-date information glance increase value windows operating system new mobile scenarios auxiliary display support included among mobile features scheduled operating system including windows mobility center speech recognition windows hotstart listed part microsoft mobile pc strategy prototype auxiliary display device demonstrated intel intel developer forum conference fall 2004 february 2005 microsoft announced first beta version windows vista codenamed longhorn would include support feature preliminary software development kit would also released concurrently operating system winhec 2005 microsoft released details sideshow development platform discussed new scenarios enabled technology prototypes also produced several original equipment manufacturers oems displayed conference microsoft would release details year later winhec 2006 additional hardware also displayed windows vista released manufacturing november 8 2006 includes two sideshow gadgets one windows mail one windows media player microsoft office 2007 released manufacturing day windows vista included outlook 2007 calendar gadget sideshow windows 7 microsoft introduced multiple user support gadgets improved reliability resiliency sideshow apis gadgets multiple devices improved asynchronous processing throughput updated sideshow control panel experience changes prominent link settings introduction tooltip descriptions gadgets windows sideshow displays embedded part device separate component examples include electronic visual display integrated part keyboard digital photo frames receive information wirelessly wireless devices connected personal computer wireless network technologies including bluetooth wi-fi manufacturers may also produce detachable displays sideshow devices display various types information contacts calendar appointments e-mail maps rss feeds serve indicators system information battery life wireless network strength microsoft published documentation suggests additional uses sideshow devices ability transmit information notifications received computer across televisions set-top boxes ability serve second screen pc games content e.g. character statistics maps enable new multitasking scenarios gameplay sideshow features integration windows desktop gadget feature windows vista windows 7 enables single gadget operate simultaneously user desktop supplying data across devices sideshow uses windows portable devices infrastructure communicate devices viewed portable device file explorer users also adjust interact files included part auxiliary displays auxiliary displays appear device manager integrate windows vista function discovery technology gadget developed sideshow written programming windows sideshow platform application programming interface\u2014a native code com-based api introduced windows vista managed api .net framework developers also released microsoft includes development templates visual studio 2005 visual studio 2008 aid development gadgets microsoft released sideshow simulator emulates functionality sideshow-compatible device thereby allowing developers test appearance functionality gadgets without requiring physical hardware devices windows sideshow different hardware traits devices mobile phones pdas former processor need rely solely connection computer processing tasks online offline abilities allow device run larger components connected computer following list contains typical device display types technologies hardware-specific native applications provide rich-media experiences like audio video playback accessed sideshow user interface require sdk specific platform vendor example nvidia provides preface platform includes abilities like mp3 aac mpeg-4 encode-decode digital media formats oems accepted sideshow 2007 asus announced w5fe laptop full-color 2.8-inch sideshow display front cover 2006 featured winhec 7-inch 10-inch momento digital photo frames released developer living picture provided sideshow functionality wifi subsequently marketed i-mate along momento live picture service shut 2009 october 2007 dell released xps 420 included sideshow device top front machine widely promoted found little use quietly dropped xps 430 came year later february 1 2010 ikanos consulting announced threemote suite windows sideshow-compatible products embedded platforms including windows mobile google android kopin golden-i threemote appears unsupported unavailable android market time available windows mobile blog posting april 2010 technical director ikanos consulting said sideshow dead threemote bubbling along february 7 2012 chris james released ms sideshow device implementation windows sideshow device google android microsoft discontinued sideshow gallery duplication sideshow gallery content available windows sidebar gadget gallery introduction windows 8.1 microsoft discontinued technology removed support sideshow devices operating system", + "neighbors": [ + 26, + 66, + 79, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 94, + "label": 4, + "text": "Comodo_Internet_Security:comodo internet security comodo internet security cis developed distributed comodo group freemium internet security suite includes antivirus program personal firewall sandbox host-based intrusion prevention system hips cis 5.0 cloud antivirus protection spyware scanning capabilities added could clean malware found effectively comodo cleaning essentials developed supplement cis host-based intrusion prevention system comodo host-based intrusion prevention system hips named defense+ designed provide protection unknown malware designed restrict actions unknown applications restrict access important files folders settings windows registry defense+ default refuses unknown program install execute except specifically allowed user file appears comodo whitelist cis 4.0 sandbox added defense+ isolate run unknown applications cis v6 released february 2013 provided major revision user interface significant new features fully sandboxed desktop environment 6 march 2014 comodo announced completion beta testing cis v7 release 7 became official april 2014 release includes new virus monitoring tool called virusscope web filtering features provide control user access web content release 8 became official 3 november 2014 includes enhanced auto-sandboxing features release 10 became official 22 december 2016 includes secure shopping prevention malware intercepting online transactions release 11 became official 26 june 2018 includes many stability performance changes comodo endpoint security manager cesm server product centrally managing security settings security components network endpoint computers cesm manages distribution updates antivirus firewall software antivirus firewall software managed cesm versions software used consumer versions comodo internet security pc magazine lead security analyst neil j. rubenking reviewed comodo firewall pro 3.0 comodo internet security 3.5 3 november 2008 giving 4.5 5 first 2.5 second praised suite firewall capabilities criticized antimalware capabilities 28 may 2009 roboert vamosi pc world reviewed comodo internet security 3.8 gave score 1 5 criticizing disappointing malware detection based av-test result limited feature set three years three version later comodo antivirus results became significantly better 30 january 2012 rubenking reviewed comodo internet security 2012 pro v5.0 giving 4 stars 5 praised support service antimalware features panned effectively default firewall defense+ popups lack parental control antispam antiphishing privacy protection features finally low ratings independent labs 9 january 2013 review techworld awarded comodo internet security pro 2013 4 5 stars concluded cloud-based scanning behaviour analysis joins suite top-notch security tools designed keep pc secure recommended also date mike williams betanews.com reviewed comodo internet security pro 2013 concluded program remains complex total pc beginners suspect average user appreciate largely automatic operation though experts enjoy powerful tools extreme configurability 7 february 2013 comodo internet security complete v6 earned pc magazine editor choice award reviewing software neil j. reubenking gave score 4.5 5 stars commended support service vpn solution comodo secure dns service value price criticized behavior blocker poor anti-phishing capabilities reubenking concluded biggest win comodo internet security complete 2013 n't features support geekbuddy service fixes problem security otherwise using remote assistance virus-free guarantee reimburses damage malware gets past comodo also get reimbursed expenses related identity theft add geekbuddy-powered tuneup tool unusually powerful backup utility 've got winner av-test anti-virus test lab based germany tested comodo products surpass industry standard measured mean score participating products awarded certificate comodo internet security participated tests since 2010 first time february 2013 comodo internet security premium version 6.0 obtained av-test certificate field home products 18 january 2013 matousec independent tester security software analyzed 38 security products proactive defense capabilities ranked comodo internet security 2013 premium v6 number one comodo internet security 2013 tested windows 7 sp1 internet explorer 9 passed 101 110 tests 92 also ranked number 1 2012", + "neighbors": [ + 17, + 120, + 134, + 189, + 217, + 297, + 476, + 569, + 648, + 656, + 685, + 717, + 731, + 739, + 842, + 910, + 938, + 944, + 961, + 965, + 1038, + 1101, + 1138, + 1239, + 1250, + 1257, + 1291, + 1350, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 95, + "label": 5, + "text": "Sleipnir_(web_browser):sleipnir web browser sleipnir tabbed web browser developed fenrir inc browser main features customization tab functions supports html5 different layout engines names sleipnir fenrir animals norse mythology sleipnir originally created japanese released english chinese translations translations performed volunteer translators available ios macos microsoft windows android windows phone sleipnir originally developed yasuyuki kashiwagi november 2004 computer containing sleipnir source code stolen 2005 kashiwagi established fenrir co. start development new version sleipnir starting version 2 new versions compatible original 2006 sleipnir 6 market share japan sleipnir one twelve browsers originally offered browser ballot screen eu edition windows 7 xp vista update users could choose internet explorer browsers installation process stable version 5.0 released december 24 2013 latest blink engine latest stable version 6.0 windows version browser layout engine changed internet explorer trident mozilla gecko supported version 3.5.0.4000 support webkit rendering engine implemented gecko rendering engine support terminated features include tab grouping mouse gestures page zooming search bar greasemonkey-like user script support plugin support bookmarks sleipnir synced different platform using function called fenrir pass sleipnir version 5 onward introduce proprietary text rendering visually resembling mac os text rendering feature mentioned mac feature set sleipnir 2 windows sleipnir 2 features customizable functions add-ons created users sleipnir 2 one browsers still support windows 98 sleipnir 3 windows includes tab options tab groups touchpaging flick tabs using mouse mouse gestures sleipnir 3 mac switch tabs swiping tabs left right-click operate tabs using gestures tiledtab pinch-in trackpad view list tabs hold go hold link open background ad block tab groups managing tabs sync bookmarks devices using fenrir pass standard full-screen mac os x lion sleipnir 4 windows sleipnir 4 windows introduced minor interface improvements smart tabs adding positioning deletion tabs determined based relationship previous next tabs 150 mouse gesture functions added google chrome extensions support sleipnir 4 mac thumbnail tab navigation open tabs shrunk anymore instead presented scrollable list tab titles appearing mouse hover portal field bar double functionality navigation bar search tiledtab view mode gives overview opened tabs allows sorting tabs six groups improved gesture controls sleipnir 5 windows sleipnir 5 windows integrated features introduced sleipnir 4 mac smooth osx-like font rendering engine introduced site updates feature shows personalized recommendations articles often visited sites added touch screen support sleipnir 6 windows sleipnir 6 windows adds favtab quick navigation favorite sites smartsearch searching via highlighting resizable portal field sleipnir mobile following mobile versions sleipnir smartphones released android ios windows phone early gecko-based versions sleipnir windows scored positive reviews cnet design functionality noticeably inclusion gestures \u201c action smooth natural lot like scrolling pages phone thumb. \u201d osx version review makeuseof followed generally line additionally bringing attention convenient tab management macworld reviewing sleipnir 4 mac praised url bar changed \u201c opera pioneered idea sleipnir \u2019 tabs remain constantly visible strike nice balance large enough identify small enough intrude main browser window. \u201d despite version 4 criticized poor performance compared browsers using webkit later versions sleipnir received positive reviews softpedia due browsers customizability features availability mobile versions \u201c sleipnir proves stable fast web browser comes innovative functions various customization possibilities extra security features together smartphone web apps linking features make viable alternative popular competitors. \u201d 2012 multiple performance tests tom hardware android version sleipnir placed third spot best browser android outrun dolphin maxthon", + "neighbors": [ + 83, + 107, + 258, + 277, + 427, + 509, + 530, + 531, + 582, + 585, + 623, + 646, + 668, + 684, + 713, + 734, + 862, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1339, + 1376, + 1378, + 1408, + 1423, + 1528, + 1550, + 1563, + 1569, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 96, + "label": 1, + "text": "The_Plant_List:plant list plant list list botanical names species plants created royal botanic gardens kew missouri botanical garden launched 2010 intended comprehensive record known names plant species time produced response target 1 2002-2010 global strategy plant conservation gsp c updated since 2013 superseded world flora online october 2012 follow-up project world flora online launched aim publish online flora known plants 2020 developed collaborative group institutions around world response 2011-2020 gspc \u2019 updated target 1 aims achieve online flora known plants 2020 complementary project called international plant names index kew also involved ipni aims provide details publication aim determine accepted species names newly published names automatically added ipni world checklist selected plant families database underlies plant list plant list 1,064,035 scientific plant names species rank 350,699 accepted species names belonging 642 plant families 17,020 plant genera plant list accepts approximately 350,699 unique species 470,624 synonyms species suggests many species referred one name plant list determined another 243,000 names unresolved meaning botanists far unable determine whether separate species duplication 350,699 unique species plant list launched 2010 international year biodiversity attracted media attention comprehensive approach fox news highlighted number synonyms encountered suggesting reflected surprising lack biodiversity earth plant list also attracted attention building work english naturalist charles darwin 1880s started plant list called index kewensis ik kew added average 6,000 species every year since ik first published 400,000 names species however ik 1913 avoided making taxonomic judgement citations currently run part ipni rather plant list", + "neighbors": [ + 124, + 179, + 931, + 933, + 1478 + ], + "mask": "Test" + }, + { + "node_id": 97, + "label": 3, + "text": "Virtual_legacy_wires:virtual legacy wires virtual legacy wires vlw transactions interconnect fabric replaced particular set physical legacy pins intel microprocessors legacy wires replaced include intr a20m smi legacy signals", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 98, + "label": 3, + "text": "Emerald_Dragon:emerald dragon game utilises top-down overhead perspective players move controllable character two dimensions player moves around world map may encounter battles turn-based time point system movements attacks sap bar top screen character turn ends bar depleted role-playing game experience points collected defeating enemies used level-up playable characters main protagonist atorushan stronger attacks made available key items collected game called emerald graces transform dragon unleash powerful attack cost reducing hp used long time ago dragons humans lived peace land ishbahn lord tiridates believing existence dragons among humans defiles ishbahn places curse kills dragons area dragons collectively called dragon tribe manage escape find refuge draguria dimensional rift prevents humans crossing start game ship wrecks coast draguria protagonist dragon tribe youth named atorushan seeks friendship sole survivor human girl named tamryn white dragon leader tribe girl nurtured dragons land 12 years later leaves wants find happiness kind atorushan breaks left horn gives means summoning need assistance 3 years incident atorushan called white dragon aforementioned horn blown granting silver scale keep perishing curse ishbahn white dragon sends tend tamryn upon arriving atorushan learns entirety ishbahn attack evil armies controlled tiridates stop remove land curse needs find 5 emerald graces dragon-based treasures scattered around land resurrect emerald dragon greatest dragons destined bring miracle akihiro kimura successfully crowdfunded sequel audio series titled elemental dragoon 2015 based ideas proposed sequel emerald dragon back 1990s never got ground due apparent copyright issues though kimura others made several independent d\u014djinshi novels continuing story years series designed get around copyright issues focusing new characters slightly changing names title though original characters appear end hopefully allow akihiro kimura generate interest true sequel emerald dragon regain copyright emerald dragon maintains score 3.59/5 50 votes gamefaqs website july 2019 youtubers reviewed game given positive rating youtuber snes drunk said game would n't think emerald dragon among ranks best role playing games snes offer certainly worthwhile play want scratch jrpg itch 5:00-5:08 youtuber avalanche reviews commented english fan translation super nintendo version aside novelty recently translated japanese rpg emerald dragon also interesting stab changing traditional rpg format small effective ways 've grown tired slim pickings westerners awarded rpg department emerald dragon may exactly 're looking amazing example genre accomplish fun different well written change pace ultimately well worth time 6:30-6:56", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 99, + "label": 2, + "text": "Classic_Mac_OS:classic mac os classic mac os series operating systems developed macintosh family personal computers apple inc. 1984 2001 starting system 1 ending mac os 9 macintosh operating system credited popularized graphical user interface concept included every macintosh sold era developed many updates system software done conjunction introduction new macintosh systems apple released original macintosh january 24 1984 first version system software official name partially based lisa os apple previously released lisa computer 1983 part agreement allowing xerox buy shares apple favorable price also used concepts xerox parc alto computer former apple ceo steve jobs lisa team members previewed operating system consisted macintosh toolbox rom system folder set files loaded disk name macintosh system software came use 1987 system 5 apple rebranded system mac os 1996 starting officially version 7.6 due part macintosh clone program program ended release mac os 8 1997 last major release system mac os 9 1999 initial versions system software run one application time introduction system 5 cooperative multitasking extension called multifinder added later integrated system 7 part operating system along support virtual memory mid-1990s however contemporary operating systems windows nt os/2 nextstep brought pre-emptive multitasking protected memory access controls multi-user capabilities desktop computers macintosh limited memory management susceptibility conflicts among extensions provide additional functionality networking support particular device led significant criticism operating system factor apple declining market share time two aborted attempts creating successor macintosh system software called taligent copland four-year development effort spearheaded steve jobs return apple 1997 apple replaced mac os new operating system 2001 named mac os x retained user interface design elements classic mac os overlap application frameworks compatibility two operating systems otherwise completely different origins architectures final updates mac os 9 released 2001 provided interoperability mac os x name classic signifies historical mac os whole reference classic environment compatibility layer helped ease transition mac os x titled macos macintosh project started late 1978 jef raskin envisioned easy-to-use low-cost computer average consumer september 1979 raskin began looking engineer could put together prototype bill atkinson member apple lisa team introduced raskin burrell smith service technician hired earlier year apple concept macintosh deliberately sought minimize user awareness operating system many basic tasks required operating system knowledge systems could accomplished mouse gestures graphic controls macintosh would differentiate contemporaries ms-dos use command-line interface consisting terse abbreviated textual commands january 1981 steve jobs completely took macintosh project jobs number apple engineers visited xerox parc december 1979 three months lisa macintosh projects begun hearing pioneering gui technology developed xerox parc former xerox employees like raskin jobs negotiated visit see xerox alto computer smalltalk development tools exchange apple stock options final lisa macintosh operating systems use concepts xerox alto many elements graphical user interface created apple including menu bar pull-down menus concepts drag drop direct manipulation unlike ibm pc uses 8 kb system rom power-on self-test post basic input/output system bios mac rom significantly larger 64 kb holds key os code much original mac rom coded andy hertzfeld member original macintosh team able conserve precious rom space writing routines assembly language code optimized hacks clever programming tricks addition rom also coded kernel macintosh toolbox desktop accessories das icons operating system represent folders application software designed susan kare later designed icons microsoft windows 3.0 bruce horn steve capps wrote macintosh finder well number macintosh system utilities apple aggressively advertised new machine release company bought 39 pages advertisement space 1984 november/december edition newsweek magazine macintosh quickly outsold sophisticated much expensive predecessor lisa apple quickly developed product named macworks allowed lisa emulate macintosh system software system 3 time discontinued rebranded macintosh xl many lisa operating system advances would appear macintosh operating system system 7 later early versions mac os compatible motorola 68000-family macintoshes apple introduced computers powerpc hardware os ported support architecture mac os 8.1 last version could run 68k processor 68040 systems prior powerpc g3-based systems significant parts system stored physical rom motherboard initial purpose avoid using limited storage floppy disks system support given early macs hard disk one model mac ever actually bootable using rom alone 1991 mac classic model architecture also allows completely graphical os interface lowest level without need text-only console command-line mode boot time errors finding functioning disk drives communicated user graphically usually icon distinctive chicago bitmap font chime death series beeps contrast ms-dos cp/m computers time display messages mono-spaced font black background require use keyboard rather mouse input provide niceties low level early mac os depends core system software rom motherboard also ensure apple computers licensed clones copyright-protected roms apple run mac os several computer manufacturers years made macintosh clones capable running mac os 1995 1997 apple licensed macintosh roms several companies notably power computing umax motorola machines normally ran various versions classic mac os steve jobs ended clone-licensing program returning apple 1997 support macintosh clones first exhibited system 7.5.1 first version include mac os logo variation original happy mac startup icon mac os 7.6 first named mac os instead system changes made disassociate operating system apple macintosh models macintosh originally used macintosh file system mfs flat file system one level folders quickly replaced 1985 hierarchical file system hfs true directory tree file systems otherwise compatible improved file system named hfs plus hfs+ mac os extended announced 1997 implemented 1998 files file systems used dos windows unix operating systems one fork contrast mfs hfs give files two different forks data fork contains sort information file file systems text document bitmaps image file resource fork contains structured data menu definitions graphics sounds code segments would incorporated program file format systems executable file might consist resources including code segments empty data fork data file might data fork resource fork word processor file could contain text data fork styling information resource fork application \u2019 recognize styling information still read raw text hand forks would provide challenge interoperability operating systems copying transferring mac os file non-mac system default implementations would simply strip file resource fork data files contained nonessential information resource fork window size location program files would inoperative without resources necessitated encoding schemes binhex macbinary allowed user encode dual-forked file single stream inversely take single stream so-encoded reconstitute dual-forked file usable mac os part apple goal creating computer appliance-like simplicity explicit distinction made operating system software hardware runs early versions operating system distinct name software consists two user-visible files system file finder application used file management also displays desktop two files contained folder directory labeled system folder contains resource files like printer driver needed interact system version numbers operating system based version numbers two files releases run one application time except desk accessories though special application shells multi-mac switcher discussed multifinder could work around visible changes best reflected version number finder major leaps found 1.x 4.x 5.x 6.x late 1990s apple retroactively gave older releases single name towards end 1987 apple introduced package titled apple macintosh system software update 5.0 first time macintosh operating system offered distinct retail product included four 800k disks three manuals cost 49 usd software still freely available user groups bulletin board services product box presented update operating system version 5.0 number appear software three four disks system tools 1 system tools 2 utilities 1 bootable user boot whichever floppy contain tools user needs instance system tools 2 disk printer drivers utilities 1 disk disk first aid apple hd sc setup disks named system tools users press commonly referred version system tools 5.0 primary new feature system 5 multifinder extension lets system run several programs system uses cooperative multitasking model meaning time given background applications foreground application yields control change system functions applications already calling handle events make many existing applications share time automatically well allowed perform tasks background users also choose use multifinder thereby using single application time 1990 infoworld tested four multitasking options pc mac viewing multifinder positively overall noting presence halved speed file transfer printing compared single-tasking system 6 without multifinder system software 6 also referred system 6 consolidation release macintosh system software producing complete stable long-lasting operating system two major hardware introductions requiring additional support system 6 68030 processor 1.44 mb superdrive debuting macintosh iix macintosh se/30 later updates include support first specialized laptop features introduction macintosh portable system 6 forward finder unified version number closely matching system alleviating much confusion caused often considerable differences earlier systems may 13 1991 system 7 released major upgrade system 6 adding significant user interface overhaul new applications stability improvements many new features introduction coincides release provided support 68040 macintosh line system 7 era saw numerous changes macintosh platform including proliferation macintosh models 68k power macintosh transition well rise microsoft windows increasing use computer networking explosion popularity internet one significant features system 7 virtual memory support essential subsystem anticipated years exists previous systems third party extension named virtual connectix accompanying move 32-bit memory addressing necessary ever-increasing amounts ram available motorola 68030 cpu 68020 cpus 68551 pmmu process involves making routines os code use full 32-bits pointer address\u2014prior systems used upper 8 bits flags change known 32-bit clean system 7 32-bit clean many existing machines thousands applications time process completed ease transition memory control panel contains switch disable feature allowing compatibility older applications another notable system 7 feature built-in cooperative multitasking system software 6 function optional multifinder system 7 also introduced aliases similar symbolic links unix shortcuts introduced later versions microsoft windows shadows ibm os/2 system extensions enhanced moved subfolder subfolder system folder also created control panels system 7.5 apple includes extensions manager previously third-party program simplified process enabling disabling extensions apple menu home desk accessories system 6 made general-purpose user could make often-used folders applications\u2014or anything else desired\u2014appear menu placing aliases apple menu items subfolder system folder system 7 also introduced following applescript scripting language automating tasks 32-bit quickdraw supporting so-called true color imaging previously available system extension truetype outline font standard trash system 6 earlier empties automatically shutting computer\u2014or multifinder running launching application system 7 reimplements trash special hidden folder allowing files remain across reboots user deliberately chose empty trash command system 7.1 mainly bugfix release minor features added one major new features system 7.1 moving fonts system file fonts folder system folder previously resource-copying utility resedit font d/a mover required installing fonts system 7.1 first macintosh operating system cost money previous versions free sold cost floppies also received pro sibling version 7.1.1 extra features system 7.1.2 first version support powerpc-based macs system 7.1 also introduces system enablers method support new models without updating actual system file leads extra files inside system folder one per new model supported system 7.5 introduces large number new features many based shareware applications apple bought included new system newer powerpc machines system 7.5 may stability problems partly due new memory manager turned issues handling errors powerpc code powerpc exceptions map type 11 issues affect 68k-architecture machines system 7.5 contemporary apple failed copland effort well release windows 95 coincides apple purchase several shareware system enhancements include new system features stability improved powerpc-based macs mac os 7.6 dropped system moniker trademarkable name needed order license os growing market third-party macintosh clone manufacturers mac os 7.6 required 32-bit-clean roms dropped support every mac 68000 processor well mac ii mac iix mac iicx mac se/30 mac os 8 released july 26 1997 month steve jobs became de facto ceo apple mainly released keep mac os moving forward difficult time apple initially planned mac os 7.7 renumbered 8 exploit legal loophole accomplish jobs goal terminating third-party manufacturers licenses system 7 shutting macintosh clone market mac os 8 added number features abandoned copland project leaving underlying operating system unchanged multi-threaded finder included files could copied background gui changed appearance new shaded greyscale look named platinum ability change appearance themes also known skins added new control panel though platinum one shipped capability provided new appearance api layer within os one significant changes apple sold 1.2 million copies mac os 8 first two weeks availability 3 million within six months light apple financial difficulties time large grassroots movement among mac users upgrade help save apple even pirate groups refused redistribute os mac os 8.1 introduced updated version hierarchical file system named hfs+ fixed many limitations earlier system continued used macos macos high sierra replaced apple file system interface changes separating network features printing improvements application switching however underlying technical respects mac os 8 different system 7 mac os 8.5 focuses speed stability 68k code replaced modern code native powerpc also improved appearance user interface although theming feature cut late development mac os 9 last major revision classic mac os released october 23 1999 generally steady evolution mac os 8 early development releases mac os 9 numbered 8.7 mac os 9 added improved support airport wireless networking introduced early implementation multi-user support though true multi-user operating system mac os 9 allow multiple desktop users data system settings improved sherlock search engine added several new search plug-ins mac os 9 also provides much improved memory implementation management applescript improved allow tcp/ip networking control mac os 9 also makes first use centralized apple software update find install os hardware updates new features included on-the-fly file encryption software code signing keychain technologies remote networking file server packages much improved list usb drivers mac os 9 also added transitional technologies help application developers adopt mac os x features introduction new os public help ease transition included new apis file system bundling carbon library apps could link instead traditional api libraries\u2014apps adapted could run natively mac os x well changes made beginning mac os 9.1 update allow launched classic environment within mac os x final update classic mac os version 9.2.2 released december 5 2001. macos originally named mac os x 2012 os x 2016 apple current mac operating system officially succeeded classic mac os 2001 although originally marketed simply version 10 mac os history largely independent earlier mac os releases macos architectural legacy successor mac os 9 classic mac os legacy however unlike classic mac os unix-based operating system built nextstep technology developed next late 1980s early 1997 apple purchased company ceo steve jobs returned apple macos also makes use bsd codebase xnu kernel core set components based upon apple open source darwin operating system early version operating system mac os x server 1.0 released 1999 retains platinum appearance classic mac os even resembles openstep places desktop version mac os x 10.0 followed march 24 2001 supporting new aqua user interface since several versions operating system released mac os x renamed os x 2012 macos 2016 users classic mac os generally upgraded mac os x criticized early years difficult less user-friendly original mac os lack certain features yet reimplemented new os slower hardware especially older hardware incompatibilities older os drivers printers scanners tablets etc written older mac os compatible mac os x due lack mac os x support older apple computers macintosh users continued using older classic mac os years original release mac os x. steve jobs encouraged people upgrade mac os x staging mock funeral mac os 9 wwdc 2002 powerpc versions mac os x including mac os x 10.4 tiger include compatibility layer running older mac applications classic environment originally codenamed blue box environment runs nearly complete mac os 9 operating system version 9.1 later mac os x application allows applications ported carbon api run mac os x reasonably seamless though classic applications retain original mac os 9 appearance gain mac os x aqua appearance early new world rom powerpc-based macs shipped mac os 9.2 well mac os x. mac os 9.2 installed user\u2014it installed default hardware revisions released mac os x 10.4 well-written classic mac os applications function properly environment compatibility assured software written unaware actual hardware interact solely operating system classic environment available intel-based mac systems due incompatibility mac os 9 x86 hardware third-party macintosh emulators vmac basilisk ii executor eventually made possible run classic mac os intel-based pcs emulators restricted emulating 68k series processors could n't run versions mac os succeeded 8.1 required powerpc processors also required mac rom image hardware interface supporting real mac rom chip requiring image dubious legal standing rom image may infringe apple intellectual property notable exception executor commercial software product abacus research development product used 100 reverse-engineered code without use apple technology ran extremely quickly never achieved minor subset functionality programs completely compatible many extremely crash-prone ran executor filled niche market porting 68k mac applications x86 platforms development ceased 2002 source code released author late 2008 emulators using mac rom images offered near complete mac os compatibility later versions offered excellent performance modern x86 processor performance increased exponentially apple included mac 68k emulator ran seamlessly powerpc-based versions classic mac os comparison 68k-emulator development powerpc support difficult justify due anticipated wide performance overhead emulated powerpc architecture would later prove correct pearpc project despite availability 7th 8th generation x86 processors employing similar architecture paradigms present powerpc nevertheless pearpc emulator capable emulating powerpc processors required newer versions mac os however longer maintained like many emulators tends run much slower native operating system would another powerpc emulator sheepshaver around since 1998 beos powerpc platform 2002 open sourced efforts began port platforms originally designed use x86 platforms required actual powerpc processor present machine running similar hypervisor although provides powerpc processor support run mac os 9.0.4 emulate memory management unit examples include shapeshifter developer created sheepshaver fusion ifusion latter ran classic mac os powerpc coprocessor accelerator card using method said equal better speed macintosh processor especially respect 68k series due real macs running mmu trap mode hampering performance apple rosetta powerpc emulator intel-based macs support classic mac os", + "neighbors": [ + 1, + 9, + 22, + 33, + 37, + 42, + 55, + 58, + 64, + 71, + 75, + 78, + 85, + 99, + 121, + 130, + 134, + 170, + 171, + 185, + 187, + 214, + 228, + 233, + 234, + 252, + 265, + 269, + 278, + 322, + 338, + 345, + 353, + 356, + 380, + 387, + 395, + 396, + 403, + 413, + 434, + 465, + 475, + 477, + 495, + 511, + 524, + 551, + 583, + 596, + 601, + 610, + 625, + 634, + 650, + 653, + 664, + 686, + 696, + 720, + 721, + 728, + 754, + 787, + 797, + 805, + 810, + 815, + 825, + 858, + 860, + 877, + 884, + 891, + 917, + 927, + 939, + 941, + 945, + 954, + 956, + 961, + 966, + 996, + 998, + 1001, + 1003, + 1011, + 1012, + 1022, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1056, + 1057, + 1063, + 1068, + 1100, + 1132, + 1138, + 1139, + 1140, + 1152, + 1155, + 1157, + 1165, + 1178, + 1187, + 1189, + 1190, + 1201, + 1202, + 1215, + 1221, + 1224, + 1227, + 1232, + 1237, + 1251, + 1262, + 1273, + 1287, + 1292, + 1294, + 1298, + 1301, + 1304, + 1305, + 1311, + 1334, + 1339, + 1373, + 1391, + 1394, + 1398, + 1407, + 1409, + 1415, + 1441, + 1445, + 1456, + 1474, + 1488, + 1494, + 1496, + 1502, + 1530, + 1536, + 1542, + 1544, + 1546, + 1578, + 1591, + 1610, + 1616, + 1627, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 100, + "label": 2, + "text": "Irina_Blok:irina blok irina blok born c. 1977 graphic designer artist best known creation google android logo including green robot icon irina blok appeared abc reality show shark tank one contestants designs featured nbc ny usa today sf weekly french edition elle magazine multiple publications around world born st petersburg russia blok moved u.s. 1995 studied graphic design san jose state university started career landor associates brand designer helped create evolve brands hp visa h r block fedex continued career number tech companies including yahoo google adobe course career design work appeared communication arts magazine magazine aiga ci annual creative review also directed study advisor graphic design mfa program academy art university san francisco", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 101, + "label": 2, + "text": "PlayStation_Vita_system_software:playstation vita system software playstation vita system software official firmware operating system playstation vita playstation tv video game consoles uses livearea graphical shell playstation vita system software one optional add-on component playstation mobile runtime package system built unix-base derived freebsd netbsd livearea name graphical user interface playstation vita system software developed sony computer entertainment interface features new touch-based screen acts like hub page allows users hop different parts game space eighth-generation playstation vita playstation tv consoles use livearea graphical shell instead previous xrossmediabar xmb interface used sony seventh-generation video game consoles playstation portable playstation 3 playstation 4 sony eighth-generation home video game console however uses neither livearea xrossmediabar graphical shell rather utilizes user interface called playstation dynamic menu playstation vita system software uses livearea user interface includes various social networking features via playstation network users select icon game application home screen open livearea screen game application playstation vita playstation tv new feature playstation vita playstation tv livearea latest game information downloadable contents shown livearea screen game addition scrolling game livearea activity users playing game checked instantly playstation vita playstation tv uses system software playstation vita supports feature called remote play sony home video game consoles playstation 3 playstation 4 allows playstation 3 playstation 4 transmit video audio output playstation vita however unlike remote play playstation vita playstation 4 well-integrated remote play playstation vita playstation 3 supported select ps3 titles results often laggy besides playstation vita used second screen device ps4 ps3 supported games class heroes 2g streaming content directly console playstation vita also users playstation vita playstation 3 possible share media files videos music images transferring multimedia files directly playstation vita playstation 3 vice versa updates playstation vita system software also downloaded ps vita devices via ps3 system furthermore service called cross-buy used allows players buy certain games support feature one time play sony platforms minecraft terraria examples games saved worlds transferable consoles minecraft longer cross buy february 25 2016 also feature called cross-play cross-platform play covering playstation vita software title interact playstation 3 playstation 4 software title different software titles use cross-play different ways example ultimate marvel vs. capcom 3 title supporting cross-play feature ps3 version game controlled using ps vita system although playstation vita console function without internet connection provide functionality connected internet example users may download updates system software internet well playing online internet properly connected additionally internet connection playstation vita system allows users access variety playstation network psn services playstation store playstation plus subscription service games content may purchased services applications live playstation app well various video streaming apps also require internet connection function properly browser preinstalled app playstation vita browsing world wide web although different web browsing playstation portable browser improved psp version intended result less difficult experience browser application tabs users 8 separate browser windows open also save images websites ps vita memory card touching holding image menu appears however users use web browser playing game watching video display content limited result recommended exit open game video performing intensive browsing tasks furthermore ps vita web browser supports html5 cookies javascript support adobe flash unlike psp web browser another application preinstalled playstation vita launch maps displayed online maps internet connection available however removed sony via system update along near feature 2015 like many video game consoles playstation vita capable photo audio video playback variety formats built-in cameras used take photos videos however unlike sony home consoles playstation 3 playstation 4 possible play blu-ray dvd movies playstation vita since lacks optical disc drive umd drive playstation portable however users transfer movies supported format playstation vita system videos download playstation store also users transfer content playing displayed playstation vita system playstation tv system allowing view content televisions instead ps vita screens following multimedia formats supported ps vita ps tv system furthermore entertainment applications available download playstation store ps vita ps tv system sony announced gamescom 2011 applications like netflix would become available via playstation store additional applications available download include music unlimited flickr nico nico tunein radio qello crunchyroll crackle hulu plus redbox instant youtube although many compatible ps tv launch similar early playstation 3 consoles compatible playstation 2 titles playstation vita backwards-compatible playstation portable games however playstation vita lacks playstation portable umd drive sony confirmed psp owners would able transfer physical umd games across ps vita system means users able play psp games ps vita originally downloaded via playstation network rather bought disc playing psp game ps vita system ps vita dual analog sticks supported psp games right stick set mimic either d-pad left stick l r buttons face button cluster original psp system graphics psp releases up-scaled optional bilinear filter reduce pixelation besides playstation portable games playstation vita also backwards-compatible majority titles platforms psone classics playstation minis playstation mobile games psone classic titles compatible ps vita launch gradually became available ps vita since system software update 1.80 released august 28 2012 playstation mobile games originally intended compatible playstation vita playstation tv certain devices run android operating system playstation mobile 2.00 released 2014 would target playstation vita optionally playstation tv gaming platforms sony gaming platforms generation gaming platforms seventh generation", + "neighbors": [ + 14, + 38, + 106, + 113, + 116, + 162, + 189, + 290, + 298, + 337, + 477, + 509, + 520, + 527, + 622, + 629, + 893, + 899, + 992, + 1018, + 1020, + 1027, + 1051, + 1138, + 1140, + 1193, + 1203, + 1301, + 1318, + 1322, + 1397, + 1521, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 102, + "label": 4, + "text": "Bradley_Willman:bradley willman bradley willman born 1980 anti-pedophile activist canada engaged private investigations using internet expose pedophiles one time unfettered access 2,000 3,000 computers used visit websites interest pedophiles result use trojan horse willman actions helped put california superior court judge ronald kline prison two years 2007 possession child pornography however legality willman use trojan horse basis appeal judge willman born 1980 langley british columbia canada willman identifies private computer cop previously used aliases garbie omnipotent late 1990s willman began tracking investigating people downloaded child porn internet time 2000 willman devised trojan horse type computer program used conduct investigations trojan horse posted websites interest pedophiles way appeared picture-file attached message actually program file visitor pedophile website downloaded file visitor unwittingly downloaded trojan horse would typically unaware running computer willman control chose download trojan horse downloaded willman could access search retrieve files infected computer willman stated whole intent program started working expected help kids willman estimated trojan horse gave access 2,000 3,000 computers used visit websites interest pedophiles including police officers military personnel social workers priests judges march 2000 willman helped royal canadian mounted police child molestation case time august 2000 willman anonymously provided private watchdog group documents related kentucky state investigation child molestation production child pornography prior january 2001 united states customs service contacted willman see whether discovered useful information related suspected russian child pornography ring early may 2000 california superior court judge ronald c. kline 1941\u2013 downloaded trojan horse computer trojan horse allowed willman b.c. monitor contents kline computer california may 2000 mid-april 2001 willman copied kline computer portions kline diary april 2001 willman anonymously forwarded excerpts diary kline hard drives final entry dated march 18 2001 website pedophile-watchdog pedowatch pedowatch passed diary san bernardino county sheriff office forwarded california attorney general office turn sent city irvine police department november 2001 irvine police searched kline irvine home found 1,500 pornographic computer images young children judge home computer child porn also found kline courthouse computer event drew national attention ultimately led kline drop bid reelection judge largely result efforts talk radio hosts john ken kfi-am 640 kline charged november 2001 united states federal government possession child pornography man said judge molested 14 years old quarter-century earlier came forward california state child molestation charges filed kline well state child molestation charges dismissed july 2003 legal case stogner v. california held california extension statute limitations sex-related child abuse could applied previously time-barred prosecutions united states evidence derives illegal government search generally used court defendant government however evidence derives illegal private search citizen tipster may used court government even though search illegal individual illegal search court answers private/government search question determining whether individual instrument agent government government knew acquiesced intrusive conduct ... party performing search intended assist law enforcement efforts party performing illegal search considered agent government march 17 2003 federal judge ruled willman working government informant invaded judge kline computers willman thought agent law enforcement ii willman motivation invasion act law enforcement purposes since judge ruled violated kline united states 4th amendment right privacy illegal searches government judge suppressed prosecution strongest evidence kline specifically judge suppressed evidence seized kline home home computer including excerpts computer diary sexual desires 1,500 pornographic photos young boys appeal united states court appeals ninth circuit appeals court disagreed federal judge found enough willman act intent assist government needed degree governmental knowledge acquiescence willman actions find willman acting government agent thus appeals court reversed district court order suppressing evidence found fruit willman illegal private search march 2005 united states supreme court declined hear case ended kline appeals 9th circuit united states supreme court actions willman evidence back play december 2005 former orange county superior court judge ronald c. kline pleaded guilty possessing child pornography home computer ending four-year legal battle kline house arrest trial conviction could brought kline 30-year prison term plea agreement limited prison time possible 27 33 months june 2006 state commission judicial performance gave kline serious punishment could give former judge barring receiving work state courts february 2007 kline sentenced 27 months prison possessing child pornography", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 103, + "label": 4, + "text": "Threat_(computer):threat computer computer security threat possible danger might exploit vulnerability breach security therefore cause possible harm threat either intentional i.e hacking individual cracker criminal organization accidental e.g possibility computer malfunctioning possibility natural disaster earthquake fire tornado otherwise circumstance capability action event iso 27005 defines threat comprehensive definition tied information assurance point view found federal information processing standards fips 200 minimum security requirements federal information information systems nist united states america national information assurance glossary defines threat enisa gives similar definition open group defines threat factor analysis information risk defines threat national information assurance training education center gives articulated definition threat term threat relates basic security terms shown following diagram resource physical logical one vulnerabilities exploited threat agent threat action result potentially compromise confidentiality integrity availability properties resources potentially different vulnerable one organization others involved parties customers suppliers so-called cia triad basis information security attack active attempts alter system resources affect operation compromises integrity availability passive attack attempts learn make use information system affect system resources compromises confidentiality owasp see figure depicts phenomenon slightly different terms threat agent attack vector exploits weakness vulnerability system related security controls causing technical impact resource asset connected business impact set policies concerned information security management information security management systems isms developed manage according risk management principles countermeasures order accomplish security strategy set following rules regulations applicable country countermeasures also called security controls applied transmission information named security services overall picture represents risk factors risk scenario widespread computer dependencies consequent raising consequence successful attack led new term cyberwarfare nowadays many real attacks exploit psychology least much technology phishing pretexting methods called social engineering techniques web 2.0 applications specifically social network services mean get touch people charge system administration even system security inducing reveal sensitive information one famous case robin sage widespread documentation computer insecurity technical threats computer virus trojan malware serious study apply cost effective countermeasures conducted following rigorous risk analysis framework isms pure technical approach let psychological attacks increasing threats threats classified according type origin note threat type multiple origins people interested studying possible threats microsoft proposed threat classification called stride initials threat categories microsoft previously rated risk security threats using five categories classification called model considered obsolete microsoft categories dread name comes initials five categories listed spread network threats lead dangerous situations military civil fields threat level defined example infocon threat level used us leading antivirus software vendors publish global threat level websites term threat agent used indicate individual group manifest threat fundamental identify would want exploit assets company might use company individuals within threat population practically anyone anything right circumstances threat agent \u2013 well-intentioned inept computer operator trashes daily batch job typing wrong command regulator performing audit squirrel chews data cable threat agents take one following actions asset important recognize actions affects different assets differently drives degree nature loss example potential productivity loss resulting destroyed stolen asset depends upon critical asset organization productivity critical asset simply illicitly accessed direct productivity loss similarly destruction highly sensitive asset play critical role productivity would directly result significant productivity loss yet asset disclosed result significant loss competitive advantage reputation generate legal costs point combination asset type action asset determines fundamental nature degree loss action threat agent takes driven primarily agent motive e.g. financial gain revenge recreation etc nature asset example threat agent bent financial gain less likely destroy critical server steal easily pawned asset like laptop important separate concept event threat agent get contact asset even virtually i.e network event threat agent act asset owasp collects list potential threat agents prevent system designers programmers insert vulnerabilities software threat agent capabilities intentions past activities individuals groups classified follows threat sources wish compromise occur term used distinguish threat agents/actors carry attack may commissioned persuaded threat source knowingly unknowingly carry attack threat action assault system security complete security architecture deals intentional acts i.e attacks accidental events various kinds threat actions defined subentries threat consequence threat analysis analysis probability occurrences consequences damaging actions system basis risk analysis threat consequence security violation results threat action includes disclosure deception disruption usurpation following subentries describe four kinds threat consequences also list describe kinds threat actions cause consequence threat actions accidental events marked collection threats particular domain context information identified vulnerable assets threats risks threat actors observed trends threats managed operating isms performing risk management activities foreseen laws standards methodologies large organizations tend adopt business continuity management plans order protect maintain recover business-critical processes systems plans foreseen set computer security incident response team csirt computer emergency response team cert kind verification threat management process organizations perform subset steps adopting countermeasures based non systematic approach computer insecurity studies battlefield computer security exploits defences results information security awareness significant market see lot software developed deal threats including open-source software see proprietary software see partial list threat management involves wide variety threats including physical threats like flood fire isms risk assessment process incorporate threat management cyber threats remote buffer overflows risk assessment process n't include processes threat intelligence management response procedures cyber threat management ctm emerging best practice managing cyber threats beyond basic risk assessment found isms enables early identification threats data-driven situational awareness accurate decision-making timely threat mitigating actions ctm includes cyber threat hunting process proactively iteratively searching networks detect isolate advanced threats evade existing security solutions contrast traditional threat management measures firewalls intrusion detection systems siems typically involve investigation warning potential threat incident occurred threat hunting manual process security analyst sifts various data information using knowledge familiarity network create hypotheses potential threats even effective efficient however threat hunting partially automated machine-assisted well case analyst utilizes software harnesses machine learning user entity behaviour analytics ueba inform analyst potential risks analyst investigates potential risks tracking suspicious behaviour network thus hunting iterative process meaning must continuously carried loop beginning hypothesis three types hypotheses analyst researches hypothesis going vast amounts data network results stored used improve automated portion detection system serve foundation future hypotheses sans institute conducted research surveys effectiveness threat hunting track disrupt cyber adversaries early process possible according survey released 2016 adopters model reported positive results 74 percent citing reduced attack surfaces 59 percent experiencing faster speed accuracy responses 52 percent finding previously undetected threats networks", + "neighbors": [ + 14, + 233, + 289, + 363, + 379, + 608, + 739, + 750, + 800, + 1015, + 1090, + 1137, + 1368, + 1623 + ], + "mask": "Test" + }, + { + "node_id": 104, + "label": 4, + "text": "Integral_cryptanalysis:integral cryptanalysis cryptography integral cryptanalysis cryptanalytic attack particularly applicable block ciphers based substitution-permutation networks originally designed lars knudsen dedicated attack square commonly known square attack also extended ciphers related square crypton rijndael shark stefan lucks generalized attack called saturation attack used attack twofish similar square radically different feistel network structure forms integral cryptanalysis since applied variety ciphers including hierocrypt idea camellia skipjack misty1 misty2 safer++ khazad fox called idea nxt unlike differential cryptanalysis uses pairs chosen plaintexts fixed xor difference integral cryptanalysis uses sets even multisets chosen plaintexts part held constant another part varies possibilities example attack might use 256 chosen plaintexts 8 bits differ 8 bits set necessarily xor sum 0 xor sums corresponding sets ciphertexts provide information cipher operation contrast differences pairs texts sums larger sets texts inspired name integral cryptanalysis borrowing terminology calculus", + "neighbors": [ + 32, + 174, + 284, + 289, + 382, + 633, + 969, + 995, + 1071, + 1181, + 1232, + 1233, + 1240, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 105, + "label": 3, + "text": "Comparison_of_CPU_microarchitectures:comparison cpu microarchitectures following comparison cpu microarchitectures", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 112, + 123, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 460, + 465, + 486, + 508, + 529, + 589, + 643, + 659, + 719, + 738, + 752, + 776, + 803, + 821, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1256, + 1263, + 1272, + 1290, + 1398, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 106, + "label": 2, + "text": "386BSD:386bsd 386bsd also known jolix discontinued unix-like operating system based berkeley software distribution bsd released 1992 ran pc-compatible computer systems based 32-bit intel 80386 microprocessor 386bsd innovations included role-based security ring buffers self-ordered configuration modular kernel design 386bsd written mainly berkeley alumni lynne jolitz william jolitz william jolitz considerable experience prior bsd releases university california berkeley 2.8 2.9bsd contributed code developed symmetric computer systems 1980s berkeley work porting 4.3bsd-reno later 4.3bsd net/2 intel 80386 done university california william jolitz berkeley 4.3bsd net/2 incomplete non-operational release portions withheld university california encumbered i.e subject unix source code license 386bsd releases made public beginning 1992 based portions 4.3bsd net/2 release coupled additional code see missing pieces ii dr. dobb journal may\u2013june 1992 written william lynne jolitz make complete operational release port began 1989 first incomplete traces port found 4.3bsd net/2 1991 port made possible keith bostic partly influenced richard stallman started remove proprietary bsd 1988 port first released march 1992 version 0.0 much usable version july 14 1992 version 0.1 porting process code extensively documented 18-part series written lynne jolitz william jolitz dr. dobb journal beginning january 1991 release 386bsd 0.1 group users began collecting bug fixes enhancements releasing unofficial patchkit due differences opinion jolitzes patchkit maintainers future direction release schedule 386bsd maintainers patchkit founded freebsd project 1993 continue work around time netbsd project founded different group 386bsd users aim unifying 386bsd strands bsd development one multi-platform system projects continue day due lawsuit usl v. regents university california potentially so-called encumbered source agreed distributed within berkeley software distribution net/2 university california subsequent release 1993 4.4bsd-lite made university correct issue however 386bsd dr. dobb journal william jolitz lynne jolitz never parties subsequent lawsuits settlements arising dispute university california continued publish work 386bsd code base lawsuits without limitation never legal filings claims university usl responsible parties respect 386bsd finally code developed 386bsd done william jolitz lynne jolitz issue lawsuits late 1994 finished version 386bsd release 1.0 distributed dr. dobb journal cdrom due immense size 600 mb release 386bsd reference cd-rom best-selling cdrom three years 1994\u20131997 386bsd release 1.0 contained completely new kernel design implementation began process incorporate recommendations made earlier berkeley designers never attempted bsd august 5 2016 update pushed 386bsd github developer ben jolitz named version 2.0 release 2.0 built upon modular framework create self-healing components however almost documentation remains version 1.0 change log available 386bsd often confused bsd/386 different project developed bsdi berkeley spinout starting 1991 bsd/386 used 386bsd code contributed university california 4.3bsd net/2 although jolitz worked briefly uunet later spun bsdi 1991 work diverged contributed university california appear 386bsd instead william jolitz gave regular code updates donn seeley bsdi packaging testing returned materials william jolitz left company following fundamental disagreements company direction goals rights respect 386bsd jolix held exclusively william jolitz lynne jolitz 386bsd public releases ended 1997 since code available many 386bsd-derived operating systems today along several derivatives thereof apple darwin openbsd portions 386bsd may found open systems opensolaris 1/91 ddj designing software specification", + "neighbors": [ + 63, + 85, + 101, + 116, + 134, + 195, + 377, + 380, + 443, + 475, + 477, + 868, + 899, + 901, + 941, + 954, + 957, + 1138, + 1301, + 1318, + 1397, + 1521, + 1578, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 107, + "label": 5, + "text": "Firefox_3.0:firefox 3.0 mozilla firefox 3.0 version firefox web browser released june 17 2008 mozilla corporation firefox 3.0 uses version 1.9 gecko layout engine displaying web pages version fixes many bugs improves standards compliance implements many new web apis compared firefox 2.0 new features include redesigned download manager new places system storing bookmarks history separate themes different operating systems firefox 3.0 8 million unique downloads day released july 2008 held 5.6 recorded usage share web browsers estimates firefox 3.0 global market share generally range 4\u20135 dropped users migrated firefox 3.5 later firefox 3.6 partially result mid-december 2009 end january 2010 firefox 3.5 popular browser counting individual browser versions passing internet explorer 7 mozilla ended support firefox 3 march 30 2010 release 3.0.19 firefox 3.0 developed codename gran paradiso like firefox codenames name actual place case seventh-highest mountain graian alps first came idea planning began october 2006 development team asked users submit feature requests wished included firefox 3 mozilla foundation released first beta november 19 2007 second beta december 18 2007 third beta february 12 2008 fourth beta march 10 2008 fifth final beta april 2 2008 first release candidate announced may 16 2008 followed second release candidate june 4 2008 third differing second release candidate corrected serious bug mac users june 11 2008 mozilla shipped final release june 17 2008 release date firefox 3 featured popular culture mentioned colbert report among others one big changes firefox 3 implementation gecko 1.9 updated layout engine new version fixes many bugs improves standard compliance implements new web apis particular makes firefox 3 first official release mozilla browser pass acid2 test standards-compliance test web-page rendering also receives better score acid3 test firefox 2 new features defined whatwg html 5 specification support web-based protocol handlers native implementation codice_1 method support safe message-passing codice_2 support offline web applications new features include apng support exslt support new internal memory allocator jemalloc used rather default libc one gecko 1.9 uses cairo graphics backend allowing improved graphics performance better consistency look feel various operating systems cairo lack support windows 95 windows 98 windows windows nt versions 4.0 microsoft ended support windows 98 windows july 11 2006 firefox 3 run operating systems similarly mac version firefox 3 runs mac os x 10.4 higher unlike previous versions native cocoa widget interface frontend changes firefox features redesigned download manager built-in search ability resume downloads also new plug-in manager included add-ons window extensions installed package manager microformats supported use software understand use documents store data machine-readable form password manager firefox 3 asks user would like remember password login attempt rather users able avoid storing incorrect password password manager bad login attempt firefox 3 uses places system storing bookmarks history sqlite backend new system stores information user history bookmarks particular letting user tag pages also used implement improved frecency-based algorithm new location bar auto-complete feature dubbed awesomebar mac version firefox 3 supports growl notifications mac os x spell checker aqua-style form controls give browser native look feel different operating systems firefox 3 uses separate themes mac os x linux windows xp windows vista running gnome firefox 3 displays icons environment thus desktop environment icon theme changes firefox follows suit additional icons also made used appropriate icon exists made following tango desktop project guidelines additionally gtk version replaced non-native tab bar implemented firefox 2.0 instead uses native gtk+ tab style default icons icon layout firefox 3 also changed dramatically taking keyhole shape forward back buttons default two three platforms however keyhole shape take effect linux small-icon mode iconfactory created icons microsoft windows platform addition separate icons sets displayed windows xp vista breakpad previously called airbag open-source crash reporter utility replaced proprietary talkback developed google mozilla used firefox thunderbird product significant first open source multi-platform crash reporting system development breakpad first included may 27 2007 firefox 3 trunk builds windows nt mac os x weeks later linux breakpad replaced talkback also known quality feedback agent crash reporter used mozilla software report crashes products centralized server aggregation case-by-case analysis talkback proprietary software licensed mozilla corporation supportsoft net applications noted use firefox 3 beta rapidly increased usage share 0.62 may 2008 interpreted increase mean firefox 3 betas stable users using primary browser within 24 hours release firefox 3.0 usage rose 1 3 according net applications reached peak 21.17 april 2009 declining users switched firefox 3.5 later firefox 3.6 official date launch firefox 3 june 17 2008 named download day 2008 firefox aiming set record software downloads 24 hours download day officially started 11:16 a.m. pdt 18:16 utc june 17 announced date download day june 18 time zones greater gmt +6 includes half asia oceania large number users attempting access mozilla website june 17 caused become unavailable least hours attempts upgrading new version resulted server timeouts site updated download firefox 3 12:00 pdt 19:00 utc two hours later originally scheduled download day ended 11:16 pdt 18:16 utc june 18 8,249,092 unique downloads recorded july 2 mozilla announced record 8,002,530 unique downloads parties 25 countries july 7 2008 31 million people downloaded firefox 3 gareth deaves records manager guinness world records complimented mozilla saying mobilizing 8 million internet users within 24 hours extremely impressive accomplishment would like congratulate mozilla community hard work dedication firefox 3 runs windows 2000 later windows 98 third-party kernel extender installed new functionality location bar dubbed awesomebar overall well received like due user interface performance changes much extensions made revert firefox 3 received cnet editors choice june 2008", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 452, + 491, + 509, + 530, + 580, + 582, + 623, + 627, + 668, + 684, + 713, + 716, + 763, + 782, + 796, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1166, + 1189, + 1195, + 1210, + 1228, + 1280, + 1287, + 1302, + 1376, + 1378, + 1423, + 1424, + 1528, + 1539, + 1550, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 108, + "label": 3, + "text": "Windows_NT_3.1:windows nt 3.1 windows nt 3.1 operating system produced microsoft part windows nt family operating systems released july 27 1993 time windows nt release microsoft windows 3.1 desktop environment established brand recognition market share windows 3.1 relied dos operating system essential functions constrictive 16-bit architecture windows nt however complete 32-bit operating system retained desktop environment familiar windows 3.1 users extending windows brand beginning windows nt version 3.1 microsoft implied consumers expect familiar user experience name windows nt new technology advertised re-engineered version windows windows nt began rewrite os/2 operating system microsoft co-developed ibm 1980s several reasons including market success windows 3.0 1990 microsoft decided advance windows rather os/2 relinquished os/2 development responsibilities ibm forked work os/2 v3.0 competing operating system windows nt 3.1 available two editions windows nt 3.1 workstations windows nt 3.1 advanced server servers premiered sales limited high system requirements general lack 32-bit applications take advantage os data processing capabilities microsoft major foothold personal computer market due use ms-dos de facto operating system ibm pc compatibles nathan myhrvold joined microsoft acquisition dynamical systems research identified two major threats microsoft monopoly\u2014the risc architecture proved powerful equivalent intel processors ms-dos ran unix family cross-platform multitasking operating systems support multiprocessing networking widespread use unix hindered need adapt programs individual variant bill gates believed combination unix-like operating system risc processors could market threat prompting need microsoft develop unix killer could run multiple architectures gates hired dave cutler digital equipment corporation assist developing new operating system cutler left company series conflicts surrounding work prism architecture microkernel operating system mica agreed join microsoft condition able bring number staff members team dec cutler arrived microsoft october 31 1988 work future operating system started november operating system first developed revised version os/2 operating system microsoft jointly developed ibm os/2 originally intended succeed ms-dos yet commercially successful os designed could ported different processor platforms support multiprocessor systems operating systems time target enterprise market os also support networking posix standard security platform compliant orange book standards would require os multi-user system permission framework ability audit security-related events microsoft ibm wanted market operating system appealed corporate enterprise software customers meant greater security reliability processing power computer networking features however since microsoft also wanted capture market share unix computing platforms needed system design portable os/2 end microsoft began developing testing new operating system non-x86 processor emulated version intel i860 alluding chip codename n10 microsoft codenamed operating system nt os/2 dec preemptively sued microsoft alleging stole code mica use new operating system out-of-court settlement microsoft agreed make nt os/2 compatible dec alpha processor development team originally estimated development would complete within 18 months april 1989 nt os/2 kernel could run inside i860 emulator however development team later determined i860 unsuitable project december begun porting nt os/2 mips r3000 processor instead completed task three months senior microsoft executive paul maritz targeting release date 1992 development schedule uncertain company eager silence naysayers speculated nt would n't market 1994 planned present new os comdex 1990 may 1990 microsoft released windows 3.0 new version ms-dos-based windows desktop environment windows 3.0 sold well resulting shift microsoft marketing strategy eroded partnership ibm\u2014who wanted microsoft concentrate solely developing os/2 primary platform opposed building future business around windows users developers unsure whether adopt windows os/2 due uncertainties situation magnified fact operating systems incompatible api level microsoft resources also drained simultaneous development multiple operating systems august 1990 response popularity windows 3.0 nt os/2 team decided re-work operating system use extended 32-bit port windows api known win32 win32 maintained familiar structure 16-bit apis used windows would allow developers easily adapt software new platform maintaining level compatibility existing software windows shift windows-like architecture operating system shell also changed os/2 presentation manager windows program manager due changes nt presented comdex 1990 originally planned neither general public ibm knew transformation nt os/2 windows nt time although companies agree revised partnership ibm microsoft would alternate developing major versions os/2 instead collaborating version ibm eventually learned microsoft windows nt plans january 1991 immediately ended os/2 partnership ibm would solely develop os/2 2.0 planned amended version future versions without involvement microsoft october 1991 windows nt received first public demonstration comdex effort ensure software taking advantage windows nt available upon release scheduled late-1992 microsoft also distributed 32-bit software development kit selected developers attendance demonstration positively received pc magazine called windows nt modern reinvention operating system time claimed unlikely promised backward compatibility would kept final release march 1992 microsoft also released win32s would allow windows 3.1 partial compatibility windows nt programs purposes developing software optimized platform microsoft win32 professional developers conference june 1992 windows nt demonstrated running x86 mips processors beta version windows nt updated development kit also made available concurrently microsoft announced new version sql server product windows nt unix vendors feared software could killer app would affect market share unix systems concerns also raised nt memory usage computers era shipped 4 megabytes ram 16 mb recommended nts due high cost ram time critics thought high system requirements could affect sales adoption windows nt steps taken reduce memory usage methods paging microsoft began releasing public beta builds nt october 1992 month later comdex presentation focusing third-party software windows nt held final pre-release version nt released march 1993 alongside unveiling server version windows nt lan manager although stability performance improved still fears os could released unfinished state delayed 1993 windows nt 3.1 windows nt 3.1 advanced server numbered associate windows 3.1 released july 26 1993 first x86 mips versions shipped dec alpha version followed september microsoft sold workstation version 495 server version 1,495 ostensibly server price meant promotional discount offered first six months sale never raised retail price listed one\u2014 2,995 250 programmers wrote 5.6 million lines code development cost 150 million last year development team fixed 30,000 bugs product lifecycle microsoft published three service packs service pack 1 released october 8 1993 service pack 2 followed january 24 1994 service pack 3 release date october 29 1994 service packs distributed cd-rom floppy disk also bulletin board systems compuserve internet microsoft terminated support operating system december 31 2000 windows nt 3.1 localized various languages besides english available dutch french german japanese spanish swedish workstation server available danish finnish italian norwegian portuguese cutler set three main goals windows nt first goal portability contrast previous operating systems strongly tied one architecture windows nt able operate multiple architectures meet goal operating systems including operating system core written c programming language planning phase clear would cause windows nt higher memory consumption previous operating systems besides graphics system parts networking system written c++ parts operating systems required direct hardware access performance critical functions written assembly language parts isolated could easily rewritten porting operating system new architecture second goal reliability system longer crash due faulty application faulty hardware way operating system made attractive critical applications meet goal architecture windows nt designed operating system core isolated applications could access directly kernel designed microkernel components core run atop kernel modular fashion cutler knew principle work digital reliability also includes security operating system able resist external attacks mainframes already system every user account assigned specific rights administrator way users could prevented access confidential documents virtual memory management designed thwart attacks malware prevent users accessing foreign areas memory third goal called personality operating system able run applications designed various operating systems windows ms-dos os/2 applications mach kernel followed similar concept moving apis components operated user mode applications could changed new ones could added principle applied windows nt despite goals performance operating system optimized possible adapting critical sections code fast execution speed improve networking performance large parts networking system moved operating system core windows nt designed networking operating system branch novell lead product netware mostly lack competition microsoft failed develop product could challenge netware lead cutler hoped gain additional customers reliable networking operating system bill gates already dominated market desktop operating systems ms-dos windows hoped networking market windows nt especially hoped find market emerging number servers time expect success desktop market 1995 therefore windows nt positioned high-end operating system interview product manager david thacher designed replace windows 3.1 completely rather supplement microsoft product palette operating system critical applications expectations 10 20 among windows sales market share 10 high end market amounted one million copies windows nt 3.1 uses graphical user interface windows 3.1 developed anew operating system dos-based independent 32-bit operating system many concepts taken cutler previous operating system vms architecture windows nt takes ideas client-server model like modular structure communication modules system resources like memory files devices viewed objects operating system accessed way handles way secured unauthorized access operating system designed multiprocessor systems supports preemptive multitasking make use threads run multiple processes parallel using symmetric multiprocessing processing usage evenly distributed among available processors inter-process communication windows nt 3.1 designed around networks two newly introduced functions remote procedure call rpc network dde extension dynamic data exchange dde facilitate access data exchange processes running different computers inside network operating system designed combine certain elements monolithic kernel microkernel nowadays often referred hybrid kernel hardware abstraction layer represents lowermost layer isolates operating system underlying hardware make easy port operating system platforms kernel running atop basic functions like interrupt management processor synchronization functions operating system core handled modules operate independently one another swapped without affecting rest operating system positioned operating system core subsystems two types subsystems one integral subsystems perform important operating system functions one subsystem security subsystem handles logon process monitors security system type subsystem environment subsystem exposes operating system functions applications via application programming interfaces base subsystem 32-bit subsystem runs 32-bit applications written windows nt windows nt applications run one platform must recompiled every platform 32-bit subsystem also contains output functions including graphics device interface gdi subsystems call 32-bit subsystem able output text graphics subsystems contained windows nt 3.1 posix subsystem supports posix-compatible applications built windows nt x86 version os/2 subsystem allows command-line based os/2 1.x applications run virtual dos machine vdm sometimes also viewed subsystem strictly speaking normal 32-bit windows application manages applications originally built dos built top windows windows wow allows applications built 16-bit windows operating systems like windows 3.1 run x86 computers virtual dos machine uses virtual 8086 mode run dos applications directly risc computers emulator licensed insignia solutions used emulates 80286 processor however dos 16-bit windows applications run windows nt 3.1 due various limitations one inability applications directly access hardware well vxd files sometimes needed applications used windows nt 3.1 pure dos applications run separate memory spaces 16-bit windows applications share one memory space done due compatibility reasons applications depend ability like schedule+ microsoft mail also means 16-bit windows applications run cooperative multitasking faulty 16-bit windows application way able cause 16-bit windows applications windows nt crash windows nt 3.1 provides boot manager called ntldr loaded startup process operating system x86-based computers allows multiboot setup multiple instances windows nt 3.1 well ms-dos os/2 1.x ntldr used risc versions risc computers firmware provides boot manager every user log computer windows nt 3.1 booted pressing key combination ctrl+alt+del entering user name password users user account user-specific settings like program manager groups stored separately every user users assigned specific rights like right change system time right shut computer facilitate management user accounts also possible group multiple user accounts assign rights groups users windows nt 3.1 introduced new ntfs file system new file system robust hardware failures allows assignment read write rights users groups file system level ntfs supports long file names features accommodate posix applications like hard links compatibility reasons windows nt 3.1 also supports fat16 well os/2 file system hpfs designed networking operating system windows nt 3.1 supports multiple network protocols besides ipx/spx netbeui tcp/ip protocol supported allowing access internet similar windows workgroups files printers shared access rights configuration resources edited network network printer installed required drivers automatically transferred network removing need manually install drivers every computer remote access service ras allows client outside network connect network using modem isdn x.25 access resources workstation allows one ras connection time server supports 64 windows nt 3.1 supports then-new unicode standard character set allows multiple languages displayed facilitates localization operating system strings well file folder names internally processed unicode included programs like file manager unicode aware folders containing unicode characters accessed demonstration purposes unicode typeface called lucida sans unicode shipped windows nt 3.1 even though installed default previous code pages still supported compatibility purposes windows registry introduced windows nt 3.1 central hierarchical configuration database designed allow configuration computers network replace commonly-used text-based configuration files like ini files autoexec.bat config.sys using undocumented registry editor windows registry viewed edited user advanced server designed manage workstation computers function domain controller users groups well rights stored way user log computer network users managed centrally server trust relationships built domains able exchange data cross-domain using replication service files like logon scripts synchronized across computers network advanced server supports appletalk protocol allow connections macintosh computers hard drives combined raids windows nt 3.1 advanced server supported configurations raid 0 raid 1 raid 5 windows nt 3.1 part comes 32-bit versions components featured windows 3.1 windows workgroups however also included applications specifically aimed needs windows nt like user manager performance monitor disk administrator event viewer backup application advanced server contained server-specific administration tools windows nt 3.1 dos-based new 32-bit command-line processor called cmd.exe included compatible ms-dos 5.0 compatibility reasons windows nt 3.1 shipped 16-bit applications like microsoft write edlin windows nt 3.1 all-new operating system previous drivers could used includes wealth drivers various common components peripherals includes common scsi devices like hard drives cd-rom drives tape drives image scanners well isa devices like graphics cards sound cards network cards pci bus however expressly supported windows nt 3.1 supports uninterruptible power supply windows nt 3.1 could installed either using cd-rom provided boot disk utilizing set twenty-two 3.5 floppies twenty-three floppies advanced server windows nt 3.1 could also installed network coupon included made possible order set twenty-seven 5.25 floppies twenty-eight floppies advanced server compared floppies cd-rom contained additional drivers applications windows nt 3.1 supports multiple platforms aside x86 architecture runs computers dec alpha mips r4000 r4400 processors minimum system requirements x86 systems include 25 mhz 80386 processor least 12 megabytes memory 75 megabytes hard drive space vga graphics card risc systems require 16 megabytes memory 92 megabytes hard drive space cd-rom drive advanced server edition requires 80386 processor 16 megabytes memory 90 megabytes hard drive space risc systems 110 megabytes hard drive space needed windows nt 3.1 supports dual processor systems advanced server edition supports four processors due error processor detection routine windows nt 3.1 installed pentium ii newer processors microsoft never fixed problem unofficial patches available windows nt 3.1 sold 300,000 copies first year hardware requirements deemed high time recommended system requirements 486 processor 16 megabytes memory well average computer configuration operating system turned slow use 32-bit applications could used capabilities windows nt 3.1 scarce users resort old 16-bit applications however ran slower windows 3.1 estimates november 1993 counted 150 windows nt applications common types software like office suites available windows nt 3.1 development operating system api calls changed 32-bit applications built 1992 pre-release version windows nt 3.1 could run final version affected even software like microsoft visual c++ 1.0 risc systems windows nt 3.1 even bigger disadvantage even though powerful x86 systems almost 32-bit applications drivers ported platforms 16-bit applications ran much slower risc systems 80286 emulation compared x86 systems could run 16-bit applications natively dos 16-bit applications depended 386 calls could run risc systems however reception negative multitasking capabilities operating system rated positively especially compared windows 3.1 compared size operating system installation turned easy even though installing floppies time-consuming task advanced server intended successor unsuccessful lan manager product technically much superior predecessor failed gain success shared problems workstation pendant low performance running 16-bit applications advanced server provided financial advantage large networks price dependent number clients unlike competitor novell netware windows nt microsoft entered market could previously address mostly dominated unix novell netware os/2 test performed infoworld magazine november 1993 networking capabilities several operating systems tested showed windows nt 3.1 seriously lacking inter-client communication could connect server via netbeui attempts connect unix netware os/2 failed client software available advanced server client macintosh limited os/2 able connect server even though operating system actual success moderate huge lasting impact developers unix derivations first time strived standardize operating systems novell concerned market share bought unix vendor manufacturers microprocessors hoped use portability new operating system increase sales thus ports windows nt announced various platforms like sun sparc architecture clipper architecture recognized windows nt would dominate desktop market soon hardware became powerful enough run operating system acceptable speed eight years later microsoft would unify consumer-oriented windows line remained ms-dos based nt line october 2001 release windows xp\u2014the first consumer-oriented version windows use nt architecture notes references", + "neighbors": [ + 78, + 85, + 111, + 127, + 148, + 166, + 210, + 278, + 306, + 322, + 326, + 359, + 379, + 433, + 445, + 457, + 463, + 491, + 495, + 595, + 627, + 647, + 689, + 754, + 796, + 815, + 868, + 941, + 961, + 1011, + 1016, + 1027, + 1049, + 1050, + 1098, + 1110, + 1138, + 1151, + 1193, + 1247, + 1287, + 1304, + 1502, + 1555, + 1616 + ], + "mask": "Validation" + }, + { + "node_id": 109, + "label": 5, + "text": "Neighbor_Discovery_Protocol:neighbor discovery protocol neighbor discovery protocol ndp nd protocol internet protocol suite used internet protocol version 6 ipv6 operates link layer internet model rfc 1122 responsible gathering various information required internet communication including configuration local connections domain name servers gateways used communicate distant systems protocol defines five different icmpv6 packet types perform functions ipv6 similar address resolution protocol arp internet control message protocol icmp router discovery router redirect protocols ipv4 however provides many improvements ipv4 counterparts rfc 4861 section 3.1 example includes neighbor unreachability detection nud thus improving robustness packet delivery presence failing routers links mobile nodes inverse neighbor discovery ind protocol extension rfc 3122 allows nodes determine advertise ipv6 address corresponding given link-layer address similar reverse arp ipv4 secure neighbor discovery protocol send security extension ndp uses cryptographically generated addresses cga resource public key infrastructure rpki provide alternative mechanism securing ndp cryptographic method independent ipsec neighbor discovery proxy nd proxy rfc 4389 provides service similar ipv4 proxy arp allows bridging multiple network segments within single subnet prefix bridging done link layer ndp defines five icmpv6 packet types purpose router solicitation router advertisement neighbor solicitation neighbor advertisement network redirects messages used provide following functionality iana maintains list current ndp options published", + "neighbors": [ + 52, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 1042, + 1116, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 110, + "label": 1, + "text": "Naval_Vessel_Register:naval vessel register naval vessel register nvr official inventory ships service craft custody titled united states navy contains information ships service craft make official inventory navy time vessel authorized life cycle disposal also includes ships removed register often termed stricken struck disposed sale transfer another government means ships service craft disposed prior 1987 currently included gradually added along updates nvr traces origin back 1880s evolved several previous publications 1911 bureau construction repair published ships data us naval vessels subsequently became ships data book 1952 bureau ships bureau ordnance vessel register first published 1942 retitled naval vessel register combined ships data book bureau ships 1959 since 1962 nvr maintained published navsea shipbuilding support office navshipso naval sea systems command referred congress statutes nvr maintained directed u.s. navy regulations article 0406 september 14 1990 vessels listed nvr classification hull number assigned ships service craft authorized built president united states chief naval operations requests instatement reinstatement vessels approved secretary navy listed ship service craft remains nvr throughout life navy asset afterwards final disposition recorded many vessels struck nvr transferred navy inactive fleet united states maritime administration marad become part national defense reserve fleet continue limited operation ready reserve fleet nvr updated weekly 2010s available electronic form online 6,500 separate record transactions processed annually supported official documentation nvr includes current list ships service craft hand construction converted loaned/leased loaned assigned military sealift command ship class fleet assignment name age home port planning yard custodian hull machinery characteristics builder key construction dates battle forces local defense miscellaneous support forces status conditions data elements provided march 2014 navy started counting self-deployable support ships fleet minesweepers surveillance craft tugs part battle fleet order reach count 272 october 2016", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 111, + "label": 2, + "text": "Features_new_to_Windows_7:features new windows 7 new features included windows 7 advancements touch speech handwriting recognition support virtual hard disks support additional file formats improved performance multi-core processors improved boot performance kernel improvements windows 7 retains windows aero graphical user interface visual style introduced predecessor windows vista many areas seen enhancements unlike windows vista window borders taskbar turn opaque window maximized windows aero active instead remain translucent support themes extended windows 7 addition providing options customize colors window chrome aspects interface including desktop background icons mouse cursors sound schemes operating system also includes native desktop slideshow feature new theme pack extension introduced codice_1 essentially collection cabinet files consist theme resources including background images color preferences desktop icons mouse cursors sound schemes new theme extension simplifies sharing themes also display desktop wallpapers via rss feeds provided windows rss platform microsoft provides additional themes free website default theme windows 7 consists single desktop wallpaper named harmony default desktop icons mouse cursors sound scheme introduced windows vista however none desktop backgrounds included windows vista present windows 7 new themes include architecture characters landscapes nature scenes additional country-specific theme determined based defined locale operating system installed although theme user home country displayed within user interface files country-specific themes included operating system themes included windows 7\u2014excluding default theme\u2014include six wallpaper images number new sound schemes associated included theme also introduced afternoon calligraphy characters cityscape delta festival garden heritage landscape quirky raga savana sonata themes may introduce custom sounds used others themes well windows 7 introduces desktop slideshow feature periodically changes desktop wallpaper based user-defined interval change accompanied smooth fade transition duration customized via windows registry desktop slideshow feature supports local images images obtained via rss windows vista microsoft introduced gadgets display information image slideshows rss feeds user desktop gadgets could optionally displayed sidebar docked side screen windows 7 sidebar removed gadgets still placed desktop gadgets brought foreground top active applications pressing several new features gadgets introduced including new desktop context menu options access gadgets hide active gadgets high dpi support feature automatically rearrange gadget based position gadgets additional new features include cached gadget content optimizations touch-based devices gadget windows media center gadgets closely integrated windows explorer gadgets continue operate single codice_2 process unlike windows vista gadgets could operate multiple codice_2 processes active gadgets also hidden via new desktop menu option microsoft stated option result power-saving benefits original equipment manufacturers enterprises windows 7 natively supports ability customize wallpaper displayed user login settings change wallpaper available via windows registry users also customize wallpaper options customize appearance interface lighting shadows also available windows explorer windows 7 supports file libraries aggregate content various locations \u2013 including shared folders networked systems shared folder indexed host system \u2013 present unified view libraries hide actual location file stored searching library automatically federates query remote systems addition searching local system files remote systems also searched unlike search folders libraries backed physical location allows files saved libraries files transparently saved backing physical folder default save location library may configured user default view layout library libraries generally stored libraries special folder allows displayed navigation pane default new user account windows 7 contains four libraries different file types documents music pictures videos configured include user profile folders respective file types well computer corresponding public folders public folder also contains hidden recorded tv library appears windows explorer sidepane tv set media center first time addition aggregating multiple storage locations libraries enable arrangement views search filter suggestions arrangement views allow pivot view library contents based metadata example selecting month view pictures library display photos stacks stack represents month photos based date taken music library artist view display stacks albums artists collection browsing artist stack display relevant albums search filter suggestions new feature windows 7 explorer search box user clicks search box menu shows showing recent searches well suggested advanced query syntax filters user type one selected typed manually menu update show possible values filter property list based current location parts query already typed example selecting tags filter typing tags search box display list possible tag values return search results arrangement views search filter suggestions database-backed features require locations library indexed windows search service local disk locations must indexed local indexer windows explorer automatically add locations indexing scope included library remote locations indexed indexer another windows 7 machine windows machine running windows search 4 windows vista windows home server another device implements ms-wsp remote query protocol windows explorer also supports federating search external data sources custom databases web services exposed web described via opensearch definition federated location description called search connector provided codice_4 file installed data source becomes queryable directly windows explorer windows explorer features previews thumbnails work results federated search well windows explorer received numerous minor enhancements improve overall functionality explorer search box address bar resized folders desktop user profile folders hidden navigation pane reduce clutter new content view added shows thumbnails metadata together new button toggle preview pane added toolbar button create new folder moved organize menu onto toolbar list view provides space items windows vista finally storage space consumption bars present hard disks windows vista shown removable storage devices areas shell also received similar fine-tunings progress bars overlay icons may appear application button taskbar better alert user status application work progress file types property handlers ifilters installed re-indexed default previously adding submenus shell context menus customizing context menu behavior certain folder possible installing form plug-in known shell extensions windows 7 however computer-savvy users editing windows registry and/or desktop.ini files additionally new shell api introduced designed simplify writing context menu shell extensions software developers windows 7 includes native support burning iso files functionality available user selects burn disc image option within context menu iso file support disc image verification also included previous versions windows users required install-third party software burn iso images start orb fade-in highlight effect user hovers mouse cursor start menu right column aero glass color windows vista always black windows 7 start menu retains two-column layout predecessors several functional changes start search field introduced windows vista extended support searching keywords control panel items example clicking start button typing wireless show control panel options related configuring connecting wireless network adding bluetooth devices troubleshooting group policy settings windows explorer provide ability administrators active directory domain expert user add five internet web sites five additional search connectors search results view start menu links appear bottom pane allow search executed selected web site search connector microsoft suggests network administrators could use feature enable searching corporate intranets internal sharepoint server windows taskbar seen significant revision since introduction windows 95 combines previous quick launch functionality open application window icons taskbar rendered aero glass element whose color changed via personalization control panel 10 pixels taller windows vista accommodate touch screen input new larger default icon size although smaller taskbar size available well maintain proportion newer high resolution monitor modes running applications denoted border frame around icon within border color effect dependent predominant rgb value icon follows mouse cursor also indicates opened status application glass taskbar translucent windows vista taskbar buttons show icons default application titles unless set 'not combine 'combine taskbar full case icons shown application running programs running pinned taskbar rearranged items notification area also rearranged quick launch toolbar removed default configuration may easily added windows 7 taskbar application-oriented window-oriented therefore n't show window titles shown application icon clicked hovered applications pinned taskbar allowing user instant access applications commonly use ways pin applications taskbar icons dragged dropped onto taskbar application \u2019 icon right-clicked pin taskbar thumbnail previews introduced windows vista expanded preview windows opened application small-sized thumbnail view also interact user close window opened clicking x corresponding thumbnail preview name window also shown thumbnail preview peek window obtained hovering thumbnail preview peeking brings window thumbnail preview mouse cursor hovers turns windows desktop transparent also works tabs internet explorer individual tabs may peeked thumbnail previews thumbnail previews integrate thumbnail toolbars control application thumbnail previews example windows media player opened mouse cursor hovering application icon thumbnail preview allow user ability play stop play next/previous track without switch windows media player window jump lists menu options available right-clicking taskbar icon holding left mouse button sliding towards center desktop icon application jump list corresponding features microsoft word displaying recently opened documents windows media player recent tracks playlists internet explorer recent browsing history options opening new tabs starting inprivate browsing windows live messenger common tasks instant messaging signing changing online status 10 menu items may appear list partially customizable user progress bar taskbar tasks allows users know progress task without switching pending window task progress used windows explorer internet explorer third-party software notification area redesigned standard volume network power action center status icons present application icons shown unless user chosen shown new notification area icons control panel added replaces customize notification icons dialog box taskbar start menu properties window first introduced windows xp addition able configure whether application icons shown ability hide application notification balloons added user view notifications later time triangle left visible notification icons displays hidden notification icons unlike windows vista windows xp hidden icons displayed window taskbar instead taskbar icons dragged window notification area previous versions windows taskbar ended notification area right-hand side windows 7 however introduces show desktop button far right side taskbar initiate aero peek feature makes open windows translucent hovered mouse cursor clicking button shows desktop clicking brings windows focus new button replaces show desktop shortcut located quick launch toolbar previous versions windows touch-based devices aero peek initiated pressing holding show desktop button touching button shows desktop button also increases width accommodate pressed finger windows dragged top screen maximize dragged away restore dragging window left right screen makes take half screen allowing user tile two windows next also resizing window bottom screen top extend window full height retain width features disabled via ease access center users wish windows automatically resize aero shake allows users clear clutter screen shaking dragging back forth window choice mouse windows minimize window user shook stays active screen window shaken restored similar desktop preview use many open windows desktop feature minimize windows except one shake click hold title bar window need open shake mouse window shake maximize others minimized restore windows shake mouse whilst holding title bar open window variety new keyboard shortcuts introduced global keyboard shortcuts taskbar user interface font management overhauled windows 7 windows vista collection installed fonts displayed windows explorer window fonts originate font family appear icons represented stacks display font previews within interface windows 7 also introduces option hide installed fonts certain fonts automatically removed view based user regional settings option manually hide installed fonts also available hidden fonts remain installed enumerated application asks list available fonts thus reducing amount fonts scroll within interface also reducing memory usage windows 7 includes 40 new fonts including new gabriola font dialog box fonts windows 7 also updated display font previews within interface allows users preview fonts selecting previous versions windows displayed name font cleartype text tuner previously available microsoft powertoy earlier windows versions integrated updated windows 7 microsoft would later backport windows 8 emoji features windows 7 two major new user interface components device management windows 7 devices printers device stage integrated windows explorer together provide simplified view devices connected computer capabilities support devices printers new control panel interface directly accessible start menu unlike device manager control panel applet still present icons shown devices printers screen limited components system non-expert user recognize plug-in devices example external monitor connected system displayed device internal monitor laptop device-specific features available context menu device external monitor context menu example provides link display settings control panel new control panel applet also replaces printers window prior versions windows common printer operations setting default printer installing removing printers configuring properties paper size done control panel windows 7 server 2008 r2 introduce print driver isolation improves reliability print spooler running printer drivers separate process spooler service third party print driver fails isolated impact drivers print spooler service device stage provides centralized location externally connected multi-function device present functionality user device portable music player connected system device appears icon task bar well windows explorer windows 7 ships high-resolution images number popular devices capable connecting internet download images devices n't recognize opening icon presents window displays actions relevant device screenshots technology presented microsoft suggest mobile phone could offer options two-way synchronization configuring ring-tones copying pictures videos managing device windows media player using windows explorer navigate device device status information free memory battery life also shown actual per-device functionality defined via xml files downloaded device first connected computer provided manufacturer installation disc hilton locke worked tablet pc team microsoft reported december 11 2007 windows 7 new touch features devices supporting multi-touch overview demonstration multi-touch capabilities including virtual piano program mapping directions program touch-aware version microsoft paint given things digital conference may 27 2008 video multi-touch capabilities made available web later day windows 7 introduces native support sensors including accelerometer sensors ambient light sensors location-based sensors operating system also provides unified driver model sensor devices notable use technology windows 7 operating system adaptive display brightness feature automatically adjusts brightness compatible computer display based environmental light conditions factors gadgets developed windows 7 also display location-based information applications certain sensor capabilities developed without requisite hardware data acquired sensors considered personally identifiable information sensors disabled default windows 7 account windows 7 requires administrative permissions enable sensor sensors also require user consent share location data unlike previous versions windows windows 7 able report laptop battery need replacement operating system works design capabilities present modern laptop batteries report information powercfg command enables customization hibernation file size default windows 7 automatically sets size hibernation file 75 computer total physical memory operating system also compresses contents memory hibernate process minimize possibility contents exceeds default size hibernation file windows 7 introduces new /energy parameter powercfg command generates html report computer energy efficiency displays information related devices settings windows 7 individually suspend usb hubs supports selective suspend in-box usb class drivers direct3d 11 direct2d directwrite dxgi 1.1 warp several components currently available windows vista sp2 windows server 2008 sp2 installing platform update windows vista first introduced windows vista desktop window manager dwm windows 7 updated use version 10.1 direct3d api performance improved significantly desktop window manager still requires least direct3d 9-capable video card supported new device type introduced direct3d 11 runtime video driver conforming windows display driver model v1.1 dxgi kernel windows 7 provides 2d hardware acceleration apis gdi direct2d directwrite though gdi+ updated use functionality allows dwm use significantly lower amounts system memory grow regardless many windows opened like windows vista systems equipped wddm 1.0 video card operate fashion windows vista using software-only rendering desktop window manager windows 7 also adds support systems using multiple heterogeneous graphics cards different vendors support color depths 30 48 bits included along wide color gamut scrgb hdmi 1.3 converted output xvycc video modes supported windows 7 16-bit srgb 24-bit srgb 30-bit srgb 30-bit extended color gamut srgb 48-bit scrgb user windows 7 server 2008 r2 individual dpi settings rather machine single setting previous versions windows dpi settings changed logging without needing restart time several technologies incorporated subsequent versions windows improve performance operating system traditional hard disk drives hdd rotating platters since solid state drives ssd differ mechanical hdds key areas moving parts write amplification limited number erase cycles allowed reliable operation beneficial disable certain optimizations add others specifically ssds windows 7 incorporates many engineering changes reduce frequency writes flushes benefit ssds particular since write operation wears flash memory windows 7 also makes use trim command supported ssd implemented early devices optimizes erase cycles performed reducing need erase blocks write increasing write performance several tools techniques implemented past reduce impact rotational latency traditional hdds notably disk defragmentation superfetch readyboost application launch prefetching involve reorganizing rewriting data platters since ssds moving platters reorganization advantages may instead shorten life solid state memory therefore tools default disabled ssds windows 7 except early generation ssds might still benefit finally partitions made windows 7 \u2019 partition-creating tools created ssd \u2019 alignment needs mind avoiding unwanted systematic write amplification enterprise ultimate editions windows 7 incorporate support virtual hard disk vhd file format vhd files mounted drives created booted way wim files furthermore installed version windows 7 booted run vhd drive even non-virtual hardware thereby providing new way multi boot windows features hibernation bitlocker available booting vhd default computer disk partitioned two partitions one limited size booting bitlocker running windows recovery environment second operating system user files windows 7 also seen improvements safely remove hardware menu including ability eject one camera card time single hub retain ports future use without reboot labels removable media also listed rather drive letter windows explorer default shows memory card reader ports computer contain card bitlocker brings encryption support removable disks usb drives devices protected passphrase recovery key automatically unlocked computer according data gathered microsoft customer experience improvement program ceip 35 vista sp1 installations boot 30 seconds less lengthy boot times remainder machines mainly due services programs loaded required system first started microsoft mike fortin distinguished engineer windows team noted august 2008 microsoft set aside team work solely issue team aims significantly increase number systems experience good boot times focused hard increasing parallelism driver initialization also microsoft aims dramatically reduce number system services along demands processors storage memory windows media center windows 7 retained much design feel predecessor variety user interface shortcuts browsing capabilities playback h.264 video locally media center extender including xbox 360 supported notable enhancements windows 7 media center include new mini guide new scrub bar option color code guide show type internet content tightly integrated regular tv via guide windows 7 versions support four tuners type qam atsc cablecard ntsc etc. browsing media library items n't album art shown range foreground background color combinations instead using white text blue background left right remote control buttons held browse library quickly two-letter prefix current album name prominently shown visual aid picture library includes new slideshow capabilities individual pictures rated also browsing media library new column appears top named shared allows users access shared media libraries media center pcs directly within media center television support windows media center tv pack released microsoft 2008 incorporated windows media center includes support cablecard north american atsc clear qam tuners well creating lists favorite stations gadget windows media center also included windows 7 includes avi wav aac/adts file media sinks read respective formats mpeg-4 file source read mp4 m4a m4v mp4v mov 3gp container formats mpeg-4 file sink output mp4 format windows 7 also includes media source read mpeg transport stream/bdav mpeg-2 transport stream m2ts mts m2t avchd files transcoding encoding support exposed built-in windows application codecs included media foundation transforms mfts addition windows media audio windows media video encoders decoders asf file sink file source introduced windows vista windows 7 includes h.264 encoder baseline profile level 3 main profile support aac low complexity aac-lc profile encoder playback various media formats windows 7 also introduces h.264 decoder baseline main high profiles support level 5.1 aac-lc he-aac v1 sbr multichannel he-aac v2 ps stereo decoders mpeg-4 part 2 simple profile advanced simple profile decoders includes decoding popular codec implementations divx xvid nero digital well mjpeg dv mft decoders avi windows media player 12 uses built-in media foundation codecs play formats default windows 7 also updates directshow filters introduced windows vista playback mpeg-2 dolby digital decode h.264 aac he-aac v1 v2 dolby digital plus including downmixing dolby digital action center formerly windows security center encompasses security maintenance called windows health center windows solution center earlier builds new user interface user account control introduced provides ability select four different levels notifications one notification settings default new windows 7 geo-tracking capabilities also available windows 7 feature disabled default enabled user limited control applications track location encrypting file system supports elliptic-curve cryptographic algorithms ecc windows 7 backward compatibility previous releases windows windows 7 supports mixed-mode operation ecc rsa algorithms efs self-signed certificates using ecc use 256-bit key default efs configured use 1k/2k/4k/8k/16k-bit keys using self-signed rsa certificates 256/384/512-bit keys using ecc certificates windows vista protected user-mode audio puma content protection facilities available applications running protected media path environment media foundation application programming interface could interact environment media player application designed use media foundation windows 7 restriction lifted puma also incorporates stricter enforcement copy never bits using serial copy management system scms copy protection s/pdif connection well high-bandwidth digital content protection hdcp hdmi connections windows 7 includes new windows biometric framework framework consists set components standardizes use fingerprint biometric devices prior releases microsoft windows biometric hardware device manufacturers required provide complete stack software support device including device drivers software development kits support applications microsoft noted white paper windows biometric framework proliferation proprietary stacks resulted compatibility issues compromised quality reliability system made servicing maintenance difficult incorporating core biometric functionality operating system microsoft aims bring biometric device support par classes devices new control panel called biometric device control panel included provides interface deleting stored biometrics information troubleshooting enabling disabling types logins allowed using biometrics biometrics configuration also configured using group policy settings alongside workgroup system used previous versions windows 7 adds new ad hoc home networking system known homegroup system uses password join computers group allows users libraries along individual files folders shared multiple computers computers running windows 7 windows 10 version 1709 create join homegroup windows homegroup home network feature support deprecated windows 10 removed windows 10 version 1803 later homegroup concept similar feature slated windows vista known castle would made possible identification service members network without centralized server homegroup created response need simple sharing model inexperienced users need share files without wrestling user accounts security descriptors share permissions end microsoft previously created simple file sharing mode windows xp enabled caused connected computers authenticated guest model either certain file folder shared anyone connects network even unauthorized parties range wireless network shared homegroup however windows 7 adds support multiple firewall profiles windows firewall windows vista dynamically changes network traffic allowed blocked based location computer based network connected approach falls short computer connected one network time computer ethernet wireless interface case vista applies profile secure network connections often desirable windows 7 resolves able apply separate firewall profile network connection windows 7 windows server 2008 r2 introduce support domain name system security extensions dnssec set specifications securing certain kinds information provided domain name system dns used internet protocol ip networks dnssec employs digital signatures ensure authenticity dns data received dns server protect dns cache poisoning attacks windows 7 contains windows powershell 2.0 out-of-the-box also available download install older platforms new management features include windows 7 includes internet explorer 8 .net framework 3.5 sp1 internet information services iis 7.5 windows installer 5.0 standalone xps viewer paint calculator resource monitor wordpad also updated paint features ribbon interface similar one introduced office 2007 also sports several new features calculator rewritten multiline capabilities including programmer statistics modes unit conversion date calculations calculator also given graphical facelift first since windows 95 1995 windows nt 4.0 1996 wordpad also features new ribbon user interface wordpad supports office open xml odf file formats resource monitor includes improved ram usage display supports display tcp/ip ports listened filtering processes using networking filtering processes disk activity listing searching process handles e.g files used process loaded modules files required executable file e.g dll files microsoft magnifier accessibility utility low vision users dramatically improved magnifier supports full screen zoom feature whereas previous windows versions magnifier attached top screen dock layout new full screen feature enabled default however requires windows aero advantage full screen zoom feature windows set windows 7 basic windows classic high contrast themes magnifier still function like windows vista earlier windows installer 5.0 supports installing configuring windows services provides developers control setting permissions software installation neither features available prior versions windows custom actions support features continue required windows installer packages need implement features", + "neighbors": [ + 66, + 108, + 111, + 148, + 268, + 295, + 379, + 413, + 425, + 433, + 521, + 542, + 638, + 647, + 689, + 771, + 813, + 815, + 832, + 961, + 989, + 1042, + 1044, + 1084, + 1098, + 1151, + 1193, + 1287, + 1363, + 1428, + 1486, + 1534, + 1555, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 112, + "label": 3, + "text": "ARM11:arm11 arm11 group older 32-bit risc arm processor cores licensed arm holdings arm11 core family consists arm1136j f -s arm1156t2 f -s arm1176jz f -s arm11mpcore since arm11 cores released 2002 2005 longer recommended new ic designs instead arm cortex-a arm cortex-r cores preferred arm11 microarchitecture announced 29 april 2002 introduced armv6 architectural additions announced october 2001 include simd media instructions multiprocessor support new cache architecture implementation included significantly improved instruction processing pipeline compared previous arm9 arm10 families used smartphones apple nokia others initial arm11 core arm1136 released licensees october 2002 arm11 family currently armv6-architecture cores however armv6-m cores cortex-m0 cortex-m1 addressing microcontroller applications arm11 cores target demanding applications terms instruction set arm11 builds preceding arm9 generation incorporates arm926ej-s features adds armv6 instructions media support simd accelerating irq response microarchitecture improvements arm11 cores include jtag debug support halting stepping breakpoints watchpoints simplified embeddedice module replaced interface became part armv7 architecture hardware tracing modules etm etb compatible updated versions used arm9 particular trace semantics updated address parallel instruction execution data transfers arm makes effort promote good verilog coding styles techniques ensures semantically rigorous designs preserving identical semantics throughout chip design flow included extensive use formal verification techniques without attention integrating arm11 third-party designs could risk exposing hard-to-find latent bugs due arm cores integrated many different designs using variety logic synthesis tools chip manufacturing processes impact register-transfer level rtl quality magnified many times arm11 generation focused synthesis previous generations making concerns issue four arm11 cores", + "neighbors": [ + 75, + 105, + 214, + 603, + 607, + 681, + 695, + 853, + 917, + 988, + 1069, + 1117, + 1147, + 1176, + 1178, + 1262, + 1305, + 1384, + 1422, + 1488, + 1507, + 1529, + 1572, + 1591 + ], + "mask": "Train" + }, + { + "node_id": 113, + "label": 2, + "text": "/e/_(operating_system):/e/ operating system /e/ formerly eelo free open-source operating system smartphones android mobile platform fork lineageos operating system developed e foundation founded ga\u00ebl duval /e/ marketed privacy software contain proprietary google apps services 2017 duval series articles titled leaving apple google /e/ odyssey proposed concept operating system without privacy-invasive software followed kickstarter crowdfunding campaign os initially named eelo name subsequently changed /e/ due copyright issues first beta version based lineageos 14.1 released september 12 2018 source code gitlab latest beta version milestone 0.7 based lineageos 14.1 lineageos 15.1 released june 26 2019 operating system includes set pre-installed mobile apps /e/ include google apps normally pre-installed android phones /e/ offers several unique features lineageos include features 30 april 2019 /e/ officially builds 81 devices including essential phone fairphone samsung xiaomi devices official builds labelled nightly although generally released every couple days /e/ active user base thousand users interact users provide support /e/ team uses telegram channels discussion forum", + "neighbors": [ + 24, + 41, + 101, + 131, + 134, + 162, + 298, + 301, + 306, + 337, + 351, + 357, + 393, + 404, + 422, + 429, + 431, + 477, + 502, + 527, + 622, + 629, + 695, + 704, + 716, + 754, + 775, + 782, + 837, + 897, + 974, + 1018, + 1020, + 1046, + 1049, + 1051, + 1055, + 1061, + 1082, + 1126, + 1138, + 1167, + 1183, + 1185, + 1193, + 1203, + 1276, + 1286, + 1310, + 1369, + 1411, + 1419, + 1458, + 1480, + 1483, + 1500, + 1539, + 1569, + 1601, + 1602 + ], + "mask": "Train" + }, + { + "node_id": 114, + "label": 8, + "text": "Heeii:heeii heeii formerly known elkoog b.v. company based groningen netherlands provides recommendation service web browsers means plug-in website visitors use heeii recommendations able get appropriate content links result reaching online objectives heeii combining human computer interaction research software engineering techniques understand implicit emergent behaviors web surfers based array implicit behaviors heeii \u2019 technology discerns user \u2019 intent dynamically connects content based collective wisdom visitors similar interests heeii built technology many social principles popularized books long tail wisdom crowds implicit approaches one heeii implements collects community wisdom emerges web observing user behaviors see comparison active passive filtering company founded 2006 edwin kuipers headquartered groningen netherlands elkoog able start taking round angel funding various close business relations friends funding round came approximately 750,000 early 2007 concept proven feasible heeii scales non-linearly always available respond rapidly financing sufficient infrastructure realized elkoog took round angel funding venture capital fund called knowledge conversion fund ir g.j smid fund foundation second funding round came approximately 1.6 million beginning 2009 company raised additional 2.6 million marketing netherlands company home base rest world also early 2009 heeii received academic accreditation becoming member expertise center target building sustainable economic cluster intelligent sensor network information systems northern part netherlands aimed data management large amounts data prominent scientific research groups innovative businesses jointly develop improve complex scalable data systems starting point target paradigm full integration large-scale data processing archiving analysis experimental surroundings target model developed actual market applications participants follow-up projects develop products services target collaboration target \u2019 secretary university groningen partners drew innovative program 32 million euros total investing total sum almost 16 million euros", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 115, + "label": 1, + "text": "Flag_state:flag state flag state merchant vessel jurisdiction whose laws vessel registered licensed deemed nationality vessel merchant vessel must registered registered one jurisdiction may change register registered flag state authority responsibility enforce regulations vessels registered flag including relating inspection certification issuance safety pollution prevention documents ship operates laws flag state laws applicable ship involved admiralty case term flag convenience describes business practice registering merchant ship state ship owners flying state civil ensign ship ships may registered flags convenience reduce operating costs avoid regulations avoid inspection scrutiny owner country normally nationality i.e. flag ship determines taxing jurisdiction since flag right declaration 1921 recognised states\u2014including land-locked countries\u2014have right maintain ship register ship \u2019 flag state failure flag states comply survey certification responsibilities especially flag-of-convenience states delegated task classification societies number states since 1982 established port state controls foreign-registered ships entering jurisdiction january 2010 panama world largest flag state almost quarter world ocean-going tonnage registered united states united kingdom 1 world war ii nations able maintain dominance cases even improve position maritime trade offering vessels exclusive protection flying flags would turn give nation exclusive control vessels shipowners time needed protection pirates privateers provided naval vessels flag state cases states offered subsidies shipbuilding industries addition incentives states might impose restrictions based flag state closing ports ships one well known example applied case england restricted import asian goods american british vessels england opened ports maneuvered position strength like gain access continental ports similarly france imposed trade monopoly colonies remained place 1869 ships must registered ship register jurisdiction whose flag flying flag registers many countries open ships foreign owners normally flag state one ship register several countries one register flag state set flag state control system", + "neighbors": [ + 348, + 451, + 761 + ], + "mask": "Test" + }, + { + "node_id": 116, + "label": 2, + "text": "PlayStation_3_system_software:playstation 3 system software playstation 3 system software updatable firmware operating system playstation 3 base operating used sony playstation 3 fork freebsd netbsd called cellos process updating almost identical playstation portable playstation vita playstation 4 software may updated downloading update directly playstation 3 downloading user local official playstation website pc using usb storage device transfer playstation 3 installing update game discs containing update data initial slim ps3s sku shipped unique firmware new features also seen software 3.00 native operating system playstation 3 cellos believed fork freebsd tcp/ip stack fingerprinting identifies playstation 3 running freebsd playstation 3 known contain code freebsd netbsd 3d computer graphics api software used playstation 3 libgcm psgl based opengl es nvidia cg libgcm low level api psgl higher level api developers preferred use libgcm due higher levels performance similar later playstation 4 console also two apis low level gnm higher level gnmx unlike software development kit sdk mobile apps sony playstation 3 sdk available registered game development companies contains software tools integrated hardware component due fact requires licensing agreement sony considered expensive number open source homebrew ps3 sdks available addition number leaked ps3 sdks playstation 3 uses xrossmediabar xmb graphical user interface also used playstation portable psp handheld console variety sony bravia hdtvs blu-ray disc players many sony products xmb displays icons horizontally across screen seen categories users navigate using left right buttons d-pad move icons forward back across screen highlighting one time opposed using kind pointer select option one category selected usually specific options available select spread vertically selected icon users may navigate among options using buttons d-pad basic features offered xmb implementations varies based device software version apart appearing psp console category icons photos music games ps3 added users tv friends xmb also xmb offers degree multitasking in-game xmb features added ps3 properly firmware version 2.41 causing early implementation problems xmb proved successful user interface sony products psp ps3 next generation sony video game consoles playstation 4 playstation vita longer use user interface playstation 3 supports remote play sony handheld game consoles playstation portable playstation vita however unlike remote play playstation 4 playstation vita problem ps3 supported select titles results often laggy however clear remote play ps3 testing bed much better integration ps4 also users playstation 3 playstation vita possible share media files videos music images transferring multimedia files directly playstation 3 playstation vita vice versa furthermore use service called cross-buy allows buy certain games support feature one time play sony platforms case games saved games actually transfer back forth devices allowing players pick moment left also feature called cross-play cross-platform play covering playstation vita software title interact playstation 3 software title different software titles use cross-play different ways example ultimate marvel vs. capcom 3 title supporting cross-play feature ps3 version game controlled using ps vita system addition ps3 games played ps vita using playstation streaming service similar many consoles playstation 3 capable photo audio video playback variety formats also includes various photo slideshow options several music visualizations furthermore playstation 3 able play blu-ray disc dvd movies well audio cds box also capable adopting streaming media services netflix web browser ps3 uses netfront browser although unlike successor ps4 uses modern webkit core safari apple ps3 web browser receives low score html5 compliance testing however unlike ps4 ps3 able play adobe flash including full-screen flash early versions playstation 3 system software also provided feature called otheros available ps3 systems prior slimmer models launched september 2009 feature enabled users install operating system linux due security concerns sony later removed functionality 3.21 system software update according sony computer entertainment sce disabling feature help ensure ps3 owners continue access broad range gaming entertainment content sce content partners secure system sony successfully sued class action removal feature settlement approved september 2016 sony agreed pay 55 many 10 million ps3 owners denied wrongdoing furthermore playstation 3 provides printing support example print images web pages supported printer connected via usb cable local network however selection printers canon epson hewlett-packard compatible ps3 playstation 3 consoles able play original playstation games psone discs downloadable classics however playstation 3 models backwards compatible playstation 2 games summary early ps3 consoles 60gb 20gb launch ps3 consoles backwards compatible ps2 games ps2 chips later models notably 80gb metal gear solid ps3 consoles also backwards compatible partial software emulation case since longer ps2 cpu although ps2 gpu allowing reduced backward compatibility hardware-assisted software emulation later models ps3 slim ps2 backwards compatible though users still enjoy ps3 psone games according sony removed backwards compatibility ps3 already point three years lifecycle time vast majority consumers purchasing ps3 cite ps3 games primary reason meaning ps2 compatibility longer necessary nevertheless ps2 classics playable ps3 officially introduced playstation network purchase afterwards although selection ps2 games republished digital format unlike ps3 games lack trophy support later playstation 4 console released backward compatible either playstation 3 playstation 2 games although limited ps2 backward compatibility later introduced ps4 owners might play selected group ps3 games streaming internet using playstation cloud-based gaming service playstation 3 lv0 keys set cryptographic keys form core playstation 3 security system according news story polygon lv0 keys users able circumvent restrictions placed sony commonly known jailbreaking lv0 keys released online group calling three musketeers granting users access sensitive parts playstation 3 access areas users decrypt security updates work around authorized playstation firmware allows playstation 3 firmware updates modified computer run modified console three musketeers decided release code group rival hackers obtained code planned sell first time playstation 3 hacked according eurogamer release new custom firmware\u2014and lv0 decryption keys particular\u2014poses serious issues also says options sony battling leak limited since reveal lv0 key basically means system update released sony going forward decrypted little effort whatsoever initial release playstation 3 system software version 1.10 appeared november 11 2006 japan november 17 2006 north america provided playstation network services remote play 60 gb model however version 1.02 included games number updates 1.xx versions provided new features account management compatibility usb devices playstation 2 format games supports usb webcams bluetooth keyboards mice version 1.80 released may 24 2007 added number relatively small new features mostly related media videos ability upscale standard dvd-videos 1080p downscale blu-ray video 720p version 1.90 released may 24 2007 added wallpaper feature background xmb ability eject game disc using controller re-order game icons format creation date update also forced 24 hz output blu-ray hdmi introduced bookmarks security function web browser last version 1.xx series 1.94 released october 23 2007 added support dualshock 3 controllers version 1.xx series number versions 2.xx 3.xx series released november 8 2007 september 20 2011 quite noticeable changes version 2.10 alone new features additions voice changer feature power make users sound like person using voice changer five presets hi low tones new music bitmapping process specifically designed ps3 provide enhanced audio playback well supports divx wmv playback blu-ray disc profile 1.1 picture-in-picture version 2.50 released october 15 2008 update 2.xx series contained largest number new features changes among support official ps3 bluetooth headset in-game screenshots adobe flash 9 recovery menu safe mode also introduced version later versions 2.xx series 2.7x 2.85 2.90 distributed ps3 slim similar versions 2.00 versions 3.00 3.10 3.30 3.40 3.70 introduced relatively large number new features changes supports new dynamic custom themes improvements internet browser trophy enhancements new video editor uploader application noticeable change version 4.00 released november 30 2011 added support playstation vita handheld game consoles example ps vita system added option ps vita system application utility added feature game update playstation 3 also gained ability transfer videos images musics game data playstation vita version 4.10 released february 8 2012 also added improvements internet browser including support html5 display speed web page layout accuracy later versions 4.xx series made changes system mostly improve stability operation quality uses applications addition adding new features displaying closed captions playing bds dvds check update options menu game playstation 3 system software currently still updated sony system software version 2.40 included in-game xmb feature playstation 3 trophies released july 2 2008 however withdrawn later day small number users unable restart consoles performing update fault explained certain system administrative data contained hdd issue addressed version 2.41 system software released july 8 2008 system software version 3.0 released september 1 2009 shortly release number users complained system update caused system blu-ray drive malfunction addition john kennedy florida filed class action suit sony computer entertainment america john kennedy purchased playstation 3 january 2009 claiming worked perfectly installed required firmware update 3.0 point blu-ray drive system ceased functioning properly sony later released statement scea aware reports ps3 owners experiencing isolated issues ps3 system since installing recent system software update v3.00 released software update 3.01 september 15 2009 however installing 3.01 plaintiff alleged problems solved new update created new issues well due removal otheros feature older models ps3 due security issues possibly related exploit released geohot caused uproar playstation community several lawsuits filed first one filed behalf ps3 owners anthony ventura suit states removing feature constitutes breach contract false advertising handful business practices relating consumer protection laws feature touted sony systems new way consumers could turn machines basic pc cites feature extremely valuable one main reasons many people paid ps3 buying competing console like wii xbox 360 also elaborates anyone accept update longer play future games future blu-ray movie releases later two suits also filed members playstation 3 community first newer lawsuits filed todd densmore antal herz claim sony rendered several playstation 3 features paid inoperable result release firmware 3.21 second filed jason baker sean bosquett paul graham paul vannatta claims among things lost money purchasing ps3 without receiving benefit bargain product claimed game console would provide os feature gaming functions fourth lawsuit filed keith wright seeks compensation equal cost console fifth lawsuit filed jeffrey harper zachary kummer calls jury trial sixth lawsuit filed johnathon huber quotes eu us playstation blogs sony responded lawsuits requesting dismissal grounds one cared feature filings cite quotes 3rd party websites instruction manual playstation web site claims invalid proof sony disable psn advertised features playing games require newer firmware etc wish lawyers plaintiffs reviewed request said fairly common stage process case would reviewed judge november 2010 february 2011 claims false advertising case dismissed plaintiffs allowed appeal amend case claims removal violated computer fraud abuse act allowed go forward march 2011 plaintiffs amended complaint refute sony claims within rights tos warranty remove feature adding details claims including breach warranty breach implied warranty breach contract unjust enrichment breach several california unfair business practices laws april 2011 scea asked case dismissed made claims plaintiffs refiled claim insufficient hackers wanted violate sony intellectual property asked judge grant search rights ps3 systems scea also made claims division solely responsible removal held responsible despite conflicting information contrary april 18 2011 plaintiffs fired back sony renewed efforts case dismissed pointing fact sony made many claims dismissed court also pointed several legal precedents california law refuted sony claims december 2011 whole case dismissed grounds plaintiffs failed prove could expect os feature beyond warranty machine however decision overturned 2014 appellate court decision finding plaintiffs indeed made clear sufficiently substantial claims ultimately 2016 sony settled users installed linux purchased playstation 3 based upon alternative os functionality system software version 4.45 released june 18 2013 however withdrawn one day later small number users unable restart consoles performing update june 21 2013 morgan haro community manager playstation network announced issue identified new update planned released resolve issue system update addressed issue version 4.46 released june 27 2013 fix affected system version 4.45 also provided sony gaming platforms sony gaming platforms next generation gaming platforms generation official playstation 3 system software update page", + "neighbors": [ + 38, + 101, + 106, + 134, + 189, + 290, + 629, + 649, + 755, + 893, + 899, + 992, + 1138, + 1301, + 1318, + 1322, + 1397, + 1521 + ], + "mask": "Test" + }, + { + "node_id": 117, + "label": 9, + "text": "Tcl:tcl tcl pronounced tickle tee cee ell high-level general-purpose interpreted dynamic programming language designed goal simple powerful tcl casts everything mold command even programming constructs like variable assignment procedure definition tcl supports multiple programming paradigms including object-oriented imperative functional programming procedural styles commonly used embedded c applications rapid prototyping scripted applications guis testing tcl interpreters available many operating systems allowing tcl code run wide variety systems tcl compact language used embedded systems platforms full form several small-footprint versions popular combination tcl tk extension referred tcl/tk enables building graphical user interface gui natively tcl tcl/tk included standard python installation form tkinter tcl programming language created spring 1988 john ousterhout working university california berkeley originally born frustration according author programmers devising languages intended embedded applications tcl gained acceptance ousterhout awarded acm software system award 1997 tcl/tk name originally comes tool command language conventionally spelled tcl rather tcl tcl conferences workshops held united states europe tcl features include safe-tcl subset tcl restricted features tcl scripts harm hosting machine application file system access limited arbitrary system commands prevented execution uses dual interpreter model untrusted interpreter running code untrusted script designed nathaniel borenstein marshall rose include active messages e-mail safe-tcl included e-mail application/safe-tcl multipart/enabled-mail supported functionality safe-tcl since incorporated part standard tcl/tk releases syntax semantics tcl covered twelve rules known dodekalogue tcl script consists series command invocations command invocation list words separated whitespace terminated newline semicolon first word name command may built language found available library defined script subsequent words serve arguments command following example uses puts command display string text host console sends string hello world standard output device along appended newline character variables results commands substituted strings example uses set expr commands store result calculation variable note tcl use codice_3 assignment operator uses puts short put string print result together explanatory text codice_4 character introduces comment comments appear anywhere interpreter expecting command name seen examples one basic construct language command quoting mechanisms substitution rules determine arguments command processed one special substitution occurs parsing commands arguments final character line i.e. immediately newline backslash backslash-newline combination spaces tabs immediately following newline replaced single space provides line continuation mechanism whereby long lines source code wrapped next line convenience readers continuing normal argument processing word begins double-quote character codice_5 extends next double-quote character word thus contain whitespace semicolons without characters interpreted special meaning i.e. treated normal text characters word begins opening curly-brace character codice_6 extends next closing curly-brace character codice_7 inside curly braces forms substitution suppressed except previously mentioned backslash-newline elimination words enclosed either construct known bare words bare double-quoted words three types substitution may occur substitution proceeds left-to-right single scan word substituted text scanned possible substitutions however number substitutions appear single word tcl 8.5 onwards word may prefixed codice_12 causes word split apart constituent sub-words purposes building command invocation similar codice_13 sequence lisp quasiquote feature consequence rules result command may used argument command also operator command string concatenation language concatenates directly note unlike unix command shells tcl reparse string unless explicitly directed makes interactive use cumbersome scripted use predictable e.g. presence spaces filenames cause difficulties single equality sign codice_3 serves special role language double equality sign codice_15 test equality used expression contexts codice_16 command first argument codice_17 commands part standard library special place library replaced desired majority tcl commands especially standard library variadic codice_18 constructor scripted command procedures allows one define default values unspecified arguments catch-all argument allow code process arbitrary numbers arguments tcl statically typed variable may contain integers floats strings lists command names dictionaries value values reinterpreted subject syntactic constraints types demand however values immutable operations appear change actually return new value instead important commands refer program execution data operations usual execution control commands looping commands additionally controlled following commands codice_1 allows command script executed scope current innermost scope stack command script may call procedures use uplevel command net effect transforming call stack call tree originally implemented permit tcl procedures reimplement built-in commands like still ability manipulate local variables example following tcl script reimplementation command omitting exception handling codice_2 arranges one local variables current procedure refer variables enclosing procedure call global variables upvar command simplifies implementation call-by-name procedure calling also makes easier build new control constructs tcl procedures decr command works like built-in codice_54 command except subtracts value variable instead adding tcl 8.6 added built-in dynamic object system tcloo 2012 includes features tcl object oriented oo syntax 2012 various extension packages emerged enable object-oriented programming widespread existing tcl source code popular extensions include tcloo added build strong object oriented system also enable extension packages build object oriented abstractions using foundation release tcloo incr tcl updated use tcloo foundation tcl web server pure-tcl implementation http protocol server runs script top vanilla tcl interpreter apache rivet open source programming system apache http server allows developers use tcl scripting language creating dynamic web applications rivet similar php asp jsp rivet primarily developed damon courtney david welton massimo manghi harald oehlmann karl lehenbauer rivet use thousands publicly available tcl packages offer countless features database interaction oracle postgresql mysql sqlite etc interfaces popular applications gd graphics library tcl interfaces natively c language originally written framework providing syntactic front-end commands written c commands language including things might otherwise keywords codice_17 codice_25 implemented way command implementation function passed array values describe already substituted arguments command free interpret values sees fit digital logic simulators often include tcl scripting interface simulating verilog vhdl systemverilog hardware languages tools exist e.g swig ffidl automatically generate necessary code connect arbitrary c functions tcl runtime critcl reverse allowing embedding arbitrary c code inside tcl script compiling runtime dll tcl language always allowed extension packages provide additional functionality gui terminal-based application automation database access commonly used extensions include", + "neighbors": [ + 7, + 19, + 78, + 117, + 134, + 152, + 201, + 216, + 246, + 306, + 324, + 365, + 373, + 412, + 509, + 538, + 544, + 567, + 579, + 593, + 594, + 597, + 653, + 682, + 686, + 742, + 756, + 782, + 796, + 815, + 820, + 825, + 873, + 916, + 919, + 948, + 1028, + 1068, + 1120, + 1138, + 1146, + 1189, + 1190, + 1212, + 1221, + 1225, + 1227, + 1235, + 1242, + 1251, + 1269, + 1278, + 1298, + 1311, + 1318, + 1319, + 1324, + 1372, + 1413, + 1418, + 1437, + 1457, + 1477, + 1481, + 1502, + 1532, + 1536, + 1538, + 1558, + 1572, + 1588, + 1607, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 118, + "label": 3, + "text": "Laplace_no_Ma:laplace video game mixture role-playing video game survival horror genres set vicinity boston massachusetts town called newcam modeled fictional city arkham created h. p. lovecraft horror part game lies exploration fictional weathertop mansion whose owner dabbled black magic game crpg features include character classes\u2014dilettante medium detective scientist journalist\u2014and player leave mansion walk around town go shops buy items needed defeat monsters complete game release famicom ts\u016bshin scored super famicom version game 26 40", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 119, + "label": 3, + "text": "Processor_array:processor array processor array like storage array contains manages processing elements instead storage elements processor array following characteristics", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 120, + "label": 4, + "text": "McAfee:mcafee mcafee llc formerly known mcafee associates inc. 1987\u20132014 intel security group 2014\u20132017 american global computer security software company headquartered santa clara california claims world largest dedicated security technology company company purchased intel february 2011 became part intel security division september 7 2016 intel announced strategic deal tpg capital convert intel security joint venture companies called mcafee deal closed april 3 2017 thoma bravo took minority stake new company intel maintains 49 stake company founded 1987 mcafee associates named founder john mcafee resigned company 1994 mcafee incorporated state delaware 1992 network associates formed 1997 merger mcafee associates network general pgp corporation helix software company restructured 2004 beginning sale magic solutions business remedy subsidiary bmc software early year mid-2004 company sold sniffer technologies business venture capital backed firm named network general name original owner sniffer technologies changed name back mcafee reflect focus security-related technologies among companies bought sold mcafee trusted information systems developed firewall toolkit free software foundation commercial gauntlet firewall later sold secure computing corporation mcafee result brief ownership tis labs/nai labs/network associates laboratories/mcafee research highly influential world open-source software organization produced portions linux freebsd darwin operating systems developed portions bind name server software snmp version 3 mcafee acquired calgary alberta canada-based fsa corporation helped company diversify security offerings away client-based antivirus software bringing board network desktop encryption technologies fsa team also oversaw creation number technologies leading edge time including firewall file encryption public key infrastructure product lines product lines individual successes including powerbroker written dean huxley dan freedman sold beyondtrust growth antivirus ware always outpaced growth security product lines fair say mcafee remains best known anti-virus anti-spam products august 19 2010 intel announced would purchase mcafee 48 share deal valued 7.68 billion january 6 2014 intel ceo brian krzanich announced consumer electronics show name change mcafee security intel security company red shield logo would remain firm continuing operate wholly owned intel subsidiary john mcafee longer involvement company expressed pleasure name longer associated software everlastingly grateful intel freeing terrible association worst software planet words words millions irate users however 2016 products still bore mcafee name company spun back intel april 4 2017 mcafee primarily develops digital-security tools personal computers server devices recently mobile devices mcafee brands products sub-products include", + "neighbors": [ + 14, + 17, + 85, + 94, + 120, + 124, + 134, + 254, + 293, + 294, + 297, + 379, + 384, + 455, + 476, + 569, + 576, + 661, + 701, + 717, + 842, + 910, + 938, + 944, + 965, + 988, + 1038, + 1101, + 1239, + 1291, + 1327, + 1342, + 1350, + 1358, + 1368, + 1379, + 1406, + 1444, + 1514, + 1534, + 1542 + ], + "mask": "Test" + }, + { + "node_id": 121, + "label": 2, + "text": "Keychain_(software):keychain software keychain password management system macos developed apple introduced mac os 8.6 included subsequent versions mac os known macos keychain contain various types data passwords websites ftp servers ssh accounts network shares wireless networks groupware applications encrypted disk images private keys certificates secure notes macos keychain files stored ~/library/keychains/ subdirectories /library/keychains/ /network/library/keychains/ keychain access gui application located utilities folder applications folder free open source software released terms apsl command line equivalent keychain access /usr/bin/security keychain file stores variety data fields including title url notes password passwords secure notes encrypted triple des default keychain file login keychain typically unlocked login user login password although password keychain instead different user \u2019 login password adding security expense convenience keychain access application permit setting empty password keychain keychain may set automatically locked computer idle time locked manually keychain access application locked password re-entered next time keychain accessed unlock overwriting file ~/library/keychains/ new one e.g part restore operation also causes keychain lock password required next access login keychain protected login password keychain password changed whenever login password changed within logged session macos shared mac/non-mac network possible login keychain password lose synchronization user login password changed non-mac system also password changed directory service like active directory open directory password changed another admin account e.g using system preferences network administrators react deleting keychain file logout new one created next time user logs means keychain passwords remembered one session next even login password changed happens user restore keychain file ~/library/keychains/ backup lock keychain need unlocked next use keychain access macos application allows user access keychain configure contents including passwords websites web forms ftp servers ssh accounts network shares wireless networks groupware applications encrypted disk images etc unlocks locks displays passwords saved system dynamically linked user login password well managing root certificates keys secure notes graphical user interface displays various keychains usually least two login keychain system keychain also includes keychain first aid utility removed 10.11.2 update repair problems keychains various events cause problems keychains sometimes solution problem delete keychain also deletes passwords stored keychain create new one usually found utilities folder applications macos ancillary application macos subject updates via software update thus moved utilities folder also included command-line tool access keychain called security keychains initially developed apple e-mail system powertalk early 1990s among many features powertalk used plug-ins allowed mail retrieved wide variety mail servers online services keychain concept naturally fell code used powertalk manage user various login credentials various e-mail systems powertalk could connect passwords easily retrievable due encryption yet simplicity interface allowed user select different password every system without fear forgetting single password would open file return time implementations concept available platforms keychain one parts powertalk obviously useful suggested promoted become part basic mac os due internal politics kept inside powertalk system therefore available mac users return steve jobs 1997 keychain concept revived now-discontinued powertalk point time concept longer unusual still rare see keychain system associated particular piece application software typically web browser keychain later made standard part mac os 9 included mac os x first commercial versions keychain distributed ios osx ios version simpler applications run mobile devices typically need basic keychain features example features acls access control lists sharing keychain items different apps present thus ios keychain items accessible app created", + "neighbors": [ + 33, + 99, + 345, + 395, + 477, + 524, + 528, + 551, + 596, + 625, + 696, + 797, + 917, + 927, + 945, + 1001, + 1100, + 1138, + 1157, + 1189, + 1240, + 1292, + 1322, + 1334, + 1339, + 1373, + 1409, + 1496 + ], + "mask": "Test" + }, + { + "node_id": 122, + "label": 3, + "text": "Intel_8279:intel 8279 intel 8279 keyboard/display controller specially developed interfacing keyboard display devices intel 8085 8086 8088 microprocessors important features keyboard section display section scan section cpu interface section interfacing 8279 8085 microprocessor based system keyboard 7-segment led display interfaced using ports latches processor carry following task operating modes 8279 1 input modes basic input modes 1 scanned keyboard 2 scanned sensor matrix 3 strobed input 2 display modes two basic output modes 1 left entry typewriter type 2 right entry calculator type full datasheet link http //www.futurlec.com/datasheet/80series/8279.pdf", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 123, + "label": 3, + "text": "Multithreading_(computer_architecture):multithreading computer architecture computer architecture multithreading ability central processing unit cpu single core multi-core processor provide multiple threads execution concurrently supported operating system approach differs multiprocessing multithreaded application threads share resources single multiple cores include computing units cpu caches translation lookaside buffer tlb multiprocessing systems include multiple complete processing units one cores multithreading aims increase utilization single core using thread-level parallelism well instruction-level parallelism two techniques complementary sometimes combined systems multiple multithreading cpus cpus multiple multithreading cores multithreading paradigm become popular efforts exploit instruction-level parallelism stalled since late 1990s allowed concept throughput computing re-emerge specialized field transaction processing even though difficult speed single thread single program computer systems actually multitasking among multiple threads programs thus techniques improve throughput tasks result overall performance gains two major techniques throughput computing multithreading multiprocessing thread gets lot cache misses threads continue taking advantage unused computing resources may lead faster overall execution resources would idle single thread executed also thread use computing resources cpu instructions depend result running another thread may prevent resources becoming idle multiple threads interfere sharing hardware resources caches translation lookaside buffers tlbs result execution times single thread improved degraded even one thread executing due lower frequencies additional pipeline stages necessary accommodate thread-switching hardware overall efficiency varies intel claims 30 improvement hyper-threading technology synthetic program performing loop non-optimized dependent floating-point operations actually gains 100 speed improvement run parallel hand hand-tuned assembly language programs using mmx altivec extensions performing data prefetches good video encoder might suffer cache misses idle computing resources programs therefore benefit hardware multithreading indeed see degraded performance due contention shared resources software standpoint hardware support multithreading visible software requiring changes application programs operating systems multiprocessing hardware techniques used support multithreading often parallel software techniques used computer multitasking thread scheduling also major problem multithreading simplest type multithreading occurs one thread runs blocked event normally would create long-latency stall stall might cache miss access off-chip memory might take hundreds cpu cycles data return instead waiting stall resolve threaded processor would switch execution another thread ready run data previous thread arrived would previous thread placed back list ready-to-run threads example conceptually similar cooperative multi-tasking used real-time operating systems tasks voluntarily give execution time need wait upon type event type multithreading known block cooperative coarse-grained multithreading goal multithreading hardware support allow quick switching blocked thread another thread ready run achieve goal hardware cost replicate program visible registers well processor control registers program counter switching one thread another thread means hardware switches using one register set another switch efficiently active threads active thread needs register set example quickly switch two threads register hardware needs instantiated twice additional hardware support multithreading allows thread switching done one cpu cycle bringing performance improvements also additional hardware allows thread behave executing alone sharing hardware resources threads minimizing amount software changes needed within application operating system support multithreading many families microcontrollers embedded processors multiple register banks allow quick context switching interrupts schemes considered type block multithreading among user program thread interrupt threads purpose interleaved multithreading remove data dependency stalls execution pipeline since one thread relatively independent threads less chance one instruction one pipelining stage needing output older instruction pipeline conceptually similar preemptive multitasking used operating systems analogy would time slice given active thread one cpu cycle example type multithreading first called barrel processing staves barrel represent pipeline stages executing threads interleaved preemptive fine-grained time-sliced multithreading modern terminology addition hardware costs discussed block type multithreading interleaved multithreading additional cost pipeline stage tracking thread id instruction processing also since threads executed concurrently pipeline shared resources caches tlbs need larger avoid thrashing different threads advanced type multithreading applies superscalar processors whereas normal superscalar processor issues multiple instructions single thread every cpu cycle simultaneous multithreading smt superscalar processor issue instructions multiple threads every cpu cycle recognizing single thread limited amount instruction-level parallelism type multithreading tries exploit parallelism available across multiple threads decrease waste associated unused issue slots example distinguish types multithreading smt term temporal multithreading used denote instructions one thread issued time addition hardware costs discussed interleaved multithreading smt additional cost pipeline stage tracking thread id instruction processed shared resources caches tlbs sized large number active threads processed implementations include dec later compaq ev8 completed intel hyper-threading technology ibm power5 sun microsystems ultrasparc t2 cray xmt amd bulldozer zen microarchitectures major area research thread scheduler must quickly choose among list ready-to-run threads execute next well maintain ready-to-run stalled thread lists important subtopic different thread priority schemes used scheduler thread scheduler might implemented totally software totally hardware hardware/software combination another area research type events cause thread switch cache misses inter-thread communication dma completion etc multithreading scheme replicates software-visible state including privileged control registers tlbs enables virtual machines created thread allows thread run operating system processor hand user-mode state saved less hardware required would allow threads active one time die area cost", + "neighbors": [ + 14, + 51, + 61, + 76, + 78, + 85, + 86, + 105, + 127, + 149, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 280, + 282, + 300, + 314, + 331, + 335, + 340, + 346, + 352, + 362, + 375, + 379, + 388, + 412, + 429, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 611, + 643, + 659, + 719, + 723, + 737, + 739, + 751, + 752, + 776, + 789, + 797, + 803, + 804, + 821, + 834, + 846, + 847, + 876, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1096, + 1099, + 1111, + 1113, + 1125, + 1138, + 1158, + 1159, + 1160, + 1174, + 1219, + 1220, + 1222, + 1256, + 1263, + 1272, + 1284, + 1290, + 1324, + 1368, + 1372, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1549, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 124, + "label": 8, + "text": "Alexa_Internet:alexa internet alexa internet inc. american web traffic analysis company based san francisco wholly owned subsidiary amazon alexa founded independent company 1996 acquired amazon 1999 250m stock toolbar collects data internet browsing behavior transmits alexa website stored analyzed basis company web traffic reporting including alexa rank according website alexa provides web traffic data global rankings information 30 million websites 2018 website visited 3 million people every month alexa internet founded april 1996 brewster kahle bruce gilliat company name chosen homage library alexandria ptolemaic egypt drawing parallel largest repository knowledge ancient world potential internet become similar store knowledge alexa initially offered toolbar gave internet users suggestions go next based traffic patterns user community company also offered context site visited registered many pages many sites pointed frequently updated alexa operations grew include archiving web pages crawled examined automated computer program nicknamed bot web crawler database served basis creation internet archive accessible wayback machine 1998 company donated copy archive two terabytes size library congress alexa continues supply internet archive web crawls 1999 company moved away original vision providing intelligent search engine alexa acquired amazon.com approximately us 250 million amazon stock alexa began partnership google early 2002 web directory dmoz january 2003 december 2005 alexa opened extensive search index web-crawling facilities third-party programs comprehensive set web services apis could used instance construct vertical search engines could run alexa servers elsewhere may 2006 google replaced windows live search provider search results december 2006 amazon released alexa image search built in-house first major application built company web platform may 2007 alexa changed api limit comparisons three websites reduce size embedded graphs flash add mandatory embedded britepic advertisements april 2007 company filed lawsuit alexa v. hornbaker stop trademark infringement statsaholic service lawsuit alexa alleged ron hornbaker stealing traffic graphs profit primary purpose site display graphs generated alexa servers hornbaker removed term alexa service name march 19 2007 november 27 2008 amazon announced alexa web search longer accepting new customers service would deprecated discontinued existing customers january 26 2009 thereafter alexa became purely analytics-focused company march 31 2009 alexa revealed major website redesign redesigned site provided new web traffic metrics\u2014including average page views per individual user bounce rate rate users come leave webpage user time website following weeks alexa added features including visitor demographics clickstream web search traffic statistics alexa introduced new features compete web analytics services key metric published alexa internet analytics alexa traffic rank also simply known alexa rank also referred global rank alexa internet designed estimate website popularity alexa internet tooltip global rank says rank calculated combination daily visitors page views website 3-month period alexa traffic rank used monitor popularity trend website compare popularity different websites alexa ranks sites based primarily tracking sample set internet traffic\u2014users toolbar internet explorer firefox google chrome web browsers alexa toolbar includes popup blocker stops unwanted ads search box links amazon.com alexa homepage alexa ranking website user visiting also allows user rate website view links external relevant websites early 2005 alexa stated 10 million downloads toolbar though company provide statistics active usage originally web pages ranked amongst users alexa toolbar installed could biased specific audience subgroup reluctant take part rankings caused controversies representative alexa user base typical internet behavior especially less-visited sites 2007 michael arrington provided examples alexa rankings known contradict data comscore web analytics service including ranking youtube ahead google 2007 third-party-supplied plugin firefox browser served option firefox users amazon abandoned a9 toolbar july 16 2007 alexa released official toolbar firefox called sparky 16 april 2008 many users reported drastic shifts alexa rankings alexa confirmed later day announcement released updated ranking system claiming would take account sources data beyond alexa toolbar users using alexa pro service website owners sign certified statistics allows alexa access website traffic data site owners input javascript code page website permitted user security privacy settings runs sends traffic data alexa allowing alexa display\u2014or display depending owner preference\u2014more accurate statistics total pageviews unique pageviews number antivirus companies assessed alexa toolbar toolbar internet explorer 7 one point flagged malware microsoft defender symantec classified toolbar trackware 2007 mcafee classified adware deeming potentially unwanted program 2005 mcafee site advisor rated alexa site green 2007 finding significant problems warned small fraction downloads ... people consider adware potentially unwanted programs 2014 though possible delete paid subscription within alexa account possible delete account created alexa web interface", + "neighbors": [ + 12, + 96, + 120, + 124, + 157, + 297, + 384, + 509, + 585, + 777, + 780, + 933, + 968, + 1019, + 1246, + 1266, + 1416, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 125, + "label": 9, + "text": "Parlog:parlog parlog logic programming language designed efficient utilization parallel computer architectures semantics based first order predicate logic expresses concurrency interprocess communication indeterminacy synchronization within declarative language framework designed imperial college london steve gregory keith l. clark descendant ic prolog relational language", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 126, + "label": 3, + "text": "Koronis_Rift:koronis rift koronis rift 1985 computer game lucasfilm games produced designed noah falstein originally developed atari 8-bit family commodore 64 koronis rift ported amstrad cpc apple ii msx tandy color computer 3 zx spectrum atari c64 version shipped flippy disk one version game side cassette version also released commodore 64 atari version required computers gtia chip installed order display properly koronis rift one two games lucasfilm games second wave december 1985 eidolon enhanced fractal technology developed rescue fractalus koronis rift atari 8-bit family additional colors commodore 64 allowed programmers gradually fade background rather suddenly popping rescue early example depth cueing computer game player controls surface rover vehicle enter several rifts alien planet effectively fractal mazes lost civilisation known ancients left strange machinery so-called hulks within rifts guarded armed flying saucers different design color depending respective color shields gunshots rover saucers varying effectiveness part game figuring shield weapon modules work best means drone robot rover retrieve modules various functions immediately obvious nearby hulks deployed attacking guardian saucers destroyed modules installed rover analyzed aboard player space ship sold rover carry six different modules time activated de-activated player sees fit large variety modules available different weapon shield modules varying power levels color codes modules increase rover power output mapper activating extra screen rover even one module turns retrieval probe bomb destroying hulks probe sent investigate instead retrieving modules conversely different types hulks exist including one simply swallows probe without yielding module requiring player purchase new probe possibly sell useful modules raise required funds goal game find destroy saucer control base hulk located 20th rift end player must explore rifts find hulks retrieve analyze modules understand color-coding weapons shields overcome increasingly aggressive dangerous saucers game solved several ways quickest acquire bomb module send probe saucer base bomb module activated info rated koronis rift four stars five stating best epyx four lucasfilm games computer gaming world stated kr game also puzzle ... arcade skill alone n't enough reviewer enjoy game difficult spent much time savescumming praised graphics sound zzap 64 thought game improvement predecessor rescue fractalus superior graphics gameplay given overall rating 96", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 127, + "label": 3, + "text": "DEC_Prism:dec prism prism parallel reduced instruction set machine 32-bit risc instruction set architecture isa developed digital equipment corporation dec final outcome number dec research projects 1982\u201385 time-frame point delivering silicon 1988 management canceled project next year work alpha started based heavily prism design period 1982 1985 fewer four attempts made create risc chip different dec divisions titan dec western research laboratory wrl palo alto california high-performance ecl based design started 1982 intended run unix safe streamlined architecture fast execution 64-bit design started year designed alan kotok spacewar fame dave orbits intended run vms hr-32 hudson risc 32-bit started 1984 rich witek dan dobberpuhl hudson fab intended used co-processor vax machine year dave cutler started cascade project decwest bellevue washington eventually cutler asked define single risc project 1985 selecting rich witek chief architect design started 64-bit chip later downsized 32-bits august 1985 first draft high-level design delivered work began detailed design prism specification developed period many months five-person team dave cutler dave orbits rich witek dileep bhandarkar wayne cardoza work 98 done 1985\u201386 heavily supported simulations pete benoit large vaxcluster terms integer operations prism architecture similar mips designs 32-bits instructions 6 highest 5 lowest bits instruction leaving 21 bits word encoding either constant register locations sixty-four 32-bit registers included opposed thirty-two mips usage otherwise similar prism mips lack register windows hallmark major risc design berkeley risc/sparc prism design notable several aspects instruction set notably prism included epicode extended processor instruction code defined number special instructions intended offer operating system stable abi across multiple implementations epicode given set 22 32-bit registers use set vector processing instructions later added well supported additional sixteen 64-bit vector registers could used variety ways two versions system planned decwest worked high-end ecl implementation known crystal semiconductor advanced development team worked microprism cmos version microprism finished first sent test fabrication april 1988 additionally cutler led development new microkernel-based operating system code-named mica offer unix-like vms-like personalities top common substrate services throughout prism period dec involved major debate future direction company newer workstations introduced performance benefit vax constantly eroded price/performance ratio completely undermined different groups within company debated best respond advocated moving vax high-end abandoning low-end workstations others suggested moving workstation market using commodity processor still others suggested re-implementing vax risc processor led considerable problems turf wars various groups competition divisions delayed architecture review n't closed 1986 work associated support chips memory management unit floating point unit later interrupted yet another debate whether design 32- 64-bit microprism design finalized april 1988 frustrated growing number losses cheaper faster competitive machines independently small group outside central engineering focused workstations unix/ultrix entertained idea using off-the-shelf risc processor build new family workstations group carried due diligence eventually choosing mips r2000 group acquired development machine prototyped port ultrix system initial meetings mips prototype machine took 90 days full production able start january 1989 resulting decstation 3100 family meeting reviewing various projects july 1988 company decided cancel prism continue mips workstations high-end vax products dave cutler left company soon every attempt produce faster vax could compete newer workstations eventually failed vax 9000 ran delays time shipped newer unix workstations already surpassed performance tiny fraction cost size apparently aware danger meeting prism canceled ken olsen started new project continue exploring risc-based vax indirectly led formation alpha project next year", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 108, + 123, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 803, + 821, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1011, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1143, + 1174, + 1219, + 1256, + 1272, + 1284, + 1287, + 1290, + 1398, + 1494, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 128, + "label": 8, + "text": "Web_Services_Test_Forum:web services test forum web services test forum wstf provides framework members web service community develop interoperability scenarios test implementations scenarios implementations wstf charge dues central governing authority i.e board wstf patterned initial creators bea systems fujitsu ibm oracle soapbuilders mailing list/community main focus test various web service specifications also serves forum entire web service community share ideas concerns open fashion wstf founded following basic principles unlike interoperability organizations work wstf center around individual specifications activities organized around concept test scenario scenarios made three parts scenario defined members wstf may implement using products open source projects deploy implementations onto publicly available systems test interoperability crosswise fashion problems issues discussed wstf mailing lists scenario may need clarified re-factored process implementation reaches certain level maturity implementers choose scenario implementations made visible outside wstf publishing whether published endpoints provide scenario implementations expected maintained indefinitely allows members wstf perform regression testing test new implementations verify behavior etc without requiring active participation implementer wstf chose keep work private couple reasons first entirely public forum members may feel free bring sensitive topics signing participation agreement members agree keep discussions private group thus allowing much open honest discussion second members wstf wanted wstf published scenario mean broad community support without formal publish step process would hard distinguish scenarios community support versus ones implemented one company scenario published 5 different implementations least two third implementor choose make public members wstf put implementations/endpoints scenario eligible vote restriction done ensure skin game allowed influence information process see wstf charter functional non-functional web service testing done help wsdl parsing regression testing performed identifying changes made thereafter web service regression testing needs categories three different ways namely changes wsdl changes code selective re-testing web service operations capture three changes three intermediate forms wsdl namely difference wsdl dwsdl unit wsdl uwsdl reduced wsdl rwsdl respectively used intermediate forms wsdls combined form combined wsdl cwsdl used regression testing web service help automatic web service change management awscm performing selection relevant test cases construct reduced test suite old test suite wstf produces following artifacts", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 129, + "label": 3, + "text": "Pcmicro:pcmicro pcmicro large bulletin board system bbs support site 1981 1998 world wide web became popular pcmicro bbs served central file repository non-commercial bbs software related utilities bbs fidonet member 1991-1997 support distribution site several shareware freeware bbs packages including remoteaccess proboard elebbs pcmicro later released telnet communications driver named netfoss allows dos-based bbs software used telnet bbs longer service today entire collection freeware shareware bbs software utilities found bbs archives http //archives.thebbs.org containing thousands third party add-ons bbs packages", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 130, + "label": 2, + "text": "IPad_Mini_(1st_generation):ipad mini 1st generation first-generation ipad mini stylized marketed ipad mini mini tablet computer designed developed marketed apple inc announced october 23 2012 fourth major product ipad line first ipad mini line features reduced screen size contrast standard features similar internal specifications ipad 2 including display resolution first generation ipad mini received positive reviews reviewers praising device size design availability applications criticizing use proprietary power connector lack expandable storage lack retina display october 16 2012 apple announced media event scheduled october 23 california theatre san jose california company predisclose subject event widely expected ipad mini day event apple ceo tim cook introduced new version macbook family new generations macbook pro mac mini imac ipad mini higher end fourth-generation ipad released november 2 2012 nearly apple markets 32 gb 64 gb models discontinued release successor ipad mini 2 october 22 2013 almost 3 years june 19 2015 remaining 16 gb model discontinued well well discontinued stores ipad mini longer receives software updates supported apple ipad mini shipped ios 6.0 act hotspot carriers sharing internet connection wi-fi bluetooth usb also access app store digital application distribution platform ios developed maintained apple service allows users browse download applications itunes store developed xcode ios sdk published apple app store garageband imovie iphoto iwork apps pages keynote numbers available latest version currently ios 9.3.6 ipad mini comes several pre-installed applications including siri safari mail photos video music itunes app store maps notes calendar game center photo booth contacts like ios devices ipad sync content data mac pc using itunes although ios 5 later managed backed icloud although tablet designed make telephone calls cellular network users use headset built-in speaker microphone place phone calls wi-fi cellular using voip application skype device dictation using voice recognition technology iphone 4s user speaks ipad types say screen provided ipad connected wi-fi cellular network device optional ibooks application displays books epub-format content downloaded ibookstore several major book publishers including penguin books harpercollins simon schuster macmillan committed publishing books device despite direct competitor amazon kindle barnes noble nook amazon.com barnes noble offer e-reader apps ipad september 17 2014 ios 8 released first generation ipad mini apple devices however newer features software supported due relatively aged hardware shared ipad 2 september 16 2015 ipad mini received ios 9 update n't new multitasking features featured ipads june 13 2016 apple announced ios 10 update major updates mobile operating system however ipad mini receive update along devices using a5 processor including iphone 4s ipad 2 ipad 3rd generation ipod touch 5th generation due hardware limitations apple stopping latest ios updates ipad mini expected many industry however led criticism device sale june 2015 june 2016 versions operating system beyond ios 9 made available tablet four buttons one switch ipad mini including home button near display returns user home screen three aluminum buttons right side top wake/sleep volume volume plus software-controlled switch whose function varies software updates tablet manufactured either without capability communicate cellular network models connect wireless lan via wi-fi ipad mini available 16 32 64 gb internal flash memory expansion option apple sells camera connection kit sd card reader used transfer photos videos ipad mini features partially hardware ipad 2 screens resolutions 1024 x 768 ipad mini smaller screen thus higher pixel density ipad 2 163 ppi vs 132 ppi unlike ipad 2 5 mp 1.2 mp cameras lightning connector system-on-chip a5 one found later revision ipad 2 32 nm audio processor found iphone 5 ipad 4th generation allows ipad mini siri voice dictation unlike ipad 2 graphics processor gpu ipad mini one found ipad 2 powervr sgx543mp2 ipad mini initially featured slate silver colors however release mini 2 slate color changed space gray silver color remained smart cover introduced ipad 2 screen protector magnetically attaches face ipad smaller version available ipad mini 1 later models including ipad mini 4 also use smart cover cover three folds allow convert stand held together magnets smart covers microfiber bottom cleans front ipad wakes unit cover removed comes six colors polyurethane apple offers accessories including bluetooth keyboard several types earbuds headphones many adapters lightning connector applecare free engraving also available ipad mini reviews first generation ipad mini positive reviewers praising device size design availability applications criticizing use proprietary power connector lack expandable storage retina display device competes tablets amazon kindle fire hd google nexus 7 barnes noble nook hd joshua topolsky verge praised industrial design ipad mini however panned lack retina display price", + "neighbors": [ + 33, + 71, + 75, + 99, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1503, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 131, + "label": 2, + "text": "Android_Marshmallow:android marshmallow android marshmallow codenamed android development sixth major version android operating system 13th version android first released beta build may 28 2015 officially released october 5 2015 nexus devices first receive update marshmallow primarily focuses improving overall user experience predecessor lollipop introduced new permissions architecture new apis contextual assistants first used new feature tap provide context-sensitive search results new power management system reduces background activity device physically handled native support fingerprint recognition usb-c connectors ability migrate data applications microsd card internal changes 16.9 devices accessing google play run android 6.0 single popular point release android android nougat oreo major releases 7.x 8.x larger install bases release internally codenamed macadamia nut cookie first developer preview build codenamed android unveiled released google i/o may 28 2015 nexus 5 nexus 6 smartphones nexus 9 tablet nexus player set-top box second developer preview released july 9 2015 third final preview released august 17 2015 along announcing android would titled android marshmallow september 29 2015 google unveiled launch devices marshmallow lg-produced nexus 5x huawei-produced nexus 6p alongside google pixel c tablet android 6.0 updates factory images nexus 5 6 7 2013 9 player released october 5 2015 older nexus devices including nexus 4 nexus 7 2012 nexus 10 receive official update october 14 2015 lg announced planned release marshmallow flagship lg g4 smartphone poland following week marking first third-party device receive update marshmallow android 6.0.1 software patch featuring security fixes support unicode 8.0 emoji although without supporting skin tone extensions human emoji return next alarm feature disturb mode released december 7 2015 new assist api allows information currently opened app including text screenshot current screen sent designated assistant application analysis processing system used google search app feature google tap allows users perform searches within context information currently displayed on-screen home button used android 5 show available apps home button used together voice command generate on-screen cards display information suggestions actions related content direct share allows share menus display recently used combinations contacts associated app direct targets adoptable storage allows newly inserted sd card secondary storage media designated either portable internal storage portable maintains default behavior previous android versions treating media secondary storage device storage user files storage media removed replaced without repercussions subject access restrictions apps designated internal storage storage media reformatted encrypted ext4 file system adopted operating system primary storage partition existing data including applications private data folders migrated external storage normal operation device becomes dependent presence media apps operating system functions function properly adopted storage device removed user loses access storage media adopted storage forgotten makes data permanently inaccessible samsung lg however removed ability use sd card internal storage galaxy s7 g5 devices samsung arguing feature could result unexpected losses data prevents users able transfer data using card android marshmallow introduces redesigned application permissions model apps longer automatically granted specified permissions installation time opt-in system used users prompted grant deny individual permissions ability access camera microphone application needed first time applications remember grants revoked user time new permissions model used applications developed marshmallow using software development kit sdk older apps continue use previous all-or-nothing approach permissions still revoked apps though might prevent working properly warning displayed effect marshmallow introduces new power management schemes known doze app standby running battery power device enter low-power state inactive physically handled state network connectivity background processing restricted high-priority notifications processed additionally network access apps deferred user recently interacted app apps may request permission exempt policies rejected google play store violation dangerous products policy core functionality adversely affected android marshmallow provides native support fingerprint recognition supported devices via standard api allowing third-party applications implement fingerprint-based authentication fingerprints used unlocking devices authenticating play store google pay purchases android marshmallow supports usb-c including ability instruct devices charge another device usb marshmallow also introduces verified links configured open directly specified application without user prompts user data apps targeting marshmallow automatically backed google drive wi-fi application receives 25 mb storage separate user google drive storage allotment marshmallow android compatibility definition document contains new security mandates devices dictating capable accessing encrypted data without affecting performance must enable secure boot device encryption default conditions comprise part specification must met order certified operating system able license google mobile services software requirement mandatory device encryption originally intended take effect lollipop delayed due performance issues", + "neighbors": [ + 24, + 34, + 41, + 113, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 132, + "label": 9, + "text": "Index_of_JavaScript-related_articles:index javascript-related articles list articles related javascript programming language", + "neighbors": [ + 36, + 50, + 69, + 81, + 176, + 509, + 593, + 686, + 742, + 869, + 959, + 1264, + 1265, + 1302, + 1566 + ], + "mask": "Validation" + }, + { + "node_id": 133, + "label": 1, + "text": "Act_on_Health_Sector_Database:act health sector database act health sector database also known act health sector database 139/1998 health sector database act media colloquial names 1998 act icelandic parliament allowed icelandic government grant license private company creation national biological database store health information could used research act noted boldly introducing policy related biobanks subject controversy decode genetics lobbying act beneficiary license create database passing act spurred international discussion policies already place differences policy existed among biobanks establishment national database icelandic citizens raised discussion nature informed consent process project", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 134, + "label": 2, + "text": "Linux:linux linux family open source unix-like operating systems based linux kernel operating system kernel first released september 17 1991 linus torvalds linux typically packaged linux distribution distributions include linux kernel supporting system software libraries many provided gnu project many linux distributions use word linux name free software foundation uses name gnu/linux emphasize importance gnu software causing controversy popular linux distributions include debian fedora ubuntu commercial distributions include red hat enterprise linux suse linux enterprise server desktop linux distributions include windowing system x11 wayland desktop environment gnome kde plasma 5 distributions intended servers may omit graphics altogether include solution stack lamp linux freely redistributable anyone may create distribution purpose linux originally developed personal computers based intel x86 architecture since ported platforms operating system linux leading operating system servers big iron systems mainframe computers os used top500 supercomputers since november 2017 gradually eliminated competitors used around 2.3 percent desktop computers chromebook runs linux kernel-based chrome os dominates us k\u201312 education market represents nearly 20 percent sub- 300 notebook sales us linux also runs embedded systems i.e devices whose operating system typically built firmware highly tailored system includes routers automation controls televisions digital video recorders video game consoles smartwatches many smartphones tablet computers run android linux derivatives dominance android smartphones linux largest installed base general-purpose operating systems linux one prominent examples free open-source software collaboration source code may used modified distributed\u2014commercially non-commercially\u2014by anyone terms respective licenses gnu general public license unix operating system conceived implemented 1969 bell laboratories united states ken thompson dennis ritchie douglas mcilroy joe ossanna first released 1971 unix written entirely assembly language common practice time later key pioneering approach 1973 rewritten c programming language dennis ritchie exception hardware i/o routines availability high-level language implementation unix made porting different computer platforms easier due earlier antitrust case forbidding entering computer business required license operating system source code anyone asked result unix grew quickly became widely adopted academic institutions businesses 1984 divested bell labs freed legal obligation requiring free licensing bell labs began selling unix proprietary product users legally allowed modify unix gnu project started 1983 richard stallman goal creating complete unix-compatible software system composed entirely free software work began 1984 later 1985 stallman started free software foundation wrote gnu general public license gnu gpl 1989 early 1990s many programs required operating system libraries compilers text editors unix shell windowing system completed although low-level elements device drivers daemons kernel called gnu/hurd stalled incomplete linus torvalds stated gnu kernel available time 1991 would decided write although released 1992 due legal complications development 386bsd netbsd openbsd freebsd descended predated linux torvalds also stated 386bsd available time probably would created linux minix created andrew s. tanenbaum computer science professor released 1987 minimal unix-like operating system targeted students others wanted learn operating system principles although complete source code minix freely available licensing terms prevented free software licensing changed april 2000 1991 attending university helsinki torvalds became curious operating systems frustrated licensing minix time limited educational use began work operating system kernel eventually became linux kernel torvalds began development linux kernel minix applications written minix also used linux later linux matured linux kernel development took place linux systems gnu applications also replaced minix components advantageous use freely available code gnu project fledgling operating system code licensed gnu gpl reused computer programs long also released compatible license torvalds initiated switch original license prohibited commercial redistribution gnu gpl developers worked integrate gnu components linux kernel making fully functional free operating system linus torvalds wanted call invention freax portmanteau free freak x allusion unix start work system project makefiles included name freax half year torvalds already considered name linux initially dismissed egotistical order facilitate development files uploaded ftp server codice_1 funet september 1991 ari lemmke torvalds coworker helsinki university technology hut one volunteer administrators ftp server time think freax good name named project linux server without consulting torvalds later however torvalds consented linux demonstrate word linux pronounced torvalds included audio guide kernel source code another variant pronunciation adoption linux production environments rather used hobbyists started take first mid-1990s supercomputing community organizations nasa started replace increasingly expensive machines clusters inexpensive commodity computers running linux commercial use began dell ibm followed hewlett-packard started offering linux support escape microsoft monopoly desktop operating system market today linux systems used throughout computing embedded systems virtually supercomputers secured place server installations popular lamp application stack use linux distributions home enterprise desktops growing linux distributions also become popular netbook market many devices shipping customized linux distributions installed google releasing chrome os designed netbooks linux greatest success consumer market perhaps mobile device market android one dominant operating systems smartphones popular tablets recently wearables linux gaming also rise valve showing support linux rolling gaming oriented linux distribution linux distributions also gained popularity various local national governments federal government brazil greg kroah-hartman lead maintainer linux kernel guides development stallman heads free software foundation turn supports gnu components finally individuals corporations develop third-party non-gnu components third-party components comprise vast body work may include kernel modules user applications libraries linux vendors communities combine distribute kernel gnu components non-gnu components additional package management software form linux distributions linux-based system modular unix-like operating system deriving much basic design principles established unix 1970s 1980s system uses monolithic kernel linux kernel handles process control networking access peripherals file systems device drivers either integrated directly kernel added modules loaded system running gnu userland key part systems based linux kernel android notable exception project implementation c library functions wrapper system calls linux kernel necessary kernel-userspace interface toolchain broad collection programming tools vital linux development including compilers used build linux kernel coreutils implement many basic unix tools project also develops popular cli shell graphical user interface gui used linux systems built top implementation x window system recently linux community seeks advance wayland new display server protocol place x11 many open-source software projects contribute linux systems installed components linux system include following user interface also known shell either command-line interface cli graphical user interface gui controls attached associated hardware common embedded systems desktop systems default user interface usually graphical although cli commonly available terminal emulator windows separate virtual console cli shells text-based user interfaces use text input output dominant shell used linux bourne-again shell bash originally developed gnu project low-level linux components including various parts userland use cli exclusively cli particularly suited automation repetitive delayed tasks provides simple inter-process communication desktop systems popular user interfaces gui shells packaged together extensive desktop environments kde plasma gnome mate cinnamon unity lxde pantheon xfce though variety additional user interfaces exist popular user interfaces based x window system often simply called x provides network transparency permits graphical application running one system displayed another user may interact application however certain extensions x window system capable working network several x display servers exist reference implementation x.org server popular several types window managers exist x11 including tiling dynamic stacking compositing window managers provide means control placement appearance individual application windows interact x window system simpler x window managers dwm ratpoison i3wm herbstluftwm provide minimalist functionality elaborate window managers fvwm enlightenment window maker provide features built-in taskbar themes still lightweight compared desktop environments desktop environments include window managers part standard installations mutter gnome kwin kde xfwm xfce although users may choose use different window manager preferred wayland display server protocol intended replacement x11 protocol received wider adoption unlike x11 wayland need external window manager compositing manager therefore wayland compositor takes role display server window manager compositing manager weston reference implementation wayland gnome mutter kde kwin ported wayland standalone display servers enlightenment already successfully ported since version 19 linux currently two modern kernel-userspace apis handling video input devices v4l2 api video streams radio dvb api digital tv reception due complexity diversity different devices due large amount formats standards handled apis infrastructure needs evolve better fit devices also good userspace device library key success userspace applications able work formats supported devices primary difference linux many popular contemporary operating systems linux kernel components free open-source software linux operating system although far widely used free open-source software licenses based principle copyleft kind reciprocity work derived copyleft piece software must also copyleft common free software license gnu general public license gpl form copyleft used linux kernel many components gnu project linux-based distributions intended developers interoperability operating systems established computing standards linux systems adhere posix sus lsb iso ansi standards possible although date one linux distribution posix.1 certified linux-ft. free software projects although developed collaboration often produced independently fact software licenses explicitly permit redistribution however provides basis larger scale projects collect software produced stand-alone projects make available form linux distribution many linux distributions manage remote collection system software application software packages available download installation network connection allows users adapt operating system specific needs distributions maintained individuals loose-knit teams volunteer organizations commercial entities distribution responsible default configuration installed linux kernel general system security generally integration different software packages coherent whole distributions typically use package manager apt yum zypper pacman portage install remove update system software one central location distribution largely driven developer user communities vendors develop fund distributions volunteer basis debian well-known example others maintain community version commercial distributions red hat fedora suse opensuse many cities regions local associations known linux user groups lugs seek promote preferred distribution extension free software hold meetings provide free demonstrations training technical support operating system installation new users many internet communities also provide support linux users developers distributions free software open-source projects irc chatrooms newsgroups online forums another means support notable examples linuxquestions.org various distribution specific support community forums ones ubuntu fedora gentoo linux distributions host mailing lists commonly specific topic usage development given list several technology websites linux focus print magazines linux often bundle cover disks carry software even complete linux distributions although linux distributions generally available without charge several large corporations sell support contribute development components system free software analysis linux kernel showed 75 percent code december 2008 january 2010 developed programmers working corporations leaving 18 percent volunteers 7 unclassified major corporations provide contributions include dell ibm hp oracle sun microsystems part oracle nokia number corporations notably red hat canonical suse built significant business around linux distributions free software licenses various software packages distribution built linux kernel based explicitly accommodate encourage commercialization relationship linux distribution whole individual vendors may seen symbiotic one common business model commercial suppliers charging support especially business users number companies also offer specialized business version distribution adds proprietary support packages tools administer higher numbers installations simplify administrative tasks another business model give away software order sell hardware used norm computer industry operating systems cp/m apple dos versions mac os prior 7.6 freely copyable modifiable computer hardware standardized throughout 1980s became difficult hardware manufacturers profit tactic os would run manufacturer computer shared architecture linux distributions support dozens programming languages original development tools used building linux applications operating system programs found within gnu toolchain includes gnu compiler collection gcc gnu build system amongst others gcc provides compilers ada c c++ go fortran many programming languages cross-platform reference implementation supports linux example php perl ruby python java go rust haskell first released 2003 llvm project provides alternative cross-platform open-source compiler many languages proprietary compilers linux include intel c++ compiler sun studio ibm xl c/c++ compiler basic form visual basic supported forms gambas freebasic xbasic terms terminal programming quickbasic turbo basic programming form qb64 common feature unix-like systems linux includes traditional specific-purpose programming languages targeted scripting text processing system configuration management general linux distributions support shell scripts awk sed make many programs also embedded programming language support configuring programming example regular expressions supported programs like grep locate traditional unix mta sendmail contains turing complete scripting system advanced text editor gnu emacs built around general purpose lisp interpreter distributions also include support php perl ruby python dynamic languages common linux also supports c via mono vala scheme guile scheme acts extension language targeting gnu system utilities seeking make conventionally small static compiled c programs unix design rapidly dynamically extensible via elegant functional high-level scripting system many gnu programs compiled optional guile bindings end number java virtual machines development kits run linux including original sun microsystems jvm hotspot ibm j2se well many open-source projects like kaffe jikesrvm gnome kde popular desktop environments provide framework developing applications projects based gtk+ qt widget toolkits respectively also used independently larger framework support wide variety languages number integrated development environments available including anjuta codelite eclipse geany activestate komodo kdevelop lazarus monodevelop netbeans qt creator long-established editors vim nano emacs remain popular linux kernel widely ported operating system kernel available devices ranging mobile phones supercomputers runs highly diverse range computer architectures including hand-held arm-based ipaq ibm mainframes system z9 system z10 specialized distributions kernel forks exist less mainstream architectures example elks kernel fork run intel 8086 intel 80286 16-bit microprocessors \u00b5clinux kernel fork may run systems without memory management unit kernel also runs architectures ever intended use manufacturer-created operating system macintosh computers powerpc intel processors pdas video game consoles portable music players mobile phones several industry associations hardware conferences devoted maintaining improving support diverse hardware linux freedomhec time support different hardware improved linux resulting off-the-shelf purchase good chance compatible besides linux distributions designed general-purpose use desktops servers distributions may specialized different purposes including computer architecture support embedded systems stability security localization specific region language targeting specific user groups support real-time applications commitment given desktop environment furthermore distributions deliberately include free software four hundred linux distributions actively developed dozen distributions popular general-purpose use popularity linux standard desktop computers laptops increasing years modern distributions include graphical user environment two popular environments kde plasma desktop xfce single official linux desktop exists rather desktop environments linux distributions select components pool free open-source software construct gui implementing less strict design guide gnome example human interface guidelines design guide gives human\u2013machine interface important role graphical design also considering people disabilities even focusing security collaborative nature free software development allows distributed teams perform language localization linux distributions use locales localizing proprietary systems would cost-effective example sinhalese language version knoppix distribution became available significantly microsoft translated windows xp sinhalese case lanka linux user group played major part developing localized system combining knowledge university professors linguists local developers performance linux desktop controversial topic example 2007 con kolivas accused linux community favoring performance servers quit linux kernel development frustration lack focus desktop gave tell interview topic since significant amount development focused improving desktop experience projects upstart systemd aim faster boot time wayland mir projects aim replacing x11 enhancing desktop performance security appearance many popular applications available wide variety operating systems example mozilla firefox openoffice.org/libreoffice blender downloadable versions major operating systems furthermore applications initially developed linux pidgin gimp ported operating systems including windows macos due popularity addition growing number proprietary desktop applications also supported linux autodesk maya foundry nuke high-end field animation visual effects see list proprietary software linux details also several companies ported companies games linux linux also supported platform popular steam desura digital-distribution services many types applications available microsoft windows macos also run linux commonly either free software application exist functions application found another operating system application version works linux skype video games like dota 2 team fortress 2 furthermore wine project provides windows compatibility layer run unmodified windows applications linux sponsored commercial interests including codeweavers produces commercial version software since 2009 google also provided funding wine project crossover proprietary solution based open-source wine project supports running windows versions microsoft office intuit applications quicken quickbooks adobe photoshop versions cs2 many popular games world warcraft cases linux port software areas desktop publishing professional audio equivalent software available linux also possible run applications written android versions linux using anbox besides externally visible components x window managers non-obvious quite central role played programs hosted freedesktop.org d-bus pulseaudio major desktop environments gnome kde include offering graphical front-ends written using corresponding toolkit gtk+ qt display server another component longest time communicating x11 display server protocol clients prominent software talking x11 includes x.org server xlib frustration cumbersome x11 core protocol especially numerous extensions led creation new display server protocol wayland installing updating removing software linux typically done use package managers synaptic package manager packagekit yum extender major linux distributions extensive repositories often containing tens thousands packages software run linux available official repositories alternatively users install packages unofficial repositories download pre-compiled packages directly websites compile source code methods come different degrees difficulty compiling source code general considered challenging process new linux users hardly needed modern distributions method specific linux linux distributions also become popular netbook market many devices asus eee pc acer aspire one shipping customized linux distributions installed 2009 google announced chrome os minimal linux-based operating system using chrome browser main user interface chrome os run non-web applications except bundled file manager media player certain level support android applications added later versions netbooks shipped operating system termed chromebooks started appearing market june 2011 linux distributions long used server operating systems risen prominence area netcraft reported september 2006 eight ten two unknown os reliable internet hosting companies ran linux distributions web servers linux top position june 2008 linux distributions represented five top ten freebsd three ten microsoft two ten since february 2010 linux distributions represented six top ten freebsd three ten microsoft one ten linux top position linux distributions cornerstone lamp server-software combination linux apache mariadb/mysql perl/php/python achieved popularity among developers one common platforms website hosting linux distributions become increasingly popular mainframes partly due pricing open-source model december 2009 computer giant ibm reported would predominantly market sell mainframe-based enterprise linux server linuxcon north america 2015 ibm announced linuxone series mainframes specifically designed run linux open-source software linux distributions also dominant operating systems supercomputers november 2017 supercomputers 500 list run variant linux several operating systems smart devices smartphones tablet computers smart tvs in-vehicle infotainment ivi systems based linux major platforms systems include android firefox os mer tizen android become dominant mobile operating system smartphones running 79.3 units sold worldwide second quarter 2013 android also popular operating system tablets android smart tvs in-vehicle infotainment systems also appeared market cellphones pdas running linux open-source platforms became common 2007 examples include nokia n810 openmoko neo1973 motorola rokr e8 continuing trend palm later acquired hp produced new linux-derived operating system webos built line palm pre smartphones nokia maemo one earliest mobile operating systems based debian later merged intel moblin another linux-based operating system form meego project later terminated favor tizen operating system targeted mobile devices well ivi tizen project within linux foundation several samsung products already running tizen samsung gear 2 significant example samsung z smartphones use tizen instead android result meego termination mer project forked meego codebase create basis mobile-oriented operating systems july 2012 jolla announced sailfish os mobile operating system built upon mer technology mozilla firefox os consists linux kernel hardware abstraction layer web-standards-based runtime environment user interface integrated web browser canonical released ubuntu touch aiming bring convergence user experience mobile operating system desktop counterpart ubuntu operating system also provides full ubuntu desktop connected external monitor due low cost ease customization linux often used embedded systems non-mobile telecommunications equipment sector majority customer-premises equipment cpe hardware runs linux-based operating system openwrt community driven example upon many oem firmware releases based example popular tivo digital video recorder also uses customized linux several network firewalls routers makers cisco/linksys korg oasys korg kronos yamaha motif xs/motif xf music workstations yamaha s90xs/s70xs yamaha mox6/mox8 synthesizers yamaha motif-rack xs tone generator module roland rd-700gx digital piano also run linux linux also used stage lighting control systems wholehogiii console past games available linux recent years games released support linux especially indie games exception aaa title games android popular mobile platform uses linux kernel gained much developer interest one main platforms mobile game development along ios operating system apple iphone ipad devices february 14 2013 valve released linux version steam popular game distribution platform pc many steam games ported linux december 13 2013 valve released steamos gaming oriented os based debian beta testing plans ship steam machines gaming entertainment platform valve also developed vogl opengl debugger intended aid video game development well porting source game engine desktop linux result valve effort several prominent games dota 2 team fortress 2 portal portal 2 left 4 dead 2 natively available desktop linux july 31 2013 nvidia released shield attempt use android specialized gaming platform linux users play windows games wine crossover linux 22 august 2018 valve released fork wine called proton aimed gaming features improvements vanilla wine vulkan-based directx 11 12 implementations steam integration better full screen game controller support improved performance multi-threaded games due flexibility customizability free open-source nature linux becomes possible highly tune linux specific purpose two main methods creating specialized linux distribution building scratch general-purpose distribution base distributions often used purpose include debian fedora ubuntu based debian arch linux gentoo slackware contrast linux distributions built scratch general-purpose bases instead focus jeos philosophy including necessary components avoiding resource overhead caused components considered redundant distribution use cases home theater pc htpc pc mainly used entertainment system especially home theater system normally connected television often additional audio system openelec linux distribution incorporates media center software kodi os tuned specifically htpc built ground adhering jeos principle os lightweight suitable confined usage range htpc also special editions linux distributions include mythtv media center software mythbuntu special edition ubuntu kali linux debian-based linux distribution designed digital forensics penetration testing comes preinstalled several software applications penetration testing identifying security exploits ubuntu derivative backbox provides pre-installed security network analysis tools ethical hacking arch-based blackarch includes 2100 tools pentesting security researching many linux distributions created privacy secrecy network anonymity information security mind including tails tin hat linux tinfoil hat linux lightweight portable security distribution based arch linux developed united states department defense tor-ramdisk minimal distribution created solely host network anonymity software tor linux live cd sessions long used tool recovering data broken computer system repairing system building upon idea several linux distributions tailored purpose emerged use gparted partition editor additional data recovery system repair software spacex uses multiple redundant fault-tolerant design falcon 9 rocket merlin engine controlled three voting computers two physical processors per computer constantly check operation linux inherently fault-tolerant operating system function whole system including hardware flight computer software makes purpose flexibility commercial off-the-shelf parts system-wide radiation-tolerant design used instead radiation hardened parts spacex conducted 76 launches falcon 9 since 2010 one successfully delivered primary payloads intended orbit plans use transport astronauts international space station addition windows used operating system non-mission critical systemslaptops used board space station examplebut replaced linux first linux-powered humanoid robot also undergoing in-flight testing jet propulsion laboratory used linux number years help projects relating construction unmanned space flight deep space exploration nasa uses linux robotics mars rover ubuntu linux save data satellites linux distributions created provide hands-on experience coding source code students devices raspberry pi addition producing practical device intention show students things work hood ubuntu derivatives edubuntu linux schools project well debian derivative skolelinux provide education-oriented software packages also include tools administering building school computer labs computer-based classrooms linux terminal server project ltsp instant webkiosk webconverger browser-based linux distributions often used web kiosks digital signage thinstation minimalist distribution designed thin clients rocks cluster distribution tailored high-performance computing clusters general-purpose linux distributions target specific audience users specific language geographical area examples include ubuntu kylin chinese language users blankon targeted indonesians profession-specific distributions include ubuntu studio media creation dnalinux bioinformatics also muslim-oriented distribution name sabily consequently also provides islamic tools certain organizations use slightly specialized linux distributions internally including gendbuntu used french national gendarmerie goobuntu used internally google astra linux developed specifically russian army many quantitative studies free/open-source software focus topics including market share reliability numerous studies specifically examining linux linux market growing rapidly revenue servers desktops packaged software running linux expected exceed 35.7 billion 2008 analysts proponents attribute relative success linux security reliability low cost freedom vendor lock-in linux kernel licensed gnu general public license gpl version 2 gpl requires anyone distributes software based source code license must make originating source code modifications available recipient terms key components typical linux distribution also mainly licensed gpl may use licenses many libraries use gnu lesser general public license lgpl permissive variant gpl x.org implementation x window system uses mit license torvalds states linux kernel move version 2 gpl version 3 specifically dislikes provisions new license prohibit use software digital rights management would also impractical obtain permission copyright holders number thousands 2001 study red hat linux 7.1 found distribution contained 30 million source lines code using constructive cost model study estimated distribution required eight thousand person-years development time according study software developed conventional proprietary means would cost us dollars develop united states source code 71 written c programming language many languages used including c++ lisp assembly language perl python fortran various shell scripting languages slightly half lines code licensed gpl linux kernel 2.4 million lines code 8 total later study analysis performed debian version 4.0 etch released 2007 distribution contained close 283 million source lines code study estimated would required seventy three thousand man-years cost us dollars develop conventional means united states name linux trademark registered linus torvalds initially nobody registered august 15 1994 william r. della croce jr. filed trademark linux demanded royalties linux distributors 1996 torvalds affected organizations sued trademark assigned torvalds 1997 case settled licensing trademark since handled linux mark institute lmi torvalds stated trademarked name prevent someone else using lmi originally charged nominal sublicensing fee use linux name part trademarks later changed favor offering free perpetual worldwide sublicense free software foundation fsf prefers gnu/linux name referring operating system whole considers linux distributions variants gnu operating system initiated 1983 richard stallman president fsf explicitly take issue name android android os also operating system based linux kernel gnu part minority public figures software projects stallman fsf notably debian sponsored fsf 1996 also use gnu/linux referring operating system whole media common usage however refers family operating systems simply linux many large linux distributions example suse linux red hat enterprise linux contrast linux distributions containing free software use gnu/linux simply gnu trisquel gnu/linux parabola gnu/linux-libre blag linux gnu gnewsense 8 13 modern linux distribution made gnu components range depending whether gnome considered part gnu determined counting lines source code making ubuntu natty release meanwhile 6 taken linux kernel increased 9 including direct dependencies", + "neighbors": [ + 1, + 9, + 13, + 22, + 25, + 33, + 34, + 35, + 37, + 38, + 40, + 42, + 43, + 55, + 58, + 63, + 64, + 65, + 74, + 78, + 82, + 83, + 85, + 94, + 99, + 106, + 107, + 113, + 116, + 117, + 120, + 137, + 138, + 142, + 148, + 160, + 162, + 166, + 170, + 171, + 175, + 176, + 185, + 186, + 187, + 189, + 193, + 195, + 207, + 209, + 210, + 211, + 213, + 216, + 217, + 219, + 221, + 222, + 227, + 232, + 233, + 234, + 242, + 246, + 254, + 258, + 264, + 265, + 267, + 270, + 272, + 275, + 278, + 292, + 293, + 294, + 295, + 298, + 300, + 301, + 305, + 306, + 308, + 313, + 322, + 323, + 326, + 327, + 329, + 331, + 332, + 333, + 334, + 336, + 337, + 351, + 353, + 355, + 357, + 358, + 359, + 360, + 362, + 363, + 364, + 373, + 375, + 377, + 379, + 380, + 387, + 390, + 392, + 393, + 397, + 399, + 400, + 401, + 404, + 405, + 412, + 413, + 416, + 431, + 434, + 438, + 443, + 446, + 448, + 457, + 465, + 468, + 469, + 473, + 475, + 476, + 477, + 483, + 484, + 491, + 500, + 503, + 507, + 522, + 526, + 536, + 551, + 558, + 567, + 569, + 571, + 577, + 579, + 582, + 583, + 593, + 598, + 611, + 630, + 631, + 639, + 648, + 650, + 653, + 656, + 661, + 664, + 668, + 679, + 685, + 688, + 690, + 695, + 697, + 707, + 708, + 711, + 712, + 713, + 716, + 717, + 720, + 721, + 725, + 728, + 731, + 736, + 743, + 747, + 754, + 755, + 763, + 766, + 776, + 780, + 787, + 796, + 797, + 800, + 805, + 806, + 812, + 819, + 824, + 839, + 842, + 857, + 860, + 862, + 868, + 872, + 875, + 884, + 886, + 887, + 891, + 893, + 897, + 899, + 900, + 901, + 908, + 910, + 912, + 916, + 918, + 919, + 923, + 925, + 927, + 935, + 938, + 939, + 941, + 942, + 947, + 948, + 953, + 954, + 957, + 961, + 962, + 966, + 974, + 977, + 986, + 987, + 991, + 996, + 997, + 998, + 1002, + 1003, + 1004, + 1011, + 1012, + 1015, + 1016, + 1024, + 1027, + 1028, + 1030, + 1033, + 1037, + 1040, + 1046, + 1049, + 1050, + 1053, + 1054, + 1055, + 1056, + 1060, + 1063, + 1064, + 1065, + 1090, + 1097, + 1102, + 1103, + 1104, + 1106, + 1110, + 1114, + 1120, + 1123, + 1126, + 1130, + 1132, + 1138, + 1142, + 1149, + 1152, + 1155, + 1157, + 1159, + 1163, + 1166, + 1167, + 1179, + 1187, + 1189, + 1190, + 1197, + 1201, + 1202, + 1206, + 1210, + 1214, + 1217, + 1218, + 1221, + 1224, + 1225, + 1227, + 1228, + 1232, + 1234, + 1235, + 1241, + 1245, + 1250, + 1251, + 1252, + 1254, + 1257, + 1270, + 1274, + 1276, + 1278, + 1279, + 1283, + 1284, + 1286, + 1288, + 1292, + 1296, + 1301, + 1304, + 1311, + 1313, + 1318, + 1321, + 1322, + 1325, + 1338, + 1346, + 1360, + 1361, + 1363, + 1366, + 1368, + 1369, + 1373, + 1374, + 1376, + 1377, + 1379, + 1381, + 1385, + 1391, + 1394, + 1397, + 1398, + 1400, + 1401, + 1403, + 1406, + 1413, + 1415, + 1421, + 1427, + 1428, + 1430, + 1441, + 1452, + 1456, + 1457, + 1458, + 1459, + 1462, + 1464, + 1468, + 1470, + 1474, + 1480, + 1493, + 1494, + 1503, + 1509, + 1514, + 1516, + 1524, + 1526, + 1528, + 1530, + 1534, + 1538, + 1539, + 1546, + 1547, + 1550, + 1552, + 1553, + 1556, + 1558, + 1568, + 1570, + 1578, + 1580, + 1582, + 1583, + 1586, + 1587, + 1588, + 1592, + 1599, + 1601, + 1602, + 1604, + 1605, + 1609, + 1610, + 1616, + 1621, + 1629, + 1631, + 1632, + 1637, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 135, + "label": 7, + "text": "Planview:planview planview global enterprise software company headquartered austin texas company founded 1989 austin texas patrick durbin 1997 company launched complete web-based resource project portfolio management ppm software planview enterprise version 14 2017 2010 company moved cloud offer software service saas solutions december 2013 insight venture partners acquired substantial interest planview august 2014 planview acquired projectplace stockholm-based project collaboration company planview went acquire troux technologies austin-based enterprise architecture management software company may 2015 august 1 2016 company announced acquisition san francisco-based innotas thus extending project portfolio management software leadership mid-market january 2017 thoma bravo acquired planview becoming majority shareholder insight venture partners maintained original 2014 capital investment company december 2017 planview acquired leankit december 2018 planview acquired spigit planview recognized visionary magic quadrant enterprise architecture tools gartner magic quadrant enterprise architecture tools \u2013 may 24 2017 gartner names planview leader project portfolio management ppm gartner 2017 magic quadrant project portfolio management worldwide may 25 2017 planview cited leader troux forrester wave\u2122 enterprise architecture management suites q2 2017 \u2013 june 14 2017 forrester research identifies projectplace leader rapidly growing work collaboration market forrester wave\u2122 enterprise collaborative work management q4 2016 ventana research awards 2016 cio/it leadership award mentor graphics using planview enterprise projectplace ensure resources working initiatives highest strategic value constellation research names projectplace 2016 constellation shortlist\u2122 social task management", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 136, + "label": 1, + "text": "Interfolio:interfolio interfolio academic faculty management software higher education technology company based washington d.c company provides software assist shared governance processes faculty activity tracking tools assist institutional accreditation reporting january 2016 company acquired 12 million investor funding interfolio founded georgetown university senior steve goldenberg 1999 interfolio \u2019 services represents complete faculty lifecycle information system interfolio created streamline college application process academic jobs providing online portfolio application system principal interfolio services includes dossier service collecting curating delivering academic materials scholarly opportunities interfolio based module faculty information includes workflow evaluation suite well tool faculty activity reporting", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 137, + "label": 3, + "text": "Advanced_Vector_Extensions:advanced vector extensions advanced vector extensions avx also known sandy bridge new extensions extensions x86 instruction set architecture microprocessors intel amd proposed intel march 2008 first supported intel sandy bridge processor shipping q1 2011 later amd bulldozer processor shipping q3 2011 avx provides new features new instructions new coding scheme avx2 expands integer commands 256 bits introduces fused multiply-accumulate fma operations avx-512 expands avx 512-bit support using new evex prefix encoding proposed intel july 2013 first supported intel knights landing processor shipped 2016 avx uses sixteen ymm registers perform single instruction multiple pieces data see simd ymm register hold simultaneous operations math width simd registers increased 128 bits 256 bits renamed xmm0\u2013xmm7 ymm0\u2013ymm7 x86-64 mode ymm0\u2013ymm15 legacy sse instructions still utilized via vex prefix operate lower 128 bits ymm registers avx introduces three-operand simd instruction format destination register distinct two source operands example sse instruction using conventional two-operand form b use non-destructive three-operand form c b preserving source operands avx three-operand format limited instructions simd operands ymm include instructions general purpose registers e.g eax support first appear avx2 alignment requirement simd memory operands relaxed new vex coding scheme introduces new set code prefixes extends opcode space allows instructions two operands allows simd vector registers longer 128 bits vex prefix also used legacy sse instructions giving three-operand form making interact efficiently avx instructions without need vzeroupper vzeroall avx instructions support 128-bit 256-bit simd 128-bit versions useful improve old code without needing widen vectorization avoid penalty going sse avx also faster early amd implementations avx mode sometimes known avx-128 avx instructions addition ones 256-bit extensions legacy 128-bit sse instructions usable 128-bit 256-bit operands cpus listed families support avx generally cpus commercial denomination core i3/i5/i7 support whereas pentium celeron cpus n't issues regarding compatibility future intel amd processors discussed xop instruction set gcc starting version 4.6 although 4.3 branch certain support intel compiler suite starting version 11.1 support avx visual studio 2010/2012 compiler supports avx via intrinsic /arch avx switch open64 compiler version 4.5.1 supports avx -mavx flag absoft supports -mavx flag pathscale supports via -mavx flag free pascal compiler supports avx avx2 -cfavx -cfavx2 switches version 2.7.1 vector pascal compiler supports avx via -cpuavx32 flag gnu assembler gas inline assembly functions support instructions accessible via gcc intel primitives intel inline assembler closely compatible gas although general handling local references within inline code assemblers masm vs2010 version yasm fasm nasm jwasm avx adds new register-state 256-bit wide ymm register file explicit operating system support required properly save restore avx expanded registers context switches following operating system versions support avx advanced vector extensions 2 avx2 also known haswell new instructions expansion avx instruction set introduced intel haswell microarchitecture avx2 makes following additions sometimes another extension using different cpuid flag considered part avx2 instructions listed page avx-512 512-bit extensions 256-bit advanced vector extensions simd instructions x86 instruction set architecture proposed intel july 2013 scheduled supported 2015 intel knights landing processor avx-512 instruction encoded new evex prefix allows 4 operands 7 new 64-bit opmask registers scalar memory mode automatic broadcast explicit rounding control compressed displacement memory addressing mode width register file increased 512 bits total register count increased 32 registers zmm0-zmm31 x86-64 mode avx-512 consists multiple extensions meant supported processors implementing instruction set consists following core extension avx-512f avx-512 foundation required implementations though current processors also support cd conflict detection computing coprocessors additionally support er pf 4vnniw 4fmaps vpopcntdq desktop processors support vl dq bw ifma vbmi vpopcntdq vpclmulqdq etc updated sse/avx instructions avx-512f use mnemonics avx versions operate 512-bit zmm registers also support 128/256 bit xmm/ymm registers avx-512vl byte word doubleword quadword integer operands avx-512bw/dq vbmi", + "neighbors": [ + 53, + 85, + 134, + 210, + 271, + 331, + 457, + 481, + 521, + 641, + 752, + 805, + 830, + 961, + 979, + 1016, + 1138, + 1158, + 1160, + 1161, + 1166, + 1284, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 138, + "label": 4, + "text": "Wireshark:wireshark wireshark free open-source packet analyzer used network troubleshooting analysis software communications protocol development education originally named ethereal project renamed wireshark may 2006 due trademark issues wireshark cross-platform using qt widget toolkit current releases implement user interface using pcap capture packets runs linux macos bsd solaris unix-like operating systems microsoft windows also terminal-based non-gui version called tshark wireshark programs distributed tshark free software released terms gnu general public license wireshark similar tcpdump graphical front-end plus integrated sorting filtering options wireshark lets user put network interface controllers promiscuous mode supported network interface controller see traffic visible interface including unicast traffic sent network interface controller mac address however capturing packet analyzer promiscuous mode port network switch traffic switch necessarily sent port capture done capturing promiscuous mode necessarily sufficient see network traffic port mirroring various network taps extend capture point network simple passive taps extremely resistant tampering gnu/linux bsd macos libpcap 1.0.0 later wireshark 1.4 later also put wireless network interface controllers monitor mode remote machine captures packets sends captured packets machine running wireshark using tzsp protocol protocol used omnipeek wireshark dissects packets analyze packets captured remote machine time captured late 1990s gerald combs computer science graduate university missouri\u2013kansas city working small internet service provider commercial protocol analysis products time priced around 1500 run company primary platforms solaris linux gerald began writing ethereal released first version around 1998 ethereal trademark owned network integration services may 2006 combs accepted job cace technologies combs still held copyright ethereal source code rest re-distributable gnu gpl used contents ethereal subversion repository basis wireshark repository however ethereal trademark changed name wireshark 2010 riverbed technology purchased cace took primary sponsor wireshark ethereal development ceased ethereal security advisory recommended switching wireshark wireshark several industry awards years including eweek infoworld pc magazine also top-rated packet sniffer insecure.org network security tools survey sourceforge project month august 2010 combs continues maintain overall code wireshark issue releases new versions software product website lists 600 additional contributing authors wireshark data capturing program understands structure encapsulation different networking protocols parse display fields along meanings specified different networking protocols wireshark uses pcap capture packets capture packets types networks pcap supports wireshark native network trace file format libpcap format supported libpcap winpcap exchange captured network traces applications use format including tcpdump ca netmaster also read captures network analyzers snoop network general sniffer microsoft network monitor capturing raw network traffic interface requires elevated privileges platforms reason older versions ethereal/wireshark tethereal/tshark often ran superuser privileges taking account huge number protocol dissectors called traffic captured pose serious security risk given possibility bug dissector due rather large number vulnerabilities past many allowed remote code execution developers doubts better future development openbsd removed ethereal ports tree prior openbsd 3.6 elevated privileges needed operations example alternative run tcpdump dumpcap utility comes wireshark superuser privileges capture packets file later analyze packets running wireshark restricted privileges emulate near realtime analysis captured file may merged mergecap growing file processed wireshark wireless networks possible use aircrack wireless security tools capture ieee 802.11 frames read resulting dump files wireshark wireshark 0.99.7 wireshark tshark run dumpcap perform traffic capture platforms require special privileges capture traffic need dumpcap run privileges neither wireshark tshark need run special privileges wireshark color packets based rules match particular fields packets help user identify types traffic glance default set rules provided users change existing rules coloring packets add new rules remove rules wireshark also used capture packets network simulation tools ns opnet modeler netsim", + "neighbors": [ + 74, + 134, + 160, + 299, + 306, + 364, + 405, + 631, + 684, + 796, + 875, + 961, + 991, + 1042, + 1138, + 1206, + 1279, + 1337, + 1400, + 1513, + 1527 + ], + "mask": "Test" + }, + { + "node_id": 139, + "label": 1, + "text": "Nadra:nadra national database registration authority nadra urdu \u0646\u0627\u062f\u0631\u0627 commonly called nadra independent autonomous agency ministry interior government pakistan regulates government databases statistically manages sensitive registration database national citizens pakistan nadra also responsible issuing computerized national identity cards citizens pakistan maintaining sensitive informational upgraded government databases securing national identities citizens pakistan stolen theft one largest government database institution employing 11,000 people 800 domestic offices five international offices also claims hold record maintaining largest biometric database citizens world codified second amendment \u00a730 constitution pakistan 2000 constitution grants powers nadra enact civil registration sensitive databases pakistan citizens databases kept extreme secrecy security ensure safety citizen databases 2018 directed headed usman yousaf mobin chief technology officer nadra appointed chairman independence pakistan prime minister liaquat ali khan launched personal identity system pis program register manage issue national identification cards citizens pakistan muslim refugees settling pakistan changes carried election commission pakistan 1965 process voter registration hold nationwide 1965 presidential election 1969\u201370 amendments pis program continued election commission election commission supervised 1970 general elections 1971 war resulted east-pakistan gaining independence bangladesh new statistical database system needed ensure safety pakistan citizens well national security country questions raised pakistani bhutto regime introduced national registration act parliament pakistan establish authority issue photo ids registered pakistani citizens 1973 new database system codified second amendment \u00a730 constitution pakistan perform contain statistical database citizens pakistan registration pakistan citizens statistic database government computer accounts started 1973 promulgation constitution country new program visioned started prime minister zulfikar ali bhutto 1973 parliamentary session bhutto stated parliament people pakistan due absence full statistical database people country country operating utter darkness government started issuing national identity card nic numbers citizens started establish government databases people government computers national database registration authority nadra established 10 march 2000 merging directorate general registration pakistan department created 1973 constitution national database organization ndo attached department ministry interior government pakistan created 1998 census nadra autonomous body operate independently mandate replace old directorate general registration computrised system registering 150 million citizens nadra launched multi-biometric national identity card project developed conformance international security documentation issuance practices year 2000 program replaced paper based personal identity system pakistan use since 1973 date 96 million citizens pakistan abroad utilized system allied services receive tamper-resistant iso standard identification documents computerised national identity card cnic computerised national identity card issued nadra pakistani citizens cnic introduced 2000 2012 89.5 million cnics issued cnic issued first age 18 pakistani law compulsory carry one however pakistani citizens cnic mandatory thus seen de facto necessity meaningful civic life pakistan pakistan adult citizens must register computerised national identity card cnic unique number upon reaching age 18 serves identification document authenticate individual identity citizen pakistan introduction cnic manual national identity cards nics issued citizens pakistan today government shifted existing records national identity cards nic central computerised database managed nadra new cnic machine-readable carry facial fingerprint information every citizen required nic number number required many activities getting driver licence passport registering vehicle receiving social insurance/zakat funding enrolling school college technical institute filing legal affidavit wiring funds paying taxes opening bank account getting utility connection electricity phone mobile phone water sewer natural gas etc however since births country registered pakistanis conduct activities described id cards 2007 nadra announced issued 60 million cnic c standing computerized numbers approximately one-third population authority issued 10 millionth cnic 11 february 2002 20 millionth 18 june 2002 30 millionth 22 december 2003 40 millionth 1 october 2004 50 millionth cnic 14 february 2006 unique 13-digit number assigned birth parents complete child birth registration form form rg-2 commonly known b-form child registration certificate crc national identity card nic number issued age 18 2001 nic numbers 11 digits long 2001-2002 authority started issuing 13-digit nic numbers along new biometric id cards first 5 digits based applicant locality next 7 random numbers last digit check digit even number females odd number males old manual nic numbers invalid 1 january 2004 id card following information legal name gender male female transgender father name husband name married females identification mark date birth national identity card number family tree id number current address permanent address date issue date expiry signature photo fingerprint thumbprint nadra also records applicant religion noted cnic nadra registered 90 women pakistan although nadra started issuing ultra modern scnic smart computerized national identity card information english urdu languages nadra introduced smart national identity card snic pakistan first national electronic identity card october 2012 pakistan snic contains data chip 36 security features snic complies icao standard 9303 iso standard 7816-4 snic used offline online identification voting pension disbursement social financial inclusion programmes services nadra aims replace 89.5 million cnics snics 2020 order address security concerns nadra incorporated 36 security features physical design card making one securest cards world card printed multiple layers layer security features chip encrypted extremely competent software developers nadra secure communication protocols determined read remote devices enable remote verification citizens match-on-card applet designed nadra citizen places card card reader reader first authenticate card return card verify authenticity reader verifications successful device ask finger lpc nadra card enable verifications individuals remotest parts pakistan say decade individual casts vote government may ascertain person casting vote indeed one electoral roll one thousands scenarios identity fraud prevention card empowers majority space chip made available private sector use products services might appear expensive private sector use card initially number citizens critical mass reached profitable private sector use secure universal platform order track nadra smart card tracking id consisting 12 digits sent 8400 example tracking id 108231064935 message sent 8400 get message request tracking id 108231064935 printing facility expected delivery 2 working days nadra started service online application nicop poc crc online data collected e.g fingerprints thumb impressions signatures online fee submitted debit credit card", + "neighbors": [ + 663, + 1490 + ], + "mask": "Test" + }, + { + "node_id": 140, + "label": 7, + "text": "UKFast:ukfast ukfast.net ltd business-to-business hosting company based manchester uk principally known managed hosting cloud services colocation business owns operates data centre complex trafford park manchester ukfast founded september 1999 welsh businessman lawrence jones partner gail jones 2007 company moved head office 28th floor city tower manchester acquired space 16th floor moving 2013 campus birley fields area hulme manchester 2013 firm launched ecloud range cloud hosting services whose hardware infrastructure reportedly cost \u00a312 million build year business turned \u00a323.4m year ending 31 december 2014 ukfast reported 24 per cent turnover increase \u00a323.4m \u00a328.9m 2011 2015 ukfast invested \u00a325m capital expenditure projects including development four data centres flagship ukfast campus founder lawrence jones rejected reported \u00a3200m takeover bid 2014 amidst trend web hosting consolidation citing business still growing 2013 ukfast opened office glasgow 2015 opened office london 2018 30 stake ukfast sold private equity firm inflexion 2005 2009 ukfast six internet service providers association awards named best hosting provider four years running ukfast received data centre solutions awards \u2019 private cloud product year 2012 datacenterdynamics award innovation outsourcing 2013 year ukfast received national business awards employer year award institute customer service employee engagement strategy year awards ukfast also featured sunday times 100 best small companies work great place work institute \u2019 best workplaces lists placing 28th 12th respectively 2014 25th 5th respectively 2013 45th 7th respectively 2012", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 141, + "label": 4, + "text": "ICloud_leaks_of_celebrity_photos:icloud leaks celebrity photos august 31 2014 collection almost 500 private pictures various celebrities mostly women many containing nudity posted imageboard 4chan later disseminated users websites social networks imgur reddit images initially believed obtained via breach apple cloud services suite icloud security issue icloud api allowed make unlimited attempts guessing victims passwords however access later revealed gained via spear phishing attacks event media outlets internet users referred names fappening portmanteau words fap \u2014a slang term masturbation\u2014and film happening celebgate met varied reaction media fellow celebrities critics felt distribution images major invasion privacy subjects allegedly depicted subjects questioned authenticity leak also prompted increased concern analysts surrounding privacy security cloud computing services icloud\u2014with particular emphasis use store sensitive private information images obtained via online storage offered apple icloud platform automatically backing photos ios devices iphones apple later reported victims icloud account information obtained using targeted attack user names passwords security questions phishing brute-force guessing initially believed images obtained using exploit find iphone service court documents 2014 indicated one user created fake email account called appleprivacysecurity ask celebrities security information photos passed around privately least couple weeks public release august 31 claims unreleased photos videos exist daily mail cited anonymous posters 4chan deadspin stated ring hackers traders sellers operating months leading mass release hacker responsible leak described collector distributed leaked images image boards 4chan anon-ib exchange bitcoin ultimately images widely circulated online via channels including imgur tumblr celebrity gossip blogger perez hilton also re-posted photos blog soon took issued apology saying acted bad taste major center activity link-sharing website reddit subreddit created sharing photos single day amassed 100,000 followers reddit administrators criticized allowing take place alleged violation anti-doxing rules mckayla maroney claimed 18 time photos taken reddit staff took photos warned anyone re-posting underage photos liz lee circulating prior incident would permanently banned site could prosecuted distributing child pornography september 7 citing copyright issues reddit banned thefappening subreddit also saying workload dealing become much reddit banned another subreddit named fappening day original release contained photos videos 100 individuals allegedly obtained file storage hacked icloud accounts including leakers claimed a-list celebrities shortly photos leaked several affected celebrities issued statements either confirm deny photos authenticity celebrities confirmed photos authenticity include jennifer lawrence confirmed publicist kate upton husband justin verlander confirmed upton lawyer mary elizabeth winstead confirmed twitter jessica brown findlay confirmed spokesman kaley cuoco confirmed via instagram kirsten dunst also criticized icloud service jill scott confirmed twitter one leaked photos stating another fake celebrities denied photos authenticity include ariana grande yvonne strahovski olympic gymnast mckayla maroney initially denied images authenticity twitter later confirmed photos legitimate also stating underage time taken victoria justice denied photos authentic later stated twitter pursuing legal actions found leak massive invasion privacy privacy celebrities affected leak reports october indicated nick hogan first male star directly targeted hackers however hogan denied pictures authenticity according security expert nik cubrilovic addition photographs personal information text messages calendars address books phone call logs data stored phones backed service also likely stolen september 20 2014 second batch similar private photos additional celebrities leaked hackers september 26 2014 third batch also leaked dubbed fappening 3 actress lena dunham pleaded twitter people view pictures saying violat es women okay actress emma watson condemned release photos also accompanying comments social media show lack empathy actors seth rogen lucas neff also spoke hackers people posted pictures justin verlander pitcher detroit tigers told media prior game cleveland indians keeps private life private would rather focus tigers race kansas city royals al central title distraction teammates security analysts stated breach could prevented use two-factor authentication forbes writer recommended turning icloud photo stream feature uploads photos taken ios device icloud servers automatically entirely incident given many names including fappening portmanteau happening fap internet slang term masturbation celebgate reference watergate scandal term fappening received criticism journalists like radhika sanghani daily telegraph toyin owoseje international business times said term trivialized leak also according sanghani made light severe situation articles used term extensively describe event including headlines interview wall street journal apple ceo tim cook stated response leaks company planned take additional steps protect privacy security icloud users future notifications provided whenever data restored device via icloud logging icloud via web browser addition existing notifications user icloud password changed additionally apple broaden encourage use two-factor authentication future versions software operating systems then-upcoming ios 8 conclusion emphasized want everything protect customers outraged jennifer lawrence contacted authorities publicist stated authorities prosecute anyone posts leaked images forbes columnist joseph steinberg questioned whether reactions law enforcement technology providers indicated celebrities treated differently ordinary americans case law enforcement may illegal october 1 2014 google threatened lawsuit lawyer martin singer 100 million behalf unnamed victims leaks alleging google refused respond requests images removed platforms including blogger youtube failing act expeditiously responsibly remove images knowingly accommodating facilitating perpetuating unlawful conduct interview vanity fair lawrence called leak sex crime sexual violation added anybody looked pictures 're perpetuating sexual offense cower shame view contrasted another victim hack emily ratajkowski told gq lot people victims hack said anyone looks pictures feel guilty n't think fair 'm sure anyone googles necessarily criminal think people stole photos fbi said aware allegations concerning computer intrusions unlawful release material involving high profile individuals addressing matter similarly apple stated investigating whether security breach icloud service responsible leaked photographs per company commitment user privacy september 2 2014 apple reported leaked images result compromised accounts using targeted attack user names passwords security questions practice become common internet october 2014 fbi searched house chicago seized several computers cell phones storage drives tracking source hacking attack ip address linked individual named emilio herrera related search warrant application mentioned eight victims initials a.s. c.h. h.s. j.m. o.w. a.k. e.b. a.h. supposedly point stolen photos abigail spencer christina hendricks hope solo jennette mccurdy olivia wilde anna kendrick emily browning amber heard according law enforcement officials herrera one several people investigation fbi carried various searches across country march 2016 36-year-old ryan collins lancaster pennsylvania agreed plead guilty one count unauthorized access protected computer obtain information resulting 18-month sentence victims named court documents numerous media outlets connected collins case fappening investigation found collins phished sending e-mails victims looked like came apple google warning victims accounts might compromised asking account details victims would enter passwords collins gained access accounts downloading e-mails icloud backups october 2016 collins sentenced 18 months prison august 2016 28-year-old edward majerczyk chicago illinois agreed plead guilty similar phishing scheme although authorities believe worked independently accused selling images posting online january 24 2017 majerczyk sentenced nine months prison ordered pay 5,700 restitution cover counseling services one unnamed celebrity victim emilio herrera also chicago first named press 2014 pleaded guilty one count unauthorized access protected computer obtain information october 2017 herrera accessed accounts unnamed celebrities others accused involved leaking sharing photos videos obtained sentenced 16 months jail march 2018 april 2018 26-year-old george garofano north branford connecticut pleaded guilty one count unauthorized access protected computer obtain information garofano attorney said led phishing scheme criminals august 29 2018 federal court sentenced garofano eight months prison october 22 2018 christopher brannan former virginia teacher became fifth man convicted relation hacking brannan pled guilty federal charges aggravated identity theft unauthorized access protected computer phishing expedition hacked 200 people addition celebrity victims brannan targeted underage sister-in-law well teachers students school used teach brannan sentenced 34 months prison march 1 2019", + "neighbors": [ + 43, + 91, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 611, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 858, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1373, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 142, + "label": 2, + "text": "OS/360_and_successors:os/360 successors os/360 officially known ibm system/360 operating system discontinued batch processing operating system developed ibm then-new system/360 mainframe computer announced 1964 heavily influenced earlier ibsys/ibjob input/output control system iocs packages one earliest operating systems require computer hardware include least one direct access storage device although os/360 discontinued successor operating systems including virtual storage mvs 64-bit z/os still run maintain application-level compatibility ibm announced three different levels os/360 generated tapes sharing code ibm eventually renamed options made significant design changes users often coined nicknames e.g. big os os/mft none names official recognition ibm major operating system system/360 hardware dos/360 os/360 public domain downloaded freely well run actual system/360 hardware executed free hercules emulator runs unix unix-like systems including gnu/linux solaris macos well windows os/360 turnkey cds provide pregenerated os/360 21.8 systems ready run hercules ibm originally intended system/360 one batch-oriented operating system os/360 capable running machines small 32 kib also intended supply separate timesharing operating system tss/360 system/360 model 67 least two accounts ibm eventually decided produce simpler batch-oriented operating systems ibm introduced series stop-gaps prevent system/360 hardware sales collapsing\u2014first bos/360 basic operating system smallest machines 8k byte memories tos/360 tape operating system machines least 16k byte memories tape drives finally dos/360 disk operating system became mainstream operating system ancestor today widely used z/vse ibm released three variants os/360 pcp primary control program stop-gap could run one job time 1966 mft multiprogramming fixed number tasks mid-range machines mvt multiprogramming variable number tasks top end mft mvt used least 1981 decade successors launched division mft mvt arose storage limitations scheduling constraints initially ibm maintained mft mvt simply two configurations os/360 control program although later ibm described separate versions os/360 ibm originally wrote os/360 assembly language later ibm wrote os/360 code new language basic systems language bsl derived pl/i large amount tso code release 20 written bsl tss/360 late unreliable ibm canceled although ibm later supplied three releases tss/370 prpq time cp-67 running well enough ibm offer without warranty timesharing facility large customers three options offered similar facilities porting applications usually required minimal effort versions ibm program products application utility software ran text mostly treats pcp mft mvt simply new names original sss mss mps although design changes also text distinguish m65mp mvt officially pcp mft mvt separate operating systems os/360 install-time configuration options\u2014in today words three different variants os nucleus scheduler however quite different behavior memory requirements users commonly consider de facto separate operating systems refer early os/360 os/mft os/mvt respectively mft differs mvt mainly way manages memory installing mft customers specify fixed number partitions areas memory fixed boundaries application programs run simultaneously primary control program pcp intended machines small memories similar mft one partition experience indicated advisable install os/360 systems less 128 kib memory although limited production use possible much smaller machines 48 kib memory ibm dropped pcp option final releases os/360 leaving mft ii mvt required memory also referred sys=min macro expansions system-dependent multiprogramming fixed number tasks mft intended serve stop-gap multiprogramming variable number tasks mvt intended target configuration os/360 became available 1967 early versions mvt many problems simpler mft continued used many years introducing new system/370 machines virtual memory 1972 ibm developed mft 2 os/vs1 last system particular line first version mft shared much code architecture pcp limited four partitions cumbersome run multiple partitions many installations used houston automatic spooling priority hasp mitigate complexity mft version ii mft-ii shared much control program scheduler code mvt much flexible run maximum number partitions increased 52 later modifications mft-ii added sub-tasking fixed number tasks longer fixed although number partitions remain limitation experience indicated advisable install mft systems less 256 kib memory 1960s quite large amount also referred sys=int macro expansions system-dependent multiprogramming variable number tasks mvt sophisticated three available configurations os/360 control program one two available configurations final releases mvt intended largest machines system/360 family introduced 1964 become available 1967 early versions many problems simpler mft continued used many years experience indicated advisable install mvt systems less 512 kib memory mvt treated memory used operating system single pool contiguous regions could allocated required unlimited number simultaneous application systems programs scheme flexible mft principle used memory efficiently liable fragmentation one could find although enough spare memory total run program divided separate chunks none large enough system/360 lacked memory relocation hardware memory compaction could used reduce fragmentation facility called rollout/rollin could swap running job secondary storage make memory available another job rolled-out job would however rolled-in original memory locations became available 1971 time sharing option tso use mvt added part release 20.1 tso became widely used program development provided editor ability submit batch jobs notified completion view results without waiting printed reports debuggers programming languages used system/360 tso os/360 communicated terminals using telecommunications access method tcam tcam name suggests ibm hoped would become standard access method data communications fact tcam os/vs2 used almost entirely tso largely superseded virtual telecommunications access method vtam mid-to-late 1970s also referred sys=vms invocations macros system-dependent model 65 multiprocessing m65mp variant mvt runs 360/65 multisystem mode m65mp traps use set system mask ssm instruction serialize disabled code two cpus part m65mp system behavior interfaces mvt system keyword parameter sys=vms included m65mp well uniprocessor mvt pcp mft mvt provide similar facilities point view application programs features available mft mvt system/370 announced 1970 offered essentially facilities system/360 4 times processor speeds similarly priced system/360 cpus 1972 ibm announced system/370 advanced functions main item future sales system/370 would include virtual memory capability could also retro-fitted existing system/370 cpus hence ibm also committed delivering enhanced operating systems could support use virtual memory ibm provided os/360 sysgen option s/370 support support dat os/vs1 successor mft offers similar facilities several additions e.g. res virtual memory vsam see initially available independent component release icr later integrated os/vs1 base ibm released fairly minor enhancements os/vs1 1983 1984 announced would aix/370 aix/esa dppx ix/370 os/vs1 tss/370 system/370 operating systems modern descendants os/vs2 release 1 mvt plus virtual memory vsam see version eventually renamed os/vs2 svs single virtual storage os/vs2 release 2 also known mvs multiple virtual storage introduced svs intended stepping stone mvt mvs historical interest today 1974 ibm released described os/vs2 release 2 really new operating system upwards-compatible os/vs2 release 1 supervisor new system largely rewritten new dialect bsl pl/s bsl pl/s dialects pl/i extensions designed transcribe assembly language code including privileged instructions needed control computer whole time-sensitive os components os dispatcher ios notably among many others remained coded assembly language enhanced os/vs ifox00 assembler older os/360 ieuasm assembler new version noticeable feature supported multiple virtual address spaces different applications thought using range virtual addresses new system virtual memory facilities mapped different ranges real memory addresses application address space consists 3 areas operating system one instance shared jobs application area unique application shared virtual area used various purposes including inter-job communication ibm promised application areas would always least 8mb approach eliminated risk memory fragmentation present mvt svs improved system internal security new system rapidly became known mvs multiple virtual storages original os/vs2 became known svs single virtual storage ibm accepted terminology labelled mvs successors mvs/ xxx mvs introduced new approach workload management allowing users define performance targets high-priority batch jobs enabled users give systems work without affecting performance highest-priority jobs mvs ibm first mainstream operating system system/370 support ibm called tightly coupled multiprocessing 2 later 12 ibm mainframes 16 amdahl mainframes cpus shared concurrent access memory single copy operating system peripheral devices providing greater processing power degree graceful degradation one cpu failed fortunately became increasingly rare event system time rose hours days years initially mvs supplied job queue manager called jes2 job entry subsystem 2 descended hasp houston automatic spooling priority also supported remote job entry workstations located elsewhere jes2 manage jobs one cpu might tightly coupled multiprocessor system 1976 ibm provided another option jes3 job entry subsystem 3 descendant asp attached support processor allows one cpu manage single job queue feeding work several physically distinct cpus therefore allows one operator console manage work cpus note jes1 job queue manager os/vs1 see ibm hoped virtual storage access method vsam would replace earlier sequential indexed direct access methods provided improved versions vsam formats became basis ibm database management systems ims/vs db2 usually esds actual data storage ksds indexes vsam also provides new implementation catalog facility enables applications access files name without needing know disk drive vsam datasets must defined vsam catalog used non-vsam datasets also listed vsam catalog mvs master catalog must vsam catalog catalogs originally provided os/360 form cvols mvs added separate catalog structure vsam later ibm added third type catalog known icf catalog ibm removed support cvol vsam catalogs 2000 since y2k-compliant hence z/os icf catalogs supported 1974 ibm announced systems network architecture meant reduce cost running large networks terminals mainly using communications lines much efficiently available ibm virtual memory operating systems since mainframe software component vtam available operating systems 1977 ibm announced mvs/system extensions program product i.e cost extra money improved mvs performance descendants mvs still used latest descendants system/360 system/390 zseries renamed os/390 system/390 64-bit version zseries named z/os data taken ibm 360 operating systems release history system/370 market chronology products services", + "neighbors": [ + 64, + 78, + 134, + 142, + 292, + 322, + 387, + 412, + 735, + 754, + 870, + 912, + 941, + 961, + 1012, + 1053, + 1087, + 1138, + 1217, + 1546, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 143, + "label": 4, + "text": "Algae_DNA_barcoding:algae dna barcoding dna barcoding algae commonly used species identification phylogenetic studies algae form phylogenetically heterogeneous group meaning application single universal barcode/marker species delimitation unfeasible thus different markers/barcodes applied aim different algal groups diatom dna barcoding method taxonomical identification diatoms even species level conducted using dna rna followed amplification sequencing specific conserved regions diatom genome followed taxonomic assignment one main challenges identifying diatoms often collected mixture diatoms several species dna metabarcoding process identifying individual species mixed sample environmental dna also called edna dna extracted straight environment soil water samples newly applied method diatom dna metabarcoding used ecological quality assessment rivers streams specific response diatoms particular ecologic conditions species identification via morphology relatively difficult requires lot time expertise high-throughput sequencing hts dna metabarcoding enables taxonomic assignment therefore identification complete sample regarding group specific primers chosen previous dna amplification several dna markers already developed mainly targeting 18s rrna using v4 hypervariable region ribosomal small subunit dna ssu rdna dna-based identification found efficient classical morphology based approach conserved regions genomes frequently used marker genes ribulose-1-5-bisphosphate carboxylase rbcl cytochrome oxidase cox1 coi 28s shown repeatedly molecular data gained diatom edna metabarcoding quite faithfully reflect morphology-based biotic diatom indices therefore provide similar assessment ecosystem status meantime diatoms routinely used assessment ecological quality freshwater ecosystems together aquatic invertebrates considered best indicators disturbance related physical chemical biological conditions watercourses numerous studies using benthic diatoms biomonitoring ideal diatom dna barcode found proposed different markers used different purposes indeed highly variable cox1 28s genes considered suitable taxonomic studies conserved 18s rbcl genes seem appropriate biomonitoring applying dna barcoding concept diatoms promises great potential resolve problem inaccurate species identification thus facilitate analyses biodiversity environmental samples.. molecular methods based ngs technology almost always leads higher number identified taxa whose presence could subsequently verified light microscopy results study provides evidence edna barcoding diatoms suitable water quality assessment could complement improve traditional methods stoeck et al also showed edna barcoding provides insight diatom diversity protist communities therefore could used ecological projection global diversity studies showed different results example inventories obtained molecular-based method closer obtained morphology-based method abundant species focus dna metabarcoding also increase taxonomic resolution comparability across geographic regions often difficult using morphological characters moreover dna-based identification allows extending range potential bioindicators including inconspicuous taxonomic groups could highly sensitive tolerant particular stressors indirectly molecular methods also help filling gaps knowledge species ecology increasing number samples processed coupled decrease processing time cost-effectiveness well increasing accuracy precision correlation species/motus occurrence environmental factors currently consensus concerning methods dna preservation isolation choice dna barcodes pcr primers agreement concerning parameters motu clustering taxonomic assignment sampling molecular steps need standardize development studies one major limitation availability reference barcodes diatoms species.the reference database bioindicator taxa far complete despite constant efforts numerous national barcoding initiatives lot species still lacking barcode information furthermore existing metabarcoding data locally available geographically scattered hindering development globally useful tools visco et al estimated 30 european diatoms species currently represented reference databases example important lack number species fennoscandian communities especially acidophilic diatoms eunotia incisa also shown taxonomic identification dna barcoding accurate species level discriminate varieties example reference missing another well-known limitation barcoding taxonomic identification clustering method used taxonomic assignation often leads massive loss genetic information reliable way assess effects different clustering different taxonomic assignation processes would compare species list generated different pipelines using reference database yet done variety pipelines used molecular assessment diatom communities europe taxonomically validated databases includes accessible vouchers also crucial reliable taxa identification via ngs additionally primer bias often found major source variation barcoding pcr primers efficiency differ diatoms species i.e primers lead preferential amplification one taxon another inference abundance metabarcoding data considered one difficult issues environmental use number generated sequences hts directly correspond number specimen biomass different species produce different amount reads example due differences chloroplast size rbcl marker vasselon et al recently created biovolume correction factor using rbcl marker example achnanthidium minutissimum small biovolume thus generate less copies rbcl fragment located chloroplast larger species correction factor however requires extensive calibration species biovolume tested species far fluctuations gene copy number markers the18s marker seem species specific tested yet barcoding marker usually combine hypervariable regions genome allow distinction species conserved region insure specificity target organism several dna markers belonging nuclear mitochondrial chloroplast genomes rbcl coi its+5.8s ssu 18s\u2026 designed successfully used diatoms identification ngs 18s gene region widely used marker protist groups jahn et al first test 18s gene region diatoms barcoding zimmerman et al proposed 390\u2013410 bp long fragment 1800 bp long 18s rrna gene locus barcode marker analysis environmental samples hts discusses use limitations diatom identification fragment includes v4 subunit largest complex highly variable regions within 18s locus highlighted hypervariable region 18s gene great potential studying protist diversity large scale limited efficiency identification species level cryptic species rbcl gene used taxonomy studies trobajo et al 2009 benefits include rarely intragenomic variation easily aligned compared open-access reference library called r-syst :diatom includes data two barcodes 18s rbcl freely accessible website kermmarec et al also successfully used rbcl gene ecological assessment diatoms rbcl marker also easily aligned compared moniz kaczmarska investigated amplification success ssu coi its2 markers found 300 \u2013 400 bp its-2 5.8s fragment provided highest success rate amplification good species resolution marker subsequently used separate morphologically defined species success rate 99.5 despite amplification success zimmerman et al criticised use its-2 due intra-individual heterogeneity suggested ssu rbcl mann et al. 2010 markers less heterogenous individuals therefore beneficial distinguishing species diatoms routinely used part suite biomonitoring tools must monitored part european water framework directive diatoms used indicator ecosystem health freshwaters ubiquitous directly affected changes physico-chemical parameters show better relationship environmental variables taxa e.g invertebrates giving better overall picture water quality recent years researchers developed standardised tools metabarcoding sequencing diatoms complement traditional assessment using microscopy opening new avenue biomonitoring aquatic systems using benthic diatoms method next-generation sequencing approach river biomonitoring revealed good potential many studies shown metabarcoding hts high-throughput sequencing utilized estimate quality status diversity freshwaters part environment agency kelly et al developed dna-based metabarcoding approach assess diatom communities rivers uk vasselon et al compared morphological hts approaches diatoms found hts gave reliable indication quality status rivers terms specific polluosensitivity index spi vasselon et al also applied dna metabarcoding diatoms communities monitoring network rivers tropical island mayotte french dom-tom rimet et al also explored possibility using hts assessing diatom diversity showed diversity indices hts microscopic analysis well correlated although perfect dna barcoding metabarcoding used establish molecular metrics indices potentially provide conclusions broadly similar traditional approaches ecological environmental status aquatic ecosystems diatoms used diagnosis tool drowning forensic practices diatom test based principle diatom inhalation water lungs distribution deposition around body dna methods used confirm cause death indeed drowning locate origin drowning diatom dna metabarcoding provides opportunity quickly analyse diatom community present within body locate origin drowning investigate body may moved one place another diatom metabarcoding may help delimit cryptic species difficult identify using microscopy help complete reference databases comparing morphological assemblages metabarcoding data chlorophytes possess ancients taxonomically diverse lineage fang et al 2014 including terrestrial plants even though 14 000 species described based structural ultrastructural criteria hall et al 2010 morphological identification often limited several barcodes chlorophytes proposed dna-based identification order bypass problematics morphological one although cytochrome oxidase coi cox coding gene link standard barcode animals proved unsatisfactory chlorophytes gene contains several introns algae group turmel et al 2002 nuclear marker genes used chlorophytes ssu rdna lsu rdna rdna leliaert et al 2014 macroalgae challenging identify simple morphology phenotypic plasticity alternate lifecycle stages thus algal systematics identification come rely heavily genetic/molecular tools dna barcoding ssu rdna gene common used barcode phylogenetic studies macroalgae however ssu rdna highly conserved region typically lack resolution species identification past 2 decades certain standards dna barcoding aim species identification developed main groups macroalgae cytochrome c oxidase subuinit coi gene commonly used barcode red brown algae tufa plastid elongation factor rbcl rubisco large subunit internal transcribe spacer commonly used green algae barcodes typically 600-700 bp long barcodes typically differ 3 main groups macroalgae red green brown evolutionary heritage diverse macroalgae polyphyletic group meaning within group share recent common ancestor making challenging find gene conserved among variable enough species identification adapted detailed information dna barcoding different organisms found microbial dna barcoding dna barcoding fish dna barcoding dna barcoding diet assessment", + "neighbors": [ + 143 + ], + "mask": "Test" + }, + { + "node_id": 144, + "label": 4, + "text": "SQL_injection:sql injection sql injection code injection technique used attack data-driven applications malicious sql statements inserted entry field execution e.g dump database contents attacker sql injection must exploit security vulnerability application software example user input either incorrectly filtered string literal escape characters embedded sql statements user input strongly typed unexpectedly executed sql injection mostly known attack vector websites used attack type sql database sql injection attacks allow attackers spoof identity tamper existing data cause repudiation issues voiding transactions changing balances allow complete disclosure data system destroy data make otherwise unavailable become administrators database server 2012 study observed average web application received 4 attack campaigns per month retailers received twice many attacks industries first public discussions sql injection started appearing around 1998 example 1998 article phrack magazine sql injection sqli considered one top 10 web application vulnerabilities 2007 2010 open web application security project 2013 sqli rated number one attack owasp top ten four main sub-classes sql injection storm worm one representation compounded sqli classification represents state sqli respecting evolution 2010\u2014further refinement underway form injection occurs user input filtered escape characters passed sql statement results potential manipulation statements performed database end-user application following line code illustrates vulnerability sql code designed pull records specified username table users however username variable crafted specific way malicious user sql statement may code author intended example setting username variable using comments even block rest query three types sql comments three lines space end renders one following sql statements parent language code used authentication procedure example could used force selection every data field users rather one specific user name coder intended evaluation 1'= 1 always true following value username statement would cause deletion users table well selection data userinfo table essence revealing information every user using api allows multiple statements input renders final sql statement follows specified sql server implementations allow multiple statements executed one call way sql apis php codice_1 function allow security reasons prevents attackers injecting entirely separate queries n't stop modifying queries blind sql injection used web application vulnerable sql injection results injection visible attacker page vulnerability may one displays data display differently depending results logical statement injected legitimate sql statement called page type attack traditionally considered time-intensive new statement needed crafted bit recovered depending structure attack may consist many unsuccessful requests recent advancements allowed request recover multiple bits unsuccessful requests allowing consistent efficient extraction several tools automate attacks location vulnerability target information established one type blind sql injection forces database evaluate logical statement ordinary application screen example book review website uses query string determine book review display url codice_2 would cause server run query would populate review page data review id 5 stored table bookreviews query happens completely server user know names database table fields user know query string user sees url returns book review hacker load urls codice_3 codice_3 may result queries respectively original review loads 1=1 url blank error page returned 1=2 url returned page created alert user input invalid words caught input test script site likely vulnerable sql injection attack query likely passed successfully cases hacker may proceed query string designed reveal version number mysql running server codice_3 would show book review server running mysql 4 blank error page otherwise hacker continue use code within query strings glean information server another avenue attack discovered goals achieved second order sql injection occurs submitted values contain malicious commands stored rather executed immediately cases application may correctly encode sql statement store valid sql another part application without controls protect sql injection might execute stored sql statement attack requires knowledge submitted values later used automated web application security scanners would easily detect type sql injection may need manually instructed check evidence attempted sql injection well known attack easily prevented simple measures apparent sql injection attack talktalk 2015 bbc reported security experts stunned large company would vulnerable development platforms parameterized statements work parameters used sometimes called placeholders bind variables instead embedding user input statement placeholder store value given type arbitrary sql fragment hence sql injection would simply treated strange probably invalid parameter value many cases sql statement fixed parameter scalar table user input assigned bound parameter easily put using parameterized queries definitely prevent sql injection mainly means variables n't query strings would accept arbitrary sql inputs however parameters given types definitely necessary parameterized queries require developer define code therefore without parameterized queries anyone could put kind sql code field database erased parameters set username person would able put username without kind code using object-relational mapping libraries avoids need write sql code orm library effect generate parameterized sql statements object-oriented code straightforward though error-prone way prevent injections escape characters special meaning sql manual sql dbms explains characters special meaning allows creating comprehensive blacklist characters need translation instance every occurrence single quote codice_6 parameter must replaced two single quotes codice_7 form valid sql string literal example php usual escape parameters using function codice_8 sending sql query function prepends backslashes following characters codice_9 codice_10 codice_11 codice_12 codice_6 codice_14 codice_15 function normally used make data safe sending query mysql php similar functions database systems pg_escape_string postgresql function codice_16 works escaping characters used especially querying databases escaping functions php returns string backslashes characters need quoted database queries etc characters single quote double quote backslash nul null byte routinely passing escaped strings sql error prone easy forget escape given string creating transparent layer secure input reduce error-proneness entirely eliminate integer float boolean string parameters checked value valid representation given type strings must follow strict pattern date uuid alphanumeric etc checked match pattern limiting permissions database login used web application needed may help reduce effectiveness sql injection attacks exploit bugs web application example microsoft sql server database logon could restricted selecting system tables would limit exploits try insert javascript text columns database", + "neighbors": [ + 11, + 14, + 149, + 281, + 293, + 379, + 436, + 439, + 479, + 487, + 505, + 509, + 518, + 528, + 576, + 604, + 638, + 698, + 703, + 739, + 740, + 762, + 800, + 1039, + 1090, + 1101, + 1112, + 1144, + 1235, + 1246, + 1303, + 1325, + 1361, + 1368, + 1379, + 1472, + 1580, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 145, + "label": 3, + "text": "Turmoil_(1984_video_game):turmoil 1984 video game turmoil platform game released 1984 zx spectrum 1986 msx bug byte player takes control mechanic mick employed rich arabian sheikh sheikh refused pay mick work done mick decides steal collection expensive cars lieu payment must build cars collecting oil dripping oil tank oil also used offensive weapon pursuing arabian guards playing area consists number platforms ladders conveyor belts swinging ropes mick must negotiate first must collect oil must take tap dripping oil oil collected must taken garage mick empty drop time fill car car invisible initially built drop oil deposited first level car mini subsequent levels cars become sleek expensive also present level number enemies resembling arabs attack mick cause lose life unlike platform games main character jump must fall onto one springs present level bounce different platform arabs also make use ladders ropes springs reviews overwhelmingly positive crash gave game 90 crash smash spectrum called hit 3.5/5 dave nicholls spectrum said springs great idea crash called slick well executed program retrogaming website retro view despite commenting politically incorrect nature using arabs enemies claims comes pure fun-filled platforming speccy n't come much better turmoil 'it knockout 8-bit videogaming decided turmoil earned crash smash release opinion well deserved giving overall rating 93 game designed written david turner", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 146, + "label": 1, + "text": "Atlas_of_Australian_Birds:atlas australian birds atlas australian birds major ongoing database project initiated managed birdlife australia formerly royal australasian ornithologists union map distribution australia bird species birdlife australia not-for-profit bird research conservation organisation bird atlasses produced various countries islands around world australian project first cover entire continent volunteers collected data australian birds order establish database publish book atlas australian birds 1984 summarising findings second period fieldwork nearly 20 years later resulted publication second book new atlas australian birds 2002 however atlas ongoing project idea australian bird atlas based data collected volunteer observers atlassers first mooted 1972 daunting scale task however test feasibility pilot atlas carried southern coast new south wales march 1973 september 1974 168 volunteers covering area 13,600 square kilometres august 1974 16th international ornithological congress held canberra providing opportunity discussions ornithologists involved atlas schemes outside australia leading decision proceed recognised although fieldwork would carried volunteers funding project management required february 1976 raou received grant australian government enabling appointment full-time staff member whose first task search existing ornithological literature records suitable complementary historical atlas discussions 1976 produced decisions main atlas project would structured organised methodology kept simple atlassers used maps determine locate one degree grid square recorded species birds seen within date location species data recorded survey sheets later entered hand computer database fieldwork began 1 january 1977 ended five years later 31 december 1981 data received every single one-degree block australian continent tasmania adjacent islands 3000 atlassers completing 90,000 survey sheets producing 2.7 million records sightings 716 bird species course atlas fieldwork period chair raou atlas committee pauline reilly project manager margaret blakers 1984 book published results 1987 spin-off book atlas victorian birds published jointly raou victorian department conservation forests lands covering state victoria higher 10-minute resolution detail reporting rates seasonal variations 20 years commencement fieldwork first atlas 1997 birds australia began negotiations environment australia towards obtaining funding new atlas project 1998 grant natural heritage trust bushcare wetlands programs approved fieldwork began august 1998 continued since though four years funding cut-off well deadline book publication purposes late 2002 methodology based first atlas improved use gps receivers scannable survey sheets four-year period 7,000 atlassers completed 279,000 surveys producing 4.7 million records 772 bird species coverage greater first atlas since well australian continent major islands second atlas included records australia territorial waters external territories christmas island cocos keeling islands norfolk island first atlas results published book new atlas australian birds atlas ongoing phase accepting electronic survey forms via birdata website analysis atlas data published birdlife australia report series end five-year data collection first atlas beginning fieldwork second atlas little atlassing took place national level however since end cut-off period inclusion data second atlas book atlassing continued database contains complete dataset two hard-copy atlasses published much additional material gathered since birds australia claims atlas database one important environmental databases world stated aims atlas australian birds project success project prompted launch number similar projects one notable example banksia atlas distribution atlas banksia species greatly increased knowledge banksia species distributions habitat even resulted discovery two new species", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 147, + "label": 7, + "text": "Uptake_(business):uptake business uptake industrial artificial intelligence ai software company aims help companies digitally transform open purpose-built software built around foundation data science machine learning uptake \u2019 core products include asset performance management application fully managed platform uptake \u2019 industry-specific content including asset strategy library asl provides access deep domain knowledge guidance failure prevention asl largest market today approximately 800 equipment types 58,000 failure modes 180,000 reportable conditions uptake co-founded brad keywell eric lefkofsky chicago illinois 2014 uptake incorporated 2014 located chicago offices san francisco houston albuquerque riyadh mississauga march 2015 caterpillar announced minority investment uptake aim joint development systems monitor improve use nearly 3 million pieces caterpillar equipment field caterpillar \u2019 core business offerings completed mid 2016 september 21 2016 progress rail formed strategic partnership launching emd uptime uptake condition monitoring march 2 2017 warren buffett berkshire hathaway energy 84 billion portfolio companies primarily renewables space announced deal uptake two bhe subsidiaries bhe renewables midamerican energy company use uptake software connect track fleet wind turbines june 2018 uptake announced u.s. army would using software improve readiness dozen bradley fighting vehicles february 2018 uptake announced hire ganesh bell former chief digital officer general electric co ge.n president october 27 2015 uptake announced raised 45 million venture capital led greatpoint ventures existing investors including new enterprise associates caterpillar uptake \u2019 valuation estimated one billion dollars making third unicorn state illinois february 1 2017 investor revolution growth firm started steve case donn davis ted leonsis announced would backing uptake 40 million part series c round valued uptake 2 billion november 2017 uptake closed series round 117 million post-money valuation 2.3 billion brought uptake total funding 250 million uptake recipient 2015 moxie award best new startup chicago uptake named forbes hottest new startup 2015 february 9 2017 pitchbook named uptake fastest us startup reach 2b valuation cnbc ranked uptake disruptor 50 list two consecutive years 2017 2018 respectively uptake recognized 2017 technology pioneer world economic forum june 14 2017 uptake ranked 22 2017 forbes 100 list best private cloud companies world uptake ranked 12 fortune \u2019 2018 best places work chicago uptake founder brad keywell named ey world entrepreneur year 2019 marking record third win us competition \u2019 19-year history", + "neighbors": [ + 147 + ], + "mask": "Test" + }, + { + "node_id": 148, + "label": 2, + "text": "Active_Directory:active directory active directory ad directory service developed microsoft windows domain networks included windows server operating systems set processes services initially active directory charge centralized domain management starting windows server 2008 however active directory became umbrella title broad range directory-based identity-related services server running active directory domain service ad ds called domain controller authenticates authorizes users computers windows domain type network\u2014assigning enforcing security policies computers installing updating software example user logs computer part windows domain active directory checks submitted password determines whether user system administrator normal user also allows management storage information provides authentication authorization mechanisms establishes framework deploy related services certificate services active directory federation services lightweight directory services rights management services active directory uses lightweight directory access protocol ldap versions 2 3 microsoft version kerberos dns active directory like many information-technology efforts originated democratization design using request comments rfcs internet engineering task force ietf oversees rfc process accepted numerous rfcs initiated widespread participants active directory incorporates decades communication technologies overarching active directory concept makes improvements upon example ldap underpins active directory also x.500 directories organizational unit preceded active directory concept makes use methods ldap concept began emerge even founding microsoft april 1975 rfcs early 1971 rfcs contributing ldap include rfc 1823 ldap api august 1995 rfc 2307 rfc 3062 rfc 4533 microsoft previewed active directory 1999 released first windows 2000 server edition revised extend functionality improve administration windows server 2003 additional improvements came subsequent versions windows server windows server 2008 additional services added active directory active directory federation services part directory charge management domains previously core part operating system renamed active directory domain services adds became server role like others active directory became umbrella title broader range directory-based services according bryon hynes everything related identity brought active directory banner active directory services consist multiple directory services best known active directory domain services commonly abbreviated ad ds simply ad active directory domain services ad ds cornerstone every windows domain network stores information members domain including devices users verifies credentials defines access rights server running service called domain controller domain controller contacted user logs device accesses another device across network runs line-of-business metro-style app sideloaded device active directory services excluding lds described well microsoft server technologies rely use domain services examples include group policy encrypting file system bitlocker domain name services remote desktop services exchange server sharepoint server active directory lightweight directory services ad lds formerly known active directory application mode adam light-weight implementation ad ds ad lds runs service windows server ad lds shares code base ad ds provides functionality including identical api require creation domains domain controllers provides data store storage directory data directory service ldap directory service interface unlike ad ds however multiple ad lds instances run server active directory certificate services ad cs establishes on-premises public key infrastructure create validate revoke public key certificates internal uses organization certificates used encrypt files used encrypting file system emails per s/mime standard network traffic used virtual private networks transport layer security protocol ipsec protocol ad cs predates windows server 2008 name simply certificate services ad cs requires ad ds infrastructure active directory federation services ad fs single sign-on service ad fs infrastructure place users may use several web-based services e.g internet forum blog online shopping webmail network resources using one set credentials stored central location opposed granted dedicated set credentials service ad fs purpose extension ad ds latter enables users authenticate use devices part network using one set credentials former enables use set credentials different network name suggests ad fs works based concept federated identity ad fs requires ad ds infrastructure although federation partner may active directory rights management services ad rms known rights management services rms windows server 2008 server software information rights management shipped windows server uses encryption form selective functionality denial limiting access documents corporate e-mails microsoft word documents web pages operations authorized users perform directory service active directory instance consists database corresponding executable code responsible servicing requests maintaining database executable part known directory system agent collection windows services processes run windows 2000 later objects active directory databases accessed via ldap adsi component object model interface messaging api security accounts manager services active directory structures arrangements information objects objects fall two broad categories resources e.g. printers security principals user computer accounts groups security principals assigned unique security identifiers sids object represents single entity\u2014whether user computer printer group\u2014and attributes certain objects contain objects object uniquely identified name set attributes\u2014the characteristics information object represents\u2014 defined schema also determines kinds objects stored active directory schema object lets administrators extend modify schema necessary however schema object integral definition active directory objects deactivating changing objects fundamentally change disrupt deployment schema changes automatically propagate throughout system created object deactivated\u2014not deleted changing schema usually requires planning active directory framework holds objects viewed number levels forest tree domain logical divisions active directory network within deployment objects grouped domains objects single domain stored single database replicated domains identified dns name structure namespace domain defined logical group network objects computers users devices share active directory database tree collection one domains domain trees contiguous namespace linked transitive trust hierarchy top structure forest forest collection trees share common global catalog directory schema logical structure directory configuration forest represents security boundary within users computers groups objects accessible objects held within domain grouped organizational units ous ous provide hierarchy domain ease administration resemble organization structure managerial geographical terms ous contain ous\u2014domains containers sense microsoft recommends using ous rather domains structure simplify implementation policies administration ou recommended level apply group policies active directory objects formally named group policy objects gpos although policies also applied domains sites see ou level administrative powers commonly delegated delegation performed individual objects attributes well organizational units separate namespace consequence compatibility legacy netbios implementations user accounts identical samaccountname allowed within domain even accounts objects separate ous samaccountname user object attribute must unique within domain.. however two users different ous common name cn name stored directory fred.staff-ou.domain fred.student-ou.domain staff-ou student-ou ous general reason lack allowance duplicate names hierarchical directory placement microsoft primarily relies principles netbios flat-file method network object management microsoft software goes way back windows nt 3.1 ms-dos lan manager allowing duplication object names directory completely removing use netbios names would prevent backward compatibility legacy software equipment however disallowing duplicate object names way violation ldap rfcs active directory supposedly based number users domain increases conventions first initial middle initial last name western order reverse eastern order fail common family names like li \u674e smith garcia workarounds include adding digit end username alternatives include creating separate id system unique employee/student id numbers use account names place actual user names allowing users nominate preferred word sequence within acceptable use policy duplicate usernames exist within domain account name generation poses significant challenge large organizations easily subdivided separate domains students public school system university must able use computer across network microsoft active directory ous confer access permissions objects placed within ous automatically assigned access privileges based containing ou design limitation specific active directory competing directories novell nds able assign access privileges object placement within ou active directory requires separate step administrator assign object ou member group also within ou relying ou location alone determine access permissions unreliable object may assigned group object ou common workaround active directory administrator write custom powershell visual basic script automatically create maintain user group ou directory scripts run periodically update group match ou account membership unable instantly update security groups anytime directory changes occurs competing directories security directly implemented directory groups known shadow groups created shadow groups selectable place ou administrative tools microsoft refers shadow groups server 2008 reference documentation explain create built-in server methods console snap-ins managing shadow groups division organization information infrastructure hierarchy one domains top-level ous key decision common models business unit geographical location service object type hybrids ous structured primarily facilitate administrative delegation secondarily facilitate group policy application although ous form administrative boundary true security boundary forest administrator domain forest must trusted across domains forest active directory database organized partitions holding specific object types following specific replication pattern microsoft often refers partitions 'naming contexts 'schema partition contains definition object classes attributes within forest 'configuration partition contains information physical structure configuration forest site topology replicate domains forest 'domain partition holds objects created domain replicates within domain sites physical rather logical groupings defined one ip subnets ad also holds definitions connections distinguishing low-speed e.g. wan vpn high-speed e.g. lan links site definitions independent domain ou structure common across forest sites used control network traffic generated replication also refer clients nearest domain controllers dcs microsoft exchange server 2007 uses site topology mail routing policies also defined site level physically active directory information held one peer domain controllers replacing nt pdc/bdc model dc copy active directory servers joined active directory domain controllers called member servers subset objects domain partition replicate domain controllers configured global catalogs global catalog gc servers provide global listing objects forest global catalog servers replicate objects domains hence provide global listing objects forest however minimize replication traffic keep gc database small selected attributes object replicated called partial attribute set pas pas modified modifying schema marking attributes replication gc earlier versions windows used netbios communicate active directory fully integrated dns requires tcp/ip\u2014dns fully functional dns server must support srv resource records also known service records active directory synchronizes changes using multi-master replication replication default 'pull rather 'push meaning replicas pull changes server change effected knowledge consistency checker kcc creates replication topology site links using defined sites manage traffic intrasite replication frequent automatic result change notification triggers peers begin pull replication cycle intersite replication intervals typically less frequent use change notification default although configurable made identical intrasite replication link 'cost e.g. ds3 t1 isdn etc kcc alters site link topology accordingly replication may occur transitively several site links same-protocol site link bridges cost low although kcc automatically costs direct site-to-site link lower transitive connections site-to-site replication configured occur bridgehead server site replicates changes dcs within site replication active directory zones automatically configured dns activated domain based site replication active directory uses remote procedure calls rpc ip rpc/ip sites smtp used replication changes schema configuration partial attribute set global catalog gcs smtp used replicating default domain partition general network utilizing active directory one licensed windows server computer backup restore active directory possible network single domain controller microsoft recommends one domain controller provide automatic failover protection directory domain controllers also ideally single-purpose directory operations run software role certain microsoft products sql server exchange interfere operation domain controller necessitating isolation products additional windows servers combining make configuration troubleshooting either domain controller installed software difficult business intending implement active directory therefore recommended purchase number windows server licenses provide least two separate domain controllers optionally additional domain controllers performance redundancy separate file server separate exchange server separate sql server forth support various server roles physical hardware costs many separate servers reduced use virtualization although proper failover protection microsoft recommends running multiple virtualized domain controllers physical hardware active-directory database directory store windows 2000 server uses jet blue-based extensible storage engine ese98 limited 16 terabytes 2 billion objects 1 billion security principals domain controller database microsoft created ntds databases 2 billion objects nt4 security account manager could support 40,000 objects called ntds.dit two main tables data table link table windows server 2003 added third main table security descriptor single instancing programs may access features active directory via com interfaces provided active directory service interfaces allow users one domain access resources another active directory uses trusts trusts inside forest automatically created domains created forest sets default boundaries trust implicit transitive trust automatic domains within forest microsoft active directory management tools include management tools may provide enough functionality efficient workflow large environments third-party solutions extend administration management capabilities provide essential features convenient administration processes automation reports integration services etc varying levels interoperability active directory achieved unix-like operating systems including unix linux mac os x java unix-based programs standards-compliant ldap clients systems usually interpret many attributes associated windows components group policy support one-way trusts third parties offer active directory integration unix-like platforms including schema additions shipped windows server 2003 r2 include attributes map closely enough rfc 2307 generally usable reference implementation rfc 2307 nss_ldap pam_ldap provided padl.com support attributes directly default schema group membership complies rfc 2307bis proposed windows server 2003 r2 includes microsoft management console snap-in creates edits attributes alternative option use another directory service non-windows clients authenticate windows clients authenticate ad non-windows clients include 389 directory server formerly fedora directory server fds viewds identity solutions viewds v7.2 xml enabled directory sun microsystems sun java system directory server latter two able perform two-way synchronization ad thus provide deflected integration another option use openldap translucent overlay extend entries remote ldap server additional attributes stored local database clients pointed local database see entries containing remote local attributes remote database remains completely untouched administration querying modifying monitoring active directory achieved via many scripting languages including powershell vbscript jscript/javascript perl python ruby free non-free ad administration tools help simplify possibly automate ad management tasks since october 2017 amazon aws offers integration microsoft active directory", + "neighbors": [ + 26, + 66, + 79, + 88, + 93, + 108, + 111, + 134, + 153, + 262, + 267, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 425, + 429, + 433, + 435, + 485, + 509, + 521, + 548, + 558, + 574, + 615, + 638, + 647, + 662, + 689, + 705, + 712, + 762, + 763, + 771, + 791, + 801, + 813, + 864, + 865, + 920, + 930, + 961, + 989, + 1019, + 1025, + 1035, + 1039, + 1092, + 1098, + 1109, + 1138, + 1151, + 1193, + 1212, + 1225, + 1227, + 1247, + 1261, + 1287, + 1304, + 1311, + 1328, + 1338, + 1346, + 1348, + 1363, + 1370, + 1393, + 1395, + 1417, + 1461, + 1506, + 1531, + 1533, + 1534, + 1545, + 1547, + 1555, + 1561, + 1582, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 149, + "label": 4, + "text": "Network_security:network security network security consists policies practices adopted prevent monitor unauthorized access misuse modification denial computer network network-accessible resources network security involves authorization access data network controlled network administrator users choose assigned id password authenticating information allows access information programs within authority network security covers variety computer networks public private used everyday jobs conducting transactions communications among businesses government agencies individuals networks private within company others might open public access network security involved organizations enterprises types institutions title explains secures network well protecting overseeing operations done common simple way protecting network resource assigning unique name corresponding password network security starts authentication commonly username password since requires one detail authenticating user name\u2014i.e. password\u2014this sometimes termed one-factor authentication two-factor authentication something user 'has also used e.g. security token 'dongle atm card mobile phone three-factor authentication something user 'is also used e.g. fingerprint retinal scan authenticated firewall enforces access policies services allowed accessed network users though effective prevent unauthorized access component may fail check potentially harmful content computer worms trojans transmitted network anti-virus software intrusion prevention system ips help detect inhibit action malware anomaly-based intrusion detection system may also monitor network like wireshark traffic may logged audit purposes later high-level analysis newer systems combining unsupervised machine learning full network traffic analysis detect active network attackers malicious insiders targeted external attackers compromised user machine account communication two hosts using network may encrypted maintain privacy honeypots essentially decoy network-accessible resources may deployed network surveillance early-warning tools honeypots normally accessed legitimate purposes techniques used attackers attempt compromise decoy resources studied attack keep eye new exploitation techniques analysis may used tighten security actual network protected honeypot honeypot also direct attacker attention away legitimate servers honeypot encourages attackers spend time energy decoy server distracting attention data real server similar honeypot honeynet network set intentional vulnerabilities purpose also invite attacks attacker methods studied information used increase network security honeynet typically contains one honeypots security management networks different kinds situations home small office may require basic security large businesses may require high-maintenance advanced software hardware prevent malicious attacks hacking spamming order minimize susceptibility malicious attacks external threats network corporations often employ tools carry network security verifications networks subject attacks malicious sources attacks two categories passive network intruder intercepts data traveling network active intruder initiates commands disrupt network normal operation conduct reconnaissance lateral movement find gain access assets available via network types attacks include", + "neighbors": [ + 11, + 90, + 123, + 144, + 190, + 225, + 227, + 267, + 282, + 293, + 310, + 317, + 338, + 343, + 346, + 363, + 364, + 379, + 405, + 429, + 439, + 440, + 450, + 479, + 487, + 490, + 518, + 528, + 531, + 564, + 566, + 576, + 598, + 608, + 624, + 666, + 692, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 818, + 834, + 849, + 856, + 898, + 993, + 1039, + 1090, + 1112, + 1138, + 1159, + 1162, + 1238, + 1239, + 1250, + 1291, + 1303, + 1309, + 1324, + 1325, + 1338, + 1355, + 1358, + 1361, + 1365, + 1368, + 1372, + 1379, + 1398, + 1433, + 1444, + 1467, + 1472, + 1543, + 1549, + 1554, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 150, + "label": 4, + "text": "@MAX_SyncUp:max syncup max syncup free proprietary backup file synchronization program developed max software windows targeted individuals small businesses software supports backup locally writable folders including attached usb devices network drives local directories also supports backup synchronization webdav servers ftp servers cloud storages google drive dropbox users allowed use free edition program personal non-commercial purposes free edition allows using 1 fully functional backup synchronization profile unlimited time pro-version max syncup restrictions use provides fully functional 30-day trial period users may use max syncup free evaluation purposes max syncup allows users create backup copies files recover data backup copies including recovering old versions files changed files destroyed also allows users synchronize files two separate locations directions schedule backups synchronizations starting version 4.0 max syncup executes synchronization using rsync-like synchronization method due method users set direct synchronization two computers internet without cloud storage rsync-like algorithm detects changes synchronized files transfers parts files changed since previous synchronization minimizes network traffic reduces time required synchronize files especially synchronize large files small changes also max syncup provides backup strategy apple time machine style hard links created unchanged files uncompressed backups files created file structure retained hard links allow saving disk space placing file several folders users manage backups thinning old backups keep recent copies rather older ones version 4.2 measured \u201c really full featured software backup \u201d software comes even close max syncup crashplan reviewers complimented max syncup ease use customizability pc advisor expert review stating walks fine line power ease use well however reviewers criticised program lack cloud backup options limited google drive free storage pc advisor gave program 3.5 stars 5 max syncup 3.0", + "neighbors": [ + 278, + 494, + 611, + 772, + 961, + 1138, + 1289 + ], + "mask": "Validation" + }, + { + "node_id": 151, + "label": 3, + "text": "Hunchback_(video_game):hunchback video game hunchback arcade game developed century electronics published 1983 game loosely based victor hugo novel hunchback notre dame player controls quasimodo set top castle wall player must guide hunchback left right avoiding obstacles series non-scrolling screens goal screen ring church bell far right obstacles include pits must swung long rope ramparts must jumped contain knights spears flying fireballs arrows ducked jumped impose time limit screen knight climbs wall costing player life reach top eventually completing number screens player must rescue esmeralda final screen completed game begins faster speed hunchback character originally robin hood hence green costume game stages arrows artist drew robin hood character left company decision change theme hunchback time new artist taken green costume become accepted no-one questioned someone commented robin hood character drawn looked like hunchback ports released 1984 ocean software acorn electron amstrad cpc atari 8-bit family commodore 64 vic-20 dragon 32 oric zx spectrum ocean first arcade port spectrum version game reached number one uk sales charts version released superior software bbc micro 1984 originally unofficial clone ocean acquired home computer rights game reached agreement ocean could release acorn electron conversion developed superior continued sell bbc micro version released versions play sam 6 compilation 1988 msx port published 1985 home ports inspired two sequels hunchback ii quasimodo revenge hunchback adventure released ocean zx spectrum commodore 64 clones released 8-bit computers quasimodo 1983 synapse software atari 8-bit family great wall 1986 artic computing acorn electron bbc micro", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 152, + "label": 9, + "text": "Comparison_of_programming_languages_(syntax):comparison programming languages syntax comparison programming languages compares features language syntax format 50 computer programming languages programming language expressions broadly classified four syntax structures programming language statements typically conventions statement separator used demarcate boundaries two separate statements statement terminator used demarcate end individual statement languages interpret end line end statement called line-oriented languages line continuation convention line-oriented languages newline character could potentially misinterpreted statement terminator languages allows single statement span one line line continuation generally done part lexical analysis newline normally results token added token stream unless line continuation detected import library way read external possibly compiled routines programs packages imports classified level module package class procedure ... syntax directive name attributes ... statements also classified whether syntactic convenience allowing things referred shorter name still referred fully qualified name without import whether actually required access code without impossible access code even fully qualified names block notation group two statements expressions units code related way comprise whole comments classified inline comments generally use newline character indicate end comment arbitrary delimiter sequence tokens indicate beginning comment examples block comments generally use delimiter indicate beginning comment another delimiter indicate end comment context whitespace newline characters counted delimiters examples abap supports two different kinds comments first character line including indentation asterisk codice_6 whole line considered comment single double quote codice_210 begins in-line commet acts end line abap comments possible statements codice_211 codice_212 native sql usages characters sql dialects double dash codice_213 used instead wide variety syntax styles declaring comments source code codice_214 italics used indicate block comment style codice_215 italics used indicate inline comment style", + "neighbors": [ + 19, + 65, + 78, + 117, + 216, + 249, + 306, + 308, + 373, + 392, + 509, + 538, + 544, + 567, + 579, + 594, + 597, + 682, + 690, + 790, + 799, + 825, + 836, + 873, + 919, + 1028, + 1034, + 1120, + 1152, + 1217, + 1221, + 1225, + 1227, + 1233, + 1235, + 1264, + 1311, + 1388, + 1390, + 1418, + 1430, + 1477, + 1508 + ], + "mask": "Validation" + }, + { + "node_id": 153, + "label": 2, + "text": "COM_Structured_Storage:com structured storage com structured storage variously also known com structured storage ole structured storage technology developed microsoft part windows operating system storing hierarchical data within single file strictly speaking term structured storage refers set com interfaces conforming implementation must provide specific implementation specific file format fact structured storage implementation need store data file addition providing hierarchical structure data structured storage may also provide limited form transactional support data access microsoft provides implementation supports transactions well one called simple-mode storage latter implementation limited ways well although performs better structured storage widely used microsoft office applications although newer releases starting office 2007 use xml-based office open xml default also important part com related object linking embedding ole technologies notable applications structured storage include sql server windows shell many third-party cad programs structured storage addresses inherent difficulties storing multiple data objects within single file one difficulty arises object persisted file changes size due update application reading/writing file expects objects file remain certain order everything following object representation file may need shifted backward make room object grows forward fill space left object shrinks file large could result costly operation course many possible solutions difficulty often application programmer want deal low level details binary file formats structured storage provides abstraction known stream represented interface codice_1 stream conceptually similar file codice_1 interface provides methods reading writing similar file input/output stream could reside memory within file within another stream etc. depending implementation another important abstraction storage represented interface codice_3 storage conceptually similar directory file system storages contain streams well storages application wishes persist several data objects file one way would open codice_3 represents contents file save objects within single codice_1 one way accomplish latter standard com interface codice_6 ole depends heavily model embed objects within documents microsoft implementation uses file format known compound files widely deployed structured storage implementations read write format compound files use fat-like structure represent storages streams chunks file known sectors may may correspond sectors underlying file system allocated needed add new streams increase size existing streams streams deleted shrink leaving unallocated sectors sectors reused new streams following applications use ole structured storage compound document format beta testing phase windows 2000 included feature titled native structured storage nss storage structured storage documents like binary microsoft office formats codice_7 file windows explorer uses cache thumbnails stream makes document stored separate ntfs data stream included utilities automatically split streams regular structured storage document ntfs data streams vice versa however feature withdrawn beta 3 due incompatibilities os components nss files automatically converted single data stream format", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 365, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 154, + "label": 9, + "text": "Query_language:query language query languages data query languages dqls computer languages used make queries databases information systems broadly query languages classified according whether database query languages information retrieval query languages difference database query language attempts give factual answers factual questions information retrieval query language attempts find documents containing information relevant area inquiry examples include", + "neighbors": [ + 18, + 154, + 429, + 521, + 592, + 804, + 834, + 874, + 903, + 1232, + 1246, + 1324, + 1606 + ], + "mask": "Test" + }, + { + "node_id": 155, + "label": 3, + "text": "Rollerball_(video_game):rollerball video game pinball machine rendered rollerball composed four screens proportion would long two standard pinball tables real table graphics two four screens based various aspects new york city skyline topmost screen hereafter called bonus screen merely shows clouds blimp second screen main screen shows top empire state building third screen intermediate shows lower skyline statue liberty lowest final screen shows blue backdrop representing ocean main mode player launches ball directly main screen top small loop marked slot player sends ball loop slot machine display center screen cycles various penalties rewards given one three symbols eggplant pair cherries bell appears three times center slot loop open allowing player enter bonus screen pair kickback holes upper left main screen bumper proximity upper one lower one shoot ball straight relying curvature wall direct upper hole player lucky ball falls upper hole one two things happen kickback slot bonus screen empty ball transferred slot another ball released plunger enter play kickback slot already filled ball relaunched lower hole intermediate screen viable way returning main screen kickback hole upper left screen initially fires main screen entered switches directions every time used player gets three cherries main screen slot hole always shoot ball upwards otherwise chances score screen desirable place ball three sets three drop targets set three slots game begins light letter lit first slot one set three drop targets chosen marked flashing green light additionally bonus tally screen begins 3,000 points completing set drop targets increases bonus tally sending ball slot light lit one move light flipping flippers adds current tally player score lower screen however least desirable place ball officially drained screen however options still available player bonus screen player must shoot ball seven sensors letters phrase sky high written random forced order player must shoot ball flashing letter light activate passing non-flashing already activated letters effect done ball placed kickback hole top screen letters turn bumpers must hit numerous times remove start bonus game successfully finishing bonus gives player large sum points well extra ball first time completed increase bonus multiplier completion two sets four targets similar drop targets top corners bonus screen activated upper left targets labeled raise saver place stopper gap left wall left flipper apparatus upper right targets labeled open gate open kickback slot lower right corner locking ball kickback slot send ball play part two-ball multiball event bonus game enabled slot opened ball already locked locked ball kick entering ball back play ball passes flippers lower screen either side flippers drained end-of-ball bonus calculated tally current bonus kept gameplay shown lower screen bonus starts 1,000 points increased intervals 1,000 points play upon draining ball bonus counted 0 points added player score represent increase bonus multiplier count repeated bonus multiplier increased finishing bonus game receiving three cherries three bells main screen slot machine game ends three balls addition extra balls bonus screen drained typical final score around 300,000 points scoring 1,000,000 points enables credits final ball drained alternate mode two-player game called match play mode much smaller table one screen tall houses number buttons switches lower score player side various amounts four sensors middle table switch scores two players whenever become lit slot machine spun buttons outer walls bonus enacted hitting button top wall first player lose points loses two animals middle player area show emotion ecstasy sadness neutral indifference depending player score score margin two players japanese version left player animal elephant right player giraffe english version giraffe changed donkey likely reference republican democratic u.s. political parties", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 156, + "label": 3, + "text": "Stardust_(1987_video_game):stardust 1987 video game stardust top-scrolling shoot 'em developed spanish studio topo soft released uk kixx 1987 zx spectrum full version included sinclair user covertape 1991 also released amstrad cpc dos msx title screen included music composed pablo toledo music later re-used game bronx player controls small space ship called astrohunter flies surface series large enemy supercruisers way attack earth player must avoid destroy various ground targets free-flying drones order eventually reach array shield generators ship equipped gun improved collecting power-ups second weapon targets objects ground supercruisers passed astrohunter lands enemy starship pilot continues foot reach shield generators destroying generators pilot must returned ship escape", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 157, + "label": 7, + "text": "FreshBooks:freshbooks freshbooks accounting software package developed marketed 2ndsite inc. freshbooks products geared mainly toward small medium-sized businesses offer cloud-based accounting applications send invoices clients bill time expertise company founded 2003 based toronto ontario canada company founded 2003 mike mcderment joe sawada mcderment previous internet marketing consulting business anicon company traces origins mcderment inadvertently losing invoice record overwriting 2003 sought new way manage accounting business product first eponymously named 2ndsite synonymous company company rebranded product 2006 freshbooks based toronto ontario canada freshbooks customers 160 countries july 23 2014 company announced raised 30 million usd first round institutional venture capital 2016 company unveiling new interface improved functionality load times app freshbooks offers subscription-based product includes invoicing accounts payable expense tracking time tracking retainers fixed asset depreciation purchase orders payroll integrations double-entry accounting industry-standard business management reporting financial data stored cloud single unified ledger allowing users access set books regardless location desktop mobile offers free api enables customers 3rd-party software vendors integrate external applications freshbooks freshbooks also supports multiple tax rates currencies also incorporates payroll feature projects feature freshbooks headquarters toronto canada operations north america europe australia founder mike mcderment chief executive officer company since inception 2003 2014 freshbooks raised series venture investment 30 million led venture capital firm oak investment partners participation georgian partners atlas venture 2017 company announced raised another 43 million funding accomplice georgian partners oak investment partners", + "neighbors": [ + 77, + 124, + 259, + 1476 + ], + "mask": "Test" + }, + { + "node_id": 158, + "label": 4, + "text": "Lazy_FP_state_restore:lazy fp state restore lazy fpu state leak also referred lazy fp state restore lazyfp security vulnerability affecting intel core cpus vulnerability caused combination flaws speculative execution technology present within affected cpus certain operating systems handle context switching floating point unit fpu exploiting vulnerability local process leak content fpu registers belong another process vulnerability related spectre meltdown vulnerabilities publicly disclosed january 2018 announced intel 13 june 2018 discovered employees amazon cyberus technology sysgo besides used floating point arithmetic fpu registers also used purposes including storing cryptographic data using aes instruction set present many intel cpus means vulnerability may allow key material compromised floating point simd registers large used every task thread system make context switching faster common microprocessors support lazy state switching rather storing full state context switch operating system simply mark fpu available hopes switched-to task need operating system guessed correctly time saved guess wrong first fpu simd instruction cause trap operating system save state previous task load correct state current task out-of-order cpus fpu available condition detected immediately fact almost detected immediately may multiple fault-causing instructions executing simultaneously processor must take first fault encountered preserve illusion in-order execution information first available in-order retire stage processor speculatively executes instruction using previous task register contents following instructions later detects fpu available condition although architectural state reverted beginning faulting instruction possible use part fpu state address memory load triggering load processor cache exploitation follows pattern spectre-family vulnerabilities cache state architectural state cache affect speed correctness cache load undone address including part previous task register state later detected measuring time taken access different memory addresses possible exploit bug without actually triggering operating system traps placing fpu access shadow forced branch misprediction e.g using retpoline processor still speculatively execute code rewind mispredicted branch never actually execute operating system trap allows attack rapidly repeated quickly reading entire fpu simd register state possible mitigate vulnerability operating system hypervisor levels always restoring fpu state switching process contexts fix firmware upgrade required operating systems already lazily restore fpu registers default protecting operating systems affected hardware platforms even underlying hardware issue existed linux operating system using kernel 3.7 higher possible force kernel eagerly restore fpu registers using codice_1 kernel parameter also many system software vendors projects including linux distributions openbsd xen released patches address vulnerability", + "neighbors": [ + 43, + 91, + 141, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 379, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 633, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 980, + 1043, + 1063, + 1162, + 1186, + 1256, + 1270, + 1327, + 1332, + 1336, + 1342, + 1351, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 159, + "label": 0, + "text": "N-gram:n-gram fields computational linguistics probability n -gram contiguous sequence n items given sample text speech items phonemes syllables letters words base pairs according application n -grams typically collected text speech corpus items words -grams may also called shingles using latin numerical prefixes n -gram size 1 referred unigram size 2 bigram less commonly digram size 3 trigram english cardinal numbers sometimes used e.g. four-gram five-gram computational biology polymer oligomer known size called k -mer instead n -gram specific names using greek numerical prefixes monomer dimer trimer tetramer pentamer etc. english cardinal numbers one-mer two-mer three-mer etc n -gram model type probabilistic language model predicting next item sequence form n \u2212 1 \u2013order markov model n -gram models widely used probability communication theory computational linguistics instance statistical natural language processing computational biology instance biological sequence analysis data compression two benefits n -gram models algorithms use simplicity scalability \u2013 larger n model store context well-understood space\u2013time tradeoff enabling small experiments scale efficiently figure 1 shows several example sequences corresponding 1-gram 2-gram 3-gram sequences examples word-level 3-grams 4-grams counts number times appeared google n -gram corpus 3-grams 4-grams n -gram model models sequences notably natural languages using statistical properties n -grams idea traced experiment claude shannon work information theory shannon posed question given sequence letters example sequence ex likelihood next letter training data one derive probability distribution next letter given history size formula_1 0.4 b 0.00001 c 0 ... probabilities possible next-letters sum 1.0 concisely n -gram model predicts formula_2 based formula_3 probability terms formula_4 used language modeling independence assumptions made word depends last n \u2212 1 words markov model used approximation true underlying language assumption important massively simplifies problem estimating language model data addition open nature language common group words unknown language model together note simple n -gram language model probability word conditioned number previous words one word bigram model two words trigram model etc described following categorical distribution often imprecisely called multinomial distribution practice probability distributions smoothed assigning non-zero probabilities unseen words n -grams see smoothing techniques n -gram models widely used statistical natural language processing speech recognition phonemes sequences phonemes modeled using n -gram distribution parsing words modeled n -gram composed n words language identification sequences characters/graphemes e.g letters alphabet modeled different languages sequences characters 3-grams sometimes referred trigrams generated good morning goo ood od mo mor forth counting space character gram sometimes beginning end text modeled explicitly adding \u2060_g _go ng_ g_ \u2060_ sequences words trigrams shingles generated dog smelled like skunk dog dog smelled dog smelled like smelled like like skunk skunk practitioners interested multiple word terms might preprocess strings remove spaces many simply collapse whitespace single space preserving paragraph marks whitespace frequently either element writing style introduces layout presentation required prediction deduction methodology punctuation also commonly reduced removed preprocessing frequently used trigger functionality n -grams also used sequences words almost type data example used extracting features clustering large sets satellite earth images determining part earth particular image came also successful first pass genetic sequence search identification species short sequences dna originated n -gram models often criticized lack explicit representation long range dependency explicit dependency range n \u2212 1 tokens n -gram model since natural languages incorporate many cases unbounded dependencies wh-movement means n -gram model principle distinguish unbounded dependencies noise since long range correlations drop exponentially distance markov model reason n -gram models made much impact linguistic theory part explicit goal model dependencies another criticism made markov models language including n -gram models explicitly capture performance/competence distinction n -gram models designed model linguistic knowledge make claims even potentially complete models linguistic knowledge instead used practical applications practice n -gram models shown extremely effective modeling language data core component modern statistical language applications modern applications rely n -gram based models machine translation applications rely exclusively models instead typically also incorporate bayesian inference modern statistical models typically made two parts prior distribution describing inherent likelihood possible result likelihood function used assess compatibility possible result observed data language model used used part prior distribution e.g gauge inherent goodness possible translation even often component distribution handcrafted features various sorts also used example variables represent position word sentence general topic discourse addition features based structure potential result syntactic considerations often used features also used part likelihood function makes use observed data conventional linguistic theory incorporated features although practice rare features specific generative particular theories grammar incorporated computational linguists tend agnostic towards individual theories grammar issue using n-gram language models out-of-vocabulary oov words encountered computational linguistics natural language processing input includes words present system dictionary database preparation default language model estimated entire observed vocabulary used cases may necessary estimate language model specific fixed vocabulary scenario n-grams corpus contain out-of-vocabulary word ignored n-gram probabilities smoothed words vocabulary even observed nonetheless essential cases explicitly model probability out-of-vocabulary words introducing special token e.g unk vocabulary out-of-vocabulary words corpus effectively replaced special unk token n-grams counts cumulated option possible estimate transition probabilities n-grams involving out-of-vocabulary words n -grams also used efficient approximate matching converting sequence items set n -grams embedded vector space thus allowing sequence compared sequences efficient manner example convert strings letters english alphabet single character 3-grams get formula_5-dimensional space first dimension measures number occurrences aaa second aab forth possible combinations three letters using representation lose information string example strings abc bca give rise exactly 2-gram bc although ab bc clearly bc ca however know empirically two strings real text similar vector representation measured cosine distance likely similar metrics also applied vectors n -grams varying sometimes better results example z-scores used compare documents examining many standard deviations n -gram differs mean occurrence large collection text corpus documents form background vector event small counts g-score also known g-test may give better results comparing alternative models also possible take principled approach statistics n -grams modeling similarity likelihood two strings came source directly terms problem bayesian inference n -gram-based searching also used plagiarism detection n -grams find use several areas computer science computational linguistics applied mathematics used choose value n n -gram model necessary find right trade stability estimate appropriateness means trigram i.e triplets words common choice large training corpora millions words whereas bigram often used smaller ones problems balance weight infrequent grams example proper name appeared training data frequent grams also items seen training data given probability 0.0 without smoothing unseen plausible data sample one introduce pseudocounts pseudocounts generally motivated bayesian grounds practice necessary smooth probability distributions also assigning non-zero probabilities unseen words n -grams reason models derived directly n -gram frequency counts severe problems confronted n -grams explicitly seen \u2013 zero-frequency problem various smoothing methods used simple add-one laplace smoothing assign count 1 unseen n -grams see rule succession sophisticated models good\u2013turing discounting back-off models methods equivalent assigning prior distribution probabilities n -grams using bayesian inference compute resulting posterior n -gram probabilities however sophisticated smoothing models typically derived fashion instead independent considerations field computational linguistics particular language modeling skip-grams generalization n -grams components typically words need consecutive text consideration may leave gaps skipped provide one way overcoming data sparsity problem found conventional n -gram analysis formally -gram consecutive subsequence length sequence tokens -skip -- gram length- subsequence components occur distance example input text set 1-skip-2-grams includes bigrams 2-grams addition subsequences syntactic n -grams n -grams defined paths syntactic dependency constituent trees rather linear structure text example sentence economic news little effect financial markets transformed syntactic n -grams following tree structure dependency relations news-economic effect-little effect-on-markets-financial syntactic n -grams intended reflect syntactic structure faithfully linear n -grams many applications especially features vector space model syntactic n -grams certain tasks gives better results use standard n -grams example authorship attribution another type syntactic n -grams part-of-speech n -grams defined fixed-length contiguous overlapping subsequences extracted part-of-speech sequences text part-of-speech n -grams several applications commonly information retrieval", + "neighbors": [ + 159, + 282, + 289, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Validation" + }, + { + "node_id": 160, + "label": 4, + "text": "Comparison_of_packet_analyzers:comparison packet analyzers following tables compare general technical information several packet analyzer software utilities also known network analyzers packet sniffers please see individual products articles information basic general information software\u2014creator/company license/price etc utilities run operating systems", + "neighbors": [ + 74, + 134, + 138, + 195, + 210, + 299, + 329, + 598, + 875, + 961, + 991, + 1045, + 1138, + 1279, + 1284, + 1301, + 1318, + 1337, + 1400, + 1513 + ], + "mask": "Test" + }, + { + "node_id": 161, + "label": 7, + "text": "Data_Format_Description_Language:data format description language data format description language dfdl often pronounced daff-o-dil published open grid forum proposed recommendation january 2011 modeling language describing general text binary data standard way dfdl model schema allows text binary data read parsed native format presented instance information set information set logical representation data contents independent physical format example two records could different formats one fixed-length fields uses delimiters could contain exactly data would represented information set dfdl schema also allows data taken instance information set written serialized native format dfdl descriptive prescriptive dfdl data format impose use particular data format instead provides standard way describing many different kinds data format approach several advantages allows application author design appropriate data representation according requirements describing standard way shared enabling multiple programs directly interchange data dfdl achieves building upon facilities w3c xml schema 1.0 subset xml schema used enough enable modeling non-xml data motivations approach avoid inventing completely new schema language make easy convert general text binary data via dfdl information set corresponding xml document educational material available form dfdl tutorial videos several hands-on dfdl labs dfdl created response need grid apis able understand data regardless source language needed capable modeling wide variety existing text binary data formats working group established global grid forum later became open grid forum 2003 create specification language.. decision made early base language subset w3c xml schema using xs appinfo annotations carry extra information necessary describe non-xml physical representations established approach already used today commercial systems dfdl takes approach evolves open standard capable describing many text binary data formats work continued language resulting publication dfdl 1.0 specification ogf proposed recommendation gfd.174 january 2011 latest revision gfd.207 published november 2014 obsoletes gfd.174 incorporates issues noted date also available html summary dfdl features available ogf issues specification tracked using redmine issue trackers implementations dfdl processors parse serialize data using dfdl schemas available presentation available describes ibm dfdl daffodil public repository dfdl schemas describe commercial scientific data formats established github dfdl schemas formats like un/edifact nacha iso8583 available free download take example following text data stream gives name age location person logical model data described following fragment xml schema document order names types cardinality fields expressed xml schema model additionally model physical representation data stream dfdl augments xml schema fragment annotations xs element xs sequence objects follows property attributes dfdl annotations express data represented ascii text format fields variable length delimited commas alternative compact syntax also provided dfdl properties carried non-native attributes xml schema objects goal dfdl provide rich modeling language capable representing text binary data format 1.0 release major step towards goal capability includes support", + "neighbors": [ + 1131, + 1606 + ], + "mask": "Validation" + }, + { + "node_id": 162, + "label": 7, + "text": "Smartphone:smartphone smartphones class mobile phones multi-purpose mobile computing devices distinguished feature phones stronger hardware capabilities extensive mobile operating systems facilitate wider software internet including web browsing mobile broadband multimedia functionality including music video cameras gaming alongside core phone functions voice calls text messaging smartphones typically include various sensors leveraged software magnetometer proximity sensors barometer gyroscope accelerometer support wireless communications protocols bluetooth wi-fi satellite navigation early smartphones marketed primarily towards enterprise market attempting bridge functionality standalone personal digital assistant pda devices support cellular telephony limited bulky form short battery life immaturity wireless data services issues eventually resolved advances mosfet mos transistor lithium-ion battery mobile network technologies 2000s ntt docomo i-mode platform blackberry nokia symbian platform windows mobile began gain market traction models often featuring qwerty keyboards resistive touchscreen input emphasizing access push email wireless internet since unveiling iphone 2007 majority smartphones featured thin slate-like form factors large capacitive screens support multi-touch gestures rather physical keyboards offer ability users download purchase additional applications centralized store use cloud storage synchronization virtual assistants well mobile payment services improved hardware faster wireless communication due standards lte bolstered growth smartphone industry third quarter 2012 one billion smartphones use worldwide global smartphone sales surpassed sales figures feature phones early 2013 development smartphone enabled advances mosfet metal-oxide-silicon field-effect transistor semiconductor device fabrication mosfet mos transistor invented mohamed atalla dawon kahng bell labs 1959 basic building block computing devices smartphones mosfet scaling mos transistors get smaller decreasing power consumption enabled large-scale integration vlsi technology mos transistor counts integrated circuit chips increasing exponential pace predicted moore law continuous mosfet scaling eventually made possible build portable smart devices smartphones 1990s2000s typical smartphone built billions tiny mosfets 2019 used integrated circuits microprocessors memory chips power devices thin-film transistors tfts mobile displays advances mosfet power electronic technology also enabled development digital wireless mobile networks essential smartphone wide adoption power mosfet ldmos lateral diffused mos rf cmos radio frequency cmos devices led development proliferation digital wireless mobile networks 1990s advances mosfet technology leading increasing bandwidth 2000s essential elements wireless mobile networks built mosfets including mobile tranceivers base station modules routers rf power amplifiers telecommunication circuits rf circuits radio transceivers networks 2g 3g 4g another important enabling factor lithium-ion battery became indispensable energy source smartphones lithium-ion battery invented john goodenough rachid yazami akira yoshino 1980s commercialized sony asahi kasei 1991 advances mosfet technology enabling smaller integrated circuit chips improving wireless mobile networks ibm engineer frank canova realised chip-and-wireless technology becoming small enough use handheld devices first commercially available device could properly referred smartphone began prototype called angler developed canova 1992 ibm demonstrated november year comdex computer industry trade show refined version marketed consumers 1994 bellsouth name simon personal communicator addition placing receiving cellular calls touchscreen-equipped simon could send receive faxes emails included address book calendar appointment scheduler calculator world time clock notepad well visionary mobile applications maps stock reports news ibm simon manufactured mitsubishi electric integrated features wireless personal digital assistant pda cellular radio technologies building ibm simon also featured liquid-crystal display lcd pc card support internal hardware includes nec vadem vg230 system-on-a-chip soc sony hitachi random-access memory ram chips intel hitachi flash memory chips cirrus logic modem chips simon commercially unsuccessful particularly due bulky form factor limited battery life using nicad batteries rather lithium-ion battery used modern smartphones term smart phone smartphone coined year introduction simon appearing print early 1995 describing phonewriter communicator beginning mid-late 1990s many people mobile phones carried separate dedicated pda device running early versions operating systems palm os newton os symbian windows ce/pocket pc operating systems would later evolve early mobile operating systems smartphones era hybrid devices combined existing familiar pda oses basic phone hardware results devices bulkier either dedicated mobile phones pdas allowed limited amount cellular internet access pda mobile phone manufacturers competed reducing size devices bulk smartphones combined high cost expensive data plans plus drawbacks expansion limitations decreased battery life compared separate standalone devices generally limited popularity early adopters business users needed portable connectivity march 1996 hewlett-packard released omnigo 700lx modified hp 200lx palmtop pc nokia 2110 mobile phone piggybacked onto rom-based software support 640\u00d7200 resolution cga compatible four-shade gray-scale lcd screen could used place receive calls create receive text messages emails faxes also 100 dos 5.0 compatible allowing run thousands existing software titles including early versions windows august 1996 nokia released nokia 9000 communicator digital cellular pda based nokia 2110 integrated system based pen/geos 3.0 operating system geoworks two components attached hinge became known clamshell design display physical qwerty keyboard pda provided e-mail calendar address book calculator notebook applications text-based web browsing could send receive faxes closed device could used digital cellular telephone june 1999 qualcomm released pdq smartphone cdma digital pcs smartphone integrated palm pda internet connectivity subsequent landmark devices included 1999 japanese wireless provider ntt docomo launched i-mode new mobile internet platform provided data transmission speeds 9.6 kilobits per second access web services available platform online shopping ntt docomo i-mode used chtml language restricted aspects traditional html favor increasing data speed devices limited functionality small screens limited bandwidth allowed phones use slower data speeds available rise i-mode helped ntt docomo accumulate estimated 40 million subscribers end 2001 ranked first market capitalization japan second globally power would later wane face rise 3g new phones advanced wireless network capabilities japanese cell phones increasingly diverged global standards trends offer forms advanced services functionality mobile payments near-field communication nfc 1seg mobile television smartphones still rare outside japan introduction danger hiptop 2002 saw moderate success among u.s. consumers t-mobile sidekick later mid-2000s business users u.s. started adopt devices based microsoft windows mobile blackberry smartphones research motion american users popularized term crackberry 2006 due blackberry addictive nature outside u.s. japan nokia seeing success smartphones based symbian originally developed psion personal organisers popular smartphone os europe middle late 2000s initially nokia symbian smartphones focused business eseries similar windows mobile blackberry devices time 2006 onwards nokia started producing consumer-focused smartphones popularized entertainment-focused nseries 2010 symbian world widely used smartphone operating system 2000s common smartphones physical t9 numeric keypad qwerty keyboard either candybar sliding form factor smartphones resistive touchscreens allowed virtual keyboards handwriting input finger stylus thus also allowing easy entry asian characters 2007 lg prada first mobile phone released large capacitive touchscreen later year apple computer introduced iphone iphone also designed around large capacitive touchscreen added support multi-touch gestures interactions pinching zoom photos web pages phones notable abandoning use stylus keyboard keypad typical smartphones time favor capacitive touchscreen direct finger input input type invention touchscreen smartphone often attributed apple iphone n't first phone touchscreen although made smartphone know today something mainstream due company popularity us lesser extent worldwide made interacting smartphones touchscreen popular following iphone success despite high retail price us 500 smartphone manufacturers started use basic design iphone iphone first smartphone conventional terms ... platform device allows software installed year later followed platforms like palmos symbian windows mobile allowing apps installed apple app store online distribution platform present phone controlled monetized apple became common means smartphone software distribution installation first iphone also faced criticism supporting latest 3g wireless network standards praised hardware software design june 2007 release met heavy demand customers waiting lines outside apple store locations among first purchase screen-focused hardware phones centered around capacitive touchscreen stimulated software focus features web browser designed render full web pages opposed stripped wap services multimedia functionality videos online services maps apps key factor success form factor advantages design around capacitive touchscreen affected development another smartphone os platform android blackberry-like prototype device scrapped favor touchscreen device slide-out physical keyboard google engineers thought time touchscreen could completely replace physical keyboard buttons first android device htc dream released september 2008 although android adoption relatively slow first started gaining widespread popularity 2010 largely due functionality low price early 2012 dominated smartphone market share worldwide continues day android based around modified linux kernel makes linux widely used operating system worldwide also makes android widely used general purpose operating system worldwide apple iphones widespread rich developed countries relatively poor developing countries iphone high end android smartphone considered luxury and/or part social status android iphone devices popularized smartphone form factor based large capacitive touchscreen led decline earlier keyboard- keypad-focused platforms microsoft instance discontinued windows mobile started new touchscreen-oriented os scratch called windows phone nokia abandoned symbian partnered microsoft use windows phone smartphones windows phone became third-most-popular smartphone os replaced windows 10 mobile declined share become largely irrelevant less 0.5 smartphone market palm replaced palm os webos blackberry limited formerly known research motion known phones full qwerty keyboard screen made new platform based qnx blackberry 10 possible control device without press physical buttons mid-2010s almost smartphones touchscreen-only android iphone smartphones dominated market early 2010s larger smartphones screen sizes least 5.5 inches diagonal dubbed phablets began achieve popularity samsung galaxy note series gaining notably wide adoption 2013 huawei launched huawei mate series sports 6.1-inch hd 1280 x 720 ips+ lcd display considered quite large back day 2013 fairphone launched first socially ethical smartphone london design festival address concerns regarding sourcing materials manufacturing followed shiftphone 2015 late 2013 qsalpha commenced production smartphone designed entirely around security encryption identity protection companies began release smartphones incorporating flexible displays create curved form factors samsung galaxy round lg g flex october 2013 motorola mobility announced project ara concept modular smartphone platform would allow users customize upgrade phones add-on modules attached magnetically frame ara retained google following sale motorola mobility lenovo shelved 2016 year lg motorola unveiled smartphones featuring limited form modularity accessories lg g5 allowed accessories installed via removal battery compartment moto z utilizes accessories attached magnetically rear device first smartphone fingerprint reader motorola atrix 4g 2011 september 2013 iphone 5s unveiled first smartphone major u.s. carrier since atrix feature technology 2014 1440p displays began appear high-end smartphones 2015 sony released xperia z5 premium featuring 4k resolution display although images videos could actually rendered resolution software upscaled 1080p microsoft expanding upon concept motorola short-lived webtop unveiled functionality windows 10 operating system phones allows supported devices docked use pc-styled desktop environment major technologies began trend 2016 including focus virtual reality augmented reality experiences catered towards smartphones newly introduced usb-c connector improving lte technologies 2015 global median smartphone ownership 43 statista forecast 2.87 billion people would smartphones 2020 new trends smartphone displays began emerge 2017 lg samsung releasing flagship smartphones utilizing displays taller aspect ratios common ratio designs allow display larger diameter slimmer width 16:9 displays equivalent screen size another trend popularized year displays contained tab-like cut-outs top-centre\u2014colloquially known notch \u2014to contain front-facing camera sometimes sensors typically located along top bezel device designs allow edge-to-edge displays take nearly entire height device little bezel along top design characteristic popularized essential phone featured circular tab camera iphone x used wider tab contain camera facial scanning system 2018 first smartphones featuring fingerprint readers embedded within oled displays announced followed 2019 implementation using ultrasonic sensor samsung galaxy s10 2019 4.7-inches 5.5 inches become industry standard size companies abandoning smaller 4.7-inch displays smartphones foldable displays theorized possible manufacturing costs production processes feasible november 2018 startup company royole unveiled first commercially available foldable smartphone royole flexpai also month samsung presented prototype phone featuring infinity flex display developers conference smaller outer display cover larger tablet-sized display opened samsung stated also develop new polymer material coat display opposed glass early examples foldable phones manufacturers became subject rumors early 2019 samsung officially announced galaxy fold based previously-demonstrated prototype february 2019 originally-scheduled release late-april smartphones central processing units cpus similar computers optimised operate low power environments performance mobile cpu depends clock rate generally given multiples hertz also memory hierarchy challenges performance mobile phone cpus often appropriately given scores derived various standardized tests measure real effective performance commonly used applications one main characteristics smartphones screen depending device design screen fills nearly space device front surface many smartphone displays aspect ratio taller aspect ratios became common 2017 screen sizes measured diagonal inches phones screens larger 5.2 inches often called phablets smartphones screens 4.5 inches size commonly difficult use single hand since thumbs reach entire screen surface may need shifted around hand held one hand manipulated used place hands due design advances modern smartphones large screen sizes edge-to-edge designs compact builds improve ergonomics shift taller aspect ratios resulted phones larger screen sizes whilst maintaining ergonomics associated smaller 16:9 displays liquid-crystal displays common others ips led oled amoled displays displays integrated pressure-sensitive digitizers developed wacom samsung apple force touch system audio quality enhancing features voice lte hd voice appeared often available newer smartphones sound quality remain problem due design phone quality cellular network compression algorithms used long distance calls audio quality improved using voip application wifi cellphones small speakers user use speakerphone feature talk person phone without holding ear small speakers also used listen digital audio files music speech watch videos audio component without holding phone close ear end 2017 smartphone battery life become generally adequate however earlier smartphone battery life poor due weak batteries could handle significant power requirements smartphones computer systems color screens smartphone users purchase additional chargers use outside home work cars buying portable external battery packs external battery packs include generic models connected smartphone cable custom-made models piggyback onto smartphone case 2016 samsung recall millions galaxy note 7 smartphones due explosive battery issue consumer convenience wireless charging stations introduced hotels bars public spaces wide range accessories sold smartphones including cases screen protectors power charging cables wireless power stations usb on-the-go adapters connecting usb drives cases hdmi cable external monitor add-on batteries headphones combined headphone-microphones example allow person privately conduct calls device without holding ear bluetooth-enabled powered speakers enable users listen media smartphones wirelessly cases range relatively inexpensive rubber soft plastic cases provide moderate protection bumps good protection scratches expensive heavy-duty cases combine rubber padding hard outer shell cases book -like form cover user opens use device cover closed protects screen book -like cases additional pockets credit cards thus enabling people use wallets accessories include products sold manufacturer smartphone compatible products made manufacturers mobile operating system mobile os operating system phones tablets smartwatches mobile devices mobile operating systems combine features personal computer operating system features useful mobile handheld use usually including following considered essential modern mobile systems touchscreen cellular bluetooth wi-fi protected access wi-fi global positioning system gps mobile navigation video- single-frame picture cameras speech recognition voice recorder music player near field communication infrared blaster q1 2018 383 million smartphones sold 85.9 percent running android 14.1 percent running ios negligible number smartphones running oses android alone popular popular desktop operating system windows general smartphone use even without tablets exceeds desktop use mobile devices mobile communications abilities e.g. smartphones contain two mobile operating systemsthe main user-facing software platform supplemented second low-level proprietary real-time operating system operates radio hardware research shown low-level systems may contain range security vulnerabilities permitting malicious base stations gain high levels control mobile device mobile app computer program designed run mobile device smartphone term app short-form term software application introduction apple app store iphone ipod touch july 2008 popularized manufacturer-hosted online distribution third-party applications software computer programs focused single platform huge variety apps including video games music products business tools point smartphone application distribution depended third-party sources providing applications multiple platforms getjar handango handmark pocketgear following success app store smartphone manufacturers launched application stores google android market later renamed google play store rim blackberry app world android-related app stores like f-droid february 2014 93 mobile developers targeting smartphones first mobile app development since 1996 smartphone shipments positive growth november 2011 27 photographs created taken camera-equipped smartphones september 2012 study concluded 4 5 smartphone owners use device shop online global smartphone sales surpassed sales figures feature phones early 2013 worldwide shipments smartphones topped 1 billion units 2013 38 2012 725 million comprising 55 share mobile phone market 2013 42 2012 q1 2016 first time shipments dropped 3 percent year year situation caused maturing china market 2011 samsung highest shipment market share worldwide followed apple 2013 samsung 31.3 market share slight increase 30.3 2012 apple 15.3 decrease 18.7 2012 huawei lg lenovo 5 significantly better 2012 figures others 40 previous years figure apple lost market share although shipment volume still increased 12.9 rest significant increases shipment volumes 36\u201392 q1 2014 samsung 31 share apple 16 q4 2014 apple 20.4 share samsung 19.9 q2 2016 samsung 22.3 share apple 12.9 q1 2017 idc reported samsung first placed 80 million units followed apple 50.8 million huawei 34.6 million oppo 25.5 million vivo 22.7 million samsung mobile business half size apple revenue apple business increased rapidly years 2013 2017 2012 university southern california study found unprotected adolescent sexual activity common among owners smartphones study conducted rensselaer polytechnic institute rpi lighting research center lrc concluded smartphones backlit devices seriously affect sleep cycles persons might become psychologically attached smartphones resulting anxiety separated devices smombie combination smartphone zombie walking person using smartphone paying attention walk possibly risking accident process increasing social phenomenon issue slow-moving smartphone users led temporary creation mobile lane walking chongqing china issue distracted smartphone users led city augsburg germany embed pedestrian traffic lights pavement many countries mobile phones used provide mobile banking services may include ability transfer cash payments secure sms text message kenya m-pesa mobile banking service example allows customers mobile phone operator safaricom hold cash balances recorded sim cards cash deposited withdrawn m-pesa accounts safaricom retail outlets located throughout country transferred electronically person person used pay bills companies branchless banking successful south africa philippines pilot project bali launched 2011 international finance corporation indonesian bank bank mandiri another application mobile banking technology zidisha us-based nonprofit micro-lending platform allows residents developing countries raise small business loans web users worldwide zidisha uses mobile banking loan disbursements repayments transferring funds lenders united states borrowers rural africa mobile phones use internet mobile payments first trialled finland 1998 two coca-cola vending machines espoo enabled work sms payments eventually idea spread 1999 philippines launched country first commercial mobile payments systems mobile operators globe smart mobile phones make mobile payments via direct mobile billing schemes contactless payments phone point sale support near field communication nfc enabling contactless payments nfc-equipped mobile phones requires co-operation manufacturers network operators retail merchants mobile phone use driving\u2014including calling text messaging playing media web browsing gaming using mapping apps operating phone features\u2014is common controversial since widely considered dangerous due known distracted driving distracted operating motor vehicle shown increase risk accidents september 2010 us national highway traffic safety administration nhtsa reported 995 people killed drivers distracted phones march 2011 us insurance company state farm insurance announced results study showed 19 drivers surveyed accessed internet smartphone driving many jurisdictions prohibit use mobile phones driving egypt israel japan portugal singapore handheld hands-free calling mobile phone uses speakerphone banned countries including uk france many us states use calling handheld phones banned hands-free use permitted 2011 study reported 90 college students surveyed text initiate reply read driving scientific literature danger driving sending text message mobile phone texting driving limited simulation study university utah found sixfold increase distraction-related accidents texting due complexity smartphones began grow introduced additional difficulties law enforcement officials attempting distinguish one usage another drivers using devices apparent countries ban handheld hands-free usage rather ban handheld use officials easily tell function phone used simply looking driver lead drivers stopped using device illegally call fact using device legally example using phone incorporated controls car stereo gps satnav 2010 study reviewed incidence phone use cycling effects behavior safety 2013 national survey us reported number drivers reported using phones access internet driving risen nearly one four study conducted university vienna examined approaches reducing inappropriate problematic use mobile phones using phones driving accidents involving driver distracted call phone begun prosecuted negligence similar speeding united kingdom 27 february 2007 motorists caught using handheld phone driving three penalty points added license addition fine \u00a360 increase introduced try stem increase drivers ignoring law japan prohibits use phones driving including use hands-free devices new zealand banned handheld phone use since 1 november 2009 many states united states banned text messaging phones driving illinois became 17th american state enforce law july 2010 30 states banned texting driving kentucky becoming recent addition july 15 public health law research maintains list distracted driving laws united states database laws provides comprehensive view provisions laws restrict use mobile devices driving 50 states district columbia 1992 first law passed december 1 2010 dataset contains information 22 dichotomous continuous categorical variables including example activities regulated e.g. texting versus talking hands-free versus handheld calls web browsing gaming targeted populations exemptions patent war samsung apple started latter claimed original galaxy android phone copied interfaceand possibly hardwareof apple ios iphone 3gs also smartphone patents licensing litigation involving sony mobile google apple inc. samsung microsoft nokia motorola htc huawei zte among others conflict part wider patent wars multinational technology software corporations secure increase market share companies granted patent sue prevent competitors using methods patent covers since 2010s number lawsuits counter-suits trade complaints based patents designs market smartphones devices based smartphone oses android ios increased significantly initial suits countersuits rulings license agreements major events began 2009 smartphone market stated grow rapidly 2012 apps allows sending receiving facsimile fax smartphone including facsimile data composed raster bi-level graphics generated directly digitally document image file formats rise number mobile medical apps market place government regulatory agencies raised concerns safety use applications concerns transformed regulation initiatives worldwide aim safeguarding users untrusted medical advice smartphone malware easily distributed insecure app store often malware hidden pirated versions legitimate apps distributed third-party app stores malware risk also comes known update attack legitimate application later changed include malware component users install notified app updated well one three robberies 2012 united states involved theft mobile phone online petition urged smartphone makers install kill switches devices 2014 apple find iphone google android device manager locate disable wipe data phones lost stolen blackberry protect os version 10.3.2 devices rendered unrecoverable even blackberry operating system recovery tools incorrectly authenticated dissociated account leaked documents published wikileaks codenamed vault 7 dated 2013\u20132016 detail capabilities united states central intelligence agency cia perform electronic surveillance cyber warfare including ability compromise operating systems smartphones including ios android guidelines mobile device security issued nist many organizations conducting private in-person meeting least one site recommends user switch smartphone disconnect battery using smartphones late night disturb sleep due blue light brightly lit screen affects melatonin levels sleep cycles effort alleviate issues several apps change color temperature screen warmer hue based time day reduce amount blue light generated developed android ios 9.3 integrated similar system-level functionality known night shift amazon released feature known blue shade fire os bellini 5.0 later also theorized users addicted use phones especially go bed result ego depletion many people also use phones alarm clocks also lead loss sleep pocket cameras difficulty producing bokeh images nowadays smartphones dual-lens cameras produce bokeh effect easily even rearrange level bokeh shooting iphone 7 plus debuted dual-lens camera back smartphone advanced smartphones may come 'quad cameras two dual-lens cameras honor 9 lite smartphone back front smartphone 13mp main lens 2mp lens capturing depth information evercoss u50a max smartphone 4 cameras costs less 100 huawei p20 pro smartphone triple lenses back smartphone launched bokeh camera smartphone optical zoom first lens 40mp rgb second lens 20mp monochrome third lens 8mp rgb telephoto 3x zoom enhanced 5x combination optical zoom megapixel lens 40mp rgb produce undeteriorated optical+digital zoom digital zoom without loss quality", + "neighbors": [ + 3, + 9, + 14, + 21, + 24, + 41, + 43, + 75, + 85, + 101, + 113, + 131, + 134, + 166, + 186, + 211, + 227, + 253, + 257, + 264, + 267, + 269, + 270, + 291, + 298, + 309, + 337, + 355, + 359, + 364, + 379, + 398, + 408, + 422, + 442, + 459, + 477, + 484, + 502, + 511, + 520, + 521, + 527, + 583, + 596, + 603, + 619, + 622, + 629, + 634, + 726, + 755, + 775, + 796, + 832, + 833, + 837, + 853, + 877, + 917, + 946, + 956, + 961, + 972, + 1018, + 1020, + 1051, + 1061, + 1082, + 1102, + 1117, + 1121, + 1138, + 1176, + 1183, + 1185, + 1193, + 1196, + 1203, + 1232, + 1262, + 1270, + 1292, + 1295, + 1310, + 1313, + 1314, + 1325, + 1361, + 1368, + 1373, + 1384, + 1411, + 1419, + 1422, + 1443, + 1448, + 1480, + 1483, + 1486, + 1493, + 1500, + 1521, + 1522, + 1529, + 1558, + 1569, + 1575, + 1576, + 1578, + 1602, + 1619 + ], + "mask": "Test" + }, + { + "node_id": 163, + "label": 3, + "text": "Magical_Tree:magical tree konami included magical tree 1998 game anthology konami antiques msx collection vol 2 playstation player character indian brave stereotype wears tanned vest trousers headband feather player ascends magical tree hopping branch branch climbing vines ladders\u2014while also dodging larvae owls lightning bolts player jump dangle branches earns points gathering apples arrows daggers coronets tree 2004 meters tall gauge tracks player altitude conclusion level game informs player much climb reach goal castle treetop ascent divided nine game levels player character dances conclusion level player clears ninth level curtain opens reveal castle top tree smiling crenels castle parapet young woman purple frock man wearing war bonnet end sequence game continues base tree", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 164, + "label": 7, + "text": "Limnu:limnu limnu online whiteboarding app founded 2015 david debry david hart primarily used educators businesses sketch ideas digital boards via ipad users invite others view edit boards", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 165, + "label": 4, + "text": "Return-oriented_programming:return-oriented programming return-oriented programming rop computer security exploit technique allows attacker execute code presence security defenses executable space protection code signing technique attacker gains control call stack hijack program control flow executes carefully chosen machine instruction sequences already present machine memory called gadgets gadget typically ends return instruction located subroutine within existing program and/or shared library code chained together gadgets allow attacker perform arbitrary operations machine employing defenses thwart simpler attacks return-oriented programming advanced version stack smashing attack generally types attacks arise adversary manipulates call stack taking advantage bug program often buffer overrun buffer overrun function perform proper bounds checking storing user-provided data memory accept input data store properly data written onto stack excess data may overflow space allocated function variables e.g. locals stack diagram right overwrite return address address later used function redirect control flow back caller overwritten control flow diverted location specified new return address standard buffer overrun attack attacker would simply write attack code payload onto stack overwrite return address location newly written instructions late 1990s major operating systems offer protection attacks microsoft windows provided buffer-overrun protections 2004 eventually operating systems began combat exploitation buffer overflow bugs marking memory data written non-executable technique known executable space protection enabled machine would refuse execute code located user-writable areas memory preventing attacker placing payload stack jumping via return address overwrite hardware support later became available strengthen protection data execution prevention adversary execute maliciously injected instructions typical buffer overflow overwrites contents data section memory marked non-executable defeat return-oriented programming attack inject malicious code rather uses instructions already present called gadgets manipulating return addresses typical data execution prevention defend attack adversary use malicious code rather combined good instructions changing return addresses therefore code used would marked non-executable widespread implementation data execution prevention made traditional buffer overflow vulnerabilities difficult impossible exploit manner described instead attacker restricted code already memory marked executable program code linked shared libraries since shared libraries libc often contain subroutines performing system calls functionality potentially useful attacker likely candidates finding code assemble attack return-into-library attack attacker hijacks program control flow exploiting buffer overrun vulnerability exactly discussed instead attempting write attack payload onto stack attacker instead chooses available library function overwrites return address entry location stack locations overwritten obeying applicable calling conventions carefully pass proper parameters function performs functionality useful attacker technique first presented solar designer 1997 later extended unlimited chaining function calls rise 64-bit x86 processors brought change subroutine calling convention required first argument function passed register instead stack meant attacker could longer set library function call desired arguments manipulating call stack via buffer overrun exploit shared library developers also began remove restrict library functions performed functions particularly useful attacker system call wrappers result return-into-library attacks became much difficult mount successfully next evolution came form attack used chunks library functions instead entire functions exploit buffer overrun vulnerabilities machines defenses simpler attacks technique looks functions contain instruction sequences pop values stack registers careful selection code sequences allows attacker put suitable values proper registers perform function call new calling convention rest attack proceeds return-into-library attack return-oriented programming builds borrowed code chunks approach extends provide turing complete functionality attacker including loops conditional branches put another way return-oriented programming provides fully functional language attacker use make compromised machine perform operation desired hovav shacham published technique 2007 demonstrated important programming constructs simulated using return-oriented programming target application linked c standard library containing exploitable buffer overrun vulnerability return-oriented programming attack superior attack types discussed expressive power resistance defensive measures none counter-exploitation techniques mentioned including removing potentially dangerous functions shared libraries altogether effective return-oriented programming attack although return-oriented programming attacks performed variety architectures shacham paper majority follow-up work focus intel x86 architecture x86 architecture variable-length cisc instruction set return-oriented programming x86 takes advantage fact instruction set dense random sequence bytes likely interpretable valid set x86 instructions therefore possible search opcode alters control flow notably return instruction 0xc3 look backwards binary preceding bytes form possibly useful instructions sets instruction gadgets chained overwriting return address via buffer overrun exploit address first instruction first gadget first address subsequent gadgets written successively onto stack conclusion first gadget return instruction executed pop address next gadget stack jump conclusion gadget chain continues third chaining small instruction sequences attacker able produce arbitrary program behavior pre-existing library code shacham asserts given sufficiently large quantity code including limited c standard library sufficient gadgets exist turing-complete functionality automated tool developed help automate process locating gadgets constructing attack binary tool known ropgadget searches binary looking potentially useful gadgets attempts assemble attack payload spawns shell accept arbitrary commands attacker address space layout randomization also vulnerabilities according paper shacham et al aslr 32-bit architectures limited number bits available address randomization 16 32 address bits available randomization 16 bits address randomization defeated brute force attack minutes 64-bit architectures 40 bits 64 available randomization 2016 brute force attack 40-bit randomization possible unlikely go unnoticed also randomization defeated de-randomization techniques even perfect randomization leakage memory contents help calculate base address dll runtime according paper checkoway et al possible perform return-oriented-programming x86 arm architectures without using return instruction 0xc3 x86 instead used carefully crafted instruction sequences already exist machine memory behave like return instruction return instruction two effects firstly searches four-byte value top stack sets instruction pointer value secondly increases stack pointer value four x86 architecture sequences jmp pop instructions act return instruction arm sequences load branch instructions act return instruction since new approach use return instruction negative implications defense defense program checks several returns also several jump instructions attack may detected g-free technique developed kaan onarlioglu leyla bilge andrea lanzi davide balzarotti engin kirda practical solution possible form return-oriented programming solution eliminates unaligned free-branch instructions instructions like ret call attackers use change control flow inside binary executable protects free-branch instructions used attacker way g-free protects return address similar xor canary implemented stackguard checks authenticity function calls appending validation block expected result found g-free causes application crash number techniques proposed subvert attacks based return-oriented programming rely randomizing location program library code attacker accurately predict location instructions might useful gadgets therefore mount successful return-oriented programming attack chain one fairly common implementation technique address space layout randomization aslr loads shared libraries different memory location program load although widely deployed modern operating systems aslr vulnerable information leakage attacks approaches determine address known library function memory attacker successfully determine location one known instruction position others inferred return-oriented programming attack constructed randomization approach taken relocating instructions and/or program state registers stack objects program separately instead library locations requires extensive runtime support software dynamic translator piece randomized instructions back together runtime technique successful making gadgets difficult find utilize comes significant overhead another approach taken kbouncer modifies operating system verify return instructions actually divert control flow back location immediately following call instruction prevents gadget chaining carries heavy performance penalty effective jump-oriented programming attacks alter jumps control-flow-modifying instructions instead returns w^x also called data execution prevention/dep no-execute/nx security feature pages processes memory may either writable executable w^x alone provide perfect protection memory-based vulnerabilities aslr technologies provide advanced protection memory based vulnerabilities w^x first implemented openbsd 2003 structured exception handler overwrite protection feature windows protects common stack overflow attacks especially attacks structured exception handler small embedded systems proliferating due expansion internet things need protection embedded systems also increasing using instruction based memory access control ib-mac implemented hardware possible protect low-cost embedded systems malicious control flow stack overflow attacks protection provided separating data stack return stack however due lack memory management unit embedded systems hardware solution applied embedded systems 2010 jinku li et al proposed suitably modified compiler could completely eliminate return-oriented gadgets replacing codice_1 instruction sequence codice_2 codice_3 instruction sequence codice_4 codice_5 represents immutable tabulation legitimate return addresses program codice_6 represents specific index table prevents creation return-oriented gadget returns straight end function arbitrary address middle another function instead gadgets return legitimate return addresses drastically increases difficulty creating useful gadgets li et al claimed return indirection technique essentially de-generalizes return-oriented programming back old style return-into-libc proof-of-concept compiler included peephole optimization phase deal certain machine instructions happen contain return opcode opcodes immediate operands codice_7 armv8.3-a architecture introduces new feature hardware level takes advantage unused bits pointer address space cryptographically sign pointer addresses jumping pointer signature checked error occurs check fails notably latest iphone a12 chips upgraded armv8.3 make use pacs", + "neighbors": [ + 53, + 85, + 388, + 655, + 961, + 1138, + 1336, + 1627 + ], + "mask": "Train" + }, + { + "node_id": 166, + "label": 5, + "text": "Modem:modem modem portmanteau modulator-demodulator hardware device converts data format suitable transmission medium transmitted computer computer historically telephone wires modem modulates one carrier wave signals encode digital information transmission demodulates signals decode transmitted information goal produce signal transmitted easily decoded reliably reproduce original digital data modems used almost means transmitting analog signals light-emitting diodes radio common type modem one turns digital data computer modulated electrical signal transmission telephone lines demodulated another modem receiver side recover digital data modems generally classified maximum amount data send given unit time usually expressed bits per second symbol bit sometimes abbreviated bps rarely bytes per second symbol b modems also classified symbol rate measured baud baud unit denotes symbols per second number times per second modem sends new signal example itu v.21 standard used audio frequency-shift keying two possible frequencies corresponding two distinct symbols one bit per symbol carry 300 bits per second using 300 baud contrast original itu v.22 standard could transmit receive four distinct symbols two bits per symbol transmitted 1,200 bits sending 600 symbols per second 600 baud using phase-shift keying news wire services 1920s used multiplex devices satisfied definition modem however modem function incidental multiplexing function commonly included history modems modems grew need connect teleprinters ordinary phone lines instead expensive leased lines previously used current loop\u2013based teleprinters automated telegraphs 1941 allies developed voice encryption system called sigsaly used vocoder digitize speech encrypted speech one-time pad encoded digital data tones using frequency shift keying mass-produced modems united states began part sage air-defense system 1958 year word modem first used connecting terminals various airbases radar sites command-and-control centers sage director centers scattered around united states canada sage modems described bell labs conforming newly published bell 101 dataset standard ran dedicated telephone lines devices end different commercial acoustically coupled bell 101 110 baud modems 201a 201b data-phones synchronous modems using two-bit-per-baud phase-shift keying psk 201a operated half-duplex 2,000 bit/s normal phone lines 201b provided full duplex 2,400 bit/s service four-wire leased lines send receive channels running set two wires famous bell 103a dataset standard also introduced 1962 provided full-duplex service 300 bit/s normal phone lines frequency-shift keying used call originator transmitting 1,070 1,270 hz answering modem transmitting 2,025 2,225 hz readily available 103a2 gave important boost use remote low-speed terminals teletype model 33 asr ksr ibm 2741 reduced modem costs introducing originate-only 113d answer-only 113b/c modems many years bell system maintained monopoly use phone lines devices could connected however fcc seminal carterfone decision 1968 fcc concluded electronic devices could connected telephone system long used acoustic coupler since handsets supplied western electric thus standard design acoustic couplers relatively easy build acoustically coupled bell 103a-compatible 300 bit/s modems common 1970s well-known models included novation cat anderson-jacobson latter spun in-house project stanford research institute sri international even lower-cost option pennywhistle modem designed built using parts electronics scrap surplus stores december 1972 vadic introduced va3400 notable full-duplex operation 1,200 bit/s phone network like 103a used different frequency bands transmit receive november 1976 introduced 212a modem compete vadic similar design used lower frequency set transmission one could also use 212a 103a modem 300 bit/s according vadic change frequency assignments made 212 intentionally incompatible acoustic coupling thereby locking many potential modem manufacturers 1977 vadic responded va3467 triple modem answer-only modem sold computer center operators supported vadic 1,200-bit/s mode 212a mode 103a operation hush-a-phone decision applied mechanical connections carterfone decision 1968 led fcc introducing rule setting stringent t-designed tests electronically coupling device phone lines opened door direct-connect modems plugged directly phone line rather via handset however cost passing tests considerable acoustically coupled modems remained common early 1980s rapidly falling prices electronics late 1970s led increasing number direct-connect models around 1980 spite directly connected modems generally operated like earlier acoustic versions \u2013 dialing phone-control operations completed hand using attached handset small number modems added ability automatically answer incoming calls automatically place outgoing call single number even limited features relatively rare limited special models lineup flexible solutions needed third party dialers used automate calling normally using separate serial port communicate dialer would control modem private electrical connection introduction microcomputer systems internal expansion slots made first software-controllable modems common slot connections gave computer complete access modem memory input/output i/o channels allowed software send commands modem data led series popular modems s-100 bus apple ii computers could directly dial phone answer incoming calls hang phone basic requirements bulletin board system bbs seminal cbbs created s-100 machine hayes internal modem number similar systems followed next major advance modems hayes smartmodem introduced 1981 smartmodem otherwise standard 103a 300 bit/s direct-connect modem attached small microcontroller watched data stream certain character strings representing commands allowed data commands sent single serial port now-standard hayes command set included instructions picking hanging phone dialing numbers answering calls among others similar commands offered internal modems unlike smartmodem could connected computer rs-232 port practically every microcomputer built introduction smartmodem made communications much simpler easily accessed provided growing market vendors licensed hayes patents competed price adding features 1980s number new higher-speed modems first 1,200 2,400 bit/s greatly improved responsiveness online systems made file transfer practical led rapid growth online services large file libraries turn gave reason modem rapid update modems led similar rapid increase bbs use helped fact bbss could control modem simply sending strings rather talking device driver different every direct-connect modem 300 bit/s modems used audio frequency-shift keying send data system stream 1s 0s computer data translated sounds easily sent phone lines bell 103 system originating modem sends 0s playing 1,070 hz tone 1s 1,270 hz answering modem transmitting 0s 2,025 hz 1s 2,225 hz frequencies chosen carefully range suffers minimum distortion phone system harmonics 1,200 bit/s faster systems phase-shift keying used system two tones one side connection sent similar frequencies 300 bit/s systems slightly phase voiceband modems generally remained 300 1,200 bit/s v.21 v.22 mid-1980s v.22bis 2,400-bit/s system similar concept 1,200-bit/s bell 212 signaling introduced u.s. slightly different one europe limited available frequency range meant symbol rate 1,200 bit/s modems still 600 baud symbols per second bit rate increases achieved defining four eight distinct symbols allowed encoding two three bits per symbol instead 1 use smaller shifts drawback making symbol vulnerable interference improvements phone line quality time helped compensate late 1980s modems could support standards 2,400-bit/s operation becoming common many standards also introduced special purposes commonly using high-speed channel receiving lower-speed channel sending one typical example used french minitel system user terminals spent majority time receiving information modem minitel terminal thus operated 1,200 bit/s reception 75 bit/s sending commands back servers three u.s. companies became famous high-speed versions concept telebit introduced trailblazer modem 1984 used large number 36 bit/s channels send data one-way rates 18,432 bit/s single additional channel reverse direction allowed two modems communicate much data waiting either end link modems could change direction fly trailblazer modems also supported feature allowed spoof uucp g protocol commonly used unix systems send e-mail thereby speed uucp tremendous amount trailblazers thus became extremely common unix systems maintained dominance market well 1990s usrobotics usr introduced similar system known hst although supplied 9,600 bit/s early versions least provided larger backchannel rather offer spoofing usr instead created large market among fidonet users offering modems bbs sysops much lower price resulting sales end users wanted faster file transfers hayes forced compete introduced 9,600 bit/s standard express 96 also known ping-pong generally similar telebit pep hayes however offered neither protocol spoofing sysop discounts high-speed modems remained rare common feature high-speed modems concept fallback speed hunting allowing communicate less-capable modems call initiation modem would transmit series signals wait remote modem respond would start high speeds get progressively slower response thus two usr modems would able connect 9,600 bit/s user 2,400 bit/s modem called usr would fall back common 2,400 bit/s speed would also happen v.32 modem hst modem connected used different standard 9,600 bit/s would fall back highest commonly supported standard 2,400 bit/s applies v.32bis 14,400 bit/s hst modem would still able communicate 2,400 bit/s echo cancellation next major advance modem design local telephone lines use wires send receive data results small amount outgoing signal reflected back useful people talking phone provides signal speaker voice making system however reflected signal causes problems modem unable distinguish signal remote modem echo signal earlier modems split signal frequencies answer originate modem could ignore signals frequency range using transmission even improvements phone system allowing higher speeds splitting available phone signal bandwidth still imposed half-speed limit modems echo cancellation eliminated problem call setup negotiation period modems send series unique tones listen return phone system measure total delay time set local delay loop time connection completed send signals phone lines normal also delay inverted signal returning echo meets inverted version coming delay line cancels echo allowed modems use full spectrum available doubling speed additional improvements introduced via quadrature amplitude modulation qam encoding system previous systems using phase shift keying psk encoded two bits sometimes three per symbol slightly delaying advancing signal phase relative set carrier tone qam used combination phase shift amplitude encode four bits per symbol transmitting 1,200 baud produced 4,800 bit/s v.27ter standard working base rate 2,400 baud produced 9,600 bit/s v.32 carrier frequency 1,650 hz systems many years engineers considered rate limit data communications telephone networks introduction higher-speed systems also led digital fax machine 1980s digital faxes simply image format sent high-speed commonly 14.4 kbit/s modem software running host computer convert image fax format sent using modem software one time add-on since become largely universal first 9,600 bit/s modem developed 1968 sold 20,000 high error rates 1980 gottfried ungerboeck ibm zurich research laboratory applied channel coding techniques search new ways increase speed modems results astonishing conveyed colleagues 1982 agreed publish landmark paper theory information coding applying parity check coding bits symbol mapping encoded bits two-dimensional diamond pattern ungerboeck showed possible increase speed factor two error rate new technique called mapping set partitions known trellis modulation error correcting codes encode code words sets bits way far case error still closest original word confused another thought analogous sphere packing packing pennies surface two bit sequences one another easier correct minor errors dave forney introduced trellis diagram landmark 1973 paper popularized viterbi algorithm practically modems operating faster 9600 bit/s decode trellis-modulated data using viterbi algorithm v.32 modems operating 9600 bit/s expensive starting enter market early 1990s v.32bis standardized rockwell international chip division developed new driver chip set incorporating standard aggressively priced supra inc. arranged short-term exclusivity arrangement rockwell developed suprafaxmodem 14400 based introduced january 1992 399 less half price slower v.32 modems already market led price war end year v.32 dead never really established v.32bis modems widely available 250 v.32bis successful older high-speed standards little recommend usr fought back 16,800 bit/s version hst introduced one-off 19,200 bit/s method referred v.32ter neither non-standard modem sold well interest proprietary improvements destroyed lengthy introduction 28,800 bit/s v.34 standard waiting several companies decided release hardware introduced modems referred v.fast order guarantee compatibility v.34 modems standard ratified 1994 manufacturers forced use flexible parts generally dsp microcontroller opposed purpose-designed asic modem chips itu standard v.34 represents culmination joint efforts employs powerful coding techniques including channel encoding shape encoding mere four bits per symbol 9.6 kbit/s new standards used functional equivalent 6 10 bits per symbol plus increasing baud rates 2,400 3,429 create 14.4 28.8 33.6 kbit/s modems rate near theoretical shannon limit calculated shannon capacity narrowband line formula_1 formula_2 linear signal-to-noise ratio narrowband phone lines bandwidth 3,000 hz using formula_3 snr 30 db capacity approximately 30 kbit/s late 1990s rockwell-lucent usrobotics introduced competing technologies based upon digital transmission used telephony networks standard digital transmission modern networks 64 kbit/s networks use part bandwidth remote office signaling e.g hang phone limiting effective rate 56 kbit/s ds0 new technology adopted itu standards v.90 common modern computers 56 kbit/s rate possible central office user site downlink united states government regulation limits maximum power output resulting maximum data rate 53.3 kbit/s uplink user central office still uses v.34 technology 33.6 kbit/s usrobotics began work technology first calling x2 56k twice speed 28k modems usrobotics held 40-percent share retail modem market rockwell international held 80-percent share modem chipset market concerned shut market rockwell began work rival 56k technology joined lucent motorola called k56flex flex technologies reached market around february 1997 although problems k56flex modems noted product reviews july within six months worked equally well variations dependent local connection characteristics retail price 56k modems us 200 compared 100 33k modems separate equipment required internet service providers isps support incompatible technologies costs varying depending whether current equipment could upgraded half isps offered 56k support october 1997 consumer sales relatively low usrobotics rockwell attributed conflicting standards international telecommunication union itu announced draft new 56 kbit/s standard v.90 february 1998 strong industry support incompatible either existing standard amalgam designed allow types modem converted firmware upgrade v.90 standard approved september 1998 widely adopted isps consumers later v.92 digital pcm technique applied increase upload speed maximum 48 kbit/s expense download rates 48 kbit/s upstream rate would reduce downstream low 40 kbit/s due echo telephone line avoid problem v.92 modems offer option turn digital upstream instead use 33.6 kbit/s analog connection order maintain high digital downstream 50 kbit/s higher v.92 also adds two features first ability users call waiting put dial-up internet connection hold extended periods time answer call second feature ability quickly connect one isp achieved remembering analog digital characteristics telephone line using saved information reconnecting v.42 v.42bis v.44 standards allow modem transmit data faster basic rate would imply instance 53.3 kbit/s connection v.44 transmit 53.3 \u00d7 6 320 kbit/s using pure text however compression ratio tends vary due noise line due transfer already-compressed files zip files jpeg images mp3 audio mpeg video points modem sending compressed files approximately 50 kbit/s uncompressed files 160 kbit/s pure text 320 kbit/s value situations small amount memory modem buffer used hold data compressed sent across phone line order prevent overflow buffer sometimes becomes necessary tell computer pause datastream accomplished hardware flow control using extra lines modem\u2013computer connection computer set supply modem higher rate 320 kbit/s modem tell computer start stop sending data telephone-based 56k modems began losing popularity internet service providers netzero/juno netscape others started using pre-compression increase throughput maintain customer base server-side compression operates much efficiently on-the-fly compression done modems compression techniques application-specific jpeg text exe etc. website text images flash executables compacted approximately 4 12 30 respectively drawback approach loss quality causes image content become pixelated smeared isps employing approach often advertise accelerated dial-up accelerated downloads integrated opera amazon silk web browsers using server-side text image compression winmodem softmodem stripped-down modem replaces tasks traditionally handled hardware software case modem simple interface codec code decode digital signal softmodems cheaper traditional modems fewer hardware components however software interpreting modem tones sent softmodem uses system resources online gaming real concern another problem lack cross-platform compatibility meaning non-windows operating systems linux often equivalent driver operate modem values maximum values actual values may slower certain conditions example noisy phone lines complete list see companion article list device bandwidths baud one symbol per second symbol may encode one data bits 1994 software publishers association found although 60 computers us households modem 7 households went online cea study 2006 found dial-up internet access declining u.s 2000 dial-up internet connections accounted 74 u.s. residential internet connections united states demographic pattern dial-up modem users per capita less mirrored canada australia past 20 years dial-up modem use u.s. dropped 60 2003 2006 stood 36 voiceband modems popular means internet access u.s. advent new ways accessing internet traditional 56k modem losing popularity dial-up modem still widely used customers rural areas dsl cable satellite fiber optic service available unwilling pay companies charge 2012 annual report aol showed still collects around us 700 million fees dial-up users three million people adsl asymmetric digital subscriber line modems recent development limited telephone voiceband audio frequencies standard twisted-pair telephone cable short distances carry signals much higher frequencies cable maximum frequency rating adsl broadband takes advantage capability however adsl performance gradually declines telephone cable length increases limits adsl broadband service subscribers within relatively short distance telephone exchange cable modems use infrastructure originally intended carry television signals therefore designed outset carry higher frequencies single cable carry radio television signals time broadband internet service without interference newer types broadband modems also available including satellite modems power line modems consumers know networking routers broadband became available however many people knew modem connected computer internet telephone line take advantage consumers familiarity modems companies called devices broadband modems rather using less familiar terms adapter interface transceiver bridge fact broadband modems fit definition modem use complex waveforms carry digital data use advanced technology dial-up modems typically modulate demodulate hundreds channels simultaneously use much wider channels dial-up modems direct broadcast satellite wifi mobile phones use modems communicate wireless services today modern telecommunications data networks also make extensive use radio modems long distance data links required systems important part pstn also common use high-speed computer network links outlying areas fibre economical even cable installed often possible get better performance make parts system simpler using radio frequencies modulation techniques cable coaxial cable large bandwidth signal attenuation becomes major problem high data rates baseband digital signal used using modem much larger amount digital data transmitted single wire digital cable television cable internet services use radio frequency modems provide increasing bandwidth needs modern households using modem also allows frequency-division multiple access used making full-duplex digital communication many users possible using single wire wireless modems come variety types bandwidths speeds wireless modems often referred transparent smart transmit information modulated onto carrier frequency allow many simultaneous wireless communication links work simultaneously different frequencies transparent modems operate manner similar phone line modem cousins typically half duplex meaning could send receive data time typically transparent modems polled round robin manner collect small amounts data scattered locations easy access wired infrastructure transparent modems commonly used utility companies data collection smart modems come media access controllers inside prevents random data colliding resends data correctly received smart modems typically require bandwidth transparent modems typically achieve higher data rates ieee 802.11 standard defines short range modulation scheme used large scale throughout world wifi wimax standards use wireless mobile broadband modems operating microwave frequencies modems use mobile telephone system gprs umts hspa evdo wimax etc known mobile broadband modems sometimes also called wireless modems wireless modems embedded inside laptop appliance external external wireless modems connect cards usb modems mobile broadband cellular routers connect card pc card expresscard slides pcmcia/pc card/expresscard slot computer usb wireless modems use usb port laptop instead pc card expresscard slot usb modem used mobile broadband internet also sometimes referred dongle cellular router may external datacard aircard slides cellular routers allow datacards usb modems cellular routers may modems definition contain modems allow modems slid difference cellular router wireless modem cellular router normally allows multiple people connect since route data support multi-point multi-point connections modem designed one connection gsm wireless modems come integrated sim cardholder i.e. huawei e220 sierra 881 etc models also provided microsd memory slot and/or jack additional external antenna huawei e1762 sierra wireless compass 885 cdma evdo versions use r-uim cards use electronic serial number esn instead cost using wireless modem varies country country carriers implement flat rate plans unlimited data transfers caps maximum limits amount data transferred per month countries plans charge fixed rate per data transferred\u2014per megabyte even kilobyte data downloaded tends add quickly today content-filled world many people pushing flat data rates faster data rates newest wireless modem technologies umts hspa evdo wimax also considered broadband wireless modems compete broadband modems end april 2011 worldwide shipments usb modems surpassed embedded 3g 4g modules 3:1 usb modems easily discarded embedded modems could start gain popularity tablet sales grow incremental cost modems shrinks 2016 ratio may change 1:1 like mobile phones mobile broadband modems sim locked particular network provider unlocking modem achieved way unlocking phone using 'unlock code devices referred broadband modems residential gateways integrating functions modem network address translation nat router ethernet switch wifi access point dhcp server firewall among others residential gateway offer so-called bridged mode disables built-in routing function makes device function similarly plain modem bridged mode separate rfc 1483 bridging dc-bus powerline modem provide communication noisy power lines speeds 1.3mbit/s using ordinary uart lin spi protocols modems used connect fiber optic network known optical network units onus fiber optic systems upgraded use quadrature amplitude modulation modulator demodulator separate components rather single assembly modems 16qam uses 16-point constellation send four bits per symbol speeds usually order 200 400 gigabits per second 64qam uses 64-point constellation send six bits per symbol although suppliers announced components announcements installation rare speeds 65 terabits per second observed although name modem seldom used case modems also used high-speed home networking applications especially using existing home wiring one example g.hn standard developed itu-t provides high-speed 1 gbit/s local area network using existing home wiring power lines phone lines coaxial cables g.hn devices use orthogonal frequency-division multiplexing ofdm modulate digital signal transmission wire phrase null modem used describe attaching specially wired cable serial ports two personal computers basically transmit output one computer wired receive input true computers software used modems procomm minicom could used null modem connection voice modems regular modems capable recording playing audio telephone line used telephony applications see voice modem command set details voice modems type modem used fxo card private branch exchange pbx systems compare v.92", + "neighbors": [ + 14, + 108, + 134, + 162, + 267, + 269, + 442, + 511, + 746, + 853, + 925, + 956, + 957, + 966, + 1027, + 1090, + 1206, + 1228, + 1422, + 1455, + 1575 + ], + "mask": "Test" + }, + { + "node_id": 167, + "label": 4, + "text": "Message_submission_agent:message submission agent message submission agent msa mail submission agent computer program software agent receives electronic mail messages mail user agent mua cooperates mail transfer agent mta delivery mail uses esmtp variant simple mail transfer protocol smtp specified rfc 6409 many mtas perform function msa well also programs specially designed msas without full mta functionality historically internet mail mta msa functions use port number 25 official port msas 587 mta accepts user incoming mail msa accepts user outgoing mail separation mta msa functions produces several benefits one benefit msa since interacting directly author mua correct minor errors message format missing date message-id fields address missing domain name and/or immediately report error author corrected sent recipients mta accepting message another site reliably make kinds corrections error reports generated mta reach author message already sent one benefit dedicated port number 587 always possible users connect domain submit new mail combat spam including spam sent unwittingly victim botnet many isps institutional networks restrict ability connect remote mtas port 25 accessibility msa port 587 enables nomadic users example working laptop continue send mail via preferred submission servers even within others networks using specific submission server requirement sender policies signing practices enforced another benefit separating mta msa functions makes easier mta deny relaying refuse mail addressed recipient domain served locally strategy used isps prevent sending spam virus infected client computers contrast msa must generally accept mail recipient internet though accepts mail authors authorized use msa established identity msa via authentication times mail submission acceptance incoming mail usually accomplished using protocol server ability send mail arbitrary destinations without authentication allowed spammers use mtas means distributing spam since single message transaction request mta relay message large number recipients also made difficult trace message origin yet another benefit msas mtas different policies filtering spam msas require authentication form username password provided author messages received msa therefore traceable author direct relationship msa held accountable actions allows msa either spam filtering permissive spam filtering mta exists purpose accepting incoming email domains difficult establish trust mail sent arbitrary domains generally direct relationship domains via trust even identity established absence trust mta must generally rely heuristics third-party reputation services distinguish spam legitimate traffic mechanisms history error-prone separation msa mta therefore avoids use unreliable spam recognition mechanisms mail submission increases probability legitimate mail delivered successfully recent email clients use port 587 default older ones still propose port 25 users change port number manually latter case also possible mua may automatically discover server provides msa given domain looking srv records domain domain example.com publish record like rfc 6409 requires clients authorized authenticated use mail submission service e.g. described smtp-auth esmtpa means radius public key certificates mostly obsolete pop smtp msa must check submitted mail syntactically valid conforms relevant site policies rfc 6409 contains optional features", + "neighbors": [ + 1171, + 1200, + 1395 + ], + "mask": "Test" + }, + { + "node_id": 168, + "label": 8, + "text": "Java_API_for_XML_Web_Services:java api xml web services java api xml web services jax-ws java programming language api creating web services particularly soap services jax-ws one java xml programming apis part java ee platform jax-ws 2.2 specification jsr 224 defines standard java- to-wsdl mapping determines wsdl operations bound java methods soap message invokes wsdl operation java-to-wsdl mapping determines java method gets invoked soap message mapped method \u2019 parameters mapping also determines method \u2019 return value gets mapped soap response jax-ws uses annotations introduced java se 5 simplify development deployment web service clients endpoints part java web services development pack jax-ws used java se starting version 6 jax-ws 2.0 replaced jax-rpc api java platform enterprise edition 5 leans towards document style web services api provides core project metro inside glassfish open-source application server community oracle corporation jax-ws also one foundations wsit", + "neighbors": [ + 796, + 1138, + 1416, + 1470, + 1481 + ], + "mask": "Validation" + }, + { + "node_id": 169, + "label": 4, + "text": "IDN_homograph_attack:idn homograph attack internationalized domain name idn homograph attack way malicious party may deceive computer users remote system communicating exploiting fact many different characters look alike i.e. homographs hence term attack although technically homoglyph accurate term different characters look alike example regular user example.com may lured click link latin character replaced cyrillic character \u0430 kind spoofing attack also known script spoofing unicode incorporates numerous writing systems number reasons similar-looking characters greek \u03bf latin cyrillic \u043e assigned code incorrect malicious usage possibility security attacks registration homographic domain names akin typosquatting forms attacks use similar-looking name established domain fool user major difference typosquatting perpetrator attracts victims relying natural human typographical errors manually entering url homograph spoofing perpetrator deceives victims presenting visually indistinguishable hyperlinks indeed would rare accident web user type e.g. cyrillic letter within otherwise english word citibank cases registration typosquatting homograph spoofing pairs l/i i/j 0/o close together keyboards depending typeface may difficult impossible distinguish early nuisance kind pre-dating internet even text terminals confusion l lowercase letter l 1 number one capital letter vowel 0 number zero typewriters pre-computer era even combined ell one users type lowercase l number one needed zero/oh confusion gave rise tradition crossing zeros computer operator would type correctly unicode may contribute greatly combining characters accents several types hyphen-alikes etc. often due inadequate rendering support especially smaller fonts sizes wide variety fonts even earlier handwriting provided rich opportunities confusion notable example etymology word zenith translation arabic samt included scribe confusing ni common medieval blackletter connect vertical columns letters n u making difficult distinguish several row latter well rn rri rn rri confusion still possible human eye even modern advanced computer technology intentional look-alike character substitution different alphabets also known various contexts example faux cyrillic used amusement attention-grabber volapuk encoding cyrillic script represented similar latin characters used early days internet way overcome lack support cyrillic alphabet another example vehicle registration plates cyrillic domestic usage cyrillic script countries latin international driving letters registration plates issued greece limited using letters greek alphabet homoglyphs latin alphabet european union regulations require use latin letters ascii several characters pairs characters look alike known homographs homoglyphs spoofing attacks based similarities known homograph spoofing attacks example 0 number letter l lowercase l uppercase typical example hypothetical attack someone could register domain name appears almost identical existing domain goes somewhere else example domain rnicrosoft.com begins r n examples g00gle.com looks much like google.com fonts using mix uppercase lowercase characters googie.com capital small l looks much like google.com fonts paypal target phishing scam exploiting using domain paypai.com certain narrow-spaced fonts tahoma default address bar windows xp placing c front j l produce homoglyphs cl cj ci g multilingual computer systems different logical characters may identical appearances example unicode character u+0430 cyrillic small letter \u0430 look identical unicode character u+0061 latin small letter lowercase used english hence codice_1 cyrillic version instead codice_2 latin version problem arises different treatment characters user mind computer programming viewpoint user cyrillic \u0430 within latin string latin difference glyphs characters fonts however computer treats differently processing character string identifier thus user assumption one-to-one correspondence visual appearance name named entity breaks internationalized domain names provide backward-compatible way domain names use full unicode character set standard already widely supported however system expanded character repertoire dozen characters single alphabet many thousands characters many scripts greatly increased scope homograph attacks opens rich vein opportunities phishing varieties fraud attacker could register domain name looks like legitimate website letters replaced homographs another alphabet attacker could send e-mail messages purporting come original site directing people bogus site spoof site could record information passwords account details passing traffic real site victims may never notice difference suspicious criminal activity occurs accounts december 2001 evgeniy gabrilovich alex gontmakher technion israel published paper titled homograph attack described attack used unicode urls spoof website url prove feasibility kind attack researchers successfully registered variant domain name microsoft.com incorporated cyrillic characters problems kind anticipated idn introduced guidelines issued registries try avoid reduce problem example advised registries accept characters latin alphabet country unicode characters advice neglected major tlds february 7 2005 slashdot reported exploit disclosed 3ric johanson hacker conference shmoocon web browsers supporting idna appeared direct url nowiki http //www.p\u0430ypal.com/ /nowiki first character replaced cyrillic \u0430 site well known payment site paypal actually led spoofed web site different content popular browsers continued problems properly displaying international domain names april 2017 following alphabets characters used spoofing attacks please note obvious common given artistic license much risk spoofer take getting caught possibilities far numerous listed cyrillic far commonly used alphabet homoglyphs largely contains 11 lowercase glyphs identical nearly identical latin counterparts cyrillic letters \u0430 \u0441 \u0435 \u043e \u0440 \u0445 \u0443 optical counterparts basic latin alphabet look close identical c e p x y. cyrillic \u0437 \u0447 \u0431 resemble numerals 3 4 6 italic type generates homoglyphs \u0434\u0442\u043f\u0438 \u0434\u0442\u043f\u0438 \u0434\u0442\u043f\u0438 standard type resembling dmnu fonts \u0434 used since italic form resembles lowercase g however mainstream fonts \u0434 instead resembles partial differential sign \u2202 capital letters counted \u0430\u0432\u0441\u0435\u043d\u0456\u0458\u043a\u043c\u043e\u0440\u0455\u0442\u0445 substitute abcehijkmopstx addition capitals lowercase cyrillic homoglyphs cyrillic non-russian problematic letters \u0456 \u0458 j \u051b q \u0455 \u051d w \u04af \u0493 f \u050d g bear resemblance cyrillic \u04d3\u0451\u0457\u04e7 also used idn spoofed fake \u00e4\u00eb\u00ef\u00f6 komi de \u0501 shha \u04bb palochka \u04cf izhitsa \u0475 bear strong resemblance latin h l v letters either rare archaic widely supported standard fonts included wgl-4 attempting use could cause ransom note effect greek alphabet omicron \u03bf sometimes nu \u03bd appear identical latin alphabet letter lowercase used urls fonts italic type feature greek alpha \u03b1 looking like latin list increases close matches also allowed greek \u03b5\u03b9\u03ba\u03b7\u03c1\u03c4\u03c5\u03c9\u03c7\u03b3 eiknptuwxy using capital letters list expands greatly greek \u03b1\u03b2\u03b5\u03b7\u03b9\u03ba\u03bc\u03bd\u03bf\u03c1\u03c4\u03c7\u03c5\u03b6 looks identical latin abehikmnoptxyz greek \u03b1\u03b3\u03b2\u03b5\u03b7\u03ba\u03bc\u03bf\u03c0\u03c1\u03c4\u03c6\u03c7 looks similar cyrillic \u0430\u0433\u0432\u0435\u043d\u043a\u043c\u043e\u043f\u0440\u0442\u0444\u0445 cyrillic \u043b \u043b greek \u03bb certain geometric sans-serif fonts greek letters \u03ba \u043e look similar cyrillic \u043a \u043e besides greek \u03c4 \u03c6 similar cyrillic \u0442 \u0444 fonts greek \u03b4 resembles cyrillic \u0431 serbian alphabet cyrillic \u0430 also italicizes latin counterpart making possible substitute alpha vice versa lunate form sigma \u03f2\u03f2 resembles latin cc cyrillic \u0441\u0441 idn spoofed greek beta \u03b2 substitute german esszet \u00df fonts fact code page 437 treats equivalent greek sigma \u03c2 \u00e7 accented greek substitutes \u03cc\u03af\u03ac usually used \u00f3\u00ed\u00e1 many fonts last alpha resembling italic type also armenian alphabet contribute critical characters several armenian characters like \u0585 \u0578 \u057d well capital \u057f \u056c often completely identical latin characters modern fonts symbols like \u0561 resemble cyrillic \u0448. beside symbols look alike \u0581\u0570\u0578\u0585\u0566\u057d look like ghnoqu \u0575 resembles j albeit dotless \u0584 either resemble p f depending font however use armenian problematic standard fonts feature armenian glyphs whereas greek cyrillic scripts standard fonts windows prior windows 7 rendered armenian distinct font sylfaen supports armenian mixing armenian latin would appear obviously different using font sylfaen unicode typeface known ransom note effect current version tahoma used windows 7 supports armenian previous versions furthermore font differentiates latin g armenian \u0581 two letters armenian \u0571\u0577 also resemble number 2 \u0575 resembles 3 another \u057e sometimes resembles number 4 hebrew spoofing generally rare three letters alphabet reliably used samekh \u05e1 sometimes resembles vav diacritic \u05d5\u05b9 resembles heth \u05d7 resembles letter n. less accurate approximants alphanumerics also found usually accurate enough use purposes foreign branding substitution furthermore hebrew alphabet written right left trying mix left-to-right glyphs may cause problems chinese language problematic homographs many characters exist traditional regular script simplified chinese characters .org domain registering one variant renders unavailable anyone .biz single chinese-language idn registration delivers variants active domains must domain name server registrant .hk .\u9999\u6e2f also adopts policy unicode scripts homographs found include number forms roman numerals cjk compatibility enclosed cjk letters months certain abbreviations latin certain digraphs currency symbols mathematical alphanumeric symbols alphabetic presentation forms typographic ligatures two names differ accent one character may look similar instance w\u00edkipedia.org wikipedia.org dot first replaced acute accent top-level domain registries w\u00edkipedia.tld xn -- wkipedia-c2a.tld wikipedia.tld two different names may held different registrants one exception .ca reserving plain-ascii version domain prevents another registrant claiming accented version name unicode includes many characters displayed default zero-width space general icann prohibits domain characters registered regardless tld september 2017 security researcher ankit anubhav discovered idn homograph attack attackers registered ado\u1e05e.com deliver betabot trojan simplest defense web browsers support idna similar mechanisms users turn whatever support browsers could mean blocking access idna sites generally browsers permit access display idns punycode either way amounts abandoning non-ascii domain names additional defense internet explorer 7 firefox 2.0 opera 9.10 include phishing filters attempt alert users visit malicious websites.. april 2017 several browsers including chrome firefox opera displaying idns consisting purely cyrillic characters normally punycode allowing spoofing attacks chrome tightened idn restrictions version 59 prevent attack methods defense extend within browser homographic urls house malicious software still distributed without displayed punycode e-mail social networking web sites without detected user actually clicks link fake link show punycode clicked point page already begun loading browser malicious software may already downloaded onto computer television station kboi-tv raised concerns unknown source registering name completely anonymous registered domain name homographic spread april fool day joke regarding governor idaho issuing supposed ban sale music justin bieber icann implemented policy prohibiting potential internationalized tld choosing letters could resemble existing latin tld thus used homograph attacks proposed idn tlds .\u0431\u0433 bulgaria .\u0443\u043a\u0440 ukraine .\u03b5\u03bb greece rejected stalled perceived resemblance latin letters three serbian .\u0441\u0440\u0431 mongolian .\u043c\u043e\u043d later accepted three-letter tld considered safer two-letter tld since harder match normal latin iso-3166 country domains although potential match new generic domains remains generic domains far expensive registering second- third-level domain address making cost-prohibitive try register homoglyphic tld sole purpose making fraudulent domains would draw icann scrutiny russian registry operator coordination center tld ru accepts cyrillic names top-level domain .\u0440\u0444 forbidding mix latin greek characters however problem .com gtlds remains open", + "neighbors": [ + 436, + 608, + 703, + 1228 + ], + "mask": "Test" + }, + { + "node_id": 170, + "label": 2, + "text": "Incompatible_Timesharing_System:incompatible timesharing system incompatible timesharing system time-sharing operating system developed principally mit artificial intelligence laboratory help project mac name jocular complement mit compatible time-sharing system ctss software developed technically influential far beyond core user community remote guest tourist access easily available via early arpanet allowing many interested parties informally try features operating system application programs software environment major influence hacker culture described steven levy book development initiated late 1960s majority mit ai lab staff time disagreed direction taken project mac multics project started mid-1960s particularly decisions inclusion powerful system security name chosen tom knight joke name earliest mit time-sharing operating system compatible time-sharing system dated early 1960s simplifying system compared multics authors able quickly produce functional operating system lab written assembly language originally digital equipment corporation pdp-6 computer majority development use later pdp-10 although used intensively 1986 continued operate mit 1990 1995 stacken computer club sweden introduced many then-new features environment seen users philosophically significantly different provided operating systems time wide-open philosophy collaborative community direct forerunner free open-source software open-design wiki movements emacs editor macros editor originally written instantiation collection teco programs called macros later operating systems written common language systems example c language unix zetalisp lisp machine system gnu \u2018 info help system originally emacs subsystem later written complete standalone system unix-like machines several important programming languages systems developed including maclisp precursor zetalisp common lisp microplanner implemented maclisp mdl became basis infocom programming environment scheme among significant influential software subsystems developed macsyma symbolic algebra system probably important terry winograd shrdlu program developed computer game zork also originally written richard greenblatt mac hack vi top-rated chess program years first display graphical board representation default top-level command interpreter pdp-10 machine language debugger ddt usual text editor teco later emacs written teco ddt teco implemented simple dispatch tables single-letter commands thus true syntax task manager called peek local spelling turist artifact six-character filename identifier limitations traceable six sixbit encoded characters fitting single 36-bit pdp-10 word turist may also pun alan turing pioneer theoretical computer science less-complimentary term luser also applied guest users especially repeatedly engaged clueless vandalous behavior jargon file started combined effort people machines mit stanford university sail document described much terminology puns culture two ai labs related research groups direct predecessor hacker dictionary", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 99, + 134, + 171, + 185, + 187, + 251, + 265, + 308, + 322, + 324, + 349, + 353, + 379, + 380, + 387, + 413, + 434, + 465, + 477, + 506, + 583, + 650, + 664, + 720, + 721, + 728, + 753, + 754, + 797, + 860, + 884, + 891, + 925, + 941, + 954, + 961, + 966, + 990, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1213, + 1224, + 1301, + 1304, + 1388, + 1391, + 1394, + 1398, + 1415, + 1430, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 171, + "label": 2, + "text": "Live_CD:live cd live cd also live dvd live disc live operating system complete bootable computer installation including operating system runs directly cd-rom similar storage device computer memory rather loading hard disk drive live cd allows users run operating system purpose without installing making changes computer configuration live cds run computer without secondary storage hard disk drive corrupted hard disk drive file system allowing data recovery cd dvd drives steadily phased-out live cds become less popular replaced live usbs equivalent systems written onto usb flash drives added benefit write-able storage functionality live cd also available bootable live usb flash drive external hard disk drive connected usb many live cds offer option persistence writing files hard drive usb flash drive many linux distributions make iso images available burning cd dvd open source operating systems used free commercial software windows go requires license use many live cds used data recovery computer forensics disk imaging system recovery malware removal tails operating system aimed preserving privacy anonymity users allowing work sensitive documents without leaving record computer hard drive computers except earliest digital computers built form minimal built-in loader loads program succession programs storage medium operate computer initially read-only medium punched tape punched cards used initial program load introduction inexpensive read-write storage read-write floppy disks hard disks used boot media introduction audio compact disc adapted use medium storing distributing large amounts computer data data may also include application operating-system software sometimes packaged archived compressed formats later seen convenient useful boot computer directly compact disc often minimal working system install full system onto hard drive read-write optical discs either mass-produced read-only discs write-once discs used purpose first compact disc drives personal computers generally much slow run complex operating systems computers designed boot optical disc operating systems came distributed compact discs either boot floppy cd would boot specifically install onto hard drive world first oldest non-linux live cd fm towns os first released 1989 release macintosh system 7 1991 yggdrasil linux 1992 although early developers users distributions built top linux kernel could take advantage cheap optical disks rapidly declining prices cd drives personal computers linux distribution cds distros generally treated collection installation packages must first permanently installed hard disks target machine however case distributions built top linux kernel free operating system meeting resistance consumer market perceived difficulty effort risk involved installing additional partition hard disk parallel existing operating system installation term live cd coined typical pc ram large enough 52x speed cd drives cd burners widespread among pc owners finally became convenient practical boot kernel run x11 window manager gui applications directly cd without disturbing os hard disk new different situation linux operating systems updates/upgrades released quickly different distributions versions offered online especially users burning cds first linux-based 'live cd yggdrasil linux first released beta form 1992~1993 ceased production 1995 though practice functionality hampered due low throughput contemporary cd-rom drives demolinux released 1998 first linux distribution specially designed live cd linuxcare bootable business card first released 1999 first live cd focus system administration first distributed bootable business card form factor finnix first released 2000 oldest live cd still production knoppix debian-derived linux distribution released 2003 found popularity rescue disk system primary distribution right since 2003 popularity live cds increased substantially partly due linux live scripts remastersys made easy build customized live systems popular linux distributions include live cd variant cases also preferred installation medium live cds made many different uses designed demonstrate test drive particular operating system usually linux another free open source operating system software tested run particular single use without interfering system setup data system functioning normally due operating system software issues made available example data recovered machine active virus infection without virus process active causing damage virus removed defences removal bypassed although live cds load memory free optical drive uses loading data cd-rom still slower typical hard drive boot rarely default large live cd images smaller live cd images loading filesystem directly ram provide significant performance boost ram much faster hard drive uses less power experienced users operating system may also use live cd determine whether extent particular operating system version compatible particular hardware configuration certain peripherals way know beforehand computer peripheral work buying live cd used troubleshoot hardware especially hard drive fails generally recovery disc case problems live cds save user-created files windows partition usb drive network drive accessible media live backup cds create image drives back files without problems due open files inconsistent sets additional uses include several live cds dedicated specific type applications according requirements thematic user communities cds tailored needs applications subject including general knowledge tutorial specifications trial data topics covers sub topics e.g administration breaks firewall rescue security etc type live cds cases particular live dvd covers one topic packaging software appliance installable live cd live iso often beneficial single image run real hardware types virtual machines allows developers avoid complexities involved supporting multiple incompatible virtual machine images formats focus lowest common denominator instead typically booting machine live cd appliance either runs non-persistent demo mode installs user request available storage device files live cd iso image accessed microsoft windows disk image emulator daemon tools unix variants mounting loop device later versions windows i.e windows 8 later software available earlier versions allow iso mounted volume mounting live cd filesystem software live cd run directly without booting chrooting mounted filesystem live cd iso image also mounted virtual machine software virtualbox vmware workstation converted live usb using syslinux special tools automate process live cd initialization user typically may resort using one boot codes change booting behavior vary distribution distribution often accessed upon first boot screen one function keys live cds come installation utility launchable desktop icon optionally install system hard drive usb flash drive live cds access information internal and/or external hard drives diskettes usb flash drives live cds usually distributed read-only media requiring either copying rewriteable media i.e hard drive cd writer complete remastering install additional software however exceptions puppy linux recorded open multisession medium changes made use files created programs installed preferences customised written new session boot medium persisting subsequent boots term live cd came used cd containing operating system software could run without installation host computer operating systems used live include amigaos 4 amithlon aros freebsd freedos classic mac os macos microsoft windows installation repair discs os/2 reactos netbsd openbsd minix 3 plan 9 bell labs morphos opensolaris belenix others based solaris maintenance versions microsoft windows bootable cd bartpe windows pe microsoft diagnostics recovery toolset dart previously known emergency repair disk commander erd commander first personal computer operating system cd support live operations might amigaos could booted cd amiga cdtv 1990.. earlier examples live os course operating systems used floppy widely spread dos unlike previous operating systems optical media though linux os/2 live cds specifically designed run without installation onto media like hard disk drive live cd concept meant promote linux showcase abilities free open source operating system conventional personal computers microsoft windows already installed pc bootable compact disc generally conforms el torito specification introduced 1994 many linux based live cds use compressed filesystem image often cloop compressed loopback driver squashfs compressed filesystem generally doubling effective storage capacity although slowing application start resulting environment quite rich typical knoppix systems include around 1,200 separate software packages live cds reputation supporting advanced auto-configuration plug-and-play functionality came necessity avoid requiring user configure system time boots make easily usable new operating system read-only file system cd-rom drawback unable save current working data reason read-only file system often merged temporary writable file system form ram disk often default linux directories codice_1 containing users personal files configuration files codice_2 containing variable data kept ramdisk system updates frequently puppy linux live cds allow configuration added files written used later sessions modern live cds read-only file system merged ram drive using transparent techniques unionfs aufs ewf boot loaders like syslinux boot iso files usb memory devices live cds able detect use wide variety hardware including network cards graphic cards etc realtime often using facilities udev hotplug hal udisk etc.. common part distributions based linux kernel 2.6", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 185, + 187, + 265, + 272, + 322, + 323, + 334, + 353, + 364, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 723, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1090, + 1126, + 1138, + 1155, + 1179, + 1187, + 1202, + 1224, + 1241, + 1252, + 1301, + 1304, + 1317, + 1328, + 1369, + 1379, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1458, + 1474, + 1494, + 1530, + 1538, + 1539, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 172, + "label": 4, + "text": "Certificate_Transparency:certificate transparency certificate transparency ct internet security standard open source framework monitoring auditing digital certificates standard creates system public logs seek eventually record certificates issued publicly trusted certificate authorities allowing efficient identification mistakenly maliciously issued certificates 2011 reseller certificate authority comodo attacked certificate authority diginotar compromised calling attention existing flaws certificate authority ecosystem accelerating work various mechanisms prevent monitor unauthorized certificate issuance ben laurie adam langley emilia kasper began work open source framework combat issues year submitted first draft standard ietf internet draft 2012 code-name sunlight one problems digital certificate management fraudulent certificates take long time spotted reported revoked browser vendors certificate transparency would help making impossible certificate issued domain without domain owner knowing certificate transparency require side channel communication validate certificates competing technologies online certificate status protocol ocsp convergence certificate transparency also operates without need trust third party certificate transparency depends verifiable certificate transparency logs log appends new certificates ever-growing merkle hash tree seen behaving correctly log must log may accept certificates yet fully valid certificates expired monitors act clients log servers monitors check logs make sure behaving correctly inconsistency used prove log behaved correctly signatures log data structure merkle tree prevent log denying misbehavior auditors also act clients log servers certificate transparency auditors use partial information log verify log partial information google launched first certificate transparency log march 2013 september 2013 digicert became first certificate authority implement certificate transparency google chrome began requiring certificate transparency newly issued extended validation certificates 2015 began requiring certificate transparency certificates newly issued symantec june 1 2016 found issued 187 certificates without domain owners knowledge cloudflare announced ct named nimbus march 23 2018", + "neighbors": [ + 88, + 235, + 260, + 261, + 290, + 319, + 533, + 539, + 542, + 554, + 576, + 692, + 826, + 1003, + 1089, + 1240, + 1331, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 173, + "label": 9, + "text": "BBN_LISP:bbn lisp bbn lisp also stylized bbn-lisp dialect lisp programming language bolt beranek newman inc. cambridge massachusetts based l. peter deutsch implementation lisp pdp-1 called basic pdp-1 lisp developed 1960 1964 time language expanded became separate dialect 1966 bbn lisp notable predecessor interlisp", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 174, + "label": 4, + "text": "Truncated_differential_cryptanalysis:truncated differential cryptanalysis cryptography truncated differential cryptanalysis generalization differential cryptanalysis attack block ciphers lars knudsen developed technique 1994 whereas ordinary differential cryptanalysis analyzes full difference two texts truncated variant considers differences partially determined attack makes predictions bits instead full block technique applied safer idea skipjack e2 twofish camellia crypton even stream cipher salsa20", + "neighbors": [ + 32, + 104, + 284, + 289, + 382, + 633, + 969, + 995, + 1071, + 1181, + 1232, + 1233, + 1240, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 175, + "label": 7, + "text": "Grid_MP:grid mp grid mp commercial distributed computing software package developed sold univa formerly known united devices privately held company based primarily austin texas formerly known metaprocessor prior release version 4.0 however letters mp grid mp officially stand anything grid mp provides job scheduling prioritization user security restrictions selective application exclusion user-activity detection time-of-day execution controls grid mp used manage computational devices consisting corporate desktop pcs departmental servers dedicated cluster nodes computational devices arranged device groups organizational security administrative control grid mp demonstrated capable managing grids large numbers nodes use infrastructure grid.org world community grid projects world community grid project migrated open-source berkeley open infrastructure network computing software 2007 despite ability scale seamlessly hundreds thousands device nodes also suitable smaller clusters enterprise servers workstations mp grid services interface simply mgsi offers web service api via soap xml-rpc protocols http enables developers back-end application services access manipulate objects within system access api objects access controlled security restricted per-object basis since mgsi web service protocol programming language soap xml-rpc library available used interface although commonly c++ java perl php used web-based mp management console simply mpmc provides administrators simplified easy-to-use interface monitor system activity control security settings manage system objects mpmc written php programming language uses mgsi web service interactions system mp agent known ud agent versions 4.0 software agent must installed computer participate grid mp installation running jobs mp agent installed computer officially recognized grid mp device grid mp enterprise version 5.5 mp agent supported following platforms", + "neighbors": [ + 85, + 134, + 195, + 210, + 274, + 412, + 507, + 847, + 909, + 961, + 1002, + 1138, + 1227, + 1235, + 1354, + 1416, + 1470 + ], + "mask": "Test" + }, + { + "node_id": 176, + "label": 9, + "text": "Dart_(programming_language):dart programming language dart client-optimized programming language fast apps multiple platforms developed google used build mobile desktop backend web applications dart object-oriented class defined garbage-collected language using c-style syntax transcompiles optionally javascript supports interfaces mixins abstract classes reified generics static typing sound type system dart unveiled goto conference aarhus denmark october 10\u201312 2011 project founded lars bak kasper lund dart 1.0 released november 14th 2013 august 2018 dart 2.0 released language changes including sound type system ecma international formed technical committee tc52 work standardizing dart inasmuch dart compiled standard javascript works effectively modern browser ecma international approved dart language specification first edition july 2014 107th general assembly second edition december 2014 latest specification available dart language specification three main ways run dart code achieve concurrency dart uses isolates independent workers share memory instead use message passing similar erlang processes see also actor model every dart program uses least one isolate main isolate since dart 2 dart web platform longer supports isolates suggests developers use web workers instead snapshots core part dart vm snapshots files store objects runtime data google introduced flutter native mobile app development android ios flutter mobile app sdk complete framework widgets tools gives developers way build deploy mobile apps written dart flutter works firebase mobile app sdks open source dart sdk contains two dart-to-javascript compilers development dartdevc supports quick refresh cycles final version app dart2js produces deployable javascript first compiler generate javascript dart code dartc deprecated second dart-to-javascript compiler frog written dart never implemented full semantics language third dart-to-javascript compiler dart2js evolution earlier compilers dart2js written dart intended implement full dart language specification semantics march 28 2013 dart team posted update blog addressing dart code compiled javascript dart2js compiler stating runs faster handwritten javascript chrome v8 javascript engine deltablue benchmark november 18 2011 google released dart editor open-source program based eclipse components mac os x windows linux-based operating systems editor supports syntax highlighting code completion javascript compiling running web server dart applications debugging august 13 2012 google announced release eclipse plugin dart development april 18 2015 google announced dart editor would retired favor jetbrains integrated development environment ide recommended ide language dart plugin available intellij idea pycharm phpstorm webstorm plugin supports many features syntax highlighting code completion analysis refactoring debugging plugins available editors like sublime text atom emacs vim visual studio code 2013 chromium team began work open source chrome app-based development environment reusable library gui widgets codenamed spark project later renamed chrome dev editor built dart contained spark powered polymer june 2015 google transferred cde project github free software project ceased active investment cde april 2019 chrome dev editor longer active development dart team created dartpad start 2015 provide easier way start using dart fully online editor users experiment dart application programming interfaces apis run dart code provides syntax highlighting code analysis code completion documentation html css editing 2013 john mccutchan announced created performant interface single instruction multiple data simd instruction sets dart interface consists two types instances types immutable optimized code mapped directly simd registers operations expressed dart typically compiled one instruction overhead similar c c++ intrinsics benchmarks 4\u00d74 matrix multiplication 3d vertex transformation mandelbrot set visualization show near 400 speedup compared scalar code written dart hello world example main function calculate nth fibonacci number int fib int n n 2 fib n 1 fib n 2 1 // fibonacci function implementation ternary operator dart // code shall read // int n 2 return fib n 1 fib n 2 // otherwise return int 1 result void main simple class // import math library get access sqrt function import 'dart math math // create class point class point // dart programs start main void main dart descendant algol language family alongside c java c javascript others method cascade syntax provides syntactic shortcut invoking several methods one another object adopted smalltalk dart mixins influenced strongtalk ruby dart makes use isolates concurrency security unit structuring applications isolate concept builds upon actor model famously implemented erlang mirror api performing controlled secure reflection first proposed paper gilad bracha member dart team david ungar originally implemented self dart initially mixed reception dart initiative criticized fragmenting web due original plans include dart vm chrome plans dropped focus instead compiling dart javascript", + "neighbors": [ + 19, + 24, + 31, + 41, + 50, + 69, + 78, + 81, + 131, + 132, + 134, + 182, + 216, + 306, + 347, + 373, + 422, + 480, + 502, + 509, + 538, + 547, + 553, + 559, + 567, + 579, + 593, + 671, + 682, + 704, + 716, + 742, + 775, + 777, + 796, + 825, + 837, + 872, + 919, + 936, + 948, + 959, + 961, + 962, + 1028, + 1061, + 1082, + 1120, + 1129, + 1138, + 1185, + 1221, + 1225, + 1227, + 1235, + 1259, + 1264, + 1265, + 1280, + 1310, + 1311, + 1318, + 1324, + 1371, + 1388, + 1411, + 1419, + 1457, + 1480, + 1500, + 1596, + 1633 + ], + "mask": "Train" + }, + { + "node_id": 177, + "label": 3, + "text": "Soul_of_a_Robot:soul robot soul robot computer game sequel nonterraqueous zx spectrum amstrad cpc msx released mastertronic 1985 sometimes called nonterraqueous 2 attempt destroy rogue computer nonterraqueous failed computer threatens self-destruct old age taking planet nonterraqueous people planet create another robot one mind man kamikaze mission computer core must locate three keys allow transport next section self-destructing inside computer core gameplay rather different prequel nonterraqueous robot controlled player fly like previous game leaps rather like ordinary platform game however ability fly available game necessary complete robot still psyche value must allowed decrease zero decreases certain actions laser previous game also remains game considered much difficult prequel relying perfectly timed aimed jumps player able choose five strengths jump order progress enjoyed much less commercial success gameplay much slower jumps flying take lot time effort perform correctly also seems certain influence underwurlde gameplay sounds used game soul robot also much smaller game map containing third many individual screens prequel 256 rooms", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 178, + "label": 7, + "text": "Apache_Hive:apache hive apache hive data warehouse software project built top apache hadoop providing data query analysis hive gives sql-like interface query data stored various databases file systems integrate hadoop traditional sql queries must implemented mapreduce java api execute sql applications queries distributed data hive provides necessary sql abstraction integrate sql-like queries hiveql underlying java without need implement queries low-level java api since data warehousing applications work sql-based querying languages hive aids portability sql-based applications hadoop initially developed facebook apache hive used developed companies netflix financial industry regulatory authority finra amazon maintains software fork apache hive included amazon elastic mapreduce amazon web services apache hive supports analysis large datasets stored hadoop hdfs compatible file systems amazon s3 filesystem alluxio provides sql-like query language called hiveql schema read transparently converts queries mapreduce apache tez spark jobs three execution engines run hadoop resource negotiator yarn yet another resource negotiator accelerate queries provides indexes including bitmap indexes features hive include default hive stores metadata embedded apache derby database client/server databases like mysql optionally used first four file formats supported hive plain text sequence file optimized row columnar orc format rcfile apache parquet read via plugin versions later 0.10 natively starting 0.13 additional hive plugins support querying bitcoin blockchain major components hive architecture based sql hiveql strictly follow full sql-92 standard hiveql offers extensions sql including multitable inserts create table select offers basic support indexes hiveql lacked support transactions materialized views limited subquery support support insert update delete full acid functionality made available release 0.14 internally compiler translates hiveql statements directed acyclic graph mapreduce tez spark jobs submitted hadoop execution word count program counts number times word occurs input word count written hiveql brief explanation statements follows checks table codice_1 exists drops creates new table called codice_1 single column type codice_3 called codice_4 loads specified file directory case \u201c input_file \u201d table codice_5 specifies target table data loaded re-written otherwise data would appended query creates table called codice_6 two columns codice_7 codice_8 query draws input inner query query serves split input words different rows temporary table aliased codice_9 groups results based keys results codice_8 column holding number occurrences word codice_7 column sorts words alphabetically storage querying operations hive closely resemble traditional databases hive sql dialect lot differences structure working hive comparison relational databases differences mainly hive built top hadoop ecosystem comply restrictions hadoop mapreduce schema applied table traditional databases traditional databases table typically enforces schema data loaded table enables database make sure data entered follows representation table specified table definition design called schema write comparison hive verify data table schema write instead subsequently run time checks data read model called schema read two approaches advantages drawbacks checking data table schema load time adds extra overhead traditional databases take longer time load data quality checks performed data load time ensure data corrupt early detection corrupt data ensures early exception handling since tables forced match schema after/during data load better query time performance hive hand load data dynamically without schema check ensuring fast initial load drawback comparatively slower performance query time hive advantage schema available load time instead generated later dynamically transactions key operations traditional databases typical rdbms hive supports four properties transactions acid atomicity consistency isolation durability transactions hive introduced hive 0.13 limited partition level recent version hive 0.14 functions fully added support complete acid properties hive 0.14 later provides different row level transactions insert delete update enabling insert update delete transactions require setting appropriate values configuration properties codice_12 codice_13 codice_14 hive v0.7.0 added integration hadoop security hadoop began using kerberos authorization support provide security kerberos allows mutual authentication client server system client \u2019 request ticket passed along request previous versions hadoop several issues users able spoof username setting codice_15 property also mapreduce operations run user hadoop mapred hive v0.7.0 \u2019 integration hadoop security issues largely fixed tasktracker jobs run user launched username longer spoofed setting codice_15 property permissions newly created files hive dictated hdfs hadoop distributed file system authorization model uses three entities user group others three permissions read write execute default permissions newly created files set changing umask value hive configuration variable codice_17", + "neighbors": [ + 192, + 197, + 292, + 296, + 318, + 620, + 715, + 796, + 864, + 874, + 1005, + 1019, + 1048, + 1091, + 1138, + 1163, + 1242, + 1254, + 1323, + 1454, + 1583, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 179, + "label": 1, + "text": "World_Checklist_of_Selected_Plant_Families:world checklist selected plant families world checklist selected plant families usually abbreviated wcsp international collaborative programme provides latest peer reviewed published opinions accepted scientific names synonyms selected plant families maintained royal botanic gardens kew available online allowing searches names families genera species well ability create checklists project traces history work done 1990s kew researcher rafa\u00ebl govaerts checklist genus quercus influenced global strategy plant conservation project expanded 173 families seed plants included coverage monocotyledon families complete families added complementary project called international plant names index ipni kew also involved ipni aims provide details publication aim determine accepted species names delay year newly published names automatically added ipni wcsp wcsp also one underlying databases plant list created kew missouri botanical garden unveiled 2010", + "neighbors": [ + 96, + 933, + 1478 + ], + "mask": "Test" + }, + { + "node_id": 180, + "label": 3, + "text": "Keystone_Kapers:keystone kapers keystone kapers video game published activision atari 2600 april 1983 later ported atari 5200 atari 8-bit family colecovision 1984 msx inspired mack sennett slapstick keystone cops series silent films object game officer keystone kelly player catch harry hooligan escape department store keystone kapers written activision designer garry kitchen game takes place side-view display three-story department store roof store eight times wider portion main display screen scrolls left right player reaches edges movement levels accomplished escalators located alternating ends map elevator center mini-map bottom screen provides overall view store location players player controls officer keystone kelly joystick used run right left along given floor reaches escalator taken next floor kelly also use elevator center map move requires careful timing moves kelly begins game lower right first floor normally begins running left reach escalator second floor harry hooligan starts game center second floor immediately begins running right attempt reach elevator third floor hooligan continues moving floors attempt reach roof via escalator left side third floor succeeds escapes trip takes 50 seconds timer top screen counts remaining time kelly runs significantly faster hooligan normally catch time straight run penalties kelly also use elevator get levels moves ahead hooligan hooligan reverse direction start back store aided ability jump levels either end map something kelly means kelly use elevators carefully risk stuck higher floor timer runs slowing kelly progress number still moving obstacles like radios beach balls shopping carts others jump duck pushing joystick touching objects causes nine-second penalty later levels flying toy biplanes cause player lose life upon contact game begins player given three lives one lost every round hooligan remains uncaught timer runs game proceeds rounds player runs lives extra lives awarded every 10,000 points maximum three kelly catches harry player score points based amount time left levels 1-9 player score left clock multiplied 100 points levels 10-15 amount left clock multiplied 200 points afterwards amount left clock multiplied 300 points kelly also pick suitcases bags money 50 points early video games end game level gets progressively harder adding and/or faster hazards kelly loses lives atari 2600 version keystone kapers received certificate merit category 1984 videogame year less 16k rom 5th annual arkie awards antic called atari 8-bit computer version perfect game anyone remarked superb animation deseret news gave colecovision version keystone kapers 3 stars praised game graphical improvement original", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 181, + "label": 7, + "text": "Huddle_(software):huddle software huddle privately held cloud-based collaboration software company founded london 2006 alastair mitchell andy mcloughlin company co-headquartered london san francisco additional offices washington d.c. new york city company raised approximately 40 million three funding rounds jafco ventures eden ventures matrix partners angel investors august 2017 huddle acquired turn/river capital san francisco-based private equity firm huddle used department energy climate change charity barnardo \u2019 september 12 2013 huddle announced desktop integrations huddle mac huddle windows huddle outlook launch huddle note followed december 2013 enabling simple content creation cloud along redesigned ios app huddle office integration launched following year 2013 company received award \u201c emerging star year \u201d uk tech awards 2013 supplier year accolade computer weekly \u2019 european user awards enterprise software company \u2019 ceo alastair mitchell selected one computer weekly \u2019 \u201c ten rising stars \u201d publication \u2019 cw tech 50 awards 2014 huddle announced secured global enterprise-wide agreement grant thornton make secure cloud collaboration technology available member firms across globe addition williams lea global business process outsourcing bpo company signed enterprise-wide agreement huddle adding suite online tools increase speed collaborates internally externally huddle used 80 central uk government departments including ministry justice moj department environment food rural affairs defra department energy climate change department business innovation skills bis end august 2014 huddle secured 206 contracts via g-cloud framework september 12 2012 huddle announced fisma-certified instance cloud-based content collaboration platform developed u.s. government agencies organizations result strategic partnership technology development agreement in-q-tel non-profit strategic investment firm identifies innovative technology solutions support missions u.s. intelligence community instance cloud collaboration services enables u.s. government community securely discover access work content people technology currently developed two iqt customer agencies department homeland security science technology directorate national geospatial-intelligence agency", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 182, + "label": 8, + "text": "Googlebot:googlebot googlebot web crawler software used google collects documents web build searchable index google search engine name actually used refer two different types web crawlers desktop crawler simulate desktop users mobile crawler simulate mobile user website probably crawled googlebot desktop googlebot mobile subtype googlebot identified looking user agent string request however crawler types obey product token useent token robots.txt developer selectively target either googlebot mobile googlebot desktop using robots.txt webmaster wishes restrict information site available googlebot another well-behaved spider appropriate directives robots.txt file adding meta tag codice_1 web page googlebot requests web servers identifiable user-agent string containing googlebot host address containing googlebot.com currently googlebot follows href links src links increasing evidence googlebot execute javascript parse content generated ajax calls well many theories regarding advanced googlebot ability process javascript opinions ranging minimal ability derived custom interpreters currently googlebot uses web rendering service wrs based chromium rendering engine version 74 7th may 2019 googlebot discovers pages harvesting links every page finds follows links web pages new web pages must linked known pages web order crawled indexed manually submitted webmaster problem webmasters low-bandwidth web hosting plans often noted googlebot takes enormous amount bandwidth cause websites exceed bandwidth limit taken temporarily especially troublesome mirror sites host many gigabytes data google provides search console allow website owners throttle crawl rate often googlebot crawl site depends crawl budget crawl budget estimation often website updated site crawl budget determined many incoming links frequently site updated technically googlebot development team crawling indexing team uses several defined terms internally takes crawl budget stands announced may 2019 googlebot runs latest chromium rendering engine googlebot regularly update rendering engine stay date new version googlebot supports 1000+ features compared previous version important cited official google documentation", + "neighbors": [ + 12, + 14, + 24, + 41, + 131, + 176, + 216, + 422, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1185, + 1259, + 1265, + 1310, + 1371, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 183, + "label": 3, + "text": "Dragonworld_(video_game):dragonworld video game dragonworld interactive fiction computer game graphics game published telarium formerly known trillium subsidiary spinnaker software year 1984 game based novel written 1979 byron preiss michael reaves text game written j. brynne stephens german reviewer recognized detailed graphics atmospheric fantasy prose text parser graphics storyline got score sehr gut good", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 184, + "label": 5, + "text": "Asynchronous_Layered_Coding:asynchronous layered coding asynchronous layered coding alc internet protocol content delivery reliable massively scalable multiple-rate congestion-controlled manner specified rfc 5775 ietf proposed standard protocol specifically designed provide massive scalability using ip multicast underlying network service massive scalability context means number concurrent receivers object potentially millions aggregate size objects delivered session ranges hundreds kilobytes hundreds gigabytes receiver initiate reception object asynchronously reception rate receiver session maximum fair bandwidth available receiver sender supported using single sender alc focused reliable content delivery goal deliver objects quickly possible receiver time remaining network friendly competing traffic thus congestion control used conjunction alc strive maximize use available bandwidth receivers sender time backing aggressively face competing traffic sender side alc consists generating packets based objects delivered within session sending appropriately formatted packets appropriate rates channels associated session receiver side alc consists joining appropriate channels associated session performing congestion control adjusting set joined channels associated session response detected congestion using packets reliably reconstruct objects information flow alc session form data packets sent single sender channels receivers join receive data alc specify session description needed receivers join session mechanisms receivers obtain required information outside scope alc application uses alc may require receivers report statistics reception experience back sender mechanisms receivers report back statistics outside scope alc general alc designed minimal protocol instantiation provides reliable content delivery without unnecessary limitations scalability basic protocol", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 185, + "label": 9, + "text": "Protected_mode:protected mode computing protected mode also called protected virtual address mode operational mode x86-compatible central processing units cpus allows system software use features virtual memory paging safe multi-tasking designed increase operating system control application software processor supports x86 protected mode powered begins executing instructions real mode order maintain backward compatibility earlier x86 processors protected mode may entered system software sets one descriptor table enables protection enable pe bit control register 0 cr0 protected mode first added x86 architecture 1982 release intel 80286 286 processor later extended release 80386 386 1985 due enhancements added protected mode become widely adopted become foundation subsequent enhancements x86 architecture although many enhancements added instructions new registers also brought benefits real mode intel 8086 predecessor 286 originally designed 20-bit address bus memory allowed processor access 2 bytes memory equivalent 1 megabyte time 1 megabyte considered relatively large amount memory designers ibm personal computer reserved first 640 kilobytes use applications operating system remaining 384 kilobytes bios basic input/output system memory add-on devices cost memory decreased memory use increased 1 mb limitation became significant problem intel intended solve limitation along others release 286 initial protected mode released 286 widely used example used microsoft xenix around 1984 coherent minix several shortcomings inability access bios dos calls due inability switch back real mode without resetting processor prevented widespread usage acceptance additionally hampered fact 286 allowed memory access 16 bit segments via four segment registers meaning 4*2 bytes equivalent 256 kilobytes could accessed time changing segment register protected mode caused 6-byte segment descriptor loaded cpu memory segment register load instruction took many tens processor cycles making much slower 8086 therefore strategy computing segment addresses on-the-fly order access data structures larger 128 kilobytes combined size two data segments became impractical even programmers mastered 8086/8088 286 maintained backwards compatibility precursor 8086 initially entering real mode power real mode functioned virtually identically 8086 allowing vast majority existing 8086 software run unmodified newer 286 real mode also served basic mode protected mode could set solving sort chicken-and-egg problem access extended functionality 286 operating system would set tables memory controlled memory access protected mode set addresses tables special registers processor set processor protected mode enabled 24 bit addressing allowed processor access 2 bytes memory equivalent 16 megabytes release 386 1985 many issues preventing widespread adoption previous protected mode addressed 386 released address bus size 32 bits allows 2 bytes memory accessing equivalent 4 gigabytes segment sizes also increased 32 bits meaning full address space 4 gigabytes could accessed without need switch multiple segments addition increased size address bus segment registers many new features added intention increasing operational security stability protected mode used virtually modern operating systems run x86 architecture microsoft windows linux many others furthermore learning failures 286 protected mode satisfy needs multiuser dos intel added separate virtual 8086 mode allowed multiple virtualized 8086 processors emulated 386 hardware support required virtualizing protected mode however wait another 20 years release 386 following additional features added protected mode release 386 protected mode offer direct method switch back real mode protected mode entered ibm devised workaround implemented ibm involved resetting cpu via keyboard controller saving system registers stack pointer often interrupt mask real-time clock chip ram allowed bios restore cpu similar state begin executing code reset later triple fault used reset 286 cpu lot faster cleaner keyboard controller method depend ibm at-compatible hardware work 80286 cpu system enter protected mode global descriptor table gdt must first created minimum three entries null descriptor code segment descriptor data segment descriptor ibm-compatible machine a20 line 21st address line also must enabled allow use address lines cpu access beyond 1 megabyte memory first 20 allowed used power-up guarantee compatibility older software written intel 8088-based ibm pc pc/xt models performing two steps pe bit must set cr0 register far jump must made clear prefetch input queue release 386 protected mode could exited loading segment registers real mode values disabling a20 line clearing pe bit cr0 register without need perform initial setup steps required 286 protected mode number features designed enhance operating system control application software order increase security system stability additions allow operating system function way would significantly difficult even impossible without proper hardware support protected mode four privilege levels rings numbered 0 3 ring 0 privileged 3 least use rings allows system software restrict tasks accessing data call gates executing privileged instructions environments operating system device drivers run ring 0 applications run ring 3 according intel 80286 programmer reference manual part binary compatibility real-mode code ability access 16 mb physical memory 1 gb virtual memory apparent changes application programmers without limitations application utilized relied techniques would n't run reality almost dos application programs violated rules due limitations virtual 8086 mode introduced 386 despite potential setbacks windows 3.0 successors take advantage binary compatibility real mode run many windows 2.x windows 2.0 windows 2.1x applications run real mode windows 2.x protected mode release 386 protected mode offers intel manuals call virtual 8086 mode virtual 8086 mode designed allow code previously written 8086 run unmodified concurrently tasks without compromising security system stability virtual 8086 mode however completely backwards compatible programs programs require segment manipulation privileged instructions direct hardware access use self-modifying code generate exception must served operating system addition applications running virtual 8086 mode generate trap use instructions involve input/output i/o negatively impact performance due limitations programs originally designed run 8086 run virtual 8086 mode result system software forced either compromise system security backwards compatibility dealing legacy software example compromise seen release windows nt dropped backwards compatibility ill-behaved dos applications real mode logical address points directly physical memory location every logical address consists two 16 bit parts segment part logical address contains base address segment granularity 16 bytes i.e segment may start physical address 0 16 32 ... 2-16 offset part logical address contains offset inside segment i.e physical address calculated codice_1 address line a20 enabled respectively segment_part \u00d7 16 offset mod 2 a20 every segment size 2 bytes protected mode replaced 16-bit selector 13 upper bits bit 3 bit 15 contain index entry inside descriptor table next bit bit 2 specifies whether operation used gdt ldt lowest two bits bit 1 bit 0 selector combined define privilege request values 0 3 represent highest lowest privilege respectively means byte offset descriptors descriptor table 16-bit selector provided lower three bits zeroed descriptor table entry defines real linear address segment limit value segment size attribute bits flags segment address inside descriptor table entry length 24 bits every byte physical memory defined bound segment limit value inside descriptor table entry length 16 bits segment length 1 byte 2 byte calculated linear address equals physical memory address segment address inside descriptor table entry expanded 32 bits every byte physical memory defined bound segment limit value inside descriptor table entry expanded 20 bits completed granularity flag g-bit short 386 processor also uses 32 bit values address offset maintaining compatibility 286 protected mode new default flag d-bit short added d-bit code segment 0 commands inside segment interpreted 16-bit commands default 1 interpreted 32-bit commands addition adding virtual 8086 mode 386 also added paging protected mode paging system software restrict control task access pages sections memory many operating systems paging used create independent virtual address space task preventing one task manipulating memory another paging also allows pages moved primary storage onto slower larger secondary storage hard disk drive allows memory used physically available primary storage x86 architecture allows control pages two arrays page directories page tables originally page directory size one page four kilobytes contained 1,024 page directory entries pde although subsequent enhancements x86 architecture added ability use larger page sizes pde contained pointer page table page table also originally four kilobytes size contained 1,024 page table entries pte pte contained pointer actual page physical address used four-kilobyte pages used given time one page directory may active use use rings privileged call gates task state segment tss introduced 286 preemptive multitasking made possible x86 architecture tss allows general-purpose registers segment selector fields stacks modified without affecting another task tss also allows task privilege level i/o port permissions independent another task many operating systems full features tss used commonly due portability concerns due performance issues created hardware task switches result many operating systems use hardware software create multitasking system operating systems like os/2 1.x try switch processor protected real modes slow unsafe real mode program easily crash computer os/2 1.x defines restrictive programming rules allowing family api bound program run either real protected mode early unix operating systems os/2 1.x windows used mode windows 3.0 able run real mode programs 16-bit protected mode switching protected mode decided preserve single privilege level model used real mode windows applications dlls hook interrupts direct hardware access lasted windows 9x series windows 1.x 2.x program written properly avoids segment arithmetic run way real protected modes windows programs generally avoid segment arithmetic windows implements software virtual memory scheme moving program code data memory programs running manipulating absolute addresses dangerous programs keep handles memory blocks running starting old program windows 3.0 running protected mode triggers warning dialog suggesting either run windows real mode obtain updated version application updating well-behaved programs using mark utility memory parameter avoids dialog possible gui programs running 16-bit protected mode gui programs running real mode windows 3.1 real mode longer supported could accessed modern 32-bit operating systems virtual 8086 mode still used running applications e.g dpmi compatible dos extender programs virtual dos machines windows 3.x applications windows windows subsystem certain classes device drivers e.g changing screen-resolution using bios functionality os/2 2.0 later control 32-bit kernel however 64-bit operating systems run long mode longer use since virtual 8086 mode removed long mode", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 78, + 85, + 99, + 134, + 170, + 171, + 187, + 225, + 234, + 265, + 270, + 322, + 347, + 387, + 413, + 465, + 477, + 583, + 664, + 728, + 735, + 754, + 797, + 860, + 868, + 884, + 891, + 941, + 957, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1202, + 1224, + 1287, + 1301, + 1346, + 1379, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1533, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 186, + "label": 4, + "text": "Data_breach:data breach data breach intentional unintentional release secure private/confidential information untrusted environment terms phenomenon include unintentional information disclosure data leak information leakage also data spill incidents range concerted attacks black hats associated organized crime political activist national governments careless disposal used computer equipment data storage media unhackable source definition data breach security incident sensitive protected confidential data copied transmitted viewed stolen used individual unauthorized data breaches may involve financial information credit card bank details personal health information phi personally identifiable information pii trade secrets corporations intellectual property data breaches involve overexposed vulnerable unstructured data \u2013 files documents sensitive information according nonprofit consumer organization privacy rights clearinghouse total 227,052,199 individual records containing sensitive personal information involved security breaches united states january 2005 may 2008 excluding incidents sensitive data apparently actually exposed many jurisdictions passed data breach notification laws requiring company subject data breach inform customers takes steps remediate possible injuries may include incidents theft loss digital media computer tapes hard drives laptop computers containing media upon information stored unencrypted posting information world wide web computer otherwise accessible internet without proper information security precautions transfer information system completely open appropriately formally accredited security approved level unencrypted e-mail transfer information information systems possibly hostile agency competing corporation foreign nation may exposed intensive decryption techniques iso/iec 27040 defines data breach compromise security leads accidental unlawful destruction loss alteration unauthorized disclosure access protected data transmitted stored otherwise processed notion trusted environment somewhat fluid departure trusted staff member access sensitive information become data breach staff member retains access data termination trust relationship distributed systems also occur breakdown web trust data quality one way reducing risk data breach partly allows owner data rate data according importance give better protection important data incidents publicized media involve private information individuals e.g social security numbers loss corporate information trade secrets sensitive corporate information details contracts government information frequently unreported compelling reason absence potential damage private citizens publicity around event may damaging loss data working inside organization major cause data breaches estimates breaches caused accidental human factor errors range 37 ponemon institute 14 verizon 2013 data breach investigations report external threat category includes hackers cybercriminal organizations state-sponsored actors professional associations asset managers work aggressively professionals educate best risk-reduction practices internal external threats assets software information security prevention may deflect high percentage attempts ultimately motivated attacker likely find way given network one top 10 quotes cisco ceo john chambers two types companies hacked n't know hacked fbi special agent cyber special operations leo taddeo warned bloomberg television notion protect perimeter falling wayside detection critical celebrities found victims inappropriate medical record access breaches albeit individual basis part typically much larger breach given series medical data breaches lack public trust countries requiring safeguards put place protect security confidentiality medical information shared electronically give patients important rights monitor medical records receive notification loss unauthorized acquisition health information united states eu imposed mandatory medical data breach notifications reportable breaches medical information increasingly common united states although incidents pose risk identity theft serious consequences cases lasting damage either breach security remedied information accessed unscrupulous people thief interested hardware stolen data contains nevertheless incidents become publicly known customary offending party attempt mitigate damages providing victim subscription credit reporting agency instance new credit cards instruments case target 2013 breach cost target significant drop profit dove estimated 40 percent 4th quarter year end 2015 target published report claiming total loss 290 million data breach related fees yahoo breach disclosed 2016 may one expensive today may lower price acquisition verizon 1 billion verizon later released renegotiation yahoo agreeing lower final price 4.8 4.48 billion cybercrime cost energy utilities companies average 12.8 million year lost business damaged equipment according dnv gl international certification body classification society based norway data breaches cost healthcare organizations 6.2 billion last two years presumably 2014 2015 according ponemon study health care 25 million people health care stolen resulting identity theft 6 million people out-of-pocket cost victims close 56 billion notoriously difficult obtain information direct indirect value loss resulting data breach common approach assess impact data breaches study market reaction incident proxy economic consequences typically conducted use event studies measure event economic impact constructed using security prices observed relatively short period time several studies studies published varying findings including works kannan rees sridhar 2007 cavusoglu mishra raghunathan 2004 campbell gordon loeb lei 2003 well schatz bashroush 2017 notable incidents include", + "neighbors": [ + 12, + 43, + 134, + 162, + 379, + 528, + 600, + 708, + 961, + 965, + 1121, + 1129, + 1368, + 1433, + 1472, + 1514 + ], + "mask": "Train" + }, + { + "node_id": 187, + "label": 2, + "text": "RT-11:rt-11 rt-11 rt real-time discontinued small single-user real-time operating system digital equipment corporation pdp-11 family 16-bit computers rt-11 first implemented 1970 widely used real-time systems process control data acquisition across full line pdp-11 computers rt-11 systems support preemptive multitasking versions could run multiple simultaneous applications variants monitors provided background job fb xm zm monitors also provided foreground job well six system jobs selected via sysgen system generation program tasks fixed priorities background job lowest foreground job highest possible switch jobs system console user interface sysgen could generate monitor provided single background job sb xb zb variants rt-11 written assembly language heavy use conditional assembly macro programming features macro-11 assembler allowed significant degree configurability allowed programmers specify high-level instructions otherwise unprovided machine code rt-11 distributions included source code operating system device drivers comments removed program named sysgen would build operating system drivers according user-specified configuration developer documentation included kernel listing included comments rt-11 device drivers loadable except prior v4.0 device driver system device boot device built kernel configuration time rt-11 commonly used device control data acquisition common developers write enhance device drivers dec encouraged driver development making hardware subsystems bus structure code open documenting internals operating system encouraging third-party hardware software vendors fostering development digital equipment computer users society users generally operated rt-11 via printing terminal video terminal originally via strap-selectable current-loop conventional teletypes rs-232 later rs-422 well interface one cpu cards dec also supported vt11 vs60 graphics display devices vector graphics terminals graphic character generator displaying text light pen graphical input third-party favorite tektronix 4010 family keyboard monitor kmon interpreted commands issued user would invoke various utilities command string interpreter csi forms commands rt-11 command language many features commands device names found later dos line operating systems heavily borrowed rt-11 csi form expected input output filenames options 'switches rt-11 precise order syntax command-line switches separated sign rather used unix-like operating systems commands full form short one could contracted example rename command could contracted ren batch files batch processor could used issue series commands rudimentary control flow batch files extension .bat later releases rt-11 possible invoke series commands using .com command file would executed sequence flow control even later possible execute series commands great control use indirect command file processor ind took .cmd control files input files extension .sav sort executables known save files rt-11 save command could used save contents memory disk file could loaded executed later time allowing session saved save command along get start reenter examine deposit basic commands implemented kmon commands utilities later borrowed dos-line operating systems commands include dir copy rename assign cls delete type help others format command used physical disk formatting although capable creating file system purpose init command used analogue dos command format /q commands supported use wildcards file names physical device names specified form 'dd n 'dd two-character alphabetic device name optional n unit number 0\u20137 unit number omitted unit 0 assumed example tt referred console terminal lp lp0 referred parallel line printer dx0 dy1 dl4 referred disk volumes rx01 unit 0 rx02 unit 1 rl01 rl02 unit 4 respectively logical device names consisted 1\u20133 alphanumeric characters used place physical device name accomplished using codice_1 command example one might issue codice_2 would cause future references 'abc map 'dl0 reserved logical name dk referred current default device device included file specification dk assumed reserved logical name sy referred system device device system booted later versions rt-11 allowed specification 64 units 0\u201377 octal certain devices device name still limited three alphanumeric characters feature enabled sysgen selection applied du ld device handlers two cases device name form became 'dnn 'd 'd du device l ld device 'nn 00\u201377 octal rt-11 distributed utilities allowed user perform many actions utilities dir dup pip format allowed user manage disk volumes teco edit visual editors ked dec vt100 k52 dec vt52 allowed user create edit source data files macro link libr allowed user build executables odt vdt sd device allowed user debug programs dec version runoff allowed user produce documents finally vtcom allowed user connect use transfer files another computer system phone using modem system complete enough handle many modern personal computing tasks large amounts free user-contributed software rt-11 available digital equipment computer users society decus including implementation c. although tools develop debug assembly-language programs provided languages including c fortran pascal several versions basic available dec layered products extra cost versions programming languages also available third-party sources even possible network rt-11 machines using decnet internet protocols developed third-party sources rt-11 operating system could booted perform useful work machine consisting two 8-inch 250kb floppy disks 56kb memory could support 8 terminals boot options include rk05 2.5mb removable hard disk platter magnetic tape distributions available pre-installed punched tape magnetic tape cartridge tape floppy disk minimal complete system supporting single real-time user could run single floppy disk 8k 16-bit words 16kb ram including user programs facilitated support swapping overlaying realize operation small memory system keyboard command user interface would swapped execution user program swapped memory upon program termination system supported real-time clock printing terminal vt11 vector graphic unit 16 channel 100 khz a/d converter 2 channel d/a 9600 baud serial port 16 bit bidirectional boards etc rt-11 implemented simple fast file system employing six-character filenames three-character extensions 6.3 encoded radix-50 packed nine characters three 16-bit words six bytes files contiguous meaning file occupied consecutive blocks minimally addressable unit disk storage 512 bytes disk meant entire file could read written quickly side effect file system structure files created deleted volume time unused disk blocks would likely remain contiguous could become limiting factor creation large files remedy periodically \u201c squeeze \u201d squish disk consolidate unused portions volume one directory preallocated beginning volume directory consists array entries one per file unallocated space directory entry 8 16-bit words though sysgen option allowed extra application-specific storage many rt11 programs need specialized peripherals direct access hardware could directly executed using rt11 rts run-time system rsts/e timesharing system rtem rt emulator various releases rsx-11 vms implementation dcl rt-11 increased compatibility dec operating systems although operating system commands options unique operating system number commands command options common dec also sold rsx-11 multiuser multitasking operating system realtime features rsts/e originally named rsts-11 multiuser time-sharing system rt-11 remained operating system choice data acquisition systems real time response required unix operating system also became popular lacked real-time features extremely small size rt-11 rt-11 ran members dec pdp-11 family q-bus- unibus-based pdp-11/05 first target 1970 final pdp-11 implementations pdp-11/93 /94 addition ran professional series pdt-11 programmed data terminal systems also dec since pdp-11 architecture implemented replacement products companies e.g. m100 family mentec reverse-engineered clones countries e.g. dvk soviet union rt-11 runs machines well fuzzball routing software internet protocols capable running rt-11 programs hammondsoftware distributed number rt-11 compatible operating systems including stareleven early multi-computer system shareplus multi-process/multi-user implementation rt-11 borrowed architectural concepts vax/vms operating system rt-11 device drivers required operation transparent device access pdp-11s vax/vms supported network option limited rsx-11 application compatibility also available shareplus strongest user base europe h computing developed distributed tsx-plus multi-user multi-processing implementation rt-11 thing n't handle boot process tsx-plus machine required boot rt-11 first running tsx-plus user program tsx-plus running would take complete control machine rt-11 provided true memory protection users users provided user accounts maintained account separation disk volumes implemented superset rt-11 emt programmed requests rt-11 programs generally ran unmodified tsx-plus fact rt-11 utilities used as-is tsx-plus device drivers generally required slight modifications users could choose four variants differing levels support multitasking several specialized pdp-11 systems sold based rt-11 several clones rt-11 made ussr", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 99, + 134, + 170, + 171, + 185, + 265, + 306, + 322, + 353, + 380, + 387, + 434, + 465, + 503, + 579, + 583, + 650, + 664, + 720, + 721, + 735, + 754, + 771, + 779, + 797, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 998, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1221, + 1224, + 1301, + 1304, + 1391, + 1394, + 1397, + 1415, + 1441, + 1456, + 1468, + 1494, + 1530, + 1546, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 188, + "label": 3, + "text": "CPU_socket:cpu socket computer hardware cpu socket cpu slot contains one mechanical components providing mechanical electrical connections microprocessor printed circuit board pcb allows placing replacing central processing unit cpu without soldering common sockets retention clips apply constant force must overcome device inserted chips large number pins zero insertion force zif sockets preferred common sockets include pin grid array pga land grid array lga designs apply compression force either handle pga type surface plate lga type put place provides superior mechanical retention avoiding risk bending pins inserting chip socket certain devices use ball grid array bga sockets although require soldering generally considered user replaceable cpu sockets used motherboard desktop server computers allow easy swapping components also used prototyping new circuits laptops typically use surface-mount cpus take less space motherboard socketed part cpu socket made plastic often comes lever latch metal contacts pins lands cpu many packages keyed ensure proper insertion cpu cpus pga pin grid array package inserted socket included latch closed cpus lga land grid array package inserted socket latch plate flipped position atop cpu lever lowered locked place pressing cpu contacts firmly socket lands ensuring good connection well increased mechanical stability table legend slotkets special adapters using socket processors bus-compatible slot motherboards", + "neighbors": [ + 270, + 457, + 647, + 755, + 776, + 1507 + ], + "mask": "Test" + }, + { + "node_id": 189, + "label": 4, + "text": "Ipfirewall:ipfirewall ipfirewall ipfw freebsd ip stateful firewall packet filter traffic accounting facility ruleset logic similar many packet filters except ipfilter ipfw authored maintained freebsd volunteer staff members syntax enables use sophisticated filtering capabilities thus enables users satisfy advanced requirements either used loadable kernel module incorporated kernel use loadable kernel module possible highly recommended ipfw built-in firewall mac os x mac os x 10.7 lion 2011 replaced openbsd project pf like freebsd ipfw open source used many freebsd-based firewall products including m0n0wall freenas port ipfw dummynet traffic shaper available linux openwrt microsoft windows wipfw windows port old 2001 version ipfw", + "neighbors": [ + 38, + 94, + 101, + 116, + 134, + 217, + 272, + 290, + 323, + 377, + 476, + 477, + 569, + 648, + 656, + 685, + 731, + 771, + 842, + 899, + 910, + 961, + 992, + 1202, + 1225, + 1250, + 1257, + 1278, + 1301, + 1322, + 1397, + 1403, + 1406, + 1457, + 1462, + 1514, + 1521, + 1538, + 1542, + 1568, + 1578 + ], + "mask": "Test" + }, + { + "node_id": 190, + "label": 4, + "text": "Anti-keylogger:anti-keylogger anti-keylogger anti\u2013keystroke logger type software specifically designed detection keystroke logger software often software also incorporate ability delete least immobilize hidden keystroke logger software computer comparison anti-virus anti-spyware software primary difference anti-keylogger make distinction legitimate keystroke-logging program illegitimate keystroke-logging program malware keystroke-logging programs flagged optionally removed whether appear legitimate keystroke-logging software keyloggers sometimes part malware packages downloaded onto computers without owners knowledge detecting presence keylogger computer difficult so-called anti- keylogging programs developed thwart keylogging systems often effective used properly anti-keyloggers used large organizations well individuals order scan remove cases simply immobilize keystroke logging software computer generally advised software developers anti-keylogging scans run regular basis order reduce amount time keylogger may record keystrokes example system scanned every three days maximum three days keylogger could hidden system recording keystrokes public computers extremely susceptible installation keystroke logging software hardware documented instances occurring public computers particularly susceptible keyloggers number people gain access machine install hardware keylogger software keylogger either secretly installed matter minutes anti-keyloggers often used daily basis ensure public computers infected keyloggers safe public use keyloggers prevalent online gaming industry used secretly record gamer access credentials user name password logging account information sent back hacker hacker sign later account change password account thus stealing world warcraft particular importance game hackers target numerous keylogging viruses anti-keyloggers used many world warcraft gaming community members order try keep gaming accounts secure financial institutions become target keyloggers particularly institutions use advanced security features pin pads screen keyboards anti-keyloggers used run regular scans computer banking client information accessed protecting passwords banking information credit card numbers identity thieves common use anti-keylogger individuals wishing protect privacy using computer uses range protecting financial information used online banking passwords personal communication virtually information may typed computer keyloggers often installed people known computer owner many times installed ex-partner hoping spy ex-partner activities particularly chat type software signature base strategic information helps uniquely identify keylogger list contains many known keyloggers possible vendors make effort availability up-to-date listing download customers time 'system scan run software compares contents hard disk drive item item list looking matches type software rather widespread one drawbacks biggest drawback signature-based anti-keyloggers one protected keyloggers found signature-base list thus staying vulnerable unknown unrecognized keyloggers criminal download one many famous keyloggers change enough anti-keylogger wo n't recognize software n't use signature bases uses checklist known features attributes methods keyloggers known use analyzes methods work modules pc thus blocking activity module similar work keyloggers though method gives better keylogging protection signature-based anti-keyloggers drawbacks one type software blocks non-keyloggers also several 'non-harmful software modules either part operating system part legitimate apps use processes keyloggers also use trigger false positive usually non signature-based keyloggers option allow user unblock selected modules cause difficulties inexperienced users unable discern good modules bad modules manually choosing block unblock", + "neighbors": [ + 11, + 149, + 293, + 379, + 450, + 487, + 531, + 564, + 576, + 624, + 692, + 739, + 746, + 818, + 1090, + 1309, + 1325, + 1379, + 1444 + ], + "mask": "Test" + }, + { + "node_id": 191, + "label": 5, + "text": "TDM_Fabric_to_Framer_Interface:tdm fabric framer interface tdm fabric framer interface abbreviated tdm commonly used tdm variants include", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 192, + "label": 7, + "text": "Apache_Giraph:apache giraph apache giraph apache project perform graph processing big data giraph utilizes apache hadoop mapreduce implementation process graphs facebook used giraph performance improvements analyze one trillion edges using 200 machines 4 minutes giraph based paper published google graph processing system called pregel compared big graph processing libraries cassovary", + "neighbors": [ + 178, + 197, + 296, + 318, + 620, + 715, + 796, + 874, + 1091, + 1138, + 1163, + 1254, + 1454, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 193, + "label": 3, + "text": "SuperH:superh superh sh 32-bit reduced instruction set computing risc instruction set architecture isa developed hitachi currently produced renesas implemented microcontrollers microprocessors embedded systems many original patents superh architecture expiring sh2 cpu reimplemented open source hardware name j2 superh processor core family first developed hitachi early 1990s hitachi developed complete group upward compatible instruction set cpu cores sh-1 sh-2 used sega saturn sega 32x capcom cps-3 cores 16-bit instructions better code density 32-bit instructions great benefit time due high cost main memory years later sh-3 core added sh cpu family new features included another interrupt concept memory management unit mmu modified cache concept sh-3 core also got dsp extension called sh-3-dsp extended data paths efficient dsp processing special accumulators dedicated mac-type dsp engine core unifying dsp risc processor world derivative also used original sh-2 core 1994 1996 35.1 million superh devices shipped worldwide dreamcast hitachi developed sh-4 architecture superscalar 2-way instruction execution vector floating point unit particularly suited 3d graphics highlights architecture sh-4 based standard chips introduced around 1998 sh-3 sh-4 architectures support big-endian little-endian byte ordering bi-endian hitachi stmicroelectronics started collaborating early 1997 design sh-4 early 2001 formed ip company superh inc. going license sh-4 core companies developing sh-5 architecture first move superh 64-bit area 2003 hitachi mitsubishi electric formed joint-venture called renesas technology hitachi controlling 55 2004 renesas technology bought stmicroelectronics share ownership superh inc. licence sh cores renesas technology later became renesas electronics following merger nec electronics sh-5 design supported two modes operation shcompact mode equivalent user-mode instructions sh-4 instruction set shmedia mode different using 32-bit instructions sixty-four 64-bit integer registers simd instructions shmedia mode destination branch jump loaded branch register separately actual branch instruction allows processor prefetch instructions branch without snoop instruction stream combination compact 16-bit instruction encoding powerful 32-bit instruction encoding unique sh-5 arm processors 16-bit thumb mode arm licensed several patents superh thumb mips processors mips-16 mode however sh-5 differs backward compatibility mode 16-bit encoding rather 32-bit encoding evolution superh architecture still continues latest evolutionary step happened around 2003 cores sh-2 sh-4 getting unified superscalar sh-x core forms kind instruction set superset previous architectures today superh cpu cores architecture products renesas electronics merger hitachi mitsubishi semiconductor groups architecture consolidated around sh-2 sh-2a sh-3 sh-4 sh-4a platforms giving scalable family last sh-2 patents expired 2014 linuxcon japan 2015 j-core developers presented cleanroom reimplemention sh-2 isa extensions known j2 core due unexpired trademarks subsequently design walkthrough presented elc 2016 open source bsd licensed vhdl code j2 core proven xilinx fpgas asics manufactured tsmc 180 nm process capable booting \u00b5clinux j2 backwards isa compatible sh-2 implemented 5-stage pipeline separate instruction data memory interfaces machine generated instruction decoder supporting densely packed complex relative risc machines isa additional instructions easy add j2 implements instructions dynamic shift using sh-3 later instruction patterns extended atomic operations used threading primitives locking/interfaces symmetric multiprocessor support plans implement sh-2a j2+ sh-4 j4 instruction sets relevant patents expire 2016-2017 several features superh cited motivations designing new cores based architecture family superh cpu cores includes sh-2 32-bit risc architecture 16-bit fixed instruction length high code density features hardware multiply\u2013accumulate mac block dsp algorithms five-stage pipeline sh-2 cache rom-less devices provides 16 general purpose registers vector-base-register global-base-register procedure register today sh-2 family stretches 32 kb on-board flash rom-less devices used variety different devices differing peripherals ethernet motor-control timer unit fast adc others sh-2a upgrade sh-2 core announced early 2006 launch 2007 sh-2a based sh7211 world fastest embedded flash microcontroller running 160 mhz later superseded several newer superh devices running 200 mhz new features sh-2a core include sh-2a family today spans wide memory field 16 kb includes many rom-less variations devices feature standard peripherals ethernet usb well application specific peripherals motor control timers tft controllers peripherals dedicated automotive powertrain applications sh-4 32-bit risc cpu developed primary use multimedia applications sega dreamcast naomi game systems includes much powerful floating point unit additional built-in functions along standard 32-bit integer processing 16-bit instruction size sh-4 features include fpu custom sh4 made casio sh7305 sh-5 64-bit risc cpu almost non-simulated sh-5 hardware ever released unlike still live sh-4 support sh-5 dropped gcc", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 134, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 544, + 571, + 589, + 643, + 659, + 719, + 752, + 803, + 821, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1143, + 1174, + 1219, + 1256, + 1272, + 1284, + 1290, + 1301, + 1360, + 1398, + 1458, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1538, + 1557, + 1578, + 1605, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 194, + "label": 9, + "text": "NetLogo:netlogo netlogo programming language integrated development environment ide modeling agent-based netlogo designed uri wilensky spirit programming language logo low threshold ceiling teaches programming concepts using agents form turtles patches links observer netlogo designed multiple audiences mind particular teaching children education community domain experts without programming background model related phenomena many scientific articles published using netlogo netlogo environment enables exploration emergent phenomena comes extensive models library including models variety domains economics biology physics chemistry psychology system dynamics netlogo allows exploration modifying switches sliders choosers inputs interface elements beyond exploring netlogo allows authoring new models modifying extant models netlogo open source freely available netlogo website use wide variety educational contexts elementary school graduate school many teachers make use netlogo curricula netlogo designed authored uri wilensky director northwestern university center connected learning computer-based modeling ccl several books published netlogo books available print include books available online include several massive open online courses offered use netlogo assignments and/or demonstrations netlogo free open-source software released gnu general public license gpl commercial licenses also available written scala java runs java virtual machine jvm core hybrid interpreter/compiler partially compiles user code jvm bytecode netlogo web version runs javascript instead jvm models may run web browser features desktop version simple multiagent model netlogo wolf-sheep predation model shown screenshot models population growth predator/prey system time following characteristics hubnet technology uses netlogo run participatory simulations classroom participatory simulation whole group users takes part enacting behavior system using individual device networked computer texas instruments graphing calculator user acts separate independent agent one example hubnet activity tragedy commons models economic problem called tragedy commons", + "neighbors": [ + 27, + 29, + 46, + 56, + 173, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 538, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 195, + "label": 2, + "text": "HP-UX:hp-ux hp-ux hewlett packard unix hewlett packard enterprise proprietary implementation unix operating system based unix system v initially system iii first released 1984 recent versions support hp 9000 series computer systems based pa-risc instruction set architecture hp integrity systems based intel itanium architecture earlier versions hp-ux supported hp integral pc hp 9000 series 200 300 400 computer systems based motorola 68000 series processors well hp 9000 series 500 computers based hp proprietary focus architecture hp-ux first unix offer access control lists file access permissions alternative standard unix permissions system hp-ux also among first unix systems include built-in logical volume manager hp long partnership veritas software uses vxfs primary file system one six commercial operating systems versions certified open group unix 03 standard others macos solaris inspur k-ux huawei euleros aix hp-ux 11i offers common shared disks clustered file system hp serviceguard cluster solution hp-ux hp global workload management adjusts workloads optimize performance integrates instant capacity demand installed resources paid 30-minute increments needed peak workload demands hp-ux offers operating system-level virtualization features hardware partitions isolated os virtual partitions cell-based servers hp integrity virtual machines hpvm integrity servers hpvm supports guests running hp-ux 11i v3 hosts \u2013 guests run linux windows openvms 8.4 hp-ux hp supports online vm guest migration encryption secure guest contents migration hp-ux 11i v3 scales follows superdome 2 32 intel itanium 9560 processors 11i v2 release introduced kernel-based intrusion detection strong random number generation stack buffer overflow protection security partitioning role-based access management various open-source security tools hp classifies operating system security features three categories data system identity release 6.x together 3.x introduced context dependent files cdf feature method allowing fileserver serve different configurations binaries even architectures different client machines heterogeneous environment directory containing files suid bit set made hidden ordinary root processes normal use scheme sometimes exploited intruders hide malicious programs data cdfs cdf filesystem dropped release 10.0 hp-ux operating systems supports variety pa-risc systems 11.0 added support integrity-based servers transition pa-risc itanium hp-ux 11i v1.5 first version supported itanium introduction hp-ux 11i v2 operating system supported architectures hp-ux 11i supports hp integrity servers hp bl server blade family servers use intel itanium architecture hp-ux 11i v2 11i v3 support hp cx series servers cx stands carrier grade used mainly telco industry -48v dc support nebs certified systems contain itanium mad6m processors discontinued hp-ux supports hp rx series servers prior release hp-ux version 11.11 hp used decimal version numbering scheme first number giving major release number following decimal showing minor release 11.11 hp made marketing decision name releases 11 followed v decimal-number version intended indicate os internet-enabled effective result dual version-numbering scheme hp bundles hp-ux 11i programs packages call operating environments oes following lists currently available hp-ux 11i v3 oes", + "neighbors": [ + 63, + 106, + 134, + 160, + 175, + 233, + 242, + 254, + 270, + 275, + 306, + 322, + 358, + 365, + 380, + 399, + 443, + 469, + 473, + 475, + 477, + 542, + 566, + 595, + 655, + 716, + 739, + 752, + 754, + 755, + 776, + 782, + 787, + 788, + 864, + 901, + 941, + 954, + 957, + 1002, + 1003, + 1022, + 1049, + 1099, + 1138, + 1221, + 1227, + 1257, + 1284, + 1288, + 1296, + 1301, + 1366, + 1381, + 1538, + 1552, + 1556, + 1578, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 196, + "label": 8, + "text": "RESTHeart:restheart restheart java open source web api server built top mongodb database restheart exposes restful application programming interface crud operations following hypertext application language standard restheart leverages mongodb document-oriented nature creating automatic mapping mongodb internal storage data graph externally accessible http resources implementing model interaction compliant hateoas hypermedia engine application state representation state client process entirely driven http verbs like get post put patch delete etc restheart naturally fits architecture need invoke document-oriented data services top mongodb via http programmers n't want waste time building repetitive crud logic hand imagine following scenario want develop web application top data model following simple crud operations data modeled hierarchy documents mongodb perfect fit job already data mongodb instance want quickly build user interface restheart allows deploy run specialized independent micro-services already available via docker containers restheart fully implemented java 8 embeds undertow non-blocking http server one core components wildfly application server undertow flexible performant web server written java providing blocking non-blocking api \u2019 based nio undertow composition based architecture allows build web server combining small single purpose handlers gives flexibility choose full java ee servlet 3.1 container low level non-blocking handler anything undertow designed fully embeddable easy use fluent builder apis undertow \u2019 lifecycle completely controlled embedding application undertow sponsored jboss default web server wildfly application server multi-threaded process connects mongodb server exposes data operations via restful interface http protocol data clients interact database management system without need low level database driver mongodb resources databases collections documents automatically represented json variant hypertext application language restheart inherits undertow pipeline architecture specialized handlers chained together serve requests order provide additional application logic custom handlers bound /_logic url restheart also supports mongodb gridfs allows storing retrieving large binary files via http sitting client database restheart also provides gateway services authentication authorization data transformation validation", + "neighbors": [ + 684, + 796, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 197, + "label": 4, + "text": "Apache_Fortress:apache fortress apache fortress open source project apache software foundation subproject apache directory standards-based access management system written java provides role-based access control delegated administration password policy services ldap standards implemented fortress four separate components fortress first contributed 2011 openldap foundation moved apache directory project 2014", + "neighbors": [ + 178, + 192, + 296, + 318, + 620, + 715, + 796, + 1039, + 1091, + 1138, + 1163, + 1254, + 1454, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 198, + "label": 4, + "text": "Alureon:alureon alureon also known tdss tdl-4 trojan bootkit created steal data intercepting system network traffic searching banking usernames passwords credit card data paypal information social security numbers sensitive user data following series customer complaints microsoft determined alureon caused wave bsods 32-bit microsoft windows systems update ms10-015 triggered crashes breaking assumptions made malware author according research conducted microsoft alureon second active botnet second quarter 2010 allure boot first identified around 2007 personal computers usually infected users manually download install trojan software alureon known bundled rogue security software security essentials 2010 dropper executed first hijacks print spooler service spoolsv.exe update master boot record execute modified bootstrap routine infects low-level system drivers responsible pata operations atapi.sys implement rootkit installed alureon manipulates windows registry block access windows task manager windows update desktop also attempts disable anti-virus software alureon also known redirect search engines commit click fraud google taken steps mitigate users scanning malicious activity warning users case positive detection malware drew considerable public attention software bug code caused 32-bit windows systems crash upon installation security update ms10-015 malware using hard-coded memory address kernel changed installation hotfix microsoft subsequently modified hotfix prevent installation alureon infection present malware author also fixed bug code november 2010 press reported rootkit evolved point able bypass mandatory kernel-mode driver signing requirement 64-bit editions windows 7 subverting master boot record made particularly resistant systems detection removal anti-virus software tdl-4 sometimes used synonymously alureon also name rootkit runs botnet first appeared 2008 tdl-1 detected kaspersky lab april 2008 later version two appeared known tdl-2 early 2009 time tdl-2 became known emerged version three titled tdl-3 lead eventually tdl-4 often noted journalists indestructible 2011 although removable tools kaspersky tdsskiller infects master boot record target machine making harder detect remove major advancements include encrypting communications decentralized controls using kad network well deleting malware rootkit generally able avoid detection circumstantial evidence infection may found examination network traffic packet analyzer inspection outbound connections tool netstat although existing security software computer occasionally report rootkit often goes undetected may useful perform offline scan infected system booting alternative operating system winpe malware attempt prevent security software updating fixmbr command windows recovery console manual replacement atapi.sys could possibly required disable rootkit functionality anti-virus tools able find clean infection various companies created standalone tools attempt remove alureon two popular tools microsoft windows defender offline kaspersky tdsskiller november 9 2011 united states attorney southern district new york announced charges six estonian nationals arrested estonian authorities one russian national conjunction operation ghost click february 6 2012 two individuals extradited new york running sophisticated operation used alureon infect millions computers", + "neighbors": [ + 91, + 141, + 158, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 564, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 818, + 915, + 961, + 1101, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1337, + 1342, + 1358, + 1370, + 1379, + 1393, + 1436, + 1467, + 1475, + 1543, + 1554, + 1573, + 1576, + 1627 + ], + "mask": "Train" + }, + { + "node_id": 199, + "label": 3, + "text": "John_Couleur:john couleur john francis couleur july 7 1925 chicago \u2013 august 25 2007 scottsdale arizona american computer engineer executive recipient 40 patents world war ii couleur enrolled v-12 navy college training program graduated summa cum laude southern methodist university houston texas 1946 korean war served lieutenant united states air force couleur joined general electric company 1953 ge heavy military electronics department hmed syracuse new york served lead architect development mistram tracking system atlas missile later ge responsible development ge-635 computer system request mit project mac couleur ted glaser designed modifications turn 635 system became ge-645 multics operating system 1972", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 200, + "label": 3, + "text": "Badlands_(1984_video_game):badlands 1984 video game game plot remarkably darker games time player assumes role buck hardworking family man whose wife children murdered band outlaws one one revenge buck tracks various outlaws earning higher higher bounties progresses final foe outlaw leader landolf outlaws ranked order bounties follows despite game apparent old west setting storyline sent hero buck noticeably non-realistic settings example one point buck walks cave ends prehistoric jungle populated dinosaurs also game provided buck three lives lost lives player would see limp humorously crutches humorously carried away stretcher \u2014 noticeable break game otherwise dark mature themes player lost his/her last life buck would turn super deformed angel time game text would appear addition game miss sequences occur player loses life humorous well including limited scorpion giving buck mohawk buck cut half axe end buck could kill landolph henches player would see ride sunset badlands earned rarity rank 16 according video game preservation society means existing arcade cabinets game fairly uncommon", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 201, + "label": 5, + "text": "Joomla:joomla joomla free open-source content management system cms publishing web content developed open source matters inc built model\u2013view\u2013controller web application framework used independently cms joomla written php uses object-oriented programming techniques since version 1.5 software design patterns stores data mysql ms sql since version 2.5 postgresql since version 3.0 database includes features page caching rss feeds printable versions pages news flashes blogs search support language internationalization 8,000 free commercial extensions available official joomla extensions directory available sources estimated second used content management system internet wordpress joomla result fork mambo august 17 2005 time mambo name trademark miro international pvt ltd formed non-profit foundation stated purpose funding project protecting lawsuits joomla development team claimed many provisions foundation structure violated previous agreements made elected mambo steering committee lacked necessary consultation key stakeholders included provisions violated core open source values joomla developers created website called opensourcematters.org osm distribute information software community project leader andrew eddie wrote letter appeared announcements section public forum mamboserver.com one thousand people joined opensourcematters.org within day posting words encouragement support miro ceo peter lamont responded publicly development team article titled mambo open source controversy \u2014 20 questions miro event created controversy within free software community definition open source forums open-source projects active postings actions sides two weeks following eddie announcement teams re-organized community continued grow eben moglen software freedom law center sflc assisted joomla core team beginning august 2005 indicated moglen blog entry date related osm announcement sflc continue provide legal guidance joomla project august 18 andrew eddie called community input suggest name project core team reserved right final naming decision chose name suggested community september 22 new name joomla announced anglicised spelling swahili word meaning together whole also similar meaning least amharic arabic urdu september 26 development team called logo submissions community invited community vote logo team announced community decision september 29 october 2 brand guidelines brand manual set logo resources published joomla thousands verified third party extensions found joomla extensions directory extensions.joomla.org also thousands high end templates available many free paid templates also available come support many templates provide graphical user interface allow change colors fonts layouts features joomla seo tools built includes metadata keywords mod_rewrite support sef urls menu creation clear consistent sitemaps april 25 2014 joomla production leadership team announced started following 'semantic versioning scheme new joomla builds earlier lts long term support sts short term support lifecycle policy longer observed joomla version 3.3.1 first version released new development strategy like many web applications joomla may run lamp stack many web hosts control panels automatic installation joomla windows joomla installed using microsoft web platform installer automatically detects installs dependencies php mysql joomla utilises configuration file configuration.php usually located root joomla installation control various settings including limited database connection settings due use configuration file migrating one server another relatively simple two large joomla conferences year joomla beyond conference largely aimed joomla developers site integrators hosted europe around may year joomla world conference brings together developers designers site administrators business owners community members held latter half year year joomla communities hold country regional joomladays joomla also like many coding communities hosts many regional user groups well joomla extensions extend functionality joomla websites eight types extensions may distinguished components modules plugins templates languages libraries files packages extensions handles specific function many extensions built joomla community free require payment download joomla cms received many awards recognitions since created 2005", + "neighbors": [ + 7, + 11, + 117, + 308, + 352, + 509, + 538, + 567, + 593, + 682, + 712, + 796, + 872, + 916, + 1005, + 1138, + 1225, + 1227, + 1232, + 1235, + 1242, + 1269, + 1311, + 1481 + ], + "mask": "Train" + }, + { + "node_id": 202, + "label": 4, + "text": "William_Genovese:william genovese william genovese former greyhat hacker turned security professional goes alias illwill early 2000 genovese former figure loose-knit group computer hackers called illmob illmob.org security community website ran genovese time many high-profile incidents related genovese works private security consultant involved computer security industry penetration testing phishing osint threat intel mitigation also contributor metasploit project 2003 genovese website first release 0day code exploited ms03-026 windows rpc vulnerability later used unknown hackers create variants w32/blaster worm response genovese released tool coded remove worm infected windows pc 2004 federal authorities charged genovese theft trade secret us code title 18 section 1832 selling incomplete windowsnt/2000 microsoft source code microsoft investigators federal agents even though code sold already widely distributed internet prior sale authorities used obscure law enacted economic espionage act 1996 traditionally adjudicated private civil litigation 2005 illmob.org site posted leaked images phone book paris hilton t-mobile sidekick phone obtained fellow hacker reportedly data obtained social engineering exploiting vulnerability bea weblogic server database function allowed attacker remotely read replace file system feeding specially-crafted web request bea produced patch bug march 2003 t-mobile failed apply website also mentioned news articles connection fred durst sex tape leak stolen personal email account 2010 resignation 2016 genovese co-founded board member 501 3 c non-profit hackerspace connecticut called nesit helped local community offering free classes various network security topics personal internet safety reverse engineering embedded electronic projects 3-d printing design helped build virtualized pen-testing lab large server farm donation pharmaceutical company users simulate attacking penetrating machines safe lab environment since 2008 genovese reinvented security consultant public speaker teacher security consulting performs penetration testing services worldwide companies also co-founder speaker security conferences excon bsides connecticut bsidesct 2011 2014 2016 2017 2018 2015 panelist def_con 23 las vegas charity fundraiser help fellow hacker stricken terminal cancer", + "neighbors": [ + 202 + ], + "mask": "Test" + }, + { + "node_id": 203, + "label": 9, + "text": "Corman_Common_Lisp:corman common lisp corman common lisp commercial implementation common lisp programming language featuring support windows operating system corman common lisp commercial software 2013 roger corman author indicated considering converting open source january 2015 published source code corman lisp github repository mit license corman common lisp designed implemented corman technologies 1995 previously developed powerlisp mac corman cl complete rewrite windows powerlisp longer developed supported developed maintained corman cl new major releases every 18 months minor updates often 2006 clos implementation originally art metaobject protocol closette extensively rewritten add missing common lisp features improve performance january 2015 roger corman permission corman common lisp copied github made open source mit license future development corman common lisp done location", + "neighbors": [ + 27, + 46, + 194, + 251, + 292, + 308, + 313, + 332, + 360, + 392, + 446, + 447, + 503, + 506, + 536, + 565, + 601, + 649, + 653, + 753, + 787, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 1021, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1413, + 1430, + 1466, + 1516, + 1582, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 204, + "label": 8, + "text": "Oracle_HTTP_Server:oracle http server oracle http server ohs web server based apache http server created oracle technology network web server based apache version 2.2 ohs like apache 2.2 includes support ipv6 web tier component oracle fusion middleware features", + "neighbors": [ + 1288, + 1484 + ], + "mask": "Train" + }, + { + "node_id": 205, + "label": 3, + "text": "Maziacs:maziacs maziacs action adventure maze game published dk'tronics 1983 zx spectrum commodore 64 msx maziacs written priestley based earlier zx81 game mazogs published bug byte 1982 mazogs one successful zx81 games priestley adapted higher-resolution colour-screen zx spectrum msx commodore 64 port written andy french maziacs takes place randomly generated scrolling overhead-view maze player-controlled protagonist must find gold exit level gold placed least 200 moves start position maze patrolled monsters called maziacs prisoners sometimes found walls maze highlight path gold short period time moving maze fighting maziacs decreases player energy replenished finding food main game screen shows one fiftieth maze view mode expands view show one twelfth whilst mode useful scouting purposes player move whilst viewing maziacs killed effectively swords several found maze used sword carried time gold last two factors lead tactic avoiding groups maziacs killing many possible collecting gold maziacs supported currah microspeech peripheral maziacs published critical reception good crash magazine awarded 82 highlighting appealing graphics animation retrospective later year crash criticized slightly unresponsive keyboard controls felt less addictive continued praise animation techniques maziacs ranked number 99 sinclair official top 100 zx spectrum games time game claustrophobic atmosphere choreographed animation general character", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 206, + "label": 3, + "text": "History_of_general-purpose_CPUs:history general-purpose cpus history general-purpose cpus continuation earlier history computing hardware early 1950s computer design unique upward-compatible machines computer architectures multiple differing implementations programs written one machine would run kind even kinds company major drawback large body software developed run computers starting programming scratch seen large barrier design freedom time important designers constrained cost electronics starting explore computer could best organized basic features introduced period included index registers ferranti mark 1 return address saving instruction univac immediate operands ibm 704 detecting invalid operations ibm 650 end 1950s commercial builders developed factory-constructed truck-deliverable computers widely installed computer ibm 650 used drum memory onto programs loaded using either paper punched tape punched cards high-end machines also included core memory provided higher speeds hard disks also starting grow popular computer automatic abacus type number system affects way works early 1950s computers built specific numerical processing tasks many machines used decimal numbers basic number system mathematical functions machines worked base-10 instead base-2 common today merely binary coded decimal bcd machines ten vacuum tubes per digit processor register early soviet computer designers implemented systems based ternary logic bit could three states +1 0 -1 corresponding positive zero negative voltage early project u.s. air force binac attempted make lightweight simple computer using binary arithmetic deeply impressed industry late 1970 major computer languages unable standardize numeric behavior decimal computers groups users large alienate even designers used binary system still many odd ideas used sign-magnitude arithmetic -1 10001 ones complement -1 11110 rather modern two complement arithmetic -1 11111 computers used six-bit character sets adequately encoded hollerith punched cards major revelation designers period realize data word multiple character size began design computers 12- 24- 36-bit data words e.g. see tx-2 era grosch law dominated computer design computer cost increased square speed one major problem early computers program one would work others computer companies found customers little reason remain loyal given brand next computer bought would incompatible anyway point concerns usually price performance 1962 ibm tried new approach designing computers plan make family computers could run software different performances different prices users needs grew could move larger computers still keep investment programs data storage media designed one reference computer named system/360 s/360 virtual computer reference instruction set abilities machines family would support provide different classes machines computer family would use less hardware emulation less microprogram emulation create machine able run full s/360 instruction set instance low-end machine could include simple processor low cost however would require use larger microcode emulator provide rest instruction set would slow high-end machine would use much complex processor could directly process s/360 design thus running much simpler faster emulator ibm chose consciously make reference instruction set quite complex capable even though computer complex control store holding microprogram would stay relatively small could made fast memory another important effect one instruction could describe quite complex sequence operations thus computers would generally fetch fewer instructions main memory could made slower smaller less costly given mix speed price s/360 successor scientific machines like 7090 data processing machines like 1401 needed design could reasonably support forms processing hence instruction set designed manipulate simple binary numbers text scientific floating-point similar numbers used calculator binary coded decimal arithmetic needed accounting systems almost following computers included innovations form basic set features called complex instruction set computing cisc pronounced sisk term invented many years later reduced instruction set computing risc began get market share many ciscs instruction could access either registers memory usually several different ways made ciscs easier program programmer could remember thirty hundred instructions set three ten addressing modes rather thousands distinct instructions called orthogonal instruction set pdp-11 motorola 68000 architecture examples nearly orthogonal instruction sets also bunch burroughs univac ncr control data corporation honeywell competed ibm time however ibm dominated era s/360 burroughs corporation later merged sperry/univac form unisys offered alternative s/360 burroughs large systems b5000 series 1961 b5000 virtual memory symmetric multiprocessing multiprogramming operating system master control program mcp written algol 60 industry first recursive-descent compilers early 1963 mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor invented mohamed atalla dawon kahng bell labs 1959 demonstrated 1960 led development metal-oxide-semiconductor mos integrated circuit ic proposed kahng 1961 fabricated fred heiman steven hofstein rca 1962 high scalability much lower power consumption higher density bipolar junction transistors mosfet made possible build high-density integrated circuits advances mos integrated circuit technology led development large-scale integration lsi chips late 1960s eventually invention microprocessor early 1970s 1960s development electronic calculators electronic clocks apollo guidance computer minuteman missile helped make mos integrated circuits economical practical late 1960s first calculator clock chips began show small computers might possible large-scale integration lsi culminated invention microprocessor single-chip cpu intel 4004 released 1971 first commercial microprocessor origins 4004 date back busicom project began japanese calculator company busicom april 1968 engineer masatoshi shima tasked designing special-purpose lsi chipset along supervisor tadashi tanba use busicom 141-pf desktop calculator integrated printer initial design consisted seven lsi chips including three-chip cpu design included arithmetic units adders multiplier units registers read-only memory macro-instruction set control decimal computer system busicom wanted general-purpose lsi chipset desktop calculators also equipment teller machine cash register billing machine shima thus began work general-purpose lsi chipset late 1968 sharp engineer tadashi sasaki also became involved development conceived single-chip microprocessor 1968 discussed concept brainstorming meeting held japan sasaki attributes basic invention break calculator chipset four parts rom 4001 ram 4002 shift registers 4003 cpu 4004 unnamed woman software engineering researcher nara women college present meeting sasaki first meeting robert noyce intel 1968 presented woman four-division chipset concept intel busicom busicom approached american company intel manufacturing help 1969 intel memory company back facilities manufacture high density silicon gate mos chip busicom required shima went intel june 1969 present design proposal due intel lacking logic engineers understand logic schematics circuit engineers convert intel asked shima simplify logic intel wanted single-chip cpu design influenced sharp tadashi sasaki presented concept busicom intel 1968 single-chip microprocessor design formulated intel marcian ted hoff 1969 simplifying shima initial design four chips including single-chip cpu due hoff formulation lacking key details shima came ideas find solutions implementation shima responsible adding 10-bit static shift register make useful printer buffer keyboard interface many improvements instruction set making ram organization suitable calculator memory address information transfer key program area performance program capacity functional specification decimal computer idea software desktop calculator logic real-time i/o control data exchange instruction accumulator general purpose register hoff shima eventually realized 4-bit microprocessor concept together help intel stanley mazor interpret ideas shima hoff specifications four chips developed period months 1969 intel team led hoff busicom team led shima late 1969 shima returned japan intel done work project early 1970 shima returned intel early 1970 found work done 4004 since left hoff moved projects week shima returned intel federico faggin joined intel become project leader shima explained project faggin worked together design 4004 thus chief designers chip faggin created design methodology silicon-based chip design hoff formulated architecture moving projects shima produced initial busicom design assisted development final intel design 4004 first introduced japan microprocessor busicom 141-pf calculator march 1971 north america first public mention 4004 advertisement november 15 1971 edition electronic news nec released \u03bcpd707 \u03bcpd708 two-chip 4-bit cpu 1971 followed nec first single-chip microprocessor \u03bcpd700 april 1972 prototype \u03bccom-4 \u03bcpd751 released april 1973 combining \u03bcpd707 \u03bcpd708 single microprocessor 1973 toshiba released tlcs-12 first 12-bit microprocessor first commercial microprocessor binary coded decimal bcd based intel 4004 released busicom intel 1971 march 1972 intel introduced microprocessor 8-bit architecture 8008 integrated pmos logic re-implementation transistor\u2013transistor logic ttl based datapoint 2200 cpu 4004 designers federico masatoshi shima went design successor intel 8080 slightly mini computer-like microprocessor largely based customer feedback limited 8008 much like 8008 used applications terminals printers cash registers industrial robots however able 8080 also became original target cpu early de facto standard personal computer operating system called cp/m used demanding control tasks cruise missiles many uses released 1974 8080 became one first really widespread microprocessors mid-1970s use integrated circuits computers common decade marked market upheavals caused shrinking price transistors became possible put entire cpu one printed circuit board result minicomputers usually 16-bit words 4k 64k memory became common ciscs believed powerful types computers microcode small could stored high-speed memory cisc architecture also addressed semantic gap perceived defined distance machine language higher level programming languages used program machine felt compilers could better job richer instruction set custom ciscs commonly constructed using bit slice computer logic amd 2900 chips custom microcode bit slice component piece arithmetic logic unit alu register file microsequencer bit-slice integrated circuits 4-bits wide early 1970s pdp-11 developed arguably advanced small computer day almost immediately wider-word ciscs introduced 32-bit vax 36-bit pdp-10 ibm continued make large fast computers however definition large fast meant megabyte ram clock speeds near one megahertz tens megabytes disk drives ibm system 370 version 360 tweaked run virtual computing environments virtual computer developed reduce chances unrecoverable software failure burroughs large systems b5000 b6000 b7000 series reached largest market share stack computer whose os programmed dialect algol different developments competed market share first single-chip 16-bit microprocessor introduced 1975 panafacom conglomerate formed japanese companies fujitsu fuji electric matsushita introduced mn1610 commercial 16-bit microprocessor according fujitsu world first 16-bit microcomputer single chip intel 8080 basis 16-bit intel 8086 direct ancestor today ubiquitous x86 family including pentium core i7 every instruction 8080 direct equivalent large x86 instruction set although opcode values different latter early 1980s researchers uc berkeley ibm discovered computer language compilers interpreters used small subset instructions complex instruction set computing cisc much power cpu ignored real-world use realized making computer simpler less orthogonal could make faster less costly time time cpu calculation became faster relation time needed memory accesses designers also experimented using large sets internal registers goal cache intermediate results registers control compiler also reduced number addressing modes orthogonality computer designs based theory called reduced instruction set computing risc riscs usually larger numbers registers accessed simpler instructions instructions specifically load store data memory result simple core cpu running high speed supporting sorts operations compilers using anyway common variant risc design employs harvard architecture versus von neumann architecture stored program architecture common designs harvard architecture machine program data occupy separate memory devices accessed simultaneously von neumann machines data programs mixed one memory device requiring sequential accessing produces so-called von neumann bottleneck one downside risc design programs run tend larger compilers must generate longer sequences simpler instructions perform results since instructions must loaded memory anyway larger code offsets risc design fast memory handling early 1990s engineers japan hitachi found ways compress reduced instruction sets fit even smaller memory systems ciscs compression schemes used instruction set superh series microprocessors introduced 1992 superh instruction set later adapted arm architecture thumb instruction set applications need run older binary software compressed riscs growing dominate sales another approach riscs minimal instruction set computer misc niladic zero-operand instruction set approach realized space instruction used identify operands instruction machines placed operands push-down last-in first stack instruction set supplemented instructions fetch store memory used simple caching provide extremely fast risc machines compact code another benefit interrupt latencies small smaller cisc machines rare trait risc machines burroughs large systems architecture used approach b5000 designed 1961 long term risc invented architecture puts six 8-bit instructions 48-bit word precursor long instruction word vliw design see burroughs architecture one inspirations charles h. moore programming language forth turn inspired later misc chip designs example f20 cores 31 5-bit instructions fit four 20-bit word risc chips dominate market 32-bit embedded systems smaller risc chips even growing common cost-sensitive 8-bit embedded-system market main market risc cpus systems need low power small size even cisc processors based architectures created risc grew dominant newer x86 processors translate instructions internally risc-like instruction set numbers may surprise many market perceived desktop computers x86 designs dominate desktop notebook computer sales computers tiny fraction computers sold people industrialised countries computers embedded systems car house desks mid-to-late 1980s designers began using technique termed instruction pipelining processor works multiple instructions different stages completion example processor retrieve operands next instruction calculating result current one modern cpus may use dozen stages pipelining originally developed late 1950s international business machines ibm 7030 stretch mainframe computer minimal instruction set computers misc execute instructions one cycle need pipelining similar idea introduced years later execute multiple instructions parallel separate arithmetic logic units alus instead operating one instruction time cpu look several similar instructions depend execute parallel approach called superscalar processor design methods limited degree instruction level parallelism ilp number non-dependent instructions program code programs run well superscalar processors due inherent high ilp notably graphics however general problems far less ilp thus lowering possible speedups methods branching one major culprit example program may add two numbers branch different code segment number bigger third number case even branch operation sent second alu processing still must wait results addition thus runs faster one alu common solution type problem use type branch prediction efficiency multiple functional units available superscalar designs operand register dependencies found another limiting factor minimize dependencies out-of-order execution instructions introduced scheme instruction results complete out-of-order must re-ordered program order processor program restartable exception out-of-order execution main advance computer industry 1990s similar concept speculative execution instructions one direction branch predicted direction executed branch direction known branch direction known predicted direction actual direction compared predicted direction correct speculatively executed instructions results kept incorrect instructions results erased speculative execution coupled accurate branch predictor gives large performance gain advances originally developed research risc-style designs allow modern cisc processors execute twelve instructions per clock cycle traditional cisc designs could take twelve cycles execute one instruction resulting instruction scheduling logic processors large complex difficult verify higher complexity needs transistors raising power consumption heat risc superior instructions simpler less interdependence make superscalar implementations easier however intel demonstrated concepts applied complex instruction set computing cisc design given enough time money instruction scheduling logic makes superscalar processor boolean logic early 1990s significant innovation realize coordination multi-alu computer could moved compiler software translates programmer instructions machine-level instructions type computer called long instruction word vliw computer scheduling instructions statically compiler versus scheduling dynamically processor reduce cpu complexity improve performance reduce heat cost unfortunately compiler lacks accurate knowledge runtime scheduling issues merely changing cpu core frequency multiplier effect scheduling operation program determined input data major effects scheduling overcome severe problems vliw system may enhanced adding normal dynamic scheduling losing vliw advantages static scheduling compiler also assumes dynamically generated code uncommon creation java java virtual machine true reasonable assume slow compiles would affect software developers just-in-time compilation jit virtual machines used many languages slow code generation affects users also several unsuccessful attempts commercialize vliw basic problem vliw computer scale different price performance points dynamically scheduled computer another issue compiler design vliw computers difficult compilers 2005 often emit suboptimal code platforms also vliw computers optimise throughput low latency unattractive engineers designing controllers computers embedded machinery embedded systems markets often pioneered computer improvements providing large market unconcerned compatibility older software january 2000 transmeta corporation took novel step placing compiler central processing unit making compiler translate reference byte code case x86 instructions internal vliw instruction set method combines hardware simplicity low power speed vliw risc compact main memory system software reverse-compatibility provided popular cisc intel itanium chip based call explicitly parallel instruction computing epic design design supposedly provides vliw advantage increased instruction throughput however avoids issues scaling complexity explicitly providing bundle instructions information concerning dependencies information calculated compiler would vliw design early versions also backward-compatible newer x86 software means on-chip emulator mode integer performance disappointing despite improvements sales volume markets continue low current designs work best computer running one program however nearly modern operating systems allow running multiple programs together cpu change work another program needs costly context switching contrast multi-threaded cpus handle instructions multiple programs cpus include several sets registers context switch occurs contents working registers simply copied one set registers purpose designs often include thousands registers instead hundreds typical design downside registers tend somewhat costly chip space needed implement chip space might used otherwise purpose intel calls technology hyperthreading offers two threads per core current core i3 core i7 core i9 desktop lineup well core i3 core i5 core i7 mobile lineup well offering four threads per core high-end xeon phi processors multi-core cpus typically multiple cpu cores die connected via shared l2 l3 cache on-die bus on-die crossbar switch cpu cores die share interconnect components interface processors rest system components may include front side bus interface memory controller interface dynamic random access memory dram cache coherent link processors non-coherent link southbridge i/o devices terms multi-core microprocessor unit mpu come general use one die multiple cpu cores one way work around von neumann bottleneck mix processor dram one chip another track development combine reconfigurable logic general-purpose cpu scheme special computer language compiles fast-running subroutines bit-mask configure logic slower less-critical parts program run sharing time cpu process allows creating devices software radios using digital signal processing perform functions usually performed analog electronics lines hardware software increasingly blur due progress design methodology availability chips field-programmable gate arrays fpga cheaper production processes even open source hardware begun appear loosely knit communities like opencores risc-v recently announced fully open cpu architectures openrisc readily implemented fpgas custom produced chips anyone license fees even established processor makers like sun microsystems released processor designs e.g. opensparc open-source licenses yet another option clockless asynchronous cpu unlike conventional processors clockless processors central clock coordinate progress data pipeline instead stages cpu coordinated using logic devices called pipe line controls fifo sequencers basically pipeline controller clocks next stage logic existing stage complete thus central clock unneeded relative clocked logic may easier implement high performance devices asynchronous logic asynchronous logic proponents believe abilities would benefits biggest disadvantage clockless cpu cpu design tools assume clocked cpu synchronous circuit making clockless cpu designing asynchronous circuit involves modifying design tools handle clockless logic extra testing ensure design avoids metastability problems even several asynchronous cpus built including one promising option eliminate front side bus modern vertical laser diodes enable change theory optical computer components could directly connect holographic phased open-air switching system would provide large increase effective speed design flexibility large reduction cost since computer connectors also likely failure points busless system may reliable 2010 modern processors use 64- 128-bit logic optical wavelength superposition could allow data lanes logic many orders magnitude higher electronics added space copper wires another long-term option use light instead electricity digital logic theory could run 30 faster use less power allow direct interface quantum computing devices main problems approach foreseeable future electronic computing elements faster smaller cheaper reliable elements already smaller wavelengths light thus even waveguide-based optical logic may uneconomic relative electronic logic 2016 development effort electronic circuitry early experimental work done using ion based chemical reactions instead electronic photonic actions implement elements logic processor relative conventional register machine stack machine architecture yet similar intel itanium architecture temporal register addressing scheme proposed ivan godard company intended greatly reduce complexity cpu hardware specifically number internal registers resulting huge multiplexer trees somewhat harder read debug general-purpose register names aids understanding view belt moving conveyor belt oldest values drop belt vanish implemented mill architecture", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 210, + 212, + 224, + 230, + 249, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 359, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1012, + 1013, + 1016, + 1022, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1174, + 1196, + 1213, + 1219, + 1222, + 1231, + 1256, + 1263, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 207, + "label": 2, + "text": "Homebrew_(package_management_software):homebrew package management software homebrew free open-source software package management system simplifies installation software apple macos operating system linux name intended suggest idea building software mac depending user taste originally written max howell package manager gained popularity ruby rails community earned praise extensibility homebrew recommended ease use well integration command line homebrew non-profit project member software freedom conservancy run entirely unpaid volunteers homebrew made extensive use github expand support several packages user contributions 2010 homebrew third-most-forked repository github 2012 homebrew largest number new contributors github 2013 homebrew largest number contributors issues closed project github homebrew spawned several sub-projects linuxbrew linux port officially merged homebrew homebrew cask builds upon homebrew focuses installation gui applications taps dedicated specific areas programming languages like php homebrew written max howell 2009 march 2013 homebrew successfully completed kickstarter campaign raise funds servers test build formulae managed raise december 13 2013 homebrew repository migrated howell github account project account february 2015 due downtime sourceforge resulted binaries unavailable homebrew moved hosting bintray september 21 2016 homebrew version 1.0.0 released december 2018 homebrew maintained team 21 people january 2019 linuxbrew merged back homebrew adding beta support linux windows subsystem linux homebrew \u2019 feature set february 2 2019 homebrew version 2.0.0 released homebrew written ruby programming language targets version ruby comes installed macos operating system default installed codice_1 consists git repository allowing user update homebrew pulling updated repository github package manager builds software source using formulae ruby scripts constructed homebrew domain specific language dsl managing dependencies downloading source files configuring compiling software binary packages called bottles provide pre-built formulae default options homebrew honor default privileges codice_1 directory ownership changed root group permissions wheel group installing user admin group specifically mode changes codice_3 codice_4 files directories ownership changed installer considered major security flaw homebrew collects installation build error operating system version statistics via google analytics possible opt command codice_5 users view analytics data last 30 90 365 days homebrew website", + "neighbors": [ + 33, + 134, + 275, + 301, + 337, + 412, + 509, + 521, + 716, + 777, + 786, + 796, + 899, + 939, + 961, + 1004, + 1046, + 1138, + 1214, + 1225, + 1227, + 1235, + 1292, + 1301, + 1311, + 1366, + 1458, + 1547, + 1582, + 1633 + ], + "mask": "Train" + }, + { + "node_id": 208, + "label": 7, + "text": "GPU_cluster:gpu cluster gpu cluster computer cluster node equipped graphics processing unit gpu harnessing computational power modern gpus via general-purpose computing graphics processing units gpgpu fast calculations performed gpu cluster hardware classification gpu clusters fall two categories heterogeneous homogeneous heterogeneous hardware major ihv used amd nvidia even different models gpu used e.g 8800gt mixed 8800gtx gpu cluster considered heterogeneous homogeneous every single gpu hardware class make model i.e homogeneous cluster comprising 100 8800gts amount memory classifying gpu cluster according semantics largely directs software development cluster different gpus different capabilities utilized interconnect addition computer nodes respective gpus fast enough interconnect needed order shuttle data amongst nodes type interconnect largely depends number nodes present examples interconnects include gigabit ethernet infiniband vendors nvidia provides list dedicated tesla preferred partners tpp capability building delivering fully configured gpu cluster using tesla 20-series gpgpus amax information technologies dell hewlett-packard silicon graphics companies provide complete line gpu clusters systems software components required make many gpu-equipped machines act one include mapping algorithm run gpu cluster somewhat similar mapping algorithm run traditional computer cluster example rather distributing pieces array ram texture divided amongst nodes gpu cluster", + "neighbors": [ + 51, + 86, + 211, + 755, + 917, + 1219, + 1421, + 1503, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 209, + "label": 2, + "text": "Bradley_M._Kuhn:bradley m. kuhn bradley m. kuhn born 1973 free software activist united states kuhn currently president software freedom conservancy previously executive director 2010 floss community liaison technology director software freedom law center sflc previously served executive director free software foundation fsf 2001 march 2005 elected fsf board directors march 2010 best known efforts gpl enforcement fsf sflc creator fsf license list original author affero general public license long proponent non-profit structures floss development leads efforts direction software freedom conservancy recipient 2012 o'reilly open source award kuhn attended loyola blakefield followed loyola college maryland graduating may 1995 summa cum laude bachelor science computer science kuhn attended graduate school computer science university cincinnati received master science degree 2001 direction graduate advisor john franco kuhn received usenix student grant scholarship thesis work. focused dynamic interoperability free software languages using port perl java virtual machine example larry wall served kuhn thesis committee kuhn thesis showed various problems regarding use stack-based virtual machines perl discovery became part justification launch parrot project kuhn active participant perl6 rfc process headed perl6-licensing committee process rfcs licensing written kuhn taught ap computer science walnut hills high school 1998-1999 academic year using linux-based lab built students kuhn volunteered free software foundation throughout graduate school hired part-time richard stallman assistant january 2000 kuhn seen posting lists professional capacity around time early employment fsf kuhn suggested creation maintained fsf license list page argued license proliferation kuhn also early active member cincinnati linux user group period serving board directors 1998 giving numerous presentations bradley kuhn computer science career briefly involved proprietary software development high school sour experience area one motivations sticking career non-profit work since graduate school kuhn worked non-profits hired full-time work fsf late 2000 promoted executive director march 2001 kuhn launched fsf associate membership campaign formalized gnu general public license gpl enforcement efforts gpl compliance labs led fsf response sco lawsuit authored affero clause original version agpl taught numerous cle classes lawyers gpl kuhn left fsf march 2005 join founding team software freedom law center eben moglen daniel ravicher subsequently established software freedom conservancy april 2006 fsf sflc kuhn involved major efforts united states enforce gpl sflc assisted eben moglen richard stallman richard fontana drafting gplv3 managed production software system gplv3 comment process called stet advocated strongly inclusion affero clause gplv3 assisted production agplv3 fsf decided write separate affero version gplv3 prior 2010 kuhn floss community liaison technical director software freedom law center president software freedom conservancy october 2010 became conservancy first executive director leadership change serves president distinguished technologist karen sandler holds executive director position 2010 kuhn founded replicant project together aaron williamson graziano sorbaioli denis \u2018 gnutoo \u2019 carikli aiming replacing proprietary android components free software counterparts kuhn fact registrant replicant.us domain since october 2010 kuhn co-hosted sandler free freedom podcast covers legal policy issues floss world kuhn sandler previously co-hosted similar podcast software freedom law show kuhn avid poker player played professionally part-time basis 2002-2007 since january 2008 contributor pokersource gpl 'd online poker system written maintained lo\u00efc dachary", + "neighbors": [ + 134, + 267, + 275, + 301, + 323, + 327, + 630, + 688, + 716, + 806, + 816, + 825, + 897, + 985, + 1060, + 1102, + 1123, + 1180, + 1190, + 1197, + 1227, + 1322, + 1361, + 1385, + 1413, + 1509, + 1524 + ], + "mask": "Test" + }, + { + "node_id": 210, + "label": 3, + "text": "SPARC:sparc sparc scalable processor architecture reduced instruction set computing risc instruction set architecture isa originally developed sun microsystems fujitsu design strongly influenced experimental berkeley risc system developed early 1980s first developed 1986 released 1987 sparc one successful early commercial risc systems success led introduction similar risc designs number vendors 1980s 90s first implementation original 32-bit architecture sparc v7 used sun sun-4 workstation server systems replacing earlier sun-3 systems based motorola 68000 series processors sparc v8 added number improvements part supersparc series processors released 1992 sparc v9 released 1993 introduced 64-bit architecture first released sun ultrasparc processors 1995 later sparc processors used symmetric multiprocessing smp non-uniform memory access cc-numa servers produced sun solbourne fujitsu among others design turned sparc international trade group 1989 since architecture developed members sparc international also responsible licensing promoting sparc architecture managing sparc trademarks including sparc owns providing conformance testing sparc international intended grow sparc architecture create larger ecosystem sparc licensed several manufacturers including atmel bipolar integrated technology cypress semiconductor fujitsu matsushita texas instruments due sparc international sparc fully open non-proprietary royalty-free september 2017 latest commercial high-end sparc processors fujitsu sparc64 xii introduced 2017 sparc m12 server sparc64 xifx introduced 2015 primehpc fx100 supercomputer oracle sparc m8 introduced september 2017 high-end servers friday september 1 2017 round layoffs started oracle labs november 2016 oracle terminated sparc design completion m8 much processor core development group austin texas dismissed teams santa clara california burlington massachusetts sparc development continues fujitsu returning role leading provider sparc servers new cpu due 2020 time frame sparc architecture heavily influenced earlier risc designs including risc ii university california berkeley ibm 801 original risc designs minimalist including features op-codes possible aiming execute instructions rate almost one instruction per clock cycle made similar mips architecture many ways including lack instructions multiply divide another feature sparc influenced early risc movement branch delay slot sparc processor usually contains many 160 general purpose registers according oracle sparc architecture 2015 specification implementation may contain 72 640 general-purpose 64-bit registers point 32 immediately visible software \u2014 8 set global registers one g0 hard-wired zero seven usable registers 24 stack registers 24 registers form called register window function call/return window moved register stack window 8 local registers shares 8 registers adjacent windows shared registers used passing function parameters returning values local registers used retaining local values across function calls scalable sparc comes fact sparc specification allows implementations scale embedded processors large server processors sharing core non-privileged instruction set one architectural parameters scale number implemented register windows specification allows three 32 windows implemented implementation choose implement 32 provide maximum call stack efficiency implement three reduce cost complexity design implement number architectures include similar register file features include intel i960 ia-64 amd 29000 architecture gone several revisions gained hardware multiply divide functionality version 8 64-bit addressing data added version 9 sparc specification published 1994 sparc version 8 floating point register file 16 double-precision registers used two single-precision registers providing total 32 single precision registers odd-even number pair double precision registers used quad-precision register thus allowing 8 quad precision registers sparc version 9 added 16 double precision registers also accessed 8 quad precision registers additional registers accessed single precision registers sparc cpu implements quad-precision operations hardware 2004 tagged add subtract instructions perform adds subtracts values checking bottom two bits operands 0 reporting overflow useful implementation run time ml lisp similar languages might use tagged integer format endianness 32-bit sparc v8 architecture purely big-endian 64-bit sparc v9 architecture uses big-endian instructions access data either big-endian little-endian byte order chosen either application instruction load-store level memory page level via mmu setting latter often used accessing data inherently little-endian devices pci buses three major revisions architecture first published version 32-bit sparc version 7 v7 1986 sparc version 8 v8 enhanced sparc architecture definition released 1990 main differences v7 v8 addition integer multiply divide instructions upgrade 80-bit extended precision floating-point arithmetic 128-bit quad-precision arithmetic sparc v8 served basis ieee standard 1754-1994 ieee standard 32-bit microprocessor architecture sparc version 9 64-bit sparc architecture released sparc international 1993 developed sparc architecture committee consisting amdahl corporation fujitsu icl lsi logic matsushita philips ross technology sun microsystems texas instruments newer specifications always remain compliant full sparc v9 level 1 specification 2002 sparc joint programming specification 1 jps1 released fujitsu sun describing processor functions identically implemented cpus companies commonality first cpus conforming jps1 ultrasparc iii sun sparc64 v fujitsu functionalities covered jps1 documented processor implementation supplements end 2003 jps2 released support multicore cpus first cpus conforming jps2 ultrasparc iv sun sparc64 vi fujitsu early 2006 sun released extended architecture specification ultrasparc architecture 2005 includes non-privileged privileged portions sparc v9 also architectural extensions developed processor generations ultrasparc iii iv iv+ well cmt extensions starting ultrasparc t1 implementation 2007 sun released updated specification ultrasparc architecture 2007 ultrasparc t2 implementation complied august 2012 oracle corporation made available new specification oracle sparc architecture 2011 besides overall update reference adds vis 3 instruction set extensions hyperprivileged mode 2007 specification october 2015 oracle released sparc m7 first processor based new oracle sparc architecture 2015 specification.- revision includes vis 4 instruction set extensions hardware-assisted encryption silicon secured memory ssm sparc architecture provided continuous application binary compatibility first sparc v7 implementation 1987 sun ultrasparc architecture implementations among various implementations sparc sun supersparc ultrasparc-i popular used reference systems spec cpu95 cpu2000 benchmarks 296 mhz ultrasparc-ii reference system spec cpu2006 benchmark following organizations licensed sparc architecture notes sparc machines generally used sun sunos solaris opensolaris including derivatives illumos openindiana operating systems also used nextstep rtems freebsd openbsd netbsd linux 1993 intergraph announced port windows nt sparc architecture later cancelled october 2015 oracle announced linux sparc reference platform several fully open source implementations sparc architecture exist fully open source simulator sparc architecture also exists hpc loads fujitsu builds specialized sparc64 fx processors new instruction extensions set called hpc-ace high performance computing \u2013 arithmetic computational extensions fujitsu k computer ranked top500 june 2011 november 2011 lists combines 88,128 sparc64 viiifx cpus eight cores total 705,024 cores\u2014almost twice many system top500 time k computer powerful next five systems list combined highest performance-to-power ratio supercomputer system also ranked green500 june 2011 list score 824.56 mflops/w november 2012 release top500 k computer ranked using far power top three ranked corresponding green500 release newer hpc processors ixfx xifx included recent primehpc fx10 fx100 supercomputers tianhe-2 top500 november 2014 number nodes galaxy ft-1500 opensparc-based processors developed china however processors contribute linpack score", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 108, + 123, + 127, + 134, + 137, + 160, + 175, + 193, + 206, + 212, + 224, + 227, + 230, + 234, + 266, + 270, + 271, + 272, + 313, + 314, + 331, + 335, + 352, + 362, + 388, + 392, + 399, + 413, + 443, + 445, + 457, + 460, + 465, + 503, + 508, + 529, + 544, + 571, + 589, + 643, + 653, + 659, + 719, + 744, + 752, + 770, + 776, + 787, + 803, + 805, + 821, + 830, + 846, + 893, + 907, + 919, + 937, + 941, + 946, + 979, + 980, + 984, + 994, + 1002, + 1006, + 1009, + 1013, + 1016, + 1028, + 1052, + 1072, + 1081, + 1100, + 1111, + 1113, + 1120, + 1125, + 1138, + 1143, + 1158, + 1160, + 1161, + 1168, + 1174, + 1207, + 1219, + 1222, + 1224, + 1251, + 1256, + 1263, + 1272, + 1284, + 1287, + 1288, + 1290, + 1302, + 1318, + 1322, + 1351, + 1398, + 1466, + 1469, + 1484, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1538, + 1550, + 1553, + 1557, + 1572, + 1578, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 211, + "label": 7, + "text": "Dell:dell dell us multinational computer technology company develops sells repairs supports computers related products services named founder michael dell company one largest technological corporations world employing 145,000 people u.s. around world annual report 2018 dell sells personal computers pcs servers data storage devices network switches software computer peripherals hdtvs cameras printers mp3 players electronics built manufacturers company well known innovations supply chain management electronic commerce particularly direct-sales model build-to-order configure order approach manufacturing\u2014delivering individual pcs configured customer specifications dell pure hardware vendor much existence acquisition 2009 perot systems dell entered market services company since made additional acquisitions storage networking systems aim expanding portfolio offering computers delivering complete solutions enterprise customers dell listed number 51 fortune 500 list 2014 going private 2013 newly confidential nature financial information prevents company ranked fortune 2015 third largest pc vendor world lenovo hp dell largest shipper pc monitors worldwide dell sixth largest company texas total revenue according fortune magazine second largest non-oil company texas \u2013 behind \u2013 largest company greater austin area publicly traded company well component nasdaq-100 p 500 taken private leveraged buyout closed october 30 2013 2015 dell acquired enterprise technology firm emc corporation following completion purchase dell emc became divisions dell technologies dell traces origins 1984 michael dell created dell computer corporation time business pc limited student university texas austin dorm-room headquartered company sold ibm pc-compatible computers built stock components dell dropped school focus full-time fledgling business getting 1,000 expansion-capital family 1985 company produced first computer design turbo pc sold 795 pc limited advertised systems national computer magazines sale directly consumers custom assembled ordered unit according selection options company grossed 73 million first year operation 1986 michael dell brought lee walker 51-year-old venture capitalist president chief operating officer serve dell mentor implement dell ideas growing company walker also instrumental recruiting members board directors company went public 1988 walker retired 1990 due health michael dell hired morton meyerson former ceo president electronic data systems transform company fast-growing medium-sized firm billion-dollar enterprise company dropped pc limited name 1987 become dell computer corporation began expanding globally june 1988 dell market capitalization grew 30 million 80 million june 22 initial public offering 3.5 million shares 8.50 share 1992 fortune magazine included dell computer corporation list world 500 largest companies making michael dell youngest ceo fortune 500 company ever 1993 complement direct sales channel dell planned sell pcs big-box retail outlets wal-mart would brought additional 125 million annual revenue bain consultant kevin rollins persuaded michael dell pull deals believing would money losers long run margins retail thin best dell left reseller channel 1994 rollins would soon join dell full-time eventually become company president ceo originally dell emphasize consumer market due higher costs unacceptably-low profit margins selling individuals households changed company internet site took 1996 1997 industry average selling price individuals going dell going second- third-time computer buyers wanted powerful computers multiple features need much technical support choosing dell dell found opportunity among pc-savvy individuals liked convenience buying direct customizing pc means delivered days early 1997 dell created internal sales marketing group dedicated serving home market introduced product line designed especially individual users 1997 2004 dell enjoyed steady growth gained market share competitors even industry slumps period rival pc vendors compaq gateway ibm packard bell ast research struggled eventually left market bought dell surpassed compaq become largest pc manufacturer 1999 operating costs made 10 percent dell 35 billion revenue 2002 compared 21 percent revenue hewlett-packard 25 percent gateway 46 percent cisco 2002 compaq merged hewlett packard fourth-place pc maker newly combined hewlett packard took top spot struggled dell soon regained lead dell grew fastest early 2000s dell attained maintained top rating pc reliability customer service/technical support according consumer reports year year mid-to-late 90 2001 right windows xp released 1996 dell began selling computers website mid-1990s dell expanded beyond desktop computers laptops selling servers starting low-end servers major three providers servers time ibm hewlett packard compaq many based proprietary technology ibm power4 microprocessors various proprietary versions unix operating system dell new poweredge servers require major investment proprietary technologies ran microsoft windows nt intel chips could built cheaper competitors consequently dell enterprise revenues almost nonexistent 1994 accounted 13 percent company total intake 1998 three years later dell passed compaq top provider intel-based servers 31 percent market dell first acquisition occurred 1999 purchase convergenet technologies 332 million dell failed develop enterprise storage system in-house convergenet elegant complex technology fit dell commodity-producer business model forcing dell write entire value acquisition 2002 dell expanded product line include televisions handhelds digital audio players printers chairman ceo michael dell repeatedly blocked president coo kevin rollins attempt lessen company heavy dependency pcs rollins wanted fix acquiring emc corporation 2003 company rebranded simply dell inc. recognize company expansion beyond computers 2004 michael dell resigned ceo retaining position chairman handing ceo title kevin rollins president coo since 2001 despite longer holding ceo title dell essentially acted de facto co-ceo rollins rollins dell acquired alienware manufacturer high-end pcs targeted mainly towards gaming market 2005 earnings sales continued rise sales growth slowed considerably company stock lost 25 value year june 2006 stock traded around us 25 40 july 2005\u2014the high-water mark company post-dotcom era slowing sales growth attributed maturing pc market constituted 66 dell sales analysts suggested dell needed make inroads non-pc businesses segments storage services servers dell price advantage tied ultra-lean manufacturing desktop pcs became less important savings became harder find inside company supply chain competitors hewlett-packard acer made pc manufacturing operations efficient match dell weakening dell traditional price differentiation throughout entire pc industry declines prices along commensurate increases performance meant dell fewer opportunities upsell customers lucrative strategy encouraging buyers upgrade processor memory result company selling greater proportion inexpensive pcs eroded profit margins laptop segment become fastest-growing pc market dell produced low-cost notebooks china like pc manufacturers eliminated dell manufacturing cost advantages plus dell reliance internet sales meant missed growing notebook sales big box stores cnet suggested dell getting trapped increasing commoditization high volume low margin computers prevented offering exciting devices consumers demanded despite plans expanding global regions product segments dell heavily dependent u.s. corporate pc market desktop pcs sold commercial corporate customers accounted 32 percent revenue 85 percent revenue comes businesses sixty-four percent revenue comes north south america according 2006 third-quarter results u.s. shipments desktop pcs shrinking corporate pc market purchases pcs upgrade cycles largely decided take break buying new systems last cycle started around 2002 three years companies started buying pcs ahead perceived y2k problems corporate clients expected upgrade extensive testing microsoft windows vista expected early 2007 putting next upgrade cycle around 2008 heavily depending pcs dell slash prices boost sales volumes demanding deep cuts suppliers dell long stuck direct sales model consumers become main drivers pc sales recent years yet decline consumers purchasing pcs web phone increasing numbers visiting consumer electronics retail stores try devices first dell rivals pc industry hp gateway acer long retail presence well poised take advantage consumer shift lack retail presence stymied dell attempts offer consumer electronics flat-panel tvs mp3 players dell responded experimenting mall kiosks plus quasi-retail stores texas new york dell reputation company relied upon supply chain efficiencies sell established technologies low prices instead innovator mid-2000s many analysts looking innovating companies next source growth technology sector dell low spending r relative revenue compared ibm hewlett packard apple inc. \u2014which worked well commoditized pc market\u2014prevented making inroads lucrative segments mp3 players later mobile devices increasing spending r would cut operating margins company emphasized dell done well horizontal organization focused pcs computing industry moved horizontal mix-and-match layers 1980s mid-2000 industry shifted vertically integrated stacks deliver complete solutions dell lagged far behind competitors like hewlett packard oracle dell reputation poor customer service since 2002 exacerbated moved call centers offshore growth outstripped technical support infrastructure came increasing scrutiny web original dell model known high customer satisfaction pcs sold thousands 2000s company could justify level service computers lineup sold hundreds rollins responded shifting dick hunter head manufacturing head customer service hunter noted dell dna cost-cutting got way aimed reduce call transfer times call center representatives resolve inquiries one call 2006 dell spent 100 million months improve rolled dellconnect answer customer inquiries quickly july 2006 company started direct2dell blog february 2007 michael dell launched ideastorm.com asking customers advice including selling linux computers reducing promotional bloatware pcs initiatives manage cut negative blog posts 49 22 well reduce dell hell prominent internet search engines also criticism dell used faulty components pcs particularly 11.8 million optiplex desktop computers sold businesses governments may 2003 july 2005 suffered faulty capacitors battery recall august 2006 result dell laptop catching fire caused much negative attention company though later sony found responsible faulty batteries 2006 marked first year dell growth slower pc industry whole fourth quarter 2006 dell lost title largest pc manufacturer rival hewlett packard whose personal systems group invigorated thanks restructuring initiated ceo mark hurd four five quarterly earnings reports expectations rollins resigned president ceo january 31 2007 founder michael dell assumed role ceo dell announced change campaign called dell 2.0 reducing number employees diversifying company products chairman board relinquishing ceo position michael dell still significant input company rollins years ceo return michael dell ceo company saw immediate changes operations exodus many senior vice-presidents new personnel brought outside company michael dell announced number initiatives plans part dell 2.0 initiative improve company financial performance include elimination 2006 bonuses employees discretionary awards reduction number managers reporting directly michael dell 20 12 reduction bureaucracy jim schneider retired cfo replaced donald carty company came sec probe accounting practices april 23 2008 dell announced closure one biggest canadian call-centers kanata ontario terminating approximately 1100 employees 500 redundancies effective spot official closure center scheduled summer call-center opened 2006 city ottawa bid host less year later dell planned double workforce nearly 3,000 workers add new building plans reversed due high canadian dollar made ottawa staff relatively expensive also part dell turnaround involved moving call-center jobs offshore cut costs company also announced shutdown edmonton alberta office losing 900 jobs total dell announced ending 8,800 jobs 2007\u20132008 \u2014 10 workforce late 2000s dell configure order approach manufacturing\u2014delivering individual pcs configured customer specifications us facilities longer efficient competitive high-volume asian contract manufacturers pcs became powerful low-cost commodities dell closed plants produced desktop computers north american market including mort topfer manufacturing center austin texas original location lebanon tennessee opened 1999 2008 early 2009 respectively desktop production plant winston-salem north carolina received us 280 million incentives state opened 2005 ceased operations november 2010 dell contract state required repay incentives failing meet conditions sold north carolina plant herbalife work used take place dell u.s. plants transferred contract manufacturers asia mexico dell factories overseas miami florida facility alienware subsidiary remains operation dell continues produce servers profitable products austin texas january 8 2009 dell announced closure manufacturing plant limerick ireland loss 1,900 jobs transfer production plant \u0142od\u017a poland release apple ipad tablet computer negative impact dell major pc vendors consumers switched away desktop laptop pcs dell mobility division managed success developing smartphones tablets whether running windows google android dell streak failure commercially critically due outdated os numerous bugs low resolution screen infoworld suggested dell oems saw tablets short-term low-investment opportunity running google android approach neglected user interface failed gain long term market traction consumers dell responded pushing higher-end pcs xps line notebooks compete apple ipad kindle fire tablets growing popularity smartphones tablet computers instead pcs drove dell consumer segment operating loss q3 2012 december 2012 dell suffered first decline holiday sales five years despite introduction windows 8 shrinking pc industry dell continued lose market share dropped lenovo 2011 fall number three world dell fellow american contemporary hewlett packard came pressure asian pc manufacturers lenovo asus acer lower production costs willing accept lower profit margins addition asian pc vendors improving quality design instance lenovo thinkpad series winning corporate customers away dell laptops dell customer service reputation slipping dell remained second-most profitable pc vendor took 13 percent operating profits pc industry q4 2012 behind apple inc. macintosh took 45 percent seven percent hewlett packard six percent lenovo asus one percent acer dell attempting offset declining pc business still accounted half revenue generates steady cash flow expanding enterprise market servers networking software services avoided many acquisition writedowns management turnover plagued chief rival hewlett packard dell also managed success taking advantage high-touch direct sales heritage establish close relationships design solutions clients despite spending 13 billion acquisitions diversify portfolio beyond hardware company unable convince market could thrive made transformation post-pc world suffered continued declines revenue share price dell market share corporate segment previously moat rivals longer case sales profits fallen precipitously several weeks rumors started around january 11 2013 dell announced february 5 2013 struck 24.4 billion leveraged buyout deal would delisted shares nasdaq hong kong stock exchange taken private reuters reported michael dell silver lake partners aided 2 billion loan microsoft would acquire public shares 13.65 apiece 24.4 billion buyout projected largest leveraged buyout backed private equity since 2007 financial crisis also largest technology buyout ever surpassing 2006 buyout freescale semiconductor 17.5 billion founder dell michael dell said february offer believe transaction open exciting new chapter dell customers team members dell rival lenovo reacted buyout saying financial actions traditional competitors substantially change outlook march 2013 blackstone group carl icahn expressed interest purchasing dell april 2013 blackstone withdrew offer citing deteriorating business private equity firms kkr co. tpg capital declined submit alternative bids dell citing uncertain market personal computers competitive pressures wide-open bidding war never materialized analysts said biggest challenge facing silver lake would find \u201c exit strategy \u201d profit investment would company would hold ipo go public one warned \u201c even get 25bn enterprise value dell take years get out. \u201d may 2013 dell joined board voting offer following august reached deal special committee board 13.88 raised price 13.75 plus special dividend 13 cents per share well change voting rules 13.88 cash offer plus .08 per share dividend third fiscal quarter accepted september 12 closed october 30 2013 ending dell 25-year run publicly traded company buyout newly private dell offered voluntary separation programme expected reduce workforce seven percent reception program exceeded expectations dell may forced hire new staff make losses november 19 2015 dell alongside arm holdings cisco systems intel microsoft princeton university founded openfog consortium promote interests development fog computing july 2018 dell announced intentions become publicly traded company paying 21.7 billion cash stock buy back shares stake vmware november 2018 carl icahn 9.3 owner dell sued company plans go public october 12 2015 dell announced intent acquire enterprise software storage company emc corporation 67 billion labeled highest-valued tech acquisition history announcement came two years dell inc. returned private ownership claiming faced bleak prospects would need several years public eye rebuild business thought company value roughly doubled since emc pressured elliott management hedge fund holding 2.2 emc stock reorganize unusual federation structure emc divisions effectively run independent companies elliott argued structure deeply undervalued emc core emc ii data storage business increasing competition emc ii vmware products confusing market hindering companies wall street journal estimated 2014 dell revenue 27.3billion personal computers 8.9bn servers emc 16.5bn emc ii 1bn rsa security 6bn vmware 230million pivotal software emc owns around 80 percent stock vmware proposed acquisition maintain vmware separate company held via new tracking stock parts emc rolled dell acquisition closes dell publish quarterly financial results ceased going private 2013 combined business expected address markets scale-out architecture converged infrastructure private cloud computing playing strengths emc dell commentators questioned deal fbr capital markets saying though makes ton sense dell nightmare scenario would lack strategic synergies emc fortune said lot dell like emc portfolio add enough justify tens billions dollars entire package probably register reported view william blair company merger would blow current chess board forcing infrastructure vendors restructure achieve scale vertical integration value vmware stock fell 10 announcement valuing deal around 63\u201364bn rather 67bn originally reported key investors backing deal besides dell singapore temasek holdings silver lake partners september 7 2016 dell completed acquisition emc post-acquisition dell re-organized new parent company dell technologies dell consumer workstation businesses internally referred dell client solutions group one company three main business divisions alongside dell emc vmware dell headquarters located round rock texas company employed 14,000 people central texas region largest private employer space 1999 almost half general fund city round rock originated sales taxes generated dell headquarters dell previously headquarters arboretum complex northern austin texas 1989 dell occupied arboretum complex 1990 dell 1,200 employees headquarters 1993 dell submitted document round rock officials titled dell computer corporate headquarters round rock texas may 1993 schematic design despite filing year company said going move headquarters 1994 dell announced moving employees arboretum going continue occupy top floor arboretum company official headquarters address would continue arboretum top floor continued hold dell board room demonstration center visitor meeting room less one month prior august 29 1994 dell moved 1,100 customer support telephone sales employees round rock dell lease arboretum scheduled expire 1994 1996 dell moving headquarters round rock january 1996 3,500 people still worked current dell headquarters one building round rock headquarters round rock 3 space 6,400 employees scheduled completed november 1996 1998 dell announced going add two buildings round rock complex adding office space complex 2000 dell announced would lease space las cimas office complex unincorporated travis county texas austin west lake hills house company executive offices corporate headquarters 100 senior executives scheduled work building end 2000 january 2001 company leased space las cimas 2 located along loop 360 las cimas 2 housed dell executives investment operations corporate functions dell also option space las cimas 3 slowdown business required reducing employees production capacity dell decided sublease offices two buildings las cimas office complex 2002 dell announced planned sublease space another tenant company planned move headquarters back round rock tenant secured 2003 dell moved headquarters back round rock leased las cimas ii total seven-year period 2003 year roughly space absorbed new subtenants 2008 dell switched power sources round rock headquarters environmentally friendly ones 60 total power coming txu energy wind farms 40 coming austin community landfill gas-to-energy plant operated waste management inc. dell facilities united states located austin texas nashua new hampshire nashville tennessee oklahoma city oklahoma peoria illinois hillsboro oregon portland area winston-salem north carolina eden prairie minnesota dell compellent bowling green kentucky lincoln nebraska miami florida facilities located abroad include penang malaysia xiamen china bracknell uk manila philippines chennai india hyderabad india noida india hortolandia porto alegre brazil bratislava slovakia \u0142\u00f3d\u017a poland panama city panama dublin limerick ireland casablanca morocco montpellier france us india countries dell business functions provide support globally research development manufacturing finance analysis customer care early beginnings dell operated pioneer configure order approach manufacturing\u2014delivering individual pcs configured customer specifications contrast pc manufacturers times delivered large orders intermediaries quarterly basis minimize delay purchase delivery dell general policy manufacturing products close customers also allows implementing just-in-time jit manufacturing approach minimizes inventory costs low inventory another signature dell business model\u2014a critical consideration industry components depreciate rapidly dell manufacturing process covers assembly software installation functional testing including burn-in quality control throughout company history dell manufactured desktop machines in-house contracted manufacturing base notebooks configuration in-house company approach changed cited 2006 annual report states continuing expand use original design manufacturing partnerships manufacturing outsourcing relationships wall street journal reported september 2008 dell approached contract computer manufacturers offers sell plants late 2000s dell configure order approach manufacturing\u2014delivering individual pcs configured customer specifications us facilities longer efficient competitive high-volume asian contract manufacturers pcs became powerful low-cost commodities assembly desktop computers north american market formerly took place dell plants austin texas original location lebanon tennessee opened 1999 closed 2008 early 2009 respectively plant winston-salem north carolina received us 280 million incentives state opened 2005 ceased operations november 2010 dell contract state requires repay incentives failing meet conditions work used take place dell u.s. plants transferred contract manufacturers asia mexico dell factories overseas miami florida facility alienware subsidiary remains operation dell continues produce servers profitable products austin texas dell assembled computers emea market limerick facility republic ireland employed 4,500 people country dell began manufacturing limerick 1991 went become ireland largest exporter goods second-largest company foreign investor january 8 2009 dell announced would move dell manufacturing limerick dell new plant polish city \u0142\u00f3d\u017a january 2010 european union officials said would investigate \u20ac52.7million aid package polish government used attract dell away ireland european manufacturing facility 1 emf1 opened 1990 emf3 form part raheen industrial estate near limerick emf2 previously wang facility later occupied flextronics situated castletroy closed 2002 dell inc. consolidated production emf3 emf1 contains offices subsidies polish government keep dell long time ending assembly limerick plant cherrywood technology campus dublin largest dell office republic 1200 people sales mainly uk ireland support enterprise support emea research development cloud computing manufacturing except dell alienware subsidiary manufactures pcs athlone ireland plant whether facility remain ireland certain construction emf4 \u0142\u00f3d\u017a poland dell started production autumn 2007 dell opened plants penang malaysia 1995 xiamen china 1999 facilities serve asian market assemble 95 dell notebooks dell inc. invested estimated 60 million new manufacturing unit chennai india support sales products indian subcontinent indian-made products bear made india mark 2007 chennai facility target producing 400,000 desktop pcs plans envisaged starting produce notebook pcs products second half 2007 dell moved desktop notebook poweredge server manufacturing south american market eldorado sul plant opened 1999 new plant hortolandia brazil 2007 corporation markets specific brand names different market segments business/corporate class represent brands company advertising emphasizes long life-cycles reliability serviceability brands include dell home office/consumer class emphasizes value performance expandability brands include dell peripherals class includes usb keydrives lcd televisions printers dell monitors includes lcd tvs plasma tvs projectors hdtv monitors dell ultrasharp high-end brand monitors dell service support brands include dell solution station extended domestic support services previously dell call dell support center extended support services abroad dell business support commercial service-contract provides industry-certified technician lower call-volume normal queues dell everdream desktop management software service remote-desktop management originally saas company founded elon musk cousin lyndon rive dell bought 2007 tech team support-queue available home users purchased systems either dell website dell phone-centers discontinued products brands include axim pda discontinued april 9 2007 dimension home small office desktop computers discontinued july 2007 dell digital jukebox mp3 player discontinued august 2006 dell powerapp application-based servers dell optiplex desktop tower computers previously supported run server desktop operating systems november 2015 emerged several dell computers shipped identical pre-installed root certificate known edellroot raised security risks attackers impersonating https-protected websites google bank america malware signed certificate bypass microsoft software filtering dell apologised offered removal tool also november 2015 researcher discovered customers diagnostic program dell foundation services could digitally tracked using unique service tag number assigned program possible even customer enabled private browsing deleted browser cookies ars technica recommended dell customers uninstall program issue addressed board consists nine directors michael dell founder company serves chairman board chief executive officer board members include carty judy lewent klaus luft alex mandl sam nunn shareholders elect nine board members meetings board members get majority votes must submit resignation board subsequently choose whether accept resignation board directors usually sets five committees oversight specific matters committees include audit committee handles accounting issues including auditing reporting compensation committee approves compensation ceo employees company finance committee handles financial matters proposed mergers acquisitions governance nominating committee handles various corporate matters including nomination board antitrust compliance committee attempts prevent company practices violating antitrust laws day-to-day operations company run global executive management committee sets strategic direction dell regional senior vice-presidents countries united states including david marmonti emea stephen j. felice asia/japan officers included martin garvin senior vice president worldwide procurement susan sheskey vice president chief information officer dell advertisements appeared several types media including television internet magazines catalogs newspapers dell inc marketing strategies include lowering prices times year free bonus products dell printers free shipping encourage sales stave competitors 2006 dell cut prices effort maintain 19.2 market share also cut profit margins half 8.7 4.3 percent maintain low prices dell continues accept purchases products via internet telephone network move customer-care division india el salvador popular united states television print ad campaign early 2000s featured actor ben curtis playing part steven lightly mischievous blond-haired youth came assistance bereft computer purchasers television advertisement usually ended steven catch-phrase dude 're gettin dell subsequent advertising campaign featured interns dell headquarters curtis character appearing small cameo end one first commercials particular campaign 2007 dell switched advertising agencies us bbdo working mother media july 2007 dell released new advertising created working mother support inspiron xps lines ads featured music flaming lips devo re-formed especially record song ad work also 2007 dell began using slogan say customizes computers fit customers requirements beginning 2011 dell began hosting conference austin texas austin convention center titled dell world event featured new technology services provided dell dell partners 2011 event held october 12\u201314 2012 event held december 11\u201313 2013 event held december 11\u201313 2014 event held november 4\u20136 2015 event held october 20\u201323 late 2007 dell inc. announced planned expand program value-added resellers vars giving official name dell partner direct new website dell india started online ecommerce website dell partner www.compuindia.com gng electronics pvt ltd termed dell express ship affiliate desa main objective reduce delivery time customers visit dell india official site given option buy online redirected dell affiliate website compuindia.com dell also operates captive analytics division supports pricing web analytics supply chain operations dga operates single centralized entity global view dell business activities firm supports 500 internal customers worldwide created quantified impact 500 million 2008 dell received press coverage claim world secure laptops specifically latitude d630 latitude d830 lenovo request u.s. national advertising division nad evaluated claim reported dell enough evidence support dell first opened retail stores india early 1990s dell sold products best buy costco sam club stores united states dell stopped practice 1994 citing low profit margins business exclusively distributing direct-sales model next decade 2003 dell briefly sold products sears stores u.s 2007 dell started shipping products major retailers u.s. starting sam club wal-mart staples largest office-supply retailer u.s. best buy largest electronics retailer u.s. became dell retail partners later year starting 2002 dell opened kiosk locations united states allow customers examine products buying directly company starting 2005 dell expanded kiosk locations include shopping malls across australia canada singapore hong kong january 30 2008 dell announced would shut 140 kiosks u.s. due expansion retail stores june 3 2010 dell also shut mall kiosks australia dell products shipped one largest office-supply retailers canada staples business depot april 2008 future shop best buy began carrying subset dell products certain desktops laptops printers monitors since shoppers certain markets show reluctance purchase technological products phone internet dell looked opening retail operations countries central europe russia april 2007 dell opened retail store budapest october year dell opened retail store moscow uk hmv flagship trocadero store sold dell xps pcs since december 2007 january 2008 uk stores dsgi sold dell products particular currys pc world stores 2008 large supermarket-chain tesco sold dell laptops desktops outlets throughout uk may 2008 dell reached agreement office supply chain officeworks part coles group stock modified models inspiron desktop notebook range models slightly different model numbers almost replicate ones available dell store dell continued retail push australian market partnership harris technology another part coles group november year addition dell expanded retail distributions australia agreement discount electrical retailer good guys known slashing prices dell agreed distribute variety makes desktops notebooks including studio xps systems late 2008 dell dick smith electronics owned woolworths limited reached agreement expand within dick smith 400 stores throughout australia new zealand may 2009 1 year since officeworks\u2014owned coles group\u2014reached deal retailer agreed distribute variety inspiron studio notebooks minimal studio desktops dell range dell continues run operate various kiosks 18 shopping centres throughout australia march 31 2010 dell announced australian kiosk employees shutting australian/new zealand dell kiosk program germany dell selling selected smartphones notebooks via media markt saturn well shopping websites dell major competitors include hewlett-packard hp hasee acer fujitsu toshiba gateway sony asus lenovo ibm msi panasonic samsung apple dell subsidiary alienware compete enthusiast market avadirect falcon northwest voodoopc subsidiary hp manufacturers second quarter 2006 dell 18 19 share worldwide personal computer market compared hp roughly 15 dell lost lead pc-business hewlett-packard gartner idc estimated third quarter 2006 hp shipped units worldwide dell dell 3.6 growth paled comparison hp 15 growth period problem got worse fourth quarter gartner estimated dell pc shipments declined 8.9 versus hp 23.9 growth result end 2006 dell overall pc market-share stood 13.9 versus hp 17.4 idc reported dell lost server market share top four competitors arena idc q4 2006 estimates show dell share server market 8.1 9.5 previous year represents 8.8 loss year-over-year primarily competitors emc ibm 2001 dell emc entered partnership whereby companies jointly design products dell provided support certain emc products including midrange storage systems fibre channel iscsi storage area networks relationship also promotes sells oem versions backup recovery replication archiving software december 9 2008 dell emc announced multi-year extension 2013 strategic partnership emc addition dell expanded product lineup adding emc celerra nx4 storage system portfolio dell/emc family networked storage systems partnered new line data deduplication products part tierdisk family data storage devices october 17 2011 dell discontinued reselling emc storage products ending partnership 2 years early dell committed reducing greenhouse gas emissions global activities 40 2015 2008 fiscal year baseline year listed greenpeace \u2019 guide greener electronics scores leading electronics manufacturers according policies sustainability climate energy green products november 2011 dell ranked 2nd 15 listed electronics makers increasing score 5.1 4.9 gained previous ranking october 2010 dell first company publicly state timeline elimination toxic polyvinyl chloride pvc brominated flame retardants bfrs planned phase end 2009 revised commitment aims remove toxics end 2011 computing products march 2010 greenpeace activists protested dell offices bangalore amsterdam copenhagen calling dell \u2019 founder ceo michael dell \u2018 drop toxics \u2019 claiming dell aspiration \u2018 greenest technology company planet \u2019 \u2018 hypocritical \u2019 dell launched first products completely free pvc bfrs g-series monitors g2210 g2410 2009 2012 report progress relating conflict minerals enough project rated dell eighth highest 24 consumer electronics companies dell became first company information technology industry establish product-recycling goal 2004 completed implementation global consumer recycling-program 2006 february 6 2007 national recycling coalition awarded dell recycling works award efforts promote producer responsibility july 19 2007 dell announced exceeded targets working achieve multi-year goal recovering 275 million pounds computer equipment 2009 company reported recovery 78 million pounds nearly 40,000 tons equipment customers 2006 93-percent increase 2005 12.4 equipment dell sold seven years earlier june 5 2007 dell set goal becoming greenest technology company earth long term company launched zero-carbon initiative includes company introduced term re-generation round table london commemorating 2007 world environment day re-generation refers people ages throughout world want make difference improving world environment dell also talked plans take lead setting environmental standard technology industry maintaining leadership future dell reports environmental performance annual corporate social responsibility csr report follows global reporting initiative gri protocol dell 2008 csr report ranked application level b checked gri company aims reduce external environmental impact energy-efficient evolution products also reduce direct operational impact energy-efficiency programs internal energy-efficiency programs reportedly save company 3 million annually energy-cost savings largest component company internal energy-efficiency savings comes pc power management company expects save 1.8 million energy costs using specialized energy-management software network 50,000 pcs 1990s dell switched using primarily atx motherboards psu using boards power supplies mechanically identical differently wired connectors meant customers wishing upgrade hardware would replace parts scarce dell-compatible parts instead commonly available parts motherboard power connections reverted industry standard 2003 dell remains secretive motherboard pin-outs peripherals mmc readers power on/off switches leds 2005 complaints dell doubled 1,533 earnings grew 52 year 2006 dell acknowledged problems customer service issues included call transfers 45 calls long wait times dell blog detailed response 're spending 100 million\u2014and lot blood sweat tears talented people\u2014to fix later year company increased spending customer service 150 million since 2018 dell seen significant increase consumer satisfaction moreover customer service praised prompt accurate answers questions especially directed social media support august 17 2007 dell inc. announced internal investigation accounting practices would restate reduce earnings 2003 first quarter 2007 total amount 50 million 150 million 2 cents 7 cents per share investigation begun november 2006 resulted concerns raised u.s. securities exchange commission documents information dell inc. submitted alleged dell disclosed large exclusivity payments received intel agreeing buy processors rival manufacturer amd 2010 dell finally paid 100 million settle sec charges fraud michael dell executives also paid penalties suffered sanctions without admitting denying charges july 2009 dell apologized drawing ire taiwanese consumer protection commission twice refusing honour flood orders unusually low prices offered taiwanese website first instance dell offered 19 lcd panel 15 second instance dell offered latitude e4300 notebook nt 18,558 us 580 70 lower usual price nt 60,900 us 1900 concerning e4300 rather honour discount taking significant loss firm withdrew orders offered voucher nt 20,000 us 625 customer compensation consumer rights authorities taiwan fined dell nt 1 million us 31250 customer rights infringements many consumers sued firm unfair compensation court southern taiwan ordered firm deliver 18 laptops 76 flat-panel monitors 31 consumers nt 490,000 us 15,120 less third normal price court said event could hardly regarded mistakes prestigious firm said company mispriced products twice taiwanese website within 3 weeks michael dell made 24.4 billion buyout bid august 2013 activist shareholder carl icahn sued company board attempt derail bid promote forthcoming offer", + "neighbors": [ + 14, + 24, + 42, + 134, + 162, + 208, + 227, + 234, + 242, + 267, + 317, + 334, + 337, + 443, + 611, + 641, + 642, + 755, + 776, + 868, + 917, + 927, + 936, + 965, + 1100, + 1193, + 1196, + 1323, + 1384, + 1421, + 1431, + 1456, + 1503, + 1524, + 1569, + 1589, + 1602, + 1620 + ], + "mask": "Validation" + }, + { + "node_id": 212, + "label": 3, + "text": "Cycles_per_instruction:cycles per instruction computer architecture cycles per instruction aka clock cycles per instruction clocks per instruction cpi one aspect processor performance average number clock cycles per instruction program program fragment multiplicative inverse instructions per cycle average cycles per instruction given process defined following formula_1 formula_2 number instructions given instruction type formula_3 formula_4 clock-cycles instruction type formula_5 total instruction count summation sums instruction types given benchmarking process let us assume classic risc pipeline following five stages stage requires one clock cycle instruction passes stages sequentially without pipelining new instruction fetched stage 1 previous instruction finishes stage 5 therefore number clock cycles takes execute instruction five cpi 5 1 case processor said subscalar pipelining new instruction fetched every clock cycle exploiting instruction-level parallelism therefore since one could theoretically five instructions five pipeline stages one instruction per stage different instruction would complete stage 5 every clock cycle average number clock cycles takes execute instruction 1 cpi 1 case processor said scalar single-execution-unit processor best cpi attainable 1 however multiple-execution-unit processor one may achieve even better cpi values cpi 1 case processor said superscalar get better cpi values without pipelining number execution units must greater number stages example six executions units six new instructions fetched stage 1 six previous instructions finish stage 5 therefore average number clock cycles takes execute instruction 5/6 cpi 5/6 1 get better cpi values pipelining must least two execution units example two executions units two new instructions fetched every clock cycle exploiting instruction-level parallelism therefore two different instructions would complete stage 5 every clock cycle average number clock cycles takes execute instruction 1/2 cpi 1/2 1 multi-cycle mips five types instructions program cpi formula_6 433mhz processor used execute benchmark program following instruction mix clock cycle count determine effective cpi mips millions instructions per second rate execution time program formula_7 formula_8 since formula_9 formula_10 formula_11 therefore formula_12", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1011, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 213, + "label": 2, + "text": "Linux_Terminal_Server_Project:linux terminal server project linux terminal server project ltsp free open source terminal server linux allows many people simultaneously use computer applications run server terminal known thin client also known x terminal handling input output generally terminals low-powered lack hard disk quieter reliable desktop computers moving parts technology becoming popular schools allows school provide pupils access computers without purchasing upgrading expensive desktop machines improving access computers becomes less costly thin client machines older computers longer suitable running full desktop os even relatively slow cpu little 128 mb ram deliver excellent performance thin client addition use centralized computing resources means performance gained less money upgrades single server rather across fleet computers converting existing computers thin clients educational institution also gain control students using computing resources user sessions monitored server see epoptes lab management tool current form v5.x ltsp relies distributions integrate ltsp architecture respective products v4.x series ltsp add-on package distribution several distributions integrate ltsp either mainline ubuntu debian separate product edubuntu ubuntu k12ltsp centos skolelinux debian kiwi-ltsp suse ltsp registered trademark disklessworkstations.com llc founder project leader ltsp jim mcquillan ltsp distributed terms gnu general public license initially mille-xterm project funded canadian public agencies school districts province quebec created version ltsp integrating four subprojects portal based uportal open-source middleware stack cd free software windows/mac finally mille-xterm mille-xterm project goal provide scalable infrastructure massive x-terminal deployment mille means mod\u00e8le d'infrastructure logiciel libre en \u00e9ducation free software infrastructure model education targeted educational institutions 2009 mille-xterm integrated back ltsp ltsp-cluster project specializing large scale deployment ltsp one main differences ltsp ltsp-cluster integration web-based central control center replaces traditional one configuration file per thin client method client customization ltsp lts.conf file main ltsp ltsp-cluster allows organizations centrally manage thousands thin clients parameters central location ltsp-cluster high-availability high-performance thin-clients specified optional use redundant components services load-balanced made highly available ltsp-cluster support linux application servers well windows application servers provides similar level support centralized management high-availability load-balancing features platforms also included support virtual desktops remote users using nx technology nx protocol allow remote windows linux sessions accessed web browser low bandwidth 40 kbit/s requirements tolerance high-latency connections nx client runs various operating systems including linux mac windows ltsp v5.x added support thin client type known fat clients advent inexpensive relatively powerful computer hardware idea run applications locally thin client offering manageability thin client solution became reality case ltsp fat client root filesystem rudimentary chroot full linux installation chroot fat client uses ldm authenticate ltsp server mounts user home directories using ssh fuse local cpu ram used fat clients provides benefits ltsp unique offering ability computer mount root filesystem network run applications locally windows platform closest equivalent solution use technology like intel vpro run client-side hypervisor mount root filesystem image using iscsi", + "neighbors": [ + 134, + 219, + 265, + 267, + 275, + 294, + 305, + 327, + 400, + 401, + 413, + 571, + 630, + 650, + 688, + 716, + 720, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1167, + 1197, + 1208, + 1241, + 1252, + 1357, + 1360, + 1361, + 1386, + 1391, + 1452, + 1456, + 1468, + 1524, + 1526, + 1553, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 214, + "label": 3, + "text": "Apple_A8:apple a8 apple a8 64-bit arm-based system chip soc designed apple inc first appeared iphone 6 iphone 6 plus introduced september 9 2014 apple states 25 cpu performance 50 graphics performance drawing 50 power predecessor apple a7 currently oldest chip supported produced apple ipad mini 4 apple tv 4th generation support ipados tvos 13 respectively a8 manufactured 20 nm process tsmc replaced samsung manufacturer apple mobile device processors contains 2 billion transistors despite twice number transistors a7 a8 physical size reduced 13 89 mm a8 uses lpddr3-1333 ram 64-bit memory interface iphone 6/6 plus sixth generation ipod touch homepod a8 1 gb ram included package a8 ipad mini 4 4th generation apple tv packaged 2 gb ram a8 cpu per-core l1 cache 64 kb data 64 kb instructions l2 cache 1 mb shared cpu cores 4 mb l3 cache services entire soc predecessor 6 decode 6 issue 9 wide out-of-order design processor dual core used iphone 6 frequency 1.4 ghz supporting apple claim 25 faster a7 also supports notion second generation enhanced cyclone core called typhoon entirely new architecture would supposedly mean significant performance gain per hz a8 also integrates graphics processing unit gpu 4-shader-cluster powervr gx6450 october 16 2014 apple introduced variant a8 a8x ipad air 2 compared a8 a8x enhanced 8-shader-cluster gpu improved cpu performance due one extra core higher frequency a8 branch predictor claimed infringe 1998 patent october 14 2015 district judge found apple guilty infringing u.s. patent table based data speculation circuit parallel processing computer apple a7 a8 processors patent owned wisconsin alumni research foundation warf firm affiliated university wisconsin july 24 2017 apple ordered pay warf 506 million patent infringement apple filed appellate brief october 26 2017 u.s. court appeals federal circuit argued apple infringe patent owned wisconsin alumni research foundation september 28 2018 ruling overturned appeal award thrown u.s. federal circuit court appeals patent expired december 2016", + "neighbors": [ + 33, + 71, + 75, + 99, + 112, + 130, + 228, + 269, + 270, + 345, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 853, + 917, + 927, + 945, + 956, + 972, + 980, + 988, + 1069, + 1100, + 1147, + 1174, + 1176, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1373, + 1409, + 1488, + 1496, + 1503, + 1518, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 215, + "label": 7, + "text": "STONITH:stonith stonith shoot node head shoot offending node head sometimes called stomith shoot member/machine head technique fencing computer clusters fencing isolation failed node cause disruption computer cluster name suggests stonith fences failed nodes resetting powering failed node multi-node error-prone contention cluster catastrophic results nodes try writing shared storage resource stonith provides effective rather drastic protection problems single node systems use comparable mechanism called watchdog timer watchdog timer reset node node tell watchdog circuit operating well stonith decision based various decisions customer specific plugins", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 216, + "label": 9, + "text": "Go_(programming_language):go programming language go also known golang statically typed compiled programming language designed google robert griesemer rob pike ken thompson go syntactically similar c memory safety garbage collection structural typing csp-style concurrency two major implementations third party transpiler gopherjs compiles go javascript front-end web development go designed google 2007 improve programming productivity era multicore networked machines large codebases designers wanted address criticism languages use google keep useful characteristics designers primarily motivated shared dislike c++ go publicly announced november 2009 version 1.0 released march 2012 go widely used production google many organizations open-source projects november 2016 go go mono fonts sans-serif monospaced respectively released type designers charles bigelow kris holmes designed legible large x-height distinct letterforms conforming din 1450 standard april 2018 original logo replaced stylized go slanting right trailing streamlines however gopher mascot remained august 2018 go principal contributors published two \u2033draft designs\u2033 new language features generics error handling asked go users submit feedback lack support generic programming verbosity error handling go 1.x drawn considerable criticism go 1 guarantees compatibility language specification major parts standard library versions current go 1.12 release maintained promise major go release supported two newer major releases go influenced c emphasis greater simplicity safety language consists go syntax includes changes c aimed keeping code concise readable combined declaration/initialization operator introduced allows programmer write codice_6 codice_7 without specifying types variables used contrasts c codice_8 codice_9 semicolons still terminate statements implicit end line occurs functions may return multiple values returning codice_10 pair conventional way function indicates error caller go go adds literal syntaxes initializing struct parameters name initializing maps slices alternative c three-statement codice_11 loop go codice_12 expressions allow concise iteration arrays slices strings maps channels go number built-in types including numeric ones etc booleans character strings strings immutable built-in operators keywords rather functions provide concatenation comparison utf-8 encoding/decoding record types defined keyword type non-negative integer constant array type denoted arrays differing lengths thus different types dynamic arrays available slices denoted type length capacity specifying new memory needs allocated expand array several slices may share underlying memory pointers available types pointer-to- type denoted address-taking indirection use operators c happen implicitly method call attribute access syntax pointer arithmetic except via special type standard library pair types type type hash tables mapping type- keys type- values hash tables built language special syntax built-in functions channel allows sending values type concurrent go processes aside support interfaces go type system nominal keyword used define new named type distinct named types layout case members order conversions types e.g. various integer types pre-defined adding new type may define additional conversions conversions named types must always invoked explicitly example keyword used define type ipv4 addresses based 32-bit unsigned integers type ipv4addr uint32 type definition interprets value ip address simply assigning variable type type error constant expressions may either typed untyped given type assigned typed variable value represent passes compile-time check function types indicated keyword take zero parameters return zero values typed parameter return values determine function type thus type functions take 32-bit signed integer return signed integer default width value built-in interface type named type method set associated ip address example extended method checking whether value known standard // zerobroadcast reports whether addr 255.255.255.255. func addr ipv4addr zerobroadcast bool due nominal typing method definition adds method methods special definition call syntax distinct method type go provides two features replace class inheritance first embedding viewed automated form composition delegation second interfaces provides runtime polymorphism interfaces class types provide limited form structural typing otherwise nominal type system go object interface type also another type much like c++ objects simultaneously base derived class go interfaces designed protocols smalltalk programming language multiple sources use term duck typing describing go interfaces although term duck typing precisely defined therefore wrong usually implies type conformance statically checked since conformance go interface checked statically go compiler except performing type assertion go authors prefer term structural typing definition interface type lists required methods name type object type functions exist matching required methods interface type object type well definition type need identify type example defined import math type shape interface type square struct // note implements declaration type circle struct // implements declaration either implicitly assigned -typed variable formal language go interface system provides structural rather nominal typing interfaces embed interfaces effect creating combined interface satisfied exactly types implement embedded interface methods newly defined interface adds go standard library uses interfaces provide genericity several places including input/output system based concepts besides calling methods via interfaces go allows converting interface values types run-time type check language constructs type assertion checks single potential type type switch checks multiple types empty interface codice_13 important base case refer item concrete type similar class java c satisfied type including built-in types like code using empty interface simply call methods built-in operators referred-to object store codice_13 value try convert useful type via type assertion type switch inspect go codice_15 package codice_13 refer value limited way escape restrictions static typing like codice_17 c additional run-time type checks interface values implemented using pointer data second pointer run-time type information like types implemented using pointers go interface values codice_18 uninitialized go package system package path e.g. codice_19 codice_20 name e.g. codice_21 codice_22 references packages definitions must always prefixed package name capitalized names packages accessible codice_23 public codice_24 codice_4 command retrieve packages stored remote repository developers encouraged develop packages inside base path corresponding source repository example.com/user_name/package_name reduce likelihood name collision future additions standard library external libraries proposals exist introduce proper package management solution go similar rust cargo system node npm system go language built-in facilities well library support writing concurrent programs concurrency refers cpu parallelism also asynchrony letting slow operations like database network-read run program work common event-based servers primary concurrency construct goroutine type light-weight process function call prefixed keyword starts function new goroutine language specification specify goroutines implemented current implementations multiplex go process goroutines onto smaller set operating system threads similar scheduling performed erlang standard library package featuring classical concurrency control structures mutex locks etc available idiomatic concurrent programs instead prefer channels provide send messages goroutines optional buffers store messages fifo order allow sending goroutines proceed messages received channels typed channel type used transfer messages type special syntax used operate expression causes executing goroutine block value comes channel sends value possibly blocking another goroutine receives value built-in -like statement used implement non-blocking communication multiple channels see example go memory model describing goroutines must use channels operations safely share data existence channels sets go apart actor model-style concurrent languages like erlang messages addressed directly actors corresponding goroutines actor style simulated go maintaining one-to-one correspondence goroutines channels language allows multiple goroutines share channel single goroutine send receive multiple channels tools one build concurrent constructs like worker pools pipelines say file decompressed parsed downloads background calls timeout fan-out parallel calls set services others channels also found uses usual notion interprocess communication like serving concurrency-safe list recycled buffers implementing coroutines helped inspire name goroutine implementing iterators concurrency-related structural conventions go channels alternative channel inputs derived tony hoare communicating sequential processes model unlike previous concurrent programming languages occam limbo language go co-designer rob pike worked go provide built-in notion safe verifiable concurrency communicating-processes model favored go one goroutines program share single address space means mutable objects pointers shared goroutines see although go concurrency features aimed primarily parallel processing used program shared memory multi-processor machines various studies done effectiveness approach one studies compared size lines code speed programs written seasoned programmer familiar language corrections programs go expert google development team chapel cilk intel tbb study found non-expert tended write divide-and-conquer algorithms one statement per recursion expert wrote distribute-work-synchronize programs using one goroutine per processor expert programs usually faster also longer restrictions goroutines access shared data making race conditions possible specifically unless program explicitly synchronizes via channels means writes one goroutine might partly entirely visible another often guarantees ordering writes furthermore go internal data structures like interface values slice headers hash tables string headers immune race conditions type memory safety violated multithreaded programs modify shared instances types without synchronization instead language support safe concurrent programming thus relies conventions example chisnall recommends idiom called aliases xor mutable meaning passing mutable value pointer channel signals transfer ownership value receiver linker gc toolchain creates statically-linked binaries default therefore go binaries include go runtime go deliberately omits certain features common languages including implementation inheritance generic programming assertions pointer arithmetic implicit type conversions untagged unions tagged unions designers added facilities three agreed omitted language features designers explicitly argue assertions pointer arithmetic defending choice omit type inheritance giving useful language encouraging instead use interfaces achieve dynamic dispatch composition reuse code composition delegation fact largely automated embedding according researchers schmager et al feature many drawbacks inheritance affects public interface objects fine-grained i.e method-level control embedding methods embedded objects hidden static making obvious whether programmers overuse extent programmers languages reputed overuse inheritance designers express openness generic programming note built-in functions fact type-generic treated special cases pike calls weakness may point changed google team built least one compiler experimental go dialect generics release also open standardizing ways apply code generation initially omitted exception-like mechanism eventually added go authors advise using unrecoverable errors halt entire program server request shortcut propagate errors stack within package across package boundaries error returns standard api go authors put substantial effort influencing style go programs main go distribution includes tools building testing analyzing code also includes profiling debugging support runtime instrumentation example track garbage collection pauses race condition tester ecosystem third-party tools adds standard distribution codice_44 enables code autocompletion many text editors codice_45 go team member automatically adds/removes package imports needed codice_46 detects code might unintentionally ignore errors plugins exist adding language support several text editors several ides available including liteide simple open source cross-platform go ide goland claims capable ergonomic package main import fmt func main fmt package formatted i/o similar c c file input/output following simple program demonstrates go concurrency features implement asynchronous program launches two lightweight threads goroutines one waits user type text implements timeout statement waits either goroutines send message main routine acts first message arrive example adapted david chisnall book package main import func readword ch chan string func timeout chan bool func main notable open-source applications written go include notable companies sites using go generally together languages exclusively include interface system deliberate omission inheritance praised michele simionato likened characteristics standard ml calling shame popular language followed particular route dave astels engine yard wrote go named programming language year tiobe programming community index first year 2009 larger 12-month increase popularity 2 months introduction november language year reached 13th place january 2010 surpassing established languages like pascal june 2015 ranking dropped 50th index placing lower cobol fortran january 2017 ranking surged 13th indicating significant growth popularity adoption go awarded tiobe programming language year 2016 bruce eckel stated 2011 evaluation language implementation comparison c++ gcc java scala google engineer found evaluation got rebuttal go development team ian lance taylor improved go code hundt paper aware intention publish code says version never intended example idiomatic efficient go russ cox optimized go code well c++ code got go code run slightly faster c++ order magnitude faster code paper november 10 2009 day general release language francis mccabe developer go programming language note exclamation point requested name change google language prevent confusion language spent 10 years developing mccabe raised concerns 'big guy end steam-rollering concern resonated 120 developers commented google official issues thread saying change name even saying issue contradicts google motto n't evil october 12 2010 issue closed google developer russ cox rsc custom status unfortunate accompanied following comment many computing products services named go 11 months since release minimal confusion two languages go critics assert designers argue omissions simplifications make language better see", + "neighbors": [ + 19, + 24, + 31, + 41, + 65, + 78, + 117, + 131, + 134, + 152, + 176, + 182, + 216, + 246, + 275, + 292, + 306, + 347, + 373, + 422, + 480, + 502, + 509, + 538, + 547, + 553, + 559, + 567, + 579, + 594, + 597, + 611, + 671, + 682, + 704, + 742, + 769, + 775, + 777, + 782, + 790, + 799, + 820, + 825, + 826, + 837, + 873, + 876, + 919, + 936, + 948, + 962, + 998, + 1004, + 1005, + 1028, + 1061, + 1082, + 1120, + 1129, + 1138, + 1146, + 1152, + 1161, + 1185, + 1221, + 1225, + 1227, + 1235, + 1259, + 1265, + 1310, + 1311, + 1318, + 1324, + 1371, + 1388, + 1411, + 1419, + 1457, + 1477, + 1480, + 1500, + 1507, + 1532, + 1570, + 1582, + 1596, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 217, + "label": 4, + "text": "Endian_Firewall:endian firewall endian firewall open-source router firewall gateway security linux distribution developed south tyrolean company endian product available either free software commercial software guaranteed support services hardware appliance including support services endian firewall turnkey linux security distribution independent unified security management operating system endian firewall based hardened linux operating system system installed pc using boot cd operated without monitor online interface via keyboard command-line interface server configured via web interface serial interface main task endian firewall gateway router firewall act proxy web email ftp sip dns four different networks dependent number network cards installed host pc normally managed networks configured web interface endian differentiated color coding endian firewall includes support load balancing means add another connection internet red network endian firewall distributes network load interfaces behind endian firewall italian endian spa appiano south tyrol community volunteer developers helpers license model endian provides commercial version free version current version includes following key features endian firewall fork linux firewall ipcop turn fork smoothwall due numerous developments one-fifth original ipcop code used newer versions based initially linux scratch version 2.2 rhel centos upcoming version 3.0 endian firewall virtually smoothwall- ipcop-free greatest difference ipcop endian firewall merely pure router-firewall combination comprehensive gateway security solution unified threat management virus scanner spam blocker firmly integrated distribution allows transport http ftp pop 3 smtp scanned real-time optionally filtered also menus refined ipcop approach reducing complexity also reducing reconfigurability individual services concerning business model endian different origins smoothwall ipcop follows", + "neighbors": [ + 94, + 134, + 189, + 276, + 333, + 444, + 476, + 542, + 569, + 648, + 656, + 678, + 684, + 685, + 754, + 910, + 1138, + 1250, + 1257, + 1395, + 1403, + 1406, + 1453, + 1462, + 1514, + 1568 + ], + "mask": "Validation" + }, + { + "node_id": 218, + "label": 3, + "text": "Hi_no_Tori_Hououhen_(MSX):hi tori hououhen msx essence knightmare-like vertical scrolling shooter player viewing character back enemies obstacles entering top screen addition game six stages laid labyrinthine way adding puzzle elements mix order find reach defeat game final boss player would travel back forth various stages obtain large assortment keys keys allow access parts stages even earlier ones traveling stages highly unusual shoot 'em", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 219, + "label": 2, + "text": "KGraft:kgraft kgraft feature linux kernel implements live patching running kernel allows kernel patches applied kernel still running avoiding need rebooting system new kernel contains desired patches kgraft aims maximize system uptime availability time kgraft allows kernel-related security updates applied without deferring scheduled downtimes internally kgraft allows entire functions running kernel replaced patched versions safely selectively using original versions functions ensure per-process consistency live patching performed kgraft developed suse source code licensed terms versions two three gnu general public license gpl april 2014 kgraft submitted inclusion linux kernel mainline minimalistic foundations live patching merged linux kernel mainline kernel version 4.0 released april 12 2015 internally kgraft consists two parts core kernel module executes live patching mechanism altering kernel inner workings userspace utilities prepare individual hot patch kernel modules source diffs live kernel patching performed function level meaning kgraft replace entire functions running kernel patched versions relying mechanisms infrastructure established ftrace route around old versions functions changes kernel internal data structures possible however security patches one natural candidates used kgraft rarely contain changes kernel data structures applying hot patches kgraft require running kernel stopped patched versions functions introduced instead replacing functions atomically kgraft provides consistent world views universes userspace processes kernel threads interrupt handlers monitored execution original versions patched kernel functions continue used accomplish kgraft maintains original versions patched functions read-copy-update rcu fashion dynamically selects original patched versions depending process kernel thread interrupt handler executes specifically original versions functions continue usedat time hot patch appliedfor processes currently executing within kernel space kernel threads reach completion points currently executing interrupt handlers due design kgraft introduce additional latency applying hot patches downside original versions patched kernel functions may required maintained extended periods time case processes remain long within kernel space example process may wait i/o network socket also original patched versions functions allowed executed parallel troubles may arise use kernel internal data structures different ways suse announced kgraft january 2014 released publicly march 2014 terms gnu general public license version 2 gplv2 kernel part terms version 3 gplv3 userspace part released shortly red hat released live kernel patching implementation called kpatch kgraft aims become merged linux kernel mainline submitted inclusion april 2014. kgraft made available suse linux enterprise server 12 november 18 2014 additional feature called suse linux enterprise live patching minimalistic foundations live kernel patching merged linux kernel mainline kernel version 4.0 released april 12 2015 foundations based primarily kernel ftrace functionality form common core capable supporting hot patching kgraft kpatch providing application programming interface api kernel modules contain hot patches application binary interface abi userspace management utilities however common core included linux kernel 4.0 supports x86 architecture provide mechanisms ensuring function-level consistency hot patches applied since april 2015 ongoing work porting kgraft common live patching core provided linux kernel mainline however implementation required function-level consistency mechanisms delayed call stacks provided linux kernel may unreliable situations involve assembly code without proper stack frames result porting work remains progress attempt improve reliability kernel call stacks specialized sanity-check userspace utility also developed", + "neighbors": [ + 85, + 134, + 213, + 265, + 267, + 294, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 754, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 220, + "label": 1, + "text": "Nested_SQL:nested sql relational databases nested table table embedded within another table individual elements inserted updated deleted nested table since individual elements modified nested table flexible array elements array modified whole individually nested table n't maximum size arbitrary number elements stored", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 221, + "label": 7, + "text": "Storage_Resource_Broker:storage resource broker storage resource broker srb data grid management computer software used computational science research projects srb logical distributed file system based client-server architecture presents users single global logical namespace file hierarchy srb provides uniform interface heterogeneous computer data storage resources network part implements logical namespace distinct physical file names maintains metadata data-objects files users groups resources collections items srb metadata catalog mcat stored relational database management system system user-defined metadata queried locate files based attributes well name srb runs various versions unix linux microsoft windows srb system middleware sense built top major software packages various storage systems real-time data sources relational database management system etc callable library functions utilized higher level software however complete many middleware software systems implements comprehensive distributed data management environment including various end-user client applications features support management collaborative controlled sharing publication replication transfer preservation distributed data collections srb sometimes used conjunction computational grid computing systems globus alliance utilize globus alliance grid security infrastructure gsi authentication system srb store retrieve data archival storage systems high performance storage system sam-fs disk file systems unix linux windows binary large objects tabular data relational database management systems tape libraries srb used since 1997 2008 srb estimated managing two petabytes data licensed srb source distributions freely available academic non-profit organizations nirvana srb commercial version srb featured capabilities specifically adapted government commercial use srb development began 1995 cooperative efforts general atomics data intensive cyber environments group dice san diego supercomputer center sdsc university california san diego ucsd support national science foundation nsf srb builds work reagan moore moore doctorate plasma physics ucsd former computational plasma physicist general atomics joined san diego supercomputer center inception project distributed object computation testbed funded darpa us patent trademark office 1998 1999 2003 general atomics granted exclusive license ucsd develop srb commercial applications new versions announced 2008 2012 integrated rule-oriented data management system irods follow-on project sdsc srb team became data intensive cyber environments group largely replaced use srb irods based srb concepts completely re-written includes highly-configurable rule engine core fully open source conferences 2011 included demonstrations irods", + "neighbors": [ + 134, + 272, + 762, + 847, + 961, + 1159 + ], + "mask": "Test" + }, + { + "node_id": 222, + "label": 6, + "text": "Parallel_Virtual_File_System:parallel virtual file system parallel virtual file system pvfs open-source parallel file system parallel file system type distributed file system distributes file data across multiple servers provides concurrent access multiple tasks parallel application pvfs designed use large scale cluster computing pvfs focuses high performance access large data sets consists server process client library written entirely user-level code linux kernel module pvfs-client process allow file system mounted used standard utilities client library provides high performance access via message passing interface mpi pvfs jointly developed parallel architecture research laboratory clemson university mathematics computer science division argonne national laboratory ohio supercomputer center pvfs development funded nasa goddard space flight center doe office science advanced scientific computing research program nsf paci hecura programs government private agencies pvfs known orangefs newest development branch pvfs first developed 1993 walt ligon eric blumer parallel file system parallel virtual machine pvm part nasa grant study i/o patterns parallel programs pvfs version 0 based vesta parallel file system developed ibm t. j. watson research center starting 1994 rob ross re-wrote pvfs use tcp/ip departed many original vesta design points pvfs version 1 targeted cluster dec alpha workstations networked using switched fddi like vesta pvfs striped data across multiple servers allowed i/o requests based file view described strided access pattern unlike vesta striping view dependent common record size ross research focused scheduling disk i/o multiple clients accessing file previous results shown scheduling according best possible disk access pattern preferable ross showed depended number factors including relative speed network details file view cases scheduling based network traffic preferable thus dynamically adaptable schedule provided best overall performance late 1994 ligon met thomas sterling john dorband goddard space flight center gsfc discussed plans build first beowulf computer agreed pvfs would ported linux featured new machine next several years ligon ross worked gsfc group including donald becker dan ridge eric hendricks 1997 cluster meeting pasadena ca sterling asked pvfs released open source package 1999 ligon proposed development new version pvfs initially dubbed pvfs2000 later pvfs2 design initially developed ligon ross phil carns ross completed phd 2000 moved argonne national laboratory design implementation carried ligon carns dale witchurch harish ramachandran clemson university ross neil miller rob latham argonne national laboratory pete wyckoff ohio supercomputer center new file system released 2003 new design featured object servers distributed metadata views based mpi support multiple network types software architecture easy experimentation extensibility pvfs version 1 retired 2005 pvfs version 2 still supported clemson argonne carns completed phd 2006 joined axicom inc. pvfs deployed several thousand nodes data mining 2008 carns moved argonne continues work pvfs along ross latham sam lang brad settlemyer developed mirroring subsystem clemson later detailed simulation pvfs used researching new developments settlemyer oak ridge national laboratory 2007 argonne began porting pvfs use ibm blue gene/p 2008 clemson began developing extensions supporting large directories small files security enhancements redundancy capabilities many goals conflicted development blue gene second branch cvs source tree created dubbed orange original branch dubbed blue pvfs orangefs track closely represent two different groups user requirements patches upgrades applied branches 2011 orangefs main development line cluster using pvfs nodes designated one client data server metadata server data servers hold file data metadata servers hold metadata include stat-info attributes datafile-handles well directory-entries clients run applications utilize file system sending requests servers network pvfs object based design say pvfs server requests involved objects called dataspaces dataspace used hold file data file metadata directory metadata directory entries symbolic links every dataspace file system unique handle client server look server holds dataspace based handle dataspace two components bytestream set key/value pairs bytestream ordered sequence bytes typically used hold file data key/value pairs typically used hold metadata object-based design become typical many distributed file systems including lustre panasas pnfs pvfs designed client access server metadata access data servers without interaction metadata servers removes critical bottleneck system allows much greater performance client program requests data pvfs supply description data based mpi_datatypes facility allows mpi file views directly implemented file system mpi_datatypes describe complex non-contiguous patterns data pvfs server data codes implement data flows efficiently transfer data multiple servers clients pvfs uses networking layer named bmi provides non-blocking message interface designed specifically file systems bmi multiple implementation modules number different networks used high performance computing including tcp/ip myrinet infiniband portals pvfs servers designed share state clients server crashes another easily restarted place updates performed without using locks pvfs clients servers run user level kernel modifications needed optional kernel module allows pvfs file system mounted like file system programs link directly user interface mpi-io posix-like interface features makes pvfs easy install less prone causing system crashes pvfs interface designed integrate system level similarities linux vfs making easy implement mountable file system equally adaptable user level interfaces mpi-io posix-like interfaces exposes many features underlying file system interfaces take advantage desired pvfs consists 4 main components number utility programs components pvfs2-server pvfslib pvfs-client-core pvfs kernel module utilities include karma management tool utilities pvfs-ping pvfs-ls pvfs-cp etc operate directly file system without using kernel module primarily maintenance testing another key design point pvfs protocol describes messages passed client server though strictly component pvfs server runs process node designated i/o node i/o nodes often dedicated nodes regular nodes run application tasks well pvfs server usually runs root run user preferred server manage multiple distinct file systems designated run metadata server data server configuration controlled configuration file specified command line servers managing given file system use configuration file server receives requests network carries request may involve disk i/o responds back original requester requests normally come client nodes running application tasks come servers server composed request processor job layer trove bmi flow layers request processor consists server process main loop number state machines state machines based simple language developed pvfs manage concurrency within server client state machine consists number states either runs c state action function calls nested subroutine state machine either case return codes select state go next state action functions typically submit job via job layer performs kind i/o via trove bmi jobs non-blocking job issued state machine execution deferred another state machine run servicing another request jobs completed main loop restarts associated state machine request processor state machines various request types defined pvfs request protocol plus number nested state machines used internally state machine architecture makes relatively easy add new requests server order add features optimize specific situations job layer provides common interface submitting trove bmi flow jobs reporting completion also implements request scheduler non-blocking job records kind requests progress objects prevents consistency errors due simultaneously operating file data trove manages i/o objects stored local server trove operates collections data spaces collection independent handle space used implement distinct pvfs file systems data space pvfs object unique within collection handle stored one server handles mapped servers table configuration file data space consists two parts bytestream set key/value pairs bytestream sequence bytes indeterminate length used store file data typically file local file system key/value pairs used store metadata attributes directory entries trove well defined interface implemented various ways date implementation trove-dbfs implementation stores bytestreams files key/value pairs berkeley db database trove operations non-blocking api provides post functions read write various components functions check wait completion", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 233, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 362, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 223, + "label": 5, + "text": "Two-way_alternating:two-way alternating two-way alternating communications term sometimes used disambiguate term duplex telecommunications two-way alternating communications channel endpoint either send receive given time send receive time two-way simultaneous communications lets endpoints talk listen simultaneously two-way alternating communications sometimes called half-duplex may fine distinction two-way alternating communications property communication protocol used endpoints underlying communications medium may support either two-way alternating two-way simultaneous communications medium shared transmitting receiving support two-way alternating protocols medium may called physically half-duplex", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 224, + "label": 3, + "text": "Address_generation_unit:address generation unit address generation unit agu sometimes also called address computation unit acu execution unit inside central processing units cpus calculates addresses used cpu access main memory address calculations handled separate circuitry operates parallel rest cpu number cpu cycles required executing various machine instructions reduced bringing performance improvements performing various operations cpus need calculate memory addresses required fetching data memory example in-memory positions array elements must calculated cpu fetch data actual memory locations address-generation calculations involve different integer arithmetic operations addition subtraction modulo operations bit shifts often calculating memory address involves one general-purpose machine instruction necessarily decode execute quickly incorporating agu cpu design together introducing specialized instructions use agu various address-generation calculations offloaded rest cpu often executed quickly single cpu cycle capabilities agu depend particular cpu architecture thus agus implement expose address-calculation operations also include advanced specialized instructions operate multiple operands time furthermore cpu architectures include multiple agus one address-calculation operation executed simultaneously bringing performance improvements capitalizing superscalar nature advanced cpu designs example intel incorporates multiple agus sandy bridge haswell microarchitectures increase bandwidth cpu memory subsystem allowing multiple memory-access instructions executed parallel", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 359, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 225, + "label": 4, + "text": "Buffer_overflow:buffer overflow information security programming buffer overflow buffer overrun anomaly program writing data buffer overruns buffer boundary overwrites adjacent memory locations buffers areas memory set aside hold data often moving one section program another programs buffer overflows often triggered malformed inputs one assumes inputs smaller certain size buffer created size anomalous transaction produces data could cause write past end buffer overwrites adjacent data executable code may result erratic program behavior including memory access errors incorrect results crashes exploiting behavior buffer overflow well-known security exploit many systems memory layout program system whole well defined sending data designed cause buffer overflow possible write areas known hold executable code replace malicious code selectively overwrite data pertaining program state therefore causing behavior intended original programmer buffers widespread operating system os code possible make attacks perform privilege escalation gain unlimited access computer resources famed morris worm 1988 used one attack techniques programming languages commonly associated buffer overflows include c c++ provide built-in protection accessing overwriting data part memory automatically check data written array built-in buffer type within boundaries array bounds checking prevent buffer overflows requires additional code processing time modern operating systems use variety techniques combat malicious buffer overflows notably randomizing layout memory deliberately leaving space buffers looking actions write areas canaries buffer overflow occurs data written buffer also corrupts data values memory addresses adjacent destination buffer due insufficient bounds checking occur copying data one buffer another without first checking data fits within destination buffer following example expressed c program two variables adjacent memory 8-byte-long string buffer two-byte big-endian integer b initially contains nothing zero bytes b contains number 1979 program attempts store null-terminated string ascii encoding buffer b value inadvertently replaced number formed part character string example e followed zero byte would become 25856 writing data past end allocated memory sometimes detected operating system generate segmentation fault error terminates process prevent buffer overflow happening example call strcpy could replaced strlcpy takes maximum capacity including null-termination character additional parameter ensures amount data written available strlcpy library function preferred strncpy null-terminate destination buffer source string length greater equal size buffer third argument passed function therefore may null-terminated treated valid c-style string techniques exploit buffer overflow vulnerability vary architecture operating system memory region example exploitation heap used dynamically allocated memory differs markedly exploitation call stack technically inclined user may exploit stack-based buffer overflows manipulate program advantage one several ways address user-supplied data used affect stack buffer overflow unpredictable exploiting stack buffer overflow cause remote code execution becomes much difficult one technique used exploit buffer overflow called trampolining technique attacker find pointer vulnerable stack buffer compute location shellcode relative pointer use overwrite jump instruction already memory make second jump time relative pointer second jump branch execution shellcode suitable instructions often present large code metasploit project example maintains database suitable opcodes though lists found windows operating system buffer overflow occurring heap data area referred heap overflow exploitable manner different stack-based overflows memory heap dynamically allocated application run-time typically contains program data exploitation performed corrupting data specific ways cause application overwrite internal structures linked list pointers canonical heap overflow technique overwrites dynamic memory allocation linkage malloc meta data uses resulting pointer exchange overwrite program function pointer microsoft gdi+ vulnerability handling jpegs example danger heap overflow present manipulation buffer occurs read executed may lead failure exploitation attempt manipulations mitigate threat exploitation may make impossible manipulations could include conversion upper lower case removal metacharacters filtering non-alphanumeric strings however techniques exist bypass filters manipulations alphanumeric code polymorphic code self-modifying code return-to-libc attacks methods used avoid detection intrusion detection systems cases including code converted unicode threat vulnerability misrepresented disclosers denial service fact remote execution arbitrary code possible real-world exploits variety challenges need overcome exploits operate reliably factors include null bytes addresses variability location shellcode differences environments various counter-measures operation nop-sled oldest widely known technique successfully exploiting stack buffer overflow solves problem finding exact address buffer effectively increasing size target area much larger sections stack corrupted no-op machine instruction end attacker-supplied data no-op instructions attacker places instruction perform relative jump top buffer shellcode located collection no-ops referred nop-sled return address overwritten address within no-op region buffer execution slide no-ops redirected actual malicious code jump end technique requires attacker guess stack nop-sled instead comparatively small shellcode popularity technique many vendors intrusion prevention systems search pattern no-op machine instructions attempt detect shellcode use important note nop-sled necessarily contain traditional no-op machine instructions instruction corrupt machine state point shellcode run used place hardware assisted no-op result become common practice exploit writers compose no-op sled randomly chosen instructions real effect shellcode execution method greatly improves chances attack successful without problems exploits using technique still must rely amount luck guess offsets stack within nop-sled region incorrect guess usually result target program crashing could alert system administrator attacker activities another problem nop-sled requires much larger amount memory hold nop-sled large enough use problem allocated size affected buffer small current depth stack shallow i.e much space end current stack frame start stack despite problems nop-sled often method work given platform environment situation still important technique jump register technique allows reliable exploitation stack buffer overflows without need extra room nop-sled without guess stack offsets strategy overwrite return pointer something cause program jump known pointer stored within register points controlled buffer thus shellcode example register contains pointer start buffer jump call taking register operand used gain control flow execution practice program may intentionally contain instructions jump particular register traditional solution find unintentional instance suitable opcode fixed location somewhere within program memory figure left see example unintentional instance i386 codice_1 instruction opcode instruction codice_2 two-byte sequence found one-byte offset start instruction codice_3 address codice_4 attacker overwrites program return address address program first jump codice_4 interpret opcode codice_2 codice_1 instruction jump top stack execute attacker code technique possible severity vulnerability increases considerably exploitation work reliably enough automate attack virtual guarantee success run reason technique commonly used internet worms exploit stack buffer overflow vulnerabilities method also allows shellcode placed overwritten return address windows platform since executables mostly based address codice_8 x86 little endian architecture last byte return address must null terminates buffer copy nothing written beyond limits size shellcode size buffer may overly restrictive dlls located high memory codice_9 addresses containing null bytes method remove null bytes disallowed characters overwritten return address used way method often referred dll trampolining various techniques used detect prevent buffer overflows various tradeoffs reliable way avoid prevent buffer overflows use automatic protection language level sort protection however applied legacy code often technical business cultural constraints call vulnerable language following sections describe choices implementations available assembly c/c++ popular programming languages vulnerable buffer overflow part allow direct access memory strongly typed c provides built-in protection accessing overwriting data part memory specifically check data written buffer within boundaries buffer standard c++ libraries provide many ways safely buffering data c++ standard template library stl provides containers optionally perform bounds checking programmer explicitly calls checks accessing data example codice_10 member function codice_11 performs bounds check throws codice_12 exception bounds check fails however c++ behaves like c bounds check explicitly called techniques avoid buffer overflows also exist c. languages strongly typed n't allow direct memory access cobol java python others prevent buffer overflow occurring cases many programming languages c/c++ provide runtime checking cases even compile-time checking might send warning raise exception c c++ would overwrite data continue execute instructions erroneous results obtained might might cause program crash examples languages include ada eiffel lisp modula-2 smalltalk ocaml c-derivatives cyclone rust d. java .net framework bytecode environments also require bounds checking arrays nearly every interpreted language protect buffer overflows signaling well-defined error condition often language provides enough type information bounds checking option provided enable disable static code analysis remove many dynamic bound type checks poor implementations awkward cases significantly decrease performance software engineers must carefully consider tradeoffs safety versus performance costs deciding language compiler setting use problem buffer overflows common c c++ languages expose low level representational details buffers containers data types buffer overflows must thus avoided maintaining high degree correctness code performs buffer management also long recommended avoid standard library functions bounds checked codice_13 codice_14 codice_15 morris worm exploited codice_13 call fingerd well-written tested abstract data type libraries centralize automatically perform buffer management including bounds checking reduce occurrence impact buffer overflows two main building-block data types languages buffer overflows commonly occur strings arrays thus libraries preventing buffer overflows data types provide vast majority necessary coverage still failure use safe libraries correctly result buffer overflows vulnerabilities naturally bug library potential vulnerability safe library implementations include better string library vstr erwin openbsd operating system c library provides strlcpy strlcat functions limited full safe library implementations september 2007 technical report 24731 prepared c standards committee published specifies set functions based standard c library string i/o functions additional buffer-size parameters however efficacy functions purpose reducing buffer overflows disputable requires programmer intervention per function call basis equivalent intervention could make analogous older standard library functions buffer overflow safe buffer overflow protection used detect common buffer overflows checking stack altered function returns altered program exits segmentation fault three systems libsafe stackguard propolice gcc patches microsoft implementation data execution prevention dep mode explicitly protects pointer structured exception handler seh overwritten stronger stack protection possible splitting stack two one data one function returns split present forth language though security-based design decision regardless complete solution buffer overflows sensitive data return address may still overwritten buffer overflows work manipulating pointers including stored addresses pointguard proposed compiler-extension prevent attackers able reliably manipulate pointers addresses approach works compiler add code automatically xor-encode pointers used attacker theoretically know value used encode/decode pointer predict point overwrites new value pointguard never released microsoft implemented similar approach beginning windows xp sp2 windows server 2003 sp1 rather implement pointer protection automatic feature microsoft added api routine called discretion programmer allows better performance used time places burden programmer know necessary xor linear attacker may able manipulate encoded pointer overwriting lower bytes address allow attack succeed attacker able attempt exploit multiple times able complete attack causing pointer point one several locations location within nop sled microsoft added random rotation encoding scheme address weakness partial overwrites executable space protection approach buffer overflow protection prevents execution code stack heap attacker may use buffer overflows insert arbitrary code memory program executable space protection attempt execute code cause exception cpus support feature called nx execute xd execute disabled bit conjunction software used mark pages data containing stack heap readable writable executable unix operating systems e.g openbsd macos ship executable space protection e.g w^x optional packages include newer variants microsoft windows also support executable space protection called data execution prevention proprietary add-ons include executable space protection generally protect return-to-libc attacks attack rely execution attackers code however 64-bit systems using aslr described executable space protection makes far difficult execute attacks address space layout randomization aslr computer security feature involves arranging positions key data areas usually including base executable position libraries heap stack randomly process address space randomization virtual memory addresses functions variables found make exploitation buffer overflow difficult impossible also forces attacker tailor exploitation attempt individual system foils attempts internet worms similar less effective method rebase processes libraries virtual address space use deep packet inspection dpi detect network perimeter basic remote attempts exploit buffer overflows use attack signatures heuristics able block packets signature known attack long series no-operation instructions known nop-sled detected used location exploit payload slightly variable packet scanning effective method since prevent known attacks many ways nop-sled encoded shellcode used attackers made alphanumeric metamorphic self-modifying evade detection heuristic packet scanners intrusion detection systems checking buffer overflows patching bugs cause naturally helps prevent buffer overflows one common automated technique discovering fuzzing edge case testing also uncover buffer overflows static analysis potential buffer overflow detected must patched makes testing approach useful software development less useful legacy software longer maintained supported buffer overflows understood partially publicly documented early 1972 computer security technology planning study laid technique code performing function check source destination addresses properly permitting portions monitor overlaid user used inject code monitor permit user seize control machine today monitor would referred kernel earliest documented hostile exploitation buffer overflow 1988 one several exploits used morris worm propagate internet program exploited service unix called finger later 1995 thomas lopatic independently rediscovered buffer overflow published findings bugtraq security mailing list year later 1996 elias levy also known aleph one published phrack magazine paper smashing stack fun profit step-by-step introduction exploiting stack-based buffer overflow vulnerabilities since least two major internet worms exploited buffer overflows compromise large number systems 2001 code red worm exploited buffer overflow microsoft internet information services iis 5.0 2003 sql slammer worm compromised machines running microsoft sql server 2000 2003 buffer overflows present licensed xbox games exploited allow unlicensed software including homebrew games run console without need hardware modifications known modchips ps2 independence exploit also used buffer overflow achieve playstation 2 twilight hack accomplished wii using buffer overflow", + "neighbors": [ + 46, + 53, + 65, + 149, + 185, + 265, + 306, + 338, + 347, + 363, + 379, + 387, + 439, + 509, + 512, + 521, + 564, + 638, + 655, + 689, + 708, + 739, + 741, + 750, + 800, + 836, + 884, + 919, + 961, + 993, + 996, + 1003, + 1011, + 1063, + 1088, + 1112, + 1120, + 1138, + 1151, + 1308, + 1335, + 1361, + 1398, + 1472, + 1517, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 226, + "label": 4, + "text": "Global_waste_trade:global waste trade global waste trade international trade waste countries treatment disposal recycling toxic hazardous wastes often exported developed countries developing countries also known countries global south therefore burden toxicity wastes western countries falls predominantly onto developing countries africa asia latin america world bank report waste global review solid waste management describes amount solid waste produced given country specifically countries produce solid waste economically developed industrialized report explains g enerally higher economic development rate urbanization greater amount solid waste produced. \u201d therefore countries global north economically developed urbanized produce solid waste global south countries current international trade flows waste follow pattern waste produced global north exported disposed global south multiple factors affect countries produce waste magnitude including geographic location degree industrialization level integration global economy numerous scholars researchers linked sharp increase waste trading negative impacts waste trading prevalence neoliberal economic policy major economic transition towards neoliberal economic policy 1980s shift towards \u201c free-market \u201d policy facilitated sharp increase global waste trade henry giroux chair cultural studies mcmaster university gives definition neoliberal economic policy \u201c neoliberalism ... removes economics markets discourse social obligations social costs ... policy political project neoliberalism wedded privatization public services selling state functions deregulation finance labor elimination welfare state unions liberalization trade goods capital investment marketization commodification society. \u201d given economic platform privatization neoliberalism based expanding free-trade agreements establishing open-borders international trade markets trade liberalization neoliberal economic policy trade completely deregulated leaving tariffs quotas restrictions international trade designed developing countries \u2019 economies integrate global economy critics claim although free-market trade liberalization designed allow country opportunity reach economic success consequences policies devastating global south countries essentially crippling economies servitude global north even supporters international monetary fund \u201c progress integration uneven recent decades \u201d specifically developing countries targeted trade liberalization policies import waste means economic expansion guiding neoliberal economic policy argues way integrated global economy participate trade liberalization exchange international trade markets claim smaller countries less infrastructure less wealth less manufacturing ability take hazardous wastes way increase profits stimulate economies current supporters global waste trade argue importing waste economic transaction benefit countries little offer global economy countries production capacity manufacture high quality products import waste stimulate economy lawrence summers former president harvard university chief economist world bank issued confidential memo arguing global waste trade 1991 memo stated think economic logic behind dumping load toxic waste lowest wage country impeccable face that\u2026 \u2019 always thought countries africa vastly polluted air quality probably vastly inefficiently low compared los angeles\u2026 n't world bank encouraging migration dirty industries least developed countries position mainly motivated economics financial profit particular demonstrates main argument global waste trade cato institute published article supporting global waste trade suggesting \u201c little evidence hazardous wastes often chronic carcinogens contribute death rates developing countries. \u201d elaborating point article argues \u201c people developing countries would rationally accept increased exposure hazardous pollutants exchange opportunities increase productivity\u2014and hence income. \u201d overall argument global waste trade rests largely upon perception developing countries need economic development supporters suggest engaging global waste trade developing countries global south expand economies increase profits critics global waste trade claim lack regulation failed policies allowed developing nations become toxic dump yards hazardous waste ever-increasing amounts hazardous waste shipped developing countries increases disproportionate risk people nations face critics effects global waste trade emphasize enormous amount hazardous wastes people poorer countries must deal highlight fact world \u2019 hazardous wastes produced western countries united states europe yet people suffer negative health effects wastes poorer countries produce waste peter newell professor development studies argues \u201c environmental inequality reinforces time reflects forms hierarchy exploitation along lines class race gender. \u201d arguing detrimental effects hazardous waste trade affect disadvantaged others critics global waste trade suggest implications dumping hazardous waste significant consequences people color women low-income people particular critiquing global waste trade reproducing inequality global scale many activists organizers environmentalists regions affected global south vocalized disappointment global waste trade policies evo morales first indigenous amerindian president bolivia argues current economic system forcing exploitation country people claims want save planet earth save life humanity duty put end capitalist system unless put end capitalist system impossible imagine equality justice planet earth believe important put end exploitation human beings pillage natural resources put end destructive wars markets raw materials plundering energy particularly fossil fuels excessive consumption goods accumulation waste capitalist system allows us heap waste jean francois kouadio african native living near toxic dump site ivory coast explains experience effects toxic substances lingering throughout community major western corporations dumping toxic wastes ivory coast kuoadio lost two children effects toxic wastes describes loss second daughter ama grace doctors said suffered acute glycemia caused toxic waste addition critics global south researchers scholars west begun critiquing uneven distribution negative effects hazardous waste dumpings causing dorceta taylor professor university michigan argues women color united states disproportionately affected policies women color forefront struggle bring attention issues devastating minority communities \u2013 issues hazardous waste disposal exposure toxins ... communities degraded environments ... repositories waste products capitalist production excessive consumption result vanguard struggle environmental justice founders environmental groups grassroots activists researchers conference organizers workshop leaders lobbyists campaign community organizers t.v reed professor english american studies washington state university argues correlation historical colonialism toxic colonialism based perceptions indigenous land \u2018 waste. \u2019 argues western cultures deemed indigenous land \u201c underdeveloped \u201d \u201c empty \u201d people inhabiting therefore less \u201c civilized. \u201d using historical premises colonialism toxic colonialism reproduces arguments defining global south land expendable western wastes toxic colonialism defined process \u201c underdeveloped states used inexpensive alternatives export disposal hazardous waste pollution developed states \u201d core critique global waste trade toxic colonialism represents neocolonial policy continues maintain global inequality today unfair trade systems toxic colonialism uses term colonialism \u201c characteristics colonialism involving economic dependence exploitation labour cultural inequality intimately associated within new realm toxic waste colonialism. \u201d electronic waste also known e-waste refers discarded electrical electronic devices rapidly growing surplus electronic waste around world resulted quickly evolving technological advances changes media tapes software mp3 falling prices planned obsolescence estimated 50 million tons e-waste produced year majority comes united states europe electronic waste shipped developing countries asia africa processed recycled various studies investigated environmental health effects e-waste upon people live work around electronic waste dumps heavy metals toxins chemicals leak discarded products surrounding waterways groundwater poisoning local people people work dumps local children searching items sell people living surrounding communities exposed deadly toxins one city suffering negative results hazardous waste trade guiyu china called electronic waste dump world may world largest e-waste dump workers dismantling 1.5 million pounds junked computers cell phones electronic devices per year incinerator ash ash produced incinerators burn waste order dispose incineration many polluting effects include release various hazardous gases heavy metals sulfur dioxide example incinerator ash dumped onto global south global north unjust trade exchange khian sea waste disposal incident carrying 14,000 tons ash incinerator philadelphia cargo ship khian sea dispose waste however upon rejected dominican republic panama honduras bermuda guinea bissau dutch antilles crew finally dumped portion ash near haiti changing name ship twice try conceal original identity senegal morocco yemen sri lanka singapore still banned ship \u2019 entry upon consistent rejections ash believed disposed atlantic indian oceans following disaster handling hazardous waste haitian government banned waste imports leading movement recognize disastrous consequences global waste trade based khian sea waste disposal incident similar events basel convention written resist known developing countries \u2018 toxic colonialism. \u2019 open signature march 1989 went effect may 1992 u.s. signed treaty yet ratify chemical waste excess unusable waste hazardous chemicals mainly produced large factories extremely difficult costly dispose poses many problems health risks upon exposure must carefully treated toxic waste processing facilities one example chemical waste exported global north onto global south event italian business man seeking avoid european economic regulations allegedly exporting 4,000 tons toxic waste containing 150 tons polychlorinated biphenyls pcbs italian businessman made 4.3 million shipping hazardous waste nigeria fordham environmental law review published article explaining impacts toxic waste imposed nigeria detail mislabelling garbage fertilizers italian company deceived retired/illiterate timber worker agreeing store poison backyard nigerian river port koko little 100 dollars month toxic chemicals exposed hot sun children playing nearby leaked koko water system resulting death nineteen villagers ate contaminated rice nearby farm one example traditional trade flow developed western countries severely unfairly disproportionately impacted developing countries global south another danger developing countries growing issue shipbreaking occurring mainly asia industrialized countries seeking retire used vessels find cheaper send ships asia dismantling china bangladesh seen two hubs shipbreaking asia one main issues lies fact ships aged continue constructed time less environmental regulation environmental fact sheet researchers demonstrate immense impact new toxic trade sector workers environment one older ships contain health-damaging substances asbestos lead oxide zinc chromates mercury arsenic tributyltin addition shipbreaking workers china developing countries traditionally lack proper equipment protective gear handling toxic substances global waste trade negative effects many people particularly poorer developing nations countries often safe recycling processes facilities people process toxic waste bare hands hazardous wastes often properly disposed treated leading poisoning surrounding environment resulting illness death people animals many people experienced illnesses death due unsafe way hazardous wastes handled hazardous waste trade disastrous effects upon environment natural ecosystems various studies explore concentrations persistent organic pollutants poisoned areas surrounding dump sites killing numerous birds fish wildlife heavy metal chemical concentrations air water soil sediment around toxic dump areas concentration levels heavy metals areas extremely high toxic hazardous waste trade serious damaging effects upon health humans people living developing countries may vulnerable dangerous effects hazardous waste trade particularly risk developing health problems methods disposal toxic wastes developing countries expose general population including future generations highly toxic chemicals toxic wastes often disposed open landfills burned incinerators dangerous processes workers wear little protective gear processing toxic chemicals exposed toxins direct contact inhalation contact soil dust well oral intake contaminated locally produced food drinking water health problems resulting hazardous wastes affect humans causing cancers diabetes alterations neurochemical balances hormone disruptions endocrine disruptors skin alterations neurotoxicity kidney damage liver damage bone disease emphysema ovotoxicity reproductive damage many fatal diseases improper disposal hazardous wastes creates fatal health problems serious public health risk various international responses problems associated global waste trade multiple attempts regulate thirty years hazardous waste trade proven difficult regulate much waste traded laws often difficult enforce furthermore often large loopholes international agreements allow countries corporations dump hazardous wastes dangerous ways notable attempt regulate hazardous waste trade basel convention basel convention control transboundary movements hazardous wastes disposal usually known basel convention international treaty plays crucial role regulating transnational movement hazardous wastes basel convention created 1989 attempts regulate hazardous waste trade specifically prevent dumping hazardous waste developed countries less developed countries basel convention developed following series high-profile cases large amounts toxic waste dumped less developed countries poisoning people environment convention seeks reduce creation hazardous wastes control reduce trade across borders convention opened signatures 22 march 1989 officially entered force 5 may 1992 may 2014 180 states european union parties convention haiti united states signed convention ratified environmental network optimizing regulatory compliance illegal traffic enforce agency staffed relevant experts promote compliance basel convention international body created deal transboundary issues international hazardous waste trade issue transnational hazardous waste trade crosses many borders affects many nations important multinational multilateral organization presiding affairs members enforce include one representative five united nations regions parties convention well five representatives basel convention regional coordinating centers based equitable geographical representation members organizations united nations environmental programme unep international criminal police organization interpol ngos working prevent stop illegal traffic basel action network ban many organizations also eligible become members enforce 1999 basel convention passed protocol liability compensation sought improve regulatory measures better protect people hazardous waste protocol liability compensation attempts \u201c assign appropriate liability procedures transboundary movements hazardous wastes result damages human health environment \u201d protocol \u201c imposes strict liability damages situations involving parties basel convention maintain control hazardous waste respective notifying transporting disposing entities. \u201d seeks regulate ensure countries \u2019 corporations \u2019 compliance basel convention laws however protocol remains unsigned countries applicability limited effort protect unfair hazardous waste dumping african caribbean pacific states acp signed lome iv convention supplement basel convention prohibits \u201c export hazardous wastes european community acp states. \u201d convention one attempt developing countries protect western countries exporting waste poorer nations hazardous waste trade lom\u00e9 iv convention expired 2000 acp countries european countries entered new agreement known cotonou agreement \u201c recognizes existence disproportionate risks developing countries desires protect inappropriate hazardous waste shipments countries. \u201d 1991 multiple developing nations africa met discuss dissatisfaction basel convention regulating dumping hazardous waste countries designed ban import hazardous wastes countries called bamako convention bamako convention different basel convention bamako \u201c essentially bans import hazardous waste generated outside oau organization african unity disposal recycling deems import non-party illegal act. \u201d however countries could effectively implement stipulations convention could prevent dump toxic wastes due limited resources lack powerful enforcement therefore application bamako convention limited laura pratt expert hazardous waste trade claims despite local international attempts regulate hazardous waste trade \u201c current international agreements widespread legally binding agreements ad hoc agendas among smaller groups countries successful eliminating toxic waste colonialism proponents would hoped. \u201d explains various loopholes current system allow toxic waste continue dumped toxic colonialism go unchecked problems international agreements include continued illegal shipments unclear definitions terms pratt explains despite attempts regulate illegal dumping \u201c ftentimes hazardous waste simply moved false permits bribes improper labels even pretext 'recycling growing trend. \u201d companies often export hazardous wastes poorer countries illegal smuggling attempts regulate market hindered lack ability monitor trade many countries authoritative legislative bodies place prevent punish illegal trafficking hazardous wastes furthermore pratt explains without coordinated international methods enforce regulations extremely difficult countries control illegal trade hazardous waste due disparity enforcement resources regulation uniformity. \u201d developing nations still bear brunt illegal activity often resources capability protect another issue basel convention international agreements regulate waste trade difficulty establishing clear uniform definitions regarding wastes overly broad ambiguous definitions cause problems international agreements different parties interpret language agreements differently thus act accordingly example \u201c \u2018 lack distinction \u2018 waste \u2019 \u2018 products \u2019 convention vague criteria \u2018 hazardous \u2019 allowed continued export 'hazardous waste \u2019 label commodities raw materials despite fact wastes still present environmental health risks developing countries \u201d", + "neighbors": [ + 231, + 420, + 535 + ], + "mask": "Test" + }, + { + "node_id": 227, + "label": 7, + "text": "Supercomputer:supercomputer supercomputer computer high level performance compared general-purpose computer performance supercomputer commonly measured floating-point operations per second flops instead million instructions per second mips since 2017 supercomputers perform hundred quadrillion flops since november 2017 world fastest 500 supercomputers run linux-based operating systems additional research conducted china united states european union taiwan japan build even faster powerful technologically superior exascale supercomputers supercomputers play important role field computational science used wide range computationally intensive tasks various fields including quantum mechanics weather forecasting climate research oil gas exploration molecular modeling computing structures properties chemical compounds biological macromolecules polymers crystals physical simulations simulations early moments universe airplane spacecraft aerodynamics detonation nuclear weapons nuclear fusion throughout history essential field cryptanalysis supercomputers introduced 1960s several decades fastest made seymour cray control data corporation cdc cray research subsequent companies bearing name monogram first machines highly tuned conventional designs ran faster general-purpose contemporaries 1960s began add increasing amounts parallelism one four processors typical 1970s vector processors operating large arrays data came dominate notable example highly successful cray-1 1976 vector computers remained dominant design 1990s today massively parallel supercomputers tens thousands off-the-shelf processors became norm us long leader supercomputer field first cray almost uninterrupted dominance field later variety technology companies japan made major strides field 1980s 90s since china become increasingly active field november 2018 fastest supercomputer top500 supercomputer list summit united states linpack benchmark score 143.5 pflops followed sierra around 48.860 pflops us five top 10 china two june 2018 supercomputers list combined broken 1 exaflops mark 1960 sperry rand built livermore atomic research computer larc today considered among first supercomputers us navy research development centre still used high-speed drum memory rather newly emerging disk drive technology also among first supercomputers ibm 7030 stretch ibm 7030 built ibm los alamos national laboratory 1955 requested computer 100 times faster existing computer ibm 7030 used transistors magnetic core memory pipelined instructions prefetched data memory controller included pioneering random access disk drives ibm 7030 completed 1961 despite meeting challenge hundredfold increase performance purchased los alamos national laboratory customers england france also bought computer became basis ibm 7950 harvest supercomputer built cryptanalysis third pioneering supercomputer project early 1960s atlas university manchester built team led tom kilburn designed atlas memory space million words 48 bits magnetic storage capacity unaffordable actual core memory atlas 16,000 words drum providing memory 96,000 words atlas operating system swapped data form pages magnetic core drum atlas operating system also introduced time-sharing supercomputing one programe could executed supercomputer one time atlas joint venture ferranti manchester university designed operate processing speeds approaching one microsecond per instruction one million instructions per second cdc 6600 designed seymour cray finished 1964 marked transition germanium silicon transistors silicon transistors could run faster overheating problem solved introducing refrigeration supercomputer design thus cdc6600 became fastest computer world given 6600 outperformed contemporary computers 10 times dubbed supercomputer defined supercomputing market one hundred computers sold 8 million cray left cdc 1972 form company cray research four years leaving cdc cray delivered 80 mhz cray-1 1976 became one successful supercomputers history cray-2 released 1985 eight central processing units cpus liquid cooling electronics coolant liquid fluorinert pumped supercomputer architecture performed 1.9 gigaflops world second fastest m-13 supercomputer moscow computer seriously challenge cray-1 performance 1970s illiac iv machine first realized example true massively parallel computer many processors worked together solve different parts single larger problem contrast vector systems designed run single stream data quickly possible concept computer instead feeds separate parts data entirely different processors recombines results illiac design finalized 1966 256 processors offer speed 1 gflops compared 1970s cray-1 peak 250 mflops however development problems led 64 processors built system could never operate faster 200 mflops much larger complex cray another problem writing software system difficult getting peak performance matter serious effort partial success illiac iv widely seen pointing way future supercomputing cray argued famously quipping plowing field would rather use two strong oxen 1024 chickens early 1980s several teams working parallel designs thousands processors notably connection machine cm developed research mit cm-1 used many 65,536 simplified custom microprocessors connected together network share data several updated versions followed cm-5 supercomputer massively parallel processing computer capable many billions arithmetic operations per second 1982 osaka university links-1 computer graphics system used massively parallel processing architecture 514 microprocessors including 257 zilog z8001 control processors 257 iapx 86/20 floating-point processors mainly used rendering realistic 3d computer graphics fujitsu numerical wind tunnel supercomputer used 166 vector processors gain top spot 1994 peak speed 1.7 gigaflops gflops per processor hitachi sr2201 obtained peak performance 600 gflops 1996 using 2048 processors connected via fast three-dimensional crossbar network intel paragon could 1000 4000 intel i860 processors various configurations ranked fastest world 1993 paragon mimd machine connected processors via high speed two dimensional mesh allowing processes execute separate nodes communicating via message passing interface software development remained problem cm series sparked considerable research issue similar designs using custom hardware made many companies including evans sutherland es-1 maspar ncube intel ipsc goodyear mpp mid-1990s general-purpose cpu performance improved much supercomputer could built using individual processing units instead using custom chips turn 21st century designs featuring tens thousands commodity cpus norm later machines adding graphic units mix systems massive number processors generally take one two paths grid computing approach processing power many computers organised distributed diverse administrative domains opportunistically used whenever computer available another approach large number processors used proximity e.g computer cluster centralized massively parallel system speed flexibility becomes important modern supercomputers used various approaches ranging enhanced infiniband systems three-dimensional torus interconnects use multi-core processors combined centralization emerging direction e.g cyclops64 system price performance energy efficiency general purpose graphic processors gpgpus improved number petaflops supercomputers tianhe-i nebulae started rely however systems k computer continue use conventional processors sparc-based designs overall applicability gpgpus general-purpose high-performance computing applications subject debate gpgpu may tuned score well specific benchmarks overall applicability everyday algorithms may limited unless significant effort spent tune application towards however gpus gaining ground 2012 jaguar supercomputer transformed titan retrofitting cpus gpus high-performance computers expected life cycle three years requiring upgrade number special-purpose systems designed dedicated single problem allows use specially programmed fpga chips even custom asics allowing better price/performance ratios sacrificing generality examples special-purpose supercomputers include belle deep blue hydra playing chess gravity pipe astrophysics mdgrape-3 protein structure computation molecular dynamics deep crack breaking des cipher throughout decades management heat density remained key issue centralized supercomputers large amount heat generated system may also effects e.g reducing lifetime system components diverse approaches heat management pumping fluorinert system hybrid liquid-air cooling system air cooling normal air conditioning temperatures typical supercomputer consumes large amounts electrical power almost converted heat requiring cooling example tianhe-1a consumes 4.04 megawatts mw electricity cost power cool system significant e.g 4 mw 0.10/kwh 400 hour 3.5 million per year heat management major issue complex electronic devices affects powerful computer systems various ways thermal design power cpu power dissipation issues supercomputing surpass traditional computer cooling technologies supercomputing awards green computing reflect issue packing thousands processors together inevitably generates significant amounts heat density need dealt cray 2 liquid cooled used fluorinert cooling waterfall forced modules pressure however submerged liquid cooling approach practical multi-cabinet systems based off-the-shelf processors system x special cooling system combined air conditioning liquid cooling developed conjunction liebert company blue gene system ibm deliberately used low power processors deal heat density ibm power 775 released 2011 closely packed elements require water cooling ibm aquasar system uses hot water cooling achieve energy efficiency water used heat buildings well energy efficiency computer systems generally measured terms flops per watt 2008 ibm roadrunner operated 3.76 mflops/w november 2010 blue gene/q reached 1,684 mflops/w june 2011 top 2 spots green 500 list occupied blue gene machines new york one achieving 2097 mflops/w degima cluster nagasaki placing third 1375 mflops/w copper wires transfer energy supercomputer much higher power densities forced air circulating refrigerants remove waste heat ability cooling systems remove waste heat limiting factor many existing supercomputers infrastructure capacity actual peak demand machine designers generally conservatively design power cooling infrastructure handle theoretical peak electrical power consumed supercomputer designs future supercomputers power-limited thermal design power supercomputer whole amount power cooling infrastructure handle somewhat expected normal power consumption less theoretical peak power consumption electronic hardware since end 20th century supercomputer operating systems undergone major transformations based changes supercomputer architecture early operating systems custom tailored supercomputer gain speed trend move away in-house operating systems adaptation generic software linux since modern massively parallel supercomputers typically separate computations services using multiple types nodes usually run different operating systems different nodes e.g using small efficient lightweight kernel cnk cnl compute nodes larger system linux-derivative server i/o nodes traditional multi-user computer system job scheduling effect tasking problem processing peripheral resources massively parallel system job management system needs manage allocation computational communication resources well gracefully deal inevitable hardware failures tens thousands processors present although modern supercomputers use linux-based operating system manufacturer specific linux-derivative industry standard exists partly due fact differences hardware architectures require changes optimize operating system hardware design parallel architectures supercomputers often dictate use special programming techniques exploit speed software tools distributed processing include standard apis mpi pvm vtl open source-based software solutions beowulf common scenario environments pvm mpi loosely connected clusters openmp tightly coordinated shared memory machines used significant effort required optimize algorithm interconnect characteristics machine run aim prevent cpus wasting time waiting data nodes gpgpus hundreds processor cores programmed using programming models cuda opencl moreover quite difficult debug test parallel programs special techniques need used testing debugging applications opportunistic supercomputing form networked grid computing whereby super virtual computer many loosely coupled volunteer computing machines performs large computing tasks grid computing applied number large-scale embarrassingly parallel problems require supercomputing performance scales however basic grid cloud computing approaches rely volunteer computing handle traditional supercomputing tasks fluid dynamic simulations fastest grid computing system distributed computing project folding home f h f h reported 101 pflops x86 processing power 100 pflops contributed clients running various gpus rest various cpu systems berkeley open infrastructure network computing boinc platform hosts number distributed computing projects boinc recorded processing power 166 petaflops 762 thousand active computers hosts network great internet mersenne prime search gimps distributed mersenne prime search achieved 0.313 pflops 1.3 million computers internet primenet server supports gimps grid computing approach one earliest successful grid computing projects since 1997 quasi-opportunistic supercomputing form distributed computing whereby super virtual computer many networked geographically disperse computers performs computing tasks demand huge processing power quasi-opportunistic supercomputing aims provide higher quality service opportunistic grid computing achieving control assignment tasks distributed resources use intelligence availability reliability individual systems within supercomputing network however quasi-opportunistic distributed execution demanding parallel computing software grids achieved implementation grid-wise allocation agreements co-allocation subsystems communication topology-aware allocation mechanisms fault tolerant message passing libraries data pre-conditioning cloud computing recent rapid expansions development grabbed attention hpc users developers recent years cloud computing attempts provide hpc-as-a-service exactly like forms services currently available cloud software-as-a-service platform-as-a-service infrastructure-as-a-service hpc users may benefit cloud different angles scalability resources on-demand fast inexpensive hand moving hpc applications set challenges good examples challenges virtualization overhead cloud multi-tenancy resources network latency issues much research currently done overcome challenges make hpc cloud realistic possibility 2016 penguin computing r-hpc amazon web services univa silicon graphics international sabalcore gomput started offer hpc cloud computing penguin demand pod cloud bare-metal compute model execute code user given virtualized login node pod computing nodes connected via nonvirtualized 10 gbit/s ethernet qdr infiniband networks user connectivity pod data center ranges 50 mbit/s 1 gbit/s citing amazon ec2 elastic compute cloud penguin computing argues virtualization compute nodes suitable hpc penguin computing also criticized hpc clouds may allocated computing nodes customers far apart causing latency impairs performance hpc applications supercomputers generally aim maximum capability computing rather capacity computing capability computing typically thought using maximum computing power solve single large problem shortest amount time often capability system able solve problem size complexity computer e.g. complex weather simulation application capacity computing contrast typically thought using efficient cost-effective computing power solve somewhat large problems many small problems architectures lend supporting many users routine everyday tasks may lot capacity typically considered supercomputers given solve single complex problem general speed supercomputers measured benchmarked flops floating point operations per second terms mips million instructions per second case general-purpose computers measurements commonly used si prefix tera- combined shorthand tflops 10 flops pronounced teraflops peta- combined shorthand pflops 10 flops pronounced petaflops petascale supercomputers process one quadrillion 10 1000 trillion flops exascale computing performance exaflops eflops range eflops one quintillion 10 flops one million tflops single number reflect overall performance computer system yet goal linpack benchmark approximate fast computer solves numerical problems widely used industry flops measurement either quoted based theoretical floating point performance processor derived manufacturer processor specifications shown rpeak top500 lists generally unachievable running real workloads achievable throughput derived linpack benchmarks shown rmax top500 list linpack benchmark typically performs lu decomposition large matrix linpack performance gives indication performance real-world problems necessarily match processing requirements many supercomputer workloads example may require memory bandwidth may require better integer computing performance may need high performance i/o system achieve high levels performance since 1993 fastest supercomputers ranked top500 list according linpack benchmark results list claim unbiased definitive widely cited current definition fastest supercomputer available given time recent list computers appeared top top500 list peak speed given rmax rating source top500 2018 lenovo became worlds largest provider 117 top500 supercomputers stages supercomputer application may summarized following table ibm blue gene/p computer used simulate number artificial neurons equivalent approximately one percent human cerebral cortex containing 1.6 billion neurons approximately 9 trillion connections research group also succeeded using supercomputer simulate number artificial neurons equivalent entirety rat brain modern-day weather forecasting also relies supercomputers national oceanic atmospheric administration uses supercomputers crunch hundreds millions observations help make weather forecasts accurate 2011 challenges difficulties pushing envelope supercomputing underscored ibm abandonment blue waters petascale project advanced simulation computing program currently uses supercomputers maintain simulate united states nuclear stockpile 2010s china united states european union others competed first create 1 exaflop 10 one quintillion flops supercomputer erik p. debenedictis sandia national laboratories theorized zettaflops 10 one sextillion flops computer required accomplish full weather modeling could cover two-week time span accurately systems might built around 2030 many monte carlo simulations use algorithm process randomly generated data set particularly integro-differential equations describing physical transport processes random paths collisions energy momentum depositions neutrons photons ions electrons etc next step microprocessors may third dimension specializing monte carlo many layers could identical simplifying design manufacture process cost operating high performance supercomputers risen mainly due increasing power consumption mid 1990s top 10 supercomputer required range 100 kilowatt 2010 top 10 supercomputers required 1 2 megawatt 2010 study commissioned darpa identified power consumption pervasive challenge achieving exascale computing time megawatt per year energy consumption cost 1 million dollar supercomputing facilities constructed efficiently remove increasing amount heat produced modern multi-core central processing units based energy consumption green 500 list supercomputers 2007 2011 supercomputer 1 exaflops 2011 would required nearly 500 megawatt operating systems developed existing hardware conserve energy whenever possible cpu cores use execution parallelised application put low-power states producing energy savings supercomputing applications increasing cost operating supercomputers driving factor trend towards bundling resources distributed supercomputer infrastructure national supercomputing centres first emerged us followed germany japan european union launched partnership advanced computing europe prace aim creating persistent pan-european supercomputer infrastructure services support scientists across european union porting scaling optimizing supercomputing applications iceland built world first zero-emission supercomputer located thor data center reykjavik iceland supercomputer relies completely renewable sources power rather fossil fuels colder climate also reduces need active cooling making one greenest facilities world computers funding supercomputer hardware also became increasingly difficult mid 1990s top 10 supercomputer cost 10 million euros 2010 top 10 supercomputers required investment 40 50 million euros 2000s national governments put place different strategies fund supercomputers uk national government funded supercomputers entirely high performance computing put control national funding agency germany developed mixed funding model pooling local state funding federal funding many science-fiction writers depicted supercomputers works historical construction computers much fiction deals relations humans computers build possibility conflict eventually developing scenarios nature appear ai-takeover page examples supercomputers fiction include hal-9000 multivac machine stops glados evitable conflict vulcan hammer", + "neighbors": [ + 14, + 51, + 77, + 85, + 86, + 123, + 134, + 149, + 162, + 210, + 211, + 251, + 267, + 270, + 272, + 280, + 289, + 300, + 306, + 314, + 322, + 331, + 340, + 346, + 362, + 375, + 379, + 399, + 412, + 417, + 429, + 443, + 465, + 506, + 571, + 579, + 583, + 611, + 642, + 719, + 737, + 739, + 752, + 755, + 770, + 776, + 789, + 846, + 847, + 876, + 909, + 942, + 968, + 1006, + 1013, + 1016, + 1019, + 1076, + 1081, + 1096, + 1099, + 1138, + 1152, + 1159, + 1168, + 1196, + 1219, + 1220, + 1288, + 1322, + 1324, + 1354, + 1358, + 1368, + 1372, + 1398, + 1421, + 1503, + 1507, + 1524, + 1549, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 228, + "label": 2, + "text": "IPad_Mini_(2019):ipad mini 2019 fifth-generation ipad mini stylized marketed ipad mini colloquially referred ipad mini 5 tablet computer ipad mini line designed developed marketed apple inc announced press release along ipad air 2019 march 18 2019 first ipad mini released without live press event predecessor ipad mini 4 discontinued day shares similar design ipad mini 4 features apple a12 bionic chip 64 256gb storage modernly upgraded 7.9-inch retina display support apple pencil 1st generation true tone display bluetooth 5.0. ifixit teardown shows ipad mini equipped upgraded 3gb lpddr4x ram iphone xr ipad mini 2019 features upgraded front camera system 7mp 1080p camera used since 2016 starting iphone 7 continued iphone xs rear camera system continues older 8mp 1080p used since ipad air 2 2014 record 4k ipad mini uses lightning port headphone jack true tone display allows lcd adapt ambient lighting change color intensity different environments apple a12 bionic chip powering ipad mini 2019 66 higher clock speed predecessor 1.5ghz dual-core processor apple a8 previous generation clocked higher iphone 6 apple a12 bionic chip 2.49ghz six-core processor ipad mini 2019 3x faster ipad mini 4 support apple pencil 1st generation", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 214, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 229, + "label": 4, + "text": "Distributed_Checksum_Clearinghouse:distributed checksum clearinghouse distributed checksum clearinghouse also referred dcc hash sharing method spam email detection basic logic dcc spam mails sent many recipients message body appearing many times therefore bulk email dcc identifies bulk email taking checksum sending checksum clearinghouse server server responds number times received checksum individual email create score 1 time processed bulk mail identified response number high content examined dcc works udp protocol uses little bandwidth dcc resistant hashbusters main dcc checksums fuzzy ignore aspects messages fuzzy checksums changed spam evolves dcc likely identify mailing lists bulk email unless white listed likewise repeatedly sending email server increases number server therefore likelihood treated spam others according official dcc website dcc based idea paul vixie fuzzy body matching reject spam corporate firewall operated vernon schryver starting 1997 dcc designed written rhyolite software starting 2000 used production since winter 2000/2001", + "neighbors": [ + 285, + 620, + 678, + 1171, + 1172, + 1249, + 1446 + ], + "mask": "Test" + }, + { + "node_id": 230, + "label": 3, + "text": "Application-specific_instruction_set_processor:application-specific instruction set processor application-specific instruction set processor asip component used system-on-a-chip design instruction set asip tailored benefit specific application specialization core provides tradeoff flexibility general purpose cpu performance asic asips configurable instruction set usually cores divided two parts static logic defines minimum isa instruction-set architecture configurable logic used design new instructions configurable logic programmed either field similar fashion field-programmable gate array fpga chip synthesis asips used alternative hardware accelerators baseband signal processing video coding traditional hardware accelerators applications suffer inflexibility difficult reuse hardware datapath handwritten finite-state machines fsm retargetable compilers asips help designer update program reuse datapath typically asip design less dependent tool flow designing processor scratch complicated commercial tools design asips example processor designer synopsys open source tool well tta-based co-design environment tce", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 231, + "label": 4, + "text": "Demanufacturing:demanufacturing demanufacture process product extensive usage disassembled components components classified functionality components suitable reuse returned product reuse demanufacturing proposed used industries means reduce environmental footprint preserving economic viability processes involved term first coined professor walter w. olson professor john w. sutherland 1993 case waste electronics demanufacture involves dismantling components case material demanufacture may chemical process treatment waste plastics breaking long polymers smaller polymers", + "neighbors": [ + 60, + 226, + 420 + ], + "mask": "Test" + }, + { + "node_id": 232, + "label": 4, + "text": "Careto_(malware):careto malware careto spanish mask sometimes called mask piece espionage malware discovered kaspersky lab 2014 high level sophistication professionalism target list included diplomatic offices embassies careto believed work nation state kaspersky believes creators malware spanish-speaking focus spanish-speaking victims heavy targeting morocco targeting gibraltar bruce schneier speculates careto operated spain careto normally installs second complex backdoor program called sgh sgh easily modifiable also wider arsenal including ability intercept system events file operations performing wider range surveillance features information gathered sgh careto include encryption keys virtual private network configurations ssh keys communication channels careto hard discover remove use stealth capabilities addition samples digitally signed signatures issued bulgarian company tecsystem ltd. authenticity company unknown one issued certificates valid june 28 2011 june 28 2013 another valid april 18 2013 july 18 2016 revoked verisign careto discovered made attempts circumvent kaspersky security products upon discovery careto trying exploit software kaspersky started investigate part collecting statistics multiple sinkholes placed command control servers currently up-to-date antivirus software discover successfully remove malware investigation command control servers discoveries showed 380 victims infected information uncovered victims infected malware clicking spear phishing link redirected websites software careto could exploit adobe flash player player since patched longer exploitable careto websites contained exploitable software names similar popular newspapers washington post independent malware said multiple backdoors linux mac os x windows evidence possible fourth type backdoor android ios discovered c c servers samples found estimated careto compiled far back 2007 known attacks ceased january 2014", + "neighbors": [ + 11, + 43, + 91, + 134, + 141, + 158, + 198, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 528, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 813, + 818, + 915, + 1043, + 1063, + 1090, + 1101, + 1162, + 1186, + 1266, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1452, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Train" + }, + { + "node_id": 233, + "label": 6, + "text": "File_system_permissions:file system permissions file systems methods assign permissions access rights specific users groups users permissions control ability users view change navigate execute contents file system two types permissions widely used traditional unix permissions date back many decades earliest days unix universally available unix linux derived platforms access control lists acls recent origin universally used microsoft windows based file systems file system supports user permissions mainly ntfs refs also commonly used widely available common unix linux based systems although necessarily generally capable far detailed fine-tuning permissions traditional unix permissions permit system access control traditional acls provide unix linux based systems standard type acl defined posix standard posix acls variants exist nfs v3 v4 acls work slightly differently nfsv3 acls nfsv4 acls multiple systems available within operating system usually way specify used given file system system handle attempts access modify permissions controlled one using commands designed another usual solution ensure least degree awareness inter-operability different commands methods unix-like otherwise posix-compliant systems including linux-based systems macos versions simple system managing individual file permissions article called traditional unix permissions systems also support kind access control lists acls either proprietary old hp-ux acls example posix.1e acls based early posix draft withdrawn 1997 nfsv4 acls part nfsv4 standard microsoft ibm dos variants including ms-dos pc dos windows 95 windows 98 windows 98 se windows permissions file attributes read-only attribute r set unset file user program therefore prevent anyone changing/deleting file permission systems would prevent user reading file ms-dos/pc dos-compatible operating systems dr dos 3.31 higher palmdos novell dos opendos flexos 4680 os 4690 os concurrent dos multiuser dos datapac system manager ims real/32 support read/write/execute/delete file/directory access permissions fat volumes exception flexos 4680 os 4690 os operating systems also support individual file/directory passwords operating systems except dr dos palmdos novell dos opendos also support three independent file/directory ownership classes world/group/owner whereas single-user operating systems dr dos 6.0 higher palmdos novell dos opendos support optional multi-user security module security.bin loaded openvms a.k.a vms well microsoft windows nt derivatives including windows 2000 windows xp use acls administer complex varied set permissions openvms also uses permission scheme similar unix complex four categories system owner group world four types access permissions read write execute delete categories mutually disjoint world includes group turn includes owner system category independently includes system users similar superusers unix classic mac os operating systems hfs support permissions file attributes hidden show directory listings locked read-only name locked renamed stationery copy-on-write amigaos filesystem amigados supports relatively advanced permissions system single-user os amigaos 1.x files archive read write execute delete collectively known arwed permissions/flags amigaos 2.x higher additional hold script pure permissions/flags added mac os x versions 10.3 panther prior use posix-compliant permissions mac os x beginning version 10.4 tiger also support use nfsv4 acls still support traditional unix permissions used previous versions mac os x apple mac os x server version 10.4+ file services administration manual recommends using traditional unix permissions possible also still supports mac os classic protected attribute solaris acl support depends filesystem used older ufs filesystem supports posix.1e acls zfs supports nfsv4 acls linux supports posix.1e acls experimental support nfsv4 acls ext3 filesystem ext4 filesystem freebsd supports posix.1e acls ufs nfsv4 acls ufs zfs ibm z/os implements file security via racf resource access control facility permissions unix-like systems managed three distinct scopes classes scopes known user group others file created unix-like system permissions restricted umask process created files directories owned user owner determines file user class distinct permissions apply owner files directories assigned group define file group class distinct permissions apply members file group owner may member file group users owner member group comprise file others class distinct permissions apply others effective permissions determined based first class user falls within order user group others example user owner file permissions given user class regardless permissions assigned group class others class unix-like systems implement three specific permissions apply class effect setting permissions directory rather file one frequently misunderstood file permission issues permission set corresponding rights denied unlike acl-based systems permissions unix-like systems inherited files created within directory necessarily permissions directory unix-like systems typically employ three additional modes actually attributes referred permissions modes special modes file directory overall class though symbolic notation see setuid bit set triad user setgid bit set triad group sticky bit set triad others additional modes also referred setuid bit setgid bit sticky bit due fact occupy one bit unix permissions represented either symbolic notation octal notation common form used command codice_1 symbolic notation first character codice_2 display indicates file type related permissions remaining nine characters three sets representing class permissions three characters first set represents user class second set represents group class third set represents others class three characters represent read write execute permissions following examples symbolic notation permission systems additional symbols codice_1 display represent additional permission features represent setuid setgid sticky text attributes executable character x '- modified though attributes affect overall file users one class setuid attribute modifies executable character triad user setgid attribute modifies executable character triad group sticky text attribute modifies executable character triad others setuid setgid attributes first second triad x becomes '- becomes sticky text attribute third triad x becomes 't '- becomes 't example another method representing unix permissions octal base-8 notation shown codice_14 notation consists least three digits three rightmost digits represents different component permissions owner group others fourth digit present leftmost high-order digit addresses three additional attributes setuid bit setgid bit sticky bit digits sum component bits binary numeral system result specific bits add sum represented numeral values never produce ambiguous combinations sum represents specific set permissions technically octal representation bit field \u2013 bit references separate permission grouping 3 bits time octal corresponds grouping permissions user group others examples symbolic notation section given octal notation systems diverge traditional posix-model users groups creating new group \u2013 user private group \u2013 user assuming user member user private group scheme allows umask 002 used without allowing users write newly created files normal directories files assigned creating user private group however sharing files desirable administrator create group containing desired users create group-writable directory assigned new group importantly make directory setgid making setgid cause files created assigned group directory 002 umask enabled using user private groups ensure members group able write files", + "neighbors": [ + 34, + 40, + 55, + 63, + 99, + 103, + 134, + 195, + 222, + 278, + 295, + 301, + 326, + 334, + 349, + 358, + 365, + 438, + 494, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 735, + 782, + 800, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1056, + 1064, + 1090, + 1097, + 1104, + 1124, + 1157, + 1187, + 1201, + 1202, + 1232, + 1234, + 1252, + 1283, + 1287, + 1304, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 234, + "label": 2, + "text": "BIOS:bios bios acronym basic input/output system also known system bios rom bios pc bios non-volatile firmware used perform hardware initialization booting process power-on startup provide runtime services operating systems programs bios firmware comes pre-installed personal computer system board first software run powered name originates basic input/output system used cp/m operating system 1975 bios originally proprietary ibm pc reverse engineered companies looking create compatible systems interface original system serves de facto standard bios modern pcs initializes tests system hardware components loads boot loader mass memory device initializes operating system era dos bios provided hardware abstraction layer keyboard display input/output i/o devices standardized interface application programs operating system recent operating systems use bios loading instead accessing hardware components directly bios implementations specifically designed work particular computer motherboard model interfacing various devices make complementary system chipset originally bios firmware stored rom chip pc motherboard modern computer systems bios contents stored flash memory rewritten without removing chip motherboard allows easy end-user updates bios firmware new features added bugs fixed also creates possibility computer become infected bios rootkits furthermore bios upgrade fails brick motherboard permanently unless system includes form backup case unified extensible firmware interface uefi successor legacy pc bios aiming address technical shortcomings term bios basic input/output system created gary kildall first appeared cp/m operating system 1975 describing machine-specific part cp/m loaded boot time interfaces directly hardware cp/m machine usually simple boot loader rom versions ms-dos pc dos dr-dos contain file called variously io.sys ibmbio.com ibmbio.sys drbios.sys file known dos bios also known dos i/o system contains lower-level hardware-specific part operating system together underlying hardware-specific operating system-independent system bios resides rom represents analogue cp/m bios introduction ps/2 machines ibm divided system bios real- protected-mode portions real-mode portion meant provide backward compatibility existing operating systems dos therefore named cbios compatibility bios whereas abios advanced bios provided new interfaces specifically suited multitasking operating systems os/2 bios original ibm pc xt interactive user interface error codes messages displayed screen coded series sounds generated signal errors power-on self-test post proceeded point successfully initializing video display adapter options ibm pc xt set switches jumpers main board expansion cards starting around mid-1990s became typical bios rom include bios configuration utility bcu bios setup utility accessed system power-up particular key sequence program allowed user set system configuration options type formerly set using dip switches interactive menu system controlled keyboard interim period ibm-compatible pcsincluding ibm atheld configuration settings battery-backed ram used bootable configuration program disk rom set configuration options contained memory disk supplied computer lost system settings could changed applied general computers eisa bus configuration program called eisa configuration utility ecu modern wintel-compatible computer provides setup routine essentially unchanged nature rom-resident bios setup utilities late 1990s user configure hardware options using keyboard video display also errors occur boot time modern bios usually displays user-friendly error messages often presented pop-up boxes tui style offers enter bios setup utility ignore error proceed possible instead battery-backed ram modern wintel machine may store bios configuration settings flash rom perhaps flash rom holds bios early intel processors started physical address 000ffff0h systems later processors provide logic start running bios system rom system powered reset button pressed cold boot full power-on self-test post run ctrl+alt+delete pressed warm boot special flag value stored nonvolatile bios memory cmos tested bios allows bypass lengthy post memory detection post identifies initializes system devices cpu ram interrupt dma controllers parts chipset video display card keyboard hard disk drive optical disc drive basic hardware early ibm pcs routine post would download program ram keyboard port run feature intended factory test diagnostic purposes option rom scan completed detected rom modules valid checksums called immediately post bios version scan option roms bios calls int 19h start boot processing post-boot programs loaded also call int 19h reboot system must careful disable interrupts asynchronous hardware processes may interfere bios rebooting process else system may hang crash rebooting int 19h called bios attempts locate boot loader software boot device hard disk floppy disk cd dvd loads executes first boot software finds giving control pc bios uses boot devices set eeprom cmos ram earliest pcs dip switches bios checks device order see bootable attempting load first sector boot sector sector read bios proceeds next device sector read successfully bioses also check boot sector signature 0x55 0xaa last two bytes sector 512 bytes long accepting boot sector considering device bootable bootable device found bios transfers control loaded sector bios interpret contents boot sector possibly check boot sector signature last two bytes interpretation data structures like partition tables bios parameter blocks done boot program boot sector programs loaded boot process non-disk device network adapter attempts booting procedure defined option rom equivalent integrated motherboard bios rom option roms may also influence supplant boot process defined motherboard bios rom user select boot priority implemented bios example computers hard disk bootable usually removable-media drive higher boot priority user cause removable disk booted modern bioses boot priority order configured user older bioses limited boot priority options selectable earliest bioses fixed priority scheme implemented floppy disk drives first fixed disks i.e hard disks second typically boot devices supported subject modification rules installed option roms bios early pc also usually would boot first floppy disk drive first hard disk drive even two drives installed el torito optical media boot standard optical drive actually emulates 3.5 high-density floppy disk bios boot purposes reading first sector cd-rom dvd-rom simply defined operation like floppy disk hard disk furthermore complexity medium makes difficult write useful boot program one sector bootable virtual floppy disk contain software provides access optical medium native format original ibm pc xt bootable disk found rom basic started calling int 18h since programs used basic rom clone pc makers left computer failed boot disk would display rom basic halt response int 18h later computers would display message like bootable disk found would prompt disk inserted key pressed retry boot process modern bios may display nothing may automatically enter bios configuration utility boot process fails environment boot program simple cpu real mode general-purpose segment registers undefined except cs ss sp dl cs always zero ip initially codice_1 boot programs always loaded fixed address need boot program relocatable dl may contain drive number used int 13h boot device ss sp points valid stack presumably large enough support hardware interrupts otherwise ss sp undefined stack must already set order interrupts serviced interrupts must enabled order system timer-tick interrupt bios always uses least maintain time-of-day count initializes post active keyboard work keyboard works even bios keyboard service called keystrokes received placed 15-character type-ahead buffer maintained bios boot program must set stack size stack set bios unknown location likewise variable although boot program investigate default stack examining ss sp easier shorter unconditionally set new stack boot time bios services available memory address codice_2 contains interrupt vector table bios post initialized system timers interrupt controller dma controller motherboard/chipset hardware necessary bring bios services ready status dram refresh system dram conventional memory extended memory necessarily expanded memory set running interrupt vectors corresponding bios interrupts set point appropriate entry points bios hardware interrupt vectors devices initialized bios set point bios-provided isrs interrupts including ones bios generates programs hook set default dummy isr immediately returns bios maintains reserved block system ram addresses codice_3 various parameters initialized post memory address codice_4 used boot program may even overwrite peripheral cards hard disk drive controllers video display adapters bios extension option roms provide additional functionality bios code extensions runs bios boots system mass storage roms typically test initialize hardware add new bios services augment replace existing bios services versions services example scsi controller usually bios extension rom adds support hard drives connected controller video cards extension roms replace video services motherboard bios video services bios extension roms gain total control machine fact anything may never return control bios invoked extension rom could principle contain entire operating system application program could implement entirely different boot process booting network operation ibm-compatible computer system completely changed removing inserting adapter card rom chip contains bios extension rom motherboard bios typically contains code access hardware components necessary bootstrapping system keyboard display storage addition plug-in adapter cards scsi raid network interface cards video boards often include bios e.g video bios complementing replacing system bios code given component even devices built motherboard behave way option roms stored separate code main bios flash chip upgraded either tandem separately main bios add-in card requires option rom card supported main bios card needs initialized made accessible bios services operating system loaded usually means required bootstrapping process even required option rom allow adapter card used without loading driver software storage device booting begins option rom time taken load driver driver take space ram hard disk driver software rom always stays device two accidentally separated also rom card peripheral hardware driver software provided rom installed together extra effort install software additional advantage rom early pc systems notably including ibm pcjr rom faster main system ram modern systems case much reverse bios rom code usually copied shadowed ram run faster many methods utilities examining contents various motherboard bios expansion roms microsoft debug unix dd expansion rom wishes change way system boots network device scsi adapter bios driver code cooperative way use bios boot specification bbs api register ability expansion roms registered using bbs apis user select among available boot options within bios user interface bbs compliant pc bios implementations allow user enter bios user interface expansion roms finished executing registering bbs api specification downloaded acpica website official title bios boot specification version 1.01 11 january 1996 also expansion rom wishes change way system boots unilaterally simply hook int 19h interrupts normally called interrupt 19h int 13h bios disk service intercept bios boot process replace bios boot process one merely modify boot sequence inserting boot actions preventing bios detecting certain devices bootable bios boot specification promulgated way expansion roms implement boot capability devices supported booting native bios motherboard motherboard bios completes post bios versions search option rom modules also called bios extension roms execute motherboard bios scans extension roms portion upper memory area part x86 real-mode address space address 0xa0000 runs rom found order discover memory-mapped isa option roms bios implementation scans real-mode address space codice_5 codice_6 2 kib boundaries looking two-byte rom signature 0x55 followed 0xaa valid expansion rom signature followed single byte indicating number 512-byte blocks expansion rom occupies real memory next byte option rom entry point also known entry offset checksum specified number 512-byte blocks calculated rom valid checksum bios transfers control entry address normal bios extension rom beginning extension initialization routine point extension rom code takes typically testing initializing hardware controls registering interrupt vectors use post-boot applications may use bios services including provided previously initialized option roms provide user configuration interface display diagnostic information anything else requires possible option rom return bios pre-empting bios boot sequence altogether option rom normally return bios completing initialization process option rom returns bios continues searching option roms calling found entire option rom area memory space scanned option roms normally reside adapter cards however original pc perhaps also pc xt spare rom socket motherboard system board ibm terms option rom inserted four roms contain basic interpreter also removed replaced custom roms option roms ibm pcjr unique among pcs two rom cartridge slots front cartridges slots map region upper memory area used option roms cartridges contain option rom modules bios would recognize cartridges also contain types rom modules basic programs handled differently one pcjr cartridge contain several rom modules different types possibly stored together one rom chip bios rom customized particular manufacturer hardware allowing low-level services reading keystroke writing sector data diskette provided standardized way programs including operating systems example ibm pc might either monochrome color display adapter using different display memory addresses hardware single standard bios system call may invoked display character specified position screen text mode graphics mode bios provides small library basic input/output functions operate peripherals keyboard rudimentary text graphics display functions forth using ms-dos bios services could accessed application program ms-dos executing int 13h interrupt instruction access disk functions executing one number documented bios interrupt calls access video display keyboard cassette device functions operating systems executive software designed supersede basic firmware functionality provide replacement software interfaces application software applications also provide services began even 1980s ms-dos programmers observed using bios video services graphics display slow increase speed screen output many programs bypassed bios programmed video display hardware directly graphics programmers particularly exclusively demoscene observed technical capabilities pc display adapters supported ibm bios could taken advantage without circumventing since at-compatible bios ran intel real mode operating systems ran protected mode 286 later processors required hardware device drivers compatible protected mode operation replace bios services modern personal computers running modern operating systems bios used booting initial loading system software operating system first graphical screen displayed input output typically handled bios boot menu textual menu windows allows users choose operating system boot boot safe mode use last known good configuration displayed bios receives keyboard input bios modern pcs still boot run legacy operating systems ms-dos dr-dos rely heavily bios console disk i/o providing system bios bios-compatible firmware necessarily case uefi-based pcs intel processors reprogrammable microcode since p6 microarchitecture bios may contain patches processor microcode fix errors initial processor microcode reprogramming persistent thus loading microcode updates performed time system powered without reprogrammable microcode expensive processor swap would required example pentium fdiv bug became expensive fiasco intel required product recall original pentium processor defective microcode could reprogrammed bioses contain software licensing description table slic digital signature placed inside bios original equipment manufacturer oem example dell slic inserted acpi table contains active code computer manufacturers distribute oem versions microsoft windows microsoft application software use slic authenticate licensing oem windows installation disk system recovery disc containing windows software systems slic preactivated oem product key verify xml formatted oem certificate slic bios means self-activating see system locked preinstallation slp user performs fresh install windows need possession oem key either slp coa digital certificate slic order bypass activation achieved user performs restore using pre-customised image provided oem power users copy necessary certificate files oem image decode slp product key perform slp activation manually cracks non-genuine windows distributions usually edit slic emulate order bypass windows activation bios implementations allow overclocking action cpu adjusted higher clock rate manufacturer rating guaranteed capability overclocking may however seriously compromise system reliability insufficiently cooled computers generally shorten component lifespan overclocking incorrectly performed may also cause components overheat quickly mechanically destroy operating systems example ms-dos rely bios carry input/output tasks within pc bios still runs 16-bit real mode calling bios services directly inefficient protected-mode operating systems bios services used modern multitasking operating systems initially load importance primary part bios greatly reduced initially later bios implementations took complex functions including interfaces advanced configuration power interface acpi functions include power management hot swapping thermal management time since 2010 bios technology transitional process toward uefi historically bios ibm pc xt built-in user interface bios versions earlier pcs xt-class software configurable instead users set options via dip switches motherboard later computers including ibm-compatibles 80286 cpus battery-backed nonvolatile bios memory cmos ram chip held bios settings settings video-adapter type memory size hard-disk parameters could configured running configuration program disk built rom special reference diskette inserted ibm configure settings memory size early bios versions passwords boot-device selection options bios hard-coded boot first floppy drive failed first hard disk access control early at-class machines physical keylock switch hard defeat computer case could opened anyone could switch computer could boot later 386-class computers started integrating bios setup utility rom alongside bios code computers usually boot bios setup utility certain key key combination pressed otherwise bios post boot process executed modern bios setup utility menu-based user interface ui accessed pressing certain key keyboard pc starts usually key advertised short time early startup example press f1 enter cmos setup actual key depends specific hardware features present bios setup utility typically include modern bios setup screen often features pc health status hardware monitoring tab directly interfaces hardware monitor chip mainboard makes possible monitor cpu chassis temperature voltage provided power supply unit well monitor control speed fans connected motherboard system booted hardware monitoring computer fan control normally done directly hardware monitor chip separate chip interfaced i\u00b2c smbus come part super i/o solution interfaced low pin count lpc operating systems like netbsd envsys openbsd sysctl hw.sensors feature integrated interfacing hardware monitors normally done without interaction bios however certain circumstances bios vendor also provides underlying information hardware monitoring acpi case operating system may using acpi perform hardware monitoring done example asustek motherboards ai booster feature modern pcs bios stored rewritable memory allowing contents replaced modified rewriting contents sometimes termed flashing based common use kind eeprom known technically flash eeprom colloquially flash memory done special program usually provided system manufacturer post bios image hard drive usb flash drive file containing contents sometimes termed bios image bios might reflashed order upgrade newer version fix bugs provide improved performance support newer hardware reflashing operation might needed fix damaged bios original ibm pc bios cassette basic stored mask-programmed read-only memory rom chips sockets motherboard roms could replaced altered users allow updates many compatible computers used re-programmable memory devices eprom later flash memory devices according robert braver president bios manufacturer micro firmware flash bios chips became common around 1995 electrically erasable prom eeprom chips cheaper easier program standard ultraviolet erasable prom eprom chips flash chips programmed re-programmed in-circuit eprom chips need removed motherboard re-programming bios versions upgraded take advantage newer versions hardware correct bugs previous revisions bioses beginning ibm pcs supported hardware clock settable bios century bit allowed manually changing century year 2000 happened bios revisions created 1995 nearly bios revisions 1997 supported year 2000 setting century bit automatically clock rolled past midnight december 31 1999 first flash chips attached isa bus starting 1997 bios flash moved lpc bus functional replacement isa following new standard implementation known firmware hub fwh 2006 first systems supporting serial peripheral interface spi appeared bios flash memory moved size bios capacity rom eeprom media may stored increased time new features added code bios versions exist sizes 16 megabytes contrast original ibm pc bios contained 8 kib mask rom modern motherboards including even bigger nand flash memory ics board capable storing whole compact operating systems linux distributions example asus motherboards included splashtop os embedded nand flash memory ics however idea including operating system along bios rom pc new 1980s microsoft offered rom option ms-dos included roms pc clones tandy 1000 hx another type firmware chip found ibm pc early compatibles keyboard interface controlled microcontroller programmable memory ibm 40-pin socketed device manufacturers used eprom version chip resembled eprom controller also assigned a20 gate function manage memory one-megabyte range occasionally upgrade keyboard bios necessary take advantage software could use upper memory bios may contain components memory reference code mrc responsible handling memory timings related hardware settings ibm published entire listings bios original pc pc xt pc contemporary pc models appendix ibm pc technical reference manual machine type effect publication bios listings anyone see exactly definitive bios may 1984 phoenix software associates released first rom-bios enabled oems build essentially 100 -compatible clones without reverse-engineer ibm pc bios compaq done portable helping fuel growth pc compatibles industry sales non-ibm versions dos first american megatrends ami bios released 1986 new standards grafted onto bios usually without complete public documentation bios listings result easy learn intimate details many non-ibm additions bios core bios services pc motherboard suppliers license bios core toolkit commercial third-party known independent bios vendor ibv motherboard manufacturer customizes bios suit hardware reason updated bioses normally obtained directly motherboard manufacturer major bios vendors include american megatrends ami insyde software phoenix technologies byosoft former vendors include award software microid research acquired phoenix technologies 1998 phoenix later phased award brand name general software also acquired phoenix 2007 sold bios intel processor based embedded systems open source community increased effort develop replacement proprietary bioses future incarnations open sourced counterpart libreboot coreboot openbios/open firmware projects amd provided product specifications chipsets google sponsoring project motherboard manufacturer tyan offers coreboot next standard bios opteron line motherboards msi gigabyte technology followed suit msi k9nd ms-9282 msi k9sd ms-9185 resp m57sli-s4 models eeprom chips advantageous easily updated user customary hardware manufacturers issue bios updates upgrade products improve compatibility remove bugs however advantage risk improperly executed aborted bios update could render computer device unusable avoid situations recent bioses use boot block portion bios runs first must updated separately code verifies rest bios intact using hash checksums methods transferring control boot block detects corruption main bios typically warn user recovery process must initiated booting removable media floppy cd usb flash drive user try flashing bios motherboards backup bios sometimes referred dualbios boards recover bios corruptions least four known bios attack viruses two demonstration purposes first one found wild mebromi targeting chinese users first bios virus cih also known chernobyl virus able erase flash rom bios content compatible chipsets cih appeared mid-1998 became active april 1999 often infected computers could longer boot people remove flash rom ic motherboard reprogram cih targeted then-widespread intel i430tx motherboard chipset took advantage fact windows 9x operating systems also widespread time allowed direct hardware access programs modern systems vulnerable cih variety chipsets used incompatible intel i430tx chipset also flash rom ic types also extra protection accidental bios rewrites form boot blocks protected accidental overwrite dual quad bios equipped systems may event crash use backup bios also modern operating systems freebsd linux macos windows nt-based windows os like windows 2000 windows xp newer allow user-mode programs direct hardware access result 2008 cih become essentially harmless worst causing annoyance infecting executable files triggering antivirus software bios viruses remain possible however since windows home users without windows vista/7 uac run applications administrative privileges modern cih-like virus could principle still gain access hardware without first using exploit operating system openbsd prevents users access grsecurity patch linux kernel also prevents direct hardware access default difference attacker requiring much difficult kernel level exploit reboot machine second bios virus technique presented john heasman principal security consultant uk-based next-generation security software 2006 black hat security conference showed elevate privileges read physical memory using malicious procedures replaced normal acpi functions stored flash memory third bios virus technique called persistent bios infection appeared 2009 cansecwest security conference vancouver syscan security conference singapore researchers anibal sacco alfredo ortega core security technologies demonstrated insert malicious code decompression routines bios allowing nearly full control pc start-up even operating system booted proof-of-concept exploit flaw bios implementation involves normal bios flashing procedures thus requires physical access machine user root despite requirements ortega underlined profound implications sacco discovery patch driver drop fully working rootkit even little code remove disable antivirus mebromi trojan targets computers awardbios microsoft windows antivirus software two chinese companies rising antivirus jiangmin kv antivirus mebromi installs rootkit infects master boot record december 2013 interview 60 minutes deborah plunkett information assurance director us national security agency claimed nsa uncovered thwarted possible bios attack foreign nation state targeting us financial system program cited anonymous sources alleging chinese plot however follow-up articles guardian atlantic wired register refuted nsa claims bios replaced complex extensible firmware interface efi many new machines efi specification replaces runtime interface legacy bios initially written intel itanium architecture efi available x86 x86-64 platforms specification development driven unified efi forum industry special interest group efi booting supported microsoft windows versions supporting gpt linux kernel 2.6.1 later macos intel-based macs new pc hardware predominantly ships uefi firmware architecture rootkit safeguard also prevent system running user software changes makes uefi controversial bios replacement open hardware community alternatives functionality legacy bios x86 world include coreboot libreboot servers workstations use platform-independent open firmware ieee-1275 based forth programming language included sun sparc computers ibm rs/6000 line powerpc systems chrp motherboards along x86-based olpc xo-1 least 2015 apple removed legacy bios support macbook pro computers bless utility longer supports -- legacy switch prints legacy mode supported system macs also boot cd-rom usb flash drives", + "neighbors": [ + 22, + 42, + 78, + 85, + 99, + 134, + 185, + 210, + 211, + 236, + 270, + 272, + 306, + 326, + 336, + 359, + 412, + 413, + 486, + 494, + 639, + 664, + 708, + 754, + 755, + 868, + 870, + 961, + 979, + 1009, + 1064, + 1110, + 1121, + 1138, + 1161, + 1188, + 1208, + 1287, + 1304, + 1328, + 1351, + 1379, + 1415, + 1558, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 235, + "label": 4, + "text": "Domain-validated_certificate:domain-validated certificate domain validated certificate dv x.509 digital certificate typically used transport layer security tls domain name applicant validated proving control dns domain sole criterion domain validated certificate proof control whois records dns records file email web hosting account domain typically control domain determined using one following domain validated certificate distinct extended validation certificate requirement issuing certificate particular domain validated certificates assure particular legal entity connected certificate even domain name may imply particular legal entity controls domain web browsers may show lock often grey rather green lock typically used extended validation certificate dns domain name legal entity never displayed domain validated certificates include legal entity subject low assurance requirements allow domain validated certificates issued quickly without requiring human intervention domain validated certificates number unique characteristics", + "neighbors": [ + 88, + 172, + 260, + 261, + 319, + 533, + 539, + 542, + 554, + 692, + 826, + 1003, + 1089, + 1240, + 1331, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 236, + "label": 9, + "text": "IBM_BASIC:ibm basic ibm personal computer basic commonly shortened ibm basic programming language first released ibm ibm personal computer model 5150 ibm pc 1981 ibm released four different versions microsoft basic interpreter licensed microsoft pc pcjr known cassette basic disk basic advanced basic basica cartridge basic versions disk basic advanced basic included ibm pc dos pc dos 4 addition features ansi standard basic ibm versions offered support graphics sound hardware ibm pc line source code could typed full-screen editor limited facilities provided rudimentary program debugging ibm also released version microsoft basic compiler pc concurrently release pc dos 1.10 1982 ibm licensed microsoft basic ibm personal computer despite already version basic company mainframes estridge said microsoft basic hundreds thousands users around world going argue ibm cassette basic came 32 kilobytes kb read-only memory rom separate 8 kb bios rom original ibm pc require operating system run cassette basic provided default user interface invoked bios int 18h floppy disk drive installed boot code find bootable floppy disk power name cassette basic came use cassette tapes rather floppy disks store programs data cassette basic built roms original pc xt early models ps/2 line supported loading saving programs ibm cassette tape interface unavailable models original model 5150 entry-level version 5150 came 16 kb random-access memory ram sufficient run cassette basic however cassette basic rarely used pcs sold without disk drive sold pc dos sufficient ram least run disk basic\u2014many could run advanced basic well three versions cassette basic c1.00 found early ibm pcs 16k-64k motherboards c1.10 found later ibm pcs xts ats ps/2s c1.20 found pcjr ibm disk basic basic.com included original ibm pc dos uses 32 kb cassette basic rom basic.com run even highly compatible pc clones compaq portable name disk basic came use floppy disks well cassette tapes store programs data disk-based code corrected errata rom-resident code added floppy disk serial port support disk basic could identified use letter preceding version number added disk support features lacking cassette basic include extended sound/graphics functions basica primary purpose disk basic light version ibm pcs 48 kb memory basic.com would 23 kb free user code whereas basica would 17 kb 1986 new pcs shipped least 256k dos versions 3.00 reduced disk basic small stub called basica.com compatibility batch files even excess ram basic would still allocate manage 61 kb user programs whether cassette basic basic.com basica ibm advanced basic basica.com also included original ibm pc dos required rom-resident code cassette basic added functions diskette file access storing programs disk monophonic sound using pc built-in speaker graphics functions set clear pixels draw lines circles set colors event handling communications joystick presses basica would run non-ibm computers even so-called 100 compatible machines later ibm models since lack needed rom basic basica versions respective dos beginning v1.00 ending v3.30 early versions basica support subdirectories graphics commands functioned slightly differently example line statement used draw lines trailed off-screen basic would merely intersect nearest adjacent line basic 2.x went screen intersect paint command basic 1.x begins filling coordinate specified expands outward alternating directions basic 2.x fills everything starting coordinate finishing everything basic 1.x paint command also makes use system stack storage filling complex areas possible produce overflow error remedy clear statement used expand basic stack 128 bytes default size basic 2.x use stack painting thus free problem compaq basic 1.13 first standalone basic pc require cassette basic run well version basic besides ibm basica 1.00 1.10 use fcbs include original line statement intersecting lines paint statement compaq basic 1.13 worked like later versions basica/gw-basic using new fill algorithm stack early versions pc dos included several sample basic programs demonstrating capabilities pc including basica game donkey.bas gw-basic identical basica exception including cassette basic code program thus allowing run non-ibm computers later ibm models lack cassette basic rom rom cartridge version basic available ibm pcjr shipped 1984 supported additional graphics modes sound capabilities possible machine superset advanced basic cartridge basic operate within first 128 kb memory pcjr work expansion ram i.e def seg function used point memory segments h1ff0 cartridge basic activated typing basica dos prompt conversely ibm basica versions 2.1 refuse run detects pcjr patched work around cassette basic loads pc pcjr booted without bootable disk cartridge disk basic advanced basic load command name basic basica respectively typed dos command prompt except pcjr activates cartridge basic instead optional parameters control allocation memory loaded sign-on identification message displays program version number full-screen text editor starts see images right function keys assigned common commands display bottom screen commands may typed load save programs expressions typed executed direct immediate mode line input starts number language system stores following line text part program source allowing programmer enter entire program line line entering line numbers statement listed screen lines displayed order increasing line number changes made displayed line program source code moving cursor line cursor keys typing on-screen text program source stored internally tokenized form reserved words replaced single byte token save space execution time programs may saved compact tokenized form optionally saved dos ascii text files viewed edited programs like dos applications ibm basic text-mode program features windows icons mouse support cut-and-paste editing gw-basic launched 1983 disk-based microsoft product distributed non-ibm ms-dos computers supports graphics modes features basica computers ibm cassette basic successor basica ms-dos pc dos versions discontinued qbasic launched 1991 stripped-down version microsoft quickbasic compiler qbasic interpreter compile source files quickbasic compile save programs .exe executable file format", + "neighbors": [ + 0, + 8, + 234, + 273, + 292, + 359, + 413, + 510, + 606, + 670, + 799, + 810, + 812, + 843, + 868, + 870, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1188, + 1204, + 1304, + 1306, + 1372, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 237, + "label": 0, + "text": "Speech-generating_device:speech-generating device speech-generating devices sgds also known voice output communication aids electronic augmentative alternative communication aac systems used supplement replace speech writing individuals severe speech impairments enabling verbally communicate sgds important people limited means interacting verbally allow individuals become active participants communication interactions particularly helpful patients suffering amyotrophic lateral sclerosis als recently used children predicted speech deficiencies several input display methods users varying abilities make use sgds sgds multiple pages symbols accommodate large number utterances thus portion symbols available visible one time communicator navigating various pages speech-generating devices produce electronic voice output using digitized recordings natural speech speech synthesis\u2014which may carry less emotional information permit user speak novel messages content organization updating vocabulary sgd influenced number factors user needs contexts device used development techniques improve available vocabulary rate speech production active research area vocabulary items high interest user frequently applicable range meanings pragmatic functionality multiple methods accessing messages devices directly indirectly using specialized access devices\u2014although specific access method depend skills abilities user sgd output typically much slower speech although rate enhancement strategies increase user rate output resulting enhanced efficiency communication first known sgd prototyped mid-1970s rapid progress hardware software development meant sgd capabilities integrated devices like smartphones notable users sgds include stephen hawking roger ebert tony proudfoot pete frates founder als ice bucket challenge speech-generating systems may dedicated devices developed solely aac non-dedicated devices computers running additional software allow function aac devices sgds roots early electronic communication aids first aid sip-and-puff typewriter controller named patient-operated selector mechanism possum prototyped reg maling united kingdom 1960 possum scanned set symbols illuminated display researchers delft university netherlands created lightspot operated typewriter lot 1970 made use small movements head point small spot light matrix characters equipped photoelectric cell although commercially unsuccessful lot well received users 1966 barry romich freshman engineering student case western reserve university ed prentke engineer highland view hospital cleveland ohio formed partnership creating prentke romich company 1969 company produced first communication device typing system based discarded teletype machine 1970s early 1980s several companies began emerge since become prominent manufacturers sgds toby churchill founded toby churchill ltd 1973 losing speech following encephalitis us dynavox known sentient systems technology grew student project carnegie-mellon university created 1982 help young woman cerebral palsy communicate beginning 1980s improvements technology led greatly increased number variety performance commercially available communication devices reduction size price alternative methods access target scanning also known eye pointing calibrate movement user eyes direct sgd produce desired speech phase scanning alternatives presented user sequentially became available communication devices speech output possibilities included digitized synthesized speech rapid progress hardware software development continued including projects funded european community first commercially available dynamic screen speech generating devices developed 1990s software programs developed allowed computer-based production communication boards high-tech devices continued become smaller lighter increasing accessibility capability communication devices accessed using eye-tracking systems perform computer word-processing internet use environmental control device independent access equipment tv radio telephones stephen hawking came associated unique voice particular synthesis equipment hawking unable speak due combination severe disabilities caused als emergency tracheotomy past 20 years sgd gained popularity amongst young children speech deficiencies autism syndrome predicted brain damage due surgery starting early 2000s specialists saw benefit using sgds adults children well neuro-linguists found sgds effective helping children risk temporary language deficits undergoing brain surgery patients als particular digitized sgds used communication aids pediatric patients recovery process many methods accessing messages devices directly indirectly specialized access devices direct access methods involve physical contact system using keyboard touch screen users accessing sgds indirectly specialized devices must manipulate object order access system maneuvering joystick head mouse optical head pointer light pointer infrared pointer switch access scanner specific access method depend skills abilities user direct selection body part pointer adapted mouse joystick eye tracking could used whereas switch access scanning often used indirect selection unlike direct selection e.g. typing keyboard touching screen users target scanning make selections scanning indicator cursor electronic device desired choice unable point typically calibrate eyes use eye gaze way point blocking way select desired words phrases speed pattern scanning well way items selected individualized physical visual cognitive capabilities user augmentative alternative communication typically much slower speech users generally producing 8\u201310 words per minute rate enhancement strategies increase user rate output around 12\u201315 words per minute result enhance efficiency communication given sgd may large number vocal expressions facilitate efficient effective communication including greetings expressing desires asking questions sgds multiple pages symbols accommodate large number vocal expressions thus portion symbols available visible one time communicator navigating various pages speech-generating devices generally display set selections either using dynamically changing screen fixed display two main options increasing rate communication sgd encoding prediction encoding permits user produce word sentence phrase using one two activations sgd iconic encoding strategies semantic compaction combine sequences icons picture symbols produce words phrases numeric alpha-numeric letter encoding also known abbreviation-expansion words sentences coded sequences letters numbers example typing hh g1 greeting 1 may retrieve hello prediction rate enhancement strategy sgd attempts reduce number keystrokes used predicting word phrase written user user select correct prediction without needing write entire word word prediction software may determine choices offered based frequency language association words past choices user grammatical suitability however users shown produce words per minute using scanning interface static keyboard layout predictive grid layout suggesting cognitive overhead reviewing new arrangement cancels benefits predictive layout using scanning interface another approach rate-enhancement dasher uses language models arithmetic coding present alternative letter targets screen size relative likelihood given history rate words produced depend greatly conceptual level system talk system allows users choose large numbers sentence-level utterances demonstrated output rates excess 60 wpm fixed display devices refer symbols items fixed particular format sources refer static displays display devices simpler learning curve devices fixed display devices replicate typical arrangement low-tech aac devices low-tech defined devices need batteries electricity electronics like communication boards share disadvantages example typically restricted limited number symbols hence messages important note technological advances made twenty-first century fixed-display sgds commonly used anymore dynamic displays devices usually also touchscreen devices typically generate electronically produced visual symbols pressed change set selections displayed user change symbols available using page links navigate appropriate pages vocabulary messages home page dynamic display device may show symbols related many different contexts conversational topics pressing one symbols may open different screen messages related topic example watching volleyball game user may press sport symbol open page messages relating sport press symbol showing scoreboard utter phrase score advantages dynamic display devices include availability much larger vocabulary ability see sentence construction advantage dynamic display devices underlying operating system capable providing options multiple communication channels including cell phone text messaging e-mail work link\u00f6ping university shown email writing practices allowed children sgd users develop new social skills increase social participation low cost systems also include keyboard audio speaker combination without dynamic display visual screen type keyboard sends typed text direct audio speaker permit phrase spoken without need visual screen always required one simple benefit talking keyboard used standard telephone speakerphone enable voice impaired individual 2 way conversation telephone output sgd may digitized and/or synthesized digitized systems play directly recorded words phrases synthesized speech uses text-to-speech software carry less emotional information permits user speak novel messages typing new words today individuals use combination recorded messages text-to-speech techniques sgds however devices limited one type output words phrases entire messages digitised stored onto device playback activated user process formally known voice banking advantages recorded speech include provides natural prosody speech naturalness listener e.g. person age gender aac user selected record messages b provides additional sounds may important user laughing whistling moreover digitized sgds provide degree normalcy patient families lose ability speak major disadvantage using recorded speech users unable produce novel messages limited messages pre-recorded device depending device may limit length recordings sgds use synthesized speech apply phonetic rules language translate user message voice output speech synthesis users freedom create novel words messages limited pre-recorded device others smartphones computers increased use synthesized speech devices creation apps allow user select list phrases messages spoken voice language user chosen apps speakit assistive express iphone provide cheap way use speech-generating device without visit doctor office learn use specialized machinery synthesized sgds may allow multiple methods message creation used individually combination messages created letters words phrases sentences pictures symbols synthesized speech virtually unlimited storage capacity messages demands memory space synthesized speech engines available many languages engine parameters speech rate pitch range gender stress patterns pauses pronunciation exceptions manipulated user selection set sgd set messages symbols codes available person using device content organisation updating selection set areas active research influenced number factors including user ability interests age selection set aac system may include words user know yet \u2013 included user grow content installed given sgd may include large number preset pages provided manufacturer number additional pages produced user user care team depending user needs contexts device used researchers beukelman mirenda list number possible sources family members friends teachers care staff selection initial content sgd range sources required general one individual would knowledge experience generate vocal expressions needed given environment example parents therapists might think add slang terms innit previous work analyzed vocabulary use typically developing speakers word use aac users generate content new aac devices processes work well generating core set utterances vocal expressions less effective situations particular vocabulary needed example terms related directly user interest horse riding term fringe vocabulary refers vocabulary specific unique individual personal interests needs typical technique develop fringe vocabulary device conduct interviews multiple informants siblings parents teachers co-workers involved persons researchers musselwhite st. louis suggest initial vocabulary items high interest user frequently applicable range meanings pragmatic functionality criteria widely used aac field ecological check sgd content beukelman mirenda emphasize vocabulary selection also involves ongoing vocabulary maintenance however difficulty aac users carers must program new utterances manually e.g names new friends personal stories existing commercial solutions automatically adding content number research approaches attempted overcome difficulty range inferred input generating content based log conversation user friends family data mined internet find language materials webcrawler project moreover making use lifelogging based approaches device content changed based events occur user day accessing user data high-quality messages generated risk exposing sensitive user data example making use global positioning systems device content changed based geographical location many recently developed sgds include performance measurement analysis tools help monitor content used individual raises concerns privacy argue device user involved decision monitor use way similar concerns raised regarding proposals devices automatic content generation privacy increasingly factor design sgds aac devices designed used areas user life sensitive legal social technical issues centred wide family personal data management problems found contexts aac use example sgds may designed support user right delete logs conversations content added automatically programming dynamic speech generating devices usually done augmentative communication specialists specialists required cater needs patients patients usually choose kinds words/ phrases want example patients use different phrases based age disability interests etc therefore content organization extremely time consuming additionally sgds rarely covered health insurance companies result resources limited regards funding staffing dr. john costello boston children hospital driving force soliciting donations keep program running well-staffed within hospital hospitals across country", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 238, + "label": 2, + "text": "Nokia_N800:nokia n800 nokia n800 internet tablet wireless internet appliance nokia originally announced las vegas ces 2007 summit january 2007 n800 allows user browse internet communicate using wi-fi networks mobile phone via bluetooth n800 developed successor nokia 770 includes fm internet radio rss news reader image viewer media player audio video files note usb port uses mini-b socket instead mini-ab specially grounded adaptor required make full use usb otg client/host auto-switching switching done software regular adaptors though usb otg provides 100 current versus full-size usb 500 devices larger current requirements need used powered usb hub n800 like nokia internet tablets runs maemo similar many handheld operating systems provides home screen\u2014the central point applications settings accessed home screen divided areas launching applications menu bar large customisable area display information rss reader internet radio player google search box example maemo modified version debian n800 bundled several applications including mozilla-based microb browser macromedia flash gizmo skype n800 use maemo os comes number built-in applications additional applications installed number sources including various official community", + "neighbors": [ + 3, + 21, + 253, + 264, + 270, + 309, + 322, + 484, + 527, + 571, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1051, + 1117, + 1138, + 1203, + 1313, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Test" + }, + { + "node_id": 239, + "label": 1, + "text": "Soterml:soterml soterml soil terrain markup language xml-based markup language storing exchanging soil terrain related data soterml development done within e-soter platform geoss plans global earth observation system within framework e-soter project addresses felt need global soil terrain database centre geospatial science currently nottingham gepospatial institute university nottingham initiated development since january 2009 development maintenance currently handled national soil resources institurte nsri cranfield university uk role cgs within development e-soter dissemination platform based inspire principles soterml development included 1 development data dictionary nomenclatures various data sources data metadata 2 development exchange format/procedures world reference base 2006", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 240, + "label": 3, + "text": "Rasterscan:rasterscan rasterscan computer game published 1987 mastertronic several 8-bit formats written binary design ltd based parsonage gardens manchester c64 version programmed phillip allsopp aka 'sarge rasterscan large damaged spacecraft drifting uncontrollably towards nearby star rasterscan still controlled piloted safety droid called msb unfortunately msb also damaged without help repair toasters player needs control msb hopefully use save unfortunate spacecraft player controls msb spherical droid float interior ship directions msb interact craft machinery instruments serve purpose also needs solve logic-puzzles order open doors different puzzles door allow access parts spacecraft", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 241, + "label": 8, + "text": "VlibTemplate:vlibtemplate vlibtemplate template engine written php programmers web developers may use web development vlibtemplate php class intended make splitting php html simple natural task using markup tags class allows users set values variables loops statements etc declared template vlibtemplate part vlib interface vlibdate vlibmimemail since vlibtemplate separates php html two files note file contains plain html one markup tag tmpl_var used display template variables assigned php script using vlibtemplatecache speed parsing process", + "neighbors": [ + 378, + 1235 + ], + "mask": "Test" + }, + { + "node_id": 242, + "label": 4, + "text": "NetVault_Backup:netvault backup netvault set data protection software developed supported quest software netvault backup backup recovery software product used protect data software applications physical virtual environments one central management interface supports many servers application platforms protocols unix linux microsoft windows vmware microsoft hyper-v oracle sybase microsoft sql server ndmp oracle acsls ibm das/aci microsoft exchange server db2 teradata quest software offers data deduplication protection nas filers ndmp netvault backup based client-server architecture central netvault backup server provides job management media management device management client management reporting notifications logging functions netvault backup server maintains history backups netvault backup database enabling users identify object want restore netvault clients \u201c agents \u201d work netvault backup server back recover respective servers applications data client software installed machine protected netvault webui enables centralized administration netvault backup server browser netvault supports tape drives tape libraries backup devices attached central server protected machine located anywhere network enabling lan-free backups additionally devices controlled ndmp attached supported filer netvault backup server master backup server deployed microsoft windows linux netvault backup protect windows server linux solaris freebsd aix hp-ux hyper-v vmware also back variety applications nas devices ndmp using so-called plug-ins list includes microsoft sql server oracle microsoft exchange server lotus notes db2 sybase others three options within netvault suite enabling backup recovery disk tape bare metal recovery bmr data deduplication quest supports netapp products following technologies originally netvault backup intended back physical tapes tape drives however product soon extended support backup disk data deduplication netvault backup supports quest dr appliance netvault smartdisk dell dr appliance hardware-based inline deduplication storage product deduplication engine originally developed ocarina networks netvault ocarina engineering teams worked integrate two technologies netvault backup also used netvault smartdisk disk storage repository deduplication product netvault smartdisk perform post-process data deduplication represents contiguous storage pool disk without subdivided virtual tapes slots easier management allows byte-level variable block-based software deduplication netvault backup supports emc data domain via dd boost quantum dxi lan-free backups netvault backup write physical tape drive vtl shared multiple machines using fibre channel iscsi", + "neighbors": [ + 134, + 195, + 211, + 415, + 494, + 792, + 961, + 1138, + 1363 + ], + "mask": "Test" + }, + { + "node_id": 243, + "label": 1, + "text": "DNA_Data_Bank_of_Japan:dna data bank japan dna data bank japan ddbj biological database collects dna sequences located national institute genetics nig shizuoka prefecture japan also member international nucleotide sequence database collaboration insdc exchanges data european molecular biology laboratory european bioinformatics institute genbank national center biotechnology information daily basis thus three databanks contain data given time ddbj began data bank activities 1986 nig remains nucleotide sequence data bank asia although ddbj mainly receives data japanese researchers accept data contributors country ddbj primarily funded japanese ministry education culture sports science technology mext ddbj international advisory committee consists nine members 3 members europe us japan committee advises ddbj maintenance management future plans year apart ddbj also international collaborative committee advises various technical issues related international collaboration consists working-level participants", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 244, + "label": 1, + "text": "Basic_Resident_Registry_Network:basic resident registry network national registry japanese citizens ruled constitutional supreme court japan march 6 2008 amidst strong opposition percentage popularization smartcard called juki-card low ratio view system end failure registry contains following information citizen initial phase network started august 5 2002 implemented literally three statutes online government local government executive procedure june 7 2003 full operation august 25 2003 among 1,700 local governments japan two kunitachi tokyo yamatsuri fukushima refused join network may 2009 registry opposed democratic party japan liberal party japanese communist party social democratic party", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 245, + "label": 3, + "text": "Raid_on_Bungeling_Bay:raid bungeling bay raid bungeling bay first video game designed wright published broderbund commodore 64 1984 ported msx 1985 nes 1987 commodore 64 version published uk ariolasoft nes version japan hudson soft game would inspire wright develop simcity raid bungeling bay 2d war zone shoot 'em player controls helicopter launched aircraft carrier bomb six factories scattered across islands small planetoid occupied bungeling empire frequent villains broderbund games fending escalating counterattacks gun turrets fighter jets guided missiles battleship also hidden island player reload failure means bungeling empire develops war machine take planet earth players attack infrastructure defending aircraft carrier served home base game offers insight design style wright would later go design simcity time factories grow develop new technologies use player also visible signs interdependency among islands supply boats moving order win game player must prevent escalation bombing factories quickly possible keeping advancing technology left alone long factories create enough new weaponry overwhelm player compute wrote 1985 raid possesses virtues needed appease demanding gamer amazingly detailed graphics computer gaming world 1988 approved nintendo version graphics calling high adventure realistic overtones involve dragons elves magazine named action-strategy game year nintendo writing raid rescued broderbund computer software vaults updated slightly sent challenge bright new nintendo games blew water ... delightful game experience 1996 computer gaming world declared raid bungeling bay 24th-best computer game ever released commodore 64 version sold 20,000 30,000 units us nes version sold million units japan large discrepancy attributed lack piracy nes due cartridge system along raid bungeling bay one first american games published japan sales game gave wright financial freedom create simcity wright continued develop editor game personal toy enjoyed much researched urban planning realised others might enjoy constructing building cities result advanced simulation eventually became simcity", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 246, + "label": 9, + "text": "Dynamic_programming_language:dynamic programming language dynamic programming language computer science class high-level programming languages runtime execute many common programming behaviours static programming languages perform compilation behaviors could include extension program adding new code extending objects definitions modifying type system although similar behaviors emulated nearly language varying degrees difficulty complexity performance costs dynamic languages provide direct tools make use many features first implemented native features lisp programming language dynamic languages also dynamically typed dynamic languages frequently always referred scripting languages although term scripting language narrowest sense refers languages specific given run-time environment dynamic languages offer eval function function takes string parameter containing code language executes code stands expression resulting value returned however erik meijer peter drayton suggests programmers use eval poor man substitute higher-order functions type object system typically modified runtime dynamic language mean generating new objects runtime definition based mixins existing types objects also refer changing inheritance type tree thus altering way existing types behave especially respect invocation methods reflection common many dynamic languages typically involves analysis types metadata generic polymorphic data however also include full evaluation modification program code data features lisp provides analyzing s-expressions limited number dynamic programming languages provide features combine code introspection ability examine classes functions keywords know know eval feature called macros programmers today aware term macro encountered c c++ static feature built small subset language capable string substitutions text program dynamic languages however provide access inner workings compiler full access interpreter virtual machine runtime allowing definition language-like constructs optimize code modify syntax grammar language assembly c c++ early java fortran generally fit category following examples show dynamic features using language common lisp common lisp object system clos example shows function modified runtime computed source code example shows existing instance changed include new slot class changes existing method replaced new version next example class person gets new superclass print method gets redefined assembles several methods effective method effective method gets assembled based class argument runtime available applicable methods popular dynamic programming languages include javascript python ruby php lua perl following generally considered dynamic languages many use term scripting languages", + "neighbors": [ + 78, + 117, + 134, + 216, + 292, + 306, + 308, + 378, + 396, + 447, + 509, + 579, + 592, + 682, + 756, + 806, + 824, + 825, + 873, + 919, + 948, + 984, + 1021, + 1028, + 1044, + 1225, + 1227, + 1231, + 1235, + 1264, + 1291, + 1311, + 1319, + 1320, + 1324, + 1389, + 1532, + 1621, + 1626 + ], + "mask": "Test" + }, + { + "node_id": 247, + "label": 2, + "text": "2015_Windows_10_400:2015 windows 10 400 2015 windows 10 400 nascar sprint cup series race held august 2 2015 pocono raceway long pond pennsylvania contested 160 laps 2.5 mile 4 km triangular superspeedway 21st race 2015 nascar sprint cup series season matt kenseth race second season brad keselowski finished second jeff gordon finished third dale earnhardt jr. greg biffle rounded top five kyle busch pole race led 19 laps leading race running fuel final lap finished 21st joey logano led race high 97 laps running fuel three laps go finished 20th race 18 lead changes among 13 different drivers eight caution flag periods 32 laps one red flag period lasted 14 minutes 32 seconds 33rd career victory matt kenseth second season first pocono raceway tenth track joe gibbs racing kenseth left pocono trailing kevin harvick 118\u2013points points standings despite winning manufacturer toyota left pocono trailing chevrolet 75\u2013points manufacturer standings pulled within one\u2013point ford second standings windows 10 400 carried nbc sports cable/satellite nbcsn network american television audience radio broadcast race carried motor racing network sirius xm nascar radio pocono raceway formerly pocono international raceway also known tricky triangle superspeedway located pocono mountains pennsylvania long pond site two annual nascar sprint cup series races held weeks apart june august one nascar camping world truck series event august since 2013 track also host verizon indycar series race pocono one nascar tracks owned either speedway motorsports inc. international speedway corporation dominant track owners nascar run igdalsky siblings brandon nicholas sister ashley cousins joseph iv chase mattioli third-generation members family-owned mattco inc started joseph ii rose mattioli mattco also owns south boston speedway south boston virginia outside nascar races pocono used throughout year sports car club america scca motorcycle clubs well racing schools triangular oval also three separate infield sections racetrack \u2013 north course east course south course infield sections use separate portion tri-oval complete track regular non-race weekends multiple clubs use track running different infield sections also infield sections run either direction multiple infield sections put together \u2013 running north course south course using tri-oval connect two kevin harvick entered pocono 69-point lead joey logano dale earnhardt jr. entered 100 back jimmie johnson entered 102 back martin truex jr. entered 109 back following axalta paint winners 400 june section tunnel turn \u2013 turn 2 \u2013 milled leveled repaved done eliminate bumps develop foundation track surface goes tunnel team haulers use get track settles ground entry list windows 10 400 released monday july 27 11:20 a.m. eastern time forty-three drivers entered race entered previous week race indianapolis three driver changes race 33 hillman-circle sport llc chevrolet driven alex kennedy premium motorsports duo swapped rides weekend timmy hill driving 62 chevrolet reed sorenson driving 98 ford brad keselowski fastest first practice session time 50.961 speed kyle busch pole time 50.444 speed \u201c told fast car \u2019 sure could get balance right \u201d busch said winning pole \u201c crew chief adam stevens guys again. \u201d \u201c lot lies putting lap together something \u2019 done last couple months \u201d kevin harvick said qualifying second \u201c feel like good job made good adjustments feel like probably gave little bit turn 1 got little bit tight center corner all-in-all good lap \u2019 glad ran fastest speed last round do. \u201d \u201c bad \u201d tony stewart said qualifying fifth \u201c crew chief chad johnston came practice session qualifying showed stuff losing time focused qualifying worked. \u201d \u201c pretty good final round quite good enough get pole \u201d said brad keselowski qualifying ninth \u201c missing little bit one corners all-in-all good effort fastest car practice feel pretty good similar brickyard really strong needed little win optimistic sure. \u201d \u201c really struggled whatever reason turn 1 today \u201d said martin truex jr. qualifying 13th \u201c \u2019 seem get balance right either tight loose matter fought thing big deal though think okay \u2019 got plenty time figure tomorrow \u2019 got cars pass 13th bad last week. \u201d carl edwards fastest second practice session time 51.191 speed kyle busch fastest final practice session time 51.358 speed jeb burton forced go backup car wrecking inside pit road wall change took place qualifying started race rear field race scheduled start 1:46 p.m. started four minutes later kyle busch led field green flag first caution race flew fifth lap kasey kahne got loose frontstretch coming turn 3 slid track slammed inside wall lining pit road almost identical manner happened jeb burton final practice day \u201c well first \u2019 believe clear late corner way left heading towards pit wall \u201d kahne said \u201c saw people thought guys need take running get way \u2019 know \u2019 done anything like kind crazy way happened. \u201d kahne uninjured released infield care center minutes later car damaged beyond repair finished dead last race red-flagged allow nascar evaluate repair wall 14-minute 43 second delay red flag withdrawn field continued caution race restarted lap 10 second caution race flew lap 16 scheduled competition caution section track washed following previous day arca race cars opted pit kevin harvick assumed race lead a. j. allmendinger tagged uncontrolled tire restarted race tail-end field race restarted lap 20 third caution race flew lap harvick blew engine turn 3 first dnf since last year duck commander 500 texas motor speedway \u201c coming turn 2 knew issues n't realize going big really proud team harvick said car fast 'll days like race restarted lap 24 fourth caution race flew lap 28 sam hornish jr. cut left-front tire turn 1 got rear-ended ricky stenhouse jr. slammed wall everything happening real fast said stenhouse walked away uninjured saw 9 hornish turn 3 run track thought got loose everything fine getting turn 1 car front ducked last minute 9 sitting got brakes really hard think got splitter could n't go left right ran right good day us guess 9 missed shift something n't aware 35 cole whitt one cars pulled real quick 9 sitting time reacted late ran right back one days hornish said missed shift restart n't good tire come apart got hit deal right busch kurt trying hold saw got straightened back one things everything stops smoking long enough think back control wobbling around unfortunate us sure ... love coming pocono good runs led laps felt like could win races n't us year hopefully n't carry watkins glen next weekend race restarted lap 34 defending pocono winner martin truex jr. front made first stop lap 39 gave lead joey logano jimmie johnson pitted second lap 44 logano ducked onto pit road lap 52 handed lead kyle busch surrendered lead pit next lap handed teammate denny hamlin dale earnhardt jr. tagged speeding pit road forced serve drive-through penalty hamlin pitted lead lap 55 handed brad keselowski pitted lap 57 handed lead jeff gordon 2 tagged uncontrolled tire colliding tire carrier forced serve drive-through penalty gordon pitted lap 59 handed lead danica patrick uncontrolled tire 2 pit stall brought fifth caution race lap 62 pitted caution lead cycled back joey logano jeb burton tagged speeding pit road restarted race tail-end field race restarted lap 66 sixth caution race flew lap kurt busch got turned paul menard t-boned sam hornish jr race restarted lap 72 seventh caution race flew lap dale earnhardt jr. made contact cole whitt turn 1 went spinning race restarted lap 76 busch pitted second lap 88 started round green flag stops logano pitted next lap gave lead matt kenseth gave lead pit next lap handed kyle larson eighth caution race flew lap 91 alex kennedy backed wall turn 1 clint bowyer caught caution pitted pit road closed result restarted race tail-end field larson pitted caution handed lead joey logano race restarted lap 98 field settled green flag run lap 123 joey logano surrendered lead pit handed lead denny hamlin pitted next lap handed lead david ragan ducked onto pit road 35 laps go handed lead greg biffle brett moffitt tagged speeding pit road forced serve drive-through penalty biffle hit pit road 34 laps go handed lead jeff gordon casey mears tagged many men wall forced serve drive-through penalty gordon surrendered lead pit 33 laps go lead cycled back joey logano logano maintained one-second lead kyle busch ten laps go chance short fuel ultimately ran fuel long pond straightaway three go busch took lead lap later truex ran fuel well last lap busch ran fuel front\u2013stretch passed matt kenseth \u2013 taken white flag 15 seconds behind busch \u2013 turn 2 went take checkered flag \u201c feels good get one today \u201d said kenseth \u201c \u2019 nothing like wins never thought \u2019 ever win pocono never thought \u2019 win fuel mileage race today. \u201d \u201c guess numbers crew chief todd gordon said good enough make half lap \u201d said joey logano running gas finishing 20th \u201c saving fuel cushion thought going good started running knew \u2019 going make tough everything right today. \u201d running tire carrier lap 57 serving drive\u2013through penalty uncontrolled tire sent back 37th brad keselowski rallied back runner\u2013up finish fuel came play end able take care bring home second respectable day keselowski said certainly going finish without fuel sometimes works think teammate team phenomenal job heartbroken win race jeff gordon running 16th four laps go took advantage cars running fuel finish third \u2013 matching best finish season \u2013 46th final career start pocono raceway thought trying get maybe 10th 12th sudden said 'you 're third think probably shocked person racetrack found gordon said race knew cars peeling n't realize many either running coming pit road teammate dale earnhardt jr. 17th four go rallied fourth-place finish 've got work harder said car n't good weekend corner lot balance issues never really cured held us n't good earlier year still top-10 top-five car barely top-five car thought good enough car win came earlier summer lost little balance nbc sports covered race television side rick allen jeff burton steve letarte call booth race dave burns mike massaro marty snider kelli stavast handled pit road television side mrn radio call race simulcast sirius xm nascar radio joe moore jeff striegle four time pocono winner rusty wallace called race booth field racing front stretch dave moody called race billboard outside turn 1 field racing turn 1 mike bagley called race billboard outside turn 2 field racing turn 2 kyle rickey called race billboard outside turn 3 field racing turn 3 woody cain glenn jarrett steve post worked pit road radio side", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 248, + "label": 8, + "text": "ProBiS:probis probis computer software allows prediction binding sites corresponding ligands given protein structure initially probis developed probis algorithm janez konc du\u0161anka jane\u017ei\u010d 2010 available probis server probis charmming server probis algorithm probis plugin name probis originates purpose software predict given protein structure binding sites corresponding ligands probis software started probis algorithm detects structurally similar sites protein surfaces local surface structure alignment using fast maximum clique algorithm probis algorithm followed probis server provides access program probis detects protein binding sites based local structural alignments two probis servers available probis server probis charmming server latter connects probis charmming servers one functional unit enables prediction protein\u2212ligand complexes allows geometry optimization interaction energy calculation probis charmming server additional functions used national institutes health usa otherwise acts regular probis server additionally probis pymol plugin probis ucsf chimera plugin made plugins connected via internet newly prepared database pre-calculated binding site comparisons allow fast prediction binding sites existing proteins protein data bank enable viewing predicted binding sites ligands poses three-dimensional graphics", + "neighbors": [ + 429, + 1138, + 1235 + ], + "mask": "Test" + }, + { + "node_id": 249, + "label": 9, + "text": "ALGOL_60:algol 60 algol 60 short algorithmic language 1960 member algol family computer programming languages followed algol 58 introduced code blocks codice_1 codice_2 pairs delimiting algol 60 first language implementing nested function definitions lexical scope gave rise many programming languages including cpl simula bcpl b pascal c. niklaus wirth based algol w algol 60 moving develop pascal algol-w intended next generation algol algol 68 committee decided design complex advanced rather cleaned simplified algol 60 official algol versions named year first published algol 68 substantially different algol 60 criticised partially general algol refers dialects algol 60 algol 60 \u2014 cobol \u2014 first languages seek standardization algol 60 used mostly research computer scientists united states europe use commercial applications hindered absence standard input/output facilities description lack interest language large computer vendors algol 60 however become standard publication algorithms profound effect future language development john backus developed backus normal form method describing programming languages specifically algol 58 revised expanded peter naur algol 60 donald knuth suggestion renamed backus\u2013naur form peter naur editor algol bulletin drawn international discussions language selected member european language design group november 1959 capacity editor algol 60 report produced result algol 60 meeting paris january 1960 following people attended meeting paris january 11 16 alan perlis gave vivid description meeting meetings exhausting interminable exhilarating one became aggravated one good ideas discarded along bad ones others nevertheless diligence persisted entire period chemistry 13 excellent language originally include recursion inserted specification last minute wishes committee algol 60 inspired many languages followed tony hoare remarked language far ahead time improvement predecessors also nearly successors scheme programming language variant lisp adopted block structure lexical scope algol also adopted wording revised report algorithmic language scheme standards documents homage algol date least 70 augmentations extensions derivations sublanguages algol 60 burroughs dialects included special system programming dialects espol newp algol 60 officially defined i/o facilities implementations defined ways rarely compatible contrast algol 68 offered extensive library transput algol 68 parlance input/output facilities algol 60 allowed two evaluation strategies parameter passing common call-by-value call-by-name call-by-name certain effects contrast call-by-reference example without specifying parameters value reference impossible develop procedure swap values two parameters actual parameters passed integer variable array indexed integer variable think passing pointer swap function every time swap referenced reevaluated say 1 2 every time swap referenced 'll return combination values 1,2 2,1 1,2 similar situation occurs random function passed actual argument call-by-name known many compiler designers interesting thunks used implement donald knuth devised man boy test separate compilers correctly implemented recursion non-local references test contains example call-by-name 35 reserved words standard burroughs large systems sub-language 71 restricted identifiers standard burroughs large systems sub-language also names intrinsic functions procedure absmax size n result subscripts k implementations differ text bold must written word 'integer including quotation marks must used implementations place integer thereby designating special keyword following example produce table using elliott 803 algol since algol 60 i/o facilities portable hello world program algol following program could still compile run algol implementation unisys a-series mainframe straightforward simplification code taken language guide university michigan-dearborn computer information science department hello world algol example program page simpler program using inline format even simpler program using display statement alternative example using elliott algol i/o follows elliott algol used different characters open-string-quote close-string-quote represented \u2018 \u2019 version elliott 803 algol a104 standard elliott 803 used 5 hole paper tape thus upper case code lacked quote characters \u00a3 uk pound sign used open quote question mark close quote special sequences placed double quotes e.g \u00a3\u00a3l produced new line teleprinter ict 1900 series algol i/o version allowed input paper tape punched card paper tape 'full mode allowed lower case output line printer note use", + "neighbors": [ + 65, + 152, + 206, + 292, + 306, + 365, + 373, + 430, + 594, + 597, + 790, + 820, + 919, + 1095, + 1221, + 1232, + 1264, + 1275, + 1311, + 1319, + 1324, + 1418, + 1430, + 1477, + 1508 + ], + "mask": "Test" + }, + { + "node_id": 250, + "label": 7, + "text": "Oracle_Enterprise_Resource_Planning_Cloud:oracle enterprise resource planning cloud oracle enterprise resource planning cloud cloud-based software application suite introduced oracle corporation 2012 oracle erp cloud manages enterprise functions including accounting financial management project management procurement oracle erp cloud end-to-end software service suite manages enterprise operations suite runs oracle technology stack oracle \u2019 cloud centers oracle erp cloud accessible public private cloud implementation supports hybrid deployment oracle supplies updates oracle erp cloud least twice annually according company \u2019 website seven different software modules make oracle erp cloud suite march 2017 oracle erp cloud received hipaa certification software suite designed support international enterprise functions includes multi-gaap multi-currency multi-language multi-subsidiary capabilities oracle erp cloud based originally oracle fusion applications oracle \u2019 enterprise resource planning software suite developed oracle fusion architecture oracle fusion middleware released 2011 june 2012 oracle cto chairman board larry ellison announced oracle erp cloud application suite part oracle cloud company \u2019 broad set cloud-based applications oracle announced preview availability oracle erp cloud oracle openworld 2012 october 2015 company reported oracle erp cloud surpassed 1,300 customers august 2 2017 oracle announced release 13 oracle erp cloud 2017 oracle ceo safra catz announced availability oracle erp cloud india assist country preparation goods services tax reforms march 2017 oracle reported oracle erp cloud grown 280 fiscal quarter 3 september 2017 reported oracle \u2019 cloud erp business grew 156 first quarter 2017-18 reached annual run rate 1.2 billion oracle erp cloud available north america south america asia emea regions oracle offers certifications software service saas specializations oracle erp cloud oracle financials cloud oracle procurement cloud oracle project portfolio management cloud oracle risk management cloud oracle openworld annual technology conference hosted oracle featured announcements updates oracle erp cloud collaborate annual technology forum hosted independent oracle users groups including international oracle users group ioug oracle applications users group oaug quest oracle community provides training oracle products including oracle erp cloud 2017 oracle erp cloud listed leader gartner \u2019 \u201c magic quadrant cloud core financial management suites midsize large global enterprises. \u201d product positioned highest completeness vision ability execute", + "neighbors": [ + 77, + 611, + 1476, + 1484 + ], + "mask": "Test" + }, + { + "node_id": 251, + "label": 9, + "text": "Guy_L._Steele_Jr.:guy l. steele jr guy lewis steele jr. born october 2 1954 american computer scientist played important role designing documenting several computer programming languages technical standards steele born missouri graduated boston latin school 1972 received bachelor arts b.a applied mathematics harvard university 1975 master degree m.s doctor philosophy ph.d. massachusetts institute technology mit computer science 1977 1980 worked assistant professor computer science carnegie mellon university compiler implementer tartan laboratories joined supercomputer company thinking machines helped define promote parallel computing version programming language named lisp named *lisp star lisp parallel version language c named c* 1994 steele joined sun microsystems invited bill joy become member java team language designed since track record writing good specifications extant languages named sun fellow 2003 steele joined oracle 2010 oracle acquired sun microsystems mit steele published two dozen papers gerald jay sussman subject language lisp implementation lambda papers one notable contributions design language scheme steele also designed original command set emacs first port tex waits published papers subjects including compilers parallel processing constraint languages one song composed published official journal association computing machinery communications acm cacm telnet song april 1984 parody behavior series pdp-10 telnet implementations written mark crispin steele served accredited technical standards committees including ecma international formerly european computer manufacturers association ecma tc39 language ecmascript editor first edition x3j11 c x3j3 fortran chairman x3j13 common lisp also member institute electrical electronics engineers ieee working group produced ieee standard language scheme ieee std 1178-1990 represented sun microsystems high performance fortran forum produced high performance fortran specification may 1993 addition specifications language java steele work sun microsystems included research parallel algorithms implementation strategies architecture software support 2005 steele began leading team researchers sun developing new language named fortress high-performance language designed obsolete fortran 1982 steele edited hacker dictionary harper row 1983 print version jargon file steele samuel p. harbison wrote c reference manual prentice-hall 1984 provide precise description language c tartan laboratories trying implement wide range systems authors participated american national standards institute ansi c standardization process several revisions book issued reflect new standard 16 march 1984 steele published common lisp language digital press 465 pages first edition original specification common lisp cltl1 served basis ansi standard steele released greatly expanded second edition 1990 1029 pages documented near-final version ansi standard steele along charles h. koelbel david b. loveman robert s. schreiber mary e. zosel wrote high performance fortran handbook mit press 1994 steele also coauthored three editions java language specification addison-wesley third ed 2005 james gosling bill joy gilad bracha steele received acm grace murray hopper award 1988 named acm fellow 1994 member national academy engineering united states america 2001 fellow american academy arts sciences 2002 received dr. dobb excellence programming award 2005 steele modern western square dancer caller mainstream c3a member tech squares member callerlab pseudonym great quux old student nickname boston latin school mit published light verse crunchly cartoons latter appeared new hacker dictionary also used initialism gls 1998 steele solved game teeko via computer showing must occur players play wisely found neither player force win steele also showed advanced teeko variant win black assuming perfect play one variant fourteen variants draws", + "neighbors": [ + 27, + 29, + 46, + 56, + 170, + 173, + 194, + 203, + 227, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 579, + 601, + 649, + 653, + 693, + 721, + 753, + 787, + 795, + 828, + 831, + 873, + 916, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1006, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1146, + 1173, + 1180, + 1207, + 1213, + 1245, + 1251, + 1264, + 1269, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1491, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 252, + "label": 2, + "text": "IOS_10:ios 10 ios 10 tenth major release ios mobile operating system developed apple inc. successor ios 9 announced company worldwide developers conference june 13 2016 released september 13 2016 succeeded ios 11 september 19 2017. ios 10 incorporates changes 3d touch lock screen new features apps messages additional emojis third-party apps extend functionality imessage maps redesigned interface additional third-party functions home app manages homekit -enabled accessories photos algorithmic search categorization media known memories siri compatible third-party app-specific requests starting workouts apps sending ims using lyft uber use payment functions reviews ios 10 mostly positive reviewers highlighted significant updates imessage siri photos 3d touch lock screen welcome changes third-party extension support imessage meant becoming platform although user interface criticized difficult understand third-party integration siri great although voice assistant criticized become smarter reviewers impressed image recognition technology photos although noting still work progress higher error rate competition 3d touch finally feels useful works almost every part os lock screen far customizable reviewers enjoyed notification bubbles could expanded see information without needing unlock phone month release ios 10 installed 54 ios devices slightly slower migration release ios 9 speculated caused early release issue may put users downloading update user adoption ios 10 steadily increased following months eventually totaling 89 active devices september 2017. ios 10 introduced apple worldwide developers conference keynote address june 13 2016 first beta release made available registered developers following keynote apple released first public beta release july 7 2016. ios 10 officially released september 13 2016. ios 10.0.1 released september 13 2016 first update ios 10 released 10.0 contained bug causing devices brick updating ios 10.0.2 released september 23 2016 update contained bug fixes specifically fixing bug temporarily disabled headphone controls lightning earpods ship iphone 7 fixing bug preventing app extensions enabled fixing unexpected crash photos app activating icloud photo library ios 10.0.3 released october 17 2016 exclusively iphone 7 iphone 7 plus models fix connectivity issues ios 10.1 released october 24 2016 new portrait camera mode iphone 7 plus transit directions japan apple maps ability replay bubble screen effects imessage well lots bug fixes ios 10.1 also features warning message launching 32-bit app says app may slow iphone ios 10.1 also allows users use imessage effects even reduce motion setting turned ios 10.1.1 released october 31 2016 fix issue health data could viewed users november 9 2016 apple released new version ios 10.1.1 available users n't yet updated previous 10.1.1 update information new update given ios 10.2 released december 12 2016 update included new tv app u.s. unifies content different video apps recommends new tv shows movies watch update also added new redesigned emoji stabilization photo grouping accuracy changes photos new love celebration messages screen effects notification support homekit-accessories well revamped sorting options design tweaks music app ios 10.2 also adds telemetry diagnostic tool apple use report battery consumption diagnosing reported issues 30 battery shutdowns iphone models ios 10.2 also includes three new wallpapers iphone 7 iphone 7 plus specifically wallpapers featured marketing phones ios 10.2.1 released january 23 2017 bug fixes security improvements december 28 2017 apple acknowledged update changed power management peak workloads avoid unexpected shutdowns iphone 6 iphone 6 plus iphone 6s iphone 6s plus iphone se customers upset update thought ploy get people upgrade new devices number people filed lawsuits feature seeking class action status ios 10.3 released march 27 2017 update introduced find airpods feature lost airpods headphones changed default file system hfs+ apfs improved performance encryption also increases usable storage device support additional siri actions including status bills payment apps scheduling ride-booking apps new apple id view settings ability developers respond reviews app store well helpful helpful review labels improved overview icloud storage usage bug fixes stability improvements users also give app ratings inside app ios 10.3 also features significant security patch fixing issue javascript exploit link would cause devices repeatedly call 9-1-1 emergency phone number update also added podcasts widget made app transitions smoother extended support wi-fi calling carriers carplay update added quick-access multitasking screen three recently used apps added functionality maps app find electric vehicle charging stations ios 10.3.1 released april 3 2017 bug fixes security improvements including fix wi-fi vulnerability discovered google project zero team security researchers ios 10.3.2 released may 15 2017 bug fixes security improvements ios 10.3.3 released july 19 2017 new wallpapers 12.9-inch ipad pro along bug fixes security improvements including fix wi-fi vulnerability devices searching signal open hackers ios 10.3.4 released july 22 2019 address issue could impact gps location performance could cause system date time incorrect available exclusively iphone 5 cellular model ipad 4th generation control center redesigned split three pages one general settings quick toggles airplane mode orientation lock one audio controls one controlling homekit internet things appliances used 3d touch capabilities added several toggles apps show widget home-screen icon accessed 3d touch default apps included ios devices hidden home screen 're-downloaded app store upon sandbox respective app removed contains user data settings caches app also hidden places today view settings app share sheets user interact app within another app feature first hinted interview september 2015 apple ceo tim cook stated apple looking allowing customers remove unused stock apps ios 10 allows users prioritize certain app downloads using 3d touch quicktype virtual keyboards provide word-completion capabilities predict answers questions suggest relevant information based location calendar availability contacts define feature previous ios versions replaced look expands use providing definitions retrieving information locations web browsing history downloaded apps suggested websites quicktype keyboard allow user type multiple languages user selects desired languages dictionary keyboard settings menus user ability change keyboard settings specifically physical keyboards autocorrect auto-capitalization slide unlock mechanism lock screen removed favor pressing home button similar feature apple watch raise wake wakes device user lifts function requires device m9 motion coprocessor newer today view notification center replaced widgets accessible swiping left right ipad widgets displayed two-column layout notification center longer today view notifications larger expand display information unread notifications cleared using 3d touch apps need updated frequently notifications update live notification center contains spotlight search bar new magnifier setting added allows users triple-click home button ios open camera app magnification also new color filters settings compensate user color blindness color filters options include grayscale red/green filter protanopia green/red filter deuteranopia blue/yellow filter tritanopia messages application users turn low quality image mode saves poor iphone stuffing full images based new animated stickers gifs sent imessage wi-fi menu settings shows warnings security network network connected internet shown user small subtext wi-fi network name raise wake enabled disabled settings ios 10.2 preserve settings feature allows users set camera app launch certain settings default options include launching video square mode rather photo mode preserving last used filter preserving capture settings live photos music added apple music one device automatically downloaded devices using automatic downloads setting settings allows user option routes maps app avoid toll roads and/or highways ios 10.3 settings updated feature information relating user apple id account main menu features section allows users see old unmaintained apps wo n't work future versions ios additionally users see breakdown icloud storage user enable setting siri announce calling options always headphones car headphones never ios 10 allows users rearrange remove apps carplay display settings ios 10.3 maps carplay added electric vehicle charging stations part overall continuity features introduced ios 8 new universal clipboard feature allows users mac personal computers running macos sierra ios devices running ios 10 easily copy material different devices icloud part continuity new continuity keyboard feature allows users type text iphone text appear apple tv running tvos 10 avoiding siri remote text input ios 10 features new sound effects locking device keyboard clicks whenever device detects liquid lightning port notice warns user disconnect lightning cable allow port dry ios 10 also allows tty calls made without additional hardware ios 10 allows users find apple watch using find iphone spotlight search contents users icloud drive storage reported user base 10 1 kilobyte equals 1000 bytes format instead base 2 used older ios versions ios 10 allows developers buy advertisement spots app store users search content also adds back categories section replaces explore section introduced ios 8 ios 10.3 developers able respond user reviews helpful helpful review labels help surface relevant customer reviews ios 10 users change day week calendar starts well alert settings birthdays events calendar type gregorian chinese hebrew islamic music longer stop playing camera app launched unless users decide record video take live photo.live photos taken filters previously available still photos ios 10.1 iphone 7 plus received new depth field portrait camera mode using wide-angle telephoto lenses phone create shallow depth field portrait photos blurred backgrounds clock app dark theme new bedtime feature reminds user go bed get desired amount sleep also new stopwatch face accessed swiping left contacts app ios 10 allows users set default phone numbers email addresses contacts multiple numbers addresses app also allows user add remove contacts favorite contacts list home new app allows users manage appliances compatible homekit apple api home automation app users add compatible homekit accessories locks lights thermostats directly control appliances app scenes panel allows many devices controlled fit mood setting geo-fencing activates scheduled sequences following user location mail app allows users unsubscribe mailing lists unsubscribe button users dismiss message unsubscribe particular mailing list tapping x top right corner preventing mail app displaying unsubscribe button mailing list later apple added back support html5 video mail previously stopped ios 8 mail filter messages either unread/read categories ios 10 also changes email threading works placing oldest email top default option settings lets users revert previous threading system recent message top additionally new threaded conversations allow users tap message see scrollable stream messages inside thread maps redesigned updated additional features including scanning calendar events locations learning user typical actions redesigned driving view marker automatically placed indicate user parked car marker also tell user last parked car notes field allows user enter information parking garage number app app helps users find nearest gas station fast-food restaurant coffee shop swiping bottom screen maps also estimates long detour take users add third-party extensions maps app enable additional functionality restaurant-booking extension help user reserve table inside maps app users pan zoom navigation mode app displays current temperature weather conditions bottom right corner ios 10.3 app also allows user see weather forecast using 3d touch current temperature functionality allows users see hour-by-hour breakdown area looking messages app incorporates app store lets users download third-party imessage apps accessed within imessage conversations users use send stickers play games send rich content media previews recipients messages app store three navigation fields featured categories manage app updated include many visual effects chat bubbles example sent loud gentle animation recipient sees upon receiving invisible ink effect obscures message recipient swipes across full-screen effects like balloons confetti fireworks sent also support interactions similar apple watch sending quick sketches recording sending user heartbeat order use screen bubble effects reduce motion setting needs turned messages allows users send handwritten notes done turning device landscape mode iphones landscape portrait ipad users tapping handwriting squiggle messages app automatically saves recently used notes make easier send handwritten message deleted way app deleted holding message pressing delete message also saved picture file new emojis added well additional features related emoji emojis appear 3x bigger messages sent three emojis text keyboard predict emojis use emoji replacement feature attempts match words messages replace emojis meaning since game center app removed messages handles actions inviting friends game read receipts turned individual contacts rather contacts music app redesigned emphasis placed usability section reorganized playlist offering daily music recommendations new tab renamed browse new tab music downloaded called downloaded music added lyrics viewable songs in-app ios 10 search tab includes recent trending searches optimized storage option removes downloaded music user n't played news app taking cues music layout redesigned incorporate bold headings newspaper-esque layout redesigned tab news also features support subscriptions provides notifications breaking news notes collaboration feature allows users share note collaborate users add remove text note users tap round yellow badge person plus sign send invitations text email link apple added deep learning capabilities sorting searching photos app new memories feature automatically recognize compile related photos create short shareable music videos local facial recognition functionality added bundle together pictures certain people ios 10 allows users add doodles text photo using new markup feature user edits live photo using markup image turned still image live photos edited photos app allows users trim clip change still frame add filter add digital image stabilization live photo buttery smooth app also upgraded auto-enhance feature adds brilliance slider phone app transcribe received visual voicemails siri announce name phone number incoming calls system mark suspected spam callers call screen upon incoming calls contacts enabled emergency bypass phone always make sounds vibrations receiving notifications chosen contacts even disturb mode favorites screen users customize action favorited contact enable click including call facetime sms email users save voicemails airdrop imessage icloud drive apps share menu apple pay available safari app limit many tabs users open time supported ipads safari unique split view viewing two safari browser tabs 50/50 mode next users also search keywords specific tabs close tabs single click reopen recently closed tabs long-pressing plus icon users also search items bookmarks reading list included ios 10.2 update tv app app available united states offers simple unified experience content different video apps long service supports feature new app replaces videos app found previous ios versions ios 10 gives third-party developers access apis three major ios system apps services siri imessage maps developers ios 10 allows third-party camera apps capture raw image format pictures support shooting photos adobe dng raw format limited devices least 12mp camera third-party app supports apple enable feature native camera app ios 10 allows voip apps functionality interface phone facetime apps use callkit api native support vpn protocol pptp removed apple recommends alternatives considers secure options group notifications app notification center customize order notifications removed game center app removed case macos sierra review verge dieter bohn wrote new features introduced ios 10 evolution design interaction ideas apple working couple years wrote imessage becoming platform although liked extensions mean access information apps without needing open respective apps wrote new imessage interface difficult understand use third-party apps stickers crazy confetti effects emoji place nightmare although finishing maybe wonderland nightmare call regarding third-party support siri called great noting limited class apps calls messaging payments photos ride-sharing apps carplay systems workouts sometimes button press required complete process beyond app integrations criticized siri writing siri n't seem gotten whole lot smarter remember bohn enjoyed new machine learning technology present photos app writing impressed apple image recognition technology noted done locally device criticize error rate compares technology google photos step ahead bohn liked new designs music maps apps saying redesigns better bohn particularly enjoyed new lock screen highlighted notification bubbles 3d touch-ed access information without needing unlock phone small bits new features liked included deletable apps upgraded widgets 3d touch-ing home screen icon breaking news notifications apple news overall bohn referred ios 10 still walled garden doors engadget devindra hardawar wrote ios 10 apple basically polishing pearl hardawar noted major changes release focus features rather visual interface wrote lock screen far customizable praised new features added 3d touch writing finally feels useful likes 3d touch works almost every part os regard imessage wrote new features particularly useful including invisible ink obscures text conversation others might looking criticized user interface writing needs work memories feature new photos app usually turned well wrote 're still clearly work progress hardawar praised new apple music app added really anything better last iteration also liked lyrics support wrote siri third-party support actually starting get useful run accuracy issues finished writing although ios 10 add features seen google android operating system mobile industry shamelessly getting inspired competition summary states ios 10 collection useful changes already solid os october 2016 month initial release 54 ios devices running ios 10 slightly slower migration release ios 9 preceding year result speculated macrumors tim hardwick caused early release issue disabled devices may put users downloading update user adoption increased 76 active devices january 2017 79 february 2017 86 june 2017 87 july 2017 89 september 2017 release ios 11 initial public release ios 10 september 13 2016 saw many iphones ipads temporarily disabled bricked over-the-air update requiring bricked devices connected mac pc itunes order retry update restore device factory settings apple quickly released ios 10.0.1 issued statement experienced brief issue software update process affecting small number users first hour availability problem quickly resolved apologize customers september 2016 discovered encryption local ios backups made itunes weaker ios 10 devices devices running ios 9 russian software firm elcomsoft discovered ios 10 backup process skips several security checks making approximately 2,500 times faster try passwords enabling 6 million password tries per second compared 2,400 password tries per second process elcomsoft used ios 9 firm stated impact severe apple acknowledged problem said planned issue security update also stated icloud backups affected ios 10.1 update subsequently fixed issue next web juan buis wrote late november 2016 complaints shared apple support forums various iphone models turning battery falls certain percentage blames ios 10.1.1 update wrote original post support forums explains phone dies \u2019 30 percent charge left many others since replied \u2019 experiencing ios 10.2 released december 2016 adds telemetry diagnostic tool apple use report battery consumption diagnosing reported issues 30 battery shutdowns february 2017 apple released statement techcrunch saying ios 10.2.1 update released january 23 reduced occurrence battery shutdowns 80 iphone 6s devices 70 iphone 6 devices full statement read ios 10.2.1 apple made improvements reduce occurrences unexpected shutdowns small number users experiencing iphone ios 10.2.1 already 50 active ios devices upgraded diagnostic data 've received upgraders shows small percentage users experiencing issue 're seeing 80 reduction iphone 6s 70 reduction iphone 6 devices unexpectedly shutting also added ability phone restart without needing connect power user still encounters unexpected shutdown important note unexpected shutdowns safety issue understand inconvenience wanted fix issue quickly possible customer issues device contact applecare release apple dropped support devices either a5 a5x chip iphone 4s ipad 2 ipad 3rd generation ipad mini 1st generation ipod touch 5th generation", + "neighbors": [ + 71, + 75, + 99, + 130, + 228, + 269, + 293, + 337, + 352, + 356, + 394, + 403, + 475, + 477, + 489, + 509, + 511, + 528, + 596, + 607, + 610, + 625, + 634, + 696, + 732, + 754, + 797, + 813, + 858, + 877, + 917, + 927, + 941, + 945, + 956, + 961, + 972, + 1001, + 1140, + 1178, + 1237, + 1246, + 1292, + 1305, + 1334, + 1339, + 1373, + 1445, + 1488, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 253, + "label": 2, + "text": "Nokia_N75:nokia n75 nokia n75 smartphone nokia uses series 60 3rd edition symbian os mobility carrier n75 united states made specifically north american 3g market supporting wcdma 850/1900 frequencies however also available countries uk cnet gave 3/5 liking call quality display disliking battery life camera mobile tech review gave 4/5 pcmag gave 2.5/5 similar praise criticism", + "neighbors": [ + 3, + 21, + 162, + 238, + 264, + 270, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1486, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 254, + "label": 4, + "text": "Trusted_Information_Systems:trusted information systems trusted information systems tis computer security research development company 1980s 1990s performing computer communications information security research organizations nsa darpa arl afrl spawar others tis founded 1983 nsa veteran steve walker various times employed notable information security experts including david elliott bell martha branstad john pescatore marv schaefer steve crocker marcus ranum wei xu john williams steve lipner carl ellison tis headquartered glenwood maryland surprisingly rural location company started walker basement shady lane glenwood md company grew rather move baltimore washington d.c. suburbs small office building constructed land next walker new home route 97 tis projects included following tis operating system work directly affected bsd/os gauntlet firewall ipsec based well linux freebsd hp ux sun os darwin others company went public 1996 soon afterwards attempted acquire pgp inc. instead acquired 1998 network associates nai later became mcafee already bought pgp inc. 1997 security research organization became nai labs gauntlet engineering development organization folded network associates engineering development nai labs went couple branding changes complemented network associates branding efforts 2001 name changed network associates laboratories better match corporate identity 2002-2003 major branding initiative network associates culminating selection flag brand mcafee result security research organization became mcafee research 2003 sparta inc. employee-owned company acquired network security branch mcafee research 2005 sparta acquired remaining branches mcafee research organized security research division srd information systems security operation isso 2008 cobham plc british aerospace company acquired sparta organizational changes srd isso affect security research separate path tis primary commercial product gauntlet firewall acquired 1999 mcafee secure computing corporation scc used one tis major competitors time mcafee n't interested firewall vendor code base integrated secure computing firewall product branded sidewinder firewall returned mcafee secure computing acquired 2008 re-branded mcafee enterprise firewall end product line came 2013 following mcafee acquisition another major firewall vendor finland-based stonesoft mcafee announced october 2013 intention migrate existing installed base firewalls stonesoft stonegate", + "neighbors": [ + 120, + 134, + 195, + 295, + 379, + 425, + 455, + 542, + 957, + 1138, + 1330 + ], + "mask": "Test" + }, + { + "node_id": 255, + "label": 4, + "text": "PathPing:pathping codice_1 command command-line network utility supplied windows 2000 beyond combines functionality ping tracert used locate spots network latency network loss command provides details path two hosts ping-like statistics node path based samples taken time period depending many nodes start end host advantages codice_1 codice_3 codice_4 node pinged result single command behavior nodes studied extended time period rather default ping sample four messages default traceroute single route trace disadvantage takes total 25 seconds per hop show ping statistics command-syntax options pathping wikipedia.org -q 10", + "neighbors": [ + 295, + 377, + 615, + 764, + 904, + 920, + 961, + 1030, + 1042, + 1050, + 1110, + 1138, + 1243, + 1370, + 1461, + 1517, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 256, + "label": 0, + "text": "Filtered-popping_recursive_transition_network:filtered-popping recursive transition network filtered-popping recursive transition network fprtn simply filtered-popping network fpn recursive transition network rtn extended map states keys returning subroutine jump requires acceptor return states mapped key rtns finite-state machines seen finite-state automata extended stack return states well consuming transitions formula_1-transitions rtns may define call transitions transitions perform subroutine jump pushing transition target state onto stack bringing machine called state time acceptor state reached return state top stack popped provided stack empty machine brought state throughout article refer filtered-popping recursive transition networks fpns though acronym ambiguous e.g fuzzy petri nets filtered-popping networks fprtns unambiguous alternatives fpn structure formula_2 transitions represent possibility bringing fpn source state formula_11 target state formula_12 possibly performing additional action depending action distinguish following types explicitly -defined transitions behaviour call transitions governed two kinds implicitly -defined transitions push transitions initialize subroutine jumps pop transitions equivalent return statements natural language text enriched meta-information application rtn output instance rtn inserting xml tags used transforming plain text structured xml document rtn output representing natural language grammar would delimit add syntactic structure text sentence see parsing rtns output could simply mark text segments containing relevant information see information extraction application rtn output representing ambiguous grammar results set possible translations interpretations input computing set exponential worst-case cost even earley parser rtns output due cases number translations increases exponentially w.r.t input length instance number interpretations natural language sentence increases exponentially w.r.t number unresolved prepositional phrase attachments fpns serve compact representation set translations allowing compute cubic time means earley-like parser fpn states correspond execution states see instruction steps earley-parser rtns without output fpn transitions correspond possible translations input symbols formula_30 map resulting fpn gives correspondence represented output segments recognized input segments given recognized input sequence formula_31 fpn path formula_32 starting state formula_33 ending state formula_34 formula_32 represents possible translation input segment formula_36 filtered-popping feature required order avoid fpn paths represent translations disconnected overlapping input segments fpn call may contain several translation paths called state acceptor state input segments correspond share start point necessarily length return states corresponding input point acceptor state finishing call valid return states", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 257, + "label": 4, + "text": "China_Internet_Network_Information_Center:china internet network information center china internet network information center cnnic administrative agency responsible internet affairs ministry industry information technology people republic china based zhongguancun high tech district beijing founded june 3 1997 government department disguise non-profit organization cnnic responsible operating administering china \u2019 domain name registry cnnic manages .cn country code top level domain chinese domain name system internationalized domain names contain chinese characters june 2015 total number chinese domain names 22,310,000 january 2009 cnnic opens cn domain registered businesses requires supporting documentations domain registration business license personal id suspended overseas registrars even domestic registrants cnnic denies mandates existing personal domain names transferred businesses trend micro suggests move still enough stop modern security threats .cn domain cnnic allocates internet protocol ip addresses numbers domestic isps users cnnic national internet registry nir acknowledged asia-pacific network information center apnic late 2004 cnnic launched \u201c ip allocation alliance \u201d simplified procedures obtaining ip addresses cnnic responsible creation maintenance state top-level network catalog database database provides information internet users web addresses domain names numbers cnnic conducts technical research undertakes state technical projects based administrative practical network technology experience cnnic conducted continues conduct surveys internet information resources cnnic maintains statistics topics internet bandwidth china domain name registrations internet development china national network information center nic cnnic maintains cooperative relationships international internet communities works closely nics countries cnnic serves secretariat internet society china \u2019 internet policy resource committee policy resource committee charge tasks providing policy legislation oriented suggestions promote growth china \u2019 internet facilitating development application internet resources relevant technologies actively participating research work domestic internet development administration policies july 2008 broad alliance chinese online commerce stakeholders including cnnic major chinese commercial banks web hosting companies founded anti-phishing alliance china apac order tackle phishing activities abuse .cn sub-domain names cnnic also functions secretariat apac october 2009 alliance announced cooperation two new members netcraft maxthon help alliance process verify various phishing reports add confirmed phishing urls netcraft phishing site feed maxthon phishing blacklist 2015 google discovered cnnic issued intermediate ca certificate egypt-based firm used cnnic keys impersonate google domains google responded removing cnnic root certificate certificate store google chrome google products mozilla responded incident stating mozilla ca team believes cnnic \u2019 actions amount egregious behaviour ... cnnic \u2019 decision violate certification practice statement especially serious raises concerns go beyond immediate scope misissued intermediate certificate public discussion ... planning change firefox \u2019 certificate validation code refuses trust certificate issued cnnic root notbefore date 1 april 2015", + "neighbors": [ + 14, + 17, + 88, + 162, + 429, + 442, + 771, + 852, + 1266 + ], + "mask": "Test" + }, + { + "node_id": 258, + "label": 5, + "text": "Pale_Moon_(web_browser):pale moon web browser pale moon open-source web browser emphasis customizability motto browser way official releases microsoft windows linux unofficial build macos contributed builds various platforms pale moon fork firefox substantial divergence main differences user interface add-on support running single-process mode pale moon retains highly customizable user interface firefox version 4\u201328 era also continues support types add-ons longer supported firefox pale moon diverged firefox number ways version 26.5 final official release support windows xp version 27.9 final official release support windows vista end xp support quickly followed pale moon getting least two forks take recent pale moon code recompile xp new moon roytam1 mypal feodor2 official releases support older processors without sse2 instruction set however contributed build linux available supports older processors pale moon source code released mozilla public license 2.0 except parts relating branding ensure quality redistribution officially branded pale moon binaries permissible specific circumstances name logo trademarked project founder used without prior permission m.c straver project founder lead developer straver first official release pale moon 2009 rebuild firefox 3.5.2 tweaked compiler settings eventually scope project grew version 24 became true fork firefox 24 esr starting version 25 pale moon uses completely independent versioning scheme pale moon 27 major re-fork core browser code firefox 38 esr added http/2 directx 11 mse/dash javascript es6 capabilities add-on support remained almost entirely unchanged slight reduction jetpack compatibility 2017 team behind pale moon began unified xul platform uxp project uxp actively maintained fork historical fork point mozilla code firefox 52 esr significant modifications codebase updated web technology support creating number xul-based applications demonstrate develop refine platform straver used create new browser basilisk pale moon 28 released august 2018 first version built uxp thereby providing improved support web standards video pale moon android distinct development effort longer maintained first released 2014 straver announced following year would likely abandoned due lack community involvement final release 25.9.6 straver remarked role benchmark tests questionable stating ca n't used draw hard regularly even conclusions plain simple indication nothing serve well compare closely related siblings e.g firefox iceweasel different builds exact browser get relative performance difference two limited subset actually tested far goes br questionable role confirmed leading technology experts example google announced retiring octane benchmark 2017 2013 pale moon bit slower firefox clubcompy real-world benchmark browsers respectively scoring 8,168 9,344 points possible 50,000 2016 browser comparison test ghacks pale moon version 25 smallest memory footprint opening 10 different websites separate tabs however report pale moon scored bottom mozilla kraken google octane 32-bit robohornet tests second-to-last 64-bit robohornet benchmarks whilst browsers hung tests pale moon hung jetstream javascript benchmark current uxp versions pale moon score comparatively browsers benchmarks showing e.g significant difference sunspider benchmark compared firefox quantum", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 258, + 270, + 277, + 306, + 312, + 427, + 435, + 491, + 509, + 530, + 531, + 582, + 585, + 623, + 627, + 646, + 653, + 668, + 684, + 686, + 713, + 734, + 815, + 830, + 862, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1068, + 1084, + 1120, + 1132, + 1138, + 1166, + 1189, + 1190, + 1195, + 1210, + 1228, + 1251, + 1264, + 1280, + 1298, + 1302, + 1331, + 1339, + 1376, + 1378, + 1395, + 1407, + 1408, + 1423, + 1502, + 1528, + 1536, + 1539, + 1550, + 1563, + 1569, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 259, + "label": 7, + "text": "Aplos_Software:aplos software aplos software privately held company specializes software service nonprofit organizations primary focus simple software manage essential nonprofit tasks fund accounting nonprofit tax preparation donor management small mid-sized large non-profit organizations aplos software founded 2009 fresno california dan kelly tim goetz certified public accountant tim goetz previously served executive pastor church helped found two nonprofits could n't find low-cost fund accounting solution wanted nonprofits joined fresno-based investor shared vision serve nonprofit sector simple affordable software founded aplos software aplos software focused software simplifying primary back office tasks required manage nonprofit private foundation foundation nonprofit charitable organization church nonprofit fund accounting differs business accounting often necessary track restricted unrestricted funds separately often occurs donor grant specifies organization must use funds specific purpose accounting software must track funds used much available aplos first launched online fund accounting software aplos accounting 2011 popular competitive accounting product small mid-sized nonprofits quickbooks october 2012 aplos software launched aplos oversight online software provides administrator accountant real-time access accounting multiple organizations summer 2012 aplos software approved irs efile provider submit irs tax forms behalf tax-exempt organizations october 2012 launched aplos e-file tax preparation filing software irs form 990-n. irs form 990-n annual electronic irs filing tax-exempt organizations less 50,000 annual gross receipts 2013 aplos added tax preparation e-file software irs form 990-ez required schedules aplos e-file irs form 990-ez short form full form 990 irs tax forms available organizations 200,000 gross receipts 500,000 assets aplos software also focused expanding fundraising donation tracking aspects software since 2012 make successful vertical market nonprofits launched contributions management module 2012 tracked donations within aplos accounting created contribution statements annual giving receipts required irs july 2013 began offering donor management module may 2017 expanded module launch stand-alone product aplos donor management according chronicle philanthropy nonprofits increasingly creating initiatives accept donations online growth online giving outpaced traditional methods 2012 keep pace growing popularity requests customers online giving platform aplos software expanded fundraising functionality january 2014 partnering wepay online payment portal add ability nonprofits accept online donations", + "neighbors": [ + 77, + 157, + 1476 + ], + "mask": "Test" + }, + { + "node_id": 260, + "label": 4, + "text": "Random_number_generator_attack:random number generator attack security cryptographic systems depends secret data known authorized persons unknown unpredictable others achieve unpredictability randomization typically employed modern cryptographic protocols often require frequent generation random quantities cryptographic attacks subvert exploit weaknesses process known random number generator attacks high quality random number generation rng process almost always required security lack quality generally provides attack vulnerabilities leads lack security even complete compromise cryptographic systems rng process particularly attractive attackers typically single isolated hardware software component easy locate attacker substitute pseudo-random bits generated way predict security totally compromised yet generally undetectable upstream test bits furthermore attacks require single access system compromised data need sent back contrast say computer virus steals keys e-mails drop point humans generally poorly generating random quantities magicians professional gamblers con artists depend predictability human behavior world war ii german code clerks instructed select three letters random initial rotor setting enigma machine message instead chose predictable values like girlfriend initials greatly aiding allied breaking encryption systems another example often predictable ways computer users choose passwords see password cracking nevertheless specific case playing mixed strategy games use human gameplay entropy randomness generation studied ran halprin moni naor components cryptosystem software random number generator designed resist certain attacks attacks possible rng include number attacks hardware random number generators possible including trying capture radio-frequency emissions computer obtaining hard drive interrupt times motor noise example trying feed controlled signals supposedly random source turning lights lava lamp feeding strong known signal sound card subverted random numbers created using cryptographically secure pseudorandom number generator seed value known attacker concealed software relatively short say 24 40 bit portion seed truly random prevent tell-tale repetitions long enough prevent attacker recovering say randomly produced key random numbers typically go several layers hardware software used bits may generated peripheral device sent serial cable collected operating system utility retrieved system call subverted bits substituted point process little likelihood detection hardware circuit produce subverted bits built integrated circuit millimeters square sophisticated hardware random number generator subverted placing chip anywhere upstream source randomness digitized say output driver chip even cable connecting rng computer subversion chip include clock limit start operation time unit first turned run acceptance tests contain radio receiver on/off control could installed manufacturer behest national signals intelligence service added later anyone physical access cpu chips built-in hardware random number generators replaced compatible chips subverted rng chips firmware designing secure random number generator requires least high level care designing elements cryptographic system early versions netscape secure socket layer ssl encryption protocol used pseudo-random quantities derived prng seeded three variable values time day process id parent process id quantities often relatively predictable little entropy less random version ssl found insecure result problem reported netscape 1994 phillip hallam-baker researcher cern web team fixed prior release problem running code discovered 1995 ian goldberg david wagner reverse engineer object code netscape refused reveal details random number generation security obscurity rng fixed later releases version 2 higher robust i.e. random higher entropy attacker perspective seeding microsoft uses unpublished algorithm generate random values windows operating system random quantities made available users via cryptgenrandom utility november 2007 leo dorrendorf et al hebrew university jerusalem university haifa published paper titled cryptanalysis random number generator windows operating system paper presented serious weaknesses microsoft approach time paper conclusions based disassembly code windows 2000 according microsoft applied windows xp well microsoft stated problems described paper addressed subsequent releases windows use different rng implementation u.s. national institute standards technology published collection deterministic random bit generators recommends nist special publication 800-90 one generators dual_ec_drbg favored national security agency dual_ec_drbg uses elliptic curve technology includes set recommended constants august 2007 dan shumow niels ferguson microsoft showed constants could constructed way create kleptographic backdoor algorithm september 2013 new york times wrote n.s.a inserted back door 2006 standard adopted n.i.s.t ... called dual ec drbg standard thereby revealing nsa carried malware attack american people december 2013 reuters reported documents released edward snowden indicated nsa paid rsa security 10 million make dual_ec_drbg default encryption software raised concerns algorithm might contain backdoor nsa due concerns 2014 nist withdrew dual ec drbg draft guidance random number generators recommending current users dual_ec_drbg transition one three remaining approved algorithms quickly possible crypto-1 cryptosystem developed nxp use mifare chips system proprietary originally algorithm published upon reverse engineering chip researchers university virginia chaos computer club found attack crypto-1 exploiting poorly initialized random number generator may 2008 security researcher luciano bello revealed discovery changes made 2006 random number generator version openssl package distributed debian gnu/linux debian-based distributions ubuntu dramatically reduced entropy generated values made variety security keys vulnerable attack security weakness caused changes made openssl code debian developer response compiler warnings apparently redundant code caused massive worldwide regeneration keys despite attention issue got could assumed many old keys still use key types affected include ssh keys openvpn keys dnssec keys key material use x.509 certificates session keys used ssl/tls connections keys generated gnupg gnutls affected programs used different methods generate random numbers keys generated non-debian-based linux distributions also unaffected weak-key-generation vulnerability promptly patched reported services still using keys generated old code remain vulnerable number software packages contain checks weak key blacklist attempt prevent use remaining weak keys researchers continue find weak key implementations december 2010 group calling fail0verflow announced recovery elliptic curve digital signature algorithm ecdsa private key used sony sign software playstation 3 game console attack made possible sony failed generate new random nonce signature analysis comparing millions rsa public keys gathered internet announced 2012 lenstra hughes augier bos kleinjung wachter able factor 0.2 keys using euclid algorithm exploited weakness unique cryptosystems based integer factorization one public key another chance simple computation factors n n \u2032 totally compromising keys nadia heninger part group similar experiment said bad keys occurred almost entirely embedded applications explains one-shared-prime problem uncovered two groups results situations pseudorandom number generator poorly seeded initially reseeded generation first second primes august 2013 revealed bugs java class securerandom could generate collisions k nonce values used ecdsa implementations bitcoin android occurred private key could recovered turn allowing stealing bitcoins containing wallet", + "neighbors": [ + 11, + 88, + 172, + 235, + 261, + 270, + 317, + 319, + 333, + 533, + 539, + 554, + 826, + 961, + 1003, + 1089, + 1090, + 1240, + 1331, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 261, + "label": 4, + "text": "DROWN_attack:drown attack drown decrypting rsa obsolete weakened encryption attack cross-protocol security bug attacks servers supporting modern tls protocol suites using support obsolete insecure ssl v2 protocol leverage attack connections using up-to-date protocols would otherwise secure drown affect types servers offer services encrypted tls yet still support sslv2 provided share public key credentials two protocols additionally public key certificate used different server supports sslv2 tls server also vulnerable due sslv2 server leaking key information used tls server full details drown announced march 2016 along patch disables sslv2 openssl vulnerability assigned id patch alone sufficient mitigate attack certificate found another sslv2 host viable countermeasure disable sslv2 servers researchers estimated 33 https sites affected vulnerability march 1 2016 drown acronym decrypting rsa obsolete weakened encryption exploits vulnerability combination protocols used configuration server rather specific implementation error according discoverers exploit fixed making changes client software web browsers exploit includes chosen-ciphertext attack use sslv2 server bleichenbacher oracle proof-of-concept attack demonstrated multi-gpu configurations commercial cloud computing could perform part codebreaking calculations cost around 18,000 gpu setup per-attack cost 400 cloud successful attack provide session key captured tls handshake investigators described attack general drown attack also found specific weakness openssl implementation sslv2 allowed called special drown attack vastly reduced effort required break encryption making real-time man-in-the-middle attacks possible required modest computing resources original reporters bug security researchers nimrod aviram sebastian schinzel protect drown server operators need ensure private keys used anywhere server software allows sslv2 connections includes web servers smtp servers imap pop servers software supports ssl/tls openssl group released security advisory set patches intended mitigate vulnerability removing support obsolete protocols ciphers however server certificate used servers support sslv2 still vulnerable patched servers numerous sources recommended vulnerability patched soon possible site operators", + "neighbors": [ + 43, + 88, + 91, + 141, + 158, + 172, + 198, + 232, + 235, + 260, + 261, + 281, + 293, + 319, + 325, + 376, + 414, + 418, + 533, + 539, + 542, + 550, + 554, + 577, + 588, + 600, + 604, + 611, + 613, + 621, + 624, + 665, + 675, + 692, + 708, + 750, + 783, + 800, + 818, + 826, + 915, + 1003, + 1043, + 1063, + 1089, + 1162, + 1186, + 1240, + 1270, + 1293, + 1327, + 1331, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1452, + 1467, + 1475, + 1534, + 1543, + 1573, + 1576, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 262, + "label": 2, + "text": "Microsoft_Transaction_Server:microsoft transaction server microsoft transaction server mts software provided services component object model com software components make easier create large distributed applications major services provided mts automated transaction management instance management just-in-time activation role-based security mts considered first major software implement aspect-oriented programming mts first offered windows nt 4.0 option pack windows 2000 mts enhanced better integrated operating system com renamed com+ com+ added object pooling loosely-coupled events user-defined simple transactions compensating resource managers features mts com+ still provided windows server 2003 windows server 2008 microsoft .net framework provides wrapper com+ enterpriseservices namespace windows communication foundation wcf provides way calling com+ applications web services however com+ based com microsoft strategic software architecture web services .net com pure .net-based alternatives many features provided com+ long term likely com+ phased basic mts architecture comprises com components run control mts executive called mts components com+ referred com+ applications mts components in-process dlls mts components deployed run mts executive manages com components object implementing iclassfactory interface serves factory object create new instances components mts inserts factory wrapper object object wrapper actual mts object client interposing wrappers called interception whenever client makes call mts component wrappers factory object intercept call inject instance-management algorithm called just-in-time activation jita call wrapper makes call actual mts component interception considered difficult time due lack extensible metadata addition based information component deployment properties transaction logic security checks also take place wrapper objects every mts-hosted object also exists context object implements iobjectcontext interface context object maintains specific information object transactional information security information deployment information methods mts component call context object iobjectcontext interface mts create actual middle-tier mts object call client reaches container since object running time use lot system resources even though object wrapper skeleton object persist soon call comes client mts wrapper process activates instance management algorithm called jita actual mts object created time service request wrapper request serviced reply sent back client component either calls setcomplete /setabort transaction ends client calls release reference object actual mts object destroyed short mts uses stateless component model generally client requests services typical mts component following sequence occurs server thus possible implement high-latency resources asynchronous resource pools take advantage stateless jit activation afforded middleware server", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 503, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1159, + 1212, + 1231, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 263, + "label": 8, + "text": "Web_Bot:web bot web bot internet bot computer program whose developers claim able predict future events tracking keywords entered internet developed 1997 originally predict stock market trends creator web bot project clif high along associate george ure keep technology algorithms largely secret sell predictions via website internet bots monitor news articles blogs forums forms internet chatter words lexicon assigned numeric values emotional quantifiers duration impact immediacy intensity others lexicon dynamic changes according shifts emotional tension humans communicate changes using internet 2008 300,000 keywords lexicon along emotional context fed computer-generated modelspace operators web bot interpret bot results make report called alta report available website paying subscribers alta stands asymmetric language trend analysis many believe predictions pseudoscientific vague meaningful despite creators made many claims fact reports predicted important events history channel discussed web bot special doomsday 2012 shows feature predictions end world nostradamus effect globe mail journalist noted tom chivers daily telegraph notes three criticisms project", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 264, + "label": 2, + "text": "Nokia_N9:nokia n9 nokia n9 codename lankku smartphone developed nokia running linux-based meego harmattan mobile operating system announced june 2011 released september first device nokia meego partly company alliance microsoft announced year initially released three colors black cyan magenta white version announced nokia world 2011 despite limited release n9 received widespread critical acclaim describing nokia finest device date praised software hardware including meego operating system buttonless 'swipe user interface high-end features design would form basis windows phone-powered nokia lumia 800 later year successor nokia n900 internally known n9-00 scheduled released late 2010 approximately one year n900 launched pictures prototype leaked august 2010 showed industrial design 4-row keyboard software engineer working nokia device division cited n9-00 product number public bug tracker qt open source application development framework used meego would later known n950 design dropped nokia started working n9-01 codenamed lankku new variant without keyboard nokia planned 2010 make meego flagship smartphone platform replacing symbian whose n8 flagship launched year thus effectively n9 originally meant flagship device company 11 february 2011 nokia partnered microsoft use windows phone 7 flagship operating system replace symbian meego also sidelined nokia ceo stephen elop promised still ship one meego device year would end n9 nokia n9 announced 21 june 2011 nokia connection event singapore time phone presumed become available public september 2011 users get notified via e-mail availability n9 country webpage nokia online store since nokia closed nokia online shop many countries including poland germany netherlands france italy spain united kingdom united states 30 june 2011 availability countries hands retailers operators elop restated company continuing development meego even n9 would success focusing solely future lumia series something meego supporters already felt n9 announcement due microsoft deal responded creating petition want nokia keep meego even severe meego linux also form continuation maemo linux established combining nokia maemo intel moblin frames nokia intel alliance created purposes cooperation despite success alliance broken meego canceled stephen elop decision intel officially expressed regrets situation n9 positive reception generally weak sales lumia range elop criticised move said contributed company demise smartphone market according elop following microsoft alliance meego became experimental project harmattan interface elements used cancelled meltemi project later nokia asha platform august 2011 nokia announced nokia n9 released united states reports indicated device available markets japan canada germany nokia posted official blog last week september 2011 n9 phones heading stores initial retail price announced around \u20ac480 16gb \u20ac560 64gb applicable taxes subsidies germany devices imported switzerland available online amazon german cyberport gmbh january 2012 also made available major stores saturn media markt chain february 2012 nokia n9 appeared italian nokia site supposed sign n9 official nokia distribution italian market prices january 2012 depending size internal memory \u20ac500 \u20ac630 nokia n9 powered texas instruments omap 3630 system-on-a-chip based 45 nanometer cmos process includes three processor units 1 ghz arm cortex a8 cpu runs operating system applications imagination technologies powervr sgx530 gpu supporting opengl es 2.0 capable processing 14 million polygons per second 430 mhz ti tms320c64x digital signal processor image processing camera audio processing telephony data transmission system also 1 gb low power single channel ram mobile ddr compcache uses part memory compressed fast swap time powerful device nokia created user data stored internal emmc chip 16 64 gb variants n9 first smartphone encompass 64 gb storage nokia n9 capacitive touchscreen 6 simultaneous points resolution 854 \u00d7 480 pixel fwvga 251 ppi pentile rgbg layout according nokia capable displaying 16.7 million colors oled screen covered curved scratch-resistant corning gorilla glass gap glass display reduced screen coated anti-glare polarizer ease usability daylight proximity sensor deactivates display touchscreen device brought near face call also ambient light sensor adjusts display brightness device also makes use accelerometer rotate screen portrait/landscape mode applications web browser n9 autonomous gps feature optional a-gps functionality wi-fi network positioning magnetometer comes pre-loaded nokia maps nokia drive applications nokia maps similar ovi maps found recent symbian devices nokia mostly finding nearby places restaurants metro station theater etc ... around user nokia maps meego also integrated contacts calendar applications nokia drive dedicated application car navigation provides free lifetime turn-by-turn voice guided car navigation nokia n9 comes preloaded maps continent purchased nokia drive require active data connection work stand-alone gps navigator main back camera autofocus feature dual led flash optimized 16:9 4:3 aspect ratios 4\u00d7 digital zoom video camera sensor size back camera 8.7 megapixels 3552 \u00d7 2448 px effective resolution 16:9 aspect ratio 3552 \u00d7 2000 px 7.1 megapixels 3248 \u00d7 2448 px 8 megapixels 4:3 aspect ratio typically 16:9 picture format digital camera achieved cropping top bottom 4:3 image since sensor 4:3 nokia n9 genuinely provides width picture choosing 16:9 aspect ratio option using full 3552-pixel width sensor height picture choosing 4:3 aspect ratio option using full 2448-pixel height sensor carl zeiss lens quite unusual specifications mobile phone 28mm wide-angle lens focal length fast class f/2.2 aperture 10 cm-to-infinity focus range capable recording 720p video 30 fps stereo sound holding device facing screen right side power on/off long press lock/unlock short press button volume keys nokia n9 fewer hardware buttons smartphones makes extensive use touchscreen navigate user interface example minimize running application user swipe finger one side bezel surrounding screen opposite side also dedicated shutter key camera touch screen instead used focus take picture screen unlocked double tapping n9 two microphones loudspeaker situated bottom phone main microphone enables conversation recording second microphone located back device near flash leds main camera used meego system noise cancellation make phone conversations clearer noisy environment top 3.5 mm av connector simultaneously provides stereo audio output support dolby headphone either microphone input video output next 3.5 mm connector high-speed usb 2.0 usb micro-b connector provided data synchronization mass storage mode client battery charging usb connector protected small door built-in bluetooth v2.1 +edr enhanced data rate supports stereo audio output a2dp profile built-in car hands-free kits also supported hfp profile file transfer supported ftp along opp profile sending/receiving objects possible remote control device avrcp profile bluetooth chip also functions fm receiver/transmitter allowing one listen fm radio using headphones connected 3.5 jack antenna nokia n800 n810 n900 ship without software support however fm radio application already available ovi store independent developer nfc also supported sharing photos contacts music devices supporting nfc e.g nokia c7 nokia 701 also pairing connecting stereo speakers e.g nokia play 360 headset e.g nokia bh-505 one device connected simultaneously n9 via nfc nokia n9 bv-5jw 3.8v 1450mah battery according nokia provides 7h 11h continuous talk time 16 19.5 days standby 4.5h video playback 50h music playback phone supports usb charging number devices used n9 via several connectivity options external keyboards via bluetooth wireless headphones via nfc wireless loudspeakers via nfc many others strictly speaking nokia n9 run meego 1.2 operating system instead runs nokia refers meego instance development harmattan previously marketed maemo 6 nokia intel merged open source projects one new common project called meego postpone development schedule nokia decided keep core harmattan middleware components gstreamer packaging managers harmattan system uses debian packages instead rpm packages nonetheless harmattan designed fully api compatible meego 1.2 via qt far end users application developers concerned distinction harmattan meego 1.2 minimal since marketing effort would directed meego nokia dropped maemo branding adopt meego confuse customers. ref name= renaming maemo 6 meego/harmattan /ref nokia n9 user experience provides three panes called home lock screen dragging flicking horizontally navigates three panes home home consists application swipe gesture one edge screen one return user one three views home close application either suspended keep running background depending application close application user must press hold red x appears upper left corner application thumbnail open application view close user may also close apps swiping top device application fadeout effect tapping status bar top screen using application display menu allowing user adjust volume change active profile silent beep ringing internet connection wifi gsm data bluetooth control shortcut enabled bluetooth settings media sharing dlna shortcut enabled media sharing settings introduced pr 1.2 availability lock screen display status bar clock notifications screen also holds music controls introduced pr 1.1 music player active customizable end user phone unlocked double tapping screen sliding holding lock screen reveals 4 shortcuts called quick launcher quick launcher also accessed using application swiping ui n9 including visual style double-tap feature resurrected nokia asha platform introduced nokia asha 501 device 2013 nokia n9 announced nokia connections event singapore june 2011 reception device positive citing meego v1.2 harmattan ui pseudo-buttonless design polycarbonate unibody construction nfc capabilities still many reviewers recommend buy n9 nokia earlier decision drop meego windows phone future smartphones \u2013 often questioning decision time engadget editor vlad savov said june 2011 terrific phone got legitimately excited use future clouded parent investing time money building whole os later review engadget writes love first sight \u2014 possibly beautiful phone ever made meego 1.2 harmattan breath fresh air leave gasping \u2014 remember 're dealing dead man walking review ars technica ryan paul writes n9 impressively engineered device matched sophisticated touch-oriented interface powerful software stack open source underpinnings verge website writes nokia n9 without doubt one fascinating phones last years german der spiegel titles could nokia winner german magazine stern describes one best devices ever made nokia delimiter called n9 nokia significant handset since nokia n95 nokia n9 released largest smartphone markets u.s. canada uk netherlands germany france italy spain others nokia disclose number sales n9 november 2011 nokia n9 3 4 applicable titles including design camera cellphone year gala held swedish magazine webzine mobil.se january 2012 nokia n9 swipe ui nominated ixda interaction award february 2012 n9 reached number 1 ranking rate rate 8.432 10 votes 74,940 also number 5 daily interest hits gsmarena ranking april 2012 n9 awarded design art direction yellow pencil interactive product design category beating among others ipad 2 nokia lumia 800 approach applied nokia one open platform exception closed user experience maemo 5 nokia n900 community request closed source component owned nokia released open source hundreds 3rd party applications mostly free open source already created ported gnu/linux meego harmattan platform nokia decision abandon meego even n9 success left much team unhappy staff left form new company jolla continue development meego resulted fork called sailfish os ported n9 see released two new smartphones created jolla images n9 prototype running android 2.3 leaked sina weibo user previously uploaded prototype images nokia sea ray later lumia 800 windows phone believed likely genuine steven elop mentioned nokia considered android past unofficial android 4.1.1 port nitdroid community made port features general functionality misses features voice calling use camera 21 november 2012 jolla announced demonstrated sailfish os direct continuation based meego 80 first linux sailfish os open source part linux meego original meego open source code developed frames mer software distribution comes meego reinstated established current standard middleware stack core software kernel ui os open source free vendors harmattan ui several software applications used n9 closed proprietary nokia hence could used neither mer project sailfish os jolla introduced swipe ui used mer core standard created sailfish os videos sailfish os running nokia n950 appeared internet day announcement n950 similar technical specifications n9 slight differences including physical qwerty keyboard led many owners n9 believe sailfish os ported n9 jolla confirmed also stated official possibilities kind support n9 instead community provide unofficial port sailfish os however jolla maintained experience sailfish official jolla phones jolla released first jolla mobile phone november 27 2013 sailfish os first full linux meego os meego harmattan meego instance fully finished combining maemo moblin sailfish os actively developed commonly assumed next better incarnation meego also jolla device assumed unofficial successor n9 legacy means early 2019 kaios technologies inc. demonstrate devices running kaios nokia 8110 2018 jio phone one full touch device suspected nokia n9", + "neighbors": [ + 3, + 21, + 134, + 162, + 238, + 253, + 270, + 294, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1051, + 1117, + 1138, + 1185, + 1203, + 1313, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Test" + }, + { + "node_id": 265, + "label": 2, + "text": "Zswap:zswap zswap linux kernel feature provides compressed write-back cache swapped pages form virtual memory compression instead moving memory pages swap device swapped zswap performs compression stores memory pool dynamically allocated system ram later writeback actual swap device deferred even completely avoided resulting significantly reduced i/o linux systems require swapping tradeoff need additional cpu cycles perform compression result reduced i/o zswap offers advantages various devices use flash-based storage including embedded devices netbooks similar low-end hardware devices well devices use solid-state drives ssds storage flash memory limited lifespan due nature avoiding used providing swap space prevents wearing quickly zswap integrated rest linux kernel virtual memory subsystem using api provided frontswap mechanism linux kernel abstracts various types storage used swap space result zswap operates backend driver frontswap providing internally visible pseudo-ram device words frontswap api makes zswap capable intercepting memory pages swapped capable intercepting page faults already swapped pages access two paths allows zswap act compressed write-back cache swapped pages internally zswap uses compression modules provided linux kernel crypto api makes possible example offload compression tasks main cpu using hardware compression accelerators supported linux kernel selection desired compression module performed dynamically boot time value kernel boot parameter specified defaults selects lempel\u2013ziv\u2013oberhumer lzo compression version 3.13 linux kernel zswap also needs explicitly enabled specifying value kernel boot parameter maximum size memory pool used zswap configurable parameter specifies maximum percentage total system ram occupied pool memory pool preallocated configured maximum size instead grows shrinks required configured maximum pool size reached result performed swapping growing pool impossible due out-of-memory condition swapped pages evicted memory pool swap device least recently used lru basis approach makes zswap true swap cache oldest cached pages evicted swap device cache full making room newer swapped pages compressed cached zbud special-purpose memory allocator used internally zswap storing compressed pages implemented rewrite zbud allocator used oracle zcache another virtual memory compression implementation linux kernel internally zbud works storing two compressed pages buddies hence allocator name per physical memory page brings advantages due easy coalescing reusing freed space disadvantages due possible lower memory utilization however result design zbud allocate memory space would originally occupied uncompressed pages zswap zbud created seth jennings first public announcement december 2012 development continued may 2013 point codebase reached maturity although still status experimental kernel feature zswap together zbud merged linux kernel mainline kernel version 3.11 released september 2 2013 since version 3.15 linux kernel released june 8 2014 zswap properly supports multiple swap devices one alternatives zswap zram provides similar still different swap compressed pages ram mechanism linux kernel main difference zram provides compressed block device using ram storing data acts regular separate swap device comparison zswap acts ram-based cache swap devices provides zswap eviction mechanism less used swapped pages zram lacks though result design least one already existing swap device required zswap used", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 213, + 219, + 225, + 267, + 294, + 305, + 306, + 322, + 327, + 346, + 347, + 352, + 387, + 400, + 401, + 413, + 465, + 477, + 571, + 583, + 630, + 650, + 664, + 688, + 720, + 725, + 728, + 736, + 754, + 797, + 860, + 884, + 891, + 897, + 935, + 941, + 961, + 966, + 986, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1060, + 1102, + 1105, + 1138, + 1155, + 1187, + 1197, + 1202, + 1208, + 1224, + 1241, + 1252, + 1278, + 1301, + 1313, + 1357, + 1360, + 1391, + 1398, + 1415, + 1441, + 1456, + 1468, + 1474, + 1494, + 1518, + 1524, + 1526, + 1530, + 1546, + 1558, + 1578, + 1602, + 1608, + 1616, + 1631, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 266, + "label": 7, + "text": "Oracle_Exalogic:oracle exalogic exalogic computer appliance made oracle corporation commercially available since 2010 cluster x86-64-servers running oracle linux solaris preinstalled full trade mark oracle exalogic elastic cloud derived si prefix exa- -logic probably weblogic positioned vendor preconfigured clustered application server use cloud computing elastic computing abilities oracle corporation announced exalogic oracle openworld conference san francisco september 2010 company presented continuation oracle-engineered systems product-line started 2008 exadata preconfigured database cluster exalogic factory assembled 19-inch rack 42 rack units completed servers network equipment 4 configurations different prices depending fills rack weight full rack 1 ton 2000 lbs quarter rack weighs half much hardware component x2-2 appliance consisted group 1-unit intel xeon servers equipped two six-core 2.93 ghz processors two solid-state drives operating system swap space common storage area network set infiniband ethernet switches full rack contains 30 server nodes half rack 16 quarter rack 8 eighth rack 4 server node installed 96 gb ram four 10 gigabit ethernet interfaces double infiniband port storage area network configurations similar 40 tb raw space vendor specifications advertising content usually indicate total parameters 360 processor kernels 2.9 tb ram full rack x3-2 model announced 2012 newer processors memory since late 2013 x4-2 model commercially available yet processor cores four times large capacity solid-state drives two 64-bit operating systems run server nodes appliance oracle linux version 5.5 solaris 11 servers installed cluster configuration oracle weblogic server distributed memory cache oracle coherence run java applications machine choice hotspot jrockit management appliance available oracle enterprise manager toolset also pre-installed appliance transaction monitor tuxedo optionally supplied exalogic deployed university melbourne food drug administration fda united states amway hyundai motor group bank chile haier deutsche post dhl public authority minors affairs pama kuwait mark benioff founder salesforce.com presumes appliance principally lacks scalability end-user compared infrastructure supplied service notes exalogic approach actually rollback obsolete mainframe computer concept also commentators expressed concerns appropriateness placing word elastic name despite ability load balance obvious computing limits box limits transcended like true elastic environment criticism applies solutions designed private cloud computing particular applies emc corporation hewlett-packard products however computing environment collection servers since many exalogic machines combined limited single box capacity may considered merely building block", + "neighbors": [ + 210, + 611, + 755, + 1232, + 1288, + 1431, + 1484 + ], + "mask": "Validation" + }, + { + "node_id": 267, + "label": 2, + "text": "Linux_adoption:linux adoption linux adoption adoption linux computer operating systems os households nonprofit organizations businesses governments many factors resulted expanded use linux systems traditional desktop users well operators server systems including desire minimize software costs increase network security support open-source philosophical principles recent years several governments various levels enacted policies shifting state-owned computers linux proprietary software regimes august 2010 jeffrey hammond principal analyst forrester research declared linux crossed chasm mainstream adoption statement attested large number enterprises transitioned linux late-2000s recession company survey completed third quarter 2009 48 surveyed companies reported using open-source operating system linux foundation regularly releases publications regarding linux kernel linux os distributions related themes one publication linux adoption trends survey enterprise end users freely available upon registration traditionally term linux adoption refers adoption linux os made desktop computers original intended use adoption servers essentially form os adoption form personal computers still low relatively adoption android operating system high term linux adoption often overlooks operating system uses chrome os also use linux kernel almost nothing else common even name \u2013 linux \u2013 usually applied android popular variant \u2013 fact popular operating system world outside traditional web services linux powers many biggest internet properties e.g. google amazon facebook ebay twitter yahoo linux used desktop computers servers supercomputers well wide range devices linux desktop distributions usually distributed retail sale sales numbers indicate number users one downloaded file may used create many cds cd may used install operating system multiple computers hand file might used test installation erased soon due factors estimates current linux desktop often rely webpage hits computers identifying running linux use statistics criticized unreliable underestimating linux use using webpage hits measure 2008 linux accounted 1 desktop market share microsoft windows operating systems held 90 might linux seen time direct replacement windows w3counter estimated linux web browser market share 4.63 android versions 6 5 4 combined based linux kernel estimated 33.77 linux counter uses alternate method estimating adoption asking users register using mathematical model estimate total number desktop users november 2014 method estimated 73 million linux users september 2014 pornhub released usage statistics website reported 1.7 linux users unity game engine gathers user statistics showed march 2016 0.4 linux users similarly steam client tracks usage reported may 2015 around 1 linux users april 2009 aaron seigo kde indicated web-page counter methods produce linux adoption numbers far low given system extensive penetration non-north american markets especially china stated north american-based web-measurement methods produce high windows numbers ignore widespread use linux parts world estimating true worldwide desktop adoption accounting windows-distorted environment usa canada indicated least 8 world desktops run linux distributions possibly high 10\u201312 numbers rising quickly commentators echoed belief noting competitors expending lot effort discredit linux incongruent tiny market share may 2009 preston gralla contributing editor computerworld.com reacting net applications web hit numbers showing linux use 1 said linux never become important desktop notebook operating system reasoned upsurge linux desktop use recently seen due linux netbooks trend saw already diminishing would eroded windows 7 became available indeed linux netbooks fall wayside though whether solely responsible upsurge linux usage open question concluded desktop operating system linux n't important enough think servers top-notch likely wo n't use desktop \u2013 even though finally manage crack 1 barrier 18 years 2009 microsoft then-ceo steve ballmer indicated linux greater desktop market share mac stating recent years linux certainly increased share somewhat third dell netbook sales 2009 linux installed caitlyn martin researching retail market numbers summer 2010 also concluded traditional numbers mentioned linux desktop adoption far low reasons change operating systems linux include better system stability better malware protection low cost distributions come complete application software hardware drivers simplified updates installed software free software licensing availability application repositories access source code linux desktop distributions also offer multiple desktop workspaces greater customization free unlimited support forums operating system n't slow time environmental reasons also cited linux operating systems usually come boxes retail packaging downloaded via internet lower system specifications also mean older hardware kept use instead recycled discarded linux distributions also get security vulnerabilities patched much quickly non-free operating systems improvements linux occurring faster rate windows report economist december 2007 said investments made improve desktop linux usability since 2007 report indian bulk computer purchaser electronics corporation tamil nadu elcot started recommending linux june 2008 following testing stated elcot using suse linux ubuntu linux operating systems desktop laptop computers numbering 2,000 past two years found far superior compared operating systems notably microsoft operating system many developing nations china due widespread software piracy microsoft windows easily obtained free linux distributions gaining high level adoption hence countries essentially cost barrier obtaining proprietary operating systems users adopting linux based merit rather price january 2001 microsoft then-ceo bill gates explained attraction adopting linux internal memo released comes vs microsoft case said greatest barrier linux desktop adoption probably desktop pcs come factory a.y siu asserted 2006 people use windows simply pcs come windows pre-installed n't choose linux much lower market penetration cases users install task beyond capabilities many pc users users \u2019 even use windows restore cds let alone install windows scratch would install unfamiliar operating system computers techrepublic writer jack wallen expands barrier saying august 2008 linus torvalds stated june 2012 interaction students aalto university although linux originally conceived desktop system market flourished suggested key reason keeps linux getting substantial presence desktop market average desktop user want install operating system getting manufacturers sell computers linux pre-installed would missing piece fulfill vision linux desktop market added chromebooks shipping linux-based chrome os could provide key turning point transition much like android allowed linux spread mobile space september 2012 gnome developer michael meeks also indicated main reason lack adoption linux desktops lack manufacturers shipping computers pre-installed supporting siu arguments six years earlier meeks also indicated users would n't embrace desktop linux wider range applications developers wo n't create wider range applications users classic catch-22 situation opensuse survey conducted 2007 69.5 respondents said dual booted microsoft windows operating system addition linux operating system early 2007 bill whyman analyst precursor advisors noted still n't compelling alternative microsoft infrastructure desktop application support quality peripheral support end user support one time seen biggest obstacles desktop linux adoption according 2006 survey linux foundation factors seen major obstacle 56 49 33 respondents respectively time november 2006 desktop linux client survey identified foremost barrier deploying linux desktops users accustomed windows applications ported linux ca n't live without included microsoft office adobe photoshop autodesk autocad microsoft project visio intuit quickbooks creates chicken egg situation developers make programs windows due market share consumers use windows due availability said programs desktoplinux.com survey conducted 2007 72 respondents said used ways run windows applications linux 51 respondents 2006 linux foundation survey believed cross-distribution linux desktop standards top priority linux desktop community highlighting fact fragmented linux market preventing application vendors developing distributing supporting operating system may 2008 gartner predicted version control incompatibilities continue plague open-source oss associated middleware 2013 timeframe 2008 design linux applications porting windows apple applications progressed point difficult find application equivalent linux providing adequate better capabilities example application progress seen comparing main productivity suite linux openoffice.org microsoft office release openoffice.org 3.0 october 2008 ars technica assessed two past availability quality open source device drivers issues linux desktops particular areas lacking drivers included printers well wireless audio cards example early 2007 dell sell specific hardware software ubuntu 7.04 computers including printers projectors bluetooth keyboards mice tv tuners remote controls desktop modems blu-ray disc drives due incompatibilities time well legal issues 2008 linux hardware support driver issues adequately addressed september 2008 jack wallen assessment critics stated compared windows linux lacking end-user support linux traditionally seen requiring much technical expertise dell website described open source software requiring intermediate advanced knowledge use september 2007 founder ubuntu project mark shuttleworth commented would reasonable say ready mass market october 2004 chief technical officer adeptiva linux stephan february noted time linux technical software product people outside technical community able support consumers windows users able rely friends family help linux users generally use discussion boards uncomfortable consumers 2005 dominic humphries summarized difference user tech support recently critics found linux user support model using community-based forum support greatly improved 2008 jack wallen stated addressing question user support manu cornet said linux credibility also attack times ron miller linuxplanet points continuing debate total cost ownership linux gartner warning 2005 costs migration may exceed cost benefits linux gartner reiterated warning 2008 predicting 2013 majority linux deployments real software total cost ownership tco advantage operating systems however comes v. microsoft lawsuit plaintiff exhibit 2817 revealed microsoft successfully lobbied gartner changing tco model favour microsoft 1998 organizations moved linux disagreed warnings sterling ball ceo ernie ball world leading maker premium guitar strings 2003 linux adopter said total cost ownership arguments think propaganda ... cost dealing virus n't 'em ... doubt 'm cheaper operate analyst guys say whatever want sco-linux controversies sco group alleged unix source code donated ibm illegally incorporated linux threat sco might able legally assert ownership linux initially caused potential linux adopters delay move court cases bankrupted sco 2007 lost four-year court battle ownership unix copyrights sco case hinged showing linux included intellectual property misappropriated unix case failed court discovered novell sco rightful owner copyrights legal process revealed sco claims linux fraudulent sco internal source code audits showed evidence infringement rival operating system vendor green hills software called open source paradigm linux fundamentally insecure us army agree linux security problem brigadier general nick justice deputy program officer army program executive office command control communications tactical peo c3t said april 2007 2008 gartner analysts predicted mobile devices like netbooks linux could potentially break dominance microsoft windows operating system provider netbook concept focuses os-agnostic applications built web applications browsing 2008 netbook market dominated linux-powered devices changed 2009 windows xp became available option one reasons given many customers returned linux-based netbooks still expecting windows-like environment despite netbook vision web-surfing web-application device 2011 google introduced chromebook web thin client running linux-based chrome os ability use web applications remote desktop computers running windows mac os x traditional linux distribution chrome os using chrome remote desktop 2012 google samsung introduced first version chromebox small-form-factor desktop equivalent chromebook 2013 chromebooks captured 20\u201325 sub- 300 us laptop market note term mobile devices computing context refers cellphones tablets term include regular laptops despite fact always designed mobile android based linux open source popular mobile platform second quarter 2013 79.3 smartphones sold worldwide running android android tablets also available firefox os another open source linux-based mobile operating system discontinued nokia previously produced phones running variant linux e.g nokia n900 2013 nokia handset division bought microsoft smartphones gradually replacing kinds embedded devices still exist example portable media players oem firmware linux based community-driven fully free open-source project rockbox in-vehicle infotainment hardware usually involves kind display either built dashboard additional displays genivi alliance works linux-based open platform run ivi may interface values delivered engine control unit albeit completely separate system special variant tizen ivi different tizen smartphones several regards linux often used various single- multi-purpose computer appliances embedded systems customer-premises equipment group devices embedded graphical user interface common sense remotely operated via secure shell via web-based user interface running lightweight web server software oem firmware based linux kernel free open-source software e.g das u-boot busybox also couple community driven projects e.g openwrt smaller scale embedded network-attached storage-devices also mostly linux-driven linux became popular internet server market particularly due lamp software bundle september 2008 steve ballmer microsoft ceo claimed 60 servers run linux 40 run windows server according idc report covering q2 2013 linux 23.2 worldwide server revenue although compensate potential price disparity linux non-linux servers may 2014 w3techs estimated 67.5 top 10 million according alexa websites run form unix linux used least 57.2 websites use unix linux-based solution stacks come general advantages benefits free open-source software commonly known examples according netcraft apache http server highest market share various freely available implementations ldap servers additionally univention corporate server integrated management system based debian supports functions provided microsoft active directory administration computers running microsoft windows free routing software available linux includes bird b.a.t.m.a.n. quagga xorp whether customer-premises equipment personal computer hardware server-hardware mainline linux kernel adapted highly optimized linux kernel capable routing rates limited hardware bus throughput linux popular operating system among supercomputers due general advantages benefits free open-source software like superior performance flexibility speed lower costs november 2008 linux held 87.8 percent share world top 500 supercomputers june 2016 operating systems used world top 500 supercomputers january 2010 weiwu hu chief architect loongson family cpus institute computing technology part chinese academy sciences confirmed new dawning 6000 supercomputer use chinese-made loongson processors run linux operating system recent supercomputer organization built dawning 5000a first run 2008 used amd chips ran windows hpc server 2008 many organizations advocate linux adoption foremost linux foundation hosts sponsors key kernel developers manages linux trademark manages open source developer travel fund provides legal aid open source developers companies linux legal defense fund sponsors kernel.org also hosts patent commons project international free open source software foundation ifossf nonprofit organization based michigan usa dedicated accelerating promoting adoption foss worldwide research civil society partnership networks open invention network formed protect vendors customers patent royalty fees using oss advocates linux include gartner claimed linux-powered personal computers accounted 4 unit sales 2008 however common users install linux addition dual boot arrangement place factory-installed microsoft windows operating system", + "neighbors": [ + 134, + 148, + 149, + 162, + 166, + 209, + 211, + 213, + 219, + 227, + 265, + 275, + 294, + 305, + 327, + 380, + 400, + 401, + 431, + 484, + 571, + 630, + 650, + 664, + 688, + 716, + 720, + 725, + 736, + 755, + 897, + 935, + 961, + 986, + 1060, + 1102, + 1105, + 1138, + 1155, + 1197, + 1208, + 1241, + 1246, + 1252, + 1313, + 1357, + 1360, + 1361, + 1391, + 1452, + 1456, + 1468, + 1509, + 1524, + 1526, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 268, + "label": 2, + "text": "DirectX_Video_Acceleration:directx video acceleration directx video acceleration dxva microsoft api specification microsoft windows xbox 360 platforms allows video decoding hardware accelerated pipeline allows certain cpu-intensive operations idct motion compensation deinterlacing offloaded gpu dxva 2.0 allows operations including video capturing processing operations hardware accelerated well dxva works conjunction video rendering model used video card dxva 1.0 introduced standardized api windows 2000 currently available windows 98 later use either overlay rendering mode vmr 7/9 dxva 2.0 available windows vista windows 7 windows 8 later oss integrates media foundation mf uses enhanced video renderer evr present mf dxva used software video decoders define codec-specific pipeline hardware-accelerated decoding rendering codec pipeline starts cpu used parsing media stream conversion dxva-compatible structures dxva specifies set operations hardware accelerated device driver interfaces ddis graphic driver implement accelerate operations codec needs defined operations use interfaces access hardware-accelerated implementation operations graphic driver implement one interfaces codec provide software fallback decoded video handed hardware video renderer video post-processing might applied rendered device resulting pipeline usable directshow compatible application dxva specifies motion compensation ddi specifies interfaces idct operations huffman coding motion compensation alpha blending inverse quantization color space conversion frame-rate conversion operations among others also includes three sub-specifications deinterlacing ddi copp ddi procamp ddi deinterlacing ddi specifies callbacks deinterlacing operations copp certified output protection protocol ddi functions allow pipeline secured drm-protected media specifying encryption functions procamp ddi used accelerate post-processing video procamp driver module sits hardware video renderer display driver provides functions applying post-processing filters decompressed video functions exposed dxva ddis accessible directly directshow client supplied callback functions video renderer renderer plays important role anchoring pipeline dxva 2.0 enhances implementation video pipeline adds host ddis including capture ddi video capture ddis shares dxva 1.0 also enhanced ability use hardware acceleration operations also ddi functions directly available callers need mediated video renderer program also create pipeline simply decoding media without rendering post-processing rendering without decoding features require windows display driver model drivers limits dxva 2.0 windows vista windows server 2008 windows 7 windows server 2008 r2 windows 8 windows xp windows 2000 programs use dxva 1.0 dxva 2.0 allows enhanced video renderer video renderer vista windows 7 windows 8 windows xp dxva-rendering possible vmr9 well-known overlay mixer dxva integrates media foundation allows dxva pipelines exposed media foundation transforms mfts even decoder pipelines post-processing pipelines exposed mfts used media foundation topology loader create full media playback pipeline dxva 1.0 emulated using dxva 2.0 dxva 2.0 include copp ddi rather uses pvp protected content windows 7 implements dxva-hd driver complies wddm 1.1 dxva2 implementations come two variants native copy-back native implementation decoded video stays gpu memory displayed video decoder must connected video renderer intermediary processing filter video renderer must also support dxva gives less freedom choice renderers copy-back implementation decoded video copied gpu memory back cpu memory implementation n't limitations mentioned acts similarly normal software decoder however video stuttering occur gpu fast enough copy memory back cpu memory native mode advantageous unless need customized processing additional copy-back operations increase gpu memory load", + "neighbors": [ + 26, + 28, + 66, + 79, + 93, + 111, + 148, + 153, + 262, + 278, + 295, + 312, + 326, + 344, + 412, + 435, + 472, + 485, + 521, + 528, + 558, + 574, + 591, + 615, + 638, + 659, + 662, + 689, + 705, + 719, + 791, + 801, + 815, + 865, + 920, + 961, + 989, + 1025, + 1068, + 1081, + 1092, + 1098, + 1177, + 1212, + 1219, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1398, + 1417, + 1428, + 1502, + 1503, + 1531, + 1533, + 1545, + 1547, + 1561, + 1608, + 1613, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 269, + "label": 2, + "text": "IPhone_XS:iphone xs iphone xs iphone xs max stylized marketed iphone iphone max roman numeral x pronounced ten smartphones designed developed marketed apple inc twelfth-generation flagships iphone succeeding iphone x announced september 12 2018 alongside lower-priced iphone xr steve jobs theater apple park cupertino apple ceo tim cook pre-orders beginning september 14 2018 official release september 21 2018 iphone xs max first plus-sized iphone new bezel-less form factor 2017 iphone x larger variant upon release xs xs max iphone x discontinued meaning shelf life 10 months shortest ever tenure flagship device history iphone release xs xs max starting prices 999/ 1099 us \u00a3999/\u00a31099 uk \u20ac1149/\u20ac1249 europe rmb8699/rmb9599 china \u20b999900/\u20b9109900 india xs design visually near-identical x includes upgraded hardware featuring a12 bionic chip built 7 nanometer process also features 5.85-inch 149 mm oled display contains dual 12-megapixel rear cameras one 7-megapixel front-facing camera xs max features hardware cameras larger 6.46-inch 164 mm oled display battery 3,174mah also noted media xs received smaller battery x dropping 2,658 mah 2,716 mah xs battery new single-cell l-shaped battery iphone xs max battery remains two cells like iphone x. additionally apple states iphone xs lasts 30 minutes longer iphone x iphone xs max lasts 1.5 hours longer iphone x. apple claims devices faster face id technology also announced june 2019 wwdc face id iphone xs iphone xs max iphone xr iphone x would 30 faster ios 13 set arrive fall xs xs max rated ip68 dust water resistance iec standard 60529 apple specifying maximum depth 2 meters 30 minutes submersion water improvement ip67 water resistance iphone 8 x. apple performed tests various liquids including chlorinated water salt water tea wine beer juices unlike xr iphone xs devices optical zoom xs xs max support dual sims nano-sim esim mainland china hong kong macau however xs max comes dual nano-sim tray esim xs dual nano-sim tray esim functionality enabled use hong kong macau mainland china wireless charging coil made copper reduce charging time power loss iphones starting iphone 6s iphone 6s plus iphone se iphone 7 iphone 7 plus iphone 8 iphone 8 plus iphone x main camera 12mp 1/2.94 sensor size 1.22 \u03bcm pixel size starting iphone 2018 series xs xs max xr iphones updated 12mp 1/2.55 sensor size 1.4 \u03bcm pixel size sensor pixel size primary cameras samsung galaxy s10 samsung galaxy s9 samsung galaxy s8 samsung galaxy s7 pixel 2 pixel 3a pixel 3a xl pixel 3 pixel 3 xl moto x4 users reported problems charging iphone xs xs max lightning cable device failed charge would begin charge screen turned would occur due software bug apple \u2019 \u201c disable usb accessories locked \u201d setting feature intended prevent unknown devices accessing user content within iphone press dubbed issue chargegate issue resolved release ios 12.0.1 october 8 2018 customers also reported seeing unrealistic smoothness skin taking selfie automatic filter observers noted face-smoothing effect likely unintentionally caused new smart hdr camera feature xs xs max technology combines multiple photos varying exposures increase dynamic range iphones photos also lead less pronounced facial imperfections decreased highlights selfies speculated result hidden \u201c beauty mode \u201d actual feature smartphones dubbed issue \u201c beautygate. \u201d general dispute community whether camera actually intends perfect faces appear way result better quality camera apple said results due smart hdr algorithm incorrectly selecting blurrier long exposure base frame instead sharpest short exposure issue resolved software release ios 12.1 october 30 2018 iphone xs users issues lte wi-fi reception bluetooth connection radio expert claims faulty antenna blame apple contacted users help investigation ios 12.0.1 addresses issue bluetooth could become unavailable", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 162, + 166, + 214, + 228, + 252, + 270, + 337, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1384, + 1409, + 1488, + 1496, + 1507, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 270, + "label": 3, + "text": "Central_processing_unit:central processing unit central processing unit cpu also called central processor main processor electronic circuitry within computer carries instructions computer program performing basic arithmetic logic controlling input/output i/o operations specified instructions computer industry used term central processing unit least since early 1960s traditionally term cpu refers processor specifically processing unit control unit cu distinguishing core elements computer external components main memory i/o circuitry form design implementation cpus changed course history fundamental operation remains almost unchanged principal components cpu include arithmetic logic unit alu performs arithmetic logic operations processor registers supply operands alu store results alu operations control unit orchestrates fetching memory execution instructions directing coordinated operations alu registers components modern cpus microprocessors cpu contained single metal-oxide-semiconductor mos integrated circuit ic chip ic contains cpu may also contain memory peripheral interfaces components computer integrated devices variously called microcontrollers systems chip soc computers employ multi-core processor single chip containing two cpus called cores context one speak single chips sockets array processors vector processors multiple processors operate parallel unit considered central also exists concept virtual cpus abstraction dynamical aggregated computational resources early computers eniac physically rewired perform different tasks caused machines called fixed-program computers since term cpu generally defined device software computer program execution earliest devices could rightly called cpus came advent stored-program computer idea stored-program computer already present design j. presper eckert john william mauchly eniac initially omitted could finished sooner june 30 1945 eniac made mathematician john von neumann distributed paper entitled first draft report edvac outline stored-program computer would eventually completed august 1949 edvac designed perform certain number instructions operations various types significantly programs written edvac stored high-speed computer memory rather specified physical wiring computer overcame severe limitation eniac considerable time effort required reconfigure computer perform new task von neumann design program edvac ran could changed simply changing contents memory edvac however first stored-program computer manchester baby small-scale experimental stored-program computer ran first program 21 june 1948 manchester mark 1 ran first program night 16\u201317 june 1949 early cpus custom designs used part larger sometimes distinctive computer however method designing custom cpus particular application largely given way development multi-purpose processors produced large quantities standardization began era discrete transistor mainframes minicomputers rapidly accelerated popularization integrated circuit ic ic allowed increasingly complex cpus designed manufactured tolerances order nanometers miniaturization standardization cpus increased presence digital devices modern life far beyond limited application dedicated computing machines modern microprocessors appear electronic devices ranging automobiles cellphones sometimes even toys von neumann often credited design stored-program computer design edvac design became known von neumann architecture others konrad zuse suggested implemented similar ideas so-called harvard architecture harvard mark completed edvac also used stored-program design using punched paper tape rather electronic memory key difference von neumann harvard architectures latter separates storage treatment cpu instructions data former uses memory space modern cpus primarily von neumann design cpus harvard architecture seen well especially embedded applications instance atmel avr microcontrollers harvard architecture processors relays vacuum tubes thermionic tubes commonly used switching elements useful computer requires thousands tens thousands switching devices overall speed system dependent speed switches tube computers like edvac tended average eight hours failures whereas relay computers like slower earlier harvard mark failed rarely end tube-based cpus became dominant significant speed advantages afforded generally outweighed reliability problems early synchronous cpus ran low clock rates compared modern microelectronic designs clock signal frequencies ranging 100 khz 4 mhz common time limited largely speed switching devices built design complexity cpus increased various technologies facilitated building smaller reliable electronic devices first improvement came advent transistor transistorized cpus 1950s 1960s longer built bulky unreliable fragile switching elements like vacuum tubes relays improvement complex reliable cpus built onto one several printed circuit boards containing discrete individual components 1964 ibm introduced ibm system/360 computer architecture used series computers capable running programs different speed performance significant time electronic computers incompatible one another even made manufacturer facilitate improvement ibm used concept microprogram often called microcode still sees widespread usage modern cpus system/360 architecture popular dominated mainframe computer market decades left legacy still continued similar modern computers like ibm zseries 1965 digital equipment corporation dec introduced another influential computer aimed scientific research markets pdp-8 transistor-based computers several distinct advantages predecessors aside facilitating increased reliability lower power consumption transistors also allowed cpus operate much higher speeds short switching time transistor comparison tube relay increased reliability dramatically increased speed switching elements almost exclusively transistors time cpu clock rates tens megahertz easily obtained period additionally discrete transistor ic cpus heavy usage new high-performance designs like simd single instruction multiple data vector processors began appear early experimental designs later gave rise era specialized supercomputers like made cray inc fujitsu ltd. period method manufacturing many interconnected transistors compact space developed integrated circuit ic allowed large number transistors manufactured single semiconductor-based die chip first basic non-specialized digital circuits gates miniaturized ics cpus based building block ics generally referred small-scale integration ssi devices ssi ics ones used apollo guidance computer usually contained dozen transistors build entire cpu ssi ics required thousands individual chips still consumed much less space power earlier discrete transistor designs ibm system/370 follow-on system/360 used ssi ics rather solid logic technology discrete-transistor modules dec pdp-8/i ki10 pdp-10 also switched individual transistors used pdp-8 pdp-10 ssi ics extremely popular pdp-11 line originally built ssi ics eventually implemented lsi components became practical mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor invented mohamed atalla dawon kahng bell labs 1959 demonstrated 1960 led development mos metal-oxide-semiconductor integrated circuit proposed kahng 1961 fabricated fred heiman steven hofstein rca 1962 high scalability much lower power consumption higher density bipolar junction transistors mosfet made possible build high-density integrated circuits lee boysel published influential articles including 1967 manifesto described build equivalent 32-bit mainframe computer relatively small number large-scale integration circuits lsi way build lsi chips chips hundred gates build using mos semiconductor manufacturing process either pmos logic nmos logic cmos logic however companies continued build processors bipolar transistor\u2013transistor logic ttl chips bipolar junction transistors faster mos chips 1970s companies datapoint continued build processors ttl chips early 1980s 1960s mos ics slower initially considered useful applications required low power following development silicon-gate mos technology federico faggin fairchild semiconductor 1968 mos ics largely replaced bipolar ttl standard chip technology early 1970s microelectronic technology advanced increasing number transistors placed ics decreasing number individual ics needed complete cpu msi lsi ics increased transistor counts hundreds thousands 1968 number ics required build complete cpu reduced 24 ics eight different types ic containing roughly 1000 mosfets stark contrast ssi msi predecessors first lsi implementation pdp-11 contained cpu composed four lsi integrated circuits advances mos ic technology led invention microprocessor early 1970s since introduction first commercially available microprocessor intel 4004 1971 first widely used microprocessor intel 8080 1974 class cpus almost completely overtaken central processing unit implementation methods mainframe minicomputer manufacturers time launched proprietary ic development programs upgrade older computer architectures eventually produced instruction set compatible microprocessors backward-compatible older hardware software combined advent eventual success ubiquitous personal computer term cpu applied almost exclusively microprocessors several cpus denoted cores combined single processing chip previous generations cpus implemented discrete components numerous small integrated circuits ics one circuit boards microprocessors hand cpus manufactured small number ics usually one overall smaller cpu size result implemented single die means faster switching time physical factors like decreased gate parasitic capacitance allowed synchronous microprocessors clock rates ranging tens megahertz several gigahertz additionally ability construct exceedingly small transistors ic increased complexity number transistors single cpu many fold widely observed trend described moore law proven fairly accurate predictor growth cpu ic complexity 2016 complexity size construction general form cpus changed enormously since 1950 basic design function changed much almost common cpus today accurately described von neumann stored-program machines moore law longer holds concerns arisen limits integrated circuit transistor technology extreme miniaturization electronic gates causing effects phenomena like electromigration subthreshold leakage become much significant newer concerns among many factors causing researchers investigate new methods computing quantum computer well expand usage parallelism methods extend usefulness classical von neumann model fundamental operation cpus regardless physical form take execute sequence stored instructions called program instructions executed kept kind computer memory nearly cpus follow fetch decode execute steps operation collectively known instruction cycle execution instruction entire process repeats next instruction cycle normally fetching next-in-sequence instruction incremented value program counter jump instruction executed program counter modified contain address instruction jumped program execution continues normally complex cpus multiple instructions fetched decoded executed simultaneously section describes generally referred classic risc pipeline quite common among simple cpus used many electronic devices often called microcontroller largely ignores important role cpu cache therefore access stage pipeline instructions manipulate program counter rather producing result data directly instructions generally called jumps facilitate program behavior like loops conditional program execution use conditional jump existence functions processors instructions change state bits flags register flags used influence program behaves since often indicate outcome various operations example processors compare instruction evaluates two values sets clears bits flags register indicate one greater whether equal one flags could used later jump instruction determine program flow first step fetch involves retrieving instruction represented number sequence numbers program memory instruction location address program memory determined program counter pc stores number identifies address next instruction fetched instruction fetched pc incremented length instruction contain address next instruction sequence often instruction fetched must retrieved relatively slow memory causing cpu stall waiting instruction returned issue largely addressed modern processors caches pipeline architectures see instruction cpu fetches memory determines cpu decode step performed circuitry known instruction decoder instruction converted signals control parts cpu way instruction interpreted defined cpu instruction set architecture isa often one group bits field within instruction called opcode indicates operation performed remaining fields usually provide supplemental information required operation operands operands may specified constant value called immediate value location value may processor register memory address determined addressing mode cpu designs instruction decoder implemented hardwired unchangeable circuit others microprogram used translate instructions sets cpu configuration signals applied sequentially multiple clock pulses cases memory stores microprogram rewritable making possible change way cpu decodes instructions fetch decode steps execute step performed depending cpu architecture may consist single action sequence actions action various parts cpu electrically connected perform part desired operation action completed typically response clock pulse often results written internal cpu register quick access subsequent instructions cases results may written slower less expensive higher capacity main memory example addition instruction executed arithmetic logic unit alu inputs connected pair operand sources numbers summed alu configured perform addition operation sum operand inputs appear output alu output connected storage e.g. register memory receive sum clock pulse occurs sum transferred storage resulting sum large i.e. larger alu output word size arithmetic overflow flag set hardwired cpu circuitry set basic operations perform called instruction set operations may involve example adding subtracting two numbers comparing two numbers jumping different part program basic operation represented particular combination bits known machine language opcode executing instructions machine language program cpu decides operation perform decoding opcode complete machine language instruction consists opcode many cases additional bits specify arguments operation example numbers summed case addition operation going complexity scale machine language program collection machine language instructions cpu executes actual mathematical operation instruction performed combinational logic circuit within cpu processor known arithmetic logic unit alu general cpu executes instruction fetching memory using alu perform operation storing result memory beside instructions integer mathematics logic operations various machine instructions exist loading data memory storing back branching operations mathematical operations floating-point numbers performed cpu floating-point unit fpu control unit cu component cpu directs operation processor tells computer memory arithmetic logic unit input output devices respond instructions sent processor directs operation units providing timing control signals computer resources managed cu directs flow data cpu devices john von neumann included control unit part von neumann architecture modern computer designs control unit typically internal part cpu overall role operation unchanged since introduction arithmetic logic unit alu digital circuit within processor performs integer arithmetic bitwise logic operations inputs alu data words operated called operands status information previous operations code control unit indicating operation perform depending instruction executed operands may come internal cpu registers external memory may constants generated alu input signals settled propagated alu circuitry result performed operation appears alu outputs result consists data word may stored register memory status information typically stored special internal cpu register reserved purpose address generation unit agu sometimes also called address computation unit acu execution unit inside cpu calculates addresses used cpu access main memory address calculations handled separate circuitry operates parallel rest cpu number cpu cycles required executing various machine instructions reduced bringing performance improvements performing various operations cpus need calculate memory addresses required fetching data memory example in-memory positions array elements must calculated cpu fetch data actual memory locations address-generation calculations involve different integer arithmetic operations addition subtraction modulo operations bit shifts often calculating memory address involves one general-purpose machine instruction necessarily decode execute quickly incorporating agu cpu design together introducing specialized instructions use agu various address-generation calculations offloaded rest cpu often executed quickly single cpu cycle capabilities agu depend particular cpu architecture thus agus implement expose address-calculation operations also include advanced specialized instructions operate multiple operands time furthermore cpu architectures include multiple agus one address-calculation operation executed simultaneously bringing performance improvements capitalizing superscalar nature advanced cpu designs example intel incorporates multiple agus sandy bridge haswell microarchitectures increase bandwidth cpu memory subsystem allowing multiple memory-access instructions executed parallel high-end microprocessors desktop laptop server computers memory management unit translating logical addresses physical ram addresses providing memory protection paging abilities useful virtual memory simpler processors especially microcontrollers usually n't include mmu cpu cache hardware cache used central processing unit cpu computer reduce average cost time energy access data main memory cache smaller faster memory closer processor core stores copies data frequently used main memory locations cpus different independent caches including instruction data caches data cache usually organized hierarchy cache levels l1 l2 l3 l4 etc. modern fast cpus specialized exceptions multiple levels cpu caches first cpus used cache one level cache unlike later level 1 caches split l1d data l1i instructions almost current cpus caches split l1 cache also l2 caches larger processors l3 caches well l2 cache usually split acts common repository already split l1 cache every core multi-core processor dedicated l2 cache usually shared cores l3 cache higher-level caches shared cores split l4 cache currently uncommon generally dynamic random-access memory dram rather static random-access memory sram separate die chip also case historically l1 bigger chips allowed integration generally cache levels possible exception last level extra level cache tends bigger optimized differently types caches exist counted towards cache size important caches mentioned translation lookaside buffer tlb part memory management unit mmu cpus caches generally sized powers two 4 8 16 etc kib mib larger non-l1 sizes although ibm z13 96 kib l1 instruction cache cpus synchronous circuits means employ clock signal pace sequential operations clock signal produced external oscillator circuit generates consistent number pulses second form periodic square wave frequency clock pulses determines rate cpu executes instructions consequently faster clock instructions cpu execute second ensure proper operation cpu clock period longer maximum time needed signals propagate move cpu setting clock period value well worst-case propagation delay possible design entire cpu way moves data around edges rising falling clock signal advantage simplifying cpu significantly design perspective component-count perspective however also carries disadvantage entire cpu must wait slowest elements even though portions much faster limitation largely compensated various methods increasing cpu parallelism see however architectural improvements alone solve drawbacks globally synchronous cpus example clock signal subject delays electrical signal higher clock rates increasingly complex cpus make difficult keep clock signal phase synchronized throughout entire unit led many modern cpus require multiple identical clock signals provided avoid delaying single signal significantly enough cause cpu malfunction another major issue clock rates increase dramatically amount heat dissipated cpu constantly changing clock causes many components switch regardless whether used time general component switching uses energy element static state therefore clock rate increases energy consumption causing cpu require heat dissipation form cpu cooling solutions one method dealing switching unneeded components called clock gating involves turning clock signal unneeded components effectively disabling however often regarded difficult implement therefore see common usage outside low-power designs one notable recent cpu design uses extensive clock gating ibm powerpc-based xenon used xbox 360 way power requirements xbox 360 greatly reduced another method addressing problems global clock signal removal clock signal altogether removing global clock signal makes design process considerably complex many ways asynchronous clockless designs carry marked advantages power consumption heat dissipation comparison similar synchronous designs somewhat uncommon entire asynchronous cpus built without using global clock signal two notable examples arm compliant amulet mips r3000 compatible minimips rather totally removing clock signal cpu designs allow certain portions device asynchronous using asynchronous alus conjunction superscalar pipelining achieve arithmetic performance gains altogether clear whether totally asynchronous designs perform comparable better level synchronous counterparts evident least excel simpler math operations combined excellent power consumption heat dissipation properties makes suitable embedded computers every cpu represents numerical values specific way example early digital computers represented numbers familiar decimal base 10 numeral system values others employed unusual representations ternary base three nearly modern cpus represent numbers binary form digit represented two-valued physical quantity high low voltage related numeric representation size precision integer numbers cpu represent case binary cpu measured number bits significant digits binary encoded integer cpu process one operation commonly called word size bit width data path width integer precision integer size cpu integer size determines range integer values directly operate example 8-bit cpu directly manipulate integers represented eight bits range 256 2 discrete integer values integer range also affect number memory locations cpu directly address address integer value representing specific memory location example binary cpu uses 32 bits represent memory address directly address 2 memory locations circumvent limitation various reasons cpus use mechanisms bank switching allow additional memory addressed cpus larger word sizes require circuitry consequently physically larger cost consume power therefore generate heat result smaller 4- 8-bit microcontrollers commonly used modern applications even though cpus much larger word sizes 16 32 64 even 128-bit available higher performance required however benefits larger word size larger data ranges address spaces may outweigh disadvantages cpu internal data paths shorter word size reduce size cost example even though ibm system/360 instruction set 32-bit instruction set system/360 model 30 model 40 8-bit data paths arithmetic logical unit 32-bit add required four cycles one 8 bits operands even though motorola 68000 series instruction set 32-bit instruction set motorola 68000 motorola 68010 16-bit data paths arithmetic logical unit 32-bit add required two cycles gain advantages afforded lower higher bit lengths many instruction sets different bit widths integer floating-point data allowing cpus implementing instruction set different bit widths different portions device example ibm system/360 instruction set primarily 32 bit supported 64-bit floating point values facilitate greater accuracy range floating point numbers system/360 model 65 8-bit adder decimal fixed-point binary arithmetic 60-bit adder floating-point arithmetic many later cpu designs use similar mixed bit width especially processor meant general-purpose usage reasonable balance integer floating point capability required description basic operation cpu offered previous section describes simplest form cpu take type cpu usually referred subscalar operates executes one instruction one two pieces data time less one instruction per clock cycle process gives rise inherent inefficiency subscalar cpus since one instruction executed time entire cpu must wait instruction complete proceeding next instruction result subscalar cpu gets hung instructions take one clock cycle complete execution even adding second execution unit see improve performance much rather one pathway hung two pathways hung number unused transistors increased design wherein cpu execution resources operate one instruction time possibly reach scalar performance one instruction per clock cycle however performance nearly always subscalar less one instruction per clock cycle attempts achieve scalar better performance resulted variety design methodologies cause cpu behave less linearly parallel referring parallelism cpus two terms generally used classify design techniques methodology differs ways implemented well relative effectiveness afford increasing cpu performance application one simplest methods used accomplish increased parallelism begin first steps instruction fetching decoding prior instruction finishes executing simplest form technique known instruction pipelining used almost modern general-purpose cpus pipelining allows one instruction executed given time breaking execution pathway discrete stages separation compared assembly line instruction made complete stage exits execution pipeline retired pipelining however introduce possibility situation result previous operation needed complete next operation condition often termed data dependency conflict cope additional care must taken check sorts conditions delay portion instruction pipeline occurs naturally accomplishing requires additional circuitry pipelined processors complex subscalar ones though significantly pipelined processor become nearly scalar inhibited pipeline stalls instruction spending one clock cycle stage improvement upon idea instruction pipelining led development method decreases idle time cpu components even designs said superscalar include long instruction pipeline multiple identical execution units load-store units arithmetic-logic units floating-point units address generation units superscalar pipeline multiple instructions read passed dispatcher decides whether instructions executed parallel simultaneously dispatched available execution units resulting ability several instructions executed simultaneously general instructions superscalar cpu able dispatch simultaneously waiting execution units instructions completed given cycle difficulty design superscalar cpu architecture lies creating effective dispatcher dispatcher needs able quickly correctly determine whether instructions executed parallel well dispatch way keep many execution units busy possible requires instruction pipeline filled often possible gives rise need superscalar architectures significant amounts cpu cache also makes hazard-avoiding techniques like branch prediction speculative execution register renaming out-of-order execution transactional memory crucial maintaining high levels performance attempting predict branch path conditional instruction take cpu minimize number times entire pipeline must wait conditional instruction completed speculative execution often provides modest performance increases executing portions code may needed conditional operation completes out-of-order execution somewhat rearranges order instructions executed reduce delays due data dependencies also case single instruction stream multiple data stream\u2014a case lot data type processed\u2014 modern processors disable parts pipeline single instruction executed many times cpu skips fetch decode phases thus greatly increases performance certain occasions especially highly monotonous program engines video creation software photo processing case portion cpu superscalar part part suffers performance penalty due scheduling stalls intel p5 pentium two superscalar alus could accept one instruction per clock cycle fpu could accept one instruction per clock cycle thus p5 integer superscalar floating point superscalar intel successor p5 architecture p6 added superscalar capabilities floating point features therefore afforded significant increase floating point instruction performance simple pipelining superscalar design increase cpu ilp allowing single processor complete execution instructions rates surpassing one instruction per clock cycle modern cpu designs least somewhat superscalar nearly general purpose cpus designed last decade superscalar later years emphasis designing high-ilp computers moved cpu hardware software interface isa strategy long instruction word vliw causes ilp become implied directly software reducing amount work cpu must perform boost ilp thereby reducing design complexity another strategy achieving performance execute multiple threads processes parallel area research known parallel computing flynn taxonomy strategy known multiple instruction stream multiple data stream mimd one technology used purpose multiprocessing mp initial flavor technology known symmetric multiprocessing smp small number cpus share coherent view memory system scheme cpu additional hardware maintain constantly up-to-date view memory avoiding stale views memory cpus cooperate program programs migrate one cpu another increase number cooperating cpus beyond handful schemes non-uniform memory access numa directory-based coherence protocols introduced 1990s smp systems limited small number cpus numa systems built thousands processors initially multiprocessing built using multiple discrete cpus boards implement interconnect processors processors interconnect implemented single chip technology known chip-level multiprocessing cmp single chip multi-core processor later recognized finer-grain parallelism existed single program single program might several threads functions could executed separately parallel earliest examples technology implemented input/output processing direct memory access separate thread computation thread general approach technology introduced 1970s systems designed run multiple computation threads parallel technology known multi-threading mt approach considered cost-effective multiprocessing small number components within cpu replicated support mt opposed entire cpu case mp mt execution units memory system including caches shared among multiple threads downside mt hardware support multithreading visible software mp thus supervisor software like operating systems undergo larger changes support mt one type mt implemented known temporal multithreading one thread executed stalled waiting data return external memory scheme cpu would quickly context switch another thread ready run switch often done one cpu clock cycle ultrasparc t1 another type mt simultaneous multithreading instructions multiple threads executed parallel within one cpu clock cycle several decades 1970s early 2000s focus designing high performance general purpose cpus largely achieving high ilp technologies pipelining caches superscalar execution out-of-order execution etc trend culminated large power-hungry cpus intel pentium 4 early 2000s cpu designers thwarted achieving higher performance ilp techniques due growing disparity cpu operating frequencies main memory operating frequencies well escalating cpu power dissipation owing esoteric ilp techniques cpu designers borrowed ideas commercial computing markets transaction processing aggregate performance multiple programs also known throughput computing important performance single thread process reversal emphasis evidenced proliferation dual core processor designs notably intel newer designs resembling less superscalar p6 architecture late designs several processor families exhibit cmp including x86-64 opteron athlon 64 x2 sparc ultrasparc t1 ibm power4 power5 well several video game console cpus like xbox 360 triple-core powerpc design playstation 3 7-core cell microprocessor less common increasingly important paradigm processors indeed computing general deals data parallelism processors discussed earlier referred type scalar device name implies vector processors deal multiple pieces data context one instruction contrasts scalar processors deal one piece data every instruction using flynn taxonomy two schemes dealing data generally referred single instruction stream multiple data stream simd single instruction stream single data stream sisd respectively great utility creating processors deal vectors data lies optimizing tasks tend require operation example sum dot product performed large set data classic examples types tasks include multimedia applications images video sound well many types scientific engineering tasks whereas scalar processor must complete entire process fetching decoding executing instruction value set data vector processor perform single operation comparatively large set data one instruction possible application tends require many steps apply one operation large set data early vector processors cray-1 associated almost exclusively scientific research cryptography applications however multimedia largely shifted digital media need form simd general-purpose processors become significant shortly inclusion floating-point units started become commonplace general-purpose processors specifications implementations simd execution units also began appear general-purpose processors early simd specifications like hp multimedia acceleration extensions max intel mmx integer-only proved significant impediment software developers since many applications benefit simd primarily deal floating-point numbers progressively developers refined remade early designs common modern simd specifications usually associated one isa notable modern examples include intel sse powerpc-related altivec also known vmx cloud computing involve subdividing cpu operation virtual central processing units vcpus host virtual equivalent physical machine virtual system operating several physical machines operating tandem managed whole grouped computing memory resources form cluster systems possible dynamically add remove cluster resources available host cluster level partitioned resources pools fine granularity performance speed processor depends among many factors clock rate generally given multiples hertz instructions per clock ipc together factors instructions per second ips cpu perform many reported ips values represented peak execution rates artificial instruction sequences branches whereas realistic workloads consist mix instructions applications take longer execute others performance memory hierarchy also greatly affects processor performance issue barely considered mips calculations problems various standardized tests often called benchmarks purposesuch specinthave developed attempt measure real effective performance commonly used applications processing performance computers increased using multi-core processors essentially plugging two individual processors called cores sense one integrated circuit ideally dual core processor would nearly twice powerful single core processor practice performance gain far smaller 50 due imperfect software algorithms implementation increasing number cores processor i.e dual-core quad-core etc increases workload handled means processor handle numerous asynchronous events interrupts etc take toll cpu overwhelmed cores thought different floors processing plant floor handling different task sometimes cores handle tasks cores adjacent single core enough handle information due specific capabilities modern cpus simultaneous multithreading uncore involve sharing actual cpu resources aiming increased utilization monitoring performance levels hardware use gradually became complex task response cpus implement additional hardware logic monitors actual use various parts cpu provides various counters accessible software example intel performance counter monitor technology", + "neighbors": [ + 3, + 29, + 51, + 53, + 61, + 71, + 75, + 76, + 78, + 85, + 86, + 105, + 123, + 127, + 130, + 134, + 162, + 185, + 188, + 193, + 195, + 206, + 210, + 212, + 214, + 224, + 227, + 228, + 230, + 234, + 238, + 253, + 258, + 260, + 264, + 269, + 270, + 271, + 272, + 280, + 292, + 314, + 331, + 335, + 337, + 349, + 352, + 359, + 362, + 386, + 388, + 398, + 403, + 408, + 413, + 429, + 445, + 448, + 457, + 460, + 465, + 481, + 484, + 486, + 489, + 508, + 511, + 529, + 571, + 589, + 603, + 607, + 610, + 611, + 615, + 619, + 633, + 634, + 641, + 643, + 659, + 661, + 707, + 719, + 752, + 754, + 776, + 803, + 804, + 821, + 846, + 853, + 891, + 893, + 907, + 910, + 917, + 918, + 919, + 923, + 927, + 937, + 946, + 956, + 966, + 972, + 976, + 979, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1019, + 1022, + 1044, + 1052, + 1057, + 1063, + 1072, + 1081, + 1088, + 1090, + 1100, + 1111, + 1113, + 1125, + 1138, + 1151, + 1158, + 1160, + 1161, + 1174, + 1178, + 1193, + 1208, + 1213, + 1215, + 1219, + 1220, + 1222, + 1224, + 1237, + 1256, + 1262, + 1263, + 1272, + 1273, + 1284, + 1290, + 1294, + 1305, + 1309, + 1314, + 1363, + 1372, + 1373, + 1379, + 1398, + 1415, + 1422, + 1459, + 1469, + 1483, + 1488, + 1499, + 1503, + 1504, + 1505, + 1507, + 1511, + 1518, + 1519, + 1522, + 1523, + 1525, + 1527, + 1529, + 1535, + 1544, + 1557, + 1566, + 1586, + 1589, + 1591, + 1605, + 1608, + 1616, + 1619, + 1629, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 271, + "label": 3, + "text": "Comparison_of_instruction_set_architectures:comparison instruction set architectures instruction set architecture isa abstract model computer also referred architecture computer architecture realization isa called implementation isa permits multiple implementations may vary performance physical size monetary cost among things isa serves interface software hardware software written isa run different implementations isa enabled binary compatibility different generations computers easily achieved development computer families developments helped lower cost computers increase applicability reasons isa one important abstractions computing today isa defines everything machine language programmer needs know order program computer isa defines differs isas general isas define supported data types state main memory registers semantics memory consistency addressing modes instruction set set machine instructions comprises computer machine language input/output model early decades computing computers used binary decimal even ternary contemporary computers almost exclusively binary computer architectures often described n -bit architectures today n often 8 16 32 64 sizes used actually strong simplification computer architecture often less natural datasizes instruction set hardware implementation may different many architectures instructions operating half and/or twice size respective processors major internal datapaths examples 8080 z80 mc68000 well many others type implementations twice wide operation typically also takes around twice many clock cycles case high performance implementations 68000 instance means 8 instead 4 clock ticks particular chip may described 32-bit architecture 16-bit implementation external databus width often useful determine width architecture ns32008 ns32016 ns32032 basically 32-bit chip different external data buses ns32764 64-bit bus used 32-bit registers width addresses may may different width data early 32-bit microprocessors often 24-bit address system/360 processors number operands one factors may give indication performance instruction set three-operand architecture allow computed one instruction two-operand architecture allow computed one instruction two instructions need executed simulate single three-operand instruction architecture may use big little endianness configurable use either little endian processors order bytes memory least significant byte multi-byte value lowest-numbered memory location big endian architectures instead order significant byte lowest-numbered address x86 architecture well several 8-bit architectures little endian risc architectures sparc power powerpc mips originally big endian arm little endian many including arm configurable endianness applies processors allow individual addressing units data bytes smaller basic addressable machine word usually number registers power two e.g 8 16 32 cases hardwired-to-zero pseudo-register included part register files architectures mostly simplify indexing modes table counts integer registers usable general instructions moment architectures always include special-purpose registers program pointer pc counted unless mentioned note architectures sparc register window architectures count indicates many registers available within register window also non-architected registers register renaming counted note common type architecture load-store synonym register register meaning instructions access memory except special \u2013 load register \u2013 store register \u2013 possible exceptions atomic memory operations locking table compares basic information instruction sets implemented cpu architectures", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 137, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 830, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1158, + 1160, + 1161, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1351, + 1398, + 1437, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 272, + "label": 3, + "text": "Computer_data_storage:computer data storage digvijay singh computer data storage often called storage memory technology consisting computer components recording media used retain digital data core function fundamental component computers central processing unit cpu computer manipulates data performing computations practice almost computers use storage hierarchy puts fast expensive small storage options close cpu slower larger cheaper options farther away generally fast volatile technologies lose data power referred memory slower persistent technologies referred storage even first computer designs charles babbage analytical engine percy ludgate analytical machine clearly distinguished processing memory babbage stored numbers rotations gears ludgate stored numbers displacements rods shuttles distinction extended von neumann architecture cpu consists two main parts control unit arithmetic logic unit alu former controls flow data cpu memory latter performs arithmetic logical operations data without significant amount memory computer would merely able perform fixed operations immediately output result would reconfigured change behavior acceptable devices desk calculators digital signal processors specialized devices von neumann machines differ memory store operating instructions data computers versatile need hardware reconfigured new program simply reprogrammed new in-memory instructions also tend simpler design relatively simple processor may keep state successive computations build complex procedural results modern computers von neumann machines modern digital computer represents data using binary numeral system text numbers pictures audio nearly form information converted string bits binary digits value 1 0 common unit storage byte equal 8 bits piece information handled computer device whose storage space large enough accommodate binary representation piece information simply data example complete works shakespeare 1250 pages print stored five megabytes 40 million bits one byte per character data encoded assigning bit pattern character digit multimedia object many standards exist encoding e.g. character encodings like ascii image encodings like jpeg video encodings like mpeg-4 adding bits encoded unit redundancy allows computer detect errors coded data correct based mathematical algorithms errors generally occur low probabilities due random bit value flipping physical bit fatigue loss physical bit storage ability maintain distinguishable value 0 1 due errors inter intra-computer communication random bit flip e.g. due random radiation typically corrected upon detection bit group malfunctioning physical bits always specific defective bit known group definition depends specific storage device typically automatically fenced-out taken use device replaced another functioning equivalent group device corrected bit values restored possible cyclic redundancy check crc method typically used communications storage error detection detected error retried data compression methods allow many cases database represent string bits shorter bit string compress reconstruct original string decompress needed utilizes substantially less storage tens percents many types data cost computation compress decompress needed analysis trade-off storage cost saving costs related computations possible delays data availability done deciding whether keep certain data compressed security reasons certain types data e.g. credit-card information may kept encrypted storage prevent possibility unauthorized information reconstruction chunks storage snapshots generally lower storage hierarchy lesser bandwidth greater access latency cpu traditional division storage primary secondary tertiary off-line storage also guided cost per bit contemporary usage memory usually semiconductor storage read-write random-access memory typically dram dynamic ram forms fast temporary storage storage consists storage devices media directly accessible cpu secondary tertiary storage typically hard disk drives optical disc drives devices slower ram non-volatile retaining contents powered historically memory called core memory main memory real storage internal memory meanwhile non-volatile storage devices referred secondary storage external memory auxiliary/peripheral storage primary storage also known main memory internal memory prime memory often referred simply memory one directly accessible cpu cpu continuously reads instructions stored executes required data actively operated also stored uniform manner historically early computers used delay lines williams tubes rotating magnetic drums primary storage 1954 unreliable methods mostly replaced magnetic core memory core memory remained dominant 1970s advances integrated circuit technology allowed semiconductor memory become economically competitive led modern random-access memory ram small-sized light quite expensive time particular types ram used primary storage also volatile i.e lose information powered shown diagram traditionally two sub-layers primary storage besides main large-capacity ram main memory directly indirectly connected central processing unit via memory bus actually two buses diagram address bus data bus cpu firstly sends number address bus number called memory address indicates desired location data reads writes data memory cells using data bus additionally memory management unit mmu small device cpu ram recalculating actual memory address example provide abstraction virtual memory tasks ram types used primary storage volatile uninitialized start computer containing storage would source read instructions order start computer hence non-volatile primary storage containing small startup program bios used bootstrap computer read larger program non-volatile secondary storage ram start execute non-volatile technology used purpose called rom read-only memory terminology may somewhat confusing rom types also capable random access many types rom literally read updates possible however slow memory must erased large portions re-written embedded systems run programs directly rom similar programs rarely changed standard computers store non-rudimentary programs rom rather use large capacities secondary storage non-volatile well costly recently primary storage secondary storage uses refer historically called respectively secondary storage tertiary storage secondary storage also known external memory auxiliary storage differs primary storage directly accessible cpu computer usually uses input/output channels access secondary storage transfer desired data primary storage secondary storage non-volatile retaining data power shut modern computer systems typically two orders magnitude secondary storage primary storage secondary storage less expensive modern computers hard disk drives hdds solid-state drives ssds usually used secondary storage access time per byte hdds ssds typically measured milliseconds one thousandth seconds access time per byte primary storage measured nanoseconds one billionth seconds thus secondary storage significantly slower primary storage rotating optical storage devices cd dvd drives even longer access times examples secondary storage technologies include usb flash drives floppy disks magnetic tape paper tape punched cards ram disks disk read/write head hdds reaches proper placement data subsequent data track fast access reduce seek time rotational latency data transferred disks large contiguous blocks sequential block access disks orders magnitude faster random access many sophisticated paradigms developed design efficient algorithms based upon sequential block access another way reduce i/o bottleneck use multiple disks parallel order increase bandwidth primary secondary memory secondary storage often formatted according file system format provides abstraction necessary organize data files directories also providing metadata describing owner certain file access time access permissions information computer operating systems use concept virtual memory allowing utilization primary storage capacity physically available system primary memory fills system moves least-used chunks pages swap file page file secondary storage retrieving later needed lot pages moved slower secondary storage system performance degraded tertiary storage tertiary memory level secondary storage typically involves robotic mechanism mount insert dismount removable mass storage media storage device according system demands data often copied secondary storage use primarily used archiving rarely accessed information since much slower secondary storage e.g 5\u201360 seconds vs. 1\u201310 milliseconds primarily useful extraordinarily large data stores accessed without human operators typical examples include tape libraries optical jukeboxes computer needs read information tertiary storage first consult catalog database determine tape disc contains information next computer instruct robotic arm fetch medium place drive computer finished reading information robotic arm return medium place library tertiary storage also known nearline storage near online formal distinction online nearline offline storage example always-on spinning hard disk drives online storage spinning drives spin automatically massive arrays idle disks maid nearline storage removable media tape cartridges automatically loaded tape libraries nearline storage tape cartridges must manually loaded offline storage off-line storage computer data storage medium device control processing unit medium recorded usually secondary tertiary storage device physically removed disconnected must inserted connected human operator computer access unlike tertiary storage accessed without human interaction off-line storage used transfer information since detached medium easily physically transported additionally case disaster example fire destroys original data medium remote location probably unaffected enabling disaster recovery off-line storage increases general information security since physically inaccessible computer data confidentiality integrity affected computer-based attack techniques also information stored archival purposes rarely accessed off-line storage less expensive tertiary storage modern personal computers secondary tertiary storage media also used off-line storage optical discs flash memory devices popular much lesser extent removable hard disk drives enterprise uses magnetic tape predominant older examples floppy disks zip disks punched cards storage technologies levels storage hierarchy differentiated evaluating certain core characteristics well measuring characteristics specific particular implementation core characteristics volatility mutability accessibility addressability particular implementation storage technology characteristics worth measuring capacity performance non-volatile memory retains stored information even constantly supplied electric power suitable long-term storage information volatile memory requires constant power maintain stored information fastest memory technologies volatile ones although universal rule since primary storage required fast predominantly uses volatile memory dynamic random-access memory form volatile memory also requires stored information periodically reread rewritten refreshed otherwise would vanish static random-access memory form volatile memory similar dram exception never needs refreshed long power applied loses content power supply lost uninterruptible power supply ups used give computer brief window time move information primary volatile storage non-volatile storage batteries exhausted systems example emc symmetrix integrated batteries maintain volatile storage several minutes utilities hdparm sar used measure io performance linux full disk encryption volume virtual disk encryption andor file/folder encryption readily available storage devices hardware memory encryption available intel architecture supporting total memory encryption tme page granular memory encryption multiple keys mktme sparc m7 generation since october 2015.. commonly used data storage media semiconductor magnetic optical paper still sees limited usage fundamental storage technologies all-flash arrays afas proposed development semiconductor memory uses semiconductor-based integrated circuits store information semiconductor memory chip may contain millions tiny transistors capacitors volatile non-volatile forms semiconductor memory exist modern computers primary storage almost exclusively consists dynamic volatile semiconductor memory dynamic random-access memory since turn century type non-volatile semiconductor memory known flash memory steadily gained share off-line storage home computers non-volatile semiconductor memory also used secondary storage various advanced electronic devices specialized computers designed early 2006 notebook desktop computer manufacturers started using flash-based solid-state drives ssds default configuration options secondary storage either addition instead traditional hdd magnetic storage uses different patterns magnetization magnetically coated surface store information magnetic storage non-volatile information accessed using one read/write heads may contain one recording transducers read/write head covers part surface head medium must moved relative another order access data modern computers magnetic storage take forms early computers magnetic storage also used optical storage typical optical disc stores information deformities surface circular disc reads information illuminating surface laser diode observing reflection optical disc storage non-volatile deformities may permanent read media formed write media reversible recordable read/write media following forms currently common use magneto-optical disc storage optical disc storage magnetic state ferromagnetic surface stores information information read optically written combining magnetic optical methods magneto-optical disc storage non-volatile sequential access slow write fast read storage used tertiary off-line storage 3d optical data storage also proposed light induced magnetization melting magnetic photoconductors also proposed high-speed low-energy consumption magneto-optical storage paper data storage typically form paper tape punched cards long used store information automatic processing particularly general-purpose computers existed information recorded punching holes paper cardboard medium read mechanically later optically determine whether particular location medium solid contained hole technologies allow people make marks paper easily read machine\u2014these widely used tabulating votes grading standardized tests barcodes made possible object sold transported computer readable information securely attached group bits malfunction may resolved error detection correction mechanisms see storage device malfunction requires different solutions following solutions commonly used valid storage devices device mirroring typical raid designed handle single device failure raid group devices however second failure occurs raid group completely repaired first failure data lost probability single failure typically small thus probability two failures raid group time proximity much smaller approximately probability squared i.e. multiplied database tolerate even smaller probability data loss raid group replicated mirrored many cases mirroring done geographically remotely different storage array handle also recovery disasters see disaster recovery secondary tertiary storage may connect computer utilizing computer networks concept pertain primary storage shared multiple processors lesser degree large quantities individual magnetic tapes optical magneto-optical discs may stored robotic tertiary storage devices tape storage field known tape libraries optical storage field optical jukeboxes optical disk libraries per analogy smallest forms either technology containing one drive device referred autoloaders autochangers robotic-access storage devices may number slots holding individual media usually one picking robots traverse slots load media built-in drives arrangement slots picking devices affects performance important characteristics storage possible expansion options adding slots modules drives robots tape libraries may 10 100,000 slots provide terabytes petabytes near-line information optical jukeboxes somewhat smaller solutions 1,000 slots robotic storage used backups high-capacity archives imaging medical video industries hierarchical storage management known archiving strategy automatically migrating long-unused files fast hard disk storage libraries jukeboxes files needed retrieved back disk", + "neighbors": [ + 38, + 68, + 76, + 85, + 105, + 123, + 127, + 134, + 171, + 189, + 193, + 206, + 210, + 212, + 221, + 224, + 227, + 230, + 234, + 270, + 271, + 272, + 282, + 290, + 306, + 314, + 335, + 346, + 359, + 365, + 379, + 387, + 388, + 397, + 399, + 401, + 429, + 445, + 448, + 457, + 460, + 463, + 494, + 508, + 528, + 570, + 589, + 615, + 643, + 659, + 719, + 723, + 752, + 770, + 776, + 803, + 821, + 834, + 846, + 857, + 891, + 899, + 907, + 921, + 937, + 980, + 984, + 992, + 994, + 1006, + 1009, + 1013, + 1016, + 1052, + 1081, + 1085, + 1099, + 1111, + 1113, + 1125, + 1138, + 1159, + 1168, + 1174, + 1179, + 1219, + 1222, + 1224, + 1227, + 1256, + 1257, + 1272, + 1284, + 1288, + 1290, + 1322, + 1324, + 1366, + 1368, + 1369, + 1372, + 1379, + 1398, + 1415, + 1421, + 1469, + 1505, + 1507, + 1518, + 1525, + 1549, + 1557, + 1573, + 1588, + 1608, + 1616, + 1618, + 1632, + 1634 + ], + "mask": "Test" + }, + { + "node_id": 273, + "label": 9, + "text": "Mallard_BASIC:mallard basic mallard basic basic interpreter cp/m written locomotive software supplied amstrad pcw range small business computers zx spectrum +3 version cp/m plus acorn bbc micro z80 second processor 1980s standard industry practice bundle basic interpreter microcomputers pcw followed practice primarily wordprocessor business use dedicated wp also ran cp/m operating system though existing implementations basic cp/m digital research cbasic third-party zbasic followed earlier 1970s model compilers fed source code prepared separate text editor mallard like traditional micro rom basic integrated editor tailored pcw non-standard 90-column screen although pcw actually excellent monochrome graphics support time specification closely comparable hercules graphics card pc mallard basic graphics support whatsoever instead locomotive optimised business use instance full isam random-access file support making easier write database applications also optimised speed named lner a4 class 4468 mallard locomotive fastest steam locomotive world displaying company fondness railway-oriented nomenclature instance see company name fact locomotive name came phrase run like train theme used name mallard basic locomotive product named anything railway-oriented acorn version designed simply run compact software small business accounting products acorn including target z80 second processor small businesses mallard major innovation designed specifically acorn addition jetsam b*-tree keyed access filing system give similar superior features miksam product compact originally designed around graphics could implemented loading gsx extension cp/m cumbersome basic programmers lack graphics support rectified several basic toolkits popular lightning extended basic leb\u2014see external links patched mallard basic replacing redundant let keyword leb could followed wide variety parameters allow sophisticated graphics time drawn screen saved disc printed et cetera probably widespread mallard application ever rped text editor supplied pcw name short roland perry editor program put together quickly roland perry amstrad executive running computer product development realised cp/m-80 came usable full-screen editor users requirement edit configuration files problem apparent dos plus ms-dos supplied ibm-compatible amstrad computers rped machines written 8086 assembler mallard basic pc version mallard basic still available locoscript software ms-dos program run windows disc version licence full introduction reference manual", + "neighbors": [ + 0, + 8, + 236, + 292, + 510, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1304, + 1306, + 1372, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 274, + "label": 7, + "text": "United_Devices:united devices united devices inc. privately held commercial distributed computing company focused use grid computing manage high-performance computing systems enterprise cluster management products services allowed users allocate workloads computers devices throughout enterprises aggregating computing power would normally go unused operated name univa ud time merging univa september 17 2007 founded 1999 austin texas united devices began distributed computing expertise distributed.net seti home although original technical staff organizations remained years april 2001 grid.org formally announced philanthropic non-profit website demonstrate benefits internet-based large scale grid computing later 2002 help ud ntt data launched similar internet-based cell computing project targeting japanese users 2004 ibm united devices worked together start world community grid project another demonstration internet-based grid computing august 2005 united devices acquired paris-based gridxpert company added synergy product lineup 2006 company acknowledged seeing industry shift using grid computing compute-intensive applications towards data center automation business application optimization partly response market shifts reorganization grid.org shut april 27 2007 completing mission demonstrate viability benefits large-scale internet-based grid computing september 17 2007 company announced would merge lisle illinois-based univa operate new name univa ud combined company would offer open source solutions based around globus toolkit continuing sell existing grid products support existing customers june 26 2008 united devices client software world community grid finished role completely relayed boinc 2001 2007 united devices operated series public projects grid.org website part philanthropic effort also acted marketing tool helping spread awareness grid mp product demonstrating platform scalability costs associated operating past projects grid.org financially sponsored part companies including microsoft intel ibm april 27 2007 united devices closed grid.org cancer research project announcement completed mission demonstrate viability benefits large-scale internet-based grid computing", + "neighbors": [ + 175, + 399, + 481, + 507, + 847, + 909, + 1099, + 1354, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 275, + "label": 2, + "text": "List_of_software_package_management_systems:list software package management systems list software package management systems categorized first package format binary source code hybrid operating system family following package management systems distribute apps binary package form i.e. apps compiled ready installed use following package management systems distribute source code apps either user must know compile packages come script automates compilation process example gobolinux recipe file contains information download unpack compile install package using compile tool cases user must provide computing power time needed compile app legally responsible consequences compiling package following unify package management several linux sometimes unix variants based concept recipe file wide variety package management systems common use today proprietary software operating systems handling installation proprietary free packages", + "neighbors": [ + 31, + 33, + 134, + 195, + 207, + 209, + 213, + 216, + 267, + 275, + 292, + 301, + 308, + 327, + 337, + 351, + 380, + 431, + 509, + 521, + 538, + 567, + 571, + 664, + 682, + 716, + 725, + 796, + 825, + 897, + 899, + 948, + 961, + 986, + 992, + 1004, + 1046, + 1102, + 1110, + 1120, + 1138, + 1189, + 1214, + 1225, + 1227, + 1235, + 1241, + 1252, + 1287, + 1292, + 1301, + 1311, + 1313, + 1360, + 1366, + 1369, + 1391, + 1456, + 1458, + 1509, + 1524, + 1547, + 1602 + ], + "mask": "Validation" + }, + { + "node_id": 276, + "label": 4, + "text": "X-Wrt:x-wrt x-wrt discontinued set packages patches provide web interface linux distribution openwrt based haserl nothing x window system allows web based management openwrt device originally created package openwrt white russian present found openwrt trunk webif package newer features dual-band support may present 31 october 2013 x-wrt homepage moved google code x-wrt extension openwrt end-user openwrt prior release 8.09 minimal web-management console whereas x-wrt supplied enhanced web-management console webif\u00b2 40 control status pages router webif\u00b2 pages include graphical traffic system status monitoring pages control status network wireless security controls provided data logging booting cron nvram file editing linux package management snmp backup restore firmware upgrade wan vlan wi-fi wep wpa wds mac filtering firewall port forwarding dhcp dnsmasq hostnames ip control routing upnp qos dyndns wol openvpn pptp hotspots", + "neighbors": [ + 217, + 333, + 413, + 444, + 455, + 494, + 569, + 716, + 1138, + 1397, + 1451, + 1462 + ], + "mask": "Test" + }, + { + "node_id": 277, + "label": 5, + "text": "Lunascape:lunascape lunascape web browser developed lunascape corporation tokyo japan unusual contains three rendering engines gecko used mozilla firefox webkit used apple safari trident used microsoft internet explorer feature common avant web browser user switch layout engines seamlessly lunascape available windows android platforms well ipad iphone lunascape released october 2001 founders college browser became popular hidekazu kondo established lunascape corporation august 2004 pursuing phd hidekazu kondo became ceo lunascape corporation additionally lunascape selected exploratory software project commissioned japanese government company branched united states june 2008 based sunnyvale california lunascape introduced browser internationally december 2008", + "neighbors": [ + 14, + 83, + 95, + 107, + 258, + 427, + 509, + 530, + 531, + 582, + 585, + 623, + 646, + 668, + 684, + 713, + 734, + 862, + 886, + 939, + 953, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1339, + 1376, + 1378, + 1408, + 1423, + 1528, + 1550, + 1563, + 1569, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 278, + "label": 6, + "text": "Hard_link:hard link computing hard link directory entry associates name file file system directory-based file systems must least one hard link giving original name file term \u201c hard link \u201d usually used file systems allow one hard link file creating additional hard link effect giving one file multiple names e.g different names different directories independently connect data disk none depends others causes alias effect e.g file opened one names changes made content changes also visible file opened alternative name contrast soft link \u201c shortcut \u201d file direct link data rather short file contains text file name location gives direct access yet another file name within directory name contained referred soft link may either hard link another soft link also creates aliasing different way every directory file special contains list file names maintained file system since directories files multiple hard links directories possible could create loops within structure directories rather branching structure like tree reason creation hard links directories sometimes forbidden multiple hard links \u2013 multiple directory entries file \u2013 supported posix-compliant partially posix-compliant operating systems linux android macos also windows nt4 later windows nt operating systems support also depends type file system used instance ntfs file system supports multiple hard links fat refs posix-compliant partially posix-compliant operating systems unix-like systems additional hard links existing files created system call ln link command-line utilities codice_1 command reveal many hard links point given file link count also included output codice_2 microsoft windows hard links created using codice_3 command windows nt 6.0 later systems windows vista earlier systems windows xp windows server 2003 using codice_4 windows api windows 2000 onwards includes createhardlink call create hard links deletefile used remove getfileinformationbyhandle used determine number hard links associated file hard links require ntfs partition starting windows vista hard links used windows component store winsxs keep track different versions dlls stored hard disk drive unix-like emulation compatibility software running windows cygwin subsystem unix-based applications allow use posix interfaces windows process unlinking dissociates name data volume without destroying associated data data still accessible long least one link points still exists last link removed space considered free process called undeleting allows recreation links data longer associated name however process available systems often reliable file deleted added free space map re-use portion deleted file space claimed new data undeletion unsuccessful previous data overwritten may result cross-linking new data leading filesystem corruption additionally deleted files solid state drives may erased time storage device reclamation free space file systems support hard links use reference counting integer value stored physical data section integer represents total number hard links created point data new link created value increased one link removed value decreased one link count becomes zero operating system usually automatically deallocates data space file process file opened access may choose immediately either performance enable undelete command maintenance value guarantees dangling hard links pointing nowhere happen symbolic links filesystem file associated inode preserved long single hard link directory reference points process keeps associated file open relieving burden accounting programmer user simple method file system track use given area storage zero values indicate free space nonzero values indicate used space posix-compliant operating systems many unix-variants reference count file directory returned stat fstat system calls codice_5 field codice_6 figure right two hard links named link a.txt link b.txt point physical data file link a.txt opened editor modified saved changes visible file link b.txt opened viewing since filenames point data opened posix systems associated file descriptor remains valid opening even original file moved true file opened link b.txt \u2014 name associated data editors however break hard link concept e.g emacs opening file link b.txt editing emacs first renames link b.txt link b.txt~ loads link b.txt~ editor saves modified contents newly created link b.txt using approach two hard links link a.txt link b.txt~ backup file link b.txt would one link longer shares data link a.txt behavior changed using emacs variable codice_7 number hard links physical data may created access data user needs specify name existing link operating system resolve location actual data one links removed posix unlink function example unix codice_8 command data still accessible link remains links removed process file open space occupied data freed allowing reused future semantic allows deleting open files without affecting process uses technique commonly used ensure temporary files deleted automatically program termination including case abnormal termination prevent loops filesystem keep interpretation parent directory consistent many modern operating systems allow hard links directories unix system v allowed superuser permission make links mac os x v10.5 leopard newer use hard links directories time machine backup mechanism symbolic links ntfs junction points generally used instead purpose hard links created files volume link file different volume needed may created symbolic link maximum number hard links single file limited size reference counter unix-like systems counter usually machine-word-sized 32- 64-bit 4,294,967,295 18,446,744,073,709,551,615 links respectively though filesystems number hard links limited strictly on-disk format linux 3.11 ext4 filesystem limits number hard links file 65,000 windows ntfs filesystem limit 1024 hard links file hard links criticized high-maintenance design neil brown linux weekly news since complicate design programs handle directory trees including archivers disk usage tools du must take care de-duplicate files linked multiple times hierarchy brown also calls attention fact plan 9 bell labs intended successor unix include concept hard link", + "neighbors": [ + 26, + 34, + 40, + 55, + 63, + 66, + 79, + 93, + 99, + 108, + 134, + 148, + 150, + 153, + 222, + 233, + 262, + 268, + 295, + 312, + 326, + 334, + 336, + 344, + 349, + 358, + 365, + 433, + 435, + 438, + 443, + 485, + 494, + 495, + 521, + 524, + 553, + 557, + 558, + 570, + 574, + 615, + 638, + 662, + 689, + 705, + 723, + 728, + 791, + 801, + 815, + 865, + 887, + 889, + 892, + 900, + 908, + 912, + 922, + 935, + 942, + 961, + 982, + 989, + 997, + 1025, + 1035, + 1056, + 1064, + 1092, + 1097, + 1098, + 1104, + 1109, + 1124, + 1138, + 1151, + 1157, + 1187, + 1201, + 1202, + 1212, + 1234, + 1247, + 1252, + 1261, + 1283, + 1287, + 1322, + 1328, + 1338, + 1346, + 1363, + 1370, + 1381, + 1417, + 1445, + 1459, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1565, + 1589, + 1613, + 1620, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 279, + "label": 1, + "text": "SHERPA/Juliet:sherpa/juliet sherpa/juliet online database open access mandates adopted academic funding bodies part sherpa suite services around open access run jisc formerly university nottingham database contains information 100 funders mostly united kingdom juliet indicates policy regarding self-archiving open access journals archival research data users suggest updates records addition new funder via form service mainly useful researchers received project-based funding want clear summary funder links original policies also provided", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 280, + "label": 7, + "text": "Distributed_memory:distributed memory computer science distributed memory refers multiprocessor computer system processor private memory computational tasks operate local data remote data required computational task must communicate one remote processors contrast shared memory multiprocessor offers single memory space used processors processors aware data resides except may performance penalties race conditions avoided distributed memory system typically processor memory form interconnection allows programs processor interact interconnect organised point point links separate hardware provide switching network network topology key factor determining multiprocessor machine scales links nodes implemented using standard network protocol example ethernet using bespoke network links used example transputer using dual-ported memories key issue programming distributed memory systems distribute data memories depending problem solved data distributed statically moved nodes data moved demand data pushed new nodes advance example problem described pipeline data x processed subsequently functions f g h etc result h g f x expressed distributed memory problem data transmitted first node performs f passes result onto second node computes g finally third node computes h also known systolic computation data kept statically nodes computations happen locally changes edges reported nodes example simulation data modeled using grid node simulates small part larger grid every iteration nodes inform neighboring nodes new edge data similarly distributed shared memory node cluster access large shared memory addition node limited non-shared private memory distributed shared memory hides mechanism communication hide latency communication", + "neighbors": [ + 51, + 86, + 123, + 227, + 270, + 300, + 314, + 340, + 362, + 375, + 465, + 611, + 719, + 737, + 846, + 847, + 876, + 1013, + 1081, + 1099, + 1219, + 1220, + 1507, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 281, + "label": 4, + "text": "2014_Russian_hacker_password_theft:2014 russian hacker password theft 2014 russian hacker password theft alleged hacking incident resulting possible theft 1.2 billion internet credentials including usernames passwords hundreds millions corresponding e-mail addresses data breach first reported new york times reported many media allegedly discovered reported milwaukee-based information security company hold security 420,000 websites reported affected according new york times source big companies know user credentials among stolen hold security disclose sites compromised instead offered two separate services one website owners one consumers check 're affected service website owners costs 10 month check consumers free hold security described group responsible hack small group \u201c fewer dozen men 20s ... based small city south central russia region flanked kazakhstan mongolia \u201d dubbed group cybervor russian lit cyber thief hold claimed hack perpetrated use sql injection according forbes article hold security says 1.2 billion credentials stolen way also ones cybervor simply bought people used means hold security n't know split forbes columnist kashmir hill noted internet predictably panicked story yet another massive password breach went viral pretty direct link panic pay-out security firm hold security website service offering people check username password pair stolen requires people send hold security encrypted versions passwords named independent sources come forward confirm breach forbes columnist joseph steinberg even expressed outright skepticism many facts claimed breach raising questions trustworthiness reports breach altogether", + "neighbors": [ + 43, + 91, + 141, + 144, + 158, + 198, + 232, + 261, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 703, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 282, + "label": 0, + "text": "Computational_linguistics:computational linguistics computational linguistics interdisciplinary field concerned statistical rule-based modeling natural language computational perspective well study appropriate computational approaches linguistic questions traditionally computational linguistics performed computer scientists specialized application computers processing natural language today computational linguists often work members interdisciplinary teams include regular linguists experts target language computer scientists general computational linguistics draws upon involvement linguists computer scientists experts artificial intelligence mathematicians logicians philosophers cognitive scientists cognitive psychologists psycholinguists anthropologists neuroscientists among others computational linguistics theoretical applied components theoretical computational linguistics focuses issues theoretical linguistics cognitive science applied computational linguistics focuses practical outcome modeling human language use association computational linguistics defines computational linguistics computational linguistics often grouped within field artificial intelligence actually present development artificial intelligence computational linguistics originated efforts united states 1950s use computers automatically translate texts foreign languages particularly russian scientific journals english since computers make arithmetic calculations much faster accurately humans thought short matter time could also begin process language computational quantitative methods also used historically attempted reconstruction earlier forms modern languages subgrouping modern languages language families earlier methods lexicostatistics glottochronology proven premature inaccurate however recent interdisciplinary studies borrow concepts biological studies especially gene mapping proved produce sophisticated analytical tools trustworthy results machine translation also known mechanical translation failed yield accurate translations right away automated processing human languages recognized far complex originally assumed computational linguistics born name new field study devoted developing algorithms software intelligently processing language data term computational linguistics first coined david hays founding member association computational linguistics international committee computational linguistics artificial intelligence came existence 1960s field computational linguistics became sub-division artificial intelligence dealing human-level comprehension production natural languages order translate one language another observed one understand grammar languages including morphology grammar word forms syntax grammar sentence structure order understand syntax one also understand semantics lexicon 'vocabulary even something pragmatics language use thus started effort translate languages evolved entire discipline devoted understanding represent process natural languages using computers nowadays research within scope computational linguistics done computational linguistics departments computational linguistics laboratories computer science departments linguistics departments research field computational linguistics aims create working speech text processing systems others aim create system allowing human-machine interaction programs meant human-machine communication called conversational agents computational linguistics performed experts variety fields wide assortment departments research fields broach diverse range topics following sections discuss literature available across entire field broken four main area discourse developmental linguistics structural linguistics linguistic production linguistic comprehension language cognitive skill develops throughout life individual developmental process examined using number techniques computational approach one human language development provide constraints make harder apply computational method understanding instance language acquisition human children largely exposed positive evidence means linguistic development individual evidence correct form provided evidence correct insufficient information simple hypothesis testing procedure information complex language provides certain boundaries computational approach modeling language development acquisition individual attempts made model developmental process language acquisition children computational angle leading statistical grammars connectionist models work realm also proposed method explain evolution language history using models shown languages learned combination simple input presented incrementally child develops better memory longer attention span simultaneously posed reason long developmental period human children conclusions drawn strength artificial neural network project created ability infants develop language also modeled using robots order test linguistic theories enabled learn children might model created based affordance model mappings actions perceptions effects created linked spoken words crucially robots able acquire functioning word-to-meaning mappings without needing grammatical structure vastly simplifying learning process shedding light information furthers current understanding linguistic development important note information could empirically tested using computational approach understanding linguistic development individual within lifetime continually improved using neural networks learning robotic systems also important keep mind languages change develop time computational approaches understanding phenomenon unearthed interesting information using price equation p\u00f3lya urn dynamics researchers created system predicts future linguistic evolution also gives insight evolutionary history modern-day languages modeling effort achieved computational linguistics would otherwise impossible clear understanding linguistic development humans well throughout evolutionary time fantastically improved advances computational linguistics ability model modify systems affords science ethical method testing hypotheses would otherwise intractable order create better computational models language understanding language structure crucial end english language meticulously studied using computational approaches better understand language works structural level one important pieces able study linguistic structure availability large linguistic corpora samples grants computational linguists raw data necessary run models gain better understanding underlying structures present vast amount data contained single language one cited english linguistic corpora penn treebank derived widely-different sources ibm computer manuals transcribed telephone conversations corpus contains 4.5 million words american english corpus primarily annotated using part-of-speech tagging syntactic bracketing yielded substantial empirical observations related language structure theoretical approaches structure languages also developed works allow computational linguistics framework within work hypotheses understanding language myriad ways one original theoretical theses internalization grammar structure language proposed two types models models rules patterns learned increase strength frequency encounter work also created question computational linguists answer infant learn specific non-normal grammar chomsky normal form without learning overgeneralized version getting stuck theoretical efforts like set direction research go early lifetime field study crucial growth field structural information languages allows discovery implementation similarity recognition pairs text utterances instance recently proven based structural information present patterns human discourse conceptual recurrence plots used model visualize trends data create reliable measures similarity natural textual utterances technique strong tool probing structure human discourse without computational approach question vastly complex information present discourse data would remained inaccessible scientists information regarding structural data language available english well languages japanese using computational methods japanese sentence corpora analyzed pattern log-normality found relation sentence length though exact cause lognormality remains unknown precisely sort intriguing information computational linguistics designed uncover information could lead important discoveries regarding underlying structure japanese could number effects understanding japanese language computational linguistics allows exciting additions scientific knowledge base happen quickly little room doubt recent days structural data languages available several languages world english language computational linguistics work progress sindhi language structure grammar domain sindhi language different languages world computational linguistics models english language suitable sindhi language viewing computational linguistics work sindhi language started properly developing methods algorithms linguistics tools https //sindhinlp.com/ machine learning models deep learning models since 2016. focus solve linguistics problems sindhi language work could lead important discoveries regarding underlying structure sindhi could number effects understanding sindhi language computational linguistics allows exciting additions scientific knowledge base happen quickly little room doubt without computational approach structure linguistic data much information available would still hidden vastness data within single language computational linguistics allows scientists parse huge amounts data reliably efficiently creating possibility discoveries unlike seen approaches production language equally complex information provides necessary skills fluent producer must say comprehension half problem communication half system produces language computational linguistics made interesting discoveries area famous paper published 1950 alan turing proposed possibility machines might one day ability think thought experiment might define concept thought machines proposed imitation test human subject two text-only conversations one fellow human another machine attempting respond like human turing proposes subject tell difference human machine may concluded machine capable thought today test known turing test remains influential idea area artificial intelligence projects still trying solve problem first started computational linguistics field first place however methods become refined clever consequently results generated computational linguists become enlightening effort improve computer translation several models compared including hidden markov models smoothing techniques specific refinements apply verb translation model found produce natural translations german french words refined alignment model first-order dependence fertility model 16 also provide efficient training algorithms models presented give scientists ability improve results type work specific computational linguistics applications could vastly improve understanding language produced comprehended computers work also done making computers produce language naturalistic manner using linguistic input humans algorithms constructed able modify system style production based factor linguistic input human abstract factors like politeness five main dimensions personality work takes computational approach via parameter estimation models categorize vast array linguistic styles see across individuals simplify computer work way making human-computer interaction much natural many earliest simplest models human-computer interaction eliza example involve text-based input user generate response computer method words typed user trigger computer recognize specific patterns reply accordingly process known keyword spotting recent technologies placed emphasis speech-based interactive systems systems siri ios operating system operate similar pattern-recognizing technique text-based systems former user input conducted speech recognition branch linguistics involves processing user speech sound waves interpreting acoustics language patterns order computer recognize input much focus modern computational linguistics comprehension proliferation internet abundance easily accessible written human language ability create program capable understanding human language would many broad exciting possibilities including improved search engines automated customer service online education early work comprehension included applying bayesian statistics task optical character recognition illustrated bledsoe browing 1959 large dictionary possible letters generated learning example letters probability one learned examples matched new input combined make final decision attempts applying bayesian statistics language analysis included work mosteller wallace 1963 analysis words used federalist papers used attempt determine authorship concluding madison likely authored majority papers 1971 terry winograd developed early natural language processing engine capable interpreting naturally written commands within simple rule governed environment primary language parsing program project called shrdlu capable carrying somewhat natural conversation user giving commands within scope toy environment designed task environment consisted different shaped colored blocks shrdlu capable interpreting commands find block taller one holding put box asking questions n't understand pyramid mean response user input impressive kind natural language processing proven much difficult outside limited scope toy environment similarly project developed nasa called lunar designed provide answers naturally written questions geological analysis lunar rocks returned apollo missions kinds problems referred question answering initial attempts understanding spoken language based work done 1960s 1970s signal modeling unknown signal analyzed look patterns make predictions based history initial somewhat successful approach applying kind signal modeling language achieved use hidden markov models detailed rabiner 1989 approach attempts determine probabilities arbitrary number models could used generating speech well modeling probabilities various words generated possible models similar approaches employed early speech recognition attempts starting late 70s ibm using word/part-of-speech pair probabilities recently kinds statistical approaches applied difficult tasks topic identification using bayesian parameter estimation infer topic probabilities text documents modern computational linguistics often combination studies computer science programming math particularly statistics language structures natural language processing combined fields often lead development systems recognize speech perform task based speech examples include speech recognition software apple siri feature spellcheck tools speech synthesis programs often used demonstrate pronunciation help disabled machine translation programs websites google translate computational linguistics especially helpful situations involving social media internet example filters chatrooms website searches require computational linguistics chat operators often use filters identify certain words phrases deem inappropriate users submit another example using filters websites schools use filters websites certain keywords blocked children view also many programs parents use parental controls put content filters place computational linguists also develop programs group organize content social media mining example twitter programs group tweets subject keywords computational linguistics also used document retrieval clustering online search documents websites retrieved based frequency unique labels related typed search engine instance search red large four-wheeled vehicle intention finding pictures red truck search engine still find information desired matching words four-wheeled car computational linguistics divided major areas depending upon medium language processed whether spoken textual upon task performed whether analyzing language recognition synthesizing language generation speech recognition speech synthesis deal spoken language understood created using computers parsing generation sub-divisions computational linguistics dealing respectively taking language apart putting together machine translation remains sub-division computational linguistics dealing computers translate languages possibility automatic language translation however yet realized remains notoriously hard branch computational linguistics areas research studied computational linguistics include subject computational linguistics recurring impact popular culture", + "neighbors": [ + 14, + 123, + 149, + 159, + 272, + 307, + 346, + 368, + 372, + 379, + 412, + 429, + 453, + 739, + 789, + 832, + 1007, + 1062, + 1096, + 1138, + 1142, + 1159, + 1324, + 1368, + 1372, + 1398, + 1486, + 1503, + 1549, + 1608, + 1615 + ], + "mask": "Validation" + }, + { + "node_id": 283, + "label": 5, + "text": "Megaphone_desktop_tool:megaphone desktop tool megaphone desktop tool windows action alert tool developed give israel united support giyus distributed world union jewish students world jewish congress jewish agency israel world zionist organization standwithus hasbara fellowships honestreporting pro-israel public relations organizations tool released july 2006 lebanon war june 2011 tool longer available giyus website rss newsfeed available megaphone desktop tool acted wrapper around rss feed giyus website originally gave user option going particular site poll user chooses go site software casts vote automatically technically feasible feature discontinued giyus tries save time effort locating voting form inside website seemingly simple task may prove quite confusing certain sites whenever technically direct straight voting action arrived poll results means directed straight voting action already successfully voted reason n't care vote always use thanks link article alert popup later versions voting concept removed entirely tool directed users anti-israel websites giving users option click button labeled act would direct user poll email address software license provides remote updates understand agree giyus.org may provide updates patches and/or new versions software time time including automatic updates installed computer notice needed continue use services hereby authorize installations according jerusalem post amir gissin head public affairs department foreign ministry israel expressed support tool use foreign ministry pushing idea urging supporters israel everywhere become cyberspace soldiers new battleground israel image reports computing website register described use software highly organised mass manipulation technologies supposed democratising claimed megaphone effectively high-tech exercise ballot-stuffing register also reported bbc history magazine website noticed upsurge voting whether holocaust denial criminal offence britain closing date already passed result already published votes invalid anyway stewart purvis former editor-in-chief itn noted independent panel reviewing bbc israeli-palestinian coverage received large number letters north america accused bbc anti-israeli states evidence pressure group involvement following success megaphone tool developers formed company collactive 2007 collactive released web assistant general-purpose commercial version megaphone tool tool received wide range reactions praise criticism amir gissin head public affairs department israeli foreign ministry praised tool noting efficacy adnan hajj photographs controversy obtaining admission reuters news agency photograph adnan hajj improperly edited photo editing software tool similarly praised number pro-israel organizations helping fight perceive anti-israel media bias time criticized independent television news others stuffing ballot online polls generating excessive comments 'spam internet message boards stifling online discussion seen mass participatory form propaganda june 2011 megaphone desktop tool unavailable download creators website currently alerts displayed giyus website rss feed", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 284, + "label": 4, + "text": "XSL_attack:xsl attack cryptography extended sparse linearization xsl attack method cryptanalysis block ciphers attack first published 2002 researchers nicolas courtois josef pieprzyk caused controversy claimed potential break advanced encryption standard aes cipher also known rijndael faster exhaustive search since aes already widely used commerce government transmission secret information finding technique shorten amount time takes retrieve secret message without key could wide implications method high work-factor unless lessened means technique reduce effort break aes comparison exhaustive search therefore affect real-world security block ciphers near future nonetheless attack caused experts express greater unease algebraic simplicity current aes overview xsl attack relies first analyzing internals cipher deriving system quadratic simultaneous equations systems equations typically large example 8,000 equations 1,600 variables 128-bit aes several methods solving systems known xsl attack specialized algorithm termed extended sparse linearization applied solve equations recover key attack notable requiring handful known plaintexts perform previous methods cryptanalysis linear differential cryptanalysis often require unrealistically large numbers known chosen plaintexts solving multivariate quadratic equations mq finite set numbers np-hard problem general case several applications cryptography xsl attack requires efficient algorithm tackling mq 1999 kipnis shamir showed particular public key algorithm known hidden field equations scheme hfe could reduced overdetermined system quadratic equations equations unknowns one technique solving systems linearization involves replacing quadratic term independent variable solving resultant linear system using algorithm gaussian elimination succeed linearization requires enough linearly independent equations approximately many number terms however cryptanalysis hfe equations kipnis shamir proposed re-linearization technique extra non-linear equations added linearization resultant system solved second application linearization re-linearization proved general enough applicable schemes 2000 courtois et al proposed improved algorithm mq known xl extended linearization increases number equations multiplying monomials certain degree complexity estimates showed xl attack would work equations derived block ciphers aes however systems equations produced special structure xsl algorithm developed refinement xl could take advantage structure xsl equations multiplied carefully selected monomials several variants proposed research efficiency xl derivative algorithms remains ongoing yang chen 2004 courtois pieprzyk 2002 observed aes rijndael partially also serpent could expressed system quadratic equations variables represent plaintext ciphertext key bits also various intermediate values within algorithm s-box aes appears especially vulnerable type analysis based algebraically simple inverse function subsequently ciphers studied see systems equations produced biryukov de canni\u00e8re 2003 including camellia khazad misty1 kasumi unlike forms cryptanalysis differential linear cryptanalysis one two known plaintexts required xsl algorithm tailored solve type equation systems produced courtois pieprzyk estimate optimistic evaluation shows xsl attack might able break rijndael 256 bits serpent key lengths 192 256 bits analysis however universally accepted example aes 4 conference bonn 2004 one inventors rijndael vincent rijmen commented xsl attack attack dream promptly courtois answered xsl may dream may also bad dream turn nightmare however neither later paper actions nsa nist give support remark courtois 2003 murphy robshaw discovered alternative description aes embedding larger cipher called bes described using simple operations single field gf 2 xsl attack mounted system yields simpler set equations would break aes complexity around 2 courtois pieprzyk analysis correct 2005 cid leurent gave evidence proposed form xsl algorithm provide efficient method solving aes system equations however courtois disputed findings fse 2007 chu-wee lim khoongming khoo showed possibly work presented even xsl works modern algorithms attack currently poses little danger terms practical security like many modern cryptanalytic results would so-called certificational weakness faster brute force attack resources required still huge unlikely real-world systems could compromised using future improvements could increase practicality attack however type attack new unexpected cryptographers expressed unease algebraic simplicity ciphers like rijndael bruce schneier niels ferguson write one criticism aes n't quite trust security\u2026 concerns us aes simple algebraic structure\u2026 block cipher know simple algebraic representation idea whether leads attack knowing reason enough skeptical use aes practical cryptography 2003 pp 56\u201357", + "neighbors": [ + 32, + 104, + 174, + 289, + 382, + 633, + 969, + 995, + 1071, + 1181, + 1240, + 1351 + ], + "mask": "Train" + }, + { + "node_id": 285, + "label": 4, + "text": "Voice_phishing:voice phishing voice phishing form criminal phone fraud using social engineering telephone system gain access private personal financial information purpose financial reward sometimes referred vishing portmanteau voice phishing landline telephone services traditionally trustworthy terminated physical locations known telephone company associated bill-payer however vishing fraudsters often use modern voice ip voip features caller id spoofing automated systems ivr make difficult legal authorities monitor trace block voice phishing typically used steal credit card numbers information used identity theft schemes individuals although use automated responders war dialers preferred vishers reported cases human operators play active role scams attempt persuade victims posing employee legitimate body bank police telephone internet provider fraudster attempts obtain personal details financial information regarding credit card bank accounts e.g pin well personal information victim received information fraudster might able access empty account commit identity fraud fraudsters may also try persuade victim transfer money another bank account withdraw cash given directly another simple trick used fraudsters ask called parties hang dial bank victim hangs fraudster keeping line open remaining connected victim picks phone dial doubt calling company telephone number listed billing statements official sources recommended opposed calling numbers received messages callers dubious authenticity however sometimes hanging redialing insufficient caller hung victim might still connected fraudster spoofs dial tone phone line entice victim dial fraudster accomplice answers impersonates whomever victim trying call known 'no hang-up scam hence consumers advised use different phone dialing company number confirm bank account data sensitive information targeted fraudsters also trying obtain security credentials consumers use microsoft apple products spoofing caller id microsoft apple inc.. sweden mobile bank id phone app launched 2011 used identify user internet banking user logs bank computer bank activates phone app user enters password phone logged fraudulent people called people claimed bank officer saying security problem asked use mobile bank id app victim say password logged fraudster computer second mobile bank id app log approved transfer money nordea even approved fraudster phone able approve usage victim account 2018 app changed must photograph qr code computer screen making sure phone computer physically located room mostly eliminated type fraud", + "neighbors": [ + 229, + 285, + 608, + 701, + 1171, + 1172, + 1249, + 1446, + 1575 + ], + "mask": "Test" + }, + { + "node_id": 286, + "label": 0, + "text": "Microsoft_Language_Portal:microsoft language portal microsoft language portal multilingual online dictionary computing terms also offers free downloads localization style guides translations user interface text feedback feature made public 2009", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 287, + "label": 3, + "text": "Cobra_Command_(1984_video_game):cobra command 1984 video game cobra command known japan interactive movie game originally released data east 1984 laserdisc-based coin-operated arcade game terrorists threatening free world amassed diabolical force brave pilot cobra command vanquish terrorist threat save free world total destruction player assumes role pilot lx-3 super cobra helicopter missions go across new york city streets statue liberty atlantic ocean italy grand canyon enemy headquarters easter island original arcade version interactive movie shooter game player watches scenes helicopter flies conflict zone game screen represented helicopter cockpit player controls crosshair moved aim enemy forces game features joystick two buttons one machine gun one missile game played 1 2 players certain moments voice pilot commanding officer helps player completing mission firing enemy forces dodging enemy fire natural surroundings pressing joystick directional pad correct direction right time pilot makes mistake anime sequence shows cobra helicopter blown player loses life lives lost game screen shows cobra smoldering ruins pilot presumably dead crash mega-cd port cobra command developed wolf team released 1992 cobra command later re-released japan playstation sega saturn 1995 two-in-one compilation road blaster another fmv game produced team data east released second game titled cobra command 1988 unlike 1984 version 1988 arcade game side-scrolling shoot-'em-up november 2009 revolutionary concepts developed published enhanced iphone os version laserdisc original yoshihisa kishimoto director cobra command also directed arcade versions double dragon battle chopper cobra command makes cameo inside garage billy jimmy walked opening sequence double dragon ii kunio-kun double dragon series creator yoshihisa kishimoto designed entirely new game cobra command using data east bega battle hardware therefore bega battle become somewhat rare even among laserdisc games cobra command developed data east co-operation external company toei animation first published japan 1984 thunder storm released later year north america cobra command one data east interactive movie games despite name similarities animation relation organization cobra command elements g.i joe franchise. also largely animated toei animation hence similarities animation style game cobra command hero pilot reviewing sega cd version wizard magazine glenn rubenstein praised high number levels unique interface gave game b- release famicom ts\u016bshin scored sega saturn version game 25 40 giving playstation version 23 40", + "neighbors": [ + 406 + ], + "mask": "Test" + }, + { + "node_id": 288, + "label": 4, + "text": "ZmEu_(vulnerability_scanner):zmeu vulnerability scanner zmeu computer vulnerability scanner searches web servers open attack phpmyadmin program apparently named zmeu dragon-like romanian folklore", + "neighbors": [ + 1452 + ], + "mask": "Validation" + }, + { + "node_id": 289, + "label": 4, + "text": "Cryptanalysis:cryptanalysis cryptanalysis greek krypt\u00f3s hidden anal\u00fdein loosen untie study analyzing information systems order study hidden aspects systems cryptanalysis used breach cryptographic security systems gain access contents encrypted messages even cryptographic key unknown addition mathematical analysis cryptographic algorithms cryptanalysis includes study side-channel attacks target weaknesses cryptographic algorithms instead exploit weaknesses implementation even though goal methods techniques cryptanalysis changed drastically history cryptography adapting increasing cryptographic complexity ranging pen-and-paper methods past machines like british bombes colossus computers bletchley park world war ii mathematically advanced computerized schemes present methods breaking modern cryptosystems often involve solving carefully constructed problems pure mathematics best-known integer factorization given encrypted data ciphertext goal cryptanalyst gain much information possible original unencrypted data plaintext useful consider two aspects achieving first breaking system \u2014 discovering encipherment process works second solving key unique particular encrypted message group messages attacks classified based type information attacker available basic starting point normally assumed purposes analysis general algorithm known shannon maxim enemy knows system \u2014 turn equivalent kerckhoffs principle reasonable assumption practice \u2014 throughout history countless examples secret algorithms falling wider knowledge variously espionage betrayal reverse engineering occasion ciphers broken pure deduction example german lorenz cipher japanese purple code variety classical schemes attacks also characterised resources require resources include sometimes difficult predict quantities precisely especially attack n't practical actually implement testing academic cryptanalysts tend provide least estimated order magnitude attacks difficulty saying example sha-1 collisions 2 bruce schneier notes even computationally impractical attacks considered breaks breaking cipher simply means finding weakness cipher exploited complexity less brute force never mind brute-force might require 2 encryptions attack requiring 2 encryptions would considered break ... simply put break certificational weakness evidence cipher perform advertised results cryptanalysis also vary usefulness example cryptographer lars knudsen 1998 classified various types attack block ciphers according amount quality secret information discovered academic attacks often weakened versions cryptosystem block cipher hash function rounds removed many attacks become exponentially difficult execute rounds added cryptosystem possible full cryptosystem strong even though reduced-round variants weak nonetheless partial breaks come close breaking original cryptosystem may mean full break follow successful attacks des md5 sha-1 preceded attacks weakened versions academic cryptography weakness break scheme usually defined quite conservatively might require impractical amounts time memory known plaintexts also might require attacker able things many real-world attackers ca n't example attacker may need choose particular plaintexts encrypted even ask plaintexts encrypted using several keys related secret key furthermore might reveal small amount information enough prove cryptosystem imperfect little useful real-world attackers finally attack might apply weakened version cryptographic tools like reduced-round block cipher step towards breaking full system cryptanalysis coevolved together cryptography contest traced history cryptography\u2014new ciphers designed replace old broken designs new cryptanalytic techniques invented crack improved schemes practice viewed two sides coin secure cryptography requires design possible cryptanalysis successful cryptanalysis undoubtedly influenced history ability read presumed-secret thoughts plans others decisive advantage example england 1587 mary queen scots tried executed treason result involvement three plots assassinate elizabeth england plans came light coded correspondence fellow conspirators deciphered thomas phelippes world war breaking zimmermann telegram instrumental bringing united states war world war ii allies benefitted enormously joint success cryptanalysis german ciphers \u2014 including enigma machine lorenz cipher \u2014 japanese ciphers particularly 'purple jn-25 'ultra intelligence credited everything shortening end european war two years determining eventual result war pacific similarly helped 'magic intelligence governments long recognized potential benefits cryptanalysis intelligence military diplomatic established dedicated organizations devoted breaking codes ciphers nations example gchq nsa organizations still active today 2004 reported united states broken iranian ciphers unknown however whether pure cryptanalysis whether factors involved although actual word cryptanalysis relatively recent coined william friedman 1920 methods breaking codes ciphers much older first known recorded explanation cryptanalysis given 9th-century arab polymath al-kindi also known alkindus europe manuscript deciphering cryptographic messages treatise includes description method frequency analysis ibrahim al-kadi 1992- ref-3 italian scholar giambattista della porta author seminal work cryptanalysis de furtivis literarum notis frequency analysis basic tool breaking classical ciphers natural languages certain letters alphabet appear often others english e likely common letter sample plaintext similarly digraph th likely pair letters english frequency analysis relies cipher failing hide statistics example simple substitution cipher letter simply replaced another frequent letter ciphertext would likely candidate e frequency analysis cipher therefore relatively easy provided ciphertext long enough give reasonably representative count letters alphabet contains europe 15th 16th centuries idea polyalphabetic substitution cipher developed among others french diplomat blaise de vigen\u00e8re 1523\u201396 three centuries vigen\u00e8re cipher uses repeating key select different encryption alphabets rotation considered completely secure le chiffre ind\u00e9chiffrable \u2014 indecipherable cipher nevertheless charles babbage 1791\u20131871 later independently friedrich kasiski 1805\u201381 succeeded breaking cipher world war inventors several countries developed rotor cipher machines arthur scherbius enigma attempt minimise repetition exploited break vigen\u00e8re system cryptanalysis enemy messages played significant part allied victory world war ii f. w. winterbotham quoted western supreme allied commander dwight d. eisenhower war end describing ultra intelligence decisive allied victory sir harry hinsley official historian british intelligence world war ii made similar assessment ultra saying shortened war less two years probably four years moreover said absence ultra uncertain war would ended practice frequency analysis relies much linguistic knowledge statistics ciphers became complex mathematics became important cryptanalysis change particularly evident world war ii efforts crack axis ciphers required new levels mathematical sophistication moreover automation first applied cryptanalysis era polish bomba device british bombe use punched card equipment colossus computers \u2014 first electronic digital computers controlled program reciprocal machine ciphers lorenz cipher enigma machine used nazi germany world war ii message key usually transmitting operator informed receiving operator message key transmitting plaintext and/or ciphertext enciphered message termed indicator indicates receiving operator set machine decipher message poorly designed implemented indicator systems allowed first polish cryptographers british cryptographers bletchley park break enigma cipher system similar poor indicator systems allowed british identify depths led diagnosis lorenz sz40/42 cipher system comprehensive breaking messages without cryptanalysts seeing cipher machine sending two messages key insecure process cryptanalyst messages said depth may detected messages indicator sending operator informs receiving operator key generator initial settings message generally cryptanalyst may benefit lining identical enciphering operations among set messages example vernam cipher enciphers bit-for-bit combining plaintext long key using exclusive operator also known modulo-2 addition symbolized \u2295 deciphering combines key bits ciphertext reconstruct plaintext modulo-2 arithmetic addition subtraction two ciphertexts aligned depth combining eliminates common key leaving combination two plaintexts individual plaintexts worked linguistically trying probable words phrases also known cribs various locations correct guess combined merged plaintext stream produces intelligible text plaintext component recovered fragment second plaintext often extended one directions extra characters combined merged plaintext stream extend first plaintext working back forth two plaintexts using intelligibility criterion check guesses analyst may recover much original plaintexts two plaintexts depth analyst may know one corresponds ciphertext practice large problem recovered plaintext combined ciphertext key revealed knowledge key course allows analyst read messages encrypted key knowledge set related keys may allow cryptanalysts diagnose system used constructing even though computation used great effect cryptanalysis lorenz cipher systems world war ii also made possible new methods cryptography orders magnitude complex ever taken whole modern cryptography become much impervious cryptanalysis pen-and-paper systems past seems upper hand pure cryptanalysis historian david kahn notes kahn goes mention increased opportunities interception bugging side channel attacks quantum computers replacements traditional means cryptanalysis 2010 former nsa technical director brian snow said academic government cryptographers moving slowly forward mature field however postmortems cryptanalysis may premature effectiveness cryptanalytic methods employed intelligence agencies remains unknown many serious attacks academic practical cryptographic primitives published modern era computer cryptography thus best modern ciphers may far resistant cryptanalysis enigma cryptanalysis broader field information security remain quite active asymmetric cryptography public key cryptography cryptography relies using two mathematically related keys one private one public ciphers invariably rely hard mathematical problems basis security obvious point attack develop methods solving problem security two-key cryptography depends mathematical questions way single-key cryptography generally conversely links cryptanalysis wider mathematical research new way asymmetric schemes designed around conjectured difficulty solving various mathematical problems improved algorithm found solve problem system weakened example security diffie\u2013hellman key exchange scheme depends difficulty calculating discrete logarithm 1983 coppersmith found faster way find discrete logarithms certain groups thereby requiring cryptographers use larger groups different types groups rsa security depends part upon difficulty integer factorization \u2014 breakthrough factoring would impact security rsa 1980 one could factor difficult 50-digit number expense 10 elementary computer operations 1984 state art factoring algorithms advanced point 75-digit number could factored 10 operations advances computing technology also meant operations could performed much faster moore law predicts computer speeds continue increase factoring techniques may continue well likely depend mathematical insight creativity neither ever successfully predictable 150-digit numbers kind used rsa factored effort greater unreasonable fast modern computers start 21st century 150-digit numbers longer considered large enough key size rsa numbers several hundred digits still considered hard factor 2005 though methods probably continue improve time requiring key size keep pace methods elliptic curve cryptography used another distinguishing feature asymmetric schemes unlike attacks symmetric cryptosystems cryptanalysis opportunity make use knowledge gained public key quantum computers still early phases research potential use cryptanalysis example shor algorithm could factor large numbers polynomial time effect breaking commonly used forms public-key encryption using grover algorithm quantum computer brute-force key search made quadratically faster however could countered doubling key length", + "neighbors": [ + 32, + 103, + 104, + 159, + 174, + 227, + 284, + 293, + 379, + 382, + 481, + 528, + 633, + 658, + 692, + 705, + 885, + 955, + 969, + 995, + 1071, + 1137, + 1181, + 1219, + 1240, + 1308, + 1317, + 1351, + 1451, + 1527, + 1534 + ], + "mask": "Test" + }, + { + "node_id": 290, + "label": 4, + "text": "Ben_Laurie:ben laurie ben laurie software engineer protocol designer cryptographer founding director apache software foundation core team member openssl member shmoo group director open rights group director security bunker secure hosting trustee founder-member freebmd visiting fellow cambridge university computer laboratory laurie works google london various projects currently focused certificate transparency ben wrote apache-ssl basis ssl-enabled versions apache http server co-author openpgp sdk developed mud gods innovative including online creation endgame ben also written several articles papers books many found home page blog interested ideal knots applications", + "neighbors": [ + 38, + 43, + 101, + 116, + 172, + 189, + 272, + 323, + 377, + 477, + 604, + 899, + 992, + 1202, + 1257, + 1278, + 1322, + 1397, + 1521 + ], + "mask": "Test" + }, + { + "node_id": 291, + "label": 4, + "text": "Call_blocking:call blocking call blocking also known call block call screening call rejection allows telephone subscriber block incoming calls specific telephone numbers feature may require additional payment subscriber telephone company third-party call blocking desired individuals wish block unwanted phone calls generally include types unsolicited calls telemarketers robocalls unwanted calls landlines may blocked number methods landline phones built-in call blocking facilities external call blockers sold telephone accessories plug existing phones call blockers related services recently received attention 2016 publications including consumer reports united kingdom united states respectively devices services enable user block call progress alternatively block number call made devices rely caller id information thus phone blocker requires caller id service active line blocking function may also possible use computer software conjunction caller id information phone company caller id enabled phone modem block incoming call treatment blocked calls may include multitude third-party call blocking applications available smart phones manufacturers provide built-in call blocking functions standard", + "neighbors": [ + 162, + 1575 + ], + "mask": "Validation" + }, + { + "node_id": 292, + "label": 9, + "text": "Compiler:compiler compiler computer program translates computer code written one programming language source language another programming language target language name compiler primarily used programs translate source code high-level programming language lower level language e.g. assembly language object code machine code create executable program however many different types compilers compiled program run computer whose cpu operating system different one compiler runs compiler cross-compiler bootstrap compiler written language intends compile program translates low-level language higher level one decompiler program translates high-level languages usually called source-to-source compiler transpiler language rewriter usually program translates form expressions without change language term compiler-compiler refers tools used create parsers perform syntax analysis compiler likely perform many following operations preprocessing lexical analysis parsing semantic analysis syntax-directed translation conversion input programs intermediate representation code optimization code generation compilers implement operations phases promote efficient design correct transformations source input target output program faults caused incorrect compiler behavior difficult track work around therefore compiler implementers invest significant effort ensure compiler correctness compilers language processor used transform source programs interpreter computer software transforms executes indicated operations translation process influences design computer languages leads preference compilation interpretation practice interpreter implemented compiled languages compilers implemented interpreted languages theoretical computing concepts developed scientists mathematicians engineers formed basis digital modern computing development world war ii primitive binary languages evolved digital devices understand ones zeros circuit patterns underlying machine architecture late 1940s assembly languages created offer workable abstraction computer architectures limited memory capacity early computers led substantial technical challenges first compilers designed therefore compilation process needed divided several small programs front end programs produce analysis products used back end programs generate target code computer technology provided resources compiler designs could align better compilation process usually productive programmer use high-level language development high-level languages followed naturally capabilities offered digital computers high-level languages formal languages strictly defined syntax semantics form high-level language architecture elements formal languages include sentences language may defined set rules called grammar backus\u2013naur form bnf describes syntax sentences language used syntax algol 60 john backus ideas derive context-free grammar concepts noam chomsky linguist bnf extensions become standard tools describing syntax programming notations many cases parts compilers generated automatically bnf description 1940s konrad zuse designed algorithmic programming language called plankalk\u00fcl plan calculus actual implementation occurred 1970s presented concepts later seen apl designed ken iverson late 1950s apl language mathematical computations high-level language design formative years digital computing provided useful programming tools variety applications compiler technology evolved need strictly defined transformation high-level source program low-level target program digital computer compiler could viewed front end deal analysis source code back end synthesize analysis target code optimization front end back end could produce efficient target code early milestones development compiler technology early operating systems software written assembly language 60s early 70s use high-level languages system programming still controversial due resource limitations however several research industry efforts began shift toward high-level systems programming languages example bcpl bliss b c. bcpl basic combined programming language designed 1966 martin richards university cambridge originally developed compiler writing tool several compilers implemented richards book provides insights language compiler bcpl influential systems programming language still used research also provided basis design b c languages bliss basic language implementation system software developed digital equipment corporation dec pdp-10 computer w.a wulf carnegie mellon university cmu research team cmu team went develop bliss-11 compiler one year later 1970 multics multiplexed information computing service time-sharing operating system project involved mit bell labs general electric later honeywell led fernando corbat\u00f3 mit multics written pl/i language developed ibm ibm user group ibm goal satisfy business scientific systems programming requirements languages could considered pl/i offered complete solution even though implemented first years mulitics project subset language could compiled assembly language early pl/i epl compiler doug mcilory bob morris bell labs epl supported project boot-strapping compiler full pl/i could developed bell labs left multics project 1969 time hope replaced frustration group effort initially failed produce economically useful system continued participation would drive project support costs researchers turned development efforts system programming language b based bcpl concepts written dennis ritchie ken thompson ritchie created boot-strapping compiler b wrote unics uniplexed information computing service operating system pdp-7 b. unics eventually became spelled unix bell labs started development expansion c based b bcpl bcpl compiler transported multics bell labs bcpl preferred language bell labs initially front-end program bell labs b compiler used c compiler developed 1971 new pdp-11 provided resource define extensions b rewrite compiler 1973 design c language essentially complete unix kernel pdp-11 rewritten c. steve johnson started development portable c compiler pcc support retargeting c compilers new machines object-oriented programming oop offered interesting possibilities application development maintenance oop concepts go back part lisp simula language science bell labs development c++ became interested oop c++ first used 1980 systems programming initial design leveraged c language systems programming capabilities simula concepts object-oriented facilities added 1983 cfront program implemented c++ front-end c84 language compiler subsequent years several c++ compilers developed c++ popularity grew many application domains idea using higher-level language quickly caught expanding functionality supported newer programming languages increasing complexity computer architectures compilers became complex darpa defense advanced research projects agency sponsored compiler project wulf cmu research team 1970 production quality compiler-compiler pqcc design would produce production quality compiler pqc formal definitions source language target pqcc tried extend term compiler-compiler beyond traditional meaning parser generator e.g. yacc without much success pqcc might properly referred compiler generator pqcc research code generation process sought build truly automatic compiler-writing system effort discovered designed phase structure pqc bliss-11 compiler provided initial structure phases included analyses front end intermediate translation virtual machine middle end translation target back end tcol developed pqcc research handle language specific constructs intermediate representation variations tcol supported various languages pqcc project investigated techniques automated compiler construction design concepts proved useful optimizing compilers compilers object-oriented programming language ada ada stoneman document formalized program support environment apse along kernel kapse minimal mapse ada interpreter nyu/ed supported development standardization efforts american national standards institute ansi international standards organization iso initial ada compiler development u.s. military services included compilers complete integrated design environment along lines stoneman document army navy worked ada language system als project targeted dec/vax architecture air force started ada integrated environment aie targeted ibm 370 series projects provide desired results contribute overal effort ada development ada compiler efforts got underway britain university york germany university karlsruhe u. s. verdix later acquired rational delivered verdix ada development system vads army vads provided set development tools including compiler unix/vads could hosted variety unix platforms dec ultrix sun 3/60 solaris targeted motorola 68020 army cecom evaluation soon many ada compilers available passed ada validation tests free software foundation gnu project developed gnu compiler collection gcc provides core capability support multiple languages targets ada version gnat one widely used ada compilers gnat free also commercial support example adacore founded 1994 provide commercial software solutions ada gnat pro includes gnu gcc based gnat tool suite provide integrated development environment high-level languages continued drive compiler research development focus areas included optimization automatic code generation trends programming languages development environments influenced compiler technology compilers became included language distributions perl java development kit component ide vads eclipse ada pro interrelationship interdependence technologies grew advent web services promoted growth web languages scripting languages scripts trace back early days command line interfaces cli user could enter commands executed system user shell concepts developed languages write shell programs early windows designs offered simple batch programming capability conventional transformation language used interpreter widely used bash batch compilers written recently sophisticated interpreted languages became part developers tool kit modern scripting languages include php python ruby lua lua widely used game development interpreter compiler support field compiling began late 50s focus limited translation high-level language programs machine code ... compiler field increasingly intertwined disciplines including computer architecture programming languages formal methods software engineering computer security compiler research next 50 years article noted importance object-oriented languages java security parallel computing cited among future research targets compiler implements formal transformation high-level source program low-level target program compiler design define end end solution tackle defined subset interfaces compilation tools e.g preprocessors assemblers linkers design requirements include rigorously defined interfaces internally compiler components externally supporting toolsets early days approach taken compiler design directly affected complexity computer language processed experience person designing resources available resource limitations led need pass source code compiler relatively simple language written one person might single monolithic piece software however source language grows complexity design may split number interdependent phases separate phases provide design improvements focus development functions compilation process classifying compilers number passes background hardware resource limitations computers compiling involves performing lots work early computers enough memory contain one program work compilers split smaller programs made pass source representation performing required analysis translations ability compile single pass classically seen benefit simplifies job writing compiler one-pass compilers generally perform compilations faster multi-pass compilers thus partly driven resource limitations early systems many early languages specifically designed could compiled single pass e.g. pascal cases design language feature may require compiler perform one pass source instance consider declaration appearing line 20 source affects translation statement appearing line 10 case first pass needs gather information declarations appearing statements affect actual translation happening subsequent pass disadvantage compiling single pass possible perform many sophisticated optimizations needed generate high quality code difficult count exactly many passes optimizing compiler makes instance different phases optimization may analyse one expression many times analyse another expression splitting compiler small programs technique used researchers interested producing provably correct compilers proving correctness set small programs often requires less effort proving correctness larger single equivalent program regardless exact number phases compiler design phases assigned one three stages stages include front end middle end back end front/middle/back-end approach makes possible combine front ends different languages back ends different cpus sharing optimizations middle end practical examples approach gnu compiler collection llvm amsterdam compiler kit multiple front-ends shared optimizations multiple back-ends front end analyzes source code build internal representation program called intermediate representation ir also manages symbol table data structure mapping symbol source code associated information location type scope frontend single monolithic function program scannerless parser commonly implemented analyzed several phases may execute sequentially concurrently method favored due modularity separation concerns commonly today frontend broken three phases lexical analysis also known lexing syntax analysis also known scanning parsing semantic analysis lexing parsing comprise syntactic analysis word syntax phrase syntax respectively simple cases modules lexer parser automatically generated grammar language though complex cases require manual modification lexical grammar phrase grammar usually context-free grammars simplifies analysis significantly context-sensitivity handled semantic analysis phase semantic analysis phase generally complex written hand partially fully automated using attribute grammars phases broken lexing scanning evaluating parsing building concrete syntax tree cst parse tree transforming abstract syntax tree ast syntax tree cases additional phases used notably line reconstruction preprocessing rare main phases front end include following middle end also known optimizer performs optimizations intermediate representation order improve performance quality produced machine code middle end contains optimizations independent cpu architecture targeted main phases middle end include following compiler analysis prerequisite compiler optimization tightly work together example dependence analysis crucial loop transformation scope compiler analysis optimizations vary greatly scope may range operating within basic block whole procedures even whole program trade-off granularity optimizations cost compilation example peephole optimizations fast perform compilation affect small local fragment code performed independently context code fragment appears contrast interprocedural optimization requires compilation time memory space enable optimizations possible considering behavior multiple functions simultaneously interprocedural analysis optimizations common modern commercial compilers hp ibm sgi intel microsoft sun microsystems free software gcc criticized long time lacking powerful interprocedural optimizations changing respect another open source compiler full analysis optimization infrastructure open64 used many organizations research commercial purposes due extra time space needed compiler analysis optimizations compilers skip default users use compilation options explicitly tell compiler optimizations enabled back end responsible cpu architecture specific optimizations code generation main phases back end include following compiler correctness branch software engineering deals trying show compiler behaves according language specification techniques include developing compiler using formal methods using rigorous testing often called compiler validation existing compiler higher-level programming languages usually appear type translation mind either designed compiled language interpreted language however practice rarely anything language requires exclusively compiled exclusively interpreted although possible design languages rely re-interpretation run time categorization usually reflects popular widespread implementations language \u2014 instance basic sometimes called interpreted language c compiled one despite existence basic compilers c interpreters interpretation replace compilation completely hides user makes gradual even though interpreter interpreted directly executed program needed somewhere bottom stack see machine language compilers contain interpreters optimization reasons example expression executed compilation results inserted output program prevents recalculated time program runs greatly speed final program modern trends toward just-in-time compilation bytecode interpretation times blur traditional categorizations compilers interpreters even language specifications spell implementations must include compilation facility example common lisp however nothing inherent definition common lisp stops interpreted languages features easy implement interpreter make writing compiler much harder example apl snobol4 many scripting languages allow programs construct arbitrary source code runtime regular string operations execute code passing special evaluation function implement features compiled language programs must usually shipped runtime library includes version compiler one classification compilers platform generated code executes known target platform native hosted compiler one whose output intended directly run type computer operating system compiler runs output cross compiler designed run different platform cross compilers often used developing software embedded systems intended support software development environment output compiler produces code virtual machine vm may may executed platform compiler produced reason compilers usually classified native cross compilers lower level language target compiler may high-level programming language c viewed sort portable assembly language frequently target language compilers example cfront original compiler c++ used c target language c code generated compiler usually intended readable maintained humans indent style creating pretty c intermediate code ignored features c make good target language include codice_1 directive generated compiler support debugging original source wide platform support available c compilers common compiler type outputs machine code many types", + "neighbors": [ + 11, + 27, + 29, + 46, + 65, + 78, + 81, + 134, + 142, + 178, + 194, + 203, + 206, + 216, + 236, + 246, + 249, + 251, + 270, + 273, + 275, + 306, + 308, + 313, + 331, + 332, + 347, + 360, + 373, + 380, + 386, + 392, + 412, + 446, + 447, + 473, + 503, + 506, + 508, + 509, + 521, + 536, + 538, + 564, + 565, + 567, + 571, + 579, + 589, + 649, + 650, + 653, + 670, + 682, + 719, + 752, + 753, + 754, + 755, + 756, + 776, + 787, + 789, + 796, + 799, + 805, + 815, + 846, + 869, + 901, + 919, + 929, + 934, + 940, + 947, + 948, + 966, + 978, + 984, + 987, + 994, + 998, + 1002, + 1009, + 1021, + 1044, + 1095, + 1118, + 1119, + 1120, + 1123, + 1138, + 1156, + 1159, + 1173, + 1180, + 1183, + 1188, + 1207, + 1217, + 1220, + 1221, + 1225, + 1227, + 1231, + 1235, + 1245, + 1251, + 1277, + 1298, + 1315, + 1319, + 1320, + 1335, + 1372, + 1375, + 1385, + 1388, + 1389, + 1398, + 1413, + 1414, + 1421, + 1430, + 1437, + 1458, + 1466, + 1502, + 1505, + 1508, + 1511, + 1516, + 1558, + 1584, + 1588, + 1609, + 1629, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 293, + "label": 4, + "text": "Ransomware:ransomware ransomware type malware cryptovirology threatens publish victim data perpetually block access unless ransom paid simple ransomware may lock system way difficult knowledgeable person reverse advanced malware uses technique called cryptoviral extortion encrypts victim files making inaccessible demands ransom payment decrypt properly implemented cryptoviral extortion attack recovering files without decryption key intractable problem \u2013 difficult trace digital currencies ukash bitcoin cryptocurrency used ransoms making tracing prosecuting perpetrators difficult ransomware attacks typically carried using trojan disguised legitimate file user tricked downloading opening arrives email attachment however one high-profile example wannacry worm travelled automatically computers without user interaction starting around 2012 use ransomware scams grown internationally 181.5 million ransomware attacks first six months 2018 marks 229 increase time frame 2017 june 2014 vendor mcafee released data showing collected double number samples ransomware quarter quarter previous year cryptolocker particularly successful procuring estimated us 3 million taken authorities cryptowall estimated us federal bureau investigation fbi accrued us 18 million june 2015 concept file-encrypting ransomware invented implemented young yung columbia university presented 1996 ieee security privacy conference called cryptoviral extortion inspired fictional facehugger movie alien cryptoviral extortion following three-round protocol carried attacker victim symmetric key randomly generated assist victims point attacker private key exposed victims victim need send small ciphertext encrypted symmetric-cipher key attacker ransomware attacks typically carried using trojan entering system example malicious attachment embedded link phishing email vulnerability network service program runs payload locks system fashion claims lock system e.g. scareware program payloads may display fake warning purportedly entity law enforcement agency falsely claiming system used illegal activities contains content pornography pirated media payloads consist simply application designed lock restrict system payment made typically setting windows shell even modifying master boot record and/or partition table prevent operating system booting repaired sophisticated payloads encrypt files many using strong encryption encrypt victim files way malware author needed decryption key payment virtually always goal victim coerced paying ransomware removed either supplying program decrypt files sending unlock code undoes payload changes attacker may simply take money without returning victim files attacker best interest perform decryption agreed since victims stop sending payments becomes known serve purpose key element making ransomware work attacker convenient payment system hard trace range payment methods used including wire transfers premium-rate text messages pre-paid voucher services paysafecard digital currency bitcoin 2016 survey commissioned citrix claimed larger businesses holding bitcoin contingency plans first known malware extortion attack aids trojan written joseph popp 1989 design failure severe necessary pay extortionist payload hid files hard drive encrypted names displayed message claiming user license use certain piece software expired user asked pay us 189 pc cyborg corporation order obtain repair tool even though decryption key could extracted code trojan trojan also known pc cyborg popp declared mentally unfit stand trial actions promised donate profits malware fund aids research idea abusing anonymous cash systems safely collect ransom human kidnapping introduced 1992 sebastiaan von solms david naccache electronic money collection method also proposed cryptoviral extortion attacks von solms-naccache scenario newspaper publication used since bitcoin ledgers exist time paper written notion using public key cryptography data kidnapping attacks introduced 1996 adam l. young moti yung young yung critiqued failed aids information trojan relied symmetric cryptography alone fatal flaw decryption key could extracted trojan implemented experimental proof-of-concept cryptovirus macintosh se/30 used rsa tiny encryption algorithm tea hybrid encrypt victim data since public key crypto used cryptovirus contains encryption key attacker keeps corresponding private decryption key private young yung original experimental cryptovirus victim send asymmetric ciphertext attacker deciphers returns symmetric decryption key contains victim fee long electronic money existed young yung proposed electronic money could extorted encryption well stating virus writer effectively hold money ransom half given even e-money previously encrypted user use user gets encrypted cryptovirus referred attacks cryptoviral extortion overt attack part larger class attacks field called cryptovirology encompasses overt covert attacks cryptoviral extortion protocol inspired parasitic relationship h. r. giger facehugger host movie alien examples extortionate ransomware became prominent may 2005 mid-2006 trojans gpcode troj.ransom.a archiveus krotten cryzip mayarchive began utilizing sophisticated rsa encryption schemes ever-increasing key-sizes gpcode.ag detected june 2006 encrypted 660-bit rsa public key june 2008 variant known gpcode.ak detected using 1024-bit rsa key believed large enough computationally infeasible break without concerted distributed effort encrypting ransomware returned prominence late 2013 propagation cryptolocker\u2014using bitcoin digital currency platform collect ransom money december 2013 zdnet estimated based bitcoin transaction information 15 october 18 december operators cryptolocker procured us 27 million infected users cryptolocker technique widely copied months following including cryptolocker 2.0 thought related cryptolocker cryptodefense initially contained major design flaw stored private key infected system user-retrievable location due use windows built-in encryption apis august 2014 discovery trojan specifically targeting network-attached storage devices produced synology january 2015 reported ransomware-styled attacks occurred individual websites via hacking ransomware designed target linux-based web servers microsoft malware protection center identified trend away wsf files favour lnk files powershell scripting lnk shortcut files install locky ransomware automating infection operations rather relying traditional user downloads wsf files\u2014all made possible universal powershell windows application unfortunately cybercriminals able leverage powershell attacks years recent report application found involved nearly 40 endpoint security incidents attackers finding weaknesses windows operating system years \u2019 clear \u2019 something problematic powershell scripting ransomware strains used proxies tied tor hidden services connect command control servers increasing difficulty tracing exact location criminals furthermore dark web vendors increasingly started offer technology service symantec classified ransomware dangerous cyber threat august 2010 russian authorities arrested nine individuals connected ransomware trojan known winlock unlike previous gpcode trojan winlock use encryption instead winlock trivially restricted access system displaying pornographic images asked users send premium-rate sms costing around us 10 receive code could used unlock machines scam hit numerous users across russia neighbouring countries\u2014reportedly earning group us 16 million 2011 ransomware trojan surfaced imitated windows product activation notice informed users system windows installation re-activated due victim fraud online activation option offered like actual windows activation process unavailable requiring user call one six international numbers input 6-digit code malware claimed call would free routed rogue operator country high international phone rates placed call hold causing user incur large international long distance charges february 2013 ransomware trojan based stamp.ek exploit kit surfaced malware distributed via sites hosted project hosting services sourceforge github claimed offer fake nude pics celebrities july 2013 os x-specific ransomware trojan surfaced displays web page accuses user downloading pornography unlike windows-based counterparts block entire computer simply exploits behaviour web browser frustrate attempts close page normal means july 2013 21-year-old man virginia whose computer coincidentally contain pornographic photographs underage girls conducted sexualized communications turned police receiving deceived ransomware purporting fbi message accusing possessing child pornography investigation discovered incriminating files man charged child sexual abuse possession child pornography converse ransomware cryptovirology attack invented adam l. young threatens publish stolen information victim computer system rather deny victim access leakware attack malware exfiltrates sensitive host data either attacker alternatively remote instances malware attacker threatens publish victim data unless ransom paid attack presented west point 2003 summarized book malicious cryptography follows attack differs extortion attack following way extortion attack victim denied access valuable information pay get back attack presented victim retains access information disclosure discretion computer virus attack rooted game theory originally dubbed non-zero sum games survivable malware attack yield monetary gain cases malware acquires access information may damage victim user organization e.g. reputational damage could result publishing proof attack success increased popularity ransomware pc platforms ransomware targeting mobile operating systems also proliferated typically mobile ransomware payloads blockers little incentive encrypt data since easily restored via online synchronization mobile ransomware typically targets android platform allows applications installed third-party sources payload typically distributed apk file installed unsuspecting user may attempt display blocking message top applications another used form clickjacking cause user give device administrator privileges achieve deeper access system different tactics used ios devices exploiting icloud accounts using find iphone system lock access device ios 10.3 apple patched bug handling javascript pop-up windows safari exploited ransomware websites recently shown ransomware may also target arm architectures like found various internet-of-things iot devices industrial iot edge devices august 2019 researchers demonstrated possible infect dslr cameras ransomware digital cameras often use picture transfer protocol ptp standard protocol used transfer files researchers found possible exploit vulnerabilities protocol infect target camera ransomware execute arbitrary code attack presented defcon security conference las vegas proof concept attack actual armed malware 2012 major ransomware trojan known reveton began spread based citadel trojan based zeus trojan payload displays warning purportedly law enforcement agency claiming computer used illegal activities downloading unlicensed software child pornography due behaviour commonly referred police trojan warning informs user unlock system would pay fine using voucher anonymous prepaid cash service ukash paysafecard increase illusion computer tracked law enforcement screen also displays computer ip address versions display footage victim webcam give illusion user recorded reveton initially began spreading various european countries early 2012 variants localized templates branded logos different law enforcement organizations based user country example variants used united kingdom contained branding organizations metropolitan police service police national e-crime unit another version contained logo royalty collection society prs music specifically accused user illegally downloading music statement warning public malware metropolitan police clarified would never lock computer way part investigation may 2012 trend micro threat researchers discovered templates variations united states canada suggesting authors may planning target users north america august 2012 new variant reveton began spread united states claiming require payment 200 fine fbi using moneypak card february 2013 russian citizen arrested dubai spanish authorities connection crime ring using reveton ten individuals arrested money laundering charges august 2014 avast software reported found new variants reveton also distribute password-stealing malware part payload encrypting ransomware reappeared september 2013 trojan known cryptolocker generated 2048-bit rsa key pair uploaded turn command-and-control server used encrypt files using whitelist specific file extensions malware threatened delete private key payment bitcoin pre-paid cash voucher made within 3 days infection due extremely large key size uses analysts affected trojan considered cryptolocker extremely difficult repair even deadline passed private key could still obtained using online tool price would increase 10 btc\u2014which cost approximately us 2300 november 2013 cryptolocker isolated seizure gameover zeus botnet part operation tovar officially announced u.s. department justice 2 june 2014 department justice also publicly issued indictment russian hacker evgeniy bogachev alleged involvement botnet estimated least us 3 million extorted malware shutdown september 2014 wave ransomware trojans surfaced first targeted users australia names cryptowall cryptolocker cryptolocker 2.0 unrelated original cryptolocker trojans spread via fraudulent e-mails claiming failed parcel delivery notices australia post evade detection automatic e-mail scanners follow links page scan malware variant designed require users visit web page enter captcha code payload actually downloaded preventing automated processes able scan payload symantec determined new variants identified cryptolocker.f unrelated original cryptolocker due differences operation notable victim trojans australian broadcasting corporation live programming television news channel abc news 24 disrupted half hour shifted melbourne studios due cryptowall infection computers sydney studio another trojan wave torrentlocker initially contained design flaw comparable cryptodefense used keystream every infected computer making encryption trivial overcome however flaw later fixed late-november 2014 estimated 9,000 users infected torrentlocker australia alone trailing turkey 11,700 infections another major ransomware trojan targeting windows cryptowall first appeared 2014 one strain cryptowall distributed part malvertising campaign zedo ad network late-september 2014 targeted several major websites ads redirected rogue websites used browser plugin exploits download payload barracuda networks researcher also noted payload signed digital signature effort appear trustworthy security software cryptowall 3.0 used payload written javascript part email attachment downloads executables disguised jpg images evade detection malware creates new instances explorer.exe svchost.exe communicate servers encrypting files malware also deletes volume shadow copies installs spyware steals passwords bitcoin wallets fbi reported june 2015 nearly 1,000 victims contacted bureau internet crime complaint center report cryptowall infections estimated losses least 18 million recent version cryptowall 4.0 enhanced code avoid antivirus detection encrypts data files also file names fusob one major mobile ransomware families april 2015 march 2016 56 percent accounted mobile ransomware fusob like typical mobile ransomware employs scare tactics extort people pay ransom program pretends accusatory authority demanding victim pay fine 100 200 usd otherwise face fictitious charge rather surprisingly fusob suggests using itunes gift cards payment also timer clicking screen adds users \u2019 anxiety well order infect devices fusob masquerades pornographic video player thus victims thinking harmless unwittingly download fusob fusob installed first checks language used device uses russian certain eastern european languages fusob nothing otherwise proceeds lock device demand ransom among victims 40 germany united kingdom united states following 14.5 11.4 respectively fusob lots common small another major family mobile ransomware represented 93 mobile ransomware 2015 2016 may 2017 wannacry ransomware attack spread internet using exploit vector named eternalblue leaked u.s. national security agency ransomware attack unprecedented scale infected 230,000 computers 150 countries using 20 different languages demand money users using bitcoin cryptocurrency wannacry demanded us 300 per computer attack affected telef\u00f3nica several large companies spain well parts british national health service nhs least 16 hospitals turn away patients cancel scheduled operations fedex deutsche bahn honda renault well russian interior ministry russian telecom megafon attackers gave victims 7-day deadline day computers got infected encrypted files would deleted petya first discovered march 2016 unlike forms encrypting ransomware malware aimed infect master boot record installing payload encrypts file tables ntfs file system next time infected system boots blocking system booting windows ransom paid check point reported despite believed innovative evolution ransomware design resulted relatively-fewer infections ransomware active around time frame 27 june 2017 heavily modified version petya used global cyberattack primarily targeting ukraine affecting many countries version modified propagate using eternalblue exploit used wannacry due another design change also unable actually unlock system ransom paid led security analysts speculating attack meant generate illicit profit simply cause disruption 24 october 2017 users russia ukraine reported new ransomware attack named bad rabbit follows similar pattern wannacry petya encrypting user file tables demands bitcoin payment decrypt eset believed ransomware distributed bogus update adobe flash software among agencies affected ransomware interfax odessa international airport kiev metro ministry infrastructure ukraine used corporate network structures spread ransomware also discovered countries including turkey germany poland japan south korea united states experts believed ransomware attack tied petya attack ukraine especially bad rabbit code many overlapping analogical elements code petya/notpetya appending crowdstrike bad rabbit notpetya dll dynamic link library share 67 percent code though identity culprits names characters game thrones series embedded within code security experts found ransomware use eternalblue exploit spread simple method vaccinate unaffected machine running older windows versions found 24 october 2017 sites used spread bogus flash updating gone offline removed problematic files within days discovery effectively killing spread bad rabbit 2016 new strain ransomware emerged targeting jboss servers strain named samsam found bypass process phishing illicit downloads favor exploiting vulnerabilities weak servers malware uses remote desktop protocol brute-force attack guess weak passwords one broken virus behind attacks government healthcare targets notable hacks occurring town farmington new mexico colorado department transportation davidson county north carolina recently major breach security infrastructure atlanta mohammad mehdi shah mansouri born qom iran 1991 faramarz shahi savandi born shiraz iran 1984 wanted fbi allegedly launching samsam ransomware two allegedly made 6 million extortion caused 30 million damages using malware forms malware security software antivirus software might detect ransomware payload especially case encrypting payloads encryption way complete particularly new version unknown protective software distributed attack suspected detected early stages takes time encryption take place immediate removal malware relatively simple process completed would stop damage data without salvaging already lost security experts suggested precautionary measures dealing ransomware using software security policies block known payloads launching help prevent infection protect attacks keeping offline backups data stored locations inaccessible potentially infected computer external storage drives devices access network including internet prevents accessed ransomware installing security updates issued software vendors mitigate vulnerabilities leveraged certain strains propagate measures include cyber hygiene \u2212 exercising caution opening e-mail attachments links network segmentation keeping critical computers isolated networks furthermore mitigate spread ransomware measures infection control applied may include disconnecting infected machines networks educational programs effective communication channels malware surveillance ways collective participation number file systems keep snapshots data hold used recover contents files time prior ransomware attack event ransomware n't disable number tools intended specifically decrypt files locked ransomware although successful recovery may possible encryption key used files decryption tools use files uncorrupted backups encrypted copies known-plaintext attack jargon cryptanalysis works cipher attacker used weak begin vulnerable known-plaintext attack recovery key possible may take several days free ransomware decryption tools help decrypt files encrypted following forms ransomware aes_ni alcatraz locker apocalypse badblock bart btcware crypt888 cryptomix crysis encryptile findzip globe hidden tear jigsaw lambdalocker legion noobcrypt stampado szflocker teslacrypt xdata addition old copies files may exist disk previously deleted cases deleted versions may still recoverable using software designed purpose ransomware malicious software evolved since beginnings confined one two countries eastern europe spread across atlantic united states canada first versions type malware used various techniques disable computers locking victims system machine locker ransomware 133 examples ransomware works include locking screen displaying message branch local law enforcement indicating user \u2019 lines like \u201c browsed illicit materials must pay fine \u201d first seen russia year 2009 claiming message microsoft also used request payment sending sms message premium rate number next variant displayed pornographic image content demanded payment removal 2011 tactics changed attackers started use electronic payment methods added languages messages also changed based user \u2019 location obtained geo-locating user \u2019 ip addresses end users affected attacks corporations private entities government even hospitals also affected example healthcare although 2015 year largest ephi data breaches occurred according onc 2016 year ransomware started increase exponentially market according 2017 internet security threat report symantec corp ransomware affects systems also patient care clinical operations billing online criminals found \u201c easy money made healthcare \u201d according symantec report developed data insurance claims u.s. department health human services hhs ransomware growing rapidly across internet users also iot environment creates challenging problem infosec increasing attack surface area evolving sophisticated attacks becoming resistant time also accessible ever today cheap price attackers access ransomware service big problem millions dollars lost organizations industries decided pay hollywood presbyterian medical center medstar health end pressure offer services patients keep lives critical forced pay attacker knows problem paying ransom funding cybercrime according symantec 2019 istr report first time since 2013 2018 observed decrease ransomware activity drop 20 percent 2017 consumers preferred victims 2017 changed dramatically moved enterprises 2018 path accelerated 81 percent infections represented 12 percent increase common distribution method today based email campaigns cyber awareness training crucial detecting attacks whereas technology protect careless foolish behavior important organizations help users recognize malicious contact whereas ransomware typically introduced email social engineering techniques either download file provide key sensitive information take action bring harm organization according knowbe4 osterman report number approaches security awareness training practiced organizations managed security teams break room approach special meetings periodically held talk security monthly security videos short snippets security information simulated phishing tests target users internal phishing messages human firewall approach everyone subject simulated phishing employees prone attack identified do-nothing approach cyber awareness training exist organization effective successful cyber awareness training program must sponsored top organization supporting policies procedures effectively outline ramifications non-compliance frequency training process acknowledgement training without sponsorship \u201c c-level \u201d executives training ignored factors key successful cyber awareness training program establish baseline identifying level knowledge organization establish users knowledge prior training whichever approach organization decides implement important organization policies procedures place provide training date performed frequently backing entire organization top investment technology detect stop threats must maintained along need remember focus weakest link user publication proof-of-concept attack code common among academic researchers vulnerability researchers teaches nature threat conveys gravity issues enables countermeasures devised put place however lawmakers support law-enforcement bodies contemplating making creation ransomware illegal state maryland original draft hb 340 made felony create ransomware punishable 10 years prison however provision removed final version bill minor japan arrested creating distributing ransomware code young yung ansi c source code ransomware cryptotrojan on-line cryptovirology.com since 2005 part cryptovirology book written source code cryptotrojan still live internet associated draft chapter 2", + "neighbors": [ + 11, + 17, + 43, + 77, + 91, + 120, + 134, + 141, + 144, + 149, + 158, + 190, + 198, + 232, + 252, + 261, + 281, + 289, + 293, + 310, + 325, + 326, + 337, + 338, + 343, + 376, + 379, + 384, + 414, + 418, + 439, + 450, + 479, + 487, + 494, + 509, + 518, + 528, + 531, + 533, + 550, + 564, + 576, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 678, + 692, + 698, + 701, + 703, + 705, + 708, + 739, + 740, + 746, + 750, + 783, + 800, + 818, + 898, + 915, + 1039, + 1043, + 1063, + 1090, + 1101, + 1112, + 1162, + 1186, + 1239, + 1270, + 1293, + 1303, + 1309, + 1322, + 1325, + 1327, + 1332, + 1336, + 1342, + 1355, + 1361, + 1365, + 1368, + 1379, + 1393, + 1433, + 1436, + 1444, + 1467, + 1472, + 1475, + 1543, + 1573, + 1576, + 1582, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 294, + "label": 2, + "text": "OFono:ofono ofono free software project mobile telephony gsm/umts applications built 3gpp standards uses high-level d-bus api use telephony applications ofono free software released terms gnu general public license v2 ofono jointly announced linux intel nokia nokia since shipped ofono meego-based n9 meego project ended intel collaborated samsung new linux-based project named tizen first release tizen contained another telephony stack 2012 announced replace ofono early 2013 canonical ltd announced ubuntu touch also uses ofono another successor project meego sailfish os also uses ofono telephony since version 1.4 released august 2016 networkmanager use ofono modem manager", + "neighbors": [ + 85, + 120, + 134, + 213, + 219, + 264, + 265, + 267, + 305, + 306, + 327, + 346, + 400, + 401, + 571, + 650, + 661, + 720, + 725, + 736, + 935, + 986, + 988, + 1102, + 1138, + 1202, + 1208, + 1241, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 295, + "label": 6, + "text": "Encrypting_File_System:encrypting file system encrypting file system efs microsoft windows feature introduced version 3.0 ntfs provides filesystem-level encryption technology enables files transparently encrypted protect confidential data attackers physical access computer efs available versions windows developed business environments see supported operating systems windows 2000 onwards default files encrypted encryption enabled users per-file per-directory per-drive basis efs settings also mandated via group policy windows domain environments cryptographic file system implementations operating systems available microsoft efs compatible see also list cryptographic file systems operating system running system without file encryption access files normally goes os-controlled user authentication access control lists however attacker gains physical access computer barrier easily circumvented one way example would remove disk put another computer os installed read filesystem another would simply reboot computer boot cd containing os suitable accessing local filesystem widely accepted solution store files encrypted physical media disks usb pen drives tapes cds microsoft windows family operating systems efs enables measure although ntfs drives using combination public key cryptography symmetric key cryptography make decrypting files extremely difficult without correct key however cryptography keys efs practice protected user account password therefore susceptible password attacks words encryption file strong password unlock decryption key efs works encrypting file bulk symmetric key also known file encryption key fek uses symmetric encryption algorithm takes less time encrypt decrypt large amounts data asymmetric key cipher used symmetric encryption algorithm used vary depending version configuration operating system see algorithms used windows version fek symmetric key used encrypt file encrypted public key associated user encrypted file encrypted fek stored efs alternative data stream encrypted file decrypt file efs component driver uses private key matches efs digital certificate used encrypt file decrypt symmetric key stored efs stream efs component driver uses symmetric key decrypt file encryption decryption operations performed layer ntfs transparent user applications folders whose contents encrypted file system marked encryption attribute efs component driver treats encryption attribute way analogous inheritance file permissions ntfs folder marked encryption default files subfolders created folder also encrypted encrypted files moved within ntfs volume files remain encrypted however number occasions file could decrypted without user explicitly asking windows files folders decrypted copied volume formatted another file system like fat32 finally encrypted files copied network using smb/cifs protocol files decrypted sent network significant way preventing decryption-on-copy using backup applications aware raw apis backup applications implemented raw apis simply copy encrypted file stream efs alternative data stream single file words files copied e.g backup file encrypted form decrypted backup starting windows vista user private key stored smart card data recovery agent dra keys also stored smart card two significant security vulnerabilities existed windows 2000 efs variously targeted since windows 2000 local administrator default data recovery agent capable decrypting files encrypted efs local user efs windows 2000 function without recovery agent always someone decrypt encrypted files users non-domain-joined windows 2000 computer susceptible unauthorized efs decryption anyone take local administrator account trivial given many tools available freely internet windows xp later default local data recovery agent requirement one setting syskey mode 2 3 syskey typed bootup stored floppy disk mitigate risk unauthorized decryption local administrator account local user password hashes stored sam file encrypted syskey syskey value available offline attacker possess syskey passphrase/floppy windows 2000 user rsa private key stored truly encrypted form also backup user rsa private key weakly protected attacker gains physical access windows 2000 computer resets local user account password attacker log user recovery agent gain access rsa private key decrypt files backup user rsa private key encrypted lsa secret accessible attacker elevate login localsystem trivial given numerous tools internet windows xp beyond user rsa private key backed using offline public key whose matching private key stored one two places password reset disk windows xp member domain active directory windows xp member domain means attacker authenticate windows xp localsystem still access decryption key stored pc hard drive windows 2000 xp later user rsa private key encrypted using hash user ntlm password hash plus user name \u2013 use salted hash makes extremely difficult reverse process recover private key without knowing user passphrase also setting syskey mode 2 3 syskey typed bootup stored floppy disk mitigate attack since local user password hash stored encrypted sam file user logged successfully access efs encrypted data requires additional authentication decryption happens transparently thus compromise user password automatically leads access data windows store versions user account passphrases reversible encryption though longer default behaviour also configured store default original version windows xp lower lan manager hashes local user account passphrases attacked broken easily also stores local user account passphrases ntlm hashes fairly easily attacked using rainbow tables passwords weak windows vista later versions n't allow weak passwords default mitigate threat trivial brute-force attacks local passphrases older versions windows need configured using security settings portion group policy never store lm hashes course enable autologon stores plaintext passphrases registry using local user account passphrases 14 characters long prevents windows storing lm hash sam \u2013 added benefit making brute-force attacks ntlm hash harder encrypting files efs \u2013 converting plaintext files encrypted files \u2013 plaintext files wiped simply deleted i.e data blocks flagged use filesystem means unless example happen stored ssd trim support easily recovered unless overwritten fully mitigate known non-challenging technical attacks efs configure encryption folder level temporary files like word document backups created directories also encrypted wish encrypt individual files copy encrypted folder encrypt file place securely wipe disk volume use windows cipher utility /w option wipe free space including still contains deleted plaintext files various third-party utilities may work well anyone gain administrators access overwrite override change data recovery agent configuration serious issue since attacker example hack administrator account using third-party tools set whatever dra certificate want data recovery agent wait sometimes referred two-stage attack significantly different scenario risk due lost stolen pc highlights risk due malicious insiders user encrypts files first stage attack feks automatically encrypted designated dra public key attacker needs access computer administrator gain full access subsequently efs-encrypted files even using syskey mode 2 3 protect attack attacker could back encrypted files offline restore elsewhere use dra private key decrypt files course malicious insider gain physical access computer might consider security features irrelevant could also install rootkits software even hardware keyloggers etc computer \u2013 potentially much interesting effective overwriting dra policy files encrypted efs decrypted using rsa private key matching previously used public key stored copy user private key ultimately protected user logon password accessing encrypted files outside windows operating systems linux example possible \u2014 least currently third party efs component driver using special tools reset user login password render impossible decrypt user private key thus useless gaining access user encrypted files significance occasionally lost users resulting data loss user forgets password fails back encryption key led coining term delayed recycle bin describe seeming inevitability data loss inexperienced user encrypts files efs configured use keys issued public key infrastructure pki configured enable key archival recovery encrypted files recovered recovering private key first operating systems file systems native support efs windows efs supports range symmetric encryption algorithms depending version windows use files encrypted", + "neighbors": [ + 26, + 34, + 40, + 55, + 63, + 66, + 79, + 93, + 111, + 134, + 148, + 153, + 222, + 233, + 254, + 255, + 262, + 268, + 278, + 295, + 312, + 326, + 334, + 336, + 344, + 349, + 358, + 377, + 433, + 435, + 438, + 448, + 485, + 495, + 521, + 524, + 528, + 553, + 557, + 558, + 570, + 574, + 615, + 638, + 647, + 662, + 689, + 705, + 723, + 728, + 762, + 764, + 791, + 801, + 813, + 865, + 887, + 892, + 900, + 904, + 908, + 912, + 920, + 922, + 942, + 961, + 982, + 989, + 997, + 1003, + 1025, + 1035, + 1056, + 1064, + 1092, + 1097, + 1098, + 1104, + 1109, + 1110, + 1124, + 1138, + 1151, + 1157, + 1193, + 1201, + 1202, + 1212, + 1234, + 1243, + 1247, + 1252, + 1261, + 1283, + 1317, + 1322, + 1328, + 1338, + 1346, + 1363, + 1370, + 1381, + 1417, + 1445, + 1459, + 1461, + 1506, + 1517, + 1531, + 1533, + 1545, + 1547, + 1561, + 1565, + 1587, + 1589, + 1613, + 1620, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 296, + "label": 8, + "text": "Apache_Karaf:apache karaf apache karaf modular open source osgi release 6 runtime environment project became top level project 2010 previously subproject apache servicemix apache karaf work top two used osgi frameworks apache felix equinox osgi providing additional features karaf container modern polymorphic container lightweight powerful enterprise ready container powered osgi polymorphic means karaf host kind applications osgi spring war much karaf use standalone container bootstrap way using karaf boot karaf cellar clustering solution karaf allows manage multiple instances synchronization instances latest release 4.1.3 february 25 2019 karaf cave implementation osgi repository specification used karaf features resolver provide resources dealing requirements capabilities artifacts latest release 4.1.2 january 19 2019 decanter provides ready use monitoring solution including alerting key feature bam business activities monitoring also completely extensible customizable latest release 2.2.0 march 22 2019", + "neighbors": [ + 178, + 192, + 197, + 318, + 473, + 620, + 638, + 715, + 796, + 874, + 1091, + 1138, + 1163, + 1242, + 1254, + 1288, + 1454, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 297, + "label": 4, + "text": "VirusTotal:virustotal virustotal website created spanish security company hispasec sistemas launched june 2004 acquired google inc. september 2012 company ownership switched january 2018 chronicle subsidiary alphabet inc.. virustotal aggregates many antivirus products online scan engines check viruses user antivirus may missed verify false positives files 550 mb uploaded website sent via email anti-virus software vendors receive copies files flagged scans passed engine help improve software extension virustotal capability users also scan suspect urls search virustotal dataset virustotal dynamic analysis malware uses cuckoo sandbox virustotal selected pc world one best 100 products 2007 virustotal windows uploader application integrates explorer right-click contextual menu listed send virus total application also launches manually submitting url program currently running os virustotal stores name various hashes scanned file already scanned files identified known e.g. vt default sha256 hash without uploading complete files sha256 query url form codice_1 file uploads normally limited 128 mb 2017 virustotal discontinued support windows uploader several browser extensions available vtzilla mozilla firefox vtchromizer google chrome vtexplorer internet explorer allow user download files directly virustotal web application prior storing computer well scanning urls service also offers android app employs public api search installed application virustotal previously scanned ones show status application previously scanned submitted api key must provided restrictions public api usage may apply see public api virustotal provides free service public api allows automation online features upload scan files submit scan urls access finished scan reports make automatic comments urls samples restrictions apply requests made public api requiring individual api key freely obtained online signing low priority scan queue limited number requests per time frame etc antivirus engines used detection uploading files. ref name= files/url /ref antivirus scanning engines used url scanning utilities used provide additional info uploaded files files uploaded virustotal may shared freely anti-malware companies also retained store virustotal page states virustotal confidentiality files urls sent virustotal shared antivirus vendors security companies help improving services products believe eventually lead safer internet better end-user protection default file/url submitted virustotal detected least one scanner freely sent scanners detect resource additionally files urls enter private store may accessed premium mainly security/antimalware companies/organizations virustotal users improve security products services", + "neighbors": [ + 17, + 94, + 120, + 124, + 436, + 585, + 717, + 944, + 1038, + 1090, + 1101, + 1291, + 1350, + 1371 + ], + "mask": "Validation" + }, + { + "node_id": 298, + "label": 2, + "text": "CopperheadOS:copperheados copperheados source-available operating system smartphones tablet computers based android mobile platform adds privacy security features official releases android open source project google goal upstreaming back android linux openbsd august 2016 copperheados announced future versions operating system based android nougat 7.x would released no-commercial-usage license funding could acquired march 2017 support pixel pixel xl devices launched offer buy devices copperheados preinstalled june 11th 2018 daniel micay main developer copperheados then-chief technology officer 50 stakeholder company announced publicly cut company e-mail sent james donaldson order turn access subreddit micay twitter account mr. donaldson representing company let micay know micay would receive pay signed employment agreement twitter micay wrote mr. donaldson attempting seize micay personal gpg key also used secure key parts copperhead project micay reportedly deleted signing keys required release updates copperheados following list devices supported copperheados past following devices supported", + "neighbors": [ + 24, + 41, + 101, + 113, + 131, + 134, + 162, + 306, + 337, + 422, + 429, + 477, + 502, + 527, + 622, + 629, + 704, + 716, + 775, + 782, + 837, + 1018, + 1020, + 1051, + 1061, + 1082, + 1138, + 1183, + 1185, + 1193, + 1203, + 1276, + 1310, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 299, + "label": 4, + "text": "Monitor_mode:monitor mode monitor mode rfmon radio frequency monitor mode allows computer wireless network interface controller wnic monitor traffic received wireless channel unlike promiscuous mode also used packet sniffing monitor mode allows packets captured without associate access point ad hoc network first monitor mode applies wireless networks promiscuous mode used wired wireless networks monitor mode one eight modes 802.11 wireless cards operate master acting access point managed client also known station ad hoc repeater mesh wi-fi direct tdls monitor mode uses monitor mode include geographical packet analysis observing widespread traffic acquiring knowledge wi-fi technology hands-on experience especially useful auditing unsecure channels protected wep monitor mode also used help design wi-fi networks given area channel number wi-fi devices currently used discovered helps create better wi-fi network reduces interference wi-fi devices choosing least used wi-fi channels software kismac kismet combination packet analyzers read pcap files provide user interface passive wireless network monitoring usually wireless adapter unable transmit monitor mode restricted single wireless channel though dependent wireless adapter driver firmware features chipset also monitor mode adapter check see cyclic redundancy check crc values correct packets captured captured packets may corrupted microsoft windows network driver interface specification ndis api supported extensions monitor mode since ndis version 6 first available windows vista ndis 6 supports exposing 802.11 frames upper protocol levels previous versions exposed fake ethernet frames translated 802.11 frames monitor mode support ndis 6 optional feature may may implemented client adapter driver implementation details compliance ndis specifications vary vendor vendor many cases monitor mode support properly implemented vendor example ralink drivers report incorrect dbm readings realtek drivers include trailing 4-byte crc values versions windows prior windows vista packet analyzer applications wildpackets omnipeek tamosoft commview wifi provide device drivers support monitor mode linux interfaces 802.11 drivers support monitor mode many drivers offer support sta drivers ralink broadcom every manufacturer \u2019 provided driver \u2019 support monitor mode freebsd netbsd openbsd dragonfly bsd also provide interface 802.11 drivers supports monitor mode many drivers operating systems support monitor mode well mac os x 10.4 later releases drivers airport extreme network adapters allow adapter put monitor mode libpcap 1.0.0 later provides api select monitor mode capturing operating systems", + "neighbors": [ + 138, + 160, + 961, + 1278, + 1279, + 1337, + 1428, + 1451, + 1527 + ], + "mask": "Test" + }, + { + "node_id": 300, + "label": 7, + "text": "FinisTerrae:finisterrae finisterrae 100th supercomputer top500 ranking november 2007 running 12.97 teraflops would rank position 258 list june 2008 also third powerful supercomputer spain marenostrum magerit located galicia project promoted xunta de galicia regional government galicia spanish national research council csic founded 1993 serve platform foster scientific innovation invest research development estimated base project completed 2010 expected reach top10 powerful supercomputers world reaches full capacity supercomputer physically hosted cesga main finisterrae characteristics depicted following table one special characteristics supercomputer ratio cores ram one reason received denomination singular technical scientific installation spanish government denomination given installations value makes singular way installations include canary island grand telescope alba synchrotron even third fastest supercomputer spain projects require special amounts memory held first second supercomputer therefore must executed finisterrae finisterrae supercomputer located cesga integrated system shared-memory nodes smp numa architecture finisterrae composed 144 computational nodes hierarchic storing system main purpose aim supercomputer research supercomputer mainly used three universities located galicia universidade da coru\u00f1a universidade de santiago de compostela universidade de vigo well research organizations like csic main projects held supercomputer divided four fields", + "neighbors": [ + 51, + 86, + 123, + 134, + 227, + 280, + 314, + 340, + 465, + 579, + 611, + 719, + 755, + 846, + 847, + 876, + 1013, + 1081, + 1099, + 1219, + 1220, + 1599, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 301, + "label": 2, + "text": "GNU_Guix:gnu guix gnu guix cross-platform package manager tool instantiate manage operating system unix-like operating systems based nix package manager guile scheme apis specializes providing exclusively free software differing traditional package managers guix like nix utilizes purely functional deployment model software installed unique directories generated cryptographic hashes dependencies software included within hash solving problem dependency hell approach package management promises generate reliable reproducible portable packages guix packages defined functional guile scheme apis specifically designed package management dependencies tracked directly language special values called derivations evaluated guix daemon lazily guix keeps track references automatically installed packages garbage collected package depends cost greater storage requirements upgrades guix guaranteed atomic efficiently rolled back also enables multiple users safely install software system without administrator privileges extra storage requirements translates greater bandwidth usage binary substitutes downloaded compared distributions debian user chooses build everything source even larger storage space bandwidth required development gnu guix intertwined guix system guix 1.0 guix system distribution short guixsd complete installable gnu system using linux-libre kernel gnu shepherd init system roll-back feature guix inherited design nix found popular linux distributions debian derivatives arch linux derivatives major distributions fedora centos opensuse project coordinated internet team volunteers incorporated french non-profit guix europe members community features related package management features guix see features guix system inherited design nix content package manager kept directory /gnu/store guix daemon write access achieved via specialised bind mounts store file system mounted read prohibiting interference even root user guix daemon remounts store read/writable private namespace guix talks daemon build things fetch substitutes kept store guix like nix built garbage collection facilities help prune dead store items keep live ones example package definition hello-package written using guile package recipes easily inspected running e.g guix edit hello changed guix making system transparent easily hackable inherited design nix manipulation store items independent directories store begin base32 encoded hash contents dependencies item guix package uses profiles generations collection symlinks specific store items together comprising user installed profile every time package installed removed new generation built e.g profile user installed gnu hello contains links store item holds version hello installed currently used guix e.g version c087a90e06d7b9451f802323e24deb1862a21e0f guix corresponds following item /gnu/store/md2plii4g5sk66wg9cgwc964l3xwhrm9-hello-2.10 built recipe addition symlinks profile guix builds also contains union info-manuals man-pages icons fonts etc user browse documentation access icons fonts installed default symlinks profile generations stored /var/guix filesystem user create number profiles invoking guix package -p profile-name command new directory profile-name well profile-generation-symlinks created current directory guix package enables instantaneous roll-back previous profile generation via changing symlink earlier profile generation profiles also stored store e.g item profile containing hello /gnu/store/b4wipjlsapvnijmbawl7sh76087vpl4n-profile built activated running guix install hello guix environment enables user easily enter environment necessary packages development software present without clogging users default profile dependencies multiple projects e.g running guix environment hello enters throw-away environment everything needed compile hello guix present gcc guile etc. want persistent gc-rooted environment garbage collected next run guix gc create root e.g running guix environment -- root=hello-root hello enters environment everything needed compile guix present gcc guile etc registered root current directory symlinking items store guix pack enables user bundle together store items output docker binary image relocatable tarball squashfs binary guix pack enables user view different graphs packages dependencies guix system distribution abbreviated guixsd linux distribution built around gnu guix package manager enables declarative operating system configuration allows reliable system upgrades easily rolled back uses linux-libre kernel support gnu hurd kernel development february 3 2015 distribution added free software foundation list free linux distributions following cpu architectures supported ia-32 x64 aarch32 aarch64 april 2019 work progress power9 support system services core feature guix system enables user declaratively compose configuration daemons background services easily specify relevant configurations enables user within single configuration file declare whole os e.g tor proxy sshd server webserver serving guix-web via nginx specific port bootup system services ricardo wurmus one maintainers explains extendability like services defined using guile scheme list services continue grow 1.0.0 list services includes following guixsd uses gnu daemon shepherd init system developed tandem guix written guile well previously known dmd stood daemon managing daemons daemons-managing daemon changed names avoid collision digital mars compiler shepherd supplies user-space functionality asynchronously services shepherd generic functions object data types exported use shepherd extend base operating system defined way contrast systemd userspace shepherd process runs user core shepherd model user space initialisation concept extension form composability services designed layered onto services augmenting elaborate specialised behaviours desired expresses instantiation-based dependency relationships found many modern init systems making system modular also allows services interact variadically services arbitrary ways shepherd also provides so-called virtual services allow dynamic dispatch class related service objects instantiate mail transfer agent mta system system governed via shepherd daemon represent user space directed acyclic graph system-service \u2212 responsible early phases boot init \u2212 root subsequently initialised services extensions system-service functionality either directly transitively services written configured guile scheme gnu shepherd intended highly programmable system administrator also used manage per-user profiles unprivileged daemons services services configuration stored uniformly object-oriented scheme code core set services provided basic guix system distribution arbitrary new services flexibly declared guile object system goops existing services redefined user discretion asking shepherd dynamically rewrite services specified ways instantiation gnu shepherd originally designed work gnu hurd later adopted guixsd guixsd date unstable development git repository shared guix enables users organizations set stable release channels via channel-feature packages guix generally up-to-date thanks lack package maintainer bottleneck anyone contribute update subject community approval process assisted tools guix refresh changes git repository peer-reviewed community members committed one 45 people commit access practice sometimes builds cause system breakages users typo similar error often solved within minutes way guix pull operates means users retain working system meantime system update leave users broken system users easily roll back individual packages well whole system state means stable channel common linux distributions longer needed users willing report bug wait minutes trying update via guix pull gnu project announced november 2012 first release gnu guix functional package manager based nix provides among things guile scheme apis project started june 2012 ludovic court\u00e8s one gnu guile hackers august 20 2015 announced guix ported gnu hurd project fixed release schedule released approximately every 6 months jesse smith distrowatch weekly reviewed guixsd 0.15.0 said guixsd package manager like criticized limited hardware support limited documentation", + "neighbors": [ + 33, + 113, + 134, + 207, + 209, + 233, + 275, + 323, + 337, + 347, + 351, + 357, + 393, + 404, + 431, + 509, + 521, + 695, + 716, + 754, + 796, + 806, + 816, + 825, + 899, + 961, + 974, + 985, + 1004, + 1046, + 1055, + 1123, + 1126, + 1167, + 1180, + 1190, + 1214, + 1225, + 1227, + 1235, + 1276, + 1286, + 1292, + 1301, + 1311, + 1366, + 1369, + 1385, + 1413, + 1415, + 1430, + 1437, + 1458, + 1509, + 1539, + 1547, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 302, + "label": 4, + "text": "XACML:xacml xacml stands extensible access control markup language standard defines declarative fine-grained attribute-based access control policy language architecture processing model describing evaluate access requests according rules defined policies published standard specification one goals xacml promote common terminology interoperability access control implementations multiple vendors xacml primarily attribute-based access control system abac attributes bits data associated user action resource inputs decision whether given user may access given resource particular way role-based access control rbac also implemented xacml specialization abac xacml model supports encourages separation access decision point use access decisions baked client applications based local machine userids access control lists acls difficult update decision criteria governing policy changes client decoupled access decision authorization policies updated fly affect clients immediately version 1.0 ratified oasis standards organization 2003 version 2.0 ratified oasis standards organization february 1 2005 first committee specification xacml 3.0 released august 10 2010 latest version xacml 3.0 standardized january 2013 non-normative terminology following rfc 2904 except pap xacml structured 3 levels elements policy set contain number policy elements policy set elements policy contain number rule elements policies policy sets rules requests use subjects resources environments actions xacml provides target basically set simplified conditions subject resource action must met policy set policy rule apply given request policy policy set found apply given request rules evaluated determine access decision response addition way check applicability target information also provides way index policies useful need store many policies quickly sift find ones apply request access service arrives pdp know look policies might apply request policies indexed based target constraints note target may also specify applies request policy set policy rule contain target elements conditions exist rules conditions essentially advanced form target use broader range functions importantly used compare two attributes together e.g subject-id==doctor-id conditions possible implement segregation duty checks relationship-based access control within xacml concept called obligations used obligation directive policy decision point pdp policy enforcement point pep must carried access approved pep unable comply directive approved access may must realized augmentation obligations eliminates gap formal requirements policy enforcement example obligation could look like access control rule xacml obligation effective way meet formal requirements non-repudiation example hard implement access control rules furthermore formal requirements part access control policy obligations separate functions makes policies consistent centralization environment easier achieve happens xacml two rules policies contradict imagine instance first rule would say managers view documents second rule would say one work 9am request alice trying view document 8am rule wins combining algorithms tell us help resolve conflicts xacml defines number combining algorithms identified rulecombiningalgid policycombiningalgid attribute policy policyset elements respectively rule-combining algorithm defines procedure arriving access decision given individual results evaluation set rules similarly policy-combining algorithm defines procedure arriving access decision given individual results evaluation set policies list higher order functions listed formal definition refer xacml standard http //docs.oasis-open.org/xacml/3.0/xacml-core-v3-schema-wd-17.xsd xacml 3.0 introduces administrative delegation json profile xacml request/response rest profile xacml multiple decision profile xacml many implementation delegation new xacml 3.0 delegation mechanism used support decentralized administration access policies allows authority delegator delegate parts authority someone else authority another user delegate without need involve modification root policy delegation model delegation rights separated access rights instead referred administrative control policies access control administrative policies work together following scenario partnership companies many services protected access control system system implements following central rules protect resources allow delegation access control rules administration control rules consultant enters corporation delegation issued locally consultant supervisor authorizing consultant access systems directly delegator supervisor scenario may right delegate limited set access rights consultants new features xacml 3.0 listed http //www.webfarmr.eu/2010/07/enhancements-and-new-features-in-xacml-3-axiomatics/ xacml tc also publishing list changes http //wiki.oasis-open.org/xacml/differencesbetweenxacml2.0andxacml3.0 rule implements use-it-lose-it access control paradigm user log 30 days lose access pseudo-code deny currentdatetime lastlogin 30 days rule grants access current time greater 9am less 5pm following contains obligation block obligations statements returned along decision enrich decision flow example pep must log access granted 2013 2014 xacml technical committee focused designing new profiles facilitate developer integration include three profiles showcased cloud identity summit 2014 monterey california using profiles integrating fine-grained authorization applications becomes much easier json profile xacml simplifies integration pep pdp saml identity sso federation standard used authentication saml used common identity token format different applications saml xacml defined oasis saml xacml designed interoperate saml used carry identity information virtual identities xacml used drive access control logic policies oauth 2.0 considered authorization standard differs xacml though origin purpose applications oauth xacml handle user approval delegated access password management xacml simply provides xacml oauth combined together deliver comprehensive approach authorization", + "neighbors": [ + 402, + 415, + 964, + 1039, + 1324, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 303, + "label": 3, + "text": "Survivor_(1987_video_game):survivor 1987 video game survivor action game released 1987 spanish software house topo soft later re-released uk u.s. gold published several 8-bit formats including amstrad cpc msx zx spectrum player takes control alien bears striking resemblance race aliens alien series films aboard huge spacecraft filled many extraterrestrial creatures player must perpetuate alien race finding ten pods ship introducing incubators ship split 142 areas divided four zones zones joined doors air-vents player crawl zones also consist different levels connected lifts pods found large rooms different corridors vents make much spacecraft closely resemble sort room found 1980s platform games creatures ship dangerous player spit paralysing acid player limited amount energy sapped hostile creatures ship defence systems energy replenished managing place pod incubator eating one technicians found wandering around ship", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 304, + "label": 4, + "text": "Computer_Underground_Digest:computer underground digest computer underground digest cud weekly online newsletter early internet cultural social legal issues published gordon meyer jim thomas march 1990 march 2000 meyer thomas criminal justice professors northern illinois university intended newsletter cover topical social legal issues generated rise telecommunications internet existed primarily email mailing list usenet though archives later provided website newsletter came prominence published legal commentary updates concerning hacker crackdowns federal indictments leonard rose craig neidorf phrack cud published commentary membership subjects including legal social implications growing internet later web book reviews topical publications many off-topic postings readership overtaken growth online forums web ceased publication march 2000", + "neighbors": [ + 14, + 703 + ], + "mask": "Test" + }, + { + "node_id": 305, + "label": 2, + "text": "Dnotify:dnotify dnotify file system event monitor linux kernel one subfeatures fcntl call introduced 2.4 kernel series obsoleted inotify retained compatibility reasons function essentially extension filesystems notice changes filesystem report changes applications instead application checking changes filesystem application register notified kernel changes filesystem occur application select directories monitor types changes notified one major use desktop search utilities like beagle functionality permits reindexing changed files without scanning filesystem changes every minutes would inefficient told file changed directly kernel rather actively looking beagle utilities achieve change-to-reindexing times second small performance hits dnotify therefore enables use programs sensible manner daemons generally accepted distributors drain system performance noticeably provide userland functionality", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 294, + 327, + 346, + 400, + 401, + 438, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 306, + "label": 9, + "text": "C_(programming_language):c programming language c letter c general-purpose procedural computer programming language supporting structured programming lexical variable scope recursion static type system prevents unintended operations design c provides constructs map efficiently typical machine instructions found lasting use applications previously coded assembly language applications include operating systems well various application software computers ranging supercomputers embedded systems c originally developed bell labs dennis ritchie 1972 1973 make utilities running unix later applied re-implementing kernel unix operating system 1980s c gradually gained popularity nowadays one widely used programming languages c compilers various vendors available majority existing computer architectures operating systems c standardized ansi since 1989 see ansi c subsequently international organization standardization c imperative procedural language designed compiled using relatively straightforward compiler provide low-level access memory provide language constructs map efficiently machine instructions require minimal runtime support despite low-level capabilities language designed encourage cross-platform programming standards-compliant c program written portability mind compiled wide variety computer platforms operating systems changes source code language become available various platforms embedded microcontrollers supercomputers like procedural languages algol tradition c facilities structured programming allows lexical variable scope recursion static type system prevents unintended operations c executable code contained within subroutines also called functions though strictly sense functional programming function parameters always passed value pass-by-reference simulated c explicitly passing pointer values c program source text free-format using semicolon statement terminator curly braces grouping blocks statements c language also exhibits following characteristics c include certain features found languages object orientation garbage collection implemented emulated often use external libraries e.g. glib object system boehm garbage collector many later languages borrowed directly indirectly c including c++ c unix c shell go java javascript limbo lpc objective-c perl php python rust swift verilog systemverilog hardware description languages languages drawn many control structures basic features c. python dramatic exception also express highly similar syntax c tend combine recognizable expression statement syntax c underlying type systems data models semantics radically different origin c closely tied development unix operating system originally implemented assembly language pdp-7 dennis ritchie ken thompson incorporating several ideas colleagues eventually decided port operating system pdp-11 original pdp-11 version unix developed assembly language thompson needed programming language make utilities first tried make fortran compiler soon gave idea made new language b thompson simplified version bcpl however utilities written b b slow b could take advantage pdp-11 features byte addressability 1972 ritchie started improve b resulted creating new language c. c compiler utilities made included version 2 unix version 4 unix released nov. 1973 unix kernel extensively re-implemented c. time c language acquired powerful features codice_12 types unix one first operating system kernels implemented language assembly earlier instances include multics system written pl/i master control program mcp burroughs b5000 written algol 1961 around 1977 ritchie stephen c. johnson made changes language facilitate portability unix operating system johnson portable c compiler served basis several implementations c new platforms 1978 brian kernighan dennis ritchie published first edition c programming language book known c programmers k r served many years informal specification language version c describes commonly referred k r c second edition book covers later ansi c standard described k r introduced several language features even publication 1989 ansi standard many years k r c still considered lowest common denominator c programmers restricted maximum portability desired since many older compilers still use carefully written k r c code legal standard c well early versions c functions return types codice_30 must declared used function definition functions used without prior declaration presumed return type codice_30 example codice_30 type specifiers commented could omitted k r c required later standards since k r function declarations include information function arguments function parameter type checks performed although compilers would issue warning message local function called wrong number arguments multiple calls external function used different numbers types arguments separate tools unix lint utility developed among things could check consistency function use across multiple source files years following publication k r c several features added language supported compilers particular pcc vendors included large number extensions lack agreement standard library together language popularity fact even unix compilers precisely implemented k r specification led necessity standardization late 1970s 1980s versions c implemented wide variety mainframe computers minicomputers microcomputers including ibm pc popularity began increase significantly 1983 american national standards institute ansi formed committee x3j11 establish standard specification c. x3j11 based c standard unix implementation however non-portable portion unix c library handed ieee working group 1003 become basis 1988 posix standard 1989 c standard ratified ansi x3.159-1989 programming language c version language often referred ansi c standard c sometimes c89 1990 ansi c standard formatting changes adopted international organization standardization iso iso/iec 9899:1990 sometimes called c90 therefore terms c89 c90 refer programming language ansi like national standards bodies longer develops c standard independently defers international c standard maintained working group iso/iec jtc1/sc22/wg14 national adoption update international standard typically occurs within year iso publication one aims c standardization process produce superset k r c incorporating many subsequently introduced unofficial features standards committee also included several additional features function prototypes borrowed c++ codice_15 pointers support international character sets locales preprocessor enhancements although syntax parameter declarations augmented include style used c++ k r interface continued permitted compatibility existing source code c89 supported current c compilers c code written today based program written standard c without hardware-dependent assumptions run correctly platform conforming c implementation within resource limits without precautions programs may compile certain platform particular compiler due example use non-standard libraries gui libraries reliance compiler- platform-specific attributes exact size data types byte endianness cases code must compilable either standard-conforming k r c-based compilers codice_38 macro used split code standard k r sections prevent use k r c-based compiler features available standard c. ansi/iso standardization process c language specification remained relatively static several years 1995 normative amendment 1 1990 c standard iso/iec 9899/amd1:1995 known informally c95 published correct details add extensive support international character sets c standard revised late 1990s leading publication iso/iec 9899:1999 1999 commonly referred c99 since amended three times technical corrigenda c99 introduced several new features including inline functions several new data types including codice_39 codice_40 type represent complex numbers variable-length arrays flexible array members improved support ieee 754 floating point support variadic macros macros variable arity support one-line comments beginning codice_41 bcpl c++ many already implemented extensions several c compilers c99 part backward compatible c90 stricter ways particular declaration lacks type specifier longer codice_30 implicitly assumed standard macro codice_43 defined value codice_44 indicate c99 support available gcc solaris studio c compilers support many new features c99 c compiler microsoft visual c++ however implements c89 standard parts c99 required compatibility c++11 2007 work began another revision c standard informally called c1x official publication 2011-12-08 c standards committee adopted guidelines limit adoption new features tested existing implementations c11 standard adds numerous new features c library including type generic macros anonymous structures improved unicode support atomic operations multi-threading bounds-checked functions also makes portions existing c99 library optional improves compatibility c++ standard macro codice_43 defined codice_46 indicate c11 support available published june 2018 c18 current standard c programming language introduces new language features technical corrections clarifications defects c11 standard macro codice_43 defined codice_48 historically embedded c programming requires nonstandard extensions c language order support exotic features fixed-point arithmetic multiple distinct memory banks basic i/o operations 2008 c standards committee published technical report extending c language address issues providing common standard implementations adhere includes number features available normal c fixed-point arithmetic named address spaces basic i/o hardware addressing c formal grammar specified c standard line endings generally significant c however line boundaries significance preprocessing phase comments may appear either delimiters codice_49 codice_50 since c99 following codice_41 end line comments delimited codice_49 codice_50 nest sequences characters interpreted comment delimiters appear inside string character literals c source files contain declarations function definitions function definitions turn contain declarations statements declarations either define new types using keywords codice_12 codice_35 codice_14 assign types perhaps reserve storage new variables usually writing type followed variable name keywords codice_57 codice_30 specify built-in types sections code enclosed braces codice_59 codice_60 sometimes called curly brackets limit scope declarations act single statement control structures imperative language c uses statements specify actions common statement expression statement consisting expression evaluated followed semicolon side effect evaluation functions may called variables may assigned new values modify normal sequential execution statements c provides several control-flow statements identified reserved keywords structured programming supported codice_61 -codice_62 conditional execution codice_63-codice_4 codice_4 codice_2 iterative execution looping codice_2 statement separate initialization testing reinitialization expressions omitted codice_68 codice_69 used leave innermost enclosing loop statement skip reinitialization also non-structured codice_70 statement branches directly designated label within function codice_5 selects codice_72 executed based value integer expression expressions use variety built-in operators may contain function calls order arguments functions operands operators evaluated unspecified evaluations may even interleaved however side effects including storage variables occur next sequence point sequence points include end expression statement entry return function call sequence points also occur evaluation expressions containing certain operators codice_73 codice_10 codice_75 comma operator permits high degree object code optimization compiler requires c programmers take care obtain reliable results needed programming languages kernighan ritchie say introduction c programming language c like language blemishes operators wrong precedence parts syntax could better c standard attempt correct many blemishes impact changes already existing software basic c source character set includes following characters newline indicates end text line need correspond actual single character although convenience c treats one additional multi-byte encoded characters may used string literals entirely portable latest c standard c11 allows multi-national unicode characters embedded portably within c source text using codice_83 codice_84 encoding codice_85 denotes hexadecimal character although feature yet widely implemented basic c execution character set contains characters along representations alert backspace carriage return run-time support extended character sets increased revision c standard c89 32 reserved words also known keywords words used purposes predefined c99 reserved five words c11 reserved seven words recently reserved words begin underscore followed capital letter identifiers form previously reserved c standard use implementations since existing program source code using identifiers would affected c implementations started supporting extensions programming language standard headers define convenient synonyms underscored identifiers language previously included reserved word called codice_130 seldom implemented removed reserved word c supports rich set operators symbols used within expression specify manipulations performed evaluating expression c operators c uses operator codice_136 used mathematics express equality indicate assignment following precedent fortran pl/i unlike algol derivatives c uses operator codice_156 test equality similarity two operators assignment equality may result accidental use one place many cases mistake produce error message although compilers produce warnings example conditional expression codice_176 might mistakenly written codice_177 evaluated true codice_76 zero assignment c operator precedence always intuitive example operator codice_156 binds tightly executed prior operators codice_9 bitwise codice_149 bitwise expressions codice_182 must written codice_183 coder intent hello world example appeared first edition k r become model introductory program programming textbooks regardless programming language program prints hello world standard output usually terminal screen display original version main standard-conforming hello world program int main void first line program contains preprocessing directive indicated codice_184 causes compiler replace line entire text codice_185 standard header contains declarations standard input output functions codice_186 codice_187 angle brackets surrounding codice_185 indicate codice_185 located using search strategy prefers headers provided compiler headers name opposed double quotes typically include local project-specific header files next line indicates function named codice_190 defined codice_190 function serves special purpose c programs run-time environment calls codice_190 function begin program execution type specifier codice_30 indicates value returned invoker case run-time environment result evaluating codice_190 function integer keyword codice_15 parameter list indicates function takes arguments opening curly brace indicates beginning definition codice_190 function next line calls diverts execution function named codice_186 case supplied system library call codice_186 function passed provided single argument address first character string literal codice_199 string literal unnamed array elements type codice_57 set automatically compiler final 0-valued character mark end array codice_186 needs know codice_202 escape sequence c translates newline character output signifies end current line return value codice_186 function type codice_30 silently discarded since used careful program might test return value determine whether codice_186 function succeeded semicolon codice_206 terminates statement closing curly brace indicates end code codice_190 function according c99 specification newer codice_190 function unlike function implicitly return value codice_80 upon reaching codice_60 terminates function formerly explicit codice_211 statement required interpreted run-time system exit code indicating successful execution type system c static weakly typed makes similar type system algol descendants pascal built-in types integers various sizes signed unsigned floating-point numbers enumerated types codice_14 integer type codice_57 often used single-byte characters c99 added boolean datatype also derived types including arrays pointers records codice_12 unions codice_35 c often used low-level systems programming escapes type system may necessary compiler attempts ensure type correctness expressions programmer override checks various ways either using type cast explicitly convert value one type another using pointers unions reinterpret underlying bits data object way find c declaration syntax unintuitive particularly function pointers ritchie idea declare identifiers contexts resembling use declaration reflects use c usual arithmetic conversions allow efficient code generated sometimes produce unexpected results example comparison signed unsigned integers equal width requires conversion signed value unsigned generate unexpected results signed value negative c supports use pointers type reference records address location object function memory pointers dereferenced access data stored address pointed invoke pointed-to function pointers manipulated using assignment pointer arithmetic run-time representation pointer value typically raw memory address perhaps augmented offset-within-word field since pointer type includes type thing pointed expressions including pointers type-checked compile time pointer arithmetic automatically scaled size pointed-to data type pointers used many purposes c. text strings commonly manipulated using pointers arrays characters dynamic memory allocation performed using pointers many data types trees commonly implemented dynamically allocated codice_12 objects linked together using pointers pointers functions useful passing functions arguments higher-order functions qsort bsearch callbacks invoked event handlers null pointer value explicitly points valid location dereferencing null pointer value undefined often resulting segmentation fault null pointer values useful indicating special cases next pointer final node linked list error indication functions returning pointers appropriate contexts source code assigning pointer variable null pointer constant written codice_80 without explicit casting pointer type codice_218 macro defined several standard headers conditional contexts null pointer values evaluate false pointer values evaluate true void pointers codice_219 point objects unspecified type therefore used generic data pointers since size type pointed-to object known void pointers dereferenced pointer arithmetic allowed although easily many contexts implicitly converted object pointer type careless use pointers potentially dangerous typically unchecked pointer variable made point arbitrary location cause undesirable effects although properly used pointers point safe places made point unsafe places using invalid pointer arithmetic objects point may continue used deallocation dangling pointers may used without initialized wild pointers may directly assigned unsafe value using cast union another corrupt pointer general c permissive allowing manipulation conversion pointer types although compilers typically provide options various levels checking programming languages address problems using restrictive reference types array types c traditionally fixed static size specified compile time recent c99 standard also allows form variable-length arrays however also possible allocate block memory arbitrary size run-time using standard library codice_220 function treat array c unification arrays pointers means declared arrays dynamically allocated simulated arrays virtually interchangeable since arrays always accessed effect via pointers array accesses typically checked underlying array size although compilers may provide bounds checking option array bounds violations therefore possible rather common carelessly written code lead various repercussions including illegal memory accesses corruption data buffer overruns run-time exceptions bounds checking desired must done manually c special provision declaring multi-dimensional arrays rather relies recursion within type system declare arrays arrays effectively accomplishes thing index values resulting multi-dimensional array thought increasing row-major order multi-dimensional arrays commonly used numerical algorithms mainly applied linear algebra store matrices structure c array well suited particular task however since arrays passed merely pointers bounds array must known fixed values else explicitly passed subroutine requires dynamically sized arrays arrays accessed using double indexing workaround allocate array additional row vector pointers columns c99 introduced variable-length arrays address issues ordinary c arrays subscript notation codice_221 codice_222 designates pointer syntactic sugar codice_223 taking advantage compiler knowledge pointer type address codice_224 points base address pointed codice_222 incremented codice_27 bytes rather defined base address incremented codice_27 multiplied size element codice_222 points thus codice_221 designates codice_230th element array furthermore expression contexts notable exception operand codice_108 name array automatically converted pointer array first element implies array never copied whole named argument function rather address first element passed therefore although function calls c use pass-by-value semantics arrays effect passed reference size element determined applying operator codice_108 dereferenced element codice_222 codice_234 codice_235 number elements declared array codice_78 determined codice_237 latter applies array names variables declared subscripts codice_238 due semantics c possible determine entire size arrays pointers arrays created dynamic allocation codice_220 code codice_240 codice_241 designates pointer work since compiler assumes size pointer requested since array name arguments codice_108 converted pointers exhibit ambiguity however arrays created dynamic allocation accessed pointers rather true array variables suffer codice_108 issues array pointers thus despite apparent equivalence array pointer variables still distinction made even though name array expression contexts converted pointer first element pointer occupy storage array name l-value address constant unlike pointer variable consequently array points changed impossible assign new address array name array contents may copied however using codice_244 function accessing individual elements one important functions programming language provide facilities managing memory objects stored memory c provides three distinct ways allocate memory objects three approaches appropriate different situations various trade-offs example static memory allocation little allocation overhead automatic allocation may involve slightly overhead dynamic memory allocation potentially great deal overhead allocation deallocation persistent nature static objects useful maintaining state information across function calls automatic allocation easy use stack space typically much limited transient either static memory heap space dynamic memory allocation allows convenient allocation objects whose size known run-time c programs make extensive use three possible automatic static allocation usually simplest storage managed compiler freeing programmer potentially error-prone chore manually allocating releasing storage however many data structures change size runtime since static allocations automatic allocations c99 must fixed size compile-time many situations dynamic allocation necessary prior c99 standard variable-sized arrays common example see article codice_220 example dynamically allocated arrays unlike automatic allocation fail run time uncontrolled consequences dynamic allocation functions return indication form null pointer value required storage allocated static allocation large usually detected linker loader program even begin execution unless otherwise specified static objects contain zero null pointer values upon program startup automatically dynamically allocated objects initialized initial value explicitly specified otherwise initially indeterminate values typically whatever bit pattern happens present storage might even represent valid value type program attempts access uninitialized value results undefined many modern compilers try detect warn problem false positives false negatives occur another issue heap memory allocation synchronized actual usage program order reused much possible example pointer heap memory allocation goes scope value overwritten codice_249 called memory recovered later reuse essentially lost program phenomenon known memory leak conversely possible memory freed continue referenced leading unpredictable results typically symptoms appear portion program far removed actual error making difficult track problem issues ameliorated languages automatic garbage collection c programming language uses libraries primary method extension c library set functions contained within single archive file library typically header file contains prototypes functions contained within library may used program declarations special data types macro symbols used functions order program use library must include library header file library must linked program many cases requires compiler flags e.g. codice_250 shorthand link math library common c library c standard library specified iso ansi c standards comes every c implementation implementations target limited environments embedded systems may provide subset standard library library supports stream input output memory allocation mathematics character strings time values several separate standard headers example codice_185 specify interfaces standard library facilities another common set c library functions used applications specifically targeted unix unix-like systems especially functions provide interface kernel functions detailed various standards posix single unix specification since many programs written c wide variety libraries available libraries often written c c compilers generate efficient object code programmers create interfaces library routines used higher-level languages like java perl python file input output i/o part c language instead handled libraries c standard library associated header files e.g codice_185 file handling generally implemented high-level i/o works streams stream perspective data flow independent devices file concrete device high level i/o done association stream file c standard library buffer memory area queue temporarily used store data sent final destination reduces time spent waiting slower devices example hard drive solid state drive low-level i/o functions part standard c library generally part bare metal programming programming independent operating system embedded programming exceptions implementations include low-level i/o number tools developed help c programmers find fix statements undefined behavior possibly erroneous expressions greater rigor provided compiler tool lint first leading many others automated source code checking auditing beneficial language c many tools exist lint common practice use lint detect questionable code program first written program passes lint compiled using c compiler also many compilers optionally warn syntactically valid constructs likely actually errors misra c proprietary set guidelines avoid questionable code developed embedded systems also compilers libraries operating system level mechanisms performing actions standard part c bounds checking arrays detection buffer overflow serialization dynamic memory tracking automatic garbage collection tools purify valgrind linking libraries containing special versions memory allocation functions help uncover runtime errors memory usage c widely used systems programming implementing operating systems embedded system applications c code written portability used purposes yet needed system-specific code used access specific hardware addresses perform type punning match externally imposed interface requirements low run-time demand system resources c also used website programming using cgi gateway information web application server browser c often chosen interpreted languages speed stability near-universal availability one consequence c wide availability efficiency compilers libraries interpreters programming languages often implemented c. reference implementations python perl php example written c. layer abstraction thin overhead low c enables programmers create efficient implementations algorithms data structures useful computationally intense programs example gnu multiple precision arithmetic library gnu scientific library mathematica matlab completely partially written c. c sometimes used intermediate language implementations languages approach may used portability convenience using c intermediate language additional machine-specific code generators necessary c features line-number preprocessor directives optional superfluous commas end initializer lists support compilation generated code however c shortcomings prompted development c-based languages specifically designed use intermediate languages c -- c also widely used implement end-user applications however applications also written newer higher-level languages c directly indirectly influenced many later languages c go java javascript limbo lpc perl php python unix c shell pervasive influence syntactical languages mentioned combine statement less recognizably expression syntax c type systems data models and/or large-scale program structures differ c sometimes radically several c near-c interpreters exist including ch cint also used scripting object-oriented languages became popular c++ objective-c two different extensions c provided object-oriented capabilities languages originally implemented source-to-source compilers source code translated c compiled c compiler c++ programming language devised bjarne stroustrup approach providing object-oriented functionality c-like syntax c++ adds greater typing strength scoping tools useful object-oriented programming permits generic programming via templates nearly superset c c++ supports c exceptions objective-c originally thin layer top c remains strict superset c permits object-oriented programming using hybrid dynamic/static typing paradigm objective-c derives syntax c smalltalk syntax involves preprocessing expressions function declarations function calls inherited c syntax object-oriented features originally taken smalltalk addition c++ objective-c ch cilk unified parallel c nearly supersets c", + "neighbors": [ + 11, + 12, + 19, + 24, + 31, + 41, + 42, + 63, + 65, + 78, + 82, + 86, + 108, + 113, + 117, + 131, + 134, + 138, + 152, + 176, + 187, + 195, + 216, + 222, + 225, + 227, + 234, + 246, + 249, + 251, + 258, + 265, + 272, + 292, + 294, + 298, + 308, + 313, + 322, + 323, + 332, + 333, + 338, + 347, + 355, + 362, + 369, + 373, + 386, + 397, + 405, + 412, + 422, + 430, + 443, + 446, + 473, + 477, + 491, + 500, + 502, + 503, + 507, + 509, + 512, + 522, + 536, + 538, + 540, + 551, + 564, + 567, + 570, + 571, + 572, + 579, + 592, + 594, + 597, + 598, + 620, + 650, + 653, + 668, + 682, + 686, + 690, + 711, + 735, + 736, + 741, + 751, + 754, + 756, + 770, + 772, + 775, + 782, + 786, + 787, + 790, + 796, + 799, + 805, + 806, + 812, + 815, + 816, + 819, + 820, + 824, + 825, + 837, + 860, + 862, + 870, + 872, + 873, + 875, + 891, + 900, + 901, + 902, + 918, + 919, + 923, + 935, + 939, + 940, + 946, + 948, + 961, + 962, + 985, + 992, + 998, + 1003, + 1004, + 1005, + 1022, + 1024, + 1028, + 1030, + 1037, + 1044, + 1050, + 1059, + 1061, + 1065, + 1068, + 1074, + 1082, + 1088, + 1097, + 1103, + 1118, + 1120, + 1130, + 1132, + 1138, + 1146, + 1152, + 1158, + 1160, + 1166, + 1180, + 1183, + 1185, + 1188, + 1189, + 1190, + 1204, + 1207, + 1208, + 1212, + 1217, + 1219, + 1221, + 1225, + 1227, + 1232, + 1234, + 1235, + 1245, + 1251, + 1264, + 1275, + 1276, + 1287, + 1288, + 1298, + 1301, + 1302, + 1304, + 1310, + 1311, + 1319, + 1320, + 1324, + 1335, + 1342, + 1366, + 1372, + 1374, + 1381, + 1385, + 1388, + 1398, + 1400, + 1411, + 1413, + 1417, + 1418, + 1419, + 1430, + 1437, + 1449, + 1456, + 1457, + 1477, + 1480, + 1483, + 1491, + 1500, + 1502, + 1503, + 1507, + 1508, + 1511, + 1521, + 1528, + 1534, + 1536, + 1538, + 1546, + 1550, + 1558, + 1569, + 1570, + 1572, + 1588, + 1602, + 1604, + 1631, + 1633, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 307, + "label": 0, + "text": "Named-entity_recognition:named-entity recognition named-entity recognition ner also known entity identification entity chunking entity extraction subtask information extraction seeks locate classify named entity mentions unstructured text pre-defined categories person names organizations locations medical codes time expressions quantities monetary values percentages etc research ner systems structured taking unannotated block text one producing annotated block text highlights names entities example person name consisting one token two-token company name temporal expression detected classified state-of-the-art ner systems english produce near-human performance example best system entering muc-7 scored 93.39 f-measure human annotators scored 97.60 96.95 notable ner platforms include expression named entity word named restricts task entities one many strings words phrases stands fairly consistently referent closely related rigid designators defined kripke although practice ner deals many names referents philosophically rigid instance automotive company created henry ford 1903 referred ford ford motor company although ford refer many entities well see ford rigid designators include proper names well terms certain biological species substances exclude pronouns see coreference resolution descriptions pick referent properties see also de dicto de names kinds things opposed individuals example bank full named-entity recognition often broken conceptually possibly also implementations two distinct problems detection names classification names type entity refer e.g person organization location first phase typically simplified segmentation problem names defined contiguous spans tokens nesting bank america single name disregarding fact inside name substring america name segmentation problem formally similar chunking second phase requires choosing ontology organize categories things temporal expressions numerical expressions i.e. money percentages etc may also considered named entities context ner task instances types good examples rigid designators e.g. year 2001 also many invalid ones e.g. take vacations \u201c june \u201d first case year 2001 refers 2001st year gregorian calendar second case month june may refer month undefined year past june next june every june etc. arguable definition named entity loosened cases practical reasons definition term named entity therefore strict often explained context used certain hierarchies named entity types proposed literature bbn categories proposed 2002 used question answering consists 29 types 64 subtypes sekine extended hierarchy proposed 2002 made 200 subtypes recently 2011 ritter used hierarchy based common freebase entity types ground-breaking experiments ner social media text evaluate quality ner system output several measures defined usual measures called precision recall f1 score however several issues remain calculate values statistical measures work reasonably well obvious cases finding missing real entity exactly finding non-entity however ner fail many ways many arguably partially correct counted compete success failures example identifying real entity one overly simple method measuring accuracy merely count fraction tokens text correctly incorrectly identified part entity references entities correct type suffers least two problems first vast majority tokens real-world text part entity names baseline accuracy always predict entity extravagantly high typically 90 second mispredicting full span entity name properly penalized finding person first name last name follows might scored \u00bd accuracy academic conferences conll variant f1 score defined follows follows definition prediction misses single token includes spurious token wrong class hard error contribute positively either precision recall thus measure may said pessimistic case many errors close correct might adequate given purpose example one system might always omit titles ms. ph.d. compared system ground-truth data expects titles included cases every name treated error issues important actually examine kinds errors decide important given one goals requirements evaluation models based token-by-token matching proposed models may given partial credit overlapping matches using intersection union criterion allow finer grained evaluation comparison extraction systems ner systems created use linguistic grammar-based techniques well statistical models machine learning hand-crafted grammar-based systems typically obtain better precision cost lower recall months work experienced computational linguists statistical ner systems typically require large amount manually annotated training data semisupervised approaches suggested avoid part annotation effort many different classifier types used perform machine-learned ner conditional random fields typical choice research indicates even state-of-the-art ner systems brittle meaning ner systems developed one domain typically perform well domains considerable effort involved tuning ner systems perform well new domain true rule-based trainable statistical systems early work ner systems 1990s aimed primarily extraction journalistic articles attention turned processing military dispatches reports later stages automatic content extraction ace evaluation also included several types informal text styles weblogs text transcripts conversational telephone speech conversations since 1998 great deal interest entity identification molecular biology bioinformatics medical natural language processing communities common entity interest domain names genes gene products also considerable interest recognition chemical entities drugs context chemdner competition 27 teams participating task despite high f1 numbers reported muc-7 dataset problem named-entity recognition far solved main efforts directed reducing annotation labor employing semi-supervised learning robust performance across domains scaling fine-grained entity types recent years many projects turned crowdsourcing promising solution obtain high-quality aggregate human judgments supervised semi-supervised machine learning approaches ner another challenging task devising models deal linguistically complex contexts twitter search queries researchers comparisons ner performances different statistical models hmm hidden markov model maximum entropy crf conditional random fields feature sets researchers recently proposed graph-based semi-supervised learning model language specific ner tasks recently emerging task identifying important expressions text cross-linking wikipedia seen instance extremely fine-grained named entity recognition types actual wikipedia pages describing potentially ambiguous concepts example output wikification system another field seen progress remains challenging application ner twitter microblogs", + "neighbors": [ + 159, + 282, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Validation" + }, + { + "node_id": 308, + "label": 9, + "text": "Common_Lisp:common lisp common lisp cl dialect lisp programming language published ansi standard document ansi incits 226-1994 r2004 formerly x3.226-1994 r1999 common lisp hyperspec hyperlinked html version derived ansi common lisp standard common lisp language developed standardized improved successor maclisp early 1980s several groups already work diverse successors maclisp lisp machine lisp aka zetalisp spice lisp nil s-1 lisp common lisp sought unify standardise extend features maclisp dialects common lisp implementation rather language specification several implementations common lisp standard available including free open-source software proprietary products common lisp general-purpose multi-paradigm programming language supports combination procedural functional object-oriented programming paradigms dynamic programming language facilitates evolutionary incremental software development iterative compilation efficient run-time programs incremental development often done interactively without interrupting running application also supports optional type annotation casting added necessary later profiling optimization stages permit compiler generate efficient code instance codice_1 hold unboxed integer range supported hardware implementation permitting efficient arithmetic big integers arbitrary precision types similarly compiler told per-module per-function basis type safety level wanted using optimize declarations common lisp includes clos object system supports multimethods method combinations often implemented metaobject protocol common lisp extensible standard features lisp macros code transformations reader macros input parsers characters common lisp provides backwards compatibility maclisp john mccarthy original lisp allows older lisp software ported common lisp work common lisp started 1981 initiative arpa manager bob engelmore develop single community standard lisp dialect much initial language design done via electronic mail 1982 guy l. steele jr. gave first overview common lisp 1982 acm symposium lisp functional programming first language documentation published 1984 common lisp language first edition second edition published 1990 incorporated many changes language made ansi common lisp standardization process final ansi common lisp standard published 1994 since update standard published various extensions improvements common lisp examples unicode concurrency clos-based io provided implementations libraries many available via quicklisp common lisp dialect lisp uses s-expressions denote code data structure function calls macro forms special forms written lists name operator first examples common lisp many data types number types include integers ratios floating-point numbers complex numbers common lisp uses bignums represent numerical values arbitrary size precision ratio type represents fractions exactly facility available many languages common lisp automatically coerces numeric values among types appropriate common lisp character type limited ascii characters modern implementations allow unicode characters symbol type common lisp languages largely unknown outside symbol unique named data object several parts name value function property list package value cell function cell important symbols lisp often used similarly identifiers languages hold value variable however many uses normally symbol evaluated value returned symbols evaluate example symbols keyword package self-evaluating boolean values common lisp represented self-evaluating symbols nil common lisp namespaces symbols called 'packages number functions available rounding scalar numeric values various ways function codice_2 rounds argument nearest integer halfway cases rounded even integer functions codice_3 codice_4 codice_5 round towards zero respectively functions return discarded fractional part secondary value example codice_6 yields -3 0.5 codice_7 yields -2 -0.5 codice_8 yields 2 0.5 codice_9 yields 4 -0.5 sequence types common lisp include lists vectors bit-vectors strings many operations work sequence type almost lisp dialects lists common lisp composed conses sometimes called cons cells pairs cons data structure two slots called car cdr list linked chain conses empty list cons car refers member list possibly another list cons cdr refers next cons\u2014except last cons list whose cdr refers codice_10 value conses also easily used implement trees complex data structures though usually advised use structure class instances instead also possible create circular data structures conses common lisp supports multidimensional arrays dynamically resize adjustable arrays required multidimensional arrays used matrix mathematics vector one-dimensional array arrays carry type members even mixed types array specialized contain specific type members vector bits usually types supported many implementations optimize array functions array used type-specialized two type-specialized array types standard string vector characters bit-vector vector bits hash tables store associations data objects object may used key value hash tables automatically resized needed packages collections symbols used chiefly separate parts program namespaces package may export symbols marking part public interface packages use packages structures similar use c structs pascal records represent arbitrary complex data structures number type fields called slots structures allow single-inheritance classes similar structures offer dynamic features multiple-inheritance see clos classes added late common lisp conceptual overlap structures objects created classes called instances special case generic functions generic functions functions instances common lisp supports first-class functions instance possible write functions take functions arguments return functions well makes possible describe general operations common lisp library relies heavily higher-order functions example codice_11 function takes relational operator argument key function optional keyword argument used sort type data also sort data structures according key evaluation model functions simple evaluator encounters form codice_12 presumes symbol named f one following f name function arguments a1 a2 ... evaluated left-to-right order function found invoked values supplied parameters macro codice_14 defines functions function definition gives name function names arguments function body function definitions may include compiler directives known declarations provide hints compiler optimization settings data types arguments may also include documentation strings docstrings lisp system may use provide interactive documentation anonymous functions function literals defined using codice_13 expressions e.g codice_16 function squares argument lisp programming style frequently uses higher-order functions useful provide anonymous functions arguments local functions defined codice_17 codice_18 number operators related definition manipulation functions instance function may compiled codice_19 operator lisp systems run functions using interpreter default unless instructed compile others compile every function macro codice_20 defines generic functions generic functions collection methods macro codice_21 defines methods methods specialize parameters clos standard classes system classes structure classes individual objects many types corresponding system classes generic function called multiple-dispatch determine effective method use generic functions also first class data type many features generic functions methods described namespace function names separate namespace data variables key difference common lisp scheme common lisp operators define names function namespace include codice_14 codice_17 codice_18 codice_21 codice_20 pass function name argument another function one must use codice_27 special operator commonly abbreviated codice_28 first codice_11 example refers function named symbol codice_30 function namespace code codice_31 conversely call function passed way one would use codice_32 operator argument scheme evaluation model simpler one namespace positions form evaluated order -- arguments code written one dialect therefore sometimes confusing programmers experienced instance many common lisp programmers like use descriptive variable names list string could cause problems scheme would locally shadow function names whether separate namespace functions advantage source contention lisp community usually referred lisp-1 vs. lisp-2 debate lisp-1 refers scheme model lisp-2 refers common lisp model names coined 1988 paper richard p. gabriel kent pitman extensively compares two approaches common lisp supports concept multiple values expression always single primary value might also number secondary values might received inspected interested callers concept distinct returning list value secondary values fully optional passed via dedicated side channel means callers may remain entirely unaware secondary values need makes convenient use mechanism communicating information sometimes useful always necessary example multiple values supported handful standard forms common codice_35 special form accessing secondary values codice_36 returning multiple values data types common lisp include like programs many programming languages common lisp programs make use names refer variables functions many kinds entities named references subject scope association name entity name refers called binding scope refers set circumstances name determined particular binding circumstances determine scope common lisp include understand symbol refers common lisp programmer must know kind reference expressed kind scope uses variable reference dynamic versus lexical scope also run-time situation environment reference resolved binding introduced environment et cetera environments lisp globally pervasive instance new type defined known everywhere thereafter references type look global environment one type environment common lisp dynamic environment bindings established environment dynamic extent means binding established start execution construct codice_51 block disappears construct finishes executing lifetime tied dynamic activation deactivation block however dynamic binding visible within block also visible functions invoked block type visibility known indefinite scope bindings exhibit dynamic extent lifetime tied activation deactivation block indefinite scope visible functions called block said dynamic scope common lisp support dynamically scoped variables also called special variables certain kinds bindings necessarily dynamically scoped also restarts catch tags function bindings dynamically scoped using codice_17 provides lexically scoped function bindings function objects first-level object common lisp assigned dynamically scoped variables bound using codice_51 dynamic scope called using codice_32 codice_57 dynamic scope extremely useful adds referential clarity discipline global variables global variables frowned upon computer science potential sources error give rise ad-hoc covert channels communication among modules lead unwanted surprising interactions common lisp special variable top-level binding behaves like global variable programming languages new value stored value simply replaces top-level binding careless replacement value global variable heart bugs caused use global variables however another way work special variable give new local binding within expression sometimes referred rebinding variable binding dynamically scoped variable temporarily creates new memory location variable associates name location binding effect references variable refer new binding previous binding hidden execution binding expression terminates temporary memory location gone old binding revealed original value intact course multiple dynamic bindings variable nested common lisp implementations support multithreading dynamic scopes specific thread execution thus special variables serve abstraction thread local storage one thread rebinds special variable rebinding effect variable threads value stored binding retrieved thread created binding thread binds special variable codice_58 codice_58 behaves like thread-local storage among threads rebind codice_58 behaves like ordinary global threads refer top-level binding codice_58 dynamic variables used extend execution context additional context information implicitly passed function function without appear extra function parameter especially useful control transfer pass layers unrelated code simply extended extra parameters pass additional data situation like usually calls global variable global variable must saved restored scheme n't break recursion dynamic variable rebinding takes care variable must made thread-local else big mutex must used scheme n't break threads dynamic scope implementations take care also common lisp library many standard special variables instance standard i/o streams stored top-level bindings well-known special variables standard output stream stored *standard-output* suppose function foo writes standard output capture output character string *standard-output* bound string stream called common lisp supports lexical environments formally bindings lexical environment lexical scope may either indefinite extent dynamic extent depending type namespace lexical scope means visibility physically restricted block binding established references textually i.e lexically embedded block simply see binding tags tagbody lexical scope expression go x erroneous actually embedded tagbody contains label x however label bindings disappear tagbody terminates execution dynamic extent block code re-entered invocation lexical closure invalid body closure try transfer control tag via go tagbody executed first evaluates setf form stores function special variable *stashed* go end-label transfers control end-label skipping code print hello since end-label end tagbody tagbody terminates yielding nil suppose previously remembered function called situation erroneous one implementation response error condition containing message go tagbody tag some-label already left function tried evaluate go some-label lexically embedded tagbody resolves label however tagbody n't executing extent ended control transfer take place local function bindings lisp lexical scope variable bindings also lexical scope default contrast go labels indefinite extent lexical function variable binding established binding continues exist long references possible even construct established binding terminated references lexical variables functions termination establishing construct possible thanks lexical closures lexical binding default binding mode common lisp variables individual symbol switched dynamic scope either local declaration global declaration latter may occur implicitly use construct like defvar defparameter important convention common lisp programming special i.e dynamically scoped variables names begin end asterisk sigil codice_62 called \u201c earmuff convention \u201d adhered convention effectively creates separate namespace special variables variables intended lexical accidentally made special lexical scope useful several reasons firstly references variables functions compiled efficient machine code run-time environment structure relatively simple many cases optimized stack storage opening closing lexical scopes minimal overhead even cases full closures must generated access closure environment still efficient typically variable becomes offset vector bindings variable reference becomes simple load store instruction base-plus-offset addressing mode secondly lexical scope combined indefinite extent gives rise lexical closure turn creates whole paradigm programming centered around use functions first-class objects root functional programming thirdly perhaps importantly even lexical closures exploited use lexical scope isolates program modules unwanted interactions due restricted visibility lexical variables private one module binds lexical variable x calls another module b references x b accidentally resolve x bound b simply access x situations disciplined interactions variable desirable common lisp provides special variables special variables allow module set binding variable x visible another module b called able advantage able prevent happening also advantage consequently common lisp supports lexical dynamic scope macro lisp superficially resembles function usage however rather representing expression evaluated represents transformation program source code macro gets source surrounds arguments binds parameters computes new source form new form also use macro macro expansion repeated new source form use macro final computed form source code executed runtime typical uses macros lisp various standard common lisp features also need implemented macros macros defined defmacro macro special operator macrolet allows definition local lexically scoped macros also possible define macros symbols using define-symbol-macro symbol-macrolet paul graham book lisp describes use macros common lisp detail doug hoyte book let lambda extends discussion macros claiming macros single greatest advantage lisp programming language single greatest advantage programming language hoyte provides several examples iterative development macros macros allow lisp programmers create new syntactic forms language one typical use create new control structures example macro provides codice_73 looping construct syntax macro definition tagbody primitive common lisp special operator provides ability name tags use go form jump tags backquote provides notation provides code templates value forms preceded comma filled forms preceded comma at-sign spliced tagbody form tests end condition condition true jumps end tag otherwise provided body code executed jumps start tag example form using macro code expanded using function macroexpand-1 expansion example looks like macro expansion value variable test random 10 0 value variable body write-line hello body list forms symbols usually automatically upcased expansion uses tagbody two labels symbols labels computed gensym interned package two go forms use tags jump since tagbody primitive operator common lisp macro expanded something else expanded form uses macro also expanded fully expanding source form called code walking fully expanded walked form form replaced primitive macros must expanded source code containing evaluated compiled normally macros considered functions accept return s-expressions similar abstract syntax trees limited functions invoked evaluator compiler produce final source code macros written normal common lisp may use common lisp third-party operator available common lisp macros capable commonly called variable capture symbols macro-expansion body coincide calling context allowing programmer create macros wherein various symbols special meaning term variable capture somewhat misleading namespaces vulnerable unwanted capture including operator function namespace tagbody label namespace catch tag condition handler restart namespaces variable capture introduce software defects happens one following two ways scheme dialect lisp provides macro-writing system provides referential transparency eliminates types capture problem type macro system sometimes called hygienic particular proponents regard macro systems automatically solve problem unhygienic common lisp macro hygiene ensured one two different ways one approach use gensyms guaranteed-unique symbols used macro-expansion without threat capture use gensyms macro definition manual chore macros written simplify instantiation use gensyms gensyms solve type 2 capture easily applicable type 1 capture way macro expansion rename interfering symbols surrounding code capture references gensyms could used provide stable aliases global symbols macro expansion needs macro expansion would use secret aliases rather well-known names redefinition well-known names would ill effect macro another approach use packages macro defined package simply use internal symbols package expansion use packages deals type 1 type 2 capture however packages n't solve type 1 capture references standard common lisp functions operators reason use packages solve capture problems revolves around use private symbols symbols one package imported otherwise made visible packages whereas common lisp library symbols external frequently imported made visible user-defined packages following example unwanted capture operator namespace occurring expansion macro codice_73 macro expand form calls codice_75 intended refer standard common lisp macro codice_75 however context codice_75 may completely different meaning codice_73 may work properly common lisp solves problem shadowing standard operators functions forbidding redefinition redefines standard operator codice_75 preceding actually fragment non-conforming common lisp allows implementations diagnose reject condition system responsible exception handling common lisp provides conditions handler restart s. condition objects describing exceptional situation example error condition signaled common lisp system searches handler condition type calls handler handler search restarts use one restarts automatically repair current problem using information condition type relevant information provided part condition object call appropriate restart function restarts unhandled code presented users part user interface debugger example user select invoke one available restarts since condition handler called context error without unwinding stack full error recovery possible many cases exception handling systems would already terminated current routine debugger also customized replaced using codice_80 dynamic variable code found within unwind-protect forms finalizers also executed appropriate despite exception following example using symbolics genera user tries open file lisp function test called read-eval-print-loop repl file exist lisp system presents four restarts user selects retry open using different pathname restart enters different pathname lispm-init.lisp instead lispm-int.lisp user code contain error handling code whole error handling restart code provided lisp system handle repair error without terminating user code common lisp includes toolkit object-oriented programming common lisp object system clos one powerful object systems available language example peter norvig explains many design patterns simpler implement dynamic language features clos multiple inheritance mixins multimethods metaclasses method combinations etc. several extensions common lisp object-oriented programming proposed included ansi common lisp standard eventually clos adopted standard object-system common lisp clos dynamic object system multiple dispatch multiple inheritance differs radically oop facilities found static languages c++ java dynamic object system clos allows changes runtime generic functions classes methods added removed classes added redefined objects updated class changes class objects changed clos integrated ansi common lisp generic functions used like normal functions first-class data type every clos class integrated common lisp type system many common lisp types corresponding class potential use clos common lisp specification say whether conditions implemented clos pathnames streams could implemented clos usage possibilities clos ansi common lisp part standard actual common lisp implementations use clos pathnames streams input\u2013output conditions implementation clos lisp interpreter directly executes lisp source code provided lisp objects lists symbols numbers ... read s-expressions lisp compiler generates bytecode machine code lisp source code common lisp allows individual lisp functions compiled memory compilation whole files externally stored compiled code fasl files several implementations earlier lisp dialects provided interpreter compiler unfortunately often semantics different earlier lisps implemented lexical scoping compiler dynamic scoping interpreter common lisp requires interpreter compiler use lexical scoping default common lisp standard describes semantics interpreter compiler compiler called using function compile individual functions using function compile-file files common lisp allows type declarations provides ways influence compiler code generation policy latter various optimization qualities given values 0 important 3 important speed space safety debug compilation-speed also function evaluate lisp code codice_81 codice_81 takes code pre-parsed s-expressions like languages text strings way code constructed usual lisp functions constructing lists symbols code evaluated function codice_81 several common lisp implementations like clozure cl sbcl implementing codice_81 using compiler way code compiled even though evaluated using function codice_81 file compiler invoked using function compile-file generated file compiled code called fasl fast load file fasl files also source code files loaded function load running common lisp system depending implementation file compiler generates byte-code example java virtual machine c language code compiled c compiler directly native code common lisp implementations used interactively even though code gets fully compiled idea interpreted language thus apply interactive common lisp language makes distinction read-time compile-time load-time run-time allows user code also make distinction perform wanted type processing wanted step special operators provided especially suit interactive development instance codice_86 assign value provided variable n't already bound codice_87 always perform assignment distinction useful interactively evaluating compiling loading code live image features also provided help writing compilers interpreters symbols consist first-level objects directly manipulable user code codice_88 special operator allows create lexical bindings programmatically packages also manipulable lisp compiler available runtime compile files individual functions make easy use lisp intermediate compiler interpreter another language following program calculates smallest number people room probability completely unique birthdays less 50 birthday paradox 1 person probability obviously 100 2 364/365 etc. answer 23 convention constants common lisp enclosed characters calling example function using repl read eval print loop define class codice_89 method displaying name age person next define group persons list codice_89 objects iterate sorted list prints three names descending age use loop macro demonstrated example use compare built exponentiation with-open-file macro opens file provides stream form returning file automatically closed funcall calls function object loop collects lines match predicate function available-shells calls function list-matching-lines pathname anonymous function predicate predicate returns pathname shell nil string filename shell example results mac os x 10.6 common lisp frequently compared contrasted scheme\u2014if two popular lisp dialects scheme predates cl comes lisp tradition engineers\u2014guy l. steele gerald jay sussman designed scheme chaired standards committee common lisp common lisp general-purpose programming language contrast lisp variants emacs lisp autolisp extension languages embedded particular products gnu emacs autocad respectively unlike many earlier lisps common lisp like scheme uses lexical variable scope default interpreted compiled code lisp systems whose designs contributed common lisp\u2014such zetalisp franz lisp\u2014used dynamically scoped variables interpreters lexically scoped variables compilers scheme introduced sole use lexically scoped variables lisp inspiration algol 68 widely recognized good idea cl supports dynamically scoped variables well must explicitly declared special differences scoping ansi cl interpreters compilers common lisp sometimes termed lisp-2 scheme lisp-1 referring cl use separate namespaces functions variables fact cl many namespaces go tags block names codice_72 keywords long-standing controversy cl scheme advocates tradeoffs involved multiple namespaces scheme broadly necessary avoid giving variables names clash functions scheme functions frequently arguments named codice_92 codice_93 codice_94 conflict system function codice_95 however cl necessary explicitly refer function namespace passing function argument\u2014which also common occurrence codice_11 example cl also differs scheme handling boolean values scheme uses special values f represent truth falsity cl follows older lisp convention using symbols nil nil standing also empty list cl non-nil value treated true conditionals codice_68 whereas scheme non- f values treated true conventions allow operators languages serve predicates answering boolean-valued question returning useful value computation scheme value equivalent nil common lisp evaluates true boolean expression lastly scheme standards documents require tail-call optimization cl standard cl implementations offer tail-call optimization although often programmer uses optimization directive nonetheless common cl coding style favor ubiquitous use recursion scheme style prefers\u2014what scheme programmer would express tail recursion cl user would usually express iterative expression codice_75 codice_99 codice_72 recently codice_101 package see category common lisp defined specification like ada c rather one implementation like perl version 6 many implementations standard details areas may validly differ addition implementations tend come extensions provide functionality covered standard free open-source software libraries created support extensions common lisp portable way notably found repositories common-lisp.net clocc common lisp open code collection projects common lisp implementations may use mix native code compilation byte code compilation interpretation common lisp designed support incremental compilers file compilers block compilers standard declarations optimize compilation function inlining type specialization proposed language specification common lisp implementations compile source code native machine code implementations create optimized stand-alone applications others compile interpreted bytecode less efficient native code eases binary-code portability also compilers compile common lisp code c code misconception lisp purely interpreted language likely lisp environments provide interactive prompt code compiled one-by-one incremental way common lisp incremental compilation widely used unix-based implementations clisp sbcl used scripting language invoked system transparently way perl unix shell interpreter see category common lisp used develop research applications often artificial intelligence rapid development prototypes deployed applications common lisp used many commercial applications including yahoo store web-commerce site originally involved paul graham later rewritten c++ perl notable examples include also exist open-source applications written common lisp since 2011 zach beane support common lisp foundation maintained quicklisp library manager allows automatic download installing loading 3600 libraries required work one implementation common lisp license allows redistribution chronological list books published published common lisp language programming common lisp especially ai programming", + "neighbors": [ + 7, + 19, + 27, + 46, + 56, + 65, + 85, + 134, + 152, + 170, + 173, + 194, + 201, + 203, + 246, + 251, + 275, + 292, + 306, + 308, + 313, + 322, + 324, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 538, + 565, + 593, + 594, + 597, + 601, + 649, + 653, + 686, + 693, + 739, + 742, + 753, + 756, + 782, + 787, + 790, + 795, + 796, + 815, + 820, + 825, + 828, + 831, + 873, + 916, + 919, + 929, + 934, + 947, + 948, + 961, + 978, + 987, + 990, + 1006, + 1010, + 1021, + 1044, + 1066, + 1068, + 1076, + 1088, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1189, + 1190, + 1207, + 1213, + 1221, + 1225, + 1227, + 1242, + 1245, + 1246, + 1251, + 1269, + 1277, + 1298, + 1301, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1437, + 1466, + 1477, + 1481, + 1491, + 1502, + 1516, + 1532, + 1536, + 1588, + 1609, + 1632, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 309, + "label": 2, + "text": "Nokia_E60:nokia e60 nokia e60 traditional candybar style smartphone eseries business phone range s60 3rd edition symbian device introduced 12 october 2005 along nokia e61 nokia e70", + "neighbors": [ + 3, + 21, + 162, + 238, + 253, + 264, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1448, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 310, + "label": 4, + "text": "Vulnerability_scanner:vulnerability scanner vulnerability scanner computer program designed assess computers networks applications known weaknesses plain words scanners used discover weaknesses given system utilized identification detection vulnerabilities arising mis-configurations flawed programming within network-based asset firewall router web server application server etc modern vulnerability scanners allow authenticated unauthenticated scans modern scanners typically available saas software service provided internet delivered web application modern vulnerability scanner often ability customize vulnerability reports well installed software open ports certificates host information queried part workflow cis critical security controls effective cyber defense designates continuous vulnerability scanning critical control effective cyber defense", + "neighbors": [ + 11, + 77, + 149, + 293, + 364, + 379, + 439, + 479, + 518, + 528, + 531, + 576, + 698, + 703, + 739, + 740, + 762, + 800, + 910, + 938, + 993, + 1036, + 1039, + 1090, + 1112, + 1303, + 1325, + 1361, + 1368, + 1379, + 1472, + 1585 + ], + "mask": "Train" + }, + { + "node_id": 311, + "label": 5, + "text": "Border_Gateway_Protocol:border gateway protocol border gateway protocol bgp standardized exterior gateway protocol designed exchange routing reachability information among autonomous systems internet protocol classified path vector protocol border gateway protocol makes routing decisions based paths network policies rule-sets configured network administrator involved making core routing decisions bgp may used routing within autonomous system application referred interior border gateway protocol internal bgp ibgp contrast internet application protocol may referred exterior border gateway protocol external bgp ebgp current version bgp version 4 bgp4 published rfc 4271 2006 progressing 20 drafts documents based rfc 1771 version 4 rfc 4271 corrected errors clarified ambiguities updated specification common industry practices major enhancement support classless inter-domain routing cidr use route aggregation decrease size routing tables bgp4 use internet since 1994 ipv6 bgp first defined rfc 1883 1995 improved rfc 2283 1998 new rfc allows bgp-4 carry wide range ipv4 ipv6 address families also called multiprotocol extensions multiprotocol bgp mp-bgp bgp neighbors called peers established manual configuration among routers create tcp session port 179 bgp speaker sends 19-byte keep-alive messages every 60 seconds maintain connection among routing protocols bgp unique using tcp transport protocol bgp runs two peers autonomous system referred internal bgp ibgp interior border gateway protocol runs different autonomous systems called external bgp ebgp exterior border gateway protocol routers boundary one exchanging information another called border edge routers simply ebgp peers typically connected directly ibgp peers interconnected intermediate routers deployment topologies also possible running ebgp peering inside vpn tunnel allowing two remote sites exchange routing information secure isolated manner main difference ibgp ebgp peering way routes received one peer propagated peers instance new routes learned ebgp peer typically redistributed ibgp peers well ebgp peers transit mode enabled router however new routes learned ibgp peering re-advertised ebgp peers route-propagation rules effectively require ibgp peers inside interconnected full mesh routes propagated controlled detail via route-maps mechanism mechanism consists set rules rule describes routes matching given criteria action taken action could drop route could modify attributes route inserting routing table peering handshake open messages exchanged bgp speakers negotiate optional capabilities session including multiprotocol extensions various recovery modes multiprotocol extensions bgp negotiated time creation bgp speaker prefix network layer reachability information nlri advertises address family prefix families include ipv4 default ipv6 ipv4/ipv6 virtual private networks multicast bgp increasingly bgp used generalized signaling protocol carry information routes may part global internet vpns order make decisions operations peers bgp peer uses simple finite state machine fsm consists six states idle connect active opensent openconfirm established peer-to-peer session bgp implementation maintains state variable tracks six states session bgp defines messages peer exchange order change session one state another first state idle state idle state bgp initializes resources refuses inbound bgp connection attempts initiates tcp connection peer second state connect connect state router waits tcp connection complete transitions opensent state successful unsuccessful starts connectretry timer transitions active state upon expiration active state router resets connectretry timer zero returns connect state opensent state router sends open message waits one return order transition openconfirm state keepalive messages exchanged upon successful receipt router placed established state established state router send/receive keepalive update notification messages to/from peer simplest arrangement routers within single participating bgp routing must configured full mesh router must configured peer every router causes scaling problems since number required connections grows quadratically number routers involved alleviate problem bgp implements two options route reflectors rfc 4456 bgp confederations rfc 5065 following discussion basic update processing assumes full ibgp mesh given bgp router may accept network layer reachability information nlri updates multiple neighbors advertise nlri different set neighbors conceptually bgp maintains master routing table called local routing information base loc-rib separate main routing table router neighbor bgp process maintains conceptual adjacent routing information base incoming adj-rib-in containing nlri received neighbor conceptual adj-rib-out outgoing nlri sent neighbor conceptual preceding paragraph means physical storage structure various tables decided implementer bgp code structure visible bgp routers although usually interrogated management commands local router quite common example store two adj-ribs loc-rib together data structure additional information attached rib entries additional information tells bgp process things whether individual entries belong adj-ribs specific neighbors whether peer-neighbor route selection process made received policies eligible loc-rib whether loc-rib entries eligible submitted local router routing table management process eligible submitted bgp submit routes considers best main routing table process depending implementation process bgp route necessarily selected example directly connected prefix learned router hardware usually preferred long directly connected route interface active bgp route destination put routing table interface goes preferred routes loc-rib route would installed main routing table recently common mistake say bgp carries policies bgp actually carried information rules inside bgp-speaking routers could make policy decisions information carried explicitly intended used policy decisions communities multi-exit discriminators med bgp standard specifies number decision factors ones used common routing process selecting nlri go loc-rib first decision point evaluating nlri next-hop attribute must reachable resolvable another way saying next-hop must reachable must active route already main routing table router prefix next-hop address reachable next neighbor bgp process applies various standard implementation-dependent criteria decide routes conceptually go adj-rib-in neighbor could send several possible routes destination first level preference neighbor level one route destination installed conceptual adj-rib-in process also delete adj-rib-in routes withdrawn neighbor whenever conceptual adj-rib-in changes main bgp process decides neighbor new routes preferred routes already loc-rib replaces given route withdrawn neighbor route destination route removed loc-rib longer sent bgp main routing table manager router route destination non-bgp source withdrawn route removed main routing table verifying next hop reachable route comes internal i.e ibgp peer first rule apply according standard examine local_preference attribute several ibgp routes neighbor one highest local_preference selected unless several routes local_preference latter case route selection process moves next tie breaker local_preference first rule standard reachability next_hop verified cisco several vendors first consider decision factor called weight local router i.e transmitted bgp route highest weight preferred local_preference weight criteria manipulated local configuration software capabilities manipulation outside scope standard commonly used example community attribute see directly used bgp selection process bgp neighbor process however rule set local_preference another factor based manually programmed rule set attribute community value matches pattern matching criterion route learned external peer per-neighbor bgp process computes local_preference value local policy rules compares local_preference routes neighbor per-neighbor level ignoring implementation-specific policy modifiers order tie breaking rules recent edition bgp standard update multi_exit_disc value several implementations created med highest possible value current standard however specifies missing meds treated lowest possible value since current rule may cause different behavior vendor interpretations bgp implementations used nonstandard default value configuration feature allows old standard rule selected candidate routes received neighbors loc-rib software applies additional tie-breakers routes destination one route still tied point several bgp implementations offer configurable option load-share among routes accepting number bgp communities attribute tags applied incoming outgoing prefixes achieve common goal rfc 1997 common say bgp allows administrator set policies prefixes handled isps generally possible strictly speaking instance bgp natively concept allow one tell another restrict advertisement prefix north american peering customers instead isp generally publishes list well-known proprietary communities description one essentially becomes agreement prefixes treated examples common communities include local preference adjustments geographic peer type restrictions dos avoidance black holing prepending options isp might state routes received customers community xxx:500 advertised peers default community xxx:501 restrict advertisement north america customer simply adjusts configuration include correct community communities route isp responsible controlling prefix advertised end user technical ability enforce correct actions taken isp though problems area generally rare accidental common tactic end customers use bgp communities usually asn:70,80,90,100 control local preference isp assigns advertised routes instead using med effect similar also noted community attribute transitive communities applied customer rarely become propagated outside next-hop isps give communities public bgp extended community attribute added 2006 order extend range attributes provide community attribute structuring means type field extended format consists one two octets type field followed seven six octets respective community attribute content definition extended community attribute documented rfc 4360 iana administers registry bgp extended communities types extended communities attribute transitive optional bgp attribute however bit type field within attribute decides whether encoded extended community transitive non-transitive nature iana registry therefore provides different number ranges attribute types due extended attribute range usage manifold rfc 4360 exemplarly defines two-octet specific extended community ipv4 address specific extended community opaque extended community route target community route origin community number bgp qos drafts also use extended community attribute structure inter-domain qos signalling note since rfc 7153 extended communities compatible 32 bits asns introduction 32 bits numbers issues immediately obvious community attribute defines 16 bits asn field prevents matching field real asn value reason rfc 8092 rfc 8195 introduce large community attribute 12 bytes divided three field 4 bytes function parameter meds defined main bgp standard originally intended show another neighbor advertising preference several links preferred inbound traffic another application meds advertise value typically based delay multiple presence ixp impose send traffic destination following bgp version 4 message header format autonomous system internal bgp ibgp must ibgp peers connect full mesh everyone speaks everyone directly full-mesh configuration requires router maintain session every router large networks number sessions may degrade performance routers due either lack memory high cpu process requirements route reflectors confederations reduce number ibgp peers router thus reduce processing overhead route reflectors pure performance-enhancing technique confederations also used implement fine-grained policy route reflectors reduce number connections required single router two redundancy made route reflector routers need configured peers confederations sets autonomous systems common practice one confederation numbers seen internet whole confederations used large networks large configured encompass smaller manageable internal ass confederations used conjunction route reflectors confederations route reflectors subject persistent oscillation unless specific design rules affecting bgp interior routing protocol followed however alternatives introduce problems including following additionally route reflectors bgp confederations designed ease bgp router configuration nevertheless common tools experienced bgp network architects tools may combined example hierarchy route reflectors routing tables managed bgp implementation adjusted continually reflect actual changes network links breaking restored routers going coming back network whole normal changes happen almost continuously particular router link changes supposed relatively infrequent router misconfigured mismanaged may get rapid cycle states pattern repeated withdrawal re-announcement known route flapping cause excessive activity routers know broken link route continually injected withdrawn routing tables bgp design delivery traffic may function routes updated internet bgp routing change may cause outages several minutes feature known route flap damping rfc 2439 built many bgp implementations attempt mitigate effects route flapping without damping excessive activity cause heavy processing load routers may turn delay updates routes affect overall routing stability damping route flapping exponentially decayed first instance route becomes unavailable quickly reappears damping take effect maintain normal fail-over times bgp second occurrence bgp shuns prefix certain length time subsequent occurrences timed exponentially abnormalities ceased suitable length time passed offending route prefixes reinstated slate wiped clean damping also mitigate denial service attacks damping timings highly customizable also suggested rfc 2439 design choices stability sensitive suppression route advertisement route flap damping feature desirable implemented exterior border gateway protocol sessions ebgp sessions simply called exterior peers interior border gateway protocol sessions ibgp sessions simply called internal peers approach route flaps inside autonomous system propagated external ass flapping route ebgp chain flapping particular route throughout backbone method also successfully avoids overhead route flap damping ibgp sessions however subsequent research shown flap damping actually lengthen convergence times cases cause interruptions connectivity even links flapping moreover backbone links router processors become faster network architects suggested flap damping may important used since changes routing table handled much faster routers led ripe routing working group write current implementations bgp flap damping application flap damping isp networks recommended ... flap damping implemented isp operating network cause side-effects customers internet users customers content services ... side-effects would quite likely worse impact caused simply running flap damping improving stability without problems flap damping subject current research one largest problems faced bgp indeed internet infrastructure whole growth internet routing table global routing table grows point older less capable routers cope memory requirements cpu load maintaining table routers cease effective gateways parts internet connect addition perhaps even importantly larger routing tables take longer stabilize see major connectivity change leaving network service unreliable even unavailable interim late 2001 global routing table growing exponentially threatening eventual widespread breakdown connectivity attempt prevent isps cooperated keeping global routing table small possible using classless inter-domain routing cidr route aggregation slowed growth routing table linear process several years expanded demand multihoming end user networks growth superlinear middle 2004 full ipv4 bgp table excess 512,000 prefixes many older routers limit 512k 512,000\u2013524,288 routing table entries august 12 2014 outages resulting full tables hit ebay lastpass microsoft azure among others number cisco routers commonly use tcam form high-speed content-addressable memory storing bgp advertised routes impacted routers tcam default allocated 512k entries ipv4 routes 512k entries ipv6 routes reported number ipv6 advertised routes 20k number advertised ipv4 routes reached default limit causing spillover effect routers attempted compensate issue using slow software routing opposed fast hardware routing via tcam main method dealing issue involves operators changing tcam allocation allow ipv4 entries reallocating tcam reserved ipv6 routes requires reboot routers 512k problem predicted advance number professionals actual allocations pushed number routes 512k announcement 15,000 new routes short order starting 07:48 utc almost routes verizon autonomous systems 701 705 created result deaggregation larger blocks introducing thousands new routes making routing table reach 515,000 entries new routes appear reaggregated within 5 minutes instability across internet apparently continued number hours even verizon caused routing table exceed 512k entries short spike would happened soon anyway natural growth route summarization often used improve aggregation bgp global routing table thereby reducing necessary table size routers consider as1 allocated big address space would counted one route table due customer requirement traffic engineering purposes as1 wants announce smaller specific routes prefix hosts as1 announce specific route counts as1 announcing four routes as2 see four routes as1 routing policy as2 decide whether take copy four routes overlaps specific routes store summary as2 wants send data prefix sent routers as1 route as1 router either dropped destination unreachable icmp message sent back depending configuration as1 routers as1 later decides drop route leaving as1 drop number routes announces three as2 see three routes depending routing policy as2 store copy three routes aggregate prefix thereby reducing number routes as2 stores two as2 wants send data prefix dropped destination unreachable icmp message sent back routers as2 as1 would routing table rfc 1771 border gateway protocol 4 bgp-4 planned coding numbers 16 bits 64510 possible public since asn 64512 65534 reserved private use 0 65535 forbidden 2011 15000 numbers still available projections envisioning complete depletion available numbers september 2013 rfc 6793 extends coding 16 32 bits keeping 16 bits range 0 65535 reserved numbers allows 4 billion available additional private range also defined rfc 6996 4200000000 4294967294 4294967295 forbidden rfc 7300 allow traversal router groups able manage new asns new attribute ot as4_path used 32 bits asn assignments started 2007 another factor causing growth routing table need load balancing multi-homed networks trivial task balance inbound traffic multi-homed network across multiple inbound paths due limitation bgp route selection process multi-homed network announces network blocks across bgp peers result may one several inbound links become congested links remain under-utilized external networks picked set congested paths optimal like routing protocols bgp detect congestion work around problem bgp administrators multihomed network may divide large contiguous ip address block smaller blocks tweak route announcement make different blocks look optimal different paths external networks choose different path reach different blocks multi-homed network cases increase number routes seen global bgp table one method growing popularity address load balancing issue deploy bgp/lisp locator/identifier separation protocol gateways within internet exchange point allow ingress traffic engineering across multiple links technique increase number routes seen global bgp table design routers running bgp accept advertised routes bgp routers default allows automatic decentralized routing traffic across internet also leaves internet potentially vulnerable accidental malicious disruption known bgp hijacking due extent bgp embedded core systems internet number different networks operated many different organizations collectively make internet correcting vulnerability introducing use cryptographic keys verify identity bgp routers technically economically challenging problem extension bgp use multipathing typically requires identical med weight origin as-path although implementations provide ability relax as-path checking expect equal path length rather actual numbers path expected match extended features like cisco dmzlink-bw enables ratio traffic sharing based bandwidth values configured individual links multiprotocol extensions bgp mbgp sometimes referred multiprotocol bgp multicast bgp defined ietf nowiki rfc 4760 /nowiki extension bgp allows different types addresses known address families distributed parallel whereas standard bgp supports ipv4 unicast addresses multiprotocol bgp supports ipv4 ipv6 addresses supports unicast multicast variants multiprotocol bgp allows information topology ip multicast-capable routers exchanged separately topology normal ipv4 unicast routers thus allows multicast routing topology different unicast routing topology although mbgp enables exchange inter-domain multicast routing information protocols protocol independent multicast family needed build trees forward multicast traffic multiprotocol bgp also widely deployed case mpls l3 vpn exchange vpn labels learned routes customer sites mpls network order distinguish different customer sites traffic customer sites comes provider edge router pe router routing bgp4 standard internet routing required internet service providers isps establish routing one another large private ip networks use bgp internally example joining number large open shortest path first ospf networks ospf scale size required another reason use bgp multihoming network better redundancy either multiple access points single isp multiple isps routers especially small ones intended small office/home office soho use may include bgp software soho routers simply capable running bgp using bgp routing tables size commercial routers may need specific software executable image contains bgp license enables open source packages run bgp include gnu zebra quagga openbgpd bird xorp vyatta devices marketed layer 3 switches less likely support bgp devices marketed routers high-end layer 3 switches usually run bgp products marketed switches may may size limitation bgp tables 20,000 routes far smaller full internet table plus internal routes devices however may perfectly reasonable useful used bgp routing smaller part network confederation-as representing one several smaller enterprises linked bgp backbone backbones small enterprise announces routes isp accepts default route perhaps small number aggregated routes bgp router used network single point entry internet may much smaller routing table size hence ram cpu requirement multihomed network even simple multihoming modest routing table size see rfc 4098 vendor-independent performance parameters single bgp router convergence control plane actual amount memory required bgp router depends amount bgp information exchanged bgp speakers way particular router stores bgp information router may keep one copy route manage different policies route advertising acceptance specific neighboring term view often used different policy relationships running router one router implementation takes memory per route another implementation may legitimate design choice trading processing speed memory full ipv4 bgp table excess 590,000 prefixes large isps may add another 50 internal customer routes depending implementation separate tables may kept view different peer notable free open source implementations bgp include systems testing bgp conformance load stress performance come vendors", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 598, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 965, + 1116, + 1172, + 1200, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Train" + }, + { + "node_id": 312, + "label": 2, + "text": "Mail_(Windows):mail windows mail email newsgroup client developed microsoft included windows 8 8.1 10 operating systems main function mail sending receiving email successor outlook express either included released windows 9x family older versions windows nt family windows mail announced microsoft successor outlook express october 10 2005 via community website channel 9 initial version featured fundamental changes new user interface much way new features origins windows mail traced back pre-release version outlook express 7 included early builds windows vista known codename longhorn version outlook express introduced various changes user interface relied winfs management storage contacts data retaining support post office protocol pop internet message access protocol imap email protocols outlook express 7 dropped support http omission inherited windows mail windows mail user interface changed match look feel windows vista interface features imported microsoft outlook 2003 including right-hand reading pane microsoft help groups added preconfigured link microsoft newsgroups additional functionality layered top standard newsgroup functionality individual threads marked question answered question postings may rated well windows mail uses ipv6 domain name servers resolves ipv6 mail messages stored individual files instead single database file transactional index database based extensible storage engine enables real-time searching improves stability reliability stored data case corruption indices rebuilt mail files account setup information longer stored windows registry instead stored alongside mail making possible copy entire windows mail configuration mail store another machine single step bayesian junk-mail filtering top-level domain blocking encoding blocking added phishing filter incorporated well protecting users web sites identified malicious removed features windows mail include windows mail documented application programming interface api based component object model com predecessor outlook express also featured api undocumented except simple mapi messaging functionality windows vista supports american english french german spanish international sort windows mail absent windows 7 time microsoft intended spin several windows components independently developed apps introduced part windows essentials software suite thus windows mail omitted favor windows live mail made available windows xp vista 7 policy eventually reverted successors windows essentials apps gradually reintegrated windows 8 8.1 10 components windows live mail succeeded mail mail added windows 8 one many apps written run full-screen snapped per microsoft metro design language philosophy n't share code windows mail windows live mail lacks newsgroups support windows store app mail included app container calendar people three uninstalled reinstalled separately mail windows 8 comes preset server configurations popular email services outlook.com exchange gmail aol mail yahoo mail imap accounts configured directly support pop even though app run windows desktop multi-window support like many microsoft apps introduced windows 8 many features hidden charms initially hidden toolbar bottom screen revealed right-clicking users subscribed microsoft account sync configurations mail across different computers mail preset server configurations outlook.com exchange gmail icloud yahoo mail aol mail custom imap accounts still added pop support returned mail calendar still windows store apps app container updated together third sibling people moved container standalone app users set windows 10 mail use system theme choose custom accent color background image light/dark preference multi-window support open email messages new window emails listed mail jumplist mail uses settings panel email sorting tools second pane toolbar viewing pane like vista version mail version important controls readily visible accounts grouped relabeled folders created within app existing folders edited deleted mail default folders possible use outlook.com aliases mentions mail like microsoft outlook mail allows users set quick actions delete set flag archive respond messages system notifications swipe gestures mail rss reader ability customize default type font microsoft announced plans add features microsoft outlook outlook express mail uses invoke search \u2013 contrary microsoft products use", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 258, + 262, + 268, + 278, + 295, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 886, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1210, + 1212, + 1247, + 1249, + 1261, + 1287, + 1328, + 1338, + 1339, + 1346, + 1363, + 1370, + 1395, + 1407, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1604, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 313, + "label": 9, + "text": "Chicken_(Scheme_implementation):chicken scheme implementation chicken stylized chicken programming language specifically compiler interpreter implement dialect programming language scheme compiles scheme source code standard c. mostly r5rs compliant offers many extensions standard newer r7rs standard supported extension library chicken free open-source software available bsd license implemented mostly scheme parts c performance make embedding c programs easier chicken focus quickly clear slogan practical portable scheme system chicken main focus practical application scheme writing real-world software scheme well known use computer science curricula programming language experimentation seen little use business industry chicken community produced large set libraries perform variety tasks chicken wiki software running also chicken program also contains list software written chicken chicken goal portable compiling intermediate representation case portable c gambit bigloo programs written chicken compiled common popular operating systems linux macos unix-like systems windows haiku mobile platforms ios android also built-in support cross-compiling programs extensions allows used various embedded system platforms like many scheme compilers chicken uses standard c intermediate representation scheme program translated c chicken compiler c compiler translates c program machine code target computer architecture producing executable program universal availability c makes useful purpose chicken design inspired 1994 paper henry baker outlined innovative strategy compile scheme c. scheme program compiled c functions c functions never reach return statement instead call new continuation complete continuations c functions passed extra arguments c functions calculated compiler far essence continuation-passing style baker novel idea use c call stack scheme heap hence normal c stack operations automatic variable creation variable-sized array allocation used stack fills stack pointer reaches top stack garbage collection initiated design used copying garbage collector originally devised c. j. cheney copies live continuations live objects heap despite c code copy c stack frames scheme objects require knowledge c implementation full scheme heap consists c stack nursery together two heaps required generational garbage collector approach gives speed c stack many operations allows use continuations simple calls c functions baker solution guarantees asymptotic tail recursive behavior required scheme language standard implementation chicken scheme compiler even asymptotically safe space chicken scheme mostly r5rs-compliant notable limitations deviations r7rs compatibility supplied extension library core system basic support utf-8 characters however string indexing manipulation procedures utf-8 aware extension library exists adds support full utf-8 awareness chicken large software repository added libraries programs termed eggs system similar rubygems initially eggs developed one central svn repository creating tag would automatically cause new version extension become available download currently eggs developed anywhere version control system still maintaining semi-automatic release management using popular code hosting sites release method vcs-agnostic sense user need vcses installed developer free host anywhere choose even choose avoid public version control distribute plain tarballs released eggs latest version tested automatically part continuous integration process canonical test server exists core system eggs tested daily recent development version catch regressive bugs recent stable version ensure everything works users stable system also anyone volunteer supply testing capacity different hardware operating systems core releases chicken supports r5rs standard scheme also adds nonstandard features available scheme implementations chicken compiling c makes possible inject custom c code compiled result eases integrating c libraries foreign function interface supports converting back forth built-in c types corresponding scheme objects also extension libraries exist interfacing python lua java via java native interface jni bridge relatively easy cross-compile scheme code another platform example embedded use device make cross-compiling possible scheme code chicken imposes model separate compiling compiled module consists two shared libraries one library contains actual code used runtime compiled target platform import module used load code runs compile-time host platform procedural macro code chicken compiler also easily cross-compiled translation c achieved one simply use c compiler set build another platform since version 4 chicken built-in module system support low-level hygienic macros explicit renaming macros version 4 available add-on library standard syntax-rules macros also supported implicit renaming macros basically reversed version explicit renaming mechanism trades performance convenience identifier explicitly injected unhygienic automatically renamed avoid name capture performance cost occurs implicit renaming requires macro-expander retraverse expressions two times cost paid expansion time macro author must consider longer compiling times acceptable since version 4.11 chicken comes shipped debugger named feathers scheme code compiled needed debugging option debugging events injected specific points code implemented calls c function relatively low-overhead actually debugging code debugging try make tcp connection feathers server process possibly different machine process halted user may set breakpoints start program breakpoint hit client process debugged enters command loop allows interrogation client read variables mutate chicken supports local flow analysis allows compiler catch variable type errors compile-time perform type specialisation specialisation makes possible remove several safety checks type detection runtime type deduced compile-time results improved run-time performance scrutinizer allow cross-module flow analysis used optimize code part one compiling unit module", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 210, + 251, + 292, + 306, + 308, + 332, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 682, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1016, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1225, + 1245, + 1251, + 1277, + 1298, + 1315, + 1318, + 1319, + 1324, + 1372, + 1375, + 1385, + 1389, + 1398, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1511, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 314, + "label": 3, + "text": "Memory-level_parallelism:memory-level parallelism memory-level parallelism mlp term computer architecture referring ability pending multiple memory operations particular cache misses translation lookaside buffer tlb misses time single processor mlp may considered form instruction-level parallelism ilp however ilp often conflated superscalar ability execute one instruction time e.g processor intel pentium pro five-way superscalar ability start executing five different microinstructions given cycle handle four different cache misses 20 different load microinstructions time possible machine superscalar nevertheless high mlp arguably machine ilp superscalar executes one instruction time non-pipelined manner performs hardware prefetching software instruction-level prefetching exhibits mlp due multiple prefetches outstanding ilp multiple memory operations outstanding instructions instructions often conflated operations furthermore multiprocessor multithreaded computer systems may said exhibit mlp ilp due parallelism\u2014but intra-thread single process ilp mlp often however restrict terms mlp ilp refer extracting parallelism appears non-parallel single threaded code", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 280, + 300, + 331, + 335, + 340, + 352, + 362, + 375, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 611, + 643, + 659, + 719, + 737, + 752, + 776, + 803, + 821, + 846, + 847, + 876, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1099, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 315, + "label": 6, + "text": "DCache:dcache dcache system storing retrieving huge amounts data distributed among large number heterogenous server nodes single virtual filesystem tree variety standard access methods dcache open source software built java used among others ten fourteen tier1 sites cern store data large hadron collider dcache provides methods exchanging data backend tertiary storage systems well space management pool attraction dataset replication hot spot determination recovery disk node failures connected tertiary storage system cache simulates unlimited direct access storage space data exchanges underlying hierarchical storage management system performed automatically invisibly user beside protocols specific high-energy physics data dcache accessed via nfsv4.1 well webdav", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 316, + "label": 7, + "text": "HCentive:hcentive hcentive inc. based reston virginia software development company specializing cloud-based products health insurers state health agencies first company build health insurance exchange solution ground-up post affordable care act aca hcentive involved development state private health insurance marketplaces exchanges state organizations health insurance providers companies third party administrators works three top five health insurance organizations us 125 employees hcentive work corporate headquarters others based indian r center hcentive founded 2009 sanjay singh manoj agarwala tarun upadhyay started activities affordable care act became law expecting would create new market idea founding hcentive company emerged concepts aca health care reform debated united states congress company \u2019 ceo sanjay singh software engineer emigrated india 2000 singh co-founded globallogic software services company vienna virginia next fourteen years grew 7,000 employees webinsure state cloud-hosted solution state-based health insurance exchanges states new york colorado kentucky chosen product state health insurance marketplaces company also offers products private market webinsure private exchange solution cloud-based solution health plans tpas dental plans webinsure exchange manager integration health insurance exchange health insurance providers related parties august 2013 geisinger health plan ghp health insurance provider began cooperation hcentive implement health insurance exchange integration private exchange solutions rank 62 deloitte technology fast 500 north american 117 inc. 5000 2014 list 12 washington business journal fast 50 2015. ranked 19 among virginia-based companies ranked 117 inc. 5000 2014 list", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 317, + "label": 4, + "text": "RSA_Security:rsa security rsa security llc formerly rsa security inc. business rsa american computer network security company focus encryption encryption standards rsa named initials co-founders ron rivest adi shamir leonard adleman rsa public key cryptography algorithm also named among products rsa bsafe cryptography libraries securid authentication token rsa known allegedly incorporating backdoors developed nsa products also organizes annual rsa conference information security conference founded independent company 1982 rsa security acquired emc corporation 2006 us 2.1 billion operated division within emc emc acquired dell technologies 2016 rsa became part dell technologies family brands rsa based bedford massachusetts regional headquarters bracknell uk singapore numerous international offices ron rivest adi shamir leonard adleman developed rsa encryption algorithm 1977 founded rsa data security 1982 march 17 2011 rsa disclosed attack two-factor authentication products attack similar sykipot attacks july 2011 sk communications hack nightdragon series attacks rsa called advanced persistent threat today securid commonly used software token rather older physical tokens rsa relationship nsa changed years reuter joseph menn cybersecurity analyst jeffrey carr noted two adversarial relationship early years rsa leaders prominent advocates strong cryptography public use nsa bush clinton administrations sought prevent proliferation mid-1990s rsa bidzos led fierce public campaign clipper chip encryption chip backdoor would allow u.s. government decrypt communications clinton administration pressed telecommunications companies use chip devices relaxed export restrictions products used restrictions prevented rsa security selling software abroad rsa joined civil libertarians others opposing clipper chip among things distributing posters foundering sailing ship words sink clipper rsa security also created des challenges show widely used des encryption breakable well-funded entities like nsa relationship shifted adversarial cooperative bidzos stepped ceo 1999 according victor chan led rsa department engineering 2005 joined 10 people labs fighting nsa became different company later example rsa reported accepted 10 million nsa 2004 deal use nsa-designed dual ec drbg random number generator bsafe library despite many indications dual_ec_drbg poor quality possibly backdoored rsa security later released statement dual_ec_drbg kleptographic backdoor march 2014 reported reuters rsa also adapted extended random standard championed nsa later cryptanalysis showed extended random add security rejected prominent standards group internet engineering task force extended random however make nsa backdoor dual_ec_drbg tens thousands times faster use attackers key dual_ec_drbg backdoor presumably nsa extended nonces extended random made part internal state dual_ec_drbg easier guess rsa security java version hard crack without extended random since caching dual_ec_drbg output e.g rsa security c programming language version already made internal state fast enough determine indeed rsa security implemented extended random java implementation dual_ec_drbg 2004 2013 rsa shipped security software \u2014 bsafe toolkit data protection manager \u2014 included default cryptographically secure pseudorandom number generator dual ec drbg later suspected contain alleged secret national security agency kleptographic backdoor alleged backdoor could made data encrypted tools much easier break nsa allegedly secret private key backdoor scientifically speaking alleged backdoor employs kleptography essentially instance diffie hellman kleptographic attack published 1997 adam young moti yung rsa security employees aware least dual_ec_drbg might contain backdoor three employees members ansi x9f1 tool standards guidelines group dual_ec_drbg submitted consideration early 2000s possibility random number generator could contain backdoor first raised ansi x9 meeting according john kelsey co-author nist sp 800-90a standard contains dual_ec_drbg january 2005 two employees cryptography company certicom \u2014 also members x9f1 group \u2014 wrote patent application described backdoor dual_ec_drbg identical nsa one patent application also described three ways neutralize backdoor two \u2014 ensuring two arbitrary elliptic curve points p q used dual_ec_drbg independently chosen smaller output length \u2014 added standard option though nsa backdoored version p q large output length remained standard default option kelsey said knew implementers actually generated non-backdoored p q reports implementations using smaller outlet nevertheless nist included dual_ec_drbg 2006 nist sp 800-90a standard default settings enabling backdoor largely behest nsa officials cited rsa security early use random number generator argument inclusion standard also fix unrelated backdoor problem csprng predictable gj\u00f8steen pointed earlier 2006 lead gj\u00f8steen call dual_ec_drbg cryptographically sound ansi standard group members microsoft employees dan shumow niels ferguson made public presentation backdoor 2007 commenting shumow ferguson presentation prominent security researcher cryptographer bruce schneier called possible nsa backdoor rather obvious wondered nsa bothered pushing dual_ec_drbg included general poor quality possible backdoor would ensure nobody would ever use seem general awareness rsa security made default products 2004 snowden leak september 2013 new york times drawing snowden leaks revealed nsa worked insert vulnerabilities commercial encryption systems systems networks endpoint communications devices used targets part bullrun program one vulnerabilities times reported dual_ec_drbg backdoor renewed focus dual_ec_drbg noted rsa security bsafe used dual_ec_drbg default previously widespread awareness new york times published article rsa security recommended users switch away dual_ec_drbg denied deliberately inserted backdoor rsa security officials largely declined explain remove dubious random number generator flaws became known implement simple mitigation nist added standard neutralize suggested later verified backdoor reuters joseph menn reported nsa secretly paid rsa security 10 million 2004 set dual_ec_drbg default csprng bsafe story quoted former rsa security employees saying alarms raised deal handled business leaders rather pure technologists interviewed cnet schneier called 10 million deal bribe rsa officials responded entered contract engaged project intention weakening rsa \u2019 products menn stood story media analysis noted rsa reply non-denial denial denied company officials knew backdoor agreed deal assertion menn story make wake reports several industry experts cancelled planned talks rsa 2014 rsa conference among mikko hypp\u00f6nen finnish researcher f-secure cited rsa denial alleged 10 million payment nsa suspicious hypp\u00f6nen announced intention give talk governments malware authors conference quickly set reaction reports trustycon held day one block away rsa conference 2014 rsa conference former rsa security executive chairman art coviello defended rsa security choice keep using dual_ec_drbg saying became possible concerns raised 2007 might merit nist acknowledged problems 2013 rsa known securid product provides two-factor authentication hundreds technologies utilizing hardware tokens rotate keys timed intervals software tokens one time codes 2016 rsa re-branded securid platform rsa securid access release added single-sign-on capabilities cloud authentication resources using saml 2.0 types federation rsa securid\u00ae suite also contains rsa identity governance lifecycle solution formally aveksa solution provides visibility access within organization manages access various capabilities access review request provisioning rsa envision security information event management siem platform centralised log-management service claims enable organisations simplify compliance process well optimise security-incident management occur april 4 2011 emc purchased netwitness added rsa group products netwitness packet capture tool aimed gaining full network visibility detect security incidents tool re-branded rsa security analytics combination rsa envision netwitness siem tool log packet capture rsa archer grc platform software supports business-level management governance risk management compliance grc platform allows users adapt solutions requirements build new applications integrate external systems without touching single line code product originally developed archer technologies emc acquired 2010", + "neighbors": [ + 11, + 149, + 211, + 260, + 379, + 481, + 517, + 1240, + 1266, + 1350, + 1451, + 1576, + 1586 + ], + "mask": "Test" + }, + { + "node_id": 318, + "label": 7, + "text": "Apache_Impala:apache impala apache impala open source massively parallel processing mpp sql query engine data stored computer cluster running apache hadoop impala described open-source equivalent google f1 inspired development 2012 apache impala query engine runs apache hadoop project announced october 2012 public beta test distribution became generally available may 2013 impala brings scalable parallel database technology hadoop enabling users issue low-latency sql queries data stored hdfs apache hbase without requiring data movement transformation impala integrated hadoop use file data formats metadata security resource management frameworks used mapreduce apache hive apache pig hadoop software impala promoted analysts data scientists perform analytics data stored hadoop via sql business intelligence tools result large-scale data processing via mapreduce interactive queries done system using data metadata \u2013 removing need migrate data sets specialized systems and/or proprietary formats simply perform analysis features include early 2013 column-oriented file format called parquet announced architectures including impala december 2013 amazon web services announced support impala early 2014 mapr added support impala 2015 another format called kudu announced cloudera proposed donate apache software foundation along impala impala graduated apache top-level project tlp 28 november 2017", + "neighbors": [ + 178, + 192, + 197, + 296, + 620, + 715, + 796, + 864, + 874, + 1019, + 1091, + 1138, + 1163, + 1254, + 1323, + 1454, + 1583, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 319, + "label": 4, + "text": "HTTP_Public_Key_Pinning:http public key pinning http public key pinning hpkp internet security mechanism delivered via http header allows https websites resist impersonation attackers using mis-issued otherwise fraudulent digital certificates delivering set public keys client e.g web browser ones trusted future connections domain name example attackers might compromise certificate authority mis-issue certificates web origin combat risk https web server serves list \u201c pinned \u201d public key hashes valid given time subsequent connections validity time clients expect server use one public keys certificate chain error message shown easily bypassed user contrary common belief technique pin certificates public keys means one use key pair get certificate certificate authority one access private key alternatively also public keys root intermediate certificates created certificate authorities pinned would subsequently allow certificates issued certificate authority mechanism deprecated google chrome team late 2017 complexity dangerous side-effects google recommends using expect-ct safer alternative server communicates hpkp policy user agent via http response header field named codice_1 codice_2 reporting-only purposes hpkp policy specifies hashes subject public key info one certificates website authentic x.509 public key certificate chain least one backup key codice_3 directives period time user agent shall enforce public key pinning codice_4 directive optional codice_5 directive include subdomains domain sent header pinning policy optional codice_6 directive url send pinning violation reports least one public keys certificates certificate chain needs match pinned public key order chain considered valid user agent time publishing rfc 7469 allowed sha-256 hash algorithm hashes hpkp policy generated shell commands mentioned appendix a. rfc 7469 third-party tools website operator choose either pin root certificate public key particular root certificate authority allowing certificate authority intermediate authorities signed key issue valid certificates website domain and/or pin key one intermediate issuing certificates pin end-entity public key least one backup key must pinned case current pinned key needs replaced hpkp valid without backup key backup key defined public key present current certificate chain hpkp standardized rfc 7469 expands static certificate pinning hardcodes public key hashes well-known websites services within web browsers applications browsers disable pinning certificate chains private root certificates enable various corporate content inspection scanners web debugging tools mitmproxy fiddler nowiki rfc 7469 standard recommends disabling pinning violation reports user-defined root certificates acceptable browser disable pin validation. /nowiki user agent performs pin validation fails find valid spki fingerprint served certificate chain post json formatted host specified directive containing details violation uri may served via http https however user agent send hpkp violation reports https uri domain domain reporting violation hosts may either use http codice_6 use alternative domain use reporting service browsers also support codice_2 triggers reporting showing error user hpkp supported firefox opera chrome internet explorer/edge chrome deprecated hpkp release chrome 67", + "neighbors": [ + 74, + 88, + 172, + 235, + 260, + 261, + 533, + 539, + 542, + 554, + 576, + 646, + 684, + 692, + 826, + 1003, + 1089, + 1228, + 1240, + 1331, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 320, + "label": 4, + "text": "Cyxymu:cyxymu cyxymu screen name georgian blogger targeted co-ordinated series attacks social networking sites facebook google blogger livejournal twitter taking latter offline two hours august 7 2009 name mimics cyrillic spelling sukhumi \u0441\u0443\u0445\u0443\u043c\u0438 capital town georgian breakaway region abkhazia blogger extensively covers suffering georgian civilians war abkhazia accuses russia trying silence using cyberattacks facebook came defense cyxymu chief security officer max kelly stating \u201c simultaneous attack across number properties targeting keep voice heard cyxymu russian-language livejournal blog source information georgia news media 2007 state emergency 2008 russo-georgian war cyxymu lj blog previously targeted denial-of-service attacks october 2008 rendering livejournal servers unavailable three times october 26\u201327 attack cyxymu internationally seen part ongoing cyberwar russia georgia", + "neighbors": [ + 14, + 363 + ], + "mask": "Test" + }, + { + "node_id": 321, + "label": 3, + "text": "Martianoids:martianoids martianoids zx spectrum video game developed ultimate play game released 1987 although uses isometric projection ultimate second-generation isometric releases nightshade gunfright martianoids used scrolling display rather flip-screen earlier titles knight lore alien 8 contemporary ultimate title bubbler martianoids written partnership tim stamper chris stamper instead programmed team u.s. gold therefore ultimate game name ultimate penultimate title 8-bit home computers 1988 company became rare embarking long-running partnership nintendo develop console games players given cryptic introduction describing attack aliens known martianoids martianoids enter player ship attack brain ship photon weapons player must act prevent damage player lasers defence destroy internal walls computer components forth aliens", + "neighbors": [ + 48, + 618, + 822, + 1307, + 1312 + ], + "mask": "Test" + }, + { + "node_id": 322, + "label": 2, + "text": "List_of_operating_systems:list operating systems list operating systems computer operating systems categorized technology ownership licensing working state usage many characteristics practice many groupings may overlap criteria inclusion notability shown either existing wikipedia article citation reliable source non-unix operating systems still confirmed see also mobile operating systems", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 85, + 99, + 108, + 134, + 142, + 170, + 171, + 185, + 187, + 195, + 227, + 238, + 265, + 306, + 308, + 322, + 337, + 353, + 380, + 387, + 413, + 434, + 443, + 457, + 465, + 475, + 477, + 502, + 583, + 647, + 650, + 664, + 707, + 720, + 721, + 728, + 735, + 744, + 754, + 755, + 797, + 860, + 884, + 891, + 899, + 901, + 919, + 927, + 941, + 954, + 957, + 961, + 965, + 966, + 996, + 1011, + 1012, + 1016, + 1022, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1057, + 1063, + 1087, + 1095, + 1099, + 1100, + 1138, + 1155, + 1183, + 1187, + 1188, + 1196, + 1202, + 1208, + 1213, + 1221, + 1224, + 1276, + 1287, + 1295, + 1301, + 1304, + 1373, + 1391, + 1394, + 1398, + 1415, + 1421, + 1441, + 1456, + 1474, + 1494, + 1530, + 1538, + 1546, + 1578, + 1605, + 1610, + 1616, + 1629, + 1631, + 1632, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 323, + "label": 2, + "text": "GNU_variants:gnu variants gnu variants also called gnu distributions distros short operating systems based upon gnu operating system hurd kernel gnu c library system libraries application software like gnu coreutils bash gnome guix package manager etc. according gnu project others also include operating systems using linux kernel others using bsd-based kernels gnu users usually obtain operating system downloading gnu distributions available wide variety systems ranging embedded devices example librecmc personal computers example debian gnu/hurd powerful supercomputers example rocks cluster distribution hurd official kernel developed gnu system linux-libre also became official gnu package debian gnu/hurd discussed release technology preview debian 7.0 wheezy however plans discarded due immature state system however maintainers debian gnu/hurd decided publish unofficial release release date debian 7.0 debian gnu/hurd considered yet provide performance stability expected production system among open issues incomplete implementation java x.org graphical user interfaces limited hardware driver support two thirds debian packages ported hurd arch hurd derivative work arch linux porting gnu hurd system packages optimised intel p6 architecture goal provide arch-like user environment bsd-style init scripts pacman package manager rolling releases simple set gnu hurd stable enough least occasional use although abandoned 2018 project produced livecd evaluation purposes installations guides livecd conventional installation term gnu/linux gnu+linux used fsf supporters refer operating system linux kernel distributed gnu system software distributions primary installed base gnu packages programs also linux notable official use term distribution debian gnu/linux 2018 gnu variants recommended gnu project regular use linux distributions committed free system distribution guidelines refer gnu/linux like debian actually use deblobbed version linux like linux-libre linux per se debian gnu/kfreebsd operating system ia-32 x86-64 computer architectures distribution gnu debian package management kernel freebsd k kfreebsd abbreviation kernel reflects fact kernel complete freebsd operating system used operating system officially released debian squeeze 6.0 february 6 2011 one debian gnu/kfreebsd live cd ging longer maintained nexenta os first distribution combines gnu userland exception libc opensolaris libc used debian packaging organisation opensolaris kernel nexenta os available ia-32 x86-64 based systems nexenta systems inc initiated project sponsors continued development nexenta os considered gnu variant due use opensolaris libc multiple illumos distributions use gnu userland default cygwin project actively-developed compatibility layer form c library providing substantial part posix api functionality windows well distribution gnu unix-like programs ecosystem first released 1995 cygnus solutions red hat 2016 microsoft canonical added official compatibility layer windows 10 translates linux kernel calls windows nt ones reverse wine allows elf executables run unmodified windows intended provide web developers familiar gnu userland top windows kernel combination dubbed linux windows even though linux i.e operating system family defined common use linux kernel absent", + "neighbors": [ + 38, + 134, + 171, + 189, + 209, + 290, + 301, + 306, + 412, + 457, + 806, + 816, + 825, + 899, + 985, + 992, + 1123, + 1138, + 1180, + 1190, + 1214, + 1287, + 1301, + 1322, + 1385, + 1413, + 1509, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 324, + "label": 9, + "text": "List_of_command-line_interpreters:list command-line interpreters computing command-line interpreter command language interpreter blanket term certain class programs designed read lines text entered user thus implementing command-line interface many variants unix shell", + "neighbors": [ + 117, + 170, + 308, + 373, + 521, + 538, + 567, + 670, + 824, + 948, + 1027, + 1028, + 1225, + 1227, + 1235, + 1298, + 1311, + 1370, + 1397 + ], + "mask": "Test" + }, + { + "node_id": 325, + "label": 4, + "text": "EFAIL:efail efail also written efail security hole email systems content transmitted encrypted form gap allows attackers access decrypted content email contains active content like html javascript loading external content enabled client affected email clients include gmail apple mail microsoft outlook two related common vulnerabilities exposures ids issued security gap made public 13 may 2018 damian poddebniak christian dresen jens m\u00fcller fabian ising sebastian schinzel simon friedberger juraj somorovsky j\u00f6rg schwenk part contribution 27th usenix security symposium baltimore august 2018 result vulnerability content attacked encrypted email transmitted attacker plain text vulnerable email client used encryption keys disclosed security gap concerns many common email programs used email encryption systems openpgp s/mime attacker needs access attacked email message encrypted form well ability send email least one regular recipient original email exploit security gap attacker modifies encrypted email causing recipient email program send decrypted content email attacker access decrypted content encrypted email attacker modifies email attacked contain text prepared attacker specific way attacker sends changed email one regular recipients attacker inserts additional text encrypted text encrypted email thereby changing message multipart/mixed mime message created encrypted part message appears together limit marks mime message parameter value html tag example modified s/mime mail content-type multipart/mixed boundary= boundary -- boundary content-type text/html img src= http //attacker.chosen.url -- boundary content-type application/pkcs7-mime content-transfer-encoding base64 encryptedmessageencryptedmessageencryptedmessageencryptedmessage -- boundary content-type text/html -- boundary email client first breaks multipart message individual parts using codice_1 tag decrypts encrypted parts reassembles multipart message receives message way content-type multipart/mixed boundary= boundary -- boundary content-type text/html img src= http //attacker.chosen.url secretmessagesecretmessage -- boundary message contains decrypted content email codice_2 attribute codice_3 tag passed email program url web server codice_4 controlled attacker content requested attacker retrieve content encrypted message web server logs variant attack attacker uses vulnerability cbc s/mime cfb openpgp operating modes encryption algorithms used allows change ciphertext inserting gadgets side effect manipulation originally contained plain text becomes illegible known attacker correct inserting additional gadgets attacker hide unknown plain text inserting certain html tags result message similar structure described since vulnerability directed content email recipient necessary recipients implement countermeasures include extent even senders encrypted content reduce vulnerability e.g electronic signatures limitation subset mime formats yet conclusively clarified announcing security vulnerability 13 may 2018 electronic frontier foundation eff recommended stop using pgp plugins email programs even though vulnerability directly relate pgp configuration email program coordinated publication originally scheduled 15 may eff criticized ignoring various parties consequence robert hansen recommended establish closed group mailing list better coordinate publication future security issues still saw eff director danny o'brien best entity administer openpgp disclosure group", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 376, + 414, + 418, + 509, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1339, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 326, + "label": 6, + "text": "NTFS:ntfs ntfs new technology file system proprietary journaling file system developed microsoft starting windows nt 3.1 default file system windows nt family ntfs several technical improvements file systems superseded \u2013 file allocation table fat high performance file system hpfs \u2013 improved support metadata advanced data structures improve performance reliability disk space use additional extensions elaborate security system based access control lists acls file system journaling ntfs supported desktop server operating systems well linux bsd free open-source ntfs driver called ntfs-3g read write functionality macos comes read-only support ntfs disabled-by-default write support ntfs unstable mid-1980s microsoft ibm formed joint project create next generation graphical operating system result os/2 hpfs microsoft disagreed ibm many important issues eventually separated os/2 remained ibm project microsoft worked develop windows nt ntfs hpfs file system os/2 contained several important new features microsoft created new operating system borrowed many concepts ntfs original ntfs developers tom miller gary kimura brian andrew david goebel probably result common ancestry hpfs ntfs use disk partition identification type code 07 using partition id record number highly unusual since dozens unused code numbers available major file systems codes example fat nine one fat12 fat16 fat32 etc. algorithms identifying file system partition type 07 must perform additional checks distinguish hpfs ntfs microsoft released five versions ntfs version number e.g v5.0 windows 2000 based operating system version confused ntfs version number v3.1 since windows xp although subsequent versions windows added new file system-related features change ntfs example windows vista implemented ntfs symbolic links transactional ntfs partition shrinking self-healing ntfs symbolic links new feature file system others new operating system features make use ntfs features already place ntfs v3.0 includes several new features predecessors sparse file support disk use quotas reparse points distributed link tracking file-level encryption called encrypting file system efs ntfs optimized 4 kb clusters supports maximum cluster size 2mb earlier implementations support 64kb maximum ntfs volume size specification support clusters implementations achieve theoretical maximum discussed maximum ntfs volume size implemented windows xp professional clusters partly due partition table limitations example using 64kb clusters maximum size windows xp ntfs volume 256tb minus 64kb using default cluster size 4kb maximum ntfs volume size 16tb minus 4kb vastly higher 128gb limit windows xp sp1 partition tables master boot record mbr disks support partition sizes 2tb multiple guid partition table gpt dynamic volumes must combined create single ntfs volume larger 2tb booting gpt volume windows environment microsoft supported way requires system unified extensible firmware interface uefi 64-bit support ntfs maximum theoretical limit size individual files 16eib minus 1kb totals 18,446,744,073,709,550,592 bytes windows 10 version 1709 windows server 2019 maximum implemented file size 8pb minus 2mb 9,007,199,252,643,840 bytes ntfs journaling file system uses ntfs log logfile record metadata changes volume feature fat provide critical ntfs ensure complex internal data structures remain consistent case system crashes data moves performed defragmentation api allow easy rollback uncommitted changes critical data structures volume remounted notably affected structures volume allocation bitmap modifications mft records moves variable-length attributes stored mft records attribute lists indices directories security descriptors usn journal update sequence number journal system management feature records extend\\ usnjrnl changes files streams directories volume well various attributes security settings journal made available applications track changes volume journal enabled disabled non-system volumes hard link feature allows different file names directly refer file contents hard links similar directory junctions refer files instead hard links may link files volume volume mft hard links file metadata change file size attributes one hard link may update others opened hard links originally included support posix subsystem windows nt windows uses hard links support short 8.3 filenames ntfs operating system support needed legacy applications work 8.3 filenames case additional filename record directory entry added 8.3 long file name linked updated together unlike regular hard link ntfs file system limit 1024 hard links file alternate data streams allow one data stream associated filename fork using format filename streamname e.g. text.txt extrastream ntfs streams introduced windows nt 3.1 enable services macintosh sfm store resource forks although current versions windows server longer include sfm third-party apple filing protocol afp products grouplogic extremez-ip still use feature file system small ads named zone.identifier added internet explorer recently browsers mark files downloaded external sites possibly unsafe run local shell would require user confirmation opening user indicates longer want confirmation dialog ads deleted alternate streams listed windows explorer size included file size file copied moved another file system without ads support user warned alternate data streams preserved warning typically provided file attached e-mail uploaded website thus using alternate streams critical data may cause problems microsoft provides tool called streams view streams selected volume starting windows powershell 3.0 possible manage ads natively six cmdlets add-content clear-content get-content get-item remove-item set-content malware used alternate data streams hide code result malware scanners special tools check alternate data streams ntfs compress files using lznt1 algorithm variant lz77 files compressed 16 cluster chunks 4 kb clusters files compressed 64 kb chunks compression algorithms ntfs designed support cluster sizes 4 kb cluster size greater 4 kb ntfs volume ntfs compression available compression reduces 64kb data 60kb less ntfs treats unneeded 4kb pages like empty sparse file clusters\u2014they written allows reasonable random-access times os follow chain fragments however large compressible files become highly fragmented since every chunk smaller 64kb becomes fragment according research microsoft ntfs development team 50\u201360gb reasonable maximum size compressed file ntfs volume 4kb default cluster block size reasonable maximum size decreases sharply volumes smaller cluster sizes single-user systems limited hard disk space benefit ntfs compression small files 4kb 64kb depending compressibility files smaller approximately 900 bytes stored within directory entry mft flash memory ssd drives head movement delays hard disk drives fragmentation smaller penalty users fast multi-core processors find improvements application speed compressing applications data well reduction space used note ssds sandforce controllers already compress data however since less data transferred reduction i/os compression works best files repetitive content seldom written usually accessed sequentially compressed log files ideal example system files needed boot time drivers ntldr winload.exe bootmgr compressed system may fail boot correctly decompression filters yet loaded later editions windows allow important system files compressed files may compressed decompressed individually via changing advanced attributes drive directory directory tree becoming default files inside although read\u2013write access compressed files mostly transparent microsoft recommends avoiding compression server systems and/or network shares holding roaming profiles puts considerable load processor sparse files files interspersed empty segments actual storage space used applications file looks like ordinary file empty regions seen regions filled zeros sparse file necessarily include sparse zeros areas sparse file attribute means file allowed database applications instance may use sparse files compressed files actual sizes sparse files taken account determining quota limits volume shadow copy service vss keeps historical versions files folders ntfs volumes copying old newly overwritten data shadow copy via copy-on-write technique user may later request earlier version recovered also allows data backup programs archive files currently use file system heavily loaded systems microsoft recommends setting shadow copy volume separate disk windows vista also introduced persistent shadow copies use system restore previous versions features persistent shadow copies however deleted older operating system mounts ntfs volume happens older operating system understand newer format persistent shadow copies windows vista applications use transactional ntfs txf group multiple changes files together single transaction transaction guarantee either changes happen none application outside transaction see changes committed uses similar techniques used volume shadow copies i.e copy-on-write ensure overwritten data safely rolled back clfs log mark transactions still committed committed still fully applied case system crash commit one participants transactional ntfs restrict transactions local ntfs volume also includes transactional data operations locations data stored separate volumes local registry sql databases current states system services remote services transactions coordinated network-wide participants using specific service dtc ensure participants receive commit state transport changes validated participant others invalidate local caches old data rollback ongoing uncommitted changes transactional ntfs allows example creation network-wide consistent distributed file systems including local live offline caches microsoft advises using txf microsoft strongly recommends developers utilize alternative means since txf may available future versions microsoft windows ntfs file folder assigned security descriptor defines owner contains two access control lists acls first acl called discretionary access control list dacl defines exactly type interactions e.g reading writing executing deleting allowed forbidden user groups users example files folder may read executed users modified user holding administrative privileges windows vista adds mandatory access control info dacls dacls primary focus user account control windows vista later second acl called system access control list sacl defines interactions file folder audited whether logged activity successful failed example auditing enabled sensitive files company managers get know someone tries delete make copy whether succeeds encrypting file system efs provides strong user-transparent encryption file folder ntfs volume efs works conjunction efs service microsoft cryptoapi efs file system run-time library fsrtl efs works encrypting file bulk symmetric key also known file encryption key fek used takes relatively small amount time encrypt decrypt large amounts data asymmetric key cipher used symmetric key used encrypt file encrypted public key associated user encrypted file encrypted data stored alternate data stream encrypted file decrypt file file system uses private key user decrypt symmetric key stored file header uses symmetric key decrypt file done file system level transparent user also case user losing access key support additional decryption keys built efs system recovery agent still access files needed ntfs-provided encryption ntfs-provided compression mutually exclusive however ntfs used one third-party tool support efs available basic home mediacenter versions windows must activated installation professional ultimate server versions windows using enterprise deployment tools within windows domains disk quotas introduced ntfs v3 allow administrator computer runs version windows supports ntfs set threshold disk space users may use also allows administrators keep track much disk space user using administrator may specify certain level disk space user may use receive warning deny access user hit upper limit space disk quotas take account ntfs transparent file-compression enabled applications query amount free space also see amount free space left user quota applied introduced ntfs v3 ntfs reparse points used associating reparse tag user space attribute file directory microsoft includes several default tags including symbolic links directory junction points volume mount points object manager parses file system name lookup encounters reparse attribute reparse name lookup passing user controlled reparse data every file system filter driver loaded windows filter driver examines reparse data see whether associated reparse point filter driver determines match intercepts file system request performs special functionality starting windows vista microsoft added built-in ability shrink expand partition however ability relocate page file fragments files marked unmovable shrinking volume often require relocating disabling page file index windows search shadow copy used system restore various third-party tools capable resizing ntfs partitions internally ntfs uses b-trees index file system data although complex implement allows faster file look times cases file system journal used guarantee integrity file system metadata individual files content systems using ntfs known improved reliability compared fat file systems ntfs allows sequence 16-bit values name encoding file names stream names index names etc except 0x0000 means utf-16 code units supported file system check whether sequence valid utf-16 allows sequence short values restricted unicode standard win32 namespace utf-16 code units case insensitive whereas posix namespace case sensitive file names limited 255 utf-16 code units certain names reserved volume root directory used files codice_1 codice_2 codice_3 codice_4 codice_5 codice_6 dot codice_7 codice_8 codice_9 codice_10 codice_11 codice_12 dot extend directories others files nt kernel limits full paths 32,767 utf-16 code units additional restrictions code points file names boot partition format roughly based upon earlier fat filesystem fields different locations fields especially sectors per track number heads hidden sectors fields may contain dummy values drives either make sense determinable os first looks 8 bytes 0x30 find cluster number mft multiplies number number sectors per cluster 1 byte found 0x0d value sector offset lba mft described ntfs file directory metafile data\u2014file name creation date access permissions use access control lists size\u2014are stored metadata master file table mft abstract approach allowed easy addition file system features windows nt development\u2014an example addition fields indexing used active directory software also enables fast file search software locate named local files folders included mft quickly without requiring index mft structure supports algorithms minimize disk fragmentation directory entry consists filename file id record number representing file master file table file id also contains reuse count detect stale references strongly resembles w_fid files-11 ntfs structures radically differ two copies mft stored case corruption first record corrupted ntfs reads second record find mft mirror file locations files stored boot sector ntfs contains several files define organize file system respects files structured like user file volume peculiar direct interest file system clients metafiles define files back critical file system data buffer file system changes manage free space allocation satisfy bios expectations track bad allocation units store security disk space usage information content unnamed data stream unless otherwise indicated metafiles treated specially windows handled directly codice_13 driver difficult directly view special purpose-built tools needed windows 7 ntfs driver completely prohibits user access resulting bsod whenever attempt execute metadata file made one tool nfi.exe ntfs file sector information utility freely distributed part microsoft oem support tools example obtain information mft -master file table segment following command used codice_14 another way bypass restriction use 7-zip file manager go low-level ntfs path codice_15 codice_16 resembles drive/partition 3 new folders appear codice_17 codice_18 pseudo-folder 7-zip uses attach files deleted file system view codice_19 another pseudo-folder contains ntfs metadata files trick used removable devices usb flash drives external hard drives sd cards etc inside windows active partition requires offline access namely winre file directory described mft record linear repository stream descriptors also named attributes packed together one mft records containing so-called attributes list extra padding fill fixed 1 kb size every mft record fully describes effective streams associated file attribute attribute type fixed-size integer mapping attribute definition file attrdef optional attribute name example used name alternate data stream value represented sequence bytes ntfs standard data files alternate data streams index data directories stored attributes according attrdef attributes either resident non-resident data attribute contains file data example attribute resident represented flag value stored directly mft record otherwise clusters allocated data cluster location information stored data runs attribute attributes given file may displayed using nfi.exe ntfs file sector information utility freely distributed part microsoft oem support tools windows system calls may handle alternate data streams depending operating system utility remote file system file transfer might silently strip data streams safe way copying moving files use backupread backupwrite system calls allow programs enumerate streams verify whether stream written destination volume knowingly skip unwanted streams optimize storage reduce i/o overhead common case attributes small associated value ntfs prefers place value within attribute size attribute exceed maximum size mft record instead using mft record space list clusters containing data case attribute store data directly store allocation map form data runs pointing actual data stored elsewhere volume value accessed directly within attribute called resident data computer forensics workers amount data fits highly dependent file characteristics 700 800 bytes common single-stream files non-lengthy filenames acls allocation map stored form data runs compressed encoding data run represents contiguous group clusters store attribute value files multi-gb volume entry encoded 5 7 bytes means 1 kb mft record store 100 data runs however attribute_list also size limit dangerous 1 million fragments single file ntfs volume also implies general good idea use ntfs compression file larger 10gb ntfs file system driver sometimes attempt relocate data attributes made non-resident clusters also attempt relocate data stored clusters back attribute inside mft record based priority preferred ordering rules size constraints since resident files directly occupy clusters allocation units possible ntfs volume contain files volume clusters example 74.5gb partition ntfs formats 19,543,064 clusters 4kb subtracting system files 64mb log file 2,442,888-byte bitmap file 25 clusters fixed overhead leaves 19,526,158 clusters free files indices since four mft records per cluster volume theoretically could hold almost 4 \u00d7 19,526,158= 78,104,632 resident files opportunistic file locks oplocks allow clients alter buffering strategy given file stream order increase performance reduce network use oplocks apply given open stream file affect oplocks different stream oplocks used transparently access files background network client may avoid writing information file remote server process accessing data may buffer read-ahead data process writing data windows supports four different types oplocks opportunistic locks enhanced windows 7 windows server 2008 r2 per-client oplock keys windows nt descendants keep internal timestamps utc make appropriate conversions display purposes ntfs timestamps utc historical reasons versions windows support ntfs keep time internally local zone time therefore file systems \u2013 ntfs \u2013 supported current versions windows means files copied moved ntfs non-ntfs partitions os needs convert timestamps fly files moved daylight saving time dst effect files moved standard time effect ambiguities conversions result especially shortly one days local zone time changes users may observe files timestamps incorrect one hour due differences implementation dst different jurisdictions result potential timestamp error 4 hours given 12 months different ntfs versions part fully forward- backward-compatible technical considerations mounting newer ntfs volumes older versions microsoft windows affects dual-booting external portable hard drives example attempting use ntfs partition previous versions a.k.a volume shadow copy operating system support result contents previous versions lost windows command-line utility called convert.exe convert supporting file systems ntfs including hpfs windows nt 3.1 3.5 3.51 fat16 fat32 windows 2000 later windows 10 version 1709 known fall creators update microsoft requires onedrive file structure reside ntfs disk reparse tag every file directory within local onedrive file structure set recursive manner thus making file folder unusable previous version windows ntfs file system driver file system backup utilities updated support unknown whether recursive linking feature ntfs file system undocumented workaround microsoft support onedrive new files on-demand feature mac os x 10.3 later include read-only support ntfs-formatted partitions gpl-licensed ntfs-3g also works mac os x fuse allows reading writing ntfs partitions performance enhanced commercial version called tuxera ntfs mac also available ntfs-3g developers paragon software group sells read-write driver named ntfs mac os x also included models seagate hard drives native ntfs write support discovered mac os x 10.6 later activated default although workarounds exist enable functionality however user reports indicate functionality unstable tends cause kernel panics probably reason write support enabled advertised linux kernel versions 2.2.0 later include ability read ntfs partitions kernel versions 2.6.0 later contain driver written anton altaparmakov university cambridge richard russon supports file read overwrite resize three userspace drivers ntfsmount ntfs-3g captive ntfs 'wrapping driver uses windows driver ntfs.sys exist ntfs support built filesystem userspace fuse linux kernel module tasked bridging userspace kernel code save retrieve data three licensed terms gnu general public license gpl due complexity internal ntfs structures built-in 2.6.14 kernel driver fuse drivers disallow changes volume considered unsafe avoid corruption two proprietary solutions also exist ecomstation freebsd offer read-only ntfs support beta ntfs driver allows write/delete ecomstation generally considered unsafe free third-party tool beos based ntfs-3g allows full ntfs read write ntfs-3g free implementation ntfs initially developed linux also works macos freebsd netbsd openbsd ntfs-3g available ports solaris qnx haiku fuse free-for-personal-use read/write driver ms-dos avira called ntfs4dos ahead software developed ntfsread driver version 1.200 dr-dos 7.0x 2002 2004 part nero burning rom software openbsd offers native read-only ntfs support default i386 amd64 platforms version 4.9 released 1 may 2011", + "neighbors": [ + 22, + 26, + 34, + 38, + 40, + 42, + 55, + 63, + 66, + 79, + 93, + 108, + 134, + 148, + 153, + 222, + 233, + 234, + 262, + 268, + 278, + 293, + 295, + 312, + 326, + 334, + 336, + 344, + 349, + 358, + 365, + 433, + 435, + 438, + 485, + 495, + 521, + 524, + 540, + 553, + 557, + 558, + 570, + 572, + 574, + 575, + 615, + 638, + 647, + 662, + 689, + 705, + 723, + 728, + 743, + 791, + 801, + 860, + 865, + 887, + 892, + 900, + 908, + 912, + 920, + 922, + 942, + 961, + 982, + 989, + 997, + 1025, + 1035, + 1056, + 1064, + 1090, + 1092, + 1097, + 1098, + 1104, + 1109, + 1124, + 1138, + 1151, + 1157, + 1179, + 1201, + 1202, + 1212, + 1234, + 1247, + 1252, + 1261, + 1283, + 1287, + 1304, + 1317, + 1322, + 1328, + 1338, + 1346, + 1363, + 1370, + 1381, + 1401, + 1415, + 1417, + 1445, + 1459, + 1461, + 1506, + 1507, + 1531, + 1533, + 1538, + 1545, + 1547, + 1554, + 1561, + 1565, + 1569, + 1578, + 1589, + 1613, + 1618, + 1620, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 327, + "label": 2, + "text": "Linux_Mark_Institute:linux mark institute linux mark institute lmi fully lmi oregon llc organization administers linux trademark behalf linus torvalds computer software includes linux kernel computer hardware utilizing linux-based software services associated implementation documentation linux-based products linux trademark owned linus torvalds u.s. germany e.u. japan computer operating system software facilitate computer use operation assignment trademark torvalds occurred lawsuit attorney william r. della croce jr. boston registered trademark us september 1995 began 1996 send letters various linux distributors demanding ten percent royalties sales linux products petition della croce practices started early 1997 workgroup solutions yggdrasil linux journal linux international torvalds appealed original trademark assignment fraudulent obtained false pretenses november case settled torvalds owned trademark lmi originally charged nominal sublicensing fee use linux name part trademarks later changed favor offering free perpetual worldwide sublicense lmi headquartered monterey california least 2005 since least 2009 headquartered beaverton oregon", + "neighbors": [ + 134, + 209, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 380, + 400, + 401, + 431, + 571, + 630, + 650, + 664, + 688, + 716, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1197, + 1208, + 1241, + 1252, + 1313, + 1357, + 1360, + 1361, + 1391, + 1456, + 1468, + 1509, + 1524, + 1526, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 328, + "label": 7, + "text": "EVS_Broadcast_Equipment:evs broadcast equipment evs broadcast equipment sa belgian company manufactures live outside broadcast digital video production systems xt3 production video servers enable creation editing exchange playout audio video feeds programming television networks consists primarily broadcasting prerecorded images recently stored tapes linear editing editing tape replaced digital media non-linear editing today digital technology hard disk non-linear definition common alternative clear confirmation migration towards technology years even though still take another 5 6 years hard disk penetration rate increase 30 70 television stations began migrating tapeless interoperable computer platforms beginning late 1990s video recorders rarely used nowadays live productions evs type digital media servers norm live broadcasting evs co-founded 1994 laurent minguet three years later company invested 30 capital private funds roundabout eur 4 million 1998 evs listed first time stock exchange initial eur 14.8 quotation per share comparable levels valued eur 204 million year evs acquired vse hardware subcontractor managed michel counson transaction vse received evs shares approximate eur 4.5 million value since evs become major broadcast actor focusing digital recording technologies live sport tv production evs core products primarily used outbroadcasting vans ob vans allow high-quality respectively slow-motion image replay evs revolutionised professional digital recording first introduce hard disk drive field instead traditional magnetic tape recording business led time sony panasonic establishing outbroadcasting sport production evs started using high value servers address tv studio production full range products 2002 strategic move contributed +40 uplift 2012 additionally evs founded xdc 2004 pioneer high definition cinema broadcasting restructured within dcinex group evs sold stake dcinex 2014 2001 laurent minguet stepped position director three years later gave position side decided leave role ceo director following board directors meeting held september 15 2011 transitional period evs managed board directors 2012 evs appoints joop janssen ceo 10 october 2014 board directors joop janssen mutually agreed end term office duties joop janssen muriel de lathouwer member board directors evs chairing strategy committee appointed president executive committee interim basis 5 january 2015 evs announced acquired scalable video system gmbh svs developing it-based vision mixers dyvi live sa company based brussels distributing products svs name dyvi 19 february 2015 evs broadcast equipment appoints muriel de lathouwer managing director ceo july 17 2018 board directors muriel de lathouwer mutually agreed end term office duties muriel de lathouwer evs headquarters administration production development located li\u00e8ge belgium 4 additional development centers found evs also sales support offices london los angeles new york dubai mexico paris munich madrid brescia beijing hong kong sydney mumbai", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 329, + "label": 4, + "text": "Charles_Proxy:charles proxy charles web debugging proxy cross-platform http debugging proxy server application written java enables user view http https http/2 enabled tcp port traffic accessed via local computer includes requests responses including http headers metadata e.g cookies caching encoding information functionality targeted assisting developers analyze connections messaging charles autoconfigure use following browsers", + "neighbors": [ + 74, + 134, + 160, + 678, + 961, + 1138, + 1337, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 330, + "label": 5, + "text": "Client\u2013server_model:client\u2013server model client\u2013server model distributed application structure partitions tasks workloads providers resource service called servers service requesters called clients often clients servers communicate computer network separate hardware client server may reside system server host runs one server programs share resources clients client share resources requests server content service function clients therefore initiate communication sessions servers await incoming requests examples computer applications use client\u2013server model email network printing world wide web client-server characteristic describes relationship cooperating programs application server component provides function service one many clients initiate requests services servers classified services provide example web server serves web pages file server serves computer files shared resource may server computer software electronic components programs data processors storage devices sharing resources server constitutes service whether computer client server determined nature application requires service functions example single computer run web server file server software time serve different data clients making different kinds requests client software also communicate server software within computer communication servers synchronize data sometimes called inter-server server-to-server communication general service abstraction computer resources client concerned server performs fulfilling request delivering response client understand response based well-known application protocol i.e content formatting data requested service clients servers exchange messages request\u2013response messaging pattern client sends request server returns response exchange messages example inter-process communication communicate computers must common language must follow rules client server know expect language rules communication defined communications protocol client-server protocols operate application layer application layer protocol defines basic patterns dialogue formalize data exchange even server may implement application programming interface api api abstraction layer accessing service restricting communication specific content format facilitates parsing abstracting access facilitates cross-platform data exchange server may receive requests many distinct clients short period time computer perform limited number tasks moment relies scheduling system prioritize incoming requests clients accommodate prevent abuse maximize availability server software may limit availability clients denial service attacks designed exploit server obligation process requests overloading excessive request rates bank customer accesses online banking services web browser client client initiates request bank web server customer login credentials may stored database web server accesses database server client application server interprets returned data applying bank business logic provides output web server finally web server returns result client web browser display step sequence client\u2013server message exchanges computer processes request returns data request-response messaging pattern requests met sequence complete web browser presents data customer example illustrates design pattern applicable client\u2013server model separation concerns early form client\u2013server architecture remote job entry dating least os/360 announced 1964 request run job response output formulating client\u2013server model 1960s 1970s computer scientists building arpanet stanford research institute used terms server-host serving host user-host using-host appear early documents rfc 5 rfc 4 usage continued xerox parc mid-1970s one context researchers used terms design computer network programming language called decode-encode language del purpose language accept commands one computer user-host would return status reports user encoded commands network packets another del-capable computer server-host received packets decoded returned formatted data user-host del program user-host received results present user client\u2013server transaction development del beginning 1969 year united states department defense established arpanet predecessor internet client-host server-host subtly different meanings client server host computer connected network whereas words server client may refer either computer computer program server-host user-host always refer computers host versatile multifunction computer clients servers programs run host client\u2013server model server likely devoted task serving early use word client occurs separating data function distributed file system 1978 paper xerox parc computer scientists howard sturgis james mitchell jay israel authors careful define term readers explain use distinguish user user network node client 1992 word server entered general parlance client\u2013server model dictate server-hosts must resources client-hosts rather enables general-purpose computer extend capabilities using shared resources hosts centralized computing however specifically allocates large amount resources small number computers computation offloaded client-hosts central computers simpler client-hosts relies heavily network resources servers infrastructure computation storage diskless node loads even operating system network computer terminal operating system input/output interface server contrast fat client personal computer many resources rely server essential functions microcomputers decreased price increased power 1980s late 1990s many organizations transitioned computation centralized servers mainframes minicomputers fat clients afforded greater individualized dominion computer resources complicated information technology management 2000s web applications matured enough rival application software developed specific microarchitecture maturation affordable mass storage advent service-oriented architecture among factors gave rise cloud computing trend 2010s addition client\u2013server model distributed computing applications often use peer-to-peer p2p application architecture client\u2013server model server often designed operate centralized system serves many clients computing power memory storage requirements server must scaled appropriately expected work-load i.e number clients connecting simultaneously load-balancing failover systems often employed scale server implementation peer-to-peer network two computers peers pool resources communicate decentralized system peers coequal equipotent nodes non-hierarchical network unlike clients client\u2013server client\u2013queue\u2013client network peers communicate directly peer-to-peer networking algorithm peer-to-peer communications protocol balances load even peers modest resources help share load node becomes unavailable shared resources remain available long peers offer ideally peer need achieve high availability redundant peers make resource downtime availability load capacity peers change protocol reroutes requests client-server master-slave regarded sub-categories distributed peer-to-peer systems", + "neighbors": [ + 14, + 365, + 412, + 425, + 429, + 444, + 522, + 611, + 646, + 763, + 766, + 770, + 796, + 804, + 1074, + 1102, + 1138, + 1200, + 1216, + 1337, + 1443, + 1444, + 1452, + 1470, + 1553 + ], + "mask": "Test" + }, + { + "node_id": 331, + "label": 3, + "text": "RISC-V:risc-v risc-v pronounced risk-five open-source hardware instruction set architecture isa based established reduced instruction set computer risc principles project began 2010 university california berkeley many contributors volunteers affiliated university june 2019 version 2.2 user-space isa version 1.11 privileged isa frozen permitting software hardware development proceed debug specification available draft version 0.3 usable new isas usually expensive computer-designers normally afford work free also developing cpu requires design expertise several specialties electronic digital logic compilers operating systems rare find team outside professional engineering organization team normally paid money charged designs therefore commercial vendors computer designs arm holdings mips technologies charge royalties use designs patents copyrights also often require non-disclosure agreements releasing documents describe designs detailed advantages instruction set many cases never describe reasons design choices expense secrecy make development new hardware software much difficult also prevents security audits another result modern high-quality general-purpose computer instruction sets explained available except academic settings risc-v started solve problems goal make practical isa open-sourced usable academically hardware software design without royalties also rationales every part project explained least broadly risc-v authors academic substantial experience computer design risc-v isa direct development series academic computer-design projects originated part aid projects address cost design project started academic research funded darpa order build large continuing community users therefore accumulate designs software risc-v isa designers planned support wide variety practical uses small fast low-power real-world implementations without over-architecting particular microarchitecture need large base contributors part reason risc-v engineered fit many uses therefore many risc-v contributors see project unified community effort term risc dates 1980 knowledge simpler computers could effective design principles widely described simple effective computers always academic interest academics created risc instruction set dlx first edition computer architecture quantitative approach 1990 david patterson author later assisted risc-v. dlx intended educational use academics hobbyists implemented using field-programmable gate arrays commercial success arm cpus versions 2 earlier public-domain instruction set still supported gnu compiler collection gcc popular free-software compiler three open-source cores exist isa manufactured openrisc open-source isa based dlx associated risc designs fully supported gcc linux implementations however commercial implementations krste asanovi\u0107 university california berkeley found many uses open-source computer system 2010 decided develop publish one short three-month project summer plan help academic industrial users david patterson berkeley also aided effort originally identified properties berkeley risc risc-v one long series cooperative risc research projects stage students inexpensively provided initial software simulations cpu designs risc-v authors institution originally provided isa documents several cpu designs bsd licenses allow derivative works\u2014such risc-v chip designs\u2014to either open free closed proprietary early funding darpa commercial users require isa stable utilize product might last many years address issue risc-v foundation formed maintain publish intellectual property related risc-v definition original authors owners surrendered rights foundation designers say instruction set main interface computer lies hardware software good instruction set open available use dramatically reduce cost software permitting far reuse also increase competition among hardware providers use resources design less software support designers assert new principles becoming rare instruction set design successful designs last forty years become increasingly similar failed sponsoring companies failed commercially instruction sets poor technically well-designed open instruction set designed using well-established principles attract long-term support many vendors prior open isas used gnu general public license gpl encouraging users open implementations copying use others unlike academic designs optimized simplicity exposition designers state risc-v instruction set practical computers said features increase computer speed yet reduce cost power use include load\u2013store architecture bit patterns simplify multiplexers cpu simplified standards-based floating-point design architecturally neutral placing most-significant bits fixed location speed sign-extension sign extension said often critical timing path instruction set designed wide range uses supports three word-widths 32 64 128 bits variety subsets definitions subset vary slightly three word-widths subsets support small embedded systems personal computers supercomputers vector processors warehouse-scale rack-mounted parallel computers instruction set variable-width extensible encoding bits always added space 128-bit stretched version isa reserved 60 years industry experience shown unrecoverable error instruction set design lack memory address space 128-bit isa remains undefined intentionally yet little practical experience large memory systems proposals implement variable-width instructions 864-bits risc-v also supports designers academic uses simplicity integer subset permits basic student exercises integer subset simple isa enabling software control research machines variable-length isa enables extensions student exercises research separated privileged instruction set permits research operating system support without redesigning compilers risc-v open intellectual property allows designs published reused modified normal problem new instruction set lack cpu designs software issues limit usability reduce adoption risc-v website specification user-mode instructions preliminary specification general-purpose privileged instruction set support operating systems several open-sourced risc-v cpu designs including 64-bit berkeley order machine boom 64-bit rocket five 32-bit sodor cpu designs berkeley picorv32 clifford wolf scr1 syntacore pulpino riscy zero-riscy eth z\u00fcrich university bologna others three-stage sodor cpu appears apt small embedded cpu rocket may suit compact low-power intermediate computers personal devices boom uses much infrastructure created rocket may usable personal supercomputer warehouse-scale computers picorv scr1 32-bit microcontroller unit mcu class rv32imc implementations verilog cores pulpino implement simple rv32imc isa micro-controllers zero-riscy powerful rv32imfc isa custom dsp extensions embedded signal processing design software includes design compiler chisel reduce designs verilog use devices website includes verification data testing core implementations available risc-v software tools include gnu compiler collection gcc toolchain gdb debugger llvm toolchain ovpsim simulator library risc-v fast processor models spike simulator simulator qemu operating system support exists linux kernel freebsd netbsd supervisor-mode instructions unstandardized prior june 2019 support provisional preliminary freebsd port risc-v architecture upstreamed february 2016 shipped freebsd 11.0 ports debian fedora stabilizing port das u-boot exists uefi spec v2.7 defined risc-v binding tianocore port done hpe engineers expected upstreamed preliminary port sel4 microkernel simulator exists run risc-v linux system web browser using javascript hex five released first secure iot stack risc-v freertos support also see comparison real-time operating systems risc-v modular design consisting alternative base parts added optional extensions isa base extensions developed collective effort industry research community educational institutions base specifies instructions encoding control flow registers sizes memory addressing logic i.e. integer manipulation ancillaries base alone implement simplified general-purpose computer full software support including general-purpose compiler standard extensions specified work standard bases without conflict many risc-v computers might implement compact extension reduce power consumption code size memory use also future plans support hypervisors virtualization together supervisor instruction set extension rvgc defines instructions needed conveniently support operating system unix-style portable operating system interface posix tame combinations functionality may implemented nomenclature defined specify instruction set base specified first coding risc-v register bit-width variant e.g. rv64i rv32e follows letters specifying implemented extensions canonical order base extended integer floating point calculations synchronisation primitives multi-core computing base extensions mafd considered necessary general-purpose computation thus shorthand g. small 32-bit computer embedded system might rv32ec large 64-bit computer might rv64gc i.e. shorthand rv64imafdc naming scheme zxxx standard extensions yxxx non-standard vendor-specific extensions proposed example ztso extension total store ordering alternative memory consistency model weak memory ordering discussion risc-v 32 16 embedded variant integer registers floating-point extension implemented 32 floating-point registers except memory access instructions instructions address registers first integer register zero register remainder general-purpose registers store zero register effect read always provides 0 using zero register placeholder makes simpler instruction set control status registers exist user-mode programs access used performance measurement floating-point management instructions exist save restore multiple registers thought needless complex perhaps slow like many risc designs risc-v load\u2013store architecture instructions address registers load store instructions conveying memory load store instructions include 12-bit offset two register identifiers one register base register register source write destination read offset added base register get address forming address base register plus offset allows single instructions access data structures example base register points top stack single instructions access subroutine local variables stack likewise load store instructions access record-style structure memory-mapped i/o device using constant zero register base address allows single instructions access memory around address zero memory addressed 8-bit bytes words little-endian order words register size accessed load store instructions accessed memory addresses need aligned word-width accesses aligned addresses may faster example simple cpus may implement unaligned accesses slow software emulation driven alignment failure interrupt risc-v manages memory systems shared cpus threads ensuring thread execution always sees memory operations programmed order threads i/o devices risc-v simplified n't guarantee order memory operations except specific instructions instruction guarantees results predecessor operations visible successor operations threads i/o devices guarantee order combinations memory memory-mapped i/o operations e.g separate memory read write operations without affecting i/o operations system operate i/o devices parallel memory n't force wait one cpu one thread may decode like many risc instruction sets complex instruction set computer cisc instruction sets x86 ibm system/360 families risc-v lacks address-modes write back registers example auto-increment risc-v little-endian resemble familiar successful computers example x86 also reduces cpu complexity costs slightly reads sizes words order example risc-v instruction set decodes starting lowest-addressed byte instruction specification leaves open possibility non-standard big-endian bi-endian systems risc cpus mips powerpc dlx berkeley risc-i place 16 bits offset loads stores set upper 16 bits load upper word instruction permits upper-halfword values set easily without shifting bits however use upper half-word instruction makes 32-bit constants like addresses risc-v uses sparc-like combination 12-bit offsets 20-bit set upper instructions smaller 12-bit offset helps compact 32-bit load store instructions select two 32 registers yet still enough bits support risc-v variable-length instruction coding risc-v handles 32-bit constants addresses instructions set upper 20 bits 32-bit register load upper immediate loads 20 bits bits 31 12 second instruction set bottom 12 bits method extended permit position-independent code adding instruction generates 20 upper address bits adding offset program counter storing result base register permits program generate 32-bit addresses relative program counter base register often used as-is 12-bit offsets loads stores needed set lower 12-bits register 64-bit 128-bit isas sign-extend result get larger address fast cpus may interpret combinations instructions single fused instructions may good candidates fuse loads stores risc-v subroutine call jump link places return address register faster many computer designs saves memory access compared systems push return address directly stack memory 20-bit signed 2 complement offset offset multiplied 2 added pc generate relative address 32-bit instruction result 32-bit address i.e. evenly divisible 4 cpu may force exception risc-v cpus jump calculated addresses using jump link-register instruction similar gets destination address adding 12-bit offset base register contrast adds larger 20-bit offset pc bit format like register-relative loads stores like used instructions set upper 20 bits base register make 32-bit branches either absolute address using pc-relative one using position-independent code using constant zero base address allows single-instruction calls small offset fixed positive negative address risc-v recycles get unconditional 20-bit pc-relative jumps unconditional register-based 12-bit jumps jumps make linkage register 0 return address saved risc-v also recycles return subroutine base register set linkage register saved offset zero linkage register zero offset return address saved like many risc designs subroutine call risc-v compiler must use individual instructions save registers stack start restore stack exit risc-v save multiple restore multiple register instructions thought make cpu complex possibly slow take code space designers planned reduce code size library routines save restore registers risc-v condition code register carry bit designers believed condition codes make fast cpus complex forcing interactions instructions different stages execution choice makes multiple-precision arithmetic complex also numerical tasks need energy instead risc-v short branches perform comparisons equal not-equal less-than unsigned less-than greater-than equal unsigned greater-than equal ten comparison-branch operations implemented six instructions reversing order operands assembler example branch greater done less-than reversed order operands comparing branches twelve-bit signed range jump relative pc risc-v isa requires default branch predictions cpus backward conditional branches predicted taken forward conditional branches predict taken predictions easy decode pipelined cpu branch addresses signed numbers added pc backward branches negative two complement addresses thus one significant bit address forward branches zero significant bit fixed location operation code speed pipeline complex cpus add branch predictors work well even unusual data situations isa manual recommends software optimized avoid branch stalls using default branch predictions reuses significant bit signed relative address hint bit tell whether conditional branch taken hint bits needed operation codes risc-v branches makes bits available branch operation codes simple inexpensive cpus merely follow default predictions still perform well optimizing compilers compilers still perform statistical path optimization desired avoid needless loading branch prediction electronics thus needless pipeline stalls comparing branch codes never used unconditional jumps risc-v support predication conditional execution instructions designers claim cpus without predication easier design optimizing compilers less likely mistakenly use predication used designers claim fast out-of-order cpu designs predication anyway comparison branch conditional code parallel discarding unused path effects also claim even simpler cpus predication less valuable branch prediction prevent stalls associated conditional branches code without predication larger branches also claim compressed instruction set risc-v set c solves problem cases many risc designs included branch delay slot position branch instruction filled instruction executed whether branch taken feature improve performance pipelined cpus absorbing time wasted cpu mispredicts operation conditional branch cpu pipeline stalls risc-v omits branch delay slot complicates multicycle cpus superscalar cpus long pipelines dynamic branch predictors succeeded well enough reduce need delayed branches risc-v segregates math minimal set integer instructions set add subtract shift bit-wise logic comparing-branches simulate risc-v instruction sets software atomic instructions notable exception risc-v currently lacks count leading zero bit-field operations normally used speed software floating-point pure-integer processor integer multiplication instructions set includes signed unsigned multiply divide double-precision integer multiplies divides included multiplies divides produce high word result isa document recommends implementors cpus compilers fuse standardized sequence high low multiply divide instructions one operation possible floating-point instructions set f includes single-precision arithmetic also comparison-branches similar integer arithmetic requires additional set 32 floating-point registers separate integer registers double-precision floating point instructions set generally assume floating-point registers 64-bit i.e. double-width f subset coordinated set quad-precision 128-bit floating-point isa q also defined risc-v computers without floating-point use floating-point software library risc-v cause exceptions arithmetic errors including overflow underflow subnormal divide zero instead integer floating-point arithmetic produce reasonable default values set status bits divide-by-zero discovered one branch division status bits tested operating system periodic interrupt risc-v supports computers share memory multiple cpus threads risc-v standard memory consistency model release consistency loads stores may generally reordered loads may designated acquire operations must precede later memory accesses stores may designated release operations must follow earlier memory accesses base instruction set includes minimal support form instruction enforce memory ordering although sufficient provides acquire provides release combined operations efficient atomic memory operation extension supports two types atomic memory operations release consistency first provides general purpose load-reserved store-conditional instructions performs load tries reserve address thread later store-conditional reserved address performed reservation broken intervening store another source store succeeds zero placed register failed non-zero value indicates software needs retry operation either case reservation released second group atomic instructions perform read-modify-write sequences load optionally load-acquire destination register operation loaded value source register store result may optionally store-release making memory barriers optional permits combining operations optional operations enabled acquire release bits present every atomic instruction risc-v defines nine possible operations swap use source register value directly add bitwise exclusive-or signed unsigned minimum maximum system design may optimize combined operations example destination register swap constant zero load may skipped value stored unmodified since load store may skipped ibm system/370 successors including z/architecture x86 implement compare-and-swap instruction tests conditionally updates location memory location contains expected old value replaces given new value returns indication whether made change however simple load-type instruction usually performed fetch old value classic problem thread reads loads value calculates new value c uses replace c way know whether concurrent activity another thread replaced value b restored algorithms e.g. ones values memory pointers dynamically allocated blocks aba problem lead incorrect results common solution employs double-wide instruction update pointer adjacent counter unfortunately instruction requires special instruction format specify multiple registers performs several reads writes complex bus operation alternative efficient usually requires one memory load minimizing slow memory operations desirable also exact controls accesses memory cell rather assuring bit pattern however unlike permit livelock two threads repeatedly cause instructions fail risc-v guarantees forward progress livelock code follows rules timing sequence instructions 1 must use subset 2 prevent repetitive cache misses code including retry loop must occupy 16 consecutive instructions 3 must include system fence instructions taken backward branches 4 backward branch retry loop must original sequence specification gives examples use subset lock data structure standard risc-v isa specifies instructions 32 bits makes particularly simple implementation like risc processors instruction encoding results larger code size instruction sets compensate risc-v 32-bit instructions actually 30 bits opcode space reserved optional recommended variable-length compressed instruction set rvc includes 16-bit instructions like arm thumb mips16 compressed instructions simply aliases subset larger instructions unlike arm thumb mips compressed set space reserved beginning separate operating mode standard compressed instructions may intermixed freely letter c like thumb-1 mips16 compressed instructions simply alternate encodings aliases selected subset larger instructions compression implemented assembler essential compiler even know prototype rvc tested 2011 prototype code 20 smaller x86 pc mips compressed code 2 larger arm thumb-2 code also substantially reduced needed cache memory estimated power use memory system researcher intended reduce code binary size small computers especially embedded computer systems prototype included 33 frequently used instructions recoded compact 16-bit formats using operation codes previously reserved compressed set compression done assembler changes compiler compressed instructions omitted fields often zero used small immediate values accessed subsets 16 8 registers common often compressible much difference size compared arm thumb set occurred risc-v prototype instructions save restore multiple registers instead compiler generated conventional instructions access stack prototype rvc assembler often converted compressed forms half size however still took code space arm instructions save restore multiple registers researcher proposed modify compiler call library routines save restore registers routines would tend remain code cache thus run fast though probably fast save-multiple instruction standard rvc requires occasional use 32-bit instructions several nonstandard rvc proposals complete requiring 32-bit instructions said higher densities standard rvc another proposal builds claims use less coding range well instruction set smallest embedded cpus set e reduced ways 16 32-bit integer registers supported floating-point instructions supported specification forbids uneconomical floating-point software library must used compressed set c recommended privileged instruction set supports machine mode user mode memory schemes use base-and-bound address relocation discussion occurred microcontroller profile risc-v ease development deeply embedded systems centers faster simple c-language support interrupts simplified security modes simplified posix application binary interface correspondents also proposed smaller non-standard 16-bit rv16e isas several serious proposal would use 16-bit c instructions 8 \u00d7 16-bit registers april fools joke proposed practical arrangement utilize 16 \u00d7 16-bit integer registers standard eimc isas including 32-bit instructions joke propose bank-switching registers 32-bit cpu would clearly superior risc-v isa includes separate privileged instruction set specification version 1.11 ratified foundation version 1.11 specification supports several types computer systems correspond roughly systems four rings privilege security machine hypervisor supervisor user layer also expected thin layer standardized supporting software communicates more-privileged layer hardware overall plan isa make hypervisor mode orthogonal user supervisor modes basic feature configuration bit either permits supervisor-level code access hypervisor registers causes interrupt accesses bit lets supervisor mode directly handle hardware needed hypervisor simplifies type 2 hypervisor hosted operating system popular mode run warehouse-scale computers support type 1 unhosted hypervisors bit cause accesses interrupt hypervisor bit simplifies nesting hypervisors hypervisor runs hypervisor also said simplify supervisor code letting kernel use hypervisor features kernel code result hypervisor form isa supports five modes machine supervisor user supervisor-under-hypervisor user-under-hypervisor privileged instruction set specification explicitly defines hardware threads harts multiple hardware threads common practice more-capable computers one thread stalled waiting memory others often proceed hardware threads help make better use large number registers execution units fast out-of-order cpus finally hardware threads simple powerful way handle interrupts saving restoring registers required simply executing different hardware thread however hardware thread required risc-v computer thread zero existing control status register definitions support risc-v error memory exceptions small number interrupts systems interrupts specification also defines interrupt controller interrupts always start highest-privileged machine level control registers level explicit forwarding bits route interrupts less-privileged code example hypervisor need include software executes interrupt forward interrupt operating system instead set-up set bits forward interrupt several memory systems supported specification physical-only suited simplest embedded systems also three unix-style virtual memory systems memory cached mass-storage systems virtual memory systems three sizes addresses sized 32 39 48-bits virtual memory systems support 4 kib pages multilevel page-table trees use similar algorithms walk page table trees designed either hardware software page-table walking optionally reduce cost page table walks super-sized pages may leaf pages higher levels system page table tree sv32 two layer page table tree supports 4 mib superpages sv39 three level page table supports 2 mib superpages 1 gib gigapages sv48 required support sv39 also 4-level page table supports 2 mib superpages 1 gib gigapages 512 gib terapages superpages aligned page boundaries next-lowest size page substantial work done produce preliminary though unapproved bit-manipulation b isa risc-v done well bit-manipulation subset aid cryptographic graphic mathematical operations criteria inclusion documented draft compliance rv5 philosophies isa formats substantial improvements code density speed i.e. least 3-for-1 reduction instructions substantial real-world applications including preexisting compiler support version 0.37 included uncontroversial instructions count leading zeros count one bits perform complement shift ones rotate generalized bit-reverse shuffle byte swaps bit extracts deposits bit-manipulation additions compressed set also includes controversial proposal bit-field extract place using nonstandard 48-bit instruction format simple cost-reduced risc-v systems proposal use floating-point registers bits perform parallel single instruction multiple data simd sub-word arithmetic widely used accelerate multimedia digital signal processing isa undefined could resemble pa-risc multimedia instructions multimedia acceleration extensions besides native 64-bit math pa-risc max2 cpu could arithmetic four 16-bit subwords several overflow methods also could move subwords different positions pa-risc max2 intentionally simplified lacked support 8-bit 32-bit subwords 16-bit subword size chosen support digital signal processing tasks instructions inexpensive design build however increased cpu performance digital signal processing tasks 48-fold enabling practical real-time video codecs 1995 proposed vector-processing instruction set may make packed simd set obsolete designers hope enough flexibility cpu implement vector instructions standard processor registers would enable minimal implementations similar performance multimedia isa however true vector coprocessor could execute code higher performance vector-processing proposal conservative flexible design general-purpose mixed-precision vector processor suitable execute compute kernels code would port easily cpus differing vector lengths ideally without recompiling contrast short-vector simd extensions less convenient used x86 arm pa-risc change word-width forces change instruction set expand vector registers case x86 64-bit mmx registers 128-bit streaming simd extensions sse 256-bit advanced vector extensions avx avx-512 result growing instruction set need port working code new instructions risc-v vector isa rather fix vector length architecture instruction available takes requested size sets vector length minimum hardware limit requested size risc-v proposal like cray long-vector design vector 32 vectors length application specifies total vector width requires processor determines vector length provide available on-chip resources takes form instruction four immediate operands specifying number vector registers available width needed total must addressable limit 32 may less application require vector length limited available on-chip storage divided number bytes storage needed entry added hardware limits may also exist turn may permit simd-style implementations outside vector loops application request zero-vector registers saving operating system work preserving context switches vector length architecturally variable designed vary run time also achieve flexibility instruction set likely use variable-width data paths variable-type operations using polymorphic overloading plan reduce size complexity isa compiler recent experimental vector processors variable-width data paths also show profitable increases operations per second speed area lower cost watt longer battery life unlike typical modern graphics processing unit plans provide special hardware support branch predication instead lower cost compiler-based predication used preliminary specification risc-v hardware-assisted debugger debugger use transport system joint test action group jtag universal serial bus usb access debug registers standard hardware debug interface may support either standardized abstract interface instruction feeding exact form abstract interface remains undefined proposals include memory mapped system standardized addresses registers debug devices command register data register accessible communication system correspondents claim similar systems used freescale background debug mode interface bdm cpus arm openrisc aeroflex leon instruction feeding cpu process debug exception execute individual instructions written register may supplemented data-passing register module directly access memory instruction feeding lets debugger access computer exactly software would also minimizes changes cpu adapts many types cpu said especially apt risc-v designed explicitly many types computers data-passing register allows debugger write data-movement loop ram execute loop move data computer speed near maximum speed debug system data channel correspondents say similar systems used mips technologies mips intel quark tensilica xtensa freescale power isa cpus background debug mode interface bdm", + "neighbors": [ + 53, + 61, + 76, + 78, + 85, + 105, + 123, + 127, + 134, + 137, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 292, + 314, + 335, + 388, + 445, + 457, + 460, + 508, + 509, + 529, + 544, + 571, + 589, + 643, + 659, + 681, + 719, + 752, + 754, + 776, + 803, + 805, + 821, + 846, + 893, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1022, + 1052, + 1081, + 1111, + 1113, + 1120, + 1125, + 1138, + 1143, + 1160, + 1161, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1318, + 1398, + 1469, + 1503, + 1505, + 1507, + 1518, + 1525, + 1538, + 1557, + 1572, + 1578, + 1582, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 332, + "label": 9, + "text": "Bigloo:bigloo bigloo programming language dialect language lisp implementation language scheme developed french research institute french institute research computer science automation inria oriented toward providing tools effective diverse code generation match performance hand-written c c++ bigloo system contains scheme compiler generate c code java virtual machine jvm .net framework .net bytecode lisp dialects contains interpreter also termed read-eval-print loop repl free open-source software run-time system libraries released gnu lesser general public license lgpl compiler programming tools released gnu general public license gpl bigloo scheme implementation devoted one goal enabling scheme based programming style c ++ usually required hop web application engine roadsend php written bigloo bigloo-lib project contains modules", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 306, + 308, + 313, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 457, + 488, + 501, + 506, + 521, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 782, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 333, + "label": 4, + "text": "OpenVPN:openvpn openvpn open-source commercial software implements virtual private network vpn techniques create secure point-to-point site-to-site connections routed bridged configurations remote access facilities uses custom security protocol utilizes ssl/tls key exchange capable traversing network address translators nats firewalls written james yonan published gnu general public license gpl openvpn allows peers authenticate using pre-shared secret keys certificates username/password used multiclient-server configuration allows server release authentication certificate every client using signatures certificate authority uses openssl encryption library extensively well tls protocol contains many security control features openvpn ported embedded several systems example dd-wrt openvpn server function softether vpn multi-protocol vpn server implementation openvpn protocol openvpn uses openssl library provide encryption data control channels lets openssl encryption authentication work allowing openvpn use ciphers available openssl package also use hmac packet authentication feature add additional layer security connection referred hmac firewall creator also use hardware acceleration get better encryption performance support mbed tls available starting version 2.3 openvpn several ways authenticate peers openvpn offers pre-shared keys certificate-based username/password-based authentication preshared secret key easiest certificate-based robust feature-rich version 2.0 username/password authentications enabled without certificates however make use username/password authentications openvpn depends third-party modules openvpn run user datagram protocol udp transmission control protocol tcp transports multiplexing created ssl tunnels single tcp/udp port rfc 3948 udp 2.3.x series openvpn fully supports ipv6 protocol virtual network inside tunnel openvpn applications also establish connections via ipv6 ability work proxy servers including http good working network address translation nat getting firewalls server configuration ability push certain network configuration options clients include ip addresses routing commands connection options openvpn offers two types interfaces networking via universal tun/tap driver create either based ip tunnel tun based ethernet tap carry type ethernet traffic openvpn optionally use lzo compression library compress data stream port 1194 official iana assigned port number openvpn newer versions program default port feature 2.0 version allows one process manage several simultaneous tunnels opposed original one tunnel per process restriction 1.x series openvpn use common network protocols tcp udp makes desirable alternative ipsec situations isp may block specific vpn protocols order force users subscribe higher-priced business grade service tier openvpn uses transmission control protocol tcp transports establish tunnel performance acceptable long sufficient excess bandwidth un-tunneled network link guarantee tunneled tcp timers expire becomes untrue performance falls dramatically known tcp meltdown problem openvpn offers various internal security features 256-bit encryption openssl library although service providers may offer lower rates effectively providing fastest vpn available consumers runs userspace instead requiring ip stack therefore kernel operation openvpn ability drop root privileges use mlockall prevent swapping sensitive data disk enter chroot jail initialization apply selinux context initialization openvpn runs custom security protocol based ssl tls rather support ike ipsec l2tp pptp openvpn offers support smart cards via pkcs 11-based cryptographic tokens openvpn extended third-party plug-ins scripts called defined entry points purpose often extend openvpn advanced logging enhanced authentication username passwords dynamic firewall updates radius integration plug-ins dynamically loadable modules usually written c scripts interface execute scripts binaries available openvpn openvpn source code examples plug-ins including pam authentication plug-in several third-party plug-ins also exist authenticate ldap sql databases sqlite mysql available solaris linux openbsd freebsd netbsd qnx macos windows xp later openvpn available mobile phone operating systems os including maemo windows mobile 6.5 ios 3gs+ devices jailbroken ios 3.1.2+ devices android 4.0+ devices android devices cyanogenmod aftermarket firmware flashed correct kernel module installed compatible mobile phone oses including palm os web-based vpn shown web page citrix terminal services web access program installed independently configured editing text files manually rather gui-based wizard openvpn compatible vpn clients use ipsec l2tp pptp protocols entire package consists one binary client server connections optional configuration file one key files depending authentication method used openvpn integrated several router firmware packages allowing users run openvpn client server mode network routers router running openvpn client mode example allows device network access vpn without needing capability install openvpn notable firmware packages openvpn integration include openvpn implemented manufacturer router firmware d-link dsr-250 mikrotik routers mikrotik implementation support udp protocol lzo compression limits transfer speeds attainable mikrotik said 2010 would continue developing openvpn favor secure socket tunneling protocol sstp openvpn integrated softether vpn open-source multi-protocol vpn server allow users connect vpn server existing openvpn clients openvpn also integrated vyos open-source routing os forked vyatta software router openvpn available two versions", + "neighbors": [ + 88, + 134, + 217, + 260, + 276, + 306, + 357, + 412, + 528, + 542, + 545, + 646, + 762, + 782, + 813, + 955, + 1003, + 1114, + 1386, + 1415, + 1462, + 1538, + 1552, + 1582, + 1586 + ], + "mask": "Test" + }, + { + "node_id": 334, + "label": 6, + "text": "Aufs:aufs aufs short advanced multi-layered unification filesystem implements union mount linux file systems name originally stood anotherunionfs version 2 developed junjiro okajima 2006 aufs complete rewrite earlier unionfs aimed improve reliability performance also introduced new concepts like writable branch balancing improvements \u2013 implemented unionfs 2.x branch aufs rejected merging mainline linux code criticized dense unreadable uncommented instead overlayfs merged linux kernel several attempts merge aufs mainline kernel author given aufs included debian jessie ubuntu 16.04 box debian stretch include aufs anymore provides package aufs-dkms auto-compiles aufs kernel module using dell dkms docker originally used aufs container filesystem layers still available one supported storage backends several linux distributions chosen aufs replacement unionfs including", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 171, + 211, + 222, + 233, + 278, + 295, + 326, + 349, + 358, + 431, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1286, + 1322, + 1369, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 335, + "label": 3, + "text": "Control_unit:control unit control unit cu component computer central processing unit cpu directs operation processor tells computer memory arithmetic logic unit input output devices respond instructions sent processor directs operation units providing timing control signals computer resources managed cu directs flow data cpu devices john von neumann included control unit part von neumann architecture modern computer designs control unit typically internal part cpu overall role operation unchanged since introduction control unit cu digital circuitry contained within processor coordinates sequence data movements processor many sub-units result routed data movements various digital circuits sub-units within processor produces manipulated data expected software instruction loaded earlier likely memory controls conducts data flow inside processor additionally provides several external control signals rest computer direct data instructions to/from processor external destinations i.e memory examples devices require cu cpus graphics processing units gpus cu receives external instructions commands converts sequence control signals cu applies data path implement sequence register-transfer level operations precisely control unit cu generally sizable collection complex digital circuitry interconnecting directing many execution units i.e alu data buffers registers contained within cpu cu normally first cpu unit accept externally stored computer program single instruction based cpu instruction set cu decodes individual instruction several sequential steps fetching addresses/data registers/memory managing execution i.e data sent alu i/o storing resulting data back registers/memory controls coordinates cpu inner works properly manipulate data design sequential steps based needs instruction range number steps order execution units enabled thus using program set instructions memory cu configure cpu data flows needed manipulate data correctly instructions results computer could run complete program require human intervention make hardware changes instructions done using punch cards computations stored programmed computers cus invented detailed steps cu dictate cpu interconnecting hardware control signals enable/disable cpu units selected/de-selected unit proper order execution required instruction operation produce desired manipulated data additionally cu orderly hardware coordination properly sequences control signals configures many hardware units comprising cpu directing data also moved changed stored outside cpu i.e memory according instruction objective depending type instruction entering cu order number sequential steps produced cu could vary selection configuration parts cpu hardware utilized achieve instruction objective mainly moving storing modifying data within cpu one feature efficiently uses software instructions control/select/configure computer cpu hardware via cu eventually manipulates program data significant reason modern computers flexible universal running various programs compared 1930s 1940s computers without proper cu often required rewiring hardware changing programs cu instruction decode process repeated program counter incremented next stored program address new instruction enters cu address programs end advanced forms control units manage translation instructions data containing portion several micro-instructions cu manages scheduling micro-instructions selected execution units data channeled changed according execution unit function i.e. alu contains several functions processors control unit may broken additional units instruction unit scheduling unit handle scheduling retirement unit deal results coming instruction pipeline control unit orchestrates main functions cpu carrying stored instructions software program directing flow data throughout computer based upon instructions roughly likened traffic lights systematically control flow cars containing data different locations within traffic grid cpu parks desired parking spot memory address/register car occupants data go building execution unit come back changed way get back car return another location via controlled traffic grid hardwired control units implemented use combinational logic units featuring finite number gates generate specific results based instructions used invoke responses hardwired control units generally faster microprogrammed designs design uses fixed architecture\u2014it requires changes wiring instruction set modified changed architecture preferred reduced instruction set computers risc use simpler instruction set controller uses approach operate high speed however little flexibility complexity instruction set implement limited hardwired approach become less popular computers evolved previously control units cpus used ad-hoc logic difficult design idea microprogramming introduced maurice wilkes 1951 intermediate level execute computer program instructions microprograms organized sequence microinstructions stored special control memory algorithm microprogram control unit unlike hardwired control unit usually specified flowchart description main advantage microprogram control unit simplicity structure outputs controller organized microinstructions easily replaced", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 123, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1256, + 1272, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 336, + "label": 2, + "text": "Windows_Genuine_Advantage:windows genuine advantage windows genuine advantage wga anti-infringement system created microsoft enforces online validation licensing several microsoft windows operating systems accessing several services windows update downloading windows components microsoft download center windows 7 wga renamed windows activation technologies wga consists two components installable component called wga notifications hooks winlogon validates windows license upon logon activex control checks validity windows license downloading certain updates microsoft download center windows update wga notifications covers windows xp later exception windows server 2003 windows xp professional x64 edition activex control checks windows 2000 professional licenses well wga also advertises latest service pack service pack 3 windows xp requires manual intervention disable previously voluntary became mandatory use services july 2005 despite name actually evaluate integrity security computer wga validation process validates present installation windows license key detected computer hardware determines software licensed microsoft accessible either stand-alone program netscape-compatible web browser plug-in activex control within internet explorer latter relevant attempt access microsoft updates via browser includes following steps activex control downloaded first validation new version available validation performed time user connects microsoft website update windows vista without service packs wga validation failure greater impact addition persistent notification disabling non-critical updates wga also disables windows aero windows defender windows readyboost user given grace period pass validation operating system disabled windows reverts reduced functionality mode behavior however removed service pack 1 windows vista favor prominent notices systems believed unlicensed user installs windows genuine advantage internet explorer add-on installed labeled windows genuine advantage early releases tool could readily disabled ie add-on management feature windows group policy added later updates causing option unavailable default still accessible policy removed july 2006 latest update blocks management means program uses either stand-alone program generate key activex control discover whether license key valid either way internet connection required windows xp wga determines user copy windows unauthorized installed seemingly legitimate media i.e. cd/dvd holographic emblem present real copies windows seems genuine microsoft supply user new cd/dvd however newer versions windows still require user purchase new copy microsoft also offers discounts people want purchase legitimate copy windows valid cd microsoft indicated continue deliver critical security updates automatic updates service well via microsoft download center systems including fail pass validation still continue receive critical security updates company made installation windows genuine advantage requirement use windows update microsoft update websites part sure customers use support resources company aware software unlicensed according microsoft legal run microsoft windows without windows genuine advantage however since non-critical windows updates presented automatic updates installation wga required installation non-critical updates available windows update microsoft download center april 25 2006 microsoft began distributing windows genuine advantage notifications critical update kb905474 windows users windows 7 kb971033 function back 2006 users copies wga believed unlicensed exposed alerts startup login use windows os stating genuine copy windows users legitimate copies supposed see alerts although anyway may 23 2006 microsoft updated program closing forms circumvention reportedly updated may 30 june 6 june 27 2006 though forms circumvention still usable latest versions roll worldwide time dates given earliest dates versions appeared actual version offered places earlier version latest release still possible opt receiving update using show option windows update site windows xp hide option right-click menu windows update control panel windows vista/7/8 addition notifications windows genuine advantage also notify users message version windows xp longer secure users xp operating system using service pack 3 provide link help users update systems new service pack version windows genuine advantage notifications released november 29 2006 changed install process inform user program also set automatically update newer versions windows genuine advantage notifications also informs users may non-genuine version windows windows version n't reported genuine however unlike previous releases started automatically delivered windows machines using four widely distributed product keys latest update version 1.9.0040.0 released march 24 2009 microsoft includes windows genuine advantage validation library several products windows validation tool windows media player 11 check validation windows software version 7 internet explorer longer requires user pass windows genuine advantage test order download install software wga validation library also included microsoft security essentials 2.0 validate windows installation whether legitimate program stop working 30 days failed validation process information used wga library check overuse license keys september 2005 microsoft filed lawsuits number companies sold unauthorized copies software based information users told copyright infringing software windows genuine advantage application may 4 2006 microsoft announced lawsuits allegedly distributing unauthorized copies windows edirectsoftware montana chicago-area resellers nathan ballog easy computers personal firewalls though one embedded windows may alert method wgatray.exe started case outpost firewall identified hidden process wgatray.exe process firewall blocked without apparent problems tool released firewall vendor prevent wga notifications transmitting information one pc windows genuine advantage microsoft collects following data october 20 2008 many users windows xp china received black desktop microsoft introduced wga system chinese language systems effort combat copyright violation extremely common china since majority users china run unlicensed copy windows many users experienced described black screen syndrome operating system changes desktop background black screen well displays constant warning messages users even reported disabling office programs microsoft word powerpoint outlook according various polls carried chinese portals sohu.com qq.com 21cn.com many others large number 60 surveyed chinese internet users hostile microsoft windows genuine advantage wga office genuine advantage oga even wga really make program unusable updates except critical ones downloaded microsoft rather disallowing updating windows vista originally ran reduced-functionality mode found wga compromised made people compare wga time bomb software windows vista sp2 removed behavior reverted nag-only methods windows xp notification tool accused spyware-like behavior phoning home daily basis microsoft subsequently admitted behaviour denied amounted spyware following pressure microsoft announced future tool would phone home every two weeks instead every day microsoft also provided removal instructions pilot version wga despite microsoft sued anti-spyware statutes wga non-disclosed phone home behaviour lawsuit since dismissed wga program produce false positives incorrectly identifying genuine copy windows genuine happen number reasons failed updates etc microsoft established forum help users encountering problems february 2007 sure section added program case incorrect reading according ars technica editorial wga reported around 22 500 million windows computers failing test less 0.5 due unauthorized software balance 20 90 positives related edge cases microsoft refused comment rate pure false positives beyond saying 1 stated around 5 million users affected june 18 2007 news surfaced possible positively validate genuine microsoft product user result able download certain software microsoft official website using internet explorer ies4linux wine running linux without even windows-family system installed october 5 2006 wga failure occurred incorrectly flagging systems non-genuine august 25 2007 microsoft wga servers suffered outage resulting many legitimate copies windows xp vista marked counterfeit issue solved 12 hours later according microsoft fewer 12,000 systems affected worldwide july 18 2008 reports microsoft wga oga servers offline surfaced microsoft later responded offline verification temporarily", + "neighbors": [ + 26, + 66, + 79, + 93, + 134, + 148, + 153, + 234, + 262, + 278, + 295, + 312, + 326, + 344, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1042, + 1092, + 1098, + 1138, + 1212, + 1247, + 1250, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1531, + 1533, + 1545, + 1547, + 1561, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 337, + "label": 2, + "text": "Mobile_operating_system:mobile operating system mobile operating system mobile os operating system phones tablets smartwatches mobile devices computers typical laptops 'mobile operating systems usually used considered mobile ones originally designed desktop computers historically need specific mobile features distinction becoming blurred newer operating systems hybrids made uses mobile operating systems combine features personal computer operating system features useful mobile handheld use usually including following considered essential modern mobile systems wireless inbuilt modem sim tray telephony data connection touchscreen cellular bluetooth wi-fi protected access wi-fi global positioning system gps mobile navigation video- single-frame picture cameras speech recognition voice recorder music player near field communication infrared blaster q1 2018 383 million smartphones sold 86.2 percent running android 12.9 percent running ios android alone popular popular desktop operating system windows general smartphone use even without tablets outnumber desktop use mobile devices mobile communications abilities e.g. smartphones contain two mobile operating systemsthe main user-facing software platform supplemented second low-level proprietary real-time operating system operates radio hardware research shown low-level systems may contain range security vulnerabilities permitting malicious base stations gain high levels control mobile device mobile operating systems majority use since 2017 measured web use even smartphones running excluding tablets used kind device thus traditional desktop os minority used kind os see usage share operating systems however variations occur popularity regions desktop-minority also applies days regions united states united kingdom mobile operating system milestones mirror development mobile phones smartphones operating systems often run atop baseband real time operating systems handle hardware aspects phone android based modified linux kernel mobile operating system developed google inc besides largest installed base worldwide smartphones also popular operating system general purpose computers category includes desktop computers mobile devices even though android popular operating system regular desktop personal computers pcs although android operating system free open-source software devices sold much software bundled including google apps vendor-installed software proprietary software closed source android releases 2.0 1.0 1.5 1.6 used exclusively mobile phones android 2.x releases mostly used mobile phones also tablets android 3.0 tablet-oriented release officially run mobile phones phone tablet compatibility merged android 4.0 current android version 9.0 pie android releases named sweets dessert items except first second releases android one software experience runs unmodified android operating system closely resembles running pixel devices previously google nexus program unlike stock androids running market android one ui closely resembles pixel ui due android one software experience developed google distributed partners signup program nokia xiaomi thus overall ui intended clean possible oem partners may tweak add additional apps cameras firmware otherwise apps handled google proprietary apps update handled google internally tested oem distributed via ota update end users designed alibaba based android amazfit os mobile operating system based android develop xiaomi backed huami higher-end amazfit series smartwatch amazfit pace verge stratos due android based operating system therefore side loaded android apk file run smartwatch similar miui although amazfit os based open source aosp consists closed source proprietary software blackberry secure operating system developed blackberry based android open source project aosp officially announced name android based front-end touch interface august 2017 announcement blackberry secure running blackberry brand devices blackberry priv dtek 50/60 blackberry keyone currently blackberry plan license blackberry secure oem coloros custom front-end touch interface based android open source project aosp developed oppo electronics corp. oppo officially releases coloros every oppo device released official rom oneplus one emotion user interface emui front-end touch interface developed huawei technologies co. ltd. based google android open source project aosp emui preinstalled huawei honor devices based open source android operating system consists closed source proprietary software /e/ operating system forked source code lineageos based android supports currently 76 devices april 2019 /e/ targets android smart phone devices uses microg replacement google play services flyme os operating system developed meizu technology co. ltd. open source os based google android open source project aosp flyme os mainly installed meizu smartphones mx series however also official rom support android devices funtouch os fork android developed vivo funtouch os difference traditional android ui funtouch os includes features unavailable former customizable gestures communication drawer bottom top swipe security centre lock screen resize options long screen shot eye protection changing warmer color temperature others funtouch os respects looks similar ios made apple grapheneos formerly named android hardening variant android runs pixel 2 pixel 3 hardware mainly developed daniel micay aims focus security privacy htc sense software suite developed htc used primarily company android-based devices serving successor htc touchflo 3d software windows mobile sense modifies many aspects android user experience incorporating added features altered home screen keyboard widgets htc-developed applications redesigned applications first device sense htc hero released 2009 indus os custom mobile operating system based android open source project aosp developed indus os team based india longer valid 2018indus os available micromax intex karbonn indian smartphone brands lg ux formerly named optimus ui front-end touch interface developed lg electronics partners featuring full touch user interface sometimes incorrectly identified operating system lg ux used internally lg sophisticated feature phones tablet computers available licensing external parties optimus ui 2 based android 4.1.2 released optimus k ii optimus neo 3 features refined user interface compared prior version based android 4.1.1 would include together new functionality voice shutter quick memo lineage android distribution custom mobile operating system based android open source project aosp serves successor highly popular custom rom cyanogenmod forked december 2016 cyanogen inc. announced discontinuing development shut infrastructure behind project since cyanogen inc. retained rights cyanogen name project rebranded fork lineageos similar cyanogenmod include proprietary apps unless user installs allows android users longer obtain update support manufacturer continue updating os version latest one based official release google aosp heavy theme customization mifavor custom android ui developed zte smartphone running android platform similar android ui mifavor replace stock apps zte owns apps however ux still closely similar stock android mi user interface miui developed chinese electronic company xiaomi inc. mobile operating system based android open source project aosp miui mostly found xiaomi smartphones mi redmi series however also official rom support android devices although miui based aosp open source consists closed source proprietary software miui poco custom mobile operating system based miui based android open source project aosp like predecessor also develop xiaomi inc unlike original miui miui poco specifically customized poco series smartphone including difference ui frequent update compare original miui like miui based open source aosp miui poco also consists closed source proprietary software oxygenos based open source android open source project aosp developed oneplus replace cyanogen os oneplus devices oneplus one preinstalled oneplus 2 oneplus x oneplus 3 oneplus 3t oneplus 5 oneplus 5t oneplus 6 stated oneplus oxygenos focused stabilizing maintaining stock like found nexus devices consists mainly google apps minor ui customization maintain sleekness pure android pixel ui developed google based open source android unlike nexus phones google shipped stock android ui came first generation pixel phones slightly modified compared stock android part google pixel software pixel ui home launcher closed source proprietary thus available pixel family devices however third party mods allow non pixel smartphones install pixel launcher google feed integration replicant custom mobile operating system based android proprietary drivers bloat closed source software removed samsung experience formerly called touchwiz front-end touch interface developed samsung electronics partners featuring full touch user interface sometimes incorrectly identified independent operating system samsung experience used internally samsung smartphones feature phones tablet computers available licensing external parties closed source proprietary android version samsung experience also comes samsung-made apps preloaded except starting galaxy s6 removed samsung pre-loaded apps installed leaving one galaxy apps save storage space initially due removal microsd release samsung galaxy s8 s8+ samsung experience 8.1 preinstall introducing new function known samsung dex similar concept microsoft continuum samsung dex allowed high end galaxy devices s8/s8+ note 8 connect docking station extends functionality allow desktop-like functionality connecting keyboard mouse monitor samsung also announced linux galaxy allows use standard linux distribution dex platform sony xperia ui formerly known timescape ui front-end ui developed sony mobile formerly sony ericsson sony xperia series running android platform sony xperia ui mostly consists sony application sony music formerly known walkman music player albums video player time timescape ui ui different standard android ui instead traditional apps dock bottom part located four corner home screen middle screen consist widget however recent development ui closely resemble stock android zenui front-end touch interface developed asus partners featuring full touch user interface zenui used asus android phones tablet computers available licensing external parties zenui also comes preloaded asus-made apps like zenlink pc link share link party link remote link non-android operating systems listed following sections chrome os operating system designed google based linux kernel uses google chrome web browser principal user interface result chrome os primarily supports web applications google announced project july 2009 conceiving operating system applications user data reside cloud hence chrome os primarily runs web applications due increase popularity 2 1 pcs recent chromebooks introduced touch screen capability android applications starting become available operating system 2014 2016 access android apps entire google play store introduced supported chrome os devices support android applications chromebook devices positioned tablet based instead notebooks chrome os available pre-installed hardware google manufacturing partners open source equivalent chromium os compiled downloaded source code early google provided design goals chrome os otherwise released technical description fuchsia capability-based real-time operating system rtos currently developed google first discovered mysterious code post github august 2016 without official announcement contrast prior google-developed operating systems chrome os android based linux kernels fuchsia based new microkernel called zircon derived little kernel small operating system intended embedded systems upon inspection media outlets noted code post github suggested fuchsia capability run universal devices embedded systems smartphones tablets personal computers may 2017 fuchsia updated user interface along developer writing project experimental prompting media speculation google intentions operating system including possibility replacing android liteos lightweight open source real-time operating system part huawei 1+2+1 internet things solution similar google android things samsung tizen huawei liteos features lightweight low-power fast-response multi-sensor collaboration multi-protocol interconnect connectivity enabling iot terminals quickly access network huawei liteos make intelligent hardware development easier thereby accelerating realization interconnection things currently liteos introduce consumer market huawei watch gt series smartbands current liteos version list pureos debian gnu/linux derivative using free software developed purism already used purism laptops planned use librem 5 smartphone purism partnership gnome kde aims separate cpu baseband processor include hardware kill switches phone wi-fi bluetooth camera microphone baseband processor provide gnome kde plasma mobile options desktop environment sailfish os jolla open source gnu general public license gpl middleware stack core comes mer sailfish due jolla business model due alliances various partners due intentional design os internals capable adopt several layers third party software including jolla software e.g jolla ui proprietary software closed source components proprietary many different kinds licences however user replace open source components like e.g nemo ui instead jolla ui nokia abandoned 2011 meego project meego team left nokia established jolla company use meego mer business opportunities mer standard allows launched hardware kernel compatible mer 2012 linux sailfish os based meego using middleware mer core stack distribution launched public use first device jolla smartphone unveiled may 20 2013 2015 jolla tablet launched brics countries declared officially supported os jolla started licensing sailfish os 2.0 third parties devices sold updateable sailfish 2.0 limits sailfish os version release named finnish lake tizen based linux kernel mobile operating system hosted linux foundation together support tizen association guided technical steering group composed intel samsung tizen operating system devices including smartphones tablets in-vehicle infotainment ivi devices smart tvs open source system however sdk closed source proprietary aims offer consistent user experience across devices tizen main components linux kernel webkit runtime according intel tizen combines best limo meego html5 apps emphasized meego encouraging members transition tizen stating future belongs html5-based applications outside relatively small percentage apps firmly convinced investment needs shift toward html5 tizen targeted variety platforms handsets touch pc smart tvs in-vehicle entertainment may 17 2013 tizen released version 2.1 code-named nectarine tizen open source ux ui layer developed samsung mainly closed source proprietary touchwiz ui samsung z series smartphone current tizen version list ubuntu touch canonical ltd.. open source uses gpl license ubuntu touch os built using android linux kernel using android drivers services via lxc container use java-like code android desktop environment ubuntu touch planned available one default desktop options librem 5 running pureos operating system though canonical formally announced discontinuing ubuntu mobile os integral component unity8 independent german non-profit ubports community/ foundation paperwork pending local berlin-government decided take project canonical started ubuntu touch based ubuntu 15.04 vivid vervet ubports upgraded base nearest current long-term support version ubuntu 16.04 lts xenial xerus original canonical ubuntu touch version list ubports ubuntu touch version list plasma mobile kde desktop environment mobile phones intended compatible several different mobile phone operating systems including pureos running librem 5 open source mobile operating systems active development include luneos based webos postmarketos based alpine linux gnu/linux distribution maemo leste meizu pro 5 ubuntu edition meizu mx4 ubuntu edition running ubuntu touch necuno using gnu/linux distribution plasma mobile desktop kde proprietary version amazfit os develop xiaomi backed huami amazfit bip smartwatch however instead based android based proprietary operating system thus able install third party apps apks ios formerly named iphone os created apple inc second largest installed base worldwide smartphones largest profits due aggressive price competition android-based manufacturers closed source proprietary built open source darwin operating system iphone ipod touch ipad second third-generation apple tv use ios derived macos native third party applications officially supported release iphone os 2.0 july 11 2008 jailbreaking allowed third party applications installed recent years jailbreaking scene changed drastically due apple continued efforts secure operating system prevent unauthorized modifications currently jailbreaks recent iterations ios semi-untethered requires device re-jailbroken every boot exploits jailbreaks becoming increasingly hard find use currently ios devices developed apple manufactured foxconn another apple partners watchos operating system apple watch developed apple inc based ios operating system many similar features released april 24 2015 along apple watch device runs watchos currently widely used wearable operating system features focus convenience able place phone calls send texts health fitness heart rate tracking current version watchos operating system watchos 5 windows 10 personal computer operating system developed released microsoft part windows nt family operating systems released july 29 2015 like predecessors designed run across multiple microsoft product pcs tablets windows user interface revised handle transitions mouse-oriented interface touchscreen-optimized interface based available input devices\u200d\u2014\u200cparticularly 2-in-1 pcs windows 10 also introduces universal apps expanding metro-style apps apps designed run across multiple microsoft product families nearly identical code\u200d\u2014\u200cincluding pcs tablets smartphones embedded systems xbox one surface hub mixed reality current windows 10 version list kaios kai based firefox os unlike mobile operating systems focus smartphones kaios developed mainly feature phones giving access advanced technologies usually found smartphones app stores wi-fi/4g capabilities blackberry 10 based qnx os blackberry smartphone os closed source proprietary runs phones tablets manufactured blackberry one dominant platforms world late 2000s global market share reduced significantly mid-2010s late 2016 blackberry announced continue support os promise release 10.3.3 therefore blackberry 10 would receive major updates blackberry partners would focus android base development current blackberry 10 version list windows 10 mobile formerly called windows phone microsoft closed source proprietary unveiled february 15 2010 windows phone includes user interface inspired microsoft metro design language integrated microsoft services onedrive office xbox music xbox video xbox live games bing also integrates many non-microsoft services facebook google accounts windows phone devices made primarily microsoft mobile/nokia also htc samsung january 21 2015 microsoft announced windows phone brand phased replaced windows 10 mobile bringing tighter integration unification pc counterpart windows 10 provide platform smartphones tablets screen sizes 8 inches october 2017 microsoft officially announced would longer push major updates windows 10 mobile instead would put maintenance mode microsoft would push bug fixes general improvements therefore windows 10 mobile would receive new feature updates current windows 10 mobile version list cyanogenmod custom mobile operating system based android open source project aosp custom rom co-developed cyanogenmod community os include proprietary apps unless user installed due open source nature cyanogenmod allowed android users could longer obtain update support manufacturer continue updating os version latest one based official releases google aosp heavy theme customization last version os cyanogenmod 13 based android asus december 24 2016 cyanogenmod announced blog would longer releasing cyanogenmod updates development moved lineageos cyanogen os based cyanogenmod maintained cyanogen inc however included proprietary apps available commercial uses firefox os project name boot gecko also known b2g mozilla open source mobile operating system released mozilla public license built android linux kernel used android drivers use java-like code android according ars technica mozilla says b2g motivated desire demonstrate standards-based open web potential competitive alternative existing single-vendor application development stacks offered dominant mobile operating systems september 2016 mozilla announced work firefox os ceased b2g-related code would removed mozilla-central meego non-profit organization linux foundation open source gpl 2010 mobile world congress barcelona nokia intel unveiled meego mobile operating system combined moblin maemo create open-sourced experience users across devices 2011 nokia announced would longer pursue meego favor windows phone nokia announced nokia n9 june 21 2011 nokia connection event singapore lg announced support platform maemo platform developed nokia smartphones internet tablets open source gpl based debian gnu/linux draws much graphical user interface gui frameworks libraries gnome project uses matchbox window manager gtk-based hildon gui application framework webos developed palm webos open source mobile operating system running linux kernel initially developed palm launched palm pre acquired hp two phones veer pre 3 tablet touchpad running webos introduced 2011 august 18 2011 hp announced webos hardware would discontinued would continue support update webos software develop webos ecosystem hp released webos open source name open webos plans update additional features february 25 2013 hp announced sale webos lg electronics used operating system smart internet-connected tvs however hp retained patents underlying webos cloud-based services app catalog 1999 research motion released first blackberry devices providing secure real-time push-email communications wireless devices services blackberry messenger provide integration communications single inbox september 2012 rim announced 200 millionth blackberry smartphone shipped september 2014 around 46 million active blackberry service subscribers early 2010s rim undergone platform transition changing company name blackberry limited making new devices new platform named blackberry 10 windows mobile discontinued operating system microsoft replaced windows phone closed source proprietary windows ce operating system windows mobile middleware widely spread asia mostly uses android two improved variants operating system windows mobile 6 professional touch screen devices windows mobile 6 standard unveiled february 2007 criticized user interface optimized touch input fingers instead usable stylus like ios mobile os supports touch screen physical bluetooth keyboard configurations microsoft phased windows mobile os focus windows phone windows phone family mobile operating systems developed microsoft smartphones replacement successor windows mobile zune windows phone features new user interface derived metro design language windows phone replaced windows 10 mobile 2015 symbian platform developed nokia models smartphones proprietary software however used ericsson sonyericsson sending benq operating system discontinued 2012 although slimmed-down version basic phones still developed july 2014 microsoft officially shelved platform favor windows phone acquisition nokia bada platform stylized bada korean \ubc14\ub2e4 operating system mobile devices smartphones tablet computers developed samsung electronics name derived \ubc14\ub2e4 bada meaning ocean sea korean ranges mid- high-end smartphones foster adoption bada os since 2011 samsung reportedly considered releasing source code open-source license expanding device support include smart tvs samsung announced june 2012 intentions merge bada tizen project would meanwhile use bada operating system parallel google android os microsoft windows phone smartphones bada-powered devices branded wave name samsung android-powered devices branded name galaxy february 25 2013 samsung announced stop developing bada moving development tizen instead bug reporting finally terminated april 2014 palm os/garnet os access co closed source proprietary webos introduced palm january 2009 successor palm os web 2.0 technologies open architecture multitasking abilities 2006 android ios exist 64 million smartphones sold 2018 q1 383.5 million smartphones sold global market share 85.9 android 14.1 ios according statcounter web use statistics proxy use smartphones alone without tablets majority use globally desktop computers used much less android particular popular windows use varies however continent smartphones way popular biggest continents i.e asia desktop still popular though north america desktop still popular many countries overall 44.9 first quarter 2017 smartphones popular even many developed countries countries continent desktop-minority european countries south america e.g haiti north america asia africa smartphone-majority poland turkey highest 57.68 62.33 respectively ireland smartphone use 45.55 outnumbers desktop use mobile whole gains majority including tablet share 9.12 spain also slightly desktop-minority range measured mobile web use varies lot country statcounter press release recognizes india amongst world leaders use mobile surf internet big countries share around 80 desktop 19.56 russia trailing 17.8 mobile use desktop rest smartphones alone without tablets first gained majority december 2016 desktop-majority lost month n't christmas-time fluke close majority smartphone majority happened march 2017 week november 7\u201313 2016 smartphones alone without tablets overtook desktop first time short period non-full-month mobile-majority applies countries paraguay south america poland europe turkey asia africa world still desktop-majority e.g united states 54.89 days however territories united states puerto rico desktop way majority windows 30 overtaken android october 22 2016 subsequent weekends mobile showed majority since october 27 desktop n't shown majority even weekdays smartphones alone showed majority since december 23 end year share topping 58.22 christmas day mobile -majority share smartphones tablets could added giving 63.22 majority unusually high top similarly high also happened monday april 17 2017 smartphones share slightly lower tablet share slightly higher combined 62.88 formerly according statcounter press release world turned desktop-minority 49 desktop use month mobile n't ranked higher tablet share added exceed desktop share note", + "neighbors": [ + 3, + 9, + 21, + 24, + 33, + 41, + 62, + 75, + 101, + 113, + 131, + 134, + 162, + 207, + 211, + 252, + 253, + 264, + 269, + 270, + 275, + 293, + 298, + 301, + 309, + 322, + 355, + 398, + 403, + 408, + 412, + 422, + 433, + 477, + 502, + 509, + 511, + 520, + 527, + 583, + 603, + 610, + 611, + 619, + 622, + 629, + 634, + 716, + 726, + 775, + 796, + 833, + 837, + 858, + 877, + 899, + 927, + 956, + 961, + 972, + 973, + 1018, + 1020, + 1051, + 1054, + 1061, + 1117, + 1138, + 1140, + 1185, + 1193, + 1203, + 1214, + 1219, + 1227, + 1287, + 1292, + 1295, + 1310, + 1314, + 1325, + 1366, + 1373, + 1411, + 1419, + 1422, + 1486, + 1493, + 1522, + 1529, + 1547, + 1602, + 1619, + 1621 + ], + "mask": "Validation" + }, + { + "node_id": 338, + "label": 4, + "text": "Fuzzing:fuzzing fuzzing fuzz testing automated software testing technique involves providing invalid unexpected random data inputs computer program program monitored exceptions crashes failing built-in code assertions potential memory leaks typically fuzzers used test programs take structured inputs structure specified e.g. file format protocol distinguishes valid invalid input effective fuzzer generates semi-valid inputs valid enough directly rejected parser create unexpected behaviors deeper program invalid enough expose corner cases properly dealt purpose security input crosses trust boundary often interesting example important fuzz code handles upload file user fuzz code parses configuration file accessible privileged user testing programs random inputs dates back 1950s data still stored punched cards programmers would use punched cards pulled trash card decks random numbers input computer programs execution revealed undesired behavior bug detected fixed execution random inputs also called random testing monkey testing 1981 duran ntafos formally investigated effectiveness testing program random inputs random testing widely perceived worst means testing program authors could show cost-effective alternative systematic testing techniques 1983 steve capps developed monkey tool would generate random inputs classic mac os applications macpaint figurative monkey refers infinite monkey theorem states monkey hitting keys random typewriter keyboard infinite amount time eventually type entire works shakespeare case testing monkey would write particular sequence inputs trigger crash term fuzzing originates 1988 class project taught barton miller university wisconsin fuzz test unix utility meant automatically generate random files command-line parameters utility project designed test reliability unix programs executing large number random inputs quick succession crashed also provided early debugging tools determine cause category detected failure allow researchers conduct similar experiments software source code tools test procedures raw result data made publicly available later term fuzzing limited command-line utilities 1991 crashme tool released intended test robustness unix unix-like operating systems executing random machine instructions 1995 fuzzer used test gui-based tools x window system network protocols system library apis april 2012 google announced clusterfuzz cloud-based fuzzing infrastructure security-critical components chromium web browser security researchers upload fuzzers collect bug bounties clusterfuzz finds crash uploaded fuzzer september 2014 shellshock disclosed family security bugs widely used unix bash shell vulnerabilities shellshock found using fuzzer afl many internet-facing services web server deployments use bash process certain requests allowing attacker cause vulnerable versions bash execute arbitrary commands allow attacker gain unauthorized access computer system april 2015 hanno b\u00f6ck showed fuzzer afl could found 2014 heartbleed vulnerability heartbleed vulnerability disclosed april 2014 serious vulnerability allows adversaries decipher otherwise encrypted communication vulnerability accidentally introduced openssl implements tls used majority servers internet shodan reported 238,000 machines still vulnerable april 2016 200,000 january 2017 august 2016 defense advanced research projects agency darpa held finals first cyber grand challenge fully automated capture-the-flag competition lasted 11 hours objective develop automatic defense systems discover exploit correct software flaws real-time fuzzing used effective offense strategy discover flaws software opponents showed tremendous potential automation vulnerability detection winner system called mayhem developed team forallsecure led david brumley september 2016 microsoft announced project springfield cloud-based fuzz testing service finding security critical bugs software december 2016 google announced oss-fuzz allows continuous fuzzing several security-critical open-source projects black hat 2018 christopher domas demonstrated use fuzzing expose existence hidden risc core processor core able bypass existing security checks execute ring 0 commands ring 3 fuzzer categorized follows mutation-based fuzzer leverages existing corpus seed inputs fuzzing generates inputs modifying rather mutating provided seeds example fuzzing image library libpng user would provide set valid png image files seeds mutation-based fuzzer would modify seeds produce semi-valid variants seed corpus seed files may contain thousands potentially similar inputs automated seed selection test suite reduction allows users pick best seeds order maximize total number bugs found fuzz campaign generation-based fuzzer generates inputs scratch instance smart generation-based fuzzer takes input model provided user generate new inputs unlike mutation-based fuzzers generation-based fuzzer depend existence quality corpus seed inputs fuzzers capability generate inputs scratch generate inputs mutation existing seeds typically fuzzers used generate inputs programs take structured inputs file sequence keyboard mouse events sequence messages structure distinguishes valid input accepted processed program invalid input quickly rejected program constitutes valid input may explicitly specified input model examples input models formal grammars file formats gui-models network protocols even items normally considered input fuzzed contents databases shared memory environment variables precise interleaving threads effective fuzzer generates semi-valid inputs valid enough directly rejected parser invalid enough might stress corner cases exercise interesting program behaviours smart model-based grammar-based protocol-based fuzzer leverages input model generate greater proportion valid inputs instance input modelled abstract syntax tree smart mutation-based fuzzer would employ random transformations move complete subtrees one node another input modelled formal grammar smart generation-based fuzzer would instantiate production rules generate inputs valid respect grammar however generally input model must explicitly provided difficult model proprietary unknown complex large corpus valid invalid inputs available grammar induction technique angluin l* algorithm would able generate input model dumb fuzzer require input model thus employed fuzz wider variety programs instance afl dumb mutation-based fuzzer modifies seed file flipping random bits substituting random bytes interesting values moving deleting blocks data however dumb fuzzer might generate lower proportion valid inputs stress parser code rather main components program disadvantage dumb fuzzers illustrated means construction valid checksum cyclic redundancy check crc crc error-detecting code ensures integrity data contained input file preserved transmission checksum computed input data recorded file program processes received file recorded checksum match re-computed checksum file rejected invalid fuzzer unaware crc unlikely generate correct checksum however attempts identify re-compute potential checksum mutated input dumb mutation-based fuzzer modified protected data typically fuzzer considered effective achieves higher degree code coverage rationale fuzzer exercise certain structural elements program also able reveal bugs hiding elements program elements considered critical others instance division operator might cause division zero error system call may crash program black-box fuzzer treats program black box unaware internal program structure instance random testing tool generates inputs random considered blackbox fuzzer hence blackbox fuzzer execute several hundred inputs per second easily parallelized scale programs arbitrary size however blackbox fuzzers may scratch surface expose shallow bugs hence attempts develop blackbox fuzzers incrementally learn internal structure behavior program fuzzing observing program output given input instance learnlib employs active learning generate automaton represents behavior web application white-box fuzzer leverages program analysis systematically increase code coverage reach certain critical program locations instance sage leverages symbolic execution systematically explore different paths program program specification available whitebox fuzzer might leverage techniques model-based testing generate inputs check program outputs program specification whitebox fuzzer effective exposing bugs hide deep program however time used analysis program specification become prohibitive whitebox fuzzer takes relatively long generate input blackbox fuzzer efficient hence attempts combine efficiency blackbox fuzzers effectiveness whitebox fuzzers gray-box fuzzer leverages instrumentation rather program analysis glean information program instance afl libfuzzer utilize lightweight instrumentation trace basic block transitions exercised input leads reasonable performance overhead informs fuzzer increase code coverage fuzzing makes gray-box fuzzers extremely efficient vulnerability detection tools fuzzing used mostly automated technique expose vulnerabilities security-critical programs might exploited malicious intent generally fuzzing used demonstrate presence bugs rather absence running fuzzing campaign several weeks without finding bug prove program correct program may still fail input executed yet executing program inputs prohibitively expensive objective prove program correct inputs formal specification must exist techniques formal methods must used order expose bugs fuzzer must able distinguish expected normal unexpected buggy program behavior however machine always distinguish bug feature automated software testing also called test oracle problem typically fuzzer distinguishes crashing non-crashing inputs absence specifications use simple objective measure crashes easily identified might indicate potential vulnerabilities e.g. denial service arbitrary code execution however absence crash indicate absence vulnerability instance program written c may may crash input causes buffer overflow rather program behavior undefined make fuzzer sensitive failures crashes sanitizers used inject assertions crash program failure detected different sanitizers different kinds bugs fuzzing also used detect differential bugs reference implementation available automated regression testing generated inputs executed two versions program automated differential testing generated inputs executed two implementations program e.g. lighttpd httpd implementations web server two variants produce different output input one may buggy examined closely static program analysis analyzes program without actually executing might lead false positives tool reports problems program actually exist fuzzing combination dynamic program analysis used try generate input actually witnesses reported problem modern web browsers undergo extensive fuzzing chromium code google chrome continuously fuzzed chrome security team 15,000 cores microsoft edge internet explorer microsoft performed fuzzed testing 670 machine-years product development generating 400 billion dom manipulations 1 billion html files fuzzer produces large number inputs relatively short time instance 2016 google oss-fuzz project produced around 4 trillion inputs week hence many fuzzers provide toolchain automates otherwise manual tedious tasks follow automated generation failure-inducing inputs automated bug triage used group large number failure-inducing inputs root cause prioritize individual bug severity fuzzer produces large number inputs many failure-inducing ones may effectively expose software bug bugs security-critical patched higher priority instance cert coordination center provides linux triage tools group crashing inputs produced stack trace lists group according probability exploitable microsoft security research centre msec developed exploitable tool first creates hash crashing input determine uniqueness assigns exploitability rating previously unreported triaged bugs might automatically reported bug tracking system instance oss-fuzz runs large-scale long-running fuzzing campaigns several security-critical software projects previously unreported distinct bug reported directly bug tracker oss-fuzz bug tracker automatically informs maintainer vulnerable software checks regular intervals whether bug fixed recent revision using uploaded minimized failure-inducing input automated input minimization test case reduction automated debugging technique isolate part failure-inducing input actually inducing failure failure-inducing input large mostly malformed might difficult developer understand exactly causing bug given failure-inducing input automated minimization tool would remove many input bytes possible still reproducing original bug instance delta debugging automated input minimization technique employs extended binary search algorithm find minimal input", + "neighbors": [ + 11, + 99, + 149, + 225, + 293, + 306, + 365, + 379, + 429, + 439, + 479, + 518, + 528, + 531, + 576, + 698, + 739, + 740, + 750, + 762, + 800, + 876, + 1015, + 1027, + 1039, + 1090, + 1110, + 1112, + 1303, + 1325, + 1361, + 1368, + 1379, + 1472, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 339, + "label": 0, + "text": "Voice_computing:voice computing voice computing discipline develops hardware software process voice inputs spans many fields including human-computer interaction conversational computing linguistics natural language processing automatic speech recognition speech synthesis audio engineering digital signal processing cloud computing data science ethics law information security voice computing become increasingly significant modern times especially advent smart speakers like amazon echo google assistant shift towards serverless computing improved accuracy speech recognition text-to-speech models voice computing rich history first scientists like wolfgang kempelen started build speech machines produce earliest synthetic speech sounds led work thomas edison record audio dictation machines play back corporate settings 1950s-1960s primitive attempts build automated speech recognition systems bell labs ibm others however 1980s hidden markov models used recognize 1,000 words speech recognition systems became relevant around 2011 siri emerged apple iphones first voice assistant accessible consumers innovation led dramatic shift building voice-first computing architectures ps4 released sony north america 2013 70+ million devices amazon released amazon echo 2014 30+ million devices microsoft released cortana 2015 400 million windows 10 users google released google assistant 2016 2 billion active monthly users android phones apple released homepod 2018 500,000 devices sold 1 billion devices active ios/siri shifts along advancements cloud infrastructure e.g amazon web services codecs solidified voice computing field made widely relevant public large voice computer assembled hardware software process voice inputs note voice computers necessarily need screen traditional amazon echo embodiments traditional laptop computers mobile phones could used voice computers moreover become increasingly interfaces voice computers advent iot-enabled devices within cars televisions september 2018 currently 20,000 types devices compatible amazon alexa voice computing software read/write record clean encrypt/decrypt playback transcode transcribe compress publish featurize model visualize voice files popular software packages related voice computing voice computing applications span many industries including voice assistants healthcare e-commerce finance supply chain agriculture text-to-speech security marketing customer support recruiting cloud computing microphones speakers podcasting voice technology projected grow cagr 19-25 2025 making attractive industry startups investors alike united states states varying telephone call recording laws states legal record conversation consent one party others consent parties required moreover coppa significant law protect minors using internet increasing number minors interacting voice computing devices e.g amazon alexa federal trade commission recently relaxed copaa rule children issue voice searches commands lastly gdpr new european law governs right forgotten many clauses eu citizens gdpr also clear companies need outline clear measures obtain consent audio recordings made define purpose scope recordings used e.g. training purposes bar valid consent raised gdpr consents must freely given specific informed unambiguous tacit consent longer sufficient many research conferences relate voice computing include google assistant roughly 2,000 actions january 2018 50,000 alexa skills worldwide september 2018 june 2017 google released audioset large-scale collection human-labeled 10-second sound clips drawn youtube videos contains 1,010,480 videos human speech files 2,793.5 hours total released part ieee icassp 2017 conference november 2017 mozilla foundation released common voice project collection speech files help contribute larger open source machine learning community voicebank currently 12gb size 500 hours english-language voice data collected 112 countries since project inception june 2017 dataset already resulted creative projects like deepspeech model open source transcription model", + "neighbors": [ + 611, + 662, + 704, + 1019, + 1096, + 1486 + ], + "mask": "Validation" + }, + { + "node_id": 340, + "label": 7, + "text": "Distributed_shared_memory:distributed shared memory computer science distributed shared memory dsm form memory architecture physically separated memories addressed one logically shared address space term shared mean single centralized memory address space shared physical address two processors refers location memory distributed global address space dgas similar term wide class software hardware implementations node cluster access shared memory addition node non-shared private memory distributed-memory system often called multicomputer consists multiple independent processing nodes local memory modules connected general interconnection network software dsm systems implemented operating system programming library thought extensions underlying virtual memory architecture implemented operating system systems transparent developer means underlying distributed memory completely hidden users contrast software dsm systems implemented library language level transparent developers usually program differently however systems offer portable approach dsm system implementations distributed shared memory system implements shared-memory model physically distributed memory system usually two methods achieving distributed shared memory three ways implementing software distributed shared memory software dsm systems also flexibility organize shared memory region different ways page based approach organizes shared memory pages fixed size contrast object based approach organizes shared memory region abstract space storing shareable objects variable sizes another commonly seen implementation uses tuple space unit sharing tuple shared memory architecture may involve separating memory shared parts distributed amongst nodes main memory distributing memory nodes coherence protocol chosen accordance consistency model maintains memory coherence memory coherence necessary system organizes dsm able track maintain state data blocks nodes across memories comprising system basic dsm track least three states among nodes given block directory state dictate block uncached u state dictate block exclusively owned modified owned em state dictate block shared blocks come directory organization transition u em ownership state initial node state transition nodes begin reading block two primary methods allowing system track blocks cached condition across node home-centric request-response uses home service requests drive states whereas requester-centric allows node drive manage requests home home-centric system dsm avoid handle request-response races nodes allowing one transaction occur time home node decided transaction finished\u2014usually home received responding processor response request example intel qpi home-source mode requester-centric system dsm allow nodes talk home means multiple nodes attempt start transaction requires additional considerations ensure coherence example one node processing block receives request block another node send nack negative acknowledgement tell initiator processing node ca n't fulfill request right away example intel qpi snoop-source mode dsm must follow certain rules maintain consistency read write order viewed among nodes called system consistency model suppose n processes mi memory operations process operations executed sequentially conclude m1 m2 \u2026 mn m1 m2 \u2026 mn possible interleaves operations issue conclusion determining correctness interleaved operations memory coherence dsm defines interleaves permitted two type replication algorithm read replication write replication read replication multiple nodes read time one node write write application multiple nodes read write time.the write requests handled sequencer replication shared data general tends however preserving coherence consistency may become challenging", + "neighbors": [ + 13, + 51, + 86, + 123, + 227, + 280, + 300, + 314, + 340, + 359, + 362, + 375, + 465, + 611, + 719, + 737, + 846, + 847, + 876, + 1013, + 1081, + 1099, + 1138, + 1219, + 1220, + 1274, + 1421, + 1507, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 341, + "label": 1, + "text": "EUROCAT_(medicine):eurocat medicine eurocat european organization describes network population-based registries epidemiological surveillance congenital anomalies covering 1.5 million births 20 countries europe founded 1979 goal improving collection data congenital disorders standardization data published extensions helps provide unique codes individual conditions approximately quarter new births european union reported eurocat", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 342, + "label": 4, + "text": "CRAM-MD5:cram-md5 cryptography cram-md5 challenge-response authentication mechanism cram based hmac-md5 algorithm one mechanisms supported simple authentication security layer sasl often used email software part smtp authentication authentication pop imap users well applications implementing ldap xmpp beep protocols software requires authentication unencrypted connections cram-md5 preferred mechanisms transmit passwords clear codice_1 codice_2 however ca n't prevent derivation password brute-force attack less effective alternative mechanisms avoid passwords use connections encrypted transport layer security tls cram-md5 protocol involves single challenge response cycle initiated server one-way hash fresh random challenge provide three types security cram-md5 defined ietf standards-track document rfc 2195 supersedes rfc 2095 earlier 1997 de facto standards define cram-md5 authentication method email mailbox-management protocols pop imap cram-md5 one authentication methods supported simple authentication security layer sasl defined 2006 rfc 4422 supersedes 1997 standard rfc 2222 internet assigned numbers authority iana maintains registry sasl mechanisms including cram-md5 limited use cram-md5 required on-demand mail relay odmr defined rfc 2645", + "neighbors": [ + 614, + 692, + 762, + 864, + 1045, + 1395, + 1443 + ], + "mask": "Train" + }, + { + "node_id": 343, + "label": 4, + "text": "Black_Hat_Briefings:black hat briefings black hat briefings commonly referred black hat computer security conference provides security consulting training briefings hackers corporations government agencies around world black hat brings together variety people interested information security ranging non-technical individuals executives hackers industry leading security professionals conference takes place regularly las vegas barcelona london abu dhabi conference also hosted amsterdam tokyo washington d.c. past black hat founded 1997 jeff moss also founded def con today moss conference chair black hat review board considered premier information security conferences world black hat started single annual conference las vegas nevada held multiple locations around world black hat acquired cmp media subsidiary u.k.-based united business media ubm 2005 black hat typically scheduled prior def con many attendees going conferences black hat perceived security industry corporate security conference whereas def con informal conference composed three major sections black hat briefings black hat trainings black hat arsenal briefings composed tracks covering various topics including reverse engineering identity privacy hacking briefings also contain keynote speeches leading voices information security field including robert lentz chief security officer united states department defense michael lynn amit yoran former director national cyber security division department homeland security general keith b. alexander former director national security agency former commander united states cyber command training offered various computer security vendors individual security professionals conference hosted national security agency information assurance manager course various courses cisco systems offensive security others arsenal portion conference dedicated giving researchers open source community place showcase latest open-source information security tools arsenal primarily consists live tool demonstrations setting attendees able ask questions tools sometimes use arsenal added 2010 toolswatch maintains archive black hat briefings arsenals black hat known antics hacker contingent disclosures brought talks conference attendees known hijack wireless connections hotels hack hotel television billing systems even hack automated teller machine hotel lobby 2009 web sites belonging handful security researchers groups hacked passwords private e-mails im chats sensitive documents exposed vandalized site dan kaminsky days conference black hat usa 2009 usb thumb drive passed around among attendees found infected conficker virus 2008 three men expelled packet sniffing press room local area network past companies attempted ban researchers disclosing vital information products black hat usa 2005 cisco systems tried stop michael lynn speaking vulnerability said could let hackers virtually shut internet however recent years researchers worked vendors resolve issues vendors challenged hackers attack products", + "neighbors": [ + 11, + 149, + 293, + 379, + 518, + 539, + 554, + 703, + 747, + 800, + 965, + 1013, + 1063, + 1090, + 1112, + 1368, + 1379 + ], + "mask": "Test" + }, + { + "node_id": 344, + "label": 2, + "text": "Windows_Ink:windows ink windows ink software suite windows 10 contains applications features oriented towards pen computing introduced windows 10 anniversary update suite includes sticky notes sketchpad screen sketch applications tablet pc supports pen input windows ink workspace icon taskbar enabled default otherwise enabled manually user windows ink workspace menu contains links top bottom described simple blank canvas quickly easily draw idea doodle create solve problems place user sketch whatever comes mind without launching full blown drawing program sketchbook clip studio paint includes small subset features full-blown drawing programs digital ruler pen options first run loads image unfinished landscape sketches saved images however possible open re-load previously saved sketch user opens windows ink workspace menu screenshot taken screen shown preview snip sketch item menu user taps draw screenshot using controls aforementioned sketchpad feature similar screen write feature samsung galaxy note devices", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 345, + "label": 2, + "text": "Steve_Jobs:steve jobs steven paul jobs february 24 1955 \u2013 october 5 2011 american business magnate entrepreneur investor chairman chief executive officer ceo co-founder apple inc. chairman majority shareholder pixar member walt disney company board directors following acquisition pixar founder chairman ceo next jobs widely recognized pioneer microcomputer revolution 1970s 1980s along apple co-founder steve wozniak jobs born san francisco california put adoption raised san francisco bay area attended reed college 1972 dropping year traveled india 1974 seeking enlightenment studying zen buddhism declassified fbi report states used marijuana lsd college told reporter taking lsd one two three important things done life jobs wozniak co-founded apple 1976 sell wozniak apple personal computer together duo gained fame wealth year later apple ii one first highly successful mass-produced personal computers jobs saw commercial potential xerox alto 1979 mouse-driven graphical user interface gui led development unsuccessful apple lisa 1983 followed breakthrough macintosh 1984 first mass-produced computer gui macintosh introduced desktop publishing industry 1985 addition apple laserwriter first laser printer feature vector graphics jobs forced apple 1985 long power struggle company board then-ceo john sculley year jobs took apple members found next computer platform development company specialized computers higher-education business markets addition helped develop visual effects industry funded computer graphics division george lucas lucasfilm 1986 new company pixar produced first 3d computer animated film toy story 1995 apple merged next 1997 jobs became ceo former company within months largely responsible helping revive apple verge bankruptcy worked closely designer jony ive develop line products larger cultural ramifications beginning 1997 think different advertising campaign leading imac itunes itunes store apple store ipod iphone app store ipad 2001 original mac os replaced completely new mac os x based next nextstep platform giving os modern unix-based foundation first time jobs diagnosed pancreatic neuroendocrine tumor 2003 died respiratory arrest related tumor age 56 october 5 2011 steven paul jobs born february 24 1955 abdulfattah jandali joanne schieble adopted paul clara jobs nee hagopian biological father abdulfattah john al- jandali arabic \u0639\u0628\u062f \u0627\u0644\u0641\u062a\u0627\u062d \u0627\u0644\u062c\u0646\u062f\u0644\u064a b 1931 grew homs syria born arab muslim household undergraduate american university beirut lebanon student activist spent time jail political activities pursued phd university wisconsin met joanne carole schieble catholic swiss german descent doctoral candidate jandali teaching assistant course schieble taking although age mona simpson jobs biological sister notes maternal grandparents happy daughter dating muslim walter isaacson steve jobs official biographer additionally states schieble father threatened cut joanne completely continued relationship jobs adoptive father paul reinhold jobs coast guard mechanic leaving coast guard paul jobs married clara hagopian 1946 clara daughter armenian immigrants grew san francisco paul jobs repo man repaired cars attempts start family halted clara ectopic pregnancy leading consider adoption 1955 schieble became pregnant jobs 1954 jandali spent summer family homs syria jandali stated much love joanne ... sadly father tyrant forbade marry syria told wanted give baby adoption according jandali schieble deliberately involve process without telling joanne upped left move san francisco baby without anyone knowing including ... want bring shame onto family thought best everyone schieble gave birth jobs february 24 1955 san francisco chose adoptive couple catholic well-educated wealthy couple changed mind however decided adopt girl instead baby boy placed paul clara jobs neither college education schieble refused sign adoption papers took matter court attempt baby placed different family consented releasing baby paul clara promised would attend college steve jobs high school mother clara admitted girlfriend 17-year-old chrisann brennan frightened love steve first six months life ... scared going take away even case steve difficult child time two felt made mistake wanted return chrisann shared mother comment steve stated already aware would later say deeply loved indulged paul clara many years later steve jobs wife laurene also noted felt really blessed two parents jobs would become upset paul clara referred adoptive parents regarded parents 1,000 regard biological parents jobs referred sperm egg bank harsh way sperm bank thing nothing paul clara adopted jobs sister patricia 1957 family moved mountain view california 1961 time paul built workbench garage son order pass along love mechanics jobs meanwhile admired father craftsmanship knew build anything needed cabinet would build built fence gave hammer could work ... n't fixing cars ... eager hang dad time ten jobs deeply involved electronics befriended many engineers lived neighborhood difficulty making friends children age however seen classmates loner jobs difficulty functioning traditional classroom tended resist authority figures frequently misbehaved suspended times clara taught read toddler jobs stated pretty bored school turned little terror ... seen us third grade basically destroyed teacher frequently played pranks others monta loma elementary school mountain view father paul abused child never reprimanded however instead blamed school placing enough challenge brilliant son jobs would later credit fourth grade teacher imogene teddy hill turning around taught advanced fourth grade class took month get hip situation bribed learning would say really want finish workbook 'll give five bucks finish really kindled passion learning things learned year think learned year school wanted skip next two years grade school go straight junior high learn foreign language parents wisely would n't let happen jobs skipped fifth grade transferred sixth grade crittenden middle school mountain view became socially awkward loner jobs often bullied gave parents ultimatum either take crittenden would drop school though jobs family well used savings 1967 buy new home would allow jobs change schools new house three-bedroom home crist drive los altos california better cupertino school district cupertino california embedded environment even heavily populated engineering families mountain view home house declared historic site 2013 first site apple computer owned patty occupied jobs step-mother marilyn 13 1968 jobs given summer job bill hewlett hewlett-packard jobs cold-called ask parts electronics project n't know ended giving parts got job summer working hewlett-packard line assembling frequency counters ... well assembling may strong putting screws n't matter heaven bill fernandez fellow electronics hobbyist jobs grade cupertino junior high first friend 1967 move fernandez later commented reason kids eighth grade n't like jobs thought odd one friends fernandez eventually introduced jobs 18-year-old electronics whiz homestead high alum steve wozniak lived across street fernandez location los altos home meant jobs would able attend nearby homestead high school strong ties silicon valley began first year late 1968 along fernandez neither jobs fernandez whose father lawyer came engineering households thus decided enroll john mccollum electronics 1 mccollum rebellious jobs grown hair long become involved growing counterculture would eventually clash jobs began lose interest class also interest sports would later say n't took jock always loner underwent change mid-1970 got stoned first time discovered shakespeare dylan thomas classic stuff read moby dick went back junior taking creative writing classes jobs also later noted official biographer started listen music whole lot started read outside science technology\u2014shakespeare plato loved king lear ... senior phenomenal ap english class teacher guy looked like ernest hemingway took bunch us snowshoeing yosemite point jobs developed two different circles friends involved electronics engineering interested art literature dual interests particularly reflected jobs senior year best friends wozniak first girlfriend artistic homestead junior chrisann brennan 1971 wozniak began attending university california berkeley jobs would visit times week experience led study nearby stanford university student union jobs also decided rather join electronics club would put light shows friend homestead avant-garde jazz program described homestead classmate kind brain kind hippie ... never fit either group smart enough nerd n't nerdy intellectual hippies wanted get wasted time kind outsider high school everything revolved around group n't carefully defined group n't anybody individual world individuality suspect senior year late 1971 taking freshman english class stanford working homestead underground film project chrisann brennan mid-1972 graduation leaving reed college jobs brennan rented house roommate al summer brennan jobs steve wozniak found advertisement posted de anza college bulletin board job required people dress characters alice wonderland brennan portrayed alice wozniak jobs al portrayed white rabbit mad hatter later year jobs enrolled reed college portland oregon reed expensive school paul clara could ill afford spending much life savings son higher education brennan remained involved jobs reed also met friend reed daniel kottke first time jobs also became friends reed student body president robert friedland brennan senior homestead plans attend college supportive jobs told planned drop reed want spend parents money neither father jobs adoptive parents gone college jobs continued attend auditing classes included course calligraphy taught robert palladino jobs longer official student brennan stopped visiting jobs later asked come live house rented near reed campus refused started seeing women interested someone met art class brennan speculated house jobs attempt make relationship monogamous 2005 commencement speech stanford university jobs stated period slept floor friends dorm rooms returned coke bottles food money got weekly free meals local hare krishna temple speech jobs said never dropped single calligraphy course college mac would never multiple typefaces proportionally spaced fonts mid-1973 jobs moved back san francisco bay area renting apartment brennan states point relationship complicated could n't break connection could n't commit steve could n't either jobs hitchhiked worked around west coast brennan would occasionally join time brennan notes little little steve separated never able fully let go never talked breaking going separate ways n't conversation one person says continued grow apart jobs would still seek visit working health food store live-in babysitter remained involved continuing see people 1973 steve wozniak designed version classic video game pong finishing wozniak gave board jobs took game atari inc. los gatos california atari thought jobs built gave job technician atari cofounder nolan bushnell later described difficult valuable pointing often smartest guy room would let people know early 1974 jobs living brennan describes simple life los gatos cabin working atari saving money impending trip india brennan visited twice cabin states memoir memories cabin consist jobs reading giving copy listening south indian music using japanese meditation pillow brennan believed distant negative toward brennan states memoir met jobs right left india tried give 100 bill earned atari initially refused accept eventually accepted money jobs traveled india mid-1974 visit neem karoli baba kainchi ashram reed friend eventual apple employee daniel kottke search spiritual enlightenment got neem karoli ashram almost deserted neem karoli baba died september 1973 made long trek dry riverbed ashram haidakhan babaji india spent lot time bus rides delhi uttar pradesh himachal pradesh staying seven months jobs left india returned us ahead daniel kottke jobs changed appearance head shaved wore traditional indian clothing time jobs experimented psychedelics later calling lsd experiences one two three important things done life spent period one farm commune oregon owned robert friedland brennan joined period time period jobs brennan became practitioners zen buddhism zen master k\u014dbun chino otogawa jobs living parents backyard toolshed converted bedroom sleeping bag mat books candle meditation pillow jobs engaged lengthy meditation retreats tassajara zen mountain center oldest s\u014dt\u014d zen monastery us considered taking monastic residence eihei-ji japan maintained lifelong appreciation zen jobs would later say people around share countercultural roots could fully relate thinking jobs returned atari assigned create circuit board arcade video game breakout according bushnell atari offered ttl chip eliminated machine jobs little specialized knowledge circuit board design made deal wozniak split fee evenly wozniak could minimize number chips much amazement atari engineers wozniak reduced ttl count 46 design tight impossible reproduce assembly line according wozniak jobs told atari gave 700 instead 5,000 paid wozniak share thus 350 wozniak learn actual bonus ten years later said jobs told explained needed money wozniak would given wozniak designed low-cost digital blue box generate necessary tones manipulate telephone network allowing free long-distance calls jobs decided could make money selling clandestine sales illegal blue boxes went well perhaps planted seed jobs mind electronics could fun profitable jobs 1994 interview recalled took six months wozniak figure build blue boxes jobs said blue boxes would apple states showed could take large companies beat jobs wozniak attended meetings homebrew computer club 1975 stepping stone development marketing first apple computer 1976 wozniak designed developed apple computer showed jobs suggested sell jobs wozniak ronald wayne founded apple computer called apple inc. garage jobs los altos home crist drive wayne stayed short time leaving jobs wozniak active primary cofounders company two decided name apple jobs returned one farm commune oregon told wozniak time spent farm apple orchard neighbor crist drive recalled jobs odd individual would greet clients underwear hanging barefoot hippie-like another neighbor larry waterland earned phd chemical engineering stanford recalled dismissing jobs budding business 'you punched cards put big deck said mainframe machines time 'steve took garage circuit board chip dumont tv set panasonic cassette tape deck keyboard said 'this apple computer said 'you 've got joking dismissed whole idea jobs friend reed college india daniel kottke recalled early apple employee person worked garage ... woz would show week latest code steve jobs n't get hands dirty sense kottke also stated much early work took place jobs kitchen spent hours phone trying find investors company received funding then-semi-retired intel product marketing manager engineer mike markkula scott mcnealy one cofounders sun microsystems said jobs broke glass age ceiling silicon valley 'd created successful company young age markkula brought apple attention arthur rock looking crowded apple booth home brew computer show started 60,000 investment went apple board returned journey india brennan visited jobs parents home still living period jobs brennan fell love brennan noted changes attributes kobun also still following also time jobs displayed prototype apple computer brennan parents living room brennan notes shift time period two main influences jobs apple kobun early 1977 jobs would spend time together home duveneck ranch los altos served hostel environmental education center brennan also worked teacher inner city children came learn farm 1977 jobs wozniak introduced apple ii west coast computer faire first consumer product sold apple computer one first highly successful mass-produced microcomputer products world designed primarily steve wozniak jobs oversaw development apple ii unusual case rod holt developed unique power supply jobs usually went work wearing black long-sleeved mock turtleneck made issey miyake sometimes reported st. croix brand levi 501 blue jeans new balance 991 sneakers said choice inspired stuart geman noted applied mathematics professor brown university jobs told biographer walter isaacson ... came like idea uniform daily convenience rationale claimed ability convey signature style jobs became successful new company relationship brennan grew complex 1977 success apple part relationship brennan daniel kottke jobs moved house near apple office cupertino brennan eventually took position shipping department apple brennan relationship jobs deteriorating position apple grew began consider ending relationship small changes october 1977 brennan approached rod holt asked take paid apprenticeship designing blueprints apples holt jobs believed would good position given artistic abilities holt particularly eager take position puzzled ambivalence toward brennan decision however overshadowed fact realized pregnant jobs father took days tell jobs whose face according brennan turned ugly news time according brennan beginning third trimester jobs said never wanted ask get abortion n't want also refused discuss pregnancy brennan confused estranged mother afraid discuss matter father also feel comfortable idea abortion chose instead discuss matter kobun encouraged keep baby pledged support meanwhile holt waiting decision internship brennan stated jobs continued encourage take internship stating could pregnant work apple take job n't get problem brennan however notes felt ashamed thought growing belly professional environment apple child unpredictable turn punishing sentimentally ridiculous could endured brennan turned internship decided leave apple stated jobs told give baby adoption sorry never going help alone brennan welfare cleaning houses earn money would sometimes ask jobs money always refused brennan hid pregnancy long could living variety homes continuing work zen meditation time according brennan jobs started seed people notion slept around infertile meant could child weeks due give birth brennan invited deliver baby one farm accepted offer jobs 23 age biological parents brennan gave birth baby lisa brennan may 17 1978 jobs went birth contacted robert friedland mutual friend farm owner distant jobs worked name baby discussed sitting fields blanket brennan suggested name lisa jobs also liked notes jobs attached name lisa also publicly denying paternity would discover later time jobs preparing unveil new kind computer wanted give female name first choice claire st. clare also stated never gave permission use baby name computer hid plans jobs also worked team come phrase local integrated software architecture alternative explanation apple lisa decades later however jobs admitted biographer walter isaacson obviously named daughter brennan would come intense criticism jobs claimed n't want money wants according brennan apple mike scott wanted jobs give money apple executives advised ignore fight tried go paternity settlement jobs denied paternity dna test established lisa father required give brennan 385 month addition returning welfare money received jobs gave 500 month time apple went public jobs became millionaire brennan worked waitress palo alto later brennan agreed give interview michael moritz time magazine time person year special released january 3 1983 discussed relationship jobs rather name jobs person year magazine named computer machine year issue jobs questioned reliability paternity test stated probability paternity jobs steven ... 94.1 jobs responded arguing 28 male population united states could father time also noted baby girl machine apple placed much hope future share name lisa jobs worth 1 million 1978 23 years old grew 250 million time 25 according estimates also one youngest people ever make forbes list nation richest people\u2014and one handful done without inherited wealth 1978 apple recruited mike scott national semiconductor serve ceo turned several turbulent years 1983 jobs lured john sculley away pepsi-cola serve apple ceo asking want spend rest life selling sugared water want chance change world 1982 jobs bought apartment two top floors san remo manhattan building politically progressive reputation although never lived spent years renovating help i. m. pei 2003 sold u2 singer bono 1984 jobs bought jackling house estate resided decade leased several years 2000 stopped maintaining house allowing exposure weather degrade 2004 jobs received permission town woodside demolish house order build smaller contemporary styled one years court house finally demolished 2011 months died early 1984 apple introduced macintosh based lisa xerox parc mouse-driven graphical user interface conceived early apple employee jef raskin following year apple aired super bowl television commercial titled 1984 apple annual shareholders meeting january 24 1984 emotional jobs introduced macintosh wildly enthusiastic audience andy hertzfeld described scene pandemonium though marketed received fanfare expensive macintosh hard sell shortly release 1985 bill gates then-developing company microsoft threatened stop developing mac applications unless granted license mac operating system software microsoft developing graphical user interface ... dos calling windows n't want apple sue similarities windows gui mac interface sculley granted microsoft license later led problems apple addition cheap ibm pc clones ran microsoft software graphical user interface began appear although macintosh preceded clones far expensive late 1980s windows user interface getting better better thus taking increasingly share apple windows-based ibm-pc clones also led development additional guis ibm topview digital research gem thus graphical user interface beginning taken granted undermining apparent advantage mac ... seemed clear 1980s wound apple could n't go alone indefinitely whole ibm-clone market sculley jobs respective visions company greatly differed former favored open architecture computers like apple ii sold education small business home markets less vulnerable ibm jobs wanted company focus closed architecture macintosh business alternative ibm pc president ceo sculley little control chairman board jobs macintosh division apple ii division operated like separate companies duplicating services although products provided 85 percent apple sales early 1985 company january 1985 annual meeting mention apple ii division employees many left including wozniak stated company going wrong direction last five years sold stock macintosh failure defeat pc strengthened sculley position company may 1985 sculley\u2014encouraged arthur rock\u2014decided reorganize apple proposed plan board would remove jobs macintosh group put charge new product development move would effectively render jobs powerless within apple response jobs developed plan get rid sculley take apple however jobs confronted plan leaked said would leave apple board declined resignation asked reconsider sculley also told jobs votes needed go ahead reorganization months later september 17 1985 jobs submitted letter resignation apple board five additional senior apple employees also resigned joined jobs new venture next following resignation apple 1985 jobs founded next inc. 7 million year later running money sought venture capital product horizon eventually jobs attracted attention billionaire ross perot invested heavily company next computer shown world considered jobs comeback event lavish invitation gala launch event described multimedia extravaganza celebration held louise m. davies symphony hall san francisco california wednesday october 12 1988 steve wozniak said 2013 interview jobs next really getting head together next workstations first released 1990 priced like apple lisa next workstation technologically advanced designed education sector largely dismissed cost-prohibitive educational institutions next workstation known technical strengths chief among object-oriented software development system jobs marketed next products financial scientific academic community highlighting innovative experimental new technologies mach kernel digital signal processor chip built-in ethernet port making use next computer english computer scientist tim berners-lee invented world wide web 1990 cern switzerland revised second generation nextcube released 1990 jobs touted first interpersonal computer would replace personal computer innovative nextmail multimedia email system nextcube could share voice image graphics video email first time interpersonal computing going revolutionize human communications groupwork jobs told reporters jobs ran next obsession aesthetic perfection evidenced development attention nextcube magnesium case put considerable strain next hardware division 1993 sold 50,000 machines next transitioned fully software development release nextstep/intel company reported first profit 1.03 million 1994 1996 next software inc. released webobjects framework web application development next acquired apple inc. 1997 webobjects used build run apple store mobileme services itunes store 1986 jobs funded spinout graphics group later renamed pixar lucasfilm computer graphics division price 10 million 5 million given company capital 5 million paid lucasfilm technology rights first film produced pixar disney partnership toy story 1995 jobs credited executive producer brought fame critical acclaim studio released next 15 years pixar creative chief john lasseter company produced box-office hits bug life 1998 toy story 2 1999 monsters inc. 2001 finding nemo 2003 incredibles 2004 cars 2006 ratatouille 2007 wall-e 2008 2009 toy story 3 2010 finding nemo incredibles ratatouille wall-e toy story 3 received academy award best animated feature award introduced 2001 2003 2004 pixar contract disney running jobs disney chief executive michael eisner tried failed negotiate new partnership early 2004 jobs announced pixar would seek new partner distribute films contract disney expired october 2005 bob iger replaced eisner disney iger quickly worked mend relations jobs pixar january 24 2006 jobs iger announced disney agreed purchase pixar all-stock transaction worth 7.4 billion deal closed jobs became walt disney company largest single shareholder approximately seven percent company stock jobs holdings disney far exceeded eisner holds 1.7 disney family member roy e. disney 2009 death held 1 company stock whose criticisms eisner\u2014especially soured disney relationship pixar\u2014accelerated eisner ousting upon completion merger jobs received 7 disney shares joined board directors largest individual shareholder upon jobs death shares disney transferred steven p. jobs trust led laurene jobs floyd norman pixar described jobs mature mellow individual never interfered creative process filmmakers early june 2014 pixar cofounder walt disney animation studios president ed catmull revealed jobs advised explain understand disagreements catmull released book creativity inc. 2014 recounts numerous experiences working jobs regarding manner dealing jobs catmull writes chrisann brennan notes jobs forced apple apologized many times behavior towards lisa also states jobs said never took responsibility sorry time jobs developed strong relationship lisa nine jobs name birth certificate changed lisa brennan lisa brennan-jobs addition jobs brennan developed working relationship co-parent lisa change brennan credits influence newly found biological sister mona simpson worked repair relationship lisa jobs jobs found mona first finding birth mother joanne schieble simpson shortly left apple jobs contact birth family adoptive mother clara lifetime however would later tell official biographer walter isaacson never wanted paul clara feel like n't consider parents totally parents ... loved much never wanted know search even reporters keep quiet found however 1986 31 clara diagnosed lung cancer began spend great deal time learned details background adoption information motivated find biological mother jobs found birth certificate name san francisco doctor schieble turned pregnant although doctor help jobs alive left letter jobs opened upon death died soon afterwards jobs given letter stated mother unmarried graduate student wisconsin named joanne schieble jobs contacted schieble clara died received permission father paul addition respect paul asked media report search jobs stated motivated find birth mother curiosity need see okay thank 'm glad n't end abortion twenty-three went lot schieble emotional first meeting though n't familiar history apple jobs role told pressured signing adoption papers said regretted giving repeatedly apologized jobs schieble would develop friendly relationship throughout rest life would spend christmas together first visit schieble told jobs sister mona aware brother schieble arranged meet new york mona worked first impression jobs totally straightforward lovely normal sweet guy simpson jobs went long walk get know jobs later told biographer mona completely thrilled first life mother emotionally affectionate toward got know became really good friends family n't know 'd without ca n't imagine better sister adopted sister patty never close jobs learned family history six months given adoption schieble father died wed jandali daughter mona jandali states finishing phd returned syria work period schieble left divorced 1962 also states divorce lost contact mona period time also bear responsibility away daughter four years old mother divorced went syria got back touch 10 years lost touch mother moved n't know since 10 years ago 've constant contact see three times year organized trip last year visit syria lebanon went relative florida years later schieble married ice skating teacher george simpson mona jandali took stepfather last name thus became mona simpson 1970 divorced schieble took mona los angeles raised jobs told official biographer meeting simpson wanted become involved ongoing search father found working sacramento decided simpson would meet jandali simpson spoke several hours point told left teaching restaurant business also said schieble given another child away adoption 'll never see baby baby gone simpson mention met jobs jandali told simpson managed mediterranean restaurant near san jose successful technology people used come even steve jobs ... oh yeah used come sweet guy big tipper hearing visit jobs recalled amazing ... restaurant times remember meeting owner syrian balding shook hands however jobs want meet jandali wealthy man n't trust try blackmail go press ... asked mona tell jandali later discovered relationship jobs online blog contacted simpson asked thing steve jobs simpson told true later commented father thoughtful beautiful storyteller passive ... never contacted steve simpson researched syrian roots began meet members family assumed jobs would eventually want meet father never jobs also never showed interest syrian heritage middle east simpson fictionalized search father 1992 novel lost father malek jandali cousin 1989 jobs first met future wife laurene powell gave lecture stanford graduate school business student soon event stated laurene right front row lecture hall could n't take eyes ... kept losing train thought started feeling little giddy lecture jobs met parking lot invited dinner point forward together minor exceptions rest life powell father died young mother raised middle class new jersey home similar one jobs grew received ba university pennsylvania spent short period high finance found n't interest decided pursue mba stanford instead addition unlike jobs athletic followed professional sports also brought much self-sufficiency relationship private public person jobs proposed new year day 1990 fistful freshly picked wildflowers married march 18 1991 buddhist ceremony ahwahnee hotel yosemite national park fifty people including father paul sister mona attended ceremony conducted jobs guru kobun chino otogawa vegan wedding cake shape yosemite half dome wedding ended hike laurene brothers snowball fight jobs reported said mona see mona ... laurene descended joe namath 're descended john muir jobs powell first child reed born september 1991 jobs father paul died year half later march 5 1993 jobs powell two children erin born august 1995 eve born 1998 family lived palo alto california journalist grew locally remembered owning house scariest halloween decorations palo alto ... n't remember seeing busy terrified 1996 apple announced would buy next 427 million deal finalized february 1997 bringing jobs back company cofounded jobs became de facto chief then-ceo gil amelio ousted july 1997 formally named interim chief executive september march 1998 concentrate apple efforts returning profitability jobs terminated number projects newton cyberdog opendoc coming months many employees developed fear encountering jobs riding elevator afraid might job doors opened reality jobs summary executions rare handful victims enough terrorize whole company jobs changed licensing program macintosh clones making costly manufacturers continue making machines purchase next much company technology found way apple products notably nextstep evolved mac os x jobs guidance company increased sales significantly introduction imac new products since appealing designs powerful branding worked well apple 2000 macworld expo jobs officially dropped interim modifier title apple became permanent ceo jobs quipped time would using title iceo company subsequently branched introducing improving upon digital appliances introduction ipod portable music player itunes digital music software itunes store company made forays consumer electronics music distribution june 29 2007 apple entered cellular phone business introduction iphone multi-touch display cell phone also included features ipod mobile browser revolutionized mobile browsing scene nurturing open-ended innovation jobs also reminded employees real artists ship jobs public war words dell computer ceo michael dell starting 1987 jobs first criticized dell making un-innovative beige boxes october 6 1997 gartner symposium dell asked would ran then-troubled apple computer company said 'd shut give money back shareholders 2006 jobs sent email employees apple market capitalization rose dell jobs admired criticized consummate skill persuasion salesmanship dubbed reality distortion field particularly evident keynote speeches colloquially known stevenotes macworld expos apple worldwide developers conferences jobs board member gap inc. 1999 2002 2001 jobs granted stock options amount 7.5 million shares apple exercise price 18.30 alleged options backdated exercise price 21.10 alleged jobs thereby incurred taxable income 20,000,000 report apple overstated earnings amount result jobs potentially faced number criminal charges civil penalties case subject active criminal civil government investigations though independent internal apple investigation completed december 29 2006 found jobs unaware issues options granted returned without exercised 2003 2005 jobs responded criticism apple poor recycling programs e-waste us lashing environmental advocates apple annual meeting cupertino april weeks later apple announced would take back ipods free retail stores computer takeback campaign responded flying banner plane stanford university graduation jobs commencement speaker banner read steve n't mini-player\u2014recycle e-waste 2006 expanded apple recycling programs us customer buys new mac program includes shipping environmentally friendly disposal old systems success apple unique products services provided several years stable financial returns propelling apple become world valuable publicly traded company 2011 jobs perceived demanding perfectionist always aspired position businesses products forefront information technology industry foreseeing setting innovation style trends summed self-concept end keynote speech macworld conference expo january 2007 quoting ice hockey player wayne gretzky july 1 2008 billion class action suit filed several members apple board directors revenue lost alleged securities fraud 2011 interview biographer walter isaacson jobs revealed met us president barack obama complained nation shortage software engineers told obama headed one-term presidency jobs proposed foreign student got engineering degree us university automatically offered green card meeting jobs commented president smart kept explaining us reasons things ca n't get done infuriates october 2003 jobs diagnosed cancer mid-2004 announced employees cancerous tumor pancreas prognosis pancreatic cancer usually poor jobs stated rare much less aggressive type known islet cell neuroendocrine tumor despite diagnosis jobs resisted doctors recommendations medical intervention nine months instead relying alternative medicine thwart disease according harvard researcher ramzi amri choice alternative treatment led unnecessarily early death doctors agree jobs diet insufficient address disease however cancer researcher alternative medicine critic david gorski wrote impossible know whether much might decreased chances surviving cancer flirtation woo best guess jobs probably modestly decreased chances survival barrie r. cassileth chief memorial sloan kettering cancer center integrative medicine department said jobs faith alternative medicine likely cost life ... kind pancreatic cancer treatable curable ... essentially committed suicide according jobs biographer walter isaacson nine months refused undergo surgery pancreatic cancer \u2013 decision later regretted health declined instead tried vegan diet acupuncture herbal remedies treatments found online even consulted psychic also influenced doctor ran clinic advised juice fasts bowel cleansings unproven approaches finally surgery july 2004 eventually underwent pancreaticoduodenectomy whipple procedure july 2004 appeared remove tumor successfully jobs receive chemotherapy radiation therapy jobs absence tim cook head worldwide sales operations apple ran company early august 2006 jobs delivered keynote apple annual worldwide developers conference thin almost gaunt appearance unusually listless delivery together choice delegate significant portions keynote presenters inspired flurry media internet speculation state health contrast according ars technica journal report worldwide developers conference wwdc attendees saw jobs person said looked fine following keynote apple spokesperson said steve health robust two years later similar concerns followed jobs 2008 wwdc keynote address apple officials stated jobs victim common bug taking antibiotics others surmised cachectic appearance due whipple procedure july conference call discussing apple earnings participants responded repeated questions jobs health insisting private matter others said shareholders right know given jobs hands-on approach running company based off-the-record phone conversation jobs new york times reported health problems amounted good deal common bug n't life-threatening n't recurrence cancer august 28 2008 bloomberg mistakenly published 2500-word obituary jobs corporate news service containing blank spaces age cause death news carriers customarily stockpile up-to-date obituaries facilitate news delivery event well-known figure death although error promptly rectified many news carriers blogs reported intensifying rumors concerning jobs health jobs responded apple september 2008 let rock keynote paraphrasing mark twain reports death greatly exaggerated subsequent media event jobs concluded presentation slide reading 110/70 referring blood pressure stating would address questions health december 16 2008 apple announced marketing vice-president phil schiller would deliver company final keynote address macworld conference expo 2009 reviving questions jobs health statement given january 5 2009 apple.com jobs said suffering hormone imbalance several months january 14 2009 jobs wrote internal apple memo previous week learned health-related issues complex originally thought announced six-month leave absence end june 2009 allow better focus health tim cook previously acted ceo jobs 2004 absence became acting ceo apple jobs still involved major strategic decisions 2009 tim cook offered portion liver jobs since share rare blood type donor liver regenerate tissue operation jobs yelled 'll never let 'll never april 2009 jobs underwent liver transplant methodist university hospital transplant institute memphis tennessee jobs prognosis described excellent january 17 2011 year half jobs returned work following liver transplant apple announced granted medical leave absence jobs announced leave letter employees stating decision made could focus health time 2009 medical leave apple announced tim cook would run day-to-day operations jobs would continue involved major strategic decisions company leave jobs appeared ipad 2 launch event march 2 wwdc keynote introducing icloud june 6 cupertino city council june 7 august 24 2011 jobs announced resignation apple ceo writing board always said ever came day could longer meet duties expectations apple ceo would first let know unfortunately day come jobs became chairman board named tim cook successor ceo jobs continued work apple day death six weeks later jobs died palo alto california home around 3 p.m. pdt october 5 2011 due complications relapse previously treated islet-cell pancreatic neuroendocrine tumor resulted respiratory arrest lost consciousness day died wife children sisters side sister mona simpson described death thus steve final words hours earlier monosyllables repeated three times embarking 'd looked sister patty long time children life partner laurene shoulders past steve final words 'oh wow oh wow oh wow lost consciousness died several hours later small private funeral held october 7 2011 details respect jobs family made public apple pixar issued announcements death apple announced day plans public service encouraging well-wishers send remembrance messages email address created receive messages apple microsoft flew flags half-staff throughout respective headquarters campuses bob iger ordered disney properties including walt disney world disneyland fly flags half-staff october 6 12 2011 two weeks following death apple displayed corporate web site simple page showed jobs name lifespan next grayscale portrait october 19 2011 apple employees held private memorial service jobs apple campus cupertino jobs widow laurene attendance well cook bill campbell norah jones al gore coldplay apple retail stores closed briefly employees could attend memorial video service uploaded apple website california governor jerry brown declared sunday october 16 2011 steve jobs day day invitation-only memorial held stanford university attendance included apple tech company executives members media celebrities close friends jobs politicians along jobs family bono yo yo joan baez performed service lasted longer hour service highly secured guards university gates helicopter flying overhead area news station attendee given small brown box farewell gift jobs box contained copy autobiography yogi paramahansa yogananda apple co-founder steve wozniak former owner would become pixar george lucas ref name= http //postcards.blogs.fortune.cnn.com/2011/10/06/george-lucas-steve-jobs/ /ref former rival microsoft co-founder bill gates president barack obama offered statements response death jobs buried unmarked grave alta mesa memorial park nonsectarian cemetery palo alto steve jobs subject number books films lisa brennan-jobs jobs eldest daughter described jobs memoir sexually inappropriate described patterns cruel behavior adolescent years jobs design aesthetic influenced philosophies zen buddhism india experienced buddhism seven-month spiritual journey sense intuition influenced spiritual people studied also learned many references sources modernist architectural style joseph eichler industrial designs richard sapper dieter rams according apple cofounder steve wozniak steve n't ever code n't engineer n't original design ... daniel kottke one apple earliest employees college friend jobs stated woz jobs woz innovator inventor steve jobs marketing person listed either primary inventor co-inventor 346 united states patents patent applications related range technologies actual computer portable devices user interfaces including touch-based speakers keyboards power adapters staircases clasps sleeves lanyards packages jobs contributions patents look feel product industrial design chief jonathan ive name along 200 patents design patents specific product designs example jobs listed primary inventor patents original lamp-style imacs well powerbook g4 titanium opposed utility patents inventions 43 issued us patents inventions patent mac os x dock user interface magnification feature issued day died although jobs little involvement engineering technical side original apple computers jobs later used ceo position directly involve product design involved many projects throughout career long-time marketing executive confidant joanna hoffman known one employees apple next could successfully stand jobs also engaging even terminally ill hospital jobs sketched new devices would hold ipad hospital bed also despised oxygen monitor finger suggested ways revise design simplicity since death former apple ceo 141 patents inventors win lifetimes currently jobs holds 450 patents apple ii 8-bit home computer one world first highly successful mass-produced microcomputer products designed primarily steve wozniak jobs oversaw development apple ii unusual case rod holt developed unique power supply introduced 1977 west coast computer faire jobs wozniak first consumer product sold apple computer lisa personal computer designed apple early 1980s first personal computer offer graphical user interface machine aimed individual business users development lisa began 1978 lisa sold poorly 100,000 units sold 1982 jobs forced lisa project joined macintosh project macintosh direct descendant lisa although obvious similarities systems final revision lisa 2/10 modified sold macintosh xl joined original macintosh team jobs took project wozniak experienced traumatic airplane accident temporarily left company jobs introduced macintosh computer january 24 1984 first mass-market personal computer featuring integral graphical user interface mouse first model later renamed macintosh 128k uniqueness amongst populous family subsequently updated models also based apple proprietary architecture since 1998 apple largely phased macintosh name favor mac though product family nicknamed mac mac since development first model macintosh introduced us 1.5 million ridley scott television commercial 1984 notably aired third quarter super bowl xviii january 22 1984 people consider ad watershed event masterpiece regis mckenna called ad successful mac 1984 uses unnamed heroine represent coming macintosh indicated picasso-style picture computer white tank top means saving humanity conformity ibm attempts dominate computer industry ad alludes george orwell novel nineteen eighty-four describes dystopian future ruled televised big brother macintosh however expensive hindered ability competitive market already dominated commodore 64 consumers well ibm personal computer accompanying clone market businesses macintosh systems still found success education desktop publishing kept apple second-largest pc manufacturer next decade jobs forced apple 1985 started company built workstation computers next computer introduced 1988 lavish launch event tim berners-lee created world first web browser worldwideweb using next computer next computer operating system named nextstep basis darwin kernel operating system apple products namely macos ios watchos audioos apple imac introduced 1998 innovative design directly result jobs return apple apple boasted back computer looks better front anyone else described cartoonlike first imac clad bondi blue plastic unlike personal computer came 1999 apple introduced graphite gray apple imac since varied shape colour size considerably maintaining all-in-one design design ideas intended create connection user handle breathing light effect computer went sleep apple imac sold 1,299 time imac also featured forward-thinking changes eschewing floppy disk drive moving exclusively usb connecting peripherals latter change resulted imac success interface popularised among third-party peripheral makers\u2014as evidenced fact many early usb peripherals made translucent plastic match imac design itunes media player media library online radio broadcaster mobile device management application developed apple used play download organize digital audio video well types media available itunes store personal computers running macos microsoft windows operating systems itunes store also available ipod touch iphone ipad itunes store users purchase download music music videos television shows audiobooks podcasts movies movie rentals countries ringtones available iphone ipod touch fourth generation onward application software iphone ipad ipod touch downloaded app store first generation ipod released october 23 2001 major innovation ipod small size achieved using 1.8 hard drive compared 2.5 drives common players time capacity first generation ipod ranged 5 gb 10 gb ipod sold us 399 100,000 ipods sold end 2001 introduction ipod resulted apple becoming major player music industry also ipod success prepared way itunes music store iphone 1st generation ipod apple released hard drive-based ipod classic touchscreen ipod touch video-capable ipod nano screenless ipod shuffle following years apple began work first iphone 2005 first iphone released june 29 2007 iphone created sensation survey indicated six ten americans aware release time declared invention year 2007 completed iphone multimedia capabilities functioned quad-band touch screen smartphone year later iphone 3g released july 2008 three key features support gps 3g data tri-band umts/hsdpa june 2009 iphone 3gs whose improvements included voice control better camera faster processor introduced phil schiller iphone 4 thinner previous models five megapixel camera capable recording video 720p hd adds secondary front-facing camera video calls major feature iphone 4s introduced october 2011 siri virtual assistant capable voice recognition ipad ios-based line tablet computers designed marketed apple first ipad released april 3 2010 recent ipad models ipad 2017 ipad pro ipad mini 4 released september 9 2015 march 24 2017 user interface built around device multi-touch screen including virtual keyboard ipad includes built-in wi-fi cellular connectivity select models 250 million ipads sold", + "neighbors": [ + 14, + 33, + 71, + 75, + 87, + 99, + 121, + 130, + 214, + 228, + 269, + 345, + 356, + 395, + 403, + 477, + 502, + 511, + 551, + 596, + 610, + 625, + 634, + 696, + 754, + 755, + 797, + 810, + 824, + 858, + 868, + 877, + 917, + 927, + 945, + 956, + 961, + 1100, + 1138, + 1140, + 1178, + 1189, + 1233, + 1237, + 1262, + 1292, + 1294, + 1305, + 1334, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 346, + "label": 2, + "text": "Network_scheduler:network scheduler network scheduler also called packet scheduler queueing discipline qdisc queueing algorithm arbiter node packet switching communication network manages sequence network packets transmit receive queues network interface controller several network schedulers available different operating systems implement many existing network scheduling algorithms network scheduler logic decides network packet forward next network scheduler associated queuing system storing network packets temporarily transmitted systems may single multiple queues case may hold packets one flow classification priority cases may possible schedule transmissions within constraints system cases network scheduler responsible deciding traffic forward gets dropped course time many network queueing disciplines developed provides specific reordering dropping network packets inside various transmit receive buffers queuing disciplines commonly used attempts compensate various networking conditions like reducing latency certain classes network packets generally used part quality service qos measures examples algorithms suitable managing network traffic include several implemented linux kernel modules freely available bufferbloat phenomenon packet-switched networks excess buffering packets causes high latency packet delay variation bufferbloat addressed network scheduler strategically discards packets avoid unnecessarily high buffering backlog examples include codel random early detection network scheduler may responsibility implementation specific network traffic control initiatives network traffic control umbrella term measures aimed reducing congest latency packet loss specifically active queue management aqm selective dropping queued network packets achieve larger goal preventing excessive network congestion scheduler must choose packets drop traffic shaping smooths bandwidth requirements traffic flows delaying transmission packets queued bursts scheduler decides timing transmitted packets quality service prioritization traffic based service class differentiated services reserved connection integrated services linux kernel packet scheduler integral part linux kernel network stack manages transmit receive ring buffers nics working layer 2 osi model handling ethernet frames example packet scheduler configured using utility called codice_1 short traffic control default queuing discipline packet scheduler uses fifo implementation called pfifo_fast although systemd since version 217 changes default queuing discipline fq_codel codice_2 codice_3 utilities enable system administrators configure buffer sizes codice_4 codice_5 device separately terms number ethernet frames regardless size linux kernel network stack contains several buffers managed network scheduler berkeley packet filter filters attached packet scheduler classifiers ebpf functionality brought version 4.1 linux kernel 2015 extends classic bpf programmable classifiers ebpf compiled using llvm ebpf backend loaded running kernel using codice_1 utility altq implementation network scheduler bsds openbsd version 5.5 altq replaced hfsc scheduler", + "neighbors": [ + 14, + 123, + 149, + 219, + 227, + 265, + 272, + 282, + 294, + 305, + 379, + 400, + 401, + 412, + 429, + 571, + 630, + 650, + 688, + 720, + 736, + 739, + 789, + 834, + 897, + 935, + 986, + 1060, + 1096, + 1105, + 1116, + 1138, + 1159, + 1197, + 1208, + 1241, + 1252, + 1301, + 1324, + 1357, + 1360, + 1368, + 1372, + 1391, + 1398, + 1456, + 1468, + 1503, + 1526, + 1549, + 1602, + 1608, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 347, + "label": 2, + "text": "Garbage_collection_(computer_science):garbage collection computer science computer science garbage collection gc form automatic memory management garbage collector collector attempts reclaim garbage memory occupied objects longer use program garbage collection invented john mccarthy around 1959 simplify manual memory management lisp garbage collection essentially opposite manual memory management requires programmer specify objects deallocate return memory system however many systems use combination approaches including techniques stack allocation region inference like memory management techniques garbage collection may take significant proportion total processing time program result significant influence performance good implementations enough memory depending application garbage collection faster manual memory management opposite also true often case past sub-optimal gc algorithms resources memory network sockets database handles user interaction windows file device descriptors typically handled garbage collection methods used manage resources particularly destructors may suffice manage memory well leaving need gc gc systems allow resources associated region memory collected causes resource reclaimed called finalization finalization may introduce complications limiting usability intolerable latency disuse reclaim especially limited resources lack control thread performs work reclaiming basic principles garbage collection find data objects program accessed future reclaim resources used objects many programming languages require garbage collection either part language specification example java c go scripting languages effectively practical implementation example formal languages like lambda calculus said garbage collected languages languages designed use manual memory management garbage-collected implementations available example c c++ languages like ada modula-3 c++/cli allow garbage collection manual memory management co-exist application using separate heaps collected manually managed objects others like garbage-collected allow user manually delete objects also entirely disable garbage collection speed required integrating garbage collection language compiler runtime system enables much wider choice methods post-hoc gc systems exist automatic reference counting arc including require recompilation post-hoc gc sometimes distinguished litter collection garbage collector almost always closely integrated memory allocator garbage collection frees programmer manually dealing memory deallocation result certain categories bugs eliminated substantially reduced bugs addressed garbage collection security implications typically garbage collection certain disadvantages including consuming additional resources performance impacts possible stalls program execution incompatibility manual resource management garbage collection consumes computing resources deciding memory free even though programmer may already known information penalty convenience annotating object lifetime manually source code overhead lead decreased uneven performance peer-reviewed paper came conclusion gc needs five times memory compensate overhead perform fast explicit memory management interaction memory hierarchy effects make overhead intolerable circumstances hard predict detect routine testing impact performance also given apple reason adopting garbage collection ios despite desired feature moment garbage actually collected unpredictable resulting stalls pauses shift/free memory scattered throughout session unpredictable stalls unacceptable real-time environments transaction processing interactive programs incremental concurrent real-time garbage collectors address problems varying trade-offs modern gc implementations try minimize blocking stop-the-world stalls much work possible background i.e separate thread example marking unreachable garbage instances application process continues run spite advancements example .net clr paradigm still difficult maintain large heaps millions objects resident objects get promoted older generations without incurring noticeable delays sometimes seconds need explicit manual resource management release/close non-gced resources object oriented language becomes transitive composition non-deterministic gc system resource resource-like object requires manual resource management release/close object used part another object composed object also become resource-like object requires manual resource management release/close tracing garbage collection common type garbage collection much garbage collection often refers tracing garbage collection rather methods reference counting overall strategy consists determining objects garbage collected tracing objects reachable chain references certain root objects considering rest garbage collecting however large number algorithms used implementation widely varying complexity performance characteristics reference counting garbage collection object count number references garbage identified reference count zero object reference count incremented reference created decremented reference destroyed count reaches zero object memory reclaimed manual memory management unlike tracing garbage collection reference counting guarantees objects destroyed soon last reference destroyed usually accesses memory either cpu caches objects freed directly pointed thus tends significant negative side effects cpu cache virtual memory operation number disadvantages reference counting generally solved mitigated sophisticated algorithms escape analysis compile-time technique convert heap allocations stack allocations thereby reducing amount garbage collection done analysis determines whether object allocated inside function accessible outside function-local allocation found accessible another function thread allocation said \u201c escape \u201d done stack otherwise object may allocated directly stack released function returns bypassing heap associated memory management costs generally speaking higher-level programming languages likely garbage collection standard feature languages built garbage collection added library boehm garbage collector c c++ functional programming languages ml haskell apl garbage collection built lisp especially notable first functional programming language first language introduce garbage collection dynamic languages ruby julia perl 5 php version 5.3 use reference counting javascript ecmascript also tend use gc object-oriented programming languages smalltalk java usually provide integrated garbage collection notable exceptions c++ delphi destructors historically languages intended beginners basic logo often used garbage collection heap-allocated variable-length data types strings lists burden programmers manual memory management early microcomputers limited memory slow processors basic garbage collection could often cause apparently random inexplicable pauses midst program operation basic interpreters applesoft basic apple ii family repeatedly scanned string descriptors string highest address order compact toward high memory resulting n performance could introduce minutes-long pauses execution string-intensive programs replacement garbage collector applesoft basic published call-a.p.p.l.e january 1981 pages 40\u201345 randy wigginton identified group strings every pass heap cut collection time dramatically basic.system released prodos 1983 provided windowing garbage collector basic reduced collections fraction second objective-c traditionally garbage collection release os x 10.5 2007 apple introduced garbage collection objective-c 2.0 using in-house developed runtime collector however 2012 release os x 10.8 garbage collection deprecated favor llvm automatic reference counter arc introduced os x 10.7 furthermore since may 2015 apple even forbids usage garbage collection new os x applications app store ios garbage collection never introduced due problems application responsivity performance instead ios uses arc garbage collection rarely used embedded real-time systems perceived need tight control use limited resources however garbage collectors compatible limited environments developed microsoft .net micro framework .net nanoframework java platform micro edition embedded software platforms like larger cousins include garbage collection among popular garbage collectors jdk could named commonly people compare garbage collectors terms ram consumption optimization receive different results compile-time garbage collection form static analysis allowing memory reused reclaimed based invariants known compilation form garbage collection studied mercury programming language saw greater usage introduction llvm automatic reference counter arc apple ecosystem ios os x 2011 incremental concurrent real-time garbage collectors developed baker algorithm lieberman algorithm baker algorithm allocation done either half single region memory becomes half full garbage collection performed moves live objects half remaining objects implicitly deallocated running program 'mutator check object references correct half move across background task finding objects generational garbage collection schemes based empirical observation objects die young generational garbage collection two allocation regions generations kept kept separate based object age new objects created young generation regularly collected generation full objects still referenced older regions copied next oldest generation occasionally full scan performed high-level language computer architectures include hardware support real-time garbage collection implementations real-time garbage collectors use tracing real-time garbage collectors meet hard real-time constraints used real-time operating system", + "neighbors": [ + 27, + 29, + 46, + 65, + 78, + 81, + 176, + 185, + 194, + 216, + 225, + 251, + 265, + 292, + 301, + 306, + 308, + 313, + 332, + 365, + 373, + 378, + 387, + 391, + 392, + 446, + 447, + 503, + 506, + 509, + 520, + 521, + 536, + 538, + 565, + 567, + 649, + 653, + 682, + 753, + 787, + 789, + 804, + 820, + 837, + 869, + 884, + 919, + 929, + 934, + 947, + 948, + 978, + 987, + 996, + 1021, + 1084, + 1118, + 1119, + 1120, + 1123, + 1149, + 1173, + 1183, + 1207, + 1221, + 1225, + 1227, + 1233, + 1235, + 1245, + 1251, + 1264, + 1277, + 1292, + 1298, + 1302, + 1311, + 1315, + 1319, + 1375, + 1389, + 1413, + 1430, + 1466, + 1491, + 1508, + 1516, + 1566, + 1588, + 1609, + 1616, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 348, + "label": 1, + "text": "Watercraft:watercraft watercraft also known marine vessels waterborne vessels vehicles used water including ships boats hovercraft submarines watercraft usually propulsive capability whether sail oar paddle engine hence distinct simple device merely floats log raft watercraft would described either ship boat however numerous craft many people would consider neither ship boat surfboards used paddle board underwater robots seaplanes torpedoes although ships typically larger boats distinction two categories one size per se term watercraft unlike terms aircraft spacecraft rarely used describe individual object rather term serves unify category ranges jet skis aircraft carriers vessel may used saltwater freshwater pleasure recreation physical exercise commerce transport military missions usually purposes behind watercraft designs skills seafaring education leisure activities fishing resource extraction transportation cargo passengers conducting combat salvage operations general purpose water vehicle identifies utility maritime industry sub-sector design water vehicle created usually seeks achieve balance internal capacity tonnage speed seaworthiness tonnage predominantly consideration transport operations speed important warships safety primary consideration less experienced often smaller less stable training leisure vehicles due great level regulatory compliance required larger watercraft ensures infrequent instances foundering sea application extensive computer modeling ship model basin testing shipyard construction begins historically water vehicles propelled people poles paddles oars manipulation sails propel wind pressure and/or lift variety engineered machinery create subsurface thrust process internal combustion electricity technological history watercraft european history divided reference marine propulsion simple paddle craft oared galleys 8th century bce 15th century lateen sail age discovery early 15th century early 17th century full rigged ships age sail 16th mid 19th century age steam reciprocating marine steam engine roughly 1770 1914 steam turbine later gas turbine internal combustion engines using diesel fuel petrol lng fuels turn 20th century supplemented degree nuclear marine propulsion since 1950s naval watercraft current technological development seeks identify cheaper renewable less polluting sources propulsion watercraft shapes sizes secondary applications technology watercraft used structural materials navigation aids case warships weapon systems purpose usage physical environment define materials used construction historically included grasses leather timbers metals combined timber without silicate plastic derivatives others watercraft registration registration watercraft government authority united states consists alphanumeric string called vessel registration number issued state department motor vehicles navigation aids varied time astronomical observation mechanical mechanisms recently analogue digital computer devices rely gps systems naval weapon systems closely followed development land weapons developing development steam propulsion coupled rapid-firing breech-loading guns naval combat often concluded boarding combat opposing crews since early 20th century substantial development technologies allow force projection naval task force land objective using marine infantry", + "neighbors": [ + 115 + ], + "mask": "Test" + }, + { + "node_id": 349, + "label": 6, + "text": "Clustered_file_system:clustered file system clustered file system file system shared simultaneously mounted multiple servers several approaches clustering employ clustered file system direct attached storage node clustered file systems provide features like location-independent addressing redundancy improve reliability reduce complexity parts cluster parallel file systems type clustered file system spread data across multiple storage nodes usually redundancy performance shared-disk file system uses storage area network san allow multiple computers gain direct disk access block level access control translation file-level operations applications use block-level operations used san must take place client node common type clustered file system shared-disk file system \u2014by adding mechanisms concurrency control\u2014provides consistent serializable view file system avoiding corruption unintended data loss even multiple clients try access files time shared-disk file-systems commonly employ sort fencing mechanism prevent data corruption case node failures unfenced device cause data corruption loses communication sister nodes tries access information nodes accessing underlying storage area network may use number block-level protocols including scsi iscsi hyperscsi ata ethernet aoe fibre channel network block device infiniband different architectural approaches shared-disk filesystem distribute file information across servers cluster fully distributed others utilize centralized metadata server achieve result enabling servers access data shared storage device distributed file systems share block level access storage use network protocol commonly known network file systems even though file systems use network send data distributed file systems restrict access file system depending access lists capabilities servers clients depending protocol designed difference distributed file system distributed data store distributed file system allows files accessed using interfaces semantics local files example mounting/unmounting listing directories read/write byte boundaries system native permission model distributed data stores contrast require using different api library different semantics often database distributed file system may also created software implementing ibm distributed data management architecture ddm programs running one computer use local interfaces semantics create manage access files located networked computers client requests trapped converted equivalent messages defined ddm using protocols also defined ddm messages transmitted specified remote computer ddm server program interprets messages uses file system interfaces computer locate interact specified file distributed file systems may aim transparency number aspects aim invisible client programs see system similar local file system behind scenes distributed file system handles locating files transporting data potentially providing features listed incompatible timesharing system used virtual devices transparent inter-machine file system access 1960s file servers developed 1970s 1976 digital equipment corporation created file access listener fal implementation data access protocol part decnet phase ii became first widely used network file system 1985 sun microsystems created file system called network file system nfs became first widely used internet protocol based network file system notable network file systems andrew file system afs apple filing protocol afp netware core protocol ncp server message block smb also known common internet file system cifs 1986 ibm announced client server support distributed data management architecture ddm system/36 system/38 ibm mainframe computers running cics followed support ibm personal computer as/400 ibm mainframe computers mvs vse operating systems flexos ddm also became foundation distributed relational database architecture also known drda many peer-to-peer network protocols open-source distributed file systems cloud closed-source clustered file systems e. g. 9p afs coda cifs/smb dce/dfs lustre panfs google file system mnet chord project network-attached storage nas provides storage file system like shared disk file system top storage area network san nas typically uses file-based protocols opposed block-based protocols san would use nfs popular unix systems smb/cifs server message block/common internet file system used ms windows systems afp used apple macintosh computers ncp used oes novell netware failure disk hardware given storage node cluster create single point failure result data loss unavailability fault tolerance high availability provided data replication one sort another data remains intact available despite failure single piece equipment examples see lists distributed fault-tolerant file systems distributed parallel fault-tolerant file systems common performance measurement clustered file system amount time needed satisfy service requests conventional systems time consists disk-access time small amount cpu-processing time clustered file system remote access additional overhead due distributed structure includes time deliver request server time deliver response client direction cpu overhead running communication protocol software concurrency control becomes issue one person client accessing file block want update hence updates file one client interfere access updates clients problem complex file systems due concurrent overlapping writes different writers write overlapping regions file concurrently problem usually handled concurrency control locking may either built file system provided add-on protocol ibm mainframes 1970s could share physical disks file systems machine channel connection drives control units 1980s digital equipment corporation tops-20 openvms clusters vax/alpha/ia64 included shared disk file systems", + "neighbors": [ + 34, + 37, + 40, + 55, + 63, + 170, + 222, + 233, + 270, + 278, + 295, + 326, + 334, + 349, + 358, + 401, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 735, + 771, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 968, + 982, + 997, + 1056, + 1064, + 1090, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1421, + 1445, + 1459, + 1565, + 1629, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 350, + "label": 1, + "text": "Relational_data_stream_management_system:relational data stream management system relational data stream management system rdsms distributed in-memory data stream management system dsms designed use standards-compliant sql queries process unstructured structured data streams real-time unlike sql queries executed traditional rdbms return result exit sql queries executed rdsms exit generating results continuously new data become available continuous sql queries rdsms use sql window function analyze join aggregate data streams fixed sliding windows windows specified time-based row-based continuous sql queries rdsms conform ansi sql standards common rdsms sql query performed declarative codice_1 statement continuous sql codice_1 operates data across one data streams optional keywords clauses include codice_3 optional codice_4 subclause specify rules joining multiple data streams codice_5 clause comparison predicate restrict records returned query codice_6 project streams common values smaller set codice_7 filter records resulting codice_6 codice_9 sort results following example continuous data stream aggregation using codice_1 query aggregates sensor stream weather monitoring station codice_1query aggregates minimum maximum average temperature values one-second time period returning continuous stream aggregated results one second intervals rdsms sql queries also operate data streams time row-based windows following example shows second continuous sql query using codice_12 clause one-second duration codice_12 clause changes behavior query output result new record arrives hence output stream incrementally updated results zero result latency", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 351, + "label": 2, + "text": "DeLi_Linux:deli linux desktop light linux deli linux short desktop linux distribution old pcs version 0.6.1 deli linux based slackware 7 using linux 2.2 deli linux version 0.7 development scratch linux 2.4.33.3 longer based slackware os still used slackware package management additionally new port system based crux deli linux based uclibc instead gnu c library port openbsd korn shell used default shell version 0.8 introduced pacman package manager 0.8 series focus internationalisation version 0.8.0 also switched web browser netsurf skipstone previously konqueror embedded dillo deli linux pre-packaged abiword siag office office suites web browser netsurf skipstone included email clients mutt sylpheed window managers icewm fluxbox included editing deli linux offers e3 elvis beaver since deli linux ships lightweight software many popular open source packages included gnome kde emacs mozilla thunderbird deli linux needs 386 32 mb ram minimum however linux swap partition needs selected setup run deli less 48 mb ram work smoothly 486 full installation packages requires nearly 750 mb hard disk space august 2010 developers announced deli linux discontinued instead two successor projects connochaetos deli cate connochaetos created 2010 arch linux derivative targeting i586 pentium 1 later processors time arch required least i686 trying follow gnu free system distribution guidelines fsdg discontinued july 2013 due maintainer lack time project financial situation project failure get endorsement free software foundation fsdg-compliant however june 2015 development connochaetos resumed longer derivative arch linux derivative slackware salix os another project deli cate runs 386 486 pentium-class machines", + "neighbors": [ + 113, + 134, + 275, + 301, + 357, + 393, + 404, + 431, + 695, + 716, + 754, + 897, + 974, + 1046, + 1049, + 1055, + 1126, + 1167, + 1276, + 1286, + 1369, + 1458, + 1539, + 1601, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 352, + "label": 3, + "text": "Cache_(computing):cache computing computing cache aue hardware software component stores data future requests data served faster data stored cache might result earlier computation copy data stored elsewhere cache hit occurs requested data found cache cache miss occurs cache hits served reading data cache faster recomputing result reading slower data store thus requests served cache faster system performs cost-effective enable efficient use data caches must relatively small nevertheless caches proven many areas computing typical computer applications access data high degree locality reference access patterns exhibit temporal locality data requested recently requested already spatial locality data requested stored physically close data already requested inherent trade-off size speed given larger resource implies greater physical distances also tradeoff expensive premium technologies sram vs cheaper easily mass-produced commodities dram hard disks buffering provided cache benefits bandwidth latency larger resource incurs significant latency access e.g take hundreds clock cycles modern 4 ghz processor reach dram mitigated reading large chunks hope subsequent reads nearby locations prediction explicit prefetching might also guess future reads come make requests ahead time done correctly latency bypassed altogether use cache also allows higher throughput underlying resource assembling multiple fine grain transfers larger efficient requests case dram circuits might served wider data bus example consider program accessing bytes 32-bit address space served 128-bit off-chip data bus individual uncached byte accesses would allow 1/16th total bandwidth used 80 data movement would memory addresses instead data reading larger chunks reduces fraction bandwidth required transmitting address information hardware implements cache block memory temporary storage data likely used central processing units cpus hard disk drives hdds frequently use cache web browsers web servers cache made pool entries entry associated data copy data backing store entry also tag specifies identity data backing store entry copy cache client cpu web browser operating system needs access data presumed exist backing store first checks cache entry found tag matching desired data data entry used instead situation known cache hit example web browser program might check local cache disk see local copy contents web page particular url example url tag content web page data percentage accesses result cache hits known hit rate hit ratio cache alternative situation cache checked found contain entry desired tag known cache miss requires expensive access data backing store requested data retrieved typically copied cache ready next access cache miss previously existing cache entry removed order make room newly retrieved data heuristic used select entry replace known replacement policy one popular replacement policy least recently used lru replaces oldest entry entry accessed less recently entry see cache algorithm efficient caching algorithms compute use-hit frequency size stored contents well latencies throughputs cache backing store works well larger amounts data longer latencies slower throughputs experienced hard drives networks efficient use within cpu cache system writes data cache must point write data backing store well timing write controlled known write policy two basic writing approaches write-back cache complex implement since needs track locations written mark dirty later writing backing store data locations written back backing store evicted cache effect referred lazy write reason read miss write-back cache requires block replaced another often require two memory accesses service one write replaced data cache back store one retrieve needed data policies may also trigger data write-back client may make many changes data cache explicitly notify cache write back data since data returned requester write operations decision needs made write misses whether data would loaded cache defined two approaches write-through write-back policies use either write-miss policies usually paired way entities cache may change data backing store case copy cache may become out-of-date stale alternatively client updates data cache copies data caches become stale communication protocols cache managers keep data consistent known coherency protocols small memories close cpu operate faster much larger main memory cpus since 1980s used one caches sometimes cascaded levels modern high-end embedded desktop server microprocessors may many six types cache levels functions examples caches specific function d-cache i-cache translation lookaside buffer mmu earlier graphics processing units gpus often limited read-only texture caches introduced morton order swizzled textures improve 2d cache coherency cache misses would drastically affect performance e.g mipmapping used caching important leverage 32-bit wider transfers texture data often little 4 bits per pixel indexed complex patterns arbitrary uv coordinates perspective transformations inverse texture mapping gpus advanced especially gpgpu compute shaders developed progressively larger increasingly general caches including instruction caches shaders exhibiting increasingly common functionality cpu caches example gt200 architecture gpus feature l2 cache fermi gpu 768 kb last-level cache kepler gpu 1536 kb last-level cache maxwell gpu 2048 kb last-level cache caches grown handle synchronisation primitives threads atomic operations interface cpu-style mmu digital signal processors similarly generalised years earlier designs used scratchpad memory fed dma modern dsps qualcomm hexagon often include similar set caches cpu e.g modified harvard architecture shared l2 split l1 i-cache d-cache memory management unit mmu fetches page table entries main memory specialized cache used recording results virtual address physical address translations specialized cache called translation lookaside buffer tlb cpu caches generally managed entirely hardware variety software manages caches page cache main memory example disk cache managed operating system kernel disk buffer integrated part hard disk drive sometimes misleadingly referred disk cache main functions write sequencing read prefetching repeated cache hits relatively rare due small size buffer comparison drive capacity however high-end disk controllers often on-board cache hard disk drive data blocks finally fast local hard disk drive also cache information held even slower data storage devices remote servers web cache local tape drives optical jukeboxes scheme main concept hierarchical storage management also fast flash-based solid-state drives ssds used caches slower rotational-media hard disk drives working together hybrid drives solid-state hybrid drives sshds web browsers web proxy servers employ web caches store previous responses web servers web pages images web caches reduce amount information needs transmitted across network information previously stored cache often re-used reduces bandwidth processing requirements web server helps improve responsiveness users web web browsers employ built-in web cache internet service providers isps organizations also use caching proxy server web cache shared among users network another form cache p2p caching files sought peer-to-peer applications stored isp cache accelerate p2p transfers similarly decentralised equivalents exist allow communities perform task p2p traffic example corelli cache store data computed demand rather retrieved backing store memoization optimization technique stores results resource-consuming function calls within lookup table allowing subsequent calls reuse stored results avoid repeated computation related dynamic programming algorithm design methodology also thought means caching bind dns daemon caches mapping domain names ip addresses resolver library write-through operation common operating unreliable networks like ethernet lan enormous complexity coherency protocol required multiple write-back caches communication unreliable instance web page caches client-side network file system caches like nfs smb typically read-only write-through specifically keep network protocol simple reliable search engines also frequently make web pages indexed available cache example google provides cached link next search result prove useful web pages web server temporarily permanently inaccessible another type caching storing computed results likely needed memoization example ccache program caches output compilation order speed later compilation runs database caching substantially improve throughput database applications example processing indexes data dictionaries frequently used subsets data distributed cache uses networked hosts provide scalability reliability performance application hosts co-located spread different geographical regions semantics buffer cache totally different even fundamental differences intent process caching process buffering fundamentally caching realizes performance increase transfers data repeatedly transferred caching system may realize performance increase upon initial typically write transfer data item performance increase due buffering occurring within caching system read caches data item must fetched residing location least order subsequent reads data item realize performance increase virtue able fetched cache faster intermediate storage rather data residing location write caches performance increase writing data item may realized upon first write data item virtue data item immediately stored cache intermediate storage deferring transfer data item residing storage later stage else occurring background process contrary strict buffering caching process must adhere potentially distributed cache coherency protocol order maintain consistency cache intermediate storage location data resides buffering hand typical caching implementations data item read written first time effectively buffered case write mostly realizing performance increase application write originated additionally portion caching protocol individual writes deferred batch writes form buffering portion caching protocol individual reads deferred batch reads also form buffering although form may negatively impact performance least initial reads even though may positively impact performance sum individual reads practice caching almost always involves form buffering strict buffering involve caching buffer temporary memory location traditionally used cpu instructions directly address data stored peripheral devices thus addressable memory used intermediate stage additionally buffer may feasible large block data assembled disassembled required storage device data may delivered different order produced also whole buffer data usually transferred sequentially example hard disk buffering sometimes increases transfer performance reduces variation jitter transfer latency opposed caching intent reduce latency benefits present even buffered data written buffer read buffer cache also increases transfer performance part increase similarly comes possibility multiple small transfers combine one large block main performance-gain occurs good chance data read cache multiple times written data soon read cache sole purpose reduce accesses underlying slower storage cache also usually abstraction layer designed invisible perspective neighboring layers", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 201, + 206, + 210, + 212, + 224, + 230, + 252, + 265, + 270, + 271, + 314, + 335, + 359, + 388, + 425, + 429, + 436, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 678, + 719, + 752, + 776, + 783, + 803, + 821, + 846, + 854, + 856, + 858, + 884, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1111, + 1113, + 1125, + 1138, + 1174, + 1219, + 1222, + 1235, + 1256, + 1272, + 1284, + 1290, + 1322, + 1336, + 1378, + 1394, + 1456, + 1462, + 1469, + 1503, + 1505, + 1507, + 1518, + 1525, + 1553, + 1557, + 1608, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 353, + "label": 2, + "text": "VM/386:vm/386 vm/386 multitasking operating system 'control program took early advantage capabilities intel 386 processor utilizing virtual 8086 mode users able run existing text-based graphical dos software safely separate environments system offered high degree control ability set memory cpu usage limits unique config.sys autoexec.bat files could configured application even different dos versions 1991 vendor announced intentions support dpmi 1.0 vm/386 vm/386 initially developed softguard systems producer copy-protection software plans include features like non-dos system support financial constraints forced sale intelligent graphics corporation igc launched product 1987 pc magazine award technical excellence 1988 company also introduced multi-user version allowed number serial terminals even graphical systems connected single 386 computer current versions software built multi-user support handle tens users networked environment windows 3.11 support access controls virtual memory device sharing among features version software designed cooperate unix bundled everex systems workstations system sees use mainly vertical applications like point-of-sale systems ability run reliably cheap reliable hardware outweigh gains newer operating systems complex less reliable early competition included desqview 386 sunny hill software omniview starpath systems vmos/3 windows/386 2.01 target market shifted away single-user systems multiple-user setups many serial terminals began compete directly likes multiuser dos pc-mos/386", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 322, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1188, + 1202, + 1224, + 1301, + 1346, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 354, + "label": 4, + "text": "Penny_Black_(research_project):penny black research project penny black project microsoft research project tries find effective practical ways fighting spam identifying spams consumes recipient time idea make sender emails pay certain amount sending currency mode payment could cpu cycles turing tests memory cycles payment would limit spammers ability send large quantities emails quickly project name derived penny black world first adhesive stamp used paid postage goal project move e-mail costs receiver sender general idea sender must prove expended certain amount effort specifically receiver message alone project aims devise method without introducing additional challenge-response mechanisms third parties without requiring extra maintenance updates retaining current architecture e-mail system one project ideas ticket server credit-based method validating emails tickets would required perform actions sending emails three operations ticket server provides request ticket cancel ticket refund ticket server would allow user request ticket exchange proof work expending cpu cycles solving hard algorithms processing power turing tests even paying money server could also cancel ticket example receiving email ticket receiver could request ticket cancelled reused person cancels ticket also option refund ticket sender causes original sender regain new ticket example user might refund ticket came email spam using friendly trusted emails would little cost tickets would frequently refunded however spammers would required invest either lot computing time money order create enough tickets send large numbers e-mails one obvious flaws project entirely stop spam hopes slow spam enough longer cost effective spammers using methods reduce spam also require policies universal amongst mail clients intended mass email may also work intended example subscribers particular email service may end getting emails significant delay email service also become increased expenses provider", + "neighbors": [ + 515, + 574, + 847, + 937, + 1138, + 1446 + ], + "mask": "Test" + }, + { + "node_id": 355, + "label": 2, + "text": "Comparison_of_OpenGL_and_Direct3D:comparison opengl direct3d direct3d opengl competing application programming interfaces apis used applications render 2d 3d computer graphics hardware acceleration process commonplace since approximately 1999. graphics processing units gpus almost always implement one version apis examples include directx 9 opengl 2 circa 2004 directx 10 opengl 3 circa 2008 recently directx 11 opengl 4 circa 2011 gpus support recent versions standards backward-compatible applications use older standards example one run older directx 9 games recent directx 11-certified gpu direct3d application development targets microsoft windows platform opengl api open standard means various hardware makers operating system developers freely create opengl implementation part system opengl implementations exist wide variety platforms notably opengl dominating graphics api unix-like computer systems application developer perspective direct3d opengl equally open full documentation necessary development tools available restrictions detail two computer graphics apis following note many essential opengl extensions methods although documented also patented thus imposing serious legal troubles implement see issues mesa opengl direct3d implemented display device driver significant difference however direct3d implements api common runtime supplied microsoft turn talks low-level device driver interface ddi opengl every vendor implements full api driver means api functions may slightly different behavior one vendor next glsl shader compilers different vendors also show slightly different behavior following compares two apis structured around various considerations mostly relevant game development proprietary direct3d officially implemented microsoft windows family operating systems including embedded versions used xbox family video game consoles sega dreamcast several mostly functional reimplementations direct3d api made third parties wine project port common windows apis unix-like operating systems cedega proprietary fork wine however process progressively impeded due interdependence directx upon many proprietary components windows direct3d proprietary nature requires difficult process reverse engineering opengl implementations available across many platforms including microsoft windows unix-based systems mac os x linux nintendo sony developed libraries similar identical opengl subset opengl chosen main graphics library android blackberry ios symbian opengl es form microsoft opengl driver provides hardware acceleration windows vista support dropped windows xp soon failed deliver fahrenheit graphics api low level support opengl-direct3d merger late 1990s opengl hardware acceleration windows achieved users first installing installable client drivers icds developed gpu makers icds virtually cases bundled standard driver download package hardware vendor ihv installing recent graphics drivers sufficient provide hardware opengl support recently google almost native graphics layer engine angle project provides means convert opengl es 2.0 application calls directx 9 done webgl subset variant opengl web run common direct3d runtime means less variation vendors first version direct3d 1996 elicited broad criticism even simple operations state changes required creating submitting objects called execute buffers contrast opengl state changes performed one function call direct3d model frustrated many programmers famous complaint made high-profile game developer john d. carmack codice_1 file urged microsoft abandon direct3d favor opengl chris hecker made similar request open letter microsoft april\u2013may 1997 issue game developer magazine version 5 second version named reflect release part directx 5 replaced execute buffers new drawprimitive api still considered cumbersome chris hecker open letter microsoft referred drawprimitive immature poorly-designed clone opengl missing architectural decisions make opengl fast despite controversy microsoft continued evolve api detailed history releases added features given microsoft direct3d web pages former critics direct3d acknowledge direct3d good better opengl abilities ease use january 2007 john carmack said \u2026dx9 really quite good api level even direct3d side things know long history people thinking 'm antagonistic microsoft done good job sensibly evolving step\u2014they 're worried breaking backwards compatibility\u2014and pretty clean api especially like work 'm 360 probably best graphics api far sensibly designed thing 've worked design features direct3d remained unchanged since version one notably reliance microsoft component object model com one advantage using com api used com-aware language notably object pascal delphi microsoft visual c++ c visual basic .net opengl specification implemented programming language c though used languages built concept state machine api opengl depends one programming language feature made callable almost language proper bindings bindings exist current programming languages general direct3d designed virtualize 3d hardware interfaces direct3d frees game programmer accommodating graphics hardware opengl hand designed 3d hardware-accelerated rendering system may emulated software two apis fundamentally designed two separate modes thought functional differences two apis work one functional difference apis manage hardware resources direct3d expects application opengl makes implementation tradeoff opengl decreases difficulty developing api time increasing complexity creating implementation driver performs well direct3d developer must manage hardware resources independently however implementation simpler developers flexibility allocate resources efficient way possible application 2005 another functional difference apis way handled rendering textures direct3d method codice_2 convenient prior versions opengl required manipulating pixel buffers p-buffers cumbersome risky codepath used program different anticipated driver maker code would fall back software rendering causing substantial performance drop however broad support frame buffer objects extension provided opengl equivalent direct3d method successfully addressed shortcoming render target feature opengl brought par direct3d aspect outside minor functional differences mostly addressed years two apis provide nearly level function hardware software makers generally respond rapidly changes directx e.g. pixel processor shader requirements directx 9 stream processors directx 10 tessellation directx 11 contrast new features opengl usually implemented first vendors retroactively applied standard shortly establishment direct3d opengl viable graphics libraries circa 1995 microsoft sgi engaged called api wars much argument revolved around api offered superior performance question relevant due high cost dedicated graphics processors time meant consumer market using software renderers implemented microsoft direct3d opengl dos business software autocad dos games id software quake originally optimized run many different graphics chipsets hardware makers 3dlabs member opengl architecture review board made opengl compatible graphics accelerators e.g. glint chip developers john carmack id software optimized products opengl multitasking user environments windows x window system x11 unix-like systems became prevalent relevance hardware faded microsoft marketed direct3d faster based in-house performance comparisons two software libraries performance deficit blamed rigorous specification conformance required opengl perception changed 1996 special interest group graphics interactive techniques siggraph conference time silicon graphics sgi challenged microsoft optimized windows software implementation opengl called cosmogl various demos matched exceeded performance direct3d sgi critical milestone showed opengl poor software rendering performance due microsoft reference opengl implementation due alleged design flaws opengl contrast software rendering 3d api largely irrelevant direct3d opengl applications many directx applications used direct3d software rendering preferring perform software rendering using directdraw facilities access display hardware opengl applications hardware support expected hardware much faster software fallback opengl application constituted rude surprise opengl developer case time sgi demonstrated opengl software rendering performance could competitive direct3d software rendering fast becoming irrelevant due wide availability low cost 3d graphics hardware 1998 even s3 virge graphics accelerator substantially faster fastest pentium ii running direct3d mmx rasterizer substantive modern performance difference arises structure hardware drivers provided hardware developers directx independent hardware vendor ihv drivers kernel-mode drivers installed operating system user-mode part api handled directx runtime provided microsoft opengl however ihv driver divided two parts user-mode part implements opengl api kernel-mode driver called user-mode part issue calling kernel-mode operations user-mode requires performing system call i.e. making cpu switch kernel mode slow operation taking order microseconds complete time cpu perform operations minimizing number times switching operation occurs would improve performance example gpu command buffer full rendering data api could simply store requested rendering call temporary buffer command buffer nearly empty perform switch kernel-mode add set stored commands batch termed marshalling direct3d ihv drivers kernel-mode user-mode code ihv hand chance optimizations occur direct3d runtime user-mode part implements api explicit knowledge driver inner workings effectively support marshalling means every direct3d call sends commands hardware must perform kernel-mode switch takes time order microseconds complete led several behaviors regarding use direct3d important need submitting large batches triangles one function call since opengl ihv drivers user-mode component ihvs ability implement marshalling thus improving performance still kernel-mode switching theoretical maximum number switches opengl implementations simply equal direct3d standard behavior direct3d 10 release included windows vista allows parts drivers run user-mode making possible ihvs implement marshalling thus bringing two back relative performance parity mac os x opengl system similar ihvs implement simpler version opengl api user kernel mode components apple additions runtime provide direct interface user code basic work make ihvs jobs easier introduction mantle amd lead increased discussion modernizing apis updating abstraction concepts used apis reflect graphics processing unit gpu operations microsoft opengl vendors began showcase visions limiting removing altogether driver overhead amount work cpu needs prepare gpu commands march 2014 microsoft presented basic assumptions goals directx12 3d component ready december 2015 opengl vendors took different approach gdc 2014 presented mix features mandatory opengl 4.3 opengl 4.4 already arb extensions show fast paths already present implementations nvidia amd intel later amd donated mantle khronos group api renamed vulkan current cross-platform api dedicated reduce driver overhead better distributing work among multiple cpu gpu cores using unified management compute kernels graphical shaders presentation apitest introduced new tool microbenchmarking specific solutions given problems emphasizing exploration fast paths current apis opengl 4.x direct3d 11 supported gathered results showed modern opengl many times faster direct3d 11 opengl originally designed then-powerful sgi workstations includes many features like stereo rendering imaging subset generally considered limited use games although stereoscopic gaming drawn interest development consumer-level 3d displays api whole contains 250 calls subset perhaps 100 useful game development however official gaming-specific subset ever defined minigl released 3dfx stopgap measure support glquake might served starting point additional features like stencil soon adopted games support full opengl standard continued today workstations consumer machines use architectures operating systems modern versions opengl standard still include features although special workstation-class video cards accelerate opengl extension mechanism probably heavily disputed difference two apis opengl includes mechanism driver advertise extensions api thus introducing new functions blend modes new ways transfer data gpus different texture wrapping parameters allows new functions exposed quickly lead confusion different vendors implement similar extensions different apis many extensions periodically standardized opengl architecture review board arb made core part future opengl revisions hand direct3d specified one vendor microsoft leading consistent api denying access vendor-specific features nvidia ultrashadow technology instance available stock direct3d apis time writing noted direct3d support texture format extensions via fourcc little-known rarely used used s3 texture compression graphics cards added support pixel shaders known opengl fragment shaders direct3d provided one pixel shader 1.1 ps1.1 standard geforce 3 radeon 8500 advertised compatibility opengl functions accessed variety custom extensions theory microsoft approach allows one code path support brands card whereas opengl programmers must write two separate systems reality though limits pixel processing early cards pixel shader 1.1 nothing pseudo-assembly language version nvidia-specific opengl extensions part cards claimed ps 1.1 functionality nvidia built natively radeon 8500 released microsoft released update direct3d included pixel shader 1.4 nothing pseudo-assembly language version ati-specific opengl extensions cards claimed ps 1.4 support ati cards designed precise hardware needed make functionality happen situation existed short time apis second-generation pixel shading cards functioned far similarly architecture evolving toward kind pixel processing conclusion pixel shader 2.0 allowed unified code path direct3d around time opengl introduced arb-approved vertex pixel shader extensions codice_3 codice_4 sets cards supported standard also opengl always seen use professional graphics market directx directx used mostly computer games term professional used refer professional production display graphics computer animated films scientific visualisation opposed games graphics produced end user personal rather professional use currently opengl directx large enough overlap functionality either could used common purposes operating system often main criterion dictating used directx common choice windows opengl nearly everything else esoteric applications still divide applicability two apis accelerated 3d across network connection directly supported opengl opengl extension x window system glx example past many professional graphics cards supported opengl 2010 virtually professional cards work windows platform also support direct3d part change professional graphics market largely unix-based hardware like sgis suns lower cost pc-based systems leading growth windows market segment time providing new market opengl software unix-based consumer systems running linux mac os x principal historical reason opengl dominance professional market performance many professional graphics applications example softimage|3d alias poweranimator originally written iris gl high-end sgi workstations far capable graphically raw cpu power pcs time later many ported opengl even personal computer evolving system powerful enough run professional graphics applications users able run maya example successor alias poweranimator either sgis windows-based personal computers today linux mac os x windows price competition eventually broke sgi dominance market established base opengl software engineers broadening user base opengl apple linux operating systems resulted market directx opengl viable widespread apis reason opengl historic advantage marketing design directx set apis marketed professional graphics applications indeed even designed uses directx api designed low-level high-performance access broadly available lower-performance consumer-priced graphics hardware purpose game development opengl much general purpose 3d api targeting full range graphics hardware low-end commodity graphics cards professional scientific graphics visualization well range average consumer providing features necessarily exclusive specific kind user gaming developers typically n't demanded wide api professional graphics system developers many games n't need overlay planes stencils although n't prevented game developers using available specifically game designers rarely interested pixel invariance demanded certain parts opengl standards conversely highly useful film computer-aided modeling attempt made merge opengl directx sgi microsoft fahrenheit graphics api intended bring together high end ability opengl broad low-level support directx microsoft eventually retreated project never allocated sufficient resources produce part rendering engine move widely held purposed ensure lock-in developers windows-directx platform would lost fahrenheit api became world de facto standard graphics api however fahrenheit led many improvements directx main architect fahrenheit works microsoft directx earliest days 3d accelerated gaming performance reliability key benchmarks several 3d accelerator cards competed dominance software written specific brand graphics card however years opengl direct3d emerged software layers hardware mainly industry support cross-hardware graphics library competition two rose game developer would choose either one early days 3d accelerated gaming vendors supply full opengl driver reason twofold firstly consumer-oriented accelerators implement enough functionality properly accelerate opengl secondly many vendors struggled implement full opengl driver good performance compatibility instead wrote minigl drivers implemented subset opengl enough run glquake later opengl games mostly based quake engine proper opengl drivers became prevalent hardware evolved consumer-oriented accelerators caught sgi systems opengl originally designed would around time directx 6 directx 7 console world proprietary native apis dominant consoles e.g. ps3 providing opengl wrapper around native api original xbox supported direct3d 8.1 native api xbox 360 supports directx9 native api console developers prefer use native apis console maximize performance making opengl direct3d comparisons relevant mostly pc platforms opengl embedded systems called opengl es subset opengl 3d graphics api designed embedded devices various versions smartphone operating systems support opengl es android ios ipad iphone ipod touch maemo nokia n900 symbian opengl es available 6 variants opengl es 1.0 1.1 2.0 3.0 3.1 3.2 release 2.0 removed backward compatibility older variants due extensive programmable pipeline functions available gl es 2.0 fixed-pipeline functions gl es 1.0 1.1 opengl es 3.0 needed new hardware opengl es 2.0 opengl es 3.1 meant software update needing new drivers direct3d mobile direct3d derivative supported windows ce currently windows phone 7 devices use .net framework ui accelerated direct3d mobile 9 adreno 200/205 integrated gpus qualcomm windows phone 8 implements direct3d 11 limited feature level 9_3", + "neighbors": [ + 86, + 134, + 162, + 306, + 337, + 435, + 484, + 521, + 927, + 961, + 1138, + 1160, + 1373, + 1421, + 1503, + 1517, + 1608 + ], + "mask": "Validation" + }, + { + "node_id": 356, + "label": 2, + "text": "IPhone_OS_1:iphone os 1 iphone os 1 first major release ios apple mobile operating system iphone os 1.1.5 latest last version apple iphone os 1 version ios first iteration touch-centric mobile operating system official name given initial release apple marketing literature simply stated iphone runs version apple desktop operating system macos known mac os x march 6 2008 release iphone software development kit iphone sdk apple named iphone os later went rename ios june 7 2010 succeeded iphone os 2 july 11 2008 iphone os 1.1.3 update cost 19.95 ipod touch users", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 228, + 252, + 269, + 345, + 394, + 403, + 475, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 754, + 797, + 858, + 877, + 917, + 927, + 941, + 945, + 956, + 972, + 1001, + 1057, + 1100, + 1138, + 1140, + 1178, + 1190, + 1237, + 1292, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 357, + "label": 4, + "text": "ClearOS:clearos clearos also known clearos system formerly clarkconnect operating system marketed software company clearcenter based centos red hat enterprise linux designed use small medium enterprises network gateway network server web-based administration interface positioned alternative windows small business server clearos succeeds clarkconnect software built clearfoundation support services purchased clearcenter clearos 5.1 removes previous limitations mail dmz multiwan functions clearos 6.1 release distribution full-featured operating system gateway network servers built source packages red hat enterprise linux features include", + "neighbors": [ + 113, + 134, + 301, + 333, + 351, + 393, + 404, + 431, + 512, + 569, + 695, + 754, + 897, + 974, + 1046, + 1049, + 1055, + 1126, + 1138, + 1167, + 1276, + 1286, + 1369, + 1395, + 1458, + 1539, + 1601 + ], + "mask": "Validation" + }, + { + "node_id": 358, + "label": 6, + "text": "Veritas_File_System:veritas file system veritas file system vxfs called jfs onlinejfs hp-ux extent-based file system originally developed veritas software oem agreement vxfs used primary filesystem hp-ux operating system on-line defragmentation resize support turned via license known onlinejfs also supported aix linux solaris opensolaris sinix/reliant unix unixware sco openserver vxfs originally developed unix system laboratories vxfs packaged part veritas storage foundation also includes veritas volume manager according vendor first commercial journaling file system claim taken two ways i.e. first implementation journaling file system commercial context first file system available unbundled product dan koren cited one original developers vxfs notes mailing list finished release 1.0 one year later starting development vxfs contract corporation 1990 sources agree product first released 1991 internet widely available early 1990s getting new file system deployed unix like operating systems difficult one- two-year delay release commercialization file system unusual on-disk layout vxfs versioned upgradeable file system mounted file system gone ten versions vxfs file system run single instance mode parallel access cluster mode parallel mode allows multiple servers also known cluster nodes simultaneously access file system run mode vxfs referred veritas cluster file system cluster file system provides cache coherency posix compliance across nodes data changes atomically seen cluster nodes simultaneously cluster file system shares binaries on-disk layout single instance vxfs moving cluster single instance mode straightforward", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 195, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 842, + 887, + 892, + 900, + 908, + 912, + 922, + 938, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1406, + 1445, + 1459, + 1542, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 359, + "label": 3, + "text": "Random-access_memory:random-access memory random-access memory ram form computer memory read changed order typically used store working data machine code random-access memory device allows data items read written almost amount time irrespective physical location data inside memory contrast direct-access data storage media hard disks cd-rws dvd-rws older magnetic tapes drum memory time required read write data items varies significantly depending physical locations recording medium due mechanical limitations media rotation speeds arm movement ram contains multiplexing demultiplexing circuitry connect data lines addressed storage reading writing entry usually one bit storage accessed address ram devices often multiple data lines said 8-bit 16-bit etc devices today technology random-access memory takes form integrated circuit ic chips mos metal-oxide-semiconductor memory cells ram normally associated volatile types memory dram modules stored information lost power removed although non-volatile ram also developed types non-volatile memories exist allow random access read operations either allow write operations kinds limitations include types rom type flash memory called nor-flash two main types volatile random-access semiconductor memory static random-access memory sram dynamic random-access memory dram commercial uses semiconductor ram date back 1965 ibm introduced sp95 sram chip system/360 model 95 computer toshiba used dram memory cells toscal bc-1411 electronic calculator based bipolar transistors commercial mos memory based mos transistors developed late 1960s first commercial dram ic chip intel 1103 introduced october 1970 synchronous dynamic random-access memory sdram later debuted samsung km48sl2000 chip 1992 early computers used relays mechanical counters delay lines main memory functions ultrasonic delay lines could reproduce data order written drum memory could expanded relatively low cost efficient retrieval memory items required knowledge physical layout drum optimize speed latches built vacuum tube triodes later discrete transistors used smaller faster memories registers registers relatively large costly use large amounts data generally dozen hundred bits memory could provided first practical form random-access memory williams tube starting 1947 stored data electrically charged spots face cathode ray tube since electron beam crt could read write spots tube order memory random access capacity williams tube hundred around thousand bits much smaller faster power-efficient using individual vacuum tube latches developed university manchester england williams tube provided medium first electronically stored program implemented manchester baby computer first successfully ran program 21 june 1948 fact rather williams tube memory designed baby baby testbed demonstrate reliability memory magnetic-core memory invented 1947 developed mid-1970s became widespread form random-access memory relying array magnetized rings changing sense ring magnetization data could stored one bit stored per ring since every ring combination address wires select read write access memory location sequence possible magnetic core memory standard form computer memory system displaced solid-state mos metal-oxide-silicon semiconductor memory integrated circuits ics early 1970s prior development integrated read-only memory rom circuits permanent read-only random-access memory often constructed using diode matrices driven address decoders specially wound core rope memory planes semiconductor memory began 1960s bipolar memory used bipolar transistors improved performance could compete lower price magnetic core memory invention mosfet metal-oxide-semiconductor field-effect transistor also known mos transistor mohamed atalla dawon kahng bell labs 1959 led development mos semiconductor memory john schmidt fairchild semiconductor 1964 addition higher performance mos memory cheaper consumed less power magnetic core memory development silicon-gate mos integrated circuit ic technology federico faggin fairchild 1968 enabled production mos memory chips mos memory overtook magnetic core memory dominant memory technology early 1970s integrated bipolar static random-access memory sram invented robert h. norman fairchild semiconductor 1963 followed development mos sram john schmidt fairchild 1964 commercial use sram began 1965 ibm introduced sp95 memory chip system/360 model 95 dynamic random-access memory dram allowed replacement 4 6-transistor latch circuit single transistor memory bit greatly increasing memory density cost volatility data stored tiny capacitance transistor periodically refreshed every milliseconds charge could leak away toshiba toscal bc-1411 electronic calculator introduced 1965 used form capacitive bipolar dram storing 180-bit data discrete memory cells consisting germanium bipolar transistors capacitors 1967 robert h. dennard ibm filed patent single-transistor mos dram memory cell using mosfet transistor first commercial dram ic chip intel 1103 manufactured 8\u00b5m mos process capacity 1kb released 1970 synchronous dynamic random-access memory sdram developed samsung electronics first commercial sdram chip samsung km48sl2000 capacity 16mb introduced samsung 1992 mass-produced 1993 first commercial ddr sdram double data rate sdram memory chip samsung 64mb ddr sdram chip released june 1998 gddr graphics ddr form ddr sgram synchronous graphics ram first released samsung 16mb memory chip 1998 two widely used forms modern ram static ram sram dynamic ram dram sram bit data stored using state six-transistor memory cell form ram expensive produce generally faster requires less dynamic power dram modern computers sram often used cache memory cpu dram stores bit data using transistor capacitor pair together comprise dram cell capacitor holds high low charge 1 0 respectively transistor acts switch lets control circuitry chip read capacitor state charge change form memory less expensive produce static ram predominant form computer memory used modern computers static dynamic ram considered volatile state lost reset power removed system contrast read-only memory rom stores data permanently enabling disabling selected transistors memory altered writeable variants rom eeprom flash memory share properties rom ram enabling data persist without power updated without requiring special equipment persistent forms semiconductor rom include usb flash drives memory cards cameras portable devices solid-state drives ecc memory either sram dram includes special circuitry detect and/or correct random faults memory errors stored data using parity bits error correction codes general term ram refers solely solid-state memory devices either dram sram specifically main memory computers optical storage term dvd-ram somewhat misnomer since unlike cd-rw dvd-rw need erased reuse nevertheless dvd-ram behaves much like hard disc drive somewhat slower memory cell fundamental building block computer memory memory cell electronic circuit stores one bit binary information must set store logic 1 high voltage level reset store logic 0 low voltage level value maintained/stored changed set/reset process value memory cell accessed reading sram memory cell type flip-flop circuit usually implemented using fets means sram requires low power accessed expensive low storage density second type dram based around capacitor charging discharging capacitor store 1 0 cell however charge capacitor slowly leaks away must refreshed periodically refresh process dram uses power achieve greater storage densities lower unit costs compared sram useful memory cells must readable writeable within ram device multiplexing demultiplexing circuitry used select memory cells typically ram device set address lines a0 ... combination bits may applied lines set memory cells activated due addressing ram devices virtually always memory capacity power two usually several memory cells share address example 4 bit 'wide ram chip 4 memory cells address often width memory microprocessor different 32 bit microprocessor eight 4 bit ram chips would needed often addresses needed provided device case external multiplexors device used activate correct device accessed one read over-write data ram many computer systems memory hierarchy consisting processor registers on-die sram caches external caches dram paging systems virtual memory swap space hard drive entire pool memory may referred ram many developers even though various subsystems different access times violating original concept behind random access term ram even within hierarchy level dram specific row column bank rank channel interleave organization components make access time variable although extent access time rotating storage media tape variable overall goal using memory hierarchy obtain highest possible average access performance minimizing total cost entire memory system generally memory hierarchy follows access time fast cpu registers top slow hard drive bottom many modern personal computers ram comes easily upgraded form modules called memory modules dram modules size sticks chewing gum quickly replaced become damaged changing needs demand storage capacity suggested smaller amounts ram mostly sram also integrated cpu ics motherboard well hard-drives cd-roms several parts computer system addition serving temporary storage working space operating system applications ram used numerous ways modern operating systems employ method extending ram capacity known virtual memory portion computer hard drive set aside paging file scratch partition combination physical ram paging file form system total memory example computer 2 gb ram 1 gb page file operating system 3 gb total memory available system runs low physical memory swap portions ram paging file make room new data well read previously swapped information back ram excessive use mechanism results thrashing generally hampers overall system performance mainly hard drives far slower ram software partition portion computer ram allowing act much faster hard drive called ram disk ram disk loses stored data computer shut unless memory arranged standby battery source sometimes contents relatively slow rom chip copied read/write memory allow shorter access times rom chip disabled initialized memory locations switched block addresses often write-protected process sometimes called shadowing fairly common computers embedded systems common example bios typical personal computers often option called \u201c use shadow bios \u201d similar enabled functions rely data bios \u2019 rom instead use dram locations also toggle shadowing video card rom rom sections depending system may result increased performance may cause incompatibilities example hardware may inaccessible operating system shadow ram used systems benefit may hypothetical bios used booting favor direct hardware access free memory reduced size shadowed roms several new types non-volatile ram preserve data powered development technologies used include carbon nanotubes approaches utilizing tunnel magnetoresistance amongst 1st generation mram 128 kib bytes chip manufactured 0.18 \u00b5m technology summer 2003 june 2004 infineon technologies unveiled 16 mib 16 \u00d7 2 bytes prototype based 0.18 \u00b5m technology two 2nd generation techniques currently development thermal-assisted switching tas developed crocus technology spin-transfer torque stt crocus hynix ibm several companies working nantero built functioning carbon nanotube memory prototype 10 gib 10 \u00d7 2 bytes array 2004 whether technologies eventually take significant market share either dram sram flash-memory technology however remains seen since 2006 solid-state drives based flash memory capacities exceeding 256 gigabytes performance far exceeding traditional disks become available development started blur definition traditional random-access memory disks dramatically reducing difference performance kinds random-access memory ecoram specifically designed server farms low power consumption important speed memory wall growing disparity speed cpu memory outside cpu chip important reason disparity limited communication bandwidth beyond chip boundaries also referred bandwidth wall 1986 2000 cpu speed improved annual rate 55 memory speed improved 10 given trends expected memory latency would become overwhelming bottleneck computer performance cpu speed improvements slowed significantly partly due major physical barriers partly current cpu designs already hit memory wall sense intel summarized causes 2005 document first chip geometries shrink clock frequencies rise transistor leakage current increases leading excess power consumption heat ... secondly advantages higher clock speeds part negated memory latency since memory access times able keep pace increasing clock frequencies third certain applications traditional serial architectures becoming less efficient processors get faster due so-called von neumann bottleneck undercutting gains frequency increases might otherwise buy addition partly due limitations means producing inductance within solid state devices resistance-capacitance rc delays signal transmission growing feature sizes shrink imposing additional bottleneck frequency increases n't address rc delays signal transmission also noted clock rate versus ipc end road conventional microarchitectures projected maximum 12.5 average annual cpu performance improvement 2000 2014 different concept processor-memory performance gap addressed 3d integrated circuits reduce distance logic memory aspects apart 2d chip memory subsystem design requires focus gap widening time main method bridging gap use caches small amounts high-speed memory houses recent operations instructions nearby processor speeding execution operations instructions cases called upon frequently multiple levels caching developed deal widening gap performance high-speed modern computers relies evolving caching techniques prevent loss processor performance takes less time perform computation initiated complete 53 difference growth speed processor speeds lagging speed main memory access solid-state hard drives continued increase speed ~400 mb/s via sata3 2012 ~3 gb/s via nvme/pcie 2018 closing gap ram hard disk speeds although ram continues order magnitude faster single-lane ddr4 3200 capable 25 gb/s modern gddr even faster fast cheap non-volatile solid state drives replaced functions formerly performed ram holding certain data immediate availability server farms 1 terabyte ssd storage 200 1tb ram would cost thousands dollars despite speed ram still necessity efficient computation large local data sets analytics machine learning though producing graphics video games vr", + "neighbors": [ + 51, + 108, + 134, + 162, + 206, + 224, + 234, + 236, + 270, + 272, + 340, + 352, + 413, + 442, + 448, + 508, + 634, + 643, + 661, + 754, + 837, + 854, + 884, + 899, + 910, + 917, + 927, + 956, + 984, + 996, + 1024, + 1044, + 1063, + 1066, + 1100, + 1138, + 1139, + 1188, + 1193, + 1196, + 1208, + 1219, + 1262, + 1290, + 1306, + 1328, + 1369, + 1373, + 1406, + 1415, + 1503, + 1518, + 1586, + 1616, + 1619, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 360, + "label": 9, + "text": "Steel_Bank_Common_Lisp:steel bank common lisp steel bank common lisp sbcl free common lisp implementation features high-performance native compiler unicode support threading name steel bank common lisp reference carnegie mellon university common lisp sbcl forked andrew carnegie made fortune steel industry andrew mellon successful banker sbcl descends cmucl descended spice lisp including early implementations mach operating system ibm rt pc three rivers computing corporation perq computer 1980s william newman originally announced sbcl variant cmucl december 1999 main point divergence time clean bootstrapping procedure cmucl requires already compiled executable binary compile cmucl source code whereas sbcl supported bootstrapping theoretically ansi-compliant common lisp implementation sbcl became sourceforge project september 2000 original rationale fork continue initial work done newman without destabilizing cmucl time already mature much-used implementation forking amicable since significant flows code cross-pollination two projects since sbcl attracted several developers ported multiple hardware architectures operating systems undergone many changes enhancements dropped support several cmucl extensions considers beyond scope project motif interface also developed many new ones including native threading unicode support version 1.0 released november 2006 active development continues william newman stepped project administrator sbcl april 2008 several developers taken interim management releases time tenth anniversary sbcl workshop organized", + "neighbors": [ + 27, + 46, + 134, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 360, + 392, + 446, + 447, + 503, + 506, + 536, + 565, + 601, + 649, + 653, + 753, + 787, + 796, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 1021, + 1057, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Validation" + }, + { + "node_id": 361, + "label": 1, + "text": "Inspec:inspec inspec major indexing database scientific technical literature published institution engineering technology iet formerly institution electrical engineers iee one iet forerunners inspec coverage extensive fields physics computing control engineering subject coverage includes astronomy electronics communications computers computing computer science control engineering electrical engineering information technology physics manufacturing production mechanical engineering due emerging concept technology business inspec also includes information technology business portfolio inspec indexed journals publishing high quality research integrating technology management economics social sciences domains sample journals include annual review financial economics aslib journal information management australian journal management international journal management economics social sciences inspec started 1967 outgrowth science abstracts service electronic records distributed magnetic tape 1980s available u.s. knowledge index low-priced dial-up version dialog service individual users made popular nearly 50 years iet employed scientists manually review items included inspec hand-indexing literature using expertise subject area make judgement call terms classification codes applied thanks work significant thesaurus developed enables content indexed far accurately context turn helps end-users discover relevant literature may otherwise remained hidden typical search queries making inspec essential tool prior art patentability searches patent drafting access inspec currently internet inspec direct various resellers inspec several print counterparts computer control abstracts frequency 12 per year covers computers computing information technology electrical electronics abstracts frequency 12 per year covers topics telecommunications electronics radio electrical power optoelectronics printed indexes subject author indexes subject guide produced twice per year physics abstracts frequency 24 per year abstracting indexing service first published institution electrical engineers first circulated science abstracts volume 1 volume 5 1898 1902 1903 1971 database different titles closely related names science abstracts section physics science abstracts section physics abstracts volume 6 volume 74 1972 societies associated authors service american institute physics 1975 1976 institute electrical electronics engineers also became author 1980 database also issued inspec-physics various formats also available part inspec database presently part inspec section physics database time physics abstracts title employed throughout 1990s science fiction writer arthur c. clarke b.s degree physics mathematics honors king college assistant editor physics abstracts 1949\u20131951 position allowed clarke access world \u2019 leading scientific journals first issue science abstracts published january 1898 first year total 1,423 abstracts published monthly intervals end year author subject index added first issue contained 110 abstracts divided 10 sections science abstracts result joint collaboration institution electrical engineers iee physical society london publication time provided without charge members societies cost publication mainly borne iee physical society financial contributions also received institution civil engineers royal society british association advancement science 1902 annual number abstracts published increased 2,362 may 1903 decided split publication two parts physics b electrical engineering decision allowed subject scope widen particularly physics result allowed larger quantity material covered since 1967 electronic access science abstracts provided inspec", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 362, + "label": 7, + "text": "Supercomputer_architecture:supercomputer architecture approaches supercomputer architecture taken dramatic turns since earliest systems introduced 1960s early supercomputer architectures pioneered seymour cray relied compact innovative designs local parallelism achieve superior computational peak performance however time demand increased computational power ushered age massively parallel systems supercomputers 1970s used processors 1990s machines thousands processors began appear end 20th century massively parallel supercomputers tens thousands off-the-shelf processors norm supercomputers 21st century use 100,000 processors graphic units connected fast connections throughout decades management heat density remained key issue centralized supercomputers large amount heat generated system may also effects reducing lifetime system components diverse approaches heat management pumping fluorinert system hybrid liquid-air cooling system air cooling normal air conditioning temperatures systems massive number processors generally take one two paths one approach e.g. grid computing processing power large number computers distributed diverse administrative domains opportunistically used whenever computer available another approach large number processors used close proximity e.g. computer cluster centralized massively parallel system speed flexibility interconnect becomes important modern supercomputers used various approaches ranging enhanced infiniband systems three-dimensional torus interconnects since late 1960s growth power proliferation supercomputers dramatic underlying architectural directions systems taken significant turns early supercomputers relied small number closely connected processors accessed shared memory supercomputers 21st century use 100,000 processors connected fast networks throughout decades management heat density remained key issue centralized supercomputers seymour cray get heat motto central design philosophy continued key issue supercomputer architectures e.g. large-scale experiments blue waters large amount heat generated system may also effects reducing lifetime system components diverse approaches heat management e.g cray 2 pumped fluorinert system system x used hybrid liquid-air cooling system blue gene/p air-cooled normal air conditioning temperatures heat aquasar supercomputer used warm university campus heat density generated supercomputer direct dependence processor type used system powerful processors typically generating heat given similar underlying semiconductor technologies early supercomputers used fast closely packed processors took advantage local parallelism e.g. pipelining vector processing time number processors grew computing nodes could placed away e.g. computer cluster could geographically dispersed grid computing number processors supercomputer grows component failure rate begins become serious issue supercomputer uses thousands nodes may fail per year average system experience several node failures day price/performance general purpose graphic processors gpgpus improved number petaflop supercomputers tianhe-i nebulae started rely however systems k computer continue use conventional processors sparc-based designs overall applicability gpgpus general purpose high performance computing applications subject debate gpgpu may tuned score well specific benchmarks overall applicability everyday algorithms may limited unless significant effort spent tune application towards however gpus gaining ground 2012 jaguar supercomputer transformed titan replacing cpus gpus number independent processors supercomputer increases way access data file system share access secondary storage resources becomes prominent years number systems distributed file management developed e.g ibm general parallel file system beegfs parallel virtual file system hadoop etc number supercomputers top100 list tianhe-i use linux lustre file system cdc 6600 series computers early attempts supercomputing gained advantage existing systems relegating work peripheral devices freeing cpu central processing unit process actual data minnesota fortran compiler 6600 could sustain 500 kiloflops standard mathematical operations early supercomputers cray 1 cray 2 appeared afterwards used small number fast processors worked harmony uniformly connected largest amount shared memory could managed time early architectures introduced parallel processing processor level innovations vector processing processor perform several operations one clock cycle rather wait successive cycles time number processors increased different architectural issues emerged two issues need addressed number processors increases distribution memory processing distributed memory approach processor physically packaged close local memory memory associated processors away based bandwidth latency parameters non-uniform memory access 1960s pipelining viewed innovation 1970s use vector processors well established 1980s many supercomputers used parallel vector processors relatively small number processors early systems allowed easily use shared memory architecture allows processors access common pool memory early days common approach use uniform memory access uma access time memory location similar processors use non-uniform memory access numa allowed processor access local memory faster memory locations cache-only memory architectures coma allowed local memory processor used cache thus requiring coordination memory values changed number processors increases efficient interprocessor communication synchronization supercomputer becomes challenge number approaches may used achieve goal instance early 1980s cray x-mp system shared registers used approach processors access shared registers move data back forth used interprocessor communication synchronization however inherent challenges managing large amount shared memory among many processors resulted move distributed architectures 1980s demand computing power increased trend much larger number processors began ushering age massively parallel systems distributed memory distributed file systems given shared memory architectures could scale large number processors hybrid approaches distributed shared memory also appeared early systems computer clustering approach connects number readily available computing nodes e.g personal computers used servers via fast private local area network activities computing nodes orchestrated clustering middleware software layer sits atop nodes allows users treat cluster large one cohesive computing unit e.g via single system image concept computer clustering relies centralized management approach makes nodes available orchestrated shared servers distinct approaches peer peer grid computing also use many nodes far distributed nature 21st century top500 organization semiannual list 500 fastest supercomputers often includes many clusters e.g world fastest 2011 k computer distributed memory cluster architecture large number local semi-independent computing nodes used e.g cluster architecture speed flexibility interconnect becomes important modern supercomputers taken different approaches address issue e.g tianhe-1 uses proprietary high-speed network based infiniband qdr enhanced feiteng-1000 cpus hand blue gene/l system uses three-dimensional torus interconnect auxiliary networks global communications approach node connected six nearest neighbors similar torus used cray t3e massive centralized systems times use special-purpose processors designed specific application may use field-programmable gate arrays fpga chips gain performance sacrificing generality examples special-purpose supercomputers include belle deep blue hydra playing chess gravity pipe astrophysics mdgrape-3 protein structure computation molecular dynamics deep crack breaking des cipher grid computing uses large number computers distributed diverse administrative domains opportunistic approach uses resources whenever available example boinc volunteer-based opportunistic grid system boinc applications reached multi-petaflop levels using close half million computers connected internet whenever volunteer resources become available however types results often appear top500 ratings run general purpose linpack benchmark although grid computing success parallel task execution demanding supercomputer applications weather simulations computational fluid dynamics remained reach partly due barriers reliable sub-assignment large number tasks well reliable availability resources given time quasi-opportunistic supercomputing large number geographically disperse computers orchestrated built-in safeguards quasi-opportunistic approach goes beyond volunteer computing highly distributed systems boinc general grid computing system globus allowing middleware provide almost seamless access many computing clusters existing programs languages fortran c distributed among multiple computing resources quasi-opportunistic supercomputing aims provide higher quality service opportunistic resource sharing quasi-opportunistic approach enables execution demanding applications within computer grids establishing grid-wise resource allocation agreements fault tolerant message passing abstractly shield failures underlying resources thus maintaining opportunism allowing higher level control air-cooled ibm blue gene supercomputer architecture trades processor speed low power consumption larger number processors used room temperature using normal air-conditioning second-generation blue gene/p system processors integrated node-to-node communication logic energy-efficient achieving 371 mflops/w k computer water-cooled homogeneous processor distributed memory system cluster architecture uses 80,000 sparc64 viiifx processors eight cores total 700,000 cores\u2014almost twice many system comprises 800 cabinets 96 computing nodes 16 gb memory 6 i/o nodes although powerful next five systems top500 list combined 824.56 mflops/w lowest power performance ratio current major supercomputer system follow system k computer called primehpc fx10 uses six-dimensional torus interconnect still one processor per node unlike k computer tianhe-1a system uses hybrid architecture integrates cpus gpus uses 14,000 xeon general-purpose processors 7,000 nvidia tesla general-purpose graphics processing units gpgpus 3,500 blades 112 computer cabinets 262 terabytes distributed memory 2 petabytes disk storage implemented via lustre clustered files tianhe-1 uses proprietary high-speed communication network connect processors proprietary interconnect network based infiniband qdr enhanced chinese made feiteng-1000 cpus case interconnect system twice fast infiniband slower interconnects supercomputers limits specific approaches continue tested boundaries reached large scale experiments e.g. 2011 ibm ended participation blue waters petaflops project university illinois blue waters architecture based ibm power7 processor intended 200,000 cores petabyte globally addressable memory 10 petabytes disk space goal sustained petaflop led design choices optimized single-core performance hence lower number cores lower number cores expected help performance programs scale well large number processors large globally addressable memory architecture aimed solve memory address problems efficient manner type programs blue waters expected run sustained speeds least one petaflop relied specific water-cooling approach manage heat first four years operation national science foundation spent 200 million project ibm released power 775 computing node derived project technology soon thereafter effectively abandoned blue waters approach architectural experiments continuing number directions e.g cyclops64 system uses supercomputer chip approach direction away use massive distributed processors 64-bit cyclops64 chip contains 80 processors entire system uses globally addressable memory architecture processors connected non-internally blocking crossbar switch communicate via global interleaved memory data cache architecture half sram bank used scratchpad memory although type architecture allows unstructured parallelism dynamically non-contiguous memory system also produces challenges efficient mapping parallel algorithms many-core system", + "neighbors": [ + 13, + 51, + 86, + 123, + 134, + 210, + 222, + 227, + 270, + 280, + 306, + 314, + 340, + 465, + 579, + 611, + 719, + 846, + 847, + 876, + 909, + 942, + 1013, + 1081, + 1099, + 1159, + 1219, + 1220, + 1421, + 1507, + 1599, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 363, + "label": 4, + "text": "Denial-of-service_attack:denial-of-service attack computing denial-of-service attack dos attack cyber-attack perpetrator seeks make machine network resource unavailable intended users temporarily indefinitely disrupting services host connected internet denial service typically accomplished flooding targeted machine resource superfluous requests attempt overload systems prevent legitimate requests fulfilled distributed denial-of-service attack ddos attack incoming traffic flooding victim originates many different sources effectively makes impossible stop attack simply blocking single source dos ddos attack analogous group people crowding entry door shop making hard legitimate customers enter thus disrupting trade criminal perpetrators dos attacks often target sites services hosted high-profile web servers banks credit card payment gateways revenge blackmail activism motivate attacks court testimony shows first demonstration dos attack made khan c. smith 1997 def con event disrupting internet access las vegas strip hour release sample code event led online attack sprint earthlink e-trade major corporations year follow march 5 2018 unnamed customer us-based service provider arbor networks fell victim largest ddos history reaching peak 1.7 terabits per second previous record set days earlier march 1 2018 github hit attack 1.35 terabits per second hong kong anti-extradition protests june 2019 messaging app telegram subject ddos attack aimed preventing protesters using coordinate movements founders telegram stated attack appears state sized actor via ip addresses originating china denial-of-service attacks characterized explicit attempt attackers prevent legitimate use service two general forms dos attacks crash services flood services serious attacks distributed distributed denial-of-service ddos large-scale dos attack perpetrator uses one unique ip address often thousands hosts infected malware distributed denial service attack typically involves around 3\u20135 nodes different networks fewer nodes may qualify dos attack ddos attack since incoming traffic flooding victim originates different sources may impossible stop attack simply using ingress filtering also makes difficult distinguish legitimate user traffic attack traffic spread across multiple points origin alternative augmentation ddos attacks may involve forging ip sender addresses ip address spoofing complicating identifying defeating attack scale ddos attacks continued rise recent years 2016 exceeding terabit per second common examples ddos attacks fraggle smurf syn flooding application layer ddos attack sometimes referred layer 7 ddos attack form ddos attack attackers target application-layer processes attack over-exercises specific functions features website intention disable functions features application-layer attack different entire network attack often used financial institutions distract security personnel security breaches 2013 application-layer ddos attacks represented 20 ddos attacks according research akamai technologies 51 percent application layer attacks q4 2013 q4 2014 16 percent q3 2014 q4 2014 november 2017 junade ali computer scientist cloudflare noted whilst network-level attacks continue high capacity occurring less frequently ali notes although network-level attacks becoming less frequent data cloudflare demonstrates application-layer attacks still showing sign slowing osi model iso/iec 7498-1 conceptual model characterizes standardizes internal functions communication system partitioning abstraction layers model product open systems interconnection project international organization standardization iso model groups similar communication functions one seven logical layers layer serves layer served layer example layer provides error-free communications across network provides communications path needed applications calls next lower layer send receive packets traverse path osi model definition application layer narrower scope often implemented osi model defines application layer user interface osi application layer responsible displaying data images user human-recognizable format interface presentation layer implementation application presentation layers frequently combined application layer ddos attack done mainly specific targeted purposes including disrupting transactions access databases requires fewer resources network layer attacks often accompanies attack may disguised look like legitimate traffic except targets specific application packets functions attack application layer disrupt services retrieval information search functions website advanced persistent dos apdos associated advanced persistent threat requires specialised ddos mitigation attacks persist weeks longest continuous period noted far lasted 38 days attack involved approximately 50+ petabits 50,000+ terabits malicious traffic attackers scenario may tactically switch several targets create diversion evade defensive ddos countermeasures eventually concentrating main thrust attack onto single victim scenario attackers continuous access several powerful network resources capable sustaining prolonged campaign generating enormous levels un-amplified ddos traffic apdos attacks characterised vendors provide so-called booter stresser services simple web-based front ends accept payment web marketed promoted stress-testing tools used perform unauthorized denial-of-service attacks allow technically unsophisticated attackers access sophisticated attack tools without need attacker understand use usually powered botnet traffic produced consumer stresser range anywhere 5-50 gbit/s cases deny average home user internet access united states computer emergency readiness team us-cert identified symptoms denial-of-service attack include additional symptoms may include attack conducted sufficiently large scale entire geographical regions internet connectivity compromised without attacker knowledge intent incorrectly configured flimsy network infrastructure equipment wide array programs used launch dos-attacks cases mydoom slowloris tools embedded malware launch attacks without knowledge system owner stacheldraht classic example ddos tool uses layered structure attacker uses client program connect handlers compromised systems issue commands zombie agents turn facilitate ddos attack agents compromised via handlers attacker using automated routines exploit vulnerabilities programs accept remote connections running targeted remote hosts handler control thousand agents cases machine may become part ddos attack owner consent example operation payback organized group anonymous loic typically used way along hoic wide variety ddos tools available today including paid free versions different features available underground market hacker related forums irc channels various dos-causing exploits buffer overflow cause server-running software get confused fill disk space consume available memory cpu time kinds dos rely primarily brute force flooding target overwhelming flux packets oversaturating connection bandwidth depleting target system resources bandwidth-saturating floods rely attacker higher bandwidth available victim common way achieving today via distributed denial-of-service employing botnet another target ddos attacks may produce added costs application operator latter uses resources based cloud computing case normally application used resources tied needed quality service level e.g responses less 200 ms rule usually linked automated software e.g amazon cloudwatch raise virtual resources provider order meet defined qos levels increased requests.the main incentive behind attacks may drive application owner raise elasticity levels order handle increased application traffic order cause financial losses force become less competitive floods may use specific packet types connection requests saturate finite resources example occupying maximum number open connections filling victim disk space logs banana attack another particular type dos involves redirecting outgoing messages client back onto client preventing outside access well flooding client sent packets land attack type attacker shell-level access victim computer may slow unusable crash using fork bomb kind application-level dos attack xdos xml dos controlled modern web application firewalls wafs pulsing zombies compromised computers directed launch intermittent short-lived floodings victim websites intent merely slowing rather crashing type attack referred degradation-of-service rather denial-of-service difficult detect regular zombie invasions disrupt hamper connection websites prolonged periods time potentially causing disruption concentrated floods exposure degradation-of-service attacks complicated matter discerning whether server really attacked normal traffic loads goal dos l2 possibly ddos attack cause launching defense mechanism blocks network segment attack originated case distributed attack ip header modification depends kind security behavior fully block attacked network internet without system crash distributed denial-of-service ddos attack occurs multiple systems flood bandwidth resources targeted system usually one web servers attack often result multiple compromised systems example botnet flooding targeted system traffic botnet network zombie computers programmed receive commands without owners knowledge server overloaded connections new connections longer accepted major advantages attacker using distributed denial-of-service attack multiple machines generate attack traffic one machine multiple attack machines harder turn one attack machine behavior attack machine stealthier making harder track shut attacker advantages cause challenges defense mechanisms example merely purchasing incoming bandwidth current volume attack might help attacker might able simply add attack machines end completely crashing website periods time malware carry ddos attack mechanisms one better-known examples mydoom dos mechanism triggered specific date time type ddos involved hardcoding target ip address prior release malware interaction necessary launch attack system may also compromised trojan allowing attacker download zombie agent trojan may contain one attackers also break systems using automated tools exploit flaws programs listen connections remote hosts scenario primarily concerns systems acting servers web stacheldraht classic example ddos tool uses layered structure attacker uses client program connect handlers compromised systems issue commands zombie agents turn facilitate ddos attack agents compromised via handlers attacker using automated routines exploit vulnerabilities programs accept remote connections running targeted remote hosts handler control thousand agents cases machine may become part ddos attack owner consent example operation payback organized group anonymous attacks use different types internet packets tcp udp icmp etc collections systems compromisers known botnets rootservers ddos tools like stacheldraht still use classic dos attack methods centered ip spoofing amplification like smurf attacks fraggle attacks also known bandwidth consumption attacks syn floods also known resource starvation attacks may also used newer tools use dns servers dos purposes unlike mydoom ddos mechanism botnets turned ip address script kiddies use deny availability well known websites legitimate users sophisticated attackers use ddos tools purposes extortioneven business rivals simple attacks syn floods may appear wide range source ip addresses giving appearance well distributed dos flood attacks require completion tcp three way handshake attempt exhaust destination syn queue server bandwidth source ip addresses trivially spoofed attack could come limited set sources may even originate single host stack enhancements syn cookies may effective mitigation syn queue flooding however complete bandwidth exhaustion may require involvement attacker mounts attack single host would classified dos attack fact attack availability would classed denial-of-service attack hand attacker uses many systems simultaneously launch attacks remote host would classified ddos attack reported new attacks internet things iot devices involved denial service attacks one noted attack made peaked around 20,000 requests per second came around 900 cctv cameras uk gchq tools built ddos named predators face rolling thunder 2015 ddos botnets dd4bc grew prominence taking aim financial institutions cyber-extortionists typically begin low-level attack warning larger attack carried ransom paid bitcoin security experts recommend targeted websites pay ransom attackers tend get extended extortion scheme recognize target ready pay first discovered 2009 http post attack sends complete legitimate http post header includes 'content-length field specify size message body follow however attacker proceeds send actual message body extremely slow rate e.g 1 byte/110 seconds due entire message correct complete target server attempt obey 'content-length field header wait entire body message transmitted take long time attacker establishes hundreds even thousands connections resources incoming connections server victim used hence making including legitimate connections impossible data sent notable unlike many dos attacks try subdue server overloading network cpu http post attack targets logical resources victim means victim would still enough network bandwidth processing power operate combined fact apache default accept requests 2gb size attack particularly powerful http post attacks difficult differentiate legitimate connections therefore able bypass protection systems owasp open source web application security project released testing tool test security servers type attacks challenge collapsar cc attack attack standard http requests sent targeted web server frequently uniform resource identifiers uris require complicated time-consuming algorithms database operations order exhaust resources targeted web server 2004 chinese hacker nicknamed kiki invented hacking tool send kinds requests attack nsfocus firewall named collapsar thus hacking tool known challenge collapsar cc short consequently type attack got name cc attack smurf attack relies misconfigured network devices allow packets sent computer hosts particular network via broadcast address network rather specific machine attacker send large numbers ip packets source address faked appear address victim devices network default respond sending reply source ip address number machines network receive respond packets large victim computer flooded traffic overloads victim computer even make unusable attack ping flood based sending victim overwhelming number ping packets usually using ping command unix-like hosts -t flag windows systems much less capable overwhelming target also -l size flag allow sent packet size greater 65500 windows simple launch primary requirement access greater bandwidth victim ping death based sending victim malformed ping packet lead system crash vulnerable system blacknurse attack example attack taking advantage required destination port unreachable icmp packets nuke old denial-of-service attack computer networks consisting fragmented otherwise invalid icmp packets sent target achieved using modified ping utility repeatedly send corrupt data thus slowing affected computer comes complete stop specific example nuke attack gained prominence winnuke exploited vulnerability netbios handler windows 95 string out-of-band data sent tcp port 139 victim machine causing lock display blue screen death bsod attackers found way exploit number bugs peer-to-peer servers initiate ddos attacks aggressive peer-to-peer-ddos attacks exploits dc++ peer-to-peer botnet attacker communicate clients subverts instead attacker acts puppet master instructing clients large peer-to-peer file sharing hubs disconnect peer-to-peer network connect victim website instead permanent denial-of-service pdos also known loosely phlashing attack damages system badly requires replacement reinstallation hardware unlike distributed denial-of-service attack pdos attack exploits security flaws allow remote administration management interfaces victim hardware routers printers networking hardware attacker uses vulnerabilities replace device firmware modified corrupt defective firmware image\u2014a process done legitimately known flashing therefore bricks device rendering unusable original purpose repaired replaced pdos pure hardware targeted attack much faster requires fewer resources using botnet root/vserver ddos attack features potential high probability security exploits network enabled embedded devices needs technique come attention numerous hacking communities brickerbot piece malware targeted iot devices used pdos attacks disable targets phlashdance tool created rich smith employee hewlett-packard systems security lab used detect demonstrate pdos vulnerabilities 2008 eusecwest applied security conference london distributed denial-of-service attack may involve sending forged requests type large number computers reply requests using internet protocol address spoofing source address set targeted victim means replies go flood target reflected attack form sometimes called drdos icmp echo request attacks smurf attack considered one form reflected attack flooding host send echo requests broadcast addresses mis-configured networks thereby enticing hosts send echo reply packets victim early ddos programs implemented distributed form attack amplification attacks used magnify bandwidth sent victim typically done publicly accessible dns servers used cause congestion target system using dns response traffic many services exploited act reflectors harder block others us-cert observed different services implies different amplification factors tabulated dns amplification attacks involve new mechanism increased amplification effect using much larger list dns servers seen earlier process typically involves attacker sending dns name look request public dns server spoofing source ip address targeted victim attacker tries request much information possible thus amplifying dns response sent targeted victim since size request significantly smaller response attacker easily able increase amount traffic directed target snmp ntp also exploited reflector amplification attack example amplified ddos attack network time protocol ntp command called monlist sends details last 600 hosts requested time ntp server back requester small request time server sent using spoofed source ip address victim results response 556.9 times size request sent victim becomes amplified using botnets send requests spoofed ip source result massive amount data sent back victim difficult defend types attacks response data coming legitimate servers attack requests also sent udp require connection server means source ip verified request received server order bring awareness vulnerabilities campaigns started dedicated finding amplification vectors led people fixing resolvers resolvers shut completely attack works using worm infect hundreds thousands iot devices across internet worm propagates networks systems taking control poorly protected iot devices thermostats wi-fi enabled clocks washing machines device becomes enslaved usually owner user immediate indication iot device direct target attack used part larger attack newly enslaved devices called slaves bots hacker acquired desired number bots instruct bots try contact isp october 2016 mirai botnet attacked dyn isp sites twitter netflix etc soon occurred websites unreachable several hours type attack physically damaging certainly costly large internet companies get attacked rudy attack targets web applications starvation available sessions web server much like slowloris rudy keeps sessions halt using never-ending post transmissions sending arbitrarily large content-length header value manipuling maximum segment size selective acknowledgement sack may used remote peer cause denial service integer overflow linux kernel causing even kernel panic jonathan looney discovered cve-2019-11477 cve-2019-11478 cve-2019-11479 june 17 2019 shrew attack denial-of-service attack transmission control protocol uses short synchronized bursts traffic disrupt tcp connections link exploiting weakness tcp re-transmission timeout mechanism slow read attack sends legitimate application layer requests reads responses slowly thus trying exhaust server connection pool achieved advertising small number tcp receive window size time emptying clients tcp receive buffer slowly causes low data flow rate sophisticated low-bandwidth ddos attack form dos uses less traffic increases effectiveness aiming weak point victim system design i.e. attacker sends traffic consisting complicated requests system essentially sophisticated ddos attack lower cost due use less traffic smaller size making difficult identify ability hurt systems protected flow control mechanisms syn flood occurs host sends flood tcp/syn packets often forged sender address packets handled like connection request causing server spawn half-open connection sending back tcp/syn-ack packet acknowledge waiting packet response sender address response ack packet however sender address forged response never comes half-open connections saturate number available connections server make keeping responding legitimate requests attack ends teardrop attack involves sending mangled ip fragments overlapping oversized payloads target machine crash various operating systems bug tcp/ip fragmentation re-assembly code windows 3.1x windows 95 windows nt operating systems well versions linux prior versions 2.0.32 2.1.63 vulnerable attack although september 2009 vulnerability windows vista referred teardrop attack targeted smb2 higher layer tcp packets teardrop used one fields ip header \u201c fragment offset \u201d field indicating starting position offset data contained fragmented packet relative data original packet sum offset size one fragmented packet differs next fragmented packet packets overlap happens server vulnerable teardrop attacks unable reassemble packets resulting denial-of-service condition voice ip made abusive origination large numbers telephone voice calls inexpensive readily automated permitting call origins misrepresented caller id spoofing according us federal bureau investigation telephony denial-of-service tdos appeared part various fraudulent schemes telephony denial-of-service exist even without internet telephony 2002 new hampshire senate election phone jamming scandal telemarketers used flood political opponents spurious calls jam phone banks election day widespread publication number also flood enough calls render unusable happened accident 1981 multiple +1-area code-867-5309 subscribers inundated hundreds misdialed calls daily response song 867-5309/jenny tdos differs telephone harassment prank calls obscene phone calls number calls originated occupying lines continuously repeated automated calls victim prevented making receiving routine emergency telephone calls related exploits include sms flooding attacks black fax fax loop transmission takes router resources drop packet ttl value 1 less forward packet higher ttl value packet dropped due ttl expiry router cpu must generate send icmp time exceeded response generating many responses overload router cpu attack uses existing vulnerability universal plug play upnp protocol get around considerable amount present defense methods flood target network servers attack based dns amplification technique attack mechanism upnp router forwards requests one outer source another disregarding upnp behavior rules using upnp router returns data unexpected udp port bogus ip address making harder take simple action shut traffic flood according imperva researchers effective way stop attack companies lock upnp routers defensive responses denial-of-service attacks typically involve use combination attack detection traffic classification response tools aiming block traffic identify illegitimate allow traffic identify legitimate list prevention response tools provided application front-end hardware intelligent hardware placed network traffic reaches servers used networks conjunction routers switches application front end hardware analyzes data packets enter system identifies priority regular dangerous 25 bandwidth management vendors approaches ddos attacks cloud-based applications may based application layer analysis indicating whether incoming bulk traffic legitimate thus triggering elasticity decisions without economical implications ddos attack approaches mainly rely identified path value inside application monitor progress requests path markers called key completion indicators essence technique statistical methods assessing behavior incoming requests detect something unusual abnormal going analogy bricks-and-mortar department store customers spend average known percentage time different activities picking items examining putting back filling basket waiting pay paying leaving high-level activities correspond key completion indicators service site normal behavior determined abnormal behavior identified mob customers arrived store spent time picking items putting back never made purchases could flagged unusual behavior department store attempt adjust periods high activity bringing reserve employees short notice routinely mob start showing never buying anything could ruin store extra employee costs soon store would identify mob activity scale back number employees recognising mob provides profit served may make difficult legitimate customers get served mob presence saves store total ruin case elastic cloud services huge abnormal additional workload may incur significant charges cloud service provider technique used scale back even stop expansion server availability protect economic loss blackhole routing traffic attacked dns ip address sent black hole null interface non-existent server efficient avoid affecting network connectivity managed isp dns sinkhole routes traffic valid ip address analyzes traffic rejects bad packets sinkholing efficient severe attacks intrusion prevention systems ips effective attacks signatures associated however trend among attacks legitimate content bad intent intrusion-prevention systems work content recognition block behavior-based dos attacks asic based ips may detect block denial-of-service attacks processing power granularity analyze attacks act like circuit breaker automated way rate-based ips rbips must analyze traffic granularly continuously monitor traffic pattern determine traffic anomaly must let legitimate traffic flow blocking dos attack traffic focused problem ips dos defense system dds block connection-based dos attacks legitimate content bad intent dds also address protocol attacks teardrop ping death rate-based attacks icmp floods syn floods case simple attack firewall could simple rule added deny incoming traffic attackers based protocols ports originating ip addresses complex attacks however hard block simple rules example ongoing attack port 80 web service possible drop incoming traffic port prevent server serving legitimate traffic additionally firewalls may deep network hierarchy routers adversely affected traffic gets firewall also many security tools still support ipv6 may configured properly firewalls often might get bypassed attacks similar switches routers rate-limiting acl capability manually set routers easily overwhelmed dos attack cisco ios optional features reduce impact flooding switches rate-limiting acl capability switches provide automatic and/or system-wide rate limiting traffic shaping delayed binding tcp splicing deep packet inspection bogon filtering bogus ip filtering detect remediate dos attacks automatic rate filtering wan link failover balancing schemes work long dos attacks prevented using example syn flood prevented using delayed binding tcp splicing similarly content based dos may prevented using deep packet inspection attacks originating dark addresses going dark addresses prevented using bogon filtering automatic rate filtering work long set rate-thresholds set correctly wan-link failover work long links dos/ddos prevention mechanism traffic passed cleaning center scrubbing center via various methods proxies tunnels digital cross connects even direct circuits separates bad traffic ddos also common internet attacks sends good traffic beyond server provider needs central connectivity internet manage kind service unless happen located within facility cleaning center scrubbing center ddos attacks overwhelm type hardware firewall passing malicious traffic large mature networks becomes effective economically sustainable ddos unintentional denial-of-service occur system ends denied due deliberate attack single individual group individuals simply due sudden enormous spike popularity happen extremely popular website posts prominent link second less well-prepared site example part news story result significant proportion primary site regular userspotentially hundreds thousands peopleclick link space hours effect target website ddos attack vipdos specifically link posted celebrity michael jackson died 2009 websites google twitter slowed even crashed many sites servers thought requests virus spyware trying cause denial-of-service attack warning users queries looked like automated requests computer virus spyware application news sites link sitessites whose primary function provide links interesting content elsewhere internetare likely cause phenomenon canonical example slashdot effect receiving traffic slashdot also known reddit hug death digg effect routers also known create unintentional dos attacks d-link netgear routers overloaded ntp servers flooding ntp servers without respecting restrictions client types geographical limitations similar unintentional denials-of-service also occur via media e.g url mentioned television server indexed google another search engine peak periods activity lot available bandwidth indexed also experience effects dos attack legal action taken least one case 2006 universal tube rollform equipment corporation sued youtube massive numbers would-be youtube.com users accidentally typed tube company url utube.com result tube company ended spend large amounts money upgrading bandwidth company appears taken advantage situation utube.com containing ads advertisement revenue march 2014 malaysia airlines flight 370 went missing digitalglobe launched crowdsourcing service users could help search missing jet satellite images response overwhelmed company servers unintentional denial-of-service may also result prescheduled event created website case census australia 2016 could caused server provides service specific time might university website setting grades available result many login requests time computer network security backscatter side-effect spoofed denial-of-service attack kind attack attacker spoofs forges source address ip packets sent victim general victim machine distinguish spoofed packets legitimate packets victim responds spoofed packets normally would response packets known backscatter attacker spoofing source addresses randomly backscatter response packets victim sent back random destinations effect used network telescopes indirect evidence attacks term backscatter analysis refers observing backscatter packets arriving statistically significant portion ip address space determine characteristics dos attacks victims many jurisdictions laws denial-of-service attacks illegal january 7 2013 anonymous posted petition whitehouse.gov site asking ddos recognized legal form protest similar occupy protests claim similarity purpose", + "neighbors": [ + 103, + 134, + 149, + 225, + 320, + 379, + 505, + 515, + 522, + 541, + 566, + 576, + 588, + 604, + 611, + 646, + 701, + 703, + 731, + 739, + 757, + 769, + 771, + 818, + 849, + 856, + 876, + 918, + 961, + 965, + 993, + 1090, + 1121, + 1172, + 1243, + 1258, + 1287, + 1327, + 1368, + 1379, + 1433, + 1453, + 1472, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 364, + "label": 4, + "text": "Cracking_of_wireless_networks:cracking wireless networks cracking wireless network defeating security wireless local-area network back-jack wireless lan commonly used wireless lan wi-fi network wireless lans inherent security weaknesses wired networks exempt wireless cracking information network attack similar direct intrusion two frequent types vulnerabilities wireless lans caused poor configuration caused weak flawed security protocols 802.11 networks use data frames management frames control frames data frames convey real data similar ethernet management frames maintain network configuration connectivity control frames manage access ether prevent access points clients interfering ether information management frames helpful better understand programs reconnaissance wardriving common method wireless network reconnaissance well-equipped wardriver uses laptop computer wireless card antenna mounted car power inverter connected gps receiver way connect internet wirelessly purpose wardriving locate wireless network collect information configuration associated clients laptop computer wireless card must support mode called monitor rfmon netstumbler network discovery program windows free netstumbler become one popular programs wardriving wireless reconnaissance although disadvantage detected easily wireless intrusion detection systems actively probes network collect information netstumbler integrated support gps unit support netstumbler displays gps coordinate information next information discovered network useful finding specific networks sorted collected data latest release netstumbler 1 april 2004 work well 64-bit windows xp windows vista inssider wi-fi network scanner 32-bit 64-bit versions windows xp vista 7 windows 8 android free open source software uses current wireless card wireless usb adapter supports gps devices namely use nmea 2.3 higher graphical user interface shows mac address ssid signal strength hardware brand security network type nearby wi-fi networks also track strength signals show time graph kismet wireless network traffic analyser os x linux openbsd netbsd freebsd wireshark packet sniffer network traffic analyser run popular operating systems support capture wireless traffic limited free open source decoding analysing wireless traffic foremost function wireshark give results obtained programs wireshark requires sufficient knowledge network protocols obtain full analysis traffic however airmagnet laptop analyser airmagnet handheld analyser wireless network analysis tools made airmagnet company started handheld analyser suitable surveying sites wireless networks deployed well finding rogue access points laptop analyser released hand-held product impractical reconnaissance wide areas commercial analysers probably offer best combination powerful analysis simple user interface however well adapted needs wardriver free programs androdumpper android apk used test hack wps wireless routers vulnerability using algorithms hack wifi network runs best android version 5.0+ airopeek packet sniffer network traffic analyser made wildpackets commercial program supports windows works wireless network interface cards become industrial standard capturing analysing wireless traffic however like wireshark airopeek requires thorough knowledge protocols use ability kismac program discovery wireless networks runs os x operating system functionality kismac includes gps support mapping ssid decloaking deauthentication attacks wep cracking two basic types vulnerabilities associated wlans caused poor configuration caused poor encryption poor configuration causes many vulnerabilities wireless networks often put use insufficient security settings security settings \u2013 default configuration \u2013 access obtained simply association without sufficient security settings networks easily defeated cloaking and/or mac address filtering poor encryption causes remaining vulnerabilities wired equivalent privacy wep defective defeated several ways wi-fi protected access wpa cisco lightweight extensible authentication protocol leap vulnerable dictionary attacks wep encryption standard firstly available wireless networks deployed 64 128 bit strength 64 bit wep secret key 40 bits initialisation vector 24 bits often called 40 bit wep 128 bit wep secret key 104 bits initialisation vector 24 bits called 104 bit wep association possible using password ascii key hexadr cracking wep fluhrer mantin shamir attack|fms attack chopping attack fms attack \u2013 named fluhrer mantin shamir \u2013 based weakness rc4 encryption algorithm researchers found 9000 possible 16 million initialisation vectors considered weak collecting enough allows determination encryption key crack wep key cases 5 million encrypted packets must captured collect 3000 weak initialisation vectors cases 1500 vectors cases 5000 needed success weak initialisation vectors supplied rc4 key-scheduling algorithm ksa |key scheduling algorithm ksa rc4 pseudo-random generation algorithm prga |pseudo random generator prng determine first byte wep key procedure repeated remaining bytes key chopping attack chops last byte captured encrypted packets breaks cyclic redundancy check checksum|integrity check value crc/icv 8 bits removed byte zero crc shortened packet made valid manipulation last four bytes manipulation result original xor certain value manipulated packet retransmitted method enables determination key collecting unique initialisation vectors main problem fms attack chopping attack capturing enough packets take weeks sometimes months fortunately speed capturing packets increased injecting packets network one address resolution protocol arp packets usually collected end transmitted access point repeatedly enough response packets captured arp packets good choice recognizable size 28 bytes waiting legitimate arp packet take awhile arp packets commonly transmitted authentication process rather waiting sending deauthentication frame pushes client network require client reauthenticate often creates arp packet wpa developed vulnerabilities wep wpa uses either pre-shared key wpa-psk used combination radius server wpa-radius encryption algorithm wpa uses either temporal key integrity protocol tkip advanced encryption standard aes wi-fi protected access wpa2|wpa2 developed vulnerabilities wpa-psk strengthen encryption wpa2 uses tkip aes requires encryption piece also authentication piece form extensible authentication protocol eap deployed piece wpa-psk attacked psk shorter 21 characters firstly four-way eap lan eapol handshaking|handshake must captured captured legitimate authentication reauthentication forced sending deauthentication packets clients secondly word word-list must cryptographic hash function|hashed hashed message authentication code \u2013 secure hash algorithm 1 two called nonce values along mac address client asked authentication mac address access point gave authentication word-lists found leap uses variation microsoft challenge handshake protocol version 2 ms-chapv2 handshake uses data encryption standard des key selection leap cracked dictionary attack attack involves capturing authentication sequence comparing last two bytes captured response generated word-list wpa-radius cracked however radius authentication server cracked whole network imperilled security authentication servers often neglected wpa2 attacked using wpa-psk attack largely ineffective aircrack-ng runs windows linux crack wep wpa-psk use pychkine-tews-weinmann korek attacks statistical methods efficient traditional fms attack aircrack-ng consists components airmon-ng configures wireless network card airodump-ng captures frames aireplay-ng generates traffic aircrack-ng cracking using data collected airodump-ng finally airdecap-ng decrypts packets captured thus aircrack-ng name suite also one components cowpatty automates dictionary attack wpa-psk runs linux program started using command-line interface specifying word-list contains passphrase dump file contains four-way eapol handshake ssid network void11 program deauthenticates clients runs linux mac address filtering used alone ineffective security measure combination encryption attack determining allowed mac address changing mac address attacker address etherchange one many programs available change mac address network adapters runs windows penetration test ing wireless network often stepping stone penetration testing internal network wireless network serves so-called entry vector wpa-radius use target site another entry vector must investigated 'wireless packet analyzer|sniffer find ip address es helpful network mapping access points usually connect nodes wireless network wired network bridge router bridge router use routing table forward packets finding relevant reachable ip addresses objective reconnaissance phase attacking organization internet relevant ip addresses determined collecting many domain name system|dns host names possible translating ip addresses ip address ranges called footprinting web search engine|search engine key finding much information possible target many cases organizations want protect resources internet access instance web server must accessible many organizations additionally message transfer agent|email servers file transfer protocol|ftp servers systems must accessible internet ip addresses organization often grouped together one ip address found rest probably found around name server store tables show domain names must translated ip addresses vice versa windows command nslookup|nslookup used query dns servers word help entered nslookup prompt list commands given linux command dig used query dns servers displays list options invoked option -h command host reverses ip addresses hostnames program nmap used reverse dns walker nmap -sl 1.1.1.1-30 gives reverse entries given range arin ripe apnic lacnic afrinic five regional internet registry|regional internet registries responsible assignment registration ip addresses website databases searched owner ip address registries respond search name organization list ip address ranges assigned name however records registries always correct cases useless probably computers access internet receive ip address dynamically dynamic host configuration protocol|dhcp protocol become popular last years decrease available ip addresses increase large networks dynamic dhcp particularly important many employees take portable computer one office another router/ firewall computing |firewall device people use home connect internet probably also functions dhcp server nowadays many router/dhcp devices perform network address translation nat nat device gateway telecommunications |gateway local network internet seen internet nat device seems single host nat local network use ip address space ip address ranges reserved private network s. ranges typically used local area network behind nat device 10.0.0.0 10.255.255.255 172.16.0.0 172.31.255.255 192.168.0.0 192.168.255.255 relevant ip addresses must narrowed reachable purpose process scanning enters scene access wireless network gained helpful determine network topology including names computers connected network nmap used available windows linux version however nmap provide user network diagram network scanner network view runs windows program asks one ip address ip address range program finished scanning displays map network using different pictures routers workstation server computing |servers laptop names added direct method finding hosts local area network|lan using program ping networking utility |ping using modern flavour unix shell computing |shell commands combined produce custom ping sweep|ping-sweeps using windows command-line also used create ping-sweep examples given reference ping-sweeps also known host scans nmap used host scan option -sp added nmap -n -sp 10.160.9.1-30 scans first 30 addresses subnet 10.160.9 -n option prevents reverse dns lookups ping packets could reliably determine whether computer line specified ip address nowadays internet control message protocol|icmp echo request packets sometimes blocked firewall operating system although nmap also probes tcp port 80 specifying tcp ports probe recommended pings blocked consequently nmap -sp -ps21,22,23,25,80,139,445,3389 10.160.9.1-30 achieve better results combining various options nmap -sp -ps21,22,23,25,80,135,139,445,1025,3389 -pu53,67,68,69,111,161,445,514 -pe -pp -pm 10.160.9.1-30 superb host scanning achieved nmap available windows unix operating systems offers graphical command-line interfaces purpose port scanning finding open ports computers found host scan port scan started network without making use results host scan much time wasted many ip addresses address range vacant programs communicate internet use either transmission control protocol|tcp user datagram protocol|udp protocol protocols support 65536 called port computer networking |ports programs choose bind allows programs run concurrently one ip address programs default ports often used example http servers commonly use tcp port 80 network scanners try connect tcp udp ports port accepts connection assumed commonly bound program running tcp connections begin syn packet sent client server server responds syn/ack packet finally client sends ack packet scanner sends syn packet gets syn/ack packet back port considered open rst packet received instead port considered closed response received port either considered filtered firewall running host ip address scanning udp ports difficult udp use handshakes programs tend discard udp packets process udp packet sent port program bound icmp error packet returned port considered closed answer received port considered either filtered firewall open many people abandoned udp scanning simple udp scanners distinguish filtered open ports although thorough scan 65536 ports would take time scanning common ports therefore nmap scans 1667 tcp ports default 2007 -p option instructs nmap scan specified ports nmap -p 21-25,80,100-160 10.150.9.46 specifying tcp udp ports also possible nmap -pt:21-25,80 u:5000-5500 10.150.9.46 nmap always requires specification host hosts scan single host specified ip address domain name multiple hosts specified ip address ranges examples 1.1.1.1 www.company.com 10.1.50.1-5,250-254 nmap performs tcp syn scan default scan packets syn flag set -ss option specifies default explicitly nmap started administrator privileges default scan takes effect nmap started user privileges connect scan performed -st option instructs nmap establish full connection scan inferior previous additional packet must sent logging target likely connect scan performed nmap executed user privileges ipv6 addresses scanned -sn option instructs nmap send packets none syn rst ack flags set tcp port closed rst packet sent return tcp port open filtered response null scan often bypass stateless firewall useful stateful firewall employed -su option instructs nmap send udp packets data icmp error returned port assumed closed response received port assumed open filtered differentiation open filtered ports severe limitation -su -sv options instruct nmap use application data application identification combination options lead slow scanning packets sent network faster cope dropped leads inaccurate scanning results intrusion detection system intrusion prevention system present target network detection becomes likely speed increases many intrusion prevention system|ips devices firewalls respond storm syn packets enabling syn cookies make appear every port open full speed scans even wreak havoc stateful firewall|stateful network devices nmap provides five templates adjusting speed also adapts -t0 option makes wait 5 minutes next packet sent -t1 option makes wait 15 seconds -t2 inserts 0.4 seconds -t3 default leaves timing settings unchanged -t4 reduces time-outs retransmissions speed things slightly -t5 reduces time-outs retransmissions even speed things significantly modern ids/ips devices detect scans use -t1 option user also define new template settings use instead provided one -sv option instructs nmap also determine version running application -o option instructs nmap try determine operating systems targets specially crafted packets sent open closed ports responses compared database -ox filename option instructs nmap save output file xml format vulnerability bug application program affects security made public places bugtraq|bugtraq full-disclosure mailing lists computer emergency response team|computer emergency response team cert brings statistical report every year 8064 vulnerabilities counted 2006 alone vulnerability scanning determining whether known vulnerabilities present target exploit computer security |exploit takes advantage software bug|bug application software|application take effect execution arbitrary commands inserting execution path program privilege escalation|escalation privileges bypass authentication infringement confidentiality result metasploit project|metasploit framework released 2003 framework provided first time basic procedure using metasploit choose exploit choose payload set ip address port target start exploit evaluate stop repeat procedure metasploit suited finding vulnerabilities host vulnerability scanner alternatively port scanner found open port exploits port may tried metasploit 3.0 provides following payloads vnc connections need relatively large bandwidth computing |bandwidth usable someone front compromised computer interaction seen quickly command-line interfaces linux os x powerful windows meterpreter payload remedies shortcomings reference gives list meterpreter commands ultimate gratification network intruder always obtain administrator privileges network intruder inside one first undertakings often install so-called rootkit target computer collection programs facilitate durable influence system programs used compromise new user computing user account|user accounts new computers network programs obscure presence intruder obscuring programs may include false versions standard network utilities netstat programs remove data log files computer relate intruder yet programs rootkit may used survey network overhear passwords travelling rootkits may also give means change operating system computer installed network intruder proceeds creating one called backdoor computing |back doors access provisions hard find system administrators serve prevent logging monitoring results normal use network back door may concealed account account privileges escalated may utility remote access telnet configured operate port number customary network intruder proceeds stealing files stealing credit card information preparing computer send spam emails another goal prepare next intrusion cautious intruder protective discovery location method choice use computer already attacked intermediary intruders use series intermediate computers making impracticable locate purpose back door maintain communication channel methods control host gained entry methods include file transfer execution programs often important make sure access communication remains secret access control desirable order prevent others using back door back orifice 2000 designed back door server runs windows client computing |clients windows linux operating systems server configured easily utility configuration server needs uploaded target started back orifice 2000 supports file transfer file execution keystroke logging|logging keystrokes control connections also aes plug-in computing |plug-in traffic encryption stcpio plug-in obfuscation traffic first plug-in adds security combination plug-ins makes much harder ids relate traffic back door information found http //www.bo2k.com rootkits specialize hiding programs hacker defender hxdef open source rootkit windows hide files process windows registry|registry entries port multiple dynamic-link library|dlls although simple command-line interface back door often better use ability hide appropriate tool unprotected wireless network extremely insecure anywhere within broadcast range someone eavesdrop start using network therefore ieee 802.11 standard wireless networks accompanied wired equivalent privacy wep security protocol takes care following wep criticized security experts experts regard ineffective 2004 draft better security protocol appeared included ieee 802.11 standard 2007 new protocol ieee 802.11i-2004|wpa2 uses aes block cipher instead rc4 algorithm better procedures authentication key distribution wpa2 much secure wep wep still wide use 2009 many wireless routers also support controlling mac addresses computers authorized use wireless network measure effectively stop neighbour using network experienced intruders stopped mac filtering attacked mac address faked easily past turning broadcasting ssid also thought give security wireless network case however freely available tools exist quickly discover ssid broadcast microsoft also determined switching broadcasting ssid leads less security details found non-broadcast wireless networks microsoft windows returning encryption wep specification encryption strength unable withstand determined hacking therefore wi-fi protected access wpa derived wep software upgrades often available latest devices conform ieee 802.11g-2003|802.11g ieee 802.11n-2009|802.11n standards also support wpa2 wpa uses tkip encryption wpa2 uses stronger aes method recommended use hardware supports wpa wpa2 installing updates regularly disabling wps setting custom ssid requiring wpa2 using strong password make wireless router difficult crack even unpatched security flaws router software firmware may still used attacker bypass encryption gain control device many router manufacturers always provide security updates timely manner especially inexpensive models wps currently severe vulnerability 8 pin numbered 0-9 passwords used easily split two halves means half brute-forced individually possible combinations greatly lessened 10^4 10^4 opposed 10^8 vulnerability addressed manufacturers days using lock mechanism router automatically lock wps number failed pin attempts take number hours router automatically unlock even rebooted make wps attacks completely obsolete without lock feature wpa2 router wps enabled easily cracked 5 hours using brute force wps attack ssid used routers identify within mass 2.4 3.6 5 60 ghz frequencies currently flying around cities also used seed router password hashes standard popular ssid netgear brute forced use rainbow table however use salt greatly improves security rainbow tables popular method wpa wpa2 cracking obtaining known 4 way handshake device connecting network 4-stage authorization process referred 4 way handshake wireless device undergoes process handshake sent air easily monitored saved external system handshake encrypted router password means opposed communicating router directly quite slow cracker attempt brute force handshake using dictionary attacks device connected directly router still undergo process however handshake sent connected wire opposed air intercepted 4 way handshake already intercepted mean cracker granted immediate access however password used contains least 12 characters consisting random upper lower case letters numbers spell word name pattern password essentially uncrackable give example let take minimum 8 characters wpa2 suppose take upper case lower case letters digits 0-9 small selection symbols avail hefty choice 64 characters 8 character length password grand total 64^8 possible combinations taking single machine could attempt 500 passwords per second gives us 17,900 years attempt every possible combination even mention amount space necessary store combination dictionary note use mac filtering protect network work macs using network easily detected spoofed network scanner sniffer application program makes use wireless network interface card repeatedly tunes wireless card successively number radio channels network detector passive scanning|passive scanner pertains receiver wireless card therefore scanning detected attacker obtain considerable amount information passive scanner information may obtained sending crafted frames provoke useful responses called active scanning probing active scanning also involves use transmitter wireless card activity therefore detected wireless card located detection possible intrusion detection system wireless networks locating possible suitable equipment wireless intrusion detection systems designed detect anomalous behaviour one sensors collect ssids radio channels beacon intervals encryption mac addresses transmission speeds signal-to-noise ratio s. wireless intrusion detection systems maintain registry mac addresses unknown clients detected making use someone else wireless access point wireless router connect internet \u2013 without owner consent way \u2013 punishable criminal law netherlands true even device uses form access protection penetrate someone else computer without owner consent punishable criminal law though consensus computer attackers divided following groups term hacker originally used someone could modify computer purposes hacking intrusion combined direct alteration security data structures breached system word hacking often confused cracking popular media discourse obfuscates fact hacking less eavesdropping related interference alteration however consistent abuse news media 2007 term hacker commonly used someone accesses network computer without authorization owner 2011 collins english dictionary|collins dictionary stated word hacker mean computer fanatic particular one means personal computer breaks computer system company government like also denoted sense word hacker slang slang words appropriate formal writing speech computer experts reserve word hacker clever programmer call someone breaks computers intruder attacker cracker category computer network security category computer security category cryptographic attacks category data security category dutch law category hacking computer security category local area networks category wi-fi category wireless networking", + "neighbors": [ + 11, + 134, + 138, + 149, + 162, + 171, + 310, + 405, + 425, + 444, + 608, + 646, + 692, + 703, + 739, + 757, + 764, + 800, + 856, + 902, + 955, + 961, + 993, + 1015, + 1027, + 1042, + 1138, + 1200, + 1243, + 1279, + 1337, + 1379, + 1451, + 1552, + 1570 + ], + "mask": "Train" + }, + { + "node_id": 365, + "label": 6, + "text": "Computer_file:computer file computer file computer resource recording data discretely computer storage device words written paper information written computer file files edited transferred internet particular computer system different types computer files designed different purposes file may designed store picture written message video computer program wide variety kinds data types files store several types information using computer programs person open read change save close computer file computer files may reopened modified copied arbitrary number times typically files organised file system keeps track files located disk enables user access word file derives latin filum thread file used context computer storage early january 1940 punched card methods scientific computation w.j eckert stated first extensive use early hollerith tabulator astronomy made comrie used building table successive differences adding large numbers harmonic terms tables functions constructed differences great efficiency either printed tables file punched cards february 1950 radio corporation america rca advertisement popular science magazine describing new memory vacuum tube developed rca stated results countless computations kept 'on file taken 'file exists 'memory tube developed rca laboratories electronically retains figures fed calculating machines holds storage memorizes new ones speeds intelligent solutions mazes mathematics 1952 file denoted inter alia information stored punched cards early use underlying hardware rather contents stored denominated file example ibm 350 disk drives denominated disk files introduction circa 1961 burroughs mcp mit compatible time-sharing system concept file system managed several virtual files one storage device origin contemporary denotation word although contemporary register file demonstrates early concept files use greatly decreased modern operating systems files organized one-dimensional arrays bytes format file defined content since file solely container data although platforms format usually indicated filename extension specifying rules bytes must organized interpreted meaningfully example bytes plain text file windows associated either ascii utf-8 characters bytes image video audio files interpreted otherwise file types also allocate bytes metadata allows file carry basic information file systems store arbitrary interpreted file system file-specific data outside file format linked file example extended attributes forks file systems done via sidecar files software-specific databases methods however susceptible loss metadata container archive file formats instant time file might size normally expressed number bytes indicates much storage associated file modern operating systems size non-negative whole number bytes system limit many older operating systems kept track number blocks tracks occupied file physical storage device systems software employed methods track exact byte count e.g. cp/m used special control character ctrl-z signal end text files general definition file require size real meaning however unless data within file happens correspond data within pool persistent storage special case zero byte file files newly created files yet data written may serve kind flag file system accidents results aborted disk operations example file link points typical unix-like system probably defined size seldom changes compare also file size may obscure information computer file consist smaller packets information often called records lines individually different share common traits example payroll file might contain information concerning employees company payroll details record payroll file concerns one employee records common trait related payroll\u2014this similar placing payroll information specific filing cabinet office computer text file may contain lines text corresponding printed lines piece paper alternatively file may contain arbitrary binary image blob may contain executable way information grouped file entirely designed led plethora less standardized file structures imaginable purposes simplest complex computer files used computer programs create modify delete files use as-needed basis programmers create programs decide files needed used often names cases computer programs manipulate files made visible computer user example word-processing program user manipulates document files user personally names although content document file arranged format word-processing program understands user able choose name location file provide bulk information words text stored file many applications pack data files single file called archive file using internal markers discern different types information contained within benefits archive file lower number files easier transfer reduce storage usage organize outdated files archive file must often unpacked next using basic operations programs perform file files computer created moved modified grown shrunk deleted cases computer programs executed computer handle operations user computer also manipulate files necessary instance microsoft word files normally created modified microsoft word program response user commands user also move rename delete files directly using file manager program windows explorer windows computers command lines cli unix-like systems user space programs operate directly low level file kernel deals files handles user-space interaction files manner transparent user-space programs operating system provides level abstraction means interaction file user-space simply filename instead file descriptor example rm filename delete file link file many links file removed kernel considers file memory space free reallocated free space commonly considered security risk due existence file recovery software secure-deletion program uses kernel-space system functions wipe file data modern computer systems files typically accessed using names filenames operating systems name associated file others file anonymous pointed links names latter case user identify name link file false analogue especially exists one link file files links files located directories however generally directory contain either list files list links files within definition paramount importance term file includes directories permits existence directory hierarchies i.e. directories containing sub-directories name refers file within directory must typically unique words must identical names within directory however operating systems name may include specification type means directory contain identical name one type object directory file environments file named file name path file directory must uniquely identify among files computer system\u2014no two files name path file anonymous named references exist within namespace cases name within namespace refer exactly zero one file however file may represented within namespace zero one names string characters may well-formed name file link depending upon context application whether name well-formed depends type computer system used early computers permitted letters digits name file modern computers allow long names 255 characters containing almost combination unicode letters unicode digits making easier understand purpose file glance computer systems allow file names contain spaces others case-sensitivity file names determined file system unix file systems usually case sensitive allow user-level applications create files whose names differ case characters microsoft windows supports multiple file systems different policies regarding case-sensitivity common fat file system multiple files whose names differ case user uses disk editor edit file names directory entries user applications however usually allow user create multiple files name differing case computers organize files hierarchies using folders directories catalogs concept irrespective terminology used folder contain arbitrary number files also contain folders folders referred subfolders subfolders contain still files folders thus building tree-like structure one master folder root folder \u2014 name varies one operating system another contain number levels folders files folders named files except root folder often name use folders makes easier organize files logical way computer allows use folders file folder name also path identifies folder folders file folder resides path sort special character\u2014such slash\u2014is used separate file folder names example illustration shown article path uniquely identifies file called folder called turn contained folder called folder file names separated slashes example topmost root folder name path begins slash root folder name would precede first slash many computer systems use extensions file names help identify contain also known file type windows computers extensions consist dot period end file name followed letters identify type file extension identifies text file extension identifies type document documentation commonly microsoft word file format even extensions used computer system degree computer system recognizes heeds vary systems required systems completely ignored presented many modern computer systems provide methods protecting files accidental deliberate damage computers allow multiple users implement file permissions control may may modify delete create files folders example given user may granted permission read file folder modify delete user may given permission read modify files folders execute permissions may also used allow certain users see contents file folder permissions protect unauthorized tampering destruction information files keep private information confidential unauthorized users another protection mechanism implemented many computers read-only flag flag turned file accomplished computer program human user file examined modified flag useful critical information must modified erased special files used internal parts computer system systems also include hidden flag make certain files invisible flag used computer system hide essential system files users alter file useful purpose must physical manifestation file abstract concept real computer system must real physical analogue exist physical terms computer files stored type data storage device example operating systems store files hard disk hard disks ubiquitous form non-volatile storage since early 1960s files contain temporary information may stored ram computer files also stored media cases magnetic tapes compact discs digital versatile discs zip drives usb flash drives etc use solid state drives also beginning rival hard disk drive unix-like operating systems many files associated physical storage device examples files directories virtual files exist objects within operating system kernel seen running user program files usually represented either file control block file handle file control block fcb area memory manipulated establish filename etc passed operating system parameter used older ibm operating systems early pc operating systems including cp/m early versions ms-dos file handle generally either opaque data type integer introduced around 1961 algol-based burroughs mcp running burroughs b5000 ubiquitous file said corrupted contents saved computer way ca n't properly read either human software depending extension damage original file sometimes recovered least partially understood file may created corrupt may corrupted later point overwriting many ways file become corrupted commonly issue happens process writing file disk example image-editing program unexpectedly crashes saving image file may corrupted program could n't save entirety program might warn user error allowing another attempt saving file examples reasons files become corrupted include although file corruption usually happens accidentally may also done purpose fool someone else thinking assignment ready earlier date potentially gaining time finish said assignment services provide demand file corruption essentially fill given file random data ca n't opened read yet still seems legitimate one effective countermeasures file corruption backing important files event important file becoming corrupted user simply replace backed version computer files contain information extremely important back-up process used protect disasters might destroy files backing files simply means making copies files separate location restored something happens computer deleted accidentally many ways back files computer systems provide utility programs assist back-up process become time-consuming many files safeguard files often copied removable media writable cds cartridge tapes copying files another hard disk computer protects failure one disk necessary protect failure destruction entire computer copies files must made media taken away computer stored safe distant location grandfather-father-son backup method automatically makes three back-ups grandfather file oldest copy file son current copy way computer organizes names stores manipulates files globally referred file system computers least one file system computers allow use several different file systems instance newer ms windows computers older fat-type file systems ms-dos old versions windows supported addition ntfs file system normal file system recent versions windows system advantages disadvantages standard fat allows eight-character file names plus three-character extension spaces example whereas ntfs allows much longer names contain spaces call file ntfs fat would restricted something like unless using vfat fat extension allowing long file names file manager programs utility programs allow users manipulate files directly allow move create delete rename files folders although actually allow read contents file store information every computer system provides least one file-manager program native file system example file explorer formerly windows explorer commonly used microsoft windows operating systems nautilus common several distributions linux", + "neighbors": [ + 14, + 117, + 153, + 195, + 233, + 249, + 272, + 278, + 326, + 330, + 338, + 347, + 434, + 460, + 494, + 495, + 505, + 509, + 518, + 524, + 570, + 646, + 728, + 754, + 772, + 782, + 797, + 904, + 930, + 961, + 982, + 1025, + 1090, + 1104, + 1121, + 1138, + 1187, + 1188, + 1221, + 1225, + 1252, + 1304, + 1306, + 1324, + 1415, + 1533 + ], + "mask": "Test" + }, + { + "node_id": 366, + "label": 7, + "text": "AppFolio:appfolio appfolio founded 2006 offers software-as-a-service saas applications vertical markets appfolio initially focused property management software acquisition mycase 2012 expanded law practice management industry company \u2019 headquarters goleta california united states also offices san diego california dallas texas appfolio established 2006 co-founders klaus schauser jon walker schauser previously founded expertcity company \u2019 first focus property management small-to-medium businesses first product appfolio property manager launched 2007 november 2012 appfolio acquired mycase legal practice management software provider appfolio purchased real estate software firm rentlinx april 2015 acquisition included rights website showmetherent.com expanded sphere appfolio \u2019 clients provided greater listing presence may 2015 appfolio announced ipo unveiled june raised 74 million 2019 appfolio acquired dynasty marketplace inc. leading provider advanced artificial intelligence ai solutions real estate market 2019 2018 2017 2016 2015 2014", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 367, + "label": 3, + "text": "Aliens:_The_Computer_Game_(1987_video_game):aliens computer game 1987 video game aliens computer game also known aliens video game developed software studios published electric dreams software 1987 initially amstrad cpc commodore 64 zx spectrum based film title ports commodore 16 msx developed mr. micro published 1987 aliens computer game played first-person perspective set inside atmosphere processing plant maze complex consisting 255 rooms player encounters alien enemies throughout game upon killing alien body leaves deadly pool acid blood must avoided player also faces threat bio-mechanical growth left uncontained results new alien eggs facehugger enemies player ultimate goal reach room houses queen alien nests must destroyed player directly control team marine soldiers issue orders team mobile tactical operations bay mtob playing mtob player view team surroundings via video cameras attached soldier helmet according retro gamer game praised computing press zzap amstrad action sinclair user awarded 81 90 5/5 respectively crash gave score 84 one reviewer declaring best game-of-the-film date review zzap 64 also opined best tie-in game date good game boot computer gamer gave excellent game superb film overall score 80 commodore user gave 8 10 sinclair gave 9 10 1993 commodore force ranked game number 59 list top 100 commodore 64 games retro gamer retrospective darren jones opined despite incredible basic look aliens dripped atmosphere quite unlike movie conversion time bloody good first-person view used game perfectly matched moment film pumped-up marines start exploring deserted base game progressed managed capture terror confusion movie way titles managed magazine also declared scariest 8-bit game ever made stephen kleckner gamesbeat wrote may lack audio/visual punch gameplay tightly defined forward-thinking time also recommended windows fan remake aliens titled lv-426", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 368, + "label": 0, + "text": "Natural-language_generation:natural-language generation natural-language generation nlg software process transforms structured data natural language used produce long form content organizations automate custom reports well produce custom content web mobile application also used generate short blurbs text interactive conversations chatbot might even read loud text-to-speech system automated nlg compared process humans use turn ideas writing speech psycholinguists prefer term language production process also described mathematical terms modeled computer psychological research nlg systems also compared translators artificial computer languages decompilers transpilers also produce human-readable code generated intermediate representation human languages tend considerably complex allow much ambiguity variety expression programming languages makes nlg challenging nlg may viewed opposite natural-language understanding whereas natural-language understanding system needs disambiguate input sentence produce machine representation language nlg system needs make decisions put concept words practical considerations building nlu vs. nlg systems symmetrical nlu needs deal ambiguous erroneous user input whereas ideas system wants express nlg generally known precisely nlg needs choose specific self-consistent textual representation many potential representations whereas nlu generally tries produce single normalized representation idea expressed nlg existed long time commercial nlg technology recently become widely available nlg techniques range simple template-based systems like mail merge generates form letters systems complex understanding human grammar nlg also accomplished training statistical model using machine learning typically large corpus human-written texts pollen forecast scotland system simple example simple nlg system could essentially template system takes input six numbers give predicted pollen levels different parts scotland numbers system generates short textual summary pollen levels output example using historical data july 1 2005 software produces grass pollen levels friday increased moderate high levels yesterday values around 6 7 across parts country however northern areas pollen levels moderate values 4 contrast actual forecast written human meteorologist data pollen counts expected remain high level 6 scotland even level 7 south east relief northern isles far northeast mainland scotland medium levels pollen count comparing two illustrates choices nlg systems must make discussed process generate text simple keeping list canned text copied pasted possibly linked glue text results may satisfactory simple domains horoscope machines generators personalised business letters however sophisticated nlg system needs include stages planning merging information enable generation text looks natural become repetitive typical stages natural-language generation proposed dale reiter content determination deciding information mention text instance pollen example deciding whether explicitly mention pollen level 7 south east document structuring overall organisation information convey example deciding describe areas high pollen levels first instead areas low pollen levels aggregation merging similar sentences improve readability naturalness instance merging two following sentences following single sentence lexical choice putting words concepts example deciding whether medium moderate used describing pollen level 4 referring expression generation creating referring expressions identify objects regions example deciding use northern isles far northeast mainland scotland refer certain region scotland task also includes making decisions pronouns types anaphora realization creating actual text correct according rules syntax morphology orthography example using future tense alternative approach nlg use end-to-end machine learning build system without separate stages words build nlg system training machine learning algorithm often lstm large data set input data corresponding human-written output texts end-to-end approach perhaps successful image captioning automatically generating textual caption image popular media paid attention nlg systems generate jokes see computational humor commercial perspective successful nlg applications data-to-text systems generate textual summaries databases data sets systems usually perform data analysis well text generation research shown textual summaries effective graphs visuals decision support computer-generated texts superior reader perspective human-written texts first commercial data-to-text systems produced weather forecasts weather data earliest system deployed fog used environment canada generate weather forecasts french english early 1990s success fog triggered work research commercial recent applications include uk met office text-enhanced forecast currently considerable commercial interest using nlg summarise financial business data indeed gartner said nlg become standard feature 90 modern bi analytics platforms nlg also used commercially automated journalism chatbots generating product descriptions e-commerce sites summarising medical records enhancing accessibility example describing graphs data sets blind people example interactive use nlg wysiwym framework stands see meant allows users see manipulate continuously rendered view nlg output underlying formal language document nlg input thereby editing formal language without learning content generation systems assist human writers makes writing process efficient effective content generation tool based web mining using search engines apis built tool imitates cut-and-paste writing scenario writer forms content various search results relevance verification essential filter irrelevant search results based matching parse tree query parse trees candidate answers alternative approach high-level structure human-authored text used automatically build template new topic automatically written wikipedia article several companies started since 2009 build systems transform data narrative using nlg ai techniques include narrative science phrasetech arria nlg automated insights retresco visual nlg yseop united robots scientific fields nlg researchers need test well systems modules algorithms work called evaluation three basic techniques evaluating nlg systems ultimate goal useful nlg systems helping people first techniques however task-based evaluations time-consuming expensive difficult carry especially require subjects specialised expertise doctors hence areas nlp task-based evaluations exception norm recently researchers assessing well human-ratings metrics correlate predict task-based evaluations work conducted context generation challenges shared-task events initial results suggest human ratings much better metrics regard words human ratings usually predict task-effectiveness least degree although exceptions ratings produced metrics often predict task-effectiveness well results preliminary case human ratings popular evaluation technique nlg contrast machine translation metrics widely used", + "neighbors": [ + 159, + 282, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1511, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 369, + "label": 4, + "text": "SciEngines_GmbH:sciengines gmbh sciengines gmbh privately owned company founded 2007 spin-off copacobana project universities bochum kiel germany project intended create platform affordable custom hardware attack copacobana massively-parallel reconfigurable computer utilized perform so-called brute force attack recover des encrypted data consists 120 commercially available reconfigurable integrated circuits fpgas xilinx spartan3-1000 run parallel create massively parallel system since 2007 sciengines gmbh enhanced developed successors copacobana furthermore copacobana become well known reference platform cryptanalysis custom hardware based attacks symmetric asymmetric cyphers stream ciphers 2008 attacks a5/1 stream cipher encryption system used encrypt voice streams gsm published first known real world attack utilizing off-the-shelf custom hardware introduced 2008 rivyera s3-5000 enhancing performance computer dramatically via using 128 spartan-3 5000 currently sciengines rivyera holds record brute-force breaking des utilizing 128 spartan-3 5000 fpgas current systems provide unique density 256 spartan-6 fpgas per single system enabling scientific utilization beyond field cryptanalysis like bioinformatics providing standard off-the-shelf intel cpu mainboard integrated fpga computer rivyera systems allow execute standard code without modifications sciengines aims programmers focus porting time consuming 5 code fpga therefore bundle eclipse like development environment allows code implementation hardware based implementation languages e.g vhdl verilog well c based languages application programming interface c c++ java fortran allow scientists programmers adopt code benefit application-specific hardware architecture", + "neighbors": [ + 306, + 544, + 579, + 591, + 1572 + ], + "mask": "Test" + }, + { + "node_id": 370, + "label": 1, + "text": "IFIS_Publishing:ifis publishing ifis academic publishing company not-for-profit organisation operating sciences regulations food health based reading ifis produces online bibliographic databases fsta resource company offered since 1969 along escalex launched 2017 fsta food science technology abstracts includes 1.4 million scientific non-predatory records trusted sources related disciplines surrounding food beverages ifis also produces association wiley blackwell dictionary food science technology second edition not-for-profit charitable organisation ifis offers access researchers developing countries research4life programmes hinari agora escalex created collaboration molecular connections launched april 2017 allows search retrieval food beverage food law information various geographies across globe originally known international food information service ifis established 1968 collaboration four organisations company originally based lane end house shinfield though recently moved granary bridge farm arborfield fsta bibliographic abstracting indexing database scientific technological information relating food beverages nutrition contains 1.3 million indexed records full-text links available covering 5,475 active historical journals books trade publications reviews conference proceedings reports patents standards database updated weekly records indexed ifis thesaurus containing 12,346 food science keywords curated structured hierarchies resource used researchers industry practitioners students contains information sources 29 languages sourced publishers 60 countries coverage includes major commodities food beverage industry related applied pure sciences pet foods food psychology food economics food safety fsta accessed ebscohost ovid proquest dialog stn web science", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 371, + "label": 3, + "text": "Theatre_Europe:theatre europe theatre europe turn-based strategy video game developed published personal software services first released united kingdom commodore 64 zx spectrum amstrad cpc atari 8-bit home computers 1985 later released france ere informatique 1986 released united states datasoft later year also ported tatung einstein home computer 1989 exclusively united kingdom fifth instalment strategic wargames series game set fictional war europe nato warsaw pact sides use nuclear chemical weapons main objective game fight conventional battles continental europe whilst trying avoid worldwide nuclear holocaust throughout game various capital cities civilian populations destroyed nuclear weapons game end either side forced surrender entire population europe perishes order request nuclear strike player required call dedicated telephone number led automated message announcing authorisation code development developers obtained extensive information statistics military strength ministry defence soviet embassy london theatre europe gained national controversy upon release receiving criticism campaign nuclear disarmament cnd sun newspaper high street retail chains refused sell game upon release despite controversy game received critical acclaim reviewers praise directed accuracy playability value money best strategy game award 1985 golden joystick awards nominated game year title game turn-based strategy revolves around fictional conflict powers nato allies warsaw pact player choice choosing either nato warsaw pact collectively referred soviet forces demo computer versus computer option game plays game takes place period 30 in-game days one day equal one round three types difficulty level one unless provoked enemy use nuclear weapons whilst levels two three enable enemy use nuclear chemical attacks prevent player winning game main feature game focused map europe western russia displays accurate terrain mountain ranges major cities borders military forces belonging side game also features arcade sequence involves shooting enemy units order secure combat bonuses gameplay mode however ignored changing game settings arcade sequences turned player notified choose battle map depending area chosen illustration battle commencing countryside city presented various forms military equipment including aeroplanes helicopters tanks player must shoot destroy enemy units using cursor similar style missile command outcome arcade sequence affect game performing poorly result severe losses throughout round combat resolved player must move assemble forces continental europe known movement phase two special units exclusively available warsaw pact 1st airborne army flown directly behind enemy lines 1st amphibious army move sea tactical attack point units moved cursor one may moved time units moved within round attack phase begin amount friendly units may attack opposing army however unit dispatched battle stopped current attack phase concludes attacking phase separate screen displaying combat information enemy numbers casualties displayed screen detailing attacking phase turned settings battle instead decided warrants air superiority armaments battle sequences player opportunity rebuild units allocating quantity armament supplies air support issued friendly unit map rebuilding ground units game move onto air phase consists commanding aircraft aeroplanes bombers limited number reserve air units several options allocating air forces include counter air strikes reconnaissance enemy movement interdiction assault breakers deep strikes counter air strikes involve attacks enemy air bases whereas interdiction involves aircraft sent behind enemy lines order attack supply movement networks interdiction aircraft discovered enemy territory chance side respond retaliatory nuclear strike remaining three aircraft options attack single unit strike enemy territory attack railways order disable enemy reinforcements respectively game allows player request chemical nuclear tactical strikes enemy chemical attack automatically targeted enemy capital city conclude readout announcing outcome attack civilian casualties order launch strategic nuclear attack player given 30 seconds call dedicated 1-800 telephone number obtain special authorisation code automated answerphone message authorisation code 'midnight sun authorisation code received player given three separate options proceed standby mode postpone nuclear launch whereas strategic launch involve one nuclear warhead targeting city third option known fire-plan issue full-scale nuclear strike across europe may result nuclear holocaust end game personal software services founded coventry west midlands gary mays richard cockayne 1981 company known creating games revolved around historic battles conflicts battle britain bismarck falklands '82 company partnership french video game developer ere informatique published localised versions products united kingdom 1986 cockayne took decision alter products release 16-bit consoles found smaller 8-bit consoles zx spectrum lacked processing power larger strategy games decision falsely interpreted pulling spectrum market video game journalist phillipa irving following years successful sales throughout mid-1980s personal software services experienced financial difficulties cockayne admitted retrospective interview took eye ball company acquired mirrorsoft february 1987 later dispossessed company due strains debt interview computer magazine richard cockayne stated theatre europe received heavy criticism campaign nuclear disarmament cnd sun newspaper respectively cnd accused developers bad taste despite cockayne claiming organisation never looked product development game cockayne mays obtained figures statistics various military strength ministry defence soviet embassy london cockayne asserted statistics developers gained realistically plausible stating would let horrifying results speak game game designer alan steel stated testing alarmed discover computer played warsaw pact always conventional war overwhelmingly forcing nato either surrender begin nuclear war steel adjusted game give nato chance win theatre europe first released united kingdom commodore 64 zx spectrum amstrad cpc atari 8-bit home computers 1985 re-released france united states consoles 1986 due lobbying cnd high street outlets boots john menzies refused sell game stores former finding morally offensive game received critical acclaim upon release gwyn hughes sinclair defended accuracy morality game stating bad taste game well researched program thought would give player insight nature modern war philippa irving crash similarly stated theatre europe offered usual run-of-the-mill war game heralded simplistic nature adding novice gamers would get ease john gilbert sinclair user added scepticism developer intention making something serious opposed titles however praised game brilliant chilling simulation reviewer writing zx computing similarly stated game superbly chilling extremely well-presented reviewer computer video games criticised inferior graphics zx spectrum stating bit flawed comparison commodore 64 version mark reed computer gamer noted game attracted media attention despite objective game discouraging use nuclear weapons reed praised presentation gameplay also stating use joystick keyboard excellent reviewer zzap 64 heralded presentation value money stating overall special indeed reviewer also gave praise sound suggesting game featured one best pieces micro music ever antic stated atari 8-bit version execution uneven magazine reported arcade portion quickly becomes nuisance nato could defeat warsaw pact lack balance flaws exist commodore 64 version peter connor advanced computer entertainment said theatre europe gift regards value money level playability 1994 survey wargames computer gaming world gave title two-plus stars five stating rendered obsolete history game play game best strategy game award 1985 golden joystick awards also nominated game year title", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 372, + "label": 0, + "text": "Stemming:stemming linguistic morphology information retrieval stemming process reducing inflected sometimes derived words word stem base root form\u2014generally written word form stem need identical morphological root word usually sufficient related words map stem even stem valid root algorithms stemming studied computer science since 1960s many search engines treat words stem synonyms kind query expansion process called conflation computer program subroutine stems word may called stemming program stemming algorithm stemmer stemmer english operating stem cat identify strings cats catlike catty stemming algorithm might also reduce words fishing fished fisher stem fish stem need word example porter algorithm reduces argue argued argues arguing argus stem argu first published stemmer written julie beth lovins 1968 paper remarkable early date great influence later work area paper refers three earlier major attempts stemming algorithms professor john w. tukey princeton university algorithm developed harvard university michael lesk direction professor gerard salton third algorithm developed james l. dolby r consultants los altos california later stemmer written martin porter published july 1980 issue journal program stemmer widely used became de facto standard algorithm used english stemming dr. porter received tony kent strix award 2000 work stemming information retrieval many implementations porter stemming algorithm written freely distributed however many implementations contained subtle flaws result stemmers match potential eliminate source error martin porter released official free software mostly bsd-licensed implementation algorithm around year 2000 extended work next years building snowball framework writing stemming algorithms implemented improved english stemmer together stemmers several languages paice-husk stemmer developed chris paice lancaster university late 1980s iterative stemmer features externally stored set stemming rules standard set rules provides 'strong stemmer may specify removal replacement ending replacement technique avoids need separate stage process recode provide partial matching paice also developed direct measurement comparing stemmers based counting over-stemming under-stemming errors several types stemming algorithms differ respect performance accuracy certain stemming obstacles overcome simple stemmer looks inflected form lookup table advantages approach simple fast easily handles exceptions disadvantages inflected forms must explicitly listed table new unfamiliar words handled even perfectly regular e.g cats cat table may large languages simple morphology like english table sizes modest highly inflected languages like turkish may hundreds potential inflected forms root lookup approach may use preliminary part-of-speech tagging avoid overstemming lookup table used stemmer generally produced semi-automatically example word run inverted algorithm might automatically generate forms running runs runned runly last two forms valid constructions unlikely.. suffix stripping algorithms rely lookup table consists inflected forms root form relations instead typically smaller list rules stored provides path algorithm given input word form find root form examples rules include suffix stripping approaches enjoy benefit much simpler maintain brute force algorithms assuming maintainer sufficiently knowledgeable challenges linguistics morphology encoding suffix stripping rules suffix stripping algorithms sometimes regarded crude given poor performance dealing exceptional relations like 'ran 'run solutions produced suffix stripping algorithms limited lexical categories well known suffixes exceptions however problem parts speech well formulated set rules lemmatisation attempts improve upon challenge prefix stripping may also implemented course languages use prefixing suffixing suffix stripping algorithms may differ results variety reasons one reason whether algorithm constrains whether output word must real word given language approaches require word actually exist language lexicon set words language alternatively suffix stripping approaches maintain database large list known morphological word roots exist real words approaches check list existence term prior making decision typically term exist alternate action taken alternate action may involve several criteria non-existence output term may serve cause algorithm try alternate suffix stripping rules case two suffix stripping rules apply input term creates ambiguity rule apply algorithm may assign human hand stochastically priority one rule another algorithm may reject one rule application results non-existent term whereas overlapping rule example given english term friendlies algorithm may identify ies suffix apply appropriate rule achieve result friendl friendl likely found lexicon therefore rule rejected one improvement upon basic suffix stripping use suffix substitution similar stripping rule substitution rule replaces suffix alternate suffix example could exist rule replaces ies affects algorithm varies algorithm design illustrate algorithm may identify ies suffix stripping rule well suffix substitution rule apply since stripping rule results non-existent term lexicon substitution rule substitution rule applied instead example friendlies becomes friendly instead friendl diving details common technique apply rules cyclical fashion recursively computer scientists would say applying suffix substitution rule example scenario second pass made identify matching rules term friendly ly stripping rule likely identified accepted summary friendlies becomes via substitution friendly becomes via stripping friend example also helps illustrate difference rule-based approach brute force approach brute force approach algorithm would search friendlies set hundreds thousands inflected word forms ideally find corresponding root form friend rule-based approach three rules mentioned would applied succession converge solution chances brute force approach would slower lookup algorithms direct access solution rule-based try several options combinations choose result seems best complex approach problem determining stem word lemmatisation process involves first determining part speech word applying different normalization rules part speech part speech first detected prior attempting find root since languages stemming rules change depending word part speech approach highly conditional upon obtaining correct lexical category part speech overlap normalization rules certain categories identifying wrong category unable produce right category limits added benefit approach suffix stripping algorithms basic idea stemmer able grasp information word stemmed apply accurate normalization rules unlike suffix stripping rules also modify stem stochastic algorithms involve using probability identify root form word stochastic algorithms trained learn table root form inflected form relations develop probabilistic model model typically expressed form complex linguistic rules similar nature suffix stripping lemmatisation stemming performed inputting inflected form trained model model produce root form according internal ruleset similar suffix stripping lemmatisation except decisions involved applying appropriate rule whether stem word return word whether apply two different rules sequentially applied grounds output word highest probability correct say smallest probability incorrect typically measured lemmatisation algorithms stochastic given word may belong multiple parts speech probability assigned possible part may take account surrounding words called context context-free grammars take account additional information either case assigning probabilities possible part speech likely part speech chosen appropriate normalization rules applied input word produce normalized root form stemming techniques use n-gram context word choose correct stem word hybrid approaches use two approaches described unison simple example suffix tree algorithm first consults lookup table using brute force however instead trying store entire set relations words given language lookup table kept small used store minute amount frequent exceptions like ran run word exception list apply suffix stripping lemmatisation output result linguistics term affix refers either prefix suffix addition dealing suffixes several approaches also attempt remove common prefixes example given word indefinitely identify leading prefix removed many approaches mentioned earlier apply go name affix stripping study affix stemming several european languages found algorithms use stem database example set documents contain stem words stems mentioned necessarily valid words rather common sub-strings brows browse browsing order stem word algorithm tries match stems database applying various constraints relative length candidate stem within word example short prefix stem words would considered stem word beside .. much early academic work area focused english language significant use porter stemmer algorithm many languages investigated hebrew arabic still considered difficult research languages stemming english stemmers fairly trivial occasional problems dries third-person singular present form verb dry axes plural axe well axis stemmers become harder design morphology orthography character encoding target language becomes complex example italian stemmer complex english one greater number verb inflections russian one complex noun declensions hebrew one even complex due nonconcatenative morphology writing system without vowels requirement prefix stripping hebrew stems two three four characters multilingual stemming applies morphological rules two languages simultaneously instead rules single language interpreting search query commercial systems using multilingual stemming exist two error measurements stemming algorithms overstemming understemming overstemming error two separate inflected words stemmed root been\u2014a false positive understemming error two separate inflected words stemmed root not\u2014a false negative stemming algorithms attempt minimize type error although reducing one type lead increasing example widely used porter stemmer stems universal university universe univers case overstemming though three words etymologically related modern meanings widely different domains treating synonyms search engine likely reduce relevance search results example understemming porter stemmer alumnus \u2192 alumnu alumni \u2192 alumni alumna alumnae \u2192 alumna english word keeps latin morphology near-synonyms conflated stemming used approximate method grouping words similar basic meaning together example text mentioning daffodils probably closely related text mentioning daffodil without cases words morphological stem idiomatic meanings closely related user searching marketing satisfied documents mentioning markets marketing stemmers common elements query systems web search engines effectiveness stemming english query systems soon found rather limited however led early information retrieval researchers deem stemming irrelevant general alternative approach based searching n-grams rather stems may used instead also stemmers may provide greater benefits languages english stemming used determine domain vocabularies domain analysis many commercial companies using stemming since least 1980s produced algorithmic lexical stemmers many languages snowball stemmers compared commercial lexical stemmers varying results google search adopted word stemming 2003 previously search fish would returned fishing software search algorithms vary use word stemming programs simply search substrings obviously find fish fishing searching fishes find occurrences word fish", + "neighbors": [ + 14, + 159, + 282, + 307, + 368, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1318, + 1440, + 1486, + 1615 + ], + "mask": "Validation" + }, + { + "node_id": 373, + "label": 2, + "text": "APL_(programming_language):apl programming language apl named book programming language programming language developed 1960s kenneth e. iverson central datatype multidimensional array uses large range special graphic symbols represent functions operators leading concise code important influence development concept modeling spreadsheets functional programming computer math packages also inspired several programming languages mathematical notation manipulating arrays developed kenneth e. iverson starting 1957 harvard university 1960 began work ibm developed notation adin falkoff published book programming language 1962 preface states premise notation used inside ibm short research reports computer systems burroughs b5000 stack mechanism stack machines versus register machines evaluated ibm upcoming computers iverson also used notation draft chapter programming language written book writing fred brooks automatic data processing would published 1963 1979 iverson received turing award work apl early 1962 first attempt use notation describe complete computer system happened falkoff discussed william c. carter work standardize instruction set machines later became ibm system/360 family 1963 herbert hellerman working ibm systems research institute implemented part notation ibm 1620 computer used students special high school course calculating transcendental functions series summation students tested code hellerman lab implementation part notation called personalized array translator pat 1963 falkoff iverson edward h. sussenguth jr. working ibm used notation formal description ibm system/360 series machine architecture functionality resulted paper published ibm systems journal 1964 published team turned attention implementation notation computer system one motivations focus implementation interest john l. lawrence new duties science research associates educational company bought ibm 1964 lawrence asked iverson group help use language tool develop use computers education lawrence m. breed philip s. abrams stanford university joined team ibm research continued prior work implementation programmed fortran iv part notation done ibm 7090 computer running ibsys operating system work finished late 1965 later named ivsys iverson system basis implementation described detail abrams stanford university technical report interpreter iverson notation 1966 academic aspect formally supervised niklaus wirth like hellerman pat system earlier implementation include apl character set used special english reserved words functions operators system later adapted time-sharing system november 1966 reprogrammed ibm system/360 model 50 computer running time sharing mode used internally ibm key development ability use apl effectively wide use cathode ray tube crt terminals development special ibm selectric typewriter interchangeable typing element special apl characters used paper printing terminal workstations using selectric typewriter typing element mechanism ibm 1050 ibm 2741 terminal keycaps could placed normal keys show apl characters would entered typed key struck first time programmer could type see proper apl characters used iverson notation forced use awkward english keyword representations falkoff iverson special apl selectric typing elements 987 988 designed late 1964 although apl computer system available use iverson cited falkoff inspiration idea using ibm selectric typing element apl character set many apl symbols even apl characters selectric typing element still typed over-striking two extant element characters example grade character made delta shift-h sheffer stroke shift-m necessary apl character set much larger 88 characters allowed typing element even letters restricted upper-case capitals first apl interactive login creation apl workspace 1966 larry breed using ibm 1050 terminal ibm mohansic labs near thomas j. watson research center home apl yorktown heights new york ibm chiefly responsible introducing apl marketplace apl first available 1967 ibm 1130 apl\\1130 would run little 8k 16-bit words memory used dedicated 1 megabyte hard disk apl gained foothold mainframe timesharing systems late 1960s early 1980s part would support multiple users lower-specification systems dynamic address translation hardware additional improvements performance selected ibm system/370 mainframe systems included apl assist microcode support apl execution included processor firmware distinct implemented entirely higher-level software somewhat later suitably performing hardware finally growing available mid- late-1980s many users migrated applications personal computer environment early ibm apl interpreters ibm 360 ibm 370 hardware implemented multi-user management instead relying host services thus timesharing systems first introduced 1966 apl\\360 system multi-user interpreter ability programmatically communicate operating system information setting interpreter system variables done special privileged i-beam functions using monadic dyadic operations 1973 ibm released apl.sv continuation product offered shared variables means access facilities outside apl system operating system files mid-1970s ibm mainframe interpreter even adapted use ibm 5100 desktop computer small crt apl keyboard small computers time offered basic 1980s vsapl program product enjoyed wide use conversational monitor system cms time sharing option tso vspc music/sp cics users 1973-1974 patrick e. hagerty directed implementation university maryland apl interpreter 1100 line sperry univac 1100/2200 series mainframe computers time sperry nothing 1974 student alan stebbens assigned task implementing internal function 1960s 1970s several timesharing firms arose sold apl services using modified versions ibm apl\\360 interpreter north america better-known ones i. p. sharp associates scientific time sharing corporation stsc time sharing resources tsr computer company tcc compuserve also entered market 1978 apl interpreter based modified version digital equipment corp carnegie mellon ran dec ki kl 36-bit machines compuserve apl available commercial market consumer information service advent first less expensive mainframes ibm 4300 later personal computer mid-1980s timesharing industry gone sharp apl available i. p. sharp associates first timesharing service 1960s later program product starting around 1979 sharp apl advanced apl implementation many language extensions packages ability put one objects single variable file system nested arrays shared variables apl interpreters available mainframe mini-computer manufacturers also notably burroughs control data corporation cdc data general digital equipment corporation dec harris hewlett-packard hp siemens ag xerox others garth foster syracuse university sponsored regular meetings apl implementers community syracuse minnowbrook conference center blue mountain lake new york later years eugene mcdonnell organized similar meetings asilomar conference grounds near monterey california pajaro dunes near watsonville california sigapl special interest group association computing machinery continues support apl community microcomputers became available mid 1970s onwards basic became dominant programming language nevertheless microcomputers provided apl instead first intel 8008-based mcm/70 released 1974 primarily used education another machine time videobrain family computer released 1977 supplied dialect apl called apl/s commodore superpet introduced 1981 included apl interpreter developed university waterloo 1976 bill gates claimed open letter hobbyists microsoft corporation implementing apl intel 8080 motorola 6800 little incentive make available hobbyists software piracy never released starting early 1980s ibm apl development leadership jim brown implemented new version apl language contained primary enhancement concept nested arrays array contain arrays new language features facilitated integrating nested arrays program workflow ken iverson longer control development apl language left ibm joined i. p. sharp associates one major contributions directing evolution sharp apl accord vision vendors busy developing apl interpreters new hardware notably unix-based microcomputers apl2 almost always standard chosen new apl interpreter developments even today apl vendors users cite apl2 compatibility selling point products apl2 ibm mainframe computers still available ibm cites use problem solving system design prototyping engineering scientific computations expert systems teaching mathematics subjects visualization database access first available cms tso 1984 apl2 workstation edition windows os/2 aix linux solaris followed much later early 1990s various implementations apl aplx dyalog et al. include extensions object-oriented programming support .net framework xml-array conversion primitives graphing operating system interfaces lambda calculus expressions apl formed basis influenced following languages apl criticized praised choice unique non-standard character set learn become ardent adherents suggesting weight behind iverson idea notation used make difference 1960s 1970s terminal devices even display monitors could reproduce apl character set popular ones employed ibm selectric print mechanism used special apl type element one early apl line terminals line-mode operation full screen texas instruments ti model 745 circa 1977 full apl character set featured half full duplex telecommunications modes interacting apl time-sharing service remote mainframe run remote computer job called rje time universal use high-quality graphic displays printing devices unicode support apl character font problem largely eliminated however entering apl characters requires use input method editors keyboard mappings virtual/on-screen apl symbol sets easy-reference printed keyboard cards frustrate beginners accustomed programming languages beginners prior experience programming languages study involving high school students found typing using apl characters hinder students measurable way defense apl use apl requires less coding type keyboard mappings become memorized time also special apl keyboards manufactured use today freely available downloadable fonts operating systems microsoft windows reported productivity gains assume one spend enough time working apl make worthwhile memorize symbols semantics keyboard mappings mention substantial number idioms common tasks unlike traditionally structured programming languages apl code typically structured chains monadic dyadic functions operators acting arrays apl many nonstandard primitives functions operators indicated single symbol combination symbols primitives defined precedence always associate right thus apl read best understood right-to-left early apl implementations circa 1970 programming loop-flow control structures codice_1 codice_2 loops codice_3 constructs instead used array operations use structured programming constructs often necessary since operation could performed full array one statement example codice_4 function codice_5 replace for-loop iteration \u03b9n applied scalar positive integer yields one-dimensional array vector 1 2 3 ... n. recent implementations apl generally include comprehensive control structures data structure program control flow clearly cleanly separated apl environment called workspace workspace user define programs data i.e. data values exist also outside programs user also manipulate data without define program examples apl interpreter first types six spaces awaiting user input output starts column one user save workspace values programs execution status apl uses set non-ascii symbols extension traditional arithmetic algebraic notation single character names single instruction multiple data simd vector functions one way apl enables compact formulation algorithms data transformation computing conway game life one line code nearly versions apl theoretically possible express computable function one expression one line code unusual character set many programmers use special keyboards apl keytops write apl code although various ways write apl code using ascii characters practice almost never done may thought support iverson thesis notation tool thought modern implementations use standard keyboard layouts special mappings input method editors access non-ascii characters historically apl font distinctive uppercase italic alphabetic characters upright numerals symbols vendors continue display apl character set custom font advocates apl claim examples so-called write-only code badly written almost incomprehensible code almost invariably examples poor programming practice novice mistakes occur language advocates also claim far productive apl conventional computer languages working software implemented far less time far fewer programmers using technology also may claim compact terse apl lends well larger-scale software development complexity number lines code reduced greatly many apl advocates practitioners also view standard programming languages cobol java comparatively tedious apl often found time-to-market important trading systems apl makes clear distinction functions operators functions take arrays variables constants expressions arguments return arrays results operators similar higher-order functions take functions arrays arguments derive related functions example sum function derived applying reduction operator addition function applying reduction operator maximum function returns larger two numbers derives function returns largest group vector numbers j language iverson substituted terms verb function adverb conjunction operator apl also identifies features built language represented symbol fixed combination symbols primitives primitives either functions operators coding apl largely process writing non-primitive functions versions apl operators however primitives considered neither functions operators noticeably assignment words used apl literature meanings differ mathematics generality computer science apl explicit representations functions operators syntax thus providing basis clear explicit statement extended facilities language tools experiment displays hello world 'hello world sample user session youtube design theme apl define default actions cases would produce syntax errors programming languages 'hello world string constant displays display default action expression action specified explicitly e.g assignment function parameter another example theme exponentiation apl written indicates raising 2 power 3 would written languages fortran python many languages use signify multiplication 2*3 apl uses however base specified statement apl languages programming languages one would syntax error apl however assumes missing base natural logarithm constant e 2.71828 ... interpreting suppose array numbers gives average reading right-to-left gives number elements x since dyadic operator term left required well parenthesis since otherwise x would taken summation would element x divided number elements x adds elements x building calculates standard deviation since assignment operator appear within expression would place suitable values av sd naturally one would make expression function repeated use rather retyping time following immediate-mode expression generates typical set pick 6 lottery numbers six pseudo-random integers ranging 1 40 guaranteed non-repeating displays sorted ascending order lot concisely although seems complex new apler combines following apl functions also called primitives glyphs since function left left-most x tell apl result simply outputs display single line separated spaces without needing explicit instruction codice_6 also monadic equivalent called codice_15 simply returns one random integer 1 sole operand right inclusive thus role-playing game program might use expression codice_16 roll twenty-sided die following expression finds prime numbers 1 r. time space calculation complexity formula_1 big notation executed right left means note assumes apl origin 1 i.e. indices start 1 apl set use 0 origin codice_45 codice_46 convenient calculations following expression sorts word list stored matrix x according word length following function life written dyalog apl takes boolean matrix calculates new generation according conway game life demonstrates power apl implement complex algorithm little code also hard follow unless one advanced knowledge apl following example also dyalog first line assigns html code variable codice_47 uses apl expression remove html tags explanation apl used many purposes including financial insurance applications artificial intelligence neural networks robotics argued apl calculation tool programming language symbolic nature array capabilities made popular domain experts data scientists require skills computer programmer apl well suited image manipulation computer animation graphic transformations encoded matrix multiplications one first commercial computer graphics houses digital effects produced apl graphics product named visions used create television commercials animation 1982 film tron latterly stormwind boating simulator uses apl implement core logic interfacing rendering pipeline middleware major part physics engine today apl remains use wide range commercial scientific applications example investment management asset management health care dna profiling hobbyists first implementation apl using recognizable apl symbols apl\\360 ran ibm system/360 completed november 1966 though time remained use within ibm 1973 implementors larry breed dick lathwell roger moore awarded grace murray hopper award association computing machinery acm given work design implementation apl\\360 setting new standards simplicity efficiency reliability response time interactive systems 1975 ibm 5100 microcomputer offered apl\\360 one two built-in rom-based interpreted languages computer complete keyboard display supported special symbols used language significant developments apl\\360 included cms/apl made use virtual storage capabilities cms aplsv introduced shared variables system variables system functions subsequently ported ibm system/370 vspc platforms final release 1983 replaced apl2 1968 apl\\1130 became first publicly available apl system created ibm ibm 1130 became popular ibm type-iii library software ibm released apl*plus sharp apl versions apl\\360 added business-oriented extensions data formatting facilities store apl arrays external files jointly developed two companies employing various members original ibm apl\\360 development team two companies i. p. sharp associates ipsa apl\\360 services company formed 1964 ian sharp roger moore others stsc time-sharing consulting service company formed 1969 lawrence breed others together two developed apl*plus thereafter continued work together develop apl separately apl*plus sharp apl stsc ported apl*plus many platforms versions made vax 11 pc unix whereas ipsa took different approach arrival personal computer made sharp apl available platform using additional pc-xt/360 hardware 1993 soliton incorporated formed support sharp apl developed sharp apl sax sharp apl unix apl*plus continues apl2000 apl+win 1985 ian sharp dan dyer stsc jointly received kenneth e. iverson award outstanding contribution apl apl2 significant re-implementation apl ibm developed 1971 first released 1984 provides many additions language notable nested non-rectangular array support available mainframe computers running z/os z/vm workstations running aix linux sun solaris microsoft windows entire apl2 products services team awarded iverson award 2007 dyalog apl first released british company dyalog ltd. 1983 available aix linux including raspberry pi macos microsoft windows platforms based apl2 extensions support object-oriented programming functional programming licences free personal/non-commercial use 1995 two development team john scholes peter donnelly awarded iverson award work interpreter gitte christensen morten kromberg joint recipients iverson award 2016 nars2000 open-source apl interpreter written bob smith prominent apl developer implementor stsc 1970s 1980s nars2000 contains advanced features new datatypes runs natively microsoft windows platforms wine aplx cross-platform dialect apl based apl2 several extensions first released british company microapl 2002 although longer development commercial sale available free charge dyalog gnu apl free implementation extended apl specified iso/iec 13751:2001 thus similar apl2 runs gnu/linux windows using cygwin uses unicode internally written j\u00fcrgen sauermann richard stallman founder gnu project early adopter apl using write text editor high school student summer 1969 apl traditionally interpreted language language characteristics weak variable typing well suited compilation however arrays core data structure provides opportunities performance gains parallelism parallel computing massively parallel applications very-large-scale integration vlsi outset apl regarded high-performance language example noted speed could perform complicated matrix operations operates arrays performs operations like matrix inversion internally nevertheless apl rarely purely interpreted compilation partial compilation techniques used include following apl interpreters support idiom recognition evaluate common idioms single operations example evaluating idiom codice_48 single operation codice_49 boolean vector codice_50 array creation two intermediate arrays avoided weak typing apl means name may reference array datatype function operator general interpreter know advance form must therefore perform analysis syntax checking etc run-time however certain circumstances possible deduce advance type name expected reference generate bytecode executed reduced run-time overhead bytecode also optimised using compilation techniques constant folding common subexpression elimination interpreter execute bytecode present assumptions made met dyalog apl includes support optimised bytecode compilation apl subject research experiment since language first became available first compiler considered burroughs apl-700 released around 1971 order able compile apl language limitations imposed apex research apl compiler written robert bernecky available gnu public license stsc apl compiler hybrid bytecode optimiser compiler enables compilation functions machine code provided sub-functions globals declared interpreter still used runtime library execute functions meet compilation requirements apl standardized american national standards institute ansi working group x3j10 international organization standardization iso international electrotechnical commission iec iso/iec joint technical committee 1 subcommittee 22 working group 3 core apl language specified iso 8485:1989 extended apl language specified iso/iec 13751:2001", + "neighbors": [ + 1, + 31, + 64, + 65, + 78, + 117, + 134, + 152, + 176, + 216, + 249, + 292, + 306, + 324, + 347, + 430, + 509, + 521, + 538, + 567, + 579, + 594, + 597, + 627, + 682, + 755, + 756, + 790, + 796, + 825, + 873, + 919, + 925, + 948, + 961, + 998, + 1005, + 1028, + 1044, + 1087, + 1090, + 1095, + 1120, + 1152, + 1212, + 1221, + 1225, + 1227, + 1235, + 1264, + 1275, + 1311, + 1324, + 1433, + 1457, + 1532, + 1616, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 374, + "label": 3, + "text": "Burroughs_B1700:burroughs b1700 burroughs b1000 series series mainframe computers built burroughs corporation originally introduced 1970s continued software development 1987 series consisted three major generations b1700 b1800 b1900 series machines also known burroughs small systems contrast burroughs large systems b5000 b6000 b7000 b8000 burroughs medium systems b2000 b3000 b4000 much original research b1700 initially codenamed plp proper language processor program language processor done burroughs pasadena plant production b1700s began mid-1970s occurred santa barbara liege belgium plants majority design work done santa barbara b1830 notable exception designed liege b1000 distinguished machines writeable control store allowing machine emulate machine burroughs mcp master control program would schedule particular job run mcp would preload interpreter whatever language required interpreters presented different virtual machines cobol fortran etc notable idea semantic gap ideal expression solution particular programming problem real physical hardware illustrated inefficiency current machine implementations three burroughs architectures represent solving problem building hardware aligned high-level languages so-called language-directed design contemporary term today often called high-level language computer architecture large systems stack machines efficiently executed algol medium systems b2000 3000 b4000 aimed business world executing cobol thus everything done bcd including addressing memory b1000 series perhaps universal solution perspective used idealized virtual machines language actual hardware built enhance capability perhaps obvious examples bit-addressable memory variable size arithmetic logic unit alu ability data register instruction register allowing efficient instruction parsing another feature machine language appearance output alu appear different addressable registers x+y x-y two read-only registers within machine language one concession fact burroughs primarily supplier business thus running cobol availability bcd arithmetic alu internally machines employed 16-bit instructions 24-bit data path bit addressable memory supported mix quite efficiently internally later generation memories stored data 32-bit boundaries capable reading across boundary supplying merged result initial hardware implementations built ctl family originally made fairchild semiconductor introduction b1955 1979 series employed popular readily obtainable ttl logic family b1955 control logic implemented proms muxes b1965 last series implemented pair microcode sequencers stayed lock step majority instructions executed single cycle first cycle decoded fplas using 16 inputs perfect size 16-bit instruction word 48 min-terms successive cycles multi-cycle instruction sourced proms fplas prom outputs wired together fpla would drive output first cycle get tri-stated proms would drive control lines completion instruction i/o system b1000 series consisted 24-bit data path control strobes peripherals cpu would place data data path inform peripheral data present many peripheral adapters fairly simplistic cpu actually drove adapter state machines operations successive accesses later models machines 1800 1900 series could configured either single dual processor tightly coupled machines competed access main memory b1955 b1965 could accommodate four processors memory bus least one would assigned multi-line adapter supplied serial i/o system dual-processor configurations ever actually sold multi-line capable driving multiple 19.2kb rs485 serial lines multi-drop configuration serial i/o polled given terminal would wait addressed grab line send data pending multi-line adapter would dma data main memory linked list format consequently processors n't deal serial i/o interrupt issues taken care fact block mode terminals type supported b1000 series could address maximum 2 megabytes memory days multiple gigabytes sounds fairly limiting commercial installations got hundreds kilobytes storage", + "neighbors": [ + 413, + 579, + 643, + 1009, + 1372 + ], + "mask": "Validation" + }, + { + "node_id": 375, + "label": 7, + "text": "Aiyara_cluster:aiyara cluster aiyara cluster low-powered computer cluster specially designed process big data aiyara cluster model considered specialization beowulf cluster sense aiyara also built commodity hardware inexpensive personal computers system-on-chip computer boards unlike beowulf applications aiyara cluster scoped big data area scientific high-performance computing another important property aiyara cluster low-power must built class processing units produces less heat name aiyara originally referred first arm-based cluster built wichai srisuruk chanwit kaewkasi suranaree university technology name aiyara came thai word literally elephant reflect underneath software stack apache hadoop like beowulf aiyara cluster define particular software stack run atop cluster normally runs variant linux operating system commonly used big data software stacks apache hadoop apache spark report aiyara hardware successfully processed non-trivial amount big data published proceedings icsec 2014 aiyara mk-i second aiyara cluster consists 22 cubieboards first known soc-based arm cluster able process big data successfully using spark hdfs stack aiyara cluster model technical description explaining build aiyara cluster later published chanwit kaewkasi dzone 2014 big data guide results cluster optimization techniques make cluster processing rate boost 0.9 gb/min still preserve low-power consumption reported proceeding ieee tencon 2014", + "neighbors": [ + 51, + 86, + 123, + 134, + 227, + 280, + 314, + 340, + 465, + 611, + 719, + 846, + 847, + 876, + 1013, + 1081, + 1099, + 1219, + 1220, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 376, + "label": 4, + "text": "NSO_Group:nso group nso group technologies israeli technology firm focused cyber intelligence founded 2010 niv carmi omri lavie shalev hulio reportedly employs around 500 people based herzliya near tel aviv annual revenues said around 40 million 2013 150 million 2015 june 2017 company put sale 1 billion francisco partners management founders lavie hulio partnering european private equity fund novalpina capital purchased majority stake nso february 2019 according company nso provides authorized governments technology helps combat terror crime claims software created nso group used targeted attacks human rights activists journalists several countries nso founders said ex-members unit 8200 israeli intelligence corps unit responsible collecting signals intelligence company start-up funding came group investors headed eddy shalev partner venture capital fund genesis partners group invested total 1.8 million dollars 30 stake 2012 government mexico announced signing 20 million contract nso 2015 company reportedly sold surveillance technology government panama contract became subject panamanian anti-corruption investigation following disclosure leak confidential information italian firm hacking team 2014 american private equity firm francisco partners bought company 130 million reported 2015 francisco seeking sell company 1 billion company officially put sale 1 billion june 2017 roughly ten times francisco originally paid 2014 february 14 2019 francisco partners sold 60 majority stake nso back co-founders shalev hulio omri lavie supported purchase novalpina capital hulio lavie invested 100 million novalpina acquiring remaining portion majority stake thus valuing company approximately 1 billion day acquisition novalpina attempted address concerns raised citizen lab letter stating belief nso operates sufficient integrity caution april 2019 nso froze deals saudi arabia scandal alleging nso software role tracking slain journalist jamal khashoggi months death may 2019 exploit whatsapp alleged developed nso whatsapp told financial times broke news attack hallmarks private company known work governments deliver spyware reportedly takes functions mobile phone operating systems nso denied involvement selecting targeting victims explicitly denied creating exploit august 25 2016 citizen lab lookout revealed software known pegasus created nso used target human rights activist ahmed mansoor united arab emirates mansoor informed citizen lab researchers bill marczak john scott-railton iphone 6 targeted august 10 2016 means clickable link sms text message analysis citizen lab lookout discovered link downloaded software exploit three previously unknown unpatched zero-day vulnerabilities ios according analysis software jailbreak iphone malicious url opened form attack known spear phishing software installs collects communications locations targeted iphones including communications sent imessage gmail viber facebook whatsapp telegram skype software also collect wi-fi passwords researchers noticed software code referenced nso group product called pegasus leaked marketing materials pegasus previously come light leak records hacking team indicated software supplied government panama 2015 researchers claim mexican journalist rafael cabrera also targeted software could used israel turkey thailand qatar kenya uzbekistan mozambique morocco yemen hungary saudi arabia nigeria bahrain citizen lab lookout notified apple security team patched flaws within ten days released update ios patch macos released six days later 2017 citizen lab researchers revealed nso exploit links may sent mexican scientists public health campaigners targets supported measures reduce childhood obesity including mexico soda tax july 2017 international team assembled investigate 2014 iguala mass kidnapping publicly complained thought surveilled mexican government claim mexican government used pegasus send messages funeral homes containing links clicked allowed government surreptitiously listen investigators mexican government repeatedly denied unauthorized hacking june 2018 israeli court indicted former employee nso group allegedly stealing copy pegasus attempting sell online 50 million worth cryptocurrency december 2018 new york times investigation concluded pegasus software played role murder jamal khashoggi friend khashoggi claimed filing saudi authorities used israeli-made software spy dissident citizen lab researchers reported october 2018 targeted undercover operatives connected nso citizen lab previously reported use nso software spy inner circle jamal khashoggi murder citizen lab october report revealed nso signature spy software placed iphone saudi dissident omar abdulaziz one khashoggi \u2019 confidantes months abdulaziz claimed software revealed khashoggi private criticisms saudi royal family abdulaziz claimed played major role kashoggi death ap report incident could find direct evidence connecting operative surveillance citizen lab \u2019 researchers nso nso denied involvement phone joaqu\u00edn guzm\u00e1n known el chapo hacked using nso software 2011 mexican president felipe calder\u00f3n reportedly called nso thank company role guzm\u00e1n capture", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 414, + 418, + 436, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 625, + 665, + 675, + 708, + 783, + 800, + 818, + 877, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 377, + "label": 6, + "text": "Fdisk:fdisk computer file systems fdisk command-line utility provides disk partitioning functions available dos dr flexos ibm os/2 microsoft windows operating systems certain ports freebsd netbsd openbsd dragonfly bsd macos compatibility reasons versions windows nt operating system line windows 2000 onwards replaced advanced tool called codice_1 similar utilities exist unix-like systems example bsd disklabel ibm introduced fixed disk setup program version 1.00 march 1983 release ibm pc/xt first pc store data hard disk ibm personal computer dos version 2.0 version 1 could used create one fat12 dos partition delete change active partition display partition data writes master boot record supported four partitions three intended operating systems cp/m-86 xenix expected partitioning utilities support august 1984 pc dos 3.0 added fat16 partitions support larger hard disks efficiently april 1987 pc dos/fdisk 3.30 added support extended partitions could hold 23 logical drives volumes ibm pc dos 7.10 contained utilities command available ms-dos versions 3.2 later support fat16b added compaq ms-dos 3.31 later became available ms-dos/pc dos 4.0 dos programs including program came original windows 95 capable creating fat partitions types fat12 fat16 fat16b derivative ms-dos provided windows 95 windows 98 later windows versions shipping windows 95b later able manipulate fat32 partitions windows 2000 later use logical disk manager feature well unlike programs operating systems programs dos windows 9x/me alter data partition table also overwrite many sectors data partition however create extended partition partition editor must put extended boot records logical drive disk users must sure correct disk/partition chosen using dos/windows partitioning switch undocumented well known repairing master boot record supplied windows 95 report correct size hard disk larger 64 gb updated available microsoft corrects microsoft named replacement 263044usa8 version 4.72.2811.0 signature may 23 2000 original windows 98 program size smaller updated one os/2 shipped two partition table managers version 4.0 text mode fdisk gui-based fdiskpm two identical functionality manipulate fat partitions advanced hpfs partitions os/2 versions 4.5 higher including ecomstation use jfs filesystem well fat hpfs replace logical volume manager lvm dr dos 6.0 flexos include implementation command implementation freedos free software freedos version developed brian e. reifsnyder paragon technology systems pts-dos 2000 pro includes implementation mach operating system written robert baron ported 386bsd julian elischer implementation used freebsd netbsd dragonfly bsd 2019 well early versions openbsd 1995 1997 openbsd 2.2 tobias weingartner re-wrote 1997 openbsd 2.2 subsequently forked apple computer inc 2002 still used basis macos 2019 native partitions bsd systems traditionally use bsd disklabel partitioning supported certain architectures compatibility reasons addition bsd disklabel mandatory linux maximum number partitions fdisk 60 3 primary partitions 1 extended partition 56 logical partitions", + "neighbors": [ + 22, + 38, + 42, + 106, + 134, + 189, + 255, + 290, + 295, + 413, + 615, + 735, + 764, + 870, + 899, + 904, + 920, + 957, + 961, + 992, + 1042, + 1050, + 1055, + 1057, + 1110, + 1138, + 1243, + 1257, + 1287, + 1304, + 1322, + 1366, + 1370, + 1461, + 1517, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 378, + "label": 9, + "text": "Class_(computer_programming):class computer programming object-oriented programming class extensible program-code-template creating objects providing initial values state member variables implementations behavior member functions methods many languages class name used name class template name default constructor class subroutine creates objects type objects generated instantiating class distinct concepts easily conflated object created constructor class resulting object called instance class member variables specific object called instance variables contrast class variables shared across class languages classes compile-time feature new classes declared run-time languages classes first-class citizens generally objects typically type similar languages class creates classes called metaclass casual use people often refer class object narrowly speaking objects type interface namely types member variables signatures member functions methods properties satisfy time class implementation specifically implementation methods create objects given type given implementation terms type theory class implementationa concrete data structure collection subroutineswhile type interface different concrete classes produce objects abstract type depending type system example type might implemented two classes fast small stacks scales poorly scales well high overhead small stacks similarly given class may several different constructors types generally represent nouns person place thing something nominalized class represents implementation example type might represent properties functionality bananas general classes would represent ways producing bananas say banana suppliers data structures functions represent draw bananas video game class could produce particular bananas instances class would objects type often single implementation type given case class name often identical type name classes composed structural behavioral constituents programming languages include classes programming construct offer support various class-related features syntax required use features varies greatly one programming language another class contains data field descriptions properties fields data members attributes usually field types names associated state variables program run time state variables either belong class specific instances class languages structure defined class determines layout memory used instances implementations possible example objects python use associative key-value containers programming languages support specification invariants part definition class enforce type system encapsulation state necessary able enforce invariants class behavior class instances defined using methods methods subroutines ability operate objects classes operations may alter state object simply provide ways accessing many kinds methods exist support varies across languages types methods created called programmer code special methods\u2014such constructors destructors conversion operators\u2014are created called compiler-generated code language may also allow programmer define call special methods every class implements realizes interface providing structure behavior structure consists data state behavior consists code specifies methods implemented distinction definition interface implementation interface however line blurred many programming languages class declarations define implement interface languages however provide features separate interface implementation example abstract class define interface without providing implementation languages support class inheritance also allow classes inherit interfaces classes derived example class inherits class b class b implements interface interface b class also inherits functionality constants methods declaration provided interface b languages support access specifiers interface class considered set public members class including methods attributes via implicit getter setter methods private members internal data structures intended depended external code thus part interface object-oriented programming methodology dictates operations interface class independent results layered design clients interface use methods declared interface interface places requirements clients invoke operations one interface particular order approach benefit client code assume operations interface available use whenever client access object buttons front television set interface electrical wiring side plastic casing press power button toggle television example particular television instance method represented button buttons together comprise interface television sets model would interface common form interface specification group related methods without associated implementation methods television set also myriad attributes size whether supports colour together comprise structure class represents full description television including attributes structure buttons interface getting total number televisions manufactured could static method television class method clearly associated class yet outside domain individual instance class static method finds particular instance set television objects another example following common set access specifiers although many object-oriented languages support access specifiers semantics may differ object-oriented design uses access specifiers conjunction careful design public method implementations enforce class invariants\u2014constraints state objects common usage access specifiers separate internal data class interface internal structure made private public accessor methods used inspect alter private data access specifiers necessarily control visibility even private members may visible client external code languages inaccessible visible member may referred run-time example pointer returned member function attempt use referring name member client code prevented type checker various object-oriented programming languages enforce member accessibility visibility various degrees depending language type system compilation policies enforced either compile-time run-time example java language allow client code accesses private data class compile languages feature accessibility schemes addition design standalone classes programming languages may support advanced class design based upon relationships classes inter-class relationship design capabilities commonly provided compositional hierarchical classes composed classes thereby establishing compositional relationship enclosing class embedded classes compositional relationship classes also commonly known has-a relationship example class car could composed contain class engine therefore car engine one aspect composition containment enclosure component instances instance enclosing object contains component instances value components enclosing object similar lifetime components contained reference may similar lifetime example objective-c 2.0 class instance string object array object classes derived one existing classes thereby establishing hierarchical relationship derived-from classes base classes parent classes derived class child class subclass relationship derived class derived-from classes commonly known is-a relationship example class 'button could derived class 'control therefore button control structural behavioral members parent classes inherited child class derived classes define additional structural members data fields behavioral members methods addition inherit therefore specializations superclasses also derived classes override inherited methods language allows languages support multiple inheritance example java allows class implement multiple interfaces inherit one class multiple inheritance allowed hierarchy directed acyclic graph dag short otherwise tree hierarchy classes nodes inheritance relationships links classes level likely associated classes different levels levels hierarchy called layers levels abstraction example simplified objective-c 2.0 code iphone sdk example uitableview uiscrollview uiview uiresponder nsobject conceptually superclass superset subclasses example common class hierarchy would involve superclass would subclass subset relations set theory well i.e. squares rectangles rectangles squares common conceptual error mistake part relation subclass example car truck kinds vehicles would appropriate model subclasses vehicle class however would error model component parts car subclass relations example car composed engine body would appropriate model engine body subclass car object-oriented modeling kinds relations typically modeled object properties example class would property called would typed hold collection objects instances etc object modeling languages uml include capabilities model various aspects part kinds relations \u2013 data cardinality objects constraints input output values etc information utilized developer tools generate additional code beside basic data definitions objects error checking get set methods one important question modeling implementing system object classes whether class one superclasses real world actual sets would rare find sets n't intersect one set however systems flavors clos provide capability one parent run time introduces complexity many object-oriented community consider antithetical goals using object classes first place understanding class responsible handling message get complex dealing one superclass used carelessly feature introduce system complexity ambiguity classes designed avoid modern object-oriented languages smalltalk java require single inheritance run time languages multiple inheritance may useful modeling implementation however semantic web application objects multiple superclasses volatility internet requires level flexibility technology standards web ontology language owl designed support similar issue whether class hierarchy modified run time languages flavors clos smalltalk support feature part meta-object protocols since classes first-class objects possible dynamically alter structure sending appropriate messages languages focus strong typing java c++ allow class hierarchy modified run time semantic web objects capability run time changes classes rational similar justification allowing multiple superclasses internet dynamic flexible dynamic changes hierarchy required manage volatility although class-based languages commonly assumed support inheritance inheritance intrinsic aspect concept classes languages often referred object-based languages support classes yet support inheritance examples object-based languages include earlier versions visual basic object-oriented analysis uml association two classes represents collaboration classes corresponding instances associations direction example bi-directional association two classes indicates classes aware relationship associations may labeled according name purpose association role given end association describes role corresponding class example subscriber role describes way instances class person participate subscribes-to association class magazine also magazine subscribed magazine role association association role multiplicity describes many instances correspond instance class association common multiplicities 0..1 1..1 1..* 0..* specifies number instances many categories classes overlap language supports inheritance abstract class abstract base class abc class instantiated either labeled abstract simply specifies abstract methods virtual methods abstract class may provide implementations methods may also specify virtual methods via signatures implemented direct indirect descendants abstract class class derived abstract class instantiated abstract methods parent classes must implemented class derivation chain object-oriented programming languages allow programmer specify classes considered abstract allow instantiated example java c php keyword abstract used c++ abstract class class least one abstract method given appropriate syntax language pure virtual function c++ parlance class consisting virtual methods called pure abstract base class pure abc c++ also known interface users language languages notably java c support variant abstract classes called interface via keyword language languages multiple inheritance allowed class implement multiple interfaces class contain abstract publicly accessible methods concrete class class instantiated opposed abstract classes languages classes declared scopes global scope various types classes inner class class defined within another class relationship inner class containing class also treated another type class association inner class typically neither associated instances enclosing class instantiated along enclosing class depending language may may possible refer class outside enclosing class related concept inner types also known inner data type nested type generalization concept inner classes c++ example language supports inner classes inner types via typedef declarations another type local class class defined within procedure function limits references class name within scope class declared depending semantic rules language may additional restrictions local classes compared non-local ones one common restriction disallow local class methods access local variables enclosing function example c++ local class may refer static variables declared within enclosing function may access function automatic variables metaclasses classes whose instances classes metaclass describes common structure collection classes implement design pattern describe particular kinds classes metaclasses often used describe frameworks languages python ruby smalltalk class also object thus class instance unique metaclass built language common lisp object system clos non-subclassable classes allow programmers design classes hierarchies classes level hierarchy derivation prohibited stand-alone class may also designated non-subclassable preventing formation hierarchy contrast abstract classes imply encourage require derivation order used non-subclassable class implicitly concrete non-subclassable class created declaring class c java php example java class designated final non-subclassable classes may allow compiler compiled languages perform optimizations available subclassable classes open class one changed typically executable program changed customers developers often change classes typically change standard built-in ones ruby classes open python classes created runtime modified afterwards objective-c categories permit programmer add methods existing class without need recompile class even access source code languages special support mixins though language multiple inheritance mixin simply class represent is-a-type-of relationship mixins typically used add methods multiple classes example class might provide method called included classes share common parent languages supporting feature partial class class whose definition may split multiple pieces within single source-code file across multiple files pieces merged compile-time making compiler output non-partial class primary motivation introduction partial classes facilitate implementation code generators visual designers otherwise challenge compromise develop code generators manage generated code interleaved within developer-written code using partial classes code generator process separate file coarse-grained partial class within file thus alleviated intricately interjecting generated code via extensive parsing increasing compiler efficiency eliminating potential risk corrupting developer code simple implementation partial classes compiler perform phase precompilation unifies parts partial class compilation proceed usual benefits effects partial class feature include partial classes existed smalltalk name class extensions considerable time arrival .net framework 2 microsoft introduced partial classes supported c 2.0 visual basic 2005 winrt also supports partial classes simple example written visual basic .net shows parts class defined two different files compiled result two files written one like objective-c partial classes also known categories may even spread multiple libraries executables like following example key difference objective-c categories overwrite definitions another interface declaration categories n't equal original class definition first requires last instead .net partial class ca n't conflicting definitions partial definitions equal others foundation header file nsdata.h user-supplied library separate binary foundation framework header file nsdata+base64.h app yet another separate binary file source code file main.m dispatcher find methods called nsdata instance invoke correctly uninstantiable classes allow programmers group together per-class fields methods accessible runtime without instance class indeed instantiation prohibited kind class example c class marked static instantiated static members fields methods may instance constructors sealed unnamed class anonymous class class bound name identifier upon definition analogous named versus unnamed functions benefits organizing software object classes fall three categories object classes facilitate rapid development lessen semantic gap code users system analysts talk developers users using essentially vocabulary talking accounts customers bills etc object classes often facilitate rapid development object-oriented environments come powerful debugging testing tools instances classes inspected run time verify system performing expected also rather get dumps core memory object-oriented environments interpreted debugging capabilities developer analyze exactly program error occurred see methods called arguments arguments object classes facilitate ease maintenance via encapsulation developers need change behavior object localize change object component parts reduces potential unwanted side effects maintenance enhancements software re-use also major benefit using object classes classes facilitate re-use via inheritance interfaces new behavior required often achieved creating new class class inherit default behaviors data superclass tailor aspect behavior data accordingly re-use via interfaces also known methods occurs another object wants invoke rather create new kind object class method re-use removes many common errors make way software one program re-uses code another data type class usually considered compile-time construct language may also support prototype factory metaobjects represent run-time information classes even represent metadata provides access reflection facilities ability manipulate data structure formats run-time many languages distinguish kind run-time type information classes class basis information needed run-time dynamic languages make strict distinctions run-time compile-time constructs therefore may distinguish metaobjects classes example human metaobject representing class person instances class person created using facilities human metaobject", + "neighbors": [ + 78, + 87, + 90, + 241, + 246, + 347, + 392, + 396, + 412, + 447, + 509, + 521, + 538, + 592, + 649, + 682, + 742, + 756, + 815, + 820, + 824, + 825, + 869, + 1005, + 1044, + 1120, + 1217, + 1225, + 1227, + 1235, + 1264, + 1311, + 1319, + 1320, + 1324, + 1389, + 1414, + 1437, + 1477, + 1483, + 1502, + 1508, + 1520, + 1532, + 1626, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 379, + "label": 4, + "text": "Computer_security:computer security computer security cybersecurity information technology security security protection computer systems theft damage hardware software electronic data well disruption misdirection services provide field becoming important due increased reliance computer systems internet wireless network standards bluetooth wi-fi due growth smart devices including smartphones televisions various devices constitute internet things due complexity terms politics technology cybersecurity also one major challenges contemporary world vulnerability weakness design implementation operation internal control vulnerabilities discovered documented common vulnerabilities exposures cve database exploitable vulnerability one least one working attack exploit exists vulnerabilities often hunted exploited aid automated tools manually using customized scripts secure computer system important understand attacks made threats typically classified one categories backdoor computer system cryptosystem algorithm secret method bypassing normal authentication security controls may exist number reasons including original design poor configuration may added authorized party allow legitimate access attacker malicious reasons regardless motives existence create vulnerability denial service attacks dos designed make machine network resource unavailable intended users attackers deny service individual victims deliberately entering wrong password enough consecutive times cause victims account locked may overload capabilities machine network block users network attack single ip address blocked adding new firewall rule many forms distributed denial service ddos attacks possible attack comes large number points \u2013 defending much difficult attacks originate zombie computers botnet range techniques possible including reflection amplification attacks innocent systems fooled sending traffic victim unauthorized user gaining physical access computer likely able directly copy data may also compromise security making operating system modifications installing software worms keyloggers covert listening devices using wireless mice even system protected standard security measures may able by-passed booting another operating system tool cd-rom bootable media disk encryption trusted platform module designed prevent attacks eavesdropping act surreptitiously listening private conversation typically hosts network instance programs carnivore narusinsight used fbi nsa eavesdrop systems internet service providers even machines operate closed system i.e. contact outside world eavesdropped upon via monitoring faint electromagnetic transmissions generated hardware tempest specification nsa referring attacks surfacing 2017 new class multi-vector polymorphic cyber threats surfaced combined several types attacks changed form avoid cyber security controls spread threats classified fifth generation cyber attacks phishing attempt acquire sensitive information usernames passwords credit card details directly users phishing typically carried email spoofing instant messaging often directs users enter details fake website whose look feel almost identical legitimate one fake website often ask personal information log-in passwords information used gain access individual real account real website preying victim trust phishing classified form social engineering privilege escalation describes situation attacker level restricted access able without authorization elevate privileges access level example standard computer user may able exploit vulnerability system gain access restricted data even become root full unrestricted access system social engineering aims convince user disclose secrets passwords card numbers etc example impersonating bank contractor customer common scam involves fake ceo emails sent accounting finance departments early 2016 fbi reported scam cost us businesses 2bn two years may 2016 milwaukee bucks nba team victim type cyber scam perpetrator impersonating team president peter feigin resulting handover team employees 2015 w-2 tax forms spoofing act masquerading valid entity falsification data ip address username order gain access information resources one otherwise unauthorized obtain several types spoofing including tampering describes malicious modification products so-called evil maid attacks security services planting surveillance capability routers examples employee behavior big impact information security organizations cultural concepts help different segments organization work effectively work effectiveness towards information security within organization \u2033exploring relationship organizational culture information security culture\u2033 provides following definition information security culture \u2033isc totality patterns behavior organization contribute protection information kinds.\u2033 andersson reimers 2014 found employees often see part organization information security effort often take actions ignore organizational information security best interests research shows information security culture needs improved continuously \u2033information security culture analysis change\u2033 authors commented \u2033it never ending process cycle evaluation change maintenance.\u2033 manage information security culture five steps taken pre-evaluation strategic planning operative planning implementation post-evaluation growth number computer systems increasing reliance upon individuals businesses industries governments means increasing number systems risk computer systems financial regulators financial institutions like u.s. securities exchange commission swift investment banks commercial banks prominent hacking targets cyber criminals interested manipulating markets making illicit gains web sites apps accept store credit card numbers brokerage accounts bank account information also prominent hacking targets potential immediate financial gain transferring money making purchases selling information black market in-store payment systems atms also tampered order gather customer account data pins computers control functions many utilities including coordination telecommunications power grid nuclear power plants valve opening closing water gas networks internet potential attack vector machines connected stuxnet worm demonstrated even equipment controlled computers connected internet vulnerable 2014 computer emergency readiness team division department homeland security investigated 79 hacking incidents energy companies vulnerabilities smart meters many use local radio cellular communications cause problems billing fraud aviation industry reliant series complex systems could attacked simple power outage one airport cause repercussions worldwide much system relies radio transmissions could disrupted controlling aircraft oceans especially dangerous radar surveillance extends 175 225 miles offshore also potential attack within aircraft europe pan-european network service newpens us nextgen program air navigation service providers moving create dedicated networks consequences successful attack range loss confidentiality loss system integrity air traffic control outages loss aircraft even loss life desktop computers laptops commonly targeted gather passwords financial account information construct botnet attack another target smartphones tablet computers smart watches mobile devices quantified self devices like activity trackers sensors cameras microphones gps receivers compasses accelerometers could exploited may collect personal information including sensitive health information wifi bluetooth cell phone networks devices could used attack vectors sensors might remotely activated successful breach increasing number home automation devices nest thermostat also potential targets large corporations common targets many cases aimed financial gain identity theft involves data breaches loss millions clients credit card details home depot staples target corporation recent breach equifax cyberattacks ordered foreign governments governments engage cyberwarfare intent spread propaganda sabotage spy targets many people believe russian government played major role us presidential election 2016 using twitter facebook affect results election medical records targeted use general identify theft health insurance fraud impersonating patients obtain prescription drugs recreational purposes resale although cyber threats continue increase 62 organizations increase security training business 2015 attacks financially motivated however example security firm hbgary federal suffered serious series attacks 2011 hacktivist group anonymous retaliation firm ceo claiming infiltrated group sony pictures attack 2014 motive appears embarrass data leaks cripple company wiping workstations servers vehicles increasingly computerized engine timing cruise control anti-lock brakes seat belt tensioners door locks airbags advanced driver-assistance systems many models additionally connected cars may use wifi bluetooth communicate onboard consumer devices cell phone network self-driving cars expected even complex systems carry security risk issues gained wide attention simple examples risk include malicious compact disc used attack vector car onboard microphones used eavesdropping however access gained car internal controller area network danger much greater \u2013 widely publicized 2015 test hackers remotely carjacked vehicle 10 miles away drove ditch manufacturers reacting number ways tesla 2016 pushing security fixes air cars computer systems area autonomous vehicles september 2016 united states department transportation announced initial safety standards called states come uniform policies government military computer systems commonly attacked activists foreign powers local regional government infrastructure traffic light controls police intelligence agency communications personnel records student records financial systems also potential targets largely computerized passports government id cards control access facilities use rfid vulnerable cloning internet things iot network physical objects devices vehicles buildings embedded electronics software sensors network connectivity enables collect exchange data \u2013 concerns raised developed without appropriate consideration security challenges involved iot creates opportunities direct integration physical world computer-based systems also provides opportunities misuse particular internet things spreads widely cyber attacks likely become increasingly physical rather simply virtual threat front door lock connected internet locked/unlocked phone criminal could enter home press button stolen hacked phone people could stand lose much credit card numbers world controlled iot-enabled devices thieves also used electronic means circumvent non-internet-connected hotel door locks medical devices either successfully attacked potentially deadly vulnerabilities demonstrated including in-hospital diagnostic equipment implanted devices including pacemakers insulin pumps many reports hospitals hospital organizations getting hacked including ransomware attacks windows xp exploits viruses data breaches sensitive data stored hospital servers 28 december 2016 us food drug administration released recommendations medical device manufacturers maintain security internet-connected devices \u2013 structure enforcement distributed generation systems risk cyber attack real according daily energy insider attack could cause loss power large area long period time attack could severe consequences natural disaster district columbia considering creating distributed energy resources der authority within city goal customers insight energy use giving local electric utility pepco chance better estimate energy demand d.c. proposal however would allow third-party vendors create numerous points energy distribution could potentially create opportunities cyber attackers threaten electric grid serious financial damage caused security breaches standard model estimating cost incident data available made public organizations involved several computer security consulting firms produce estimates total worldwide losses attributable virus worm attacks hostile digital acts general 2003 loss estimates firms range 13 billion worms viruses 226 billion forms covert attacks reliability estimates often challenged underlying methodology basically anecdotal security breaches continue cost businesses billions dollars survey revealed 66 security staffs believe senior leadership takes cyber precautions strategic priority however reasonable estimates financial cost security breaches actually help organizations make rational investment decisions according classic gordon-loeb model analyzing optimal investment level information security one conclude amount firm spends protect information generally small fraction expected loss i.e. expected value loss resulting cyber/information security breach physical security motivations breaches computer security vary attackers thrill-seekers vandals activists others criminals looking financial gain state-sponsored attackers common well resourced started amateurs markus hess hacked kgb recounted clifford stoll cuckoo egg additionally recent attacker motivations traced back extremist organizations seeking gain political advantage disrupt social agendas growth internet mobile technologies inexpensive computing devices led rise capabilities also risk environments deemed vital operations critical targeted environments susceptible compromise led series proactive studies migrate risk taking consideration motivations type actors several stark differences exist hacker motivation nation state actors seeking attack based ideological preference standard part threat modelling particular system identify might motivate attack system might motivated breach level detail precautions vary depending system secured home personal computer bank classified military network face different threats even underlying technologies use similar computer security countermeasure action device procedure technique reduces threat vulnerability attack eliminating preventing minimizing harm cause discovering reporting corrective action taken common countermeasures listed following sections security design alternately secure design means software designed ground secure case security considered main feature techniques approach include open security architecture organization defines security architecture design artifacts describe security controls security countermeasures positioned relate overall information technology architecture controls serve purpose maintain system quality attributes confidentiality integrity availability accountability assurance services techopedia defines security architecture unified security design addresses necessities potential risks involved certain scenario environment also specifies apply security controls design process generally reproducible key attributes security architecture state computer security conceptual ideal attained use three processes threat prevention detection response processes based various policies system components include following today computer security comprises mainly preventive measures like firewalls exit procedure firewall defined way filtering network data host network another network internet implemented software running machine hooking network stack case unix-based operating systems linux built operating system kernel provide real-time filtering blocking another implementation so-called physical firewall consists separate machine filtering network traffic firewalls common amongst machines permanently connected internet organizations turning big data platforms apache hadoop extend data accessibility machine learning detect advanced persistent threats however relatively organisations maintain computer systems effective detection systems fewer still organized response mechanisms place result reuters points companies first time report losing electronic theft data physical stealing assets primary obstacle effective eradication cyber crime could traced excessive reliance firewalls automated detection systems yet basic evidence gathering using packet capture appliances puts criminals behind bars vulnerability management cycle identifying remediating mitigating vulnerabilities especially software firmware vulnerability management integral computer security network security vulnerabilities discovered vulnerability scanner analyzes computer system search known vulnerabilities open ports insecure software configuration susceptibility malware beyond vulnerability scanning many organizations contract outside security auditors run regular penetration tests systems identify vulnerabilities sectors contractual requirement formal verification correctness computer systems possible yet common operating systems formally verified include sel4 sysgo pikeos \u2013 make small percentage market two factor authentication method mitigating unauthorized access system sensitive information requires something know password pin something card dongle cellphone piece hardware increases security unauthorized person needs gain access social engineering direct computer access physical attacks prevented non-computer means difficult enforce relative sensitivity information training often involved help mitigate risk even highly disciplined environments e.g military organizations social engineering attacks still difficult foresee prevent enoculation derived inoculation theory seeks prevent social engineering fraudulent tricks traps instilling resistance persuasion attempts exposure similar related attempts possible reduce attacker chances keeping systems date security patches updates using security scanner or/and hiring competent people responsible security statement ambiguous even systems developed competent people get penetrated effects data loss/damage reduced careful backing insurance hardware may source insecurity microchip vulnerabilities maliciously introduced manufacturing process hardware-based assisted computer security also offers alternative software-only computer security using devices methods dongles trusted platform modules intrusion-aware cases drive locks disabling usb ports mobile-enabled access may considered secure due physical access sophisticated backdoor access required order compromised covered detail one use term computer security refers technology used implement secure operating systems 1980s united states department defense dod used orange book standards current international standard iso/iec 15408 common criteria defines number progressively stringent evaluation assurance levels many common operating systems meet eal4 standard methodically designed tested reviewed formal verification required highest levels means uncommon example eal6 semiformally verified design tested system integrity-178b used airbus a380 several military jets software engineering secure coding aims guard accidental introduction security vulnerabilities also possible create software designed ground secure systems secure design beyond formal verification aims prove correctness algorithms underlying system important cryptographic protocols example within computer systems two many security models capable enforcing privilege separation access control lists acls capability-based security using acls confine programs proven insecure many situations host computer tricked indirectly allowing restricted file access issue known confused deputy problem also shown promise acls giving access object one person never guaranteed practice problems resolved capabilities mean practical flaws exist acl-based systems designers certain utilities must take responsibility ensure introduce flaws capabilities mostly restricted research operating systems commercial oss still use acls capabilities however also implemented language level leading style programming essentially refinement standard object-oriented design open source project area e language end-user widely recognized weakest link security chain estimated 90 security incidents breaches involve kind human error among commonly recorded forms errors misjudgment poor password management inability recognize misleading urls identify fake websites dangerous email attachments human component cyber risk particularly relevant determining global cyber risk organization facing security awareness training levels provides formal compliance regulatory industry mandates considered essential reducing cyber risk protecting individuals companies great majority cyber threats focus end-user represents profound cultural change many security practitioners traditionally approached cybersecurity exclusively technical perspective moves along lines suggested major security centers develop culture cyber awareness within organization recognizing security aware user provides important line defense cyber attacks responding forcefully attempted security breaches manner one would attempted physical security breaches often difficult variety reasons incident response organized approach addressing managing aftermath computer security incident compromise goal preventing breach thwarting cyberattack incident identified managed time intrusion typically escalates impactful event data breach system failure intended outcome computer security incident response plan limit damage reduce recovery time costs responding compromises quickly mitigate exploited vulnerabilities restore services processes minimize impact losses incident response planning allows organization establish series best practices stop intrusion causes damage typical incident response plans contain set written instructions outline organization response cyberattack without documented plan place organization may successfully detect intrusion compromise stakeholders may understand roles processes procedures escalation slowing organizations response resolution four key components computer security incident response plan illustrative examples different types computer security breaches given 1988 60,000 computers connected internet mainframes minicomputers professional workstations 2 november 1988 many started slow running malicious code demanded processor time spread computers \u2013 first internet computer worm software traced back 23-year-old cornell university graduate student robert tappan morris jr. said wanted count many machines connected internet 1994 hundred intrusions made unidentified crackers rome laboratory us air force main command research facility using trojan horses hackers able obtain unrestricted access rome networking systems remove traces activities intruders able obtain classified files air tasking order systems data furthermore able penetrate connected networks national aeronautics space administration goddard space flight center wright-patterson air force base defense contractors private sector organizations posing trusted rome center user early 2007 american apparel home goods company tjx announced victim unauthorized computer systems intrusion hackers accessed system stored data credit card debit card check merchandise return transactions 2010 computer worm known stuxnet reportedly ruined almost one-fifth iran nuclear centrifuges disrupting industrial programmable logic controllers plcs targeted attack generally believed launched israel united states \u2013 although neither publicly admitted early 2013 documents provided edward snowden published washington post guardian exposing massive scale nsa global surveillance also indications nsa may inserted backdoor nist standard encryption standard later withdrawn due widespread criticism nsa additionally revealed tapped links google data centres 2013 2014 russian/ukrainian hacking ring known rescator broke target corporation computers 2013 stealing roughly 40 million credit cards home depot computers 2014 stealing 53 56 million credit card numbers warnings delivered corporations ignored physical security breaches using self checkout machines believed played large role malware utilized absolutely unsophisticated uninteresting says jim walter director threat intelligence operations security technology company mcafee \u2013 meaning heists could easily stopped existing antivirus software administrators responded warnings size thefts resulted major attention state federal united states authorities investigation ongoing april 2015 office personnel management discovered hacked year earlier data breach resulting theft approximately 21.5 million personnel records handled office office personnel management hack described federal officials among largest breaches government data history united states data targeted breach included personally identifiable information social security numbers names dates places birth addresses fingerprints current former government employees well anyone undergone government background check believed hack perpetrated chinese hackers july 2015 hacker group known impact team successfully breached extramarital relationship website ashley madison created avid life media group claimed taken company data user data well breach impact team dumped emails company ceo prove point threatened dump customer data unless website taken permanently avid life media take site offline group released two compressed files one 9.7gb second 20gb second data dump avid life media ceo noel biderman resigned website remained functioning international legal issues cyber attacks complicated nature global base common rules judge eventually punish cyber crimes cyber criminals security firms agencies locate cybercriminal behind creation particular piece malware form cyber attack often local authorities take action due lack laws prosecute proving attribution cyber crimes cyber attacks also major problem law enforcement agencies computer viruses switch one country another one jurisdiction another \u2013 moving around world using fact n't capability globally police operations like internet someone given free plane tickets online criminals world use techniques dynamic dns fast flux bullet proof servers add difficulty investigation enforcement role government make regulations force companies organizations protect systems infrastructure information cyberattacks also protect national infrastructure national power-grid government regulatory role cyberspace complicated cyberspace seen virtual space remain free government intervention seen many today libertarian blockchain bitcoin discussions many government officials experts think government crucial need improved regulation mainly due failure private sector solve efficiently cybersecurity problem r. clarke said panel discussion rsa security conference san francisco believes industry responds threaten regulation industry n't respond threat follow hand executives private sector agree improvements necessary think government intervention would affect ability innovate efficiently daniel r. mccarthy analyzed public-private partnership cybersecurity reflected role cybersecurity broader constitution political order many different teams organisations exist including 14 april 2016 european parliament council european union adopted general data protection regulation gdpr eu 2016/679 gdpr became enforceable beginning 25 may 2018 provides data protection privacy individuals within european union eu european economic area eea gdpr requires business processes handle personal data built data protection design default gdpr also requires certain organizations appoint data protection officer dpo countries computer emergency response team protect network security since 2010 canada cyber security strategy functions counterpart document national strategy action plan critical infrastructure strategy three main pillars securing government systems securing vital private cyber systems helping canadians secure online also cyber incident management framework provide coordinated response event cyber incident canadian cyber incident response centre ccirc responsible mitigating responding threats canada critical infrastructure cyber systems provides support mitigate cyber threats technical support respond recover targeted cyber attacks provides online tools members canada critical infrastructure sectors posts regular cyber security bulletins operates online reporting tool individuals organizations report cyber incident inform general public protect online public safety canada partnered stop.think.connect coalition non-profit private sector government organizations launched cyber security cooperation program also run getcybersafe portal canadian citizens cyber security awareness month october public safety canada aims begin evaluation canada cyber security strategy early 2015 china central leading group internet security informatization established 27 february 2014 leading small group lsg communist party china headed general secretary xi jinping staffed relevant party state decision-makers lsg created overcome incoherent policies overlapping responsibilities characterized china former cyberspace decision-making mechanisms lsg oversees policy-making economic political cultural social military fields relate network security strategy lsg also coordinates major policy initiatives international arena promote norms standards favored chinese government emphasize principle national sovereignty cyberspace berlin starts national cyber defense initiative 16 june 2011 german minister home affairs officially opened new german ncaz national center cyber defense nationales cyber-abwehrzentrum located bonn ncaz closely cooperates bsi federal office information security bundesamt f\u00fcr sicherheit der informationstechnik bka federal police organisation bundeskriminalamt deutschland bnd federal intelligence service bundesnachrichtendienst mad military intelligence service amt f\u00fcr den milit\u00e4rischen abschirmdienst national organisations germany taking care national security aspects according minister primary task new organization founded 23 february 2011 detect prevent attacks national infrastructure mentioned incidents like stuxnet provisions cyber security incorporated rules framed information technology act 2000 national cyber security policy 2013 policy framework ministry electronics information technology meity aims protect public private infrastructure cyber attacks safeguard information personal information web users financial banking information sovereign data cert- nodal agency monitors cyber threats country post national cyber security coordinator also created prime minister office pmo indian companies act 2013 also introduced cyber law cyber security obligations part indian directors provisions cyber security incorporated rules framed information technology act 2000 update 2013 following cyber attacks first half 2013 government news media television station bank websites compromised national government committed training 5,000 new cybersecurity experts 2017 south korean government blamed northern counterpart attacks well incidents occurred 2009 2011 2012 pyongyang denies accusations 1986 computer fraud abuse act key legislation prohibits unauthorized access damage protected computers defined although various measures proposed \u2013 none succeeded 2013 executive order improving critical infrastructure cybersecurity signed prompted creation nist cybersecurity framework standardized government testing services general services administration gsa standardized penetration test service pre-vetted support service rapidly address potential vulnerabilities stop adversaries impact us federal state local governments services commonly referred highly adaptive cybersecurity services hacs listed us gsa advantage website see information penetration test standardized government penetration test services department homeland security dedicated division responsible response system risk management program requirements cybersecurity united states called national cyber security division division home us-cert operations national cyber alert system national cybersecurity communications integration center brings together government organizations responsible protecting computer networks networked infrastructure third priority federal bureau investigation fbi protect united states cyber-based attacks high-technology crimes along national white collar crime center nw3c bureau justice assistance bja part multi-agency task force internet crime complaint center also known ic3 addition specific duties fbi participates alongside non-profit organizations infragard criminal division united states department justice operates section called computer crime intellectual property section ccips charge investigating computer crime intellectual property crime specialized search seizure digital evidence computers networks 2017 ccips published framework vulnerability disclosure program online systems help organizations clearly describe authorized vulnerability disclosure discovery conduct thereby substantially reducing likelihood described activities result civil criminal violation law computer fraud abuse act 18 u.s.c \u00a7 1030 united states cyber command also known uscybercom tasked defense specified department defense information networks ensures security integrity governance government military infrastructure assets role protection civilian networks u.s. federal communications commission role cybersecurity strengthen protection critical communications infrastructure assist maintaining reliability networks disasters aid swift recovery ensure first responders access effective communications services food drug administration issued guidance medical devices national highway traffic safety administration concerned automotive cybersecurity criticized government accountability office following successful attacks airports claimed attacks airplanes federal aviation administration devoted funding securing systems board planes private manufacturers aircraft communications addressing reporting system concerns also raised future next generation air transportation system computer emergency response team name given expert groups handle computer security incidents us two distinct organization exist although work closely together growing concern cyberspace become next theater warfare mark clayton christian science monitor described article titled new cyber arms race future wars fought soldiers guns planes drop bombs also fought click mouse half world away unleashes carefully weaponized computer programs disrupt destroy critical industries like utilities transportation communications energy attacks could also disable military networks control movement troops path jet fighters command control warships led new terms cyberwarfare cyberterrorism united states cyber command created 2009 many countries similar forces critical voices question whether cybersecurity significant threat made cybersecurity fast-growing field concerned reducing organizations risk hack data breach according research enterprise strategy group 46 organizations say problematic shortage cybersecurity skills 2016 28 2015 commercial government non-governmental organizations employ cybersecurity professionals fastest increases demand cybersecurity workers industries managing increasing volumes consumer data finance health care retail however use term cybersecurity prevalent government job descriptions typical cyber security job titles descriptions include student programs also available people interested beginning career cybersecurity meanwhile flexible effective option information security professionals experience levels keep studying online security training including webcasts wide range certified courses also available united kingdom nationwide set cyber security forums known u.k cyber security forum established supported government cyber security strategy order encourage start-ups innovation address skills gap identified u.k government following terms used regards computer security explained", + "neighbors": [ + 11, + 14, + 46, + 77, + 85, + 103, + 108, + 111, + 120, + 123, + 134, + 144, + 149, + 158, + 162, + 170, + 186, + 190, + 225, + 227, + 254, + 272, + 282, + 289, + 293, + 310, + 317, + 338, + 343, + 346, + 363, + 379, + 393, + 412, + 415, + 429, + 439, + 476, + 479, + 494, + 517, + 518, + 528, + 576, + 595, + 598, + 600, + 608, + 611, + 633, + 655, + 678, + 692, + 698, + 701, + 703, + 739, + 740, + 747, + 750, + 754, + 762, + 763, + 789, + 798, + 800, + 834, + 876, + 898, + 938, + 944, + 1003, + 1011, + 1015, + 1019, + 1039, + 1042, + 1063, + 1090, + 1096, + 1101, + 1112, + 1121, + 1138, + 1140, + 1151, + 1159, + 1186, + 1200, + 1202, + 1224, + 1239, + 1240, + 1243, + 1250, + 1275, + 1291, + 1303, + 1309, + 1324, + 1325, + 1327, + 1335, + 1338, + 1350, + 1355, + 1361, + 1368, + 1372, + 1379, + 1398, + 1415, + 1433, + 1452, + 1472, + 1475, + 1503, + 1526, + 1527, + 1535, + 1549, + 1570, + 1585, + 1594, + 1607, + 1608, + 1623 + ], + "mask": "Test" + }, + { + "node_id": 380, + "label": 3, + "text": "Emdebian_Grip:emdebian grip emdebian grip discontinued small-footprint linux distribution based compatible debian compared debian provides fine-grained control package selection size dependencies content enabling way creation small efficient debian packages use resource-limited embedded systems result reduced installation size one main benefits coming emdebian grip emdebian grip project terminated available updates planned new releases leaving version 3.1 based debian 7.1 wheezy longer supported latest stable release emdebian grip re-packs package files made available debian removing unneeded files man pages info documents documentation unwanted translation files emdebian grip debian distribution builder command package processes package compiled architectures supported debian generates equivalent emdebian grip package way binaries maintainer scripts dependencies original debian packages left untouched overall size installation footprint packages reduced packages created emdebian grip recompiled completely binary compatible debian result emdebian grip maintains much compatibility possible debian even possible mix emdebian debian packages even migrate existing debian system emdebian grip emdebian grip provides complete package repositories seven architectures i386 amd64 powerpc armhf armel mips mipsel included support standard debian tools like functional changes emdebian grip compared base debian releases since version 3.0 emdebian grip suites codenames include additional -grip suffix compared equivalent debian suites codenames july 13 2014 end-of-life notice posted project web site announced updates emdebian grip stopped leaving version 3.1 based debian 7.1 wheezy longer supported latest stable release main reasons stated cause ending project lack embedded devices provide support expandable storage much work involved preparing updates releasing new versions", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 106, + 134, + 170, + 171, + 187, + 195, + 267, + 275, + 292, + 322, + 327, + 413, + 443, + 465, + 475, + 477, + 583, + 664, + 716, + 728, + 754, + 797, + 860, + 891, + 901, + 941, + 957, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1102, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1361, + 1398, + 1415, + 1441, + 1474, + 1494, + 1524, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Train" + }, + { + "node_id": 381, + "label": 3, + "text": "Gemini_Wing:gemini wing gemini wing arcade game created tecmo released 1987 vertically-scrolling shooter one two players control futuristic aircraft travelling numerous terrains shooting enemies animalistic insectoid design home conversions released zx spectrum commodore 64 amstrad cpc amiga atari st msx x68000", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 382, + "label": 4, + "text": "Boomerang_attack:boomerang attack cryptography boomerang attack method cryptanalysis block ciphers based differential cryptanalysis attack published 1999 david wagner used break coconut98 cipher boomerang attack allowed new avenues attack many ciphers previously deemed safe differential cryptanalysis refinements boomerang attack published amplified boomerang attack rectangle attack boomerang attack based differential cryptanalysis differential cryptanalysis attacker exploits differences input cipher plaintext affect resultant difference output ciphertext high-probability differential input difference produce likely output difference needed covers nearly cipher boomerang attack allows differentials used cover part cipher attack attempts generate so-called quartet structure point halfway cipher purpose say encryption action e cipher split two consecutive stages e e e e e plaintext message suppose two differentials two stages say e basic attack proceeds follows one attack kasumi block cipher used 3gpp related-key rectangle attack breaks full eight rounds cipher faster exhaustive search biham et al. 2005 attack requires 2 chosen plaintexts encrypted one four related keys time complexity equivalent 2 kasumi encryptions", + "neighbors": [ + 32, + 104, + 174, + 284, + 289, + 633, + 969, + 995, + 1071, + 1181, + 1232, + 1233, + 1240, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 383, + "label": 9, + "text": "Louis_Hodes:louis hodes louis hodes june 19 1934 \u2013 june 30 2008 american mathematician computer scientist cancer researcher got phd hartley rogers thesis computability john mccarthy late 1950s early 1960s helped produce earliest implementations lisp marvin minsky early research visual pattern recognition lisp also credited idea initial implementation logic programming 1966 moved cancer-related research specifically national institutes health later national cancer institute turned interest visual pattern recognition medical imaging applications also worked efficient algorithms screening chemical compounds studying chemical carcinogenesis work models clustering chemical compounds pronounced milestone developmental therapeutics program national cancer institute revolutioniz ing selection compounds interest measuring novelty chemical structure comparing known compounds", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 501, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 384, + "label": 4, + "text": "Pop-up_ad:pop-up ad pop-up ads pop-ups forms online advertising world wide web pop-up graphical user interface gui display area usually small window suddenly appears pops foreground visual interface pop-up window containing advertisement usually generated javascript uses cross-site scripting xss sometimes secondary payload uses adobe flash also generated vulnerabilities/security holes browser security variation pop-up window pop-under advertisement opens new browser window active window pop-unders interrupt user immediately appear user closes covering window making difficult determine website created pop-up ads originated tripod.com webpage hosting site late 1990s javascript provided capability web page open another window ethan zuckerman claims used capability launch advertisements separate windows response complaints advertisers ads appearing pages sexual content zuckerman later apologized unforeseen nuisance pop-up ads evolved web development design technologies allow author associate item pop-up action including cancel innocent looking button bad experiences apprehensive possible damage may cause users click interact item inside pop-up window whatsoever may leave site generated block pop-ups opera first major browser incorporate tools block pop-up ads mozilla browser later improved blocking pop-ups generated page loads early 2000s major web browsers except internet explorer let users block unwanted pop-ups almost completely 2004 microsoft released windows xp sp2 added pop-up blocking internet explorer modern browsers provide pop-up blocking tools third-party tools add features ad filtering users websites web applications continuously experience unwanted pop ads course normal interaction web browser ordinarily users respond dismissing pop-up close cancel feature window hosting pop-up typical response authors pop-up advertising depend create on-screen buttons controls look similar close cancel option user chooses one simulated cancel options however button performs unexpected unauthorized action opening new pop-up downloading unwanted file user system hover ad in-page pop-up uses dhtml combine banner ad pop-up window appears front browser screen javascript imposes advertisement webpage transparent layer advertisement appear variety forms example advertisement contain adobe flash animation links advertiser site advertisement also look like regular window pop-up blockers block ad part webpage blocked third-party ad blockers adblock adblock plus using custom style sheets urls sometimes redirected advertisement pages url redirection urls sometimes opened new tab content old background tab replaced advertisement page url redirection times switches tab user advertisement tab adblock plus ublock noscript block redirects pop-under ads similar pop-up ads ad window appears hidden behind main browser window rather superimposed front pop-up ads became widespread intrusive often taking whole computer screen many users would immediately close pop-up ads appeared site without looking pop-under ads immediately impede view content remain unnoticed user closes minimizes main browser window pop-under ad involves two javascript functions introduced 1997 netscape 2.0b3 browser modern web publishers advertisers use create window front users screen load advertisement send behind screen modern browsers allow codice_1 execute called user interaction e.g. mouse click event handler non-interactive calls timer callback load events etc codice_1 result new window blocked bypass restriction pop-under ads trigger mouse click event listener attached directly document document body enables catching mouse click events consumed click event handlers calling codice_1 without blocked example user selects text mouse click triggers mouse click handler attached document pop-under opens using code notice techniques bypass codice_1 call restriction hijacking mouse clicks exitexchange.com filed patent 2000 subset pop-under advertising called exit pop years controversy numerous articles pop-under patent patent awarded united states patent trademark office uspto april june 2008 respective patent numbers patent 7,386,555 related method opening exit pop toolbar software application computing device whereas patent 7,353,229 covers method used open exit pop embedded script found within media file e.g. javascript code web page copyright aspects pop-up advertising discussed wikipedia articles derivative works transformativeness articles contain illustrations links examples pop-up advertising", + "neighbors": [ + 14, + 120, + 124, + 293, + 509, + 531, + 697, + 746, + 780, + 800, + 1228, + 1280, + 1423 + ], + "mask": "Test" + }, + { + "node_id": 385, + "label": 1, + "text": "Traditional_Knowledge_Digital_Library:traditional knowledge digital library traditional knowledge digital library tkdl indian digital knowledge repository traditional knowledge especially medicinal plants formulations used indian systems medicine set 2001 collaboration council scientific industrial research csir ministry ayush objective library protect ancient traditional knowledge country exploitation biopiracy unethical patents documenting electronically classifying per international patent classification systems apart non-patent database serves foster modern research based traditional knowledge simplifies access vast knowledge remedies practices 2010 transcribed 148 books ayurveda unani siddha yoga public domain 34 million pages information translated five languages \u2014 english german french spanish japanese data 80,000 formulations ayurveda 1,000,000 unani 12,000 siddha already put tkdl plus signed agreements leading international patent offices european patent office epo united kingdom trademark patent office ukpto united states patent trademark office protect traditional knowledge biopiracy giving patent examiners international patent offices access tkdl database patent search examination issue biopiracy unethical bioprospecting made headlines government india successfully revoked limited turmeric basmati rice patents granted united states patent trademark office uspto neem patent granted european patent office epo late 1990s soon patent claims came light india \u2019 vast traditional medicine knowledge existed languages like sanskrit hindi arabic persian urdu tamil making inaccessible examiners international patent offices verify claims experience prompted department ayush government india create task force experts areas traditional medicine systems india i.e. ayurveda unani siddha yoga patent examiners experts scientists technical officers creation traditional knowledge digital library tkdl initiated 2001 tasks included example transcribing sanskrit shlokas describe ayurvedic formulation text using traditional knowledge resource classification tkrc devised purpose easily understandable patent examiner anywhere world reason entire 34 million pages text available english german french spanish japanese database project reached completion 2006 government allowed access library international patent offices including european patent office epo japan uk subject non-disclosure clause allows patent examiners evaluate patent applications stop attempts patent traditional knowledge new inventions agreements signed epo february 2009 united kingdom trademark patent office ukpto january 2010 u.s. patent trademark office uspto summit meeting us president barack obama prime minister manmohan singh also january 2010 patent examiners getting access tkdl database legal cases regarding unethical patent claims taken years vast expenditure case could avoided another project include data relating 1,500 postures yoga began 2008 new reports large number false gurus yoga masters attempted patent ancient knowledge countries example 131 yoga-related patents traced us alone 2007 uproar parliament media government india took issue uspto thereafter team yoga gurus nine schools working government officials 200 scientists council scientific industrial research csir scanned 35 ancient texts including hindu epics mahabharata bhagwad gita patanjali yoga sutras register native pose end 2009 1500 asanas added 2010 union environment minister jairam ramesh stated eight years 34 million pages information collected estimated cost rs 7 crore least 36 cases identified epo 40 cases uspto using tkdl future project people \u2019 register biodiversity set government document protect traditional knowledge passed oral tradition india \u2019 national biodiversity act 2002", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 386, + "label": 9, + "text": "Optimizing_compiler:optimizing compiler computing optimizing compiler compiler tries minimize maximize attributes executable computer program common requirements minimize program execution time memory requirement power consumption last two popular portable computers compiler optimization generally implemented using sequence optimizing transformations algorithms take program transform produce semantically equivalent output program uses fewer resources and/or executes faster shown code optimization problems np-complete even undecidable practice factors programmer willingness wait compiler complete task place upper limits optimizations compiler implementer might provide optimization generally cpu- memory-intensive process past computer memory limitations also major factor limiting optimizations could performed factors optimization rarely produces optimal output sense fact optimization may impede performance cases rather heuristic methods improving resource usage typical programs techniques used optimization broken among various scopes affect anything single statement entire program generally speaking locally scoped techniques easier implement global ones result smaller gains examples scopes include addition scoped optimizations two general categories optimization following instance local machine dependent optimization set register 0 obvious way use constant 0 instruction sets register value constant less obvious way xor register compiler know instruction variant use many risc machines instructions would equally appropriate since would length take time many microprocessors intel x86 family turns xor variant shorter probably faster need decode immediate operand use internal immediate operand register potential problem xor may introduce data dependency previous value register causing pipeline stall however processors often xor register special case cause stalls large extent compiler optimization techniques following themes sometimes conflict optimization techniques primarily designed operate loops include data-flow optimizations based data-flow analysis primarily depend certain properties data propagated control edges control flow graph include optimizations intended done transforming program special form called static single assignment see ssa form every variable assigned one place although function without ssa effective ssa many optimizations listed sections also benefit special changes register allocation although many also apply non-functional languages either originate easily implemented particularly critical functional languages lisp ml interprocedural optimization works entire program across procedure file boundaries works tightly intraprocedural counterparts carried cooperation local part global part typical interprocedural optimizations procedure inlining interprocedural dead code elimination interprocedural constant propagation procedure reordering usual compiler needs perform interprocedural analysis actual optimizations interprocedural analyses include alias analysis array access analysis construction call graph interprocedural optimization common modern commercial compilers sgi intel microsoft sun microsystems long time open source gcc criticized lack powerful interprocedural analysis optimizations though improving another open source compiler full analysis optimization infrastructure open64 due extra time space required interprocedural analysis compilers perform default users must use compiler options explicitly tell compiler enable interprocedural analysis expensive optimizations early history compilers compiler optimizations good hand-written ones compiler technologies improved good compilers typically generate code good enough generally longer warrant much higher effort program hand-optimized code assembly language except special cases risc cpu architectures even vliw hardware compiler optimization key obtaining efficient code risc instruction sets compact hard human manually schedule combine small instructions get efficient results indeed architectures designed rely compiler writers adequate performance however optimizing compilers means perfect way compiler guarantee program source code fastest smallest possible equivalent compiled program output compiler fundamentally impossible would solve halting problem assuming turing completeness may proven considering call function foo function returns nothing side effects i/o modify global variables live data structures etc. fastest possible equivalent program would simply eliminate function call however function foo fact return program call foo would different program without call optimizing compiler determine solving halting problem additionally number practical issues optimizing compiler technology moreover optimization algorithms complicated especially used compile large complex programming languages bugs introduce errors generated code cause internal errors compilation compiler errors kind disconcerting user especially case since may clear optimization logic fault case internal errors problem partially ameliorated fail-safe programming technique optimization logic compiler coded failure trapped warning message issued rest compilation proceeds successful completion work improve optimization technology continues one approach use so-called post-pass optimizers commercial versions date back mainframe software late 1970s tools take executable output optimizing compiler optimize even post pass optimizers usually work assembly language machine code level contrast compilers optimize intermediate representations programs performance post-pass compilers limited fact much information available original source code always available processor performance continues improve rapid pace memory bandwidth improves slowly optimizations reduce memory bandwidth requirements even cost making processor execute relatively instructions become useful examples already mentioned include loop nest optimization rematerialization early compilers 1960s often primarily concerned simply compiling code correctly efficiently \u2013 compile times major concern one earliest notable optimizing compilers bliss 1970 described design optimizing compiler 1975 late 1980s optimizing compilers sufficiently effective programming assembly language declined co-evolved development risc chips advanced processor features instruction scheduling speculative execution designed targeted optimizing compilers rather human-written assembly code", + "neighbors": [ + 78, + 85, + 270, + 292, + 306, + 386, + 388, + 486, + 503, + 579, + 643, + 789, + 926, + 940, + 1044, + 1052, + 1207, + 1231, + 1320, + 1335, + 1372, + 1414, + 1421, + 1430, + 1511, + 1518 + ], + "mask": "Test" + }, + { + "node_id": 387, + "label": 2, + "text": "Memory_management_(operating_systems):memory management operating systems operating systems memory management function responsible managing computer primary memory memory management function keeps track status memory location either allocated free determines memory allocated among competing processes deciding gets memory receive much allowed memory allocated determines memory locations assigned tracks memory freed unallocated updates status distinct application memory management process manages memory assigned operating system single allocation simplest memory management technique computer memory usually exception small portion reserved operating system available single application ms-dos example system allocates memory way embedded system running single application might also use technique system using single contiguous allocation may still multitask swapping contents memory switch among users early versions music operating system used technique partitioned allocation divides primary memory multiple memory partitions usually contiguous areas memory partition might contain information specific job task memory management consists allocating partition job starts unallocating job ends partitioned allocation usually requires hardware support prevent jobs interfering one another operating system ibm system/360 used lock-and-key technique systems used base bounds registers contained limits partition flagged invalid accesses univac 1108 storage limits register separate base/bound sets instructions data system took advantage memory interleaving place called bank bank separate memory modules partitions may either static defined initial program load ipl boot time computer operator dynamic automatically created specific job ibm system/360 operating system multiprogramming fixed number tasks mft example static partitioning multiprogramming variable number tasks mvt example dynamic mvt successors use term region distinguish dynamic partitions static ones systems partitions may relocatable using hardware typed memory like burroughs corporation b5500 base bounds registers like pdp-10 ge-635 relocatable partitions able compacted provide larger chunks contiguous physical memory compaction moves in-use areas memory eliminate holes unused areas memory caused process termination order create larger contiguous free areas systems allow partitions swapped secondary storage free additional memory early versions ibm time sharing option tso swapped users single time-sharing partition paged allocation divides computer primary memory fixed-size units called page frames program virtual address space pages size hardware memory management unit maps pages frames physical memory allocated page basis address space appears contiguous usually paged memory management job runs address space however single address space operating systems run processes within single address space ibm runs processes within large address space ibm os/vs2 svs ran jobs single 16mib virtual address space paged memory demand-paged system move pages required primary secondary memory segmented memory memory management technique provide user program linear contiguous address space segments areas memory usually correspond logical grouping information code procedure data array segments require hardware support form segment table usually contains physical address segment memory size data access protection bits status swapped swapped etc segmentation allows better access protection schemes memory references relative specific segment hardware permit application reference memory defined segment possible implement segmentation without paging without paging support segment physical unit swapped memory required paging support pages usually unit swapping segmentation adds additional level security addresses segmented system usually consist segment id offset relative segment base address defined offset zero intel ia-32 x86 architecture allows process 16,383 segments 4gib ia-32 segments subdivisions computer linear address space virtual address space provided paging hardware multics operating system probably best known system implementing segmented memory multics segments subdivisions computer physical memory 256 pages page 1k 36-bit words size resulting maximum segment size 1mib 9-bit bytes used multics process could 4046 segments rollout/rollin computer operating system memory management technique entire non-shared code data running program swapped auxiliary memory disk drum free main storage another task programs may rolled demand end or\u2026when waiting long event rollout/rollin commonly used time-sharing systems user think time relatively long compared time swap unlike virtual storage\u2014paging segmentation rollout/rollin require special memory management hardware however unless system relocation hardware memory map base bounds registers program must rolled back original memory locations rollout/rollin largely superseded virtual memory rollout/rollin optional feature os/360 multiprogramming variable number tasks mvt rollout/rollin allows temporary dynamic expansion particular job beyond originally specified region job needs space rollout/rollin attempts obtain unassigned storage job use unassigned storage another job rolled -- i.e. transferred auxiliary storage -- region may used first job released first job additional storage available either 1 unassigned storage source 2 receive job transferred back main storage rolled note rollin/rollout os/360 used batch jobs rollin occur jobstep borrowing region terminates", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 142, + 170, + 171, + 185, + 187, + 225, + 265, + 272, + 322, + 347, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 961, + 966, + 996, + 998, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1202, + 1213, + 1224, + 1301, + 1304, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 388, + "label": 3, + "text": "Complex_instruction_set_computer:complex instruction set computer complex instruction set computer cisc computer single instructions execute several low-level operations load memory arithmetic operation memory store capable multi-step operations addressing modes within single instructions term retroactively coined contrast reduced instruction set computer risc therefore become something umbrella term everything risc large complex mainframe computers simplistic microcontrollers memory load store operations separated arithmetic instructions modern risc processor therefore much complex say modern microcontroller using cisc-labeled instruction set especially complexity electronic circuits also number instructions complexity encoding patterns typical differentiating characteristic risc designs use uniform instruction length almost instructions employ strictly separate load/store-instructions examples instruction set architectures retroactively labeled cisc system/360 z/architecture pdp-11 vax architectures data general nova many others well known microprocessors microcontrollers also labeled cisc many academic publications include motorola 6800 6809 68000-families intel 8080 iapx432 x86-family zilog z80 z8 z8000-families national semiconductor 32016 ns320xx-line mos technology 6502-family intel 8051-family others designs regarded borderline cases writers instance microchip technology pic labeled risc circles cisc others 6502 6809 described risc-like although complex addressing modes well arithmetic instructions operate memory contrary risc-principles risc philosophy became prominent many computer architects tried bridge so-called semantic gap i.e. design instruction sets directly support high-level programming constructs procedure calls loop control complex addressing modes allowing data structure array accesses combined single instructions instructions also typically highly encoded order enhance code density compact nature instruction sets results smaller program sizes fewer slow main memory accesses time early 1960s onwards resulted tremendous saving cost computer memory disc storage well faster execution also meant good programming productivity even assembly language high level languages fortran algol always available appropriate indeed microprocessors category sometimes still programmed assembly language certain types critical applications 1970s analysis high-level languages indicated complex machine language implementations determined new instructions could improve performance instructions added never intended used assembly language fit well compiled high-level languages compilers updated take advantage instructions benefits semantically rich instructions compact encodings seen modern processors well particularly high-performance segment caches central component opposed embedded systems fast complex expensive memories inherently limited size making compact code beneficial course fundamental reason needed main memories i.e. dynamic ram today remain slow compared high-performance cpu core many designs achieved aim higher throughput lower cost also allowed high-level language constructs expressed fewer instructions observed always case instance low-end versions complex architectures i.e using less hardware could lead situations possible improve performance using complex instruction procedure call enter instruction instead using sequence simpler instructions one reason architects microcode writers sometimes over-designed assembly language instructions including features could implemented efficiently basic hardware available could instance side effects conventional flags setting register memory location perhaps seldom used done via ordinary non duplicated internal buses even external bus would demand extra cycles every time thus quite inefficient even balanced high-performance designs highly encoded relatively high-level instructions could complicated decode execute efficiently within limited transistor budget architectures therefore required great deal work part processor designer cases simpler typically slower solution based decode tables and/or microcode sequencing appropriate time transistors components limited resource also left fewer components less opportunity types performance optimizations circuitry performs actions defined microcode many cisc processors processor many ways reminiscent structure early cpu designs early 1970s gave rise ideas return simpler processor designs order make feasible cope without relatively large expensive rom tables and/or pla structures sequencing and/or decoding first retroactively risc- labeled processor ibm 801 ibm watson research center mid-1970s tightly pipelined simple machine originally intended used internal microcode kernel engine cisc designs also became processor introduced risc idea somewhat larger public simplicity regularity also visible instruction set would make easier implement overlapping processor stages pipelining machine code level i.e level seen compilers however pipelining level already used high performance cisc supercomputers order reduce instruction cycle time despite complications implementing within limited component count wiring complexity feasible time internal microcode execution cisc processors hand could less pipelined depending particular design therefore less akin basic structure risc processors modern context complex variable-length encoding used typical cisc architectures makes complicated still feasible build superscalar implementation cisc programming model directly in-order superscalar original pentium out-of-order superscalar cyrix 6x86 well known examples frequent memory accesses operands typical cisc machine may limit instruction level parallelism extracted code although strongly mediated fast cache structures used modern designs well measures due inherently compact semantically rich instructions average amount work performed per machine code unit i.e per byte bit higher cisc risc processor may give significant advantage modern cache based implementation transistors logic plas microcode longer scarce resources large high-speed cache memories limited maximum number transistors today although complex transistor count cisc decoders grow exponentially like total number transistors per processor majority typically used caches together better tools enhanced technologies led new implementations highly encoded variable length designs without load-store limitations i.e non-risc governs re-implementations older architectures ubiquitous x86 see well new designs microcontrollers embedded systems similar uses superscalar complexity case modern x86 solved converting instructions one micro-operations dynamically issuing micro-operations i.e indirect dynamic superscalar execution pentium pro amd k5 early examples allows fairly simple superscalar design located fairly complex decoders buffers giving speak best worlds many respects technique also used ibm z196 later z/architecture microprocessors terms cisc risc become less meaningful continued evolution cisc risc designs implementations first highly tightly pipelined x86 implementations 486 designs intel amd cyrix ibm supported every instruction predecessors achieved maximum efficiency fairly simple x86 subset little typical risc instruction set i.e without typical risc load-store limitations intel p5 pentium generation superscalar version principles however modern x86 processors also typically decode split instructions dynamic sequences internally buffered micro-operations helps execute larger subset instructions pipelined overlapping fashion also facilitates advanced extraction parallelism code stream even higher performance contrary popular simplifications present also academic texts ciscs microcoded complex instructions cisc became catch-all term meaning anything load-store risc architecture number instructions complexity implementation instructions define cisc fact arithmetic instructions also perform memory accesses compared small 8-bit cisc processor risc floating-point instruction complex cisc even need complex addressing modes 32 64-bit risc processors may well complex addressing modes small 8-bit cisc processors pdp-10 pdp-8 intel 80386 intel 4004 motorola 68000 system z mainframe burroughs b5000 vax zilog z80000 mos technology 6502 vary wildly number sizes formats instructions number types sizes registers available data types hardware support operations like scanning substring arbitrary-precision bcd arithmetic transcendental functions others 8-bit addition subtraction cisc category load-operate instructions load and/or store memory contents within instructions perform actual calculations instance pdp-8 8 fixed-length instructions microcode cisc instructions work powerpc 230 instructions vaxes complex internals like register renaming reorder buffer risc minimal cisc 8 instructions clearly cisc combines memory access computation instructions", + "neighbors": [ + 51, + 61, + 76, + 78, + 85, + 86, + 105, + 123, + 127, + 165, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 386, + 445, + 457, + 460, + 465, + 486, + 508, + 529, + 579, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1213, + 1219, + 1220, + 1222, + 1256, + 1263, + 1272, + 1284, + 1290, + 1319, + 1398, + 1421, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1605, + 1608, + 1616, + 1629, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 389, + "label": 3, + "text": "Hareraiser:hareraiser hareraiser computer game originally released 1984 uk home computer platforms released two parts prelude finale prize worth \u00a330,000 offer game could solved game released acorn electron amstrad cpc bbc micro model b commodore 64 commodore vic-20 ex dragon 32 msx oric atmos 48k sinclair zx spectrum 1984 \u00a38.95 part game takes form series graphical screens depicting grass sky trees occasional text clues interaction pressing cursor keys follow hare moves across screen disappears one sides hints puzzle solved may case text position trees sun clouds elements different screen interpreted way solvers prelude would also buy solve finale could enter competition locate prize bejewelled 18 carat golden hare pendant featured cover golden hare previously prize solving book masquerade british artist kit williams buried secret location ampthill park bedfordshire object game solve clues book would lead successful treasure-hunter location golden prize several sources state erroneously hareraiser based masquerade fact thing apart prize two common feature hare haresoft founded dugald thompson controversial winner masquerade business partner john guard haresoft claimed game released two parts make fun enable competitors ages participate sinclair user magazine however suggested simply make money haresoft stated additional clue revealed harrods tv personality anneka rice nature clue remains unknown whether rice even revealed clue game sell well haresoft went liquidation hareraiser never solved hare sold sotheby auction creditors 1988 although given guide price \u00a33,000\u20136,000 fact exceed haresoft stated value selling \u00a331,900 although rumoured sold early 1990s whereabouts unknown 20 years july 2009 appeal made bbc radio 4 current owner granddaughter got touch kit williams reunited hare bbc tv documentary game awarded 3/10 sinclair user reviewer richard price struggling find reason play game except sincere need get rich norwich gaming festival 2017 comedian computer game historian stuart ashen described showed game play called worst game ever revealing solution videogame predecessor discovered via cheating ashen stated believed puzzle intentionally designed unsolvable haresoft would lose art piece golden hare", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 390, + "label": 7, + "text": "HTCondor:htcondor htcondor open-source high-throughput computing software framework coarse-grained distributed parallelization computationally intensive tasks used manage workload dedicated cluster computers farm work idle desktop computersso-called cycle scavenging htcondor runs linux unix mac os x freebsd microsoft windows operating systems htcondor integrate dedicated resources rack-mounted clusters non-dedicated desktop machines cycle scavenging one computing environment htcondor developed htcondor team university wisconsin\u2013madison freely available use htcondor follows open-source philosophy licensed apache license 2.0 htcondor makes use unused computing time leaving computers turned use htcondor increase energy consumption associated costs starting version 7.1.1 htcondor hibernate wake machines based user-specified policies feature previously available via third-party software htcondor formerly known condor name changed october 2012 resolve trademark lawsuit htcondor scheduler software used distribute jobs first draft assembly human genome way example nasa advanced supercomputing facility nas htcondor pool consists approximately 350 sgi sun workstations purchased used software development visualization email document preparation etc workstation runs daemon watches user i/o cpu load workstation idle two hours job batch queue assigned workstation run daemon detects keystroke mouse motion high non-htcondor cpu usage point job removed workstation placed back batch queue htcondor run sequential parallel jobs sequential jobs run several different universes including vanilla provides ability run batch ready programs standard universe target application re-linked htcondor i/o library provides remote job i/o job checkpointing htcondor also provides local universe allows jobs run submit host world parallel jobs htcondor supports standard message passing interface parallel virtual machine goux et al 2000 addition master worker mw library extremely parallel tasks htcondor-g allows htcondor jobs use resources direct control mostly used talk grid cloud resources like pre-ws ws globus nordugrid arc unicore amazon elastic compute cloud also used talk batch systems like torque/pbs lsf support sun grid engine currently development part egee project htcondor supports drmaa job api allows drmaa compliant clients submit monitor htcondor jobs saga c++ reference implementation provides htcondor plug-in adaptor makes htcondor job submission monitoring available via saga python c++ apis htcondor features include dagman provides mechanism describe job dependencies", + "neighbors": [ + 25, + 134, + 399, + 611, + 760, + 847, + 961, + 1138, + 1421, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 391, + "label": 9, + "text": "RScheme:rscheme rscheme scheme implementation developed donovan kolbly object-orientation approach adapted dylan rscheme implements r4rs except transcript-on transcript-off r5rs except define-syntax addition rscheme reflective object system many operating system services modules threads systems programming features including ability integrate compile c code code rscheme compiled c c compiled normal c compiler generate machine code default keep compilation fast code size rscheme compiles bytecodes interpreted runtime virtual machine systems compiling c done on-the-fly resulting object code dynamically loaded back image execution rscheme known publicly available scheme implementation include real-time safe garbage collector", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 347, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 796, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1138, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1582, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 392, + "label": 9, + "text": "Racket_(programming_language):racket programming language racket general-purpose multi-paradigm programming language based scheme dialect lisp designed platform programming language design implementation addition core racket language racket also used refer family racket programming languages set tools supporting development racket racket also used scripting computer science education research racket platform provides implementation racket language including run-time system libraries jit compiler along drracket integrated development environment ide written racket racket used programbydesign outreach program aims turn computer science indispensable part liberal arts curriculum core racket language known extensive macro system enables creating embedded domain-specific languages language constructs classes modules separate dialects racket different semantics platform distribution free open-source software distributed gnu lesser general public license lgpl extensions packages written community may uploaded racket package catalog matthias felleisen founded plt mid 1990s first research group soon project dedicated producing pedagogic materials novice programmers lectures exercises/projects software january 1995 group decided develop pedagogic programming environment based scheme matthew flatt cobbled together mred original virtual machine racket libscheme wxwidgets free systems years followed team including flatt robby findler shriram krishnamurthi cormac flanagan many others produced drscheme programming environment novice scheme programmers research environment soft typing main development language drscheme supported named plt scheme parallel team began conducting workshops high school teachers training program design functional programming field tests teachers students provided essential clues directing development following years plt added teaching languages algebraic stepper transparent read\u2013eval\u2013print loop constructor-based printer many innovations drscheme producing application-quality pedagogic program development environment 2001 core team felleisen findler flatt krishnamurthi also written published first textbook design programs based teaching philosophy racket manifesto details principles driving development racket presents evaluation framework behind design process details opportunities future improvements first generation plt scheme revisions introduced features programming large modules classes version 42 introduced units \u2013 first-class module system \u2013 complement classes large scale development class system gained features e.g java-style interfaces also lost several features e.g multiple inheritance throughout versions language evolved throughout number successive versions gaining milestone popularity version 53 leading extensive work following version 100 would equivalent 1.0 release current popular version systems next major revision named version 200 introduced new default module system cooperates macros particular module system ensures run-time compile-time computation separated support tower languages unlike units modules first-class objects version 300 introduced unicode support foreign library support refinements class system later 300 series improved performance language runtime addition jit compiler switch default generational garbage collection next major release project switched conventional sequence-based version numbering version 4.0 introduced codice_1 shorthand specify language module written revision introduced immutable pairs lists support fine-grained parallelism statically-typed dialect june 7 2010 plt scheme renamed racket renaming coincided release version 5.0 subsequently graphical user interface gui backend rewritten racket c++ version 5.1 using native ui toolkits platforms version 5.2 included background syntax checking tool new plotting library database library new extended repl version 5.3 included new submodule feature optionally loaded modules new optimization tools json library features version 5.3.1 introduced major improvements drracket background syntax checker turned default new documentation preview tool added version 6.0 racket released second-generation package management system part development principal drracket racket repository reorganized split large set small packages making possible install minimal racket install packages needed version 7 racket released new macro expander written racket part preparations supporting moving chez scheme runtime system supporting multiple runtime systems racket core language includes macros modules lexical closures tail calls delimited continuations parameters fluid variables software contracts green os threads language also comes primitives eventspaces custodians control resource management enables language act like operating system loading managing programs extensions language created powerful macro system together module system custom parsers control aspects language unlike programming languages lack macro systems language constructs racket written base language using macros include mixin class system component module system expressive ml opaque ascription pattern matching language features first contract system higher-order programming language racket contract system inspired design contract work eiffel extends work higher-order values first-class functions objects reference cells example object checked contract ensured make contract checks methods eventually invoked racket includes bytecode jit jit compilers bytecode compiler translates internal bytecode format run racket virtual machine jit compiler translating bytecode native code x86 x86-64 arm powerpc platforms runtime since 2004 language also shipped planet package manager integrated module system third-party libraries transparently imported used also planet built-in versioning policy prevent dependency hell end 2014 much racket code moved new packaging system separate main code base new packaging system serviced client program named raco new package system provides fewer features planet blog post jay mccarthy racket blog explains rationale change duplicate older system features clearly distinguish racket languages lisp family integrated language extensibility features support building new domain-specific general-purpose languages racket extensibility features built module system allow context-sensitive module-level control syntax example codice_2 syntactic form overridden change semantics function application similarly codice_3 form allows arbitrary static analysis entire module since module used language via codice_1 notation effectively means virtually aspect language programmed controlled module-level extensibility features combined scheme-like hygienic macro system provides features lisp s-expression manipulation system scheme 84 hygienic extend-syntax macros r5rs syntax-rules indeed fair say macro system carefully tuned application programming interface api compiler extensions using compiler api programmers add features entire domain-specific languages manner makes completely indistinguishable built-in language constructs macro system racket used construct entire language dialects includes typed racket gradually typed dialect racket eases migration untyped typed code lazy racket\u2014a dialect lazy evaluation hackett combines haskell racket pedagogical programming language pyret originally implemented racket. ref name= index 2017 /ref dialects include frtime functional reactive programming scribble documentation language slideshow presentation language several languages education racket core distribution provides libraries aid process constructing new programming languages languages restricted s-expression based syntax addition conventional readtable-based syntax extensions racket codice_1 makes possible language programmer define arbitrary parser example using parser tools library see racket logic programming example language language platform provides self-hosted ide named drracket continuation-based web server graphical user interface tools racket also viable scripting tool used scripting unix shell parse command line arguments execute external tools includes libraries like common scripting languages drracket formerly drscheme widely used among introductory computer science courses teach scheme racket lauded simplicity appeal beginner programmers ide originally built use teachscheme project programbydesign outreach effort northeastern university number affiliated universities attracting high school students computer science courses college level editor provides source highlighting syntax run-time errors parenthesis matching debugger algebraic stepper student-friendly features include support multiple language levels beginning student intermediate student also integrated library support sophisticated analysis tools advanced programmers module-oriented programming supported module browser contour view integrated testing coverage measurements refactoring support provides integrated context-sensitive access extensive hyper-linked help system named help desk drracket available windows macos unix linux x window system programs behave similarly platforms trivial hello world program running program produces output slightly less trivial program program taken racket website draws sierpinski triangle nested depth 8 using codice_1 directive source file written different dialects racket example factorial program typed racket statically typed dialect racket apart basis programming language theory racket designed used general-purpose language production systems thus racket distribution features extensive library covers systems network programming web development uniform interface underlying operating system dynamic foreign function interface several flavours regular expressions lexer/parser generators logic programming complete gui framework racket several features useful commercial language among ability generate standalone executables windows macos unix profiler debugger included integrated development environment ide unit testing framework racket used commercial projects web applications notable example hacker news website runs arc developed racket naughty dog used scripting language several video games racket used teach students algebra game design bootstrap program", + "neighbors": [ + 19, + 27, + 29, + 46, + 56, + 85, + 134, + 152, + 173, + 194, + 203, + 210, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 378, + 383, + 391, + 446, + 447, + 454, + 488, + 501, + 503, + 506, + 509, + 536, + 565, + 601, + 649, + 653, + 693, + 716, + 742, + 753, + 782, + 787, + 789, + 795, + 796, + 820, + 824, + 828, + 831, + 873, + 919, + 926, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1016, + 1021, + 1066, + 1076, + 1118, + 1119, + 1120, + 1123, + 1138, + 1173, + 1180, + 1207, + 1231, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1532, + 1536, + 1588, + 1609, + 1633, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 393, + "label": 4, + "text": "Parrot_OS:parrot os parrot linux linux distribution based debian focus computer security designed penetration testing vulnerability assessment mitigation computer forensics anonymous web browsing developed frank ruben aqua skid parrotsec intended provide suite penetration testing tools used attack mitigation security research forensics vulnerability assessment parrot based debian testing branch buster custom linux 4.19 kernel follows rolling release development model desktop environment mate default display manager lightdm project certified run devices minimum 256mb ram suitable 32-bit i386 64-bit amd64 processor architectures moreover project available armv7 armhf architectures even offers edition 32-bit 64-bit developed specifically servers carry cloud service penetration testing june 2017 parrotsec announced considering change debian devuan mainly problems highly controversial systemd january 21st 2019 parrot linux team phasing development 32-bit i386 versions future operating systems parrot multiple editions based upon debian various desktop environments available parrot home special edition parrot designed daily use targets regular users need lightweight always updated beautiful system laptops workstations distribution look feel regular parrot environment includes basic programs daily work parrot home also includes programs chat privately people encrypt documents highest cryptographic standards surf net completely anonymous secure way system also used starting point build customized pentesting platform tools need use build professional workstation taking advantage latest powerful technologies debian without hassle lightweight parrot release embedded systems aimed simplicity portability supported hardware brands raspberry pi orange pi pine64 cubieboard development team specified official release timeline based release changelogs notes included official review distribution project released monthly basis", + "neighbors": [ + 113, + 134, + 301, + 351, + 357, + 379, + 393, + 404, + 431, + 695, + 716, + 747, + 754, + 897, + 974, + 1015, + 1046, + 1049, + 1055, + 1126, + 1167, + 1276, + 1286, + 1317, + 1361, + 1369, + 1458, + 1539, + 1601 + ], + "mask": "Validation" + }, + { + "node_id": 394, + "label": 2, + "text": "Cocoa_Touch:cocoa touch cocoa touch ui framework building software programs run ios iphone ipod touch ipad watchos apple watch tvos fourth-generation apple tv apple inc. cocoa touch provides abstraction layer ios operating system iphone ipod touch ipad cocoa touch based macos cocoa api toolset like primarily written objective-c language cocoa touch allows use hardware features found macos computers thus unique ios range devices like cocoa cocoa touch follows model-view-controller mvc software architecture cocoa touch contains different set graphical control elements cocoa tools developing applications based cocoa touch included ios sdk ios watchos tvos technologies seen set layers cocoa touch highest level core os/kernel bottom hierarchical view ios watchos tvos technologies shown follows main features technologies cocoa touch cocoa touch provides key frameworks developing applications devices running ios key frameworks", + "neighbors": [ + 71, + 75, + 130, + 228, + 252, + 269, + 356, + 403, + 477, + 489, + 511, + 596, + 607, + 610, + 625, + 634, + 653, + 686, + 696, + 815, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1068, + 1138, + 1140, + 1178, + 1189, + 1190, + 1237, + 1251, + 1292, + 1298, + 1305, + 1334, + 1339, + 1373, + 1488, + 1502, + 1536, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 395, + "label": 2, + "text": "Quartz_(graphics_layer):quartz graphics layer apple macos operating system quartz quartz 2d quartz compositor part core graphics framework quartz includes 2d renderer core graphics composition engine sends instructions graphics card vertical nature quartz often synonymous core graphics general sense quartz quartz technologies refer almost every part graphics model rendering layer compositor including core image core video apple graphics technologies use quartz prefix include quartz 2d primary two-dimensional 2d text graphics rendering library directly supports aqua displaying two-dimensional graphics create user interface including on-the-fly rendering anti-aliasing quartz render text sub-pixel precision graphics limited traditional anti-aliasing default mode operation turned mac os x 10.4 tiger apple introduced quartz 2d extreme enabling quartz 2d offload rendering compatible gpus however gpu rendering enabled default due potential video redraw issues kernel panics mac os x v10.5 quartz 2d extreme renamed quartzgl however still remains disabled default situations degrade performance experience visual glitches per-application setting turned developer wishes quartz compositor compositing engine used macos mac os x jaguar later quartz compositor use graphics accelerator gpu vastly improve composition performance technology known quartz extreme enabled automatically systems supported graphics cards widely stated quartz uses pdf internally notably apple 2000 macworld presentation quartz early developer documentation often people making comparisons display postscript technology used nextstep openstep descendant quartz internal imaging model correlates well pdf object graph making easy output pdf multiple devices", + "neighbors": [ + 33, + 99, + 121, + 345, + 477, + 551, + 596, + 623, + 625, + 689, + 696, + 797, + 917, + 927, + 945, + 1001, + 1027, + 1100, + 1140, + 1158, + 1189, + 1232, + 1292, + 1322, + 1334, + 1339, + 1373, + 1409, + 1496, + 1503 + ], + "mask": "Test" + }, + { + "node_id": 396, + "label": 9, + "text": "Visual_programming_language:visual programming language computing visual programming language vpl programming language lets users create programs manipulating program elements graphically rather specifying textually vpl allows programming visual expressions spatial arrangements text graphic symbols used either elements syntax secondary notation example many vpls known dataflow diagrammatic programming based idea boxes arrows boxes screen objects treated entities connected arrows lines arcs represent relations vpls may classified according type extent visual expression used icon-based languages form-based languages diagram languages visual programming environments provide graphical iconic elements manipulated users interactive way according specific spatial grammar program construction general goal vpls make programming accessible novices support programmers three different levels visually transformed language non-visual language superimposed visual representation naturally visual languages inherent visual expression obvious textual equivalent current developments try integrate visual programming approach dataflow programming languages either immediate access program state resulting online debugging automatic program generation documentation dataflow languages also allow automatic parallelization likely become one greatest programming challenges future visual basic visual c visual j etc languages microsoft visual studio ide visual programming languages representation algorithms etc textual even though ide embellishes editing debugging activities rich user interface similar consideration applies rapid application development environments typically support form designer sometimes also graphical tools illustrate define control flow data dependencies parsers visual programming languages implemented using graph grammars following contains list notable visual programming languages many modern video games make use behavior trees principle family simple programming languages designed model behaviors non-player characters behaviors modeled trees often edited graphical editors article originally based material free on-line dictionary computing used update needed", + "neighbors": [ + 29, + 78, + 99, + 246, + 378, + 592, + 756, + 796, + 919, + 927, + 934, + 961, + 1044, + 1319, + 1320, + 1324, + 1389, + 1532 + ], + "mask": "Test" + }, + { + "node_id": 397, + "label": 4, + "text": "Mondo_Rescue:mondo rescue mondo rescue free disaster recovery software supports linux i386 x86-64 ia-64 freebsd i386 packaged multiple distributions red hat rhel fedora centos opensuse sles mandriva debian ubuntu gentoo also supports tapes disks usb devices network cd/dvd backup media multiple filesystems lvm software hardware raid restoration may done physical media including obdr tape support cd/dvd/usb media network pxe mentioned free software directory emphasis stability ease use according ohloh mondorescue development worth 6m mondo uses linux distribution called mindi provide favorable post boot environment performing data restore unlike disk clone solutions ready use live cd provided mondo rescue instead included mindi package create custom turn-key live cd/dvds using exact linux kernel configuration system backed effect bootable dvd/cd customized computer backed objective reduce possibility missing device drivers kernel incompatibilities may arise using generic vanilla linux kernel pre-built live dvd/cd", + "neighbors": [ + 134, + 272, + 306, + 889, + 921, + 1002, + 1138, + 1457 + ], + "mask": "Test" + }, + { + "node_id": 398, + "label": 2, + "text": "Samsung_Wave_II_S8530:samsung wave ii s8530 samsung wave ii s8530 samsung wave ii successor samsung wave s8500 smartphone running bada 1.2 operating system designed samsung commercially released october 2010 wave slim touchscreen phone powered samsung hummingbird cpu s5pc110 includes 1 ghz arm cortex-8 cpu powerful built-in powervr sgx 540 graphics engine super lcd screen 720p high-definition video capture capabilities shortage super amoled screens one primary reasons release model design phone made mostly metal alloy measured 10.9 mm thick terms form factor slate style featuring 3 physical buttons front call reject/ shutdown main menu button screen screen capacitive touchscreen super lcd anti-smudge oleophobic coating top scratch-resistant tempered-glass gorilla glass display touch panel shown capable resisting extreme friction scratch-resistant screen resolution 800x480 wvga processor phone features 1 ghz soc internally contains arm cortex a8 cpu core identical arm cortex cpu core used apple a4 package package soc phone graphics engine sgx 540 said capable generating 90 million triangles per second soc used samsung galaxy 256mb+128mb ram hardware samsung wave s8500 camera phone features 5 megapixel supports 2592 x 1944 pixels along autofocus led flash geo-tagging face blink detection image stabilization touch focus etc features various shooting modes beauty shot smile shot continuous panorama vintage shot camcorder able shoot 720p hd recording 1280x720 30 fps flash well also able record slow motion video 320x240 120 fps flash features feature includes a-gps 2 gb/8 gb internal storage microsdhc slot additional 32 gb also magnetometer proximity sensor accelerometer 5.1-channel surround sound mobile theater music recognition fake call service smart search social hub first phone support bluetooth version 3.0 addition bluetooth 3.0 phone also features wi-fi 802.11 b/g/n hsdpa 3.2 mbit/s hsupa 2 mbit/s phone available european/asia 3g bandings north american 3g bandings keep mind north american 3g bandings version phone limited availability available us user interface phone one smartphone feature samsung bada operating system platform ui samsung touchwiz 3.0 touchwiz 3.0 like 2 predecessors touchwiz 2.0 touchwiz utilises widgets 3 notable widgets pre-installed touchwiz 3.0 daily briefing includes essential information weather finance ap mobile news schedule feeds updates buddies allows users call send texts read facebook/twitter feeds favourite contacts users allowed 10 homescreens add widgets applications terms internet browser samsung wave pre-installed dolphin browser v2.0 based webkit browser supports flash disabled default improve page load time default phone comes picsel viewer capable reading .pdf microsoft office file formats users selected countries buy download picsel office editor samsung apps samsung apps users also download applications games widgets application store software includes gps software comes phone lbs route 66 palringo im facebook twitter social hub mini diary daily briefing memo video player fm radio media browser voice recorder e-mail pre-installed asphalt5 media support mp3 aac aac+ e-aac+ wma amr wav mp4 flac mpeg4 h.263 h.264 wmv avi divx xvid mkv android porting due many owners phone disliking bada software many people worked porting popular android o.s wave 2 ported versions known froyo gingerbread ice cream sandwich jelly bean kitkat however still developed features gps may limited function intended samsung site reviews support forums", + "neighbors": [ + 24, + 162, + 270, + 337, + 1138 + ], + "mask": "Validation" + }, + { + "node_id": 399, + "label": 7, + "text": "Oracle_Grid_Engine:oracle grid engine oracle grid engine previously known sun grid engine sge codine computing distributed networked environments grd global resource director grid computing computer cluster software system otherwise known batch-queuing system acquired part purchase gridware improved supported sun microsystems later oracle open source versions multiple commercial versions technology initially sun later oracle univa corporation october 22 2013 univa announced acquired intellectual property trademarks grid engine technology univa take support.. univa since evolved grid engine technology e.g improving scalability demonstrated 1 million core cluster aws announced june 24 2018 original grid engine open-source project website closed 2010 versions technology still available original sun industry standards source license projects forked original project code known son grid engine open grid scheduler univa grid engine grid engine typically used computer farm high-performance computing hpc cluster responsible accepting scheduling dispatching managing remote distributed execution large numbers standalone parallel interactive user jobs also manages schedules allocation distributed resources processors memory disk space software licenses grid engine used foundation sun grid utility computing system made available internet united states 2006 later becoming available many countries early version public cloud computing facility predating amazon aws instance feature sets date last sun releases 2009 earlier current feature information found web sites open source forks univa grid engine features 6.2 features sge include grid engine runs multiple platforms including aix bsd freebsd netbsd openbsd hp-ux irix linux mac os x solaris super-ux tru64 windows via sfu interix sua microsoft windows services unix execution hosts z/os progress typical grid engine cluster consists master host one execution hosts multiple shadow masters also configured hot spares take role master original master host crashes univa providing commercial support training univa grid engine oracle grid engine description historic options sun provided support contracts commercial version grid engine unix platforms windows professional services consulting training support provided sun partners sun partners georgetown university deliver grid engine administration classes bioteam runs short sge training workshops 1 2 days long users obtained community support grid engine mailing lists grid engine workshops held 2002 2003 2007 2009 2012 regensburg germany contains historic information recent deployment information specifically regarding commercial users available univa notable deployments sge include 2000 sun acquired gridware privately owned commercial vendor advanced computing resource management software offices san jose calif. regensburg germany later year sun offered free version gridware solaris linux renamed product sun grid engine 2001 sun made source code available adopted open source development model ports mac os x *bsd contributed non-sun open source developers 2010 purchase sun oracle grid engine 6.2 update 6 source code included binaries changes put back project source repository response grid engine community started open grid scheduler project continue develop maintain free implementation grid engine january 18 2011 announced univa recruited several principal engineers former sun grid engine team univa would developing forked version grid engine newly announced univa grid engine include commercial support would compete official version oracle grid engine oct 22 2013 univa announced acquired intellectual property trademarks pertaining grid engine technology univa take support oracle grid engine customers contains historic information products solutions longer available number sge add-ons available", + "neighbors": [ + 134, + 195, + 210, + 227, + 272, + 274, + 390, + 507, + 611, + 770, + 796, + 847, + 961, + 968, + 1006, + 1019, + 1131, + 1138, + 1168, + 1227, + 1288, + 1322, + 1354, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 400, + "label": 2, + "text": "Tomoyo_Linux:tomoyo linux tomoyo linux stylised tomoyo linux linux kernel security module implements mandatory access control mac tomoyo linux mac implementation linux used increase security system also useful purely systems analysis tool launched march 2003 sponsored ntt data corporation march 2012 tomoyo linux focuses system behaviour tomoyo linux allows process declare behaviours resources needed achieve purpose protection enabled tomoyo linux restricts process behaviours resources allowed administrator main features tomoyo linux include tomoyo merged linux kernel mainline version 2.6.30 2009 june 10 currently one four standard linux security modules lsm along selinux apparmor smack tomoyo linux project started patch linux kernel provide mac porting tomoyo linux mainline linux kernel required introduction hooks lsm designed developed specifically support selinux label-based approach however hooks needed integrate remaining mac functionality tomoyo linux consequently project following two parallel development lines", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 294, + 305, + 327, + 346, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 401, + "label": 2, + "text": "LIO_(SCSI_target):lio scsi target computing linux-io lio target open-source implementation scsi target become standard one included linux kernel internally lio initiate sessions instead provides one logical unit numbers luns waits scsi commands scsi initiator performs required input/output data transfers lio supports common storage fabrics including fcoe fibre channel ieee 1394 iscsi iscsi extensions rdma iser scsi rdma protocol srp usb included linux distributions native support lio qemu/kvm libvirt openstack makes lio also storage option cloud deployments lio maintained datera inc. silicon valley vendor storage systems software january 15 2011 lio scsi target engine merged linux kernel mainline kernel version 2.6.38 released march 14 2011 additional fabric modules merged subsequent linux releases competing generic scsi target module linux scst narrower purpose providing linux iscsi target older iet iscsi enterprise target stgt scsi target framework modules also enjoy industry support scsi standard provides extensible semantic abstraction computer data storage devices become lingua franca data storage systems scsi t10 standards define commands protocols scsi command processor sent scsi cdbs electrical optical interfaces various implementations scsi initiator endpoint initiates scsi session scsi target endpoint waits initiator commands executes required i/o data transfers scsi target usually exports one luns initiators operate lio linux scsi target implements generic scsi target provides remote access data storage device types prevalent storage fabrics protocols lio neither directly accesses data directly communicate applications lio provides highly efficient fabric-independent fabric-transparent abstraction semantics numerous data storage device types lio implements modular extensible architecture around versatile highly efficient parallelized scsi command processing engine scsi target engine implements semantics scsi target lio scsi target engine independent specific fabric modules backstore types thus lio supports mixing matching number fabrics backstores time lio scsi target engine implements comprehensive spc-3/spc-4 feature set support high-end features including scsi-3/scsi-4 persistent reservations prs scsi-4 asymmetric logical unit assignment alua vmware vsphere apis array integration vaai t10 dif etc lio configurable via configfs-based kernel api managed via command-line interface api targetcli concept scsi target n't narrowly restricted physical devices scsi bus instead provides generalized model receivers logical scsi fabric includes scsi sessions across interconnects physical scsi bus conceptually scsi target provides generic block storage service server scenario backstores provide scsi target generalized access data storage devices importing via corresponding device drivers backstores n't need physical scsi devices important backstore media types result lio provides generalized model export block storage fabric modules implement frontend scsi target encapsulating abstracting properties various supported interconnect following fabric modules available fibre channel ethernet fcoe fabric module allows transport fibre channel protocol fcp traffic across lossless ethernet networks specification supported large number network storage vendors part technical committee t11 fc-bb-5 standard lio supports standard ethernet nics fcoe fabric module contributed cisco intel released linux 3.0 july 21 2011 fibre channel high-speed network technology primarily used storage networking standardized technical committee t11 international committee information technology standards incits qlogic fibre channel fabric module supports 4- 8-gigabit speeds following hbas fibre channel fabric module low-level driver lld released linux 3.5 july 21 2012 linux 3.9 following qlogic hbas cnas also supported makes lio first open source target support 16-gigabit fibre channel firewire sbp-2 fabric module enables linux export local storage devices via ieee 1394 systems mount ordinary ieee 1394 storage device ieee 1394 serial bus interface standard high-speed communications isochronous real-time data transfer developed apple firewire late 1980s early 1990s macintosh computers supported firewire target disk mode since 1999 firewire sbp-2 fabric module released linux 3.5 july 21 2012 internet small computer system interface iscsi fabric module allows transport scsi traffic across standard ip networks carrying scsi sessions across ip networks iscsi used facilitate data transfers intranets manage storage long distances iscsi used transmit data local area networks lans wide area networks wans internet enable location-independent location-transparent data storage retrieval lio iscsi fabric module also implements number advanced iscsi features increase performance resiliency multiple connections per session mc/s error recovery levels 0-2 erl=0,1,2 lio supports standard ethernet nics iscsi fabric module released linux 3.1 october 24 2011 networks supporting remote direct memory access rdma use iscsi extensions rdma iser fabric module transport iscsi traffic iser permits data transferred directly remote scsi computer memory buffers without intermediate data copies direct data placement ddp using rdma rdma supported infiniband networks ethernet data center bridging dcb networks via rdma converged ethernet roce standard ethernet networks iwarp enhanced tcp offload engine controllers iser fabric module developed together datera mellanox technologies first released linux 3.10 june 30 2013 scsi rdma protocol srp fabric module allows transport scsi traffic across rdma see networks 2013 srp widely used iser although limited scsi peer-to-peer protocol whereas iscsi fully routable srp fabric module supports following mellanox host channel adapters hcas srp fabric module released linux 3.3 march 18 2012 2012 c't magazine measured almost 5000 mb/s throughput lio srp target one mellanox connectx-3 port 56 gbit/s fdr mode sandy bridge pci express 3.0 system four fusion-io iodrive pci express flash memory cards usb gadget fabric module enables linux export local storage devices via universal serial bus usb systems mount ordinary storage device usb designed mid-1990s standardize connection computer peripherals also become common data storage devices usb gadget fabric module released linux 3.5 july 21 2012 targetcli user space single-node management command line interface cli lio supports fabric modules based modular extensible architecture plug-in modules additional fabric modules functionality targetcli provides cli uses underlying generic target library well-defined api thus cli easily replaced complemented ui metaphors gui targetcli implemented python consists three main modules detailed instructions set lio targets found lio wiki targetcli lio included linux distributions per default overview popular ones together initial inclusion dates", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 272, + 294, + 305, + 327, + 346, + 349, + 400, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1197, + 1202, + 1208, + 1225, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 402, + "label": 4, + "text": "Enterprise_Privacy_Authorization_Language:enterprise privacy authorization language enterprise privacy authorization language epal formal language writing enterprise privacy policies govern data handling practices systems according fine-grained positive negative authorization rights submitted ibm world wide web consortium w3c 2003 considered recommendation 2004 lawsuit filed zero-knowledge systems claiming ibm breached copyright agreement worked together 2001 2002 create privacy rights markup language prml epal based prml means zero-knowledge argued co-owner standard", + "neighbors": [ + 16, + 302, + 415 + ], + "mask": "Test" + }, + { + "node_id": 403, + "label": 2, + "text": "IPod_Touch_(7th_generation):ipod touch 7th generation seventh-generation ipod touch stylized marketed ipod touch colloquially known ipod touch 7g ipod touch 7 ipod touch 2019 multipurpose handheld device designed marketed apple inc. touchscreen-based user interface successor ipod touch 6th generation becoming first major update ipod touch since 2015 released online apple store may 28 2019 seventh-generation ipod touch features ios apple mobile operating system user interface ios based concept direct manipulation using multi-touch gestures interface control elements consist sliders switches buttons interaction os includes gestures swipe tap pinch reverse pinch specific definitions within context ios operating system multi-touch interface internal accelerometers used applications respond shaking device one common result undo command rotating vertically one common result switching portrait landscape mode seventh-generation ipod touch introduced may 28 2019 running latest ios version 12.3.1 play music movies television shows audiobooks podcasts sort media library songs artists albums videos playlists genres composers podcasts audiobooks compilations scrolling achieved swiping finger across screen alternatively headset controls used pause play skip repeat tracks however earpods come seventh-generation ipod touch include remote microphone voice control feature also used identify track play songs playlist specific artist create genius playlist apple a10 system-on-chip seventh-generation ipod touch enables advanced features predecessors includes arkit applications group facetime functionality seventh-generation ipod touch features apple a10 processor m10 motion coprocessor processor used apple iphone 7 apple ipad 2018 however underclocked 1.64 ghz 2.34 ghz uses two four cores making ipod touch weaker devices chip seventh-generation ipod touch features front rear camera systems sixth-generation device includes 8mp rear facing camera capable recording video 1080p resolution 30fps slow-motion video 720p 120fps camera also supports different photo features burst photos hdr photos panoramic photos front facing camera facetime hd camera capable taking photos 1.2mp recording video 720p 30fps camera also features auto hdr video recordings burst photo capabilities device first ipod touch come 256 gb storage option\u2014 highest capacity ever offered ipod surpassing 160gb capacity sixth-generation ipod classic discontinued 2014 seventh-generation ipod touch ships apple earpods apple lightning usb charging cable device also supports apple airpods earpods lightning connector", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 214, + 228, + 252, + 269, + 270, + 337, + 345, + 356, + 394, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1237, + 1262, + 1292, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 404, + "label": 2, + "text": "4MLinux:4mlinux 4mlinux lightweight distribution made 32bit 64bit architectures named 4mlinux since 4 main components os maintenance used rescue live cd multimedia inbuilt support almost every multimedia format miniserver comes 64-bit server included running lamp suite mystery includes collection classic linux games distribution developed poland first released 2010 distribution include package manager uses jwm joe window manager default window manager also comes conky preinstalled installing programs distribution distribution retrieve windows version rather linux version due coming pre-installed wine compatibility layer windows applications package manager distribution geared towards people prefer lightweight distribution version distribution called 4mlinux game edition provides 90s games natively doom hexen distribution comes two different version 4mserver 4mlinux 4mlinux requires 128 mb ram installed hdd 1024 mb ram used live cd/usb whereas 4mserver requires 256 mb ram installed hdd 2048 mb ram used live cd/usb", + "neighbors": [ + 113, + 134, + 301, + 351, + 357, + 393, + 431, + 695, + 716, + 754, + 897, + 974, + 1046, + 1055, + 1126, + 1167, + 1276, + 1286, + 1369, + 1458, + 1539, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 405, + "label": 4, + "text": "Nmap:nmap nmap network mapper free open-source network scanner created gordon lyon also known pseudonym fyodor vaskovich nmap used discover hosts services computer network sending packets analyzing responses nmap provides number features probing computer networks including host discovery service operating system detection features extensible scripts provide advanced service detection vulnerability detection features nmap adapt network conditions including latency congestion scan nmap started linux utility ported systems including windows macos bsd linux popular platform followed windows nmap features include nmap provide information targets including reverse dns names device types mac addresses typical uses nmap nmapfe originally written zach smith nmap official gui nmap versions 2.2 4.22 nmap 4.50 originally 4.22soc development series nmapfe replaced zenmap new official graphical user interface based umit developed adriano monteiro marques various web-based interfaces allow controlling nmap analysing nmap results web browser include nmap-cgi ivre microsoft windows specific guis exist including nmapwin updated since june 2003 v1.4.0 nmapw syhunt nmap provides four possible output formats interactive output saved file nmap output manipulated text processing software enabling user create customized reports nmap first published september 1997 article phrack magazine source-code included help contributions computer security community development continued enhancements included operating system fingerprinting service fingerprinting code rewrites c c++ additional scan types protocol support e.g ipv6 sctp new programs complement nmap core features major releases include nmap tool used discover services running internet connected systems like tool could potentially used black hat hacking precursor attempts gain unauthorized access computer systems however nmap also used security systems administration assess networks vulnerabilities i.e white hat hacking system administrators use nmap search unauthorized servers computers conform security standards jurisdictions unauthorized port scanning illegal nmap originally distributed gnu public license gpl later releases nmap authors added clarifications specific interpretations license felt gpl unclear lacking instance nmap 3.50 specifically revoked license sco group distribute nmap software views sco-linux controversies matrix reloaded trinity seen using nmap access power plant computer system allowing neo physically break building appearance nmap film widely discussed internet forums hailed unusually realistic example hacking nmap nmapfe used listening 2006 movie former nsa officer defects mounts clandestine counter-listening station high italian alps nmap source code seen movie battle royale well brief views command line version nmap executing live free die hard bourne ultimatum 2013 nmap continued make appearances movies including popular sci-fi movie elysium film dredd film adaptation famous judge dredd comics released 2012 also contains multiple nmap scenes nmap used network reconnaissance exploitation slum tower network even seen briefly movie trailer command nmap widely used video game hacknet allowing probe network ports target system hack snowden nmap used aptitude test scene 14 minutes movie nmap integral part academic activities used research involving tcp/ip protocol suite networking general well research tool nmap become research topic", + "neighbors": [ + 134, + 138, + 149, + 306, + 364, + 425, + 631, + 682, + 703, + 711, + 757, + 796, + 961, + 993, + 1015, + 1042, + 1138, + 1225, + 1243, + 1279, + 1374, + 1416, + 1552, + 1607 + ], + "mask": "Test" + }, + { + "node_id": 406, + "label": 3, + "text": "Road_Blaster:road blaster laserdisc-based arcade games time gameplay consists on-screen instructions overlaid pre-recorded full motion video animated footage high-speed chases vehicular combat player controls cross-hair steer car toward correct directions according green arrows flashing beeping beside controlling gas pedal brake booster whenever light game nine stages upon successfully completing level player graded reaction time different difficulty levels selected normal mode pop-up icons audio tones signal turn left right brake hit turbo hit cars hard mode on-screen icons guide player story road blaster inspired revenge thriller films mad max takes place post-apocalyptic wasteland late 1990s united states future time game release player assumes role vigilante drives customized sports car order get revenge biker gang responsible wife death honeymoon recovering injuries upgrades car goes rampage nine areas goal seek gang female boss complete vengeance road blaster uses animation provided anime studio toei animation animated guidance yoshinobu inano also directed key-animated films animated using 15,000 hand-painted cels produce 30 minutes animation game director yoshihisa kishimoto previously worked cobra command later directed arcade version double dragon car road blaster seen inside lee brothers garage start game road blaster originally released 1985 laserdisc-based arcade game various ports released throughout including versions msx x1 mega cd/sega cd laseractive mega ld format sega saturn playstation 3do interactive multiplayer prototyped turbo blaster however sega cd mega ld versions released outside japan titles road avenger road prosecutor respectively titles possibly changed avoid confusion similarly titled arcade game roadblasters atari games ported mega drive around time road blaster also released sharp x68000 windows 2011 exclusively japan cobra command road blaster ported ios revolutionary concepts 2010 2011 respectively variations included one-shot reproductions vhs cassette players takara video challenger limited interactive port road blaster arcade game sega saturn playstation ports compilations road blaster another laserdisc arcade game developed team titled thunder storm known outside japan cobra command unofficial super nes port also released 2011 however game relies heavily msu1 media enhancement chip somewhat new chip allows 4gb additional storage space full motion video playback stereo pcm audio early 2018 another unofficial port released commodore amiga ocs aga versions released based mega cd version dragon reviewers gave sega cd version game 4 5 stars 1993 gamefan noted greater interaction compared time gal thunderstorm praised non-stop control vehicle graphics smooth animation andrenaline rush experience gamepro praised highly detailed animation stereo cd sound called masterpiece like participating intense action-packed animated movie release famitsu gave mega cd version score 32 40 mega rated 86 famitsu later scored sega saturn version 25 40 playstation version 23 40 ios port released generally favourable reviews including scores 8 10 ign 7 10 pocket gamer novelization game announced 2009 project officially authorized g-mode japan rights holder data east catalog written mary margaret park", + "neighbors": [ + 287 + ], + "mask": "Test" + }, + { + "node_id": 407, + "label": 3, + "text": "Rock_n'_Bolt:rock n bolt rock n bolt puzzle video game developed action graphics published 1984 activision colecovision commodore 64 msx sg-1000 objective game lock platforms place according supplied map three levels difficulty second third level time limits", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 408, + "label": 2, + "text": "GeeksPhone_Revolution:geeksphone revolution geeksphone revolution smartphone released geeksphone january 2014 uses x86 architecture pci bus instead arm architecture capable running either android firefox os lacks dual boot facility", + "neighbors": [ + 162, + 270, + 337, + 1051 + ], + "mask": "Validation" + }, + { + "node_id": 409, + "label": 3, + "text": "Spatial_Archive_and_Interchange_Format:spatial archive interchange format spatial archive interchange format saif pronounced safe defined early 1990s self-describing extensible format designed support interoperability storage geospatial data saif dataset saif two major components together define saiftalk first class syntax notation csn data definition language used define dataset schema second object syntax notation osn data language used represent object data adhering schema csn osn contained physical file along directory beginning file use ascii text straightforward syntax csn osn ensure parsed easily understood directly users developers saif dataset .saf .zip extension compressed using zip archive format schema definition saif defines 285 classes including enumerations class syntax notation covering definitions high-level features geometric types topological relationships temporal coordinates relationships geodetic coordinate system components metadata considered forming base schema using csn user defines new schema describe features given dataset classes belonging new schema defined csn subclasses existing saif classes new enumerations foreststand :myschema example could defined attributes including age species etc foreststand :myschema specified subclass geographicobject feature defined saif standard user defined classes must belong schema one defined user previously existing different schemas exist dataset objects defined one schema reference specified another inheritance saif supports multiple inheritance although common usage involved single inheritance object referencing object referencing used means breaking large monolithic structures significantly allow objects defined referenced number times section geometry land-water interface could define part coastline well part municipal boundary part marine park boundary geometric feature defined given object reference used geometry coastline municipality marine park specified multimedia multimedia objects also objects saif dataset referenced accordingly example image sound files associated given location could included primary advantage saif inherently extensible following object oriented principles meant data transfers one gis environment another need follow lowest common denominator two systems instead data could extracted dataset defined first gis transformed intermediary i.e. semantically rich saif model transformed model format applicable second gis notion model model transformation deemed realistic object oriented approach recognized scripts carry transformations could fact add information content safe software developed feature manipulation engine fme large measure express purpose supporting transformations fmebc freely available software application supported wide range transformations using saif hub fme developed commercial offering intermediary could held memory instead saif dataset saif project established means addressing interoperability different geographic information systems exchange formats particular prominence time included digest digital geographic information exchange standard sdts spatial data transfer specification later accepted spatial data transfer standard considered inflexible difficult use consequently government british columbia decided develop saif put forward national standard canada saif became canadian national standard 1993 approval canadian general standards board last version saif published january 1995 designated cgis-saif canadian geomatics interchange standard spatial archive interchange format formal definition release 3.2 issue can/cgsb-171.1-95 catalogue number p29-171-001-1995e work saif modeling paradigm csn classes carried principally mark sondheim henry kucera peter friesen british columbia government time dale lutz murray safe software developed object syntax notation reader writer software became part feature manipulation engine saif brought attention michael stonebraker kenn gardels university california berkeley working initial version open geospatial interoperability specification ogis first efforts became open geospatial consortium ogc series 18 submissions iso sql multimedia working group also helped tie saif original iso work geospatial features today saif historical interest significant precursor geography markup language formative element development widely used feature manipulation engine sondheim m. k. gardels k. buehler 1999 gis interoperability pp 347\u2013358 geographical information systems second edition volume 1 edited paul a. longley michael f. goodchild david j. magurie davide w. rhind sondheim m. p. friesen d. lutz d. murray 1997 spatial archive interchange format saif spatial database transfer standards 2 characteristics assessing standards full descriptions national international standards world edited moellering h. hogan r. elsevier netherlands surveys resource mapping branch spatial archive interchange format release 3.2 formal definition 1995 also release 3.1 1994 3.0 1993 2.0 1992 1.0 1991 0.1 1990 surveys resource mapping branch british columbia ministry environment lands parks 258p also published canadian general standards board can/cgsb-171.1-95 available request geobc service desk http //www.ilmb.gov.bc.ca/geobc/servicedesk.html", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 410, + "label": 3, + "text": "Miracle_Warriors:_Seal_of_the_Dark_Lord:miracle warriors seal dark lord miracle warriors seal dark lord known japan role-playing video game released initially japanese pc-88 ported various systems including sega master system version released north america screen game consists four parts lower left character statistics lists characters party character life bar experience bar single character gain experience hitting enemies experiences full new level reached experience bar emptied bars extended resulting maximum life character experience needed gain new level lower right statistics entire party example amount money upper right section varies screen screen traveling world town maze map shown player navigate player invokes main menu shown battle shows battle menu upper left section also varies traveling world cave shows party members surroundings battle shows foe town shows persons player talk dialogue player encounters enemy screen switches battle mode battle mode player choose one character attack per turn character also subjected attack enemy unless enemy uses spell attacks multiple players enemies use flame spells attack party members sleep spells put multiple party members sleep every time party member put sleep take damage wake put sleep many times battle taking damage time fall asleep every party member sleeping enemy use flame spell attack every party member alternative attack player several options including talking retreating using magical item casting spell enemies respond talking give hints currency game guilder used buy items heal players defeated enemies also yield fangs proof valor battle fangs used buy exclusive items traded villages guilders defeating enemies also increase decrease player character points fame killing monsters usually increases player fame killing good characters example merchants decreases player fame certain amount character points required enter certain villages game takes place world five lands spread three continent came elaborate grid-format map noting areas interest game four types land plain forest mountains desert enemies become dangerous different types land plains safest terrain cross continents separated oceans storming sea around last continent ship required sail oceans special ship needed cross storming sea helmed someone pirate blood veins throughout world several towns towns smiths repair weapons armor healers heal sell herbs shops sell weapons armor towns provide information one person every town buys fangs fifty guilders also villages serve special purposes selling ships special magical items several caves exist world house guardians protect mystical armors legend finally also various castles visited get weapons legends kings impressed enough demon queen terarin \u30c6\u30e9\u30ea\u30f3 returned stolen golden seal opened pandora passage letting loose dark creatures world young hero tasked king restore peace world must step footsteps ancestor iason fought seal demoness another dimension finish job bring end terarin evil hero must enlist aid three companions guy warrior medi amazon treo pirate called turo english manual find three keys terarin lair underground temple defeat also need find set ancient mystical weapons armor miracle warriors master system received mixed mostly positive reviews including rated 40 games machine 77 sega power 80 tilt game followed sequel titled wings arugisu \u30a2\u30eb\u30ae\u30fc\u30b9\u306e\u7ffc released msx2 kogado 1988", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 411, + "label": 4, + "text": "MacScan:macscan macscan anti-malware utility apple mac os x developed securemac aimed removing malware including spyware trojan horses keystroke loggers tracking cookies first anti-spyware program released mac os x addition application scans remote administration programs like apple remote desktop allowing users verify programs installed authorization unlike anti-malware applications available mac os x systems macscan scans exclusively malware affects macs opposed scanning forms known threats would include windows malware given considerably less mac-based malware windows-based malware macscan definition files smaller optimized full version macscan available shareware 30-day trial available free developer website download macscan started discussion securemac.com forums developed response specific user concerns malware securemac developed keep mac platform secure scanning viruses malware addition selling flagship product securemac releases special-purpose removal utilities public free charge threat might compromise broader platform releases included utilities remove particular threat designed remove free", + "neighbors": [ + 1138 + ], + "mask": "Validation" + }, + { + "node_id": 412, + "label": 2, + "text": "Library_(computing):library computing computer science library collection non-volatile resources used computer programs often software development may include configuration data documentation help data message templates pre-written code subroutines classes values type specifications ibm os/360 successors referred partitioned data sets library also collection implementations behavior written terms language well-defined interface behavior invoked instance people want write higher level program use library make system calls instead implementing system calls addition behavior provided reuse multiple independent programs program invokes library-provided behavior via mechanism language example simple imperative language c behavior library invoked using c normal function-call distinguishes call library function versus another function program way code organized system library code organized way used multiple programs connection code part program organized used within one program distinction gain hierarchical notion program grows large multi-million-line program case may internal libraries reused independent sub-portions large program distinguishing feature library organized purposes reused independent programs sub-programs user needs know interface internal details library value library lies reuse behavior program invokes library gains behavior implemented inside library without implement behavior libraries encourage sharing code modular fashion ease distribution code behavior implemented library connected invoking program different program lifecycle phases code library accessed build invoking program library called static library alternative build executable invoking program distribute independently library implementation library behavior connected executable invoked executed either part process starting execution middle execution case library called dynamic library loaded run time dynamic library loaded linked preparing program execution linker alternatively middle execution application may explicitly request module loaded compiled languages standard library although programmers also create custom libraries modern software systems provide libraries implement majority system services libraries commoditized services modern application requires code used modern applications provided system libraries earliest programming concepts analogous libraries intended separate data definitions program implementation jovial brought compool communication pool concept popular attention 1959 although adopted idea large-system sage software following computer science principles separation concerns information hiding comm pool purpose permit sharing system data among many programs providing centralized data description cobol also included primitive capabilities library system 1959 jean sammet described inadequate library facilities retrospect another major contributor modern library concept came form subprogram innovation fortran fortran subprograms compiled independently compiler lacked linker prior introduction modules fortran-90 type checking fortran subprograms impossible finally historians concept remember influential simula 67 simula first object-oriented programming language classes nearly identical modern concept used java c++ c class concept simula also progenitor package ada module modula-2 even developed originally 1965 simula classes could included library files added compile time libraries important program linking binding process resolves references known links symbols library modules linking process usually automatically done linker binder program searches set libraries modules given order usually considered error link target found multiple times given set libraries linking may done executable file created whenever program used run time references resolved may addresses jumps routine calls may main program one module depending upon another resolved fixed relocatable addresses common base allocating runtime memory memory segments module referenced programming languages may use feature called smart linking whereby linker aware integrated compiler linker knows external references used code library never actually used even though internally referenced discarded compiled application example program uses integers arithmetic arithmetic operations exclude floating-point library routines smart-linking feature lead smaller application file sizes reduced memory usage references program library module stored relative symbolic form resolved code libraries assigned final static addresses relocation process adjusting references done either linker loader general relocation done individual libraries addresses memory may vary depending program using libraries combined position-independent code avoids references absolute addresses therefore require relocation linking performed creation executable another object file known static linking early binding case linking usually done linker may also done compiler static library also known archive one intended statically linked originally static libraries existed static linking must performed modules recompiled modules required program sometimes statically linked copied executable file process resulting stand-alone file known static build program static build may need relocation virtual memory used address space layout randomization desired shared library shared object file intended shared executable files shared object files modules used program loaded individual shared objects memory load time run time rather copied linker creates single monolithic executable file program shared libraries statically linked meaning references library modules resolved modules allocated memory executable file created often linking shared libraries postponed loaded modern operating systems shared library files format executable files offers two main advantages first requires making one loader rather two single loader considered well worth added complexity secondly allows executables also used shared libraries symbol table typical combined executable shared library formats elf mach-o unix pe windows older environments 16-bit windows mpe hp 3000 stack-based data local allowed shared-library code significant restrictions placed shared-library code library code may shared memory multiple processes well disk virtual memory used processes would execute physical page ram mapped different address spaces processes advantages instance openstep system applications often hundred kilobytes size loaded quickly majority code located libraries already loaded purposes operating system programs accomplish ram sharing using position-independent code unix leads complex flexible architecture using common virtual addresses windows os/2 systems make sure various tricks like pre-mapping address space reserving slots shared library code great probability shared third alternative single-level store used ibm system/38 successors allows position-dependent code places significant restrictions code placed shared cases different versions shared libraries cause problems especially libraries different versions file name different applications installed system require specific version scenario known dll hell named windows os/2 dll file modern operating systems 2001 clean-up methods eliminate situations use application-specific private libraries dynamic linking late binding linking performed program loaded load time executed run time rather executable file created dynamically linked library dynamic-link library dll windows os/2 dynamic shared object dso unix-like systems library intended dynamic linking minimal amount work done linker executable file created records library routines program needs index names numbers routines library majority work linking done time application loaded load time execution run time usually necessary linking program called dynamic linker linking loader actually part underlying operating system however possible exceedingly difficult write program uses dynamic linking includes dynamic linker even operating system provides support dynamic linking programmers originally developed dynamic linking multics operating system starting 1964 mts michigan terminal system built late 1960s since shared libraries systems change often systems compute likely load address shared library system needed store information libraries executables every shared library loaded undergone process load predetermined address speeds process dynamic linking optimization known prebinding macos prelinking linux disadvantages technique include time required precompute addresses every time shared libraries change inability use address space layout randomization requirement sufficient virtual address space use problem alleviated adoption 64-bit architectures least time loaders shared libraries vary widely functionality depend executable storing explicit paths libraries change library naming layout file system cause systems fail commonly name library path stored executable operating system supplying method find library disk based algorithm shared library executable depends deleted moved renamed incompatible version library copied place earlier search executable would fail load called dependency hell existing many platforms infamous windows variant commonly known dll hell problem occur version library uniquely identified program references libraries full unique identifiers dll hell problems earlier windows versions arose using names libraries guaranteed unique resolve dynamic links programs avoid dll hell later versions windows rely largely options programs install private dlls\u2014essentially partial retreat use shared libraries\u2014along mechanisms prevent replacement shared system dlls earlier versions microsoft windows checks registry determine proper place load dlls implement com objects dlls check directories defined order first windows checks directory loaded program private dll directories set calling codice_1 function system32 system windows directories current working directory finally directories specified path environment variable applications written .net framework framework since 2002 also check global assembly cache primary store shared dll files remove issue dll hell openstep used flexible system collecting list libraries number known locations similar path concept system first starts moving libraries around causes problems although users incur time cost first starting system unix-like systems search path specifying file-system directories look dynamic libraries systems specify default path configuration file others hard-code dynamic loader executable file formats specify additional directories search libraries particular program usually overridden environment variable although disabled setuid setgid programs user ca n't force program run arbitrary code root permissions developers libraries encouraged place dynamic libraries places default search path downside make installation new libraries problematic known locations quickly become home increasing number library files making management complex dynamic loading subset dynamic linking involves dynamically linked library loading unloading run time request request may made implicitly compile time explicitly run time implicit requests made compile time linker adds library references include file paths simply file names explicit requests made applications make direct calls operating system api run time operating systems support dynamically linked libraries also support dynamically loading libraries via run-time linker api instance microsoft windows uses api functions loadlibrary loadlibraryex freelibrary getprocaddress microsoft dynamic link libraries posix-based systems including unix unix-like systems use dlopen dlclose dlsym development systems automate process although originally pioneered 1960s dynamic linking reach operating systems used consumers late 1980s generally available form operating systems early 1990s period object-oriented programming oop becoming significant part programming landscape oop runtime binding requires additional information traditional libraries n't supply addition names entry points code located within also require list objects depend side-effect one oop main advantages inheritance means parts complete definition method may different places simply listing one library requires services another true oop system libraries may known compile time vary system system time many developers worked idea multi-tier programs display running desktop computer would use services mainframe minicomputer data storage processing instance program gui-based computer would send messages minicomputer return small samples huge dataset display remote procedure calls rpc already handled tasks standard rpc system soon majority minicomputer mainframe vendors instigated projects combine two producing oop library format could used anywhere systems known object libraries distributed objects supported remote access microsoft com example system local use dcom modified version supports remote access time object libraries held status next big thing programming world number efforts create systems would run across platforms companies competed try get developers locked system examples include ibm system object model som/dsom sun microsystems distributed objects everywhere doe next portable distributed objects pdo digital objectbroker microsoft component object model com/dcom number corba-based systems inevitable cooling marketing hype object libraries continue used object-oriented programming distributed information systems class libraries rough oop equivalent older types code libraries contain classes describe characteristics define actions methods involve objects class libraries used create instances objects characteristics set specific values oop languages like java distinction clear classes often contained library files like java jar file format instantiated objects residing memory although potentially able made persistent separate files others like smalltalk class libraries merely starting point system image includes entire state environment classes instantiated objects another solution library issue comes using completely separate executables often lightweight form calling using remote procedure call rpc network another computer approach maximizes operating system re-use code needed support library code used provide application support security every program additionally systems require library exist machine forward requests network however approach means every library call requires considerable amount overhead rpc calls much expensive calling shared library already loaded machine approach commonly used distributed architecture makes heavy use remote calls notably client-server systems application servers enterprise javabeans code generation libraries high-level apis generate transform byte code java used aspect-oriented programming data access frameworks testing generate dynamic proxy objects also used intercept field access system stores codice_2 codice_3 files directories codice_4 codice_5 codice_6 filenames always start codice_7 end suffix codice_8 archive static library codice_9 shared object dynamically linked library systems might multiple names dynamically linked library names names symbolic links remaining name names might include major version library full version number example systems codice_10 would filename second major interface revision dynamically linked library codice_11 codice_12 files sometimes found library directories libtool archives usable system system inherits static library conventions bsd library stored codice_8 file use codice_9-style dynamically linked libraries codice_15 suffix instead libraries macos however consist frameworks placed inside special directories called bundles wrap library required files metadata example framework called codice_16 would implemented bundle called codice_17 codice_18 either dynamically linked library file symlink dynamically linked library file codice_19 dynamic-link libraries usually suffix codice_20 although file name extensions may identify specific-purpose dynamically linked libraries e.g codice_21 ole libraries interface revisions either encoded file names abstracted away using com-object interfaces depending compiled codice_22 files either static libraries representations dynamically linkable libraries needed compilation known import libraries unlike unix world uses different file extensions linking codice_23 file windows one must first know regular static library import library latter case codice_24 file must present run time", + "neighbors": [ + 28, + 34, + 65, + 78, + 81, + 117, + 123, + 134, + 142, + 175, + 207, + 227, + 234, + 268, + 282, + 292, + 306, + 313, + 323, + 330, + 332, + 333, + 337, + 346, + 378, + 379, + 429, + 435, + 447, + 472, + 521, + 536, + 551, + 565, + 567, + 592, + 605, + 632, + 665, + 682, + 689, + 704, + 716, + 723, + 740, + 779, + 782, + 786, + 815, + 834, + 940, + 961, + 1003, + 1040, + 1044, + 1057, + 1064, + 1068, + 1100, + 1110, + 1123, + 1132, + 1138, + 1149, + 1151, + 1159, + 1177, + 1180, + 1188, + 1189, + 1193, + 1214, + 1235, + 1245, + 1251, + 1280, + 1311, + 1324, + 1325, + 1351, + 1372, + 1390, + 1391, + 1398, + 1414, + 1415, + 1417, + 1428, + 1437, + 1466, + 1483, + 1502, + 1508, + 1528, + 1549, + 1583, + 1616, + 1620, + 1625, + 1629 + ], + "mask": "Validation" + }, + { + "node_id": 413, + "label": 2, + "text": "Booting:booting computing booting process starting computer initiated hardware button press software command switched computer central processing unit cpu software main memory process must load software memory executed may done hardware firmware cpu separate processor computer system restarting computer also called rebooting hard e.g electrical power cpu switched soft power cut systems soft boot may optionally clear ram zero hard soft booting initiated hardware button press software command booting complete operative runtime system typically operating system applications attained process returning computer state hibernation sleep involve booting minimally embedded systems require noticeable boot sequence begin functioning turned may simply run operational programs stored rom computing systems state machines reboot may method return designated zero-state unintended locked state addition loading operating system stand-alone utility boot process also load storage dump program diagnosing problems operating system boot short bootstrap bootstrap load derives phrase pull oneself one bootstraps usage calls attention requirement software loaded onto computer software already running computer mechanism must exist load initial software onto computer early computers used variety ad-hoc methods get small program memory solve problem invention read-only memory rom various types solved paradox allowing computers shipped start program could erased growth capacity rom allowed ever elaborate start procedures implemented many different methods available load short initial program computer methods reach simple physical input removable media hold complex programs early computers 1940s 1950s one-of-a-kind engineering efforts could take weeks program program loading one many problems solved early computer eniac program stored memory set problem configuration interconnecting cables bootstrapping apply eniac whose hardware configuration ready solving problems soon power applied edsac system second stored-program computer built used stepping switches transfer fixed program memory start button pressed program stored device david wheeler completed late 1948 loaded instructions punched tape executed first programmable computers commercial sale univac ibm 701 included features make operation simpler typically included instructions performed complete input output operation hardware logic could used load contents punch card typical ones input media magnetic drum magnetic tape contained bootstrap program pressing single button booting concept called variety names ibm computers 1950s early 1960s ibm used term initial program load ibm 7030 stretch later used mainframe lines starting system/360 1964 ibm 701 computer 1952\u20131956 load button initiated reading first 36-bit word main memory punched card card reader magnetic tape tape drive magnetic drum unit depending position load selector switch left 18-bit half-word executed instruction usually read additional words memory loaded boot program executed turn loaded larger program medium memory without help human operator term boot used sense since least 1958 ibm computers era similar features example ibm 1401 system c. 1958 used card reader load program punched card 80 characters stored punched card read memory locations 001 080 computer would branch memory location 001 read first stored instruction instruction always move information first 80 memory locations assembly area information punched cards 2 3 4 could combined form stored program information moved assembly area machine would branch instruction location 080 read card next card would read information processed another example ibm 650 1953 decimal machine group ten 10-position switches operator panel addressable memory word address 8000 could executed instruction thus setting switches 7004000400 pressing appropriate button would read first card card reader memory op code 70 starting address 400 jump 400 begin executing program card ibm competitors also offered single button program load noteworthy variation found burroughs b1700 neither bootstrap rom hardwired ipl operation instead system reset reads executes opcodes sequentially tape drive mounted front panel sets boot loader ram executed however since makes assumptions system equally well used load diagnostic maintenance test routine tapes display intelligible code front panel even cases gross cpu failure ibm system/360 successors including current z/architecture machines boot process known initial program load ipl ibm coined term 7030 stretch revived design system/360 continues use environments today system/360 processors ipl initiated computer operator selecting three hexadecimal digit device address cuu c=i/o channel address uu=control unit device address followed pressing load button high end system/360 models system/370 later systems functions switches load button simulated using selectable areas screen graphics console often ibm 2250-like device ibm 3270-like device example system/370 model 158 keyboard sequence 0-7-x zero seven x order results ipl device address keyed input area amdahl 470v/6 related cpus supported four hexadecimal digits cpus optional second channel unit installed total 32 channels later ibm would also support 16 channels ipl function system/360 successors compatibles amdahl reads 24 bytes operator-specified device main storage starting real address zero second third groups eight bytes treated channel command words ccws continue loading startup program first ccw always simulated cpu consists read ipl command command chaining suppress incorrect length indication enforced i/o channel commands complete first group eight bytes loaded processor program status word psw startup program begins execution location designated psw ipl device usually disk drive hence special significance read-type command exactly procedure also used ipl input-type devices tape drives even card readers device-independent manner allowing example installation operating system brand-new computer os initial distribution magnetic tape disk controllers command also causes selected device seek cylinder head simulating seek cylinder head command search record simulating search id equal command seeks searches simulated tape card controllers device classes command simply sequential read command read ipl command disk tape card deck must contain special program load actual operating system standalone utility main storage specific purpose ipl text placed disk stand-alone dasdi direct access storage device initialization program equivalent program running operating system e.g. ickdsf ipl-able tapes card decks usually distributed ipl text already present minicomputers starting digital equipment corporation dec pdp-5 pdp-8 1965 simplified design using cpu assist input output operations saved cost made booting complicated pressing single button minicomputers typically way toggle short programs manipulating array switches front panel since early minicomputers used magnetic core memory lose information power bootstrap loaders would remain place unless erased erasure sometimes happened accidentally program bug caused loop overwrote memory minicomputers simple form booting include hewlett-packard hp 2100 series mid-1960s original data general nova 1969 dec pdp-11 1970 dec later added optional diode matrix read-only memory pdp-11 stored bootstrap program 32 words 64 bytes consisted printed circuit card m792 plugged unibus held 32 16 array semiconductor diodes 512 diodes place memory contained one bits card programmed cutting diode whose bit zero dec also sold versions card bm792-yx series pre-programmed many standard input devices simply omitting unneeded diodes following older approach earlier pdp-1 hardware loader operator need push load switch instruct paper tape reader load program directly core memory data general supernova used front panel switches cause computer automatically load instructions memory device specified front panel data switches jump loaded code nova 800 1200 switch loaded program main memory special read-only memory jumped minicomputer paper tape reader first program run boot process boot loader would read core memory either second-stage boot loader often called binary loader could read paper tape checksum operating system outside storage medium pseudocode boot loader might simple following eight instructions related example based loader nicolet instrument corporation minicomputer 1970s using paper tape reader-punch unit teletype model 33 asr teleprinter bytes second-stage loader read paper tape reverse order length second stage loader final byte overwrites location 7 instruction location 6 executes location 7 starts second stage loader executing second stage loader waits much longer tape containing operating system placed tape reader difference boot loader second stage loader addition checking code trap paper tape read errors frequent occurrence relatively low-cost part-time-duty hardware teletype model 33 asr friden flexowriters far reliable also comparatively costly earliest microcomputers altair 8800 released first 1975 even earlier similar machine based intel 8008 cpu bootstrapping hardware started cpu would see memory would contain executable code containing binary zeros\u2014memory cleared resetting powering front panels machines carried toggle switches entering addresses data one switch per bit computer memory word address bus simple additions hardware permitted one memory location time loaded switches store bootstrap code meanwhile cpu kept attempting execute memory content correctly loaded cpu enabled execute bootstrapping code process tedious error-free boot process minicomputers microcomputers revolutionized introduction integrated circuit read-only memory rom many variants including mask-programmed roms programmable roms prom erasable programmable roms eprom flash memory allowed firmware boot programs included part computer introduction external rom italian telephone switching elaborator called gruppi speciali patented 1975 alberto ciaramella researcher cselt gruppi speciali starting 1975 fully single-button machine booting operating system rom memory composed semiconductors ferrite cores although rom device natively embedded computer gruppi speciali due design machine also allowed single-button rom booting machines designed therefore bootstrap device architecture-independent e.g pdp-11 storing state machine switch-off also place another critical feature telephone switching contest typically every microprocessor reset power-on condition perform start-up process usually takes form begin execution code found starting specific address look multibyte code specific address jump indicated location begin execution system built using microprocessor permanent rom occupying special locations system always begins operating without operator assistance example intel x86 processors always start running instructions beginning f000 fff0 mos 6502 processor initialization begins reading two-byte vector address fffd ms byte fffc ls byte jumping location run bootstrap code apple inc. first computer apple 1 introduced 1976 featured prom chips eliminated need front panel boot process case altair 8800 commercial computer according apple ad announcing switches lights ... firmware proms enables enter display debug programs hex keyboard due expense read-only memory time apple ii series booted disk operating systems using series small incremental steps passing control onward next phase gradually complex boot process see apple dos boot loader little disk operating system relied rom hardware also extremely flexible supported wide range customized disk copy protection mechanisms see software cracking history operating systems notably pre-1995 macintosh systems apple closely interwoven hardware impossible natively boot operating system standard one opposite extreme scenario using switches mentioned highly inflexible relatively error-proof foolproof long hardware working normally common solution situations design boot loader works program belonging standard os hijacks system loads alternative os technique used apple a/ux unix implementation copied various freeware operating systems beos personal edition 5 machines like atari st microcomputer instant-on operating system executing rom retrieval os secondary tertiary store thus eliminated one characteristic operations bootstrapping allow system customizations accessories support software loaded automatically atari floppy drive read additional components boot process timeout delay provided time manually insert floppy system searched extra components could avoided inserting blank disk atari st hardware also designed cartridge slot could provide native program execution gaming purposes holdover atari legacy making electronic games inserting spectre gcr cartridge macintosh system rom game slot turning atari could natively boot macintosh operating system rather atari tos ibm personal computer included rom-based firmware called bios one functions firmware perform power-on self test machine powered read software boot device execute firmware compatible bios ibm personal computer used ibm pc compatible computers extensible firmware interface developed intel originally itanium-based machines later also used alternative bios x86-based machines including apple macs using intel processors unix workstations originally vendor-specific rom-based firmware sun microsystems later developed openboot later known open firmware incorporated forth interpreter much firmware written forth standardized ieee ieee standard 1275-1994 firmware implements standard used powerpc-based macs powerpc-based machines well sun sparc-based computers advanced risc computing specification defined another firmware standard implemented mips-based alpha-based machines sgi visual workstation x86-based workstations computer turned softwareincluding operating systems application code dataremains stored non-volatile memory computer powered typically operating system loader random-access memory ram computer first executes relatively small program stored read-only memory rom along small amount needed data access nonvolatile device devices operating system programs data loaded ram small program starts sequence known bootstrap loader bootstrap boot loader small program job load data programs executed ram often multiple-stage boot loaders used several programs increasing complexity load one process chain loading computer systems upon receiving boot signal human operator peripheral device may load small number fixed instructions memory specific location initialize least one cpu point cpu instructions start execution instructions typically start input operation peripheral device may switch-selectable operator systems may send hardware commands directly peripheral devices i/o controllers cause extremely simple input operation read sector zero system device memory starting location 1000 carried effectively loading small number boot loader instructions memory completion signal i/o device may used start execution instructions cpu smaller computers often use less flexible automatic boot loader mechanisms ensure computer starts quickly predetermined software configuration many desktop computers example bootstrapping process begins cpu executing software contained rom example bios ibm pc predefined address cpus including intel x86 series designed execute software reset without outside help software contains rudimentary functionality search devices eligible participate booting load small program special section commonly boot sector promising device typically starting fixed entry point start sector boot loaders may face peculiar constraints especially size instance ibm pc compatibles boot sector typically work 32 kb later relaxed 64 kb system memory use instructions supported original 8088/8086 processors first stage pc boot loaders fsbl first-stage boot loader located fixed disks removable drives must fit first 446 bytes master boot record order leave room default 64-byte partition table four partition entries two-byte boot signature bios requires proper boot loader \u2014 even less additional features like four partition entries 16 16 bytes disk signature 6 bytes disk timestamp 6 bytes advanced active partition 18 bytes special multi-boot loaders supported well environments floppy superfloppy volume boot records 59 bytes occupied extended bios parameter block fat12 fat16 volumes since dos 4.0 whereas fat32 ebpb introduced dos 7.1 requires even 87 bytes leaving 423 bytes boot loader assuming sector size 512 bytes microsoft boot sectors therefore traditionally imposed certain restrictions boot process example boot file located fixed position root directory file system stored consecutive sectors conditions taken care codice_1 command slightly relaxed later versions dos boot loader able load first three sectors file memory happened contain another embedded boot loader able load remainder file memory microsoft added lba fat32 support even switched boot loader reaching two physical sectors using 386 instructions size reasons time vendors managed squeeze much functionality single boot sector without relaxing original constraints minimal available memory 32 kb processor support 8088/8086 example dr-dos boot sectors able locate boot file fat12 fat16 fat32 file system load memory whole via chs lba even file stored fixed location consecutive sectors examples first-stage bootloaders include coreboot libreboot das u-boot second-stage boot loaders gnu grub bootmgr syslinux ntldr bootx operating systems able load operating system properly transfer execution operating system subsequently initializes may load extra device drivers second-stage boot loader need drivers operation may instead use generic storage access methods provided system firmware bios open firmware though typically restricted hardware functionality lower performance many boot loaders like gnu grub windows bootmgr windows nt/2000/xp ntldr configured give user multiple booting choices choices include different operating systems dual multi-booting different partitions drives different versions operating system case new version unexpected problems different operating system loading options e.g. booting rescue safe mode standalone programs function without operating system memory testers e.g. memtest86+ basic shell gnu grub even games see list pc booter games boot loaders also load boot loaders example grub loads bootmgr instead loading windows directly usually default choice preselected time delay user press key change choice delay default choice automatically run normal booting occur without interaction boot process considered complete computer ready interact user operating system capable running system programs application programs many embedded systems must boot immediately example waiting minute digital television gps navigation device start generally unacceptable therefore devices software systems rom flash memory device begin functioning immediately little loading necessary loading precomputed stored rom device made large complex systems may boot procedures proceed multiple phases finally operating system programs loaded ready execute operating systems designed never start stop boot loader might load operating system configure mere process within system irrevocably transfer control operating system boot loader terminates normally process would computers also capable booting computer network scenario operating system stored disk server certain parts transferred client using simple protocol trivial file transfer protocol tftp parts transferred operating system takes control booting process second-stage boot loader network booting begins using generic network access methods provided network interface boot rom typically contains preboot execution environment pxe image drivers required system functionality limited operating system kernel drivers transferred started result rom-based booting completed entirely possible network boot operating system ability use network interface boot device device operating system loaded modern pc uefi bios firmware supports booting various devices typically local solid state drive hard disk drive via gpt master boot record mbr drive disk optical disc drive using el torito usb mass storage device ftl-based flash drive sd card multi-media card slot hard disk drive optical disc drive etc network interface card using pxe older less common bios-bootable devices include floppy disk drives scsi devices zip drives ls-120 drives typically firmware uefi bios allow user configure boot order boot order set first dvd drive second hard disk drive firmware try boot dvd drive fails e.g dvd drive try boot local hard disk drive example pc windows xp installed hard drive user could set boot order one given insert linux live cd order try linux without install operating system onto hard drive example dual booting user chooses operating system start computer performed power-on self-test post example dual booting user chooses inserting removing cd computer common choose operating system boot selecting bios uefi boot menu using computer keyboard boot menu typically entered pressing keys post several devices available enable user quick-boot usually variant linux various simple tasks internet access examples splashtop latitude upon starting ibm-compatible personal computer x86 cpu executes real mode instruction located reset vector physical memory address 16-bit x86 processors 32-bit 64-bit x86 processors usually pointing firmware uefi bios entry point inside rom memory location typically contains jump instruction transfers execution location firmware uefi bios start-up program program runs power-on self-test post check initialize required devices dram pci bus including running embedded roms complicated step setting dram spi made difficult fact point memory limited initializing required hardware firmware uefi bios goes pre-configured list non-volatile storage devices boot device sequence finds one bootable bootable mbr device defined one read last two bytes first sector contain little-endian word found byte sequence disk also known mbr boot signature otherwise established code inside sector executable x86 pcs bios found bootable device loads boot sector linear address usually segment offset bioses erroneously use transfers execution boot code case hard disk referred master boot record mbr definition operating-system specific conventional mbr code checks mbr partition table partition set bootable one active flag set active partition found mbr code loads boot sector code partition known volume boot record vbr executes vbr often operating-system specific however operating systems main function load execute operating system kernel continues startup active partition active partition boot sector invalid mbr may load secondary boot loader select partition often via user input load boot sector usually loads corresponding operating system kernel cases mbr may also attempt load secondary boot loaders trying boot active partition else fails issue int 18h bios interrupt call followed int 19h case int 18h would return order give back control bios would attempt boot devices attempt remote boot via network invoke rom basic systems particularly newer macintoshes new editions microsoft windows use intel efi also coreboot allows computer boot without firmware/bios constantly running system management mode 16-bit bios interfaces required certain x86 operating systems dos windows 3.1/95/98 booted via uefi however boot loaders retain 16-bit bios call support modern cpus microcontrollers example ti omap sometimes even dsps may boot rom boot code integrated directly silicon processor could perform quite sophisticated boot sequence load boot programs various sources like nand flash sd mmc card difficult hardwire required logic handling devices integrated boot rom used instead scenarios boot rom usage enables flexible boot sequences hardwired logic could provide example boot rom could try perform boot multiple boot sources also boot rom often able load boot loader diagnostic program via serial interfaces like uart spi usb feature often used system recovery purposes reasons usual boot software non-volatile memory got erased could also used initial non-volatile memory programming clean non-volatile memory installed hence software available system yet embedded system designs may also include intermediary boot sequence step form additional code gets loaded system ram integrated boot rom additional code loaded way usually serves way overcoming platform limitations small amounts ram dedicated primary boot loader das u-boot loaded next step system boot sequence additional code boot sequence step usually referred secondary program loader spl also possible take control system using hardware debug interface jtag interface may used write boot loader program bootable non-volatile memory e.g flash instructing processor core perform necessary actions program non-volatile memory alternatively debug interface may used upload diagnostic boot code ram start processor core instruct execute uploaded code allows example recovery embedded systems software remains supported boot device processor integrated boot rom jtag standard popular interface many cpus microcontrollers devices manufactured jtag interfaces 2009 microcontrollers provide special hardware interfaces used take arbitrary control system directly run code instead allow insertion boot code bootable non-volatile memory like flash memory via simple protocols manufacturing phase interfaces used inject boot code possibly code non-volatile memory system reset microcontroller begins execute code programmed non-volatile memory like usual processors using roms booting notably technique used atmel avr microcontrollers others well many cases interfaces implemented hardwired logic cases interfaces could created software running integrated on-chip boot rom gpio pins digital signal processors serial mode boot parallel mode boot host port interface hpi boot case dsps often second microprocessor microcontroller present system design responsible overall system behavior interrupt handling dealing external events user interface etc dsp dedicated signal processing tasks systems dsp could booted another processor sometimes referred host processor giving name host port processor also sometimes referred master since usually boots first memories controls overall system behavior including booting dsp controlling dsp behavior dsp often lacks boot memories relies host processor supply required code instead notable systems design cell phones modems audio video players dsp cpu/microcontroller co-existing many fpga chips load configuration external serial eeprom configuration rom power-up", + "neighbors": [ + 1, + 9, + 11, + 22, + 37, + 42, + 53, + 55, + 58, + 64, + 78, + 85, + 99, + 111, + 134, + 170, + 171, + 185, + 210, + 213, + 234, + 236, + 265, + 270, + 276, + 322, + 353, + 359, + 374, + 377, + 380, + 387, + 434, + 444, + 457, + 465, + 475, + 503, + 583, + 650, + 664, + 705, + 720, + 721, + 754, + 776, + 797, + 868, + 870, + 884, + 891, + 937, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1016, + 1022, + 1024, + 1040, + 1049, + 1053, + 1054, + 1055, + 1063, + 1090, + 1138, + 1157, + 1188, + 1202, + 1213, + 1224, + 1290, + 1301, + 1304, + 1328, + 1370, + 1379, + 1391, + 1394, + 1415, + 1441, + 1456, + 1530, + 1546, + 1553, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 414, + "label": 4, + "text": "Badlock:badlock badlock security bug disclosed april 12 2016 affecting security account manager sam local security authority domain policy lsad remote protocols supported windows samba servers sam lsad layered onto dce 1.1 remote procedure call dce/rpc protocol implemented samba windows rpc services allowed attacker become man middle although vulnerability discovered development samba namegiving smb protocol affected", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 692, + 708, + 750, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 415, + "label": 4, + "text": "Information_privacy:information privacy information privacy relationship collection dissemination data technology public expectation privacy legal political issues surrounding also known data privacy data protection challenge data privacy use data protecting individual privacy preferences personally identifiable information fields computer security data security information security design use software hardware human resources address issue various types personal information often come privacy concerns describes ability control information one reveals oneself cable television access information example third parties track ip tv programs someone watched given time addition information broadcasting stream required audience rating survey additional devices requested installed houses viewers listeners without necessity cooperations audience ratings automatically performed real-time united kingdom 2012 education secretary michael gove described national pupil database rich dataset whose value could maximised making openly accessible including private companies kelly fiveash register said could mean child school life including exam results attendance teacher assessments even characteristics could available third-party organizations responsible anonymizing publications rather data anonymized government handed example data request gove indicated rejected past might possible improved version privacy regulations analysis sexual exploitation information person financial transactions including amount assets positions held stocks funds outstanding debts purchases sensitive criminals gain access information person accounts credit card numbers person could become victim fraud identity theft information person purchases reveal great deal person history places he/she visited he/she contacted products he/she used his/her activities habits medications he/she used cases corporations may use information target individuals marketing customized towards individual personal preferences person may may approve ability control information one reveals oneself internet access information become growing concern concerns include whether email stored read third parties without consent whether third parties continue track websites someone visited another concern websites visited collect store possibly share personally identifiable information users advent various search engines use data mining created capability data individuals collected combined wide variety sources easily ftc provided set guidelines represent widely accepted concepts concerning fair information practices electronic marketplace called fair information practice principles order give away much personal information emails encrypted browsing web pages well online activities done trace-less via anonymizers case trusted open-source distributed anonymizers called mix nets i2p tor \u2013 onion router vpns virtual private networks another anonymizer used give someone protection online includes obfuscating encrypting web traffic groups see mine email n't internet content privacy concerns age increasing amounts information going online social networking sites pose additional privacy challenges people may tagged photos valuable information exposed either choice unexpectedly others data location also accidentally published example someone posts picture store background caution exercised information posted social networks vary allow users make private remains publicly accessible without strong security settings place careful attention remains public person profiled searching collecting disparate pieces information worst case leading cases cyberstalking reputational damage location tracking capabilities mobile devices advancing location-based services problems related user privacy arise location data among sensitive data currently collected list potentially sensitive professional personal information could inferred individual knowing mobility trace published recently electronic frontier foundation include movements competitor sales force attendance particular church individual presence motel abortion clinic recent mit study de montjoye et al showed four spatio-temporal points approximate places times enough uniquely identify 95 1.5 million people mobility database study shows constraints hold even resolution dataset low therefore even coarse blurred datasets provide little anonymity people may wish medical records revealed others may concern might affect insurance coverages employment may would wish others know medical psychological conditions treatments would bring embarrassment upon revealing medical data could also reveal details one personal life three major categories medical privacy informational degree control personal information physical degree physical inaccessibility others psychological extent doctor respects patients \u2019 cultural beliefs inner thoughts values feelings religious practices allows make personal decisions physicians psychiatrists many cultures countries standards doctor\u2013patient relationships include maintaining confidentiality cases physician\u2013patient privilege legally protected practices place protect dignity patients ensure patients feel free reveal complete accurate information required receive correct treatment view united states laws governing privacy private health information see hipaa hitech act political privacy concern since voting systems emerged ancient times secret ballot simplest widespread measure ensure political views known anyone voters themselves\u2014it nearly universal modern democracy considered basic right citizenship fact even rights privacy exist type privacy often unfortunately several forms voting fraud privacy violations possible use digital voting machines legal protection right privacy general \u2013 data privacy particular \u2013 varies greatly around world laws regulations related privacy data protection constantly changing seen important keep abreast changes law continually reassess compliance data privacy security regulations within academia institutional review boards function assure adequate measures taken ensure privacy confidentiality human subjects research privacy concerns exist wherever personally identifiable information sensitive information collected stored used finally destroyed deleted \u2013 digital form otherwise improper non-existent disclosure control root cause privacy issues data privacy issues may arise response information wide range sources heterogeneous information systems differing privacy rules interconnected information shared policy appliances required reconcile enforce monitor increasing amount privacy policy rules laws two categories technology address privacy protection commercial systems communication enforcement internet many users give away lot information unencrypted e-mails read administrators e-mail server connection encrypted https also internet service provider parties sniffing network traffic connection able know contents applies kind traffic generated internet including web browsing instant messaging others order give away much personal information e-mails encrypted browsing webpages well online activities done traceless via anonymizers open source distributed anonymizers so-called mix networks well known open-source mix nets include i2p \u2013 anonymous network tor computer privacy improved individualization currently security messages designed average user i.e message everyone researchers posited individualized messages security nudges crafted based users individual differences personality traits used improvements person compliance computer security privacy united states department commerce created international safe harbor privacy principles certification program response 1995 directive data protection directive 95/46/ec european commission directive 95/46/ec declares chapter iv article 25 personal data may transferred countries european economic area countries provide adequate privacy protection historically establishing adequacy required creation national laws broadly equivalent implemented directive 95/46/eu although exceptions blanket prohibition \u2013 example disclosure country outside eea made consent relevant individual article 26 1 \u2013 limited practical scope result article 25 created legal risk organisations transfer personal data europe united states program regulates exchange passenger name record information eu us according eu directive personal data may transferred third countries country provides adequate level protection exceptions rule provided instance controller guarantee recipient comply data protection rules european commission set working party protection individuals regard processing personal data commonly known article 29 working party working party gives advice level protection european union third countries working party negotiated u.s. representatives protection personal data safe harbor principles result notwithstanding approval self-assessment approach safe harbor remains controversial number european privacy regulators commentators safe harbor program addresses issue following way rather blanket law imposed organisations united states voluntary program enforced ftc u.s. organisations register program self-assessed compliance number standards deemed adequate purposes article 25 personal information sent organisations eea without sender breach article 25 eu national equivalents safe harbor approved providing adequate protection personal data purposes article 25 6 european commission 26 july 2000 safe harbor adoptee organisations need carefully consider compliance onward transfer obligations personal data originating eu transferred us safe harbor onward third country alternative compliance approach binding corporate rules recommended many eu privacy regulators resolves issue addition dispute arising relation transfer hr data us safe harbor must heard panel eu privacy regulators july 2007 new controversial passenger name record agreement us eu made short time afterwards bush administration gave exemption department homeland security arrival departure information system adis automated target system 1974 privacy act february 2008 jonathan faull head eu commission home affairs complained us bilateral policy concerning pnr us signed february 2008 memorandum understanding mou czech republic exchange visa waiver scheme without concerting brussels tensions washington brussels mainly caused lesser level data protection us especially since foreigners benefit us privacy act 1974 countries approached bilateral mou included united kingdom estonia germany greece", + "neighbors": [ + 242, + 302, + 379, + 402, + 517, + 528, + 762, + 813, + 1121, + 1325, + 1337, + 1416, + 1444, + 1470 + ], + "mask": "Test" + }, + { + "node_id": 416, + "label": 7, + "text": "SpeedTree:speedtree speedtree group vegetation programming modeling software products developed sold interactive data visualization inc. idv generates virtual foliage animations architecture real time video games demanding real time simulations speedtree licensed developers range video games microsoft windows xbox playstation console series since 2002 speedtree used 40 major films since release 2009 including iron man 3 star trek darkness life pi birdman used generate lush vegetation pandora avatar speedtree awarded scientific technical academy award 2015 presented idv founders michael sechrest chris king senior engineer greg croft speedtree conceptualized idv circa 2000 originated due firm lack satisfaction 3rd-party tree-generation software market initial version speedtreecad cad standing computer-aided design developed idv real-time golf simulation although backers pulled golf project idv refined cad software 3d studio max plug-in animated architectural rendering dubbing speedtreemax speedtreemax released february 2002 toward end 2002 idv released speedtreert real-time foliage/tree middleware sdk allowed automatic levels foliage detail real-time wind effects multiple lighting options idv eventually released plug-ins maya well appropriately named speedtreemaya early 2009 idv discontinued speedtreemax speedtreemaya plugins replacing speedtree modeler compiler products idv released speedtree 5 july 2009 version representing complete re-engineering software first versions speedtree enabling hand modeling editing vegetation models speedtree modeler replacing speedtreecad speedtreesdk replacing speedtreert speedtree compiler prepares speedtree files real-time rendering speedtree cinema first released idv 2009 based version 5 technology speedtree games version 6 released november 7 2011 essentially re-branded version speedtree 6 modeler compiler product identified speedtree games distinguish products meant gaming/real-time use speedtree architect released october 15 2012 designed architectural 3d cad use 3d fly-throughs idv released updated versions speedtree cinema speedtree studio speedtree architect november 2013 idv released speedtree v7 unreal engine 4 july 2014 idv released speedtree v7 unity 5 new engine version launch date march 2015 idv released speedtree games v7 april 16 2015 idv three engineers received scientific technical academy award 2015 speedtree cinema product suite speedtree cinema released idv 2009 saw first major use avatar james cameron speedtree cinema designed use film industry generates high-resolution meshes high-quality textures autodesk 3ds max autodesk maya cinema4d cinema edition includes speedtree modeler complete tree model library designed idv suites tree packs must purchased separately several members speedtree line simulate animated growth trees plants seasonal changes export data animated wind effects speedtree studio released idv 2009 less expensive companion speedtree cinema include cinema features complete tree model library speedtree architect released 2012 designed use 3d architectural cad generates meshes compatible typical architectural applications autodesk 3ds max autodesk maya rhino architect edition also exports normal maps uv maps physically-accurate rendering engines v-ray mental ray speedtree games edition speedtree video game development contrasting subscription edition offered users unity game development engine certain versions unreal engine 4 engine games edition includes modeler compiler sdk edition permits game developers integrate speedtree runtime technology game engine choice meshes generated system low poly multiple levels detail use texture atlases typically stored efficient binary format speedtree subscription edition low-cost edition speedtree modeler runtime targeted independent game studios licensing fee 19 usd monthly charge well additional charges tree packs subscribers get access speedtree editor ability generate 3d models trees plants plants exclusively usable either unreal engine 4 unity depending license subscribers download additional tree model packs model library pricing varies packs speedtree modeler windows-based specialized modeling tool designing foliage modeler features combination procedural tree generation hand-editing tools draw trees transform individual tree parts procedural tree generation uses configuration branch length branching angles bark texture generate tree variety formats newer versions support drag-and-drop interface automatically blends branch intersections handles branch collisions speedtree compiler software enables creation efficient tree models use real-time rendering video games generates texture atlases compiles optimizes tree models real-time use speedtree sdk multi-platform c++ sdk efficiently handles rendering speedtree-generated trees forests engine designed integrate operate within larger game engine ready-made support unreal engine unity ogre engine contains optimized systems cull off-screen trees determine level detail on-screen trees full source code available licensees use video games real-time applications modification engine supported engine built work microsoft windows mac os x xbox playstation playstation vita idv licensed middleware partner playstation 3 playstation 4 xbox 360 xbox one idv partnered epic games order integrate software epic unreal engine 4 unreal engine 3 free udk engine released november 2009 partnerships also formed idv bigworld tech vision engine havok multiverse network gamebryo engine emergent game technologies ogre open-source rendering engine torus knot speedtree games licensed first video games including december 2002 speedtree licensed pc next-generation console titles wide variety genres studios used speedtree published games featuring technology include selected recent upcoming and/or popular titles featuring speedtree games following release speedtree cinema 2009 speedtree saw first major cinematic use 2009 avatar technology provided vegetation flyover planet pandora first frames movie well scenes known movies television productions featuring speedtree include speedtree used following real-time projects offerings", + "neighbors": [ + 134, + 468, + 718, + 839, + 961, + 976, + 1138, + 1159, + 1592 + ], + "mask": "Test" + }, + { + "node_id": 417, + "label": 7, + "text": "Cluster_manager:cluster manager cluster manager usually backend graphical user interface gui command-line software runs one cluster nodes cases runs different server cluster management servers .the cluster manager works together cluster management agent agents run node cluster manage configure services set services manage configure complete cluster server see super computing cases cluster manager mostly used dispatch work cluster cloud perform last case subset cluster manager remote desktop application used configuration send work get back work results cluster cases cluster related availability load balancing computational specific service clusters", + "neighbors": [ + 227, + 611 + ], + "mask": "Validation" + }, + { + "node_id": 418, + "label": 4, + "text": "Tiny_Banker_Trojan:tiny banker trojan tiny banker trojan also called tinba malware program targets financial institution websites modified form older form viruses known banker trojans yet much smaller size powerful works establishing man-in-the-browser attacks network sniffing since discovery found infected two dozen major banking institutions united states including td bank chase hsbc wells fargo pnc bank america designed steal users sensitive data account login information banking codes tiny banker first discovered 2012 found infected thousands computers turkey discovered original source code malware leaked online began undergoing individual revisions making process detecting harder institutions highly modified version zeus trojan similar attack method obtain information tinba however found much smaller size smaller size makes malware difficult detect 20kb tinba much smaller known trojan reference average file size web site around 1,000kb difference infected web page clean one difficult anti-malware programs recognize tinba operates using packet sniffing method reading network traffic determine user navigates banking website malware launch one two different actions depending variation popular form tinba form grab webpage causing man-in-the-middle attack trojan uses form grabbing grab keystrokes encrypted https tinba sends keystrokes command control turn causes user information stolen second method tinba used allow user log webpage user malware use page information extract company logo site formatting create pop-up page informing user updates system requesting additional information social security numbers banking institutions inform users never ask information way defend types attacks tinba modified address defense begun asking users type information asked security questions user mother maiden name attempt attacker use information reset password later time tinba also injects system processes attempt convert host machine zombie unwilling member botnet order maintain connection botnet tinba coded four domains one goes loses communication trojan look one others immediately", + "neighbors": [ + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 533, + 550, + 564, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 675, + 692, + 708, + 783, + 818, + 915, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 419, + "label": 0, + "text": "Center_embedding:center embedding linguistics center embedding process embedding phrase middle another phrase type often leads difficulty parsing would difficult explain grammatical grounds alone frequently used example involves embedding relative clause inside another one theories natural language parsing difficulty multiple center embedding thought arise limitations human short term memory order process multiple center embeddings store many subjects order connect predicates interesting theoretical point sentences multiple center embedding grammatical unacceptable examples behind noam chomsky comment languages 'designed parsability \u2026 may say languages usable chomsky 1991 researchers peter reich came theories though single center embedding acceptable man boy kicked friend mine double center embedding linguist anne de roeck colleagues provided counter-example n't true example-sentences people know produce likely accepted de roeck et al. 1982 linguist fred karlsson provided empirical evidence 2007 maximal degree multiple center-embedding clauses exactly 3 written language provided thirteen genuine examples type various indo-european languages danish english german latin swedish real examples degree 4 recorded spoken language multiple center-embeddings even degree 2 rare practically non-existing karlsson 2007 center embedding focus science fiction novel ian watson embedding plays part ted chiang story life embedding refers types clauses occurring subordinate parts superordinate clause three types sub-clauses complement relative adverbial subordinators relative pronouns indicate sub clause used center embedding abbreviated c c contains words superordinate clause left right sub-clauses multiple center embedding type clause called self-embedding english language create infinite number sentences even though set number words grammatical rules create infinite sentences rules recursion iteration rule recursion come center embedding embedding one sentence within another sentence linguists say center embedding could go forever technically grammatically correct reader would however become confused trying keep track working memory would able store keep track information given enough time piece paper pencil reader could work information sentence made sense embedding used two clauses share common category expand sentence effective optional categories used create extensive embedding sentence brother opened window maid closed -the common category window sentence expanded become brother opened window maid closed brother opened window maid janitor uncle bill hired married closed common category sentence broken multiple sentences make sense reader brother opened window maid closed one married janitor uncle bill hired center embedded sentence difficult comprehend relative clause embedded another relative clause comprehension becomes easier types clause different -- complement clause embedded relative clause relative clause embedded complement clause example- man heard dog killed radio ran away tell sentence center embedded edge embedded depending brackets located sentence 1 joe believes mary thinks john handsome 2 cat dog man hit chased meowed sentence 1 brackets located right sentence right embedded sentence 2 brackets located inside sentence spaced throughout", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 420, + "label": 4, + "text": "Battery_Directive:battery directive directive 2006/66/ec european parliament council 6 september 2006 batteries accumulators waste batteries accumulators repealing directive 91/157/eec commonly known battery directive regulates manufacture disposal batteries european union aim improving environmental performance batteries accumulators batteries commonly contain hazardous elements mercury cadmium lead incinerated landfilled present risk environment human health directive 91/157/eec adopted 18 march 1991 reduce hazards harmonising eu member states laws disposal recycling batteries containing dangerous substances directive 2006/66/ec repealed directive 91/157/eec directive 2006/66/ec amended directive 2013/56/eu 20 november 2013 regards placing market portable batteries accumulators containing cadmium intended use cordless power tools button cells low mercury content repealing commission decision 2009/603/ec directive like many european compliance directives directly applicable requires legislative action european member states though european directives legislation european union member states must comply avoid legal action european commission bring bear n't however member states retain freedom means implement directive requirements battery directive objective improving environmental performance batteries regulating use certain substances manufacture batteries lead mercury cadmium etc setting standards waste management batteries many european member states passed battery waste management laws among nations belgium sweden germany austria denmark finland united kingdom netherlands france others finland denmark supported total prohibition cadmium batteries belgium sweden battery recycling rates 59 55 respectively finalisation 2006 battery directive european states specific guidelines make rules comport first western european directives dealing waste management council directive 75/442/eec 15 july 1975 waste n't mention batteries chemicals specified regulation particular categories waste later referenced battery directives legislative legal basis first version european council directive batteries accumulators 91/157/eec approved 18 march 1991 covered many battery types including industrial automotive dry-cell lead-acid alkaline nickel-cadmium nickel-metal-hydride lithium lithium-ion mercury etc first program directive set six-year duration starting 1993 1991 battery directive article 3 mi annex stated prohibition exceptions marketing since battery recycling rates 5 directive sought improve rates set recycling goals separate collection recycling provide recycling/collection information consumer responsibility providing separated recycling collection largely given manufacturers recycling requirements found articles 4 6 7 marking provisions including manufacturer responsibility marking battery products contained substances recycling information regulation met heavy resistance disputed deadlines target recycling rates implementation dates weight percentage limits applicable product groups financial responsibility public information campaigns waste management financial impact exclusions financial responsibility given small producer businesses personnel safety decreased reliability greener batteries non-environmental battery marking question automotive battery makers questioned markings batteries relating battery performance arguing quantity car battery electric current output start vehicle extreme weather good indicator battery performance poor implementation first battery directive work began new directive would emphasise battery end-of-life waste management mandated better-structured collection recycling programs also acknowledged research certain substance needed harsher complete arguably unrealistic bans thus onus everyone waste management chain producer consumer rather affecting product design substance bans manufacturers claimed unreasonable consultations revisions first battery directive started 1997 giving interested parties voice legislation policy especially assessing directive economic environmental social impact february 2003 open stakeholders consultation process started published findings online culminated meeting brussels july 2003 waters tested asking extended impact assessments different scenarios proposed ranges regulation example would impact establishing spent battery collection targets 30 80 impact separate spent battery collection 70 100 entities asked goals could met propose collection responsibility models green viewpoint perhaps conciliation committee previous directive limited scope groups side set forth reasons less stringency arguing broadening scope claimed batteries certain metals banned carte blanche waste management effort would hurt confusion perhaps inconvenience public least six drafts 2003 version equivalent second battery directive 2003 revision council directive 2003/0282/cod july 2006 conciliation agreement compromise european council european parliament came three years draft revisions welcomed entities like european portable battery association epba favoured less stringency models european compliance legislation corporation organisations like epba participates working groups members include among players legislators large enterprises\u2014in case battery-makers\u2014trade associations non-governmental organisations directive overall stated objective still protect public interest cleaner environment minimising negative impact environment batteries especially waste cycle depending viewpoint also something compromise 1. manufacturers distributors 3. environmental proponents recent battery directive entered force 26 september 2006 gave european member states 26 september 2008 implement national laws rules batteries art.26 \u2013 transposition nations took initiative already started programs passed laws accordance spirit specifications earlier battery directives exception button cells mercury content 2 weight 2006 battery directive restates earlier battery directive prohibition marketing batteries 0.0005 mercury 0.002 cadmium weight however exceptions exist directive also mandates symbols battery labels indicate battery chemical contents lead mercury cadmium used according directive lead content batteries longer restricted initiatives reduce heavy metal batteries promote using less toxic substances batteries dispose batteries properly via regular household waste properly separated research initiatives recycling consumers informed dangers non-compliant disposal old batteries also states must easy consumers remove batteries electronic products disposal automotive industrial batteries leaving landfills incineration prohibited directive preamble point 8 article 7 requires member states maximise separation batteries regular municipal waste requires spent batteries collected separately recycling collection targets called fewer batteries end landfills collection program found annex proposed member states set country standards using battery directive guide minimum levels levels stated terms percents prior annual sales article 3 17 states 'collection rate means given member state given calendar year percentage obtained dividing weight waste portable batteries accumulators collected accordance article 8 1 directive directive 2002/96/ec calendar year average weight portable batteries accumulators producers either sell directly end-users deliver third parties order sell end-users member state calendar year preceding two calendar years member states required provide collection sites accessible free charge public art 8 battery distributors may required provide member states discretion art 8 2 battery manufacturers may refuse take back waste batteries end-consumers irrespective chemical composition origin art 8 3 waste battery collection rate targets specified article 10 minimum targets 25 battery sales 45 battery sales 26 september 2012 2016 respectively art 10 2 collections rates monitored annually outlined annex scheme yearly reporting commission may leeway given form transitional agreements nation special circumstances art 10 4 many exclusions granted manufacturers certain product types cases batteries used safety critical-use applications e.g miners caps exemptions following still place batteries imported third countries non-discriminatory conditions included art 19 member states may use instruments like differential tax rates encourage less toxic batteries recycling art 9 member states required submit implementation reports commission every three years art 22 art 21 marking must indicate separate collections recycling heavy metal content labels state collection information chemical content batteries show symbol crossed-out wheeled recycling bin annex ii indicate battery go bin symbol size specified percent battery area largest side 3 except cylindrical batteries symbol 1.5 total surface area member states set measures effective proportionate dissuasive penalties actions comporting battery directive apprise european commission measures changes art 25 annex battery collection targets mentioned art 10 practice manufacturers batteries need make sure applied legal framework company means need check producer legal terms directive whether fulfilled labelling obligation next step manufacturers distributors define battery strategy register battery compliance schemes control battery compliance monitor recycling recovery results working within framework battery directive manufacturers producers distributors also aware financial aspects registration timelines ensure compliance reduce risks batteries time supported advice suitable qualified persons mercury-containing rechargeable battery management act 1996 similar law united states banning sale mercury-containing batteries except small button cells requiring labelling disposal recycling u.s. state california new york city require recycling rechargeable batteries along state maine require recycling cell phones similar european directives protecting environment health parallel battery directive restriction hazardous substances rohs waste electrical electronic equipment weee registration evaluation authorisation restriction chemicals reach directives", + "neighbors": [ + 60, + 226, + 231, + 535 + ], + "mask": "Test" + }, + { + "node_id": 421, + "label": 5, + "text": "Drop_and_insert:drop insert multichannel transmission system drop insert process diverts drop portion multiplexed aggregate signal intermediate point introduces insert different signal subsequent transmission position drop insert practiced example time-division multiplexing tdm time slot frequency band replaced another source diverted signal may demodulated reinserted another transmission system another time slot frequency band time slot frequency band vacated diverted signal need necessarily reoccupied another signal likewise previously unoccupied time slot frequency band may occupied signal inserted drop-and-insert point signals interest drop-and-insert point diverted", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 422, + "label": 2, + "text": "Android_Honeycomb:android honeycomb android honeycomb codename eighth version android designed devices larger screen sizes particularly tablets longer supported newer versions honeycomb debuted motorola xoom february 2011 besides addition new features honeycomb introduced new so-called holographic user interface theme interaction model built main features android multitasking notifications widgets new features introduced honeycomb include following", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 423, + "label": 1, + "text": "Iris_Recognition_Immigration_System:iris recognition immigration system iris recognition immigration system iris initiative launched 2004 provide automated clearance uk immigration certain frequent travellers functioned one-to-all identification mode searching large database million enrolled frequent travellers see anyone matched presenting iris passenger asked assert identity e.g presenting passport id card would require one-to-one verification test single enrolled identity thus iris exploited great robustness iris recognition making false matches since unlike weak biometrics face recognition could survive vast number opportunities make false matches searching large database instead needing test single asserted identity decommissioned september 2013 favour e-passport entry using biometric data stored e-passport chip requires single asserted identity tested thus could function using weaker biometrics simple one-to-one verification mode iris relied biometric technology authenticate identity part e-borders initiative uk government claimed passengers found system difficult use resulting many false rejections required passengers join normal queue passport presentation main factor behind decision decommission iris cost staffing enrolment offices airport terminals whereas face recognition required submitting passport-type photograph acquired photo-booth without need personal presentation airport enrolment staff system cost \u00a34.9 million develop \u00a34 million operate enrolled passengers could enter uk special automated immigration control barrier incorporating iris recognition camera barriers located certain immigration arrival halls form part immigration passport control enrolment took place airport departure lounge immigration officer assesses eligibility enrols qualifying persons qualified participate scheme eyes photographed order capture iris patterns data stored securely alongside personal details originally iris rolled london heathrow london gatwick birmingham manchester 2004 intended deployment period five years february 2013 iris available heathrow terminals 3 5 barriers decommissioned last operational barriers decommissioned 15 16 september 2013 respectively original deployment plan five years doubled nearly ten years following travellers eligible enrol", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 424, + "label": 0, + "text": "Technolangue/Easy:technolangue/easy technolangue/easy first evaluation campaign syntactic parsers french project supported french research ministry minist\u00e8re de recherche fran\u00e7ais technolangue/easy included four tasks 2003 2006 13 laboratories companies submitted parser evaluation making total 16 runs 7 research laboratories 3 r institutes 3 private companies said terms existing french parsers competed", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 425, + "label": 5, + "text": "Domain_Name_System:domain name system domain name system dns hierarchical decentralized naming system computers services resources connected internet private network associates various information domain names assigned participating entities prominently translates readily memorized domain names numerical ip addresses needed locating identifying computer services devices underlying network protocols providing worldwide distributed directory service domain name system essential component functionality internet since 1985 domain name system delegates responsibility assigning domain names mapping names internet resources designating authoritative name servers domain network administrators may delegate authority sub-domains allocated name space name servers mechanism provides distributed fault-tolerant service designed avoid single large central database domain name system also specifies technical functionality database service core defines dns protocol detailed specification data structures data communication exchanges used dns part internet protocol suite internet maintains two principal namespaces domain name hierarchy internet protocol ip address spaces domain name system maintains domain name hierarchy provides translation services address spaces internet name servers communication protocol implement domain name system dns name server server stores dns records domain dns name server responds answers queries database common types records stored dns database start authority soa ip addresses aaaa smtp mail exchangers mx name servers ns pointers reverse dns lookups ptr domain name aliases cname although intended general purpose database dns expanded time store records types data either automatic lookups dnssec records human queries responsible person rp records general purpose database dns also used combating unsolicited email spam storing real-time blackhole list rbl dns database traditionally stored structured text file zone file database systems common often-used analogy explain domain name system serves phone book internet translating human-friendly computer hostnames ip addresses example domain name www.example.com translates addresses ipv4 ipv6 dns quickly transparently updated allowing service location network change without affecting end users continue use hostname users take advantage use meaningful uniform resource locators urls e-mail addresses without know computer actually locates services important ubiquitous function dns central role distributed internet services cloud services content delivery networks user accesses distributed internet service using url domain name url translated ip address server proximal user key functionality dns exploited different users simultaneously receive different translations domain name key point divergence traditional phone-book view dns process using dns assign proximal servers users key providing faster reliable responses internet widely used major internet services dns reflects structure administrative responsibility internet subdomain zone administrative autonomy delegated manager zones operated registry administrative information often complemented registry rdap whois services data used gain insight track responsibility given host internet using simpler memorable name place host numerical address dates back arpanet era stanford research institute sri international maintained text file named hosts.txt mapped host names numerical addresses computers arpanet elizabeth feinler developed maintained first arpanet directory maintenance numerical addresses called assigned numbers list handled jon postel university southern california information sciences institute isi whose team worked closely sri addresses assigned manually computers including hostnames addresses added master file contacting sri network information center nic directed elizabeth feinler telephone business hours later feinler set whois directory server nic retrieval information resources contacts entities team developed concept domains feinler suggested domains based location physical address computer computers educational institutions would domain edu example team managed host naming registry 1972 1989 early 1980s maintaining single centralized host table become slow unwieldy emerging network required automated naming system address technical personnel issues postel directed task forging compromise five competing proposals solutions paul mockapetris mockapetris instead created domain name system internet engineering task force published original specifications rfc 882 rfc 883 november 1983 1984 four uc berkeley students douglas terry mark painter david riggle songnian zhou wrote first unix name server implementation berkeley internet name domain commonly referred bind 1985 kevin dunlap dec substantially revised dns implementation mike karels phil almquist paul vixie maintained bind since early 1990s bind ported windows nt platform widely distributed especially unix systems still widely used dns software internet november 1987 rfc 1034 rfc 1035 superseded 1983 dns specifications several additional request comments proposed extensions core dns protocols domain name space consists tree data structure node leaf tree label zero resource records rr hold information associated domain name domain name consists label possibly concatenated name parent node right separated dot tree sub-divides zones beginning root zone dns zone may consist one domain may consist many domains sub-domains depending administrative choices zone manager dns also partitioned according class separate classes thought array parallel namespace trees administrative responsibility zone may divided creating additional zones authority new zone said delegated designated name server parent zone ceases authoritative new zone definitive descriptions rules forming domain names appear rfc 1035 rfc 1123 rfc 2181 rfc 5892 domain name consists one parts technically called labels conventionally concatenated delimited dots example.com right-most label conveys top-level domain example domain name www.example.com belongs top-level domain com hierarchy domains descends right left label left specifies subdivision subdomain domain right example label example specifies subdomain com domain www subdomain example.com tree subdivisions may 127 levels label may contain zero 63 characters null label length zero reserved root zone full domain name may exceed length 253 characters textual representation internal binary representation dns maximum length requires 255 octets storage also stores length name although technical limitation exists use character domain name labels representable octet hostnames use preferred format character set characters allowed labels subset ascii character set consisting characters z z digits 0 9 hyphen rule known ldh rule letters digits hyphen domain names interpreted case-independent manner labels may start end hyphen additional rule requires top-level domain names all-numeric limited set ascii characters permitted dns prevented representation names words many languages native alphabets scripts make possible icann approved internationalizing domain names applications idna system user applications web browsers map unicode strings valid dns character set using punycode 2009 icann approved installation internationalized domain name country code top-level domains cctld addition many registries existing top-level domain names tld adopted idna system guided rfc 5890 rfc 5891 rfc 5892 rfc 5893 domain name system maintained distributed database system uses client\u2013server model nodes database name servers domain least one authoritative dns server publishes information domain name servers domains subordinate top hierarchy served root name servers servers query looking resolving tld authoritative name server name server gives answers dns queries data configured original source example domain administrator dynamic dns methods contrast answers obtained via query another name server maintains cache data authoritative name server either master server slave server master server server stores original master copies zone records slave server uses special automatic updating mechanism dns protocol communication master maintain identical copy master records every dns zone must assigned set authoritative name servers set servers stored parent domain zone name server ns records authoritative server indicates status supplying definitive answers deemed authoritative setting protocol flag called authoritative answer aa bit responses flag usually reproduced prominently output dns administration query tools dig indicate responding name server authority domain name question domain name resolvers determine domain name servers responsible domain name question sequence queries starting right-most top-level domain label proper operation domain name resolver network host configured initial cache hints known addresses root name servers hints updated periodically administrator retrieving dataset reliable source assuming resolver cached records accelerate process resolution process starts query one root servers typical operation root servers answer directly respond referral authoritative servers e.g. query www.wikipedia.org referred org servers resolver queries servers referred iteratively repeats process receives authoritative answer diagram illustrates process host named fully qualified domain name www.wikipedia.org mechanism would place large traffic burden root servers every resolution internet required starting root practice caching used dns servers off-load root servers result root name servers actually involved relatively small fraction requests theory authoritative name servers sufficient operation internet however authoritative name servers operating every dns query must start recursive queries root zone domain name system user system would implement resolver software capable recursive operation improve efficiency reduce dns traffic across internet increase performance end-user applications domain name system supports dns cache servers store dns query results period time determined configuration time-to-live domain name record question typically caching dns servers also implement recursive algorithm necessary resolve given name starting dns root authoritative name servers queried domain function implemented name server user applications gain efficiency design operation combination dns caching recursive functions name server mandatory functions implemented independently servers special purposes internet service providers typically provide recursive caching name servers customers addition many home networking routers implement dns caches recursors improve efficiency local network client side dns called dns resolver resolver responsible initiating sequencing queries ultimately lead full resolution translation resource sought e.g. translation domain name ip address dns resolvers classified variety query methods recursive non-recursive iterative resolution process may use combination methods non-recursive query dns resolver queries dns server provides record either server authoritative provides partial result without querying servers case caching dns resolver non-recursive query local dns cache delivers result reduces load upstream dns servers caching dns resource records period time initial response upstream dns servers recursive query dns resolver queries single dns server may turn query dns servers behalf requester example simple stub resolver running home router typically makes recursive query dns server run user isp recursive query one dns server answers query completely querying name servers needed typical operation client issues recursive query caching recursive dns server subsequently issues non-recursive queries determine answer send single answer back client resolver another dns server acting recursively behalf resolver negotiates use recursive service using bits query headers dns servers required support recursive queries iterative query procedure process dns resolver queries chain one dns servers server refers client next server chain current server fully resolve request example possible resolution www.example.com would query global root server com server finally example.com server name servers delegations identified name rather ip address means resolving name server must issue another dns request find ip address server referred name given delegation subdomain domain delegation provided circular dependency case name server providing delegation must also provide one ip addresses authoritative name server mentioned delegation information called glue delegating name server provides glue form records additional section dns response provides delegation authority section response glue record combination name server ip address example authoritative name server example.org ns1.example.org computer trying resolve www.example.org first resolves ns1.example.org ns1 contained example.org requires resolving example.org first presents circular dependency break dependency name server top level domain org includes glue along delegation example.org glue records address records provide ip addresses ns1.example.org resolver uses one ip addresses query one domain authoritative servers allows complete dns query standard practice implementing name resolution applications reduce load domain name system servers caching results locally intermediate resolver hosts results obtained dns request always associated time live ttl expiration time results must discarded refreshed ttl set administrator authoritative dns server period validity may vary seconds days even weeks result distributed caching architecture changes dns records propagate throughout network immediately require caches expire refreshed ttl rfc 1912 conveys basic rules determining appropriate ttl values resolvers may override ttl values protocol supports caching sixty-eight years caching negative caching i.e caching fact non-existence record determined name servers authoritative zone must include start authority soa record reporting data requested type exists value minimum field soa record ttl soa used establish ttl negative answer reverse dns lookup query dns domain names ip address known multiple domain names may associated ip address dns stores ip addresses form domain names specially formatted names pointer ptr records within infrastructure top-level domain arpa ipv4 domain in-addr.arpa ipv6 reverse lookup domain ip6.arpa ip address represented name reverse-ordered octet representation ipv4 reverse-ordered nibble representation ipv6 performing reverse lookup dns client converts address formats querying name ptr record following delegation chain dns query example assuming ipv4 address 208.80.152.2 assigned wikimedia represented dns name reverse order 2.152.80.208.in-addr.arpa dns resolver gets pointer ptr request begins querying root servers point servers american registry internet numbers arin 208.in-addr.arpa zone arin servers delegate 152.80.208.in-addr.arpa wikimedia resolver sends another query 2.152.80.208.in-addr.arpa results authoritative response users generally communicate directly dns resolver instead dns resolution takes place transparently applications web browsers e-mail clients internet applications application makes request requires domain name lookup programs send resolution request dns resolver local operating system turn handles communications required dns resolver almost invariably cache see containing recent lookups cache provide answer request resolver return value cache program made request cache contain answer resolver send request one designated dns servers case home users internet service provider machine connects usually supply dns server user either configured server address manually allowed dhcp set however systems administrators configured systems use dns servers dns resolvers point separately maintained name servers organization event name server thus queried follow process outlined either successfully finds result returns results dns resolver assuming found result resolver duly caches result future use hands result back software initiated request large isps configured dns servers violate rules disobeying ttls indicating domain name exist one name servers respond applications web browsers maintain internal dns cache avoid repeated lookups via network practice add extra difficulty debugging dns issues obscures history data caches typically use short caching times \u2013 order one minute internet explorer represents notable exception versions ie 3.x cache dns records 24 hours default internet explorer 4.x later versions ie 8 decrease default time value half hour may changed modifying default configuration google chrome triggers specific error message dns issues dns server broken google chrome returns error message domain name system includes several functions features hostnames ip addresses required match one-to-one relationship multiple hostnames may correspond single ip address useful virtual hosting many web sites served single host alternatively single hostname may resolve many ip addresses facilitate fault tolerance load distribution multiple server instances across enterprise global internet dns serves purposes addition translating names ip addresses instance mail transfer agents use dns find best mail server deliver e-mail mx record provides mapping domain mail exchanger provide additional layer fault tolerance load distribution dns used efficient storage distribution ip addresses blacklisted email hosts common method place ip address subject host sub-domain higher level domain name resolve name record indicates positive negative indication example e-mail servers query blacklist.example find specific host connecting blacklist many blacklists either subscription-based free cost available use email administrators anti-spam software provide resilience event computer network failure multiple dns servers usually provided coverage domain top level global dns thirteen groups root name servers exist additional copies distributed worldwide via anycast addressing dynamic dns ddns updates dns server client ip address on-the-fly example moving isps mobile hot spots ip address changes administratively dns protocol uses two types dns messages queries replies format message consists header four sections question answer authority additional space header field flags controls content four sections header section consists following fields identification flags number questions number answers number authority resource records rrs number additional rrs field 16 bit long appears order given identification field used match responses queries flag field consists sub-fields follows flag header ends four 16-bit integers contain number records sections follow order question section simpler format resource record format used sections record usually 1 contains following fields domain name broken discrete labels concatenated label prefixed length label dns primarily uses user datagram protocol udp port number 53 serve requests dns queries consist single udp request client followed single udp reply server length answer exceeds 512 bytes client server support edns larger udp packets used otherwise query sent using transmission control protocol tcp tcp also used tasks zone transfers resolver implementations use tcp queries domain name system specifies database information elements network resources types information elements categorized organized list dns record types resource records rrs record type name number expiration time time live class type-specific data resource records type described resource record set rrset special ordering dns resolvers return entire set upon query servers may implement round-robin ordering achieve load balancing contrast domain name system security extensions dnssec work complete set resource record canonical order sent internet protocol network records use common format specified rfc 1035 name fully qualified domain name node tree wire name may shortened using label compression ends domain names mentioned earlier packet substituted end current domain name free standing used denote current origin type record type indicates format data gives hint intended use example record used translate domain name ipv4 address ns record lists name servers answer lookups dns zone mx record specifies mail server used handle mail domain specified e-mail address rdata data type-specific relevance ip address address records priority hostname mx records well known record types may use label compression rdata field unknown record types must rfc 3597 class record set internet common dns records involving internet hostnames servers ip addresses addition classes chaos ch hesiod hs exist class independent name space potentially different delegations dns zones addition resource records defined zone file domain name system also defines several request types used communication dns nodes wire performing zone transfers axfr/ixfr edns opt domain name system supports wildcard dns records specify names start asterisk label '* e.g. *.example dns records belonging wildcard domain names specify rules generating resource records within single dns zone substituting whole labels matching components query name including specified descendants example following configuration dns zone x.example specifies subdomains including subdomains subdomains x.example use mail exchanger mx a.x.example record a.x.example needed specify mail exchanger ip address result excluding domain name subdomains wildcard matches additional mx record subdomain a.x.example well wildcarded mx record subdomains must also defined dns zone role wildcard records refined rfc 4592 original definition rfc 1034 incomplete resulted misinterpretations implementers original dns protocol limited provisions extension new features 1999 paul vixie published rfc 2671 superseded rfc 6891 extension mechanism called extension mechanisms dns edns introduced optional protocol elements without increasing overhead use accomplished opt pseudo-resource record exists wire transmissions protocol zone files initial extensions also suggested edns0 increasing dns message size udp datagrams dynamic dns updates use update dns opcode add remove resource records dynamically zone database maintained authoritative dns server feature described rfc 2136 facility useful register network clients dns boot become otherwise available network booting client may assigned different ip address time dhcp server possible provide static dns assignments clients originally security concerns major design considerations dns software software deployment early internet network open participation general public however expansion internet commercial sector 1990s changed requirements security measures protect data integrity user authentication several vulnerability issues discovered exploited malicious users one issue dns cache poisoning data distributed caching resolvers pretense authoritative origin server thereby polluting data store potentially false information long expiration times time-to-live subsequently legitimate application requests may redirected network hosts operated malicious intent dns responses traditionally cryptographic signature leading many attack possibilities domain name system security extensions dnssec modify dns add support cryptographically signed responses dnscurve proposed alternative dnssec extensions tsig add support cryptographic authentication trusted peers commonly used authorize zone transfer dynamic update operations domain names may used achieve spoofing effects example paypa1.com different names yet users may unable distinguish graphical user interface depending user chosen typeface many fonts letter l numeral 1 look similar even identical problem acute systems support internationalized domain names many character codes iso 10646 may appear identical typical computer screens vulnerability occasionally exploited phishing techniques forward-confirmed reverse dns also used help validate dns results device looking dns record must communicate dns server considerable attention given adverse privacy implications even dns records easily read modified spoofed due security extensions person access dns server traffic stream wire may little difficulty matching ip address device often identifies user websites email domains visit track often records queried since dns records typically expire must requeried regularly dns also leak otherwise secure private connections attention paid configuration times dns used bypass firewalls malicious persons exfiltrate data since often seen innocuous two main approaches use counter privacy issues dns right use domain name delegated domain name registrars accredited internet corporation assigned names numbers icann organizations opennic charged overseeing name number systems internet addition icann top-level domain tld maintained serviced technically administrative organization operating registry registry responsible operating database names within authoritative zone although term often used tlds registrant person organization asked domain registration registry receives registration information domain name registrar authorized accredited assign names corresponding zone publishes information using whois protocol 2015 usage rdap considered icann publishes complete list tlds tld registries domain name registrars registrant information associated domain names maintained online database accessible whois service 290 country code top-level domains cctlds domain registries maintain whois registrant name servers expiration dates etc information instance denic germany nic holds de domain data 2001 generic top-level domain gtld registries adopted so-called thick registry approach i.e keeping whois data central registries instead registrar databases top-level domains com net thin registry model used domain registry e.g. godaddy bigrock pdr verisign etc. etc holds basic whois data i.e. registrar name servers etc. organizations registrants using org hand public interest registry exclusively domain name registries often called network information centers nic also function registrars end-users addition providing access whois datasets top-level domain registries domains com net org use registry-registrar model consisting many domain name registrars method management registry manages domain name database relationship registrars registrants users domain name customers registrar cases additional subcontracting resellers domain name system defined request comments rfc documents published internet engineering task force internet standards following list rfcs define dns protocol rfcs advisory nature may provide useful information despite defining neither standard bcp rfc 1796 rfcs official status unknown due age clearly labeled", + "neighbors": [ + 14, + 52, + 109, + 111, + 148, + 254, + 311, + 330, + 352, + 364, + 405, + 430, + 436, + 444, + 455, + 470, + 531, + 542, + 543, + 576, + 598, + 620, + 647, + 672, + 678, + 684, + 703, + 711, + 732, + 757, + 758, + 762, + 764, + 769, + 770, + 771, + 772, + 779, + 780, + 833, + 852, + 1099, + 1116, + 1138, + 1144, + 1145, + 1171, + 1200, + 1201, + 1206, + 1218, + 1266, + 1287, + 1309, + 1326, + 1329, + 1386, + 1395, + 1400, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 426, + "label": 2, + "text": "Words_(Unix):words unix words standard file unix unix-like operating systems simply newline-delimited list dictionary words used instance spell-checking programs words file usually stored debian ubuntu file provided package provider packages etc fedora arch file provided package", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 427, + "label": 5, + "text": "Mozilla_localizations:mozilla localizations mozilla localizations localized versions mozilla products usually entails product translated certain language language region specific features added localization normally carried teams volunteers mozilla firefox heavily localized cross-platform web browser date first official release november 2004 available 28 different locales including british english/american english european spanish/argentine spanish chinese traditional chinese characters/simplified chinese characters firefox 4 initially shipped 80 locales introduced 10 new locales including 6 african languages following table lists releases firefox precursors microsoft windows operating system listing locales available end version releases mozilla thunderbird email application somewhat fewer localised releases initial release us english since released 45 languages 47 locales though much mozilla web content localized extent localization varies locale locale example mozilla firefox privacy policy currently available english", + "neighbors": [ + 81, + 83, + 95, + 107, + 258, + 277, + 509, + 530, + 582, + 623, + 668, + 684, + 713, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1120, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1302, + 1376, + 1378, + 1423, + 1539, + 1550, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 428, + "label": 4, + "text": "Security_level_management:security level management security level management slm comprises quality assurance system electronic information security aim slm display security status transparently across company time make security measurable quantity transparency measurability form prerequisites making security proactively monitorable improved continuously slm oriented towards phases deming cycle/plan-do-check-act pdca cycle within scope slm abstract security policies compliance guidelines company transposed operative measureable specifications security infrastructure operative aims form security level reached security level checked permanently current performance security systems malware scanner patch systems etc. deviations recognised early adjustments made security system slm falls range duties chief security officer cso chief information officer cio chief information security officer ciso report directly executive board security data availability slm related disciplines security security event management siem analysts gartner summarise magic quadrant security information event management define follows \u2026 sim provides reporting analysis data primarily host systems applications secondarily security devices \u2014 support security policy compliance management internal threat management regulatory compliance initiatives sim supports monitoring incident management activities security organization \u2026 sem improves security incident response capabilities sem processes near-real-time data security devices network devices systems provide real-time event management security operations \u2026 sim sem relate infrastructure realising superordinate security aims descriptive strategic management system aims measures revisions actions derived slm unites requisite steps realising measurable functioning security structure management control cycle slm categorised strategic panoply governance via suitable organisation structures processes ensures supports corporate strategy objectives slm allows csos cios cisos prove slm contributing towards protecting electronic data relevant processes adequately therefore makes contribution part governance defining security level plan company specifies security policies executive management defines aims relation integrity confidentiality availability authority classified data order able verify compliance specifications concrete aims individual security systems company need derived abstract security policies security level consists collection measurable limiting threshold values example operative aims like anti-virus systems uk sites need up-to-date longer four hours publication current definition need derived superordinate security policies like employees able work without interrupted limiting threshold values specified separately individually different sites locations countries infrastructure on-site local determining factors need taken consideration example office buildings uk normally equipped high-speed dedicated lines wholly realistic limit deadline supplying computers newest anti-virus definitions hours factory asia slow modem link web realistic limiting value would set somewhat higher control manual control objectives information related technology cobit cobit provides companies instructions transposing subordinate abstract aims measurable aims steps collecting analysing data information current status systems gleaned log file status reports provided individual anti-virus anti-spyware anti-spam consoles monitoring reporting solutions analysing software applications software houses simplify accelerate data collection checking security level check slm prescribes continual reconciliation defined security level current measured values automated real-time reconciliation supplies companies permanent status report security status across locations adjusting security structure act efficient slm allows trend analyses long-term comparative assessments made rolling observation security level weak spots network identified early appropriate adjustments made proactively security systems besides defining specifications engineering introducing operating monitoring maintaining improving documented information security management system iso/iec 27001 also defines specifications implementing suitable security mechanisms infrastructure library itil collection best practices control processes goes far beyond security relation supplies criteria security officers conceive security independent qualitatively measurable service integrate universe business-process-oriented processes itil also works top policies processes procedures job-related instructions assumes superordinate also operative aims need planned implemented controlled evaluated adjusted", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 429, + "label": 1, + "text": "Database:database database organized collection data generally stored accessed electronically computer system databases complex often developed using formal design modeling techniques database management system dbms software interacts end users applications database capture analyze data dbms software additionally encompasses core facilities provided administer database sum total database dbms associated applications referred database system often term database also used loosely refer dbms database system application associated database computer scientists may classify database-management systems according database models support relational databases became dominant 1980s model data rows columns series tables vast majority use sql writing querying data 2000s non-relational databases became popular referred nosql use different query languages formally database refers set related data way organized access data usually provided database management system dbms consisting integrated set computer software allows users interact one databases provides access data contained database although restrictions may exist limit access particular data dbms provides various functions allow entry storage retrieval large quantities information provides ways manage information organized close relationship term database often used casually refer database dbms used manipulate outside world professional information technology term database often used refer collection related data spreadsheet card index size usage requirements typically necessitate use database management system existing dbmss provide various functions allow management database data classified four main functional groups database dbms conform principles particular database model database system refers collectively database model database management system database physically database servers dedicated computers hold actual databases run dbms related software database servers usually multiprocessor computers generous memory raid disk arrays used stable storage raid used recovery data disks fail hardware database accelerators connected one servers via high-speed channel also used large volume transaction processing environments dbmss found heart database applications dbmss may built around custom multitasking kernel built-in networking support modern dbmss typically rely standard operating system provide functions since dbmss comprise significant market computer storage vendors often take account dbms requirements development plans databases dbmss categorized according database model support relational xml type computer run server cluster mobile phone query language used access database sql xquery internal engineering affects performance scalability resilience security sizes capabilities performance databases respective dbmss grown orders magnitude performance increases enabled technology progress areas processors computer memory computer storage computer networks development database technology divided three eras based data model structure navigational sql/relational post-relational two main early navigational data models hierarchical model codasyl model network model relational model first proposed 1970 edgar f. codd departed tradition insisting applications search data content rather following links relational model employs sets ledger-style tables used different type entity mid-1980s computing hardware become powerful enough allow wide deployment relational systems dbmss plus applications early 1990s however relational systems dominated large-scale data processing applications remain dominant ibm db2 oracle mysql microsoft sql server searched dbms dominant database language standardised sql relational model influenced database languages data models object databases developed 1980s overcome inconvenience object-relational impedance mismatch led coining term post-relational also development hybrid object-relational databases next generation post-relational databases late 2000s became known nosql databases introducing fast key-value stores document-oriented databases competing next generation known newsql databases attempted new implementations retained relational/sql model aiming match high performance nosql compared commercially available relational dbmss introduction term database coincided availability direct-access storage disks drums mid-1960s onwards term represented contrast tape-based systems past allowing shared interactive use rather daily batch processing oxford english dictionary cites 1962 report system development corporation california first use term data-base specific technical sense computers grew speed capability number general-purpose database systems emerged mid-1960s number systems come commercial use interest standard began grow charles bachman author one product integrated data store ids founded database task group within codasyl group responsible creation standardization cobol 1971 database task group delivered standard generally became known codasyl approach soon number commercial products based approach entered market codasyl approach relied manual navigation linked data set formed large network applications could find records one three methods later systems added b-trees provide alternate access paths many codasyl databases also added straightforward query language however final tally codasyl complex required significant training effort produce useful applications ibm also dbms 1966 known information management system ims ims development software written apollo program system/360 ims generally similar concept codasyl used strict hierarchy model data navigation instead codasyl network model concepts later became known navigational databases due way data accessed bachman 1973 turing award presentation programmer navigator ims classified ibm hierarchical database idms cincom systems total database classified network databases ims remains use edgar codd worked ibm san jose california one offshoot offices primarily involved development hard disk systems unhappy navigational model codasyl approach notably lack search facility 1970 wrote number papers outlined new approach database construction eventually culminated groundbreaking relational model data large shared data banks paper described new system storing working large databases instead records stored sort linked list free-form records codasyl codd idea use table fixed-length records table used different type entity linked-list system would inefficient storing sparse databases data one record could left empty relational model solved splitting data series normalized tables relations optional elements moved main table would take room needed data may freely inserted deleted edited tables dbms whatever maintenance needed present table view application/user relational model also allowed content database evolve without constant rewriting links pointers relational part comes entities referencing entities known one-to-many relationship like traditional hierarchical model many-to-many relationship like navigational network model thus relational model express hierarchical navigational models well native tabular model allowing pure combined modeling terms three models application requires instance common use database system track information users name login information various addresses phone numbers navigational approach data would placed single record unused items would simply placed database relational approach data would normalized user table address table phone number table instance records would created optional tables address phone numbers actually provided linking information back together key system relational model bit information used key uniquely defining particular record information collected user information stored optional tables would found searching key instance login name user unique addresses phone numbers user would recorded login name key simple re-linking related data back single collection something traditional computer languages designed navigational approach would require programs loop order collect records relational approach would require loops collect information one record codd suggestions set-oriented language would later spawn ubiquitous sql using branch mathematics known tuple calculus demonstrated system could support operations normal databases inserting updating etc well providing simple system finding returning sets data single operation codd paper picked two people berkeley eugene wong michael stonebraker started project known ingres using funding already allocated geographical database project student programmers produce code beginning 1973 ingres delivered first test products generally ready widespread use 1979 ingres similar system r number ways including use language data access known quel time ingres moved emerging sql standard ibm one test implementation relational model prtv production one business system 12 discontinued honeywell wrote mrds multics two new implementations alphora dataphor rel dbms implementations usually called relational actually sql dbmss 1970 university michigan began development micro information management system based d.l childs set-theoretic data model micro used manage large data sets us department labor u.s. environmental protection agency researchers university alberta university michigan wayne state university ran ibm mainframe computers using michigan terminal system system remained production 1998 1970s 1980s attempts made build database systems integrated hardware software underlying philosophy integration would provide higher performance lower cost examples ibm system/38 early offering teradata britton lee inc. database machine another approach hardware support database management icl cafs accelerator hardware disk controller programmable search capabilities long term efforts generally unsuccessful specialized database machines could keep pace rapid development progress general-purpose computers thus database systems nowadays software systems running general-purpose hardware using general-purpose computer data storage however idea still pursued certain applications companies like netezza oracle exadata ibm started working prototype system loosely based codd concepts system r early 1970s first version ready 1974/5 work started multi-table systems data could split data record optional stored single large chunk subsequent multi-user versions tested customers 1978 1979 time standardized query language \u2013 sql \u2013 added codd ideas establishing workable superior codasyl pushing ibm develop true production version system r known sql/ds later database 2 db2 larry ellison oracle database simply oracle started different chain based ibm papers system r. though oracle v1 implementations completed 1978 n't oracle version 2 ellison beat ibm market 1979 stonebraker went apply lessons ingres develop new database postgres known postgresql postgresql often used global mission critical applications .org .info domain name registries use primary data store many large companies financial institutions sweden codd paper also read mimer sql developed mid-1970s uppsala university 1984 project consolidated independent enterprise another data model entity\u2013relationship model emerged 1976 gained popularity database design emphasized familiar description earlier relational model later entity\u2013relationship constructs retrofitted data modeling construct relational model difference two become irrelevant 1980s ushered age desktop computing new computers empowered users spreadsheets like lotus 1-2-3 database software like dbase dbase product lightweight easy computer user understand box c. wayne ratliff creator dbase stated dbase different programs like basic c fortran cobol lot dirty work already done data manipulation done dbase instead user user concentrate rather mess dirty details opening reading closing files managing space allocation dbase one top selling software titles 1980s early 1990s 1990s along rise object-oriented programming saw growth data various databases handled programmers designers began treat data databases objects say person data database person attributes address phone number age considered belong person instead extraneous data allows relations data relations objects attributes individual fields term object-relational impedance mismatch described inconvenience translating programmed objects database tables object databases object-relational databases attempt solve problem providing object-oriented language sometimes extensions sql programmers use alternative purely relational sql programming side libraries known object-relational mappings orms attempt solve problem xml databases type structured document-oriented database allows querying based xml document attributes xml databases mostly used applications data conveniently viewed collection documents structure vary flexible highly rigid examples include scientific articles patents tax filings personnel records nosql databases often fast require fixed table schemas avoid join operations storing denormalized data designed scale horizontally recent years strong demand massively distributed databases high partition tolerance according cap theorem impossible distributed system simultaneously provide consistency availability partition tolerance guarantees distributed system satisfy two guarantees time three reason many nosql databases using called eventual consistency provide availability partition tolerance guarantees reduced level data consistency newsql class modern relational databases aims provide scalable performance nosql systems online transaction processing read-write workloads still using sql maintaining acid guarantees traditional database system databases used support internal operations organizations underpin online interactions customers suppliers see enterprise software databases used hold administrative information specialized data engineering data economic models examples include computerized library systems flight reservation systems computerized parts inventory systems many content management systems store websites collections webpages database one way classify databases involves type contents example bibliographic document-text statistical multimedia objects another way application area example accounting music compositions movies banking manufacturing insurance third way technical aspect database structure interface type section lists adjectives used characterize different kinds databases connolly begg define database management system dbms software system enables users define create maintain control access database dbms acronym sometime extended indicated underlying database model rdbms relational oodbms ordbms object orientated model ordbms object-relational extensions indicate characteristic ddbms distributed database management systems functionality provided dbms vary enormously core functionality storage retrieval update data codd proposed following functions services fully-fledged general purpose dbms provide also generally expected dbms provide set utilities purposes may necessary administer database effectively including import export monitoring defragmentation analysis utilities core part dbms interacting database application interface sometimes referred database engine often dbmss configuration parameters statically dynamically tuned example maximum amount main memory server database use trend minimise amount manual configuration cases embedded databases need target zero-administration paramount large major enterprise dbmss tended increase size functionality involved thousands human years development effort lifetime early multi-user dbms typically allowed application reside computer access via terminals terminal emulation software client\u2013server architecture development application resided client desktop database server allowing processing distributed evolved multitier architecture incorporating application servers web servers end user interface via web browser database directly connected adjacent tier general-purpose dbms provide public application programming interfaces api optionally processor database languages sql allow applications written interact database special purpose dbms may use private api specifically customised linked single application example email system performing many functions general-purpose dbms message insertion message deletion attachment handling blocklist lookup associating messages email address forth however functions limited required handle email external interaction database via application program interfaces dbms range database tool allows users execute sql queries textually graphically web site happens use database store search information programmer code interactions database sometimes referred datasource via application program interface api via database language particular api language chosen need supported dbms possible indirectly via pre-processor bridging api api aim database independent odbc commonly known example common api include jdbc ado.net database languages special-purpose languages allow one following tasks sometimes distinguished sublanguages database languages specific particular data model notable examples include database language may also incorporate features like database storage container physical materialization database comprises internal physical level database architecture also contains information needed e.g. metadata data data internal data structures reconstruct conceptual level external level internal level needed putting data permanent storage generally responsibility database engine a.k.a storage engine though typically accessed dbms underlying operating system often using operating systems file systems intermediates storage layout storage properties configuration setting extremely important efficient operation dbms thus closely maintained database administrators dbms operation always database residing several types storage e.g. memory external storage database data additional needed information possibly large amounts coded bits data typically reside storage structures look completely different way data look conceptual external levels ways attempt optimize best possible levels reconstruction needed users programs well computing additional types needed information data e.g. querying database dbmss support specifying character encoding used store data multiple encodings used database various low-level database storage structures used storage engine serialize data model written medium choice techniques indexing may used improve performance conventional storage row-oriented also column-oriented correlation databases often storage redundancy employed increase performance common example storing materialized views consist frequently needed external views query results storing views saves expensive computing time needed downsides materialized views overhead incurred updating keep synchronized original updated database data cost storage redundancy occasionally database employs storage redundancy database objects replication one copies increase data availability improve performance simultaneous multiple end-user accesses database object provide resiliency case partial failure distributed database updates replicated object need synchronized across object copies many cases entire database replicated database security deals various aspects protecting database content owners users ranges protection intentional unauthorized database uses unintentional database accesses unauthorized entities e.g. person computer program database access control deals controlling person certain computer program allowed access information database information may comprise specific database objects e.g. record types specific records data structures certain computations certain objects e.g. query types specific queries using specific access paths former e.g. using specific indexes data structures access information database access controls set special authorized database owner personnel uses dedicated protected security dbms interfaces may managed directly individual basis assignment individuals privileges groups elaborate models assignment individuals groups roles granted entitlements data security prevents unauthorized users viewing updating database using passwords users allowed access entire database subsets called subschemas example employee database contain data individual employee one group users may authorized view payroll data others allowed access work history medical data dbms provides way interactively enter update database well interrogate capability allows managing personal databases data security general deals protecting specific chunks data physically i.e. corruption destruction removal e.g. see physical security interpretation parts meaningful information e.g. looking strings bits comprise concluding specific valid credit-card numbers e.g. see data encryption change access logging records accessed attributes changed changed logging services allow forensic database audit later keeping record access occurrences changes sometimes application-level code used record changes rather leaving database monitoring set attempt detect security breaches database transactions used introduce level fault tolerance data integrity recovery crash database transaction unit work typically encapsulating number operations database e.g. reading database object writing acquiring lock etc abstraction supported database also systems transaction well defined boundaries terms program/code executions included transaction determined transaction programmer via special transaction commands acronym acid describes ideal properties database transaction atomicity consistency isolation durability database built one dbms portable another dbms i.e. dbms run however situations desirable migrate database one dbms another reasons primarily economical different dbmss may different total costs ownership tcos functional operational different dbmss may different capabilities migration involves database transformation one dbms type another transformation maintain possible database related application i.e. related application programs intact thus database conceptual external architectural levels maintained transformation may desired also aspects architecture internal level maintained complex large database migration may complicated costly one-time project factored decision migrate spite fact tools may exist help migration specific dbmss typically dbms vendor provides tools help importing databases popular dbmss designing database application next stage building database typically appropriate general-purpose dbms selected used purpose dbms provides needed user interfaces used database administrators define needed application data structures within dbms respective data model user interfaces used select needed dbms parameters like security related storage allocation parameters etc. database ready data structures needed components defined typically populated initial application data database initialization typically distinct project many cases using specialized dbms interfaces support bulk insertion making operational cases database becomes operational empty application data data accumulated operation database created initialised populated needs maintained various database parameters may need changing database may need tuned tuning better performance application data structures may changed added new related application programs may written add application functionality etc sometimes desired bring database back previous state many reasons e.g. cases database found corrupted due software error updated erroneous data achieve backup operation done occasionally continuously desired database state i.e. values data embedding database data structures kept within dedicated backup files many techniques exist effectively decided database administrator bring database back state e.g. specifying state desired point time database state files used restore state static analysis techniques software verification applied also scenario query languages particular *abstract interpretation framework extended field query languages relational databases way support sound approximation techniques semantics query languages tuned according suitable abstractions concrete domain data abstraction relational database system many interesting applications particular security purposes fine grained access control watermarking etc dbms features might include increasingly calls single system incorporates core functionalities build test deployment framework database management source control borrowing developments software industry market offerings devops database first task database designer produce conceptual data model reflects structure information held database common approach develop entity-relationship model often aid drawing tools another popular approach unified modeling language successful data model accurately reflect possible state external world modeled example people one phone number allow information captured designing good conceptual data model requires good understanding application domain typically involves asking deep questions things interest organization like customer also supplier product sold two different forms packaging product different products plane flies new york dubai via frankfurt one flight two maybe even three answers questions establish definitions terminology used entities customers products flights flight segments relationships attributes producing conceptual data model sometimes involves input business processes analysis workflow organization help establish information needed database left example help deciding whether database needs hold historic data well current data produced conceptual data model users happy next stage translate schema implements relevant data structures within database process often called logical database design output logical data model expressed form schema whereas conceptual data model theory least independent choice database technology logical data model expressed terms particular database model supported chosen dbms terms data model database model often used interchangeably article use data model design specific database database model modeling notation used express design popular database model general-purpose databases relational model precisely relational model represented sql language process creating logical database design using model uses methodical approach known normalization goal normalization ensure elementary fact recorded one place insertions updates deletions automatically maintain consistency final stage database design make decisions affect performance scalability recovery security like depend particular dbms often called physical database design output physical data model key goal stage data independence meaning decisions made performance optimization purposes invisible end-users applications two types data independence physical data independence logical data independence physical design driven mainly performance requirements requires good knowledge expected workload access patterns deep understanding features offered chosen dbms another aspect physical database design security involves defining access control database objects well defining security levels methods data database model type data model determines logical structure database fundamentally determines manner data stored organized manipulated popular example database model relational model sql approximation relational uses table-based format common logical data models databases include object-relational database combines two related structures physical data models include models include specialized models optimized particular types data database management system provides three views database data typically one conceptual logical physical internal view data number different external views allows users see database information business-related way rather technical processing viewpoint example financial department company needs payment details employees part company expenses need details employees interest human resources department thus different departments need different views company database three-level database architecture relates concept data independence one major initial driving forces relational model idea changes made certain level affect view higher level example changes internal level affect application programs written using conceptual level interfaces reduces impact making physical changes improve performance conceptual view provides level indirection internal external one hand provides common view database independent different external view structures hand abstracts away details data stored managed internal level principle every level even every external view presented different data model practice usually given dbms uses data model external conceptual levels e.g. relational model internal level hidden inside dbms depends implementation requires different level detail uses types data structure types separating external conceptual internal levels major feature relational database model implementations dominate 21st century databases database technology active research topic since 1960s academia research development groups companies example ibm research research activity includes theory development prototypes notable research topics included models atomic transaction concept related concurrency control techniques query languages query optimization methods raid database research area several dedicated academic journals example acm transactions database systems -tods data knowledge engineering -dke annual conferences e.g. acm sigmod acm pods vldb ieee icde", + "neighbors": [ + 14, + 24, + 41, + 77, + 113, + 123, + 131, + 148, + 149, + 154, + 227, + 248, + 257, + 270, + 272, + 282, + 298, + 330, + 338, + 346, + 352, + 379, + 412, + 422, + 429, + 494, + 502, + 514, + 523, + 548, + 592, + 611, + 684, + 699, + 705, + 712, + 716, + 719, + 725, + 739, + 745, + 775, + 789, + 798, + 804, + 834, + 837, + 883, + 903, + 948, + 1019, + 1032, + 1043, + 1061, + 1082, + 1090, + 1096, + 1099, + 1102, + 1121, + 1138, + 1159, + 1183, + 1185, + 1188, + 1209, + 1217, + 1219, + 1235, + 1252, + 1275, + 1310, + 1322, + 1324, + 1368, + 1372, + 1398, + 1411, + 1419, + 1465, + 1480, + 1483, + 1484, + 1500, + 1503, + 1515, + 1549, + 1569, + 1596, + 1602, + 1606, + 1608, + 1615, + 1629, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 430, + "label": 5, + "text": "Fiber_Distributed_Data_Interface:fiber distributed data interface fiber distributed data interface fddi standard data transmission local area network uses optical fiber standard underlying physical medium although also later specified use copper cable case may called cddi copper distributed data interface standardized tp-pmd twisted-pair physical medium-dependent also referred tp-ddi twisted-pair distributed data interface fddi effectively made obsolete local networks fast ethernet offered 100 mbit/s speeds much lower cost since 1998 gigabit ethernet due speed even lower cost ubiquity fddi provides 100 mbit/s optical standard data transmission local area network extend range although fddi logical topology ring-based token network use ieee 802.5 token ring protocol basis instead protocol derived ieee 802.4 token bus timed token protocol addition covering large geographical areas fddi local area networks support thousands users fddi offers dual-attached station das counter-rotating token ring topology single-attached station sas token bus passing ring topology fddi product american national standards institute x3t9.5 x3t12 conforms open systems interconnection osi model functional layering using protocols standards process started mid 1980s fddi-ii version fddi described 1989 added circuit-switched service capability network could also handle voice video signals work started connect fddi networks synchronous optical networking sonet technology fddi network contains two rings one secondary backup case primary ring fails primary ring offers 100 mbit/s capacity network requirement secondary ring backup also carry data extending capacity 200 mbit/s single ring extend maximum distance dual ring extend fddi larger maximum-frame size 4,352 bytes standard ethernet family supports maximum-frame size 1,500 bytes allowing better effective data rates cases designers normally constructed fddi rings network topology dual ring trees small number devices typically infrastructure devices routers concentrators rather host computers dual-attached rings host computers connect single-attached devices routers concentrators dual ring degenerate form simply collapses single device typically computer-room contained whole dual ring although implementations deployed fddi metropolitan area network fddi requires network topology dual ring actually passes connected device requires device remain continuously operational standard actually allows optical bypasses network engineers consider unreliable error-prone devices workstations minicomputers might come control network managers suitable connection dual ring alternative using dual-attached connection workstation obtain degree resilience dual-homed connection made simultaneously two separate devices fddi ring one connections becomes active one automatically blocked first connection fails backup link takes perceptible delay fddi data frame format pa preamble sd start delimiter fc frame control da destination address sa source address pdu protocol data unit packet data unit fcs frame check sequence checksum ed/fs end delimiter frame status internet engineering task force defined standard transmission internet protocol would protocol data unit case fddi first proposed june 1989 revised 1990 aspects protocol compatible ieee 802.2 standard logical link control example 48-bit mac addresses became popular ethernet family thus protocols address resolution protocol arp could common well fddi considered attractive campus backbone network technology early mid 1990s since existing ethernet networks offered 10 mbit/s data rates token ring networks offered 4 mbit/s 16 mbit/s rates thus relatively high-speed choice era 1994 vendors included cisco systems national semiconductor network peripherals syskonnect acquired marvell technology group 3com fddi installations largely replaced ethernet deployments fddi standards included", + "neighbors": [ + 52, + 109, + 249, + 306, + 311, + 373, + 425, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 965, + 977, + 1042, + 1116, + 1206, + 1218, + 1221, + 1232, + 1264, + 1275, + 1311, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 431, + "label": 2, + "text": "Porteus_(operating_system):porteus operating system porteus formerly slax remix portable operating system based slackware require installation run fixed removable media usb flash drive compact disc porteus available 32-bit 64-bit version porteus project started slax remix beginning 2010 started community project using zen kernel improve update slax os community agreed new name project porteus named 'portability 'proteus 'proteus greek god sea capable changing form according naming announcement porteus forum project leader commented name find name kind synonym 'flexibility portable small flexible modular features included one name porteus porteus 4.0 available seven desktop variants cinnamon kde plasma 5 lxde lxqt mate openbox xfce porteus based substantially modified optimized version linux live scripts run disk usb stick changes saved onto portable device installed hard drive porteus even installed within another system without need create new partition porteus preloaded variety software user selects installing system downloaded selecting various options menu including one four windows management systems browser features porteus uses package manager utilizing slackware porteus kiosk specialized edition porteus operating system minimalist linux distribution web-only terminals firefox google chrome chromium opera set upon installation sole application porteus kiosk provides users locked computing environment designed deployed schools offices public libraries internet caf\u00e9s business establishment provides internet access clients porteus kiosk installed cd/dvd usb flash drive hard drive bootable storage media compact flash sd/mmc memory cards prior installation system customized kiosk wizard utility allows system browser related tweaks porteus kiosk system open source available free-of-charge although number commercial services custom builds automatic updates software upgrades available version 3.7.0 porteus kiosk able run 32-bit i486 greater 64-bit x86_64 machines google chrome n't support 32-bit machines anymore developers distribution decided follow path hence release 4.0.0 porteus kiosk supports x86_64 architecture system lightweight terms size resources used default image 80 mb size custom kiosk iso depend choice added extra components adobe flash java additional fonts factors reviewing porteus 1.0 june 2011 joe zonker brockmeier wrote users 've missed kde 3.5.x treat porteus portable linux distribution offers 32-bit release trinity fork kde 3.5.x 64-bit release offers kde 4.6.4 distribution appeal everyone might interest enthusiasts live cd distributions old-school kde fans concluded ... porteus looks like nice portable linux distribution aimed expert least experienced linux users something appeal majority linux users particularly users prefer slightly larger depth available packages users nursing older hardware prefer portable distribution porteus interesting project custom live cd iso creation linux magazine wrote issue 160/2014 build portable linux distro porteus building customized linux distribution daunting proposition \u2013 unless use porteus wizard clever simple service lets create custom live cd distro fits usb stick loads ram", + "neighbors": [ + 113, + 134, + 267, + 275, + 301, + 327, + 334, + 351, + 357, + 393, + 404, + 695, + 716, + 754, + 897, + 974, + 1046, + 1049, + 1055, + 1102, + 1126, + 1138, + 1167, + 1276, + 1286, + 1361, + 1369, + 1415, + 1458, + 1524, + 1539, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 432, + "label": 3, + "text": "Senjyo:senjyo senjyo \u30bb\u30f3\u30b8\u30e7\u30fc arcade game developed 1983 tehkan known tecmo title game translates japanese 'battlefield simple gameplay involves player controlling fixed turret tank shooting oncoming alien enemies cross-hair target certain number enemies must destroyed progress next stage original arcade cabinet cocktail table game ported published sony corporation 1984 msx computers 2005 senjyo re-released exclusively xbox part tecmo classic arcade collection", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 433, + "label": 2, + "text": "Windows_10_Mobile_version_history:windows 10 mobile version history windows 10 mobile mobile operating system developed microsoft released manufacturing november 20 2015 made generally available march 17 2016 october 2017 microsoft announced would pause active development windows 10 mobile last feature update fall creators update future development windows 10 mobile limited maintenance releases security patches windows 10 mobile november update also known version 1511 codenamed threshold 2 first major update windows 10 mobile one series updates threshold codenames carries build number 10.0.10586 released public november 12 2015 update reached end service january 9 2018 windows 10 mobile anniversary update also known version 1607 codenamed redstone 1 second major update windows 10 mobile first series updates redstone codenames carries build number 10.0.14393 first preview released february 19 2016 released public august 16 2016 update reached end service release build 14393.2551 october 9 2018 windows 10 mobile creators update also known version 1703 codenamed redstone 2 third major update windows 10 mobile second series updates redstone codenames carries build number 10.0.15063 first preview released insiders august 17 2016 released public april 25 2017 update reached end service release build 15063.1868 june 11 2019 windows 10 mobile fall creators update also known version 1709 codenamed redstone 3 third major update windows 10 mobile third series updates redstone codenames carries build number 10.0.15254 despite sharing codename version number pc version windows 10 fall creators update redstone 3 update still build part redstone 2 branch first preview released insiders april 14 2017 released public october 24 2017 update set reached end service december 10 2019", + "neighbors": [ + 26, + 66, + 79, + 93, + 108, + 111, + 148, + 153, + 262, + 278, + 295, + 312, + 326, + 337, + 344, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 647, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1092, + 1098, + 1151, + 1193, + 1212, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1531, + 1533, + 1545, + 1547, + 1555, + 1561, + 1582, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 434, + "label": 2, + "text": "Disk_operating_system:disk operating system disk operating system abbreviated dos computer operating system use disk storage device floppy disk hard disk drive optical disc disk operating system must provide file system organizing reading writing files storage disk strictly speaking definition apply current generations operating systems versions microsoft windows use appropriately used older generations operating systems disk operating systems available mainframes microprocessors home computers usually loaded disks part boot process early days computers disk drives floppy disks modern flash storage devices early storage devices delay lines punched cards paper tape magnetic tape magnetic drums used instead early days microcomputers home computers paper tape audio cassette tape see kansas city standard nothing used instead latter case program data entry done front panel switches directly memory computer terminal keyboard sometimes controlled basic interpreter rom power turned information lost hard disks floppy disk drives require software manage rapid access block storage sequential data microcomputers disk drive kind optional peripheral systems could used tape drive booted without storage device disk operating system component operating system needed disk drive used dos concept began dos/360 1966 ibm system/360 mainframes home personal computers late 1970s 1980s used disk operating system often dos name simply referred dos within respective communities cbm dos commodore 8-bit systems atari dos atari 8-bit family trs-dos trs-80 apple dos apple ii ms-dos ibm pc compatibles usually disk operating system loaded disk among exceptions commodore whose dos resided rom chips disk drives lt. kernal hard disk subsystem commodore 64 commodore 128 models stored dos disk case modern systems loaded dos ram boot time british bbc micro optional disc filing system dfs offered kit disk controller chip rom chip handful logic chips installed inside computer disk operating systems operating system entire computer system", + "neighbors": [ + 1, + 9, + 22, + 37, + 58, + 64, + 85, + 99, + 134, + 170, + 171, + 187, + 322, + 365, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 870, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1188, + 1202, + 1224, + 1301, + 1304, + 1394, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1565, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 435, + "label": 2, + "text": "DirectX:directx microsoft directx collection application programming interfaces apis handling tasks related multimedia especially game programming video microsoft platforms originally names apis began direct direct3d directdraw directmusic directplay directsound forth name directx coined shorthand term apis x standing particular api names soon became name collection microsoft later set develop gaming console x used basis name xbox indicate console based directx technology x initial carried forward naming apis designed xbox xinput cross-platform audio creation tool xact directx pattern continued windows apis direct2d directwrite direct3d 3d graphics api within directx widely used development video games microsoft windows xbox line consoles direct3d also used software applications visualization graphics tasks cad/cam engineering direct3d widely publicized component directx common see names directx direct3d used interchangeably directx software development kit sdk consists runtime libraries redistributable binary form along accompanying documentation headers use coding originally runtimes installed games explicitly user windows 95 launch directx directx included windows 95 oem service release 2 windows 98 windows nt 4.0 shipped directx every version windows released since sdk available free download runtimes proprietary closed-source software source code provided sdk samples starting release windows 8 developer preview directx sdk integrated windows sdk late 1994 microsoft ready release windows 95 next operating system important factor value consumers would place programs would able run three microsoft employees\u2014craig eisler alex st. john eric engstrom\u2014were concerned programmers tended see microsoft previous operating system ms-dos better platform game programming meaning games would developed windows 95 operating system would much success compounded negative reception surrounding windows port video game lion king game used wing crashed compaq presarios came shipped following partnership compaq disney cirrus logic display drivers used presarios thoroughly tested api dos allowed direct access video cards keyboards mice sound devices parts system windows 95\u2014with protected memory model\u2014restricted access working much standardized model microsoft needed quick solution programmers operating system months away released eisler development lead st. john engstrom program manager worked together fix problem solution eventually named directx first version directx released september 1995 windows games sdk win32 replacement dci wing apis windows 3.1 directx allowed versions microsoft windows starting windows 95 incorporate high-performance multimedia eisler wrote frenzy build directx 1 5 blog directx 2.0 became component windows releases windows 95 osr2 windows nt 4.0 mid-1996 since windows 95 still new games released microsoft engaged heavy promotion directx developers generally distrustful microsoft ability build gaming platform windows alex st. john evangelist directx staged elaborate event 1996 computer game developers conference game developer jay barnson described roman theme including real lions togas something resembling indoor carnival event microsoft first introduced direct3d directplay demonstrated multiplayer mechwarrior 2 played internet directx team faced challenging task testing directx release array computer hardware software variety different graphics cards audio cards motherboards cpus input devices games multimedia applications tested beta final release directx team also built distributed tests allowed hardware industry confirm new hardware designs driver releases would compatible directx prior directx microsoft included opengl windows nt platform time opengl required high-end hardware focused engineering cad uses direct3d intended microsoft controlled alternative opengl focused initially game use 3d gaming grew opengl developed include better support programming techniques interactive multimedia applications like games giving developers choice using opengl direct3d 3d graphics api applications point battle began supporters cross-platform opengl windows-only direct3d incidentally opengl supported microsoft directx team developer chose use opengl 3d graphics api apis directx often combined opengl computer games opengl include directx functionality sound joystick support console-specific version directx used basis microsoft xbox xbox 360 xbox one console api api developed jointly microsoft nvidia developed custom graphics hardware used original xbox xbox api similar directx version 8.1 non-updateable like console technologies xbox code named directxbox shortened xbox commercial name 2002 microsoft released directx 9 support use much longer shader programs pixel vertex shader version 2.0 microsoft continued update directx suite since introducing shader model 3.0 directx 9.0c released august 2004 april 2005 directshow removed directx moved microsoft platform sdk instead directx confirmed present microsoft windows phone 8 real-time raytracing announced dxr 2018 original logo resembled deformed radiation warning symbol controversially original name directx project manhattan project reference us nuclear weapons initiative alex st. john head microsoft directx evangelism time claims connotation ultimate outcome manhattan project nuclear bombing japan intentional directx sister project xbox shares similar logo meant displace japanese videogame-makers dominance video-game industry however microsoft publicly denies account instead claiming logo merely artistic design directx composed multiple apis microsoft deprecated still supports directx components directx functionality provided form com-style objects interfaces additionally directx components managed objects built top parts directx managed direct3d xna graphics library top direct3d 9 directx 9 released 2002 windows 98 xp currently supported subsequent versions microsoft continues make changes directx 9c causing support dropped aforementioned operating systems january 2007 windows 2000 xp required also introduced shader model 2.0 containing pixel shader 2.0 vertex shader 2.0 major update directx api directx 10 ships available windows vista later previous versions windows windows xp able run directx 10-exclusive applications rather programs run windows xp system directx 10 hardware simply resort directx 9.0c code path latest available windows xp computers changes directx 10 extensive many former parts directx api deprecated latest directx sdk preserved compatibility directinput deprecated favor xinput directsound deprecated favor cross-platform audio creation tool system xact additionally lost support hardware accelerated audio since vista audio stack renders sound software cpu directplay dplay.dll also removed replaced dplayx.dll games rely dll must duplicate rename dplay.dll order achieve backwards compatibility directx windows vista contains several versions direct3d direct3d 10.1 incremental update direct3d 10.0 shipped required windows vista service pack 1 release mainly sets image quality standards graphics vendors giving developers control image quality also adds support cube map arrays separate blend modes per-mrt coverage mask export pixel shader ability run pixel shader per sample access multi-sampled depth buffers requires video card supports shader model 4.1 higher 32-bit floating-point operations direct3d 10.1 still fully supports direct3d 10 hardware order utilize new features updated hardware required microsoft unveiled directx 11 gamefest 08 event seattle major scheduled features including gpgpu support directcompute direct3d 11 tessellation support improved multi-threading support assist video game developers developing games better utilize multi-core processors direct3d 11 runs windows vista windows 7 windows 8 windows 10 parts new api multi-threaded resource handling supported direct3d 9/10/10.1-class hardware hardware tessellation shader model 5.0 require direct3d 11 supporting hardware microsoft since released direct3d 11 technical preview direct3d 11 strict superset direct3d 10.1 \u2014 hardware api features version 10.1 retained new features added necessary exposing new functionality helps keep backwards compatibility previous versions directx microsoft released final platform update windows vista october 27 2009 5 days initial release windows 7 launched direct3d 11 base standard since four updates directx 11 released directx 12 announced microsoft gdc march 20 2014 officially launched alongside windows 10 july 29 2015 primary feature highlight new release directx introduction advanced low-level programming apis direct3d 12 reduce driver overhead developers able implement command lists buffers gpu allowing efficient resource utilization parallel computation lead developer max mcmullen stated main goal direct3d 12 achieve console-level efficiency phone tablet pc release direct3d 12 comes alongside initiatives low-overhead graphics apis including amd mantle amd graphics cards apple metal ios macos khronos group cross-platform vulkan multiadapter support feature directx 12 allowing developers utilize multiple gpus system simultaneously multi-gpu support previously dependent vendor implementations amd crossfirex nvidia sli directx 12 supported fermi later nvidia gpus amd gcn-based chips intel haswell later processors graphics units siggraph 2014 intel released demo showing computer generated asteroid field directx 12 claimed 50\u201370 efficient directx 11 rendering speed cpu power consumption ashes singularity first publicly available game utilize directx 12 testing ars technica august 2015 revealed slight performance regressions directx 12 directx 11 mode nvidia geforce 980 ti whereas amd radeon r9 290x achieved consistent performance improvements 70 directx 12 scenarios amd outperformed powerful nvidia directx 12 performance discrepancies may due poor nvidia driver optimizations directx 12 even hardware limitations card optimized directx 11 serial execution however exact cause remains unclear directx 12 apis also featured xbox however directx 12 code directly portable pc xbox one due inherent differences two platforms performance improvements directx 12 xbox substantial pc march 2018 directx raytracing dxr announced capable real-time ray-tracing supported hardware dxr api added windows 10 october 2018 update 2019 microsoft announced arrival directx 12 windows 7 version number reported microsoft dxdiag tool version 4.09.0000.0900 higher use x.xx.xxxx.xxxx format version numbers however directx windows xp msdn page claims registry always x.xx.xx.xxxx format put another way table lists version 4.09.00.0904 microsoft dxdiag tool may 4.09.0000.0904 various releases windows included supported various versions directx allowing newer versions operating system continue running applications designed earlier versions directx versions gradually phased favor newer apis drivers hardware apis direct3d directsound need interact hardware device driver hardware manufacturers write drivers particular directx version device driver interface ddi test individual piece hardware make directx compatible hardware devices directx compatible drivers words one must install directx order use hardware early versions directx included up-to-date library directx compatible drivers currently available practice stopped however favor web-based windows update driver-update system allowed users download drivers relevant hardware rather entire library prior directx 10 directx runtime designed backward compatible older drivers meaning newer versions apis designed interoperate older drivers written previous version ddi application programmer query available hardware capabilities using complex system cap bits tied particular hardware feature direct3d 7 earlier would work version ddi direct3d 8 requires minimum ddi level 6 direct3d 9 requires minimum ddi level 7 however direct3d 10 runtime windows vista run older hardware drivers due significantly updated ddi requires unified feature set abandons use cap bits direct3d 10.1 introduces feature levels 10_0 10_1 allow use hardware features defined specified version direct3d api direct3d 11 adds level 11_0 10 level 9 subset direct3d 10 api designed run direct3d 9 hardware three feature levels 9_1 9_2 9_3 grouped common capabilities low med high-end video cards runtime directly uses direct3d 9 ddi provided wddm drivers feature level 11_1 introduced direct3d 11.1 2002 microsoft released version directx compatible microsoft .net framework thus allowing programmers take advantage directx functionality within .net applications using compatible languages managed c++ use c programming language api known managed directx mdx short claimed operate 98 performance underlying native directx apis december 2005 february 2006 april 2006 august 2006 microsoft released successive updates library culminating beta version called managed directx 2.0 managed directx 2.0 consolidated functionality previously scattered multiple assemblies single assembly thus simplifying dependencies software developers development version subsequently discontinued longer supported managed directx 2.0 library expired october 5 2006 gdc 2006 microsoft presented xna framework new managed version directx similar identical managed directx intended assist development games making easier integrate directx high-level shader language hlsl tools one package also supports execution managed code xbox 360 xna game studio express rtm made available december 11 2006 free download windows xp unlike directx runtime managed directx xna framework xbox 360 apis xinput xact etc shipped part windows developers expected redistribute runtime components along games applications microsoft product including latest xna releases provides directx 10 support .net framework approach directx managed languages use third-party libraries like alternatives directx family apis opengl successor vulkan metal mantle features comparable direct3d examples apis include sdl allegro openmax openml openal opencl fmod sfml etc many libraries cross-platform open codebases also alternative implementations aim provide api one wine furthermore developers reactos trying reimplement directx name reactx", + "neighbors": [ + 26, + 28, + 66, + 79, + 93, + 148, + 153, + 258, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 355, + 412, + 433, + 468, + 472, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 670, + 689, + 705, + 791, + 801, + 815, + 853, + 865, + 920, + 961, + 976, + 989, + 1025, + 1035, + 1050, + 1068, + 1092, + 1098, + 1109, + 1138, + 1149, + 1151, + 1177, + 1193, + 1212, + 1219, + 1247, + 1261, + 1287, + 1304, + 1320, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1427, + 1428, + 1461, + 1502, + 1503, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 436, + "label": 8, + "text": "URL:url uniform resource locator url colloquially termed web address reference web resource specifies location computer network mechanism retrieving url specific type uniform resource identifier uri although many people use two terms interchangeably urls occur commonly reference web pages http also used file transfer ftp email mailto database access jdbc many applications web browsers display url web page page address bar typical url could form codice_1 indicates protocol codice_2 hostname codice_3 file name codice_4 uniform resource locators defined 1994 tim berners-lee inventor world wide web uri working group internet engineering task force ietf outcome collaboration started ietf living documents birds feather session 1992 format combines pre-existing system domain names created 1985 file path syntax slashes used separate directory filenames conventions already existed server names could prefixed complete file paths preceded double slash codice_5 berners-lee later expressed regret use dots separate parts domain name within uris wishing used slashes throughout also said given colon following first component uri two slashes domain name unnecessary early 1993 draft html specification referred universal resource locators dropped time june 1994 rfc 1630 october 1994 draft-ietf-uri-url-08.txt every http url conforms syntax generic uri web browser usually dereference url performing http request specified host default port number 80 urls using codice_6 scheme require requests responses made secure connection website internet users distributed throughout world using wide variety languages alphabets expect able create urls local alphabets internationalized resource identifier iri form url includes unicode characters modern browsers support iris parts url requiring special treatment different alphabets domain name path domain name iri known internationalized domain name idn web internet software automatically convert domain name punycode usable domain name system example chinese url codice_7 becomes codice_8 codice_9 indicates character originally ascii url path name also specified user local writing system already encoded converted utf-8 characters part basic url character set escaped hexadecimal using percent-encoding example japanese url codice_10 becomes codice_11 target computer decodes address displays page protocol-relative links prl also known protocol-relative urls prurl urls protocol specified example codice_12 use protocol current page either http https", + "neighbors": [ + 14, + 16, + 144, + 169, + 297, + 352, + 376, + 425, + 540, + 582, + 604, + 678, + 684, + 751, + 769, + 780, + 1145, + 1371, + 1464, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 437, + "label": 4, + "text": "The_Snowden_Files:snowden files snowden files inside story world wanted man 2014 book luke harding published vintage books greg miller washington post described book first single-book account edward snowden 2013 leaking national security agency nsa documents however miller commented british perspective book overlooks significant u.s. developments underplays important work done journalists including barton gellman washington post greg miller concluded harding delivered clearly written captivating account snowden leaks aftermath succeeding beyond basic ambition arrive bookstores first book received positive reviews guardian london review books called super-readable thrillerish account events surrounding reporting documents michiko kakutani new york times wrote book reads like le carr\u00e9 novel crossed something kafka conversely daily telegraph david blair wrote harding story crackles verve complexity nuance banished particular real dilemmas intelligence work ignored snowden files initially criticised snowden associate journalist glenn greenwald read extracts harding book later reading whole book conceded criticise snowden february 14 2014 greenwald told financial times purporting tell inside story edward snowden written someone never met even spoken edward snowden luke came talked half day without realising trying get write book cut interview realised financial times since amended article stating harding insists spoke greenwald rio made clear research book snowden wikileaks founder snowden backer julian assange\u2014subject 2011 book coauthored luke harding david leigh assange condemned\u2014harshly criticized snowden files author calling book walloping fraud written frauds praised frauds assange stated disappointing thing snowden files exploitative existed understand pressures facing print journalism need diversify revenue order cross-subsidize investigative journalism investigative journalism involves able develop relationships trust sources snowden files along fictionalized time octopus snowden russian lawyer anatoly kucherena forms basis oliver stone film snowden 2016", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 438, + "label": 6, + "text": "GFS2:gfs2 computing global file system 2 gfs2 shared-disk file system linux computer clusters gfs2 differs distributed file systems afs coda intermezzo glusterfs gfs2 allows nodes direct concurrent access shared block storage addition gfs gfs2 also used local filesystem gfs disconnected operating-mode client server roles nodes gfs cluster function peers using gfs cluster requires hardware allow access shared storage lock manager control access storage lock manager operates separate module thus gfs gfs2 use distributed lock manager dlm cluster configurations nolock lock manager local filesystems older versions gfs also support gulm server-based lock manager implements redundancy via failover gfs gfs2 free software distributed terms gnu general public license development gfs began 1995 originally developed university minnesota professor matthew o'keefe group students originally written sgi irix operating system 1998 ported linux since open source code provided convenient development platform late 1999/early 2000 made way sistina software lived time open-source project 2001 sistina made choice make gfs proprietary product developers forked opengfs last public release gfs enhanced include updates allowing work opendlm opengfs opendlm became defunct since red hat purchased sistina december 2003 released gfs many cluster-infrastructure pieces gpl late june 2004 red hat subsequently financed development geared towards bug-fixing stabilization development gfs2 derives gfs included along distributed lock manager shared gfs linux 2.6.19 red hat enterprise linux 5.2 included gfs2 kernel module evaluation purposes 5.3 update gfs2 became part kernel package gfs forms part fedora red hat enterprise linux 5.3 upwards associated centos linux distributions users purchase commercial support run gfs fully supported top red hat enterprise linux since red hat enterprise linux version 5.3 red hat enterprise linux advanced platform included support gfs additional cost following list summarizes version numbers major features introduced design gfs gfs2 targets san-like environments although possible use single node filesystem full feature-set requires san take form iscsi fibrechannel aoe device presented linux block device shared number nodes example drbd device dlm requires ip based network communicate normally ethernet many possible solutions depending upon choice san may possible combine normal practice involves separate networks dlm storage gfs requires fencing hardware kind requirement cluster infrastructure rather gfs/gfs2 required multi-node clusters usual options include power switches remote access controllers e.g drac ipmi ilo fencing used ensure node cluster believes failed suddenly start working another node recovering journal failed node also optionally restart failed node automatically recovery complete although designers gfs/gfs2 aimed emulate local filesystem closely number differences aware due existing filesystem interfaces allowing passing information relating cluster stem difficulty implementing features efficiently clustered manner example main difference one shared similar cluster filesystems cache control mechanism known glocks pronounced gee-locks gfs/gfs2 effect across whole cluster inode filesystem two glocks associated one called iopen glock keeps track processes inode open inode glock controls cache relating inode glock four states un unlocked sh shared \u2013 read lock df deferred \u2013 read lock incompatible sh ex exclusive four modes maps directly dlm lock mode ex mode inode allowed cache data metadata might dirty i.e waiting write back filesystem sh mode inode cache data metadata must dirty df mode inode allowed cache metadata must dirty df mode used direct i/o un mode inode must cache metadata order operations change inode data metadata interfere ex lock used means certain operations create/unlink files directory writes file general restricted one node cluster course operations multiple nodes work expected due requirement flush caches frequently efficient single frequently asked question gfs/gfs2 performance performance poor email servers solution break mail spool separate directories try keep far possible node reading writing private set directories gfs gfs2 journaled file systems gfs2 supports similar set journaling modes ext3 data=writeback mode metadata journaled mode supported gfs however possible turn journaling individual data-files zero size journaled files gfs number restrictions placed upon support mmap sendfile system calls also use different on-disk format regular files also inherit-journal attribute set directory causes files sub-directories created within directory journal inherit-journal respectively flag set used instead data=journal mount option ext3 supports gfs/gfs2 gfs2 also supports data=ordered mode similar data=writeback except dirty data synced journal flush completed ensures blocks added inode content synced back disk metadata updated record new size thus prevents uninitialised blocks appearing file node failure conditions default journaling mode data=ordered match ext3 default gfs2 yet support data=journal mode unlike gfs use on-disk format regular journaled files also supports journaled inherit-journal attributes gfs2 also relaxes restrictions file may journaled attribute changed time file open also ext3 performance reasons node gfs gfs2 journal gfs journals disk extents gfs2 journals regular files number nodes may mount filesystem one time limited number available journals gfs2 adds number new features gfs summary features already mentioned boxes right page gfs2 designed upgrading gfs would simple procedure end on-disk structure remained gfs including big-endian byte ordering differences though journaling systems gfs gfs2 compatible upgrading possible means tool gfs2_convert run filesystem off-line update metadata spare blocks gfs journals used create small per_node files required gfs2 update process data remains place gfs2 meta filesystem filesystem right alternate root main filesystem although behaves like normal filesystem contents various system files used gfs2 normally users need ever look gfs2 utilities mount unmount meta filesystem required behind scenes", + "neighbors": [ + 34, + 40, + 55, + 63, + 68, + 134, + 222, + 233, + 278, + 295, + 305, + 326, + 334, + 349, + 358, + 495, + 524, + 540, + 553, + 557, + 558, + 570, + 723, + 728, + 771, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1187, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1421, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 439, + "label": 4, + "text": "Secure_by_design:secure design secure design software engineering means software designed foundation secure malicious practices taken granted care taken minimize impact anticipation security vulnerabilities security vulnerability discovered invalid user input closely related practice using good software design domain-driven design cloud native way increase security reducing risk vulnerability-opening mistakes\u2014even though design principles used originally conceived security purposes generally designs work well rely secret often secrecy reduces number attackers demotivating subset threat population logic increase complexity attacker increased attacker effort compromise target technique implies reduced inherent risks virtually infinite set threat actors techniques applied time cause secrecy methods fail mandatory proper security usually means everyone allowed know understand design secure advantage many people looking computer code improves odds flaws found sooner see linus law attackers also obtain code makes easier find vulnerabilities well also important everything works fewest privileges possible see principle least privilege example web server runs administrative user root admin privilege remove files users belong flaw program could put entire system risk whereas web server runs inside isolated environment privileges required network filesystem functions compromise system runs unless security around also flawed many things especially input distrusted secure design fault-tolerant program could even distrust internals two examples insecure design allowing buffer overflows format string vulnerabilities following c program demonstrates flaws gets function c standard library stop writing bytes codice_1 reads newline character eof typing 99 characters prompt constitutes buffer overflow allocating 100 characters codice_1 assumption almost given name user longer 99 characters n't prevent user actually typing 99 characters lead arbitrary machine code execution second flaw program tries print input passing directly codice_3 function function prints first argument replacing conversion specifications et cetera sequentially arguments call stack needed thus malicious user entered instead name program would attempt print non-existent integer value undefined behavior would occur related mistake web programming online script validate parameters example consider script fetches article taking filename read script parsed script might use following hypothetical url retrieve article dog food script input checking instead trusting filename always valid malicious user could forge url retrieve configuration files webserver depending script may expose /etc/passwd file unix-like systems contains among others user ids login names home directory paths shells see sql injection similar attack server/client architectures program side may authorised client client server may authorised server even man-in-the-middle attack could compromise communications often easiest way break security client/server system go head security mechanisms instead go around man middle attack simple example use collect details impersonate user important consider encryption hashing security mechanisms design ensure information collected potential attacker wo n't allow access another key feature client-server security design good coding practices example following known software design structure client broker help designing well-built structure solid foundation furthermore software modified future even important follows logical foundation separation client server programmer comes clearly understand dynamics program may end adding changing something add security flaw even best design always possibility better standardized design less chance occurring", + "neighbors": [ + 11, + 144, + 149, + 225, + 293, + 310, + 338, + 379, + 479, + 518, + 528, + 576, + 692, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 898, + 1039, + 1044, + 1090, + 1112, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1472, + 1535, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 440, + "label": 4, + "text": "Middlebox:middlebox middlebox network appliance computer networking device transforms inspects filters otherwise manipulates traffic purposes packet forwarding common examples middleboxes include firewalls filter unwanted malicious traffic network address translators modify packets source destination addresses dedicated middlebox hardware widely deployed enterprise networks improve network security performance however even home network routers often integrated firewall nat middlebox functionality widespread deployment middleboxes network appliances resulted challenges criticism due poor interaction higher layer protocols lixia zhang jonathan b. postel professor computer science university california los angeles coined term middlebox 1999 following examples commonly deployed middleboxes although widely deployed middleboxes generated technical challenges application development controversy regarding impact middleboxes interfere application functionality restricting preventing end host applications performing properly network address translators present challenge nat devices divide traffic destined public ip address across several receivers connections host internet host behind nat initiated host behind nat nat learns traffic connection belongs local host thus traffic coming internet destined public shared address particular port nat direct traffic appropriate host however connections initiated host internet present nat opportunity learn internal host connection belongs moreover internal host may even know public ip address announce potential clients address connect resolve issue several new protocols proposed common middlebox-induced application challenges include web proxies serving stale date content firewalls rejecting traffic desired ports one criticism middleboxes limit choice transport protocols thus placing limits application service designs middleboxes may filter drop traffic conform expected behaviors new uncommon protocols protocol extensions may filtered middleboxes conversely certain types middlebox assist protocol deployment providing translation new old protocols ipv6 example deployed public endpoints load balancers proxies forms nat backend traffic routed ipv4 ipv6 generally middleboxes considered violate end-to-end principle computer system design", + "neighbors": [ + 149, + 440, + 552, + 739 + ], + "mask": "Test" + }, + { + "node_id": 441, + "label": 1, + "text": "British_and_Irish_Legal_Information_Institute:british irish legal information institute british irish legal information institute bailii pronounced bailey provides legal information especially reports cases decided courts united kingdom generally decisions england wales ireland northern ireland scotland european union european court human rights put online partial online database british irish legislation case law law reform reports treaties legal scholarship traditionally legal information accessible law report usually written private individuals groups court judgments official reports recently historically court judgment would simply spoken publication precedents built depended record interested third parties year books recorded judgments 1268 1535 probably compiled law students people like judge sir edward coke 1572 1615 created series reports would necessarily accurate record said recorded might selective inaccurate reporting industry developed people became involved specialised particular areas law incorporated council law reporting created 1885 released copies various cases still could gaps reporting however advent internet possible access multiple databases fee online particularly westlaw lexis however freely available source yet made bailii set long hard campaign various activists including senior members society computers law then-chairman neil cameron barrister laurie west-knights qc lord saville lord justice brooke concerned lack availability court judgments ordinary court users inspired australasian legal information institute austlii lii aim provide free access publicly available legal information 2006 bailii included 5 jurisdictions fourteen databases bailii website jointly hosted institute advanced legal studies university london university college cork law school bailii uses neutral citation method quickly adopted standard citation cases different series cases bailii produces follows bailii received criticisms due restrictions imposes usage guardian editorial noted bailii done wonderful job making case law freely accessible lawyers including historic european data otherwise difficult find however also noted small charity service struggles afford host 297,000 judgments allow search engines index instances even clear whether crown judge concerned holds copyright words reproducing site forbidden organization known judgmental established scrape information bailii make indexable search engines founding members judgmental included francis irving one developers theyworkforyou judgmental shut threat legal action regarding court records libel case former bailii chairman henry brooke defended criticisms stating restrictions indexing ensure records could retroactively edited removed clerical legal reasons errors information authorized published records properly anonymized brooke went explain bailii consider taking extra step making judgments searchable using google search engines necessary order achieve primary objective making judgments courts freely available public also stated restriction redistribution protect value-added content converting suitable format making efforts prevent publication material must published much material available bailii duplicated elsewhere example legislation rulings courts supreme court bailii agreement ministry justice indemnifying legal prosecutions bailii historically received payment part contract 2010/2011 tax year bailii received part contract", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 442, + "label": 5, + "text": "Multiplexing:multiplexing telecommunications computer networks multiplexing sometimes contracted muxing method multiple analog digital signals combined one signal shared medium aim share scarce resource example telecommunications several telephone calls may carried using one wire multiplexing originated telegraphy 1870s widely applied communications telephony george owen squier credited development telephone carrier multiplexing 1910 multiplexed signal transmitted communication channel cable multiplexing divides capacity communication channel several logical channels one message signal data stream transferred reverse process known demultiplexing extracts original channels receiver end device performs multiplexing called multiplexer mux device performs reverse process called demultiplexer demux dmx inverse multiplexing imux opposite aim multiplexing namely break one data stream several streams transfer simultaneously several communication channels recreate original data stream computing i/o multiplexing also used refer concept processing multiple input/output events single event loop system calls like poll select unix multiple variable bit rate digital bit streams may transferred efficiently single fixed bandwidth channel means statistical multiplexing asynchronous mode time-domain multiplexing form time-division multiplexing digital bit streams transferred analog channel means code-division multiplexing techniques frequency-hopping spread spectrum fhss direct-sequence spread spectrum dsss wireless communications multiplexing also accomplished alternating polarization horizontal/vertical clockwise/counterclockwise adjacent channel satellite phased multi-antenna array combined multiple-input multiple-output communications mimo scheme wired communication space-division multiplexing also known space-division multiple access use separate point-to-point electrical conductors transmitted channel examples include analogue stereo audio cable one pair wires left channel another right channel multi-pair telephone cable switched star network telephone access network switched ethernet network mesh network wireless communication space-division multiplexing achieved multiple antenna elements forming phased array antenna examples multiple-input multiple-output mimo single-input multiple-output simo multiple-input single-output miso multiplexing ieee 802.11g wireless router k antennas makes principle possible communicate k multiplexed channels peak bit rate 54 mbit/s thus increasing total peak bit rate factor k different antennas would give different multi-path propagation echo signatures making possible digital signal processing techniques separate different signals techniques may also utilized space diversity improved robustness fading beamforming improved selectivity rather multiplexing frequency-division multiplexing fdm inherently analog technology fdm achieves combining several signals one medium sending signals several distinct frequency ranges single medium fdm signals electrical signals one common applications fdm traditional radio television broadcasting terrestrial mobile satellite stations cable television one cable reaches customer residential area service provider send multiple television channels signals simultaneously cable subscribers without interference receivers must tune appropriate frequency channel access desired signal variant technology called wavelength-division multiplexing wdm used optical communications time-division multiplexing tdm digital rare cases analog technology uses time instead space frequency separate different data streams tdm involves sequencing groups bits bytes individual input stream one way associated appropriate receiver done sufficiently quickly receiving devices detect circuit time used serve another logical communication path consider application requiring four terminals airport reach central computer terminal communicated 2400 baud rather acquire four individual circuits carry low-speed transmission airline installed pair multiplexers pair 9600 baud modems one dedicated analog communications circuit airport ticket desk back airline data center also installed web proxy servers e.g polipo use tdm http pipelining multiple http transactions onto tcp/ip connection carrier sense multiple access multidrop communication methods similar time-division multiplexing multiple data streams separated time medium signals separate origins instead combined single signal best viewed channel access methods rather form multiplexing td legacy multiplexing technology still providing backbone national fixed line telephony networks europe providing 2m/bit voice signalling ports narrow band telephone exchanges dms100 e1 2m/bit tdm port provides either 30 31 speech timeslots case ccitt7 signalling systems 30 voice channels customer connected q931 dass2 dpnss v5 cass signalling systems polarization-division multiplexing uses polarization electromagnetic radiation separate orthogonal channels practical use radio optical communications particularly 100 gbit/s per channel fiber optic transmission systems orbital angular momentum multiplexing relatively new experimental technique multiplexing multiple channels signals carried using electromagnetic radiation single path potentially used addition physical multiplexing methods greatly expand transmission capacity systems still early research phase small-scale laboratory demonstrations bandwidths 2.5 tbit/s single light path controversial subject academic community many claiming new method multiplexing rather special case space-division multiplexing code division multiplexing cdm code division multiple access cdma spread spectrum class techniques several channels simultaneously share frequency spectrum spectral bandwidth much higher bit rate symbol rate one form frequency hopping another direct sequence spread spectrum latter case channel transmits bits coded channel-specific sequence pulses called chips number chips per bit chips per symbol spreading factor coded transmission typically accomplished transmitting unique time-dependent series short pulses placed within chip times within larger bit time channels different code transmitted fiber radio channel medium asynchronously demultiplexed advantages conventional techniques variable bandwidth possible statistical multiplexing wide bandwidth allows poor signal-to-noise ratio according shannon-hartley theorem multi-path propagation wireless communication combated rake receivers significant application cdma global positioning system gps multiplexing technique may extended multiple access method channel access method example tdm time-division multiple access tdma statistical multiplexing carrier-sense multiple access csma multiple access method makes possible several transmitters connected physical medium share capacity multiplexing provided physical layer osi model multiple access also involves media access control protocol part data link layer transport layer osi model well tcp/ip model provides statistical multiplexing several application layer data flows to/from computer code-division multiplexing cdm technique channel transmits bits coded channel-specific sequence pulses coded transmission typically accomplished transmitting unique time-dependent series short pulses placed within chip times within larger bit time channels different code transmitted fiber asynchronously demultiplexed widely used multiple access techniques time-division multiple access tdma frequency-division multiple access fdma code-division multiplex techniques used access technology namely code-division multiple access cdma universal mobile telecommunications system umts standard third-generation 3g mobile communication identified itu earliest communication technology using electrical wires therefore sharing interest economies afforded multiplexing electric telegraph early experiments allowed two separate messages travel opposite directions simultaneously first using electric battery ends one end telephony customer telephone line typically ends remote concentrator box multiplexed along telephone lines neighborhood similar area multiplexed signal carried central switching office significantly fewer wires much distances customer line practically go likewise also true digital subscriber lines dsl fiber loop fitl common method multiplexing uses optical fiber backbone connects pots phone lines rest pstn also replaces dsl connecting directly ethernet wired home asynchronous transfer mode often communications protocol used cable tv long carried multiplexed television channels late 20th century began offering services telephone companies iptv also depends multiplexing video editing processing systems multiplexing refers process interleaving audio video one coherent data stream digital video transport stream normally feature container format may include metadata information subtitles audio video streams may variable bit rate software produces transport stream and/or container commonly called statistical multiplexer muxer demuxer software extracts otherwise makes available separate processing components stream container digital television systems several variable bit-rate data streams multiplexed together fixed bitrate transport stream means statistical multiplexing makes possible transfer several video audio channels simultaneously frequency channel together various services may involve several standard definition television sdtv programmes particularly dvb-t dvb-s2 isdb atsc-c one hdtv possibly single sdtv companion channel one 6 8 mhz-wide tv channel device accomplishes called statistical multiplexer several systems multiplexing results mpeg transport stream newer dvb standards dvb-s2 dvb-t2 capacity carry several hdtv channels one multiplex digital radio multiplex also known ensemble number radio stations grouped together multiplex stream digital information includes audio data communications satellites carry broadcast television networks radio networks known multiple channel per carrier mcpc multiplexing practical different sources using single transponder single channel per carrier mode used fm broadcasting analog radio media multiplexing term commonly given process adding subcarriers audio signal enters transmitter modulation occurs fact stereo multiplex signal generated using time-division multiplexing switching two left channel right channel input signals ultrasonic rate subcarrier filtering higher harmonics multiplexing sense sometimes known mpx turn also old term stereophonic fm seen stereo systems since 1960s spectroscopy term used indicate experiment performed mixture frequencies respective response unravelled afterwards using fourier transform principle computer programming may refer using single in-memory resource file handle handle multiple external resources on-disk files electrical multiplexing techniques require physical multiplexer device refer keyboard matrix charlieplexing design style high-throughput dna sequencing term used indicate artificial sequences often called barcodes indexes added link given sequence reads given sample thus allow sequencing multiple samples reaction", + "neighbors": [ + 14, + 162, + 166, + 257, + 359, + 596, + 678, + 1116, + 1200, + 1408, + 1455, + 1510, + 1530, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 443, + "label": 2, + "text": "UNIX_System_V:unix system v unix system v pronounced system five one first commercial versions unix operating system originally developed first released 1983 four major versions system v released numbered 1 2 3 4 system v release 4 svr4 commercially successful version result effort marketed unix system unification solicited collaboration major unix vendors source several common commercial unix features system v sometimes abbreviated sysv unix market divided five system v variants ibm aix hewlett-packard hp-ux oracle solaris xinuos unixware illumos distributions open-source opensolaris continuation system v successor 1982 unix system iii developed sold hardware ran system v customers ran version reseller based reference implementation standards document called system v interface definition outlined default features behavior implementations formative years computer business division went several phases system v software groups beginning unix support group usg followed unix system development laboratory usdl followed information systems attis finally unix system laboratories usl 1980s early-1990s unix system v berkeley software distribution bsd two major version unix historically bsd also commonly called bsd unix berkeley unix eric s. raymond summarizes longstanding relationship rivalry system v bsd early period hp ibm others chose system v basis unix offerings vendors sun microsystems dec extended bsd throughout development though system v infused features bsd bsd variants dec ultrix received system v features sun microsystems worked together merge system v bsd-based sunos produce solaris one primary system v descendants still use today since early 1990s due standardization efforts posix commercial success linux division system v bsd become less important system v known inside bell labs unix 5.0 succeeded previous commercial unix called system iii january 1983 unix 4.0 never released externally would designated system iv first release system v called system v.0 system v release 1 svr1 developed unix support group usg based bell labs internal usg unix 5.0 system v also included features vi editor curses 4.1 bsd developed university california berkeley also improved performance adding buffer inode caches also added support inter-process communication using messages semaphores shared memory developed earlier bell-internal cb unix svr1 ran dec pdp-11 vax minicomputers unix support group usg transformed unix system development laboratory usdl released system v release 2 1984 svr2 added shell functions svid svr2.4 added demand paging copy-on-write shared memory record file locking concept porting base formalized dec vax-11/780 chosen release porting base so-called original version release porting efforts machines emanate educational source licenses svr2 offered us 800 first cpu 400 additional cpu commercial source license offered 43,000 three months support 16,000 price per additional cpu apple computer a/ux operating system initially based release sco xenix also used svr2 basis first release hp-ux also svr2 derivative maurice j. bach book design unix operating system definitive description svr2 kernel unix system development laboratory usdl succeeded information systems attis distributed unix system v release 3 1987 svr3 included streams remote file sharing rfs file system switch fss virtual file system mechanism restricted form shared libraries transport layer interface tli network api final version release 3.2 1988 added binary compatibility xenix intel platforms see intel binary compatibility standard user interface improvements included layers windowing system dmd 5620 graphics terminal svr3.2 curses libraries offered eight color pairs time important features forms panels menus etc. 3b2 became official porting base sco unix based upon svr3.2 isc 386/ix among obscure distributions svr3.2 386 esix 3.2 everex system v release 3.2 sold intel two shipped plain vanilla codebase ibm aix operating system svr3 derivative system v release 4.0 announced october 18 1988 incorporated variety commercial unix products early 1989 onwards joint project unix system laboratories sun microsystems combined technology new features included many companies licensed svr4 bundled computer systems workstations network servers svr4 systems vendors included atari atari system v commodore amiga unix data general dg/ux fujitsu uxp/ds hitachi hi-ux hewlett-packard hp-ux ncr unix/ns nec ews-ux up-ux ux/4800 super-ux oki oki system v pyramid technology dc/osx sgi irix siemens sinix sony news-os sumitomo electric industries seiux sun microsystems solaris illumos 2010s open-source platform software porting houses also sold enhanced supported intel x86 versions svr4 software vendors included dell dell unix everex esix micro station technology svr4 microport svr4 uhc svr4 primary platforms svr4 intel x86 sparc sparc version called solaris 2 internally sunos 5.x developed sun relationship sun terminated release svr4 meaning later versions solaris inherit features later svr4.x releases sun would 2005 release source code solaris 10 sunos 5.10 open-source opensolaris project creating forks open-source albeit heavily modified system v implementation available oracle took sun solaris forked proprietary release illumos continuation project developed open-source consortium intel-based resellers including unisys icl ncr corporation olivetti developed svr4.0mp multiprocessing capability allowing system calls processed processor interrupt servicing master processor release 4.1 es enhanced security added security features required orange book b2 compliance access control lists support dynamic loading kernel modules 1992 usl engaged joint venture novell called univel year saw release system v.4.2 univel unixware featuring veritas file system vendors included uhc consensys release 4.2mp completed late 1993 added support multiprocessing released unixware 2 1995 eric s. raymond warned prospective buyers svr4.2 versions often include on-line man pages 1994 buyers guide attributes change policy unix system laboratories santa cruz operation sco owners xenix eventually acquired unixware trademark distribution rights system v release 4.2 codebase novell vendors sun ibm hp continued use extend system v release 4 novell transferred ownership unix trademark open group operating system meets single unix specification sus effectively successor system v interface definition may granted unix rights sus met apple macos bsd derivative well several operating systems derived either bsd system v. system v release 5 developed 1997 santa cruz operation sco merger sco openserver svr3-derivative unixware focus large-scale servers released sco unixware 7 sco successor sco group also based sco openserver 6 svr5 codebase used major developer reseller system v release 6 announced sco released end 2004 apparently cancelled supposed support 64-bit systems industry coalesced around open group single unix specification version 3 unix 03 see also smallfoot 1980s 1990s variety svr4 versions unix available commercially x86 pc platform however market commercial unix pcs declined linux bsd became widely available late 1994 eric s. raymond discontinued pc-clone unix software buyer guide usenet stating reason dropping run linux longer find svr4 market interesting significant 1998 confidential memo microsoft stated linux track eventually x86 unix market predicted believe linux \u2013 moreso nt \u2013 biggest threat sco near future infoworld article 2001 characterized sco unixware bleak outlook due trounced market linux solaris idc predicted sco would continue see shrinking share market project monterey started 1998 combine major features existing commercial unix platforms joint project compaq ibm intel sco sequent computer systems target platform meant intel new ia-64 architecture itanium line processors however project abruptly canceled 2001 little progress 2001 several major unix variants sco unixware compaq tru64 unix sgi irix decline three major unix versions well market ibm aix hewlett-packard hp-ux sun solaris 2006 sgi declared bankruptcy analysts questioned whether linux would replace proprietary unix altogether 2006 article written computerworld mark hall economics linux cited major factor driving migration unix linux article also cites trends high-performance computing applications evidence dramatic shift unix linux november 2015 survey top 500 supercomputers unix used 1.2 running ibm aix linux used 98.8 survey november 2017 reports 100 using linux system v derivatives continued deployed proprietary server platforms principal variants system v remain commercial use aix ibm solaris oracle hp-ux hp according study done idc 2012 worldwide unix market divided ibm 56 oracle 19.2 hp 18.6 commercial unix vendor 2 market industry analysts generally characterize proprietary unix entered period slow permanent decline opensolaris derivatives svr4 descendants open-source software core system software continues developed illumos used illumos distributions smartos openindiana others system v interprocess communication mechanisms available unix-like operating systems derived system v particular linux reimplementation unix well bsd derivative freebsd posix 2008 specifies replacement interfaces freebsd maintains binary compatibility layer coff format allows freebsd execute binaries compiled svr3.2 derivatives sco unix interactive unix modern system v linux bsd platforms use elf file format natively compiled binaries", + "neighbors": [ + 63, + 106, + 134, + 195, + 210, + 211, + 227, + 278, + 306, + 322, + 380, + 445, + 475, + 477, + 491, + 595, + 723, + 755, + 770, + 776, + 901, + 954, + 957, + 1002, + 1049, + 1074, + 1138, + 1143, + 1187, + 1196, + 1202, + 1234, + 1287, + 1301, + 1304, + 1421, + 1578, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 444, + "label": 5, + "text": "Dynamic_Host_Configuration_Protocol:dynamic host configuration protocol dynamic host configuration protocol dhcp network management protocol used udp/ip networks whereby dhcp server dynamically assigns ip address network configuration parameters device network communicate ip networks dhcp server enables computers request ip addresses networking parameters automatically internet service provider isp reducing need network administrator user manually assign ip addresses network devices absence dhcp server computer device network needs manually assigned ip address assign apipa address enable communicate outside local subnet dhcp implemented networks ranging size home networks large campus networks regional internet service provider networks router residential gateway enabled act dhcp server residential network routers receive globally unique ip address within isp network within local network dhcp server assigns local ip address device connected network 1984 reverse address resolution protocol rarp defined rfc 903 introduced allow simple devices diskless workstations dynamically obtain suitable ip address however acted data link layer made implementation difficult many server platforms also required server present individual network link rarp superseded bootstrap protocol bootp defined rfc 951 september 1985 introduced concept relay agent allowed forwarding bootp packets across networks allowing one central bootp server serve hosts many ip subnets dhcp based bootp dynamically allocate ip addresses pool reclaim longer use also used deliver wide range extra configuration parameters ip clients including platform-specific parameters dhcp first defined rfc 1531 october 1993 due errors editorial process almost immediately reissued rfc 1541 four years later dhcpinform message type small changes added rfc 2131 remains standard ipv4 networks dhcpv6 initially described rfc 3315 2003 updated many subsequent rfcs rfc 3633 added dhcpv6 mechanism prefix delegation stateless address autoconfiguration added rfc 3736 udp/ip defines devices one network communicate devices another network dhcp server manage udp/ip settings devices network automatically dynamically assigning ip addresses devices dhcp operates based client\u2013server model computer device connects network dhcp client software sends dhcp broadcast query requesting necessary information dhcp server network may service request dhcp server manages pool ip addresses information client configuration parameters default gateway domain name name servers time servers receiving dhcp request dhcp server may respond specific information client previously configured administrator specific address information valid entire network time period allocation lease valid dhcp client typically queries information immediately booting periodically thereafter expiration information dhcp client refreshes assignment initially requests parameter values dhcp server may assign new address based assignment policies set administrators large networks consist multiple links single dhcp server may service entire network aided dhcp relay agents located interconnecting routers agents relay messages dhcp clients dhcp servers located different subnets depending implementation dhcp server may three methods allocating ip addresses dhcp used internet protocol version 4 ipv4 ipv6 versions serve purpose details protocol ipv4 ipv6 differ sufficiently may considered separate protocols ipv6 operation devices may alternatively use stateless address autoconfiguration ipv6 hosts may also use link-local addressing achieve operations restricted local network link dhcp employs connectionless service model using user datagram protocol udp implemented two udp port numbers operations bootstrap protocol bootp udp port number 67 destination port server udp port number 68 used client dhcp operations fall four phases server discovery ip lease offer ip lease request ip lease acknowledgement stages often abbreviated dora discovery offer request acknowledgement dhcp operation begins clients broadcasting request client server different subnets dhcp helper dhcp relay agent may used clients requesting renewal existing lease may communicate directly via udp unicast since client already established ip address point additionally broadcast flag 1 bit 2 byte flags field bits reserved set 0 client use indicate way broadcast unicast receive dhcpoffer 0x8000 broadcast 0x0000 unicast usually dhcpoffer sent unicast hosts accept unicast packets ip addresses configured flag used work around issue dhcp client broadcasts dhcpdiscover message network subnet using destination address 255.255.255.255 limited broadcast specific subnet broadcast address directed broadcast dhcp client may also request last known ip address client remains connected network server may grant request otherwise depends whether server set authoritative authoritative server denies request causing client issue new request non-authoritative server simply ignores request leading implementation-dependent timeout client expire request ask new ip address example htype set 1 specify medium used ethernet hlen set 6 ethernet address mac address 6 octets long chaddr set mac address used client options set well dhcp server receives dhcpdiscover message client ip address lease request dhcp server reserves ip address client makes lease offer sending dhcpoffer message client message contains client client id traditionally mac address ip address server offering subnet mask lease duration ip address dhcp server making offer dhcp server may also take notice hardware-level mac address underlying transport layer according current rfcs transport layer mac address may used client id provided dhcp packet dhcp server determines configuration based client hardware address specified chaddr client hardware address field server 192.168.1.1 specifies client ip address yiaddr ip address field response dhcp offer client replies dhcprequest message broadcast server requesting offered address client receive dhcp offers multiple servers accept one dhcp offer based required server identification option request broadcast messaging servers informed whose offer client accepted dhcp servers receive message withdraw offers made client return offered ip address pool available addresses dhcp server receives dhcprequest message client configuration process enters final phase acknowledgement phase involves sending dhcpack packet client packet includes lease duration configuration information client might requested point ip configuration process completed protocol expects dhcp client configure network interface negotiated parameters client obtains ip address probe newly received address e.g arp address resolution protocol prevent address conflicts caused overlapping address pools dhcp servers dhcp client may request information server sent original dhcpoffer client may also request repeat data particular application example browsers use dhcp inform obtain web proxy settings via client sends request dhcp server release dhcp information client deactivates ip address client devices usually know users may unplug network protocol mandate sending dhcp release dhcp server provide optional configuration parameters client rfc 2132 describes available dhcp options defined internet assigned numbers authority iana dhcp bootp parameters dhcp client select manipulate overwrite parameters provided dhcp server unix-like systems client-level refinement typically takes place according values configuration file /etc/dhclient.conf options octet strings varying length first octet option code second octet number following octets remaining octets code dependent example dhcp message-type option offer would appear 0x35 0x01 0x02 0x35 code 53 dhcp message type 0x01 means one octet follows 0x02 value offer following tables list available dhcp options listed rfc 2132 iana registry option exists identify vendor functionality dhcp client information variable-length string characters octets meaning specified vendor dhcp client one method dhcp client utilize communicate server using certain type hardware firmware set value dhcp requests called vendor class identifier vci option 60 method allows dhcp server differentiate two kinds client machines process requests two types modems appropriately types set-top boxes also set vci option 60 inform dhcp server hardware type functionality device value option set gives dhcp server hint required extra information client needs dhcp response relay agent information option option 82 specifies container attaching sub-options dhcp requests transmitted dhcp relay dhcp server small networks one ip subnet managed dhcp clients communicate directly dhcp servers however dhcp servers also provide ip addresses multiple subnets case dhcp client yet acquired ip address communicate directly dhcp server using ip routing routable ip address know link layer address router know ip address dhcp server order allow dhcp clients subnets directly served dhcp servers communicate dhcp servers dhcp relay agents installed subnets dhcp client broadcasts local link relay agent receives broadcast transmits one dhcp servers using unicast relay agent stores ip address field giaddr field dhcp packet dhcp server uses giaddr-value determine subnet relay agent received broadcast allocates ip address subnet dhcp server replies client sends reply giaddr-address using unicast relay agent retransmits response local network situation communication relay agent dhcp server typically uses source destination udp port 67 dhcp ensures reliability several ways periodic renewal rebinding failover dhcp clients allocated leases last period time clients begin attempt renew leases half lease interval expired sending unicast dhcprequest message dhcp server granted original lease server unreachable fail respond dhcprequest however case client repeats dhcprequest time time dhcp server comes back becomes reachable dhcp client succeed contacting renew lease dhcp server unreachable extended period time dhcp client attempt rebind broadcasting dhcprequest rather unicasting broadcast dhcprequest message reach available dhcp servers dhcp server able renew lease time order rebinding work client successfully contacts backup dhcp server server must accurate information client binding maintaining accurate binding information two servers complicated problem servers able update lease database must mechanism avoid conflicts updates independent servers proposal implementing fault-tolerant dhcp servers submitted internet engineering task force never formalized rebinding fails lease eventually expire lease expires client must stop using ip address granted lease time restart dhcp process beginning broadcasting codice_1 message since lease expired accept ip address offered new ip address presumably different dhcp server able use network however since ip address changed ongoing connections broken 2018 dhcp remains widely-used automatically assign ip addresses newer iterations assigning ip addresses include dhcpv6 slaac base dhcp include mechanism authentication vulnerable variety attacks attacks fall three main categories client way validate identity dhcp server unauthorized dhcp servers commonly called rogue dhcp operated networks providing incorrect information dhcp clients serve either denial-of-service attack preventing client gaining access network connectivity man-in-the-middle attack dhcp server provides dhcp client server ip addresses ip address one dns servers attacker convince dhcp client dns lookups dns server therefore provide answers dns queries client turn allows attacker redirect network traffic allowing eavesdrop connections client network servers contacts simply replace network servers dhcp server secure mechanism authenticating client clients gain unauthorized access ip addresses presenting credentials client identifiers belong dhcp clients also allows dhcp clients exhaust dhcp server store ip addresses\u2014by presenting new credentials time asks address client consume available ip addresses particular network link preventing dhcp clients getting service dhcp provide mechanisms mitigating problems relay agent information option protocol extension rfc 3046 usually referred industry actual number option 82 allows network operators attach tags dhcp messages messages arrive network operator trusted network tag used authorization token control client access network resources client access network upstream relay agent lack authentication prevent dhcp server operator relying authorization token another extension authentication dhcp messages rfc 3118 provides mechanism authenticating dhcp messages 2002 nowiki rfc 3118 /nowiki seen widespread adoption problems managing keys large numbers dhcp clients 2007 book dsl technologies remarked numerous security vulnerabilities identified security measures proposed rfc 3118 fact combined introduction 802.1x slowed deployment take-rate authenticated dhcp never widely deployed 2010 book notes implementations dhcp authentication challenges key management processing delays due hash computation deemed heavy price pay perceived benefits architectural proposals 2008 involve authenticating dhcp requests using 802.1x pana transport eap ietf proposal made including eap dhcp so-called eapodhcp appear progressed beyond ietf draft level last dates 2010", + "neighbors": [ + 14, + 52, + 109, + 217, + 276, + 311, + 330, + 364, + 413, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 678, + 684, + 692, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 833, + 856, + 977, + 1042, + 1116, + 1144, + 1206, + 1218, + 1241, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1462, + 1517, + 1538, + 1552, + 1553, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 445, + "label": 3, + "text": "Clipper_architecture:clipper architecture clipper architecture 32-bit risc-like instruction set architecture designed fairchild semiconductor architecture never enjoyed much market success computer manufacturers create major product lines using clipper processors intergraph high level hardware first processors using clipper architecture designed sold fairchild division responsible subsequently sold intergraph 1987 intergraph continued work clipper processors use systems clipper architecture used simplified instruction set compared earlier cisc architectures incorporate complicated instructions present contemporary risc processors instructions implemented so-called macro instruction rom within clipper cpu scheme allowed clipper somewhat higher code density risc cpus initial clipper microprocessor produced fairchild c100 became available 1986 followed faster c300 intergraph 1988 final model clipper c400 released 1990 extensively redesigned faster added floating-point registers c400 processor combined two key architectural techniques achieve new level performance \u2014 superscalar instruction dispatch superpipelined operation many processors time used either superscalar instruction dispatch superpipelined operation clipper c400 first processor use intergraph started work subsequent clipper processor design known c5 never completed released nonetheless advanced processor design techniques devised c5 intergraph granted patents patents along original clipper patents basis patent-infringement lawsuits intergraph intel companies unlike many microprocessors clipper processors actually sets several distinct chips c100 c300 consist three chips one central processing unit containing integer unit floating point unit two cache memory management units cammus one responsible data one instructions cammus contained caches translation lookaside buffers support memory protection virtual memory c400 consists four basic units integer cpu fpu mmu cache unit initial version used one chip cpu fpu discrete elements mmu cache unit later versions mmu cache unit combined one cammu chip clipper 16 integer registers r15 used stack pointer 16 floating-point registers limited 8 early implementations plus program counter pc processor status word psw containing alu fpu status flags trap enables system status word ssw containing external interrupt enable user/supervisor mode address translation control bits user supervisor mode separate banks integer registers interrupt handling consisted saving pc psw ssw stack clearing psw loading pc ssw memory trap vector clipper load/store architecture arithmetic operations could specify register immediate operands basic instruction parcel 16 bits 8 bits opcode 4 bits source register 4 bits destination register immediate-operand forms allowed 1 2 following instruction parcels specify 16-bit sign-extended 32-bit immediate operand processor uniformly little-endian including immediate operands special quick encoding 4-bit unsigned operand provided add subtract load move quick register move complement quick register addressing modes load/store branch instructions follows displacements sign-extended addition usual logical arithmetic operations processor supported complex macro instructions allowed instructions allowed arbitrary stack pointer register specified except user register save/restore multiple-register operations could use r15 intergraph sold several generations clipper systems including servers workstations systems included interact interserve interpro product lines targeted largely cad market fairchild promoted clix operating system version unix system v use clipper intergraph adopted clix clipper-based systems continued develop operating system available systems intergraph work version microsoft windows nt clipper systems publicly demonstrated effort canceled release intergraph decided discontinue clipper line began selling x86 systems windows nt instead", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 108, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 443, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 803, + 821, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1143, + 1174, + 1219, + 1224, + 1256, + 1272, + 1284, + 1287, + 1290, + 1398, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 446, + "label": 9, + "text": "Gambit_(scheme_implementation):gambit scheme implementation gambit also called gambit-c programming language variant language family lisp variants named scheme gambit implementation consists scheme interpreter compiler compiles scheme language c makes cross-platform software conforms standards rrs rrs institute electrical electronics engineers ieee several scheme requests implementations srfis gambit released first 1988 gambit-c gambit c backend released first 1994 free open-source software released gnu lesser general public license lgpl 2.1 apache license 2.0 compiling intermediate representation case portable c chicken bigloo programs written gambit compiled common popular operating systems linux macos unix-like systems windows gerbil scheme variant scheme implemented gambit-c supports current r*rs standards common srfis state art macro module system inspired racket language termite scheme variant scheme implemented gambit-c. termite intended distributed computing offers simple powerful message passing model concurrency inspired erlang gambit compiler produces c code full integration support c++ objective-c compilers gnu compiler collection gcc thus software written gambit-c contain c++ objective-c code fully integrate corresponding libraries", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1372, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1511, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 447, + "label": 9, + "text": "Dylan_(programming_language):dylan programming language dylan multi-paradigm programming language includes support functional object-oriented programming oop dynamic reflective providing programming model designed support generating efficient machine code including fine-grained control dynamic static behaviors created early 1990s group led apple computer concise thorough overview language may found dylan reference manual dylan derives scheme common lisp adds integrated object system derived common lisp object system clos dylan values including numbers characters functions classes first-class objects dylan supports multiple inheritance polymorphism multiple dispatch keyword arguments object introspection pattern-based syntax extension macros many advanced features programs express fine-grained control dynamism admitting programs occupy continuum dynamic static programming supporting evolutionary development allowing rapid prototyping followed incremental refinement optimization dylan main design goal dynamic language well-suited developing commercial software dylan attempts address potential performance issues introducing natural limits full flexibility lisp systems allowing compiler clearly understand compilable units libraries dylan derives much semantics scheme lisps dylan implementations initially built within extant lisp systems however dylan algol-like syntax instead lisp-like prefix syntax dylan created early 1990s group led apple computer one time development intended use apple newton computer dylan implementation reach sufficient maturity time newton instead used mix c newtonscript developed walter smith apple ended dylan development effort 1995 though made technology release version available apple dylan tr1 included advanced integrated development environment ide two groups contributed design language developed implementations harlequin released commercial ide microsoft windows carnegie mellon university released open source compiler unix systems called gwydion dylan implementations open source harlequin implementation named open dylan maintained group volunteers dylan hackers dylan language code-named ralph james joaquin chose name dylan dynamic language many dylan syntax features come lisp heritage originally dylan used lisp-like prefix syntax based s-expressions time language design completed syntax changed algol-like syntax expectation would familiar wider audience programmers syntax designed michael kahl described great detail dylan reference manual dylan case sensitive dylan lexical syntax allows use naming convention hyphen-minus signs used connect parts multiple-word identifiers sometimes called lisp-case kebab case convention common lisp languages used programming languages treat hyphen-minus part numeric literal single lexical token even surrounded whitespace characters identifiers dylan may contain special characters languages besides alphanumeric characters hyphen-minus signs dylan allows following non-alphanumerical characters part identifiers underscore codice_1 asterisk codice_2 ampersand codice_3 less-than sign codice_4 equals sign codice_5 greater-than sign codice_6 vertical bar codice_7 caret codice_8 dollar sign codice_9 percent sign codice_10 sign codice_11 identifiers may consist non-alphanumeric characters numeric characters alone ambiguity whitespace used simple class several slots convention classes named less-than greater-than signs used angle brackets e.g class named codice_12 code example codice_13 codice_14 codice_12 optional true codice_16 clauses example may write codice_17 codice_16 terminate codice_19 statement class rewritten minimal way possible slots typed codice_20 slots must initialized manually convention constant names begin factorial function codice_21 codice_22 normal identifiers explicit return statement result method function last expression evaluated common style leave semicolon expression return position many object-oriented languages classes main means encapsulation modularity class defines namespace controls definitions externally visible classes many languages define indivisible unit must used whole example using codice_23 concatenation function requires importing compiling codice_23 languages including dylan also include separate explicit namespace module system performs encapsulation general way dylan concepts compile-unit import-unit separated classes nothing specifically either library defines items compiled handled together module defines namespace classes placed together modules cut across programmer wishes often complete definition class exist single module spread across several optionally collected together different programs different definitions class including need example consider add-on library regex support codice_23 languages functionality included strings functionality must added codice_23 namespace soon occurs codice_23 class becomes larger functions n't need use regex still must pay increased library size reason sorts add-ons typically placed namespaces objects downside approach new functions longer part codice_23 instead isolated set functions must called separately instead codice_29 would natural organization oo viewpoint something like codice_30 used effectively reverses ordering dylan many interfaces defined code instance string concatenation method could placed string interface concat interface collects together different concatenation functions various classes commonly used math libraries functions tend applicable widely differing object types practical use interface construct build public private versions module something languages include bolt feature invariably causes problems adds syntax dylan every function call simply places private development interface collect publicly accessible functions codice_31 java c++ visibility object defined code meaning support similar change programmer would forced rewrite definitions fully could two versions time classes dylan describe codice_32 data members fields ivars etc objects fashion similar oo languages access slots via methods smalltalk default getter setter methods automatically generated based slot names contrast oo languages methods applicable class often defined outside class thus class definitions dylan typically include definition storage instance define class window view end class example class codice_33 defined class name syntax convention make class names stand out\u2014the angle brackets merely part class name contrast languages convention capitalize first letter class name prefix name c example codice_33 inherits single class codice_35 contains two slots codice_36 holding string window title codice_37 holding x-y point corner window example title given default value position optional init-keyword syntax allows programmer specify initial value slot instantiating object class languages c++ java class would also define interface case definition explicit instructions languages access slots methods considered codice_38 meaning used subclasses allow unrelated code use window instances must declared codice_39 dylan sorts visibility rules considered part code module/interface system adds considerable flexibility instance one interface used early development could declare everything public whereas one used testing deployment could limit c++ java changes would require changes source code people wo n't whereas dylan fully unrelated concept although example use dylan also supports multiple inheritance dylan methods intrinsically associated specific class methods thought existing outside classes like clos dylan based multiple dispatch multimethods specific method called chosen based types arguments method need known compile time understanding required function may available based user preferences java methods would isolated specific class use functionality programmer forced import class refer explicitly call method class unavailable unknown compile time application simply wo n't compile dylan code isolated storage functions many classes methods call functions thereby looking feeling like oo languages however code may also located generic functions meaning attached specific class called natively anyone linking specific generic function method class accomplished thusly define method turn-blue w window end method definition similar languages would likely encapsulated within codice_33 class note setter call syntactic sugar codice_41 utility generic methods comes consider generic examples instance one common function languages codice_42 returns human-readable form object instance window might return title position parens string would return dylan methods could collected single module called codice_42 thereby removing code definition class specific object support codice_42 could easily added codice_42 module whole concept might strike readers odd code handle codice_42 window n't defined codice_33 might make sense consider dylan handles call codice_42 languages program compiled codice_42 codice_33 looked replaced pointer less method dylan occurs program first run runtime builds table method-name/parameters details looks methods dynamically via table means function specific method located anywhere compile-time unit end programmer given considerable flexibility terms place code collecting along class lines appropriate functional lines implication programmer add functionality existing classes defining functions separate file instance might wish add spell checking codice_51s languages would require access source code string class\u2014and basic classes rarely given source form dylan extensible languages spell checking method could added codice_52 module defining classes applied via codice_53 construct case actual functionality might defined single generic function takes string returns errors codice_52 module compiled program strings objects get added functionality apple dylan implementation dylan produced apple computer originally developed apple newton product", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 246, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 378, + 383, + 391, + 392, + 412, + 446, + 454, + 488, + 501, + 506, + 536, + 565, + 597, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 799, + 828, + 831, + 873, + 919, + 929, + 934, + 947, + 948, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1225, + 1245, + 1251, + 1277, + 1298, + 1311, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1532, + 1536, + 1588, + 1609, + 1626, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 448, + "label": 4, + "text": "Double_Image_Backup:double image backup double image backup software runs windows laptops workstations windows servers double image first released march 1994 since followed major releases double image 7.0 released january 12 2011 become compatible windows 7 windows vista windows server 2008 operating systems double image 7.0.58 released march 15 2018 included compatibility windows 10 windows 8 windows server 2016 windows server 2012 added options file synchronization using 'major delete feature double image code installation package code sign certified using sha-2 current release double image 7.0.61 released august 26 2018 features systems supported remain previous versions release several bug fixes including dealing windows 10 registry restore", + "neighbors": [ + 85, + 134, + 270, + 272, + 295, + 359, + 494, + 528, + 647, + 755, + 961, + 1138, + 1289 + ], + "mask": "Test" + }, + { + "node_id": 449, + "label": 7, + "text": "Cluster_Computing_(journal):cluster computing journal cluster computing journal networks software tools applications peer-reviewed scientific journal parallel processing distributed computing systems computer communication networks journal established 1998 2016 journal journal citation reports impact factor 2.040", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 450, + "label": 4, + "text": "Operation:_Bot_Roast:operation bot roast operation bot roast operation fbi track bot herders crackers virus coders install malicious software computers internet without owners knowledge turns computer zombie computer sends spam computers compromised computer making botnet network bot infected computers operation launched vast scale botnet resources poses threat national security operation created disrupt disassemble bot herders june 2007 fbi identified 1 million computers compromised leading arrest persons responsible creating malware process owners infected computers notified many unaware exploitation early results operation include charges following", + "neighbors": [ + 11, + 149, + 190, + 293, + 487, + 490, + 522, + 531, + 564, + 576, + 624, + 666, + 692, + 739, + 746, + 818, + 1090, + 1162, + 1309, + 1325, + 1358, + 1365, + 1379, + 1433, + 1444, + 1467, + 1543, + 1554 + ], + "mask": "Test" + }, + { + "node_id": 451, + "label": 1, + "text": "Flag_of_convenience:flag convenience flag convenience foc business practice whereby ship owners register merchant ship ship register country ship owners ship flies civil ensign country called flag state term often used pejoratively practice regarded contentious merchant ship required international law registered registry created country ship subject laws country used also ship involved case admiralty law ship owners may elect register ship foreign country enables avoid regulations owners \u2019 country may example stricter safety standards may also select jurisdiction reduce operating costs bypassing laws protect wages working conditions mariners term flag convenience used since 1950s registry nationality residency requirement ship registration often described open registry panama example offers advantages easier registration often online ability employ cheaper foreign labour furthermore foreign owners pay income taxes modern practice ships registered foreign country began 1920s united states shipowners seeking serve alcohol passengers prohibition registered ships panama owners soon began perceive advantages terms avoiding increased regulations rising labor costs continued register ships panama even prohibition ended use open registries steadily increased 1968 liberia grew surpass united kingdom world largest ship register half world merchant ships registered open registries almost 40 entire world fleet terms deadweight tonnage registered panama liberia marshall islands 2006 20 high-seas fishing vessels registered states connected according ihs markit march 2017 panama 8,052 ships registry singapore 3,574 ships liberia 3,277 ships marshall islands 3,244 ships hong kong 2,594 ships open registries criticised mainly trade union organisations based developed countries especially europe one criticism shipowners want hide ownership may select flag-of-convenience jurisdiction enables legally anonymous ships flags convenience found engaging crime offer substandard working conditions negatively impact environment primarily illegal unreported unregulated fishing shipowners may select jurisdiction measurement rules reduce certified grt size ship reduce subsequent port call dock dues consideration carnival cruise line changed flag rms empress canada 1972 panama 2011 cunard cruise line registered ships bermuda besides considerations enabled ship captains marry couples sea weddings sea described lucrative market thirteen flag states found international shipping organisations substandard regulations hand maritime industry practitioners seafarers countries contend natural product globalisation supporters practice however point economic regulatory advantages increased freedom choosing employees international labour pool ship owners developed countries use practice competitive global environment ships thirteen flags convenience targeted special enforcement countries visit ports countries called port state control international law requires every merchant ship registered country country ship registered flag state flag state gives ship right fly civil ensign ship operates laws flag state laws used ship involved admiralty case ship flag state exercises regulatory control vessel required inspect regularly certify ship equipment crew issue safety pollution prevention documents organization actually registers ship known registry registries may governmental private agencies reasons choosing open register varied include tax avoidance ability avoid national labor environmental regulations ability hire crews lower-wage countries national closed registries typically require ship owned constructed national interests least partially crewed citizens conversely open registries frequently offer on-line registration questions asked use flags convenience lowers registration maintenance costs turn reduces overall transportation costs accumulated advantages significant example 1999 28 american company sealand fleet 63 ships foreign-flagged saving company us 3.5 million per ship every year environmental disaster caused 1978 sinking flew liberian flag spurred creation new type maritime enforcement resulting strong political public outcry amoco cadiz sinking fourteen european nations signed 1982 paris memorandum understanding port state control paris mou port state control ships international trade became subject inspection states visit addition shipboard living working conditions inspections cover items concerning safety life sea prevention pollution ships cases port state inspection uncovers problems ship port state may take actions including detaining ship 2015 member states paris mou conducted 17,858 inspections deficiencies resulted 595 detained vessels 11 banned member states tokyo memorandum understanding conducted 17,269 ship inspections 2015 recording 83,606 deficiencies resulted 1,153 detentions principle genuine link ship owners flag state dates back 1958 article 5 1 geneva convention high seas also required state must effectively exercise jurisdiction control administrative technical social matters ships flying flag principle repeated article 91 1982 treaty called united nations convention law sea often referred unclos 1986 united nations conference trade development attempted solidify genuine link concept united nations convention conditions registration ships convention registration ships would require flag state linked ships either economic stake ownership ships providing mariners crew ships come force 1986 treaty requires 40 signatories whose combined tonnage exceeds 25 world total 14 countries signed treaty merchant ships used false flags tactic evade enemy warships since antiquity examples found early roman era middle ages following american revolutionary war merchantmen flying flag fledgling united states quickly found offered little protection attack barbary pirates \u2013 many responded seeking transfer registry back great britain use false flags frequently used british napoleonic wars united states war 1812 mid-19th century slave ships flew various flags avoid searched british anti-slavery fleets belen quezada august 1919 first foreign ship re-registered panamanian registry employed running illegal alcohol canada united states prohibition modern practice registering ships foreign countries gain economic advantage originated united states era world war though term flag convenience come use 1950s 1915 1922 several laws passed united states strengthen united states merchant marine provide safeguards mariners period u.s.-flagged ships became subject regular inspections undertaken american bureau shipping also time robert lafollette seamen act 1915 described magna carta sailors rights seamen act regulated mariners working hours payment established baseline requirements shipboard food also reduced penalties disobedience abolished practice imprisoning sailors offense desertion another aspect seamen act enforcement safety standards requirements lifeboats number qualified able seamen board officers seamen able speak language laws put u.s.-flagged vessels economic disadvantage countries lacking safeguards ships started re-registered panama open registry 1919 addition sidestepping seamen act panamanian-flagged ships early period paid sailors japanese wage scale much lower western merchant powers early phase world war ii transfer american-owned ships panama registry sanctioned united states government could used deliver materials britain without dragging united states neutral unintentionally war liberian open registry founded 1948 brainchild edward stettinius franklin d. roosevelt secretary state world war ii stettinius created corporate structure included liberia corporation joint-venture government liberia corporation structured one-fourth revenue would go liberian government another 10 went fund social programs liberia remainder returned stettinius corporation liberian registry created time panama registry becoming less attractive several reasons including unpopularity u.s. labor movement european shipping concerns political unrest panama increases fees regulations 11 march 1949 greek shipping magnate stavros niarchos registered first ship liberian flag world peace stettinius died 1949 ownership registry passed international bank washington led general george olmsted within 18 years liberia grew surpass united kingdom world largest register due liberia 1989 1999 civil wars registry eventually fell second panama flag convenience maritime funds continued supply 70 total government revenue civil war 1990 liberia joined republic marshall islands develop new maritime corporate program resulting company international registries formed parent company 1993 bought management taking liberian government americo-liberian warlord charles taylor signed new registry contract liberian international ship corporate registry commonly known liscr liscr one legal sources income taylor regime liberia registry operated virginia united states open registries panama liberia marshall islands accounted almost 40 entire world fleet terms deadweight tonnage year top ten flags convenience registered 55 world deadweight tonnage including 61 bulk carriers 56 oil tankers counteract class hopping 2009 iacs established transfer class agreement toca international transport workers federation itf maintains list registries considers flags convenience foc registries developing list itf considers ability willingness flag state enforce international minimum social standards vessels degree ratification enforcement ilo conventions recommendations safety environmental record list includes 35 countries panama liberia marshall islands world three largest registries terms deadweight tonnage dwt three organizations registered 11,636 ships total 39 world shipborne carrying capacity panama dominates scene 8,065 ships accounting almost 23 world dwt three marshall islands 1,265 registered ships greatest rate dwt increase 2009 increasing tonnage almost 15 bahamian flag ranks sixth worldwide behind hong kong greek registries similar size marshallese flag convenience 200 ships carrying capacity lower malta ninth position worldwide 100 ships bahamas capacity representing 4 world fleet 12 growth year eleventh position cyprus registered 1,016 ships 2009 2.6 world tonnage remaining top 11 flags convenience antigua barbuda 20 bermuda 22 saint vincent grenadines 26 french international ship register fis number 27 bermuda fis fewer 200 ships apiece large average bermudan ship average fis ship way reference average capacity ships u.s. u.k. registers respectively registries antigua barbuda saint vincent grenadines 1,000 ships average capacity respectively remaining flags convenience listed itf account less 1 world dwt half world merchant ships measured tonnage registered flags convenience number common threads found criticisms flag convenience system one flag states insufficient regulations regulations poorly enforced another many cases flag state identify shipowner much less hold owner civilly criminally responsible ship actions result lack flag state control flags convenience criticized grounds enabling tax avoidance providing environment conducting criminal activities supporting terrorism providing poor working conditions seafarers adverse effect environment david cockroft former general secretary itf says panama largest maritime register followed liberia landlocked bolivia also major registry mongolia also registers based countries example panama consulates manage documentation collect registration fees liberia registry managed company virginia bahamas city london ship beneficial owner legally financially responsible ship activities number reasons justifiable suspicious shipowners wish conceal ownership may use number strategies achieve goal jurisidictions permit actual owners may establish shell corporations legal owners ships making difficult impossible track beneficial owner ship 2004 report un secretary general consultative group flag state implementation reported easy comparatively inexpensive establish complex web corporate entities provide effective cover identities beneficial owners want known according 2003 report organisation economic co-operation development oecd report entitled ownership control ships corporate structures often multi-layered spread across numerous jurisdictions make beneficial owner almost impenetrable law enforcement officials taxation report concludes regardless reasons cloak anonymity made available provided also assist may wish remain hidden engage illegal criminal activities including terrorists oecd report concludes use bearer shares perhaps single important perhaps widely used mechanism protect anonymity ship beneficial owner physically possessing bearer share accords ownership corporation requirement reporting transfer bearer shares every jurisdiction requires serial numbers even recorded two similar techniques provide anonymity ship beneficial owner nominee shareholders nominee directors jurisdictions require shareholder identities reported loophole may exist beneficial owner may appoint nominee shareholder nominee legally compelled reveal identity beneficial owner corporations required least one director however many jurisdictions allow nominee director nominee director name would appear corporate paperwork place beneficial owners like nominee shareholders jurisdictions compel nominee director divulge identity beneficial owners hurdle jurisdictions allow corporation named director flag convenience ships long linked crime high seas example 1982 honduras shut open registry operations enabled illegal traffic kinds given honduras bad name ships registered cambodia shipping corporation csc found smuggling drugs cigarettes europe breaking iraq oil embargo engaging human trafficking prostitution europe asia response activities 2000 ahamd yahya cambodian ministry public works transport told industry publication fairplay n't know care owns ships whether 're 'white 'black business ... concern less two years later french forces seized cambodian-flagged greek-owned mv winner cocaine smuggling shortly seizure cambodian prime minister hun sen closed registry foreign ships cambodia canceled contract csc shortly thereafter north korean flag convenience also garnered significant scrutiny 2003 north korean freighter pong su reflagged tuvalu middle voyage shortly seized australian authorities smuggling heroin country year thirteen nations began monitoring vessels north korean flag illicit cargos like drugs missiles nuclear weapon fuel accompanying material ilo maritime labour convention 2006 international labour organization estimated time approximately 1,200,000 working seafarers across world document goes say working aboard ships flagged states exercise effective jurisdiction control ships seafarers often work unacceptable conditions detriment well-being health safety safety ships work international transport workers federation goes stating flags convenience provide means avoiding labor regulation country ownership become vehicle paying low wages forcing long hours work unsafe working conditions since foc ships real nationality beyond reach single national seafarers trade union also say ships low safety standards construction requirements enforce safety standards minimum social standards trade union rights seafarers frequently fail pay crews poor safety records engage practices abandoning crewmen distant ports flag convenience ships involved highest-profile oil spills history maltese-flagged bahamian-flagged marshallese-flagged deepwater horizon liberian-flagged ss torrey canyon common environmental criticism face regards illegal fishing critics flag convenience system argue many foc flag states lack resources properly monitor control vessels environmental justice foundation ejf contends illegal unreported unregulated fishing iuu vessels use flags convenience avoid fisheries regulations controls flags convenience help reduce operating costs associated illegal fishing methods help illegal operators avoid prosecution hide beneficial ownership result flags convenience perpetuate iuu fishing extensive environmental social economic impacts particularly developing countries ejf campaigning end granting flags convenience fishing vessels effective measure combat iuu fishing according franz fischler european union fisheries commissioner international regulations maritime industry promulgated agencies united nations particularly international maritime organization international labour organization flag states adopt regulations ships ratifying individual treaties one common criticism flag convenience countries allow shipowners avoid regulations ratifying important treaties failing enforce international chamber shipping ics issues annual report entitled shipping industry flag state performance table identifying six core conventions representing minimum level maritime regulation viewpoint shipowners solas marpol 66 stcw mlc clc/fund92 35 flag convenience countries listed itf ratified stcw convention concerning standards training certification watchkeeping seafarers 19 ratified six however least fourteen listed countries ratified remaining five conventions put context 60 flag states ratified six conventions including china united states america safety life sea solas load line 66 conventions focus shipboard safety issues originally developed response sinking rms titanic solas sets regulations lifeboats emergency equipment safety procedures including continuous radio watches updated include regulations ship construction fire protection systems life-saving appliances radio communications safety navigation management safe operation ships safety security concerns 66 sets standards minimum buoyancy hull stress ship fittings well establishing navigational zones extra precautions must taken international labour organization maritime labour convention 2006 provides comprehensive rights protection work seafarers including requirements minimum age qualifications hours work rest medical care complaint procedures wage payments onboard living arrangements mlc replaced number earlier ilo conventions including ilo147 marpol clc/fund92 relate pollution international convention prevention pollution ships 1973 marpol modified protocol 1978 including annexes i\u2013vi regulates pollution ships including oil air pollution shipboard sewage garbage civil liability oil pollution damage clc international fund compensation oil pollution damage fund92 together provide mechanisms ensure compensation victims oil spills 1978 number european countries agreed hague audit labour conditions board vessels vis-a-vis rules international labour organization end 1982 paris memorandum understanding port state control paris mou established setting port state control standards twenty-six european countries canada several regional memoranda understanding established based paris model including memorandum understanding port state control asia-pacific region typically referred tokyo mou organizations black sea caribbean indian ocean mediterranean latin america tokyo paris organizations generate based deficiencies detentions black- white- grey-lists flag states us coast guard handles port state control inspections us maintains similar target list underperforming flag states least thirteen thirty-five flags convenience listed itf targeted special enforcement countries paris tokyo mous u.s. coast guard united nations conference trade development 2009 report maritime trade states shipowners often register ships foreign flag order employ seafarers developing countries lower wages philippines china supply large percentage maritime labor general major flags convenience particular 2009 flag-states employing highest number expatriate-filipino seafarers panama bahamas liberia marshall islands year 150,000 filipino sailors employed four flags convenience 2006 study united states maritime administration marad sailors people republic china comprised 40 crews surveyed ships flying panamanian flag around 10 flying liberian flag marad report referred china philippines low cost crewing sources seafaring industry often divided two employment groups licensed mariners including deck officers marine engineers mariners required licenses able seamen cooks required certified latter group collectively known unlicensed mariners ratings differences wages seen groups high cost crewing sources united states low cost sources china philippines however salaries flag convenience ships still far higher median salaries non-seafarers countries addition income tax exemption seamen particularly philippines unlicensed mariners 2009 statistics american bureau labor statistics give median earnings able ordinary seamen us 35,810 varying 21,640 10th percentile 55,360 90th percentile compared 2006 statistics international labour organization giving average yearly earnings filipino chinese able seamen around 2,000 3,000 per year php9,900 per month cny3,071 per year among licensed mariners american chief engineers earned median 63,630 varying 35,030 109,310 filipino counterparts averaged 5,500 per year php21,342 per month", + "neighbors": [ + 115, + 951, + 1192 + ], + "mask": "Test" + }, + { + "node_id": 452, + "label": 5, + "text": "Jughead_(search_engine):jughead search engine jughead search engine system gopher protocol distinct veronica searches single server time jughead developed rhett jones 1993 university utah name jughead originally chosen match archie search engine jughead jones archie friend archie comics later backronym developed jonzy universal gopher hierarchy excavation display released original author gnu general public license 2006 source code modernized better run current posix systems due trademark issues modified version called jugtail made available download gnu savannah see external links", + "neighbors": [ + 14, + 83, + 107, + 580, + 623, + 668, + 713, + 886, + 939, + 1132, + 1210, + 1376, + 1423, + 1424, + 1528, + 1550 + ], + "mask": "Test" + }, + { + "node_id": 453, + "label": 0, + "text": "Shallow_parsing:shallow parsing shallow parsing also chunking light parsing analysis sentence first identifies constituent parts sentences nouns verbs adjectives etc links higher order units discrete grammatical meanings noun groups phrases verb groups etc. elementary chunking algorithms simply link constituent parts basis elementary search patterns e.g specified regular expressions approaches use machine learning techniques classifiers topic modeling etc take contextual information account thus compose chunks way better reflect semantic relations basic constituents advanced methods get around problem combinations elementary constituents different higher level meanings depending context sentence technique widely used natural language processing similar concept lexical analysis computer languages name shallow structure hypothesis also used explanation second language learners often fail parse complex sentences correctly", + "neighbors": [ + 159, + 282, + 307, + 368, + 372, + 733, + 799, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 454, + "label": 9, + "text": "Cadence_SKILL:cadence skill skill lisp dialect used scripting language pcell parameterized cells description language used many eda software suites cadence design systems originally put forth ieee paper 1990 skill originally based flavor lisp called franz lisp created uc berkeley students professor richard j. fateman skill acronym name trademark reasons cadence prefers capitalized franz lisp flavors lisp eventually superseded ansi standard common lisp historically skill known il skill library il functions name originally initialism silicon compiler interface language scil pronounced skil morphed skill plain english word easier everyone remember il interface language although skill used initially describe api rather language snappier name stuck name il remains common file extension used skill code designating code contained file lisp-2 semantics another possible file extension designating content lisp-1 semantics academic", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 454, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 455, + "label": 5, + "text": "Simple_Network_Management_Protocol:simple network management protocol simple network management protocol snmp internet standard protocol collecting organizing information managed devices ip networks modifying information change device behavior devices typically support snmp include cable modems routers switches servers workstations printers snmp widely used network management network monitoring snmp exposes management data form variables managed systems organized management information base mib describe system status configuration variables remotely queried circumstances manipulated managing applications three significant versions snmp developed deployed snmpv1 original version protocol recent versions snmpv2c snmpv3 feature improvements performance flexibility security snmp component internet protocol suite defined internet engineering task force ietf consists set standards network management including application layer protocol database schema set data objects typical uses snmp one administrative computers called managers task monitoring managing group hosts devices computer network managed system executes software component called agent reports information via snmp manager snmp-managed network consists three key components managed device network node implements snmp interface allows unidirectional read-only bidirectional read write access node-specific information managed devices exchange node-specific information nmss sometimes called network elements managed devices type device including limited routers access servers switches cable modems bridges hubs ip telephones ip video cameras computer hosts printers agent network-management software module resides managed device agent local knowledge management information translates information snmp-specific form network management station executes applications monitor control managed devices nmss provide bulk processing memory resources required network management one nmss may exist managed network snmp agents expose management data managed systems variables protocol also permits active management tasks configuration changes remote modification variables variables accessible via snmp organized hierarchies snmp define variables managed system offer rather snmp uses extensible design allows applications define hierarchies hierarchies described management information base mib mibs describe structure management data device subsystem use hierarchical namespace containing object identifiers oid oid identifies variable read set via snmp mibs use notation defined structure management information version 2.0 smiv2 subset asn.1 snmp operates application layer internet protocol suite snmp messages transported via user datagram protocol udp snmp agent receives requests udp port 161 manager may send requests available source port port 161 agent agent response sent back source port manager manager receives notifications traps informrequests port 162 agent may generate notifications available port used transport layer security datagram transport layer security requests received port 10161 notifications sent port 10162 snmpv1 specifies five core protocol data units pdus two pdus getbulkrequest informrequest added snmpv2 report pdu added snmpv3 snmp pdus constructed follows seven snmp pdu types identified pdu-type field follows snmpv1 snmpv2 use communities establish trust managers agents agents support three community names one read-only read-write trap three community strings control different types activities read-only community applies get requests read-write community string applies set requests trap community string applies receipt traps snmpv3 also uses community strings allows secure authentication communication snmp manager agent practice snmp implementations often support multiple versions typically snmpv1 snmpv2c snmpv3 snmp version 1 snmpv1 initial implementation snmp protocol design snmpv1 done 1980s group collaborators viewed officially sponsored osi/ietf/nsf national science foundation effort hems/cmis/cmip unimplementable computing platforms time well potentially unworkable snmp approved based belief interim protocol needed taking steps towards large scale deployment internet commercialization first request comments rfcs snmp known snmpv1 appeared 1988 1990 documents superseded 1991 mib-1 replaced often used snmpv1 widely used de facto network management protocol internet community snmpv1 may carried transport layer protocols user datagram protocol udp internet protocol ip osi connectionless-mode network service clns appletalk datagram delivery protocol ddp novell internetwork packet exchange ipx version 1 criticized poor security specification fact allow room custom authentication used widely used implementations support trivial authentication service identifies snmp messages authentic snmp messages. security messages therefore becomes dependent security channels messages sent example organization may consider internal network sufficiently secure encryption necessary snmp messages cases community name transmitted cleartext tends viewed de facto password spite original specification snmpv2 defined revises version 1 includes improvements areas performance security manager-to-manager communications introduced getbulkrequest alternative iterative getnextrequests retrieving large amounts management data single request new party-based security system introduced snmpv2 viewed many overly complex widely adopted version snmp reached proposed standard level maturity deemed obsolete later versions community-based simple network management protocol version 2 snmpv2c defined \u2013 snmpv2c comprises snmpv2 without controversial new snmp v2 security model using instead simple community-based security scheme snmpv1 version one relatively standards meet ietf draft standard maturity level widely considered de facto snmpv2 standard later restated part snmpv3 user-based simple network management protocol version 2 snmpv2u defined \u2013 compromise attempts offer greater security snmpv1 without incurring high complexity snmpv2 variant commercialized snmp v2* mechanism eventually adopted one two security frameworks snmp v3 snmpv2c incompatible snmpv1 two key areas message formats protocol operations snmpv2c messages use different header protocol data unit pdu formats snmpv1 messages snmpv2c also uses two protocol operations specified snmpv1 overcome incompatibility defines two snmpv1/v2c coexistence strategies proxy agents bilingual network-management systems snmpv2 agent act proxy agent behalf snmpv1 managed devices follows proxy agent maps snmpv1 trap messages snmpv2 trap messages forwards nms bilingual snmpv2 network-management systems support snmpv1 snmpv2 support dual-management environment management application bilingual nms must contact agent nms examines information stored local database determine whether agent supports snmpv1 snmpv2 based information database nms communicates agent using appropriate version snmp although snmpv3 makes changes protocol aside addition cryptographic security looks much different due new textual conventions concepts terminology visible change define secure version snmp adding security remote configuration enhancements snmp due lack security earlier versions network administrators often used means telnet ssh configuration accounting fault management snmpv3 focuses two main aspects namely security administration security aspect addressed offering strong authentication data encryption privacy administration aspect snmpv3 focuses two parts namely notification originators proxy forwarders changes also facilitated remote configuration administration snmp entities well addressing issues related large-scale deployment accounting fault management features enhancements included security one biggest weakness snmp v3 authentication snmp versions 1 2 amounts nothing password community string sent clear text manager agent snmpv3 message contains security parameters encoded octet string meaning security parameters depends security model used security approach v3 targets v3 also defines usm vacm later followed transport security model provided support snmpv3 ssh snmpv3 tls dtls snmp implementations vary across platform vendors cases snmp added feature taken seriously enough element core design major equipment vendors tend over-extend proprietary command line interface cli centric configuration control systems february 2002 carnegie mellon software engineering institute cm-sei computer emergency response team coordination center cert-cc issued advisory snmpv1 ca-2002-03 oulu university secure programming group conducted thorough analysis snmp message handling snmp implementations regardless version protocol use program code decoding protocol data units pdu thus many vendors issue patches snmp implementations among others problems found decoding snmp trap messages received snmp management station requests received snmp agent network device snmp powerful write capabilities would allow configuration network devices fully utilized many vendors partly lack security snmp versions snmpv3 partly many devices simply capable configured via individual mib object changes requirements snmp set operation easy implement correctly many vendors chose omit support set \u2013 probably lower development cost reduce code size among reasons snmp seemingly simple tree structure linear indexing may always understood well enough within internal data structures elements platform basic design consequently processing snmp queries certain data sets may result higher cpu utilization necessary one example would large routing tables bgp igp snmp values especially tabular values require specific knowledge table indexing schemes index values necessarily consistent across platforms cause correlation issues fetching information multiple devices may employ table indexing scheme example fetching disk utilization metrics specific disk identifier different across platforms modular devices may dynamically increase decrease snmp indices a.k.a instances whenever slotted hardware added removed although common hardware virtual interfaces effect index values typically assigned boot time remain fixed next reboot hardware virtual entities added device 'live may indices assigned end existing range possibly reassigned next reboot network inventory monitoring tools need device update capability properly reacting cold start trap device reboot order avoid corruption mismatch polled data index assignments snmp device instance may change poll poll mostly result changes initiated system administrator information needed particular interface imperative determine snmp index retrieving data needed generally description table like ifdescr map user friendly name like serial 0/1 blade 0 port 1 snmp index however necessarily case specific snmp value arbitrary snmp implementation snmp designed allow administrators monitor configure network devices remotely also used penetrate local area network lan snmp used network turned aside creating vulnerability consume available network bandwidth needlessly use cpu cycles significant number software tools scan entire network snmp therefore mistakes configuration read-write mode make network susceptible attacks 2001 cisco released information even read mode snmp implementation cisco ios 11.0 12.0 operating system used switches routers vulnerable certain denial service attacks security issues fixed ios upgrade configuring snmp read-only mode close attention paid configuration access control ip addresses snmp messages accepted snmp servers identified ip snmp allowed respond ips snmp messages ip addresses would denied however ip address spoofing remains security concern snmp available different versions 1 2 3 security issues snmp v1 sends passwords clear-text network therefore passwords read packet sniffing snmp v2 allows password hashing md5 configured virtually network management software support snmp v1 necessarily snmp v2 v3 snmp v2 specifically developed provide data security authentication privacy authorization snmp version 2c gained endorsement internet engineering task force ietf versions 2u 2* failed gain ietf approval due security issues snmp v3 uses md5 secure hash algorithm sha keyed algorithms offer protection unauthorised data modification masquerade attacks higher level security needed data encryption standard des optionally used cipher block chaining mode snmp v3 implemented cisco ios since release 12.0 3 t. snmpv3 may subject brute force dictionary attacks guessing authentication keys encryption keys keys generated short weak passwords passwords found dictionary snmpv3 allows providing random uniformly distributed cryptographic keys generating cryptographic keys password supplied user risk guessing authentication strings hash values transmitted network depends hash function used length hash value snmpv3 uses hmac-sha-2 authentication protocol user-based security model usm challenge-response handshake used improve security snmpv3 like snmp protocol versions stateless protocol designed minimal amount interactions agent manager thus introducing challenge-response handshake command would impose burden agent possibly network protocol designers deemed excessive unacceptable security deficiencies snmp versions mitigated ipsec authentication confidentiality mechanisms implementation snmp datagram transport layer security dtls also available snmp based network management software send passwords repeatedly normal operations across network therefore clear-text passwords significant security risk snmp v2 used network administrator enable password encryption network devices snmp servers running done command snmp-server enable traps snmp authentication md5 many snmp implementations include type automatic discovery new network component switch router discovered pooled automatically snmpv1 v2c done community string broadcast clear-text devices default configuration community strings public read-only access private read-write snmp topped list sans institute common default configuration issues number ten sans top 10 critical internet security threats year 2000 system network administrators frequently change configurations community string sent snmp network encrypted community string known outside organisation could become target attack prevent easy discovery community snmp configured pass community-name authentication failure traps snmp management device needs configured react authentication failure trap snmpv1 v2 vulnerable ip spoofing attacks whether runs tcp udp subject bypassing device access lists might implemented restrict snmp access snmpv3 security mechanisms usm tsm prevent successful attack would pointless employ snmpv3 vacm view-based access control without securing messages usm tsm", + "neighbors": [ + 52, + 109, + 120, + 254, + 276, + 311, + 425, + 430, + 444, + 463, + 470, + 483, + 528, + 542, + 543, + 598, + 672, + 684, + 732, + 741, + 757, + 758, + 762, + 764, + 769, + 770, + 771, + 779, + 833, + 1039, + 1102, + 1116, + 1138, + 1200, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 456, + "label": 3, + "text": "Princess_Tomato_in_the_Salad_Kingdom:princess tomato salad kingdom ported may 27 1988 famicom february 8 1991 nintendo entertainment system north america also released wii virtual console japan january 19 2010 north america february 8 2010 characters primarily cartoon-like anthropomorphic fruits vegetables taking role sir cucumber knight player assigned king broccoli deceased defeat evil minister pumpkin kidnapped princess tomato early sir cucumber gains sidekick percy baby persimmon offers advice helps throughout quest always refers sir cucumber boss princess tomato salad kingdom plays similarly text adventure though due nes lack keyboard accessory possible commands represented buttons line sides screen commands fixed change gameplay primarily game consists still screens exception finger wars rock paper scissors mazes occasional animated character octoberry fernbirds players issue commands game protagonist way lose able determine action required advance failing defeat end-game boss minister pumpkin game finger wars", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 457, + "label": 3, + "text": "DEC_Alpha:dec alpha alpha originally known alpha axp 64-bit reduced instruction set computing risc instruction set architecture isa developed digital equipment corporation dec designed replace 32-bit vax complex instruction set computer cisc isa alpha implemented microprocessors originally developed fabricated dec microprocessors prominently used variety dec workstations servers eventually formed basis almost mid-to-upper-scale lineup several third-party vendors also produced alpha systems including pc form factor motherboards operating systems supported alpha included openvms previously known openvms axp tru64 unix previously known dec osf/1 axp digital unix windows nt discontinued nt 4.0 pre-release windows 2000 rc1 linux debian suse gentoo red hat bsd unix netbsd openbsd freebsd 6.x plan 9 bell labs well l4ka :pistachio kernel alpha architecture sold along parts dec compaq 1998 compaq already intel customer phased alpha favor forthcoming hewlett-packard/intel itanium architecture sold alpha intellectual property intel 2001 effectively killing product hewlett-packard purchased compaq later year continuing development existing product line 2004 selling alpha-based systems largely existing customer base april 2007 alpha born earlier risc project named prism parallel reduced instruction set machine product several earlier projects prism intended flexible design supporting unix-like applications well digital existing vms programs vax minor conversion new unix-like operating system known mica would run applications natively supporting vms emulation running time development palo alto design team working unix-only workstation originally included prism however development workstation well ahead prism engineers proposed release machines using mips r2000 processor instead moving release date considerably dec management doubted need produce new computer architecture replace existing vax decstation lines eventually ended prism project 1988 time cancellation however second-generation risc chips newer sparc architecture offering much better price/performance ratios vax lineup clear third generation would completely outperform vax ways cost another study started see new risc architecture could defined could directly support vms operating system new design used basic prism concepts re-tuned allow vms vms programs run reasonable speed conversion decision also made upgrade design full 64-bit implementation prism 32-bit conversion major risc vendors undertaking eventually new architecture became alpha primary alpha instruction set architects richard l. sites richard t. witek prism epicode developed alpha palcode providing abstracted interface platform- processor implementation-specific features main contribution alpha microprocessor industry main reason performance much architecture rather implementation time microchip industry dominated automated design layout tools chip designers digital continued pursuing sophisticated manual circuit design order deal overly complex vax architecture alpha chips showed manual circuit design applied simpler cleaner architecture allowed much higher operating frequencies possible automated design systems chips caused renaissance custom circuit design within microprocessor design community originally alpha processors designated decchip 21x64 series decchip replaced mid-1990s alpha first two digits 21 signifies 21st century last two digits 64 signifies 64 bits alpha designed 64-bit start 32-bit version middle digit corresponded generation alpha architecture internally alpha processors also identified ev numbers ev officially standing extended vax alternative humorous meaning electric vlasic giving homage electric pickle experiment western research lab first generations alpha chips innovative time persistent report attributed dec insiders suggests choice axp tag processor made dec legal department still smarting vax trademark fiasco lengthy search tag axp found entirely unencumbered within computer industry joke got started acronym axp meant almost exactly prism alpha architecture intended high-performance design digital intended architecture support one-thousandfold increase performance twenty-five years ensure architectural feature impeded multiple instruction issue clock rate multiprocessing removed result alpha alpha condition codes integer instructions remove potential bottleneck condition status register instructions resulting overflow adding two numbers whose result fit 64 bits write 32 64 least significant bits destination register carry generated performing unsigned compare result either operand see result smaller either operand test true value one written least significant bit destination register indicate condition architecture defined set 32 integer registers set 32 floating-point registers addition program counter two lock registers floating-point control register fpcr also defined registers optional implemented implementation required lastly registers palcode defined integer registers denoted r0 r31 floating-point registers denoted f0 f31 r31 f31 registers hardwired zero writes registers instructions ignored digital considered using combined register file split register file determined better enabled two-chip implementations register file located chip integer-only implementations omit floating-point register file containing floating point registers split register file also determined suitable multiple instruction issue due reduced number read write ports number registers per register file also considered 32 64 contenders digital concluded 32 registers suitable required less die space improved clock frequencies number registers deemed major issue respect performance future growth thirty-two registers could support least eight-way instruction issue program counter 64-bit register contains longword-aligned virtual byte address low two bits program counter always zero pc incremented four address next instruction instruction decoded lock flag locked physical address register used load-locked store-conditional instructions multiprocessor support floating-point control register fpcr 64-bit register defined architecture intended use alpha implementations ieee 754-compliant floating-point hardware alpha architecture byte defined 8-bit datum octet word 16-bit datum longword 32-bit datum quadword 64-bit datum octaword 128-bit datum alpha architecture originally defined six data types maintain level compatibility vax 32-bit architecture preceded alpha two floating-point data types included alpha 64-bit linear virtual address space memory segmentation implementations implement smaller virtual address space minimum size 43 bits although unused bits implemented hardware tlbs architecture required implementations check whether zero ensure software compatibility implementations larger full virtual address space alpha isa fixed instruction length 32 bits six instruction formats integer operate format used integer instructions contains 6-bit opcode field followed ra field specifies register containing first operand rb field specifies register containing second operand next 3-bit field unused reserved 1-bit field contains 0 distinguished format integer literal format 7-bit function field follows used conjunction opcode specify operation last field rc field specifies register result computation written register fields 5 bits long required address 32 unique locations 32 integer registers integer literal format used integer instructions use literal one operands format integer operate format except replacement 5-bit rb field 3 bits unused space 8-bit literal field zero-extended 64-bit operand floating-point operate format used floating-point instructions similar integer operate format 11-bit function field made possible using literal unused bits reserved integer operate format memory format used mostly load store instructions 6-bit opcode field 5-bit ra field 5-bit rb field 16-bit displacement field branch instructions 6-bit opcode field 5-bit ra field 21-bit displacement field ra field specifies register tested conditional branch instruction condition met program counter updated adding contents displacement field program counter displacement field contains signed integer value integer positive branch taken program counter incremented value integer negative program counter decremented branch taken range branch thus \u00b11 mi instructions \u00b14 mib alpha architecture designed large range part architecture forward-looking goal call_pal format used codice_1 instruction used call palcode subroutines format retains opcode field replaces others 26-bit function field contains integer specifying pal subroutine control instructions consist conditional unconditional branches jumps conditional unconditional branch instructions use branch instruction format jump instructions use memory instruction format conditional branches test whether least significant bit register set clear compare register signed quadword zero branch specified condition true conditions available comparing register zero equality inequality less less equal greater equal greater new address computed longword aligning sign extending 21-bit displacement adding address instruction following conditional branch unconditional branches update program counter new address computed way conditional branches also save address instruction following unconditional branch register two instructions differ hints provided branch prediction hardware four jump instructions perform operation saving address instruction following jump providing program counter new address register differ hints provided branch prediction hardware unused displacement field used purpose integer arithmetic instructions perform addition multiplication subtraction longwords quadwords comparison quadwords instruction division architects considered implementation division hardware adverse simplicity addition standard add subtract instructions scaled versions versions shift second operand left two three bits adding subtracting multiply longword multiply quadword instructions write least significant 32 64 bits 64- 128-bit result destination register respectively since useful obtain significant half unsigned multiply quadword high umulh instruction provided umulh used implementing multi-precision arithmetic division algorithms concept separate instruction multiplication returns significant half result taken prism instructions operate longwords ignore significant half register 32-bit result sign-extended written destination register default add multiply subtract instructions exception umulh scaled versions add subtract trap overflow functionality required versions instructions perform overflow detection trap overflow provided compare instructions compare two registers register literal write 1 destination register specified condition true 0 conditions equality inequality less equal less exception instructions specify former two conditions versions perform signed unsigned compares integer arithmetic instructions use integer operate instruction formats logical instructions consist performing bitwise logical operations conditional moves integer registers bitwise logical instructions perform nand xnor xor two registers register literal conditional move instructions test register signed quadword zero move specified condition true specified conditions equality inequality less equal less greater equal greater shift instructions perform arithmetic right shift logical left right shifts shift amount given register literal logical shift instructions use integer operate instruction formats later alpha included byte-word extensions set instructions manipulate 8-bit 16-bit data types instructions first introduced 21164a ev56 microprocessor present subsequent implementations instructions performed operations previously required multiple instructions implement improved code density performance certain applications bwx also made emulation x86 machine code writing device drivers easier motion video instructions mvi instruction set extension alpha isa added instructions single instruction multiple data simd operations alpha implementations implement mvi chronological order alpha 21164pc pca56 pca57 alpha 21264 ev6 alpha 21364 ev7 unlike simd instruction sets period mips mdmx sparc visual instruction set like pa-risc multimedia acceleration extensions mvi simple instruction set composed instructions operate integer data types stored existing integer registers mvi simplicity due two reasons firstly digital determined alpha 21164 already capable performing dvd decoding software therefore requiring hardware provisions purpose inefficient mpeg-2 encoding second reason requirement retain fast cycle times implementations adding many instructions would complicated enlarged instruction decode logic reducing implementation clock frequency mvi consisted 13 instructions floating-point extensions fix extension alpha architecture introduced nine instructions floating-point square-root transferring data integer registers floating-point registers alpha 21264 ev6 first microprocessor implement instructions count extensions cix extension architecture introduced three instructions counting bits instructions categorized integer arithmetic instructions first implemented alpha 21264a ev67 time announcement alpha heralded architecture next 25 years alpha nevertheless reasonably long life first version alpha 21064 otherwise known ev4 introduced november 1992 running 192 mhz slight shrink die ev4s shrunk 0.75 \u00b5m 0.675 \u00b5m ran 200 mhz months later 64-bit processor superpipelined superscalar design like risc designs nevertheless outperformed dec touted world fastest processor careful attention circuit design hallmark hudson design team like huge centralized clock circuitry allowed run cpu higher speeds even though microarchitecture fairly similar risc chips comparison less expensive intel pentium ran 66 mhz launched following spring alpha 21164 ev5 became available 1995 processor frequencies 333 mhz july 1996 line speed bumped 500 mhz march 1998 666 mhz also 1998 alpha 21264 ev6 released 450 mhz eventually reaching 2001 21264c/ev68cb 1.25 ghz 2003 alpha 21364 ev7 marvel launched essentially ev68 core four 1.6 gb/s inter-processor communication links improved multiprocessor system performance running 1 1.15 ghz 1996 production alpha chips licensed samsung electronics company following purchase digital compaq majority alpha products placed api networks inc. previously alpha processor inc. private company funded samsung compaq october 2001 microway became exclusive sales service provider api networks alpha-based product line june 25 2001 compaq announced alpha would phased 2004 favor intel itanium canceled planned ev8 chip sold alpha intellectual property intel hp new owner compaq later year announced development alpha series would continue years including release 1.3 ghz ev7 variant called ev7z would final iteration alpha 0.13 \u00b5m ev79 also canceled alpha also implemented piranha research prototype developed compaq corporate research nonstop hardware development groups western research laboratory systems research center piranha multicore design transaction processing workloads contained eight simple cores described 27th annual international symposium computer architecture june 2000 illustrate comparative performance alpha-based systems spec performance numbers specint95 specfp95 listed note spec results claim report measured performance whole computer system cpu bus memory compiler optimizer cpu also note benchmark scale changed 1992 1995 however figures give rough impression performance alpha architecture 64-bit compared contemporary hp 64-bit intel-based offerings 32-bit perhaps obvious trend intel could always get reasonably close alpha integer performance floating point performance difference considerable side hp pa-risc also reasonably close alpha cpus running significantly lower clock rates mhz tables lack two important values power consumption price cpu first generation dec alpha-based systems comprised dec 3000 axp series workstations low-end servers dec 4000 axp series mid-range servers dec 7000 axp 10000 axp series high-end servers dec 3000 axp systems used turbochannel bus previous mips-based decstation models whereas 4000 based futurebus+ 7000/10000 shared architecture corresponding vax models dec also produced pc-like alpha workstation eisa bus decpc axp 150 codename jensen also known dec 2000 axp first alpha system support windows nt dec later produced alpha versions celebris xl digital personal workstation pc lines 21164 processors digital also produced single board computers based vmebus embedded industrial use first generation included 21068-based axpvme 64 axpvme 64lc 21066-based axpvme 160 introduced march 1 1994 later models axpvme 100 axpvme 166 axpvme 230 based 21066a processor alpha vme 4/224 alpha vme 4/288 based 21064a processor last models alpha vme 5/352 alpha vme 5/480 based 21164 processor 21066 chip used dec multia vx40/41/42 compact workstation alphabook 1 laptop tadpole technology 1994 dec launched new range alphastation alphaserver systems used 21064 21164 processors introduced pci bus vga-compatible frame buffers ps/2-style keyboards mice alphaserver 8000 series superseded dec 7000/10000 axp also employed xmi futurebus+ buses alphastation xp1000 first workstation based 21264 processor later alphaserver/station models based 21264 categorised ds departmental server es enterprise server gs global server families final 21364 chip used alphaserver es47 es80 gs1280 models alphastation es47 number oem motherboards produced dec 21066 21068-based axppci 33 noname part major push oem market company 21164-based alphapc 164 alphapc 164lx 21164pc-based alphapc 164sx alphapc 164rx 21264-based alphapc 264dp several third parties samsung api also produced oem motherboards api up1000 up2000 assist third parties developing hardware software platform dec produced evaluation boards eb64+ eb164 alpha 21064a 21164 microprocessors respectively 21164 21264 processors used netapp various network-attached storage systems 21064 21164 processors used cray t3d t3e massively parallel supercomputers fastest supercomputer based alpha processors", + "neighbors": [ + 29, + 38, + 51, + 61, + 76, + 85, + 86, + 108, + 123, + 127, + 134, + 137, + 188, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 322, + 323, + 331, + 332, + 352, + 388, + 413, + 445, + 457, + 460, + 465, + 508, + 529, + 571, + 589, + 643, + 659, + 719, + 752, + 755, + 776, + 787, + 803, + 804, + 821, + 830, + 846, + 893, + 907, + 925, + 937, + 946, + 961, + 979, + 980, + 984, + 994, + 998, + 1002, + 1009, + 1013, + 1016, + 1040, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1143, + 1158, + 1160, + 1161, + 1174, + 1193, + 1213, + 1217, + 1219, + 1232, + 1256, + 1263, + 1272, + 1284, + 1287, + 1290, + 1301, + 1346, + 1351, + 1360, + 1398, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1538, + 1557, + 1578, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 458, + "label": 4, + "text": "System_integrity:system integrity telecommunications term system integrity following meanings", + "neighbors": [ + 1138 + ], + "mask": "Validation" + }, + { + "node_id": 459, + "label": 2, + "text": "BlackBerry_World:blackberry world blackberry world previously blackberry app world application distribution service application blackberry limited majority blackberry devices service provides blackberry users environment browse download update third-party applications service went live april 1 2009 three major app stores different operating systems largest revenue per app 9,166.67 compared 6,480.00 1,200.00 apple app store google play respectively 21 january 2013 blackberry announced rebranded blackberry app world simpler blackberry world part release blackberry 10 operating system blackberry devices since 2015 release blackberry priv longer use blackberry 10 operating system android instead uses google play store blackberry world set shut 2019 2003 rim launched mobile data service enable customers access java-based third-party enterprise applications using secure real-time push-based blackberry infrastructure later october 21 2008 rim announced blackberry developer conference company would open application store devices also announced store scheduled open march 2009 would work conjunction paypal services january 19 2009 rim began accepting submissions applications developers march 4 2009 rim officially named store blackberry app world previously called blackberry application storefront also confirmed service would initially available desktops web-based catalog would accessible non-blackberry devices april 1 2009 ctia trade show rim announced app world gone live blackberry sponsored wireless symposium announced average one million apps downloaded day august 19 2010 blackberry app world 2.0 released new version introduced blackberry id single sign account system used blackberry client blackberry app world desktop storefront addition blackberry id blackberry app world 2.0 also introduced direct credit card billing carrier billing wireless subscribers december 3 2010 research motion announced daily downloads two million apps per day february 2 2011 blackberry app world 2.1 released version introduced in-app purchases digital goods allowing add-ons purchased within applications january 21 2013 blackberry rebranded blackberry app world blackberry world june 18 2014 blackberry announced official relationship amazon includes access amazon appstore blackberry 10.3 december 5 2017 blackberry announced closure blackberry world december 31 2019 april 1 2018 blackberry removed paid apps blackberry world beginning 2011 16,000 apps available blackberry app world year later app store passed 60,000 apps january 2012 month later 70,000 apps february 2012 blackberry jam september 2012 rim announced app world 105,000 apps may 2013 blackberry live conference blackberry announced 120,000 apps blackberry 10 available download blackberry world application verification done blackberry world apps content quality agreed launch 85 percent verification done denpasar bali rim announced store would initially available united states united kingdom canada march 2013 blackberry world available 170 markets supports 23 currencies 33 languages 6 million applications downloaded daily aggregate 4 billion downloads to-date accepts payment markets using combination paypal credit card carrier billing list countries blackberry world available applications free paid 0.99 599.99 usd u.s registration app submission fees charged developers currently 0 service available english french italian german spanish brazilian portuguese store available following blackberry devices updated blackberry os version 4.5.0 higher users initially allowed archive apps microsd emmc storage certain blackberry smartphone models archive function later removed release app world 3.0 2010 rim announced several new tools make easier applications developers build simulate deploy monetize feature-rich applications blackberry platform including blackberry enterprise application development platform next generation blackberry web application platform blackberry webworks platform blackberry playbook\u2122 tablet blackberry smartphones blackberry payment service blackberry push service blackberry advertising service location service maps services analytics service scoreloop bbm social platform software developer kits et al blackberry embraced open standards included variety open source libraries box including lua openal cocos2d-x box2d open source repository accessed github.com/blackberry open ecosystem helps developers target multiple platforms partnerships appcelerator apache cordova dojo jquery mobile marmalade nme qt sencha touch blackberry changed whole direction development tools mainly embracing c++/cascades native road develop mobile apps blackberry 10 platform html5 considered almost-native second path development april 2014 blackberry announced stop support adobe air release blackberry 10.3.1 released later 2014 time release blackberry 10.3.1 possible upload new adobe air-based apps blackberry world", + "neighbors": [ + 33, + 62, + 162, + 716, + 1138, + 1292, + 1295, + 1547 + ], + "mask": "Validation" + }, + { + "node_id": 460, + "label": 3, + "text": "Register_file:register file register file array processor registers central processing unit cpu modern integrated circuit-based register files usually implemented way fast static rams multiple ports rams distinguished dedicated read write ports whereas ordinary multiported srams usually read write ports instruction set architecture cpu almost always define set registers used stage data memory functional units chip simpler cpus architectural registers correspond one-for-one entries physical register file prf within cpu complicated cpus use register renaming mapping physical entry stores particular architectural register changes dynamically execution register file part architecture visible programmer opposed concept transparent caches register files may clubbed together register banks processors several register banks arm processors use arm register banks fast interrupt request x86 processors use context switching fast interrupt switching instruction decoder gprs register files one instruction issued existing processors support superscalar however context switching totally different mechanism arm register bank within registers modcomp later 8051-compatible processors use bits program status word select currently active register bank usual layout convention simple array read vertically single word line runs horizontally causes row bit cells put data bit lines run vertically sense amps convert low-swing read bitlines full-swing logic levels usually bottom convention larger register files sometimes constructed tiling mirrored rotated simple arrays register files one word line per entry per port one bit line per bit width per read port two bit lines per bit width per write port bit cell also vdd vss therefore wire pitch area increases square number ports transistor area increases linearly point may smaller and/or faster multiple redundant register files smaller numbers read ports rather single register file read ports mips r8000 integer unit example 9 read 4 write port 32 entry 64-bit register file implemented 0.7 \u00b5m process could seen looking chip arm length two popular approaches dividing registers multiple register files distributed register file configuration partitioned register file configuration principle operation could done 64-bit-wide register file many read write ports could done single 8-bit-wide register file single read port single write port however bit-level parallelism wide register files many ports allows run much faster thus operations single cycle would take many cycles fewer ports narrower bit width width bits register file usually number bits processor word size occasionally slightly wider order attach extra bits register poison bit width data word different width address\u2014or cases 68000 even width\u2014the address registers separate register file data registers basic scheme bit cell many optimizations possible register files make special provision prevent multiple write ports writing entry simultaneously instead instruction scheduling hardware ensures one instruction particular cycle writes particular entry multiple instructions targeting register issued one write enables turned crossed inverters take finite time settle write operation read operation either take longer return garbage common bypass multiplexers bypass written data read ports simultaneous read write entry commanded bypass multiplexers often part larger bypass network forwards results yet committed functional units register file usually pitch-matched datapath serves pitch matching avoids many busses passing datapath turn corners would use lot area since every unit must bit pitch every unit datapath ends bit pitch forced widest unit waste area units register files two wires per bit per write port bit lines must contact silicon every bit cell often set pitch datapath area sometimes saved machines multiple units datapath two datapaths side-by-side smaller bit pitch single datapath would case usually forces multiple copies register file one datapath alpha 21264 ev6 instance first large micro-architecture implement shadow register file architecture two copies integer register file two copies floating point register locate front end future scaled file contain 2 read 2 write port took extra cycle propagate data two context switch issue logic attempted reduce number operations forwarding data two greatly improved integer performance help reduce impact limited number gpr superscalar speculative execution design later adapted sparc mips later x86 implementation mips uses multiple register file well r8000 floating-point unit two copies floating-point register file four write four read ports wrote copies time context switch however support integer operation integer register file still remain one later shadow register file abandoned newer design favor embedded market sparc uses shadow register file architecture well high end line 4 copies integer register files future retired scaled scratched contain 7 read 4 write port 2 copies floating point register file unlike alpha x86 locate back end retire unit right order unit renaming register files load instruction instruction fetch decoding stage context switch needless design ibm uses mechanism many major microprocessors deeply merging register file decoder register file work independently decoder side involve context switch different alpha x86 register file serve dedicate decoder thread level example power8 8 instruction decoders 32 register files 32 general purpose registers 4 read 4 write port facilitate simultaneous multithreading instruction used cross register file lack context switch. x86 processor line typical pre-486 cpu individual register file general purpose register directly work decoder x87 push stack located within floating-point unit starting pentium typical pentium-compatible x86 processor integrated one copy single-port architectural register file containing 8 architectural registers 8 control registers 8 debug registers 8 condition code registers 8 unnamed based register one instruction pointer one flag register 6 segment registers one file one copy 8 x87 fp push stack default mmx register virtually simulated x87 stack require x86 register supplying mmx instruction aliases exist stack p6 instruction independently stored executed parallel early pipeline stages decoding micro-operations renaming out-of-order execution beginning p6 register files require additional cycle propagate data register files like architectural floating point located code buffer decoders called retire buffer reorder buffer oooe connected within ring bus 16 bytes register file still remains one x86 register file one x87 stack serve retirement storing x86 register file increased dual ported increase bandwidth result storage registers like debug/condition code/control/unnamed/flag stripped main register file placed individual files micro-op rom instruction sequencer inaccessible registers like segment register separated general-purpose register file except instruction pointer located scheduler instruction allocator order facilitate register renaming out-of-order execution x87 stack later merged floating-point register file 128-bit xmm register debuted pentium iii xmm register file still located separately x86 integer register files later p6 implementations pentium yonah introduced shadow register file architecture expanded 2 copies dual ported integer architectural register file consist context switch future retirered file scaled file using trick used integer floating point order solve register bottleneck exist x86 architecture micro op fusion introduced still 8 entries 32 bit architectural registers total 32 bytes capacity per file segment register instruction pointer remain within file though inaccessible program speculative file second file served scaled shadow register file without context switch scaled file store instruction independently instruction sse2/sse3/ssse3 require feature integer operation example instruction like pshufb pmaddubsw phsubw phsubd phsubsw phaddw phaddd phaddsw would require loading eax/ebx/ecx/edx register file though uncommon x86 processor take use another register file instruction time second file served scale retirered file pentium architecture still remains one dual-ported fp register file 8 entries mm/xmm shared three decoder fp register shadow register file shadow register file architecture including floating point function processor p6 architectural register file external locate processor backend retired opposite internal register file locate inner core register renaming/reorder buffer however core 2 within unit called register alias table rat located instruction allocator size register size retirement core 2 increased inner ring bus 24 bytes allow 3 instructions decoded extended register file dual ported one read/one write quad ported two read/two write register still remain 8 entries 32 bit 32 bytes including 6 segment register one instruction pointer unable access file code/instruction total file size expanded 16 entries x64 total 128 bytes size per file pentium pipeline port decoder increased 're located allocator table instead code buffer fp xmm register file also increase quad ported 2 read/2 write register still remain 8 entries 32 bit extended 16 entries x64 mode number still remain 1 shadow register file architecture including floating point/sse functions later x86 implementations like nehalem later processors integer floating point registers incorporated unified octa-ported six read two write general-purpose register file 8 8 32-bit 16 16 x64 per file register file extended 2 enhanced shadow register file architecture favorite executing hyper threading thread uses independent register files decoder later sandy bridge onward replaced shadow register table architectural registers much large yet advance physical register file decoding reorder buffer randered sandy bridge onward longer carry architectural register atom line modern simplified revision p5 includes single copies register file share thread decoder register file dual-port design 8/16 entries gprs 8/16 entries debug register 8/16 entries condition code integrated file however eight-entries 64 bit shadow based register eight-entries 64 bit unnamed register separated main gprs unlike original p5 design located execution unit file registers single-ported expose instruction like scaled shadow register file found core/core2 shadow register file made architectural registers bonnell due shadow register file architecture however file use renaming purpose due lack order execution found bonnell architecture also one copy xmm floating point register file per thread difference nehalem bonnell unified register file dedicated register file hyper threading instead bonnell uses separate rename register thread despite order similar bonnell larrabee xeon phi also one general-purpose integer register file larrabee 16 xmm register files 8 entries per file xeon phi 128 avx-512 register files containing 32 512-bit zmm registers vector instruction storage big l2 cache intel x86 lines n't register file internal design geode gx vortex86 many embedded processors n't pentium-compatible reverse-engineered early 80x86 processors therefore n't register file decoders gprs used individually pentium 4 hand register file decoder x86 gprs n't exist within structure due introduction physical unified renaming register file similar sandy bridge slightly different due inability pentium 4 use register naming attempting replace architectural register file skip x86 decoding scheme instead uses sse integer execution storage alu result sse2/sse3/ssse3 use mechanism well integer operation amd early design like k6 register file like intel support shadow register file architecture lack context switch bypass inverter necessary require register file function appropriately instead use separate gprs directly link rename register table oooe cpu dedicated integer decoder floating decoder mechanism similar intel pre-pentium processor line example k6 processor four int one eight-entries temporary scratched register file one eight-entries future register file one eight-entries fetched register file eight-entries unnamed register file two fp rename register files two eight-entries x87 st file one goes fadd one goes fmov directly link x86 eax integer renaming xmm0 register floating point renaming later athlon included shadow register front end scaled 40 entries unified register file order integer operation decoded register file contain 8 entries scratch register 16 future gprs register file 16 unnamed gprs register file later amd designs abandons shadow register design favored k6 architecture individual gprs direct link design like phenom three int register files two sse register files located physical register file directly linked gprs however scales one integer one floating-point bulldozer like early amd designs x86 manufacturers like cyrix via dm p sis used mechanism well resulting lack integer performance without register renaming in-order cpu companies like cyrix amd increase cache size hope reduce bottleneck amd sse integer operation work different way core 2 pentium 4 uses separate renaming integer register load value directly decode stage though theoretically need shorter pipeline intel sse implementation generally cost branch prediction much greater higher missing rate intel would take least two cycles sse instruction executed regardless instruction wide early amds implementations could execute fp int sse instruction set like intel implementation unlike alpha sparc mips allows one register file load/fetch one operand time would require multiple register files achieve superscale arm processor hand integrate multiple register files load/fetch instructions arm gprs special purpose instruction set arm isa require accumulator index stack/base points registers accumulator base/stack point used thumb mode gprs propagate store multiple instructions independently smaller code size small enough able fit one register architectural register act table shared decoder/instructions simple bank switching decoders major difference arm designs arm allows run general-purpose register quick bank switching without requiring additional register file superscalar despite x86 sharing mechanism arm gprs store data individually x86 confront data dependency three non-related instructions stored gprs per file small eight 32 bit mode 16 64 bit compared arm 13 32 bit 31 64 bit data impossible superscalar without multiple register files feed decoder x86 code big complex compared arm x86 front-ends become much larger much power hungry arm processor order competitive example pentium core 2 duo bay trail third-party x86 equivalent processors even became noncompetitive arm due dedicated register file architecture particularly amd cyrix via bring reasonable performance without register renaming order execution leave intel atom in-order x86 processor core mobile competition x86 nehalem processor merged integer floating point register one single file introduction large physical register table enhanced allocator table front-end renaming out-of-order internal core processors perform register renaming arrange functional unit write subset physical register file arrangement eliminate need multiple write ports per bit cell large savings area resulting register file effectively stack register files single write ports benefits replication subsetting read ports limit technique would place stack 1-write 2-read regfiles inputs functional unit since regfiles small number ports often dominated transistor area best push technique limit useful sparc isa defines register windows 5-bit architectural names registers actually point window much larger register file hundreds entries implementing multiported register files hundreds entries requires large area register window slides 16 registers moved architectural register name refer small number registers larger array e.g architectural register r20 refer physical registers 20 36 52 68 84 100 116 seven windows physical file save area sparc implementations implement 32-entry register file cell seven bits one read writeable external ports contents bits rotated rotation accomplishes single cycle movement register window wires accomplishing state movement local tremendous bandwidth possible little power technique used r10000 register renaming mapping file stores 6-bit virtual register number physical registers renaming file renaming state checkpointed whenever branch taken branch detected mispredicted old renaming state recovered single cycle see register renaming", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 365, + 388, + 445, + 457, + 465, + 486, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1143, + 1160, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 461, + "label": 1, + "text": "Trigger_list:trigger list trigger list general meaning refers list whose items used initiate trigger certain actions united states person applies mortgage loan lender makes credit inquiry potential borrower national credit bureaus equifax experian transunion unless borrower opted credit bureaus put applicants onto trigger list leads persons interested new loans lists sold numerous lenders united states soon application applicant starts receiving offers parts country trigger lists contain significant amount personal financial information among buyers trigger lists lead generators resell filtered information borrowers e.g. people live certain area certain credit score federal trade commission considers market trigger lists legal business many people organizations national association mortgage brokers consider serious breach privacy lobby putting practice regulatory controls american consumers may opt-out trigger lists calling 1-888-5-optout 1-888-567-8688 zangger committee nuclear suppliers group maintain lists items may contribute nuclear proliferation nuclear non-proliferation treaty forbids members export items non-treaty members items said trigger countries responsibilities npt hence name", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 462, + "label": 1, + "text": "Tuvalu_Ship_Registry:tuvalu ship registry tuvalu ship registry body appointed government tuvalu register ships tuvalu flag ship registry launched 2004 located singapore operated tuvalu ship registry pte ltd ship registry managed behalf tuvalu government sovereign ventures sv pte ltd responsibilities registry include total 245 type bulk carrier 18 container ship 2 general cargo 36 oil tanker 27 162 2017 tuvalu entered international spotlight 2012 ships sailing flag iran registered tuvalu ship registry response european boycott iranian oil exports iran nuclear policy number oil tankers changed tuvalu flags according radio australia could lead unforeseen consequences small nation iranian vessels accepted tuvalu ship registry earlier flagged malta cyprus flags well-known reputable flags however upon understanding vessels actually sanctioned us eu government tuvalu took swift action instruct tuvalu ship registry de-register possible iranian-linked vessels 16 august 2012 iranian-linked vessels de-registered 21 september 2012 press releases actions taken tuvalu ship registry posted website iranian vessels later rumored gone flags tanzania mongolia others", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 463, + "label": 4, + "text": "Uninterruptible_power_supply:uninterruptible power supply uninterruptible power supply uninterruptible power source ups electrical apparatus provides emergency power load input power source mains power fails ups differs auxiliary emergency power system standby generator provide near-instantaneous protection input power interruptions supplying energy stored batteries supercapacitors flywheels on-battery run-time uninterruptible power sources relatively short minutes sufficient start standby power source properly shut protected equipment type continual power system ups typically used protect hardware computers data centers telecommunication equipment electrical equipment unexpected power disruption could cause injuries fatalities serious business disruption data loss ups units range size units designed protect single computer without video monitor around 200 volt-ampere rating large units powering entire data centers buildings world largest ups 46-megawatt battery electric storage system bess fairbanks alaska powers entire city nearby rural communities outages primary role ups provide short-term power input power source fails however ups units also capable varying degrees correcting common utility power problems manufacturers ups units categorize products accordance number power-related problems address three general categories modern ups systems on-line line-interactive standby ups one kilovolt-ampere 1 kva line-interactive standby variety usually less expensive large power units dynamic uninterruptible power supplies dups sometimes used synchronous motor/alternator connected mains via choke energy stored flywheel mains power fails eddy-current regulation maintains power load long flywheel energy exhausted dups sometimes combined integrated diesel generator turned brief delay forming diesel rotary uninterruptible power supply drups fuel cell ups developed recent years using hydrogen fuel cell power source potentially providing long run times small space offline/standby ups offers basic features providing surge protection battery backup protected equipment normally connected directly incoming utility power incoming voltage falls rises predetermined level sps turns internal dc-ac inverter circuitry powered internal storage battery ups mechanically switches connected equipment dc-ac inverter output switch-over time long 25 milliseconds depending amount time takes standby ups detect lost utility voltage ups designed power certain equipment personal computer without objectionable dip brownout device line-interactive ups similar operation standby ups addition multi-tap variable-voltage autotransformer special type transformer add subtract powered coils wire thereby increasing decreasing magnetic field output voltage transformer may also performed buck\u2013boost transformer distinct autotransformer since former may wired provide galvanic isolation type ups able tolerate continuous undervoltage brownouts overvoltage surges without consuming limited reserve battery power instead compensates automatically selecting different power taps autotransformer depending design changing autotransformer tap cause brief output power disruption may cause upss equipped power-loss alarm chirp moment become popular even cheapest upss takes advantage components already included main 50/60 hz transformer used convert line voltage battery voltage needs provide two slightly different turns ratios one convert battery output voltage typically multiple 12 v line voltage second one convert line voltage slightly higher battery charging voltage multiple 14 v difference two voltages charging battery requires delta voltage 13\u201314 v charging 12 v battery furthermore easier switching line-voltage side transformer lower currents side gain buck/boost feature required two separate switches ac input connected one two primary taps load connected thus using main transformer primary windings autotransformer battery still charged bucking overvoltage boosting undervoltage transformer output low charge batteries autotransformers engineered cover wide range varying input voltages requires taps increases complexity expense ups common autotransformer cover range 90 v 140 v 120 v power switch battery voltage goes much higher lower range low-voltage conditions ups use current normal may need higher current circuit normal device example power 1000-w device 120 v ups draw 8.33 brownout occurs voltage drops 100 v ups draw 10 compensate also works reverse overvoltage condition ups need less current online ups batteries always connected inverter power transfer switches necessary power loss occurs rectifier simply drops circuit batteries keep power steady unchanged power restored rectifier resumes carrying load begins charging batteries though charging current may limited prevent high-power rectifier overheating batteries boiling electrolyte main advantage on-line ups ability provide electrical firewall incoming utility power sensitive electronic equipment online ups ideal environments electrical isolation necessary equipment sensitive power fluctuations although one time reserved large installations 10 kw advances technology permitted available common consumer device supplying 500 w less online ups may necessary power environment noisy utility power sags outages anomalies frequent protection sensitive equipment loads required operation extended-run backup generator necessary basic technology online ups standby line-interactive ups however typically costs much due much greater current ac-to-dc battery-charger/rectifier rectifier inverter designed run continuously improved cooling systems called double-conversion ups due rectifier directly driving inverter even powered normal ac current online ups typically static transfer switch sts increasing reliability hybrid rotary ups designs official designations although one name used utl double conversion demand style ups targeted towards high-efficiency applications still maintaining features protection level offered double conversion hybrid double conversion demand ups operates off-line/standby ups power conditions within certain preset window allows ups achieve high efficiency ratings power conditions fluctuate outside predefined windows ups switches online/double-conversion operation double-conversion mode ups adjust voltage variations without use battery power filter line noise control frequency ferroresonant units operate way standby ups unit however online exception ferroresonant transformer used filter output transformer designed hold energy long enough cover time switching line power battery power effectively eliminates transfer time many ferroresonant upss 82\u201388 efficient ac/dc-ac offer excellent isolation transformer three windings one ordinary mains power second rectified battery power third output ac power load dominant type ups limited around range units still mainly used industrial settings oil gas petrochemical chemical utility heavy industry markets due robust nature ups many ferroresonant upss utilizing controlled ferro technology may interact power-factor-correcting equipment result fluctuating output voltage ups may corrected reducing load levels adding linear type loads ups designed powering dc equipment similar online ups except need output inverter also ups battery voltage matched voltage device needs device power supply needed either since one power conversion steps eliminated increases efficiency run time many systems used telecommunications use extra-low voltage common battery 48 v dc power less restrictive safety regulations installed conduit junction boxes dc typically dominant power source telecommunications ac typically dominant source computers servers much experimentation 48 v dc power computer servers hope reducing likelihood failure cost equipment however supply amount power current would higher equivalent 115 v 230 v circuit greater current requires larger conductors energy lost heat laptop computer classic example pc dc ups built high voltage dc 380 v finding use data center applications allows small power conductors subject complex electrical code rules safe containment high voltages rotary ups uses inertia high-mass spinning flywheel flywheel energy storage provide short-term ride-through event power loss flywheel also acts buffer power spikes sags since short-term power events able appreciably affect rotational speed high-mass flywheel also one oldest designs predating vacuum tubes integrated circuits considered line since spins continuously normal conditions however unlike battery-based ups flywheel-based ups systems typically provide 10 20 seconds protection flywheel slowed power output stops traditionally used conjunction standby generators providing backup power brief period time engine needs start running stabilize output rotary ups generally reserved applications needing 10,000 w protection justify expense benefit advantages rotary ups systems bring larger flywheel multiple flywheels operating parallel increase reserve running time capacity flywheels mechanical power source necessary use electric motor generator intermediary diesel engine designed provide emergency power using transmission gearbox rotational inertia flywheel used directly start diesel engine running diesel engine used directly spin flywheel multiple flywheels likewise connected parallel mechanical countershafts without need separate motors generators flywheel normally designed provide high current output compared purely electronic ups better able provide inrush current inductive loads motor startup compressor loads well medical mri cath lab equipment also able tolerate short-circuit conditions 17 times larger electronic ups permitting one device blow fuse fail devices still continue powered rotary ups life cycle usually far greater purely electronic ups 30 years require periodic downtime mechanical maintenance ball bearing replacement larger systems redundancy system ensures availability processes maintenance battery-based designs require downtime batteries hot-swapped usually case larger units newer rotary units use technologies magnetic bearings air-evacuated enclosures increase standby efficiency reduce maintenance low levels typically high-mass flywheel used conjunction motor-generator system units configured case 3 motor generator synchronous/synchronous induction/synchronous motor side unit case nos 2 3 driven directly ac power source typically inverter bypass 6-step double-conversion motor drive 6-pulse inverter case 1 uses integrated flywheel short-term energy source instead batteries allow time external electrically coupled gensets start brought online case nos 2 3 use batteries free-standing electrically coupled flywheel short-term energy source smaller ups systems come several different forms sizes however two common forms tower rack-mount tower models stand upright ground desk shelf typically used network workstations desktop computer applications rack-mount models mounted standard 19-inch rack enclosures require anywhere 1u 12u rack units typically used server networking applications devices feature user interfaces rotate 90\u00b0 allowing devices mounted vertically ground horizontally would found rack large business environments reliability great importance single huge ups also single point failure disrupt many systems provide greater reliability multiple smaller ups modules batteries integrated together provide redundant power protection equivalent one large ups n+1 means load supplied n modules installation contain n+1 modules way failure one module impact system operation many computer servers offer option redundant power supplies event one power supply failing one power supplies able power load critical point \u2013 power supply must able power entire server redundancy enhanced plugging power supply different circuit i.e different circuit breaker redundant protection extended yet connecting power supply ups provides double protection power supply failure ups failure continued operation assured configuration also referred 1+1 2n redundancy budget allow two identical ups units common practice plug one power supply mains power ups ups system placed outdoors specific features guarantee tolerate weather without effects performance factors temperature humidity rain snow among others considered manufacturer designing outdoor ups system operating temperature ranges outdoor ups systems could around \u221240 \u00b0c +55 \u00b0c outdoor ups systems either pole ground pedestal host mounted outdoor environment could mean extreme cold case outdoor ups system include battery heater mat extreme heat case outdoor ups system include fan system air conditioning system solar inverter pv inverter solar converter converts variable direct current dc output photovoltaic pv solar panel utility frequency alternating current ac fed commercial electrical grid used local off-grid electrical network critical bos\u2013component photovoltaic system allowing use ordinary ac-powered equipment solar inverters special functions adapted use photovoltaic arrays including maximum power point tracking anti-islanding protection problem combination double-conversion ups generator voltage distortion created ups input double-conversion ups essentially big rectifier current drawn ups non-sinusoidal cause voltage ac mains generator also become non-sinusoidal voltage distortion cause problems electrical equipment connected power source including ups also cause power lost wiring supplying power ups due spikes current flow level noise measured percentage total harmonic distortion current thd classic ups rectifiers thd level around 25 \u201330 reduce voltage distortion requires heavier mains wiring generators twice large ups several solutions reduce thd double-conversion ups classic solutions passive filters reduce thd 5 \u201310 full load reliable big work full load present problems used tandem generators alternative solution active filter use device thd drop 5 full power range newest technology double-conversion ups units rectifier use classic rectifier components thyristors diodes uses high-frequency components instead double-conversion ups insulated-gate bipolar transistor rectifier inductor thd small 2 completely eliminates need oversize generator transformers without additional filters investment cost losses space power management pm requires basic computer-to-ups control methods intended one-to-one signaling single source single target example single ups may connect single computer provide status information ups allow computer control ups similarly usb protocol also intended connect single computer multiple peripheral devices situations useful single large ups able communicate several protected devices traditional serial usb control signal replication device may used example allows one ups connect five computers using serial usb connections however splitting typically one direction ups devices provide status information return control signals may permitted one protected systems ups ethernet increased common use since 1990s control signals commonly sent single ups multiple computers using standard ethernet data communication methods tcp/ip status control information typically encrypted example outside hacker gain control ups command shut distribution ups status control data requires intermediary devices ethernet switches serial multiplexers powered one ups systems order ups alerts reach target systems power outage avoid dependency ethernet infrastructure upss connected directly main control server using gsm/gprs channel also sms gprs data packets sent upss trigger software shut pcs reduce load three main types ups batteries valve regulated lead acid vrla flooded cell vla batteries lithium ion batteries run-time battery-operated ups depends type size batteries rate discharge efficiency inverter total capacity lead\u2013acid battery function rate discharged described peukert law manufacturers supply run-time rating minutes packaged ups systems larger systems data centers require detailed calculation load inverter efficiency battery characteristics ensure required endurance attained lead\u2013acid battery charged discharged initially affects reacting chemicals interface electrodes electrolyte time charge stored chemicals interface often called interface charge spreads diffusion chemicals throughout volume active material battery completely discharged e.g car lights left overnight next given fast charge minutes short charging time develops charge near interface battery voltage may rise close charger voltage charging current decreases significantly hours interface charge spread volume electrode electrolyte leading interface charge low may insufficient start car due interface charge brief ups self-test functions lasting seconds may accurately reflect true runtime capacity ups instead extended recalibration rundown test deeply discharges battery needed deep discharge testing damaging batteries due chemicals discharged battery starting crystallize highly stable molecular shapes re-dissolve battery recharged permanently reducing charge capacity lead acid batteries known sulfation also affects types nickel cadmium batteries lithium batteries therefore commonly recommended rundown tests performed infrequently every six months year multi-kilowatt commercial ups systems large easily accessible battery banks capable isolating testing individual cells within battery string consists either combined-cell battery units 12-v lead acid batteries individual chemical cells wired series isolating single cell installing jumper place allows one battery discharge-tested rest battery string remains charged available provide protection also possible measure electrical characteristics individual cells battery string using intermediate sensor wires installed every cell-to-cell junction monitored individually collectively battery strings may also wired series-parallel example two sets 20 cells situation also necessary monitor current flow parallel strings current may circulate strings balance effects weak cells dead cells high resistance shorted cells example stronger strings discharge weaker strings voltage imbalances equalized must factored individual inter-cell measurements within string battery strings wired series-parallel develop unusual failure modes due interactions multiple parallel strings defective batteries one string adversely affect operation lifespan good new batteries strings issues also apply situations series-parallel strings used ups systems also electric vehicle applications consider series-parallel battery arrangement good cells one becomes shorted dead way prevent subtle series-parallel string interactions using parallel strings using separate charge controllers inverters individual series strings even single string batteries wired series adverse interactions new batteries mixed old batteries older batteries tend reduced storage capacity discharge faster new batteries also charge maximum capacity rapidly new batteries mixed string new old batteries depleted string voltage drop old batteries exhausted new batteries still charge available newer cells may continue discharge rest string due low voltage energy flow may useful may wasted old cells resistance heating cells supposed operate within specific discharge window new cells capacity may cause old cells series string continue discharge beyond safe bottom limit discharge window damaging old cells recharged old cells recharge rapidly leading rapid rise voltage near fully charged state new cells capacity fully recharged charge controller detects high voltage nearly fully charged string reduces current flow new cells capacity charge slowly slowly chemicals may begin crystallize reaching fully charged state reducing new cell capacity several charge/discharge cycles capacity closely matches old cells series string reasons industrial ups management systems recommend periodic replacement entire battery arrays potentially using hundreds expensive batteries due damaging interactions new batteries old batteries within across series parallel strings", + "neighbors": [ + 108, + 272, + 455, + 921, + 1138, + 1317 + ], + "mask": "Test" + }, + { + "node_id": 464, + "label": 1, + "text": "VxInsight:vxinsight vxinsight knowledge mining tool developed sandia national laboratories institute scientific information allows user visualize relationship groups objects large databases 3d landscape hillier et al call pioneering study vxinsight used analyze gene expression i.e microarray data across number conditions c. elegans using vxinsight kim et al able cluster genes mounts coherent functions also able make novel observations finding distinct classes transposons tc3 mariner transposons appear differentially regulated development", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 465, + "label": 2, + "text": "Preemption_(computing):preemption computing computing preemption act temporarily interrupting task carried computer system without requiring cooperation intention resuming task later time changes executed task known context switches normally carried privileged task part system known preemptive scheduler power preempt interrupt later resume tasks system given system design operations performed system may preemptible usually applies kernel functions service interrupts permitted run completion would tend produce race conditions resulting deadlock barring scheduler preempting tasks processing kernel functions simplifies kernel design expense system responsiveness distinction user mode kernel mode determines privilege level within system may also used distinguish whether task currently preemptible modern systems preemptive kernels designed permit tasks preempted even kernel mode examples systems solaris 2.0/sunos 5.0 windows nt linux kernel 2.6.x newer aix bsd systems netbsd since version 5 term preemptive multitasking used distinguish multitasking operating system permits preemption tasks cooperative multitasking system wherein processes tasks must explicitly programmed yield need system resources simple terms preemptive multitasking involves use interrupt mechanism suspends currently executing process invokes scheduler determine process execute next therefore processes get amount cpu time given time preemptive multitasking operating system kernel also initiate context switch satisfy scheduling policy priority constraint thus preempting active task general preemption means prior seizure high priority task instance seizes currently running task known preemptive scheduling term preemptive multitasking sometimes mistakenly used intended meaning specific referring instead class scheduling policies known time-shared scheduling time-sharing preemptive multitasking allows computer system reliably guarantee process regular slice operating time also allows system rapidly deal important external events like incoming data might require immediate attention one another process specific time processes grouped two categories waiting input output called i/o bound fully utilizing cpu cpu bound early systems processes would often poll busywait waiting requested input disk keyboard network input time process performing useful work still maintained complete control cpu advent interrupts preemptive multitasking i/o bound processes could blocked put hold pending arrival necessary data allowing processes utilize cpu arrival requested data would generate interrupt blocked processes could guaranteed timely return execution although multitasking techniques originally developed allow multiple users share single machine soon became apparent multitasking useful regardless number users many operating systems mainframes single-user personal computers no-user control systems like robotic spacecraft recognized usefulness multitasking support variety reasons multitasking makes possible single user run multiple applications time run background processes retaining control computer period time process allowed run preemptive multitasking system generally called time slice quantum scheduler run every time slice choose next process run length time slice critical balancing system performance vs process responsiveness time slice short scheduler consume much processing time time slice long processes take longer respond input interrupt scheduled allow operating system kernel switch processes time slices expire effectively allowing processor time shared number tasks giving illusion dealing tasks parallel simultaneously operating system controls design called multi-tasking system today nearly operating systems support preemptive multitasking including current versions windows macos linux including android ios earliest operating systems available home users featuring preemptive multitasking sinclair qdos 1984 amiga os 1985 ran motorola 68000-family microprocessors without memory management amiga os used dynamic loading relocatable code blocks hunks amiga jargon multitask preemptively processes flat address space early pc operating systems ms-dos pc dos support multitasking however alternative operating systems mp/m-86 1981 concurrent cp/m-86 support preemptive multitasking unix-like systems including minix coherent provided preemptive multitasking 1980s-era personal computers later dos versions natively supporting preemptive multitasking/multithreading include concurrent dos multiuser dos novell dos later called caldera opendos dr-dos 7.02 higher since concurrent dos 386 could also run multiple dos programs concurrently virtual dos machines earliest version windows support limited form preemptive multitasking windows 2.1x used intel 80386 virtual 8086 mode run dos applications virtual 8086 machines commonly known dos boxes could preempted windows 95 98 32-bit applications made preemptive running one separate address space 16-bit applications remained cooperative backward compatibility windows 3.1x protected mode kernel virtual device drivers ran preemptively 16-bit applications non-preemptive shared address space preemptive multitasking always supported windows nt versions os/2 native applications unix unix-like systems linux bsd macos vms os/360 many operating systems designed use academic medium-to-large business markets although plans upgrade cooperative multitasking found classic mac os preemptive model preemptive api exist mac os 9 although limited sense abandoned favor mac os x called macos hybrid old mac system style nextstep operating system based mach kernel derived part bsd always provided unix-like preemptive multitasking", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 76, + 85, + 86, + 99, + 105, + 123, + 127, + 134, + 170, + 171, + 185, + 187, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 265, + 270, + 271, + 280, + 300, + 314, + 322, + 335, + 340, + 353, + 362, + 375, + 380, + 387, + 388, + 413, + 434, + 445, + 457, + 460, + 477, + 508, + 583, + 589, + 611, + 643, + 650, + 659, + 664, + 719, + 720, + 721, + 728, + 737, + 752, + 754, + 776, + 797, + 803, + 821, + 846, + 847, + 860, + 876, + 884, + 891, + 907, + 937, + 941, + 954, + 961, + 966, + 980, + 984, + 994, + 996, + 1009, + 1011, + 1012, + 1013, + 1016, + 1022, + 1024, + 1027, + 1040, + 1049, + 1052, + 1053, + 1054, + 1057, + 1063, + 1081, + 1099, + 1111, + 1113, + 1125, + 1138, + 1155, + 1174, + 1187, + 1202, + 1219, + 1222, + 1224, + 1256, + 1272, + 1284, + 1287, + 1290, + 1301, + 1304, + 1346, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1469, + 1474, + 1494, + 1505, + 1507, + 1518, + 1525, + 1530, + 1546, + 1557, + 1578, + 1610, + 1616, + 1631, + 1632, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 466, + "label": 7, + "text": "EKool:ekool ekool school management system used estonia covering 90 nation school network connecting pupils parents teachers involved estimated application used 28-30 estonians total name ekool means eschool estonian system usable teachers pupils parents exchange information time tables grades homework assignments similar features ekool created 2002 look world foundation cooperation companies private sector originally designed meet requirements four test schools rocca al mare school j\u00fcri gymnasium kuresaare gymnasium tallinn arte gymnasium since grown cover 90 estonian school network ekool started 2002 replace printed school diaries digital journals would enable parents students see grades homework assignments online pilot project launched specifications 4 schools rocca al mare school j\u00fcri gymnasium kuressaare gymnaasium tallinn arte gymnasium initial look world program ended 2005 turned private company koolit\u00f6\u00f6de next years ekool mostly expanded estonian school system reaching 420 schools 2012 since 2014 ekool also supported mobile application allows students parents access information mobile phones however schools teachers still need use computer ekool accessed combination user-name password estonian id-card estonian mobile-id smart-id online bank identification ekool used various interest groups school personnel students parents extent local government overseeing school one user account person access functionalities different user groups user belongs schools personnel carries data entry process ekool latter used parties right access information among information schools provide parents students access information keep date side make easy school collect contact information parents students enter keep ekool updated using", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 467, + "label": 1, + "text": "World_Database_of_Happiness:world database happiness world database happiness web-based archive research findings subjective appreciation life database contains overview scientific publications happiness digest research findings database contains information happy people wide range circumstances 165 different nations happiness defined degree individual judges quality life whole favorably two 'components happiness distinguished hedonic level affect degree pleasant affect dominates contentment perceived realization wants world database happiness tool acquire overview ever-growing stream research findings happiness accumulation knowledge stagnates scientists capitalize earlier research investments medio 2013 database covered 19,000 scientific findings happiness 6000 distributional findings happy people another 13,000 correlational findings associated less happiness first findings date 1915 world database happiness often used popular media make lists happiest countries around globe example happy planet index aims chart sustainable happiness world combining data longevity happiness size ecological footprint citizens database clear conceptual focus includes research findings subjective enjoyment one \u2019 life whole thereby evades babel haunted study happiness ages side coin much interesting research left findings reported technical details measurement statistical analysis detail welcomed scholars makes information difficult digest lay-persons still another limitation available findings often contradictory makes hard draw firm conclusions causes happiness clear poor health separation unemployment lack social contact strongly negatively associated unhappiness another problem world database happiness number studies happiness increases high rate gets increasingly difficult offer complete overview research findings", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 468, + "label": 7, + "text": "Unigine:unigine unigine proprietary cross-platform game engine developed russian software company unigine corp. apart use game engine mainly used enterprise area simulators virtual reality systems serious games visualization distinguishing feature unigine support large open worlds planet scale also advanced 3d renderer currently supports opengl 4 directx 11 updated unigine sdk released 3 months unigine engine also core technology lineup benchmarks cpu gpu power supply cooling system used overclockers technical media tom hardware linus tech tips pc gamer others unigine benchmarks also included part phoronix test suite benchmarking purposes linux systems first public release 0.3 version may 4 2005 unigine engine created scratch based engine last update released july 7 2014 initially started microsoft windows linux support platforms added later os x playstation 3 android ios experimental support webgl included official sdk unigine 1 support several graphical apis directx 9 directx 10 directx 11 opengl opengl es playstation 3 initial versions v0.3x opengl support 3 apis developers c++ c uniginescript proprietary scripting language similar \u0441++ syntax custom shaders written glsl hlsl languages unigine 1 several features required professional simulators enterprise vr systems mostly support large virtual scenarios specific hardware often called serious games support large virtual worlds implemented via double precision coordinates 64-bit per axis zone-based background data streaming optional operations geographic coordinate system latitude longitude elevation instead x z video output sophisticated displays implemented via so-called multi-channel rendering network-synchronized image generation single large image several computers standard approach professional simulators system enabled support multiple output devices asymmetric projections e.g cave curved screens multiple projectors requiring image warping edge blending also supported also various types stereoscopic 3d output supported anaglyph separate images output nvidia 3d vision well vr hmd support oculus rift unigine 1 also supported multi-monitor output video-walls unigine renderer supports shader model 5.0 hardware tessellation directcompute well opencl together set post-processes including screen space ambient occlusion ssao real-time global illumination set built-in high-level objects like terrain grass water clouds unigine uses proprietary physics engine collision detection rigid body physics dynamical destruction objects rag doll cloth fluid buoyancy force fields time reverse pathfinding also implemented proprietary engine together basic ai components spatial triggers callbacks features includes interactive 3d gui video playback using theora codec 3d audio system based openal library wysiwyg scene editor unigineeditor originally released october 10 2015 unigine 2 features unigine 1 focus simulators enterprise use main differences transition forward rendering deferred rendering approach pbr shading introduction several new graphical technologies like geometry water multi-layered volumetric clouds ssrtgi voxel-based lighting introduction c api supported platforms microsoft windows linux os x support stopped starting 2.6 version unigine 2 supports following graphical apis directx 11 opengl 4.x 3 apis developers c++ c uniginescript supported shader languages hlsl glsl uusl unified unigine shader language proprietary ssrtgi screen space ray-traced global illumination rendering technology introduced 2.5 version presented siggraph 2017 real-time live event roots unigine frustum.org open source project initiated 2002 alexander frustum zaprjagaev co-founder along denis shergin ceo ex-cto unigine corp name unigine means universal engine unique engine november 25 2010 unigine corp announced competition support linux game development agreed give away free license unigine engine anyone willing develop release game linux native client would also grant team windows license competition ran december 10 2010 considerable number entries submitted due unexpected response unigine decided extend offer three best applicants getting full unigine licenses winners announced december 13 2010 developers selected kot-in-action creative artel previously developed steel storm gamepulp intend make puzzle platformer med-art previously worked 2019 company claimed 200 b2b customers worldwide primarily use unigine military virtual reality projects several notable projects include graphical benchmarks cad systems unigine engine used platform series benchmarks used determine stability pc hardware cpu gpu power supply cooling system extremely stressful conditions well overclocking", + "neighbors": [ + 134, + 416, + 435, + 718, + 796, + 839, + 961, + 976, + 1592 + ], + "mask": "Test" + }, + { + "node_id": 469, + "label": 4, + "text": "HP_Data_Protector:hp data protector hp data protector software automated backup recovery software single-server enterprise environments supporting disk storage tape storage targets provides cross-platform online backup data microsoft windows unix linux operating systems business- mission-critical applications hp data protector zero downtime backup leverages array-based solutions offload processing server perform backup operations copy production data hp data protector instant recovery retrieves data replicated images disk recovery specific points time hp data protector originated omniback last version use omniback name version 4.1 retired 2004 hewlett-packard acquired apollo computer 1989 latter already developed backup system entitled omniback network backup system available market time hp continued develop product omniback name purpose backing individual files raw disk partitions related distinct product omniback/turbo developed backing databases 1996 hp released omniback ii 2.0 merged omniback ii omniback/turbo single product although still impossible create single job would contain database file system backup windows nt port released version 2.3 version 2.55 released 1997 included support hp-ux ibm aix interim hewlett-packard withdrew development slovenia germany significant time spent delivering version 3.5.2 solaris complete however allowed quick ports tru64 linux version 5.0 omniback name dropped since product called hp openview storage data protector hp storageworks data protector product called hp data protector software hp announced release hp data protector 9.0 part adaptive backup recovery initiative may 2014 released july 2014 released july 2014 along two companion products hp data protector management pack hp backup navigator hp data protector architecture based concept cell network environment contains cell manager clients backup devices cell manager main system centrally controls manages cell contains database runs core software runs backup restore sessions writing session information database client system within cell clients backed require installation disk agent clients control backup restore data require installation media agent multi-site operations data protector manager managers mom allows local administrators control data backup restore providing centralized enterprise monitoring media management configuration multiple data protector cells grouped configured managed mom hp data protector offers data deduplication capabilities ability compare blocks data written backup device data blocks previously stored device data deduplication hp data protector allows disk-based data storage target storage tape drives used deduplication targets sequential nature opposed block-oriented nature disk-devices hp data protector supports backup restore virtual servers including protection whole virtual machine application data supported virtual environments include vmware windows 2008 hyper-v limited microsoft virtual server 2005 hp integrity virtual machines citrix xenserver support longer officially provided hp data protector includes automated key management software linear tape-open lto-4 encryption users choice client-based encryption data security use encryption functionality lto-4 later generation tape drives november 2009 hp began offering hp data protector notebook extension hp data protector notebook extension enables users back recover data working remotely offline hp data protector notebook extension data captured backed automatically time user changes creates receives file processes transparent user impact laptop desktop performance data stored temporarily local repository pending transfer network data vault full backup restore capabilities key features include end-user single-click recovery encryption compression techniques granular recovery extensions components sit inside applications provide operator application way triggering large restore selecting individual items need restored without requiring assistance backup administrator example vmware granular recovery extension appears extra item vsphere console vcenter lets vmware administrator restore vmdk file finally provides interface selecting files vmdk file sharepoint gre allows microsoft sharepoint administrators recover single document collection folder directly via sharepoint gui granular recovery sharepoint 2010 introduced version 7.0", + "neighbors": [ + 134, + 195, + 494, + 755, + 788, + 961, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 470, + "label": 5, + "text": "Network_News_Transfer_Protocol:network news transfer protocol network news transfer protocol nntp application protocol used transporting usenet news articles netnews news servers reading posting articles end user client applications brian kantor university california san diego phil lapsley university california berkeley wrote specification network news transfer protocol march 1986 contributors included stan o. barber baylor college medicine erik fair apple computer usenet originally designed based uucp network article transfers taking place direct point-to-point telephone links news servers powerful time-sharing systems readers posters logged computers reading articles directly local disk local area networks internet participation proliferated became desirable allow newsreaders run personal computers connected local networks resulting protocol nntp resembled simple mail transfer protocol smtp tailored exchanging newsgroup articles newsreader also known news client software application reads articles usenet either directly news server disks via nntp well-known tcp port 119 reserved nntp well-known tcp port 433 nnsp may used bulk transfer articles one server another clients connect news server transport layer security tls tcp port 563 often used sometimes referred nntps alternatively plain-text connection port 119 may changed use tls via codice_1 command october 2006 ietf released updates nntp codifies many additions made years since rfc 977 time ietf also released specifies use transport layer security tls via nntp starttls abortive attempt update nntp standard early 1990s specialized form nntp intended specifically use clients nnrp proposed protocol never completed fully implemented name persisted internetnews inn nnrpd program result subset standard nntp commands useful clients sometimes still referred nnrp", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 491, + 542, + 543, + 598, + 638, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 772, + 779, + 833, + 910, + 923, + 939, + 1116, + 1132, + 1200, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1528, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 471, + "label": 7, + "text": "Lanyon_Solutions:lanyon solutions lanyon solutions inc. privately owned software-as-a-service saas company provided cloud-based software manage meetings events travel lanyon software supported range clients including corporations hotels associations tradeshows convention visitor bureaus cvbs intermediaries meetings events travel space merged cvent 2017 lanyon solutions formed combination two companies active network business solutions group lanyon vista equity partners 2014 two acquisitions added passkey genieconnect 2014 nevertheless solutions services offered individual companies date back decades lanyon founded 1984 nick lanyon irving texas provider software focused corporate transient travel 2009 lanyon received 10 million funding frontier capital charlotte nc-based private equity company expand lanyon product customer sales support company purchased vista equity partners december 2012 signaling exit frontier capital investment company founded 1996 waltham ma-based passkey international provided hotel reservation technology hotels event planners april 2014 lanyon acquired passkey complemented lanyon existing event solutions included passkey groupmax technology enabled hotels destination marketing organizations drive revenue group reservations easing manual tasks associated managing group room blocks starcite founded 1999 spinoff mcgettigan partners company expanded focus desktop consolidation meetings technology acquiring attendee applications provider regweb 2002 attendee product provider b-there 2003 2006 starcite merged onvantage inc. formed merger seeuthere technologies plansoft 2004 bringing together two leaders meetings technology merged company took starcite name products included starcite mobile attendee attendee networking 1:1 meetings schedule meetings business intelligence meetings data analytics suite smm applications supplier database 2008 active network acquired boulder co-based regonline online registration company lindon ut-based wingateweb provided large enterprise event management software january 2012 active network acquired starcite 57.7 million form business solutions group offer smm event marketing software meetings events addition starcite smm business solutions group technology offering included activeworks conference conferences regonline online registration starcite supplier marketplace hotel venue sourcing september 2013 active network acquired vista equity partners 1 billion would return public company private status february 2014 lanyon paired active network business solutions group consolidated lanyon name genieconnect founded 2010 teams us uk apac previously known geniemobile march 2013 uk-based genieconnect offered enterprise-level mobile event technology products included smartconnect provides content based attendee app usage ibeacon-enabled audience response solution marketing track attendee behaviors send messages audiences omnistream event wall aggregate social event activity genieconnect mobile event technology used associations corporations exhibitors expo companies cisco live 2014 genieconnect achieved following results 11,000 attendee profiles updates 7,500 access interactive maps 167,00 plus favorited content mobile app received user rating 4.5 5 stars cisco post-event survey acquired lanyon december 2014 genieconnect mobile technology already integrated many lanyon existing solutions formed early 2014 merger active network business solutions group lanyon lanyon solutions expanded software offering focus several key mergers acquisitions company acquired group hotel reservations company passkey april 2014 mobile application company genieconnect december 2014 lanyon solutions relocated headquarters downtown dallas texas offices draper ut london uk philadelphia pa singapore singapore waltham lanyon serves meetings events travel industries variety software products businesses hotels lanyon large focus enterprise serving 80 fortune 100 10,000 small medium-sized businesses 100,000 hotels company solutions designed manage costs spend data related meetings hotels enabling hoteliers offer venues services corporations associations introduced 2013 lanyon smart events cloud solution brings together strategic meetings management event marketing technologies single solution smart events cloud solution includes products hoteliers lanyon provides rfp management software respond meetings transient erfps hotel booking systems product offerings include", + "neighbors": [ + 1380 + ], + "mask": "Test" + }, + { + "node_id": 472, + "label": 8, + "text": "Text_Template_Transformation_Toolkit:text template transformation toolkit microsoft text template transformation toolkit usually referred t4 template based text generation framework included visual studio t4 source files usually denoted file extension .tt t4 used developers part application tool framework automate creation text files variety parameters text files ultimately text format code example c xml html xaml t4 uses custom template format contain .net code string literals parsed t4 command line tool .net code compiled executed output executed code text file generated template t4 also completely run within .net applications via use texttransformation class eliminates need end user visual studio installed t4 used within microsoft asp.net mvc creation views controllers ado.net entity framework entity generation asp.net dynamic data also used outside microsoft projects subsonic t4 templating also supported monodevelop four types controls handed t4 template transformation engine microsoft often criticized lack tooling support t4 within visual studio ide relies third parties namely tangible engineering clarius consulting however later revisions included better tooling support", + "neighbors": [ + 28, + 268, + 412, + 435, + 521, + 670, + 689, + 815, + 961, + 1050, + 1068, + 1177, + 1417, + 1428, + 1502, + 1547, + 1555, + 1582, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 473, + "label": 8, + "text": "Nginx:nginx nginx like engine x stylized nginx nginx web server also used reverse proxy load balancer mail proxy http cache software created igor sysoev first publicly released 2004 company name founded 2011 provide support nginx plus paid software nginx free open-source software released terms bsd-like license large fraction web servers use nginx often load balancer march 2019 nginx company acquired f5 networks 670 million netcraft estimated nginx served 32 active websites ranked ranking first apache 29 top million websites neither ranked first ranked first 33 sources still estimate apache ahead overall according netcraft november 2016 web server survey nginx found second widely used web server across active sites 18.22 surveyed sites top million busiest sites 27.83 surveyed sites according w3techs used 37.7 top 1 million websites 49.7 top 100,000 websites 57.0 top 10,000 websites according builtwith used 38.2 top 10,000 websites growth within top 10k 100k 1 million segments increased 2018 survey docker usage found nginx commonly deployed technology docker containers wikipedia uses nginx ssl termination proxy openbsd release 5.2 1 november 2012 nginx became part openbsd base system providing alternative system fork apache 1.3 intended replace later replaced openbsd httpd 8 nginx deployed serve dynamic http content network using fastcgi scgi handlers scripts wsgi application servers phusion passenger modules serve software load balancer nginx uses asynchronous event-driven approach rather threads handle requests nginx modular event-driven architecture provide predictable performance high loads nginx default configuration file codice_1 features include upgrading executable configuration without client connections loss module-based architecture core third-party module support paid plus product includes additional features advanced load balancing access expanded suite metrics performance monitoring two versions nginx oss nginx nginx plus nginx plus offers additional features included oss nginx active health checks session persistence based cookies dns service discovery integration cache purging api appdynamic datalog dynatrace new relic plug-ins active-active ha config sync key-value store on-the-fly zero downtime updates upstream configurations key\u2011value stores using nginx plus api web application firewall waf dynamic module nginx written explicit goal outperforming apache web server box serving static files nginx uses dramatically less memory apache handle roughly four times many requests per second however performance boost comes cost decreased flexibility ability override systemwide access settings per-file basis apache accomplishes .htaccess file nginx feature built nginx also reputation harder install configure apache formerly adding third party modules nginx required recompiling application source modules statically linked partially overcome version 1.9.11 february 2016 addition dynamic module loading however modules still must compiled time nginx modules compatible system\u2014some require older static linking process nginx generally considered less stable windows server linux apache equal support igor sysoev began development nginx 2002 originally nginx developed solve c10k problem fill needs websites including rambler search engine portal serving 500 million requests per day september 2008 nginx inc. founded july 2011 sysoev provide commercial products support software company principal place business san francisco california legally incorporated british virgin islands october 2011 nginx raised 3 million bv capital runa capital msd capital michael dell venture fund company announced commercial support options companies using nginx production nginx offered commercial support february 2012 paid nginx plus subscription august 2013 support packages focus installation configuration performance improvement etc support includes proactive notifications major changes security patches updates patches wordpress developer automattic inc. content delivery network provider maxcdn became funding partners update google spdy version 3.1 slated early 2014 nginx also offers consulting services assist customers custom configuration adding additional features october 2013 nginx raised 10 million series b investment round led new enterprise associates round included previous investors well aaron levie ceo founder box.com december 2014 nginx raised 20 million series b1 round led new enterprise associates participation e.ventures formerly bv capital runa capital index ventures nginx ceo gus robertson october 2017 nginx inc. announced general available nginx amplify saas providing monitoring analytics capabilities nginx september 2017 nginx announced api management tool nginx controller would build api gateway nginx plus june 2018 nginx raised 43 million series c funding round led goldman sachs accelerate application modernization digital transformation enterprises 11 march 2019 f5 networks acquired nginx", + "neighbors": [ + 69, + 134, + 195, + 292, + 296, + 306, + 539, + 638, + 678, + 682, + 731, + 783, + 1138, + 1242, + 1288, + 1301, + 1318, + 1395, + 1408, + 1510 + ], + "mask": "Test" + }, + { + "node_id": 474, + "label": 7, + "text": "Benchmark_Email:benchmark email benchmark email international internet-based service provider email marketing headquarters los alamitos ca company founded curt denise keller 2004 company offers various free paid editions benchmark member returnpath.net email sender provider coalition industry consortiums expansion international markets pursued company translating software english spanish french german chinese japanese portuguese italian establishing offices philippines japan china india spain taiwan italy among several countries recently website also launched french 2017 benchmark email named one 20 b2b technologies try 2017 forbes", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 475, + "label": 2, + "text": "A/UX:a/ux a/ux discontinued unix-based operating system apple computer custom integrated system 7 graphical interface application compatibility launched 1988 discontinued 1995 version 3.1.1 apple first official unix-based operating system a/ux requires select models 68k-based macintosh fpu paged memory management unit pmmu including macintosh ii se/30 quadra centris series predecessor macos variant unix currently bundled apple desktop computers described infoworld open systems solution macintosh heart operating system based unix system v release 2.2 includes additional features system v releases 3 4 bsd versions 4.2 4.3 posix system v interface definition svid compliant includes tcp/ip networking version 2 onward unix-compatible posix-compliant operating system made possible apple bid large contracts supply computers u.s. federal government institutes a/ux provides graphical user interface including familiar finder windows menus controls a/ux finder customized version system 7 finder adapted run unix process designed interact underlying unix file systems a/ux includes codice_1 terminal program offers command line interface underlying unix system x window system server application called macx terminal program also used interface system run x applications alongside finder alternatively user choose run fullscreen x11r4 session without finder apple compatibility layer allows a/ux run macintosh system 7.0.1 unix hybrid applications hybrid application uses functions macintosh toolbox unix system example run macintosh application calls unix system functions unix application calls macintosh toolbox functions quickdraw hypercard stack graphical frontend command-line unix application a/ux compatibility layer uses existing toolbox functions computer \u2019 rom function calls translated native unix system calls cooperatively multitasks macintosh apps single address space using token-passing system access toolbox a/ux includes utility called codice_2 similar tool name included macintosh programmer workshop assist users entering unix commands opening unix executable file finder opens dialog box allows user choose command-line options program using standard controls radio buttons check boxes display resulting command line argument user executing command program feature intended ease learning curve users new unix decrease user reliance unix manual a/ux utility allows user reformat third-party scsi drives way used macs era a/ux runs 68k-based macintoshes floating point unit fpu paged memory management unit pmmu even runs select models example quadra 840av apple fastest 68k macintosh run a/ux a/ux 1.0 announced february 1988 uniforum conference seven months behind schedule initially aimed existing unix customers universities vars. ref name= apple breaks unix market a/ux /ref system initially sold pre-installed macintosh ii although one could add larger monitor higher price purchase kit upgrading existing mac ii lower price third-party software announced system first release includes ingres database statview developer tools various productivity software packages based unix system v.2.2 additional features bsd unix networking support included tcp/ip appletalk nfs implementations developed unisoft base system gui running command line capable running single mac program time using system 6 interface although 10 existing mac software would run released 1989 a/ux 1.1 supplies basic gui system 6 finder chooser desk accessories control panels provisions unix x window system x11r3 gui draft 12 posix standard overall improved speed comparable low end sun workstation. ref name= a/ux release 1.1 supports x window /ref first posix compliant platform allowed apple join growing list industry heavyweights allowed us federal government burgeoning 6 billion bid market 1991 based aim alliance apple envisioned a/ux becoming basis drastically scaling concept macintosh system architecture application compatibility across computing industry personal enterprise markets apple formed new business division enterprise systems led director jim groff serve large businesses government higher education basing division upon maturing a/ux groff admitted apple major player unix market performed merely quiet marketing operating system fully intended become major player broad-based marketing objectives 1992 apple believed alliance ibm would merge a/ux aix system 7\u2014thus ultimately scaling execution macintosh applications mac desktops ibm huge rs/6000 systems november 1991 apple launched a/ux 3.0 planning synchronize two ongoing release schedules a/ux system 7 time company also preannounced a/ux 4.0 expected release 1993 1994 announcement expounded upon historic technology partnership apple ibm expecting merge apple user-friendly graphical interface desktop applications market ibm highly scalable unix server market allowing two companies enter apple believed emerging general desktop open systems market upcoming a/ux 4.0 would target poweropen environment abi merge features ibm aix variant unix a/ux use osf/1 kernel open software foundation a/ux 3.0 would serve important migration path new system making unix system 7 applications compliant poweropen specification future a/ux 4.0 aix operating systems intended run variety ibm power powerpc hardware apple powerpc-based hardware april 1992 c2-level secure version a/ux released coincidentally aim alliance launched apple/ibm partner corporation taligent inc. one month earlier mission bringing pink market grandly universal operating system application framework contrary announcements apple eventually abandoned plans a/ux 4.0 never releasing product 1995 company withdrew taligent partnership poweropen discontinued 1996 discontinued two-year copland project intended become mac os 8 host taligent software 1996 1997 company deployed short-lived platform apple network server systems based upon powerpc hardware customized ibm aix operating system company overall failed operating system strategy left badly aged system 7 successor following apple 1996 acquisition next apple introduced 1999 mac os x server descendant unix-based nextstep operating system final release a/ux version 3.1.1 1995 apple abandoned a/ux platform completely 1996 a/ux 1.0 criticized 1988 infoworld review largely command-driven user interface unix variants rather graphical system 6 networking support praised though byte 1989 listed a/ux 1.1 among excellence winners byte awards stating could make unix multitasking operating system choice next decade challenge os/2 compared contemporary workstations unix vendors however macintosh hardware lacks features demand paging first two versions a/ux consequently suffer poor performance poor sales users also complained amount disk space uses standard macintosh though comparable unix system august 1992 issue infoworld author favorably reviewed a/ux 3.0 describing open systems solution macintosh heart apple finally gets unix right praised gui single-button point-and-click installer one year personal tech support graphical help dialogs user manuals saying a/ux defies stereotype unix difficult use easiest version unix learn list price much higher much weaker competing pc operating systems system 7 os/2 ms-dos windows 3.1 low compared prevailing proprietary unix licenses review found system speed acceptable great even fastest quadra 950 blaming software incomplete unix optimization found apple hardware though good value system price-performance ratio judged altogether uncompetitive sun sparcstation 2 reviewers thought unlikely users want buy macs run a/ux would awarded infoworld top score os proprietary macintosh hardware tony bove bove rhodes report generally complained f unix super-users compelling reason buy apple unix apple a/ux always way sell macs unix check-off item users a/ux requires specific raw hardware access execution a/ux within macintosh emulation software impossible 2014 introduction macintosh ii emulator named shoebill vintage a/ux users one central repository a/ux applications internet server nasa called jagubox administered jim jagielski also editor a/ux faq", + "neighbors": [ + 63, + 99, + 106, + 134, + 195, + 252, + 322, + 356, + 380, + 413, + 443, + 477, + 595, + 754, + 797, + 858, + 877, + 901, + 927, + 941, + 954, + 957, + 1022, + 1049, + 1100, + 1138, + 1140, + 1301, + 1373 + ], + "mask": "Validation" + }, + { + "node_id": 476, + "label": 4, + "text": "Agnitum:agnitum agnitum ltd founded 1999 st. petersburg russia software company 2000 agnitum hired 2 developers increased number staff people 20 2002 agnitum originally focused anti-trojan pc connections monitoring solutions targeted windows pcs users company known mostly personal firewall internet security products provider outpost firewall pro flagship product company released 2002 together freeware solution updated 2009 agnitum products mostly consumer-oriented taking account licensing agnitum products technologies several national security software publishers january 14 2016 agnitum confirmed official blog company acquired yandex december 2015 february 28 2017 final phase sale yandex agnitum site user forum shut agnitum established software producer 1999 st. petersburg russia two students baltic state technical university distributing software online shareware agnitum sold niche software entering 2002 pc firewalls market agnitum software become rather popular 2002 agnitum began formally implement international distribution strategy putting place agreements partners major european markets well germany italy spain poland 2003 2006 agnitum strengthened european american far east market positions personal firewall engine company became basis company products thus integrated several firms security solutions partnering security vendors provide personal firewall anti-spyware technologies 2003-2006 agnitum announced contracts anti-virus solutions vendors whole re-branded software part vendor suite sophos uk usa lavasoft sweden novell usa virusbuster hungary others 2006 agnitum criticized microsoft onecare firewall agnitum claimed leaks faced simplest attacks programs test firewalls leaks agnitum chief software architect posted less-than-glowing assessment microsoft windows firewall part company entry security software business 2006 agnitum entered strategic alliance virusbuster experienced anti-virus vendor hungary agnitum aimed enter market internet security suite solutions compete anti-virus vendors kaspersky zonelabs etc already integrated personal firewalls personal security solutions mostly personal anti-viruses additional spyware adware spam web content filtering engines 2007-2008 agnitum finally entered market anti-virus solutions anti-virus products began participating international domestic test labs tests virus bulletin vb100 anti-malware.ru anti-virus tests outpost firewall pro tested leaktests killtests independent research portals 2009 2010 agnitum released 2 freeware editions outpost software outpost firewall pro free edition outpost security suite free continue competition well-known zonealarm comodo free pc firewall vendors agnitum first software products anti-trojan tool tauscan pc connections monitoring tool jammer anti-trojan software tauscan occasionally achieved attention media received awards jammer focused detecting blocking attacks hackers prototype outpost personal firewall launched simultaneously \u201c free \u201d \u201c pro \u201d versions march 2002 march 2007 agnitum released free anti-spam plug-in filtering microsoft outlook outlook express mail supports bat since 2008 may 2007 agnitum released combined internet security suite solution \u2014 outpost security suite pro ossp proactive solution basis outpost firewall agnitum anti-spam licensed anti-virus combined agnitum anti-spyware october 2007 agnitum released microsoft vista-compatible outpost 2008 products outpost firewall pro began pass leak-tests kill-tests matousec transparent security firewall challenge project independent project proactive security software testing 2010 agnitum released extension freeware solution outpost security suite free include anti-virus anti-spyware anti-spam free internet security suite moment agnitum security products available following languages english german french spanish russian default also lot localized outpost software versions like italian polish hungarian japanese traditional simplified chinese korean turkish dutch brazilian portuguese agnitum firewall anti-spyware anti-virus engines became almost independent products several security companies licensing agnitum technologies integrate products list companies made publicity licensing novell novell os client security agent sophos corporate edition client agent bullguard internet security solution lavasoft personal firewall client agent cat/quickheal indian anti-virus solutions vendor total security solution", + "neighbors": [ + 17, + 94, + 120, + 134, + 189, + 217, + 379, + 569, + 576, + 648, + 656, + 685, + 717, + 731, + 842, + 910, + 938, + 944, + 961, + 965, + 1038, + 1101, + 1239, + 1250, + 1257, + 1291, + 1350, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Validation" + }, + { + "node_id": 477, + "label": 2, + "text": "WatchOS:watchos watchos operating system apple watch developed apple inc based ios operating system many similar features released april 24 2015 along apple watch device runs watchos api called watchkit second version watchos 2 included support native third-party apps improvements released september 21 2015 third version watchos 3 released september 13 2016 emphasizing better performance including new watch faces stock apps fourth version watchos 4 released september 19 2017 fifth version watchos 5 released september 17 2018 adding third-party support new workouts along \u201c walkie-talkie \u201d feature sixth version watchos 6 announced june 3 2019 home screen rendered also known carousel composed circular application icons zoomed digital crown dragged launched touching display many apps miniaturized simplified versions ios counterparts prior watchos 3 glances provided fast access summarized view popular native third party applications used apple watch glances view opened swipe gesture watch face screen watchos 3 glances replaced redesigned control center much like one ios friends menu invoked side button acts dedicated dock apps different actions options appear depending user taps deep presses apple watch detects pressure-sensitive force touch display several years apple developing healthkit product bid change way people interact devices also conscious attempt penetrate lucrative healthcare wellness industry many observers believe hold huge growth opportunity apple confirmed jony ive apple chief designer interview said health crucial element apple watch since day inception developmental trajectory hardware watchos geared towards health-based capabilities ive pointed one primary apps shipped first watchos allowed users track communicate well encourage move exercise stand said many us phones us time \u2019 connected imagine something powerful times opportunities might present user opportunity phenomenal particularly \u2019 understand today terms technology capability headed.one recent updates watchos included applications keep users active also diagnose illnesses example app called deepheart deep learning network detect atrial fibrillation hypertension sleep apnea diabetes taps healthkit platform collect data particularly collected apple watch heart sensor watchos 5 first shown public san jose wwdc developer conference held apple instant watch-to-watch walkie-talkie mode first version watchos support first generation apple watch apple announced new version watchos contain features app store calculator tip tools audiobooks app apple voice memos app", + "neighbors": [ + 1, + 9, + 22, + 33, + 37, + 38, + 42, + 55, + 58, + 63, + 64, + 71, + 75, + 99, + 101, + 106, + 113, + 121, + 130, + 134, + 162, + 170, + 171, + 185, + 189, + 195, + 214, + 228, + 252, + 265, + 269, + 290, + 298, + 306, + 322, + 337, + 345, + 353, + 356, + 380, + 387, + 394, + 395, + 403, + 434, + 443, + 465, + 475, + 477, + 489, + 511, + 520, + 527, + 551, + 583, + 596, + 607, + 610, + 625, + 634, + 650, + 664, + 696, + 720, + 721, + 754, + 797, + 810, + 858, + 877, + 884, + 891, + 899, + 901, + 917, + 927, + 941, + 945, + 954, + 956, + 957, + 961, + 966, + 972, + 992, + 996, + 1001, + 1011, + 1012, + 1020, + 1024, + 1040, + 1049, + 1051, + 1053, + 1054, + 1057, + 1063, + 1100, + 1138, + 1140, + 1178, + 1189, + 1190, + 1201, + 1202, + 1224, + 1237, + 1252, + 1262, + 1292, + 1301, + 1304, + 1305, + 1322, + 1334, + 1339, + 1373, + 1391, + 1394, + 1409, + 1415, + 1441, + 1456, + 1488, + 1496, + 1530, + 1544, + 1546, + 1578, + 1591, + 1602, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 478, + "label": 8, + "text": "WebMacro:webmacro webmacro framework developing java servlets enforces model-view-controller framework project allowing clean separation concerns design particular webmacro keeps program source code absolutely separate presentation html code webmacro open source software webmacro initially created designed justin wells semiotek inc. mid-2000 project taken team sourceforge extensive discussions webmacro java servlet-interest mailing list time may influential sun microsystems decision move java server pages product model-view-controller architecture webmacro also used generate arbitrary text output templates one uses automated code generation template language similar language used apache velocity automated script perform migration apache velocity project started clean room re-implementation jon scott stevens geir magnusson jason van zyl agreement could reached adoption apache license current version webmacro bsd licensed", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 479, + "label": 4, + "text": "Data-centric_security:data-centric security data-centric security approach security emphasizes security data rather security networks servers applications data-centric security evolving rapidly enterprises increasingly rely digital information run business big data projects become mainstream data-centric security also allows organizations overcome disconnect security technology objectives business strategy relating security services directly data implicitly protect relationship often obscured presentation security end common processes data-centric security model include technical point view information data -centric security relies implementation following data access control selective restriction access data accessing may mean viewing editing using defining proper access controls requires map information resides important important sensitive data designing appropriate controls encryption proven data-centric technique address risk data theft smartphones laptops desktops even servers including cloud one limitation encryption always effective network intrusion occurred cybercriminals operate stolen valid user credentials data masking process hiding specific data within database table cell ensure data security maintained sensitive information exposed unauthorized personnel may include masking data users developers third-party outsourcing vendors etc data masking achieved multiple ways duplicating data eliminate subset data needs hidden obscuring data dynamically users perform requests monitoring activity data layer key component data-centric security strategy provides visibility types actions users tools requested authorized specific data elements continuous monitoring data layer combined precise access control contribute significantly real-time detection data breaches limits damages inflicted breach even stop intrusion proper controls place 2016 survey shows organizations still n't assess database activity continuously lack capability identify database breaches timely fashion cloud computing evolving paradigm tremendous momentum unique aspects exacerbate security privacy challenges heterogeneity diversity cloud services environments demand fine-grained access control policies services flexible enough capture dynamic context attribute-based access requirements data protection recent decades many organizations rely managing database services public clouds amazon web services oracle cloud google cloud platform microsoft azure organize data approach limitations users managing security sensitive data instance hardware security appliances agents running database servers longer option requires innovative ways secure data databases using reverse proxy sitting clients applications database servers requirements supporting load balancing high availability fail-over data-centric security brings additional challenges database security vendors must meet", + "neighbors": [ + 11, + 144, + 149, + 293, + 310, + 338, + 379, + 439, + 518, + 528, + 576, + 611, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 898, + 1019, + 1039, + 1090, + 1112, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1472, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 480, + "label": 8, + "text": "BigQuery:bigquery bigquery restful web service enables interactive analysis massive datasets working conjunction google storage serverless platform service paas may used complementarily mapreduce limited testing period 2010 bigquery generally available november 2011 google atmosphere conference april 2016 european users service suffered 12-hour outage may 2016 support announced google sheets bigquery provides external access dremel technology scalable interactive ad hoc query system analysis read-only nested data bigquery requires requests authenticated supporting number google-proprietary mechanisms well oauth", + "neighbors": [ + 24, + 41, + 77, + 131, + 176, + 182, + 216, + 422, + 502, + 547, + 553, + 556, + 559, + 611, + 671, + 704, + 715, + 775, + 777, + 837, + 936, + 962, + 1019, + 1036, + 1061, + 1082, + 1129, + 1185, + 1259, + 1265, + 1310, + 1371, + 1377, + 1411, + 1416, + 1419, + 1431, + 1480, + 1500, + 1596 + ], + "mask": "Validation" + }, + { + "node_id": 481, + "label": 4, + "text": "Distributed.net:distributed.net distributed.net distributed computing effort attempting solve large scale problems using otherwise idle cpu gpu time governed distributed computing technologies incorporated dcti non-profit organization u.s. tax code 501 c 3 distributed.net working rc5-72 breaking rc5 72-bit key ogr-28 searching optimal 28-mark golomb ruler rc5-72 project pace exhaust keyspace 150 years although project end whenever required key found problems part series ogr part infinite series rc5 eight unsolved challenges rsa security although may 2007 rsa security announced would longer providing prize money correct key secret key challenges distributed.net decided sponsor original prize offer finding key result 2001 distributed.net estimated throughput 30 tflops 2009 throughput estimated much higher coordinated effort started february 1997 earle ady christopher g. stach ii hotjobs.com new media labs effort break rc5-56 portion rsa secret-key challenge 56-bit encryption algorithm 10,000 usd prize available anyone could find key unfortunately initial effort suspended result syn flood attacks participants upon server new independent effort named distributed.net coordinated jeffrey a. lawson adam l. beberg david c. mcnett along several others would serve board operate infrastructure late march 1997 new proxies released resume rc5-56 work began enhanced clients cow head selected icon application project mascot rc5-56 challenge solved october 19 1997 250 days correct key 0x532b744cc20999 plaintext message read unknown message time move longer key length rc5-64 challenge solved july 14 2002 1,757 days correct key 0x63de7dc154f4d039 plaintext message read unknown message things better left unread search ogrs order 24 25 26 27 completed distributed.net 13 october 2004 25 october 2008 24 february 2009 19 february 2014 respectively dnetc file name software application users run participate active distributed.net project command line program interface configure available wide variety platforms distributed.net refers software application simply client volunteers running 32-bit windows ati/amd stream enabled gpus contributed processing power rc5-72 project volunteers running 64-bit gnu/linux contributed processing power ogr-28 project portions source code client publicly available although users permitted distribute modified versions distributed.net rc5-72 ogr-28 projects available boinc client moo wrapper yoyo home projects respectively recent years work rc5-72 project submitted clients run gpu modern graphics cards although project already underway almost 6 years first gpus began submitting results march 2018 gpus represent 78 completed work units complete nearly 93 work units day", + "neighbors": [ + 137, + 270, + 274, + 289, + 317, + 528, + 847, + 909, + 1503 + ], + "mask": "Validation" + }, + { + "node_id": 482, + "label": 7, + "text": "IBM_Websphere_Business_Events:ibm websphere business events websphere business events ibm implementation event-processing engine event processing involves altering existing server software organization emit events small messages whenever notable event occurs event-processing software software monitor events look certain patterns interest useful prevention credit card fraud giving executives high-level view going company e.g share price drops extended period time detailed description see complex event processing software components following details websphere business events released june 2008 based upon acquisition aptsoft software", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 483, + "label": 4, + "text": "Cisco_PIX:cisco pix cisco pix private internet exchange popular ip firewall network address translation nat appliance one first products market segment 2005 cisco introduced newer cisco adaptive security appliance cisco asa inherited many pix features 2008 announced pix end-of-sale pix technology sold blade firewall services module fwsm cisco catalyst 6500 switch series 7600 router series reached end support status september 26 2007 pix originally conceived early 1994 john mayes redwood city california designed coded brantley coile athens georgia pix name derived creators aim creating functional equivalent ip pbx solve then-emerging registered ip address shortage time nat investigated viable approach wanted conceal block blocks ip addresses behind single multiple registered ip addresses much pbxs internal phone extensions began rfc 1597 rfc 1631 discussed now-familiar rfc 1918 yet submitted design testing carried 1994 john mayes brantley coile johnson wu network translation inc. brantley coile sole software developer beta testing pix serial number 000000 completed first customer acceptance december 21 1994 kla instruments san jose california pix quickly became one leading enterprise firewall products awarded data communications magazine hot product year award january 1995 shortly cisco acquired network translation november 1995 mayes coile hired two longtime associates richard chip howes pete tenereillo shortly acquisition 2 longtime associates jim jordan tom bohannon together continued development finesse os original version cisco pix firewall known pix classic time pix shared code another cisco product localdirector january 28 2008 cisco announced end-of-sale end-of-life dates cisco pix security appliances software accessories licenses last day purchasing cisco pix security appliance platforms bundles july 28 2008 last day purchase accessories licenses january 27 2009 cisco ended support cisco pix security appliance customers july 29 2013 may 2005 cisco introduced asa combines functionality pix vpn 3000 series ips product lines asa series devices run pix code 7.0 later pix os release 7.x pix asa use software images beginning pix os version 8.x operating system code diverges asa using linux kernel pix continuing use traditional finesse/pix os combination pix runs custom-written proprietary operating system originally called finese fast internet service executive software known simply pix os though classified network-layer firewall stateful inspection technically pix would precisely called layer 4 transport layer firewall access restricted network layer routing socket-based connections port ip address port communications occur layer 4 default allows internal connections outbound traffic allows inbound traffic response valid request allowed access control list acl conduit administrators configure pix perform many functions including network address translation nat port address translation pat well serving virtual private network vpn endpoint appliance pix became first commercially available firewall product introduce protocol specific filtering introduction fixup command pix fixup capability allows firewall apply additional security policies connections identified using specific protocols protocols specific fixup behaviors developed include dns smtp dns fixup originally implemented simple effective security policy allowed one dns response dns server internet known outside interface dns request client protected known inside interface inspect superseded fixup later versions pix os cisco pix also one first commercially available security appliances incorporate ipsec vpn gateway functionality administrators manage pix via command line interface cli via graphical user interface gui access cli serial console telnet ssh gui administration originated version 4.1 several incarnations cisco acquired pix network translation cli originally align cisco ios syntax starting version 7.0 configuration became much ios-like original nti pix pix classic cases sourced oem provider appro flash cards early encryption acceleration cards pix-pl pix-pl2 sourced productivity enhancement products pep later models cases cisco oem manufacturers pix constructed using intel-based/intel-compatible motherboards pix 501 used amd 5x86 processor standalone models used intel 80486 pentium iii processors pix boots proprietary isa flash memory daughtercard case nti pix pix classic 10000 510 520 535 boots integrated flash memory case pix 501 506/506e 515/515e 525 ws-svc-fwm-1-k9 latter part code pix technology implemented fire wall services module catalyst 6500 7600 router adaptive security appliance network firewall made cisco introduced 2005 replace cisco pix line along stateful firewall functionality another focus asa virtual private network vpn functionality also features intrusion prevention voice ip asa 5500 series followed 5500-x series 5500-x series focuses virtualization hardware acceleration security modules 2005 cisco released 5510 5520 5540 models asa continues using pix codebase asa os software transitioned major version 7.x 8.x moved finesse/pix os operating system platform linux operating system platform also integrates features cisco ips 4200 intrusion prevention system cisco vpn 3000 concentrator asa continues pix lineage intel 80x86 hardware cisco pix vpn product hacked nsa-tied group equation group somewhere 2016 equation group developed tool code-named benigncertain reveals pre-shared password attacker cve-2016-6415 equation group later hacked another group called shadow brokers published exploit publicly among others according ars technica nsa likely used vulnerability wiretap vpn-connections decade citing snowden leaks cisco asa-brand also hacked equation group vulnerability requires ssh snmp accessible attacker codename given exploit nsa extrabacon bug exploit cve-2016-6366 also leaked shadowbrokers batch exploits backdoors according ars technica exploit easily made work modern versions cisco asa leaked exploit handle 29th january 2018 security problem cisco asa-brand disclosed cedric halbronn ncc group use free-bug secure sockets layer ssl vpn functionality cisco adaptive security appliance asa software could allow unauthenticated remote attacker cause reload affected system remotely execute code bug listed cve-2018-0101", + "neighbors": [ + 134, + 455, + 542, + 569, + 779, + 813, + 1045, + 1121, + 1138, + 1452 + ], + "mask": "Test" + }, + { + "node_id": 484, + "label": 2, + "text": "Nokia_N900:nokia n900 nokia n900 smartphone made nokia supersedes nokia n810 default operating system maemo 5 linux-based os originally developed nokia 770 internet tablet first nokia device based upon texas instruments omap3 microprocessor arm cortex-a8 core unlike three nokia internet tablets preceding nokia n900 first maemo device include phone functionality quad-band gsm 3g umts/hsdpa n900 functions mobile internet device includes e-mail web browsing access online services 5-megapixel digital camera still video photography portable media player music video calculator games console word processor sms well mobile telephony using either mobile network voip via internet mobile wi-fi maemo provides x-terminal interface interacting core operating system launched nokia world 2 september 2009 released 11 november 2009 united states 9 european countries n900 launched alongside maemo 5 giving device overall touch-friendly interface predecessors customizable home screen mixes application icons shortcuts widgets maemo 5 supports adobe flash player 9.4 includes many applications designed specifically mobile platform new touch-friendly media player nokia n900 announced 17 september 2008 keynote presentation dr. ari jaaksi nokia new supported features announced maemo 5 cellular connectivity 3g/hspa ti omap3 processor high definition camera support news backward compatibility older internet tablets time frame established release pre-alpha maemo 5 software development kit december 2008 targeted exclusively omap3 architecture revamped user interface included support hardware graphics acceleration functionalities found internet tablets time cellular data connectivity high definition camera support first photo specifications n900 codenamed rover developed came may 2009 release fcc approval documents august 2009 confirmed device provided second codename rx-51 nokia n900 officially announced 2 september 2009 nokia world 2009 germany nokia says step 4 5 line maemo devices started 2005 nokia 770 device initially available selected markets starting november 2009 4 december uk retail price \u20ac599 finland germany italy netherlands spain \u20ac649 france 2499 z\u0142 poland 5995 kr sweden \u00a3499 united kingdom prices including vat excluding subsidies retail price launch us 649 united states excluding sales taxes subsidies available canada independent retailers around c 800 march 2010 nokia site australia lists n900 homepage hinting launch time near future black color available launch initially availability extremely limited leading delays statement nokia higher pre-order demand expected nokia n900 launched hong kong 29 may 2010 added features facilitate character handwriting input price launch 4998 hkd already released australia via optus nokia n900 powered omap 3430 arm cortex-a8 system-on-a-chip made texas instruments based 65 nanometer cmos process omap 3430 composed three microprocessors cortex a8 running 600 mhz 1.15 ghz correct overclocking used run os applications powervr sgx530 gpu made imagination technologies supports opengl es 2.0 capable 14 mpolys/s tms320c64x digital signal processors running 430 mhz used run image processing camera audio processing telephony data transmission tms320 c64x main purpose offload cortex a8 process audio video signal moreover omap 3430 n900 devices successfully over-clocked 1150 mhz using modified kernel editing kernel power configuration file system 256 mb dedicated high performance ram mobile ddr paired access 768 mb swap space managed os provides total 1 gb virtual memory nokia n900 resistive touchscreen resolution 800 \u00d7 480 pixel wvga 267 ppi according nokia xorg.log capable displaying 65k colours 565 rgb nokia n900 camera capability 2592x1944 pixels carl zeiss optics autofocus dual led flash video light geo-tagging lcd transflective permit usability wide range luminosity daylight dark haptic feedback provided touchscreen input applying small vibration sound user choose whether feature enabled stylus provided allow precise touch input access smaller user interface elements 3-axis accelerometer allows orientation screen change portrait landscape mode certain applications used user input games applications dashboard desktop active rotating device landscape portrait mode activates phone application feature also disabled user discretion update pr1.2 became possible view web pages portrait mode developers may add support portrait mode applications desired proximity sensor deactivates display touchscreen device brought near face call slide-out 4-row keyboard d-pad nokia n810 replaced nokia n900 slide-out 3-row backlit keyboard arrow keys previous internet tablets on-screen keyboard also available addition english qwerty layout slide keyboard available variants italian french german russian czech nordic finnish swedish spanish nokia n900 ambient light sensor adjusts display brightness activates backlit keyboard os comes word prediction software configured user preferences auto capitalization word completion auto spacing words device autonomous gps optional a-gps functionality comes pre-loaded ovi maps application ovi maps provides typical mapping features alternate views 3d landmarks satellite hybrid maps address/places interest searching route planning although turn-by-turn navigation yet 5-megapixel back camera autofocus feature dual led flash 4:3 16:9 aspect ratio options 3\u00d7 digital zoom focal length camera 5.2 mm aperture f/2.8 focus range 10 cm infinity capable video recording 848 \u00d7 480 pixels 25 fps lens use protected sliding hatch opening hatch launches camera application although 0.3-megapixel front camera capable video recording 640 \u00d7 480 pixels pre-production units could used video calls ip using google talk retail version delivered without software enabling video calling video chatting update pr1.2 ota over-the-air skype video calling added enabling fascia camera software updates phone becomes capable play/record/stream 720p video holding device facing screen top left right rocking buttons function volume up/down zoom in/out depending context power on/off camera button pressing power button brings menu change profile activate offline mode a.k.a airplane flight mode turns emitted signals lock device either secure key code simple lock option end current task nokia n900 fewer hardware buttons makes use touchscreen display on-screen buttons example accept reject end call n900 microphone stereo speakers located side device 3.5 mm four-contact trrs connector simultaneously provides stereo audio output either microphone input video output pal ntsc tv possible using nokia video connectivity cable included upon purchase standard trrs 3x rca cable high-speed usb 2.0 usb micro-b connector provided data synchronization mass storage mode client battery charging micro-usb connector prone failure nokia n900 unlike previous versions nokia internet tablet n't enabled support usb on-the-go ability act usb host default order meet deadlines production usb certification ongoing community effort add support subsequently currently software beta stage requiring non-standard usb cable usb a-a adapter software development repository built-in bluetooth v2.1 supports wireless earpieces headphones hsp profile nokia n900 supports hardware capable stereo audio output a2dp profile built-in car hands-free kits also supported hfp profile file transfer supported ftp along opp profile sending/receiving objects possible remote control device avrcp profile dun profile permits access internet laptop dialing mobile phone wirelessly tethering hid profile provides support devices bluetooth keyboards pan profile networking using bluetooth unsupported enabled bluetooth set also functions fm receiver allowing one listen fm radio n900 also 88.1\u2013107.9 mhz fm transmitter example play music separate radio note fm transmitter frequency range extended 76.0\u2013107.9 mhz community supported modifications operating system furthermore nokia n900 wi-fi b/g connectivity support wep wpa wpa2 aes/tkip security protocols nokia n900 synchronize microsoft outlook activesync various e-mail calendar clients syncml bluetooth micro-usb contact information also exchanged via vcard file format supported commonly e-mail programs including evolution microsoft outlook device also features infrared port compatible irda used turn nokia n900 remote controller using third-party software battery life shipped bl-5j 1320mah battery n900 seems deficient able make full working day internet connection call usage press release nokia stated aiming one day full usage always online 2-4 days tcp/ip connected active online usage 1+ day early reports users range 12 hours wi-fi web browsing video gps 2 days online used continuously value appears highly dependent user choice background software active desktop widgets im email polling well mobile network signal quality especially 3g cases software bugs nokia reported talk times around 9 hours gsm 5 hours 3g battery life extended significantly switching gps/a-gps wi-fi bluetooth replacing 3g 2g gprs previous internet tablets used larger batteries 1500 mah compared n900 1320 mah based less efficient microprocessor typical battery time nokia n810 around 7 hours continuous full usage display wi-fi principle n900 figures expected much higher third party extended batteries 2400 mah capacity available n900 also community supported modifications performed 3rd party n900 compatible batteries usually involving putting two said batteries parallel increase effective battery capacity nokia n900 3000 mah sim card located battery accessed removing back panel nokia n900 microsd hc card socket also located back cover battery tool necessary remove back panel nokia n900 32 gb emmc 256 mb nand non-removable storage additional storage available via hot swappable microsdhc card socket claimed support 200 gb additional storage however sdhc specification supports cards 32 gb size difficulty reported use 64+ gb sdxc cards sandisk claims sdxc cards compatible n900 hot swapping achieved via software-supported magnetic sensor detects removal back cover partition residing microsdhc card unmounted back cover removed microsdhc card formatted supported file system ext2 ext3 fat16 fat32 32 gb emmc split 3 partitions 256 mb nand formatted ubifs contains bootloader kernel image root directory 100 mb free space programs larger 500 kb including dependencies stored /opt symlinked /home/opt therefore located 2 gb ext3 partition vfat partition also available storage needs used carefully unmounted exported usb cable connected device maemo 5 also known fremantle default operating system nokia n900 maemo 5 nokia adaptation linux desktop environment pocket-sized device ui fully customizable user able move widgets around add/remove widgets change background add shortcuts applications n900 comes preloaded variety applications 1500 additional applications overwhelming majority free download use created 3rd party developers custom kernels also available via app manager users need devices maemo uses upstart reduce boot time application called easy debian installs debian lxde image internal memory enabling applications iceweasel firefox browser openoffice.org suite run within maemo applications synaptic package manager included debian installation gimp run within lxde interface software also added debian using maemo chroot utility using synaptic apt-get command line stellarium zim desktop wiki accessed either via lxde desktop icons program manager shortcuts desktop nokia n900 sim application toolkit available also known operator menu possible use services require result support sim interact directly outside world initiate commands independently handset network making n900 vulnerable installation malicious sim java applications via text messages issues various value-added services resulting availability sim application toolkit include following nokia often offers new n8 e7 devices warranty replacements n900s although warranty terms consumer rights legislation differ across jurisdictions users reported success refusing pressing n900 least eu india recently august 2011 owners confident getting n900 warranty replacement often attempt repair devices sell nokia-provided replacement buy n900 instead n900 proximity sensor designed lock touch screen phone user ear prevent accidental operation locks screen unintentionally bright light usually outdoors call placed received nokia acknowledged hardware issue addressed unlock screen phone call tactile unlock switch right side device used however keep touch screen active accidental operation phone keys call may occur device used handset issue blamed application screen protectors however n900 users without screen protectors also experiencing problem n900 microusb charger port fragile people successfully fixed problem either epoxy glue resoldering usb port onto circuit board chips n900 gsm module might badly soldered circuit board resulting multiple n900 devices reported troubled inability sim card detected issue fixable putting something gsm-related chips shielding though proper fix would reballing announced may 2010 nokia n900 last mobile communication device running maemo 5 operating system replaced meego nokia continue support n900 updates necessary transition succeeding meego operating system possible mainly interest developers rather consumers officially supported nokia interest within user community working backporting meego developments maemo n900 places interesting device people within wider open source community consumers download meego operating system available officially supported nokia nokia used say meego going succeed maemo new devices however 11 february 2011 nokia announced primarily concentrating alliance microsoft meego development stopped one meego device become available 2011 3 march 2011 jukka eklund product manager meego os nokia announced meego-dev mailing list meego 1.2 developer edition n900 developed dedicated nokia team led mika leppinen target particular edition usable primary phone device developer/hacker person regular end users september 2011 announcement intel linux foundation abandoning meego favor tizen prompted developer community begin seriously doubt future meego n900 meego developer edition rename meego community edition evolved nemo based mer currently october 2012 actively developed nitdroid project ports android devices alternate operating system also available n900 however little progress made achieving voice calling nitdroid n900 main developer goes online handle e-yes moved developing devices nokia n9 community-based project aiming provide hardware upgrade n900 called neo900 began late 2013 collaboration openmoko maemo communities hardware upgrade quadruple device ram provide processor nearly twice fast one original n900 integrate additional sensors gyroscope compass likely modern lte modem also included", + "neighbors": [ + 3, + 21, + 134, + 162, + 238, + 253, + 264, + 267, + 270, + 309, + 355, + 527, + 571, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1051, + 1117, + 1138, + 1203, + 1225, + 1232, + 1313, + 1314, + 1422, + 1451, + 1493, + 1503, + 1522, + 1529, + 1616, + 1619 + ], + "mask": "Test" + }, + { + "node_id": 485, + "label": 2, + "text": "Microsoft_Tinker:microsoft tinker tinker also known microsoft tinker puzzle video game developed fuel industries player controls robot various mazes obstacle courses originally released september 23 2008 part windows ultimate extras contained 60 levels including 20-level tutorial free map editor level builder also released however compatible games windows \u2013 live version tinker compatible windows ultimate extras version december 15 2009 expanded live-enabled version game released games windows \u2013 live client game available windows xp windows vista windows 7 including users access windows vista ultimate extras windows vista editions contains 160 levels including tutorial version also 15 achievements worth 200g similar many xbox live arcade games like every games windows live game requires user sign using gamertag assigned windows live id however windows vista ultimate extras version requirement tinker spatial/environmental puzzle game players must guide robot end point moving objects activating switches traversing obstacles playing field square board divided checkerboard pattern robot given limited number moves make runs energy player must guide goal marker without expiring motions essentially action robot makes counts move including taking step activating switch turning around players must carefully plan actions stage waste moves players replenish robot energy collecting batteries thus extend possible number moves allowed make players earn achievement star level completing course par time energy cog collection cogs exist level obstacles objects present levels include movable objects pushed pulled two objects row pushed even movable objects stacked top pushed bottom object movable e.g. tower consisting two dice blocks metal block moved one dice blocks bottom attempting push immovable object row objects result wasted move though attempting walk obstacle waste move robot destroyed rendered inoperable hit laser beam falling height greater two blocks running energy hazards destroy robot process reaching exit e.g. robot walks laser beam crosses exit square hazard trumps exit robot destroyed however level completed exit reached zero energy live-enabled version tinker previously possible earn achievement star set 07 level 19 due energy par value -1 player could unlock perfection achieved achievement thus able obtain 175 achievement points 200 fuel industries game developer nick iannitti mentioned tinker blog fix sent gfwl march 7 2010 fix hours removed due bug auto-update code required unnecessary reboot update officially released april 10 2010 making perfection achieved achievement obtainable", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 486, + "label": 3, + "text": "P6_(microarchitecture):p6 microarchitecture p6 microarchitecture sixth-generation intel x86 microarchitecture implemented pentium pro microprocessor introduced november 1995 frequently referred i686 succeeded netburst microarchitecture 2000 eventually revived pentium line microprocessors successor pentium variant p6 microarchitecture core microarchitecture turn also derived p6 microarchitecture p6 core sixth generation intel microprocessor x86 line first implementation p6 core pentium pro cpu 1995 immediate successor original pentium design p5 p6 processors dynamically translate ia-32 instructions sequences buffered risc-like micro-operations analyze reorder micro-operations order detect parallelizable operations may issued one execution unit pentium pro first x86 chip use technique \u2014 nexgen nx586 introduced 1994 also used \u2014 first intel x86 chip techniques first used x86 space p6 core include p6 architecture lasted three generations pentium pro pentium iii widely known low power consumption excellent integer performance relatively high instructions per cycle ipc p6 line processing cores succeeded netburst p68 architecture appeared introduction pentium 4 completely different design based use long pipelines favoured high clock speed cost lower ipc higher power consumption upon release pentium 4-m mobile pentium 4 quickly realized new mobile netburst processors ideal mobile computing netburst-based processors simply efficient per clock per watt compared p6 predecessors mobile pentium 4 processors ran much hotter pentium iii-m processors n't offer significant performance advantages inefficiency affected cooling system complexity also all-important battery life realizing new microarchitecture n't best choice mobile space intel went back drawing board design would optimally suited market segment result modernized p6 design called pentium design overview pentium power efficient x86 processor notebooks several years consuming maximum 27 watts maximum load 4-5 watts idle processing efficiency gains brought modernization allowed rival mobile pentium 4 clocked 1 ghz higher fastest-clocked mobile pentium 4 compared fastest-clocked pentium equipped much memory bus bandwidth first pentium family processors banias internally support pae show pae support flag cpuid information causes operating systems primarily linux distributions refuse boot processors since pae support required kernels yonah cpu launched january 2006 core brand single dual-core mobile version sold core solo core duo pentium dual-core brands server version released xeon lv processors provided partial solutions pentium shortcomings adding resulted interim microarchitecture low-voltage cpus part way p6 following core microarchitecture july 27 2006 core microarchitecture derivative p6 launched form core 2 processor subsequently processors released core microarchitecture core 2 xeon pentium celeron brand names core microarchitecture intel final mainstream processor line use fsb later intel processors based nehalem later intel microarchitectures featuring integrated memory controller qpi dmi bus communication rest system improvements relative intel core processors chips technically derivatives pentium pro architecture gone several radical changes since inception", + "neighbors": [ + 85, + 105, + 234, + 270, + 386, + 388, + 460, + 486, + 508, + 776, + 830, + 837, + 980, + 1002, + 1052, + 1160, + 1161, + 1256, + 1263, + 1351, + 1505, + 1507, + 1518 + ], + "mask": "Test" + }, + { + "node_id": 487, + "label": 4, + "text": "Scareware:scareware scareware form malware uses social engineering cause shock anxiety perception threat order manipulate users buying unwanted software scareware part class malicious software includes rogue security software ransomware scam software tricks users believing computer infected virus suggests download pay fake antivirus software remove usually virus fictional software non-functional malware according anti-phishing working group number scareware packages circulation rose 2,850 9,287 second half 2008 first half 2009 apwg identified 585 increase scareware programs scareware label also apply application virus pranks users intent cause anxiety panic internet security writers use term scareware describe software products produce frivolous alarming warnings threat notices typically fictitious useless commercial firewall registry cleaner software class program tries increase perceived value bombarding user constant warning messages increase effectiveness way software packaged look feel mimics legitimate security software order deceive consumers websites display pop-up advertisement windows banners text computer may infected harmful spyware programs immediate removal may required scan click 'yes websites go far saying user job career marriage would risk products using advertisements often considered scareware serious scareware applications qualify rogue software scareware affiliated installed programs user encounter pop-up website indicating pc infected scenarios possible become infected scareware even user attempts cancel notification popups especially designed look like come user operating system actually webpage 2010 study google found 11,000 domains hosting fake anti-virus software accounting 50 malware delivered via internet advertising starting march 29 2011 1.5 million web sites around world infected lizamoon sql injection attack spread scareware research google discovered scareware using servers check internet connectivity data suggested million machines infected scareware company placed warning search results users whose computers appear infected another example scareware smart fortress site scares people thinking lots viruses computer asks buy professional service forms spyware also qualify scareware change user desktop background install icons computer notification area microsoft windows claiming kind spyware infected user computer scareware application help remove infection cases scareware trojans replaced desktop victim large yellow text reading warning spyware box containing similar text even forced screensaver change bugs crawling across screen winwebsec term usually used address malware attacks users windows operating system produces fake claims similar genuine anti-malware software spysheriff exemplifies spyware scareware purports remove spyware actually piece spyware often accompanying smitfraud infections antispyware scareware may promoted using phishing scam another approach trick users uninstalling legitimate antivirus software microsoft security essentials disabling firewall since antivirus programs typically include protection tampered disabled software scareware may use social engineering convince user disable programs would otherwise prevent malware working 2005 microsoft washington state successfully sued secure computer makers spyware cleaner 1 million charges using scareware pop-ups washington attorney general also brought lawsuits securelink networks high falls media makers quick shield october 2008 microsoft washington attorney general filed lawsuit two texas firms branch software alpha red producers registry cleaner xp scareware lawsuit alleges company sent incessant pop-ups resembling system warnings consumers personal computers stating critical error message registry damaged corrupted instructing users visit web site download registry cleaner xp cost 39.95 december 2 2008 u.s. federal trade commission ftc filed complaint federal court innovative marketing inc. bytehosting internet services llc well individuals sam jain daniel sundin james reno marc \u2019 souza kristy ross complaint also listed maurice \u2019 souza relief defendant alleged held proceeds wrongful conduct accusing violating law ftc alleged defendants violated ftc act deceptively marketing software including winfixer winantivirus drivecleaner errorsafe xp antivirus according complaint defendants falsely represented scans consumer computer showed compromised infected offered sell software fix alleged problems another type scareware involves software designed literally scare user use unanticipated shocking images sounds video", + "neighbors": [ + 11, + 17, + 77, + 144, + 149, + 190, + 293, + 450, + 531, + 564, + 576, + 624, + 692, + 739, + 746, + 818, + 961, + 1090, + 1309, + 1325, + 1379, + 1444 + ], + "mask": "Test" + }, + { + "node_id": 488, + "label": 9, + "text": "Paul_Graham_(programmer):paul graham programmer paul graham born 13 november 1964 english-born computer scientist entrepreneur venture capitalist author essayist best known work lisp former startup viaweb later renamed yahoo store co-founding influential startup accelerator seed capital firm combinator blog hacker news author several programming books lisp 1993 ansi common lisp 1995 hackers painters 2004 technology journalist steven levy described graham hacker philosopher paul graham family moved pittsburgh pennsylvania 1968 attended gateway high school graham received bachelor arts philosophy cornell university 1986 attended harvard university earning master science 1988 doctor philosophy 1990 degrees computer science also studied painting rhode island school design accademia di belle arti florence 1996 graham robert morris founded viaweb first application service provider asp viaweb software written mostly common lisp allowed users make internet stores summer 1998 viaweb sold yahoo 455,000 shares yahoo stock valued 49.6 million acquisition product became yahoo store later gained fame essays posts personal website paulgraham.com essay subjects range beating averages compares lisp programming languages introduced hypothetical programming language blub nerds unpopular discussion nerd life high school collection essays published hackers painters o'reilly includes discussion growth viaweb graham perceives advantages lisp program 2001 graham announced working new dialect lisp named arc years since written several essays describing features goals language internal projects combinator written arc notably hacker news web forum news aggregator program 2005 giving talk harvard computer society later published start startup graham along trevor blackwell jessica livingston robert morris started combinator provide seed funding large number startups particularly started younger technically oriented founders combinator invested 1300 startups including justin.tv xobni dropbox airbnb stripe businessweek included paul graham 2008 edition annual feature 25 influential people web 2008 paul graham married jessica livingston response proposed stop online piracy act sopa graham announced late 2011 representatives company supporting would invited combinator demo day events graham proposed disagreement hierarchy 2008 essay disagree putting types argument seven-point hierarchy observing moving disagreement hierarchy makes people less mean make happier graham also suggested hierarchy thought pyramid highest forms disagreement rarer following hierarchy graham notes articulate forms name-calling e.g author self-important dilettante different crude insults graham considers hierarchy programming languages example blub hypothetically average language right middle abstractness continuum powerful language powerful cobol machine language used graham illustrate comparison beyond turing completeness programming language power specifically illustrate difficulty comparing programming language one knows one one graham considers hypothetical blub programmer programmer looks power continuum considers lower languages less powerful miss feature blub programmer used looks fails realise looking merely sees weird languages unnecessary features assumes equivalent power hairy stuff thrown well graham considers point view programmer using language higher blub describes programmer looking blub noting missing features point view higher language graham describes blub paradox concludes induction programmers position see differences power various languages understand powerful one concept cited writers joel spolsky", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 873, + 919, + 929, + 934, + 947, + 978, + 1021, + 1044, + 1118, + 1119, + 1123, + 1173, + 1180, + 1207, + 1245, + 1246, + 1249, + 1251, + 1277, + 1298, + 1315, + 1372, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609, + 1635 + ], + "mask": "Test" + }, + { + "node_id": 489, + "label": 2, + "text": "IPad_Air_(2019):ipad air 2019 third-generation ipad air tablet computer designed developed marketed apple inc announced march 18 2019 alongside 5th generation ipad mini device similar ipad air 2 10.5-inch ipad pro features apple a12 bionic chip 64 256 gb storage upgraded 10.5-inch retina display support apple pencil 1st generation bluetooth 5.0 faster memory lpddr4x instead ipad air 2 lpddr3 third-generation ipad air features upgraded front camera system 7mp 1080p camera used since 2016 starting iphone 7 continued iphone xs continues older 8mp 1080p rear camera system used since ipad air 2 2014 record 4k ipad air retains lightning port keeps headphone jack third-generation ipad air 2.49ghz six-core processor apple a12 bionic chip chip 66 faster clock speed 1.5ghz triple-core apple a8x third-generation ipad air predecessor ipad air 2 third-generation ipad air true tone display allows lcd adapt ambient lighting change color intensity different environments 3x faster ipad air 2 battery last 10 hours", + "neighbors": [ + 71, + 75, + 130, + 214, + 228, + 252, + 269, + 270, + 356, + 394, + 403, + 477, + 511, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1138, + 1140, + 1178, + 1237, + 1262, + 1292, + 1305, + 1334, + 1339, + 1373, + 1488, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 490, + "label": 4, + "text": "Festi_botnet:festi botnet festi botnet also known alias spamnost botnet mostly involved email spam denial service attacks festi botnet first discovered around autumn 2009 time estimated botnet consisted roughly infected machines spam volume capacity roughly 2.5 billion spam emails day recent estimates dated august 2012 display botnet sending spam unique ip addresses quarter total amount 1 million detected ip sending spam mails besides capable sending email spam research festi botnet demonstrated also capable performing denial service attacks", + "neighbors": [ + 149, + 450, + 522, + 531, + 576, + 666, + 1090, + 1162, + 1358, + 1365, + 1467, + 1543, + 1554 + ], + "mask": "Train" + }, + { + "node_id": 491, + "label": 5, + "text": "Usenet:usenet usenet worldwide distributed discussion system available computers developed general-purpose unix-to-unix copy uucp dial-up network architecture tom truscott jim ellis conceived idea 1979 established 1980 users read post messages called articles posts collectively termed news one categories known newsgroups usenet resembles bulletin board system bbs many respects precursor internet forums widely used today discussions threaded web forums bbss though posts stored server sequentially name comes term users network major difference bbs web forum usenet absence central server dedicated administrator usenet distributed among large constantly changing conglomeration servers store forward messages one another so-called news feeds individual users may read messages post messages local server operated commercial usenet provider internet service provider university employer server usenet culturally historically significant networked world given rise popularized many widely recognized concepts terms faq flame sockpuppet spam 1990s internet became commonly affordable usenet connections via fidonet dial-up bbs networks made long-distance worldwide discussions communication widespread needing server local telephone service usenet conceived 1979 publicly established 1980 university north carolina chapel hill duke university decade world wide web went online general public received access internet making one oldest computer network communications systems still widespread use originally built poor man arpanet employing uucp transport protocol offer mail file transfers well announcements newly developed news software news name usenet emphasized creators hope usenix organization would take active role operation articles users post usenet organized topical categories known newsgroups logically organized hierarchies subjects instance sci.math sci.physics within sci hierarchy science talk.origins talk.atheism talk hierarchy user subscribes newsgroup news client software keeps track articles user read newsgroups majority articles responses article set articles traced one single non-reply article called thread modern newsreaders display articles arranged threads subthreads example wine-making newsgroup rec.crafts.winemaking someone might start thread called best yeast thread conversation might grow dozens replies long perhaps six eight different authors several days conversation different wine yeasts might branch several sub-threads tree-like form user posts article initially available user news server news server talks one servers newsfeeds exchanges articles fashion article copied server server eventually reach every server network later peer-to-peer networks operate similar principle usenet normally sender rather receiver initiates transfers usenet designed conditions networks much slower always available many sites original usenet network would connect twice day batch-transfer messages largely pots network typically used transfers phone charges lower night format transmission usenet articles similar internet e-mail messages difference two usenet articles read user whose news server carries group message posted opposed email messages one specific recipients today usenet diminished importance respect internet forums blogs mailing lists social media usenet differs media several ways usenet requires personal registration group concerned information need stored remote server archives always available reading messages require mail web client news client however possible read participate usenet newsgroups large degree using ordinary internet browsers since newsgroups copied several internet sites groups alt.binaries still widely used data transfer many internet service providers many internet sites operate news servers users access isps operate servers directly often offer users account another provider specifically operates newsfeeds early news implementations server newsreader single program suite running system today one uses separate newsreader client software program resembles email client accesses usenet servers instead clients mozilla thunderbird outlook express provide abilities isps run news servers news server one difficult internet services administer large amount data involved small customer base compared mainstream internet services email web access disproportionately high volume customer support incidents frequently complaining missing news articles isp fault isps outsource news operation specialist sites usually appear user though isp ran server many sites carry restricted newsfeed limited number newsgroups commonly omitted newsfeed foreign-language newsgroups alt.binaries hierarchy largely carries software music videos images accounts 99 percent article data also usenet providers specialize offering service users whose isps carry news carry restricted feed see also news server operation overview news systems implemented newsgroups typically accessed newsreaders applications allow users read reply postings newsgroups applications act clients one news servers although historically usenet associated unix operating system developed newsreaders available major operating systems modern mail clients communication suites commonly also integrated newsreader often however integrated clients low quality compared standalone newsreaders incorrectly implement usenet protocols standards conventions many integrated clients example one microsoft outlook express disliked purists misbehavior rise world wide web www web front-ends web2news become common web front ends lowered technical entry barrier requirements one application usenet nntp server account numerous websites offering web based gateways usenet groups although people begun filtering messages made web interfaces one reason another google groups one web based front end web browsers access google groups via news protocol links directly minority newsgroups moderated meaning messages submitted readers distributed directly usenet instead emailed moderators newsgroup approval moderator receive submitted articles review inject approved articles properly propagated worldwide articles approved moderator must bear approved header line moderators ensure messages readers see newsgroup conform charter newsgroup though required follow rules guidelines typically moderators appointed proposal newsgroup changes moderators follow succession plan historically mod hierarchy existed usenet reorganization moderated newsgroups may appear hierarchy typically .moderated added group name usenet newsgroups big-8 hierarchy created proposals called request discussion rfd rfd required following information newsgroup name checkgroups file entry moderated unmoderated status group moderated least one moderator valid email address must provided information beneficial required includes charter rationale moderation policy group moderated discussion new newsgroup proposal follows finished members big-8 management board making decision vote either approve disapprove new newsgroup unmoderated newsgroups form majority usenet newsgroups messages submitted readers unmoderated newsgroups immediately propagated everyone see minimal editorial content filtering vs propagation speed form one crux usenet community one little cited defense propagation canceling propagated message usenet users use command news readers offer cancellation commands part article storage expires relatively short order anyway almost unmoderated usenet groups become collections spam usenet set protocols generating storing retrieving news articles resemble internet mail messages exchanging among readership potentially widely distributed protocols commonly use flooding algorithm propagates copies throughout network participating servers whenever message reaches server server forwards message network neighbors n't yet seen article one copy message stored per server server makes available demand typically local readers able access server collection usenet servers thus certain peer-to-peer character share resources exchanging granularity exchange however different scale modern peer-to-peer system characteristic excludes actual users system connect news servers typical client-server application much like email reader rfc 850 first formal specification messages exchanged usenet servers superseded rfc 1036 subsequently rfc 5536 rfc 5537 cases unsuitable content posted usenet support automated removal posting whole network creating cancel message although due lack authentication resultant abuse capability frequently disabled copyright holders may still request manual deletion infringing material using provisions world intellectual property organization treaty implementations united states online copyright infringement liability limitation act would require giving notice individual news server administrator internet usenet transported via network news transfer protocol nntp tcp port 119 standard unprotected connections tcp port 563 ssl encrypted connections offered sites major set worldwide newsgroups contained within nine hierarchies eight operated consensual guidelines govern administration naming current big eight see also great renaming alt hierarchy subject procedures controlling groups big eight result less organized groups alt hierarchy tend specialized specific\u2014for example might newsgroup big eight contains discussions children books group alt hierarchy may dedicated one specific author children books binaries posted alt.binaries making largest hierarchies many hierarchies newsgroups distributed alongside regional language-specific hierarchies ne serve specific countries regions japan malta new england companies projects administer hierarchies discuss products offer community technical support historical hierarchy free software foundation microsoft closed newsserver june 2010 providing support products forums users prefer use term usenet refer big eight hierarchies others include alt well general term netnews incorporates entire medium including private organizational news systems informal sub-hierarchy conventions also exist *.answers typically moderated cross-post groups faqs faq would posted within one group cross post *.answers group head hierarchy seen refining information news group subgroups recursive\u2014to point silliness alt.* usenet originally created distribute text content encoded 7-bit ascii character set help programs encode 8-bit values ascii became practical distribute binary files content binary posts due size often-dubious copyright status time restricted specific newsgroups making easier administrators allow disallow traffic oldest widely used encoding method binary content uuencode unix uucp package late 1980s usenet articles often limited 60,000 characters larger hard limits exist today files therefore commonly split sections require reassembly reader header extensions base64 quoted-printable mime encodings new generation binary transport practice mime seen increased adoption text messages avoided binary attachments operating systems metadata attached files use specialized encoding formats mac os binhex special mime types used lesser known encoding systems may used one time btoa xx encoding boo usr encoding attempt reduce file transfer times informal file encoding known yenc introduced 2001 achieves 30 reduction data transferred assuming 8-bit characters safely transferred across network without first encoding 7-bit ascii space common method uploading large binary posts usenet convert files rar archives create parchive files parity files used recreate missing data every part files reaches server news server generally allocates certain amount storage space post content newsgroup storage filled time new post arrives old posts deleted make room new content network bandwidth available server high storage allocation small possible huge flood incoming content overflow allocation push everything group flood large enough beginning flood begin deleted even last part flood posted binary newsgroups able function reliably sufficient storage allocated group allow readers enough time download parts binary posting flushed group storage allocation one time posting undesired content countered newsgroup would flooded random garbage data posts sufficient quantity push content suppressed compensated service providers allocating enough storage retain everything posted day including spam floods without deleting anything average length time posts able stay group deleted commonly called retention time generally larger usenet servers enough capacity archive several years binary content even flooded new data maximum daily speed available good binaries service provider must accommodate users fast connections 3 megabit also users slow connections 256 kilobit less need time download content period several days weeks major nsps retention time 4 years results 33 petabytes 33000 terabytes storage part long retention times well growing internet upload speeds usenet also used individual users store backup data practice called usenet backup ubackup commercial providers offer easy use online backup services storing data usenet free charge although access usenet may method requires user manually select prepare upload data anyone potentially download backup files data typically encrypted files uploaded uploader control files automatically copied usenet providers multiple copies spread different geographical locations around world\u2014desirable backup scheme binary newsgroups used distribute completely legal user-created works open-source software public domain material binary groups used illegally distribute commercial software copyrighted media pornographic material isp-operated usenet servers frequently block access alt.binaries groups reduce network traffic avoid related legal issues commercial usenet service providers claim operate telecommunications service assert responsible user-posted binary content transferred via equipment united states usenet providers qualify protection dmca safe harbor regulations provided establish mechanism comply respond takedown notices copyright holders removal copyrighted content entire usenet network nearly impossible task due rapid propagation servers retention done server petitioning usenet provider removal removes one server retention cache others possible special post cancellation message distributed remove servers many providers ignore cancel messages standard policy easily falsified submitted anyone takedown petition effective across whole network would issued origin server content posted propagated servers removal content early stage would prevent propagation modern high speed links content propagated fast arrives allowing time content review takedown issuance copyright holders establishing identity person posting illegal content equally difficult due trust-based design network like smtp email servers generally assume header origin information post true accurate however smtp email usenet post headers easily falsified obscure true identity location message source manner usenet significantly different modern p2p services p2p users distributing content typically immediately identifiable users network address origin information usenet posting completely obscured unobtainable propagated past original server also unlike modern p2p services identity downloaders hidden view p2p services downloader identifiable others network address usenet downloader connects directly server server knows address connecting usenet providers keep usage logs make logged information casually available outside parties recording industry association america existence anonymising gateways usenet also complicates tracing postings true origin newsgroup experiments first occurred 1979 tom truscott jim ellis duke university came idea replacement local announcement program established link nearby university north carolina using bourne shell scripts written steve bellovin public release news form conventional compiled software written steve daniel truscott 1980 usenet connected arpanet connections usenet arpanet mark horton graduate student set connection began feeding mailing lists arpanet usenet fa arpanet identifier usenet gained 50 member sites first year including reed college university oklahoma bell labs number people using network increased dramatically however still longer usenet users could contribute arpanet uucp networks spread quickly due lower costs involved ability use existing leased lines x.25 links even arpanet connections 1983 thousands people participated 500 hosts mostly universities bell labs sites also growing number unix-related companies number hosts nearly doubled 940 1984 100 newsgroups existed 20 devoted unix computer-related topics least third recreation mesh uucp hosts rapidly expanded became desirable distinguish usenet subset overall network vote taken 1982 usenix conference choose new name name usenet retained established applied news name uucpnet became common name overall network addition uucp early usenet traffic also exchanged fidonet dial-up bbs networks mid-1990s almost 40,000 fidonet systems operation possible communicate millions users around world local telephone service widespread use usenet bbs community facilitated introduction uucp feeds made possible ms-dos implementations uucp ufgate uucp fidonet gateway fsuucp uupc 1986 rfc 977 provided network news transfer protocol nntp specification distribution usenet articles tcp/ip flexible alternative informal internet transfers uucp traffic since internet boom 1990s almost usenet distribution nntp early versions usenet used duke news software designed one two articles day matt glickman horton berkeley produced improved version called b news could handle rising traffic 50 articles day late 1983 message format offered compatibility internet mail improved performance became dominant server software c news developed geoff collyer henry spencer university toronto comparable b news features offered considerably faster processing early 1990s internetnews rich salz developed take advantage continuous message flow made possible nntp versus batched store-and-forward design uucp since time inn development continued news server software also developed usenet first internet community place many important public developments pre-commercial internet place tim berners-lee announced launch world wide web linus torvalds announced linux project marc andreessen announced creation mosaic browser introduction image tag revolutionized world wide web turning graphical medium many jargon terms common use internet originated popularized usenet likewise many conflicts later spread rest internet ongoing difficulties spamming began usenet sascha segan pc magazine said 2008 usenet dying years segan said people pointed eternal september 1993 beginning usenet decline segan believes pornographers software crackers began putting large non-text files usenet late 1990s usenet disk space traffic increased correspondingly internet service providers questioned needed host space pornography unauthorized software state new york opened investigation child pornographers used usenet many isps dropped usenet access access alt hierarchy response john biggs techcrunch said long folks think command line better mouse original text-only social network live aol discontinued usenet access 2005 may 2010 duke university whose implementation kicked usenet 30 years earlier decommissioned usenet server citing low usage rising costs 32 years usenet news service link university north carolina chapel hill news.unc.edu retired february 4 2011 time amount usenet traffic steadily increased number text posts made big-8 newsgroups averaged 1,800 new messages every hour average 25,000 messages per day however averages minuscule comparison traffic binary groups much traffic increase reflects increase discrete users newsgroup discussions instead combination massive automated spamming increase use .binaries newsgroups large files often posted publicly small sampling change measured feed size per day follows 2008 verizon communications time warner cable sprint nextel signed agreement attorney general new york andrew cuomo shut access sources child pornography time warner cable stopped offering access usenet verizon reduced access big 8 hierarchies sprint stopped access alt hierarchies stopped access alt.binaries hierarchies cuomo never specifically named usenet anti-child pornography campaign david dejean pc world said worry isps used cuomo campaign excuse end portions usenet access costly internet service providers high demand customers 2008 aol longer offered usenet access four providers responded cuomo campaign five largest internet service providers united states 50 u.s. isp marketshare june 8 2009 announced would longer provide access usenet service july 15 2009 aol announced would discontinue integrated usenet service early 2005 citing growing popularity weblogs chat forums on-line conferencing aol community tremendous role popularizing usenet 11 years earlier august 2009 verizon announced would discontinue access usenet september 30 2009 janet announced would discontinue usenet service effective july 31 2010 citing google groups alternative microsoft announced would discontinue support public newsgroups msnews.microsoft.com june 1 2010 offering web forums alternative primary reasons cited discontinuance usenet service general isps include decline volume actual readers due competition blogs along cost liability concerns increasing proportion traffic devoted file-sharing spam unused discontinued groups isps include pressure cuomo campaign child pornography one reasons dropping usenet feeds part services isps cox atlantic communications resisted 2008 trend eventually drop respective usenet feeds 2010 public archives usenet articles existed since early days usenet system created kenneth almquist late 1982 distributed archiving usenet posts suggested november 1982 scott orshan proposed every site keep articles posted forever also november year rick adams responded post asking anyone archived netnews anyone plan stating afraid admit started archiving 'useful newsgroups september 18 june 1982 gregory g. woodbury proposed automatic access archives system consisted automatic answering fixed-format messages special mail recipient specified machines 1985 two news archiving systems one rfc posted internet first system called keepnews mark m. swenson university arizona described program attempts provide sane way extracting keeping information comes usenet main advantage system allow users mark articles worthwhile retain second system ya news archiver chuq von rospach similar keepnews designed work much larger archives wonderful quadratic search time feature unix ... becomes real problem von rospach early 1985 posted detailed rfc archiving accessing usenet articles keyword lookup rfc described program could generate maintain archive usenet articles allow looking articles based article-id subject lines keywords pulled article also included c code internal data structure system desire fulltext search index archived news articles new either one request made april 1991 alex martelli sought build sort keyword index news archive early may mr. martelli posted summary responses usenet noting popular suggestion award must definitely go 'lq-text package liam quin recently posted alt.sources huge site http //asstr.org archives indexes erotic pornographic stories posted usenet group alt.sex.stories today archiving usenet led fear loss privacy archive simplifies ways profile people partly countered introduction x-no-archive yes header controversial web-based archiving usenet posts began 1995 deja news large searchable database 2001 database acquired google google groups hosts archive usenet posts dating back may 1981 earliest posts date may 1981 june 1991 donated google university western ontario help david wiseman others originally archived henry spencer university toronto zoology department archives late 1991 early 1995 provided kent landfield netnews cd series j\u00fcrgen christoffel gmd archive posts march 1995 onward started company dejanews later deja purchased google february 2001 google began archiving usenet posts starting second week august 2000 google criticized vice wired contributors well former employees stewardship archive breaking search functionality usenet whole administrators server administrator free whatever pleases long end users peer servers tolerate accept nevertheless famous administrators", + "neighbors": [ + 14, + 27, + 83, + 107, + 108, + 134, + 258, + 306, + 443, + 470, + 494, + 505, + 528, + 530, + 568, + 582, + 617, + 623, + 639, + 646, + 668, + 703, + 713, + 743, + 772, + 776, + 779, + 886, + 897, + 901, + 919, + 939, + 957, + 1002, + 1009, + 1084, + 1090, + 1132, + 1155, + 1166, + 1204, + 1210, + 1227, + 1228, + 1235, + 1301, + 1376, + 1395, + 1423, + 1433, + 1517, + 1528, + 1550, + 1568, + 1604, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 492, + "label": 4, + "text": "Maureen_Baginski:maureen baginski maureen a. baginski former signals intelligence sigint director national security agency nsa executive assistant director intelligence federal bureau investigation fbi beginning intelligence career baginski graduated ba slavic languages linguistics university albany also received honorary doctorate humane letters 2005 service nation baginski began career intelligence 1979 russian language instructor nsa cold war held various positions nearly quarter-century nsa including lead analyst soviet union assistant deputy director technology systems chief officer director executive assistant director nsa/central security service senior operations officer national security operations center sigint director nsa third highest position baginski sigint director september 11 2001 critical nsa response terrorist attacks also directing extended sigint enterprise order acquire produce disseminate foreign sigint variety government military customers documentary film \u201c good american \u201d then-senior nsa executive thomas drake quotes baginski saying \u201c 9/11 gift nsa \u2019 gon na get money need \u201d immediate aftermath 9/11 retired nsa analyst bill binney star film describes baginski \u2019 reaction \u201c sickening. \u201d 2003 baginski left position nsa become executive assistant director intelligence fbi executive assistant director intelligence fbi 2003-2005 baginski successfully led bureau first-ever intelligence program charge adapting fbi intelligence capabilities information technologies created intelligence-sharing platform helped identify stop terror plots head intelligence fbi baginski helped develop intelligence career service intelligence professionals would able advance careers fbi many high-ranking government officials including president george w. bush fbi director mueller acknowledged applauded baginski significant changes fbi improved capabilities safeguard united states america upon retirement fbi director mueller asked baginski remain senior advisor fbi position accepted since retiring fbi baginski held multiple positions within private sector board member bearingpoint inc. argon st si international inc. baginski also president national security systems sparta inc. chief executive officer national security partners llc chairwoman emeriti afcea throughout distinguished career public sector baginski received several awards including two presidential rank awards two director central intelligence national achievement medals director military intelligence \u2019 leadership award nsa \u2019 exceptional civilian service award fbi intelligence analysts association award", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 493, + "label": 5, + "text": "Isochronous_media_access_controller:isochronous media access controller isochronous media access controller i-mac media access control whereby data must transferred isochronously\u2014in words data must transmitted steady rate without interruption", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 494, + "label": 4, + "text": "Backup:backup information technology backup data backup copy computer data taken stored elsewhere may used restore original data loss event verb form referring process back whereas noun adjective form backup backups used recover data loss data deletion corruption recover data earlier time backups provide simple form disaster recovery however backup systems able reconstitute computer system complex configuration computer cluster active directory server database server backup system contains least one copy data considered worth saving data storage requirements large information repository model may used provide structure storage different types data storage devices used copying backups data already secondary storage onto archive files. ref group note name=archivefilemaynotcontainold/historicalmaterial contrast everyday use term archive data stored archive file necessarily old historical interest. /ref also different ways devices arranged provide geographic dispersion data security portability data selected extracted manipulated storage process include methods dealing live data including open files well compression encryption de-duplication additional techniques apply enterprise client-server backup backup schemes may include dry runs validate reliability data backed limitations human factors involved backup scheme backup strategy requires information repository secondary storage space data aggregates backups data sources repository could simple list backup media dvds etc dates produced could include computerized index catalog relational database backup data needs stored requiring backup rotation scheme system backing data computer media limits number backups different dates retained separately appropriate re-use data storage media overwriting backups longer needed scheme determines piece removable storage used backup operation long retained backup data stored unstructured repository may simply stack tapes dvd-rs external hdds minimal information backed method easiest implement unlikely achieve high level recoverability lacks automation repository using backup method contains complete source data copies taken one specific points time copying system images method frequently used computer technicians record known good configurations however imaging generally useful way deploying standard configuration many systems rather tool making ongoing backups diverse systems incremental backup stores data changed since reference point time duplicate copies unchanged data n't copied typically full backup files infrequent intervals serving reference point incremental repository subsequently number incremental backups made successive time periods restores begin last full backup apply incrementals backup systems create series incrementals thus providing equivalent frequently full backup done modify single archive file speeds restores recent versions files true continuous data protection cdp refers backup instantly saves copy every change made data allows restoration data point time comprehensive advanced data protection near-cdp backup applications frequently marketed cdp automatically take incremental backups specific intervals example every 15 minutes one hour 24 hours therefore allow restores fixed interval near-cdp backup applications use journaling typically based periodic snapshots read-only copy data frozen particular point time near-cdp except apple time machine intent-logs every change host system often saving byte block-level differences rather file-level differences backup method differs simple disk mirroring enables roll-back log thus restoration old images data intent-logging allows precautions consistency live data protecting self-consistent files requiring applications quiesced made ready backup near-cdp practicable ordinary personal backup applications opposed cdp must run conjunction virtual machine equivalent therefore generally used enterprise client-server backups reverse incremental backup method stores recent archive file mirror source data series differences mirror current state previous states reverse incremental backup method starts non-image full backup full backup performed system periodically synchronizes full backup live copy storing data necessary reconstruct older versions either done using hard links\u2014as apple time machine using binary diffs differential backup saves data changed since last full backup means maximum two backups repository used restore data however time last full backup thus accumulated changes data increases time perform differential backup restoring entire system requires starting recent full backup applying last differential backup differential backup copies files created changed since last full backup regardless whether differential backups made since whereas incremental backup copies files created changed since recent backup type full incremental variations incremental backup include multi-level incrementals block-level incrementals compare parts files instead entire files regardless repository model used data copied onto archive file data storage medium medium used also referred type backup destination magnetic tape long time commonly used medium bulk data storage backup archiving interchange previously less expensive option longer case smaller amounts data tape sequential access medium rate continuously writing reading data fast many tape formats proprietary specific certain markets like mainframes particular brand personal computer 2014 lto become primary tape technology remaining viable super formats ibm 3592 also referred ts11xx series oracle storagetek t10000 use hard disk storage increased time become progressively cheaper hard disks usually easy use widely available accessed quickly however hard disk backups close-tolerance mechanical devices may easily damaged tapes especially transported mid-2000s several drive manufacturers began produce portable drives employing ramp loading accelerometer technology sometimes termed shock sensor 2010 industry average drop tests drives technology showed drives remaining intact working 36-inch non-operating drop onto industrial carpeting manufacturers also offer 'ruggedized portable hard drives include shock-absorbing case around hard disk claim range higher drop specifications period years stability hard disk backups shorter tape backups external hard disks connected via local interfaces like scsi usb firewire esata via longer-distance technologies like ethernet iscsi fibre channel disk-based backup systems via virtual tape libraries otherwise support data deduplication reduce amount disk storage capacity consumed daily weekly backup data optical storage uses lasers store retrieve data recordable cds dvds blu-ray discs commonly used personal computers generally cheap past capacities speeds discs lower hard disks tapes although advances optical media slowly shrinking gap many optical disc formats worm type makes useful archival purposes since data changed optical storage systems allow cataloged data backups without human contact discs allowing longer data integrity french study 2008 indicated lifespan typically-sold cd-rs 2\u201310 years one manufacturer later estimated longevity cd-rs gold-sputtered layer high 100 years sony optical disc archive 2016 reach read rate 250mb/s solid-state drives ssds use integrated circuit assemblies store data flash memory thumb drives usb flash drives compactflash smartmedia memory sticks secure digital card devices relatively expensive low capacity convenient backing relatively low data volumes solid-state drive contain movable parts making less susceptible physical damage huge throughput around 500 mbit/s 6 gbit/s available ssds become capacious cheaper flash memory backups stable fewer years hard disk backups remote backup services cloud backups involve service providers storing data offsite used protect events fires floods earthquakes could destroy locally stored backups cloud-based backup provides layer data protection however users must trust provider maintain privacy integrity data confidentiality enhanced use encryption speed availability limited user online connection users large amounts data may need use cloud seeding large-scale recovery various methods used manage backup media striking balance accessibility security cost media management methods mutually exclusive frequently combined meet user needs using on-line disks staging data sent near-line tape library common example online backup storage typically accessible type data storage begin restore milliseconds internal hard disk disk array maybe connected san example online backup type storage convenient speedy vulnerable deleted overwritten either accident malevolent action wake data-deleting virus payload nearline storage typically less accessible less expensive online storage still useful backup data storage mechanical device usually used move media units storage drive data read written generally safety properties similar on-line storage example tape library restore times ranging seconds minutes off-line storage requires direct action provide access storage media example inserting tape tape drive plugging cable data accessible via computer except limited periods written read back largely immune on-line backup failure modes access time varies depending whether media on-site off-site backup media may sent off-site vault protect disaster site-specific problem vault simple system administrator home office sophisticated disaster-hardened temperature-controlled high-security bunker facilities backup media storage data replica off-site also on-line e.g. off-site raid mirror replica fairly limited value backup backup site disaster recovery center used store data enable computer systems networks restored properly configure event disaster organisations heir data recovery centres others contract third-party due high costs backing rarely considered preferred method moving data dr site typical way would remote disk mirroring keeps dr data date possible backup operation starts selecting extracting coherent units data data modern computer systems stored discrete units known files files organized filesystems deciding back given time involves tradeoffs backing much redundant data information repository fill quickly backing insufficient amount data eventually lead loss critical information files actively updated called live present challenge back effective way back live data temporarily quiesce e.g. close files take snapshot resume live operations point snapshot backed normal methods snapshot instantaneous function filesystems presents copy filesystem frozen specific point time often copy-on-write mechanism snapshotting file changed results corrupted file unusable also case across interrelated files may found conventional database applications microsoft exchange server term fuzzy backup used describe backup live data looks like ran correctly represent state data single point time backup options data files quiesced include information stored computer stored files accurately recovering complete system scratch requires keeping track non-file data frequently useful required manipulate data backed optimize backup process manipulations improve backup speed restore speed data security media usage and/or reduced bandwidth requirements out-of-date data automatically deleted personal backup applications\u2014as opposed enterprise client-server backup applications automated data grooming customized\u2014the deletion globally delayed disabled various schemes employed shrink size source data stored uses less storage space compression frequently built-in feature tape drive hardware redundancy due backing similarly configured workstations reduced thus storing one copy technique applied file raw block level potentially large reduction called deduplication occur server data moves backup media sometimes referred source/client side deduplication approach also reduces bandwidth required send backup data target media process also occur target storage device sometimes referred inline back-end deduplication sometimes backups duplicated second set storage media done rearrange archive files optimize restore speed second copy different location different storage medium\u2014as disk-to-disk-to-tape capability enterprise client-server backup high-capacity removable storage media backup tapes present data security risk lost stolen encrypting data media mitigate problem however encryption cpu intensive process slow backup speeds security encrypted backups effective security key management policy many computers backed destination storage devices ability use single storage device several simultaneous backups useful however cramming scheduled backup window via multiplexed backup used tape destinations process rearranging backup sets archive file known refactoring example backup system uses single tape day store incremental backups protected computers restoring one computers could require many tapes refactoring could used consolidate backups single computer onto single tape creating synthetic full backup especially useful backup systems incrementals forever style backups sometimes backups copied staging disk copied tape process sometimes referred d2d2t acronym disk disk tape useful problem matching speed final destination device source device frequently faced network-based backup systems also serve centralized location applying data manipulation techniques", + "neighbors": [ + 91, + 150, + 233, + 234, + 242, + 272, + 276, + 278, + 293, + 365, + 379, + 429, + 448, + 469, + 491, + 494, + 505, + 528, + 646, + 664, + 723, + 728, + 772, + 854, + 871, + 896, + 899, + 921, + 930, + 961, + 1085, + 1090, + 1179, + 1289, + 1321, + 1322, + 1327, + 1348, + 1401, + 1568, + 1600, + 1618, + 1634 + ], + "mask": "Test" + }, + { + "node_id": 495, + "label": 6, + "text": "Fork_(file_system):fork file system computer file system fork set data associated file-system object file systems without forks allow single set data contents file systems forks allow multiple contents every non-empty file must least one fork often default type depending file system file may one associated forks turn may contain primary data integral file metadata unlike extended attributes similar file system feature typically fixed size forks variable size possibly even larger file primary data fork size file sum sizes fork file systems without forks one may instead use multiple separate files associated particularly sidecar files metadata however connection files automatically preserved file system must instead handled program works files another alternative container file stores additional data within given file format archive file allows storing several files metadata within file within single fork requires programs process container file archive file rather file system handling forks alternatives require additional work programs using data benefit portability file systems support forks file system forks associated apple hierarchical file system hfs apple hfs original apple macintosh file system mfs allowed file system object two kinds forks data fork resource fork resource fork designed store non-compiled data would used system graphical user interface gui localizable text strings file icon used finder menus dialog boxes associated application however feature flexible additional uses found splitting word processing document content presentation storing part separate resources compiled software code also stored resource often applications would consist resource fork data fork one hfs+ obscure features file may arbitrary number custom named forks addition traditional data resource forks feature gone largely unused apple never added support mac os 8.1-10.3.9 beginning 10.4 partial implementation made support apple extended inline attributes mac os x v10.4 users running unix command line utilities tar included mac os x would risk data loss utilities updated handle resource forks files v10.4 starting 1985 novell netware file system nwfs successor novell storage services nss designed ground use variety methods store file metadata metadata resides novell directory services nds stored directory structure disk stored novell terms 'multiple data streams file multiple data streams also allow macintosh clients attach use netware servers ntfs file system introduced windows nt 3.1 supports file system forks known alternate data streams ads refs new file system introduced windows server 2012 originally support ads windows 8.1 64-bit server 2012 r2 support ads lengths 128k added refs ads originally intended add compatibility existing operating systems support forks computer program may directed open ads specifying name ads colon sign file path spite support programs including windows explorer dir command windows vista ignore ads windows explorer copies ads warns target file system support calculates main stream size list file folder streams dir command windows vista supports showing ads windows powershell v3.0 later supports manipulating ads windows 2000 uses ads store thumbnails image files store summary information title author file without changing main stream windows xp microsoft realized ads susceptible loss files containing moved ntfs volumes thus windows xp stores main stream whenever file format supports windows vista discontinued support adding summary information altogether microsoft decided sensitive ads handle use ads purposes stop service pack 2 windows xp introduced attachment execution service stores details origin downloaded files ads called zone identifier effort protect users downloaded files may present risk internet explorer windows 8 extended function smartscreen internet explorer also uses ads store favicons internet shortcut files solaris version 9 later allows files forks forks called extended attributes solaris although within usual meaning extended attribute maximum size solaris-type extended attribute maximum size file read written fashion files internally actually stored accessed like normal files ownership permissions differ parent file sub-directories administratively disabled names contain characters extended attributes network file system version 4 similar solaris-style extended attributes file system supports different forks applications aware security risks arise allowing legacy software access data without appropriate shims place primary culprit problems different system utilities disk explorer antivirus software archivers aware different forks following problems arise", + "neighbors": [ + 34, + 40, + 55, + 63, + 99, + 108, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 365, + 438, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1090, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 496, + "label": 8, + "text": "SemanticGov:semanticgov semanticgov european union-funded research development project lasted 2006 2009 aimed building infrastructure software models services etc necessary enabling offering semantic web services public administration pa semanticgov aimed address longstanding challenges faced public administrations achieving interoperability amongst pa agencies within country well amongst countries easing discovery pa services customers facilitating execution complex services often involving multiple pa agencies interworkflows semanticgov project aimed capitalizing service oriented architectures paradigm implemented state-of-the-art semantic web services technology supported rigorous reusable public administration domain analysis modelling line major european programmes initiatives field e.g european interoperability framework previous work conducted eu idabc programme i2010 group member states representatives competitiveness innovation cip programme semanticgov project objectives support pa client identify needed services providing infrastructure mapping client needs pa services b discover service interest federal/national pa service directory c. execute monitor service workflow providing infrastructure on-the-fly semi-automated composition execution monitoring complex pa services ii support european citizens businesses access pan-european egovernment services pegs providing communal semantic gateway resolve semantic incompatibilities amongst different administration systems semanticgov project meant simply provide new electronic government solutions a. enhance administrative capacity national public administration systems providing new paradigm service provision b. pave way administrative dimension european unification aka \u201c common european administrative space \u201d facilitating communication amongst eu national administrative systems list consortium partners follows", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 497, + "label": 5, + "text": "Simple_Update_Protocol:simple update protocol simple update protocol sup protocol developed friendfeed simplify speed rss atom websites supported sup meaning updates services appeared friendfeed within seconds support dropped eventually friendfeed shutdown 2015-04-09 sites include disqus identi.ca reddit brightkite supported sup shutdown april 2012 youtube supported sup according youtube v2 api sup documentation yet reference says youtube data api v2 officially deprecated march 4 2014 youtube data api v3 supports push notifications via pubsubhubbub instead longer sup section", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 498, + "label": 3, + "text": "Eddie_Kidd_Jump_Challenge:eddie kidd jump challenge eddie kidd jump challenge stunt bike video game released acorn electron bbc micro commodore 64 msx zx spectrum first released 1984 licensed british stunt performer eddie kidd player takes role eddie kidd must make series jumps like real kidd player must start jumping bmx oil barrels work jumping cars motorbike player starts riding away jump get big enough run must set correct speed correctly selecting gears hit ramp enough speed clear obstacles much miss landing ramp air player lean forward back land correctly game first released late 1984 zx spectrum published software communications martech label version ported msx 1985 similar version released bbc micro acorn electron modified version game much zoomed camera angle screen display released commodore 64 also 1985 game cassette came sticker numbered competition entry card could used win prizes including bmx bikes computers tvs game reissued budget price part mastertronic ricochet label 1987 crash gave game overall score 56 concluding good simulation game exciting particularly addictive difficulty curve criticised early bmx-based levels skipped described doddle skill mastered game holds challenge clare edgeley sinclair user agreed replay bmx section failing advanced jumps seems waste time gave similar score 6/10 computer video games gave scores 7/10 8/10 particularly praising zoomed graphics improved sound commodore 64 version calling superb outshining spectrum game miles", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 499, + "label": 0, + "text": "Automated_Similarity_Judgment_Program:automated similarity judgment program automated similarity judgment program asjp collaborative project applying computational approaches comparative linguistics using database word lists database open access consists 40-item basic-vocabulary lists well half world languages continuously expanded addition isolates languages demonstrated genealogical groups database includes pidgins creoles mixed languages constructed languages words database transcribed simplified standard orthography asjpcode database used estimate dates language families diverged daughter languages method related still different glottochronology determine homeland urheimat proto-language investigate sound symbolism evaluate different phylogenetic methods several purposes asjp originally developed means objectively evaluating similarity words meaning different languages ultimate goal classifying languages computationally based lexical similarities observed first asjp paper two semantically identical words compared languages judged similar showed least two identical sound segments similarity two languages calculated percentage total number words compared judged similar method applied 100-item word lists 250 languages language families including austroasiatic indo-european mayan muskogean asjp consortium founded around 2008 came involve around 25 professional linguists interested parties working volunteer transcribers and/or extending aid project ways main driving force behind founding consortium cecil h. brown s\u00f8ren wichmann daily curator project third central member consortium eric w. holman created software used project word lists used originally based 100-item swadesh list statistically determined subset 40 100 items produced good slightly better classificatory results whole list subsequently word lists gathered contain 40 items less attestations lacking papers published since 2008 asjp employed similarity judgment program based levenshtein distance ld approach found produce better classificatory results measured expert opinion method used initially ld defined minimum number successive changes necessary convert one word another change insertion deletion substitution symbol within levenshtein approach differences word length corrected dividing ld number symbols longer two compared words produces normalized ld ldn ldn divided ldnd two languages calculated dividing average ldn word pairs involving meaning average ldn word pairs involving different meanings second normalization intended correct chance similarity asjp uses following 40-word list similar swadesh\u2013yakhontov list differences asjp version 2016 uses following symbols encode phonemes p b f v w 8 z c n r l z c j 5 k g x n q x h 7 l 4 g e e 3 u represent 7 vowels 34 consonants found standard qwerty keyboard", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 500, + "label": 5, + "text": "AICCU:aiccu aiccu automatic ipv6 connectivity client utility popular cross-platform utility automatically configuring ipv6 tunnel free software available bsd license utility originally provided sixxs tunnel broker also used variety tunnel brokers aiccu written maintained jeroen massar various patches persons incorporated persons acknowledged field contributions aiccu successor windows-only linux/bsd-variety heartbeat tool provided sixxs solely use heartbeat protocol ayiya protocol came existence decided support new protocol would better merge windows unix trees one program give better appearance name heartbeat tool changed reflect providing mere support heartbeats aiccu award excellence implementation category 2004 edition ipv6 application contest following tunneling protocols currently supported aiccu primarily uses tic protocol retrieve configuration parameters tunnel automatically user wants configured aiccu finds available tunnel brokers looking txt dns records _aiccu.sixxs.net latter allows local network add tunnel broker adding records domains configured search path non-local tunnel brokers added requesting sixxs staff add entry global dns records following operating systems/platforms/distributions supported aiccu various distributions aiccu package included distribution main usage aiccu combination sixxs tunnel broker service isps implemented parts protocols aiccu support instance czech isp netbox uses aiccu configure tunnels automatically users providing tic tunnel information control protocol implementation ignores username/password/tunnel_id uses source address tic connection originates determine return tunnel configuration using tic protocol aiccu uses configure tunnel", + "neighbors": [ + 134, + 306, + 796, + 899, + 961, + 1138, + 1318, + 1386 + ], + "mask": "Train" + }, + { + "node_id": 501, + "label": 9, + "text": "Phyllis_Fox:phyllis fox phyllis ann fox american mathematician computer scientist fox raised colorado undergraduate studies wellesley college earning b.a mathematics 1944 1944 1946 worked general electric operator differential analyser project earned second baccalaureate b.s electrical engineering university colorado 1948 moved graduate studies massachusetts institute technology earning m.s 1949 electrical engineering doctorate sc.d mathematics 1954 supervision chia-chiao lin time also worked assistant whirlwind project mit jay forrester 1954 1958 fox worked numerical solution partial differential equations univac computing center united states atomic energy commission courant institute mathematical sciences new york university 1958 following husband returned forester system dynamics research group mit became part team wrote dynamo programming language became collaborator first lisp interpreter principal author first lisp manual 1963 moved mit newark college engineering became full professor 1972 time also consulted bell labs moved 1973 work highly portable numerics library port retired bell labs 1984", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 383, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 502, + "label": 2, + "text": "Android_Ice_Cream_Sandwich:android ice cream sandwich android ice cream sandwich ninth version android mobile operating system developed google unveiled october 19 2011 android 4.0 builds upon significant changes made tablet-only release android honeycomb effort create unified platform smartphones tablets android 4.0 focused simplifying modernizing overall android experience around new set human interface guidelines part efforts introduced new visual appearance codenamed holo built around cleaner minimalist design new default typeface named roboto also introduced number new features including refreshed home screen near-field communication nfc support ability beam content another user using technology updated web browser new contacts manager social network integration ability access camera control music playback lock screen visual voicemail support face recognition device unlocking face unlock ability monitor limit mobile data usage internal improvements android 4.0 received positive reviews critics praised cleaner revamped appearance operating system comparison previous versions along improved performance functionality however critics still felt android 4.0 stock apps still lacking quality functionality comparison third-party equivalents regarded operating system new features particularly face unlock feature gimmicks statistics issued google indicate 0.3 android devices accessing google play run ice cream sandwich following tablet-only release honeycomb announced google i/o 2011 next version android code named ice cream sandwich ics would emphasized providing unified user experience smartphones tablets june 2011 details also began surface surrounding new nexus phone samsung accompany ics would notably exclude hardware navigation keys android blog rootzwiki released photos august 2011 showing nexus running build ics depicting new application menu layout resembling honeycomb new interface blue-colored accenting official launch event android 4.0 new nexus phone originally scheduled october 11 2011 ctia trade show san diego however respect death apple co-founder steve jobs google samsung postponed event october 19 2011 hong kong android 4.0 launch device galaxy nexus officially unveiled october 19 2011 andy rubin explained 4.0 intended provide enticing intuitive user experience across smartphones tablets matias duarte google vice president design explained development ice cream sandwich based around question soul new machine user studies concluded existing android interface complicated thus prevented users empowered devices overall visual appearance android streamlined ice cream sandwich building upon changes made tablet-oriented android 3.0 first project google duarte admitted team cut back support smaller screens honeycomb prioritize sufficient tablet support wanted android oems stop silly things like taking phone ui stretching 10-inch tablet judging android major competitors duarte felt interface ios skeuomorphic kitschy windows phone metro design language looked much like airport lavatory signage operating systems tried hard enforce conformity without leaving room content express ice cream sandwich team aimed provide interface design guidelines would evoke modern appearance still allowing flexibility application developers characterized revised look ice cream sandwich toned geeky nerd quotient comparison honeycomb carried futuristic appearance compared critics aesthetics tron january 2012 following official launch ice cream sandwich duarte google launched android design portal features human interface guidelines best practices resources developers building android apps designed ice cream sandwich galaxy nexus first android device ship android 4.0 android 4.0.3 released december 16 2011 providing bug fixes new social stream api internal improvements day google began rollout ice cream sandwich predecessor galaxy nexus nexus s. however december 20 2011 nexus roll-out paused company could monitor feedback related update march 29 2012 android 4.0.4 released promising performance improvements camera screen rotation bug fixes google play services support 4.0 ended february 2019 user interface android4.0 represents evolution design introduced honeycomb although futuristic aesthetics honeycomb scaled back favor flatter cleaner feel neon blue accenting hard edges drop shadows depth ice cream sandwich also introduces new default system font roboto designed in-house replace droid font family roboto primarily optimized use high-resolution mobile displays new visual appearance ice cream sandwich implemented widget toolkit known holo ensure access holo style across devices\u2014even use customized interface skin elsewhere android devices certified ship google play store formerly android market must provide capability apps use unmodified holo theme honeycomb devices render navigation buttons\u2014 back home recent apps \u2014on system bar across bottom screen removing need physical equivalents menu button present previous generations android devices deprecated favor presenting buttons actions within apps action bars menu items fit bar action overflow menus designated three vertical dots hardware search buttons also deprecated favor search buttons within action bars devices without menu key temporary menu key displayed on-screen running apps coded support new navigation scheme devices use hardware menu key action overflow buttons hidden apps mapped menu key default home screen ice cream sandwich displays persistent google search bar across top screen dock across bottom containing app drawer button middle four slots app shortcuts alongside folders apps formed dragging app hovering another app drawer split two tabs one apps latter holding widgets placed home screen pages widgets resizable contain scrolling content android4.0 contains increased use swiping gestures apps notifications removed recent apps menu dismissed notifications area sliding away number stock google apps use new form tabs users navigate different panes either tapping name strip swiping left right phone app updated holo design ability send pre-configured text message responses response incoming calls visual voicemail integration within call log display web browser app incorporates updated versions webkit v8 supports syncing google chrome override mode loading desktop-oriented version website rather mobile-oriented version well offline browsing contacts section phone app split new people app offers integration social networks google+ display recent posts synchronize contacts profile device user camera app redesigned reduction shutter lag face detection new panorama mode ability take still photos video recorded camcorder mode photo gallery app contains basic photo editing tools lock screen supports face unlock includes shortcut launching camera app house playback controls music players keyboard incorporates improved autocomplete algorithms improvements voice input allow continuous dictation ability take screenshots holding power volume buttons together also added devices supporting near-field communication nfc android beam allows users share links content compatible apps holding back device back another nfc-equipped android device tapping screen prompted certain system apps particularly pre-loaded carriers uninstalled disabled hides application prevents launching application removed storage android4.0 introduced features managing data usage mobile networks users display total amount data used period time display data usage per-app background data usage disabled globally per-app basis cap set automatically disable data usage reaches certain quota calculated device android 4.0 inherits platform additions honeycomb also adds support ambient temperature humidity sensors bluetooth health device profile near-field communication nfc wi-fi direct operating system also provides improved support stylus mouse input along new accessibility calendar keychain spell checking social networking virtual private network apis multimedia support android4.0 also adds support adts aac matroska containers vorbis vp8 webp streaming vp8 openmax al http live streaming 3.0 android4.0 released positive reception ars technica praised holo user interface sense identity visual coherence previously lacking comparison previous versions android also believing new interface style could help improve quality third-party apps stock apps android4.0 also praised slightly better functionality comparison previous versions features noted improvements text voice input along data usage controls especially given increasing use metered data plans overall performance improvements comparison gingerbread however face unlock feature panned insecure gimmick although providing improved experience previous version stock applications email client panned still inferior third-party alternatives engadget also acknowledged maturing quality android experience ice cream sandwich praised modern feel new interface comparison android 2.3 along new features provided google stock apps operating system conclusion engadget felt android4.0 gorgeous os offers great performance and\u2014for part\u2014does n't feel like half-baked effort however engadget still felt android4.0 new features face unlock beta feel noted lack facebook integration new people app operating system still intuitive new users competitors pc magazine acknowledged influence windows phone 7 new people app improved benchmark performance web browser considered android beam face unlock gimmicks criticized lack support certain apps adobe flash launch", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 322, + 337, + 345, + 422, + 429, + 480, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 813, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 503, + "label": 9, + "text": "Runtime_system:runtime system runtime system also called run-time system runtime environment run-time environment primarily implements portions execution model confused runtime lifecycle phase program runtime system operation languages form runtime system provides environment programs run environment may address number issues including layout application memory program accesses variables mechanisms passing parameters procedures interfacing operating system otherwise compiler makes assumptions depending specific runtime system generate correct code typically runtime system responsibility setting managing stack heap may include features garbage collection threads dynamic features built language every programming language specifies execution model many implement least part model runtime system one possible definition runtime system behavior among others behavior directly attributable program definition includes part runtime system things putting parameters onto stack function call behavior disk i/o parallel execution related behaviors definition essentially every language runtime system including compiled languages interpreted languages embedded domain-specific languages even api invoked stand alone execution models pthreads runtime system implementation execution model behavior scholarly papers runtime systems focus implementation details parallel runtime systems notable example parallel runtime system cilk popular parallel programming model addition proto-runtime toolkit created simplify creation parallel runtime systems addition execution model behavior runtime system may also perform support services type checking debugging code generation optimization runtime system also gateway running program interacts runtime environment contains state values accessible program execution also active entities interacted program execution like disk drives people via keyboards example environment variables features many operating systems part runtime environment running program access via runtime system likewise hardware devices dvd drive active entities program interact via runtime system unique application runtime environment rte within operating system os allows rte run meaning boot power-down entire os dedicated application running within rte code tries run failures application break rte breaks os stops processing requires re-boot boot read-only memory extremely secure simple single-mission system created simple example basic runtime system runtime system c language particular set instructions inserted executable image compiler among things instructions manage processor stack create space local variables copy function-call parameters onto top stack often clear criteria deciding language behavior considered inside runtime system versus behavior part source program c setup stack part runtime system opposed part semantics individual program maintains global invariant holds executions systematic behavior implements execution model language opposed implementing semantics particular program text directly translated code computes results one way observe separation semantics particular program runtime environment compile program object file containing functions versus compiling entire program executable binary object file contain assembly code relevant functions executable binary contain additional code used implement runtime environment object file one hand may missing information runtime environment resolved linking hand code object file still depends assumptions runtime system example function may read parameters particular register stack location depending calling convention used runtime environment another example case using application programming interface api interact runtime system calls api look calls regular software library however point call execution model changes runtime system implements execution model different language library written terms person reading code normal library would able understand library behavior knowing language library written however person reading code api invokes runtime system would able understand behavior api call knowing language call written point via mechanism execution model stops language call written switches execution model implemented runtime system example trap instruction one method switching execution models difference distinguishes api-invoked execution model posix threads usual software library posix threads calls software library calls invoked via api posix threads behavior understood terms language call rather posix threads calls bring play outside execution model implemented posix threads runtime system runtime system often os kernel extreme example physical cpu viewed implementation runtime system specific assembly language view execution model implemented physical cpu memory systems analogy runtime systems higher-level languages implemented using languages creates hierarchy runtime systems cpu itself\u2014or actually logic microcode layer below\u2014acting lowest-level runtime system compiled interpreted languages provide interface allows application code interact directly runtime system example codice_1 class java language class allows code animated one thread things start stop threads normally core aspects language behavior task scheduling resource management accessible fashion higher-level behaviors implemented runtime system may include tasks drawing text screen making internet connection often case operating systems provide kinds behaviors well available runtime system implemented abstraction layer translates invocation runtime system invocation operating system hides complexity variations services offered different operating systems also implies os kernel viewed runtime system set os calls invoke os behaviors may viewed interactions runtime system limit runtime system may provide services p-code machine virtual machine hide even processor instruction set approach followed many interpreted languages awk languages like java meant compiled machine-independent intermediate representation code bytecode arrangement simplifies task language implementation adaptation different machines improves efficiency sophisticated language features reflection also allows program executed machine without explicit recompiling step feature become important since proliferation world wide web speed execution runtime systems feature just-in-time compilation machine code modern aspect runtime systems parallel execution behaviors behaviors exhibited mutex constructs pthreads parallel section constructs openmp runtime system parallel execution behaviors may modularized according proto-runtime approach notable early examples runtime systems interpreters basic lisp environments also included garbage collector forth early example language designed compiled intermediate representation code runtime system virtual machine interpreted code another popular theoretical example donald knuth mix computer c later languages supported dynamic memory allocation runtime system also included library managed program memory pool object-oriented programming languages runtime system often also responsible dynamic type checking resolving method references", + "neighbors": [ + 14, + 28, + 50, + 78, + 134, + 187, + 203, + 210, + 262, + 292, + 306, + 347, + 360, + 386, + 392, + 413, + 756, + 789, + 919, + 940, + 966, + 987, + 1009, + 1044, + 1090, + 1110, + 1138, + 1149, + 1180, + 1183, + 1188, + 1231, + 1277, + 1335, + 1372, + 1375, + 1414, + 1511, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 504, + "label": 1, + "text": "Kaii-Y\u014dkai_Densh\u014d_Database:kaii-y\u014dkai densh\u014d database database y\u014dkai mystery stories collected japanese folklore database published international research center japanese studies prototype created march 19 2002 first live version released june 20 2002. project supervisor kazuhiko komatsu japanese folklorist professor study y\u014dkai database includes verbal information without visual information data collected item database abstract around 100 characters full text searchable database searched name region item found", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 505, + "label": 5, + "text": "BitTorrent:bittorrent bittorrent abbreviated bt communication protocol peer-to-peer file sharing p2p used distribute data electronic files internet bittorrent one common protocols transferring large files digital video files containing tv shows video clips digital audio files containing songs peer-to-peer networks estimated collectively account approximately 43 70 internet traffic depending location february 2013 bittorrent responsible 3.35 worldwide bandwidth half 6 total bandwidth dedicated file sharing send receive files person uses bittorrent client internet-connected computer bittorrent client computer program implements bittorrent protocol popular clients include \u03bctorrent xunlei transmission qbittorrent vuze deluge bitcomet tixati bittorrent trackers provide list files available transfer allow client find peer users known seeds may transfer files programmer bram cohen former university buffalo student designed protocol april 2001 released first available version 2 july 2001 recent version 2013 bittorrent clients available variety computing platforms operating systems including official client released bittorrent inc. bittorrent 15\u201327 million concurrent users time bittorrent utilized 150 million active users based figure total number monthly bittorrent users may estimated quarter billion bittorrent protocol used reduce server network impact distributing large files rather downloading file single source server bittorrent protocol allows users join swarm hosts upload to/download simultaneously protocol alternative older single source multiple mirror sources technique distributing data work effectively networks lower bandwidth using bittorrent protocol several basic computers home computers replace large servers efficiently distributing files many recipients lower bandwidth usage also helps prevent large spikes internet traffic given area keeping internet speeds higher users general regardless whether use bittorrent protocol first release bittorrent client search engine peer exchange users wanted upload file create small torrent descriptor file would upload torrent index site first uploader acted seed downloaders would initially connect peers see diagram right wish download file would download torrent client would use connect tracker list ip addresses seeds peers swarm peer completed download complete file could turn function seed file distributed divided segments called pieces peer receives new piece file becomes source piece peers relieving original seed send piece every computer user wishing copy bittorrent task distributing file shared want entirely possible seed send single copy file eventually distribute unlimited number peers piece protected cryptographic hash contained torrent descriptor ensures modification piece reliably detected thus prevents accidental malicious modifications pieces received nodes node starts authentic copy torrent descriptor verify authenticity entire file receives pieces typically downloaded non-sequentially rearranged correct order bittorrent client monitors pieces needs pieces upload peers pieces size throughout single download example 10 mb file may transmitted ten 1 mb pieces forty 256 kb pieces due nature approach download file halted time resumed later date without loss previously downloaded information turn makes bittorrent particularly useful transfer larger files also enables client seek readily available pieces download immediately rather halting download waiting next possibly unavailable piece line typically reduces overall time download eventual transition peers seeders determines overall health file determined number times file available complete form distributed nature bittorrent lead flood-like spreading file throughout many peer computer nodes peers join swarm likelihood successful download particular node increases relative traditional internet distribution schemes permits significant reduction original distributor hardware bandwidth resource costs distributed downloading protocols general provide redundancy system problems reduce dependence original distributor provide sources file generally transient therefore single point failure one way server-client transfers bittorrent client capable preparing requesting transmitting type computer file network using protocol 2005 way share files creating small text file called torrent files contain metadata files shared trackers keep track seeds peers users want download file first obtain torrent file connect tracker seeds 2005 first vuze bittorrent client introduced distributed tracking using distributed hash tables allowed clients exchange data swarms directly without need torrent file 2006 peer exchange functionality added allowing clients add peers based data found connected nodes though ultimately transfer files network bittorrent download differs one way server-client download typical http ftp request example several fundamental ways taken together differences allow bittorrent achieve much lower cost content provider much higher redundancy much greater resistance abuse flash crowds regular server software however protection theoretically comes cost downloads take time rise full speed may take time enough peer connections established may take time node receive sufficient data become effective uploader contrasts regular downloads http server example vulnerable overload abuse rise full speed quickly maintain speed throughout beginning bittorrent non-contiguous download methods made harder support streaming playback however recently clients offering streaming options bittorrent protocol provides way index torrent files result comparatively small number websites hosted large majority torrents many linking copyrighted works without authorization copyright holders rendering sites especially vulnerable lawsuits bittorrent index list .torrent files typically includes descriptions information torrent content several types websites support discovery distribution data bittorrent network public torrent-hosting sites pirate bay allow users search download collection torrent files users typically also upload torrent files content wish distribute often sites also run bittorrent trackers hosted torrent files two functions mutually dependent torrent file could hosted one site tracked another unrelated site private host/tracker sites operate like public ones except may restrict access registered users may also keep track amount data user uploads downloads attempt reduce leeching web search engines allow discovery torrent files hosted tracked sites examples include pirate bay torrentz isohunt btdigg sites allow user ask content meeting specific criteria containing given word phrase retrieve list links torrent files matching criteria list often sorted respect several criteria relevance seeders-leechers ratio one popular useful due way protocol behaves download bandwidth achievable sensitive value metasearch engines allow one search several bittorrent indices search engines dht search engines monitors dht network indexes torrents via metadata exchange peers tribler bittorrent client among first incorporate built-in search capabilities tribler users find .torrent files held random peers taste buddies adds ability bittorrent protocol using gossip protocol somewhat similar exeem network shut 2005 software includes ability recommend content well dozen downloads tribler software roughly estimate download taste user recommend additional content may 2007 researchers cornell university published paper proposing new approach searching peer-to-peer network inexact strings could replace functionality central indexing site year later team implemented system plugin vuze called cubit published follow-up paper reporting success somewhat similar facility slightly different approach provided bitcomet client torrent exchange feature whenever two peers using bitcomet torrent exchange enabled connect exchange lists torrents name info-hash torrent share storage torrent files previously downloaded user chose enable sharing torrent exchange thus client builds list torrents shared peers connected current session even maintain list sessions instructed time user search torrent collection list certain torrent sort list categories user chooses download torrent list .torrent file automatically searched info-hash value dht network found downloaded querying client create initiate downloading task users find torrent interest torrent index site using search engine built client download open bittorrent client client connects tracker seeds specified torrent file receives list seeds peers currently transferring pieces file client connects peers obtain various pieces swarm contains initial seeder client connects directly begins request pieces clients incorporate mechanisms optimize download upload rates effectiveness data exchange depends largely policies clients use determine send data clients may prefer send data peers send data back tit tat exchange scheme encourages fair trading strict policies often result suboptimal situations newly joined peers unable receive data n't pieces yet trade two peers good connection exchange data simply neither takes initiative counter effects official bittorrent client program uses mechanism called optimistic unchoking whereby client reserves portion available bandwidth sending pieces random peers necessarily known good partners called preferred peers hopes discovering even better partners ensure newcomers get chance join swarm although swarming scales well tolerate flash crowds popular content less useful unpopular niche market content peers arriving initial rush might find content unavailable need wait arrival seed order complete downloads seed arrival turn may take long happen termed seeder promotion problem since maintaining seeds unpopular content entails high bandwidth administrative costs runs counter goals publishers value bittorrent cheap alternative client-server approach occurs huge scale measurements shown 38 new torrents become unavailable within first month strategy adopted many publishers significantly increases availability unpopular content consists bundling multiple files single swarm sophisticated solutions also proposed generally use cross-torrent mechanisms multiple torrents cooperate better share content peer distributing data file treats file number identically sized pieces usually byte sizes power 2 typically 32 kb 16 mb peer creates hash piece using sha-1 hash function records torrent file pieces sizes greater 512 kb reduce size torrent file large payload claimed reduce efficiency protocol another peer later receives particular piece hash piece compared recorded hash test piece error-free peers provide complete file called seeders peer providing initial copy called initial seeder exact information contained torrent file depends version bittorrent protocol convention name torrent file suffix codice_1 torrent files announce section specifies url tracker info section containing suggested names files lengths piece length used sha-1 hash code piece used clients verify integrity data receive though sha-1 shown signs cryptographic weakness bram cohen initially consider risk big enough backward incompatible change example sha-3 bittorrent preparing move sha-256 early days torrent files typically published torrent index websites registered least one tracker tracker maintained lists clients currently connected swarm alternatively trackerless system decentralized tracking every peer acts tracker azureus first bittorrent client implement system distributed hash table dht method alternative incompatible dht system known mainline dht released mainline bittorrent client three weeks later though development since 2002 subsequently adopted \u00b5torrent transmission rtorrent ktorrent bitcomet deluge clients dht adopted private flag \u2013 analogous broadcast flag \u2013 unofficially introduced telling clients restrict use decentralized tracking regardless user desires flag intentionally placed info section torrent disabled removed without changing identity torrent purpose flag prevent torrents shared clients access tracker flag requested inclusion official specification august 2008 accepted yet clients ignored private flag banned many trackers discouraging practice bittorrent offer users anonymity one usually see ip addresses peers swarm one client firewall program may expose users insecure systems attacks countries copyright organizations scrape lists peers send takedown notices internet service provider users participating swarms files copyright jurisdictions copyright holders may launch lawsuits uploaders downloaders infringement police may arrest suspects cases various means used promote anonymity example bittorrent client tribler makes available tor-like onion network optionally routing transfers peers obscure client requested data exit node would visible peers swarm tribler organization provides exit nodes one advantage tribler clearnet torrents downloaded small decrease download speed one hop routing i2p provides similar anonymity layer although case one download torrents uploaded i2p network bittorrent client vuze allows users concerned anonymity take clearnet torrents make available i2p network bittorrent clients designed provide anonymity used tor debate whether torrenting tor acts drag network private torrent trackers usually invitation require members participate uploading downside single centralized point failure oink pink palace what.cd examples private trackers shut seedbox services download torrent files first company servers allowing user direct download file one ip address would visible seedbox provider third parties virtual private networks encrypt transfers substitute different ip address user anyone monitoring torrent swarm see address growing number individuals organizations using bittorrent distribute licensed works e.g indie bands distributing digital files new songs independent adopters report without using bittorrent technology dramatically reduced demands private networking hardware bandwidth could afford distribute files uses bittorrent file sharing may violate laws jurisdictions see legal issues section bittorrent 100 million users greater share network bandwidth netflix hulu combined early 2015 estimates bittorrent represents 20 broadband traffic routers use network address translation nat must maintain tables source destination ip addresses ports typical home routers limited 2000 table entries expensive routers larger table capacities bittorrent frequently contacts 20\u201330 servers per second rapidly filling nat tables known cause home routers ceasing work correctly bittorrent protocol still development may therefore still acquire new features enhancements improved efficiency 2 may 2005 azureus 2.3.0.0 known vuze released introducing support trackerless torrents system called distributed database system distributed hash table implementation allows client use torrents working bittorrent tracker following month bittorrent inc. released version 4.2.0 mainline bittorrent client supported alternative dht implementation popularly known mainline dht outlined draft website incompatible azureus recent measurement shows users mainline dht 10 million 25 million daily churn least 10 million mainline dht arguably largest realistic dht world current versions official bittorrent client \u00b5torrent bitcomet transmission bitspirit share compatibility mainline dht dht implementations based kademlia version 3.0.5.0 azureus also supports mainline dht addition distributed database use optional application plugin potentially allows azureus/vuze client reach bigger swarm another idea surfaced vuze virtual torrents idea based distributed tracker approach used describe web resource currently used instant messaging implemented using special messaging protocol requires appropriate plugin anatomic p2p another approach uses decentralized network nodes route traffic dynamic trackers bittorrent clients also use peer exchange pex gather peers addition trackers dht peer exchange checks known peers see know peers 3.0.5.0 release vuze major bittorrent clients compatible peer exchange web seeding implemented 2006 ability bittorrent clients download torrent pieces http source addition swarm advantage feature website may distribute torrent particular file batch files make files available download web server simplify long-term seeding load balancing use existing cheap web hosting setups theory would make using bittorrent almost easy web publisher creating direct http download addition would allow web seed disabled swarm becomes popular still allowing file readily available feature two distinct specifications supported libtorrent 26+ clients use first created john theshad0w hoffman created bittornado first specification requires running web service serves content info-hash piece number rather filename specification created getright authors rely basic http download space using byte serving september 2010 new service named burnbit launched generates torrent url using webseeding server-side solutions provide initial seeding file webserver via standard bittorrent protocol number external seeders reach limit stop serving file original source technique called broadcatching combines rss feeds bittorrent protocol create content delivery system simplifying automating content distribution steve gillmor explained concept column ziff-davis december 2003 discussion spread quickly among bloggers ernest miller chris pirillo etc. article entitled broadcatching bittorrent scott raymond explained rss feed track content bittorrent ensures content integrity cryptographic hashing data feed subscribers receive uncorrupted content one first popular software clients free open source broadcatching miro free software clients penguintv katchtv also supporting broadcatching bittorrent web-service movedigital added ability make torrents available web application capable parsing xml standard rest-based interface 2006 though since discontinued additionally torrenthut developing similar torrent api provide features help bring torrent community web 2.0 standards alongside release first php application built using api called pep parse really simple syndication rss 2.0 feed automatically create seed torrent enclosure found feed since bittorrent makes large proportion total traffic isps chosen throttle slow bittorrent transfers reason methods developed disguise bittorrent traffic attempt thwart efforts protocol header encrypt phe message stream encryption/protocol encryption mse/pe features bittorrent clients attempt make bittorrent hard detect throttle november 2015 vuze bitcomet ktorrent transmission deluge \u00b5torrent moopolice halite qbittorrent rtorrent latest official bittorrent client v6 support mse/pe encryption september 2006 reported software could detect throttle bittorrent traffic masquerading http traffic reports august 2007 indicated comcast preventing bittorrent seeding monitoring interfering communication peers protection efforts provided proxying client-tracker traffic via encrypted tunnel point outside comcast network comcast recently called truce bittorrent inc. intention shaping traffic protocol-agnostic manner questions ethics legality comcast behavior led renewed debate net neutrality united states general although encryption make difficult determine shared bittorrent vulnerable traffic analysis thus even mse/pe may possible isp recognize bittorrent also determine system longer downloading uploading data terminate connection injecting tcp rst reset flag packets another unofficial feature extension bittorrent metadata format proposed john hoffman implemented several indexing websites allows use multiple trackers per file one tracker fails others continue support file transfer implemented several clients bitcomet bittornado bittorrent ktorrent transmission deluge \u00b5torrent rtorrent vuze frostwire trackers placed groups tiers tracker randomly chosen top tier tried moving next tier trackers top tier fail torrents multiple trackers decrease time takes download file also consequences bittorrent specification free use many clients open source bittorrent clients created common operating systems using variety programming languages official bittorrent client \u00b5torrent qbittorrent transmission vuze bitcomet popular clients bittorrent implementations mldonkey torrentflux designed run servers example used centralize file sharing single dedicated server users share access network server-oriented bittorrent implementations also hosted hosting providers co-located facilities high bandwidth internet connectivity e.g. datacenter provide dramatic speed benefits using bittorrent regular home broadband connection services imageshack download files bittorrent user allowing download entire file http finished opera web browser supports bittorrent wyzo bitlet allows users download torrents directly browser using java applet increasing number hardware devices made support bittorrent include routers nas devices containing bittorrent-capable firmware like openwrt proprietary versions protocol implement drm encryption authentication found within managed clients pando unimplemented unofficial feature similarity enhanced transfer set technique improving speed peer-to-peer file sharing content distribution systems share data set proposed researchers pucha andersen kaminsky works spotting chunks identical data files exact near match one needed transferring data client exact data present experiments suggested set help greatly less popular files much popular data many peers already downloading andersen believes technique could immediately used developers bittorrent file sharing system bittorrent inc. working oversi new policy discover protocols query isp capabilities network architecture information oversi isp hosted netenhancer box designed improve peer selection helping peers find local nodes improving download speeds reducing loads isp network although protocol legal problems stem using protocol traffic copyright infringing works much controversy use bittorrent trackers bittorrent metafiles store file contents whether publishers bittorrent metafiles violate copyrights linking copyrighted works without authorization copyright holders controversial various jurisdictions pursued legal action websites host bittorrent trackers high-profile examples include closing suprnova.org torrentspy lokitorrent btjunkie mininova oink pink palace what.cd pirate bay torrent website formed swedish group noted legal section website letters replies subject alleged copyright infringements publicly displayed 31 may 2006 pirate bay servers sweden raided swedish police allegations mpaa copyright infringement however tracker running three days later study used value nbc universal merger comcast envisional examined 10,000 torrent swarms managed publicbt active downloaders excluding pornographic unidentifiable content found one swarm offered legitimate content united states 200,000 lawsuits filed copyright infringement bittorrent since 2010 30 april 2012 uk high court ordered five isps block bittorrent search engine pirate bay see list websites blocked united kingdom one concern udp flood attack bittorrent implementations often use \u00b5tp communication achieve high bandwidths underlying protocol used udp allows spoofing source addresses internet traffic possible carry denial-of-service attacks p2p lab environment users running bittorrent clients act amplifiers attack another service however always effective attack isps check source address correct leeches users download share bittorrent collaborative distributed platform section community wants solutions punish discourage behaviour several studies bittorrent indicated exist files containing malware available download via bittorrent particular one small sample indicated 18 executable programs available download contained malware another study claims much 14.5 bittorrent downloads contain zero-day malware bittorrent used distribution mechanism 47 zero-day malware found due sha1 collisions attacker alter execution path executable serving altered chunks victim downloading executable using bittorrent protocol despite fact proof concept exists attack may succeed limited cases small chunk size 32kb selecting larger chunks i.e 256kb amount resources required find sha1 collision tremendous makes attack virtually impossible", + "neighbors": [ + 14, + 77, + 91, + 144, + 363, + 365, + 491, + 494, + 505, + 545, + 552, + 556, + 611, + 646, + 678, + 684, + 708, + 771, + 813, + 889, + 953, + 1019, + 1036, + 1228, + 1235, + 1252, + 1321, + 1377, + 1386, + 1416, + 1431, + 1552, + 1568, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 506, + "label": 9, + "text": "NIL_(programming_language):nil programming language new implementation lisp nil programming language dialect language lisp developed massachusetts institute technology mit intended successor language maclisp 32-bit implementation part response digital equipment corporation dec vax computer project headed jon l white stated goal maintaining compatibility maclisp fixing many problems lisp language invented 1958 john mccarthy massachusetts institute technology mit inception lisp closely connected artificial intelligence ai research community especially pdp-10 systems 36-bit word size pdp-6 pdp-10 influenced usefulness two lisp 18-bit pointers one word pdp-6 project started early 1963 24-bit machine grew 36 bits lisp design goal lisp used implementation programming language micro planner foundation famous ai system shrdlu lisp particular maclisp named originated mit project mac also used implement macsyma computer algebra system 1970s ai research spawned commercial offshoots performance extant lisp systems became growing problem partly garbage collection lisp would use stop-and-copy garbage collection single heap memory allocation partly representation internal structures lisp became difficult run memory-limited stock computer hardware day led creating lisp machines dedicated hardware running lisp environments programs alternative use powerful commodity hardware becoming available especially digital equipment corporation dec vax nil implementation lisp developed mit mid late 1970s intended modern successor maclisp able run stock hardware contrast lisp machine lisp lisp machines originally designed first modern lisp dialect stock hardware development lisp machine lisp mit went become one main influences design common lisp pg 63/294 since users macsyma program represented large potential user base nil necessary nil would large complex system speed would imperative example high-speed bignums requirement support macsyma since nil would failure slow bignums consequently nil ended large base vax assembly language requirements led aggressive complex optimization strategy applied prematurely negative results final system concurrent effort write nil research group stanford university lawrence livermore national laboratory headed richard p. gabriel investigating design lisp run s-1 mark iia supercomputer s-1 lisp lisp never fully functional test bed implementing advanced compiler methods lisp eventually s-1 nil groups began collaborating although unsuccessful meeting goals used language nil important several ways first brought together jon l. white guy l. steele jr. richard p. gabriel later define common lisp second jonathan rees worked part nil project year away yale university returning yale hired computer science department write new lisp became optimizing native code scheme system named t. part nil begat name since nil", + "neighbors": [ + 27, + 46, + 56, + 78, + 170, + 173, + 194, + 203, + 227, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1120, + 1123, + 1138, + 1173, + 1180, + 1207, + 1213, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1632, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 507, + "label": 7, + "text": "Comparison_of_cluster_software:comparison cluster software following tables compare general technical information notable computer cluster software software grossly separated four categories job scheduler nodes management nodes installation integrated stack table explanation table explanation", + "neighbors": [ + 134, + 175, + 274, + 306, + 399, + 737, + 760, + 847, + 961, + 1225, + 1354, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 508, + "label": 3, + "text": "Execution_unit:execution unit computer engineering execution unit also called functional unit part central processing unit cpu performs operations calculations instructed computer program may internal control sequence unit confused cpu main control unit registers internal units arithmetic logic unit alu address generation unit agu floating-point unit fpu load-store unit lsu branch execution unit beu smaller specific components common modern cpus multiple parallel execution units referred superscalar design simplest arrangement use one bus manager manage memory interface others perform calculations additionally modern cpus execution units usually pipelined", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 359, + 388, + 445, + 457, + 460, + 465, + 486, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1372, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 509, + "label": 9, + "text": "JavaScript:javascript javascript often abbreviated js high-level interpreted scripting language conforms ecmascript specification javascript curly-bracket syntax dynamic typing prototype-based object-orientation first-class functions alongside html css javascript one core technologies world wide web javascript enables interactive web pages essential part web applications vast majority websites use major web browsers dedicated javascript engine execute multi-paradigm language javascript supports event-driven functional imperative including object-oriented prototype-based programming styles apis working text arrays dates regular expressions dom language include i/o networking storage graphics facilities relies upon host environment embedded provide features initially implemented client-side web browsers javascript engines embedded many types host software including server-side web servers databases non-web programs word processors pdf software runtime environments make javascript available writing mobile desktop applications including desktop widgets terms vanilla javascript vanilla js refer javascript extended frameworks additional libraries scripts written vanilla js plain javascript code although similarities javascript java including language name syntax respective standard libraries two languages distinct differ greatly design javascript influenced programming languages self scheme json serialization format used store data structures files transmit across networks based javascript 1993 national center supercomputing applications ncsa unit university illinois urbana-champaign released ncsa mosaic first popular graphical web browser played important part expanding growth nascent world wide web beyond nextstep niche worldwideweb formed three years earlier 1994 company called mosaic communications founded mountain view california employed many original ncsa mosaic authors create mosaic netscape however intentionally shared code ncsa mosaic internal codename company browser mozilla portmanteau mosaic godzilla first version web browser mosaic netscape 0.9 released late 1994 within four months already taken three-quarters browser market became main web browser 1990s avoid trademark ownership problems ncsa browser subsequently renamed netscape navigator year company took name netscape communications netscape communications realized web needed become dynamic marc andreessen founder company believed html needed glue language easy use web designers part-time programmers assemble components images plugins code could written directly web page markup 1995 netscape communications recruited brendan eich goal embedding scheme programming language netscape navigator could get started netscape communications collaborated sun microsystems include sun static programming language java netscape navigator compete microsoft user adoption web technologies platforms netscape communications decided scripting language wanted create would complement java similar syntax excluded adopting languages perl python tcl scheme defend idea javascript competing proposals company needed prototype eich wrote one 10 days may 1995 although developed name mocha language officially called livescript first shipped beta releases netscape navigator 2.0 september 1995 renamed javascript deployed netscape navigator 2.0 beta 3 december final choice name caused confusion giving impression language spin-off java programming language choice characterized marketing ploy netscape give javascript cachet hot new web programming language common misconception javascript influenced earlier web page scripting language developed nombas named cmm confused later c -- created 1997 brendan eich however never heard cmm created livescript nombas pitch embedded web page scripting netscape though web page scripting new concept shown violawww web browser nombas later switched offering javascript instead cmm scriptease product part tc39 group standardized ecmascript december 1995 soon releasing javascript browsers netscape introduced implementation language server-side scripting netscape enterprise server since 1996 iis web-server supported microsoft implementation server-side javascript\u2014jscript\u2014in asp .net pages since mid-2000s additional server-side javascript implementations introduced node.js 2009 microsoft script technologies including vbscript jscript released 1996 jscript reverse-engineered implementation netscape javascript part internet explorer 3 jscript also available server-side scripting internet information server internet explorer 3 also included microsoft first support css various extensions html case implementation noticeably different found netscape navigator time differences made difficult designers programmers make single website work well browsers leading use best viewed netscape best viewed internet explorer logos characterized early years browser wars javascript began acquire reputation one roadblocks cross-platform standards-driven web developers took difficult task trying make sites work major browsers many could afford time release internet explorer 4 microsoft introduced concept dynamic html differences language implementations different proprietary document object models remained obstacles widespread take-up javascript web november 1996 netscape submitted javascript ecma international carve standard specification browser vendors could implement based work done netscape led official release language specification ecmascript published first edition ecma-262 standard june 1997 javascript well known implementations actionscript jscript well-known implementations ecmascript release ecmascript 2 june 1998 continued standards process cycle conforming modifications iso/iec 16262 international standard ecmascript 3 released december 1999 modern-day baseline javascript original ecmascript 4 work led waldemar horwat netscape google started 2000 microsoft initially participated implemented proposals jscript .net language time clear microsoft intention cooperating implementing proper javascript internet explorer even though competing proposal partial diverged point implementation .net server side 2003 original ecmascript 4 work mothballed next major event 2005 two major happenings javascript history first brendan eich mozilla rejoined ecma international not-for-profit member work started ecmascript xml e4x ecma-357 standard came ex-microsoft employees bea systems originally acquired crossgain led working jointly macromedia later acquired adobe systems implementing e4x actionscript 3 actionscript 3 fork original ecmascript 4 along macromedia work restarted ecmascript 4 goal standardizing actionscript 3 end adobe systems released actionscript virtual machine 2 code named tamarin open source project tamarin actionscript 3 different web javascript converge realized parties 2007 2008 alas still turmoil various players douglas crockford\u2014then yahoo \u2014joined forces microsoft 2007 oppose ecmascript 4 led ecmascript 3.1 effort development ecmascript 4 never completed work influenced subsequent versions happening open source developer communities set work revolutionize could done javascript community effort sparked 2005 jesse james garrett released white paper coined term ajax described set technologies javascript backbone used create web applications data loaded background avoiding need full page reloads leading dynamic applications resulted renaissance period javascript usage spearheaded open source libraries communities formed around libraries prototype jquery dojo toolkit mootools others released july 2008 disparate parties either side came together oslo led eventual agreement early 2009 rename ecmascript 3.1 ecmascript 5 drive language forward using agenda known harmony ecmascript 5 finally released december 2009 june 2011 ecmascript 5.1 released fully align third edition iso/iec 16262 international standard ecmascript 2015 released june 2015 ecmascript 2016 released june 2016 current version ecmascript 2017 released june 2017 javascript become one popular programming languages web however many professional programmers initially denigrated language due perceived target audience web authors amateurs advent ajax returned javascript spotlight brought professional programming attention result proliferation comprehensive frameworks libraries improved javascript programming practices increased usage javascript outside web browsers seen proliferation server-side javascript platforms january 2009 commonjs project founded goal specifying common standard library mainly javascript development outside browser rise single-page applications javascript-heavy sites increasingly used compile target source-to-source compilers dynamic languages static languages javascript trademark oracle corporation united states used license technology invented implemented netscape communications current entities mozilla foundation following features common conforming ecmascript implementations unless explicitly specified otherwise popular modern web browsers support javascript built-in interpreters javascript supports much structured programming syntax c e.g. codice_1 statements codice_2 loops codice_3 statements codice_4 loops etc. one partial exception scoping javascript originally function scoping codice_5 ecmascript 2015 added keywords codice_6 codice_7 block scoping meaning javascript function block scoping like c javascript makes distinction expressions statements one syntactic difference c automatic semicolon insertion allows semicolons would normally terminate statements omitted javascript almost entirely object-based javascript object associative array augmented prototype see string key provides name object property two syntactical ways specify name dot notation codice_9 bracket notation codice_10 property may added rebound deleted run-time properties object property belongs object prototype inheritance chain enumerated using codice_11 loop javascript small number built-in objects including codice_12 codice_13 function first-class function considered object function may properties methods codice_23 codice_24 nested function function defined within another function created time outer function invoked addition nested function forms lexical closure lexical scope outer function including constant local variable argument value becomes part internal state inner function object even execution outer function concludes javascript also supports anonymous functions javascript supports implicit explicit delegation javascript officially managed mozilla foundation new language features added periodically however javascript engines support new features variables javascript defined using either codice_5 codice_6 codice_7 keywords var x // declares variable x assigns special value undefined confused undefined value var 2 // declares variable assigns value 2 var z hello world // declares variable z assigns string containing hello world note comments example preceded two forward slashes built-in input/output functionality javascript run-time environment provides ecmascript specification edition 5.1 mentions indeed provisions specification input external data output computed results however runtime environments codice_38 object used print output minimalist hello world program javascript console.log hello world simple recursive function function factorial n factorial 3 // returns 6 anonymous function lambda function counter var closure counter closure // returns 1 closure // returns 2 closure // returns 3 example shows javascript function closures capture non-local variables reference arrow functions first introduced 6th edition ecmascript 2015 shorten syntax writing functions javascript arrow functions anonymous nature variable needed refer order invoke creation example arrow function // arrow functions let us omit function keyword long_example // points anonymous function value const long_example input1 input2 // arrow functions also let us automatically return expression right // arrow input 5 omitting braces return keyword const short_example input input 5 long_example 2 3 // prints hello world returns 5. short_example 2 // returns 7 javascript objects created way functions known function object object example function ball r var myball new ball 5 // creates new instance ball object radius 5 myball.show // instance ball object show function performed variadic function demonstration codice_30 special variable function sum sum 1 2 // returns 3 sum 1 2 3 // returns 6 immediately-invoked function expressions often used create modules ecmascript 2015 built-in module construct language modules allow gathering properties methods namespace making private var counter function // module counter.get // shows 0 counter.set 6 counter.increment // shows 7 counter.increment // shows 8 exporting importing modules javascript export example /* mymodule.js */ // function remains private exported let sum b // export variables export var name 'alice export let age 23 // export named functions export function add num1 num2 // export class export class multiplication import example // import one property import add './mymodule.js console.log add 1 2 // 3 // import multiple properties import name age './mymodule.js console.log name age // alice 23 // import properties module import './module.js' console.log name age // alice 23 console.log add 1,2 // 3 sample code displays various javascript features /* finds lowest common multiple lcm two numbers */ function lcmcalculator x // constructor function // prototype object instances created constructor // constructor prototype property lcmcalculator.prototype // object literal // define generic output function implementation works web browsers function output x // note array map foreach defined javascript 1.6 // used demonstrate javascript inherent functional nature .map function pair // array literal mapping function function printresult obj following output displayed browser window lcmcalculator 28 b 56 gcd 28 lcm 56 lcmcalculator 21 b 56 gcd 7 lcm 168 lcmcalculator 25 b 55 gcd 5 lcm 275 lcmcalculator 22 b 58 gcd 2 lcm 638 94.5 10 million popular web pages used javascript common use javascript add client-side behavior html pages also known dynamic html dhtml scripts embedded included html pages interact document object model dom page simple examples usage javascript code run locally user browser rather remote server increasing application overall responsiveness user actions javascript code also detect user actions html alone individual keystrokes applications gmail take advantage much user-interface logic written javascript javascript dispatches requests information content e-mail message server wider trend ajax programming similarly exploits strength javascript engine also known javascript interpreter javascript implementation interpreter interprets javascript source code executes script accordingly first javascript engine created brendan eich netscape netscape navigator web browser engine code-named spidermonkey implemented c. since updated javascript 1.5 conform ecmascript 3 rhino engine created primarily norris boyd formerly netscape google javascript implementation java rhino like spidermonkey ecmascript 3 compliant web browser common host environment javascript however web browser execute javascript code example text-based browsers javascript engines users browsers may disable scripts preference extension web browser typically creates host objects represent dom javascript web server another common host environment javascript web server would typically expose host objects representing http request response objects javascript program could interrogate manipulate dynamically generate web pages javascript language popular browsers share support inadvertently become target language frameworks languages increasing speed javascript engines made language feasible compilation target despite performance limitations inherent dynamic nature minimal example standards-conforming web page containing javascript using html 5 syntax dom doctype html html /html javascript runs widely varying environments important part testing debugging test verify javascript works across multiple browsers dom interfaces officially defined w3c standardization effort separate javascript implementation dom interfaces differ web browsers javascript authors deal differences writing standards-compliant code executed correctly browsers failing write code behaves differently absence certain browser features authors may also find practical detect browser running two browsers may implement feature differing behavior libraries toolkits take browser differences account also useful programmers furthermore scripts may work users example user may support users web authors try create pages degrade gracefully user agents browsers support page javascript particular page remain usable albeit without extra features javascript would added sites use html codice_40 tag contains alt content js disabled alternative approach many find preferable first author content using basic technologies work browsers enhance content users javascript enabled javascript dom provide potential malicious authors deliver scripts run client computer via web browser authors minimize risk using two restrictions first scripts run sandbox perform web-related actions general-purpose programming tasks like creating files second scripts constrained same-origin policy scripts one web site access information usernames passwords cookies sent another site javascript-related security bugs breaches either origin policy sandbox subsets general javascript\u2014adsafe secure ecmascript ses \u2014that provide greater levels security especially code created third parties advertisements caja another project safe embedding isolation third-party javascript html content security policy main intended method ensuring trusted code executed web page common javascript-related security problem cross-site scripting xss violation same-origin policy xss vulnerabilities occur attacker able cause target web site online banking website include malicious script webpage presented victim script example access banking application privileges victim potentially disclosing secret information transferring money without victim authorization solution xss vulnerabilities use html escaping whenever displaying untrusted data browsers include partial protection reflected xss attacks attacker provides url including malicious script however even users browsers vulnerable xss attacks malicious code stored database correct design web applications server side fully prevent xss xss vulnerabilities also occur implementation mistakes browser authors another cross-site vulnerability cross-site request forgery csrf csrf code attacker site tricks victim browser taking actions user intend target site like transferring money bank target sites rely solely cookies request authentication requests originating code attacker site carry valid login credentials initiating user general solution csrf require authentication value hidden form field cookies authenticate request might lasting effects checking http referrer header also help javascript hijacking type csrf attack codice_29 tag attacker site exploits page victim site returns private information json javascript possible solutions include developers client-server applications must recognize untrusted clients may control attackers application author assume javascript code run intended secret embedded code could extracted determined adversary implications package management systems npm bower popular javascript developers systems allow developer easily manage program dependencies upon developer program libraries developers trust maintainers libraries keep secure date always case vulnerability emerged blind trust relied-upon libraries new releases cause bugs vulnerabilities appear programs rely upon libraries inversely library go unpatched known vulnerabilities wild study done looking sample 133k websites researchers found 37 websites included library at-least one known vulnerability median lag oldest library version used website newest available version library 1,177 days alexa development libraries still active use ceased years ago another possibility maintainer library may remove library entirely occurred march 2016 azer ko\u00e7ulu removed repository npm caused tens thousands programs websites depending upon libraries break javascript provides interface wide range browser capabilities may flaws buffer overflows flaws allow attackers write scripts would run code wish user system code means limited another javascript application example buffer overrun exploit allow attacker gain access operating system api superuser privileges flaws affected major browsers including firefox internet explorer safari plugins video players adobe flash wide range activex controls enabled default microsoft internet explorer may also flaws exploitable via javascript flaws exploited past windows vista microsoft attempted contain risks bugs buffer overflows running internet explorer process limited privileges google chrome similarly confines page renderers sandbox web browsers capable running javascript outside sandbox privileges necessary example create delete files privileges intended granted code web incorrectly granting privileges javascript web played role vulnerabilities internet explorer firefox windows xp service pack 2 microsoft demoted jscript privileges internet explorer microsoft windows allows javascript source files computer hard drive launched general-purpose non-sandboxed programs see windows script host makes javascript like vbscript theoretically viable vector trojan horse although javascript trojan horses uncommon practice 2015 javascript-based proof-of-concept implementation rowhammer attack described paper security researchers 2017 javascript-based attack via browser demonstrated could bypass aslr called aslr\u2295cache anc addition web browsers servers javascript interpreters embedded number tools applications provides object model provides access host environment core javascript language remains mostly application within javascript access debugger becomes invaluable developing large non-trivial programs implementation differences various browsers particularly within dom useful access debugger browsers web application targets script debuggers integrated within many mainstream browsers internet explorer firefox safari google chrome opera node.js addition native internet explorer developer tools three debuggers available internet explorer microsoft visual studio features three closely followed microsoft script editor component microsoft office finally free microsoft script debugger free microsoft visual web developer express provides limited version javascript debugging functionality microsoft visual studio comparison internet explorer firefox comprehensive set developer tools includes debugger well old versions firefox without tools used firefox addon called firebug older venkman debugger webkit web inspector includes javascript debugger used safari modified version called blink devtools used google chrome node.js node inspector interactive debugger integrates blink devtools opera includes set tools called dragonfly addition native computer software online javascript integrated development environment ides debugging aids written javascript built run web example program jslint developed douglas crockford written extensively language jslint scans javascript code conformance set standards guidelines many libraries javascript three.js provide links demonstration code edited users demonstration codes also used pedagogical tool institutions khan academy allow students experience writing code environment see output programs without needing setup beyond web browser javascript increased usage web development warrants considerations performance frontend code inherited many responsibilities previously handled backend mobile devices particular may encounter problems rendering poorly optimized frontend code library benchmarks benchmark.js benchmarking library supports high-resolution timers returns statistically significant results another tool jsben.ch online javascript benchmarking tool code snippets tested javascript initially developed 1996 use netscape navigator web browser year microsoft released implementation internet explorer implementation called jscript due trademark issues 1997 first standardized version language released name ecmascript first edition ecma-262 standard explicit versioning opt-in language features mozilla-specific removed later firefox versions least firefox 59 firefox 4 last version referred explicit javascript version 1.8.5 new editions ecma-262 standard javascript language features often mentioned initial definition ecma-262 editions following table explicitly versioned javascript versions based information multiple sources javascript widely supported client-side language run within web browser become intermediate language languages also called transpilers target included newly created languages ports existing languages include javascript unusual limitations \u2013 explicit integer type double-precision binary floating point \u2013 languages compile javascript take care use integer-converting shift bitwise logical operators may slightly different behavior environments common misconception javascript similar closely related java true c-like syntax c language immediate common ancestor language also typically sandboxed used inside browser javascript designed java syntax standard library mind particular java keywords reserved original javascript javascript standard library follows java naming conventions javascript objects based classes java 1.0 similarities end java javascript first appeared 1995 java developed james gosling sun microsystems javascript brendan eich netscape communications differences two languages prominent similarities java static typing javascript typing dynamic java loaded compiled bytecode javascript loaded human-readable source code java objects class-based javascript prototype-based finally java support functional programming java 8 javascript done beginning influenced scheme starting 2017 web browsers began supporting webassembly technology standardized w3c webassembly standard specifies binary format produced compiler toolchain llvm execute browser near native speed webassembly allows programming languages c c++ c java used well javascript author client-side code world wide web", + "neighbors": [ + 7, + 11, + 14, + 16, + 19, + 28, + 29, + 31, + 33, + 36, + 50, + 65, + 69, + 77, + 78, + 81, + 83, + 95, + 101, + 107, + 117, + 124, + 132, + 144, + 148, + 152, + 176, + 201, + 207, + 216, + 225, + 246, + 252, + 258, + 275, + 277, + 292, + 293, + 301, + 306, + 325, + 331, + 337, + 347, + 365, + 373, + 378, + 384, + 392, + 427, + 509, + 515, + 527, + 530, + 531, + 538, + 564, + 567, + 577, + 579, + 582, + 583, + 592, + 593, + 594, + 597, + 617, + 623, + 632, + 638, + 653, + 668, + 682, + 684, + 686, + 690, + 712, + 713, + 716, + 742, + 743, + 746, + 756, + 777, + 780, + 782, + 790, + 796, + 799, + 805, + 815, + 820, + 825, + 833, + 862, + 869, + 872, + 873, + 886, + 899, + 916, + 919, + 939, + 948, + 953, + 959, + 961, + 962, + 998, + 1005, + 1028, + 1033, + 1058, + 1063, + 1068, + 1084, + 1088, + 1106, + 1120, + 1121, + 1132, + 1146, + 1152, + 1156, + 1166, + 1168, + 1189, + 1190, + 1195, + 1210, + 1212, + 1214, + 1221, + 1225, + 1227, + 1228, + 1232, + 1235, + 1242, + 1245, + 1246, + 1251, + 1254, + 1264, + 1265, + 1269, + 1280, + 1292, + 1298, + 1302, + 1311, + 1319, + 1324, + 1331, + 1332, + 1366, + 1372, + 1376, + 1378, + 1388, + 1408, + 1417, + 1418, + 1422, + 1423, + 1430, + 1457, + 1477, + 1481, + 1491, + 1502, + 1511, + 1528, + 1532, + 1536, + 1547, + 1550, + 1566, + 1569, + 1582, + 1594, + 1604, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 510, + "label": 9, + "text": "LotusScript:lotusscript lotusscript object oriented programming language used lotus notes since version 4.0 ibm lotus software products lotusscript similar visual basic developers familiar one easily understand syntax structure code major differences two respective integrated development environments product-specific object classes provided language included vb includes richer set classes ui manipulation whereas lotusscript includes richer set application-specific classes lotus notes lotus word pro lotus 1-2-3 case lotus notes classes work notes databases documents records databases etc classes also used ole automation objects outside lotus notes environment visual basic lotusscript also allows definition user-defined types classes although possible inherit product-specific classes lotusscript programs access microsoft office documents using ole automation libraries ms office", + "neighbors": [ + 0, + 8, + 236, + 273, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1156, + 1204, + 1212, + 1306, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 511, + "label": 2, + "text": "IPhone_XR:iphone xr iphone xr stylized marketed iphone roman numeral x pronounced ten smartphone designed manufactured apple inc twelfth generation iphone announced phil schiller september 12 2018 steve jobs theater apple park campus alongside higher-priced iphone xs iphone xs max pre-orders began october 19 2018 official release october 26 2018 phone 6.1-inch liquid retina lcd display apple claims advanced lcd industry least expensive device apple iphone x line devices starting price 749 united states 1029 canada \u00a3749 united kingdom \u20ac849 eurozone countries 6499 yuan china features processor xs xs max apple a12 bionic chip built 7 nanometer process apple claims smartest powerful chip ever put smartphone available six colors black white capri yellow coral shade pink orange product red xr available three storage capacities 64gb 128gb 256gb second iphone released yellow capri first iphone 5c 2013 internationally phone supports dual sims nano-sim esim mainland china hong kong macau dual nano-sim single tray offered instead despite receiving criticism lower display resolution comparison previous iphone models roughly price point xr received mostly positive reviews critics users release xr apple best selling 2018 model according apple xr battery lasts one-and-a-half hours longer direct predecessor iphone 8 xr similar design iphone x iphone xs however slightly larger bezels aluminum frame available wide variety colors similar x-branded iphones models come black front xr ip67 rating dust water resistance means immersed 1-meter deep water 30 minutes xr similar hardware xs features removed reduce price instead 3d touch xr comes haptic touch user long presses feel vibration taptic engine xr also lcd display known liquid retina instead oled screen used x xs xs max display xr resolution 1792\u00d7828 pixels pixel density 326 ppi compared 458 ppi x-branded iphones screen-to-body ratio xr 79.3 much higher 67.5 iphone 8 plus still lower phones price category unlike phones x-series xr ships single camera rear phone featuring exactly main camera sensor xs xs max utilizing 1/2.55 sensor size 1.4\u03bcm pixel size unlike xs optical zoom single camera dxomark gave camera iphone xr rating 101 giving title \u201c top-ranked single-lens phone. \u201d despite rear single-camera setup modified version portrait mode included works unaltered using truedepth front camera rear camera attempts calculate depth field using combination focus pixels image sensor ai resulting limitations including lower resolution depth data subjects close enough due wide-angle lens used instead missing telephoto lens like iphone xs xs max iphone xr also offers adjustable depth field software allowing user adjust background bokeh effect taking photo xr shipped ios 12 installed box compatible ios 13", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 162, + 166, + 214, + 228, + 252, + 269, + 270, + 337, + 345, + 356, + 394, + 403, + 477, + 489, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1384, + 1409, + 1488, + 1496, + 1507, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 512, + "label": 4, + "text": "Snort_(software):snort software snort free open source network intrusion detection system ids intrusion prevention system ips created 1998 martin roesch founder former cto sourcefire snort developed cisco purchased sourcefire 2013 2009 snort entered infoworld open source hall fame one greatest pieces open source software time snort open source network-based intrusion detection/prevention system ids/ips ability perform real-time traffic analysis packet logging internet protocol ip networks snort performs protocol analysis content searching matching program also used detect probes attacks including limited operating system fingerprinting attempts semantic url attacks buffer overflows server message block probes stealth port scans snort configured three main modes sniffer packet logger network intrusion detection sniffer mode program read network packets display console packet logger mode program log packets disk intrusion detection mode program monitor network traffic analyze rule set defined user program perform specific action based identified several third-party tools interfacing snort administration reporting performance log analysis", + "neighbors": [ + 225, + 306, + 357, + 725, + 739, + 771, + 796, + 856, + 965, + 993, + 1103, + 1138, + 1337, + 1462, + 1527 + ], + "mask": "Test" + }, + { + "node_id": 513, + "label": 8, + "text": "Session_replay:session replay session replay ability replay visitor journey web site within mobile application web application replay include user view browser screen output user input keyboard mouse inputs logs network events console logs supposed help improve customer experience identify obstacles conversion processes websites however also used study web site usability customer behavior well handling customer service questions customer journey interactions replayed organizations even use capability analyse fraudulent behavior websites solutions augment session replay advanced analytics identify segments customers struggling use website means replay capability used much efficiently reduce need replay customer sessions unnecessarily generally two ways capture replay visitor sessions client side tag-free server side many tag-based solutions offer video-like replay visitors session replay analogous video accurately reproduction specific user experience mouse movements clicks taps scrolls underlying data session recordings captured tagging pages advanced tools able access dom directly play back interactions within dom including mutations high degree accuracy number tools provide similar functions advantage replay movie-like format full client experience also deal modern single-page applications disadvantage tracking script easily detected blocked ad blocker becomes normal 2017 615m devices active adblock solutions capture website traffic replay every visitor interaction every device including mobile users location sessions replayed step-by-step providing ability search locate analyse aspects visitors session including clicks form entry server-side solutions require hardware software installed premises advantage server-side recording solution ca n't blocked unfortunately wo n't able see video like replay client-side activities scrolling mouse movements deals badly modern single-page applications hybrid approach combines advantages without weaknesses hybrid approach ensures every session recorded important compliance server-side capturing enriched client-side tracking data mouse movements clicks scrolling key strokes user behavior driven customer experience insights works well modern single-page applications benefit movie-like replay additionally ensure 100 compliant capturing deployed either premises saas tools listed available software service saas solutions", + "neighbors": [ + 77, + 780 + ], + "mask": "Train" + }, + { + "node_id": 514, + "label": 7, + "text": "ReplicaNet:replicanet distributed computing distributed object systems designed allow software modules objects work together objects located different computers connected network interactive computer simulations computer games use object-oriented programming languages c++ maintain database entities player characters monsters tanks anything exist simulated world using object description language programmatically registering filter classes machine knows create update c++ class object object treated potential network shareable object machine allocates machine control c++ classes change variables call member functions normal object ready shared machines object published replicanet network session underlying replicanet software detects changes object automatically updates replicated classes machines connected network session changes made member variables c++ classes extrapolated replicanet using several pre-defined filters reduce amount network traffic transmitting changes object approach describing objects processed computers similar systems corba java remote method invocation distributed component object model 2011 game developer magazine announced replicanet 7.0 one networking finalists front line awards honors best networking middleware computer games industry game programming c++ start finish erik yuzwa http //gameprogrammingstarttofinish.wazooinc.com/ massively multiplayer game development 2 page 220 charles river media", + "neighbors": [ + 429 + ], + "mask": "Validation" + }, + { + "node_id": 515, + "label": 4, + "text": "Hashcash:hashcash hashcash proof-of-work system used limit email spam denial-of-service attacks recently become known use bitcoin cryptocurrencies part mining algorithm hashcash proposed 1997 adam back described formally back paper hashcash denial service counter-measure similar idea first proposed cynthia dwork moni naor eli ponyatovski 1992 paper pricing via processing combatting junk mail using weakened signature schemes rather simpler efficient hash-based approach introduced hashcash hashcash independent rediscovery proof work concept author aware dwork et al work hashcash cryptographic hash-based proof-of-work algorithm requires selectable amount work compute proof verified efficiently email uses textual encoding hashcash stamp added header email prove sender expended modest amount cpu time calculating stamp prior sending email words sender taken certain amount time generate stamp send email unlikely spammer receiver negligible computational cost verify stamp valid however known way find header necessary properties brute force trying random values answer found though testing individual string easy satisfactory answers rare enough require substantial number tries find answer hypothesis spammers whose business model relies ability send large numbers emails little cost per message cease profitable even small cost spam send receivers verify whether sender made investment use results help filter email header line looks something like header contains header contains recipient email address date message information proving required computation performed presence recipient email address requires different header computed recipient date allows recipient record headers received recently ensure header unique email message sender prepares header appends counter value initialized random number computes 160-bit sha-1 hash header first 20 bits i.e 5 significant hex digits hash zeros acceptable header sender increments counter tries hash 2 possible hash values 2 hash values satisfy criterion thus chance randomly selecting header 20 zeros beginning hash 1 2 approx 10 one million number times sender needs try get valid hash value modeled geometric distribution hence sender average try 2 values find valid header given reasonable estimates time needed compute hash would take one second find efficient method brute force approach known find valid header normal user desktop pc would significantly inconvenienced processing time required generate hashcash string however spammers would suffer significantly due large number spam messages sent technically system implemented following steps hash string passes tests considered valid hash string tests take far less time disk space receiving body content e-mail time needed compute hash collision exponential number zero bits zero bits added doubling amount time needed compute hash additional zero bit expensive spammers generate valid header lines confirming header valid always takes amount time matter many zero bits required valid header since requires single hashing operation hashcash system advantage micropayment proposals applying legitimate e-mail real money involved neither sender recipient need pay thus administrative issues involved micropayment system moral issues related charging e-mail entirely avoided hand hashcash requires potentially significant computational resources expended e-mail sent somewhat difficult tune ideal amount average time one wishes clients expend computing valid header mean sacrificing accessibility low-end embedded systems else running risk hostile hosts challenged enough provide effective filter spam hashcash also fairly simple implement mail user agents spam filters central server needed hashcash incrementally deployed\u2014the extra hashcash header ignored received mail clients understand one plausible analysis concluded one following cases likely either non-spam e-mail get stuck due lack processing power sender spam e-mail bound still get examples include respectively centralized e-mail topology like mailing list server send enormous amount legitimate e-mails botnets cluster farms spammers increase processing power enormously issues may addressed e.g. botnets may expire faster users notice high cpu load take counter-measures mailing list servers registered white lists subscribers hosts thus relieved hashcash challenges represent serious obstacles hashcash deployment remain addressed another projected problem computers continue get faster according moore law difficulty calculations required must increased time however developing countries expected use older hardware means find increasingly difficult participate e-mail system also applies lower-income individuals developed countries afford latest hardware like hashcash cryptocurrencies use hash function proof-of-work system rise cryptocurrency created demand asic-based mining machines although cryptocurrencies use sha-256 hash function asic technology could used create hashcash solvers three orders magnitude faster consumer cpu reducing computational hurdle spammers contrast hashcash mail applications relies recipients set manually amount work intended deter malicious senders bitcoin cryptocurrency network employs different hashing-based proof-of-work challenge enable competitive bitcoin mining bitcoin miner runs computer program collects unconfirmed transactions coin dealers network data form block earn payment miner block accepted network miner discovers trial error nonce number included block yields hash sufficient number leading zero bits meet network difficulty target blocks accepted miners form bitcoin blockchain growing ledger every bitcoin transaction since coin first creation hashcash uses sha-1 hash requires first 20 160 hash bits zero bitcoin proof work uses two successive sha-256 hashes originally required least first 32 256 hash bits zero however bitcoin network periodically resets difficulty level keep average rate block creation 6 per hour january 2019 block 556678 bitcoin network responded deployments ever faster hashing hardware miners hardening requirement first 74 256 hash bits must zero hashcash used potential solution false positives automated spam filtering systems legitimate users rarely inconvenienced extra time takes mine stamp spamassassin able check hashcash stamps since version 2.70 assigning negative score i.e less likely spam valid unspent hashcash stamps however although hashcash plugin initially default still needs configured list address patterns must match hashcash resource field n't actually work default penny post software project sourceforge implements hashcash mozilla thunderbird email client project named historical availability conventional mailing services cost sender one penny see penny post information mailing services history microsoft also designed implemented deprecated open spec similar yet incompatible hashcash email postmark part coordinated spam reduction initiative csri microsoft email postmark variant hashcash implemented microsoft mail infrastructure components exchange outlook hotmail format differences hashcash microsoft email postmark postmark hashes body addition recipient uses modified sha-1 hash function uses multiple sub-puzzles reduce proof work variance like e-mail blogs often fall victim comment spam blog owners used hashcash scripts written javascript language slow comment spammers scripts wp-hashcash claim implement hashcash instead depend javascript obfuscation force client generate matching key require processing power use hashcash algorithm hashcash stamps hashcash patented reference implementation implementations free software hashcash included available many linux distributions rsa made ipr statements ietf client-puzzles context rfc described client-puzzles hashcash rfc included hashcash title referenced hashcash mechanism described known-solution interactive challenge akin client-puzzles hashcash non-interactive therefore known solution case rsa ipr statement apply hashcash hashcash predates march 1997 client-puzzles publication feb 1999 client-puzzles patent filing us7197639 february 2000", + "neighbors": [ + 354, + 363, + 509, + 620, + 1446, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 516, + "label": 1, + "text": "Object_Exchange_Model:object exchange model object exchange model oem model exchanging semi-structured data object-oriented databases serves basic data model numerous projects stanford university database group including tsimmis lore c3 slight variations oem evolved across different stanford projects lore labels actually parent-child links rather objects example oem object multiple parents different parent objects may use different labels identify object atomic value encoding person name might included one complex object using label author another complex object using label editor c3 additional attributes required object annotate changes object occurred time textual oem interchange format used lore goals interchange format textual encodings oem easy read easy edit easy generate parse program", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 517, + "label": 4, + "text": "Identity_management:identity management identity management idm also known identity access management iam framework policies technologies ensuring proper people enterprise appropriate access technology resources idm systems fall overarching umbrella security data management identity access management systems identify authenticate authorize individuals utilizing resources also hardware applications employees need access identity access management solutions become prevalent critical recent years regulatory compliance requirements become increasingly rigorous complex addresses need ensure appropriate access resources across increasingly heterogeneous technology environments meet increasingly rigorous compliance requirements terms identity management idm identity access management used interchangeably area identity access management identity-management systems products applications platforms manage identifying ancillary data entities include individuals computer-related hardware software applications idm covers issues users gain identity roles sometimes permissions identity grants protection identity technologies supporting protection e.g. network protocols digital certificates passwords etc. identity management idm task controlling information users computers information includes information authenticates identity user information describes information actions authorized access and/or perform also includes management descriptive information user information accessed modified managed entities typically include users hardware network resources even applications digital identity entity online presence encompassing personal identifying information pii ancillary information see oecd nist guidelines protecting pii interpreted codification identity names attributes physical instance way facilitates processing real-world context engineering online systems identity management involve four basic functions general model identity constructed small set axioms example identities given namespace unique identities bear specific relationship corresponding entities real world axiomatic model expresses pure identity sense model constrained specific application context general entity real virtual multiple identities identity encompass multiple attributes unique within given name space diagram illustrates conceptual relationship identities entities well identities attributes theoretical practical models digital identity given identity object consists finite set properties attribute values properties record information object either purposes external model operate model example classification retrieval pure identity model strictly concerned external semantics properties common departure pure identity practice occurs properties intended assure aspect identity example digital signature software token model may use internally verify aspect identity satisfaction external purpose extent model expresses semantics internally pure model contrast situation properties might externally used purposes information security managing access entitlement simply stored maintained retrieved without special treatment model absence external semantics within model qualifies pure identity model identity management defined set operations given identity model generally set capabilities reference practice identity management often expands express model contents provisioned reconciled among multiple identity models user access enables users assume specific digital identity across applications enables access controls assigned evaluated identity use single identity given user across multiple systems eases tasks administrators users simplifies access monitoring verification allows organizations minimize excessive privileges granted one user user access tracked initiation termination user access organizations deploy identity management process system motivation normally primarily manage set identities rather grant appropriate access rights entities via identities words access management normally motivation identity management two sets processes consequently closely related organizations continue add services internal users customers many services require identity management properly provide services increasingly identity management partitioned application functions single identity serve many even organization activities internal use identity management evolving control access digital assets including devices network equipment servers portals content applications and/or products services often require access extensive information user including address books preferences entitlements contact information since much information subject privacy and/or confidentiality requirements controlling access vital name implies identity federation comprises one systems federate user access allow users log based authenticating one systems participating federation trust several systems often known circle trust setup one system acts identity provider idp system acts service provider sp user needs access service controlled sp he/she first authenticates idp upon successful authentication idp sends secure assertion service provider saml assertions specified using mark language intended describing security assertions used verifier make statement relying party identity claimant saml assertions may optionally digitally signed addition creation deletion modification user identity data either assisted self-service identity management controls ancillary entity data use applications contact information location putting personal information onto computer networks necessarily raises privacy concerns absent proper protections data may used implement surveillance society social web online social networking services make heavy use identity management helping users decide manage access personal information become issue broad concern identity theft happens thieves gain access identity information personal details needed get access bank account research related management identity covers disciplines technology social sciences humanities law within seventh research framework programme european union 2007 2013 several new projects related identity management started picos project investigates develops state-of-the-art platform providing trust privacy identity management mobile communities primelife develops concepts technologies help individuals protect autonomy retain control personal information irrespective activities swift focuses extending identity functions federation network addressing usability privacy concerns leverages identity technology key integrate service transport infrastructures benefit users providers ongoing projects include future identity information society fidis guide prime academic journals publish articles related identity management include less specialized journals publish topic instance special issues identity iso specifically iso/iec jtc1 sc27 security techniques wg5 identity access management privacy techniques conducting standardization work identity management elaboration framework identity management including definition identity-related terms published standards current work items includes following organization normally role department responsible managing schema digital identities staff objects represented object identities object identifiers oid", + "neighbors": [ + 317, + 379, + 415, + 517, + 762, + 864, + 964, + 1036, + 1039, + 1416, + 1484, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 518, + "label": 4, + "text": "Logic_bomb:logic bomb logic bomb piece code intentionally inserted software system set malicious function specified conditions met example programmer may hide piece code starts deleting files salary database trigger ever terminated company software inherently malicious viruses worms often contain logic bombs execute certain payload pre-defined time condition met technique used virus worm gain momentum spread noticed viruses attack host systems specific dates friday 13th april fools day trojans computer viruses activate certain dates often called time bombs considered logic bomb payload unwanted unknown user software example trial programs code disables certain functionality set time normally regarded logic bombs reported 1982 trans-siberian pipeline incident occurred logic bomb later reported story may hoax kgb operative reported stolen plans sophisticated control system software canadian firm use siberian pipeline central intelligence agency cia supposedly tipped documents farewell dossier company insert logic bomb program sabotage purposes", + "neighbors": [ + 11, + 144, + 149, + 293, + 310, + 338, + 343, + 365, + 379, + 439, + 479, + 528, + 576, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 898, + 1039, + 1090, + 1112, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1433, + 1472, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 519, + "label": 3, + "text": "Bounder_(video_game):bounder video game courses composed numerous tiles suspended high ground ball must bounced past walls enemies coming contact either plummeting edge course results loss one player seven lives courses feature power squares push tennis ball forward allow longer jumps must utilized complete course power squares also used enable tennis ball reach mystery spaces tiles question marks contain extra lives bonus jumps used bonus screens mystery spaces also destroy tennis ball resulting loss life instant destruction freezing ball place missile flies across play area explodes bonus screen accessed every time course completed consists mystery spaces increase player score bounced player receive 40 bounces allowed bonus screen though figure increased player uncovering mystery squares preceding course bounces used mystery spaces bounced play moves next course bouncing mystery spaces awards player 10,000 points well extra life bounder received gold medal award commodore 64 magazine zzap 64 well sinclair mega game award remake bounder released mobile game swivel creations may 2019", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 520, + "label": 9, + "text": "Java_Platform,_Micro_Edition:java platform micro edition java platform micro edition java computing platform development deployment portable code embedded mobile devices micro-controllers sensors gateways mobile phones personal digital assistants tv set-top boxes printers java formerly known java 2 platform micro edition j2me platform uses object-oriented java programming language part java software-platform family java designed sun microsystems acquired oracle corporation 2010 platform replaced similar technology personaljava originally developed java community process jsr 68 different flavors java evolved separate jsrs oracle provides reference implementation specification tended provide free binary implementations java runtime environment mobile devices rather relying third parties provide 22 december 2006 java source code licensed gnu general public license released project name phoneme 2008 java platforms currently restricted jre 1.3 features use version class file format internally known version 47.0 oracle ever declare new round java configuration versions support later class file formats language features corresponding jre 1.5 1.6 notably generics entail extra work part platform vendors update jres java devices implement profile common mobile information device profile aimed mobile devices cell phones personal profile aimed consumer products embedded devices like set-top boxes pdas profiles subsets configurations currently two connected limited device configuration cldc connected device configuration cdc 2.1 billion java enabled mobile phones pdas popular sub- 200 devices nokia series 40 also used bada operating system symbian os along native software users windows ce windows mobile maemo meego android download java respective environments proof-of-concept android connected limited device configuration cldc contains strict subset java-class libraries minimum amount needed java virtual machine operate cldc basically used classifying myriad devices fixed configuration configuration provides basic set libraries virtual-machine features must present implementation j2me environment coupled one profiles connected limited device configuration gives developers solid java platform creating applications consumer embedded devices configuration designed devices 160kb 512kb total memory minimum 160kb rom 32kb ram available java platform designed mobile phones mobile information device profile includes gui data storage api midp 2.0 includes basic 2d gaming api applications written profile called midlets almost new cell phones come midp implementation de facto standard downloadable cell phone games however many cellphones run midlets approved carrier especially north america jsr 271 mobile information device profile 3 final release 09 dec 2009 specified 3rd generation mobile information device profile midp3 expanding upon functionality areas well improving interoperability across devices key design goal midp3 backward compatibility midp2 content information module profile imp profile embedded headless devices vending machines industrial embedded applications security systems similar devices either simple display limited network connectivity originally introduced siemens mobile nokia jsr-195 imp 1.0 strict subset midp 1.0 except n't include user interface apis \u2014 words n't include support java package codice_1 jsr-228 also known imp-ng imp next generation based midp 2.0 leveraging midp 2.0 new security networking types apis apis codice_2 codice_3 n't include ui apis game api connected device configuration subset java se containing almost libraries gui related richer cldc foundation profile java connected device configuration cdc profile profile intended used devices requiring complete implementation java virtual machine including entire java platform standard edition api typical implementations use subset api set depending additional profiles supported specification developed java community process personal basis profile extends foundation profile include lightweight gui support form awt subset platform bd-j built upon sun provides reference implementation configurations profiles midp cdc starting javame 3.0 sdk netbeans-based ide support single ide contrast numerous binary implementations java platform built sun servers workstations sun provide binaries platforms java targets exception midp 1.0 jre jvm palm os sun provides j2me jre microsoft windows mobile pocket pc based devices despite open-letter campaign sun release rumored internal implementation personaljava known code name captain america third party implementations widely used windows mobile vendors operating systems targeting java implemented docomo form doja savaje savaje os latter company purchased sun april 2007 forms basis sun javafx mobile open-source mika vm aims implement javame cdc/fp certified certified implementations required charge royalties impractical open-source project consequently devices use implementation allowed claim javame cdc compatibility linux-based android operating system uses proprietary version java similar identical java esr consortium devoted standards embedded java especially cost effective standards typical applications domains industrial control machine-to-machine medical e-metering home automation consumer human-to-machine-interface ...", + "neighbors": [ + 101, + 162, + 337, + 347, + 477, + 527, + 538, + 622, + 629, + 786, + 796, + 869, + 1018, + 1020, + 1051, + 1091, + 1140, + 1193, + 1203, + 1314, + 1481, + 1508, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 521, + "label": 2, + "text": ".NET_Framework:.net framework .net framework pronounced dot net software framework developed microsoft runs primarily microsoft windows includes large class library named framework class library fcl provides language interoperability language use code written languages across several programming languages programs written .net framework execute software environment contrast hardware environment named common language runtime clr clr application virtual machine provides services security memory management exception handling computer code written using .net framework called managed code fcl clr together constitute .net framework fcl provides user interface data access database connectivity cryptography web application development numeric algorithms network communications programmers produce software combining source code .net framework libraries framework intended used new applications created windows platform microsoft also produces integrated development environment largely .net software called visual studio .net framework began proprietary software although firm worked standardize software stack almost immediately even first release despite standardization efforts developers mainly free open-source software communities expressed unease selected terms prospects free open-source implementation especially regarding software patents since microsoft changed .net development closely follow contemporary model community-developed software project including issuing update patent promising address concerns .net framework led family .net platforms targeting mobile computing embedded devices alternative operating systems web browser plug-ins reduced version framework .net compact framework available windows ce platforms including windows mobile devices smartphones .net micro framework targeted resource-constrained embedded devices silverlight available web browser plugin mono available many operating systems customized popular smartphone operating systems android ios game engines .net core targets universal windows platform uwp cross-platform cloud computing workloads microsoft began developing .net framework late 1990s originally name next generation windows services ngws part .net strategy late 2000 first beta versions .net 1.0 released august 2000 microsoft intel worked standardize common language infrastructure cli c december 2001 ratified ecma international ecma standards international organisation standardisation iso followed april 2003 current version iso standards iso/iec 23271:2012 iso/iec 23270:2006 microsoft partners hold patents cli c ecma iso require patents essential implementation made available reasonable non-discriminatory terms firms agreed meet terms make patents available royalty-free however apply part .net framework covered ecma-iso standards included windows forms ado.net asp.net patents microsoft holds areas may deterred non-microsoft implementations full framework october 3 2007 microsoft announced source code .net framework 3.5 libraries become available microsoft reference source license ms-rsl source code repository became available online january 16 2008 included bcl asp.net ado.net windows forms wpf xml scott guthrie microsoft promised linq wcf wf libraries added november 12 2014 microsoft announced .net core effort include cross-platform support .net source release microsoft coreclr implementation source entire \u2026 library stack .net core adoption conventional bazaar -like open-source development model consolation stewardship .net foundation miguel de icaza describes .net core redesigned version .net based simplified version class libraries microsoft immo landwerth explained .net core would foundation future .net platforms time announcement initial release .net core project seeded subset libraries source code coincided relicensing microsoft existing .net reference source away restrictions ms-rsl landwerth acknowledged disadvantages formerly selected shared license explaining made codename rotor non-starter community-developed open source project meet criteria open source initiative osi approved license november 2014 microsoft also produced update patent grants extends scope beyond prior pledges prior projects like mono existed legal grey area microsoft earlier grants applied technology covered specifications including strictly 4th editions ecma-334 ecma-335 new patent promise however places ceiling specification version even extends .net runtime technologies documented msdn formally specified ecma group project chooses implement allows mono projects maintain feature parity modern .net features introduced since 4th edition published without risk patent litigation implementation features new grant maintain restriction implementation must maintain minimum compliance mandatory parts cli specification march 31 2016 microsoft announced microsoft build completely relicense mono mit license even scenarios formerly commercial license needed microsoft also supplemented prior patent promise mono stating assert applicable patents parties using selling offering sale importing distributing mono announced mono project contributed .net foundation developments followed acquisition xamarin began february 2016 finished march 18 2016 microsoft press release highlights cross-platform commitment allows fully open-source modern server-side .net stack microsoft released source code wpf windows forms winui december 4 2018 may 8th 2019 microsoft announced .net 5.0 released november 2020 based .net core common language infrastructure cli provides language-neutral platform application development execution implementing core aspects .net framework within scope cli functions tied one language available across many languages supported framework .net framework includes common language runtime clr serves execution engine .net framework offers many services memory management type safety exception handling garbage collection security thread management programs written .net framework executed clr programs written .net framework compiled common intermediate language code cil opposed directly compiled machine code execution architecture-specific just-in-time compiler jit turns cil code machine code microsoft move .net core cli virtual execution system ves implementation known coreclr instead clr compiled cil code stored cli assemblies mandated specification assemblies stored portable executable pe file format common windows platform dynamic-link library dll executable exe files assembly consists one files one must contain manifest bearing metadata assembly complete name assembly confused file name disk contains simple text name version number culture public key token assemblies considered equivalent share complete name private key also used creator assembly strong naming public key token identifies private key assembly signed creator key pair typically person signing assembly sign assemblies strong name prior version assembly since creator possesses private key strong naming required add assemblies global assembly cache starting visual studio 2015 .net native compilation technology allows compilation .net code universal windows platform apps directly machine code rather cil code app must written either c visual basic.net .net framework includes implementation cli foundational standard libraries .net framework class library fcl organized hierarchy namespaces built-in application programming interfaces apis part either codice_1 codice_2 namespaces class libraries implement many common functions file reading writing graphic rendering database interaction xml document manipulation class libraries available cli compliant languages fcl implements cli base class library bcl class libraries\u2014some specified cli microsoft specific bcl includes small subset entire class library core set classes serve basic api clr .net framework classes considered part bcl reside codice_3 codice_4 codice_5 bcl classes available .net framework well alternative implementations including .net compact framework microsoft silverlight .net core mono fcl refers entire class library ships .net framework includes expanded set libraries including bcl windows forms asp.net windows presentation foundation wpf also extensions base class libraries ado.net language integrated query linq windows communication foundation wcf workflow foundation wf fcl much larger scope standard libraries languages like c++ comparable scope standard libraries java introduction alternative implementations e.g. silverlight microsoft introduced concept portable class libraries pcl allowing consuming library run one platform proliferation .net platforms pcl approach failed scale pcls defined intersections api surface two platforms next evolutionary step pcl .net standard library created retroactively based codice_6 based apis found uwp silverlight new .net platforms encouraged implement version standard library allowing re-use extant third-party libraries run without new versions .net standard library allows independent evolution library app model layers within .net architecture nuget package manager .net platforms used retrieve third-party libraries .net project global library feed nuget.org private feeds maintained separately e.g. build server file system directory microsoft move .net core cli foundational class libraries implementation known corefx instead fcl atop class libraries multiple app models used create apps .net framework supports console windows forms windows presentation foundation asp.net asp.net core apps default app models offered alternative implementations .net framework console uwp asp.net core available .net core mono used power xamarin app models android ios macos retroactive architectural definition app models showed early 2015 also applied prior technologies like windows forms wpf microsoft introduced c++/cli visual studio 2005 language means compiling visual c++ programs run within .net framework parts c++ program still run within unmanaged visual c++ runtime specially modified parts translated cil code run .net framework clr assemblies compiled using c++/cli compiler termed mixed-mode assemblies since contain native managed code dll assemblies complex reverse engineer since .net decompilers .net reflector reveal managed code computer systems commonly require interaction newer older applications .net framework provides means access functions implemented newer older programs execute outside .net environment access component object model com components provided codice_7 codice_8 namespaces framework access functions via platform invocation services p/invoke access .net functions native applications via reverse p/invoke function .net framework introduces common type system cts defines possible data types programming constructs supported clr may may interact conforming cli specification feature .net framework supports exchange types object instances libraries applications written using conforming .net language cts clr used .net framework also enforce type safety prevents ill-defined casts wrong method invocations memory size issues accessing object also makes cli languages statically typed without type inference however starting .net framework 4.0 dynamic language runtime extended clr allowing dynamically typed languages implemented atop cli microsoft never implemented full framework system except microsoft windows engineered framework cross-platform implementations available operating systems see silverlight \u00a7 alternative implementations microsoft submitted specifications cli includes core class libraries cts cil c c++/cli ecma international ecma international organization standardization iso making available official standards makes possible third parties create compatible implementations framework languages platforms .net framework security mechanism two general features code access security cas validation verification cas based evidence associated specific assembly typically evidence source assembly whether installed local machine downloaded internet cas uses evidence determine permissions granted code code demand calling code granted specified permission demand causes clr perform call stack walk every assembly method call stack checked required permission assembly granted permission security exception thrown managed cil bytecode easier reverse-engineer native code unless obfuscated decompiler programs enable developers reverse-engineering skills view source code behind unobfuscated .net assemblies contrast apps compiled native machine code much harder reverse-engineer source code almost never produced successfully mainly compiler optimizations lack reflection creates concerns business community possible loss trade secrets bypassing license control mechanisms mitigate microsoft included dotfuscator community edition visual studio .net since 2002 third-party obfuscation tools also available vendors vmware v.i labs turbo red gate software method-level encryption tools .net code available vendors safenet clr frees developer burden managing memory allocating freeing done handles memory management detecting memory safely freed instantiations .net types objects allocated managed heap pool memory managed clr long reference object exists may either direct via graph objects object considered use reference object exists reached used becomes garbage eligible collection .net framework includes garbage collector gc runs periodically separate thread application thread enumerates unusable objects reclaims memory allocated non-deterministic compacting mark-and-sweep garbage collector gc runs set amount memory used enough pressure memory system since guaranteed conditions reclaim memory reached gc runs non-deterministic .net application set roots pointers objects managed heap managed objects include references static objects objects defined local variables method parameters currently scope objects referred cpu registers gc runs pauses application object referred root recursively enumerates objects reachable root objects marks reachable uses cli metadata reflection discover objects encapsulated object recursively walk enumerates objects heap initially allocated contiguously using reflection objects marked reachable garbage mark phase since memory held garbage consequence considered free space however leaves chunks free space objects initially contiguous objects compacted together make free space managed heap contiguous reference object invalidated moving object updated gc reflect new location application resumed garbage collection ends latest version .net framework uses concurrent garbage collection along user code making pauses unnoticeable done background garbage collector used .net framework also generational objects assigned generation newly created objects tagged generation 0 objects survive one garbage collection tagged generation 1 generation 1 objects survive another collection generation 2 framework uses generation 2 objects higher generation objects garbage collected less often lower generation objects raises efficiency garbage collection older objects tend longer lifetimes newer objects ignoring older objects collection runs fewer checks compaction operations needed total application first launched .net framework compiles cil code executable code using just-in-time compiler caches executable program .net native image cache due caching application launches faster subsequent launches although first launch usually slower speed first launch developers may use native image generator utility manually ahead-of-time compile cache .net application garbage collector integrated environment introduce unanticipated delays execution developer little direct control large applications number objects garbage collector needs work become large means take long time visit rearrange .net framework provides support calling streaming simd extensions sse via managed code april 2014 visual studio 2013 update 2 however mono provided support simd extensions version 2.2 within namespace 2009 mono lead developer miguel de icaza expressed hope simd support adopted clr ecma standard streaming simd extensions available x86 cpus since introduction pentium iii architectures arm mips also simd extensions case cpu lacks support extensions instructions simulated software .net framework predominant implementation .net technologies implementations parts framework exist although runtime engine described ecma-iso specification implementations may encumbered patent issues iso standards may include disclaimer attention drawn possibility elements document may subject patent rights iso shall held responsible identifying patent rights harder develop alternatives fcl described open standard may subject copyright restrictions also parts fcl windows-specific functions behavior implementation non-windows platforms problematic alternative implementations parts framework listed microsoft managed code frameworks components licensed follows", + "neighbors": [ + 26, + 28, + 33, + 66, + 74, + 79, + 85, + 93, + 111, + 137, + 148, + 153, + 154, + 162, + 207, + 225, + 262, + 268, + 275, + 278, + 292, + 295, + 301, + 312, + 324, + 326, + 332, + 336, + 344, + 347, + 355, + 373, + 378, + 412, + 433, + 435, + 472, + 485, + 538, + 558, + 574, + 579, + 611, + 615, + 638, + 647, + 662, + 689, + 690, + 705, + 712, + 716, + 742, + 756, + 791, + 796, + 801, + 815, + 824, + 825, + 865, + 899, + 902, + 920, + 926, + 934, + 946, + 947, + 961, + 989, + 1016, + 1025, + 1028, + 1035, + 1044, + 1068, + 1092, + 1098, + 1109, + 1120, + 1138, + 1140, + 1151, + 1152, + 1161, + 1177, + 1193, + 1212, + 1214, + 1221, + 1231, + 1247, + 1261, + 1292, + 1311, + 1325, + 1328, + 1329, + 1338, + 1346, + 1363, + 1366, + 1370, + 1372, + 1417, + 1428, + 1430, + 1437, + 1461, + 1502, + 1506, + 1508, + 1511, + 1531, + 1533, + 1545, + 1547, + 1561, + 1578, + 1589, + 1613, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 522, + "label": 4, + "text": "BASHLITE:bashlite bashlite also known gafgyt lizkebab qbot torlus lizardstresser malware infects linux systems order launch distributed denial-of-service attacks ddos originally also known name bashdoor term refers exploit method used malware used launch attacks 400 gbps original version 2014 exploited flaw bash shell shellshock software bug exploit devices running busybox months later variant detected could also infect vulnerable devices local network 2015 source code leaked causing proliferation different variants 2016 reported one million devices infected identifiable devices participating botnets august 2016 almost 96 percent iot devices 95 percent cameras dvrs roughly 4 percent home routers less 1 percent compromised linux servers bashlite written c designed easily cross-compile various computer architectures exact capabilities differ variants common features generate several different types ddos attacks hold open tcp connections send random string junk characters tcp udp port repeatedly send tcp packets specified flags may also mechanism run arbitrary shell commands infected machine facilities reflected amplification attacks bashlite uses client\u2013server model command control protocol used communication essentially lightweight version internet relay chat irc even though supports multiple command control servers variants single command control ip-address hardcoded propagates via brute forcing using built-in dictionary common usernames passwords malware connects random ip addresses attempts login successful logins reported back command control server", + "neighbors": [ + 17, + 134, + 306, + 330, + 363, + 450, + 490, + 564, + 666, + 1138, + 1162, + 1200, + 1358, + 1365, + 1398, + 1467, + 1543, + 1552, + 1554 + ], + "mask": "Test" + }, + { + "node_id": 523, + "label": 7, + "text": "Connection_broker:connection broker software engineering connection broker resource manager manages pool connections connection-based resources databases remote desktops enabling rapid reuse connections short-lived processes without overhead setting new connection time connection brokers often used systems using n-tier architectures remote desktop connection brokers perform variety tasks including", + "neighbors": [ + 429 + ], + "mask": "Validation" + }, + { + "node_id": 524, + "label": 6, + "text": "Macintosh_File_System:macintosh file system macintosh file system mfs volume format disk file system created apple computer storing files 400k floppy disks mfs introduced original apple macintosh computer january 1984 mfs notable introducing resource forks allow storage structured data storing metadata needed support graphical user interface mac os mfs allows file names 255 characters length although finder allow users create names longer 63 characters 31 characters later versions mfs called flat file system support hierarchy directories folders exist concept original mfs-based macintosh work completely differently way modern systems visible finder windows open save dialog boxes always one empty folder volume altered way adding renaming files new empty folder appears thus providing way create new folders mfs stores file directory listing information single file finder creates illusion folders storing files pairs directory handles file handles display contents particular folder mfs scans directory files handle need find separate file containing directory listing macintosh file system support volumes 20 mb size 1,400 files small today standards time seemed expansive compared macintosh 400 kb floppy drive apple introduced hierarchical file system replacement mfs september 1985 mac os 7.6.1 apple removed support writing mfs volumes mac os 8.0 support mfs volumes removed altogether although macos built-in support mfs example vfs plug-in apple called mfslives provides read-only access mfs volumes", + "neighbors": [ + 34, + 40, + 55, + 63, + 99, + 121, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 365, + 438, + 495, + 553, + 557, + 558, + 570, + 723, + 728, + 797, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1578, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 525, + "label": 3, + "text": "Lunar_Pool:lunar pool lunar pool known japan video game combines pool pocket billiards aspects miniature golf created developed compile nintendo entertainment system msx stage differently shaped pool table object knock ball pocket using cue ball sixty levels choose friction table adjustable thus lunar reference title along moon-related background imagery within game japanese lunar ball appeared famicom clone systems pirated multi-game cartridges power player super joy iii released wii north american virtual console october 22 2007 lunar pool played boards different shapes wherein player shoot cue ball knock colored balls pockets player fails pocket least one colored ball three consecutive turns player lose one life also player pockets cue ball loses life player pockets colored balls level consecutively without failure player get perfect remark bonus points added player score lunar pool either played alone another player computer game played another player computer players take turns shooting cue ball one player fails knock least one colored balls pocket pockets cue ball opponent turn", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 526, + "label": 8, + "text": "GoAgent:goagent goagent gnu gpl open-source cross-platform network access software mainly written python supports windows os x linux linux-based os like android openwrt uses google app engine servers provide users free proxy service gain access blocked information normally used web browsers goagent eventually shut request chinese law enforcement project called xx-net claims reborn goagent first release january 2015", + "neighbors": [ + 134, + 678, + 796, + 813, + 1138, + 1225, + 1452, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 527, + "label": 2, + "text": "Series_40:series 40 series 40 often shortened s40 software platform application user interface ui software nokia broad range mid-tier feature phones well vertu line luxury phones one world widely used mobile phone platforms found hundreds millions devices nokia announced 25 january 2012 company sold 1.5 billion series 40 devices used smartphones nokia primarily uses windows phone 2012 symbian however 2012 2013 several series 40 phones asha line 308 309 311 advertised smartphones although actually support smartphone features like multitasking fully fledged html browser 2014 microsoft acquired nokia mobile phones business part licensing agreement company microsoft mobile allowed use nokia brand feature phones series 40 range however july 2014 company memo revealed microsoft would end future production series 40 devices replaced series 30+ series 40 underlying operating system called intelligent system architecture isa also called nokia operating system nos series 40 introduced 1999 release nokia 7110 96 \u00d7 65 pixel monochrome display first phone come wap browser years s40 ui evolved low-resolution ui high-resolution color ui enhanced graphical look third generation series 40 became available 2005 introduced support devices resolutions high qvga 240\u00d7320 possible customize look feel ui via comprehensive themes 2012 nokia asha mobile phones 200/201/210 302/306/305/308/310/311 303 311 released used series 40 final feature phone running series 40 nokia 515 2013 running 6th edition series 40 provides communication applications telephone internet telephony voip messaging email client pop3 imap4 capabilities web browser media applications camera video recorder music/video player fm radio phonebook personal information management pim applications calendar tasks basic file management like series 60 provided applications gallery folders subfolders gallery also default location files transferred bluetooth placed user-installed applications series 40 generally mobile java applications flash lite applications also supported mostly used screensavers integrated web browser access web content service provider xhtml/html gateway latest version series 40 called series 40 6th edition introduced new browser based webkit open source components webcore javascriptcore new browser delivers support html 4.01 css2 javascript 1.5 ajax also like higher-end series 60 series 40 run uc browser web browser enhance user web browsing experience latest feature phones asha lineup come nokia xpress browser uses proxy servers compress optimize web pages similar fashion opera mini support syncml synchronization address book calendar notes external services present however many s40 phones synchronization settings must sent via ota text message series 40 embedded software platform open software development via standard de facto content application development technologies supports java midlets i.e java midp cldc technology provide location communication messaging media graphics capabilities s40 also supports flash lite applications", + "neighbors": [ + 3, + 21, + 101, + 113, + 162, + 238, + 253, + 264, + 298, + 309, + 337, + 477, + 484, + 509, + 520, + 527, + 583, + 603, + 619, + 622, + 629, + 707, + 716, + 726, + 833, + 1018, + 1020, + 1051, + 1117, + 1138, + 1140, + 1193, + 1203, + 1280, + 1314, + 1325, + 1373, + 1422, + 1493, + 1520, + 1522, + 1529, + 1602, + 1619, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 528, + "label": 4, + "text": "Encryption:encryption cryptography encryption process encoding message information way authorized parties access authorized encryption prevent interference denies intelligible content would-be interceptor encryption scheme intended information message referred plaintext encrypted using encryption algorithm \u2013 cipher \u2013 generating ciphertext read decrypted technical reasons encryption scheme usually uses pseudo-random encryption key generated algorithm principle possible decrypt message without possessing key well-designed encryption scheme considerable computational resources skills required authorized recipient easily decrypt message key provided originator recipients unauthorized users symmetric-key schemes encryption decryption keys communicating parties must key order achieve secure communication example symmetric key german military enigma machine key settings day allies figured machine worked able decipher information encoded within messages soon could discover encryption key given day transmissions public-key encryption schemes encryption key published anyone use encrypt messages however receiving party access decryption key enables messages read public-key encryption first described secret document 1973 encryption schemes symmetric-key also called private-key although published subsequently work diffie hellman published journal large readership value methodology explicitly described method became known diffie hellman key exchange publicly available public key encryption application called pretty good privacy pgp written 1991 phil zimmermann distributed free charge source code purchased symantec 2010 regularly updated encryption long used militaries governments facilitate secret communication commonly used protecting information within many kinds civilian systems example computer security institute reported 2007 71 companies surveyed utilized encryption data transit 53 utilized encryption data storage encryption used protect data rest information stored computers storage devices e.g usb flash drives recent years numerous reports confidential data customers personal records exposed loss theft laptops backup drives encrypting files rest helps protect physical security measures fail digital rights management systems prevent unauthorized use reproduction copyrighted material protect software reverse engineering see also copy protection another somewhat different example using encryption data rest encryption also used protect data transit example data transferred via networks e.g internet e-commerce mobile telephones wireless microphones wireless intercom systems bluetooth devices bank automatic teller machines numerous reports data transit intercepted recent years data also encrypted transmitted across networks order protect eavesdropping network traffic unauthorized users conventional methods deleting data permanently storage device involve overwriting whole content zeros ones patterns \u2013 process take significant amount time depending capacity type medium cryptography offers way making erasure almost instantaneous method called crypto-shredding example implementation method found ios devices cryptographic key kept dedicated 'effaceable storage key stored device setup offer full confidentiality protection case unauthorized person gains physical access device encryption important tool sufficient alone ensure security privacy sensitive information throughout lifetime applications encryption protect information rest transit leaving sensitive data cleartext potentially vulnerable improper disclosure processing cloud service example homomorphic encryption secure multi-party computation emerging techniques compute encrypted data techniques general turing complete incur high computational and/or communication costs response encryption data rest cyber-adversaries developed new types attacks recent threats encryption data rest include cryptographic attacks stolen ciphertext attacks attacks encryption keys insider attacks data corruption integrity attacks data destruction attacks ransomware attacks data fragmentation active defense data protection technologies attempt counter attacks distributing moving mutating ciphertext difficult identify steal corrupt destroy encryption protect confidentiality messages techniques still needed protect integrity authenticity message example verification message authentication code mac digital signature authenticated encryption algorithms designed provide encryption integrity protection together standards cryptographic software hardware perform encryption widely available successfully using encryption ensure security may challenging problem single error system design execution allow successful attacks sometimes adversary obtain unencrypted information without directly undoing encryption see example traffic analysis tempest trojan horse integrity protection mechanisms macs digital signatures must applied ciphertext first created typically device used compose message protect message end-to-end along full transmission path otherwise node sender encryption agent could potentially tamper encrypting time creation secure encryption device correct keys tampered endpoint device configured trust root certificate attacker controls example attacker inspect tamper encrypted data performing man-in-the-middle attack anywhere along message path common practice tls interception network operators represents controlled institutionally sanctioned form attack countries also attempted employ attacks form control censorship even encryption correctly hides message content tampered rest transit message length form metadata still leak sensitive information message well-known crime breach attacks https side-channel attacks relied information leakage via length encrypted content example traffic analysis broad class techniques often employs message lengths infer sensitive implementation traffic flows many messages aggregate padding message payload encrypting help obscure cleartext true length cost increasing ciphertext size introducing bandwidth overhead messages may padded randomly deterministically approach different tradeoffs encrypting padding messages form padded uniform random blobs purbs practice guaranteeing cipher text leaks metadata cleartext content leaks asymptotically minimal formula_1 information via length", + "neighbors": [ + 11, + 14, + 68, + 91, + 121, + 144, + 149, + 186, + 232, + 252, + 268, + 272, + 289, + 293, + 295, + 310, + 333, + 338, + 379, + 415, + 439, + 448, + 455, + 479, + 481, + 491, + 494, + 518, + 539, + 542, + 576, + 591, + 611, + 633, + 664, + 692, + 696, + 698, + 703, + 705, + 739, + 740, + 750, + 800, + 813, + 864, + 889, + 892, + 898, + 923, + 930, + 1036, + 1039, + 1090, + 1104, + 1112, + 1121, + 1179, + 1206, + 1209, + 1240, + 1289, + 1291, + 1303, + 1317, + 1325, + 1337, + 1355, + 1358, + 1361, + 1368, + 1372, + 1373, + 1379, + 1386, + 1433, + 1443, + 1452, + 1459, + 1472, + 1534, + 1538, + 1570, + 1585, + 1604, + 1608, + 1634 + ], + "mask": "Test" + }, + { + "node_id": 529, + "label": 3, + "text": "Status_register:status register status register flag register condition code register ccr collection status flag bits processor examples registers include flags register x86 architecture flags program status word psw register ibm system/360 architecture z/architecture application program status register apsr arm cortex-a architecture status register hardware register contains information state processor individual bits implicitly explicitly read and/or written machine code instructions executing processor status register lets instruction take action contingent outcome previous instruction typically flags status register modified effects arithmetic bit manipulation operations example z bit may set result operation zero cleared nonzero classes instructions may also modify flags indicate status example string instruction may indicate whether instruction terminated found match/mismatch found end string flags read subsequent conditional instruction specified action depending processor jump call return occurs flags indicate specified result earlier instruction cpu architectures mips alpha use dedicated flag register others implicitly set and/or read flags machines either pass implicit status information instructions pass explicitly selected general purpose register status register may often fields well specialized flags interrupt enable bits similar types information interrupt status thread currently executing preserved later recalled storing current value status register along program counter active registers machine stack reserved area memory list common cpu status register flags implemented almost modern processors processors status register also contains flags status flags enable instruction act based result previous instruction pipelined processors superscalar speculative processors create hazards slow processing require extra hardware work around long instruction word processors dispense status flags single instruction performs test indicates outcome test take action compare b jump c equal result test saved subsequent instructions another alternative status register processor instructions deposit status information general-purpose register program requests mips amd 29000 dec alpha risc-v examples architectures provide comparison instructions store comparison result general-purpose register single bit numeric value 0 1 conditional branches act based value general-purpose register usually comparison instructions test equality signed/unsigned magnitude test conditions program uses equivalence formula example mips carry bit program performing multiple-word addition test whether single-word addition registers overflowed testing whether sum lower operand codice_1 instruction sets codice_2 1 0 based specified comparison two operands general-purpose register codice_2 used status register govern conditional jump rather possible value 1 indicating carry low-order addition added high-order word scheme becomes less convenient adding three words two additions computing codice_4 either may generate carry must detected two codice_1 instructions fortunately two carries may added without risk overflow situation stabilizes five instructions per word added", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 314, + 331, + 335, + 388, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 979, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1022, + 1044, + 1052, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1469, + 1505, + 1507, + 1518, + 1525, + 1557, + 1605, + 1632 + ], + "mask": "Train" + }, + { + "node_id": 530, + "label": 5, + "text": "MediaBrowser:mediabrowser mediabrowser mediabrowser.com inc. internet browser branding company started 2000 mark c. brown made specially branded versions internet explorer various company brands themes branded web browsers made mediabrowser require internet explorer 5 higher supported windows operating systems december 5 2001 mediabrowser.com inc. went bankrupt shut site branded web browsers windows 95 windows xp internet explorer 5.0 higher windows media player 6.4 higher macromedia flash 4.0 higher also 486 mhz higher processor 32 mb ram 5 mb free hard drive space active internet connection due compatibility issues mediabrowser compatible windows vista windows 7 however run windows xp compatibility mode upon new installation mediabrowser branded browser user required register web browser using mediabrowser online registration form asked name address etc 12 years old mediabrowser shut registration process broken registration form hosted defunct web site therefore users would able use unless modified value windows registry branding consisted various brand images background navigation buttons splash screen links specific web pages related brand company mediabrower also space ads display bottom web browser mediabrowser microtron also included every mediabrowser branding display brand-related video content user late 2000 video game company nintendo partnered mediabrowser make branded browsers new upcoming video games first two browsers released upcoming pok\u00e9mon gold silver video games mario tennis retailers gave cd-rom copies branded pok\u00e9mon gs browser anyone pre-ordered copy pok\u00e9mon gold silver special promotion later 2001 browsers released branded nintendo games paper mario nintendo power branded browser released well mediabrowser.com inc. went bankrupt december 5 2001 chapter 7 filing due company debts 2.49 million various unpaid loans web site containing branded web browsers pulled nintendo posted notice downloads page stating nintendo custom browsers currently unavailable date return keep checking nintendo.com downloads page updates thanks", + "neighbors": [ + 14, + 83, + 95, + 107, + 258, + 277, + 427, + 491, + 509, + 531, + 582, + 623, + 627, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 1033, + 1058, + 1084, + 1132, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1376, + 1378, + 1408, + 1423, + 1528, + 1550, + 1569, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 531, + "label": 4, + "text": "Browser_security:browser security browser security application internet security web browsers order protect networked data computer systems breaches privacy malware security exploits browsers often use javascript \u2014 sometimes cross-site scripting xss \u2014 sometimes secondary payload using adobe flash security exploits also take advantage vulnerabilities security holes commonly exploited browsers including mozilla firefox google chrome opera microsoft internet explorer safari web browsers breached one following ways browser may aware breaches may show user safe connection made whenever browser communicates website website part communication collects information browser order process formatting page delivered nothing else malicious code inserted website content worst-case scenario website specifically designed host malicious code vulnerabilities specific particular browser allow malicious code run processes within browser application unintended ways remember one bits information website collects browser communication browser identity- allowing specific vulnerabilities exploited attacker able run processes visitor machine exploiting known security vulnerabilities allow attacker gain privileged access browser n't already running privileged access infected system order perform even greater variety malicious processes activities machine even victim whole network breaches web browser security usually purpose bypassing protections display pop-up advertising collecting personally identifiable information pii either internet marketing identity theft website tracking web analytics user using tools web bugs clickjacking likejacking facebook like button targeted http cookies zombie cookies flash cookies local shared objects lsos installing adware viruses spyware trojan horses gain access users personal computers via cracking malware including online banking theft using man-in-the-browser attacks vulnerabilities web browser software minimized keeping browser software updated sufficient underlying operating system compromised example rootkit subcomponents browsers scripting add-ons cookies particularly vulnerable confused deputy problem also need addressed following principle defence depth fully patched correctly configured browser may sufficient ensure browser-related security issues occur example rootkit capture keystrokes someone logs banking website carry man-in-the-middle attack modifying network traffic web browser dns hijacking dns spoofing may used return false positives mistyped website names subvert search results popular search engines malware rsplug simply modifies system configuration point rogue dns servers browsers use secure methods network communication help prevent attacks perimeter defenses typically firewalls use filtering proxy servers block malicious websites perform antivirus scans file downloads commonly implemented best practice large organizations block malicious network traffic reaches browser topic browser security grown point spawning creation entire organizations browser exploitation framework project creating platforms collect tools breach browser security ostensibly order test browsers network systems vulnerabilities although part browser per se browser plugins extensions extend attack surface exposing vulnerabilities adobe flash player adobe acrobat reader java plugin activex commonly exploited malware may also implemented browser extension browser helper object case internet explorer browsers like google chrome mozilla firefox block\u2014or warn users of\u2014insecure plugins august 2009 study social science research network found 50 websites using flash also employing flash cookies yet privacy policies rarely disclosed user controls privacy preferences lacking browsers cache history delete functions affect flash player writing local shared objects cache user community much less aware existence function flash cookies http cookies thus users deleted http cookies purged browser history files caches may believe purged tracking data computers fact flash browsing history remains well manual removal betterprivacy addon firefox remove flash cookies adblock plus used filter specific threats flashblock used give option allowing content otherwise trusted sites charlie miller recommended install flash computer security conference cansecwest several security experts also recommend either install adobe flash player block contents web page arbitrary controlled entity owning domain named displayed address bar https used encryption used secure attackers access network changing page contents en route presented password field web page user supposed look address bar determine whether domain name address bar correct place send password example google single sign-on system used e.g youtube.com user always check address bar says nowiki https //accounts.google.com /nowiki inputting password un-compromised browser guarantees address bar correct guarantee one reason browsers generally display warning entering fullscreen mode top address bar would normally fullscreen website make fake browser user interface fake address bar attempts market hardware-based browsers running non-writable read-only file systems data stored device media overwritten presenting clean executable time loads first device zeusgard secure hardware browser released late 2013 zeusgard website functional since mid-2016 another device icloak\u00ae stik icloak website provides complete live os completely replaces computer entire operating system offers two web browsers read-only system icloak provide tor browser anonymous browsing well regular firefox browser non-anonymous browsing non-secured web traffic using https example could still subject man-in-the-middle alteration network traffic-based manipulations livecds run operating system non-writable source typically come web browsers part default image original livecd image free malware software used including web browser load free malware every time livecd image booted one effective ways browse web safely use browser patches avoid cross-origin resource sharing vulnerability example patches provided webkit-based browsers browsing world wide web least-privilege user account i.e without administrator privileges limits ability security exploit web browser compromising whole operating system internet explorer 4 later allows blacklisting whitelisting activex controls add-ons browser extensions various ways internet explorer 7 added protected mode technology hardens browser application security sandboxing feature windows vista called mandatory integrity control google chrome provides sandbox limit web page access operating system suspected malware sites reported google confirmed google flagged hosting malware certain browsers third-party extensions plugins available harden even latest browsers older browsers operating systems whitelist-based software noscript block javascript adobe flash used attacks privacy allowing users choose sites know safe adblock plus also uses whitelist ad filtering rules subscriptions though software filtering list maintainers come controversy by-default allowing sites pass pre-set filters us-cert recommends block flash using noscript modern web browsers undergo extensive fuzzing uncover vulnerabilities chromium code google chrome continuously fuzzed chrome security team 15,000 cores microsoft edge internet explorer microsoft performed fuzzed testing 670 machine-years product development generating 400 billion dom manipulations 1 billion html files", + "neighbors": [ + 11, + 83, + 95, + 149, + 190, + 258, + 277, + 293, + 310, + 338, + 384, + 425, + 450, + 487, + 490, + 509, + 530, + 564, + 576, + 582, + 623, + 624, + 664, + 666, + 668, + 678, + 684, + 692, + 739, + 746, + 777, + 780, + 800, + 818, + 886, + 939, + 944, + 953, + 1033, + 1058, + 1090, + 1132, + 1144, + 1162, + 1166, + 1195, + 1210, + 1228, + 1280, + 1309, + 1325, + 1331, + 1358, + 1365, + 1378, + 1379, + 1408, + 1417, + 1423, + 1444, + 1467, + 1472, + 1533, + 1535, + 1543, + 1550, + 1554, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 532, + "label": 6, + "text": "Chiron_FS:chiron fs chiron filesystem fault-tolerant replication file system chiron fs fuse based filesystem implements replication filesystem level like raid 1 device level replicated filesystem may kind requisite mounted need special configuration files setup simple one mount command one line fstab specific communication protocol mount time invoking parameters indicate two paths directories replicated underlying filesystems must already sync allows client use kind underlying filesystems ext3 nfs sshfs even mix every write chiron fs mount point subtree echoed underlying filesystems read chiron fs mount point subtree made one underlying filesystems using prioritized round robin algorithm one underlying filesystems fails virtualized filesystem provided chiron fs continues operating long least one replica available case failures reported log file failure write operation failed replica disabled used chiron fs available resynchronized others synchronization implemented yet chiron fs must done manually replica fails calling application receives error message would receive accessing non replicated filesystem case log report", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 533, + "label": 4, + "text": "POODLE:poodle poodle attack stands padding oracle downgraded legacy encryption man-in-the-middle exploit takes advantage internet security software clients fallback ssl 3.0 attackers successfully exploit vulnerability average need make 256 ssl 3.0 requests reveal one byte encrypted messages bodo m\u00f6ller thai duong krzysztof kotowicz google security team discovered vulnerability disclosed vulnerability publicly october 14 2014 despite paper dated september 2014 december 8 2014 variation poodle vulnerability affected tls announced cve-id associated original poodle attack f5 networks filed well see poodle attack tls section poodle exemplifies vulnerability succeeds mechanism designed reducing security sake interoperability designing systems domains high levels fragmentation extra care appropriate domains graceful security degradation may become common mitigate poodle attack one approach completely disable ssl 3.0 client side server side however old clients servers support tls 1.0 thus authors paper poodle attacks also encourage browser server implementation tls_fallback_scsv make downgrade attacks impossible another mitigation implement anti-poodle record splitting splits records several parts ensures none attacked however problem splitting though valid according specification may also cause compatibility issues due problems server-side implementations full list browser versions levels vulnerability different attacks including poodle found article transport layer security opera 25 implemented mitigation addition tls_fallback_scsv google chrome browser servers already supported tls_fallback_scsv google stated october 2014 planning remove ssl 3.0 support products completely within months fallback ssl 3.0 disabled chrome 39 released november 2014 ssl 3.0 disabled default chrome 40 released january 2015 mozilla disabled ssl 3.0 firefox 34 esr 31.3 released december 2014 added support tls_fallback_scsv firefox 35 microsoft published security advisory explain disable ssl 3.0 internet explorer windows os october 29 2014 microsoft released fix disables ssl 3.0 internet explorer windows vista server 2003 announced plan disable ssl 3.0 default products services within months microsoft disabled fallback ssl 3.0 internet explorer 11 protect mode sites february 10 2015 sites april 14 2015 apple safari os x 10.8 ios 8.1 later mitigated poodle removing support cbc protocols ssl 3.0 however left rc4 also completely broken rc4 attacks ssl 3.0.. poodle completely mitigated os x 10.11 el capitan 2015 ios 9 2015 prevent poodle attack web services dropped support ssl 3.0 examples include cloudflare wikimedia network security services version 3.17.1 released october 3 2014 3.16.2.3 released october 27 2014 introduced support tls_fallback_scsv nss disable ssl 3.0 default april 2015 openssl versions 1.0.1j 1.0.0o 0.9.8zc released october 15 2014 introduced support tls_fallback_scsv libressl version 2.1.1 released october 16 2014 disabled ssl 3.0 default new variant original poodle attack announced december 8 2014 attack exploits implementation flaws cbc encryption mode tls 1.0 1.2 protocols even though tls specifications require servers check padding implementations fail validate properly makes servers vulnerable poodle even disable ssl 3.0 ssl pulse showed 10 servers vulnerable poodle attack tls vulnerability announced cve-id f5 networks implementation bug entry nist nvd states cve-id used f5 networks implementation tls vendors whose products failure validate padding mistake implementations like a10 networks cisco systems need issue cve-ids implementation errors flaw protocol flaw protocol implementation poodle attack tls found easier initiate initial poodle attack ssl need downgrade clients ssl 3.0 meaning fewer steps needed execute successful attack", + "neighbors": [ + 43, + 88, + 91, + 141, + 158, + 172, + 198, + 232, + 235, + 260, + 261, + 281, + 293, + 319, + 325, + 376, + 414, + 418, + 539, + 542, + 550, + 554, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 692, + 708, + 783, + 800, + 818, + 826, + 915, + 961, + 965, + 1003, + 1043, + 1063, + 1089, + 1162, + 1186, + 1228, + 1240, + 1270, + 1293, + 1327, + 1331, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1452, + 1467, + 1475, + 1534, + 1543, + 1573, + 1576, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 534, + "label": 3, + "text": "Server_Base_System_Architecture:server base system architecture server base system architecture sbsa hardware system architecture servers based 64-bit arm processors attempts standardize pe arm processing element features key aspects system architecture specified features firmware os hypervisors rely enable suitably-built single os image run hardware compliant specification architecture compliance suite check system compliant sbsa specification available open source software downloaded https //github.com/arm-software/sbsa-acs", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 535, + "label": 4, + "text": "E-Stewards:e-stewards e-stewards initiative electronics waste recycling standard created basel action network program organization created grew concern electronic waste generated wealthy countries dismantled poor countries often underage workers young workers exposed toxic metals working unsafe conditions 2009 ban published e-stewards standard responsible recycling reuse electronic equipment set forth requirements becoming certified e-stewards recycler\u2014a program recognizes electronics recyclers adhere stringent environmentally socially responsible practices recovering hazardous electronic materials recyclers qualified older pledge program 1 september 2011 achieve certification standard e-stewards accredited certification body accredited anab ansi-asq national accreditation board e-stewards standard responsible recycling reuse electronic equipment developed basel action network industry-specific environmental management system standard basis e-stewards initiative 6 march 2012 ban released updated revised version 2.0 open public comment prior final adoption later spring 2012 certification available electronics recyclers refurbishers achieve e-stewards certification organizations subject initial stage stage ii audit passing audits accepted ban yearly surveillance audits take place ensure organizations standard registered iso 14001 environmental management system place well achieving numerous performance requirements including assuring export hazardous electronic wastes developing countries use prison labor dumping toxic materials municipal landfills", + "neighbors": [ + 60, + 226, + 420 + ], + "mask": "Test" + }, + { + "node_id": 536, + "label": 9, + "text": "Emacs_Lisp:emacs lisp emacs lisp dialect lisp programming language used scripting language emacs text editor family commonly associated gnu emacs xemacs used implementing editing functionality built emacs remainder written c lisp interpreter emacs lisp also termed elisp although also older unrelated lisp dialect name users emacs commonly write emacs lisp code customize extend emacs options include customize feature gnu emacs since version 20 written emacs lisp customize provides set preferences pages allowing user set options preview effect running emacs session user saves changes customize simply writes necessary emacs lisp code user config file set special file customize uses avoid possibility altering user file emacs lisp also function scripting language much like unix bourne shell perl calling emacs batch mode way may called command line via executable file editing functions buffers movement commands available program normal mode user interface presented emacs started batch mode simply executes passed-in script exits displaying output script emacs lisp closely related maclisp later influence common lisp supports imperative functional programming methods richard stallman chose lisp extension language rewrite emacs original used text editor corrector teco extension language powerful features including ability treat functions data although common lisp standard yet formulated scheme existed time stallman rewriting gosling emacs gnu emacs chose use comparatively poor performance workstations opposed minicomputers emacs traditional home wanted develop dialect thought would easily optimized lisp dialect used emacs differs substantially modern common lisp scheme dialects used applications programming prominent characteristic emacs lisp use dynamic rather lexical scope default see function may reference local variables scope called scope defined understand logic behind emacs lisp important remember emphasis providing data structures features specific making versatile text editor implementing general-purpose programming language example emacs lisp easily read file line time\u2014the entire file must read emacs buffer however emacs lisp provides many features navigating modifying buffer text sentence paragraph higher syntactic level defined modes follows simple example emacs extension written emacs lisp emacs editing area split separate areas called windows displaying different buffer buffer region text loaded emacs memory possibly file saved text document users press default c-x 2 key binding open new window runs emacs lisp function codice_1 normally new window appears displays buffer previous one suppose wish make display next available buffer order user writes following emacs lisp code either existing emacs lisp source file empty emacs buffer first statement codice_2 defines new function codice_3 calls codice_1 old window-splitting function tells new window display another new buffer second statement codice_5 re-binds key sequence c-x 2 new function also written using feature called advice allows user create wrappers around existing functions instead defining advantage requiring keybindings changed working wherever original function called well simpler write disadvantage making debugging complicated reason advice allowed source code gnu emacs user wishes advice feature used code reimplement code follows instructs codice_1 execute user-supplied code whenever called executing rest function advice also specified execute original function around it\u2014literally wrapping original conditionally execute original function based results advice emacs 24.4 replaces codice_7 mechanism codice_8 claimed flexible simpler advice could reimplemented using new system changes take effect soon code evaluated necessary recompile restart emacs even rehash configuration file code saved emacs init file emacs load extension next time starts otherwise changes must reevaluated manually emacs restarted emacs lisp code stored filesystems plain text files convention filename suffix .el user init file exception often appearing .emacs despite evaluated emacs lisp code recent versions emacs recent 40-year-old program meaning roughly version released since mid-1990s also load ~/.emacs.el ~/.emacs.d/init.el additionally users may specify file load config file command line explicitly state config file loaded files loaded interpreter component emacs program reads parses functions variables storing memory available editing functions user commands functions variables freely modified redefined without restarting editor reloading config file order save time memory space much functionality emacs loads required set optional features shipped emacs implemented collection emacs code called package library example library highlighting keywords program source code library playing game tetris library implemented using one emacs lisp source files libraries define one major modes activate control function emacs developers write certain functions c. primitives also termed built-in functions subrs although primitives called lisp code modified editing c source files recompiling gnu emacs primitives available external libraries part emacs executable xemacs runtime loading primitives possible using operating system support dynamic linking functions may written primitives need access external data libraries otherwise available emacs lisp called often enough comparative speed c versus emacs lisp makes worthwhile difference however errors c code easily lead segmentation violations subtle bugs crash editor writing c code interacts correctly emacs lisp garbage collector error-prone number functions implemented primitives kept necessary minimum byte-compiling make emacs lisp code execute faster emacs contains compiler translate emacs lisp source files special representation termed bytecode emacs lisp bytecode files filename suffix .elc compared source files bytecode files load faster occupy less space disk use less memory loaded run faster bytecode still runs slowly primitives functions loaded bytecode easily modified re-loaded addition bytecode files platform-independent standard emacs lisp code distributed emacs loaded bytecode although matching source files usually provided user reference well user-supplied extensions typically byte-compiled neither large computationally intensive notably cl package implements fairly large subset common lisp emacs lisp unlike lisp implementations tail-call optimization without tail recursions eventually lead stack overflow apel library aids writing portable emacs lisp code help polysylabi platform bridge emacs lisp lisp-2 meaning function namespace separate namespace uses variables like maclisp emacs lisp uses dynamic scope offering static lexical option starting version 24 activated setting file local variable codice_9 dynamic scoping programmer declares variable within scope function available subroutines called within function originally intended optimization lexical scoping still uncommon uncertain performance asked rms implementing emacs lisp dynamically scoped exact reply lexical scope inefficient dynamic scoping also meant provide greater flexibility user customizations however dynamic scoping several disadvantages firstly easily lead bugs large programs due unintended interactions variables different functions secondly accessing variables dynamic scoping generally slower lexical scoping also codice_10 macro cl package provide effective lexical scope emacs lisp programmers cl widely used codice_10 rarely used", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 565, + 601, + 649, + 653, + 693, + 753, + 782, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1227, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1372, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 537, + "label": 1, + "text": "Australasian_Virtual_Herbarium:australasian virtual herbarium australasian virtual herbarium avh online resource allows access plant specimen data held various australian new zealand herbaria part atlas living australia ala formed amalgamation australia virtual herbarium nz virtual herbarium 12 august 2014 five million specimens 8 million upwards specimens available participating institutions databased resource used academics students anyone interested research botany australia new zealand since record tells known specimen collected current identification together botanist identified information habitat associated species ala post processes original herbarium data giving fields respect taxonomy quality data interrogating individual specimen records environmental overlays show reverse jackknife testing see whether specimen outlier respect climate environmental layers see e.g. mel 0304065a scaevola amblyanthera records downloadable entirety anyone examples use records may found google scholar search using phrase australia virtual herbarium shows well 200 articles 3 may 2018 published using data resource herbaria codes may found wikipedia list herbaria based new york botanical garden continuously updated index plans australia virtual herbarium announced 2001 article tim entwisle 2003 shows still largely planning stage time although projected usages preservation biodiversity western new south wales already visible", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 538, + "label": 9, + "text": "Scala_(programming_language):scala programming language scala general-purpose programming language providing support functional programming strong static type system designed concise many scala design decisions aimed address criticisms java scala source code intended compiled java bytecode resulting executable code runs java virtual machine scala provides language interoperability java libraries written either language may referenced directly scala java code like java scala object-oriented uses curly-brace syntax reminiscent c programming language unlike java scala many features functional programming languages like scheme standard ml haskell including currying type inference immutability lazy evaluation pattern matching also advanced type system supporting algebraic data types covariance contravariance higher-order types higher-rank types anonymous types features scala present java include operator overloading optional parameters named parameters raw strings conversely feature java scala checked exceptions proved controversial name scala portmanteau scalable language signifying designed grow demands users design scala started 2001 \u00e9cole polytechnique f\u00e9d\u00e9rale de lausanne epfl lausanne switzerland martin odersky followed work funnel programming language combining ideas functional programming petri nets odersky formerly worked generic java javac sun java compiler internal release late 2003 scala released publicly early 2004 java platform second version v2.0 followed march 2006 17 january 2011 scala team five-year research grant \u20ac2.3 million european research council 12 may 2011 odersky collaborators launched typesafe inc. later renamed lightbend inc. company provide commercial support training services scala typesafe received 3 million investment 2011 greylock partners scala runs java platform java virtual machine compatible existing java programs android applications typically written java translated java bytecode dalvik bytecode may translated native machine code installation packaged scala java compatibility makes well-suited android development functional approach preferred reference scala software distribution including compiler libraries released apache license scala.js scala compiler compiles javascript making possible write scala programs run web browsers node.js compiler development since 2013 announced longer experimental 2015 v0.6 version v1.0.0-m1 released june 2018 2019 still m7 scala native scala compiler targets llvm compiler infrastructure create executable code uses lightweight managed runtime uses boehm garbage collector project led denys shabalin first release 0.1 14 march 2017 development scala native began 2015 goal faster just-in-time compilation jvm eliminating initial runtime compilation code also providing ability call native routines directly reference scala compiler targeting .net framework common language runtime released june 2004 officially dropped 2012 hello world program written scala form unlike stand-alone hello world application java class declaration nothing declared static singleton object created object keyword used instead program stored file helloworld.scala user compiles command runs analogous process compiling running java code indeed scala compiling executing model identical java making compatible java build tools apache ant shorter version hello world scala program scala includes interactive shell scripting support saved file named codice_1 run script prior compiling using commands also entered directly scala interpreter using option expressions entered interactively repl following example shows differences java scala syntax syntactic differences code syntactic relaxations designed allow support domain-specific languages basic syntactic differences following example contrasts definition classes java scala code shows conceptual differences java scala handling classes scala compiling model java c namely separate compiling dynamic class loading scala code call java libraries scala operational characteristics java scala compiler generates byte code nearly identical generated java compiler fact scala code decompiled readable java code exception certain constructor operations java virtual machine jvm scala code java code indistinguishable difference one extra runtime library codice_35 scala adds large number features compared java fundamental differences underlying model expressions types make language theoretically cleaner eliminate several corner cases java scala perspective practically important several added features scala also available c examples include mentioned scala good deal syntactic flexibility compared java following examples may seem like questionable choices collectively serve purpose allowing domain-specific languages defined scala without needing extend compiler example erlang special syntax sending message actor i.e codice_67 implemented scala library without needing language extensions java makes sharp distinction primitive types e.g codice_68 codice_69 reference types class reference types part inheritance scheme deriving codice_70 scala types inherit top-level class codice_71 whose immediate children codice_72 value types codice_73 codice_74 codice_75 reference types java means java distinction primitive types boxed types e.g codice_68 vs. codice_77 present scala boxing unboxing completely transparent user scala 2.10 allows new value types defined user instead java foreach loops looping iterator scala codice_78-expressions similar list comprehensions languages haskell combination list comprehensions generator expressions python for-expressions using codice_79 keyword allow new collection generated iterating existing one returning new collection type translated compiler series codice_64 codice_65 codice_66 calls codice_79 used code approximates imperative-style loop translating codice_84 simple example result running following vector complex example iterating map expression codice_88 example pattern matching see iterating map returns set key-value tuples pattern-matching allows tuples easily destructured separate variables key value similarly result comprehension also returns key-value tuples automatically built back map source object variable codice_89 map note codice_89 instead held list set array collection tuples exactly code would yield new collection type supporting object-oriented features available java fact augmenting various ways scala also provides large number capabilities normally found functional programming languages together features allow scala programs written almost completely functional style also allow functional object-oriented styles mixed examples unlike c java similar languages lisp scala makes distinction statements expressions statements fact expressions evaluate value functions would declared returning codice_24 c java statements like codice_92 logically return value scala considered return type codice_25 singleton type one object type functions operators never return e.g codice_94 operator function always exits non-locally using exception logically return type codice_95 special type containing objects bottom type i.e subclass every possible type turn makes type codice_95 compatible every type allowing type inference function correctly similarly codice_97 statement actually expression produces value i.e result evaluating one two branches means block code inserted wherever expression desired obviating need ternary operator scala similar reasons codice_7 statements unnecessary scala fact discouraged lisp last expression block code value block code block code body function returned function make clear functions expressions even methods return codice_25 written equals sign equivalently type inference omitting unnecessary braces due type inference type variables function return values many expressions typically omitted compiler deduce examples codice_100 immutable constant immutable object codice_101 variable whose value later changed type inference scala essentially local contrast global hindley-milner algorithm used haskell ml purely functional languages done facilitate object-oriented programming result certain types still need declared notably function parameters return types recursive functions e.g return type declared recursive function scala functions objects convenient syntax exists specifying anonymous functions example expression codice_102 specifies function one parameter compares argument see less 2 equivalent lisp form codice_103 note neither type codice_104 return type need explicitly specified generally inferred type inference explicitly specified e.g codice_105 even codice_106 anonymous functions behave true closures automatically capture variables lexically available environment enclosing function variables available even enclosing function returns unlike case java anonymous inner classes need declared final even possible modify variables mutable modified value available next time anonymous function called even shorter form anonymous function uses placeholder variables example following written concisely even scala enforces distinction immutable unmodifiable read-only variables whose value changed assigned mutable variables changed similar distinction made immutable mutable objects distinction must made variable declared immutable variables declared codice_5 mutable variables use codice_6 similarly collection objects container types scala e.g linked lists arrays sets hash tables available mutable immutable variants immutable variant considered basic default implementation immutable variants persistent data types create new object encloses old object adds new member similar linked lists built lisp elements prepended creating new cons cell pointer new element head old list tail allows easy concurrency \u2014 locks needed shared objects ever modified immutable structures also constructed efficiently sense modified instances reuses old instance data unused/unreferenced parts collected gc evaluation strict eager default words scala evaluates expressions soon available rather needed however possible declare variable non-strict lazy codice_112 keyword meaning code produce variable value evaluated first time variable referenced non-strict collections various types also exist type codice_113 non-strict linked list collection made non-strict codice_114 method non-strict collections provide good semantic fit things like server-produced data evaluation code generate later elements list turn triggers request server possibly located somewhere else web happens elements actually needed functional programming languages commonly provide tail call optimization allow extensive use recursion without stack overflow problems limitations java bytecode complicate tail call optimization jvm general function calls tail call optimized mutually recursive functions trampolines suggested workaround trampoline support provided scala library object codice_115 since scala 2.8.0 released 14 july 2010 function may optionally annotated codice_116 case compile unless tail recursive scala built-in support pattern matching thought sophisticated extensible version switch statement arbitrary data types matched rather simple types like integers booleans strings including arbitrary nesting special type class known case class provided includes automatic support pattern matching used model algebraic data types used many functional programming languages perspective scala case class simply normal class compiler automatically adds certain behaviors could also provided manually e.g. definitions methods providing deep comparisons hashing destructuring case class constructor parameters pattern matching example definition quicksort algorithm using pattern matching idea partition list elements less pivot elements less recursively sort part paste results together pivot uses divide-and-conquer strategy mergesort fast sorting algorithms codice_117 operator used pattern matching object stored codice_118 codice_119 expression tried turn see match first match determines result case codice_120 matches literal object codice_120 codice_122 matches non-empty list simultaneously destructures list according pattern given case associated code access local variable named codice_123 holding head list another variable codice_124 holding tail list note variables read-only semantically similar variable bindings established using codice_125 operator lisp scheme pattern matching also happens local variable declarations case return value call codice_126 tuple \u2014 case two lists tuples differ types containers e.g lists always fixed size elements differing types \u2014 although pattern matching easiest way fetching two parts tuple form codice_127 declaration anonymous function placeholder variable see section anonymous functions list operators codice_128 adds element onto beginning list similar codice_129 lisp scheme codice_130 appends two lists together similar codice_131 lisp scheme appear despite appearances nothing built-in either operators specified string symbols serve function name method applied object written infix -style without period parentheses line written could also written thus standard method-call notation methods end colon right-associative bind object right pattern-matching example body codice_117 operator partial function consists series codice_119 expressions first matching expression prevailing similar body switch statement partial functions also used exception-handling portion codice_136 statement finally partial function used alone result calling equivalent codice_117 example prior code quicksort written thus read-only variable declared whose type function lists integers lists integers bind partial function note single parameter partial function never explicitly declared named however still call variable exactly normal function scala pure object-oriented language sense every value object data types behaviors objects described classes traits class abstractions extended subclassing flexible mixin-based composition mechanism avoid problems multiple inheritance traits scala replacement java interfaces interfaces java versions 8 highly restricted able contain abstract function declarations led criticism providing convenience methods interfaces awkward methods must reimplemented every implementation extending published interface backwards-compatible way impossible traits similar mixin classes nearly power regular abstract class lacking class parameters scala equivalent java constructor parameters since traits always mixed class codice_138 operator behaves specially traits allowing traits chained using composition addition inheritance following example simple window system variable may declared thus result calling codice_139 words call codice_140 first executed code codice_141 last trait mixed codice_142 calls threaded back mixed-in traits eventually code codice_143 even though none traits inherited one another similar decorator pattern concise less error-prone n't require explicitly encapsulating parent window explicitly forwarding functions whose implementation n't changed relying run-time initialization entity relationships languages similar effect could achieved compile-time long linear chain implementation inheritance disadvantage compared scala one linear inheritance chain would declared possible combination mix-ins scala equipped expressive static type system mostly enforces safe coherent use abstractions type system however sound particular type system supports scala able infer types usage makes static type declarations optional static types need explicitly declared unless compiler error indicates need practice static type declarations included sake code clarity common technique scala known enrich library originally termed pimp library martin odersky 2006 though concerns raised phrasing due negative connotation immaturity allows new methods used added existing types similar c concept extension methods powerful technique limited adding methods instance used implement new interfaces scala technique involves declaring implicit conversion type receiving method new type typically class wraps original type provides additional method method found given type compiler automatically searches applicable implicit conversions types provide method question technique allows new methods added existing class using add-on library code imports add-on library gets new functionality code unaffected following example shows enrichment type codice_73 methods codice_145 codice_146 importing members codice_147 brings implicit conversion extension class codice_148 scope scala standard library includes support actor model addition standard java concurrency apis lightbend inc. provides platform includes akka separate open-source framework provides actor-based concurrency akka actors may distributed combined software transactional memory transactors alternative communicating sequential processes csp implementations channel-based message passing communicating scala objects simply via jcsp actor like thread instance mailbox created codice_149 overriding codice_150 method receive messages using codice_151 exclamation point method send message following example shows echoserver receive messages print scala also comes built-in support data-parallel programming form parallel collections integrated standard library since version 2.9.0 following example shows use parallel collections improve performance besides actor support data-parallelism scala also supports asynchronous programming futures promises software transactional memory event streams well-known open-source cluster-computing solution written scala apache spark additionally apache kafka publish\u2013subscribe message queue popular spark stream processing technologies written scala several ways test code scala scalatest supports multiple testing styles integrate java-based testing frameworks scalacheck library similar haskell quickcheck specs2 library writing executable software specifications scalamock provides support testing high-order curried functions junit testng popular testing frameworks written java scala often compared groovy clojure two programming languages also using jvm substantial differences languages found type system extent language supports object-oriented functional programming similarity syntax syntax java scala statically typed groovy clojure dynamically typed makes type system complex difficult understand allows almost type errors caught compile-time result significantly faster execution contrast dynamic typing requires testing ensure program correctness generally slower order allow greater programming flexibility simplicity regarding speed differences current versions groovy clojure allow optional type annotations help programs avoid overhead dynamic typing cases types practically static overhead reduced using recent versions jvm enhanced invoke dynamic instruction methods defined dynamically typed arguments advances reduce speed gap static dynamic typing although statically typed language like scala still preferred choice execution efficiency important regarding programming paradigms scala inherits object-oriented model java extends various ways groovy also strongly object-oriented focused reducing verbosity clojure object-oriented programming deemphasised functional programming main strength language scala also many functional programming facilities including features found advanced functional languages like haskell tries agnostic two paradigms letting developer choose two paradigms frequently combination thereof regarding syntax similarity java scala inherits much java syntax case groovy clojure hand follows lisp syntax different appearance philosophy however learning scala also considered difficult many advanced features case groovy despite also feature-rich language mainly designed mainly scripting language jvm-based languages clojure groovy kotlin scala significantly less popular original java language usually ranked first second also simultaneously evolving time popularity programming language index tracks searches language tutorials ranked scala 15th april 2018 small downward trend makes scala popular jvm-based language java although immediately followed kotlin jvm-based language strong upward trend ranked 16th tiobe index programming language popularity employs internet search engine rankings similar publication-counting determine language popularity april 2018 shows scala 34th place dropped four places last two years but\u2013as mentioned bugs change requests \u2013tiobe aware issues methodology using search terms might commonly used programming language communities ranking scala ahead functional languages like haskell 42nd erlang languages like swift 15th perl 16th go 19th clojure 30th thoughtworks technology radar opinion based biannual report group senior technologists recommended scala adoption languages frameworks category 2013 july 2014 assessment made specific refers scala good parts described successfully use scala need research language strong opinion parts right creating definition scala good parts. redmonk programming language rankings establishes rankings based number github projects questions asked stack overflow ranks scala 14th scala placed inside second-tier group languages\u2013ahead go powershell haskell behind swift objective-c typescript r. however 2018 report rankings noted drop scala rank third time row questioning much available oxygen scala consumed kotlin latter continues rocket rankings 2018 edition state java survey collected data 5160 developers various java-related topics scala places third terms usage alternative languages jvm compared last year edition survey scala usage among alternative jvm languages fell almost quarter 28.4 21.5 overtaken kotlin rose 11.4 2017 28.8 2018 march 2015 former vp platform engineering group twitter raffi krikorian stated would chosen scala 2011 due learning curve month linkedin svp kevin scott stated decision minimize dependence scala november 2011 yammer moved away scala reasons included learning curve new team members incompatibility one version scala compiler next", + "neighbors": [ + 7, + 19, + 31, + 65, + 78, + 117, + 152, + 176, + 194, + 201, + 216, + 275, + 292, + 306, + 308, + 324, + 347, + 373, + 378, + 509, + 520, + 521, + 567, + 579, + 593, + 597, + 682, + 742, + 756, + 786, + 790, + 820, + 825, + 869, + 873, + 874, + 916, + 919, + 926, + 948, + 998, + 1005, + 1006, + 1028, + 1091, + 1120, + 1146, + 1152, + 1163, + 1221, + 1225, + 1227, + 1231, + 1235, + 1242, + 1269, + 1311, + 1319, + 1324, + 1430, + 1437, + 1454, + 1457, + 1481, + 1483, + 1508, + 1532, + 1582, + 1621, + 1626 + ], + "mask": "Test" + }, + { + "node_id": 539, + "label": 4, + "text": "CRIME:crime crime compression ratio info-leak made easy security exploit secret web cookies connections using https spdy protocols also use data compression used recover content secret authentication cookies allows attacker perform session hijacking authenticated web session allowing launching attacks crime assigned cve-2012-4929 vulnerability exploited combination chosen plaintext attack inadvertent information leakage data compression similar described 2002 cryptographer john kelsey relies attacker able observe size ciphertext sent browser time inducing browser make multiple carefully crafted web connections target site attacker observes change size compressed request payload contains secret cookie sent browser target site variable content created attacker variable content altered size compressed content reduced inferred probable part injected content matches part source includes secret content attacker desires discover divide conquer techniques used home true secret content relatively small number probe attempts small multiple number secret bytes recovered crime exploit hypothesized adam langley first demonstrated security researchers juliano rizzo thai duong also created beast exploit exploit due revealed full 2012 ekoparty security conference rizzo duong presented crime general attack works effectively large number protocols including limited spdy always compresses request headers tls may compress records http may compress responses crime defeated preventing use compression either client end browser disabling compression spdy requests website preventing use data compression transactions using protocol negotiation features tls protocol detailed transport layer security tls protocol version 1.2 client sends list compression algorithms clienthello message server picks one sends back serverhello message server choose compression method client offered client offers 'none compression data compressed similarly since 'no compression must allowed tls clients server always refuse use compression crime exploit spdy tls-level compression described mitigated then-latest versions chrome firefox web browsers websites applied countermeasures end nginx web-server vulnerable crime since 1.0.9/1.1.6 october/november 2011 using openssl 1.0.0+ since 1.2.2/1.3.2 june july 2012 using versions openssl note december 2013 crime exploit http compression mitigated rizzo duong warned vulnerability might even widespread spdy tls compression combined august 2013 black hat conference researchers gluck harris prado announced variant crime exploit http compression called breach short browser reconnaissance exfiltration via adaptive compression hypertext uncovers https secrets attacking inbuilt http data compression used webservers reduce network traffic", + "neighbors": [ + 88, + 172, + 235, + 260, + 261, + 319, + 343, + 473, + 528, + 533, + 542, + 554, + 692, + 826, + 1003, + 1089, + 1240, + 1331, + 1408, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 540, + "label": 4, + "text": "Null_character:null character null character also null terminator null byte control character value zero present many character sets including iso/iec 646 ascii c0 control code universal coded character set unicode ebcdic available nearly mainstream programming languages often abbreviated nul null though contexts term used null pointer different object original meaning character like nop\u2014when sent printer terminal nothing terminals however incorrectly display space electromechanical teleprinters used computer output devices one null characters sent end printed line allow time mechanism return first printing position next line punched tape character represented holes new unpunched tape initially filled null characters often text could inserted reserved space null characters punching new characters tape nulls today character much significance c derivatives many data formats serves reserved character used signify end string often called null-terminated string allows string length overhead one byte alternative storing count requires either string length limit 255 overhead one byte advantages/disadvantages described null-terminated string null character often represented escape sequence codice_1 source code string literals character constants many languages c introduced notation separate escape sequence octal escape sequence single octal digit 0 consequence codice_1 must followed digits codice_3 codice_4 otherwise interpreted start longer octal escape sequence escape sequences found use various languages codice_5 codice_6 codice_7 codice_8 null character placed url percent code codice_9 ability represent null character always mean resulting string correctly interpreted many programs consider null end string thus ability type case unchecked user input creates vulnerability known null byte injection lead security exploits caret notation null character codice_10 keyboards one enter null character holding pressing us layouts often work need get sign documentation null character sometimes represented single-em-width symbol containing letters nul unicode character corresponding glyph visual representation null character symbol null u+2400 \u2400 \u2014not confused actual null character u+0000 modern character sets null character code point value zero encodings translated single code unit zero value instance utf-8 single zero byte however modified utf-8 null character encoded two bytes 0xc0 0x80 allows byte value zero used character used string terminator", + "neighbors": [ + 34, + 306, + 326, + 436, + 438, + 558, + 594, + 800, + 1022 + ], + "mask": "Test" + }, + { + "node_id": 541, + "label": 4, + "text": "Fail2ban:fail2ban fail2ban intrusion prevention software framework protects computer servers brute-force attacks written python programming language able run posix systems interface packet-control system firewall installed locally example iptables tcp wrapper fail2ban operates monitoring log files e.g /var/log/auth.log /var/log/apache/access.log etc selected entries running scripts based commonly used block selected ip addresses may belong hosts trying breach system security ban host ip address makes many login attempts performs unwanted action within time frame defined administrator includes support ipv4 ipv6 optionally longer bans custom-configure recidivist abusers keep coming back fail2ban typically set unban blocked host within certain period lock genuine connections may temporarily misconfigured however unban time several minutes usually enough stop network connection flooded malicious connections well reducing likelihood successful dictionary attack fail2ban perform multiple actions whenever abusive ip address detected update netfilter/iptables pf firewall rules tcp wrapper hosts.deny table reject abuser ip address email notifications user-defined action carried python script standard configuration ships filters apache lighttpd sshd vsftpd qmail postfix courier mail server filters defined python regexes may conveniently customized administrator familiar regular expressions combination filter action known jail causes malicious host blocked accessing specified network services well examples distributed software jail may created network-facing process creates log file access", + "neighbors": [ + 363, + 739, + 1138, + 1225, + 1452, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 542, + "label": 5, + "text": "IPsec:ipsec computing internet protocol security ipsec secure network protocol suite authenticates encrypts packets data sent internet protocol network used virtual private networks vpns ipsec includes protocols establishing mutual authentication agents beginning session negotiation cryptographic keys use session ipsec protect data flows pair hosts host-to-host pair security gateways network-to-network security gateway host network-to-host internet protocol security ipsec uses cryptographic security services protect communications internet protocol ip networks ipsec supports network-level peer authentication data-origin authentication data integrity data confidentiality encryption replay protection initial ipv4 suite developed security provisions part ipv4 enhancement ipsec layer 3 osi model internet layer end-to-end security scheme internet security systems widespread use operate layer 3 transport layer security tls secure shell ssh operate application layer ipsec automatically secure applications ip layer starting early 1970s advanced research projects agency sponsored series experimental arpanet encryption devices first native arpanet packet encryption subsequently tcp/ip packet encryption certified fielded 1986 1991 nsa sponsored development security protocols internet secure data network systems sdns program brought together various vendors including motorola produced network encryption device 1988 work openly published 1988 nist security protocol layer 3 sp3 would eventually morph iso standard network layer security protocol nlsp 1992 1995 various research groups improved upon sdns sp3 1992 us naval research laboratory nrl began sipp project research implement ip encryption december 1993 experimental software ip encryption protocol swipe developed sunos columbia university bell labs john ioannidis others funded white house 1993 wei xu trusted information systems tis followed swipe research enhanced ip security protocols developed device driver data encryption standard december 1994 team released tis gauntlet firewall product integrated 3des hardware encryption provided commercial ip security t1 speeds securing networks us east west coasts period internet engineering task force ietf ip security working group formed standardize efforts open freely available set security extensions called ipsec 1995 working group published rfc-1825 rfc-1827 nrl first working implementation ipsec open standard part ipv4 suite ipsec uses following protocols perform various functions security authentication header ah derived partially previous ietf standards work authentication simple network management protocol snmp version 2 authentication header ah member ipsec protocol suite ah ensures connectionless integrity using hash function secret shared key ah algorithm ah also guarantees data origin authenticating ip packets optionally sequence number protect ipsec packet contents replay attacks using sliding window technique discarding old packets ah operates directly top ip using ip protocol number 51 following ah packet diagram shows ah packet constructed interpreted ip encapsulating security payload esp researched naval research laboratory starting 1992 part darpa-sponsored research project openly published ietf sipp working group drafted december 1993 security extension sipp esp originally derived us department defense sp3d protocol rather derived iso network-layer security protocol nlsp sp3d protocol specification published nist late 1980s designed secure data network system project us department defense encapsulating security payload esp member ipsec protocol suite provides origin authenticity source authentication data integrity hash functions confidentiality encryption protection ip packets esp also supports encryption-only authentication-only configurations using encryption without authentication strongly discouraged insecure unlike authentication header ah esp transport mode provide integrity authentication entire ip packet however tunnel mode entire original ip packet encapsulated new packet header added esp protection afforded whole inner ip packet including inner header outer header including outer ipv4 options ipv6 extension headers remains unprotected esp operates directly top ip using ip protocol number 50 following esp packet diagram shows esp packet constructed interpreted ipsec protocols use security association communicating parties establish shared security attributes algorithms keys ipsec provides range options determined whether ah esp used exchanging data two hosts agree algorithm used encrypt ip packet example des idea hash function used ensure integrity data md5 sha parameters agreed particular session lifetime must agreed session key algorithm authentication also agreed data transfer takes place ipsec supports range methods authentication possible pre-shared key symmetric key already possession hosts hosts send hashes shared key prove possession key ipsec also supports public key encryption host public private key exchange public keys host sends nonce encrypted host public key alternatively hosts hold public key certificate certificate authority used ipsec authentication security associations ipsec established using internet security association key management protocol isakmp isakmp implemented manual configuration pre-shared secrets internet key exchange ike ikev2 kerberized internet negotiation keys kink use ipseckey dns records rfc 5386 defines better-than-nothing security btns unauthenticated mode ipsec using extended ike protocol order decide protection provided outgoing packet ipsec uses security parameter index spi index security association database sadb along destination address packet header together uniquely identifies security association packet similar procedure performed incoming packet ipsec gathers decryption verification keys security association database ip multicast security association provided group duplicated across authorized receivers group may one security association group using different spis thereby allowing multiple levels sets security within group indeed sender multiple security associations allowing authentication since receiver know someone knowing keys sent data note relevant standard describe association chosen duplicated across group assumed responsible party made choice ipsec protocols ah esp implemented host-to-host transport mode well network tunneling mode transport mode payload ip packet usually encrypted authenticated routing intact since ip header neither modified encrypted however authentication header used ip addresses modified network address translation always invalidates hash value transport application layers always secured hash modified way example translating port numbers means encapsulate ipsec messages nat traversal defined rfc documents describing nat-t mechanism tunnel mode entire ip packet encrypted authenticated encapsulated new ip packet new ip header tunnel mode used create virtual private networks network-to-network communications e.g routers link sites host-to-network communications e.g remote user access host-to-host communications e.g private chat tunnel mode supports nat traversal cryptographic algorithms defined use ipsec include refer rfc 8221 details ipsec implemented ip stack operating system requires modification source code method implementation done hosts security gateways various ipsec capable ip stacks available companies hp ibm alternative called bump-in-the-stack bits implementation operating system source code modified ipsec installed ip stack network drivers way operating systems retrofitted ipsec method implementation also used hosts gateways however retrofitting ipsec encapsulation ip packets may cause problems automatic path mtu discovery maximum transmission unit mtu size network path two ip hosts established host gateway separate cryptoprocessor common military also found commercial systems so-called bump-in-the-wire bitw implementation ipsec possible ipsec implemented kernel key management isakmp/ike negotiation carried user space openly specified pf_key key management api version 2 often used enable application-space key management application update ipsec security associations stored within kernel-space ipsec implementation existing ipsec implementations usually include esp ah ike version 2 existing ipsec implementations unix-like operating systems example solaris linux usually include pf_key version 2 embedded ipsec used ensure secure communication among applications running constrained resource systems small overhead ipsec developed conjunction ipv6 originally required supported standards-compliant implementations ipv6 rfc 6434 made recommendation ipsec also optional ipv4 implementations ipsec commonly used secure ipv4 traffic ipsec protocols originally defined rfc 1825 rfc 1829 published 1995 1998 documents superseded rfc 2401 rfc 2412 incompatible engineering details although conceptually identical addition mutual authentication key exchange protocol internet key exchange ike defined create manage security associations december 2005 new standards defined rfc 4301 rfc 4309 largely superset previous editions second version internet key exchange standard ikev2 third-generation documents standardized abbreviation ipsec uppercase \u201c ip \u201d lowercase \u201c sec \u201d \u201c esp \u201d generally refers rfc 4303 recent version specification since mid-2008 ipsec maintenance extensions ipsecme working group active ietf 2013 part snowden leaks revealed us national security agency actively working insert vulnerabilities commercial encryption systems systems networks endpoint communications devices used targets part bullrun program allegations ipsec targeted encryption system openbsd ipsec stack first implementation available permissive open-source license therefore copied widely letter openbsd lead developer theo de raadt received 11 dec 2010 gregory perry alleged jason wright others working fbi inserted number backdoors side channel key leaking mechanisms openbsd crypto code forwarded email 2010 theo de raadt first express official position validity claims apart implicit endorsement forwarding email jason wright response allegations every urban legend made real inclusion real names dates times gregory perry email falls category \u2026 state clearly add backdoors openbsd operating system openbsd crypto framework ocf days later de raadt commented believe netsec probably contracted write backdoors alleged \u2026 written n't believe made tree published snowden leaks alternative explanation put forward authors logjam attack suggests nsa compromised ipsec vpns undermining diffie-hellman algorithm used key exchange paper allege nsa specially built computing cluster precompute multiplicative subgroups specific primes generators second oakley group defined rfc 2409 may 2015 90 addressable ipsec vpns supported second oakley group part ike organization precompute group could derive keys exchanged decrypt traffic without inserting software backdoors second alternative explanation put forward equation group used zero-day exploits several manufacturers vpn equipment validated kaspersky lab tied equation group validated manufacturers real exploits zero-day exploits time exposure cisco pix asa firewalls vulnerabilities used wiretapping nsa furthermore ipsec vpns using aggressive mode settings send hash psk clear apparently targeted nsa using offline dictionary attacks", + "neighbors": [ + 11, + 52, + 88, + 109, + 111, + 172, + 195, + 217, + 235, + 254, + 261, + 311, + 319, + 333, + 425, + 430, + 444, + 455, + 470, + 483, + 528, + 533, + 539, + 543, + 552, + 554, + 576, + 672, + 684, + 732, + 757, + 758, + 762, + 764, + 769, + 770, + 771, + 779, + 813, + 826, + 833, + 849, + 955, + 977, + 1003, + 1089, + 1101, + 1114, + 1116, + 1138, + 1206, + 1218, + 1233, + 1240, + 1326, + 1329, + 1330, + 1331, + 1338, + 1386, + 1395, + 1397, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1462, + 1517, + 1534, + 1552, + 1570, + 1578, + 1586, + 1597, + 1624, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 543, + "label": 5, + "text": "Open_Shortest_Path_First:open shortest path first open shortest path first ospf routing protocol internet protocol ip networks uses link state routing lsr algorithm falls group interior gateway protocols igps operating within single autonomous system defined ospf version 2 rfc 2328 1998 ipv4 updates ipv6 specified ospf version 3 rfc 5340 2008 ospf supports classless inter-domain routing cidr addressing model ospf widely used igp large enterprise networks is-is another lsr-based protocol common large service provider networks open shortest path first ospf designed interior gateway protocol igp use autonomous system local area network lan implements dijkstra algorithm also known shortest path first spf algorithm link-state routing protocol based link-state algorithm developed arpanet 1980 is-is routing protocol ospf first standardised 1989 rfc 1131 known ospf version 1 development work ospf prior codification open standard undertaken largely digital equipment corporation developed proprietary decnet protocols routing protocols like ospf calculate shortest route destination network based algorithm first routing protocol widely implemented routing information protocol rip calculated shortest route based hops number routers ip packet traverse reach destination host rip successfully implemented dynamic routing routing tables change network topology changes rip adapt routing according changing network conditions data-transfer rate demand grew dynamic routing protocol could calculate fastest route destination ospf developed shortest path network calculated based cost route taking account bandwidth delay load therefore ospf undertakes route cost calculation basis link-cost parameters weighted administrator ospf quickly adopted became known reliably calculating routes large complex local area networks link state routing protocol ospf maintains link state databases really network topology maps every router implemented state given route network cost ospf algorithm allows every router calculate cost routes given reachable destination unless administrator made configuration link cost path connected router determined bit rate 1 gbit/s 10 gbit/s etc interface router interface ospf advertise link cost neighbouring routers multicast known hello procedure routers ospf implementation keep sending hello packets thus changes cost links become known neighbouring routers information cost link speed point point connection two routers cascaded network ospf routers advertise information receive one neighbouring router neighbouring routers process flooding link state information network known synchronisation based information routers ospf implementation continuously update link state databases information network topology adjust routing tables ospf network structured subdivided routing areas simplify administration optimize traffic resource utilization areas identified 32-bit numbers expressed either simply decimal often dot-decimal notation used ipv4 addresses convention area 0 zero 0.0.0.0 represents core backbone area ospf network identifications areas may chosen administrators often select ip address main router area area identifier additional area must connection ospf backbone area connections maintained interconnecting router known area border router abr abr maintains separate link-state databases area serves maintains summarized routes areas network ospf detects changes topology link failures converges new loop-free routing structure within seconds ospf become popular dynamic routing protocol commonly used dynamic routing protocols rip border gateway protocol bgp today routers support least one interior gateway protocol advertise routing tables within local area network frequently implemented interior gateway protocols besides ospf rip is-is proprietary interior gateway routing protocol igrp cisco ospf supports complex networks multiple routers including backup routers balance traffic load multiple links subnets neighboring routers broadcast domain end point-to-point link communicate via ospf protocol routers form adjacencies detected detection initiated router identifies hello protocol packet upon acknowledgment establishes two-way state basic relationship routers ethernet frame relay network select designated router dr backup designated router bdr act hub reduce traffic routers ospf uses unicast multicast transmission modes send hello packets link state updates link state routing protocol ospf establishes maintains neighbor relationships exchanging routing updates routers neighbor relationship table called adjacency database two ospf routers neighbors members subnet share area id subnet mask timers authentication essence ospf neighborship relationship two routers allow see understand nothing ospf neighbors exchange routing information \u2013 packets exchange hello packets ospf adjacencies formed selected neighbors allow exchange routing information two routers must first neighbors become adjacent two routers become adjacent least one designated router backup designated router multiaccess type networks interconnected point-to-point point-to-multipoint network type forming neighbor relationship interfaces used form relationship must ospf area interface may configured belong multiple areas generally practiced configured second area interface must configured secondary interface ospf router within network communicates neighboring routers connecting interface establish states adjacencies every communication sequence separate conversation identified pair router ids communicating neighbors rfc 2328 specifies protocol initiating conversations hello protocol establishing full adjacencies database description packets link state request packets course router conversation transitions maximum eight conditions defined state machine unlike routing protocols ospf carry data via transport protocol user datagram protocol udp transmission control protocol tcp instead ospf forms ip datagrams directly packaging using protocol number 89 ip protocol field ospf defines five different message types various types communication ospf network divided areas logical groupings hosts networks area includes connecting router interfaces connected network area maintains separate link state database whose information may summarized towards rest network connecting router thus topology area unknown outside area reduces routing traffic parts autonomous system areas uniquely identified 32-bit numbers area identifiers commonly written dot-decimal notation familiar ipv4 addressing however ip addresses may duplicate without conflict ipv4 address area identifiers ipv6 implementations ospfv3 also use 32-bit identifiers written notation dotted formatting omitted implementations expand area 1 area identifier 0.0.0.1 known expand 1.0.0.0 ospf defines several special area types backbone area also known area 0 area 0.0.0.0 forms core ospf network areas connected either directly routers inter-area routing happens via routers connected backbone area associated areas logical physical structure 'ospf domain attached nonzero areas ospf domain note ospf term autonomous system boundary router asbr historic sense many ospf domains coexist internet-visible autonomous system rfc 1996 backbone area responsible distributing routing information nonbackbone areas backbone must contiguous need physically contiguous backbone connectivity established maintained configuration virtual links ospf areas must connect backbone area connection however virtual link example assume area 0.0.0.1 physical connection area 0.0.0.0 assume area 0.0.0.2 direct connection backbone area connection area 0.0.0.1 area 0.0.0.2 use virtual link transit area 0.0.0.1 reach backbone transit area area transit attribute stubby way stub area area receive route advertisements external routing within area based entirely default route abr deletes type 4 5 lsas internal routers sends default route 0.0.0.0 turns default gateway reduces lsdb routing table size internal routers modifications basic concept stub areas exist not-so-stubby area nssa addition several proprietary variations implemented systems vendors totally stubby area tsa nssa totally stubby area extension cisco systems routing equipment not-so-stubby area nssa type stub area import autonomous system external routes send areas still receive as-external routes areas nssa extension stub area feature allows injection external routes limited fashion stub area case study simulates nssa getting around stub area problem able import external addresses visualizes following activities asbr imports external addresses type 7 lsa abr converts type 7 lsa type 5 floods areas abr acts asbr areas asbrs take type 5 lsas convert type 7 lsas area several vendors cisco allied telesis juniper alcatel-lucent huawei quagga implement two extensions stub not-so-stubby areas although covered rfc standards considered many standard features ospf implementations newly acquired subsidiary one example might suitable area simultaneously not-so-stubby totally stubby practical place put asbr edge totally stubby area case asbr send externals totally stubby area available ospf speakers within area cisco implementation external routes summarized injecting totally stubby area general asbr advertise default tsa-nssa although work extremely careful design operation limited special cases advertisement makes sense declaring totally stubby area nssa external routes backbone except default route enter area discussed externals reach area 0.0.0.0 via tsa-nssa routes default route enter tsa-nssa routers tsa-nssa send traffic abr except routes advertised asbr transit area area two ospf border routers used pass network traffic one adjacent area another transit area originate traffic destination traffic ospf defines following overlapping categories routers router type attribute ospf process given physical router may one ospf processes example router connected one area receives routes bgp process connected another area border router autonomous system boundary router router identifier customarily written dotted decimal format e.g. 1.2.3.4 ip address identifier must established every ospf instance explicitly configured highest logical ip address duplicated router identifier however since router identifier ip address part routable subnet network often n't avoid confusion addition four router types ospf uses terms designated router dr backup designated router bdr attributes router interface given router interfaces designated dr others backup designated bdr others non-designated router dr bdr given subnet bdr first elected second election held dr dr elected based following default criteria dr exist purpose reducing network traffic providing source routing updates dr maintains complete topology table network sends updates routers via multicast routers multi-access network segment form slave/master relationship dr form adjacencies dr bdr every time router sends update sends dr bdr multicast address dr send update routers area multicast address way routers constantly update rather get updates single source use multicasting reduces network load drs bdrs always setup/elected ospf broadcast networks dr also elected nbma non-broadcast multi-access networks frame relay atm drs bdrs elected point-to-point links point-to-point wan connection two routers either sides link must become fully adjacent bandwidth optimized dr non-dr routers evolve 2-way full adjacency relationships exchanging dd request update ospf uses path cost basic routing metric defined standard equate standard value speed network designer could pick metric important design practice determined speed bandwidth interface addressing given route although tends need network-specific scaling factors links faster 25 mbit/s common cisco uses metric like 10/bandwidth reference value 10 default adjusted 100mbit/s link cost 1 10mbit/s cost 10 links faster 100mbit/s cost would 1 metrics however directly comparable type four types metrics recognized decreasing preference types example intra-area route always preferred external route regardless metric ospf version 3 introduces modifications ipv4 implementation protocol except virtual links neighbor exchanges use ipv6 link-local addressing exclusively ipv6 protocol runs per link rather based subnet ip prefix information removed link-state advertisements hello discovery packet making ospfv3 essentially protocol-independent despite expanded ip addressing 128-bits ipv6 area router identifications still based 32-bit numbers ospf-te extension ospf extending expressivity allow traffic engineering use non-ip networks using ospf-te information topology exchanged using opaque lsa carrying type-length-value elements extensions allow ospf-te run completely band data plane network means also used non-ip networks optical networks ospf-te used gmpls networks means describe topology gmpls paths established gmpls uses path setup forwarding protocols full network map resource reservation protocol rsvp ospf-te used recording flooding rsvp signaled bandwidth reservations label switched paths within link-state database documents work optical routing ip based extensions ospf is-is multicast open shortest path first mospf protocol extension ospf support multicast routing mospf allows routers share information group memberships broadcast multiple-access networks neighbor adjacency formed dynamically using multicast hello packets dr bdr elected normally function normally non-broadcast multiple-access networks nbma following two official modes defined cisco defined following three additional modes ospf nbma topologies ospf first widely deployed routing protocol converge network seconds guarantee loop-free paths many features allow imposition policies propagation routes may appropriate keep local load sharing selective route importing is-is is-is contrast tuned lower overhead stable network sort common isp enterprise networks historical accidents made is-is preferred igp isps isps today may well choose use features now-efficient implementations ospf first considering pros cons is-is service provider environments mentioned ospf provide better load-sharing external links igps default route isp injected ospf multiple asbrs type external route external cost specified routers go asbr least path cost location tuned adjusting external cost contrast default route different isps injected different external costs type ii external route lower-cost default becomes primary exit higher-cost becomes backup real limiting factor may compel major isps select is-is ospf network 850 routers mention ospf network 1000 routers quite uncommon network must specifically designed minimize overhead achieve stable operation", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 965, + 1116, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 544, + "label": 9, + "text": "VHDL:vhdl vhdl vhsic-hdl high speed integrated circuit hardware description language hardware description language used electronic design automation describe digital mixed-signal systems field-programmable gate arrays integrated circuits vhdl also used general purpose parallel programming language starting 1983 vhdl originally developed behest u.s department defense order document behavior asics supplier companies including equipment standard mil-std-454n requirement 64 section 4.5.1 asic documentation vhdl explicitly requires documentation microelectronic devices vhdl idea able simulate asics information documentation obviously attractive logic simulators developed could read vhdl files next step development logic synthesis tools read vhdl output definition physical implementation circuit due department defense requiring much syntax possible based ada order avoid re-inventing concepts already thoroughly tested development ada vhdl borrows heavily ada programming language concepts syntax initial version vhdl designed ieee standard ieee 1076-1987 included wide range data types including numerical integer real logical bit boolean character time plus arrays codice_1 called codice_2 codice_3 called string problem solved edition however multi-valued logic signal drive strength none weak strong unknown values also considered required ieee standard 1164 defined 9-value logic types scalar codice_4 vector version codice_5 resolved subtype codice_6 parent type codice_4 typed signals allow multiple driving modeling bus structures whereby connected resolution function handles conflicting assignments adequately updated ieee 1076 1993 made syntax consistent allowed flexibility naming extended codice_3 type allow iso-8859-1 printable characters added codice_9 operator etc minor changes standard 2000 2002 added idea protected types similar concept class c++ removed restrictions port mapping rules addition ieee standard 1164 several child standards introduced extend functionality language ieee standard 1076.2 added better handling real complex data types ieee standard 1076.3 introduced signed unsigned types facilitate arithmetical operations vectors ieee standard 1076.1 known vhdl-ams provided analog mixed-signal circuit design extensions standards support wider use vhdl notably vital vhdl initiative towards asic libraries microwave circuit design extensions june 2006 vhdl technical committee accellera delegated ieee work next update standard approved called draft 3.0 vhdl-2006 maintaining full compatibility older versions proposed standard provides numerous extensions make writing managing vhdl code easier key changes include incorporation child standards 1164 1076.2 1076.3 main 1076 standard extended set operators flexible syntax case generate statements incorporation vhpi vhdl procedural interface interface c/c++ languages subset psl property specification language changes improve quality synthesizable vhdl code make testbenches flexible allow wider use vhdl system-level descriptions february 2008 accellera approved vhdl 4.0 also informally known vhdl 2008 addressed 90 issues discovered trial period version 3.0 includes enhanced generic types 2008 accellera released vhdl 4.0 ieee balloting inclusion ieee 1076-2008 vhdl standard ieee 1076-2008 published january 2009 ieee standard 1076 defines vhsic hardware description language vhdl originally developed contract f33615-83-c-1003 united states air force awarded 1983 team intermetrics inc. language experts prime contractor texas instruments chip design experts ibm computer system design experts language undergone numerous revisions variety sub-standards associated augment extend important ways 1076 continues milestone design electronic systems vhdl commonly used write text models describe logic circuit model processed synthesis program part logic design simulation program used test logic design using simulation models represent logic circuits interface design collection simulation models commonly called testbench vhdl simulator typically event-driven simulator means transaction added event queue specific scheduled time e.g signal assignment occur 1 nanosecond event added queue time +1ns zero delay also allowed still needs scheduled cases delta delay used represent infinitely small time step simulation alters two modes statement execution triggered statements evaluated event processing events queue processed vhdl constructs handle parallelism inherent hardware designs constructs processes differ syntax parallel constructs ada tasks like ada vhdl strongly typed case sensitive order directly represent operations common hardware many features vhdl found ada extended set boolean operators including nand vhdl file input output capabilities used general-purpose language text processing files commonly used simulation testbench stimulus verification data vhdl compilers build executable binaries case might possible use vhdl write testbench verify functionality design using files host computer define stimuli interact user compare results expected however designers leave job simulator relatively easy inexperienced developer produce code simulates successfully synthesized real device large practical one particular pitfall accidental production transparent latches rather d-type flip-flops storage elements one design hardware vhdl ide fpga implementation xilinx ise altera quartus synopsys synplify mentor graphics hdl designer produce rtl schematic desired circuit generated schematic verified using simulation software shows waveforms inputs outputs circuit generating appropriate testbench generate appropriate testbench particular circuit vhdl code inputs defined correctly example clock input loop process iterative statement required final point vhdl model translated gates wires mapped onto programmable logic device cpld fpga actual hardware configured rather vhdl code executed form processor chip key advantage vhdl used systems design allows behavior required system described modeled verified simulated synthesis tools translate design real hardware gates wires another benefit vhdl allows description concurrent system vhdl dataflow language unlike procedural computing languages basic c assembly code run sequentially one instruction time vhdl project multipurpose created calculation block used many projects however many formational functional block parameters tuned capacity parameters memory size element base block composition interconnection structure vhdl project portable created one element base computing device project ported another element base example vlsi various technologies big advantage vhdl compared original verilog vhdl full type system designers use type system write much structured code especially declaring record types vhdl design consists minimum entity describes interface architecture contains actual implementation addition designs import library modules designs also contain multiple architectures configurations simple gate vhdl would look something like notice codice_10 stands register transfer level design example may seem verbose hdl beginners many parts either optional need written generally simple functions like part larger behavioral module instead separate module something simple addition use elements codice_4 type might first seem overkill one could easily use built-in codice_1 type avoid library import beginning however using 9-valued logic codice_13 codice_14 codice_15 codice_16 codice_17 codice_18 codice_19 codice_20 codice_21 instead simple bits 0,1 offers powerful simulation debugging tool designer currently exist hdl examples follow see vhdl code written compact form however experienced designers usually avoid compact forms use verbose coding style sake readability maintainability another advantage verbose coding style smaller amount resources used programming programmable logic device cpld vhdl frequently used two different goals simulation electronic designs synthesis designs synthesis process vhdl compiled mapped implementation technology fpga asic many fpga vendors free inexpensive tools synthesize vhdl use chips asic tools often expensive constructs vhdl suitable synthesis example constructs explicitly deal timing codice_22 synthesizable despite valid simulation different synthesis tools different capabilities exists common synthesizable subset vhdl defines language constructs idioms map common hardware many synthesis tools ieee 1076.6 defines subset language considered official synthesis subset generally considered best practice write idiomatic code synthesis results incorrect suboptimal non-standard constructs multiplexer 'mux usually called simple construct common hardware design example demonstrates simple two one mux inputs codice_23 codice_24 selector codice_25 output codice_14 note many ways express mux vhdl transparent latch basically one bit memory updated enable signal raised many ways expressed vhdl d-type flip-flop samples incoming signal rising falling edge clock example asynchronous active-high reset samples rising clock edge another common way write edge-triggered behavior vhdl 'event signal attribute single apostrophe written signal name name attribute vhdl also lends one-liners useful signals registers driven process reset following example up-counter asynchronous reset parallel load configurable width demonstrates use 'unsigned type type conversions 'unsigned 'std_logic_vector vhdl generics generics close arguments templates traditional programming languages like c++ complex counters may add if/then/else statements within codice_27 add functions count enables stopping rolling count value generating output signals like terminal count signals etc care must taken ordering nesting controls used together order produce desired priorities minimize number logic levels needed large subset vhdl translated hardware subset known non-synthesizable simulation-only subset vhdl used prototyping simulation debugging example following code generate clock frequency 50 mhz example used drive clock input design simulation however simulation-only construct implemented hardware actual hardware clock generated externally scaled internally user logic dedicated hardware simulation-only constructs used build complex waveforms short time waveform used example test vectors complex design prototype synthesizer logic implemented future commercial", + "neighbors": [ + 65, + 117, + 152, + 193, + 210, + 331, + 369, + 546, + 560, + 643, + 681, + 682, + 819, + 977, + 1221, + 1225, + 1324, + 1518, + 1572, + 1582, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 545, + "label": 4, + "text": "UDP_hole_punching:udp hole punching udp hole punching commonly used technique employed network address translation nat applications maintaining user datagram protocol udp packet streams traverse nat nat traversal techniques typically required client-to-client networking applications internet involving hosts connected private networks especially peer-to-peer direct client-to-client dcc voice internet protocol voip deployments udp hole punching establishes connectivity two hosts communicating across one network address translators typically third-party hosts public transit network used establish udp port states may used direct communications communicating hosts port state successfully established hosts communicating port state may maintained either normal communications traffic prolonged absence thereof keep-alive packets usually consisting empty udp packets packets minimal non-intrusive content udp hole punching method establishing bidirectional udp connections internet hosts private networks using network address translators technique applicable scenarios types nats nat operating characteristics standardized hosts network connectivity inside private network connected via nat internet typically use session traversal utilities nat stun method interactive connectivity establishment ice determine public address nat communications peers require process another host public network used establish port mapping udp port state assumed valid direct communication application hosts since udp state usually expires short periods time range tens seconds minutes udp port closed process udp hole punching employs transmission periodic keep-alive packets renewing life-time counters udp state machine nat udp hole punching work symmetric nat devices also known bi-directional nat tend found large corporate networks symmetric nat nat mapping associated connection well-known stun server restricted receiving data well-known server therefore nat mapping well-known server sees useful information endpoint somewhat elaborate approach hosts start sending using multiple attempts restricted cone nat first packet host blocked nat device record sent packet machine let packets coming ip address port number technique widely used peer-to-peer software voice internet protocol telephony also used assist establishment virtual private networks operating udp technique sometimes extended transmission control protocol tcp connections though less success tcp connection streams controlled host os application sequence numbers selected randomly thus nat device performs sequence-number checking consider packets associated existing connection drop let b two hosts private network n n two nat devices globally reachable ip addresses eip eip respectively public server well-known globally reachable ip address", + "neighbors": [ + 333, + 505, + 552, + 646, + 813, + 1114, + 1321, + 1552, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 546, + "label": 4, + "text": "IEEE_802.10:ieee 802.10 ieee 802.10 former standard security functions could used local area networks metropolitan area networks based ieee 802 protocols 802.10 specifies security association management key management well access control data confidentiality data integrity ieee 802.10 standards withdrawn january 2004 working group ieee 802 currently active security wireless networks standardized 802.11i cisco inter-switch link isl protocol supporting vlans ethernet similar lan technologies based ieee 802.10 application 802.10 largely replaced ieee 802.1q standard developed 8 parts parts b e f g h incorporated ieee standard 802.10-1998", + "neighbors": [ + 544, + 560, + 965, + 977, + 1572 + ], + "mask": "Test" + }, + { + "node_id": 547, + "label": 8, + "text": "Google_Website_Optimizer:google website optimizer google website optimizer free website optimization tool helped online marketers webmasters increase visitor conversion rates overall visitor satisfaction continually testing different combinations website content google website optimizer could test element existed html code page including calls action fonts headlines point action assurances product copy product images product reviews forms allowed webmasters test alternative versions entire page called a/b testing \u2014 test multiple combinations page elements headings images body copy known multivariate testing could used multiple stage conversion funnel 1 june 2012 google announced gwo separate product would retired 1 august 2012 functionality would integrated google analytics google analytics content experiments", + "neighbors": [ + 14, + 24, + 41, + 131, + 176, + 182, + 216, + 422, + 480, + 502, + 553, + 559, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1185, + 1259, + 1265, + 1310, + 1371, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 548, + "label": 7, + "text": "Multi-master_replication:multi-master replication multi-master replication method database replication allows data stored group computers updated member group members responsive client data queries multi-master replication system responsible propagating data modifications made member rest group resolving conflicts might arise concurrent changes made different members multi-master replication contrasted master-slave replication single member group designated master given piece data node allowed modify data item members wishing modify data item must first contact master node allowing single master makes easier achieve consistency among members group less flexible multi-master replication multi-master replication also contrasted failover clustering passive slave servers replicating master data order prepare takeover event master stops functioning master server active client interaction primary purposes multi-master replication increased availability faster server response time many directory servers based ldap implement multi-master replication one prevalent multi-master replication implementations directory servers microsoft active directory within active directory objects updated one domain controller replicated domain controllers multi-master replication required domain controllers replicate would cause excessive network traffic large active directory deployments instead domain controllers complex update pattern ensures servers updated timely fashion without excessive replication traffic active directory needs however better served flexible single master operation ca directory supports multi-master replication opends successor product opendj implemented multi-master since version 1.0 opends/opendj multi-master replication asynchronous uses log publish-subscribe mechanism allows scaling large number nodes opends/opendj replication conflict resolution entry attribute level opends/opendj replication used wide area network widely used open source ldap server implements multi-master replication since version 2.4 october 2007 apache couchdb uses simple http-based multi-master replication system built use append data-store use multiversion concurrency control mvcc document contains revision id every record stores evolutionary timeline previous revision ids leading itself\u2014which provides foundation couchdb mvcc system additionally keeps by-sequence index entire database replication process copies last revision document previous revisions source database copied destination database couchdb replicator acts simple http client acting source target database compares current sequence ids database calculates revision differences makes necessary changes target based found history source database bi-directional replication result merely another replication source target values swapped arangodb native multi-model database system using multi-master replication clusters arangodb use cp master/master model single point failure cluster encounters network partition arangodb prefers maintain internal consistency availability clients experience view database regardless node connect cluster continues serve requests even one machine fails cloudant distributed database system uses largely http api apache couchdb exposes ability replicate using multiversion concurrency control mvcc cloudant databases replicate internally nodes within cloudant clusters use multi-master replication stay sync provide high availability api consumers extremedb cluster clustering sub-system mcobject extremedb embedded database product family maintains database consistency across multiple hardware nodes replicating transactions synchronous manner two-phase commit important characteristic extremedb cluster transaction replication contrast log file-based sql statement-based replication schemes may may guarantee success failure entire transactions accordingly extremedb cluster acid compliant system base eventual consistency query executed cluster node return result executed cluster node database clusters implement multi-master replication using one two methods asynchronous multi-master replication commits data changes deferred transaction queue periodically processed databases cluster synchronous multi-master replication uses oracle two phase commit functionality ensure databases cluster consistent dataset microsoft sql provides multi-master replication peer-to-peer replication provides scale-out high-availability solution maintaining copies data across multiple nodes built foundation transactional replication peer-to-peer replication propagates transactionally consistent changes near real-time basic level possible achieve multi-master replication scheme beginning since mysql version 3.23 circular replication departing mariadb mysql ship replication support different nuances terms direct support mariadb natively supports multi-master replication since version 10.0 conflict resolution supported master must contain different databases mysql named multi-source available since version 5.7.6 mysql mysql group replication plugin virtual synchronous multi master conflict handling distributed recovery released 5.7.17 cluster projects mysql cluster supports conflict detection resolution multiple masters since version 6.3 true multi-master capability mysql server also external project galera cluster created codership provides true multi-master capability based fork innodb storage engine custom replication plug-ins replication synchronous conflict possible percona xtradb cluster also combination galera replication library mysql supporting multi master various options synchronous multi-master replication exist postgres-xl available mozilla public license postgresxc known postgres-x2 available license postgresql examples note pgcluster project abandoned 2007 replication documentation postgresql categorises different types replication available various options exist distributed multi-master including bucardo rubyrep bdr bi-directional replication bdr aimed eventual inclusion postgresql core benchmarked demonstrating significantly enhanced performance earlier options bdr includes replication data writes dml well changes data definition ddl global sequences bdr nodes may upgraded online version 0.9 onwards 2ndquadrant developed bdr continuously since 2012 system used production since 2014 latest version bdr 3.6 provides column-level conflict detection crdts eager replication multi-node query consistency many features within ingres replicator objects updated one ingres server replicated servers whether local remote multi-master replication one server fails client connections re-directed another server required ingres servers environment replicate could cause excessive network traffic large implementations instead ingres replicator allows appropriate data replicated appropriate servers without excessive replication traffic means servers environment serve failover candidates servers meet requirements managing subset columns tables departmental solution subset rows geographical region one-way replication reporting server event source target network failure data integrity enforced two-phase commit protocol ensuring either whole transaction replicated none addition ingres replicator operate rdbms \u2019 multiple vendors connect", + "neighbors": [ + 148, + 429, + 782 + ], + "mask": "Train" + }, + { + "node_id": 549, + "label": 4, + "text": "Double_encoding:double encoding double encoding attack technique used bypass security mechanisms decode data used masquerade directory traversal attack cross-site scripting xss attack double encoding works encoding character want put really decrypts message input illegal characters codice_1 uri encoded becomes codice_2 double uri encoded becomes codice_3 get /download.php file= 252fetc 252fpasswd", + "neighbors": [ + 14 + ], + "mask": "Test" + }, + { + "node_id": 550, + "label": 4, + "text": "Stars_virus:stars virus stars virus computer virus infects computers running microsoft windows named discovered iranian authorities april 2011 iran claimed used tool commit espionage western researchers came believe probably thing duqu virus part stuxnet attack iran stars virus studied laboratory iran \u2013 means major vendors antivirus software access samples therefore could assess potential relation duqu stuxnet foreign computer experts say seen evidence virus even doubt actual existence iran claiming stars harmful computer systems said inflict minor damage initial stage might mistaken executable files governmental organizations second attack claimed iran stuxnet computer worm discovered july 2010 targeted industrial software equipment researchers came believe stars virus found iranian computer specialists duqu virus duqu virus keylogger embedded jpeg file since file taken keylogger portion image remained turned image taken hubble telescope showing cluster stars aftermath two galaxies colliding symantec kaspersky crysys researchers came believe duqu stars virus", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 898, + 915, + 961, + 1043, + 1063, + 1090, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 551, + "label": 2, + "text": "Core_Foundation:core foundation core foundation also called cf c application programming interface api macos ios mix low-level routines wrapper functions apple releases open-source project called cflite used write cross-platform applications macos linux windows third-party open-source implementation called opencflite also exists extends apple distribution building windows linux environments core foundation routines follow certain naming convention deal opaque objects example cfdictionaryref functions whose names begin cfdictionary objects often reference counted manually codice_1 codice_2 internally core foundation forms base types objective-c standard library well prevalent use core foundation passing primitive types data including raw bytes unicode strings numbers calendar dates uuids well collections arrays sets dictionaries numerous macos c routines primarily gui-related operating system level core foundation also provides standardized application preferences management codice_3 bundle handling run loops interprocess communication codice_4 codice_5 basic graphical user interface message dialog codice_6 parts api include utility routines wrappers around existing apis ease use utility routines perform actions file system network i/o codice_7 codice_8 codice_9 endianness translation byte order utilities examples wrapper routines include core foundation wrapper routines unix sockets cfsocket api types core foundation toll-free bridged interchangeable simple cast foundation kit counterparts example one could create codice_10 core foundation type later simply use standard c cast convert objective-c counterpart codice_11 use desired objective-c methods object one normally would core foundation plug-in model cfplugin based microsoft component object model", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 134, + 214, + 228, + 269, + 306, + 345, + 356, + 395, + 403, + 412, + 477, + 511, + 596, + 610, + 625, + 634, + 696, + 797, + 810, + 858, + 877, + 917, + 927, + 945, + 956, + 961, + 1001, + 1100, + 1178, + 1189, + 1237, + 1262, + 1292, + 1305, + 1322, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 552, + "label": 4, + "text": "NAT_traversal:nat traversal network address translator traversal computer networking technique establishing maintaining internet protocol connections across gateways implement network address translation nat nat traversal techniques required many network applications peer-to-peer file sharing voice ip nat devices allow use private ip addresses private networks behind routers single public ip address facing internet internal network devices communicate hosts external network changing source address outgoing requests nat device relaying replies back originating device leaves internal network ill-suited hosting servers nat device automatic method determining internal host incoming packets destined problem general web access email however applications peer-to-peer file sharing voip services video game consoles require clients servers well incoming requests easily correlated proper internal host furthermore many types services carry ip address port number information application data potentially requiring substitution deep packet inspection network address translation technologies standardized result methods used nat traversal often proprietary poorly documented many traversal techniques require assistance servers outside masqueraded network methods use server establishing connection others based relaying data increases bandwidth requirements latency detrimental real-time voice video communications nat traversal techniques usually bypass enterprise security policies enterprise security experts prefer techniques explicitly cooperate nat firewalls allowing nat traversal still enabling marshalling nat enforce enterprise security policies ietf standards based security model realm-specific ip rsip middlebox communications midcom following nat traversal techniques available recent proliferation symmetric nats reduced nat traversal success rates many practical situations mobile public wifi connections hole punching techniques stun ice fail traversing symmetric nats without help relay server practiced turn techniques traverse symmetric nats attempting predict next port opened nat device discovered 2003 yutaka takeda panasonic communications research laboratory 2008 researchers waseda university port prediction techniques effective nat devices use known deterministic algorithms port selection predictable yet non-static port allocation scheme uncommon large scale nats used 4g lte networks therefore port prediction largely ineffective mobile broadband networks ipsec virtual private network clients use nat traversal order encapsulating security payload packets traverse nat ipsec uses several protocols operation must enabled traverse firewalls network address translators many routers provide explicit features often called ipsec passthrough windows xp nat traversal enabled default windows xp service pack 2 disabled default case vpn server also behind nat device rare controversial security issue ipsec nat-t patches also available windows 2000 windows nt windows 98 nat traversal ipsec may used enable opportunistic encryption traffic systems nat traversal allows systems behind nats request establish secure connections demand hosted nat traversal hnt set mechanisms including media relaying latching used intermediaries ietf advises using latching internet recommends ice security reasons", + "neighbors": [ + 440, + 505, + 542, + 545, + 646, + 758, + 813, + 849, + 1114, + 1200, + 1321, + 1448, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 553, + "label": 6, + "text": "Google_File_System:google file system google file system gfs googlefs proprietary distributed file system developed google provide efficient reliable access data using large clusters commodity hardware last version google file system codenamed colossus released 2010 gfs enhanced google core data storage usage needs primarily search engine generate enormous amounts data must retained google file system grew earlier google effort bigfiles developed larry page sergey brin early days google still located stanford files divided fixed-size chunks 64 megabytes similar clusters sectors regular file systems extremely rarely overwritten shrunk files usually appended read also designed optimized run google computing clusters dense nodes consist cheap commodity computers means precautions must taken high failure rate individual nodes subsequent data loss design decisions select high data throughputs even comes cost latency gfs cluster consists multiple nodes nodes divided two types one master node large number chunkservers file divided fixed-size chunks chunkservers store chunks chunk assigned globally unique 64-bit label master node time creation logical mappings files constituent chunks maintained chunk replicated several times throughout network default replicated three times configurable files high demand may higher replication factor files application client uses strict storage optimizations may replicated less three times order cope quick garbage cleaning policies master server usually store actual chunks rather metadata associated chunks tables mapping 64-bit labels chunk locations files make mapping files chunks locations copies chunks processes reading writing particular chunk taking snapshot chunk pursuant replicate usually instigation master server due node failures number copies chunk fallen beneath set number metadata kept current master server periodically receiving updates chunk server heart-beat messages permissions modifications handled system time-limited expiring leases master server grants permission process finite period time process granted permission master server modify chunk modifying chunkserver always primary chunk holder propagates changes chunkservers backup copies changes saved chunkservers acknowledge thus guaranteeing completion atomicity operation programs access chunks first querying master server locations desired chunks chunks operated i.e outstanding leases exist master replies locations program contacts receives data chunkserver directly similar kazaa supernodes unlike file systems gfs implemented kernel operating system instead provided userspace library google file system implement posix api files organized hierarchically directories identified pathnames file operations create delete open close read write supported supports record append allows multiple clients append data file concurrently atomicity guaranteed deciding benchmarking results used relatively small number servers 15 file system achieves reading performance comparable single disk 80\u2013100 mb/s reduced write performance 30 mb/s relatively slow 5 mb/s appending data existing files authors present results random seek time master node directly involved data reading data passed chunk server directly reading client read rate increases significantly number chunk servers achieving 583 mb/s 342 nodes aggregating large number servers also allows big capacity somewhat reduced storing data three independent locations provide redundancy", + "neighbors": [ + 14, + 24, + 34, + 40, + 41, + 55, + 63, + 131, + 176, + 182, + 216, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 422, + 438, + 480, + 495, + 502, + 524, + 547, + 557, + 558, + 559, + 570, + 671, + 704, + 723, + 728, + 775, + 777, + 837, + 887, + 892, + 900, + 908, + 912, + 922, + 936, + 942, + 962, + 982, + 997, + 1056, + 1061, + 1064, + 1082, + 1097, + 1104, + 1124, + 1129, + 1138, + 1157, + 1185, + 1201, + 1202, + 1234, + 1252, + 1259, + 1265, + 1283, + 1310, + 1322, + 1371, + 1381, + 1411, + 1415, + 1419, + 1445, + 1459, + 1480, + 1500, + 1565, + 1596, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 554, + "label": 4, + "text": "Convergence_(SSL):convergence ssl convergence proposed strategy replacing ssl certificate authorities first put forth moxie marlinspike august 2011 giving talk titled ssl future authenticity black hat security conference demonstrated firefox addon server-side notary daemon talk marlinspike proposed current problems certificate authority ca system could reduced single missing property called trust agility convergence aimed provide strategy claimed agile secure distributed 2013 marlinspike focused ietf proposal called tack designed uncontroversial first step advocates dynamic certificate pinning instead full ca replacement reduces number times third party needs trusted development convergence continued convergence extra fork 2014 convergence based previous work perspectives project carnegie mellon university like perspectives convergence authenticated connections contacting external notaries unlike perspectives convergence notaries could use number different strategies beyond network perspective order reach verdict purpose certificate authority conventional ssl system vouch identity site checking ssl certificate without vouchsafing one open man-in-the-middle attack single site vouched single certificate authority ca ca trusted user web browsers typically include list default trusted certificate authorities display warning untrusted connection site vouchsafed trusted ca problem system user browser vendor loses trust ca removing ca browser list trusted authorities means losing trust sites used ca happened major browsers lost trust diginotar ca sites registered ca get new certificate authorities see certificate authority ca compromise examples trust breaches convergence however level redundancy single point failure several notaries could vouch single site user could choose trust several notaries would vouch sites notaries disagreed whether site identity correct user could choose go majority vote err side caution demand notaries agree content single notary voting method controlled setting browser addon user chose distrust certain notary non-malicious site could still trusted long remaining trusted notaries trusted thus longer single point failure september 2011 qualys announced would run two notary servers june 2016 servers appeared list notaries maintained convergence wiki", + "neighbors": [ + 88, + 172, + 235, + 260, + 261, + 319, + 343, + 533, + 539, + 542, + 692, + 826, + 1003, + 1089, + 1138, + 1240, + 1331, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 555, + "label": 3, + "text": "Milk_Race_(video_game):milk race video game milk race computer game released 1987 zx spectrum commodore 64 atari 8-bit family msx amstrad cpc developed phil berry stuart ruecroft composer david whittaker icon design based around internationally acclaimed event world cycle race milk race known tour britain simulator designed coincide 1987 event starting newcastle upon tyne north england midlands london finishing line basic premise game control bike using acceleration braking choosing correct gear conserve energy", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 556, + "label": 7, + "text": "Rackspace:rackspace rackspace inc. american managed cloud computing company based windcrest texas suburb san antonio company also offices australia united kingdom switzerland netherlands germany singapore mexico hong kong rackspace data centers operating texas chicago kansas city virginia united kingdom germany australia hong kong company rackspace email division operates blacksburg va offices located austin texas 2016 rackspace closed san francisco office rackspace became public 2008 2016 purchased taken private apollo global management llc 1996 richard yoo started small internet service provider called cymitar network systems garage apartment san antonio texas company began application development work addition offering basic internet access web hosting 1997 yoo brought dirk elmendorf company began develop internet applications primary business company re-formed cymitar technology group cymitar technology group grew patrick condon recruited california joined team 1998 coincidentally three company founders students one time trinity university san antonio although founders began application developers end users found companies either know want host applications founders wanted focus application development\u2013not hosting\u2013but unable find opportunity outsource hosting work eventually founders realized would better create product serve hosting need launch company rackspace launched october 1998 richard yoo ceo although hosting companies focused technology end hosting rackspace created fanatical support offering focus service support march 28 2000 rackspace received funding lead investor norwest venture partners sequoia capital george j still jr. managing partner norwest subsequently joined board directors 2008 rackspace moved headquarters building occupied datapoint corporation then-unoccupied windsor park mall windcrest texas rackspace chairman graham weston owned montgomery ward building mall 2006 sold developer city windcrest purchased south mall create residential retail complex facility located next roosevelt high school many roosevelt students intern rackspace fortune top 100 best companies work 2008 placed rackspace first year rackspace applied consideration company praised transparency regular open book meetings held top level leaders share in-depth financial information employees 2011 2013 company named one top 100 places work fortune august 8 2008 rackspace opened trading new york stock exchange ticker symbol rax initial public offering ipo raised 187.5 million initial public offering included 15,000,000 shares common stock price 12.50 per share ipo well public market lost 20 initial price almost immediately around 3:45pm cst december 18 2009 rackspace experienced outage customers using dallas\u2013fort worth data center \u2013 including rackspace cloud september 8 2010 rackspace received national attention decided discontinue providing web hosting service one customers dove world outreach center reaction dove world pastor terry jones plan burn several copies qur'an anniversary september 11th attacks rackspace claims violated company policy move came criticism notably terry jones described indirect attack freedom speech others questioned appropriateness rackspace action stating absolutely reason web hosts editorial policy gives jones attention makes look persecuted june 3 2011 rackspace intervened application queensland host rack servers trademark business name australia may 26 2013 author bill schley book 'the unstoppables inspired culture rackspace became new york times bestseller may 15 2014 rackspace hired morgan stanley evaluate strategic options including selling merging technology companies october 2014 rackspace announced would sell support google work apps business customers august 2016 confirmed apollo global management reached agreement buy company 4.3 billion sale completed november 2016 rackspace officially ended trading new york stock exchange november 3 2016 may 2017 ceo taylor rhodes announced leaving company may 16 work smaller private company different city may 2017 rackspace named joe eazor new ceo april 2019 company named kevin jones new ceo october 22 2008 rackspace announced purchasing cloud storage provider jungle disk vps provider slicehost february 16 2012 rackspace acquired sharepoint911 microsoft sharepoint consulting company based cincinnati ohio may 25 2017 rackspace announced agreement acquire tricore solutions september 11 2017 rackspace announced plans acquire datapipe september 17 2018 rackspace announced acquired relationedge acquisitions include cloudkick anso labs mailgun objectrocket exceptional cloud services zerovm rackspace launched serverbeach san antonio january 2003 lower-cost alternative dedicated servers designed technology hobbyists want flexibility reliability richard yoo catalyst startup serverbeach bandwidth colocation provider peer 1 hosting known cogeco peer 1 purchased serverbeach october 2004 7.5 million peer 1 hosting entered uk managed hosting market january 2009 serverbeach brand competes directly uk arm rackspace run dominic monkhouse former managing director rackspace limited october 2006 mosso inc. launched experimented white-labeling hosting services eventually division became foundation rackspace cloud computing offering october 1 2007 rackspace acquired webmail.us private e-mail hosting firm located blacksburg va originally branded mailtrust may 20 2009 became part newly formed cloud office division rackspace october 22 2008 rackspace acquired slicehost provider virtual servers jungle disk provider online backup software services rackspace announced march 8 2017 plans expansion portfolio include managed service google cloud platform program began beta testing july 18 2017 planned full offering late 2017 rackspace partnered google customer reliability engineering group google site reliability engineers ensure cloud applications run speed reliability google widely-used products 2010 rackspace contributed source code cloud files product openstack project apache license become openstack object storage component april 2012 rackspace announced would implement openstack compute underlying technology cloud servers product change introduced new control panel well add-on cloud services offering databases server monitoring block storage virtual networking 2015 two rackspace executives elected board openstack foundation february 2016 interview cto john engates stated rackspace use openstack power public private cloud", + "neighbors": [ + 77, + 480, + 505, + 570, + 611, + 671, + 708, + 857, + 930, + 936, + 1019, + 1036, + 1091, + 1377, + 1431, + 1447 + ], + "mask": "Validation" + }, + { + "node_id": 557, + "label": 6, + "text": "Andrew_File_System:andrew file system andrew file system afs distributed file system uses set trusted servers present homogeneous location-transparent file name space client workstations developed carnegie mellon university part andrew project originally named vice afs named andrew carnegie andrew mellon primary use distributed computing afs several benefits traditional networked file systems particularly areas security scalability one enterprise afs deployment morgan stanley exceeds 25,000 clients afs uses kerberos authentication implements access control lists directories users groups client caches files local filesystem increased speed subsequent requests file also allows limited filesystem access event server crash network outage afs uses weak consistency model read write operations open file directed locally cached copy modified file closed changed portions copied back file server cache consistency maintained callback mechanism file cached server makes note promises inform client file updated someone else callbacks discarded must re-established client server network failure including timeout re-establishing callback involves status check require re-reading file consequence file locking strategy afs support large shared databases record updating within files shared client systems deliberate design decision based perceived needs university computing environment example original email system andrew project andrew message system single file per message used like maildir rather single file per mailbox like mbox see afs buffered i/o problems handling shared databases significant feature afs volume tree files sub-directories afs mountpoints links afs volumes volumes created administrators linked specific named path afs cell created users filesystem may create directories files usual without concern physical location volume volume may quota assigned order limit amount space consumed needed afs administrators move volume another server disk location without need notify users operation even occur files volume used afs volumes replicated read-only cloned copies accessing files read-only volume client system retrieve data particular read-only copy point copy becomes unavailable clients look remaining copies users data unaware location read-only copy administrators create relocate copies needed afs command suite guarantees read-only volumes contain exact copies original read-write volume time read-only copy created file name space andrew workstation partitioned shared local name space shared name space usually mounted /afs unix filesystem identical workstations local name space unique workstation contains temporary files needed workstation initialization symbolic links files shared name space andrew file system heavily influenced version 4 sun microsystems popular network file system nfs additionally variant afs distributed file system dfs adopted open software foundation 1989 part distributed computing environment finally afs version two predecessor coda file system three major implementations transarc ibm openafs arla transarc software deprecated losing support fourth implementation exists linux kernel source code since least version 2.6.10 committed red hat fairly simple implementation still early stages development therefore incomplete january 2013 following access control list acl permissions granted permissions affect files subdirectories include additionally afs includes application acls h effect access files", + "neighbors": [ + 34, + 40, + 55, + 63, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1538, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 558, + "label": 6, + "text": "ExFAT:exfat exfat extended file allocation table file system introduced microsoft 2006 optimized flash memory usb flash drives sd cards exfat proprietary microsoft owns patents several elements design exfat used ntfs feasible solution due data-structure overhead greater file-size limit standard fat32 file system i.e 4 gib required exfat adopted sd card association default file system sdxc cards larger 32 gib 2013 samsung published gpl linux driver exfat exfat first introduced late 2006 part windows ce 6.0 embedded windows operating system vendors signing licenses exfat either embedded systems device manufacturers produce media preformatted exfat entire file allocation table fat family exfat included used embedded systems lightweight better suited solutions low memory low power requirements easily implemented firmware specifications features requirements exfat file system include exfat format allows individual files larger 4 gb facilitating long continuous recording hd video exceed 4 gb limit less hour current digital cameras using fat32 break video files multiple segments approximately 2 4 gb increase capacity increase data transferred write operation needs made efficient sdxc cards running uhs-i minimum guaranteed write speed 10 mbps exfat plays factor achieving throughput reduction file system overhead cluster allocation achieved introduction cluster bitmap elimination reduction writes fat single bit directory record indicates file contiguous telling exfat driver ignore fat optimization analogous extent file systems except applies whole files opposed contiguous parts files exfat supported windows xp windows server 2003 update kb955704 windows embedded ce 6.0 windows vista service pack 1 windows server 2008 windows 7 windows 8 windows server 2008 r2 except windows server 2008 server core windows 10 mac os x starting 10.6.5 companies integrate exfat specific group consumer devices including cameras camcorders digital photo frames flat fee mobile phones pcs networks different volume pricing model exfat supported number media devices modern flat-panel tvs media centers portable media players vendors flash media including usb pen drives compact flash cf solid-state drives ssd ship high-capacity media pre-formatted exfat file system example sandisk ships 256 gb cf cards exfat microsoft entered licensing agreements blackberry panasonic sanyo sony canon aspen avionics audiovox continental harman lg automotive bmw mac os x snow leopard 10.6.5 later create read write verify repair exfat file systems fuse-based implementation named fuse-exfat exfat-fuse read/write support available freebsd multiple linux distributions older versions mac os x kernel implementation also released written samsung initially released github unintentionally later released officially samsung compliance gpl none solutions become official part linux due patent encumbered status exfat file system implementation called exfatfilesystem based fuse-exfat available amigaos 4.1 proprietary read/write solutions licensed derived microsoft exfat implementation available android linux operating systems paragon software group tuxera xcfiles datalight proprietary full-featured implementation intended portable 32-bit systems rtfs ebs embedded software full-featured implementation embedded devices two experimental unofficial solutions available dos loadable usbexfat driver requires panasonic usb stack dos works usb storage devices open-source exfat executable exfat file system reader requires hx dos extender work native exfat real-mode dos drivers would allow usage booting exfat volumes exfat employs filename hash-based lookup phase speed certain cases described us patent 8321439 quick file name lookup using name hash document perhaps contains additional details helpful understanding file system appendix like ntfs exfat pre-allocate disk space file marking arbitrary space disk 'allocated file exfat uses two separate 64-bit length fields directory valid data length vdl indicates real size file physical data length provide improvement allocation cluster storage new file microsoft incorporated method pre-allocate contiguous clusters bypass use updating fat table december 10 2013 us patent office granted patent us8606830 one feature exfat used exfat implementation within embedded systems provides atomic transactions multiple steps updating file system metadata feature called transaction safe fat texfat granted patent us patent office us7613738 november 3 2009. exfat rest fat family file systems use indexes file names unlike ntfs uses b-trees file searching file accessed directory must sequentially searched match found file names shorter 16 characters length one file name record required entire file represented three 32-byte directory records called directory file set 256 mib sub-directory hold 2,796,202 file sets files longer names number decrease maximum based minimum three-record file set help improve sequential searching directories including root hash value file name derived file stored directory record searching file file name first converted upper case using upcase table file names case insensitive hashed using proprietary patented algorithm 16-bit 2 byte hash value record directory searched comparing hash value match found file names compared ensure proper file located case hash collisions improves performance 2 bytes compared file significantly reduces cpu cycles file names 2 characters bytes size virtually every comparison performed 2 bytes time intended file located exfat introduces metadata integrity use checksums three checksums currently use volume boot record vbr 12 sector region contains boot records bios parameter block bpb oem parameters checksum sector two vbr type regions main vbr backup vbr checksum sector checksum previous 11 sectors exception three bytes boot sector flags percent used provides integrity vbr determining vbr modified common cause could boot sector virus would also catch corruption vbr second checksum used upcase table static table never change corruption table could prevent files located table used convert filenames upper case searching locate file third checksum directory file sets multiple directory records used define single file called file set file set metadata including file name time stamps attributes address first cluster location data file lengths file name checksum taken entire file set mismatch would occur directory file set accidentally maliciously changed file system mounted integrity check conducted hashes verified mounting also includes comparison version exfat file system driver make sure driver compatible file system trying mount make sure none required directory records missing example directory record upcase table allocation bitmap required file system ca n't run missing checks fail file system mounted although certain cases may mount read-only file system provides extensibility template-based metadata definitions using generic layouts generic patterns exfat proprietary file system microsoft released specification lack documentation hampered development free open-source drivers exfat accordingly exfat support effectively limited microsoft products microsoft licensees turn inhibited exfat adoption universal exchange format interoperability requires certain results achieved particular predefined way algorithm exfat potentially requires every implementation perform certain procedures exactly way microsoft implementation procedures used microsoft implementation patented patents owned microsoft license use algorithms purchased microsoft companies including apple google samsung done however open-source ecosystem financial incentive open-source vendors purchase license algorithms regardless whether open-source including samsung leaked kernel driver source initially fraudulently rebadged gpl-licensed microsoft stated license required order implement exfat use product device unlicensed distribution exfat driver would make distributor liable financial damages driver found violated microsoft patents patents may enforceable determined legal process expensive time consuming may also possible achieve intended results without infringing microsoft patents october 2018 microsoft released 60,000 patents open invention network members linux systems exfat patents included however discussion within microsoft whether microsoft allow exfat linux devices", + "neighbors": [ + 26, + 34, + 40, + 42, + 55, + 63, + 66, + 79, + 82, + 93, + 134, + 148, + 153, + 222, + 233, + 262, + 268, + 278, + 295, + 312, + 326, + 334, + 336, + 344, + 349, + 358, + 433, + 435, + 438, + 485, + 495, + 521, + 524, + 540, + 553, + 557, + 570, + 574, + 615, + 638, + 662, + 689, + 705, + 723, + 728, + 791, + 801, + 865, + 887, + 892, + 900, + 908, + 912, + 920, + 922, + 942, + 961, + 982, + 989, + 997, + 1025, + 1035, + 1056, + 1064, + 1092, + 1097, + 1098, + 1104, + 1109, + 1124, + 1138, + 1151, + 1157, + 1201, + 1202, + 1212, + 1234, + 1247, + 1252, + 1261, + 1283, + 1322, + 1328, + 1338, + 1346, + 1363, + 1370, + 1381, + 1417, + 1445, + 1459, + 1461, + 1506, + 1531, + 1533, + 1538, + 1545, + 1547, + 1561, + 1565, + 1569, + 1578, + 1582, + 1589, + 1613, + 1620, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 559, + "label": 8, + "text": "Google_Search_Console:google search console google search console previously google webmaster tools web service google provided free charge webmasters allows check indexing status optimize visibility websites may 20 2015 google rebranded google webmaster tools google search console january 2018 google introduced new version search console refreshed user interface improvements tools let webmasters list inbound links google webmaster tools generally much larger list inbound links discovered using link example.com search query google google tight lipped discrepancy list google webmaster tools includes nofollow links convey search engine optimization authority linked site hand list links generated link example.com type query deemed google important links controversial way google webmaster tools well google index seems routinely ignore link spam manual penalty removed google webmaster tools still display penalty another 1\u20133 days google search console rebrand information produced demonstrating google search console creates data points reconcile google analytics ranking data particularly within local search market webmaster services hawaii", + "neighbors": [ + 24, + 41, + 131, + 176, + 182, + 216, + 422, + 480, + 502, + 547, + 553, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1185, + 1259, + 1265, + 1310, + 1371, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 560, + "label": 4, + "text": "Simultaneous_Authentication_of_Equals:simultaneous authentication equals cryptography simultaneous authentication equals sae secure password-based authentication password-authenticated key agreement method sae variant dragonfly key exchange defined based diffie\u2013hellman key exchange using finite cyclic groups primary cyclic group elliptic curve problem using diffie\u2013hellman key exchange authentication mechanism resulting key influenced pre-shared key mac addresses peers solve authentication problem sae originally implemented use peers ieee 802.11s peers discover security enabled take part sae exchange sae completes successfully peer knows party possesses mesh password by-product sae exchange two peers establish cryptographically strong key key used authenticated mesh peering exchange ampe establish secure peering derive session key protect mesh traffic including routing traffic january 2018 wi-fi alliance announced wpa3 replacement wpa2 new standard uses 128-bit encryption wpa3-personal mode 192-bit wpa3-enterprise forward secrecy wpa3 standard also replaces pre-shared key exchange simultaneous authentication equals defined ieee 802.11-2016 resulting secure initial key exchange personal mode wi-fi alliance also claims wpa3 mitigate security issues posed weak passwords simplify process setting devices display interface", + "neighbors": [ + 544, + 546, + 955, + 977, + 1042, + 1572 + ], + "mask": "Test" + }, + { + "node_id": 561, + "label": 1, + "text": "UK_Educational_Evidence_Portal:uk educational evidence portal uk educational evidence portal eep online resource providing easy access published research evidence-based guidance across areas education related aspects children \u2019 services developed collaboration organisations make research evidence widely available range audiences including educational professionals practitioners policy makers research community portal went live september 2007 funded number organisations including cfbt education trust dcsf bis tda becta national college hosted eppi-centre institute education university london managed development group meets approximately bi-monthly subset group meets editorial group manages content portal cfbt education trust provides overall leadership portal cited useful information resource various academic government sources uk elsewhere eep searched following ways eep currently developing next release portal improve search results new experienced users subject list browsing database authors names british education thesaurus terms clickable related documents database linked new text mining tool provide automatic subject tags fly database website search", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 562, + "label": 3, + "text": "The_Black_Bass_(1986_video_game):black bass 1986 video game objective player catch many black bass possible sunrise sunset player may select beginner game ranking game ranking game requires password player may select location lake start begin fishing simply tossing lure desired power start process fish lured moving lure around bites player try reeling much constant reeling leads line breaking loss fish lure casting rounds player make certain selections among selections available option change type color lure used", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 563, + "label": 4, + "text": "InfoSec_Institute:infosec institute infosec institute technology training company provides certification-based training courses security professionals enterprise-grade security awareness phishing training businesses agencies technology professionals company training library provides multi-course tracks job function certification-specific training short-form continuing education training course library includes 95 courses covering topics like ethical hacking network security mobile forensics infosec institute securityiq integrates security awareness training phishing simulations personalized learning scales employees \u2019 security aptitudes roles learning styles infosec institute founded 1998 team information security instructors", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 564, + "label": 4, + "text": "Timeline_of_computer_viruses_and_worms:timeline computer viruses worms timeline computer viruses worms presents chronological timeline noteworthy computer viruses computer worms trojan horses similar malware related research events", + "neighbors": [ + 11, + 46, + 91, + 149, + 190, + 198, + 225, + 292, + 293, + 306, + 418, + 450, + 487, + 509, + 522, + 531, + 576, + 624, + 638, + 692, + 739, + 746, + 763, + 818, + 868, + 1012, + 1090, + 1188, + 1213, + 1235, + 1287, + 1301, + 1309, + 1325, + 1327, + 1342, + 1350, + 1358, + 1379, + 1444, + 1467, + 1543, + 1573, + 1582, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 565, + "label": 9, + "text": "Hy:hy hy alternately hylang programming language dialect language lisp designed interact language python translating expressions python abstract syntax tree ast hy introduced python conference pycon 2013 paul tagliamonte similar kawa clojure mapping s-expressions onto java virtual machine jvm hy meant operate transparent lisp front end python abstract syntax lisp allows operating code data metaprogramming thus hy used write domain-specific languages hy also allows python libraries including standard library imported accessed alongside hy code compiling step converting data structure python ast language documentation", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1225, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Train" + }, + { + "node_id": 566, + "label": 4, + "text": "Christmas_tree_packet:christmas tree packet information technology christmas tree packet packet every single option set whatever protocol use term derives fanciful image little option bit header represented different-colored light bulb turned packet lit like christmas tree also known kamikaze packet nastygram lamp test segment christmas tree packets used method tcp/ip stack fingerprinting exposing underlying nature tcp/ip stack sending packets awaiting analyzing responses used part scanning system tcp header christmas tree packet flags fin urg psh set many operating systems implement compliance internet protocol standard rfc 791 varying incomplete ways observing host responds odd packet christmas tree packet inferences made regarding host operating system versions microsoft windows bsd/os hp-ux cisco ios mvs irix display behaviors differ rfc standard queried said packets large number christmas tree packets also used conduct dos attack exploiting fact christmas tree packets require much processing routers end-hosts usual packets christmas tree packets easily detected intrusion-detection systems advanced firewalls network security point view christmas tree packets always suspicious indicate high probability network reconnaissance activities", + "neighbors": [ + 149, + 195, + 363, + 739, + 771, + 779, + 961, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 567, + "label": 9, + "text": "Haskell_(programming_language):haskell programming language haskell statically typed purely functional programming language type inference lazy evaluation type classes enable type-safe operator overloading originated haskell main implementation glasgow haskell compiler named logician haskell curry haskell based semantics syntax miranda programming language served focus efforts initial haskell working group haskell used widely academia industry latest standard haskell haskell 2010. haskell committee working next standard haskell 2020 following release miranda research software ltd. 1985 interest lazy functional languages grew 1987 dozen non-strict purely functional programming languages existed miranda widely used proprietary software conference functional programming languages computer architecture fpca '87 portland oregon strong consensus committee formed define open standard languages committee purpose consolidate existing functional languages common one serve basis future research functional-language design first version haskell haskell 1.0 defined 1990 committee efforts resulted series language definitions 1.0 1.1 1.2 1.3 1.4 late 1997 series culminated haskell 98 intended specify stable minimal portable version language accompanying standard library teaching base future extensions committee expressly welcomed creating extensions variants haskell 98 via adding incorporating experimental features february 1999 haskell 98 language standard originally published haskell 98 report january 2003 revised version published haskell 98 language libraries revised report language continues evolve rapidly glasgow haskell compiler ghc implementation representing current de facto standard early 2006 process defining successor haskell 98 standard informally named haskell prime began intended ongoing incremental process revise language definition producing new revision per year first revision named haskell 2010 announced november 2009 published july 2010 haskell 2010 incremental update language mostly incorporating several well-used uncontroversial features previously enabled via compiler-specific flags haskell features lazy evaluation lambda expressions pattern matching list comprehension type classes type polymorphism purely functional language means functions generally side effects distinct construct exists represent side effects orthogonal type functions pure function return side effect subsequently executed modeling impure functions languages haskell strong static type system based hindley\u2013milner type inference principal innovation area type classes originally conceived principled way add overloading language since finding many uses construct represents side effects example monad monads general framework model different kinds computation including error handling nondeterminism parsing software transactional memory monads defined ordinary datatypes haskell provides syntactic sugar use haskell open published specification multiple implementations exist main implementation glasgow haskell compiler ghc interpreter native-code compiler runs platforms ghc noted rich type system incorporating recent innovations generalized algebraic data types type families computer language benchmarks game also highlights high-performance implementation concurrency parallelism active growing community exists around language 5,400 third-party open-source libraries tools available online package repository hackage hello world program haskell last line strictly necessary factorial function haskell defined different ways integer type arbitrary-precision code compute values codice_10 456,574-digit number loss precision implementation algorithm similar quick sort lists first element taken pivot haskell logo top page generated haskell code listed implementations distributed open source licenses implementations fully nearly comply haskell 98 standard include implementations longer actively maintained include implementations fully haskell 98 compliant using variant haskell language include several web frameworks written haskell including jan-willem maessen 2002 simon peyton jones 2003 discussed problems associated lazy evaluation also acknowledging theoretical motives addition purely practical considerations improved performance note addition adding performance overhead lazy evaluation makes difficult programmers reason performance code particularly space use bastiaan heeren daan leijen arjan van ijzendoorn 2003 also observed stumbling blocks haskell learners subtle syntax sophisticated type system haskell double edged sword \u2013 highly appreciated experienced programmers also source frustration among beginners since generality haskell often leads cryptic error messages address researchers utrecht university developed advanced interpreter called helium improved user-friendliness error messages limiting generality haskell features particular removing support type classes ben lippmeier designed disciple strict-by-default lazy explicit annotation dialect haskell type-and-effect system address haskell difficulties reasoning lazy evaluation using traditional data structures mutable arrays argues p. 20 destructive update furnishes programmer two important powerful tools ... set efficient array-like data structures managing collections objects ... ability broadcast new value parts program minimal burden programmer robert harper one authors standard ml given reasons using haskell teach introductory programming among difficulty reasoning resource use non-strict evaluation lazy evaluation complicates definition data types inductive reasoning inferiority haskell old class system compared ml module system haskell build tool cabal historically criticised poorly handling multiple versions library problem know cabal hell stackage server stack build tool made response criticisms.. clean close slightly older relative haskell biggest deviation haskell use uniqueness types instead monads i/o side-effects series languages inspired haskell different type systems developed including java virtual machine jvm based related languages include haskell served testbed many new ideas language design many haskell variants produced exploring new language ideas including haskell community meets regularly research development activities main events since 2006 series organized hackathons occurred hac series aimed improving programming language tools libraries", + "neighbors": [ + 7, + 19, + 29, + 31, + 65, + 78, + 117, + 134, + 152, + 176, + 201, + 216, + 275, + 292, + 306, + 324, + 347, + 373, + 412, + 509, + 538, + 579, + 593, + 594, + 597, + 653, + 682, + 686, + 742, + 782, + 789, + 790, + 796, + 799, + 815, + 820, + 824, + 825, + 873, + 916, + 919, + 926, + 948, + 998, + 1005, + 1006, + 1011, + 1028, + 1044, + 1068, + 1120, + 1138, + 1146, + 1152, + 1189, + 1190, + 1221, + 1225, + 1227, + 1235, + 1242, + 1251, + 1256, + 1269, + 1298, + 1311, + 1324, + 1372, + 1388, + 1418, + 1430, + 1457, + 1477, + 1481, + 1491, + 1502, + 1511, + 1516, + 1532, + 1536, + 1538, + 1582, + 1626, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 568, + "label": 4, + "text": "Usenet_Death_Penalty:usenet death penalty usenet usenet death penalty udp final penalty may issued internet service providers single users produce much spam fail adhere usenet standards messages fall jurisdiction usenet death penalty cancelled cancelled messages deleted usenet servers allowed propagate causes users affected isp unable post usenet puts pressure isp change policies notable cases include actions taken uunet compuserve excite home three types usenet death penalty effective udp must supported large number servers majority major transit servers otherwise articles propagate throughout smaller slower peerings udps casual acts announced beforehand owner offending server contacted given several chances correct perceived problem since effects users server udp significant users want post impact udp induce operators offending server address problems quickly udps issued america online bbn planet compuserve erols internet netcom tiac uunet first udp software written karl kleinpaste 1990 though disagreement term coined net abuse faq claims 1993 message posted 18 august year claims coined years earlier eliot lear udp implemented uunet 1 august 1997 became host many spammers unresponsive abuse complaints forced provider implement antispam policies tools close open relays executives called udp digital terrorism threatened legal action asserted planning move spammers anyway volume spam uunet decreased organizers called penalty august 6 though announcement stifled cancel messages udp opponents active udp implemented compuserve 18 november 1997 lifted following day company implemented anti-spamming measures instituted new acceptable use policy addressing spamming udp scheduled begin excite home 19 january 2000 lifted day scheduled begin isp began scanning misconfigured proxy servers home users computers blamed spam originating network", + "neighbors": [ + 491, + 627 + ], + "mask": "Test" + }, + { + "node_id": 569, + "label": 4, + "text": "Comparison_of_firewalls:comparison firewalls following comparison notable firewalls starting simple home firewalls sophisticated enterprise-level firewalls firewall solutions provided software solutions run general purpose operating systems following table lists different firewall software installed configured different general purpose operating systems general computer appliance computing device specific function limited configuration ability software appliance set computer programs might combined enough operating system jeos run optimally industry standard computer hardware virtual machine firewall appliance combination firewall software operating system purposely built run firewall system dedicated hardware virtual machine include following table lists different firewall appliances features strictly firewall features sometimes bundled firewall software exist platform note features marked yes even implemented separate module comes platform firewall sits ids real-time firewall logs/sniffs/blocks suspicious connections part rule-set vpn virtual private network types pptp l2tp mpls ipsec ssl/ssh profile selection user switch sets firewall settings e.g use work home public connections", + "neighbors": [ + 94, + 120, + 134, + 189, + 217, + 276, + 357, + 476, + 483, + 576, + 648, + 656, + 685, + 731, + 739, + 813, + 842, + 910, + 938, + 944, + 961, + 1138, + 1239, + 1250, + 1257, + 1291, + 1301, + 1318, + 1397, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Train" + }, + { + "node_id": 570, + "label": 6, + "text": "Comparison_of_distributed_file_systems:comparison distributed file systems computing distributed file system dfs network file system file system allows access files multiple hosts sharing via computer network makes possible multiple users multiple machines share files storage resources distributed file systems differ performance mutability content handling concurrent writes handling permanent temporary loss nodes storage policy storing content researchers made functional experimental analysis several distributed file systems including hdfs ceph gluster lustre old 1.6.x version moosefs although document 4 years old lot information may outdated e.g moosefs time writing stable 2.0 beta 3.0 version ha metadata server since 2.0 mentioned document cloud based remote distributed storage major vendors different apis different consistency models", + "neighbors": [ + 34, + 40, + 55, + 63, + 222, + 233, + 272, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 365, + 438, + 495, + 524, + 553, + 556, + 557, + 558, + 684, + 723, + 728, + 755, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1225, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1470, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 571, + "label": 3, + "text": "List_of_Linux-supported_computer_architectures:list linux-supported computer architectures basic components linux family operating systems based linux kernel gnu c library busybox forks thereof like \u03bcclinux uclibc programmed certain level abstraction mind also distinct code paths assembly language c source code support certain hardware therefore source code successfully compiled onor cross-compiled fora great number computer architectures furthermore required free open-source software also developed interface linux hardware linux executed example compilers available e.g gnu compiler collection gcc llvm/clang cross-compilation number complete toolchains available like gnu toolchain openwrt buildroot openembedded yocto project targeted embedded use cases portability section linux kernel article contains information references technical details note components like display server programs like blender present absent fundamentally software ported i.e specifically adapted kind hardware supposed executed level abstraction kept mind programming software first place dictates necessary effort relevant term porting target computer architecture comprises instruction set microarchitecture processor least cpu target also comprises system design entire system supercomputer desktop computer soc e.g case unique bus used former times memory controller part chipset motherboard cpu-die although support specific instruction set task compiler software must written certain level abstraction mind make portability possible code written assembly language specific instruction set support specific microarchitecture includes optimizations cpu cache hierarchy tlb etc additional processors particularly freescale 68000 coldfire supported mmu-less \u03bcclinux variant", + "neighbors": [ + 78, + 85, + 134, + 193, + 210, + 213, + 219, + 227, + 238, + 265, + 267, + 270, + 275, + 292, + 294, + 305, + 306, + 327, + 331, + 346, + 400, + 401, + 457, + 484, + 571, + 630, + 650, + 688, + 707, + 716, + 720, + 725, + 736, + 755, + 868, + 893, + 897, + 935, + 986, + 1002, + 1016, + 1060, + 1102, + 1105, + 1176, + 1197, + 1202, + 1208, + 1215, + 1241, + 1252, + 1278, + 1284, + 1313, + 1357, + 1360, + 1361, + 1391, + 1398, + 1415, + 1456, + 1468, + 1518, + 1524, + 1526, + 1558, + 1578, + 1602, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 572, + "label": 4, + "text": "Time-of-check_to_time-of-use:time-of-check time-of-use software development time-of-check time-of-use toctou tocttou toc/tou class software bugs caused race condition involving checking state part system security credential use results check simple example follows consider web application allows user edit pages also allows administrators lock pages prevent editing user requests edit page getting form used alter content user submits form administrator locks page prevent editing however since editing already begun user submits form edits already made accepted user began editing appropriate authorization checked user indeed allowed edit however authorization used later time edits longer allowed toctou race conditions common unix operations file system occur contexts including local sockets improper use database transactions early 1990s mail utility bsd 4.3 unix exploitable race condition temporary files used codice_1 function early versions openssh exploitable race condition unix domain sockets remain problem modern systems 2019 toctou race condition docker allows root access filesystem host platform unix following c code used codice_2 program toctou bug access intended check whether real user executed codice_2 program would normally allowed write file i.e. codice_4 checks real userid rather effective userid race condition vulnerable attack example attacker exploit race condition codice_5 codice_6 trick codice_2 victim overwriting entry system password database toctou races used privilege escalation get administrative access machine although sequence events requires precise timing possible attacker arrange conditions without much difficulty implication applications assume state managed operating system case file system namespace change system calls exploiting toctou race condition requires precise timing ensure attacker operations interleave properly victim example attacker must execute codice_8 system call precisely codice_5 codice_6 general attack attacker must scheduled execution operation victim also known single-stepping victim case bsd 4.3 mail utility mktemp attacker simply keep launching mail utility one process keep guessing temporary file names keep making symlinks another process attack usually succeed less one minute techniques single-stepping victim program include file system mazes algorithmic complexity attacks cases attacker manipulates os state control scheduling victim file system mazes force victim read directory entry os cache os puts victim sleep reading directory disk algorithmic complexity attacks force victim spend entire scheduling quantum inside single system call traversing kernel hash table cached file names attacker creates large number files names hash value file victim look despite conceptual simplicity toctou race conditions difficult avoid eliminate one general technique use exception handling instead checking philosophy eafp \u2013 easier ask forgiveness permission rather lbyl \u2013 look leap \u2013 case check failure assumptions hold detected use time exception context file system toctou race conditions fundamental challenge ensuring file system changed two system calls 2004 impossibility result published showing portable deterministic technique avoiding toctou race conditions since impossibility result libraries tracking file descriptors ensuring correctness proposed researchers alternative solution proposed research community unix systems adopt transactions file system os kernel transactions provide concurrency control abstraction os used prevent toctou races production unix kernel yet adopted transactions proof-of-concept research prototypes developed linux including valor file system txos kernel microsoft windows added transactions ntfs file system microsoft discourages use indicated may removed future version windows file locking common technique preventing race conditions single file extend file system namespace metadata locking work well networked filesystems prevent toctou race conditions setuid binaries possible solution use codice_11 system call change effective user perform codice_12 differences codice_13 operating systems problematic", + "neighbors": [ + 306, + 326, + 804, + 876, + 961 + ], + "mask": "Validation" + }, + { + "node_id": 573, + "label": 3, + "text": "Samantha_Fox_Strip_Poker:samantha fox strip poker samantha fox strip poker 1986 erotic video game developed software communications published martech games published commodore 64 amstrad cpc bbc micro msx zx spectrum game one first erotic video games include real human part theme erotic games players complete difficult tasks rewarded nudity video game programmed wolfgang smith graphics edited malcolm smith author music rob hubbard credited name john york music includes cover entertainer scott joplin stripper david rose players plays 5-card 7-card stud poker british model singer samantha fox beating results taking clothes topless zzap felt music well-suited style game commodore format magazine thought idea anybody using game way experience titillating content depressing due require effort player uvejuegos thought game prime example strange 1980s spiegel placed game within sub-genre early pixelated digi-ladies dubious beauty along artworx strip poker 1984", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 574, + "label": 2, + "text": "Windows_Desktop_Gadgets:windows desktop gadgets windows desktop gadgets called windows sidebar windows vista discontinued widget engine microsoft gadgets introduced windows vista features sidebar anchored side desktop widgets perform various tasks displaying time date windows vista widgets restricted sidebar windows 7 freely moved anywhere desktop windows desktop gadgets discontinued windows 8 windows 8 live tiles perform similar function visible start menu visible run restrictive environment making less risky also less useful purposes like system monitoring windows sidebar originated microsoft research project called sideshow confused windows sideshow developed summer 2000 used internally microsoft included clock traffic reports im integration windows sidebar appeared build 3683 windows vista circa september 2002 originally intended replace notification area quick launch toolbar windows plans scrapped development reset mid-2004 windows sidebar rebuilt began appear windows vista builds second half 2005 reviewers macintosh enthusiasts pointed sidebar similarities form function konfabulator yahoo widget engine appeared several years previously dashboard widget engine first included apple inc. mac os x v10.4 released months earlier windows 7 windows sidebar renamed windows desktop gadgets sidebar included windows 7 windows desktop gadgets included beta releases windows 8 make final release instead 10 july 2012 intervening time last beta windows 8 final release microsoft issued security advisory disable sidebar desktop gadgets windows vista 7 security vulnerability could allow remote code execution windows desktop gadgets feature windows vista windows 7 excluding windows server family operating system hosts mini-applications gadgets combination scripts html code use cases include displaying system time downloading displaying rss feeds controlling software windows media player windows vista gadgets run docked sidebar windows 7 float anywhere desktop also possible run multiple instances gadget simultaneously windows vista 7 sidebar also works windows xp windows vista ships eleven gadgets calendar clock contacts cpu meter currency conversion feed headlines notes picture puzzle slide show stocks weather several gadgets available vista beta app launcher feed viewer number puzzle recycle bin egg timer never made final release windows vista windows 7 adds media center gadget removes contacts notes stocks gadgets originally microsoft provided link web site called windows live gallery additional sidebar gadgets created third-party developers could downloaded site officially retired october 1 2011", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 354, + 433, + 435, + 485, + 521, + 558, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 575, + "label": 3, + "text": "Forward_compatibility:forward compatibility forward compatibility upward compatibility design characteristic allows system accept input intended later version concept applied entire systems electrical interfaces telecommunication signals data communication protocols file formats computer programming languages standard supports forward compatibility product complies earlier versions gracefully process input designed later versions standard ignoring new parts understand objective forward compatible technology old devices recognise data generated new devices forward compatibility older system usually means backward compatibility new system i.e ability process data old system new system usually full compatibility older one able process generate data format older system forward compatibility extensibility forward compatible design process least data future version extensible design makes upgrading easy example design ideas found web browsers point time current browser forward compatible gracefully accepts newer version html whereas easily browser code upgraded process newer html determines extensible introduction fm stereo transmission color television allowed forward compatibility since monophonic fm radio receivers black-and-white tv sets still could receive signal new transmitter also allowed backward compatibility since new receivers could receive monophonic black-and-white signals generated old transmitters html designed treat tags way inert unstyled inline elements unless appearance behavior overridden either browser default settings scripts styles included page makes new features degrade gracefully older browsers one case work intended script style blocks whose content meant interpreted browser instead part page cases dealt enclosing content within comment blocks products designed forward compatible referred nuc upwardly compatible cases might intentional designers form vendor lock-in software regression example cubicle producer considers changing cubicle design one designer promotes changing footprint 4 foot square 1.2 meter square immediately sales manager calls nuc problem understood footprint changes existing customers considering buying producer fit different sized unit office designed 4 foot square cubicle planned obsolescence type upward compatibility rather adopting policy backwards compatibility companies adopt commercial policy backwards incompatibility newer apps require newer devices", + "neighbors": [ + 34, + 326, + 948, + 1022 + ], + "mask": "Validation" + }, + { + "node_id": 576, + "label": 4, + "text": "Internet_security:internet security internet security branch computer security specifically related internet often involving browser security world wide web also network security applies applications operating systems whole objective establish rules measures use attacks internet internet represents insecure channel exchanging information leads high risk intrusion fraud phishing online viruses trojans worms many methods used protect transfer data including encryption from-the-ground-up engineering current focus prevention much real time protection well known new threats internet user tricked forced downloading software malicious intent onto computer software comes many forms viruses trojan horses spyware worms denial-of-service attack dos attack distributed denial-of-service attack ddos attack attempt make computer resource unavailable intended users another way understanding ddos seeing attacks cloud computing environment growing due essential characteristics cloud computing although means carry motives targets dos attack may vary generally consists concerted efforts prevent internet site service functioning efficiently temporarily indefinitely according businesses participated international business security survey 25 respondents experienced dos attack 2007 16.8 experienced one 2010 dos attacks often use bots botnet carry attack phishing attack targets online users extraction sensitive information username password credit card information phishing occurs attacker pretends trustworthy entity either via email web page victims directed fake web pages dressed look legitimate via spoof emails instant messenger/social media avenues often tactics email spoofing used make emails appear legitimate senders long complex subdomains hide real website host insurance group rsa said phishing accounted worldwide losses 10.8 billion 2016 applications used access internet resources may contain security vulnerabilities memory safety bugs flawed authentication checks severe bugs give network attackers full control computer security applications suites incapable adequate defense kinds attacks common widespread web-browser application vulnerability so-called cross-origin resource sharing vulnerability- maximum security privacy make sure adopt adequate countermeasures example patches provided webkit-based browsers tcp/ip protocols may secured cryptographic methods security protocols protocols include secure sockets layer ssl succeeded transport layer security tls web traffic pretty good privacy pgp email ipsec network layer security ipsec designed protect tcp/ip communication secure manner set security extensions developed internet task force ietf provides security authentication ip layer transforming data using encryption two main types transformation form basis ipsec authentication header ah esp two protocols provide data integrity data origin authentication anti-replay service protocols used alone combination provide desired set security services internet protocol ip layer basic components ipsec security architecture described terms following functionalities set security services provided ip layer includes access control data origin integrity protection replays confidentiality algorithm allows sets work independently without affecting parts implementation ipsec implementation operated host security gateway environment giving protection ip traffic multi-factor authentication mfa method computer access control user granted access successfully presenting several separate pieces evidence authentication mechanism \u2013 typically least two following categories knowledge something know possession something inherence something internet resources websites email may secured using multi-factor authentication online sites offer customers ability use six-digit code randomly changes every 30\u201360 seconds security token keys security token built mathematical computations manipulate numbers based current time built device means every thirty seconds certain array numbers possible would correct validate access online account website user logging would made aware device serial number would know computation correct time built device verify number given indeed one handful six-digit numbers works given 30-60 second cycle 30\u201360 seconds device present new random six-digit number log website email messages composed delivered stored multiple step process starts message composition user finishes composing message sends message transformed standard format rfc 2822 formatted message afterwards message transmitted using network connection mail client referred mail user agent mua connects mail transfer agent mta operating mail server mail client provides sender \u2019 identity server next using mail server commands client sends recipient list mail server client supplies message mail server receives processes message several events occur recipient server identification connection establishment message transmission using domain name system dns services sender \u2019 mail server determines mail server recipient server opens connection recipient mail server sends message employing process similar used originating client delivering message recipient pretty good privacy provides confidentiality encrypting messages transmitted data files stored using encryption algorithm triple des cast-128 email messages protected using cryptography various ways following first two methods message signing message body encryption often used together however encrypting transmissions mail servers typically used two organizations want protect emails regularly sent example organizations could establish virtual private network vpn encrypt communications mail servers internet unlike methods encrypt message body vpn encrypt entire messages including email header information senders recipients subjects cases organizations may need protect header information however vpn solution alone provide message signing mechanism provide protection email messages along entire route sender recipient mime transforms non-ascii data sender site network virtual terminal nvt ascii data delivers client simple mail transfer protocol smtp sent internet server smtp receiver side receives nvt ascii data delivers mime transformed back original non-ascii data message authentication code mac cryptography method uses secret key encrypt message method outputs mac value decrypted receiver using secret key used sender message authentication code protects message data integrity well authenticity computer firewall controls access networks generally consists gateways filters vary one firewall another firewalls also screen network traffic able block traffic dangerous firewalls act intermediate server smtp hypertext transfer protocol http connections firewalls impose restrictions incoming outgoing network packets private networks incoming outgoing traffic must pass firewall authorized traffic allowed pass firewalls create checkpoints internal private network public internet also known choke points borrowed identical military term combat limiting geographical feature firewalls create choke points based ip source tcp port number also serve platform ipsec using tunnel mode capability firewall used implement vpns firewalls also limit network exposure hiding internal network system information public internet packet filter first generation firewall processes network traffic packet-by-packet basis main job filter traffic remote ip host router needed connect internal network internet router known screening router screens packets leaving entering network stateful firewall circuit-level gateway proxy server operates network level open systems interconnection osi model statically defines traffic allowed circuit proxies forward network packets formatted unit data containing given port number port permitted algorithm main advantage proxy server ability provide network address translation nat hide user ip address internet effectively protecting internal information internet application-level firewall third generation firewall proxy server operates top osi model ip suite application level network packet forwarded connection established using known protocol application-level gateways notable analyzing entire messages rather individual packets data data sent received web browser statistics tend affect amount web browser exploited example internet explorer 6 used majority web browser market share considered extremely insecure vulnerabilities exploited due former popularity since browser choice evenly distributed internet explorer 28.5 firefox 18.4 google chrome 40.8 vulnerabilities exploited many different browsers antivirus software internet security programs protect programmable device attack detecting eliminating malware antivirus software mainly shareware early years internet several free security applications internet choose platforms password manager software application helps user store organize passwords password managers usually store passwords encrypted requiring user create master password single ideally strong password grants user access entire password database top bottom called security suites first offered sale 2003 mcafee contain suite firewalls anti-virus anti-spyware also offer theft protection portable storage device safety check private internet browsing cloud anti-spam file shredder make security-related decisions answering popup windows several free charge", + "neighbors": [ + 11, + 14, + 120, + 144, + 149, + 172, + 190, + 293, + 310, + 319, + 338, + 363, + 379, + 425, + 439, + 450, + 476, + 479, + 487, + 490, + 518, + 528, + 531, + 542, + 564, + 569, + 577, + 611, + 624, + 666, + 678, + 684, + 692, + 698, + 703, + 730, + 739, + 740, + 750, + 762, + 771, + 779, + 800, + 813, + 818, + 871, + 878, + 898, + 910, + 938, + 944, + 1036, + 1038, + 1039, + 1090, + 1112, + 1162, + 1200, + 1303, + 1309, + 1325, + 1350, + 1355, + 1358, + 1361, + 1365, + 1368, + 1379, + 1395, + 1406, + 1416, + 1444, + 1467, + 1472, + 1542, + 1543, + 1554, + 1585, + 1597 + ], + "mask": "Test" + }, + { + "node_id": 577, + "label": 4, + "text": "Goatse_Security:goatse security goatse security goatsec loose-knit nine-person grey hat hacker group specializes uncovering security flaws division anti-blogging internet trolling organization known gay nigger association america gnaa group derives name goatse.cx shock site chose gaping holes exposed slogan june 2010 goatse security obtained email addresses approximately 114,000 apple ipad users led fbi investigation filing criminal charges two group members gnaa several security researchers within membership according goatse security spokesperson leon kaiser gnaa could fully utilize talents since group believed would anyone would take security data published gnaa seriously order create medium gnaa members publish security findings gnaa created goatse security december 2009 order protect web browser inter-protocol exploitation mozilla blocked several ports html forms would normally access january 2010 gnaa discovered mozilla blocks cover port 6667 left mozilla browsers vulnerable cross-protocol scripts gnaa crafted javascript-based exploit order flood irc channels although efnet oftc able block attacks freenode struggled counteract attacks goatse security exposed vulnerability one members andrew auernheimer aka weev posted information exploit encyclopedia dramatica march 2010 goatse security discovered integer overflow vulnerability within apple web browser safari posted exploit encyclopedia dramatica found person could access blocked port adding 65,536 port number vulnerability also found arora icab omniweb stainless although apple fixed glitch desktop versions safari march company left glitch unfixed mobile versions browser goatse security claimed hacker could exploit mobile safari flaw order gain access cause harm apple ipad june 2010 goatse security uncovered vulnerability within website provider 3g service apple ipad united states time signing 3g service ipad retrieves icc-id ipad sim card associates email address provided sign-up order ease log-in process ipad website receives sim card icc-id pre-populates email address field address provided sign-up goatse security realized sending http request valid icc-id embedded inside website website would reveal email address associated icc-id june 5 2010 daniel spitler aka jacksonbrown began discussing vulnerability possible ways exploit including phishing irc channel goatse security constructed php-based brute force script would send http requests random icc-ids website legitimate icc-id entered would return email address corresponding icc-id script dubbed ipad 3g account slurper goatse security attempted find appropriate news source confide leaked information weev attempted contact news corporation thomson reuters executives including arthur siskind security problems june 6 2010 weev sent emails icc-ids recovered order verify claims chat logs period also reveal attention publicity may incentives group contrary first claimed group initially revealed security flaw gawker media notifying also exposed data 114,000 ipad users including celebrities government military tactics re-provoked significant debate proper disclosure security flaws weev maintained goatse security used common industry standard practices said tried good guys jennifer granick electronic frontier foundation also defended tactics used goatse security june 14 2010 michael arrington techcrunch awarded group crunchie award public service first time crunchie awarded outside annual crunchies award ceremony fbi opened investigation incident leading criminal complaint january 2011 raid andrew weev auernheimer house search related investigation auernheimer subsequently detained released bail state drug charges later dropped release bail broke gag order protest dispute legality search house denial access public defender also asked donations via paypal defray legal costs 2011 department justice announced charged one count conspiracy access computer without authorization one count fraud co-defendant daniel spitler released bail november 20 2012 auernheimer found guilty one count identity fraud one count conspiracy access computer without authorization tweeted would appeal ruling alex pilosov friend also present ruling tweeted auernheimer would remain free bail sentencing least 90 days november 29 2012 auernheimer authored article wired magazine entitled forget disclosure hackers keep security holes advocating disclosure zero-day exploit individuals use interests social justice april 11 2014 third circuit issued opinion vacating auernheimer conviction basis venue new jersey improper judges address substantive question legality site access released prison late april 11 may 2011 dos vulnerability affecting several linux distributions disclosed goatse security group discovered lengthy advanced packaging tool url would cause compiz crash september 2012 goatse security credited microsoft helping secure online services", + "neighbors": [ + 43, + 91, + 134, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 509, + 533, + 550, + 576, + 588, + 600, + 604, + 613, + 621, + 623, + 624, + 665, + 675, + 703, + 708, + 783, + 800, + 818, + 915, + 927, + 1043, + 1063, + 1088, + 1162, + 1186, + 1200, + 1235, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 578, + "label": 3, + "text": "Flash_Gordon_(video_game):flash gordon video game flash gordon video game based comic book character name game published 1986 mastertronic amstrad cpc commodore 64 zx spectrum msx personal computers zzap 64 praised commodore 64 version game reviewers appreciated gameplay variety offered three different sections game quality graphics sound rated 89 overall also 1982 game tie 1980 film released atari 2600 oct. 7 2015 mobile game also based film released infinite runner type game developed boluga limited featured three songs queen flash \u2019 theme vultan \u2019 theme football fight flash gordon also 1990 defenders earth video game enigma variations", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 579, + "label": 9, + "text": "Fortran:fortran fortran formerly fortran derived formula translation general-purpose compiled imperative programming language especially suited numeric computation scientific computing originally developed ibm 1950s scientific engineering applications fortran came dominate area programming early continuous use six decades computationally intensive areas numerical weather prediction finite element analysis computational fluid dynamics computational physics crystallography computational chemistry popular language high-performance computing used programs benchmark rank world fastest supercomputers fortran encompasses lineage versions evolved add extensions language usually retaining compatibility prior versions successive versions added support structured programming processing character-based data fortran 77 array programming modular programming generic programming fortran 90 high performance fortran fortran 95 object-oriented programming fortran 2003 concurrent programming fortran 2008 fortran design basis many programming languages among better known basic based fortran ii number syntax cleanups notably better logical structures changes work easily interactive environment names earlier versions language fortran 77 conventionally spelled all-capitals fortran 77 last version use lowercase letters keywords strictly non-standard capitalization dropped referring newer versions beginning fortran 90 official language standards refer language fortran rather all-caps fortran late 1953 john w. backus submitted proposal superiors ibm develop practical alternative assembly language programming ibm 704 mainframe computer backus historic fortran team consisted programmers richard goldberg sheldon f. best harlan herrick peter sheridan roy nutt robert nelson irving ziller harold stern lois haibt david sayre concepts included easier entry equations computer idea developed j. halcombe laning demonstrated laning zierler system 1952 programmers chess players chosen work ibm thought logical minds draft specification ibm mathematical formula translating system completed november 1954 first manual fortran appeared october 1956 first fortran compiler delivered april 1957 first optimizing compiler customers reluctant use high-level programming language unless compiler could generate code performance comparable hand-coded assembly language community skeptical new method could possibly outperform hand-coding reduced number programming statements necessary operate machine factor 20 quickly gained acceptance john backus said 1979 interview think ibm employee magazine much work come lazy n't like writing programs working ibm 701 writing programs computing missile trajectories started work programming system make easier write programs language widely adopted scientists writing numerically intensive programs encouraged compiler writers produce compilers could generate faster efficient code inclusion complex number data type language made fortran especially suited technical applications electrical engineering 1960 versions fortran available ibm 709 650 1620 7090 computers significantly increasing popularity fortran spurred competing computer manufacturers provide fortran compilers machines 1963 40 fortran compilers existed reasons fortran considered first widely used cross-platform programming language development fortran paralleled early evolution compiler technology many advances theory design compilers specifically motivated need generate efficient code fortran programs initial release fortran ibm 704 contained 32 statements including arithmetic statement reminiscent readily implementable three-way comparison instruction cas compare accumulator storage available 704 statement provided way compare numbers testing difference attendant risk overflow deficiency later overcome logical facilities introduced fortran iv statement used originally optionally give branch probabilities three branch cases arithmetic statement first fortran compiler used weighting perform compile time monte carlo simulation generated code results used optimize placement basic blocks memory sophisticated optimization time monte carlo technique documented backus et al paper original implementation fortran automatic coding system fundamental unit program basic block basic block stretch program one entry point one exit point purpose section 4 prepare section 5 table predecessors pred table enumerates basic blocks lists every basic block basic blocks immediate predecessor flow together absolute frequency basic block link table obtained running program monte-carlo fashion outcome conditional transfers arising if-type statements computed go determined random number generator suitably weighted according whatever frequency statements provided many years later statement effect code treated comment statement since compilers longer kind compile-time simulation similar fate befallen compiler hints several programming languages example c keyword first fortran compiler reported diagnostic information halting program error found outputting error code console code could looked programmer error messages table operator manual providing brief description problem later error handling subroutine handle users error division zero developed nasa incorporated giving users feedback line code error appeared development disk files text editors terminals programs often entered keypunch keyboard onto 80-column punched cards one line card resulting deck cards would fed card reader compiled punched card codes included lower-case letters many special characters special versions ibm 026 keypunch offered would correctly print re-purposed special characters used fortran reflecting punched card input practice fortran programs originally written fixed-column format first 72 columns read twelve 36-bit words letter c column 1 caused entire card treated comment ignored compiler otherwise columns card divided four fields columns 73 80 could therefore used identification information punching sequence number text could used re-order cards stack cards dropped though practice reserved stable production programs ibm 519 could used copy program deck add sequence numbers early compilers e.g. ibm 650 additional restrictions due limitations card readers keypunches could programmed tab column 7 skip column 72 later compilers relaxed fixed-format restrictions requirement eliminated fortran 90 standard within statement field whitespace characters blanks ignored outside text literal allowed omitting spaces tokens brevity including spaces within identifiers clarity example valid identifier equivalent 101010do101i=1,101 valid statement equivalent 10101 101 1 101 zero column 6 treated space 101010do101i=1.101 instead 10101 do101i 1.101 assignment 1.101 variable called do101i note slight visual difference comma period hollerith strings originally allowed format data statements prefixed character count letter h e.g. allowing blanks retained within character string miscounts problem ibm fortran ii appeared 1958 main enhancement support procedural programming allowing user-written subroutines functions returned values parameters passed reference common statement provided way subroutines access common global variables six new statements introduced next years fortran ii would also add support data types early fortran compilers supported recursion subroutines early computer architectures supported concept stack directly support subroutine calls return location often stored one fixed location adjacent subroutine code e.g ibm 1130 specific machine register ibm 360 et seq allows recursion stack maintained software return address stored stack call made restored call returns although specified fortran 77 many f77 compilers supported recursion option burroughs mainframes designed recursion built-in default became standard fortran 90 via new keyword recursive program heron formula reads data tape reel containing three 5-digit integers b c input type declarations available variables whose name starts j k l n fixed-point i.e integers otherwise floating-point since integers processed example names variables start letter name variable must start letter continue letters digits limit six characters fortran ii b c represent sides triangle plane geometry program execution end error code stop 1 otherwise output line printed showing input values b c followed computed area triangle floating-point number occupying ten spaces along line output showing 2 digits decimal point .2 f10.2 format statement label 601 c area triangle standard square root function c input tape reader unit 5 integer input c output line printer unit 6 real output c input error display error output code 1 job control listing c ia ib ic may negative zero c furthermore sum two sides triangle c must greater third side check c using heron formula calculate c area triangle ibm also developed fortran iii 1958 allowed inline assembly code among features however version never released product like 704 fortran fortran ii fortran iii included machine-dependent features made code written unportable machine machine early versions fortran provided vendors suffered disadvantage fortran provided ibm 1401 computer innovative 63-phase compiler ran entirely core memory 8000 six-bit characters compiler could run tape 2200-card deck used tape disk storage kept program memory loaded overlays gradually transformed place executable form described haines article reprinted edited editions anatomy compiler ibm manual fortran specifications operating procedures ibm 1401 executable form entirely machine language rather floating-point arithmetic sub-scripting input/output function references interpreted preceding ucsd pascal p-code two decades ibm later provided fortran iv compiler 1400 series computers starting 1961 result customer demands ibm began development fortran iv removed machine-dependent features fortran ii adding new features data type logical boolean expressions logical statement alternative arithmetic statement fortran iv eventually released 1962 first ibm 7030 stretch computer followed versions ibm 7090 ibm 7094 later ibm 1401 1966 1965 fortran iv supposed compliant standard developed american standards association x3.4.3 fortran working group 1966 1968 ibm offered several fortran iv compilers system/360 named letters indicated minimum amount memory complier needed run letters f g h matched codes used system/360 model numbers indicate memory size letter increment factor two larger time fortran iv started become important educational tool implementations university waterloo watfor watfiv created simplify complex compile link processes earlier compilers perhaps significant development early history fortran decision american standards association american national standards institute ansi form committee sponsored bema business equipment manufacturers association develop american standard fortran resulting two standards approved march 1966 defined two languages fortran based fortran iv served de facto standard basic fortran based fortran ii stripped machine-dependent features fortran defined first standard officially denoted x3.9-1966 became known fortran 66 although many continued term fortran iv language standard largely based fortran 66 effectively became first industry-standard version fortran fortran 66 included release fortran 66 standard compiler vendors introduced several extensions standard fortran prompting ansi committee x3j3 1969 begin work revising 1966 standard sponsorship cbema computer business equipment manufacturers association formerly bema final drafts revised standard circulated 1977 leading formal approval new fortran standard april 1978 new standard called fortran 77 officially denoted x3.9-1978 added number significant features address many shortcomings fortran 66 revision standard number features removed altered manner might invalidate formerly standard-conforming programs removal allowable alternative x3j3 time since concept deprecation yet available ansi standards 24 items conflict list see appendix a2 x3.9-1978 addressed loopholes pathological cases permitted prior standard rarely used small number specific capabilities deliberately removed dimension 10,5 control data corporation computers another version fortran 77 called minnesota fortran mnf designed especially student use variations output constructs special uses commons data statements optimizations code levels compiling detailed error listings extensive warning messages debugs development revised standard succeed fortran 77 would repeatedly delayed standardization process struggled keep rapid changes computing programming practice meantime standard fortran nearly fifteen years fortran 77 would become historically important dialect important practical extension fortran 77 release mil-std-1753 1978 specification developed u.s. department defense standardized number features implemented fortran 77 compilers included ansi fortran 77 standard features would eventually incorporated fortran 90 standard ieee 1003.9 posix standard released 1991 provided simple means fortran 77 programmers issue posix system calls 100 calls defined document allowing access posix-compatible process control signal handling file system control device control procedure pointing stream i/o portable manner much-delayed successor fortran 77 informally known fortran 90 prior fortran 8x finally released iso/iec standard 1539:1991 1991 ansi standard 1992 addition changing official spelling fortran fortran major revision added many new features reflect significant changes programming practice evolved since 1978 standard unlike prior revision fortran 90 removed features appendix b.1 says list deleted features standard empty standard-conforming fortran 77 program also standard-conforming fortran 90 either standard usable define behavior small set features identified obsolescent expected removed future standard functionalities early version features performed new fortran 95 features kept simplify porting old programs may eventually deleted fortran 95 published officially iso/iec 1539-1:1997 minor revision mostly resolve outstanding issues fortran 90 standard nevertheless fortran 95 also added number extensions notably high performance fortran specification number intrinsic functions extended example argument added intrinsic several features noted fortran 90 obsolescent removed fortran 95 important supplement fortran 95 iso technical report tr-15581 enhanced data type facilities informally known allocatable tr specification defined enhanced use arrays prior availability fully fortran 2003-compliant fortran compilers uses include arrays derived type components procedure dummy argument lists function return values arrays preferable -based arrays arrays guaranteed fortran 95 deallocated automatically go scope eliminating possibility memory leakage addition elements allocatable arrays contiguous aliasing issue optimization array references allowing compilers generate faster code case pointers another important supplement fortran 95 iso technical report tr-15580 floating-point exception handling informally known ieee tr specification defined support ieee floating-point arithmetic floating point exception handling addition mandatory base language defined iso/iec 1539-1 1997 fortran 95 language also includes two optional modules together compose multi-part international standard iso/iec 1539 according standards developers optional parts describe self-contained features requested substantial body users and/or implementors deemed sufficient generality required standard-conforming fortran compilers nevertheless standard-conforming fortran provide options must provided accordance description facilities appropriate part standard fortran 2003 officially published iso/iec 1539-1:2004 major revision introducing many new features comprehensive summary new features fortran 2003 available fortran working group iso/iec jtc1/sc22/wg5 official web site article major enhancements revision include important supplement fortran 2003 iso technical report tr-19767 enhanced module facilities fortran report provided sub-modules make fortran modules similar modula-2 modules similar ada private child sub-units allows specification implementation module expressed separate program units improves packaging large libraries allows preservation trade secrets publishing definitive interfaces prevents compilation cascades iso/iec 1539-1:2010 informally known fortran 2008 approved september 2010 fortran 95 minor upgrade incorporating clarifications corrections fortran 2003 well introducing select new capabilities new capabilities include final draft international standard fdis available document n1830 important supplement fortran 2008 iso technical specification ts 29113 interoperability fortran c submitted iso may 2012 approval specification adds support accessing array descriptor c allows ignoring type rank arguments latest revision language fortran 2018 earlier referred fortran 2015 significant revision released november 28 2018 fortran 2018 incorporates two previously published technical specifications additional changes new features include support iso/iec/ieee 60559:2011 latest version ieee floating point standard 2019 hexadecimal input/output implicit none enhancements changes although 1968 journal article authors basic already described fortran old-fashioned fortran use several decades vast body fortran software daily use throughout scientific engineering communities jay pasachoff wrote 1984 physics astronomy students simply learn fortran much exists fortran seems unlikely scientists change pascal modula-2 whatever 1993 cecil e. leith called fortran mother tongue scientific computing adding replacement possible language may remain forlorn hope primary language intensive super-computing tasks astronomy climate modeling computational chemistry computational economics computational fluid dynamics computational physics data analysis hydrological modeling numerical linear algebra numerical libraries lapack imsl nag optimization satellite simulation structural engineering weather prediction many floating-point benchmarks gauge performance new computer processors cfp2006 floating-point component spec cpu2006 benchmarks written fortran apart modern codes computational science generally use large program libraries metis graph partitioning petsc trilinos linear algebra capabilities dune fenics mesh finite element support generic libraries since early 2000s many widely used support libraries also implemented c recently c++ hand high-level languages matlab python r become popular particular areas computational science consequently growing fraction scientific programs also written higher-level languages reason facilities inter-operation c added fortran 2003 enhanced iso/iec technical specification 29113 incorporated fortran 2018 shift popularity programming languages also evident selection applications spec cpu 2000 spec cpu 2006 floating point benchmarks software nasa probes voyager 1 voyager 2 originally written fortran 5 later ported fortran 77. software still written fortran ported c. precise characteristics syntax fortran 95 discussed fortran 95 language features portability problem early days agreed upon standard even ibm reference manual computer companies vied differentiate offerings others providing incompatible features standards improved portability 1966 standard provided reference syntax semantics vendors continued provide incompatible extensions although careful programmers coming realize use incompatible extensions caused expensive portability problems therefore using programs pfort verifier 1977 standard national bureau standards nist published fips pub 69 processors purchased u.s. government required diagnose extensions standard rather offer two processors essentially every compiler eventually least option diagnose extensions incompatible extensions portability problem numerical calculations important take account characteristics arithmetic addressed fox et al context 1966 standard port library ideas therein became widely used eventually incorporated 1990 standard way intrinsic inquiry functions widespread almost universal adoption ieee 754 standard binary floating-point arithmetic essentially removed problem access computing environment e.g. program command line environment variables textual explanation error conditions remained problem addressed 2003 standard large collections library software could described loosely related engineering scientific calculations graphics libraries written c therefore access presented portability problem addressed incorporation c interoperability 2003 standard possible relatively easy write entirely portable program fortran even without recourse preprocessor fortran 5 marketed data general corp late 1970s early 1980s nova eclipse mv line computers optimizing compiler quite good minicomputers time language closely resembles fortran 66 name pun earlier fortran iv fortran v distributed control data corporation 1968 cdc 6600 series language based upon fortran iv univac also offered compiler 1100 series known fortran v. spinoff univac fortran v athena fortran fortran 6 visual fortran 2001 licensed compaq microsoft licensed compaq visual fortran provided visual studio 5 environment interface compaq v6 v6.1 vendors high-performance scientific computers e.g. burroughs control data corporation cdc cray honeywell ibm texas instruments univac added extensions fortran take advantage special hardware features instruction cache cpu pipelines vector arrays example one ibm fortran compilers h extended iup level optimization reordered machine code instructions keep multiple internal arithmetic units busy simultaneously another example cfd special variant fortran designed specifically illiac iv supercomputer running nasa ames research center ibm research labs also developed extended fortran-based language called vectran processing vectors matrices object-oriented fortran object-oriented extension fortran data items grouped objects instantiated executed parallel available sun iris ipsc ncube longer supported machine-specific extensions either disappeared time elements incorporated main standards major remaining extension openmp cross-platform extension shared memory programming one new extension coarray fortran intended support parallel programming transit name reduced version ibm 704 fortran language implemented ibm 650 using translator program developed carnegie late 1950s following comment appears ibm reference manual transit automatic coding system c28-4038 copyright 1957 1959 ibm fortran system designed complex machine 650 consequently 32 statements found fortran programmer reference manual acceptable transit system addition certain restrictions fortran language added however none restrictions make source program written transit incompatible fortran system 704 permissible statements ten subroutines could used one program transit statements limited columns 7 56 punched cards used input output ibm 650 three passes required translate source code language compile statements soap assembly language finally produce object program could loaded machine run program using punched cards data input outputting results onto punched cards two versions existed 650s 2000 word memory drum transit transit ii latter machines equipped indexing registers automatic floating point decimal bi-quinary arithmetic appendix manual included wiring diagrams ibm 533 card reader/punch control panel prior fortran 77 number preprocessors commonly used provide friendlier language advantage preprocessed code could compiled machine standard fortran compiler preprocessors would typically support structured programming variable names longer six characters additional data types conditional compilation even macro capabilities popular preprocessors included flecs iftran mortran sftran s-fortran ratfor ratfiv ratfor ratfiv example implemented c-like language outputting preprocessed code standard fortran 66 despite advances fortran language preprocessors continue used conditional compilation macro substitution one earliest versions fortran introduced '60s popularly used colleges universities developed supported distributed university waterloo watfor based largely fortran iv student using watfor could submit batch fortran job syntax errors program would move straight execution simplification allowed students concentrate program syntax semantics execution logic flow rather dealing submission job control language jcl compile/link-edit/execution successive process es complexities mainframe/minicomputer environment side simplified environment watfor good choice programmers needing expanded abilities host processor e.g. watfor typically limited access i/o devices watfor succeeded watfiv later versions lrltran developed lawrence radiation laboratory provide support vector arithmetic dynamic storage among extensions support systems programming distribution included ltss operating system fortran-95 standard includes optional part 3 defines optional conditional compilation capability capability often referred coco many fortran compilers integrated subsets c preprocessor systems simscript application specific fortran preprocessor modeling simulating large discrete systems f programming language designed clean subset fortran 95 attempted remove redundant unstructured deprecated features fortran statement f retains array features added fortran 90 removes control statements made obsolete structured programming constructs added fortran 77 fortran 90 f described creators compiled structured array programming language especially well suited education scientific computing lahey fujitsu teamed create fortran microsoft .net framework silverfrost ftn95 also capable creating .net code following program illustrates dynamic memory allocation array-based operations two features introduced fortran 90 particularly noteworthy absence loops statements manipulating array mathematical operations applied array whole also apparent use descriptive variable names general code formatting conform contemporary programming style example computes average data entered interactively program average end program average fortran standards committee meeting name fortran 77 chosen satirical technical proposal incorporated official distribution bearing title letter considered harmful proposal purported address confusion sometimes arises letter numeral zero eliminating letter allowable variable names however method proposed eliminate letter character set entirely thereby retaining 48 number lexical characters colon increased 49 considered beneficial would promote structured programming making impossible use notorious statement troublesome statements would also eliminated noted might invalidate existing programs probably non-conforming anyway assumed-length arrays added dispute appropriate character separate upper lower bounds comment examining arguments dr. walt brainerd penned article entitled astronomy vs. gastroenterology proponents suggested using star asterisk others favored colon fortran 77 earlier versions variable names beginning letters i\u2013n default type integer variables starting letters defaulted real although programmers could override defaults explicit declaration led joke fortran god real unless declared integer", + "neighbors": [ + 31, + 65, + 78, + 117, + 134, + 152, + 176, + 187, + 216, + 227, + 246, + 251, + 292, + 300, + 306, + 362, + 369, + 373, + 374, + 386, + 388, + 509, + 521, + 538, + 567, + 594, + 597, + 682, + 690, + 730, + 753, + 766, + 789, + 790, + 796, + 806, + 820, + 824, + 825, + 873, + 893, + 901, + 919, + 946, + 948, + 998, + 1005, + 1006, + 1009, + 1028, + 1044, + 1059, + 1110, + 1120, + 1152, + 1217, + 1220, + 1221, + 1225, + 1227, + 1234, + 1235, + 1311, + 1319, + 1324, + 1388, + 1418, + 1430, + 1437, + 1457, + 1507, + 1518, + 1532, + 1572, + 1609, + 1626, + 1632, + 1633, + 1636 + ], + "mask": "Validation" + }, + { + "node_id": 580, + "label": 5, + "text": "Veronica_(search_engine):veronica search engine veronica search engine system gopher protocol released november 1992 steven foster fred barrie university nevada reno existence veronica constantly updated database names almost every menu item thousands gopher servers veronica database could searched major gopher menus although original veronica database longer accessible various local veronica installations least one complete rewrite veronica-2 still exist search engine named character veronica lodge archie comics intentional analogy naming archie search engine search engine ftp servers backronym veronica easy rodent-oriented net-wide index computer archives", + "neighbors": [ + 83, + 107, + 452, + 623, + 668, + 713, + 886, + 939, + 1132, + 1210, + 1376, + 1423, + 1424, + 1528, + 1550 + ], + "mask": "Test" + }, + { + "node_id": 581, + "label": 4, + "text": "Prefix_WhoIs:prefix whois prefix whois open source project develops operates free whois-compatible framework stockpiling querying various routing registry information prefix whois uses global bgp routing data learned many isp backbone routers information sources also supported imported data every regional internet registry afrinic apnic arin lacnic ripe geocoding information project mentioned number popular network security network engineering books articles many public servers around world operate mirrors prefix whois making information generally available worldwide service may used client using standard whois protocol dns address whois.pwhois.org resolves prefix whois server nearest client based anycast dns several client software packages available prefix whois commercial vendors include free open source utilities whob layer four traceroute prefix whois project distributes c php libraries direct access prefix whois servers http simplequery interface also available software made available custom license", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 582, + "label": 5, + "text": "Vivaldi_(web_browser):vivaldi web browser vivaldi freeware cross-platform web browser developed vivaldi technologies company founded opera software co-founder former ceo jon stephenson von tetzchner tatsuki tomita officially launched april 6 2016 although intended general users first foremost targeted towards technically-inclined users well former opera users disgruntled transition presto layout engine chromium-based browser resulted loss many iconic features despite also chromium-based vivaldi aims revive features presto-based opera proprietary modifications march 2019 vivaldi 1.2 million active monthly users vivaldi began virtual community website replaced opera shut opera software march 2014 jon stephenson von tetzchner angered decision believed community helped make opera web browser tetzchner launched vivaldi community\u2014a virtual community focused providing registered users discussion forum blogging service numerous practical web services\u2014to make opera closure later january 27 2015 vivaldi technologies launched\u2014with community mind\u2014the first technical preview vivaldi web browser name comes italian composer antonio vivaldi according one creators easy name remembered understood worldwide vivaldi minimalistic user interface basic icons fonts color scheme changes based background design web page visited browser also allows users customize appearance ui elements background color overall theme address bar tab positioning start pages according ceo jon von tetzchner vivaldi vast unique customizability huge part browser caters experienced users vivaldi features ability stack tile tabs annotate web pages add notes bookmarks furthermore users place digital bookmarks speed dial page quick access harness quick commands search bookmarks browsing history open tabs settings vivaldi built around based web technologies html5 node.js react.js numerous npm modules technical preview 4 vivaldi also supports numerous mouse gestures actions like tab switching keyboard activation vivaldi also set chromeless ui gives users screen real-estate ability focus single page without distractions accommodate users prefer use large number tabs time vivaldi supports hibernation individual tabs tab stacks freeing resources user actively use tabs chromium-based browser vivaldi use many browser extensions developed google chrome users install directly chrome web store work properly vivaldi exception user interface customizations vivaldi interface quite different chrome company hopes integrate email client m3 future version vivaldi developers planning release extension platform vivaldi statcounter estimates vivaldi 0.05 market share desktop browsers december 2018 ars technica reviewer scott gilbertson wrote version 1.0 april 2016 praised innovative features tab handling noting likely remain niche browser see widespread uptake october 2018 gilbertson gave version 2.0 positive review stated vivaldi usual browser would hard put go back browser without unique features", + "neighbors": [ + 14, + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 436, + 491, + 509, + 530, + 531, + 623, + 627, + 646, + 668, + 684, + 713, + 734, + 796, + 862, + 886, + 939, + 953, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1339, + 1371, + 1376, + 1378, + 1408, + 1416, + 1423, + 1528, + 1550, + 1563, + 1569, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 583, + "label": 2, + "text": "Usage_share_of_operating_systems:usage share operating systems usage share operating systems percentage computing devices run operating system particular time figures necessarily estimates data operating system share difficult obtain reliable primary sources agreed methodologies collection personal computing platform area smartphones watches google android dominates 2.5 billion users mobile phone operating systems include apple ios kaios series 30+ area desktop laptop computers microsoft windows generally 70 markets 78 globally apple macos around 14 google chromeos 3 north america linux around 2 figures vary somewhat different markets depending gathered android battling windows used rank often popular past global scale ios never managed close half popularity windows however mobile operating systems android plus ios majority use non-mobile windows e.g macos close two years mostly android continues popular windows still countries continents mobile devices never anywhere near popular continents countries become mobile-majority still including ireland ios alone popular windows later android alone europe populous countries populous continent asia whole e.g china india excluding e.g russia still mobile-majority 56.37 public internet servers linux generally counted dominant powering twice number hosts windows server trailed many smaller players including traditional mainframe oses supercomputer field completely dominated linux 100 top500 running os according gartner following worldwide device shipments referring wholesale operating system includes smartphones tablets laptops pcs together shipments stores mean sales consumers necessarily year shipment therefore suggesting numbers indicate popularity and/or usage could misleading smartphones sell higher numbers traditional pcs also whole lot dollar value gap projected widen well double 2015 earlier gartner reports year worldwide pc shipments declined fourth consecutive year started 2012 launch tablets 8 decline pc sales 2015 including cumulative decline sales previous years gartner includes macs running macos pc sales numbers e.g ipads androids individually slight increase sales 2015 28 may 2015 google announced 1.4 billion android users 1 billion google play users active month changed 2 billion monthly active users may 2017 27 january 2016 paul thurrott summarized operating system market day apple announced one billion devices microsoft backed away goal one billion windows 10 devices three years middle 2018 reported 26 september 2016 windows 10 running 400 million devices march 2019 800 million late 2016 android e.g samsung smartphones explained killing apple ios market share i.e declining sales smartphones relatively also number units whole market increasing 9 may 2019 biggest smartphone companies market share samsung huawei apple respectively gartner press release said apple continued downward trend decline 7.7 percent second quarter 2016 decline based absolute number units underestimates relative decline market increasing along misleading 1.7 percent point decline point decline means 11.6 relative decline 14.6 12.9 although units sold apple declining almost vendor making profit smartphone sector hardware sales alone q3 2016 example captured 103.6 market profits mobile phone owners toothbrush owners mobile phones fastest growing technology history billion active mobile phones world people many 10 billion sold far less half still use explained fact people one extra work phones operating system fraction smartphones os capable running modern applications currently 3.1 billion smartphones tablets use across world tablets small fraction total generally running operating systems android ios latter popular tablets 2019 announced variant ios called ipados specifically ipad tablets development 2015 emarketer estimated beginning year tablet installed base would hit one billion first time china use 328 million google play n't serve track usa use second 156 million end year cheap tablets counted analysts goal met even excluding cumulative sales previous years conflicts statistics idc say tablet market contracted 10 2015 huawei ranked fifth big gains doubling share fourth quarter 2015 five biggest vendors except amazon fire tablets ranked third worldwide new list enabled quite tripling market share 7.9 fire os android-derivative recent data various sources published last twelve months summarized table sources monitor substantial number web sites statistics related one web site excluded android currently ranks highest windows incl xbox console systems every day week ios competes windows sweden depending day ios used ios windows 10 competing 13 windows mobile systems i.e windows phone accounts 0.51 web usage weekends ios alone topped windows us ios n't popular independent country guam unincorporated territory united states three consecutive quarters ios also highest ranked falkland islands british overseas territory one quarter plus one month overtaken android following quarter unknown strangely high countries madagascar 32.44 may due fact statcounter uses browser detection get os statistics common browsers often used version breakdown browsers madagascar shows 34.9 opera mini 4.4 popular known browser 22.1 plus e.g 3.34 opera 7.6 however browser statistics without version-breakdown opera 48.11 category small china android highest ranked operating system since january 2016 windows occasionally topped since asian continent whole android ranked highest since february 2016 android alone majority share large majority populous countries continent 84 bangladesh since august 2015 android ranked first 48.36 may 2016 african continent took big jump ahead windows 7 thereby africa joined asia mobile-majority continent china longer desktop-majority country joining india mobile-majority 71 confirming asia significant mobile-majority online usage linux kernel derivatives google systems gnu/linux exceeds windows true since time january april 2016 according w3counter statcounter however even figure unix-like oses including apple higher windows windows still dominant desktop os dominance varies region gradually lost market share desktop operating systems mobile slide noticeable us macos usage tripled 2009 2017 windows 72.76 chrome os 3.33 plus traditional linux 1.46 little openly published information device shipments desktop laptop computers gartner publishes estimates way estimates calculated openly published another source market share various operating systems statcounter basing estimate web use although may accurate also sales may overstate usage computers sold pre-installed operating system users replacing os different one due personal preference installing another os alongside using conversely sales underestimate usage counting unauthorized copies example 2009 approximately 80 software sold china comprised illegitimate copies 2007 statistics automated update ie7 registered windows computers differed observed web browser share leading one writer estimate 25\u201335 windows xp installations unlicensed usage share microsoft latest client operating system windows 10 slowly increasing since july/august 2016 windows 7 slight decrease time reaching around 27.15 december 2016 web analysis shows significant variation different parts world example north america usage windows xp dropped 2.06 africa still 11.02 asia 6.63 even higher china 18.21 tied windows 10 second going overtaken windows 10 conversely macos north america claims 16.82 17.52 us whereas asia 4.4 2019 stack overflow developer survey provides detail particular versions windows desktop operating system share among identifying professional developers june 2016 microsoft claimed windows 10 half market share windows installations usa uk quoted betanews digital video game distribution platform steam publishes monthly hardware software survey statistics q1 2018 mobile operating systems smartphones included google dominant android variants apple ios combined almost 100 market share smartphone penetration vs. desktop use differs substantially country countries like russia still smartphone use low 19 western countries smartphone use close 50 smartphone usage share developing countries much higher bangladesh example android smartphones 84 share mali smartphones 90 95 share year section information regional trends move smartphones clear correlation gdp per capita country country respective smartphone os market share richest countries much likely choose apple iphone google android predominant elsewhere tablet computers simply tablets became significant os market share category starting apple ipad q1 2018 ios 65.03 market share android 34.58 market share windows tablets may get classified analysts thus barely register e.g 2-in-1 pcs may get classified desktops tablets since 2016 south america cuba north america android tablets gained majority asia 2017 android slightly popular ipad 49.05 usage share october 2015 africa android tablets much popular elsewhere ipad safe margin android made steady gains becoming popular tablet operating system trend many countries already gained majority large countries india 63.25 indonesia 62.22 african continent android 62.22 first gain android majority late 2014 steady gains 20.98 august 2012 egypt 62.37 zimbabwe 62.04 south america 51.09 july 2015 peru 52.96 asia 46 nepal android gained majority lead november 2014 lost 41.35 ios 56.51 taiwan october 2016 android gained confident majority losing streak china major exception android gaining market share asia android phablets much popular android tablets similar devices get classified smartphones ipad/ios 82.84 march 2015 according statcounter web use statistics proxy use smartphones popular desktop computers globally android particular popular windows although desktop computers still popular many countries overall 44.9 first quarter 2017 smartphones popular even many developed countries countries continents desktop-minority android popular windows many e.g poland europe half countries south america many north america e.g guatemala honduras haiti countries asia africa smartphone-majority android poland turkey europe highest 57.68 62.33 respectively ireland smartphone use 45.55 outnumbers desktop use mobile whole gains majority including tablet share 9.12 spain also slightly desktop-minority july 2019 sweden desktop-minority eight weeks row range measured mobile web use varies lot country statcounter press release recognizes india amongst world leaders use mobile surf internet big countries share around 80 desktop 19.56 russia trailing 17.8 mobile use desktop rest smartphones discounting tablets first gained majority december 2016 desktop-majority lost month n't christmas-time fluke close majority smartphone majority happened march 2017 week 7\u201313 november 2016 smartphones alone without tablets overtook desktop first time albeit short period examples mobile-majority countries include paraguay south america poland europe turkey asia africa world still desktop-majority example united states 54.89 days however territories united states puerto rico desktop significantly majority windows 30 overtaken android 22 october 2016 subsequent weekends mobile showed majority since 27 october desktop n't majority including weekdays smartphones alone showed majority since 23 december end year share topping 58.22 christmas day mobile -majority share smartphones tablets could added giving 63.22 majority unusually high top similar high also occurred monday 17 april 2017 smartphone share slightly lower tablet share slightly higher combining 62.88 formerly according statcounter press release world turned desktop-minority 49 desktop use month mobile n't ranked higher tablet share added exceed desktop share christmas season i.e temporarily desktop-minority remains smartphone-majority weekends last two weeks december 2016 australia oceania general desktop-minority first time extended period i.e every day 23 december south america smartphones alone took majority desktops christmas day full-week-average desktop still least 58 uk desktop-minority dropped 44.02 christmas day eight days end year ireland joined european countries smartphone-majority three days christmas topping day 55.39 us desktop-minority happened three days around christmas longer four-day stretch happened november happens frequently weekends according statcounter web use statistics proxy use week 7\u201313 november 2016 mobile meaning smartphones alone without tablets overtook desktop first time highest ranked 52.13 27 november 2016 49.02 full week mobile-majority applies countries paraguay south america poland europe turkey continents asia africa large regions rest world still desktop-majority days united states north america whole n't us desktop-minority four days row five-day average examples desktop-minority days include uk ireland australia oceania whole fact least one country every continent turned desktop-minority least month 22 october 2016 subsequent weekends mobile shown majority previously according statcounter press release world turned desktop-minority 49 desktop use month desktop-minority stretching 18-weeks/4-months period 28 june 31 october 2016 whole july august september 2016 showed desktop-majority many long sub-periods long stretch showed desktop-minority similarly fridays saturdays sundays desktop-minority biggest continents asia africa shown vast mobile-majority long time day week well several individual countries elsewhere also turned mobile-majority poland albania turkey europe paraguay bolivia south america according statcounter web use statistics saturday 28 may 2016 day smartphones mobile statcounter counts tablets separately became used platform ranking first 47.27 desktops next day desktops slightly outnumbered mobile unless counting tablets analysts count tablets smartphones separately others desktops even tablets ipad android windows devices since sunday 27 march 2016 first day world dipped desktop-minority happened almost every week week 11\u201317 july 2016 world desktop-minority followed next week thereon also three-week period trend still stronger weekends e.g 17 july 2016 showed desktop 44.67 mobile 49.5 plus tablets 5.7 recent weekly data shows downward trend desktops according statcounter web use statistics proxy overall use weekends desktops worldwide lose 5 percent points e.g 51.46 15 august 2015 loss relative web use going mobile also minuscule increase tablets mostly windows 7 ranked 1st workdays declines web use shifting android lesser degree ios two continents already crossed mobile-majority android based statcounters web use statistics june 2015 asia became first continent mobile overtook desktop followed africa august nigeria mobile majority october 2011 symbian later 51 share series 40 dominating followed android dominating operating system far back october 2014 reported trend large scale press release mobile usage already overtaken desktop several countries including india south africa saudi arabia india desktop went majority july 2012 32 bangladesh desktop went majority may 2013 17 android alone accounting majority web use african countries still desktop-majority many large mobile majority including ethiopia kenya mobile usage 72 popularity mobile use worldwide driven huge popularity increase android asian countries android highest ranked operating system statistically virtually every south-east asian country also ranks popular almost every african country poland desktop-minority since april 2015 android vastly popular european countries albania turkey also crossed south america continent somewhat far losing desktop-majority paraguay lost android mobile browsing general also become hugely popular continents desktop large desktop base trend mobile clear fraction total web use analysts count tablets desktops run windows others count mobile phones vast majority tablets run so-called mobile operating system android operating system |android ios ipad ipad clear lead globally clearly lost majority android south america number eastern european countries poland lost virtually african countries lost majority twice asia gained majority back many individual countries e.g india middle east clear android majority tablets android tablets thus second popular ipad march 2015 first time us number mobile-only adult internet users exceeded number desktop-only internet users 11.6 digital population using mobile compared 10.6 using desktop also means majority 78 use desktop mobile access internet smaller countries north america haiti android gone mobile majority mobile went 72.35 64.43 february 2016 region largest android usage also largest mobile revenue file rack001.jpg|thumb| server computing |servers colocation centre |upright|right server computing |internet based servers market share measured statistical surveys publicly accessible servers web server mail server dns server internet operating systems powering servers found inspecting raw response messages method gives insight market share operating systems publicly accessible internet differences result depending sample done observations weighted usually surveys based random sample ip numbers domain names hosts organisations servers found method additionally many domains ip numbers may served one host domains may served several hosts one host several ip numbers file ibm system z10.jpg|thumb|upright|right|ibm ibm system z10|system z10 common operating system mainframes ibm z/os operating systems ibm system z generation hardware include ibm proprietary z/os linux z systems transaction processing facility|z/tpf vse operating system |z/vse z/vm gartner reported 23 december 2008 linux system z used approximately 28 customer z base expected increase 50 following five years linux system z red hat micro focus compete sell red hat enterprise linux|rhel suse linux enterprise server|sles respectively file operating systems used top 500 supercomputers.svg|thumb|upright=1.8|supercomputer os family 1993\u20132019 systems share according top500 field supercomputers always dominated unix unix-like operating systems linux predominating since 2017 top 500 fastest supercomputers run linux top500 project lists ranks 500 fastest supercomputer benchmark results submitted june 2017 two aix computers held rank 493 494 last non-linux systems dropped list last non-linux fastest supercomputer asci white also running aix held title november 2000 november 2001 decommissioned 2006 historically kinds unix operating systems dominated end ultimately linux remains category operating systems|*usage share operating systems category usage share|operating systems", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 162, + 170, + 171, + 185, + 187, + 227, + 265, + 322, + 337, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 509, + 527, + 622, + 647, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 891, + 927, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1087, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 584, + "label": 0, + "text": "Russell_Gray:russell gray russell david gray evolutionary biologist psychologist working applying quantitative methods study cultural evolution human prehistory worked professor university auckland located new zealand although originally trained biology psychology gray become well known studies evolution austronesian language family using computational phylogenetic methods gray also performs research animal cognition one main research-projects studies tool-use among new caledonian crows summer 2014 max planck society announced max planck institute economics jena germany would receive new different mandate along johannes krause gray appointed director new max planck institute science human history commencing february 1 2014", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 585, + "label": 4, + "text": "Genieo:genieo genieo innovation israeli company specializing unwanted software includes advertising user tracking software commonly referred potentially unwanted program adware privacy-invasive software grayware malware best known genieo application type also operate installmac distributes additional 'optional search modifying software applications 2014 genieo innovation acquired 34 million somoto another company bundles legitimate applications offers additional third party applications may unwanted user sector israeli software industry frequently referred download valley genieo innovation founded april 2008 sol tzvi jacob tenenboem first version genieo released september 2009 beta version launched demo2010 conference march 2010 genieo website suspected changed name inkeepr software installs onto computers makes almost impossible users remove hijacks user browser tracks browser usage intention mining information users complain acts like virus need run special programs remove genieo listed malware apple inc. xprotect anti-malware service built macintosh computers running mac os x snow leopard later may 2013 malicious installer distributed genieo partner softonic found security software company intego installer masquerades necessary update adobe flash player attempts install genieo.app without user interaction dynamic libraries added safari browser intercept searches intended bing google versions genieo mac also offered 'codecs required video playback testing carried genieo mac june 2013 found left active software behind using supplied uninstaller required detailed manual removal november 2013 another fake application installer reported include genieo adware january 2014 sophos added genieo mac threat list category viruses spyware trojan horse computing adware november 2014 genieo mac flagged intego mentioned according analysis virustotal 25 55 surveyed anti-malware solutions including ad-aware avast bitdefender comodo dr web eset fortinet f-secure kaspersky trend micro housecall sophos symantec july 2014 genieo acquired 34 million somoto another company bundles legitimate applications offers additional third party applications may unwanted user august 2015 malware researchers discovered genieo installer acquired access mac keychain automated click allow permission dialog keychain displayed code safari browser extension added genieo also contained immediately used earlier versions installer april 2019 osx.genieo locked user macbook air computer passwords stored secure note found missing mail account settings tampered genieo case became impetus rapid emergence similar adware search macshop ads macvx etc", + "neighbors": [ + 17, + 95, + 124, + 258, + 277, + 297, + 623, + 646, + 717, + 734, + 886, + 1138, + 1166, + 1291, + 1339, + 1350, + 1423, + 1563, + 1604 + ], + "mask": "Validation" + }, + { + "node_id": 586, + "label": 1, + "text": "Australian_Research_Data_Commons:australian research data commons australian research data commons ardc limited company formed 1 july 2018 combining australian national data service ands nectar national eresearch collaboration tools resources research data services rds purpose enable australian researchers industry access nationally significant einfrastructure skills platforms data collections ands established 2008 order help address challenges storing managing making accessible australia research data joint collaboration monash university australian national university csiro manages research data australia web portal enables access data 100 australian research organisations cultural institutions government agencies nectar established 2009 australian government project directorate establish infrastructure university melbourne created 2011 research data services project provides service development prioritised areas research continuing operational support infrastructure accesses data national collections project led monash university collaboration australian national university anu csiro created basis full ands implementation aim allow researchers identify locate access analyse available research data transforming large number scattered disparate collections around australia cohesive accessible body resources importance eresearch infrastructure australian future research competitiveness emphasised prime reason funding provided australian government national collaborative research infrastructure strategy ncris part funding agreement department innovation industry science research diisr monash university september 2008 mid-2009 ands funded education investment fund eif establishment australian research data commons australian government \u2019 super science initiative research data australia formerly ands collections registry ands significant service web portal enables access data 100 australian research organisations cultural institutions government agencies online research collections australia orca registry software utility drove ands collections registry precursor research data australia used names online discovery service run ands allows researchers publicise existence research data enables prospective users data find research data australia made use iso 2146-based rif-cs metadata standard research data services project continuation research data storage infrastructure rdsi national collaboration tools resources project nectar established 2009 australian government budget part super science initiative financed education investment fund eif since received government funding well similar investment australian universities research institutions project got ground 2011 university melbourne partners research communities develop manage 12 virtual laboratories 16 e-research tools national research cloud known nectar cloud 10,000 users three organisations created aligned set investments business plans 2017/8 order integrate work line 2016 national research infrastructure ncris roadmap created department education training monash university remains lead agent ands university queensland lead agent rds university melbourne lead agent nectar", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 587, + "label": 7, + "text": "Cluster-aware_application:cluster-aware application cluster-aware application software application designed call cluster apis order determine running state case manual failover triggered cluster nodes planned technical maintenance automatic failover required computing cluster node encounters hardware software failure maintain business continuity cluster-aware application may capable failing lan wan", + "neighbors": [ + 804 + ], + "mask": "Train" + }, + { + "node_id": 588, + "label": 4, + "text": "February_2010_Australian_cyberattacks:february 2010 australian cyberattacks february 2010 australian cyberattacks series denial-of-service attacks conducted anonymous online community australian government response proposed web censorship regulations operation titstorm name given cyber attacks perpetrators resulted lapses access government websites 10 11 february 2010 accompanied emails faxes phone calls harassing government offices actual size attack number perpetrators involved unknown estimated number systems involved ranged hundreds thousands amount traffic caused disruption multiple government websites australian telecommunications minister stephen conroy proposed regulations would mainly filter sites pornographic content various groups advocating uncensored access internet along companies like google yahoo object proposed filter spokesperson conroy said actions legitimate form protest called irresponsible attacks also drew criticism filter protest groups initial stage followed small in-person protests 20 february called project freeweb attack began protest responding plan australian telecommunications minister stephen conroy would require internet service providers block australian users accessing illegal government deemed unwanted content websites blocked feature pornography showing rape bestiality child sex abuse small-breasted women may appear legal age female ejaculation drawn depictions acts included proposal proposed filter also includes gambling sites along others showing drug use leaked version proposed blacklist also referred refused classification rc list also showed sites include adult content name operation titstorm reference material would censored google questioned proposal saying prohibitions would broad strongly opposed free speech groups poll conducted mcnair ingenuity research hungry beast television program found 80 1,000 respondents favour concept plan survey also found 91 concerned government intent keep list filtered websites secret department defence cyber security operations centre discovered attack coming 5 february statement released anonymous press two days attack said government right refuse citizens access information solely perceive 'unwanted went read australian government learn one mess porn one messes access perfectly legal illegal content reason anonymous previously garnered media attention protests church scientology project chanology iranian government september 2009 prime minister kevin rudd website hacked similar protest proposed web censorship reforms flyers distributed recruit participants said attack begin 8 pm aest 10 february day government websites targeted denial-of-service attacks communications department said hackers infiltrated government security instead swamped government computer servers sites left unavailable sporadic periods throughout attack one point australian parliament website offline two days due high volume requests rudd government site also inaccessible time primary target communications department also received large amount traffic government offices also flooded e-mail spam junk faxes prank phone calls prime minister homepage vandalized pornographic images flyer released attack called faxes focus cartoon pornography female ejaculation small-breasted pornography reports actual size attack varied one cyber security expert described attacks equivalent parking truck across driveway shopping centre firm marketing security technology said peak attack relatively low 16.84 megabits per second one writer described 7.5 million requests per second initially brought parliament website massive site usually receives hundred per second appears botnets made compromised computers used estimates number attacking systems involved ranged hundreds thousands spokeswoman conroy said attacks legitimate political protest according totally irresponsible potentially deny services australian public systems administrators guild australia said condemned ddos attacks wrong way express disagreement proposed law anti-censorship groups criticised attacks saying hurt cause purported spokesperson attackers recommended wider australian public protest filter signing petition electronic frontiers australia anonymous coordinated second phase small protests outside parliament house canberra major cities throughout australia 20 february additional demonstrations held country embassies overseas organizers called follow-up protests project freeweb differentiate criticised cyber attacks several supporters attack later said messageboard taking websites enough convince government back web filtering policy called violence others disagreed actions proposed launching additional attack popular government site spokesman electronic frontiers australia said believed real intention capacity follow violent threats attack also resulted criticism australia terrorism laws university new south wales law journal one writer wrote provisions leave place legitimate acts online protest least sets penalty far high relatively minor cyber-vandalism australian teenager charged four counts inciting hackers impair electronic communications two unauthorised access restricted data role attack ordered pay bond instead convicted pleading guilty showing good behaviour july 2010 conroy delayed implementing plan pending 12-month review refused classification content rated proposal expected go forward due opposition coalition greens internet service providers telstra optus agreed voluntarily block content", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 363, + 376, + 414, + 418, + 533, + 550, + 577, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1246, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 589, + "label": 3, + "text": "Explicit_data_graph_execution:explicit data graph execution explicit data graph execution edge type instruction set architecture isa intends improve computing performance compared common processors like intel x86 line edge combines many individual instructions larger group known hyperblock hyperblocks designed able easily run parallel parallelism modern cpu designs generally starts plateau eight internal units one four cores edge designs intend support hundreds internal units offer processing speeds hundreds times greater existing designs major development edge concept led university texas austin darpa polymorphous computing architectures program stated goal producing single-chip cpu design 1 tflops performance 2012 yet realized 2018 almost computer programs consist series instructions convert data one form another instructions require several internal steps complete operation time relative performance cost different steps changed dramatically resulting several major shifts isa design 1960s memory relatively expensive cpu designers produced instruction sets densely encoded instructions data order better utilize resource instance codice_1 instruction would provided many different forms would gather b different places main memory indexes registers providing different instructions allowed programmer select instruction took least possible room memory reducing program needs leaving room data instruction set tried provide every possible access mode every possible instruction like dec vax known orthogonal considered paragon design style memory access wide variety modes led instruction sets hundreds different instructions style known today cisc complex instruction set computing late 1970s memory become cheap cost lower performance cpu designs ran many times faster memory talked new regime orthogonality became undesirable versions instructions took room cpu little nothing improve performance communicated slow memory time memory savings unnecessary period risc reduced instruction set computing design philosophy flourished basic aim reduce access memory much possible using internal high-performance registers instructions side-effect wide variety different modes instructions disappeared might one codice_2 instruction instead many removing instructions reduced complexity instruction decoder freed considerable space cpu space used greatly increase number registers 1990s chip design fabrication process grew point possible build commodity processor every potential feature built improve performance cpu designs started adding internal parallelism becoming superscalar program instructions work unrelated data adding functional units instructions run time new portion cpu scheduler looks independent instructions feeds units taking outputs re-ordering externally appears ran succession amount parallelism extracted superscalar designs limited number instructions scheduler examine interdependencies examining greater number instructions improve chance finding instruction run parallel cost increasing complexity scheduler despite massive efforts cpu designs using classic risc cisc isa plateaued three four functional units additional performance wrung systems examining instructions find ones operate different types data adding units dedicated sort data led introduction floating point units recently single instruction multiple data simd units drawback approach makes cpu less generic feeding cpu program uses almost floating point instructions instance bog fpus units sit idle recent problem modern cpu designs delay talking registers general terms size cpu die remained largely time size units within cpu grown much smaller units added means relative distance one function unit global register file grown time introduced order avoid delays talking main memory global register file become delay worth avoiding delays talking memory price fell suggested radical change isa instruction set architecture cisc risc designers considering whether problems scaling parallelism increasing delays talking registers demands another switch basic isa among ways introduce new isa long instruction word vliw architectures typified itanium vliw moves scheduler logic cpu compiler much memory longer timelines examine instruction stream static placement static issue execution model works well delays known presence cache latencies filling instruction words proven difficult challenge compiler instruction might take five cycles data cache could take hundreds compiler way know whether data cache runtime determined overall system load factors nothing program compiled key performance bottleneck traditional designs data instructions operate theoretically scattered memory memory performance dominates overall performance classic dynamic placement dynamic issue designs seem reached limit performance capabilities vliw uses static placement static issue model proven difficult master runtime behavior programs difficult predict properly schedule advance edge architectures new class isa based static placement dynamic issue design edge systems compile source code form consisting statically-allocated hyperblocks containing many individual instructions hundreds thousands hyperblocks scheduled dynamically cpu edge thus combines advantages vliw concept looking independent data compile time superscalar risc concept executing instructions data becomes available vast majority real-world programs linkage data instructions obvious explicit programs divided small blocks referred subroutines procedures methods depending era programming language used generally well-defined entrance exit points data passed information lost high level language converted processor much simpler isa information useful modern compilers generalized concept basic block attempting identify within programs optimize memory access registers block instructions control statements predicated instructions dataflow graph encoded using blocks specifying flow data one block instructions another storage area basic idea edge directly support operate blocks isa level since basic blocks access memory well-defined ways processor load related blocks schedule output one block feeds directly one consume data eliminates need global register file simplifies compiler task scheduling access registers program whole instead basic block given local registers compiler optimizes access within block much simpler task edge systems bear strong resemblance dataflow languages 1960s\u20131970s 1990s dataflow computers execute programs according dataflow firing rule stipulates instruction may execute time operands available due isolation data similar edge dataflow languages inherently parallel interest followed general interest massive parallelism solution general computing problems studies based existing cpu technology time demonstrated would difficult dataflow machine keep enough data near cpu widely parallel precisely bottleneck modern fabrication techniques solve placing hundreds cpu memory single die another reason dataflow systems never became popular compilers era found difficult work common imperative languages like c++ instead dataflow systems used dedicated languages like prograph limited commercial interest decade compiler research eliminated many problems key difference dataflow edge approaches edge designs intend work commonly used languages edge-based cpu would consist one small block engines local registers realistic designs might hundreds units units interconnected using dedicated inter-block communication links due information encoded block compiler scheduler examine entire block see inputs available send engine execution need examine individual instructions within small increase complexity scheduler examine multiple blocks see outputs one fed inputs another place blocks units reduce inter-unit communications delays modern cpu examines thousand instructions potential parallelism complexity edge allows examine thousand hyperblocks one consisting hundreds instructions gives scheduler considerably better scope additional cost pattern operation gives concept name graph string blocks connected data flowing another advantage edge concept massively scalable low-end design could consist single block engine stub scheduler simply sends blocks called program edge processor intended desktop use would instead include hundreds block engines critically changes designs physical layout chip private information known scheduler program written single-unit machine would run without changes desktop version albeit thousands times faster power scaling likewise dramatically improved simplified block engines turned required linear effect power consumption perhaps greatest advantage edge concept suitable running sort data load unlike modern cpu designs different portions cpu dedicated different sorts data edge cpu would normally consist single type alu-like unit desktop user running several different programs time would get much parallelism scientific user feeding single program using floating point cases scheduler would simply load every block could units low level performance individual block engines would match dedicated fpu instance would attempt overwhelm advantage massive parallelism university texas austin developing edge isa known trips order simplify microarchitecture cpu designed run trips isa imposes several well-defined constraints trips hyperblock trips compiler statically bundles instructions hyperblocks also statically compiles blocks run particular alus means trips programs dependency precise implementation compiled 2003 produced sample trips prototype sixteen block engines 4 4 grid along megabyte local cache transfer memory single chip version trips fabbed ibm canada using 130 nm process contains two grid engines along shared level-2 cache various support systems four chips gigabyte ram placed together daughter-card experimentation trips team set ultimate goal producing single-chip implementation capable running sustained performance 1 tflops 50 times performance high-end commodity cpus available 2008 dual-core xeon 5160 provides 17 gflops cmu cash compiler produces intermediate code called pegasus cash trips similar concept cash targeted produce output specific architecture therefore hard limits block layout university washington wavescalar architecture substantially similar edge statically place instructions within waves instead special instructions phi rho mark boundaries waves allow scheduling", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1319, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 590, + "label": 4, + "text": "Ambient_authority:ambient authority ambient authority term used study access control systems subject computer program said using ambient authority needs specify names involved object operation performed order permitted action succeed definition authority ambient sense exists broadly visible environment often necessarily global environment subject request name example suppose c program opens file read access executing call desired file designated name filesystem include authorising information program exercising ambient authority ambient authority requested permissions granted denied based one global properties executing program identity role cases management access control handled separately explicit communication executing program process means access control lists associated objects role-based access control mechanisms executing program means reify permissions granted specific purpose first-class values program able access object acting behalf acting behalf one clients behalf one client another way express intention inevitably leads programs subject confused deputy problem term ambient authority used primarily contrast capability-based security including object-capability models executing programs receive permissions might receive data communicated first-class object references allows determine permissions came thus avoid confused deputy problem however since additional requirements system considered capability system besides avoiding ambient authority non-ambient authority system synonym capability system ambient authority dominant form access control computer systems today user model access control used unix windows systems ambient authority model programs execute authorities user started means executing programs inevitably given permissions need task unable determine source number types permission program executing ambient authority access control model little option designate permissions try exercise hoping best property requires excess permissions granted users roles order programs execute without error", + "neighbors": [ + 1535, + 1629 + ], + "mask": "Validation" + }, + { + "node_id": 591, + "label": 4, + "text": "Custom_hardware_attack:custom hardware attack cryptography custom hardware attack uses specifically designed application-specific integrated circuits asic decipher encrypted messages mounting cryptographic brute force attack requires large number similar computations typically trying one key checking resulting decryption gives meaningful answer trying next key computers perform calculations rate millions per second thousands computers harnessed together distributed computing network number computations required average grows exponentially size key many problems standard computers fast enough hand many cryptographic algorithms lend fast implementation hardware i.e networks logic circuits also known gates integrated circuits ics constructed gates often execute cryptographic algorithms hundreds times faster general purpose computer ic contain large numbers gates hundreds millions 2005 thus decryption circuit cell replicated thousands times one ic communications requirements ics simple must initially loaded starting point key space situations comparison test value see known plaintext attack output consists signal ic found answer successful key since ics lend mass production thousands even millions ics applied single problem ics mounted printed circuit boards standard board design used different problems since communication requirements chips wafer-scale integration another possibility primary limitations method cost chip design ic fabrication floor space electric power thermal dissipation alternative approach use fpgas field-programmable gate arrays slower expensive per gate reprogrammed different problems copacobana cost-optimized parallel code breaker one machine consisting 120 fpgas type xilinx spartan3-1000 run parallel earliest custom hardware attack may bombe used recover enigma machine keys world war ii 1998 custom hardware attack mounted data encryption standard cipher electronic frontier foundation deep crack machine cost u.s. 250,000 build decrypted des challenge ii-2 test message 56 hours work confirmed des cracker copacobana machine cost-optimized parallel code breaker built 2006 unlike deep crack copacobana consist commercially available reconfigurable integrated circuits copacobana costs 10,000 build recover des key 6.4 days average cost decrease roughly factor 25 eff machine impressive example continuous improvement digital hardware adjusting inflation 8 years yields even higher improvement 30x since 2007 sciengines gmbh spin-off company two project partners copacobana enhanced developed successors copacobana 2008 copacobana rivyera reduced time break des current record less one day using 128 spartan-3 5000 generally believed large government code breaking organizations u.s. national security agency make extensive use custom hardware attacks examples declassified", + "neighbors": [ + 268, + 369, + 528, + 659, + 719, + 1081, + 1219, + 1398, + 1503, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 592, + "label": 9, + "text": "Fourth-generation_programming_language:fourth-generation programming language fourth-generation programming language 4gl computer programming language belongs class languages envisioned advancement upon third-generation programming languages 3gl programming language generations aims provide higher level abstraction internal computer hardware details making language programmer-friendly powerful versatile definition 4gl changed time typified operating large collections information rather focusing bits bytes languages claimed 4gl may include support database management report generation mathematical optimization gui development web development researchers state 4gls subset domain-specific languages concept 4gl developed 1970s 1990s overlapping development 3gl 3gls like c c++ c java javascript remain popular wide variety uses 4gls originally defined found narrower uses advanced 3gls like python ruby perl combine 4gl abilities within general-purpose 3gl environment also libraries 4gl-like features developed add-ons popular 3gls blurred distinction 4gl 3gl 1980s 1990s efforts develop fifth-generation programming languages 5gl though used earlier papers discussions term 4gl first used formally james martin 1981 book applications development without programmers refer non-procedural high-level specification languages primitive way early 4gls included informatics mark-iv 1967 product sperry mapper 1969 internal use 1979 release motivations '4gl inception continued interest several term apply large set software products also apply approach looks greater semantic properties implementation power 3gl offered greater power programmer 4gl open development environment wider population early input scheme 4gl supported entry data within 72-character limit punched card 8 bytes used sequencing card tag would identify type function judicious use cards 4gl deck could offer wide variety processing reporting capability whereas equivalent functionality coded 3gl could subsume perhaps whole box cards 72-character metaphor continued hardware progressed larger memory terminal interfaces even limitations approach supported highly sophisticated applications interfaces improved allowed longer statement lengths grammar-driven input handling greater power ensued example described nomad page development 4gl influenced several factors hardware operating system constraints large weight 4gl first introduced disparate mix hardware operating systems mandated custom application development support specific system order ensure sales one example mapper system developed sperry though roots back beginning system proven successful many applications ported modern platforms latest variant embedded bis offering unisys mark-iv known vision builder offered computer associates santa fe railroad used mapper develop system project early example 4gl rapid prototyping programming users idea easier teach railroad experts use mapper teach programmers intricacies railroad operations one early portable languages 4gl properties ramis developed gerald c. cohen mathematica mathematical software company cohen left mathematica founded information builders create similar reporting-oriented 4gl called focus later 4gl types tied database system far different earlier types use techniques resources resulted general improvement computing time interesting twist 4gl scene realization graphical interfaces related reasoning done user form 'language poorly understood number different types 4gls exist 4gls integrated tools allow easy specification required information twenty-first century 4gl systems emerged low code environments platforms problem rapid application development short periods time vendors often provide sample systems crm contract management bug tracking development occur little programming extract data files database create reports wide range formats done report generator tools", + "neighbors": [ + 47, + 78, + 154, + 246, + 306, + 378, + 396, + 412, + 429, + 509, + 766, + 806, + 824, + 1028, + 1044, + 1059, + 1130, + 1225, + 1227, + 1311, + 1319, + 1320, + 1324, + 1532 + ], + "mask": "Test" + }, + { + "node_id": 593, + "label": 9, + "text": "Wakanda_(software):wakanda software wakanda javascript platform develop run web mobile apps based open standards technologies including angularjs ionic node.js typescript supported linux deployment microsoft windows macos studio development wakanda consists stack tools technologies starting 2008 server wakanda first presented ajax experience 2009 year jsconf.eu private developer preview made accessible 2010 first version wakanda studio including model designer gui designer wakanda came public attention june 2011 new developer preview second public developer preview announced wakanday js.everywhere boston october 2011 conference first beta december 15th wakanda available live release version since march 15 2012 june 28 2012 first version wakanda officially launched october 26 2012 demonstrated js.everywhere conference us france first involved commonjs working group since 2009 team created client server javascript apis w3c community group april 2012 joining w3c october 2012 company wakanda sas created december 2014 december 7 2015 wakanda digital app factory officially launched 2016 wakanda named cool vendor gartner wakanda server supports commonjs modules web workers web storage xmlhttprequest html5 file api blobs timers implements firebug crossfire debugger protocol well webkit remote debugging protocol wakandadb nosql engine accessed via http inspired odata rest api integrates connectors interact tiers databases mysql microsoft sql server odbc wakanda supports node.js modules including eventemitter socket tls wakanda includes open source projects part default packages wakanda server built javascriptcore icu openssl zlib", + "neighbors": [ + 7, + 36, + 50, + 69, + 81, + 117, + 132, + 134, + 176, + 201, + 308, + 509, + 538, + 567, + 632, + 682, + 686, + 712, + 716, + 869, + 872, + 916, + 959, + 961, + 1138, + 1225, + 1227, + 1235, + 1242, + 1264, + 1269, + 1280, + 1302, + 1311, + 1481, + 1566 + ], + "mask": "Test" + }, + { + "node_id": 594, + "label": 9, + "text": "Comparison_of_programming_languages_(string_functions):comparison programming languages string functions string functions used computer programming languages manipulate string query information string programming languages string datatype string functions although may low-level ways within language handle strings directly object-oriented languages string functions often implemented properties methods string objects functional list-based languages string represented list character codes therefore list-manipulation procedures could considered string functions however languages may implement subset explicit string-specific functions well function manipulate strings modern object-oriented languages like c java immutable strings return copy newly allocated dynamic memory others like c manipulate original string unless programmer copies data new string see example concatenation basic example string function codice_1 function function returns length string literal languages may string functions similar exactly syntax parameters outcomes example many languages length function usually represented len string list common functions aims help limit confusion string functions common many languages listed including different names used list common functions aims help programmers find equivalent function language note string concatenation regular expressions handled separate pages statements guillemets \u00ab \u2026 \u00bb optional var begin // example c ya hello world 2 // l' substr hello world 1 1 e' hello world .substr 1 1 e' hello world 2 l' hello world -3 r' example visual basic mid hello world ,2,1 example visual basic .net hello world .chars 2 l c example smalltalk 'hello world 2 e //example rust hello world .chars .nth 2 // l' hello cmp world returns -1 hello cmp world returns less world cmp hello returns hello cmp hello returns cmp hello world returns -1 /** example rexx */ compare hello world /* returns index mismatch 1 */ use-modules srfi srfi-13 string-compare hello world values values values example erlang hello world returns false art gt painting returns false art lt painting returns true hello -gt world returns false string art painting returns nil string art painting returns non nil 'abc 'def // returns abcdef // example c abc def // returns abcdef example visual basic abc def returns abcdef abc def returns abcdef abc null returns abc abc null returns null // example abc def // returns abcdef concatenate 'string abc def ghi returns abc def ghi abc def returns abcdef perl 5 returns perl 5 abc def returns abcdef perl 6 returns perl 6 \u00a2 example algol 68 \u00a2 // example c hello mate .contains e // returns true word .contains z // returns false good morning .contains z returns false \u00a1buenos d\u00edas .contains \u00ed returns true e hello mate returns true z word returns false example smalltalk 'hello mate includessubstring e returns true 'word includessubstring z returns false tests two strings equal see also compare compare note equality checks via generic compare integer result confusing programmer often significantly expensive operation especially true using c-strings // example c hello == world // returns false example visual basic hello world returns false 'hello eq 'world returns 0 'hello eq 'hello returns 1 'hello eq 'world returns false 'hello eq 'hello returns true hello -eq world returns false \u235d example apl 'hello \u2261 'world \u235d returns 0 search e hello mate returns 1 search z word returns nil // examples c hello mate .indexof e // returns 1 hello mate .indexof e 4 // returns 9 word .indexof z // returns -1 hello .index e returns 1 hello .index z returns nil use-modules srfi srfi-13 string-contains hello mate e returns 1 string-contains word z returns f examples visual basic instr hello mate e returns 2 instr 5 hello mate e returns 10 instr word z returns 0 examples smalltalk 'hello mate indexofsubcollection 'ate returns 8 'hello mate indexofsubcollection 'late returns 0 i'hello mate 'hello mate // examples c hello mate .indexof e // returns 1 word .indexof z // returns -1 position \\e hello mate returns 1 position \\z word returns nil // example c string.format 0 costs 1 c2 pen 19.99 // returns pen costs 19.99 // example object pascal delphi format 'my costs 2f 'pen 19.99 // returns pen costs 19.99 // example java string.format costs 2f pen 19.99 // returns pen costs 19.99 sprintf costs .2f pen 19.99 returns pen costs 19.99 1.fmt 04d returns 0001 costs .2f pen 19.99 returns pen costs 19.99 0 costs 1 .2f .format pen 19.99 returns pen costs 19.99 format ~a costs ~1,2f pen 19.99 returns pen costs 19.99 tests two strings equal see also equality // example c hello world // returns true example visual basic hello world returns true not= hello world \u21d2 true 'hello ne 'world returns 1 'hello ne 'world returns true hello -ne world returns true see find see find see find see rfind languages languages without built-in trim function usually simple create custom function accomplishes task awk one use regular expressions trim standard trim function c c++ available string libraries c contain code implements trimming functions significantly ease efficient implementation function also often called eatwhitespace non-standard c libraries c programmers often combine ltrim rtrim implement trim void rtrim char *str void ltrim char *str void trim char *str open source c++ library boost several trim variants including standard one trimmed boost :algorithm :trim_copy string note boost function named simply codice_3 input sequence modified in-place return result another open source c++ library qt several trim variants including standard one trimmed s.trimmed linux kernel also includes strip function codice_4 since 2.6.18-rc1 trims string place since 2.6.33-rc1 kernel uses codice_5 instead codice_4 avoid false warnings trim algorithm haskell may interpreted follows f drops preceding whitespace reverses string f applied output note type signature second line optional trim algorithm j functional description filter codice_7 non-space characters codice_8 leading codice_9 codice_10 trailing codice_11 spaces built-in trim function javascript 1.8.1 firefox 3.5 later ecmascript 5 standard earlier versions added string object prototype follows string.prototype.trim function perl 5 built-in trim function however functionality commonly achieved using regular expressions example string =~ s/^\\s+// remove leading whitespace string =~ s/\\s+ // remove trailing whitespace string =~ s/^\\s+|\\s+ //g remove leading trailing whitespace examples modify value original variable codice_12 also available perl stripltspace codice_13 cpan however two functions commonly used strip whitespace end strings codice_14 codice_15 perl 6 upcoming major revision language strings codice_3 method example string string.trim remove leading trailing whitespace string .= trim thing tcl codice_19 command three relevant subcommands codice_3 codice_21 codice_22 commands additional argument may specified string represents set characters remove\u2014the default whitespace space tab newline carriage return example trimming vowels set string onomatopoeia set trimmed string trim string aeiou result nomatop set r_trimmed string trimright string aeiou result onomatop set l_trimmed string trimleft string aeiou result nomatopoeia xslt includes function codice_23 strips leading trailing whitespace addition replacing whitespace sequence including line breaks single space example xsl variable name='trimmed /xsl variable xslt 2.0 includes regular expressions providing another mechanism perform string trimming another xslt technique trimming utilize xpath 2.0 codice_24 function", + "neighbors": [ + 19, + 65, + 117, + 152, + 216, + 249, + 306, + 308, + 373, + 509, + 540, + 567, + 579, + 597, + 682, + 712, + 790, + 873, + 948, + 1050, + 1120, + 1189, + 1217, + 1221, + 1225, + 1227, + 1235, + 1311, + 1374, + 1418, + 1430, + 1477, + 1508 + ], + "mask": "Test" + }, + { + "node_id": 595, + "label": 4, + "text": "Trusted_Computer_System_Evaluation_Criteria:trusted computer system evaluation criteria trusted computer system evaluation criteria tcsec united states government department defense dod standard sets basic requirements assessing effectiveness computer security controls built computer system tcsec used evaluate classify select computer systems considered processing storage retrieval sensitive classified information tcsec frequently referred orange book centerpiece dod rainbow series publications initially issued 1983 national computer security center ncsc arm national security agency updated 1985 tcsec eventually replaced common criteria international standard originally published 2005 24 october 2002 orange book aka dodd 5200.28-std canceled dodd 8500.1 later reissued dodi 8500.02 14 march 2014 security policy must explicit well-defined enforced computer system three basic security policies specified individual accountability regardless policy must enforced secure means must exist ensure access authorized competent agent evaluate accountability information within reasonable amount time without undue difficulty accountability objective includes three requirements computer system must contain hardware/software mechanisms independently evaluated provide sufficient assurance system enforces requirements extension assurance must include guarantee trusted portion system works intended accomplish objectives two types assurance needed respective elements within class additional set documentation addresses development deployment management system rather capabilities documentation includes tcsec defines four divisions c b division highest security division represents significant difference trust individual organization place evaluated system additionally divisions c b broken series hierarchical subdivisions called classes c1 c2 b1 b2 b3 a1 division class expands modifies indicated requirements immediately prior division class publication entitled army regulation 380-19 example guide determining system class used given situation", + "neighbors": [ + 108, + 195, + 379, + 443, + 475, + 941, + 957, + 1138, + 1275, + 1361, + 1535 + ], + "mask": "Test" + }, + { + "node_id": 596, + "label": 2, + "text": "FaceTime:facetime facetime proprietary videotelephony product developed apple inc. facetime available supported ios mobile devices macintosh computers run later facetime supports ios device forward-facing camera macintosh computer equipped facetime camera facetime audio audio-only version available ios device supports ios 7 newer macintosh forward-facing camera running later facetime included free ios macos 10.7 onwards apple bought facetime name facetime communications changed name actiance inc. june 7 2010 apple announced facetime conjunction iphone 4 apple bought facetime name facetime communications changed name actiance january 2011 june 7 2010 apple announced facetime conjunction iphone 4 support fourth generation ipod touch first model ipod touch equipped cameras announced conjunction device release september 8 2010 facetime announced october 20 2010 march 2 2011 facetime support announced newly introduced ipad 2 forward- rear-facing cameras february 24 2011 facetime left beta listed mac app store us 0.99 apple claims intended provide application free charge however provision sarbanes\u2013oxley act 2002 bars companies providing unadvertised new feature already-sold product without enduring onerous accounting measures us 0.99 beta still available download apple facetime included free macos 10.7 onwards ios allowed customers use facetime long tiered blocked application working customers unlimited data plans brought federal communications commission fcc net neutrality violations may 2011 found facetime would work seamlessly 3g iphone ipad ipod touch models supported even though facetime worked 3g time supports 4g lte calls networks world availability limited operators gsm plans june 2018 apple announced facetime would support group video audio calls 32 people ios 12 macos mojave facetime works establishing connection two supported devices apple devices iphones ipads macs introduced 2011 support facetime facetime currently incompatible non-apple devices video calling services mac models introduced 2011 high-definition video facetime devices use automatically ends facetime hd camera unlike mac os x ichat facetime currently support group conferencing support announced ios 12 application one-on-one video chat\u2014only two people talk second user calls user answers video chat previous user ends new video session begins second caller iphone phone call pending user attempts answer video call ends phone call begins next user incoming notifications ios devices shown facetime call opened video temporarily paused user back facetime app iphone user activate facetime phone call pressing facetime button initiated facetime call history contacts application ios 7 newer also provide separate facetime app always apple non-telephony devices ipad ipod touch mac release ios 6 facetime required wifi connection work ios 6 onwards facetime iphone ipad supported facetime calls cellular networks 3g lte provided carrier enabled mid-2013 virtually carriers worldwide allowed facetime audio uses three megabytes data every five minutes conversation facetime video using significantly cellular talk time/minutes used switching voice call facetime call facetime calls placed supported devices phone number email address registered facetime service single email address registered multiple devices call placed address rings devices simultaneously facetime protocol based numerous open industry standards although interoperable videotelephony systems upon launch iphone 4 jobs stated apple would immediately start working standards bodies make facetime protocol open industry standard protocols open standards apple facetime service requires client-side certificate facetime calls protected end-to-end encryption sender receiver access apple decrypt data compared sip implementations facetime adds techniques enhance performance cost breaking interoperability port multiplexing sdp minimization sdp compression new audio-only version facetime named facetime audio announced annual apple worldwide developers conference wwdc keynote speech june 10 2013 released ios 7 september 18 2013 audio-only version facetime effectively makes protocol voice internet protocol voip competes mainstream providers field including skype microsoft based aac-ld audio protocol service provides high-quality audio ios 7 betas limited facetime audio calls placed wi-fi network original limitation video version facetime final release removed restriction allow work 3g lte data connections case carriers plans regard facetime video like video version facetime audio currently available apple devices feature available run ipod touch 4th generation device support ios 7 later facetime streaming cellular data unavailable iphone 4 ipad 2. facetime enabled devices bought united arab emirates possibly due regulations country restrict ip-based communications addition devices bought china facetime audio disabled facetime video available devices bought outside countries support video audio versions facetime although egypt jordan qatar kuwait originally disabled facetime iphone 4 later re-enabled feature carrier update existing phone owners made pre-enabled newly purchased iphone march 2018 facetime available iphones saudi arabia upon updating ios 11.3 august 2019 facetime available iphones pakistan upon updating ios 12.4 april 16 2014 facetime ceased working earlier versions ios previously supported ios 4 5 6 client-side certificate used authenticate genuine apple device facetime servers amongst uses expired date apple chose release update certificate devices newer major ios version new valid certificate available apple release minor update certificate os x versions could run facetime also earlier versions ios small number devices could run facetime could run newer major version ios 4th generation ipod touch result policy almost ios users update ios version devices wished continue using facetime limitation applied even users jailbroken devices since even legally jailbroken device would difficult also illegal extract install apple new certificate without apple permission order work around issue due proprietary nature facetime currently unavailable platforms including android windows january 28 2019 bug discovered facetime app allowed users eavesdrop users without knowledge exploit later discovered video feed could enabled without users acceptance apple said statement would release fix exploit shortly disabling group facetime time bug named facepalm security researchers affects ios devices running facetime ios 12.1 later macintosh computers running macos 10.14.1 mojave later although bug gained international attention january 28 2019 bug found 14-year old high school student arizona mother tried week warn apple problem facebook twitter discovering bug january 20th however pair found impossible reach anyone company short smoke signals trying every method someone could use get hold someone apple said ms. thompson january 25 2019 posted video youtube demonstrating bug news bug finally gained media coverage ms thompson wrote letters emails tweets msgs sent apple 10+ days reporting group facetime bug lets someone listen teenager discovered never heard back \u201d", + "neighbors": [ + 14, + 33, + 71, + 75, + 99, + 121, + 130, + 162, + 214, + 228, + 252, + 269, + 345, + 356, + 394, + 395, + 403, + 442, + 477, + 489, + 511, + 551, + 607, + 610, + 625, + 634, + 696, + 797, + 810, + 858, + 877, + 883, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1189, + 1237, + 1262, + 1292, + 1305, + 1322, + 1334, + 1339, + 1373, + 1409, + 1443, + 1448, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 597, + "label": 9, + "text": "Comparison_of_programming_languages_by_type_system:comparison programming languages type system onlyinclude comparison programming languages type system compares features type systems type checking multiple programming languages brief definitions /onlyinclude", + "neighbors": [ + 19, + 65, + 117, + 152, + 216, + 249, + 306, + 308, + 373, + 447, + 509, + 538, + 567, + 579, + 594, + 682, + 790, + 873, + 948, + 998, + 1028, + 1120, + 1152, + 1221, + 1225, + 1227, + 1235, + 1311, + 1418, + 1430, + 1477, + 1508 + ], + "mask": "Validation" + }, + { + "node_id": 598, + "label": 4, + "text": "Ettercap_(software):ettercap software ettercap free open source network security tool man-in-the-middle attacks lan used computer network protocol analysis security auditing runs various unix-like operating systems including linux mac os x bsd solaris microsoft windows capable intercepting traffic network segment capturing passwords conducting active eavesdropping number common protocols original developers later founded hacking team ettercap works putting network interface promiscuous mode arp poisoning target machines thereby act 'man middle unleash various attacks victims ettercap plugin support features extended adding new plugins ettercap supports active passive dissection many protocols including ciphered ones provides many features network host analysis ettercap offers four modes operation addition software also offers following features ettercap also ability actively passively find poisoners lan", + "neighbors": [ + 134, + 149, + 160, + 306, + 311, + 379, + 425, + 455, + 470, + 646, + 678, + 684, + 692, + 708, + 758, + 764, + 796, + 856, + 961, + 965, + 1042, + 1138, + 1218, + 1337, + 1452, + 1527, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 599, + "label": 4, + "text": "Fly-by-wire:fly-by-wire fly-by-wire fbw system replaces conventional manual flight controls aircraft electronic interface movements flight controls converted electronic signals transmitted wires hence fly-by-wire term flight control computers determine move actuators control surface provide ordered response use mechanical flight control backup systems boeing 777 use fully fly-by-wire controls improved fully fly-by-wire systems interpret pilot control inputs desired outcome calculate control surface positions required achieve outcome results various combinations rudder elevator aileron flaps engine controls different situations using closed feedback loop pilot may fully aware control outputs acting effect outcome aircraft reacting expected fly-by-wire computers act stabilise aircraft adjust flying characteristics without pilot involvement prevent pilot operating outside aircraft safe performance envelope mechanical hydro-mechanical flight control systems relatively heavy require careful routing flight control cables aircraft systems pulleys cranks tension cables hydraulic pipes systems often require redundant backup deal failures increases weight limited ability compensate changing aerodynamic conditions dangerous characteristics stalling spinning pilot-induced oscillation pio depend mainly stability structure aircraft concerned rather control system depending pilot action term fly-by-wire implies purely electrically signaled control system used general sense computer-configured controls computer system interposed operator final control actuators surfaces modifies manual inputs pilot accordance control parameters side-sticks centre sticks conventional flight control yokes used fly fbw aircraft fbw aircraft lighter similar design conventional controls partly due lower overall weight system components partly natural stability aircraft relaxed slightly transport aircraft maneuverable fighter means stability surfaces part aircraft structure therefore made smaller include vertical horizontal stabilizers fin tailplane normally rear fuselage structures reduced size airframe weight reduced advantages fbw controls first exploited military commercial airline market airbus series airliners used full-authority fbw controls beginning a320 series see a320 flight control though limited fbw functions existed a310 boeing followed 777 later designs pilot commands flight control computer make aircraft perform certain action pitch aircraft roll one side moving control column sidestick flight control computer calculates control surface movements cause plane perform action issues commands electronic controllers surface controllers surface receive commands move actuators attached control surface moved flight control computer commanded controllers measure position flight control surface sensors lvdts fly-by-wire control systems allow aircraft computers perform tasks without pilot input automatic stability systems operate way gyroscopes fitted sensors mounted aircraft sense rotation pitch roll yaw axes movement straight level flight example results signals computer automatically move control actuators stabilize aircraft traditional mechanical hydraulic control systems usually fail gradually loss flight control computers immediately renders aircraft uncontrollable reason fly-by-wire systems incorporate either redundant computers triplex quadruplex etc kind mechanical hydraulic backup combination mixed control system mechanical backup feedbacks rudder elevation directly pilot therefore makes closed loop feedback systems senseless aircraft systems may quadruplexed four independent channels prevent loss signals case failure one even two channels high performance aircraft fly-by-wire controls also called ccvs control-configured vehicles may deliberately designed low even negative stability flight regimes rapid-reacting ccv controls electronically stabilize lack natural stability pre-flight safety checks fly-by-wire system often performed using built-in test equipment bite number control movement steps automatically performed reducing workload pilot groundcrew speeding flight-checks aircraft panavia tornado example retain basic hydro-mechanical backup system limited flight control capability losing electrical power case tornado allows rudimentary control stabilators pitch roll axis movements servo-electrically operated control surfaces first tested 1930s soviet tupolev ant-20 long runs mechanical hydraulic connections replaced wires electric servos first pure electronic fly-by-wire aircraft mechanical hydraulic backup apollo lunar landing training vehicle lltv first flown 1968 first non-experimental aircraft designed flown 1958 fly-by-wire flight control system avro canada cf-105 arrow feat repeated production aircraft concorde 1969 system also included solid-state components system redundancy designed integrated computerised navigation automatic search track radar flyable ground control data uplink downlink provided artificial feel feedback pilot uk two seater avro 707b flown fairey system mechanical backup early mid-60s program curtailed air-frame ran flight time 1972 first digital fly-by-wire fixed-wing aircraft without mechanical backup take air f-8 crusader modified electronically nasa united states test aircraft f-8 used apollo 11 guidance navigation control hardware preceded 1964 llrv pioneered fly-by-wire flight mechanical backup control digital computer three analog redundant channels ussr sukhoi t-4 also flew time united kingdom trainer variant british hawker hunter fighter modified british royal aircraft establishment fly-by-wire flight controls right-seat pilot fly-by-wire flight control systems eliminate complexity fragility weight mechanical circuit hydromechanical electromechanical flight control systems\u2014each replaced electronic circuits control mechanisms cockpit operate signal transducers turn generate appropriate electronic commands next processed electronic controller\u2014either analog one modernly digital one aircraft spacecraft autopilots part electronic controller hydraulic circuits similar except mechanical servo valves replaced electrically controlled servo valves operated electronic controller simplest earliest configuration analog fly-by-wire flight control system configuration flight control systems must simulate feel electronic controller controls electrical feel devices provide appropriate feel forces manual controls used concorde first production fly-by-wire airliner sophisticated versions analog computers replaced electronic controller canceled 1950s canadian supersonic interceptor avro canada cf-105 arrow employed type system analog computers also allowed customization flight control characteristics including relaxed stability exploited early versions f-16 giving impressive maneuverability digital fly-by-wire flight control system extended analog counterpart digital signal processing receive interpret input multiple sensors simultaneously altimeters pitot tubes adjust controls real time computers sense position force inputs pilot controls aircraft sensors solve differential equations related aircraft equations motion determine appropriate command signals flight controls execute intentions pilot programming digital computers enable flight envelope protection protections tailored aircraft handling characteristics stay within aerodynamic structural limitations aircraft example computer flight envelope protection mode try prevent aircraft handled dangerously preventing pilots exceeding preset limits aircraft flight-control envelope prevent stalls spins limit airspeeds g forces airplane software also included stabilize flight-control inputs avoid pilot-induced oscillations since flight-control computers continuously feedback environment pilot workloads reduced also military naval applications possible fly military aircraft relaxed stability primary benefit aircraft maneuverability combat training flights so-called carefree handling stalling spinning undesirable performances prevented automatically computers digital flight control systems enable inherently unstable combat aircraft lockheed f-117 nighthawk northrop grumman b-2 spirit flying wing fly usable safe manners federal aviation administration faa united states adopted rtca/do-178c titled software considerations airborne systems equipment certification certification standard aviation software safety-critical component digital fly-by-wire system including applications laws aeronautics computer operating systems need certified do-178c level b depending class aircraft applicable preventing potential catastrophic failures nevertheless top concern computerized digital fly-by-wire systems reliability even analog electronic control systems digital computers running software often control path pilot aircraft flight control surfaces computer software crashes reason pilot may unable control aircraft hence virtually fly-by-wire flight control systems either triply quadruply redundant computers electronics three four flight-control computers operating parallel three four separate data buses connecting control surface multiple redundant flight control computers continuously monitor output one computer begins give aberrant results reason potentially including software hardware failures flawed input data combined system designed exclude results computer deciding appropriate actions flight controls depending specific system details may potential reboot aberrant flight control computer reincorporate inputs return agreement complex logic exists deal multiple failures may prompt system revert simpler back-up modes addition early digital fly-by-wire aircraft also analog electrical mechanical hydraulic back-up flight control system space shuttle addition redundant set four digital computers running primary flight-control software fifth back-up computer running separately developed reduced-function software flight-control system \u2013 one commanded take event fault ever affects computers four back-up system serves reduce risk total flight-control-system failure ever happening general-purpose flight software fault escaped notice four computers airliners flight-control redundancy improves safety fly-by-wire control systems physically lighter lower maintenance demands conventional controls also improve economy terms cost ownership in-flight economy certain designs limited relaxed stability pitch axis example boeing 777 flight control system may allow aircraft fly aerodynamically efficient angle attack conventionally stable design modern airliners also commonly feature computerized full-authority digital engine control systems fadecs control jet engines air inlets fuel storage distribution system similar fashion way fbw controls flight control surfaces allows engine output continually varied efficient usage possible second generation embraer e-jet family gained 1.5 efficiency improvement first generation fly-by-wire system enabled reduction 280 ft.\u00b2 250 ft.\u00b2 horizontal stabilizer e190/195 variants airbus boeing differ approaches implementing fly-by-wire systems commercial aircraft since airbus a320 airbus flight-envelope control systems always retain ultimate flight control flying normal law permit pilots violate aircraft performance limits unless choose fly alternate law strategy continued subsequent airbus airliners however event multiple failures redundant computers a320 mechanical back-up system pitch trim rudder airbus a340 purely electrical electronic back-up rudder control system beginning a380 flight-control systems back-up systems purely electrical use three-axis backup control module bcm boeing airliners boeing 777 allow pilots completely override computerised flight-control system permitting aircraft flown outside usual flight-control envelope decide necessary advent fadec full authority digital engine control engines permits operation flight control systems autothrottles engines fully integrated modern military aircraft systems autostabilization navigation radar weapons system integrated flight control systems fadec allows maximum performance extracted aircraft without fear engine misoperation aircraft damage high pilot workloads civil field integration increases flight safety economy airbus a320 fly-by-wire brethren protected dangerous situations low-speed stall overstressing flight envelope protection result conditions flight control systems commands engines increase thrust without pilot intervention economy cruise modes flight control systems adjust throttles fuel tank selections precisely skillful pilots fadec reduces rudder drag needed compensate sideways flight unbalanced engine thrust a330/a340 family fuel transferred main wing center fuselage tanks fuel tank horizontal stabilizer optimize aircraft center gravity cruise flight fuel management controls keep aircraft center gravity accurately trimmed fuel weight rather drag-inducing aerodynamic trims elevators fly-by-optics sometimes used instead fly-by-wire offers higher data transfer rate immunity electromagnetic interference lighter weight cases cables changed electrical optical fiber cables sometimes referred fly-by-light due use fiber optics data generated software interpreted controller remain fly-by-light effect decreasing electro-magnetic disturbances sensors comparison common fly-by-wire control systems kawasaki p-1 first production aircraft world equipped flight control system eliminated mechanical transmission circuits fly-by-wire flight control systems next step eliminate bulky heavy hydraulic circuits hydraulic circuit replaced electrical power circuit power circuits power electrical self-contained electrohydraulic actuators controlled digital flight control computers benefits digital fly-by-wire retained biggest benefits weight savings possibility redundant power circuits tighter integration aircraft flight control systems avionics systems absence hydraulics greatly reduces maintenance costs system used lockheed martin f-35 lightning ii airbus a380 backup flight controls boeing 787 airbus a350 also incorporate electrically powered backup flight controls remain operational even event total loss hydraulic power wiring adds considerable amount weight aircraft therefore researchers exploring implementing fly-by-wireless solutions fly-by-wireless systems similar fly-by-wire systems however instead using wired protocol physical layer wireless protocol employed addition reducing weight implementing wireless solution potential reduce costs throughout aircraft life cycle example many key failure points associated wire connectors eliminated thus hours spent troubleshooting wires connectors reduced furthermore engineering costs could potentially decrease less time would spent designing wiring installations late changes aircraft design would easier manage etc newer flight control system called intelligent flight control system ifcs extension modern digital fly-by-wire flight control systems aim intelligently compensate aircraft damage failure flight automatically using engine thrust avionics compensate severe failures loss hydraulics loss rudder loss ailerons loss engine etc several demonstrations made flight simulator cessna-trained small-aircraft pilot successfully landed heavily damaged full-size concept jet without prior experience large-body jet aircraft development spearheaded nasa dryden flight research center reported enhancements mostly software upgrades existing fully computerized digital fly-by-wire flight control systems dassault falcon 7x embraer legacy 500 business jets flight computers partially compensate engine-out scenarios adjusting thrust levels control inputs still require pilots respond appropriately", + "neighbors": [ + 78, + 1138 + ], + "mask": "Validation" + }, + { + "node_id": 600, + "label": 4, + "text": "Full_disclosure_(computer_security):full disclosure computer security field computer security independent researchers often discover flaws software abused cause unintended behaviour flaws called vulnerabilities process analysis vulnerabilities shared third parties subject much debate referred researcher disclosure policy full disclosure practice publishing analysis software vulnerabilities early possible making data accessible everyone without restriction primary purpose widely disseminating information vulnerabilities potential victims knowledgeable attack essay topic bruce schneier stated full disclosure \u2013 practice making details security vulnerabilities public \u2013 damned good idea public scrutiny reliable way improve security secrecy makes us less secure leonard rose co-creator electronic mailing list superseded bugtraq become de facto forum disseminating advisories explains n't believe security obscurity far know full disclosure way ensure everyone insiders access information need controversy around public disclosure sensitive information new issue full disclosure first raised context locksmithing 19th-century controversy regarding whether weaknesses lock systems kept secret locksmithing community revealed public today three major disclosure policies others categorized non disclosure coordinated disclosure full disclosure major stakeholders vulnerability research disclosure policies shaped various motivations uncommon observe campaigning marketing lobbying preferred policy adopted chastising dissent many prominent security researchers favor full disclosure whereas vendors prefer coordinated disclosure non disclosure generally favoured commercial exploit vendors blackhat hackers proponents coordinated disclosure believe software vendors right control vulnerability information concerning products primary tenet coordinated disclosure nobody informed vulnerability software vendor gives permission often exceptions variations policy distribution must initially limited vendors given privileged access nonpublic research advocates coordinated disclosure often prefer weighted less-descriptive term \u201c responsible disclosure \u201d coined microsoft security manager scott culp essay \u201c time end information anarchy \u201d referring full disclosure microsoft later asked term phased favour \u201c coordinated disclosure \u201d although reasoning varies many practitioners argue end-users benefit access vulnerability information without guidance patches vendor risks sharing research malicious actors great little benefit microsoft explain coordinated disclosure serves everyone best interests ensuring customers receive comprehensive high-quality updates security vulnerabilities exposed malicious attacks update developed full disclosure policy publishing information vulnerabilities without restriction early possible making information accessible general public without restriction general proponents full disclosure believe benefits freely available vulnerability research outweigh risks whereas opponents prefer limit distribution free availability vulnerability information allows users administrators understand react vulnerabilities systems allows customers pressure vendors fix vulnerabilities vendors may otherwise feel incentive solve fundamental problems coordinated disclosure full disclosure resolve discovery specific flaw vulnerability mutually exclusive event multiple researchers differing motivations discover flaws independently standard way make vulnerability information available public researchers often use mailing lists dedicated topic academic papers industry conferences non disclosure principle vulnerability information shared shared non-disclosure agreement either contractually informally common proponents non-disclosure include commercial exploit vendors researchers intend exploit flaws find proponents security obscurity researchers favour coordinated disclosure believe users make use advanced knowledge vulnerabilities without guidance vendor majority best served limiting distribution vulnerability information advocates argue low-skilled attackers use information perform sophisticated attacks would otherwise beyond ability potential benefit outweigh potential harm caused malevolent actors vendor prepared guidance even unsophisticated users digest information made public argument presupposes vulnerability discovery mutually exclusive event one person discover vulnerability many examples vulnerabilities discovered simultaneously often exploited secrecy discovery researchers may exist users benefit vulnerability information full disclosure advocates believe demonstrates contempt intelligence end users true users benefit vulnerability information 're concerned security networks position hire expert assist would hire mechanic help car non disclosure typically used researcher intends use knowledge vulnerability attack computer systems operated enemies trade knowledge vulnerability third party profit typically use attack enemies researchers practicing non disclosure generally concerned improving security protecting networks however proponents argue simply want assist vendors claim intent harm others full coordinated disclosure advocates declare similar goals motivations simply disagreeing best achieve non disclosure entirely incompatible", + "neighbors": [ + 91, + 141, + 158, + 186, + 232, + 261, + 281, + 293, + 325, + 376, + 379, + 414, + 533, + 550, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 675, + 703, + 708, + 783, + 800, + 818, + 915, + 1186, + 1270, + 1293, + 1308, + 1327, + 1332, + 1336, + 1342, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576, + 1623 + ], + "mask": "Test" + }, + { + "node_id": 601, + "label": 9, + "text": "Macintosh_Common_Lisp:macintosh common lisp macintosh common lisp mcl implementation ide common lisp programming language various versions mcl run classic mac os m68k ppc mac os x versions mcl including 5.1 proprietary version 5.2 open sourced 2009 new different version mcl open sourced rmcl rmcl based mcl 5.1 run rosetta intel-based macs mcl famous integration macintosh toolbox later apple carbon allowed direct access mac os functionality directly lisp achieved low-level interface allowed direct manipulation native mac os data structures lisp together high-level interface convenient use 2001 article dr. dobb journal peter norvig wrote mcl favorite ide macintosh platform language serious rival platforms development mcl began 1984 history mcl known different names running 68k-based apple macintosh computers running powerpc-based apple macintosh computers also spawned least one separately maintained fork", + "neighbors": [ + 27, + 46, + 99, + 194, + 203, + 251, + 308, + 313, + 332, + 360, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 916, + 919, + 929, + 934, + 947, + 978, + 987, + 1021, + 1118, + 1119, + 1123, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Train" + }, + { + "node_id": 602, + "label": 4, + "text": "Commwarrior:commwarrior commwarrior symbian bluetooth worm first spread via multimedia messaging service mms bluetooth worm affects nokia series 60 software platform commwarrior particularly effective via mms vector used infect phones appeared though sent source known victim leading even security-conscious users open infected message actually message sent random contact sender address book message opened virus attempts install phone via sis file runs worm executed every time phone switched secondary method infection create malicious .sis file compromised phone per minute thereafter worm attempts send file phone bluetooth enabled according sophos installation program one six chance displaying following text commwarrior v1.0 c 2005 e10d0r", + "neighbors": [ + 1018, + 1291 + ], + "mask": "Validation" + }, + { + "node_id": 603, + "label": 2, + "text": "Nokia_5250:nokia 5250 nokia 5250 budget nokia resistive touchscreen smartphone running symbian v9.4 operating system s60 5th edition user interface price tax subsidies \u20ac115 announced august 2010 available china eurasia europe india latin america middle east south east asia pacific region small compact comes preloaded guitar hero mobile series 5 cnet asia praised resolution budget price criticized lack 3g capabilities relying gsm edge", + "neighbors": [ + 3, + 21, + 112, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 527, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 604, + "label": 4, + "text": "Operation_Payback:operation payback operation payback coordinated decentralized group attacks high-profile opponents internet piracy internet activists using anonymous moniker operation payback started retaliation distributed denial service ddos attacks torrent sites piracy proponents decided launch ddos attacks piracy opponents initial reaction snowballed wave attacks major pro-copyright anti-piracy organizations law firms individuals following united states diplomatic cables leak december 2010 organizers commenced ddos attacks websites banks withdrawn banking facilities wikileaks 2010 several bollywood companies hired aiplex software launch ddos attacks websites respond takedown notices piracy activists created operation payback september 2010 retaliation original plan attack aiplex software directly upon finding hours planned ddos another individual taken firm website operation payback moved launching attacks websites copyright stringent organisations motion picture association america mpaa international federation phonographic industry giving two websites combined total downtime 30 hours following two days operation payback attacked multitude sites affiliated mpaa recording industry association america riaa british phonographic industry law firms davenport lyons dunlap grubb weaver us copyright group also attacked september 21 2010 website united kingdom law firm subjected ddos attack part operation payback asked attacks andrew crossley owner acs law said hours far concern fact train turning 10 minutes late queue coffee wasting time sort rubbish site came back online 350mb file backup site visible anyone short period time backup included copies emails sent firm downloaded made available various peer-to-peer networks websites including pirate bay emails contained unencrypted excel spreadsheets listing names addresses people acs law accused illegally sharing media one contained 5,300 sky broadband customers accused illegally sharing pornography another contained details 8,000 sky customers 400 plusnet customers accused infringing copyright music sharing peer-to-peer networks alleged breach data protection act become part ongoing investigation acs law information commissioner office september 30 leesburg virginia office dunlap grubb weaver law firm \u2013 also business u.s copyright group \u2013 evacuated police emailed bomb threat received believed event could connected anonymous non-related copyright law firms sites websheriff.com also attacked attacks originally organized internet relay chat channel attacks also became popular topic twitter september 27 2010 ddos attack australian federation copyright theft afact unintentionally brought 8,000 small websites hosted server september 2010 attempt ensure portuguese citizens ca n't access thepiratebay.org associa\u00e7\u00e3o com\u00e9rcio audiovisual de portugal acapor filed complaint pirate bay complaint filed general inspection cultural activities part portuguese ministry culture according movie rental association pirate bay directly responsible 15 million illegal downloads portugal every year installing pirate bay block isps acapor hoped decrease financial damage claims pirate bay causes october 18 2010 acapor website defaced presenting text operation payback redirect pirate bay seconds addition defacing website copy email database acapor uploaded pirate bay leaked e-mails far revealed acapor methods denunciation dissatisfaction portuguese government justice system perception copyright debate war antagonism isps acapor claimed business isps illegal downloading october 4 2010 operation payback launched attack ministry sound website gallant macmillan website october 7 2010 attacked website spanish copyright society sgae.es october 7 2010 total downtime websites attacked operation payback 537.55 hours october 15 2010 copyprotected.com sql injected defaced three days later operation payback launched ddos attack uk intellectual property office production companies satelfilm.at wega-film.at hit drive-by ddoses october 21 2010 response efforts gain court injunction isp refused block movie-streaming website operation payback knocked porn website hustler.com offline following day 2010 mipcom convention gene simmons kiss stated response simmons comments members operation payback switched attentions two websites simmonsrecords.com genesimmons.com taking offline total 38 hours point course ddos genesimmons.com hacked redirected thepiratebay.org response attack simmons wrote led additional attacks subsequently downtime websites later simmons message removed website one year later december 2011 person supposedly known nickname spydr101 arrested relation attack genesimmons.com charged conspiracy unauthorized impairment protected computer october 26 2010 limewire ordered disable searching downloading uploading file trading and/or file distribution functionality losing court battle riaa claims copyright infringement satisfied injunction riaa announced intention continue arista records llc v. lime group llc trial recover damages caused program retaliation members operation payback announced would attack riaa website october 29 despite fact group typically hit target twice october 29 riaa.org indeed taken offline via denial-of-service attack attack riaa.com riaa.org sites inaccessible europe operation payback main site attacked later day subsequently moved website tieve.tk anonops.net damages phase limewire trial riaa attempted switch seeking statutory damages per-work seeking per-infringement quote total damage amount method calculating number infringements judge case rejected proposal holding case law supported statutory damages per-work basis large-scale infringement thus capping potential award 1.5 billion march 15 2011 four days ruling report appeared law.com highlighting judge remark per-infringement award sought record companies might total trillions report estimated 75 trillion attention-grabbing headline usa nominal gdp 2012-2013 16\u201317 trillion figure repeated pc magazine march 23 operation payback call-to-arms followed citing 75 trillion figure still actively sought riaa ddos attack riaa website commenced march 25 around october 28 2010 group set new website intention coordinating protests around world raise awareness cause date protest activities november 5 intended day gunpowder plot anonymous heavily affiliates use guy fawkes masks protest activity included attack united states copyright office fbi launched investigation later arrested one person accused taking part attack paypal november 9 2010 operation payback temporarily ceased attacking websites hiatus lasted four months ending early march 2011 attack temporarily took website bmi prominent collection society operating behalf music publishers followed aforementioned second attack riaa website december 8 2010 u.s politician sarah palin announced website personal credit card information compromised palin team believed attack executed anonymous though anonymous never commented palin possible target attack interview rt anonymous member said n't really care sarah palin much honest n't really know trying accomplish attention trying gain personally n't care sarah palin palin technical team posted screenshot server log file showing wikileaks.org url visa attacks denial service attacks credit card data compromised unknown whether palin card compromised part broad attack visa specific attack palins palin email previously hacked campaigning 2008 u.s. presidential election december 2010 wikileaks came intense pressure stop publishing secret u.s. diplomatic cables corporations amazon paypal bankamerica swiss bank postfinance mastercard visa either stopped working froze customers donations wikileaks due political pressures response behind operation payback directed activities companies operation payback launched ddos attacks paypal postfinance swedish prosecution authority december 8 2010 coordinated ddos attack operation payback brought mastercard visa websites december 9 2010 prior sustained ddos attack paypal website caused minor slowdown service paypal announced blog would release frozen funds account wau holland foundation raising funds wikileaks would reactivate account regarding attacks wikileaks spokesman kristinn hrafnsson denied relation group said neither condemn applaud attacks believe reflection public opinion actions targets day 16-year-old boy arrested hague netherlands connection distributed denial-of-service attacks mastercard paypal boy irc operator nickname jeroenz0r december 10 2010 daily telegraph reported anonymous threatened disrupt british government websites assange extradited sweden anonymous issued press release attempt clarify issue electronic frontier foundation co-founder john perry barlow described attacks shot heard round world\u2014this lexington following list sites domains known targeted operation payback attempt take amazon.com aborted failed recruit enough users botnet cnn noted massive amazon website almost impossible crash late december fbi began raid suspected participants operation payback beginning 2011 operation payback brought zimbabwean government websites zimbabwean president wife sued newspaper 15 million publishing wikileaks cable linked alleged trade illicit diamonds january 27 2011 five males aged 15 26 arrested early morning raids u.k. suspicion involvement fbi executed 40 search warrants day united kingdom intellectual property office said site attacked responsible depriving citizens access information democratic right access critics claimed attacks restricted gene simmons right free speech spokesman mpaa said troubling groups seem concerned rights steal copy films music books creative resources rights american workers producing products also criticism pirate party uk united states pirate party joint public statement urged group immediately cease distributed denial-of-service ddos attacks instead seek legal method express frustration disquiet copyright industry perversions copyright law personal gain acknowledging ddos attacks credit card banking web sites serve political protests cyber experts said operation payback done long-term damage sites back online attacks penetrated brought entire banking systems used conduct transactions people still continuing use credit cards make payments like noisy political demonstration like mob surrounding bank refusing let anyone said one cyber expert operation payback members used modified version low orbit ion cannon loic execute ddos attacks september 2010 hive mind mode added loic hive mind mode loic connects irc controlled remotely allows computers loic installed behave part botnet utilising tool coordinators operation payback able quickly take websites belonging anti-piracy groups botnets sizes also used members operation payback reportedly used irc channel communicate targets select instructions attacking targets produced posted various imageboards 4chan/7chan/711chan/420chan/808chan media twitter facebook also utilized coordination december 8 2010 operation payback facebook page removed official twitter account suspended additionally federal court order forced encyclopedia dramatica delete operation payback article featured detailed history operation including personal information individuals associated companies attacked october 2013 13 members operation payback indicted federal court alexandria virginia co-conspirators violation 18 u.s.c \u00a7 731 18 u.s.c \u00a7 1030 2014 members received plea deal reducing felony charges single misdemeanor", + "neighbors": [ + 43, + 91, + 141, + 144, + 158, + 198, + 232, + 261, + 281, + 290, + 293, + 325, + 363, + 376, + 414, + 418, + 436, + 533, + 550, + 577, + 588, + 600, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1291, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 605, + "label": 5, + "text": "Tabular_Data_Stream:tabular data stream tabular data stream tds application layer protocol used transfer data database server client initially designed developed sybase inc. sybase sql server relational database engine 1984 later microsoft microsoft sql server early development sybase sql server developers sybase perceived lack commonly accepted application-level protocol transfer data database server client order encourage use products sybase promoted use flexible pair libraries called codice_1 codice_2 implement standard sql library included order implement bulk copy called blk codice_1 job ferry data two computers underlying network protocol codice_2 provides api client program communicates server via codice_1 codice_2 sends server structured stream bytes meant tables data hence tabular data stream codice_7 provides like codice_2 api client programs communicates server via codice_1 1990 sybase entered technology-sharing agreement microsoft resulted microsoft marketing sql server \u2014 microsoft sql server \u2014 based sybase code microsoft kept codice_2 api added odbc microsoft since added additional apis time sybase introduced powerful successor codice_2 called codice_12 called pair open client codice_2 though officially deprecated remains widespread use tds protocol comes several varieties openly documented regarded proprietary technology exception tds 5.0 used exclusively sybase documentation available sybase situation changed microsoft published tds specification 2008 part open specification promise freetds team developed free native-library implementation tds protocol licensed lgpl license wireshark protocol decoder tds oracle corporation provides oracle net software analogous tds", + "neighbors": [ + 412, + 646 + ], + "mask": "Test" + }, + { + "node_id": 606, + "label": 9, + "text": "Family_BASIC:family basic family basic famicom basic consumer product programming nintendo family computer video game console japan family basic launched june 21 1984 consumers japan nintendo cooperation hudson soft sharp corporation second version titled family basic v3 released february 21 1985 greater memory new features first edition family basic application cartridge bundled computer style keyboard instructional textbook requires cassette tape recorder save user-generated basic programs programs saved using cassette tape drive famicom data recorder family basic designed compatible floppy disk storage famicom disk system disk system ram adapter requires use famicom cartridge slot prevents using slot family basic cartridge family basic includes dialect basic programming language enhanced game development microsoft basic-derived command set extended support sprites animation backgrounds musical sequences gamepads several visual components seen nintendo games backgrounds characters mario donkey kong series games made available family basic development componentry appear premade family basic games family basic normally used nes consoles console lacks famicom 15-pin expansion port circumvented use custom i/o adapter hooks otherwise unused nes expansion port bottom console 1990 manufacturer shenzhen named nedc developed sold clone famicom family basic china first model called fcs-90 combines famicom chipset cartridge slot pair controllers rf output making complete console used program play famicom video games nedc also translated built-in software english fcs-90 revised model fcs-92 instruction manual section programming japanese popular music family basic developed koji kondo second nintendo product tenure kondo previously initiated computer audio interests programming sounds basic home computer satoshi tajiri creator pok\u00e9mon initially used family basic gateway build understanding internal operation famicom inspired create handmade famicom game development hardware make game freak debut game quinty later released mendel palace 1990", + "neighbors": [ + 0, + 8, + 236, + 273, + 510, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1156, + 1204, + 1306, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 607, + "label": 3, + "text": "Apple_A5:apple a5 apple a5 32-bit system-on-a-chip designed apple inc. manufactured samsung successor apple a4 a5 commercially debuted release apple ipad 2 tablet also powers iphone 4s ipod touch fifth generation apple tv third generation ipad mini first generation consistent apple debuted a4 chip first original ipad followed iphone 4 ipod touch fourth generation apple claims compared predecessor a4 a5 cpu twice work gpu nine times graphics performance software updates devices using chip ceased 2016 release ios 10 a5 consists dual-core arm cortex-a9 cpu neon simd accelerator dual core powervr sgx543mp2 gpu apple lists a5 clocked 1 ghz ipad 2 technical specifications page though dynamically adjust frequency save battery life unit used iphone 4s clocked approximately 800 mhz apple also included image signal processor unit isp advanced image post-processing face detection white balance automatic image stabilization earsmart unit audience noise canceling a5 first released estimated time cost 75 previous generation difference expected diminish production increased a5 manufactured samsung austin texas factory samsung invested 3.6 billion austin facility produce chips processors nearly facility output dedicated apple components samsung invested 4.2 billion austin facility order transition 28 nm fabrication process second half 2013 a5 part model numbers s5l8940 45 nm version s5l8942 32 nm version s5l8947 32 nm single core version version a5 wider memory subsystem four graphic cores called apple a5x found third generation ipad apple uses first version a5 chip iphone 4s ipad 2 a5 manufacturing process 45 nm 122.2 mm die area manufactured package package pop together 512 mb dual-channel lp-ddr2 dram apple used second version a5 chip third generation apple tv announced march 7 2012 well ipod touch fifth generation ipad mini 32 nm revision ipad 2 chip manufactured 32 nm fabrication process id code s5l8942 one core disabled apple tv new a5 measures nearly 41 smaller first-generation a5 coming 69.6 mm manufactured package package pop together 512 mb lpddr2 dram march 2013 apple released updated version third generation apple tv appletv3,2 containing smaller single cpu core single gpu core version a5 processor unlike a5 variants version a5 package-on-package pop stacked ram chip small 37.8 mm decrease size due decrease feature size still 32 nm fabrication process indicates a5 revision new design markings tell named apl7498 software chip called s5l8947 images illustrations approximately scale", + "neighbors": [ + 71, + 75, + 112, + 130, + 214, + 228, + 252, + 269, + 270, + 356, + 394, + 403, + 477, + 489, + 511, + 596, + 610, + 625, + 634, + 681, + 696, + 853, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 988, + 1001, + 1069, + 1140, + 1147, + 1176, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1488, + 1503, + 1507, + 1518, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 608, + "label": 4, + "text": "Spoofing_attack:spoofing attack context information security especially network security spoofing attack situation person program successfully masquerades another falsifying data gain illegitimate advantage many protocols tcp/ip suite provide mechanisms authenticating source destination message thus vulnerable spoofing attacks extra precautions taken applications verify identity sending receiving host ip spoofing arp spoofing particular may used leverage man-in-the-middle attacks hosts computer network spoofing attacks take advantage tcp/ip suite protocols may mitigated use firewalls capable deep packet inspection taking measures verify identity sender recipient message websites especially pornographic paysites allow access materials certain approved login- pages enforced checking referrer header http request referrer header however changed known referrer spoofing ref-tar spoofing allowing users gain unauthorized access materials spoofing also refer copyright holders placing distorted unlistenable versions works file-sharing networks public telephone networks often provide caller id information includes caller number sometimes caller \u2019 name call however technologies especially voice ip voip networks allow callers forge caller id information present false names numbers gateways networks allow spoofing public networks forward false information since spoofed calls originate countries laws receiver country may apply caller limits laws effectiveness use spoofed caller id information scam sender information shown e-mails codice_1 field spoofed easily technique commonly used spammers hide origin e-mails leads problems misdirected bounces i.e e-mail spam backscatter e-mail address spoofing done quite way writing forged return address using snail mail long letter fits protocol i.e stamp postal code smtp protocol send message done using mail server telnet geolocation spoofing occurs user applies technologies make appear located somewhere actually located common geolocation spoofing use virtual private network vpn dns proxy order user appear located different country state territory actually located according study globalwebindex 49 global vpn users utilize vpns primarily access territorially restricted entertainment content type geolocation spoofing also referred geo-piracy since user illicitly accessing copyrighted materials via geolocation spoofing technology another example geolocation spoofing occurred online poker player california used geolocation spoofing techniques play online poker new jersey contravention california new jersey state law forensic geolocation evidence proved geolocation spoofing player forfeited 90,000 winnings gps spoofing attack attempts deceive gps receiver broadcasting incorrect gps signals structured resemble set normal gps signals rebroadcasting genuine signals captured elsewhere different time spoofed signals may modified way cause receiver estimate position somewhere actually located different time determined attacker one common form gps spoofing attack commonly termed carry-off attack begins broadcasting signals synchronized genuine signals observed target receiver power counterfeit signals gradually increased drawn away genuine signals suggested capture lockheed rq-170 drone aircraft northeastern iran december 2011 result attack gps spoofing attacks predicted discussed gps community previously known example malicious spoofing attack yet confirmed proof-of-concept attack successfully performed june 2013 luxury yacht white rose drachs misdirected spoofed gps signals group aerospace engineering students cockrell school engineering university texas austin students aboard yacht allowing spoofing equipment gradually overpower signal strengths actual gps constellation satellites altering course yacht june 2017 approximately twenty ships black sea complained gps anomalies showing vessels transpositioned miles actual location professor todd humphreys believed likely spoofing attack gps anomalies around putin palace moscow kremlin led researchers believe russian authorities use gps spoofing wherever vladimir putin located affecting maritime traffic since advent software defined radio gps simulator applications made available general public made gps spoofing much accessible meaning performed limited expense modicum technical knowledge different ways prevent gps spoofing department homeland security collaboration national cybersecurity communications integration center nccic national coordinating center communications ncc released paper lists methods prevent type spoofing important recommended use installation operation strategies development opportunities described herein significantly enhance ability gnss receivers associated equipment defend range interference jamming spoofing attacks", + "neighbors": [ + 103, + 149, + 169, + 285, + 364, + 379, + 692, + 701, + 703, + 739, + 762, + 856, + 1171, + 1303, + 1395, + 1570, + 1575 + ], + "mask": "Test" + }, + { + "node_id": 609, + "label": 1, + "text": "Postcode_Plants_Database:postcode plants database postcode plants database uk resource identifying locally native plants species based postcode hosted natural history museum london used determine plant conservation schemes also information relationships plants associated animals", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 610, + "label": 2, + "text": "IPad_(2017):ipad 2017 ipad officially fifth-generation ipad 9.7-inch tablet computer designed developed marketed apple inc. announcement march 21 2017 conflicting naming conventions spawned number different names including seventh-generation ipad ipad 2017 retains screen size ipad air line tablets powerful ipad air 2 even overall dimensions weight similar original ipad air unlike ipad air 2 generation ipad fully laminated display lacks anti-reflective coating unlike ipad pro smart connector features dual-speaker system ipad received mixed reviews significantly praised performance reviewers asserting model noticeably faster older ipad models also received positive reviews price battery life criticized however lacking laminated anti-reflective screen lack support apple pencil attachable keyboards smart connector introductory price united states lowest ever ipad media noting lower price might effort encourage wider adoption tablet education sector well businesses needing inexpensive tablets undemanding uses march 27 2018 apple announced successor 2018 ipad also marked discontinuation ipad ipad announced apple march 21 2017 press release confusion around naming referred ipad marketing called fifth-generation ipad official statements specifications sheets title previously taken 2013 ipad air sources refer seventh-generation ipad including ipad air ipad air 2 fifth- sixth-generation ipads respectively also referred ipad 2017 matt kapko cio wrote apple introductory pricing 329 united states ipad 70 price reduction versus ipad air 2 appeared designed fend encroachment google chromebook laptops education sector foster wider adoption customer-facing terminals kapko also wrote device designed appeal businesses require inexpensive tablets undemanding use including kiosks checkout terminals hospitality screens time original release ipad shipped ios 10 version apple mobile operating system new units sold come new ios 11 operating system instead included touch id fingerprint sensor allows user unlock device well approve purchases app store itunes store ibooks store touch id apple pay let user purchase items websites within apps ipad 9.7-inch 25cm screen compared ipad air 2 processor updated apple a8x a9 embedded apple m9 motion co-processor ipad 2 gigabytes ram 7.5mm thick thickness ipad air compared 6.1mm ipad air 2 unlike ipad models available ipad display fully laminated anti-reflective coating however ipad brighter screen ipad air 2 25 brighter according apple available 32 128 gigabyte storage options contrasting ipad pro lineup ipad features two speakers opposed four smart connector support flash back offered silver gold space grey colors despite use apple a9 processor accompanying m9 motion co-processor introduced iphone 6s 2015 ipad feature support always-on hey siri voice input feature advertised made possible low-power processing then-new chips use hey siri limited ipad connected power product teardown ifixit showed design ipad nearly identical ipad air except differences addition touch id lack physical mute switch microphone holes smaller single row speaker holes dieter bohn verge wrote thin fast tablet praised screen good despite fancy true tone display ipad pro things made screen ipad air 2 nice lamination anti-reflectivity criticized lack support attachable keyboards apple pencil praising a9 processor significantly faster older ipads though noting n't necessarily significantly faster ipad air 2 fast ipad pro also disliked ipad features two speakers opposed four ipad pro summarizing overall review fundamentally trying tell ipad trust ipads decent tablets basic level quality speed functionality get one need one n't stress 're missing n't sascha segan pc magazine wrote apple ipad affordable ever noted little reason existing ipad owners upgrade new ipad price stabs stake heart many competing android tablets although criticizing non-laminated display little washed predecessor claimed could n't see measurable difference nominal degradation quality n't really matter everyday use segan also praised performance compared prior ipad models also praised improved wi-fi performance writing quite impressive double wi-fi speeds new ipad air 2 jeff benjamin 9to5mac wrote sure lacks gorgeous laminated anti-reflective display ipad air 2 sure \u2019 svelte either thickness weight \u2019 denying 2017 ipad a9 dual core processor tow good value described tablet solid buy upgraders new users igor bonifacic mobilesyrup also praised performance well number ipad apps available criticized camera outdated keyboard/pencil incompatibility summarization reading 2017 ipad exciting tablet \u2019 supposed exciting ... apple \u2019 latest tablet iterative update designed appeal specific subset consumers bonifacic also called tablet perfect first-time tablet buyers chris velazco engadget praised battery life describing one best ipads 've tested also criticized lack anti-reflection display calling another cost-saving measure wish apple reconsidered", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 214, + 228, + 252, + 269, + 270, + 337, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 611, + "label": 7, + "text": "Cloud_computing:cloud computing cloud computing on-demand availability computer system resources especially data storage computing power without direct active management user term generally used describe data centers available many users internet large clouds predominant today often functions distributed multiple locations central servers connection user relatively close may designated edge server clouds may limited single organization enterprise clouds available many organizations public cloud cloud computing relies sharing resources achieve coherence economies scale advocates public hybrid clouds note cloud computing allows companies avoid minimize up-front infrastructure costs proponents also claim cloud computing allows enterprises get applications running faster improved manageability less maintenance enables teams rapidly adjust resources meet fluctuating unpredictable demand cloud providers typically use pay-as-you-go model lead unexpected operating expenses administrators familiarized cloud-pricing models availability high-capacity networks low-cost computers storage devices well widespread adoption hardware virtualization service-oriented architecture autonomic utility computing led growth cloud computing 2019 linux used type operating systems used including microsoft offerings thus described dominant cloud computing popularized amazon.com releasing elastic compute cloud product 2006 references phrase cloud computing appeared early 1996 first known mention compaq internal document cloud symbol used represent networks computing equipment original arpanet early 1977 csnet 1981\u2014both predecessors internet word cloud used metaphor internet standardized cloud-like shape used denote network telephony schematics simplification implication specifics end points network connected relevant purposes understanding diagram term cloud used refer platforms distributed computing early 1993 apple spin-off general magic used describing paired telescript personalink technologies wired april 1994 feature bill andy excellent adventure ii andy hertzfeld commented telescript general magic distributed programming language 1960s initial concepts time-sharing became popularized via rje remote job entry terminology mostly associated large vendors ibm dec. full-time-sharing solutions available early 1970s platforms multics ge hardware cambridge ctss earliest unix ports dec hardware yet data center model users submitted jobs operators run ibm mainframes overwhelmingly predominant 1990s telecommunications companies previously offered primarily dedicated point-to-point data circuits began offering virtual private network vpn services comparable quality service lower cost switching traffic saw fit balance server use could use overall network bandwidth effectively began use cloud symbol denote demarcation point provider responsible users responsible cloud computing extended boundary cover servers well network infrastructure computers became diffused scientists technologists explored ways make large-scale computing power available users time-sharing experimented algorithms optimize infrastructure platform applications prioritize cpus increase efficiency end users use cloud metaphor virtualized services dates least general magic 1994 used describe universe places mobile agents telescript environment could go described andy hertzfeld use cloud metaphor credited general magic communications employee david hoffman based long-standing use networking telecom addition use general magic also used promoting associated personalink services cloud computing existence since 2000 august 2006 amazon created subsidiary amazon web services introduced elastic compute cloud ec2 april 2008 google released google app engine beta early 2008 nasa opennebula enhanced reservoir european commission-funded project became first open-source software deploying private hybrid clouds federation clouds mid-2008 gartner saw opportunity cloud computing shape relationship among consumers services use services sell observed organizations switching company-owned hardware software assets per-use service-based models projected shift computing ... result dramatic growth products areas significant reductions areas 2008 u.s. national science foundation began cluster exploratory program fund academic research using google-ibm cluster technology analyze massive amounts data february 2010 microsoft released microsoft azure announced october 2008 july 2010 rackspace hosting nasa jointly launched open-source cloud-software initiative known openstack openstack project intended help organizations offering cloud-computing services running standard hardware early code came nasa nebula platform well rackspace cloud files platform open source offering along open-source solutions cloudstack ganeti opennebula attracted attention several key communities several studies aim comparing open sources offerings based set criteria march 1 2011 ibm announced ibm smartcloud framework support smarter planet among various components smarter computing foundation cloud computing critical part june 7 2012 oracle announced oracle cloud cloud offering poised first provide users access integrated set solutions including applications saas platform paas infrastructure iaas layers may 2012 google compute engine released preview rolled general availability december 2013 2019 revealed linux used microsoft azure dominant elsewhere goal cloud computing allow users take benefit technologies without need deep knowledge expertise one cloud aims cut costs helps users focus core business instead impeded obstacles main enabling technology cloud computing virtualization virtualization software separates physical computing device one virtual devices easily used managed perform computing tasks operating system\u2013level virtualization essentially creating scalable system multiple independent computing devices idle computing resources allocated used efficiently virtualization provides agility required speed operations reduces cost increasing infrastructure utilization autonomic computing automates process user provision resources on-demand minimizing user involvement automation speeds process reduces labor costs reduces possibility human errors cloud computing uses concepts utility computing provide metrics services used cloud computing attempts address qos quality service reliability problems grid computing models cloud computing shares characteristics cloud computing exhibits following key characteristics national institute standards technology definition cloud computing identifies five essential characteristics though service-oriented architecture advocates everything service acronyms eaas xaas simply aas cloud-computing providers offer services according different models three standard models per nist infrastructure service iaas platform service paas software service saas models offer increasing abstraction thus often portrayed layers stack infrastructure- platform- software-as-a-service need related example one provide saas implemented physical machines bare metal without using underlying paas iaas layers conversely one run program iaas access directly without wrapping saas infrastructure service iaas refers online services provide high-level apis used dereference various low-level details underlying network infrastructure like physical computing resources location data partitioning scaling security backup etc hypervisor runs virtual machines guests pools hypervisors within cloud operational system support large numbers virtual machines ability scale services according customers varying requirements linux containers run isolated partitions single linux kernel running directly physical hardware linux cgroups namespaces underlying linux kernel technologies used isolate secure manage containers containerisation offers higher performance virtualization hypervisor overhead also container capacity auto-scales dynamically computing load eliminates problem over-provisioning enables usage-based billing iaas clouds often offer additional resources virtual-machine disk-image library raw block storage file object storage firewalls load balancers ip addresses virtual local area networks vlans software bundles nist definition cloud computing describes iaas consumer able deploy run arbitrary software include operating systems applications consumer manage control underlying cloud infrastructure control operating systems storage deployed applications possibly limited control select networking components e.g. host firewalls iaas-cloud providers supply resources on-demand large pools equipment installed data centers wide-area connectivity customers use either internet carrier clouds dedicated virtual private networks deploy applications cloud users install operating-system images application software cloud infrastructure model cloud user patches maintains operating systems application software cloud providers typically bill iaas services utility computing basis cost reflects amount resources allocated consumed nist definition cloud computing defines platform service paas vendors offer development environment application developers provider typically develops toolkit standards development channels distribution payment paas models cloud providers deliver computing platform typically including operating system programming-language execution environment database web server application developers develop run software cloud platform instead directly buying managing underlying hardware software layers paas underlying computer storage resources scale automatically match application demand cloud user allocate resources manually integration data management providers also use specialized applications paas delivery models data examples include ipaas integration platform service dpaas data platform service ipaas enables customers develop execute govern integration flows ipaas integration model customers drive development deployment integrations without installing managing hardware middleware dpaas delivers integration\u2014and data-management\u2014products fully managed service dpaas model paas provider customer manages development execution programs building data applications customer dpaas users access data data-visualization tools platform service paas consumers manage control underlying cloud infrastructure including network servers operating systems storage control deployed applications possibly configuration settings application-hosting environment nist definition cloud computing defines software service software service saas model users gain access application software databases cloud providers manage infrastructure platforms run applications saas sometimes referred on-demand software usually priced pay-per-use basis using subscription fee saas model cloud providers install operate application software cloud cloud users access software cloud clients cloud users manage cloud infrastructure platform application runs eliminates need install run application cloud user computers simplifies maintenance support cloud applications differ applications scalability\u2014which achieved cloning tasks onto multiple virtual machines run-time meet changing work demand load balancers distribute work set virtual machines process transparent cloud user sees single access-point accommodate large number cloud users cloud applications multitenant meaning machine may serve one cloud-user organization pricing model saas applications typically monthly yearly flat fee per user prices become scalable adjustable users added removed point proponents claim saas gives business potential reduce operational costs outsourcing hardware software maintenance support cloud provider enables business reallocate operations costs away hardware/software spending personnel expenses towards meeting goals addition applications hosted centrally updates released without need users install new software one drawback saas comes storing users data cloud provider server result could unauthorized access data mobile backend service model also known backend service baas web app mobile app developers provided way link applications cloud storage cloud computing services application programming interfaces apis exposed applications custom software development kits sdks services include user management push notifications integration social networking services relatively recent model cloud computing baas startups dating 2011 later trends indicate services gaining significant mainstream traction enterprise consumers serverless computing cloud computing code execution model cloud provider fully manages starting stopping virtual machines necessary serve requests requests billed abstract measure resources required satisfy request rather per virtual machine per hour despite name actually involve running code without servers serverless computing named business person owns system purchase rent provision servers virtual machines back-end code run function service faas service-hosted remote procedure call leverages serverless computing enable deployment individual functions cloud run response events faas included broader term serverless computing terms may also used interchangeably private cloud cloud infrastructure operated solely single organization whether managed internally third party hosted either internally externally undertaking private cloud project requires significant engagement virtualize business environment requires organization reevaluate decisions existing resources improve business every step project raises security issues must addressed prevent serious vulnerabilities self-run data centers generally capital intensive significant physical footprint requiring allocations space hardware environmental controls assets refreshed periodically resulting additional capital expenditures attracted criticism users still buy build manage thus benefit less hands-on management essentially lacking economic model makes cloud computing intriguing concept cloud called public cloud services rendered network open public use public cloud services may free technically may little difference public private cloud architecture however security consideration may substantially different services applications storage resources made available service provider public audience communication effected non-trusted network generally public cloud service providers like amazon web services aws ibm oracle microsoft google operate infrastructure data center access generally via internet aws oracle microsoft google also offer direct connect services called aws direct connect oracle fastconnect azure expressroute cloud interconnect respectively connections require customers purchase lease private connection peering point offered cloud provider hybrid cloud composition public cloud private environment private cloud on-premise resources remain distinct entities bound together offering benefits multiple deployment models hybrid cloud also mean ability connect collocation managed and/or dedicated services cloud resources gartner defines hybrid cloud service cloud computing service composed combination private public community cloud services different service providers hybrid cloud service crosses isolation provider boundaries ca n't simply put one category private public community cloud service allows one extend either capacity capability cloud service aggregation integration customization another cloud service varied use cases hybrid cloud composition exist example organization may store sensitive client data house private cloud application interconnect application business intelligence application provided public cloud software service example hybrid cloud extends capabilities enterprise deliver specific business service addition externally available public cloud services hybrid cloud adoption depends number factors data security compliance requirements level control needed data applications organization uses another example hybrid cloud one organizations use public cloud computing resources meet temporary capacity needs met private cloud capability enables hybrid clouds employ cloud bursting scaling across clouds cloud bursting application deployment model application runs private cloud data center bursts public cloud demand computing capacity increases primary advantage cloud bursting hybrid cloud model organization pays extra compute resources needed cloud bursting enables data centers create in-house infrastructure supports average workloads use cloud resources public private clouds spikes processing demands specialized model hybrid cloud built atop heterogeneous hardware called cross-platform hybrid cloud cross-platform hybrid cloud usually powered different cpu architectures example x86-64 arm underneath users transparently deploy scale applications without knowledge cloud hardware diversity kind cloud emerges rise arm-based system-on-chip server-class computing community cloud shares infrastructure several organizations specific community common concerns security compliance jurisdiction etc whether managed internally third-party either hosted internally externally costs spread fewer users public cloud private cloud cost savings potential cloud computing realized cloud computing platform assembled distributed set machines different locations connected single network hub service possible distinguish two types distributed clouds public-resource computing volunteer cloud multicloud use multiple cloud computing services single heterogeneous architecture reduce reliance single vendors increase flexibility choice mitigate disasters etc differs hybrid cloud refers multiple cloud services rather multiple deployment modes public private legacy issues transferring large amounts data cloud well data security data cloud initially hampered adoption cloud big data much data originates cloud advent bare-metal servers cloud become solution use cases including business analytics geospatial analysis hpc cloud refers use cloud computing services infrastructure execute high-performance computing hpc applications applications consume considerable amount computing power memory traditionally executed clusters computers 2016 handful companies including r-hpc amazon web services univa silicon graphics international sabalcore gomput penguin computing offered high performance computing cloud penguin demand pod cloud one first non-virtualized remote hpc services offered pay-as-you-go basis penguin computing launched hpc cloud 2016 alternative amazon ec2 elastic compute cloud uses virtualized computing nodes cloud architecture systems architecture software systems involved delivery cloud computing typically involves multiple cloud components communicating loose coupling mechanism messaging queue elastic provision implies intelligence use tight loose coupling applied mechanisms others cloud engineering application engineering disciplines cloud computing brings systematic approach high-level concerns commercialization standardization governance conceiving developing operating maintaining cloud computing systems multidisciplinary method encompassing contributions diverse areas systems software web performance information technology engineering security platform risk quality engineering cloud computing poses privacy concerns service provider access data cloud time could accidentally deliberately alter delete information many cloud providers share information third parties necessary purposes law order without warrant permitted privacy policies users must agree start using cloud services solutions privacy include policy legislation well end users choices data stored users encrypt data processed stored within cloud prevent unauthorized access identity management systems also provide practical solutions privacy concerns cloud computing systems distinguish authorized unauthorized users determine amount data accessible entity systems work creating describing identities recording activities getting rid unused identities according cloud security alliance top three threats cloud insecure interfaces api data loss leakage hardware failure \u2014which accounted 29 25 10 cloud security outages respectively together form shared technology vulnerabilities cloud provider platform shared different users may possibility information belonging different customers resides data server additionally eugene schultz chief technology officer emagined security said hackers spending substantial time effort looking ways penetrate cloud real achilles heels cloud infrastructure making big holes bad guys get data hundreds thousands companies stored large cloud servers hackers theoretically gain control huge stores information single attack\u2014a process called hyperjacking examples include dropbox security breach icloud 2014 leak dropbox breached october 2014 7 million users passwords stolen hackers effort get monetary value bitcoins btc passwords able read private data well data indexed search engines making information public problem legal ownership data user stores data cloud cloud provider profit many terms service agreements silent question ownership physical control computer equipment private cloud secure equipment site someone else control public cloud delivers great incentive public cloud computing service providers prioritize building maintaining strong management secure services small businesses n't expertise security could find secure use public cloud risk end users understand issues involved signing cloud service persons sometimes n't read many pages terms service agreement click accept without reading important cloud computing becoming popular required services work example intelligent personal assistant apple siri google fundamentally private cloud seen secure higher levels control owner however public cloud seen flexible requires less time money investment user according bruce schneier downside limited customization options cloud computing cheaper economics scale and\u2014like outsourced task\u2014you tend get get restaurant limited menu cheaper personal chef cook anything want fewer options much cheaper price feature bug also suggests cloud provider might meet legal needs businesses need weigh benefits cloud computing risks cloud computing control back end infrastructure limited cloud vendor cloud providers often decide management policies moderates cloud users able deployment cloud users also limited control management applications data services includes data caps placed cloud users cloud vendor allocating certain amount bandwidth customer often shared among cloud users privacy confidentiality big concerns activities instance sworn translators working stipulations nda might face problems regarding sensitive data encrypted cloud computing beneficial many enterprises lowers costs allows focus competence instead matters infrastructure nevertheless cloud computing proven limitations disadvantages especially smaller business operations particularly regarding security downtime technical outages inevitable occur sometimes cloud service providers csps become overwhelmed process serving clients may result temporary business suspension since technology systems rely internet individual able access applications server data cloud outage cloud computing still subject research driving factor evolution cloud computing chief technology officers seeking minimize risk internal outages mitigate complexity housing network computing hardware in-house major cloud technology companies invest billions dollars per year cloud research development example 2011 microsoft committed 90 percent 9.6 billion r budget cloud research investment bank centaur partners late 2015 forecasted saas revenue would grow 13.5 billion 2011 32.8 billion 2016 issue carrying investigations cloud storage devices physically accessed generated number changes way digital evidence located collected new process models developed formalize collection scenarios existing digital forensics tools employed access cloud storage networked drives although slow process generating large amount internet traffic alternative approach deploy tool processes cloud organizations using office 365 'e5 subscription option use microsoft built-in ediscovery resources although provide functionality typically required forensic process", + "neighbors": [ + 17, + 51, + 58, + 68, + 77, + 85, + 86, + 123, + 134, + 141, + 150, + 211, + 216, + 227, + 250, + 261, + 266, + 270, + 280, + 300, + 314, + 330, + 337, + 339, + 340, + 362, + 363, + 375, + 379, + 390, + 399, + 417, + 429, + 465, + 479, + 480, + 505, + 521, + 528, + 556, + 576, + 630, + 661, + 671, + 701, + 715, + 719, + 731, + 737, + 747, + 754, + 755, + 804, + 813, + 814, + 832, + 846, + 847, + 857, + 876, + 909, + 921, + 930, + 936, + 961, + 968, + 1013, + 1019, + 1036, + 1081, + 1089, + 1099, + 1102, + 1106, + 1138, + 1219, + 1220, + 1235, + 1238, + 1295, + 1354, + 1377, + 1431, + 1443, + 1447, + 1452, + 1456, + 1480, + 1507, + 1555, + 1582, + 1583, + 1608, + 1635 + ], + "mask": "Test" + }, + { + "node_id": 612, + "label": 1, + "text": "International_Thylacine_Specimen_Database:international thylacine specimen database international thylacine specimen database itsd culmination four-year research project catalogue digitally photograph known surviving specimen material thylacine thylacinus cynocephalus tasmanian tiger held within museum university private collections itsd first published electronic resource series three cd-roms april 2005 updated july 2006 completely revised may 2009 released single dvd totalling 3.68 gb data images itsd designed free access academic tool promote facilitate undergraduate postgraduate research species accessed offices curators heads department universities museums hold thylacine material alternatively libraries several major zoological societies itsd lists available catalogue data individual specimen e.g holding institution catalogue identification number sex date acquisition specimen type source locality collector field number old additional catalogue numbers purchase exchange information finally additional remarks pertaining specimen support data component significantly enhance educational worth high-resolution digital images specimens included itsd specimen image bank forms largest single photographic resource kind anywhere world primary justification including digital images specimen material within itsd comprises skins skeletons skulls taxidermy mounts wet specimens wet specimens whole animals organs body parts preserved either alcohol formalin specimens thylacine spread extensively around globe search locate specimens outset international search involving total 106 museum university private collections 23 countries master copy itsd held zoological society london mirror copies held within university tasmania hobart australian national wildlife collection canberra queen victoria museum art gallery launceston master mirror copies kept constantly revised updated new information comes light zoological society chosen hold master copy itsd historic association thylacine bulk early scientific papers species published within proceedings society zoo regent park exhibited thylacines zoo outside australia year royal zoological society new south wales hosts whitley awards awards tribute gilbert whitley eminent australian ichthyologist presented outstanding publications contain significant amount new information relating fauna australasian region september 2005 international thylacine specimen database awarded whitley award best zoological database first time history awards whitley citation presented database", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 613, + "label": 4, + "text": "BlueKeep:bluekeep bluekeep security vulnerability discovered microsoft remote desktop protocol implementation allows possibility remote code execution first reported may 2019 present unpatched windows nt-based versions microsoft windows windows 2000 windows server 2008 r2 windows 7 microsoft issued security patch including out-of-band update several versions windows reached end-of-life windows xp 14 may 2019 13 august 2019 related bluekeep security vulnerabilities collectively named dejablue reported affect newer windows versions including windows 7 recent versions windows 10 operating system well older windows versions bluekeep security vulnerability first noted uk national cyber security centre 14 may 2019 reported microsoft vulnerability named bluekeep computer security expert kevin beaumont twitter bluekeep officially tracked wormable remote code execution vulnerability u.s. national security agency issued advisory vulnerability 4 june 2019 microsoft stated vulnerability could potentially used self-propagating worms microsoft based security researcher estimation nearly 1 million devices vulnerable saying theoretical attack could similar scale eternalblue-based attacks notpetya wannacry day nsa advisory researchers cert coordination center disclosed separate rdp-related security issue windows 10 may 2019 update windows server 2019 citing new behaviour rdp network level authentication nla login credentials cached client system user re-gain access rdp connection automatically network connection interrupted microsoft dismissed vulnerability intended behaviour disabled via group policy 1 june 2019 active malware vulnerability seems publicly known however undisclosed proof concept poc codes exploiting vulnerability may available 1 july 2019 sophos british security company reported working example poc order emphasize urgent need patch vulnerability 22 july 2019 details exploit purportedly revealed conference speaker chinese security firm 25 july 2019 computer experts reported commercial version exploit may available 31 july 2019 computer experts reported significant increase malicious rdp activity warn based histories exploits similar vulnerabilities active exploit bluekeep vulnerability wild may imminent 13 august 2019 related bluekeep security vulnerabilities collectively named dejablue reported affect newer windows versions including windows 7 recent versions operating system windows 10 well older windows versions rdp protocol uses virtual channels configured pre-authentication data path client server providing extensions rdp 5.1 defines 32 static virtual channels dynamic virtual channels contained within one static channels server binds virtual channel ms_t120 channel legitimate reason client connect static channel 31 heap corruption occurs allows arbitrary code execution system level windows xp windows vista windows 7 windows server 2003 windows server 2008 windows server 2008 r2 named microsoft vulnerable attack versions newer 7 windows 8 windows 10 affected cybersecurity infrastructure security agency stated also successfully achieved code execution via vulnerability windows 2000 microsoft released patches vulnerability 14 may 2019 windows xp windows vista windows 7 windows server 2003 windows server 2008 windows server 2008 r2 included versions windows end-of-life vista xp server 2003 longer eligible security updates patch forces aforementioned ms_t120 channel always bound 31 even requested otherwise rdp server nsa recommended additional measures disabling remote desktop services associated port used requiring network level authentication nla rdp according computer security company sophos two-factor authentication may make rdp issue less vulnerable however best protection take rdp internet switch rdp needed needed make rdp accessible via vpn", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 813, + 818, + 915, + 961, + 1043, + 1063, + 1162, + 1186, + 1200, + 1270, + 1291, + 1293, + 1327, + 1332, + 1335, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 614, + "label": 4, + "text": "TACACS:tacacs terminal access controller access-control system tacacs usually pronounced like tack-axe refers family related protocols handling remote authentication related services networked access control centralized server original tacacs protocol dates back 1984 used communicating authentication server common older unix networks spawned related protocols tacacs originally developed 1984 bbn technologies administering milnet ran unclassified network traffic darpa time would later evolve u.s. department defense niprnet originally designed means automate authentication \u2013 allowing someone already logged one host network connect another network without needing re-authenticate \u2013 first formally described bbn brian anderson december 1984 ietf rfc 927 cisco systems began supporting tacacs networking products late 1980s eventually adding several extensions protocol 1990 cisco extensions top tacacs became proprietary protocol called extended tacacs xtacacs although tacacs xtacacs open standards craig finseth university minnesota cisco assistance published description protocols 1993 ietf rfc 1492 informational purposes tacacs defined rfc 1492 uses either tcp udp port 49 default tacacs allows client accept username password send query tacacs authentication server sometimes called tacacs daemon simply tacacsd tacacsd uses tcp usually runs port 49 would determine whether accept deny authentication request send response back tip routing node accepting dial-up line connections user would normally want log would allow access based upon response way process making decision opened algorithms data used make decision complete control whomever running tacacs daemon xtacacs stands extended tacacs provides additional functionality tacacs protocol also separates authentication authorization accounting aaa functions separate processes even allowing handled separate servers technologies tacacs+ radius generally replaced tacacs xtacacs recently built updated networks tacacs+ entirely new protocol compatible predecessors tacacs xtacacs tacacs+ uses tcp radius operates udp since tcp connection oriented protocol tacacs+ implement transmission control radius however detect correct transmission errors like packet loss timeout etc since rides udp connectionless radius encrypts users password travels radius client radius server information username authorization accounting transmitted clear text therefore vulnerable different types attacks tacacs+ encrypts information mentioned therefore vulnerabilities present radius protocol tacacs+ cisco designed extension tacacs encrypts full content packet moreover provides granular control command command authorization", + "neighbors": [ + 342, + 762, + 864, + 965, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 615, + "label": 2, + "text": "Windows_System_Assessment_Tool:windows system assessment tool windows system assessment tool winsat module microsoft windows vista windows 7 windows 8 windows 10 available control panel performance information tools except windows 8.1 windows 10 measures various performance characteristics capabilities hardware running reports windows experience index wei score wei includes five subscores processor memory 2d graphics 3d graphics disk basescore equal lowest subscores average subscores winsat reports wei scores scale 1.0 5.9 windows vista 7.9 windows 7 9.9 windows 8 windows 10 wei enables users match computer hardware performance performance requirements software example aero graphical user interface automatically enabled unless system wei score 3 higher wei also used show part system would expected provide greatest increase performance upgraded example computer lowest subscore memory would benefit ram upgrade adding faster hard drive component detailed raw performance information like actual disk bandwidth obtained invoking codice_1 command line also allows specific tests re-run obtaining wei score command line done invoking codice_2 also updates value stored codice_3 xml files stored easily hacked report fake performance values wei also available applications api configure function hardware performance taking advantage capabilities without becoming unacceptably slow windows experience index score displayed windows 8.1 onwards graphical user interface winsat removed versions windows although command line winsat tool still exists operates correctly along final score launching command shell games according article pc pro microsoft removed winsat gui order promote idea kinds hardware run windows 8 equally well 2003 game developers conference dean lester microsoft general manager windows graphics gaming stated interview gamespot microsoft intended focus improvements pc gaming experience part new gaming initiative next version windows windows vista codenamed longhorn lester stated part initiative operating system would include games folder would centralize settings pertinent gamers among features display driver streamlining parental controls games ability start windows game directly optical media installation\u2014in manner similar games designed video game console microsoft would also require new method displaying system requirements retail packaging windows games rating system would categorize games based numerical system 2004 lester expanded microsoft intentions stating company would work hardware manufacturers create pcs windows vista used level system designate performance capabilities system hardware xbox 360 peripherals would fully compatible operating system windows experience index feature windows vista relies measurements taken winsat provide accurate assessment system capabilities\u2014these capabilities presented form rating higher rating indicates better performance preliminary design elements created microsoft robert stein 2004 suggest winsat intended rate user hardware out-of-box experience design decision would retained operating system release manufacturing windows hardware engineering conference 2005 microsoft formally unveiled existence winsat presented technology games one would allow windows vista make decisions whether enable desktop composition based machine hardware capabilities winsat would remain key focus throughout development operating system release manufacturing winsat windows vista windows 7 performs following tests running tests show progress bar working background animation aero glass deactivated windows vista windows 7 testing tool properly assess graphics card cpu windows 8 winsat runs maintenance scheduler every week default schedule 1am sundays maintenance scheduler collates various os tasks schedule computer randomly interrupted individual tasks scheduler wakes computer sleep runs scheduled tasks puts computer back sleep weekly task winsat runs long enough detect hardware changes tests run winsat simply ends existing scores must valid winsat perform tests laptop battery-operated", + "neighbors": [ + 26, + 66, + 79, + 85, + 93, + 148, + 153, + 255, + 262, + 268, + 270, + 272, + 278, + 295, + 312, + 326, + 336, + 344, + 377, + 433, + 435, + 485, + 521, + 558, + 574, + 638, + 643, + 662, + 689, + 705, + 764, + 791, + 801, + 865, + 904, + 920, + 961, + 989, + 1025, + 1035, + 1042, + 1050, + 1092, + 1098, + 1109, + 1110, + 1138, + 1151, + 1212, + 1243, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1517, + 1531, + 1533, + 1545, + 1547, + 1561, + 1587, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 616, + "label": 1, + "text": "Supra-entity:supra-entity supra-entity conceptual element derived entity-relationship e-r technique information system modeling similar entity defined higher level encompassing individual entity occurrences parts groups groups parts parts groups concepts supra-entity supra-relationship supra-attribute created published gonz\u00e1lez muller work \u201c business entity-relationship model innovation entrepreneurship management \u201d applied first time work conceptually model key elements interrelationships \u201c business \u201d reality supra-entities supra-relationships supra-attributes objective covering diversity situations perspectives existing reality integrated representation higher level individual occurrences multiple parts groups entities relationships according different criteria structures properties attributes association supra-entities level partition grouping supra-entity formed individual entities multiple structures entity parts multiple structures entity groups multiple structures groups entity parts parts entity groups associated closed squared structure shown attached diagram representation multiple structures parts groups groups parts parts entity groups form supra-entity done strips connecting different elements instead usual line symbol used single structure entity-relationship models example supra-entity products business sector shown next diagram addition application modeling development databases information systems supra-entities supra-relationships allow redefinition concept innovation degrees types clarity amplitude facilitates generation ideas innovation capacity general business innovation defined supra-entity domain scope consists creation generation introduction new occurrences supra-entity elements good results success first invention major innovation improved minor incremental innovation including new occurrences replicate similar previous ones example apply definition innovation supra-entity products obtain product innovations consist creation generation introduction market new element occurrences supra-entity products good results success first invention major innovation improved minor incremental innovation including new occurrences replicate similar previous ones business innovation traditionally identified introduction marketing new improved products processes market innovation necessarily require technological innovate identifying new needs new customer segments new ways getting product customer new forms agreements contracting new environments etc summary possible innovate different supra-entities supra-relationships constitute business entity-relationship model achieving different types innovations increasing innovation capacity business", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 617, + "label": 4, + "text": "Anti-spam_techniques_(users):anti-spam techniques users people tend much less bothered spam slipping filters mail box false negatives desired e-mail ham blocked false positives trying balance false negatives missed spams vs false positives rejecting good e-mail critical successful anti-spam system servers able block spam tools individual users help control balance number techniques individuals use restrict availability e-mail addresses reducing preventing attractiveness spam sharing email address among limited group correspondents one way limit spam method relies discretion members group disclosing email addresses outside group circumvents trust relationship group reason forwarding messages recipients n't know one another avoided absolutely necessary forward messages recipients n't know one another good practice list recipient names bcc instead practice avoids scenario unscrupulous recipients might compile list email addresses spamming purposes practice also reduces risk address distributed computers affected email address harvesting malware however privacy email address lost divulgence likely regained posting anonymously fake name address one way avoid e-mail address harvesting users ensure fake address valid users want receive legitimate email regarding posts web sites alter addresses humans figure spammers instance joe example.com might post joenos pam.invalid.example.com address munging however cause legitimate replies lost user valid address truly invalid otherwise someone server still get spam ways use transparent address munging avoid allowing users see actual address obfuscate automated email harvesters methods displaying part e-mail address web page image text logo shrunken normal size using in-line css jumbled text order characters restored using css spammers often regard responses messages\u2014even responses like n't spam \u2014as confirmation email address valid likewise many spam messages contain web links addresses user directed follow removed spammer mailing list several cases spam-fighters tested links confirming lead recipient address removal\u2014if anything lead spam removal request filing complaint may get address list washed lower complaints spammer stay active acquire new accounts and/or internet provider sender addresses often forged spam messages including using recipient address forged sender address responding spam may result failed deliveries may reach innocent e-mail users whose addresses abused usenet widely considered even important avoid responding spam many isps software seek destroy duplicate messages someone may see spam respond cancelled server effect reposting spam since duplicate reposted copy last longer replying may also cause poster falsely linked part spam message contact forms allow users send email filling forms web browser web server takes form data forwarding email address users never see email address forms however sometimes inconvenient users able use preferred e-mail client risk entering faulty reply address typically notified delivery problems contact forms drawback require website supports server side scripts finally software used run contact forms badly designed become spam tool right additionally spammers begun send spam using contact form many modern mail programs incorporate web browser functionality display html urls images easily expose user offensive images spam addition spam written html contain web bugs allows spammers see e-mail address valid message caught spam filters javascript programs used direct user web browser advertised page make spam message difficult close delete spam messages contained attacks upon security vulnerabilities html renderer using holes install spyware computer viruses borne mechanisms mail clients automatically download display html images attachments fewer risks clients configured display default email user may sometimes need give address site without complete assurance site owner use sending spam one way mitigate risk provide disposable email address\u2014a temporary address user disable abandon forwards email real account number services provide disposable address forwarding addresses manually disabled expire given time interval expire certain number messages forwarded disposable email addresses used users track whether site owner disclosed address capability resulted legal jeopardy sites disclose confidential addresses without permission systems use ham passwords ask unrecognised senders include email password demonstrates email message ham spam message typically email address ham password would described web page ham password would included subject line email address ham passwords often combined filtering systems counter risk filtering system accidentally identify ham message spam message plus addressing technique appends password username part email address tracking spammer isp reporting offense lead spammer service terminated criminal prosecution unfortunately difficult track spammer\u2014and online tools assist always accurate occasionally spammers employ netblocks case abuse contact netblock spammer confirm address examples online tools spamcop network abuse clearinghouse provide automated semi-automated means report spam isps spam-fighters regard inaccurate compared expert email system however email users experts free tool called complainterator may used reporting spam complainterator send automatically generated complaint registrar spamming domain registrar name servers historically reporting spam way seriously abated spam since spammers simply move operation another url isp network ip addresses consumers may also forward unwanted deceptive commercial email email address spam uce.gov maintained us federal trade commission ftc database collected used prosecute perpetrators scam deceptive advertising alternative contacting isps contact registrar domain name used spam e-mail registrars icann-accredited administrative organizations obliged uphold certain rules regulations resources necessary dealing abuse complaints advocate responding aggressively spam\u2014in words spamming spammer basic idea make spamming less attractive spammer increasing spammer overhead several ways reach spammer besides caveats mentioned may lead retaliations spammer variety techniques e-mail senders use try make sure send spam failure control amount spam sent judged e-mail receivers often cause even legitimate email blocked sender put dnsbls since spammer accounts frequently disabled due violations abuse policies constantly trying create new accounts due damage done isp reputation source spam many isps web email providers use captchas new accounts verify real human registering account automated spamming system also verify credit cards stolen accepting new customers check spamhaus project rokso list background checks one difficulty implementing opt-in mailing lists many means gathering user email addresses remain susceptible forgery instance company puts web form allow users subscribe mailing list products malicious person enter people email addresses \u2014 harass make company appear spamming anti-spammers company sends e-mail forgery victims spamming albeit inadvertently prevent abuse maps anti-spam organizations encourage mailing lists use confirmed opt-in also known verified opt-in double opt-in whenever email address presented subscription list list software send confirmation message address confirmation message contains advertising content construed spam \u2014 address added live mail list unless recipient responds confirmation message see also spamhaus mailing lists vs. spam lists page modern mailing list management programs gnu mailman listserv majordomo qmail ezmlm support confirmed opt-in default e-mail senders type anti-spam checks e-mail coming users customers done e-mail coming rest internet sort bounce message anti-virus warning gets sent forged email address result backscatter problems sending challenges forged e-mail addresses greatly reduced creating new message contains challenge instead challenge placed bounce message receiving mail system gives rejection-code smtp session receiving mail system rejects e-mail way sending system actually creates bounce message result bounce message almost always sent real sender format language sender usually recognize firewalls routers programmed allow smtp traffic tcp port 25 machines network supposed run mail transfer agents send e-mail practice somewhat controversial isps block home users especially isps allow blocking turned upon request e-mail still sent computers designated smart hosts via port 25 smart hosts via e-mail submission port 587 network address translation used intercept port 25 smtp traffic direct mail server enforces rate limiting egress spam filtering commonly done hotels cause e-mail privacy problems well making impossible use starttls smtp-auth port 587 submission port n't used machines suddenly start sending lots e-mail may well become zombie computers limiting rate e-mail sent around typical computer question legitimate e-mail still sent large spam runs slowed manual investigation done monitoring spam reports places spamcop aol feedback loop network abuse clearinghouse domain abuse mailbox etc. isps often learn problems seriously damage isp reputation mail servers blacklisted malicious software human spam senders often use forged addresses sending spam messages control may enforced smtp servers ensure senders use correct email address field outgoing messages email users database user record e-mail address smtp server must check email address field outgoing message address belongs user credentials supplied smtp authentication field forged smtp error returned email client e.g email address trying send isps webmail providers either acceptable use policy aup terms service tos agreement discourages spammers using system allows spammer terminated quickly violations increasingly anti-spam efforts led co-ordination law enforcement researchers major consumer financial service companies internet service providers monitoring tracking e-mail spam identity theft phishing activities gathering evidence criminal cases appropriate legislation enforcement significant impact spamming activity penalty provisions australian spam act 2003 dropped australia ranking list spam-relaying countries email spam tenth twenty-eighth legislation provides mandates bulk emailers must follow makes compliant spam easier identify filter analysis sites spamvertised given piece spam often leads questionable registrations internet domain names since registrars required maintain trustworthy whois databases digging registration details complaining proper locations often results site shutdowns uncoordinated activity may effective given today volume spam rate criminal organizations register new domains however coordinated effort implemented adequate infrastructure obtain good results since spamming facilitated fact large volumes email inexpensive send one proposed set solutions would require senders pay cost order send email making prohibitively expensive spammers anti-spam activist daniel balsam attempts make spamming less profitable bringing lawsuits spammers number proposals sideband protocols assist smtp operation anti-spam research group asrg internet research task force irtf working number email authentication proposals providing simple source authentication flexible lightweight scalable recent internet engineering task force ietf activities include marid 2004 leading two approved ietf experiments 2005 domainkeys identified mail 2006 dmarc stands domain-based message authentication reporting conformance standardizes email receivers perform email authentication using well-known sender policy framework spf dkim mechanisms channel email new proposal sending email attempts distribute anti-spam activities forcing verification probably using bounce messages back-scatter n't occur first email sent new contacts smtp proxies allow combating spam real time combining sender behavior controls providing legitimate users immediate feedback eliminating need quarantine statistical bayesian filtering set requires administrative maintenance per se instead users mark messages spam nonspam filtering software learns judgements thus statistical filter reflect software author administrator biases content rather user biases example biochemist researching viagra wo n't messages containing word viagra automatically flagged spam viagra show often legitimate messages still spam emails containing word viagra get filtered content rest spam messages differs significantly content legitimate messages statistical filter also respond quickly changes spam content without administrative intervention long users consistently designate false negative messages spam received email statistical filters also look message headers thereby considering content also peculiarities transport mechanism email typical statistical filtering uses single words calculations decide message classified spam powerful calculation made using groups two words taken together random noise words used successfully fool filter software programs implement statistical filtering include bogofilter dspam spambayes assp e-mail programs mozilla mozilla thunderbird mailwasher later revisions spamassassin another interesting project crm114 hashes phrases bayesian classification phrases also free mail filter popfile sorts mail many categories user wants family friends co-worker spam whatever bayesian filtering spam subject several research conferences including", + "neighbors": [ + 491, + 509, + 620, + 1090, + 1094, + 1171, + 1172, + 1249, + 1395, + 1446, + 1510, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 618, + "label": 3, + "text": "Alien_8:alien 8 alien 8 action-adventure video game developed published ultimate play game released zx spectrum bbc micro amstrad cpc msx 1985 game spiritual successor best-selling knight lore lauded critics isometric graphics game player takes control robot alien 8 whose job ensure cryogenically frozen passengers board starship remain viable ship voyage game written chris stamper graphics designed tim stamper alien 8 uses image masking technique knight lore allows developers create composite structures stacked images without visual overlay technique copyrighted ultimate filmation game engine spiritual predecessor game rendered isometric projection game critically acclaimed upon release reviewers praised game graphics innovation however minor criticism directed similarities knight lore game presented isometric format set board starship taking role robot alien 8 player must explore large starship order ensure cryogenic life support systems preserving biological crew re-activated core system series geometrically-shaped circuits however circuits removed invading aliens distributed around starship main objective game collect correct circuits return respective locations starship reaches destination circuits variously shaped cubes pyramids domes cylinders spiritual predecessor environment game takes form series isometric flip-screen rooms trace outline large starship total 129 rooms filled various objects moveable platforms static hazards spikes hostile aliens well executing well-timed manoeuvres jumps player able use starship props block defend another feature use remote controlled drones directed alien 8 inaccessible dangerous areas dying planet distant galaxy last creatures known guardians stored libraries records knowledge single starship together cryogenically preserved members race single robot alien 8 tasked keeping occupants vessel alive duration journey ship launched towards new solar system alien 8 performs task thousands years journey however ship nears destination attacked boarded hostile aliens cryogenic life support systems damaged attack alien 8 must restore operational status ship automatic thrusting systems manoeuvre planetary orbit development alien 8 began immediately release knight lore stamper brothers predicted publishers would attempt copy knight lore filmation technology games predecessor stamper brothers developed game monochrome avoid visual overlay attribute clash common processing limitation early 8-bit consoles however amstrad release exclusively displayed dual-colours game critically acclaimed upon release reviewer crash praised graphics presentation stating excellent imaginative pleasing compared predecessor despite regarding slight difference amstrad action similarly praised graphics citing amazing brilliant great colour combinations reviewer amtix stated visuals breathtakingly stunning improves predecessor david kelly popular computing weekly stated game little disappointment due similarities knight lore however asserted graphics superior quality predecessor chris bourne sinclair user stated general quality graphics higher predecessor although used identical system crash praised new additions game particular time limit various collectable items reviewer stated new features compelling exciting differs predecessor reviewer amstrad action similarly praised innovation stating wonderfully original ideas despite criticising similarities knight lore kelly praised game extra puzzles animation enemies heralding brilliant bourne similarly praised 3d animation stating every extension game improved knight lore", + "neighbors": [ + 48, + 321, + 822, + 1307, + 1312 + ], + "mask": "Test" + }, + { + "node_id": 619, + "label": 2, + "text": "Nokia_E5-00:nokia e5-00 nokia e5-00 also called nokia e5 qwerty smartphone runs symbian os v9.3 operating system like phones nokia eseries targeted b2b comes business software applications including quickoffice office document editor released third quarter 2010 comes candybar form factor casing five color options e5-00 similar e72 dram memory e72 also important cost reductions one cost reduction technology lcds screen e5-00 transmissive lcd display e-72 transflective lcd e5 supports 256k display colors important cost reductions removal secondary camera accelerometer digital compass third full focus camera extends depth field without narrowing aperture instead autofocus e5-00 smaller battery 1200 mah e-72 1500 talk-time 8 hours stand time 10 days also features gps integrated assisted runs nokia maps 3.0 ovi maps nokia e5 supports mail exchange ibm lotus notes traveler corporate emails e5 supports hd voice nokia e5-00 features im instant messenger allowing access several chat services communities simultaneously include yahoo messenger google talk skype wechat whatsapp windows live messenger reception e5 generally positive cnet uk praised quality full qwerty keyboard criticized performance 320 x 240 pixel lcd quoting virtually impossible see direct sunlight softpedia contrast stated lcd worked perfectly sunlight softpedia wrote e5-00 all-rounder performs decent areas though also stated camera strong point", + "neighbors": [ + 3, + 21, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 527, + 603, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 620, + "label": 4, + "text": "Apache_SpamAssassin:apache spamassassin apache spamassassin computer program used e-mail spam filtering uses variety spam-detection techniques including dns-based fuzzy-checksum-based spam detection bayesian filtering external programs blacklists online databases released apache license 2.0 part apache foundation since 2004 program integrated mail server automatically filter mail site also run individual users mailbox integrates several mail programs apache spamassassin highly configurable used system-wide filter still configured support per-user preferences apache spamassassin created justin mason maintained number patches earlier program named filter.plx mark jeftovic turn begun august 1997 mason rewrote jeftovic code scratch uploaded resulting codebase sourceforge april 20 2001 summer 2004 project became apache software foundation project later officially renamed apache spamassassin spamassassin 3.4.2 release first well three years developers say project picked new set developers moving forward apache spamassassin perl-based application mail :spamassassin cpan usually used filter incoming mail one several users run standalone application subprogram another application milter sa-exim exiscan mailscanner mimedefang amavis client spamc communicates daemon spamd client/server embedded mode operation performance benefits certain circumstances may introduce additional security risks typically either variant application set generic mail filter program called directly mail user agent supports whenever new mail arrives mail filter programs procmail made pipe incoming mail apache spamassassin adjustment user .procmailrc file apache spamassassin comes large set rules applied determine whether email spam rules based regular expressions matched body header fields message apache spamassassin also employs number spam-fighting techniques rules called tests spamassassin documentation test score value assigned message matches test criteria scores positive negative positive values indicating spam negative ham non-spam messages message matched tests apache spamassassin combines results global score assigned message higher score higher probability message spam apache spamassassin internal configurable score threshold classify message spam usually message considered spam matches multiple criteria matching single test usually enough reach threshold apache spamassassin considers message spam rewritten default configuration content mail appended mime attachment brief excerpt message body description tests resulted mail classified spam score lower defined settings default information tests passed total score still added email headers used post-processing less severe actions tagging mail suspicious apache spamassassin allows per-user configuration behavior even installed system-wide service configuration read file database configuration users specify individuals whose emails never considered spam change scores certain rules user also define list languages want receive mail apache spamassassin assigns higher score mails appear written another language apache spamassassin based heuristics pattern recognition software exhibits false positives false negatives apache spamassassin also supports methods added reasonably easily writing perl plug-in apache spamassassin apache spamassassin reinforces rules bayesian filtering user administrator feeds examples good ham bad spam filter order learn difference two purpose apache spamassassin provides command-line tool sa-learn instructed learn single mail entire mailbox either ham spam typically user move unrecognized spam separate folder run sa-learn folder non-spam folder spam separately alternatively mail user agent supports sa-learn called individual emails regardless method used perform learning spamassassin bayesian test help score future e-mails based learning improve accuracy apache spamassassin free/open source software licensed apache license 2.0 versions prior 3.0 dual-licensed artistic license gnu general public license codice_1 utility distributed apache spamassassin compiles spamassassin ruleset deterministic finite automaton allows apache spamassassin use processor power efficiently apache spamassassin designed trigger gtube 68-byte string similar antivirus eicar test file string inserted rfc 5322 formatted message passed apache spamassassin engine apache spamassassin trigger weight 1000", + "neighbors": [ + 178, + 192, + 197, + 229, + 296, + 306, + 318, + 425, + 515, + 617, + 620, + 646, + 715, + 741, + 751, + 796, + 874, + 1091, + 1094, + 1138, + 1163, + 1172, + 1227, + 1249, + 1254, + 1454, + 1554, + 1583, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 621, + "label": 4, + "text": "Dexter_(malware):dexter malware dexter computer virus point sale malware infects computers running microsoft windows discovered security firm seculert december 2012 infects pos systems worldwide steals sensitive information credit card debit card information december 2013 researchers discovered stardust major revision dexter compromised 20,000 cards active campaign hitting us merchants one first known botnets target point-of-sale pos terminals used stores restaurants process customers credit debit card payments", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 898, + 915, + 1043, + 1063, + 1090, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 622, + "label": 2, + "text": "Series_30+:series 30+ series 30+ abbreviated s30+ software platform application user interface used nokia-branded mobile devices platform introduced nokia september 2013 first appearing nokia 108 main nokia feature phone operating system end series 30 series 40 platforms 2014 despite similar name user interface s30+ technically completely different unrelated s30 many s30+ devices support maui runtime environment mre developed mediatek later devices included support j2me applications even models n't support java j2me applications still capable running built-in online applications opera mini browser bing search msn weather skype groupme chat s30+ models also come online shop would allow downloading new apps games platform taken nokia microsoft mobile 2014 hmd global 2016 although devices still selling brand nokia following feature phones use series 30+ platform available single dual sim models maximum accepted video resolution 854\u00d7480", + "neighbors": [ + 3, + 21, + 101, + 113, + 162, + 238, + 253, + 264, + 298, + 309, + 337, + 484, + 520, + 527, + 583, + 603, + 619, + 622, + 707, + 726, + 957, + 961, + 1018, + 1020, + 1051, + 1117, + 1138, + 1140, + 1176, + 1203, + 1287, + 1304, + 1314, + 1422, + 1493, + 1520, + 1522, + 1529, + 1602, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 623, + "label": 5, + "text": "OmniWeb:omniweb omniweb proprietary internet web browser developed marketed omni group exclusively apple macos operating system though longer maintained still available free download omniweb originally developed omni group nextstep platform released lighthouse design march 17 1995 one month development time nextstep evolved openstep mac os x omniweb updated run platforms omniweb also able run microsoft windows yellow box openstep frameworks lighthouse design bought sun microsystems omni group released product version 2.5 onwards version 4.0 onwards omniweb developed solely os x platform omniweb developed using cocoa api allowed take full advantage os x features used quartz render images smooth text use multiple processors available featured interface made use aqua ui features drawers sheets customizable toolbars omniweb originally employed proprietary html layout engine used standard api nstext components however engine slow particularly scrolling fully compatible recent web standards cascading style sheets omniweb version 4.5 omni group adopted apple khtml-based webcore rendering engine created apple safari browser august 11 2004 omni group released version 5.0 omniweb included number new features notable feature unusual implementation tabbed browsing tabs displayed vertically drawer side window including optional thumbnail pictures pages despite certain amount controversy merits tab drawer tab toolbar feature persisted final version september 7 2006 version 5.5 released major new features included use custom version webkit instead webcore universal binary support saving web archive support user-defined style sheets select next link feature ftp folder display ad-blocking improvements updated localizations many small changes bug fixes omniweb omni group flagship app os x web browsers improved\u2014apple eventually bundled safari os x\u2014 omni successfully introduced products omnigraffle omnioutliner omniweb importance diminished omniweb price successively lowered first 39.95 february 24 2009 omni group announced omniweb would made available free change previous price 14.95 omni group official website states browser longer active development omniweb popular early 2000s omnigroup experience developing openstep became foundation mac os x gave edge developers apple safari omniweb best support mac os x technologies among competition chiefly mozilla firefox internet explorer mac john siracusa technology journalist critic writing ars technica said finding level functionality proper mac os x application respected developer proven track record like finding perfect 1/10,000th scale replica eiffel tower box crackerjacks tower transforms tiny robot makes lunch", + "neighbors": [ + 14, + 16, + 83, + 95, + 107, + 258, + 277, + 395, + 427, + 452, + 491, + 509, + 530, + 531, + 577, + 580, + 582, + 585, + 627, + 646, + 668, + 684, + 713, + 734, + 780, + 862, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1189, + 1195, + 1210, + 1228, + 1280, + 1331, + 1339, + 1376, + 1378, + 1408, + 1423, + 1424, + 1528, + 1550, + 1563, + 1569, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 624, + "label": 4, + "text": "FinFisher:finfisher finfisher also known finspy surveillance software marketed lench solutions plc markets spyware law enforcement channels finfisher covertly installed targets computers exploiting security lapses update procedures non-suspect software company criticized human rights organizations selling capabilities repressive non-democratic states known monitoring imprisoning political dissidents egyptian dissidents ransacked offices egypt secret police following overthrow egyptian president hosni mubarak reported discovered contract gamma international \u20ac287,000 license run finfisher software 2014 american citizen sued ethiopian government surreptitiously installing finspy onto computer america using wiretap private skype calls monitor entire family \u2019 every use computer period months lench solutions plc uk-based branch gamma international ltd andover england germany-based branch gamma international gmbh munich gamma international subsidiary gamma group specializing surveillance monitoring including equipment software training services reportedly owned william louthean nelson shell corporation british virgin islands shell corporation signed nominee director order withhold identity ultimate beneficiary nelson common system companies established offshore august 6 2014 finfisher source code pricing support history related data retrieved gamma international internal network made available internet addition spyware finfisher suite offered gamma intelligence community includes monitoring ongoing developments updating solutions techniques complement developed intelligence agencies software suite company calls remote monitoring deployment solutions ability take control target computers capture even encrypted data communications using enhanced remote deployment methods install software target computers intrusion training program offered includes training methods techniques use company-supplied software suite marketed arabic english german french portuguese russian offered worldwide trade shows offering intelligence support system iss training products law enforcement intelligence agencies finfisher malware installed various ways including fake software updates emails fake attachments security flaws popular software sometimes surveillance suite installed target accepts installation fake update commonly used software code install malware also detected emails software designed evade detection antivirus software versions work mobile phones major brands security flaw apple itunes allowed unauthorized third parties use itunes online update procedures install unauthorized programs gamma international offered presentations government security officials security software trade shows described covertly install finfisher spy software suspects computers using itunes update procedures security flaw itunes finfisher reported exploited first described 2008 security software commentator brian krebs apple patch security flaw three years november 2011 apple officials offered explanation flaw took long patch promotional videos used firm trade shows illustrate infect computer surveillance suite released wikileaks december 2011 2014 ethiopian government found installed finspy computer american citizen via fake email attachment appeared microsoft word document finfisher also found engage politically motivated targeting ethiopia instance photos political opposition group used bait infect users technical analysis malware methods infection persistence techniques published code security blog four parts 12 march 2013 reporters without borders named gamma international one five corporate enemies internet \u201c digital era mercenaries \u201d selling products used governments violate human rights freedom information finfisher technology used bahrain reporters without borders together privacy international european center constitutional human rights ecchr bahrain centre human rights bahrain watch filed organisation economic co-operation development oecd complaint asking national contact point united kingdom investigate gamma \u2019 possible involvement bahrain since research shown finfisher technology used australia austria bahrain bangladesh britain brunei bulgaria canada czech republic estonia ethiopia germany hungary india indonesia japan latvia lithuania macedonia malaysia mexico mongolia netherlands nigeria pakistan panama qatar romania serbia singapore south africa turkey turkmenistan united arab emirates united states venezuela vietnam finfisher capable masquerading legitimate programs mozilla firefox april 30 2013 mozilla announced sent gamma cease-and-desist letter trademark infringement gamma created espionage program entitled firefox.exe even provided version number trademark claims appear legitimate firefox software article pc magazine bill marczak member bahrain watch computer science phd student university california berkeley research finfisher said finspy mobile gamma mobile spyware saw respect desktop version finfisher antivirus alone n't enough bypassed antivirus scans article author sara yin analyst pc magazine predicted antivirus providers likely updated signatures detect finspy mobile according announcements eset finfisher finspy detected eset antivirus software win32/belesak.d trojan security vendors claim products block spyware know detect regardless may launched eugene kaspersky head security company kaspersky lab stated detect malware regardless purpose origin two years statement eugene kaspersky 2012 description technique used finfisher evade kaspersky protection published part 2 relevant blog code security", + "neighbors": [ + 11, + 43, + 91, + 141, + 149, + 158, + 190, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 450, + 487, + 531, + 533, + 550, + 564, + 576, + 577, + 588, + 600, + 604, + 613, + 621, + 665, + 675, + 692, + 708, + 739, + 746, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1090, + 1101, + 1162, + 1186, + 1270, + 1293, + 1309, + 1325, + 1327, + 1332, + 1336, + 1342, + 1365, + 1379, + 1393, + 1436, + 1444, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 625, + "label": 5, + "text": "IMessage:imessage imessage instant messaging service developed apple inc launched 2011 supported messages application ios 5 later os x mountain lion later imessage announced scott forstall wwdc 2011 keynote june 6 2011 version messages app ios support imessage included ios 5 update october 12 2011 february 16 2012 apple announced new messages app replacing ichat would part os x mountain lion mountain lion released july 25 2012 october 23 2012 apple ceo tim cook announced apple device users sent 300 billion messages using imessage apple delivers average 28,000 messages per second february 2016 eddy cue announced number imessages sent per second grown 200,000 may 2014 lawsuit filed apple issue user switches apple device non-apple device messages delivered imessage would reach destination november 2014 apple addressed problem providing instructions online tool deregister imessage federal court dismissed suit apple favor march 21 2016 group researchers johns hopkins university published report demonstrated attacker possession imessage ciphertexts could potentially decrypt photos videos sent via service researchers published findings vulnerability patched apple may 3 2016 independent open-source project named piemessage announced app developer eric chee consisting code os x communicates imessage connects android client allowing android client send receive messages june 13 2016 apple announced addition apps imessage service accessible via messages apps apps create share content add stickers make payments within imessage conversations without switch standalone apps one could develop standalone imessage apps extension existing ios apps publishers also create standalone stickers apps without writing code according sensor tower march 2017 imessage app store features nearly 5,000 message-enabled apps imessage allows users send texts documents photos videos contact information group messages internet ios macos users imessage alternative sms mms messaging users devices running ios 5 later send sms setting messages cause message sent via sms sender active internet connection receiver internet connection message stored server connection restored imessage accessible messages app iphone ipad ipod touch running ios 5 later mac running os x mountain lion later owners devices register one email addresses apple additionally iphone owners register phone numbers apple provided carrier supported message sent mobile number messages check apple mobile number set imessage message seamlessly transition imessage sms messages user sent communication aligned right replies people left user see imessage user typing message pale gray ellipsis appears text bubble user reply started also possible start conversation one ios device continue another iphones green buttons text bubbles indicate sms-based communication ios devices blue buttons text bubbles indicate imessage communication imessages encrypted tracked using delivery receipts recipient enables read receipts sender able see recipient read message imessage also allows users set chats two people\u2014a group chat launch ios 10 users send messages accompanied range bubble screen effects holding send button force range effects surfaced users select effect sent receiver imessage protocol based apple push notification service apns \u2014a proprietary binary protocol sets keep-alive connection apple servers every connection unique code acts identifier route used send message specific device connection encrypted tls using client-side certificate requested device activation imessage november 12 2012 chetan sharma technology strategy consulting firm published us mobile data market update q3 2012 noting decline text messaging united states suggested decline may attributed americans using alternative free messaging services imessage 2017 google announced would compete imessage messaging service android messaging november 4 2014 electronic frontier foundation eff listed imessage secure messaging scorecard giving score 5 7 points received points communications encrypted transit communications encrypted keys provider n't access end-to-end encryption past communications secure keys stolen forward secrecy security designs well-documented recent independent security audit missed points users verify contacts identities source code open independent review september 2015 matthew green noted imessage display key fingerprints out-of-band verification users unable verify man-in-the-middle attack occurred post also noted imessage uses rsa key exchange means opposed eff scorecard claims imessage feature forward secrecy august 7 2019 researchers project zero presented 6 \u201c interaction-less \u201d exploits imessage could used takeover control user \u2019 device 6 exploits fixed ios 12.4 released july 22 2019 however stil undisclosed exploits patched future update", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 214, + 228, + 252, + 269, + 345, + 356, + 376, + 394, + 395, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 692, + 696, + 797, + 810, + 858, + 877, + 883, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1189, + 1237, + 1262, + 1292, + 1305, + 1334, + 1339, + 1373, + 1409, + 1443, + 1448, + 1488, + 1496, + 1544, + 1582, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 626, + "label": 3, + "text": "Empire_City:_1931:empire city 1931 also known street fight shooting gallery game originally released arcades 1986 game players taking mafia 1931 new york city gunning mobsters one one versions game released family computer 1987 msx 1988 acclaim advertised release nintendo entertainment system western regions console version remained exclusive japan seibu kaihatsu eventually released follow-up game dead angle game set 1931 new york city player controls young man must avenge family members killed gang shootout period several months targets mobsters culminating mafia boss players move crosshair around screen aim shoot mobsters one time lurk around various areas including street windows arrow appears helps direct players location next mobster onscreen players set amount time find shoot enemy time running speech bubble appears counting last seconds timer timer reaches zero player shot screen pans location enemy defend button available last resort avoid shot players replenish ammo shooting hidden ammunition boxes get bonus points shooting gold bars levels cleared set number mobsters eliminated game final level player one opportunity assassinate mob boss walks front windows building final level completed game loops back beginning famicom version largely player progress restored time famicom version using password system four numbers and/or letters review computer video games said game fast moving lots action called unusual addictive game bound winner", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 627, + "label": 5, + "text": "CompuServe:compuserve compuserve compuserve information service also known initialism cis first major commercial online service provider united states described 1994 oldest big three information services others prodigy america online dominated field 1980s remained major influence mid-1990s peak early 1990s cis known online chat system message forums covering variety topics extensive software libraries computer platforms series popular online games notably megawars iii island kesmai also known introduction gif format pictures gif exchange mechanism 1997 17 years h r block acquired cis parent announced desire sell company complex deal worked worldcom acting broker resulting cis sold aol 2015 verizon acquired aol including compuserve division 2017 verizon completed acquisition yahoo compuserve became part verizon newly formed oath inc. subsidiary compuserve founded 1969 compu-serv network inc. columbus ohio subsidiary golden united life insurance focus business customers though golden united founder harry gard sr. son-in-law jeffrey wilkins widely miscredited first president compuserve first president john r. goltz wilkins replaced goltz ceo within first year operation goltz wilkins graduate students electrical engineering university arizona early recruits university included sandy trevor inventor compuserve cb simulator chat system doug chinnock larry shelley company objectives twofold provide in-house computer processing support golden united life insurance develop independent business computer time-sharing industry renting time pdp-10 midrange computers business hours spun separate company 1975 trading nasdaq symbol cmpu concurrently company recruited executives shifted focus offering time-sharing services customers wrote applications one focused packaged applications first new executives robert tillson left service bureau corporation subsidiary control data corporation originally formed division ibm become compuserve executive vice president marketing recruited charles mccall followed jeff wilkins ceo later became ceo medical information firm hbo co. maury cox became ceo departure mccall robert massey followed cox ceo 1977 compuserve board changed company name compuserve incorporated 1979 began offering dial-up online information service consumers 1980 h r block acquired compuserve aol entry pc market 1991 marked beginning end cis aol charged 2.95 hour versus 5.00 hour compuserve aol used freely available gui-based client compusserve n't free supported subset system functionality response cis lowered hourly rates several occasions subsequently aol switched monthly subscription instead hourly rates active users aol much less expensive late 1994 compuserve offering unlimited use standard services including news sports weather ... limited electronic mail 8.95 per month new york times called probably best deal cis number users grew peaking april 1995 3 million worldwide point aol 20 million users united states alone peak 27 million due customers leaving lower-cost offerings 1997 number users leaving online services dialup internet service providers reaching climax original 1969 dial-up technology fairly simple\u2014the local phone number cleveland example line connected time-division multiplexer connected via leased line matched multiplexer columbus connected time-sharing host system earliest buildups line terminated single machine compuserve host different numbers used reach different computers later central multiplexers columbus replaced pdp-8 minicomputers pdp-8s connected dec pdp-15 minicomputer acted switches phone number tied particular destination host finally compuserve developed packet switching network implemented dec pdp-11 minicomputers acting network nodes installed throughout us later countries interconnected time compuserve network evolved complicated multi-tiered network incorporating asynchronous transfer mode atm frame relay fr internet protocol ip x.25 technologies 1981 times explained compuserve technology one sentence compuserve offering video-text-like service permitting personal computer users retrieve software mainframe computer telephone lines new york times described international big three noted reached local phone call 700 cities compuserve also world leader commercial services one financial services group collected consolidated financial data myriad data feeds including compustat disclosure i/b/e/s well price/quote feeds major exchanges compuserve developed extensive screening reporting tools used many investment banks wall street 1979 radio shack marketed residential information service micronet home users accessed computers evening hours compuserve computers otherwise idle success prompted compuserve drop micronet name favor compuserve origin approximately concurrent source services operating early 1979 first online services micronet made popular issue 2 commodore disk user included instructions connect run micronet programs mid-1980s compuserve one largest information networking services companies largest consumer information service operated commercial branches 30 us cities selling primarily network services major corporations throughout united states consumer accounts could bought computer stores box instruction manual trial account login awareness service extremely high 1987 consumer side would 50 compuserve revenues corporate culture entrepreneurial encouraging skunkworks projects alexander sandy trevor secluded weekend writing cb simulator chat system soon became one cis popular features instead hiring employees manage forums contracted sysops received compensation based success forum boards libraries chat areas july 1980 working associated press compuserve began hosting text versions columbus dispatch new york times virginian-pilot ledger star washington post san francisco examiner san francisco chronicle los angeles times added 1981 additional newspapers followed although accessing articles newspapers made 5 compuserve traffic reading entire newspaper using method impractical text 0.20 print edition newspaper would take two six hours download cost 5 per hour 6 p.m. another major unit compuserve compuserve network services formed 1982 generate revenue selling connectivity nationwide packet network compuserve built support time-sharing service compuserve designed manufactured network processors based dec pdp-11 wrote software ran network often erroneously called x.25 network compuserve network implemented mixture standardized proprietary layers throughout network one proprietary layers called adaptive routing adaptive routing system implemented two powerful features one network operated entirely self-discovery mode new switch added network connecting neighbor via leased telephone circuit new switch discovered absorbed network without explicit configuration change network configuration needed add remove connections network would automatically reconfigure second feature implemented adaptive routing often talked network engineering circles implemented cns establishing connection paths basis real-time performance measurements one circuit became busy traffic diverted alternative paths prevent overloading poor performance users cns network based x.25 protocol network presented standard x.25 interface outside world providing dialup connectivity corporate hosts allowing compuserve form alliances private networks tymnet telenet among others gave compuserve largest selection local dial-up phone connections world era network usage charges expensive still lower long distance charges networks permitted compuserve access still locations including international locations usually substantial connect-time surcharges common early 1980s pay 30-per-hour charge connect compuserve time cost 5 6 per hour factoring connect-time surcharges resulted company nicknamed compuspend compu erve ci cns primary supplier dial-up communications credit-card authorizations 20 years competence developed long relationship visa international peak line business compuserve carried millions authorization transactions month representing several billion dollars consumer purchase transactions many businesses always-on connection extravagance dialup option made better sense today service remains operation deeply embedded within verizon see competitors remaining market company notable introducing number online services personal computer users compuserve began offering electronic mail capabilities technical support commercial customers 1978 name infoplex also pioneer real-time chat market cb simulator service introduced february 21 1980 first public commercial multi-user chat program compuserve also introduced number online games around 1981 compuserve introduced compuserve b protocol file-transfer protocol allowing users send files later expanded higher-performance b+ version intended downloads cis although b+ protocol widely supported software used default time cis b+ protocol later extended include host-micro interface hmi mechanism communicating commands transaction requests server application running mainframes hmi could used front end client software present gui-based interface cis without use error-prone cli route commands compuserve began expand reach outside united states entered international arena japan 1986 fujitsu nissho iwai developed japanese-language version compuserve called nifty-serve 1989 1993 compuserve hong kong launched joint venture hutchison telecom able acquire 50,000 customers dialup isp frenzy 1994 1995 fujitsu compuserve co-developed worldsaway interactive virtual world 2014 original world launched compuserve 1995 known dreamscape still operating late 1980s possible log compuserve via worldwide x.25 packet switching networks bridged onto compuserve existing us-based network gradually introduced direct dial-up access network many countries economical solution network expansion compuserve also extended marketing commercial services opening branches london munich compuserve first online service offer internet connectivity albeit limited access early 1989 connected proprietary e-mail service allow incoming outgoing messages exchanged internet-based e-mail addresses early 1990s compuserve hundreds thousands users visiting thousands moderated forums forerunners discussion sites web like web many forums managed independent producers administered forum recruited moderators called sysops among many hardware software companies offered customer support broadened audience primarily business users technical geek crowd migrated byte magazine apos bix online service special forums special groups many relatively large premiums premium data bases charges 7.50 time enter search request 1992 compuserve hosted first known wysiwyg e-mail content forum posts fonts colors emoticons encoded 7-bit text-based messages via third party product navcis dvorak development running dos windows 3.1 windows 95 operating systems navcis included features offline work similar offline readers used bulletin board systems allowing users connect service exchange new mail forum content largely automated fashion run complete user edited messages locally offline mode system also allowed interactive navigation system support services like chat system many services remained text based compuserve later introduced compuserve information manager cim compete directly aol unlike navigator cim tuned online work used point-and-click interface similar aols later versions interacted hosts using hmi communications protocol areas service support hmi older text-based interface could used wincim also allowed caching forum messages news articles e-mail reading posting could performed off-line without incurring hourly connect costs previously luxury navcis autosig tapcis applications power users one big advantages cis internet users could purchase services software compuserve members using compuserve account early 1990s hourly rate fell 10 hour 1.95 hour march 1992 launched online signups credit card based payments desktop application connect online check emails april 1995 compuserve topped three million members still largest online service provider launched netlauncher service providing www access capability via spry mosaic browser aol however introduced far cheaper flat-rate unlimited-time advertisement-supported price plan us compete compuserve hourly charges conjunction aol marketing campaigns caused significant loss customers compuserve responded similar plan 24.95 per month late 1997 world wide web grew popularity general public company company closed once-busy compuserve customer support forums offer customer support larger audience directly company websites area compuserve forums time could address yet introduced universal www access 1992 compuserve acquired mark cuban company microsolutions 1997 compuserve began converting forums proprietary host-micro interface hmi html web standards 1997 change discontinued text based access forums forums accessible web well thorough compuserve proprietary hmi protocol 2004 compuserve discontinued hmi converted forums web access forums remained active compuserve.com end 2017 compuserve made number acquisitions history acquired h r block compuserve special military section help veterans military brats members non-members 1994-founded military brats america mba connect later mba established bulletin board within vietnam veterans america aol portal widespread adoption internet world wide web united kingdom first national major-brands online shopping service developed uk arm compuserve/cis part proprietary closed-system collection consumer services andrew gray set compuserve uk operations european arm us company back late 1980s later became company european general manager david gilroy compuserve uk director customer services service continued grow offered technical support managed suzanne gautier sales managed colin campbell service proposed paul stanfield independent business-to-consumer electronic commerce consultant martin turner product marketing director cis uk august 1994 turner agreed project started september rapid market research product development sales online space major uk retail catalogue companies included wh smith tesco virgin/our price great universal stores/gus interflora dixons retail past times pc world retailer innovations service launched thursday 27 april 1995 paul stanfield purchase book wh smith shop repeat first formal test service 9 february 1995 included secure payment subsequent fulfilment order royal mail postal delivery interactive media retail group imrg uk industry association e-retailing believes uk first national shopping service secure online transaction purchase wh smith book compuserve centre approximately 1,000,000 uk customers access shops time british retailers first major exposure medium retailers joined service soon included sainsbury wine jaguar cars branded lifestyle goods compuserve uk commissioned writer sue schofield produce 'retail pack including new uk compuserve book free cd-rom containing cis software access service compuserve closed private network system slow react rapid development open world wide web long major uk retailers started develop web sites independently compuserve original compuserve user ids consisted seven octal digits form 7xxxx xx legacy pdp-10 architecture later eight nine octal digits form 7xxxx xxx 7xxxx xxxx finally ten octal digits form 1xxxxx xxxx generated advance issued printed snap paks 1989 compuserve users email access internet using user id form xxxxx.xxxx compuserve.com comma original id replaced period 1996 users allowed create alias internet e-mail address could also used personal web page longest-term members allowed first choice new addresses 1998 users offered option switching mailbox newer system provided pop3 access via internet internet mail program could used current compuserve email addresses look like xxxxxx cs.com users compuserve 2000 service compuserve long history offering custom portal compuserve information service airline industry beginning 1970s compuserve offered customized version service allows pilots flight attendants bid flight schedules airline compuserve offered customized solutions industries well including service called compuserve lawyers another african-american culture arts forum long largest online service provider 1987 compuserve 380,000 subscribers compared 320,000 dow jones news/retrieval 80,000 source 70,000 genie compuserve 3 million worldwide users peak compared aol 27 million early 1999 many home uses switched standard dial-up internet access compuserve slipped 2 million largely business professional users one popular use compuserve 1980s file exchange particularly pictures indeed 1985 hosted perhaps first online comic world witches stitches compuserve introduced simple black-and-white image format known rle run-length-encoding standardize images could shared among different microcomputer platforms introduction powerful machines universally supporting color compuserve introduced much capable gif format invented steve wilhite gif went become de facto standard 8-bit images internet early mid-1990s compuserve outside telecommunications attorney randy may led appeals federal communications commission fcc exempt data networks pay common carrier access charge ccac levied telephone local exchange carriers primarily baby bell companies long distance carriers primary argument data networking brand new industry country would better served exposing important new industry aberrations voice telephone economics ccac mechanism used subsidize cost local telephone service long distance revenue fcc agreed compuserve position consequence dial-up networking united states whether private networks public internet much less expensive otherwise would 1991 compuserve sued defamation one early cases testing application traditional law internet cubby v. compuserve although defamatory content posted one forums compuserve liable content unaware content exercise editorial control forum november 1993 copyright infringement lawsuit regarding 900 songs settled two years later payment divided among publishers whose songs involved 1995 compuserve blocked access sex-oriented newsgroups pressured bavarian prosecutors 1997 compuserve reopened newsfeeds felix somm former managing director compuserve germany charged violating german child pornography laws material compuserve network carrying germany first convicted november 1997 another hearing sentenced two years probation may 28 1998 cleared appeal november 17 1999 wow styled wow online service run compuserve starting march 1996 closure announced november year effective end january 1997 among promised features first internet service offered monthly 'unlimited rate 17.95 software bugs random shutdowns service loss email messages limited service small loyal fan base closed january 31 1997 several class-action lawsuits filed claiming wow sold stockholders false misleading information wow supposed make company competitive aol proprietary service aimed families novice computer users late-1995 announced wow information service supposed commence microsoft windows 95 sr2 first include internet explorer knowing bundling browser would considered anti-competitive microsoft also planned bundle installers several major isps windows compuserve software ready aol retained wow.com domain name since acquired compuserve kept dormant shutdown wow 2007 mid-2007 aol considered moving digg-style news aggregator hosted netscape.com wow.com ultimately moving propeller.com toward end year aol reportedly working using domain social networking service focused popular online role-playing game world warcraft october 2010 2015 shutdown moved subdomain joystiq wow.com domain simultaneously relaunched deal day site similar groupon however site also short-lived shutting late 2011 january 2019 wow.com search engine powered bing using back-end aol search part oath inc battle customers aol compuserve became one handing customers back forth using free hours enticements technical problems\u2014the thousands new generation u.s. robotics dialup modems deployed network would crash high call volumes first time decades compuserve began losing money prodigious rate effort code-named red-dog initiated convert compuserve long-time pdp-10 based technologies servers based intel x86 architectures microsoft windows nt operating system parent h r block going management changes time beginning retirement ceo henry bloch series successors ensured 1997 h r block announced intention divest compuserve number potential buyers came forefront terms offered unacceptable management aol likely buyer made several offers purchase compuserve using aol stock h r block management sought cash least higher quality stock february 1998 john w. sidgmore vice chairman worldcom former ceo uunet devised complex transaction ultimately met goals parties step one worldcom purchased shares compuserve 1.2 billion wcom stock next day worldcom sold compuserve information service portion company aol retaining compuserve network services portion aol turn sold networking division advanced network services ans worldcom sidgmore said point world balance accountants taxes aol information services worldcom networks worldcom newly acquired compuserve network services renamed worldcom advanced networks continued operate discrete company within worldcom combined aol network subsidiary ans existing worldcom networking company called gridnet 1999 worldcom acquired mci became mci worldcom worldcom advanced networks briefly became mci worldcom advanced networks mci worldcom advanced networks ultimately absorbed uunet soon thereafter worldcom began spiral bankruptcy re-emerging mci 2006 mci sold verizon result organization networking business within compuserve part verizon business process splitting compuserve two major businesses compuserve information services compuserve network services worldcom aol desired make use compuserve name trademarks consequently jointly owned holding company formed purpose hold title various trademarks patents intellectual property license intellectual property cost worldcom verizon aol 2015 verizon acquired aol compuserve original properties reunited verizon september 2003 compuserve information service become division aol added compuserve basic product lines selling via netscape.com cis positioned value market-provider several million customers part aol web products group recent u.s. versions compuserve client software \u2014 essentially enhanced web browser \u2014 used gecko layout engine developed mozilla within derivative aol client using aol dialup network previous compuserve service offering re-branded compuserve classic remained available us also countries compuserve 2000 offered uk germany compuserve 2000 introduced 1999 withdrawn 2001 failure german market compuserve classic service remained compuserve germany introduced products dialup dsl internet access client software called compuserve 4.5 light january 2007 compuserve e-mail members windows vista supported suggested switching aol-branded service like many older programs however compuserve client software run windows vista compatibility mode july 2007 compuserve pacific announced cessation august 31 2007 september 2007 announced compuserve france would close operations november 30 2007 pacific region australia new zealand etc fujitsu australia ran compuserve pacific franchise 1998 35,000 customers towards end operations area thought far fewer compuserve pacific pricing plans changed since 1998 e.g. 14.95 2 hours per month july 2008 compuserve germany informed customers would close operations july 31 2008 legacy service compuserve classic would affected decision compuserve forums tightly linked compuserve channels compuserve.com currently runs slightly trimmed-down version now-defunct netscape.com web portal latter shut 2006 compuserve announced april 15 2009 compuserve classic would longer operate internet service provider would close june 30 2009 compuserve classic services including ourworld web pages taken offline date compuserve classic e-mail users would able continue using compuserve e-mail addresses via new e-mail system aol used compuserve brand compuserve 2000 rebranded low-cost offering closed 2011 including mac compuserve dialer low-cost dialup isp became web portal compuserve announced november 2017 compuserve forums would shut december 15 2017 36 years since compuserve forums begun 1981 moved forumania elsewhere time several graphical user interfaces written accessing compuserve unlike aol gave free new york times wrote compuserve ought give away among names wincim tapcis navcis time subscribers paid timed access well long distance calls countries spend time online reading replying messages goal bypass compuserve wincim interface streamline sending pre-written email forum postings user written offline receiving new messages downloading requested files logging compuserve tapcis access program compuserve information service automated ms-dos-based software application sped access management compuserve email accounts forum memberships pc users 1981 2004 advances compuserve technology rendered obsolete described archaic-looking .. remains powerful tool accessing compuserve forums tapcis written borland turbo pascal howard banner marketing executive wilmington delaware joined compuserve 1981 died melanoma june 1990 aged 44 software shareware retailed community users continued maintain website since able issue administrative commands tapcis preferred tool dozens compuserve system operators sysops regarding wincim predecessor cim pc magazine wrote give broader view available using easily navigate service explicitly caution unlike tapcis wo n't save money ... could actually take longer retrieve answer messages ... without although ozcis ozwin windows-based successor described free personal use pc magazine shareware like wincim tapcis navcis programming done steve sneed using pascal-like delphi software published ozarks west software inc. like tapcis sysop features moving deleting messages administering file libraries flagging users giving/denying sysop rights unlike offline readers tapcis navcis added proprietary ways formatting text colors fonts attributes ozwin always remained plain text never displayed custom styles may 2005 compuserve discontinued access ozcis tapcis forums compuserve autosig free unlike wincim tapcis navcis ozcis/ozwin", + "neighbors": [ + 14, + 83, + 107, + 108, + 258, + 373, + 530, + 568, + 582, + 623, + 646, + 668, + 713, + 771, + 886, + 939, + 1084, + 1132, + 1155, + 1166, + 1210, + 1213, + 1221, + 1228, + 1246, + 1304, + 1376, + 1423, + 1528, + 1550, + 1588 + ], + "mask": "Test" + }, + { + "node_id": 628, + "label": 8, + "text": "Load_Shedding:load shedding load shedding technique used information systems especially web services avoid overloading system making unavailable users idea ignore requests rather crashing system making fail serve request considerations shaping design load shedding algorithms include popular open-source tool defending delays downstream systems finagle", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 629, + "label": 2, + "text": "Nintendo_DSi_system_software:nintendo dsi system software nintendo dsi system software set updatable firmware versions software frontend nintendo dsi including xl variant video game console updates downloaded via system internet connection allow nintendo add remove features software updates also include changes previous updates user interface nintendo dsi redesigned nintendo ds nintendo ds lite dsi user interface slideable single row icons moving programs fairly snappy icons big enough new touchscreen allow navigation using fingers instead built-in stylus users load dsi first time system snaps shot faces faces fill entire top screen whenever main menu main menu take picture time pressing shoulder buttons camera used also selected within programs power button doubles home button bringing back main screen soft reset nintendo dsi provides built-in applications initially users able access following programs main menu dsi camera dsi sound dsi shop pictochat download play dsi menu akin channel interface nintendo wii new programs downloaded added interface dsi camera application snap shots sorts zany real-time filters users put photos squish heads however subject low resolution actual cameras 0.3mp additionally program recognize shots users taken digital cameras editing dsi sound application thematically similar dsi camera serving sound recorder editor along low bitrate aac music player notable features like excitebike starfox-themed equalizers modulators make user voice sound like robot parakeet dsi shop would serve ds version wii shop channel unlike nintendo previous handheld consoles nintendo ds nintendo ds lite nintendo dsi built music playback support dsi music program split two modes voice recording music playback offer plenty entertainment value tools gimmicks nintendo included recording mode lets users record 18 clips maximum 10 seconds length recorded clip play around various ways example users make clip play backwards forwards isolate small sections using a-b repeat modify speed tone dragging pointer around 2d graph also apply 12 effects clip used transform sound music playback mode also many play options song loaded users change speed tone like recording mode also overlay recordings made recording mode songs point addition nintendo provided set sound effects selected quickly using stylus inserted freely using shoulder buttons unlike built-in dsi camera application would read files generated dsi dsi music application restriction comes files directory structure files stored multi-level directory structure root directory sd card dsi parsed instantly displayed internal directories quick access playback users access features forwarding rewinding volume controls nintendo presumably envisioned dsi music substitute real music player however important drawback ds music application support popular mp3 format instead player supports aac format .mp4 .m4a .3gp filename extensions furthermore compared sony playstation portable difficult interface dsi pc usb port system order transfer music podcasts users need remove sd card plug directly pc one major updates nintendo dsi brings nintendo ds line full network connectivity unlike original nintendo ds nintendo ds lite featured minimal network connectivity download content firmware updates core dsi experience similar wii sony playstation portable consoles example users first power system click dsi shop icon main menu immediately prompted run firmware update nintendo dsi supports wep wpa aes/tkip wpa2 aes/tkip wireless encryption software built-in support use latter two encryption types supported ds ds lite dsi shop application users purchase various dsiware titles cute music blocky interface somewhat similar counterpart wii users permanently login club nintendo account track purchase rewards main shopping interface also lets users add dsi points read dsi shop manual firmware updates dsi shopping experience quite similar wii although big problem dsi shopping slow speed furthermore like previous nintendo ds ds lite nintendo dsi includes web browser version opera browser support html5 canvas object css opacity however limitations features web surfing either platforms whole good experience addition slow download speeds browser difficulty rendering pages example many pages would load completely compatible movie files music files adobe flash multimedia content sites like youtube nintendo dsi collection games applications specifically designed nintendo dsi handheld game console available download via dsi shop known dsiware since games applications specifically targeted nintendo dsi compatible original nintendo ds nintendo ds lite consoles nintendo dsi nintendo first region-locked handheld prevents using certain software released another region unlike original nintendo ds models member nintendo ds line nintendo dsi backward compatible original nintendo ds games cartridge software compatible previous models including original ds games internet browsing photo sharing region-locked later successor nintendo 3ds consoles also adopted approach result nintendo dsi 3ds-specific games locked certain region original ds games still region-free addition dsiware dsi-exclusive although later also run 3ds also dsi-enhanced games containing dsi-exclusive features still played earlier nintendo ds models original ds games run dsi dsi backward compatible game boy advance gba games original ds games require gba slot since dsi lacks slot unlike ds ds lite absence dsi also backward compatible accessories requiring gba slot nintendo ds rumble pak homebrew flash cards designed previous ds models incompatible dsi new cards capable running ds software even dsiware dsi available users transfer purchased dsiware nintendo dsi consoles units dsiware transferred nintendo 3ds although saved data like nintendo dsi nintendo 3ds backward compatible nintendo ds nintendo dsi software list major system updates nintendo dsi gaming platforms nintendo gaming platforms next generation gaming platforms generation", + "neighbors": [ + 101, + 113, + 116, + 162, + 298, + 337, + 520, + 527, + 1020, + 1051, + 1140, + 1228, + 1451, + 1521, + 1602 + ], + "mask": "Validation" + }, + { + "node_id": 630, + "label": 2, + "text": "Matthew_Garrett:matthew garrett matthew garrett technologist programmer free software activist major contributor series free software projects including linux gnome debian ubuntu red hat recipient free software award free software foundation work secure boot uefi linux kernel garrett states born galway ireland phd genetics university cambridge author several articles drosophila melanogaster i.e. fruit fly genetics garrett contributor gnome debian linux projects early contributor ubuntu initial member ubuntu technical board worked contractor canonical ltd. worked red hat canonical ltd. red hat garrett worked power management linux red hat garrett also worked issues relating secure boot uefi linux kernel preserve users ability run operating system choosing hardware supporting secure boot work eventually led awarded 2013 fsf free software award garrett worked cloud computing platform company coreos cited press expert cloud computing issues since 28 january 2017 working google recipient free software award free software foundation work secure boot uefi linux kernel garrett strong advocate software freedom compliance gnu general public license gpl linux kernel example garrett filed complaint us customs fusion garage due violations gpl october 2014 garrett stated blog would longer contribute linux kernel changes relating intel hardware response intel pulling ads gamasutra gamergate controversy however intel took steps demonstrate commitment diversity way appreciated edited post reflect happy resume working", + "neighbors": [ + 134, + 209, + 213, + 219, + 265, + 267, + 305, + 327, + 346, + 400, + 401, + 571, + 611, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1197, + 1202, + 1208, + 1241, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1509, + 1524, + 1526, + 1558, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 631, + "label": 4, + "text": "Netcat:netcat netcat often abbreviated nc computer networking utility reading writing network connections using tcp udp command designed dependable back-end used directly easily driven programs scripts time feature-rich network debugging investigation tool since produce almost kind connection user could need number built-in capabilities list features includes port scanning transferring files port listening used backdoor original netcat features include rewrites like gnu openbsd support additional features example openbsd nc supports tls nc mail.server.net 25 full response including http headers dumped standard output file accessed via web browser nowiki http //servername:8080/ /nowiki netcat serves file first client connects exits also provides content length browsers expect work fine lan may potentially fail kind firewall between. versions netcat like netcat-traditional debian 8.6 need specify -p port number nc -vzu 192.168.0.1 nowiki 80-90 /nowiki note udp tests always show open test useful shell access server tested know whether firewall blocking specific udp port server listening host i.e server whose port needs checked following sending host following \u2013 note codice_1 hostname listening host text typed sending host type something hit enter displayed also listening host udp port 4172 open open get error connection refused caveat machines ipv6 may default ip version use codice_2 thus host specified hostname contacted using ipv6 user might know ports may appear closed test even though would open using ipv4 difficult notice may cause false impression port blocked actually open force use ipv4 using adding codice_3 options codice_4 commands echo 0 message nc -w 1 -u loggerhost 514 uncommon use codice_2 port scanning netcat considered best tool job sufficient advanced tool nmap codice_6 parameter prevents dns lookup codice_7 makes codice_4 receive data server codice_9 makes connection timeout 1 second inactivity another useful behaviour using codice_2 proxy ports hosts redirected look example port 12345 represents request starts codice_4 server port 12345 connections get redirected codice_12 web browser makes request codice_4 request sent google response sent web browser pipes unidirectional worked around named pipe redirect input output codice_14 option may also used codice_15 implementation using named pipe reliable method using codice_14 option provides one-shot proxy another useful feature proxy ssl connections way traffic viewed wire sniffing applications wireshark accomplished unixes utilizing codice_17 codice_2 codice_19 codice_2 used make process network server listen port pipe input receives process codice_21 option spawns executable input output redirected via network socket example possible expose bourne shell process remote computers computer ip address 192.168.1.2 run command computer network one could run codice_4 command way codice_21 option used create rudimentary backdoor administrators perceive risk thus allow codice_2 computer ncat similar tool netcat provided nmap suite ncat n't built code \u201c traditional \u201d netcat implementation ncat definitely based netcat spirit functionality codice_29 user host1 ncat -l 9899 outputfile user host2 ncat host1 9899 inputfile user host1 ncat -l 9899 inputfile user host2 ncat host1 9899 outputfile suppose ssh tunnel want copy file remote machine could codice_32 directly opens another connection goal re-use existing connection use netcat ssh add codice_33 port forwarding sending everything port 31000 remote machine port local machine extra overhead tcp takes care error correction ssh already encrypted pipe original version netcat unix program last version 1.10 released march 1996 several implementations posix systems including rewrites scratch like gnu netcat openbsd netcat latter supports ipv6 tls openbsd version ported freebsd base windows/cygwin mac os x comes netcat installed osx 10.13 users use macports install variant dos version netcat called ntool included freedos package group networking based wattcp stack licensed european union public licence version 1.1 known ports embedded systems includes versions windows ce named netcat 4 wince iphone busybox includes default lightweight version netcat solaris 11 includes netcat implementation based openbsd netcat socat complex variant netcat larger flexible options must configured given task february 1 2016 santiago zanella-beguelin microsoft vulnerability research issued security advisory regarding composite diffie-hellman parameter hard-coded openssl implementation socat implausibility composite might unintentionally introduced prime number required led suspicion sabotage introduce backdoor software vulnerability socat bug affected version 1.7.3.0 2.0.0-b8 corrected following releases 1.7.3.1 2.0.0-b9 cryptcat version netcat integrated transport encryption capabilities middle 2005 nmap announced another netcat incarnation called ncat features new possibilities connection brokering tcp/udp redirection socks4 client server support ability chain ncat processes http connect proxying proxy chaining ssl connect/listen support ip address/connection filtering like nmap ncat cross-platform systems modified versions similar netcat utilities go command name codice_4 codice_15 codice_38 codice_39 codice_40 codice_41 codice_42", + "neighbors": [ + 11, + 42, + 134, + 138, + 405, + 769, + 796, + 816, + 961, + 1110, + 1138, + 1216, + 1318, + 1373, + 1374, + 1386, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 632, + "label": 8, + "text": "SWFAddress:swfaddress swfaddress open-source javascript library enables adobe flash/flex javascript/ajax websites web applications support deep linking practice enables users link specific section page content importance rich internet application platforms provide single url access specific content user navigation within content uniquely identified shared means url developer content integrates swfaddress users able use standard browser navigation functionality share bookmark unique urls represent currently displayed section state content library commonly used flash websites web applications available deep linking javascript library flash web swfaddress found used 100,000 websites 2011 swfaddress uses hash portion url interact web browsers simulate page navigation works two ways library built integrate free google analytics web analytics system order record page view statistics track popularity individual pages viewer navigates virtual pages states content also integrates popular swfobject javascript library automatically enable deep linking content loaded swfaddress works major web browsers major operating systems integrated flash content written outdated actionscript 1 recent actionscript 2 latest actionscript 3", + "neighbors": [ + 7, + 36, + 50, + 69, + 81, + 412, + 509, + 593, + 686, + 777, + 869, + 959, + 1149, + 1264, + 1302, + 1566 + ], + "mask": "Validation" + }, + { + "node_id": 633, + "label": 4, + "text": "Side-channel_attack:side-channel attack computer security side-channel attack attack based information gained implementation computer system rather weaknesses implemented algorithm e.g cryptanalysis software bugs timing information power consumption electromagnetic leaks even sound provide extra source information exploited side-channel attacks require technical knowledge internal operation system although others differential power analysis effective black-box attacks rise web 2.0 applications software-as-a-service also significantly raised possibility side-channel attacks web even transmissions web browser server encrypted e.g. https wifi encryption according researchers microsoft research indiana university many powerful side-channel attacks based statistical methods pioneered paul kocher attempts break cryptosystem deceiving coercing people legitimate access typically considered side-channel attacks see social engineering rubber-hose cryptanalysis general classes side channel attack include cases underlying principle physical effects caused operation cryptosystem side provide useful extra information secrets system example cryptographic key partial state information full partial plaintexts forth term cryptophthora secret degradation sometimes used express degradation secret key material resulting side-channel leakage works monitoring security critical operations aes t-table entry modular exponentiation multiplicand accesses attacker able recover secret key depending accesses made made victim deducing encryption key also unlike side-channel attacks method create fault ongoing cryptographic operation invisible victim 2017 cache-based vulnerabilities discovered cpus dubbed meltdown spectre allow attacker leak memory contents processes operating system timing attack watches data movement cpu memory hardware running cryptosystem algorithm simply observing variations long takes perform cryptographic operations might possible determine entire secret key attacks involve statistical analysis timing measurements demonstrated across networks power-analysis attack provide even detailed information observing power consumption hardware device cpu cryptographic circuit attacks roughly categorized simple power analysis spa differential power analysis dpa fluctuations current also generate radio waves enabling attacks analyze measurements electromagnetic emanations attacks typically involve similar statistical techniques power-analysis attacks historical analogues modern side-channel attacks known recently declassified nsa document reveals far back 1943 engineer bell telephone observed decipherable spikes oscilloscope associated decrypted output certain encrypting teletype according former mi5 officer peter wright british security service analyzed emissions french cipher equipment 1960s 1980s soviet eavesdroppers suspected planted bugs inside ibm selectric typewriters monitor electrical noise generated type ball rotated pitched strike paper characteristics signals could determine key pressed power consumption devices causes heating offset cooling effects temperature changes create thermally induced mechanical stress stress create low level acoustic emissions operating cpus 10 khz cases recent research shamir et al suggested information operation cryptosystems algorithms obtained way well acoustic cryptanalysis attack surface cpu chip cases cpu package observed infrared images also provide information code executed cpu known thermal-imaging attack optical side-channel attack examples include gleaning information hard disk activity indicator reading small number photons emitted transistors change state side-channel attacks rely relationship information emitted leaked side channel secret data countermeasures fall two main categories 1 eliminate reduce release information 2 eliminate relationship leaked information secret data make leaked information unrelated rather uncorrelated secret data typically form randomization ciphertext transforms data way undone cryptographic operation e.g. decryption completed first category displays special shielding lessen electromagnetic emissions reducing susceptibility tempest attacks commercially available power line conditioning filtering help deter power-monitoring attacks although measures must used cautiously since even small correlations remain compromise security physical enclosures reduce risk surreptitious installation microphones counter acoustic attacks micro-monitoring devices cpu power-draw thermal-imaging attacks another countermeasure still first category jam emitted channel noise instance random delay added deter timing attacks although adversaries compensate delays averaging multiple measurements generally using measurements analysis amount noise side channel increases adversary needs collect measurements another countermeasure first category use security analysis software identify certain classes side channel attacks found design stages underlying hardware timing attacks cache attacks identifiable certain commercially available security analysis software platforms allow testing identify attack vulnerability well effectiveness architectural change circumvent vulnerability comprehensive method employ countermeasure create secure development lifecycle hardware includes utilizing available security analysis platforms respective stages hardware development lifecycle case timing attacks targets whose computation times quantized discrete clock cycle counts effective countermeasure design software isochronous run exactly constant amount time independently secret values makes timing attacks impossible countermeasures difficult implement practice since even individual instructions variable timing cpus one partial countermeasure simple power attacks differential power-analysis attacks design software pc-secure program counter security model pc-secure program execution path depend secret values words conditional branches depend public information even though multiply operations draw power nop practically cpus using constant execution path prevents operation-dependent power differences differences power choosing one branch another leaking secret information architectures instruction execution time data-dependent pc-secure program also immune timing attacks another way code non-isochronous modern cpus memory cache accessing infrequently used information incurs large timing penalty revealing information frequency use memory blocks cryptographic code designed resist cache attacks attempts use memory predictable fashion accessing input outputs program data according fixed pattern example data-dependent table lookups must avoided cache could reveal part lookup table accessed partial countermeasures attempt reduce amount information leaked data-dependent power differences operations use power correlated number 1 bits secret value using constant-weight code using fredkin gates dual-rail encoding reduce leakage information hamming weight secret value although exploitable correlations likely remain unless balancing perfect balanced design approximated software manipulating data complement together several secure cpus built asynchronous cpus global timing reference cpus intended make timing power attacks difficult subsequent research found timing variations asynchronous circuits harder remove typical example second category decorrelation technique known blinding case rsa decryption secret exponent formula_1 corresponding encryption exponent formula_2 modulus formula_3 technique applies follows simplicity modular reduction omitted formulas decrypting computing result formula_4 given ciphertext formula_5 system picks random number formula_6 encrypts public exponent formula_2 obtain formula_8 decryption done formula_9 obtain formula_10 since decrypting system chose formula_6 compute inverse modulo formula_3 cancel factor formula_6 result obtain formula_4 actual result decryption attacks require collecting side-channel information operations data controlled attacker blinding effective countermeasure since actual operation executed randomized version data attacker control even knowledge another general countermeasure effective side-channel attacks masking countermeasure principle masking avoid manipulating sensitive value formula_5 directly rather manipulate sharing set variables called shares formula_16 formula_17 formula_18 xor operation attacker must recover values shares get meaningful information", + "neighbors": [ + 32, + 104, + 158, + 174, + 270, + 284, + 289, + 379, + 382, + 528, + 800, + 969, + 995, + 1063, + 1071, + 1181, + 1186, + 1240, + 1256, + 1308, + 1309, + 1336, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 634, + "label": 2, + "text": "IPhone_5:iphone 5 iphone 5 smartphone designed marketed apple inc sixth generation iphone succeeding iphone 4s preceding iphone 5s iphone 5c formally unveiled part press event september 12 2012 released september 21 2012 iphone 5 first iphone announced september setting trend subsequent iphone releases first iphone completely developed guidance tim cook last iphone overseen steve jobs iphone 5 featured major design changes comparison predecessor included aluminum-based body thinner lighter previous models taller screen nearly aspect ratio apple a6 system-on-chip lte support lightning new compact dock connector replaced 30-pin design used previous iphone models second apple phone include new sony-made 8 mp camera first introduced iphone 4s apple began taking pre-orders september 14 2012 two million received within 24 hours initial demand iphone 5 exceeded supply available launch september 21 2012 described apple extraordinary pre-orders sold twenty times faster predecessors reception iphone 5 generally positive consumers reviewers noted hardware issues unintended purple hue photos taken phone coating prone chipping reception also mixed apple decision switch different dock connector design change affected iphone 5 compatibility accessories otherwise compatible previous iterations line iphone 5 officially discontinued apple september 10 2013 announcement successors iphone 5s iphone 5c iphone 5 second-shortest lifespan iphone ever produced twelve months production breaking apple standard practice selling existing iphone model reduced price upon release new model broken iphone x ten-months production november 2017 september 2018 replaced midrange entry-level device iphone 5c 5c internal hardware specifications almost identical 5 albeit less expensive polycarbonate exterior iphone 5 supports ios 6 7 8 9 10 iphone 5 second iphone support five major versions ios iphone 4s rumors began shortly announcement iphone 4s though detailed leaks emerge june 2012 july 30 2012 reports pinpointed dates iphone 5 would unveiled released along accurate predictions features september 4 2012 apple announced would hosting event yerba buena center arts san francisco september 12 2012 shadow numeral 5 featured invitations sent media suggesting next iphone would unveiled event unveiling apple announced iphone 5 also introduced new ipod nano ipod touch models also stated pre-orders would accepted starting september 14 2012 two million pre-orders received within 24 hours initial demand new phone exceeded record set predecessor iphone 4s selling 5 million units first three days november 30 2012 apple added unlocked version iphone 5 online us store 16 gb model starting us 649 iphone 5 officially discontinued apple september 10 2013 announcement successors iphone 5s iphone 5c 5c shared almost internal hardware iphone 5 5c used lower-cost poly-carbonate plastic case place original 5 aluminum form introduction 5c deviated apple previous market strategy previous iphone model would remain production sold lower price point new model april 28 2014 apple initiated warranty recall program replace failing power buttons iphone 5 models manufactured prior march 2013 cost august 23 2014 apple announced program replace batteries iphone 5 models may suddenly experience shorter battery life need charged frequently sold september 2012 january 2013 following release iphone 5 samsung announced filing lawsuit apple infringing eight patents case scheduled begin 2014 statement samsung said little choice take steps necessary protect innovations intellectual property rights litigation two involving patent infringement ongoing fought several court cases around world components labor required construct basic iphone 5 estimated cost us 207 us 19 cost components corresponding iphone 4s model lte module iphone 5 alone costs 34 10 cellular module iphone 4s similarly screens used iphone 5 cost 44 7 screen predecessor mashable noted profit margin selling device huge iphone 5 retails us 649 announcement device lack supply evident due shortage components screen reports emerged stating sharp unable ship screen debut iphone 5 manufacturers reported difficult keep demand result number pre-orders rose due uncertainty stock retail stores delivery dates pre-orders postponed dates initial release date device china labor watch new york state\u2013based ngo reported three four thousand foxconn workers work iphone 5 production plant zhengzhou stopped working october 5 2012 strikes occurred apple implemented stricter quality standard products includes 0.02 mm restriction indentations inflicted production imposed demands related scratches frames back covers strikes also attributed employer forcing employees work public holiday report stated training inadequate quality demands expected led employees producing products meet standards strike conflicts quality control inspectors employees resulted brawls china labor watch also claimed concerns raised inspectors addressed factory management foxconn spokesmen admitted micromanagement problem exists also said 300 400 workers absent conflicts influence production processes november 2012 foxconn chairman terry gou reported delay production due undisclosed difficulties assembly features ios apple mobile operating system user interface ios based concept direct manipulation using multi-touch gestures interface control elements consist sliders switches buttons interaction os includes gestures swipe tap pinch reverse pinch specific definitions within context ios operating system multi-touch interface internal accelerometers used applications respond shaking device one common result undo command rotating vertically one common result switching portrait landscape mode iphone 5 shipped ios 6 released september 19 2012 many features work specifically included ios 6.0 operating system worked certain territories release apple said rolling program take longer implement across regions phone act hotspot sharing internet connection wifi bluetooth usb also accesses app store online application distribution platform ios developed maintained apple service allows users browse download applications itunes store developed xcode ios sdk published apple play music movies television shows ebooks audiobooks podcasts sort media library songs artists albums videos playlists genres composers podcasts audiobooks compilations options always presented alphabetically except playlists retain order itunes users rotate device horizontally landscape mode access cover flow like itunes feature shows different album covers scroll-through photo library scrolling achieved swiping finger across screen alternatively headset controls used pause play skip repeat tracks iphone 5 volume changed included apple earphones voice control feature used identify track play songs playlist specific artist create genius playlist like iphone 4s iphone 5 siri allows user operate iphone spoken commands software improved ios 6 include ability make restaurant reservations launch apps dictate facebook twitter updates retrieve movie reviews detailed sports statistics texting aided voice assistant converts speech text addition regular texting messaging supports imessage specialized instant messaging program service allows unlimited texting apple devices running ios 5 later supports inclusion content images sound text messages integration device voice-controlled software assistant read acknowledgements sent messages input device comes keyboard displayed multi-touch screen voice-to text speaking microphone entered text supported predictive suggestion software multi-language spell-checker recognises many regional accents different languages ios 6 features several new and/or updated apps includes apple maps passbook apple built-in maps app replaced former maps app powered google maps universally derided lacked many features present competing maps apps uses apple new vector-based engine eliminates lag making smoother zooming new maps turn-by-turn navigation spoken directions 3d views major cities real-time traffic ios 6 able retrieve documents boarding passes admission tickets coupons loyalty cards new passbook app ios device passbook scanned reader process mobile payment locations compatible hardware app context-aware features notifications relevant coupons immediate vicinity given store facebook comes integrated apple native apps ios 6 facebook features directly accessed within native apps calendar sync facebook events use facebook like button within apple app store new privacy settings available user addition location services following added ios 6 photos already partially restricted ios 5 contacts address book calendars reminders bluetooth sharing twitter facebook sina weibo ios 6 also comes limit ad tracking user control general settings menu allow users option prevent targeted advertising apple advertising identifier replaces company existing unique device identification udid standard advertising networks yet using apple advertising identifier device identifier standard would affected although apple require standard future apple emphasized improved build quality iphone 5 press event frame used previous versions redesigned use aluminum composite frame used stainless steel instead aluminium due steve jobs preference metal thought looks beautiful wears 18 thinner 20 lighter 12 less overall volume predecessor iphone 4s phone aluminum body thick september 2012 conference apple claimed thinnest smartphone world 7.6 mm though claim disputed chinese oppo finder thinner smartphones could considered thinner depending upon thickness measured oppo finder measured thinnest point thickest point making overall thinner iphone uses system chip soc called apple a6 soc comprises 1.3 ghz dual-core processor 1gb ram tri-core powervr sgx543mp4 running 266 mhz. ref name= geekbench test 28/9 /ref operating memory lpddr2-1066 edram doubled 512 mb 1 gb storage capacities available fixed 16 32 64 gb 4s plug-in memory cards supported two color options black black glass slate-colored metal trim white white ceramic silver-colored metal trim color options though differently implemented predecessor 4s iphone 5 retains 8 megapixel back camera iphone 4s improved low-light performance 40 faster photo capture predecessors purple hue strong source light present photograph front camera accessible facetime camera app lower resolution 1.2 megapixels rechargeable lithium-ion battery charge capacity 1440mah built replaced user rated \u2264225 hours standby time \u22648 hours talk time three separate models phone available one supporting cdma two gsm versions knock-on effects version device actually work countries/regions phone takes nano-sim smaller micro-sim hardware benchmarking conducted using geekbench glbenchmark validates several claims apple included website mentioned unveiling device include two times faster two times graphics performance geekbench overall hardware assessment iphone 5 received score approximately 2.5 times higher iphone 4s benchmark conducted using glbenchmark iphone 5 returned score 2 times better iphone 4s result however inconsistent 3d graphics benchmark assessment using passmark returned score approximately 1.45 times better iphone 4s battery life assessments conducted anandtech concluded battery life shorter iphone 5 predecessor performing certain tasks however performing tasks iphone 5 battery outlasts iphone 4s retina display 1,136 \u00d7 640 pixels aspect ratio almost exactly 16:9 minus one extra row horizontal pixels diagonal 4 display size 6.7 square inches compared 5.7 iphone 4 4s pixel density remains 4s model 326 pixels per inch screen icons iphone 5 arranged matrix six rows four icons increased screen size allows sixth row icons added five rows present iphone 4 in-cell touch sensor technology sharp slims screen allows thinner phone screen color saturation 44 greater predecessor three microphones placed front side back noise cancellation video calls april 28 2014 apple initiated warranty recall program replace failing power buttons iphone 5 models manufactured prior march 2013 cost august 23 2014 apple announced program replace batteries iphone 5 models may suddenly experience shorter battery life need charged frequently sold september 2012 january 2013 well ipod touch 5th generation ipod nano 7th generation ipad 4th generation ipad mini feature new dock connector named lightning replaces 30-pin apple dock connector introduced 2003 apple ipod 3rd generation apple lightning connector eight pins signaling digital new connector smaller previous one helping slimmer predecessors apple lightning cables duplicate pins two sides plug inserted either way round various accessories available convert apple lightning connector older 30-pin apple dock connector usb although old accessories work signals available particular video output ipod feature bmw automobiles earphones known apple earpods included iphone 5 devices announced apple media event september 12 2012 superseded earphones included previous generation iphones ipods according technology commentators redesign earphones aimed improve sound quality allowing air travel freely apple states redesign earphones allows rival high-end headphones cost hundreds dollars reviews gizmodo techradar reported although redesigned earphones sounded better predecessor reviewers felt quality sound produced poor verizon sprint offer lte access us uk ee three able offer lte access march 26 2013 t-mobile announced would begin carrying iphone 5 making first iphone available four nationwide carriers united states t-mobile version iphone features modified version a1428 iphone 5 model enabling advanced wireless services aws support carriers canada selling lte networks including rogers wireless fido solutions bell mobility virgin mobile canada telus mobility koodo mobile 42 officially recognized bands exist lte however rollouts coalescing around more-popular bands based historically made available specific regions europe bands available lte include 2.6 ghz 3g-expansion band 800 mhz cleared analogue tv 1,800 mhz appearing places including uk germany carrier network supported t-mobile 1,800 mhz band allocated lte countries europe including denmark norway sweden others\u2014will able offer lte connectivity via iphone 5 customers current lte networks already deployed lte 2.6 ghz band iphone 5 support november 2012 representative swisscom reported iphone 5 supports lte networks tested certified apple unlike iphone 4s world phone produced apple three versions iphone 5 differ frequency used three work 2g gsm/gprs 3g umts/edge networks 800 1900 mhz bands used americas 900 1800 mhz bands used elsewhere cdma a1429 model works cdma networks sprint verizon another version supports lte 1700/2100 mhz aws band 700 mhz band recovered conversion digital television us channels 52 56 currently network supports band gsm a1429 supports several lte bands available countries lte bands 1 3 5 received mainly positive reviews commentators reviewers tim stevens engadget praised high resolution screen surpassing considered one best phone screens available market stevens critical new connector incompatible devices cables use superseded 30-pin connector although la times reported change necessary make device smaller predecessor engadget agreed apple fulfilled promises stated website better battery performance two times graphics performance two times faster david pogue new york times considered 4-inch retina display nice life-changing change praised lightning connector size sturdiness reversibility noting lack support older accessories remarking apple long history killing technologies inconveniently expensively public come love technology columnist ed baig usa today impressed apple met public lofty expectations iphone 5 competitive market repair-ability review ifixit found iphone 5 easier disassemble repair predecessor wired reported iphone 5 design carried iphone 5s iphone se regarded long golden child apple phone design benchmark phones general succeeding iphone 6/6s design less critically acclaimed felt little bit wrong though holding slick 650 bar soap wired described iphone 5 elegance rooted way aluminum glass work together felt streamlined yet substantial different iphone 6 feels substantial size alone plus unlike ubiquitous rounded corners 6 iphone 5 \u2019 really look like anything else market time however iphone 5 design suited scaling contrast iphone 6/6s could better accommodate growing consumer trend towards larger screen sizes indeed spawned 6/6s plus phablet models reviewers commentators critical new maps app replaced google maps ios 6 reported contain errors misplacement landmark tags directing users incorrect locations poor satellite images nine days maps release apple issued statement apologizing frustration caused customers recommending try alternate mapping services gizmodo editor diaz discussed correspondence apple reader purple flare pictures taken iphone 5 camera apple response issue normal advised customer aim camera away bright light sources taking photos tests conducted techcrunch indicate problem existed iphone 4s distinct pronounced iphone 5 consumer reports found purple haze effect occurred several manufacturers phones including samsung galaxy iii motorola droid razr maxx less pronounced iphone 4s report concluded digital cameras general including higher-end slrs suffer lens flare purple-tinted effect uncommon anecdotal claims iphone 5 coating chipping exposing bright aluminium underneath apple executive response email correspondence affected customer summarized normal aluminum scratch term scuffgate reference antennagate affected iphone 4 applied various sources cnet yahoo news things digital describe scuffing issue users reported internet white model leaked light behind screen though issue unique iphone 5 also affected apple devices techcrunch reported sold twenty times faster 4 4s models apple said blown away customer response phil schiller apple vice-president worldwide marketing said two million orders received first 24 hours said fastest-selling iphone company ever offered selling five million units launch weekend exceeding supply available release sale iphone 5 also slowed growth android according market share reports released kantar worldpanel comtech first 16 days phone initial release comprised 20 phones sold period j.p. morgan chief economist michael feroli said sales could boost annualized us gdp growth 3.2 billion 12.8 billion annual rate shortly announcement iphone 5 preceding launch apple stock price rose record 705.07 within three months fell 507.48 according analysis eric savitz apple stock decline resulting losses result issue new maps application disappointed investors points initial hardware sales five million compared projections twice primary cause since release iphone 5 discounts previous generation iphones enabled apple maintain market lead united states japan iphone continued lag behind combined total android phones global market", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 162, + 214, + 228, + 252, + 269, + 270, + 337, + 345, + 356, + 359, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1140, + 1178, + 1237, + 1262, + 1272, + 1292, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1503, + 1507, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 635, + "label": 1, + "text": "IMO_number:imo number international maritime organization imo number unique reference ships registered ship owners management companies imo numbers introduced improve maritime safety security reduce maritime fraud consist three letters imo followed unique seven-digit numbers assigned international convention safety life sea solas 1987 imo adopted resolution a.600 15 aimed enhancement maritime safety pollution prevention prevention maritime fraud assigning ship permanent identification number imo number remains linked hull lifetime regardless changes names flags owners imo adopted existing unique 7-digit numbers applied ships lloyd register since 1969 modified 6-digit numbers introduced 1963 solas regulation xi/3 adopted 1994 came force 1 january 1996 made imo numbers mandatory applied cargo vessels least 300 gross tons gt passenger vessels least 100 gt solas convention cargo ships means ships passenger ships imo scheme however apply december 2002 diplomatic conference maritime security adopted number measures aimed enhancing security ships port facilities included modification solas regulation xi-1/3 require ships identification numbers permanently marked visible place either ship hull superstructure well internally ship certificates passenger ships also carry marking horizontal surface visible air may 2005 imo adopted new solas regulation xi-1/3-1 mandatory company registered owner identification number scheme entry force 1 january 2009 regulation provides every ship owner management company shall unique identification number amendments require numbers added relevant certificates documents international safety management code ism international ship port facility security code isps like imo ship identification number company identification number seven-digit number prefix imo example ship atlantic star imo 5304986 referred former ship manager pullmantur cruises ship management ltd imo 5364264 former owner pullmantur cruises empress ltd. imo identification numbers ships companies registered owners assigned ihs markit previously lloyd register-fairplay new vessels imo number assigned hull construction generally upon keel laying many vessels fall outside mandatory requirements solas numbers allocated lloyd register ihs markit numerical series including fishing vessels commercial yachts imo number made three letters imo followed seven-digit number consists six-digit sequential unique number followed check digit integrity imo number verified using check digit done multiplying first six digits factor 2 7 corresponding position right left rightmost digit sum check digit example imo 9074729 9\u00d7 7 0\u00d7 6 7\u00d7 5 4\u00d7 4 7\u00d7 3 2\u00d7 2 139 01718423143", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 636, + "label": 3, + "text": "Attack_of_the_Killer_Tomatoes_(1986_video_game):attack killer tomatoes 1986 video game attack killer tomatoes computer game released 1986 sinclair spectrum amstrad cpc msx based 1978 comedy film name player takes control wimp plasbot works tomato puree plant must rid plant mutated killer tomatoes referred title wimp plasbot checked 9:00 begin another day work discovered tomatoes mutated wimp must destroy killer tomatoes ensuring pizza parlours still supplied puree bouncing ones player must control wimp explores various isometric 3d rooms attempts destroy mutated killer tomatoes three different types tomato found factory killer tomatoes walk around legs square patterns kill wimp touch wimp must destroy tomatoes crushing hammer found somewhere factory second type tomato bounce wimp must stop bouncing squirting tomato sauce take crusher keep supply tomato puree third type tomato sit floor factory wimp touches cause time clock accelerate short clocking time reached killer tomatoes destroyed player loses punch cards found around factory give player extra time reviews fairly positive crash giving 89 sinclair rating 8/10 zx computing rating great crash said game despite awfulness movie name akt excellent game though owe quite lot previous releases rachael smith sinclair said ... converting film nominated worst vegetable movie time global created tie-in far better original deserved far better many superior films received zx computing said killer tomatoes quite complex professionally produced game keep occupied quite similarity knight lore inspired titles left feeling n't really offer anything n't seen", + "neighbors": [ + 822 + ], + "mask": "Test" + }, + { + "node_id": 637, + "label": 3, + "text": "Michael_Jackson's_Moonwalker:michael jackson moonwalker michael jackson moonwalker name several video games based 1988 michael jackson film moonwalker u.s. gold published various games home computers released 1989 sega developed two similarly themed beat 'em video games 1990 one released arcades another released mega drive/genesis master system games stories loosely follow story film michael jackson must rescue kidnapped children evil mr. big incorporate synthesized versions musician songs versions game released popular 8-bit 16-bit home computers time developed two small software houses irish emerald software ltd american keypunch software published u.k. company u.s. gold game features four different levels first level top-down maze-style level next level similar gameplay riding motorcycle collecting tokens third level side-scrolling level based smooth criminal clip player collects ammunition shoots gangsters openings player character last level involves morphing robot shooting soldiers openings player controlling crosshair different home computer version arcade video game sega programming triumph international audiovisuals help jackson released sega system 18 hardware game suffered sega suicide battery arcade board battery accidentally otherwise renders game unplayable end lifespan arcade distinctively different gameplay computer console counterparts focusing beat 'em gameplay elements rather platform game essentially beat-em-up although jackson attacks magic powers instead physical contact ability shoot short-ranged magic power enemies magic power charged holding attack button increase range damage magic power close enemies jackson executes spinning melee attack using magic power cabinet supports three people play simultaneously three players play jackson dressed suit white player 1 red player 2 black player 3 jackson special attack termed dance magic three different dance routines may performed player starts one three attacks per credit depending machine set bubbles chimpanzee michael real-life pet appears level collected rescued chimp transforms michael robotic version pop singer ability shoot laser bursts missiles absorb significantly damage home versions game released sega mega drive/genesis master system home video game systems though gameplay completely different arcade version version also rated pegi release virtual console never materialized never specified version considered rerelease home console versions actually based evolved version home computer version game gameplay somewhat similar shinobi series contrast arcade version three-quarters view shooter/fighter type game game involves player controlling pop star quest save kids kidnapped mr. big game levels music borrowed film though many music tracks taken jackson thriller album well player ability destroy enemies making dance jackson become robot rescuing certain child grabbing comet falls sky gameplay focused finding children resemble katie movie scattered throughout level behind objects doors objects empty contain enemies jackson standard attack stylized high kick commonly incorporated dance routines player continues hold kick button moves jackson backwards performs moonwalk dance move critical reviews mixed positive sinclair compared spectrum version game gauntlet operation wolf saying well animated surprising amount fun megatech said megadrive version addictive platform game excellent graphics mega magazine placed game number 91 list best megadrive games time saying average jackson later would go cameo role sega space channel 5 music/rhythm games dreamcast playstation 2 jackson also appeared secret character", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 638, + "label": 8, + "text": "Internet_Information_Services:internet information services internet information services iis formerly internet information server extensible web server created microsoft use windows nt family iis supports http http/2 https ftp ftps smtp nntp integral part windows nt family since windows nt 4.0 though may absent editions e.g windows xp home edition active default first microsoft web server research project european microsoft windows nt academic centre emwac part university edinburgh scotland distributed freeware however since emwac server unable handle volume traffic going microsoft.com microsoft forced develop web server iis almost every version iis released either alongside version microsoft windows versions iis prior 7.0 running client operating systems supported 10 simultaneous connections single website microsoft criticized vendors web server software including o'reilly associates netscape licensing early versions windows nt workstation edition os permitted ten simultaneous tcp/ip connections whereas expensive server edition otherwise additional features permitted unlimited connections bundled iis implied intended discourage consumers running alternative web server packages cheaper edition netscape wrote open letter antitrust division u.s. department justice regarding distinction product licensing asserted technical merit o'reilly showed user could remove enforced limits meant cripple nt 4.0 workstation web server two registry key changes trivial configuration file tweaking iis 6.0 higher support following authentication mechanisms iis 7.0 modular architecture modules also called extensions added removed individually modules required specific functionality installed iis 7 includes native modules part full installation modules individual features server uses process requests include following iis 7.5 includes following additional enhanced security features authentication changed slightly iis 6.0 iis 7 notably anonymous user named iusr_ machinename built-in account vista future operating systems named iusr notably iis 7 authentication mechanism isolated module installed uninstalled iis 8.0 offers new features targeted performance easier administration new features iis 8.5 several improvements related performance large-scale scenarios used commercial hosting providers microsoft cloud offerings also several added features related logging troubleshooting new features iis express lightweight 4.5\u20136.6 mb version iis available standalone freeware server may installed windows xp service pack 3 subsequent versions microsoft windows iis 7.5 express supports http https protocols portable stores configuration per-user basis require administrative privileges attempts avoid conflicting existing web servers machine iis express downloaded separately part webmatrix visual studio 2012 later visual studio 2010 earlier web developers developing asp.net apps used asp.net development server codenamed cassini default iis express serves local traffic iis releases new feature modules major version releases add new functionality following extensions available iis 7.5 according netcraft february 2014 iis market share sites 32.80 making second popular web server world behind apache http server 38.22 netcraft showed rising trend market share iis since 2012 14 february 2014 however w3techs shows different results according w3techs iis third used web server behind apache http server 1st place nginx furthermore shows consistently falling trend iis use since february 2013 netcraft data february 2017 indicates iis market share top million busiest sites 10.19 making third popular web server world behind apache 41.41 nginx 28.34 iis 4 iis 5 affected ca-2001-13 security vulnerability led infamous code red attack however versions 6.0 7.0 reported issues specific vulnerability iis 6.0 microsoft opted change behaviour pre-installed isapi handlers many culprits vulnerabilities 4.0 5.0 thus reducing attack surface iis addition iis 6.0 added feature called web service extensions prevents iis launching program without explicit permission administrator default iis 5.1 earlier run websites single process running context system account windows account administrative rights 6.0 request handling processes run context network service account significantly fewer privileges vulnerability feature custom code wo n't necessarily compromise entire system given sandboxed environment worker processes run iis 6.0 also contained new kernel http stack codice_1 stricter http request parser response cache static dynamic content according secunia iis 7 total six resolved vulnerabilities iis 6 total eleven vulnerabilities one still unpatched unpatched security advisory severity rating 2 5 june 2007 google study 80 million domains concluded iis market share 23 time iis servers hosted 49 world malware apache servers whose market share 66 study also observed geographical location dirty servers suggested cause could use unlicensed copies windows could obtain security updates microsoft blog post 28 april 2009 microsoft noted supplies security updates everyone without genuine verification 2013 mass surveillance disclosures made widely known iis particularly bad supporting perfect forward secrecy pfs especially used conjunction internet explorer possessing one long term asymmetric secret keys used establish https session make easier derive short term session key decrypt conversation even later time diffie\u2013hellman key exchange dhe elliptic curve diffie\u2013hellman key exchange ecdhe 2013 ones known property 30 firefox opera chromium browser sessions use nearly 0 apple safari microsoft internet explorer sessions", + "neighbors": [ + 26, + 66, + 79, + 93, + 111, + 144, + 148, + 153, + 225, + 262, + 268, + 278, + 295, + 296, + 312, + 326, + 336, + 344, + 433, + 435, + 470, + 473, + 485, + 509, + 521, + 558, + 564, + 574, + 615, + 647, + 662, + 678, + 680, + 684, + 689, + 705, + 712, + 762, + 791, + 800, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1065, + 1092, + 1098, + 1109, + 1138, + 1151, + 1193, + 1212, + 1235, + 1242, + 1247, + 1261, + 1287, + 1288, + 1328, + 1338, + 1346, + 1363, + 1370, + 1395, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1555, + 1561, + 1582, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 639, + "label": 3, + "text": "Ralf_Brown's_Interrupt_List:ralf brown interrupt list ralf brown interrupt list aka rbil x86 interrupt list ms-dos interrupt list inter comprehensive list interrupts calls hooks interfaces data structures cmos settings memory port addresses well processor opcodes special function registers x86 machines including many clones start pc era 1981 2000 still applying pcs today list covers operating systems device drivers application software documented undocumented information including bugs incompatibilities shortcomings workarounds version locale date information often detail level far beyond found contemporary literature large part covers system bioses internals operating systems dos os/2 windows well interactions widely used resource ibm pc system developers analysts well application programmers pre-windows era parts compiled information used creation several books systems programming also translated chinese japanese russian compilation proven important resource developing various closed open source operating systems including linux freedos today still used reference bios calls develop programs dos well system-level software project result research collaborative effort 650 listed contributors worldwide period 15 years 290 provided significant information 55 even original list created january 1985 janet jack others named interrupt list ms-dos subsequently maintained mailed requestors usenet ross m. greenberg 1986 since october 1987 maintained ralf d. brown researcher carnegie mellon university language technologies institute information several interrupt listings merged list order establish one comprehensive reference compilation years michael a. shiels timothy patrick farley matthias r. paul robin d. h. walker wolfgang lierz tamura jones became major contributors project providing information list project also expanded include pc development related information therefore absorbed number independently maintained lists pc i/o ports wim osterholt matthias r. paul bios cmos memory contents atley padgett peterson processor opcodes alex v. potemkin bugs harald feldmann brown paul also conducted several systematic surveys specific hard- software details among number dedicated user groups order validate info help fill gaps list originally list distributed archive named interrup various compression formats well form diffs distribution file name changed include version form internyy n issue number yy 2-digit release year 1988 mid 1989 distribution settled use zip compression archive reached size 360 kb floppy june 1991 distribution split several files following interrrp.zip naming scheme rr revision starting 26 version 91.3 p part indicator package starting letter officially named ms-dos interrupt list x86 interrupt list abbreviated inter maintainer community coined unofficial name ralf brown interrupt list abbreviated rbil 1990s publication currently revision 61 17 july 2000 almost 8 mb ascii text including close entries plus tables fully cross linked would result 3700 pages 60 lines per page condensed information printed interrupt list makes 5.5 mb 2500 pages printed project officially abandoned website still maintained 2018 new releases forthcoming long time despite fact information still pending release even inter61 release 2000 new releases planned several times 2001 2002 materialize portions new information dos pc internals provided paul circulated preliminary form development community peer-review assist operating system development", + "neighbors": [ + 22, + 42, + 53, + 85, + 134, + 234, + 491, + 868, + 920, + 961, + 1138, + 1188, + 1304, + 1346, + 1394 + ], + "mask": "Train" + }, + { + "node_id": 640, + "label": 3, + "text": "The_Goonies_(MSX_video_game):goonies msx video game goonies 1986 platform game konami msx based film name music simple rendition song goonies r good enough cyndi lauper goonies platform puzzle game featuring five 'scenes successfully completed scene key word given thus player continue game point time", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 641, + "label": 4, + "text": "Intel_Management_Engine:intel management engine intel management engine also known manageability engine autonomous subsystem incorporated virtually intel processor chipsets since 2008 located platform controller hub modern intel motherboards part intel active management technology allows system administrators perform tasks machine remotely system administrators use turn computer login remotely computer regardless whether operating system installed intel management engine always runs long motherboard receiving power even computer turned ime attractive target hackers since top level access devices completely bypasses operating system intel released much information intel management engine prompting speculation may include backdoor electronic frontier foundation voiced concern ime amd processors similar feature called amd secure technology subsystem primarily consists proprietary firmware running separate microprocessor performs tasks boot-up computer running asleep long chipset soc connected current via battery power supply continues run even system turned intel claims required provide full performance exact workings largely undocumented code obfuscated using confidential huffman tables stored directly hardware firmware contain information necessary decode contents intel main competitor amd incorporated equivalent amd secure technology formally called platform security processor virtually post-2013 cpus starting 11 based intel quark x86-based 32-bit cpu runs minix 3 operating system state stored partition spi flash using embedded flash file system effs previous versions based arc core management engine running threadx rtos versions 1.x 5.x used arctangent-a4 32-bit instructions whereas versions 6.x 8.x used newer arcompact mixed 32- 16-bit instruction set architecture starting 7.1 arc processor could also execute signed java applets mac ip address out-of-band interface direct access ethernet controller one portion ethernet traffic diverted even reaching host operating system support exists various ethernet controllers exported made configurable via management component transport protocol mctp also communicates host via pci interface linux communication host done via /dev/mei release nehalem processors usually embedded motherboard northbridge following memory controller hub mch layout newer intel architectures intel 5 series onwards included platform controller hub pch intel current terminology 2017 one several firmware sets converged security manageability engine csme prior amt version 11 csme called intel management engine bios extension intel mebx russian company positive technologies dmitry sklyarov found firmware version 11 runs minix 3 several weaknesses found may 1 2017 intel confirmed remote elevation privilege bug sa-00075 management technology every intel platform provisioned intel standard manageability active management technology small business technology nehalem 2008 kaby lake 2017 remotely exploitable security hole several ways disable without authorization could allow functions sabotaged found additional major security flaws affecting large number computers incorporating trusted execution engine txe server platform services sps firmware skylake 2015 coffee lake 2017 confirmed intel 20 november 2017 sa-00086 unlike sa-00075 bug even present amt absent provisioned disabled known unofficial methods july 2018 another set vulnerabilitites disclosed sa-00112 september 2018 yet another vulnerability published sa-00125 normally possible user disable undocumented methods discovered however methods supported intel security architecture designed prevent disabling thus possibility considered intel security vulnerability example virus could abuse make computer lose functionality typical end-user expects ability play media drm hand malicious actor could use remotely compromise system strictly speaking none known methods disables completely since required booting main cpu known methods merely make go abnormal states soon boot seems working functionality still physically connected current microprocessor continuing execute code 2016 me_cleaner project found integrity verification broken supposed detect tampered case shut pc forcibly every 30 minutes system start prevents compromised system running undetected yet allows owner fix issue flashing valid version firmware grace period project found making unauthorized changes firmware possible force abnormal error state prevented triggering shutdown even large parts firmware overwritten thus made inoperable august 2017 russian company positive technologies dmitry sklyarov published method disable via undocumented built-in mode intel confirmed contains switch enable government authorities nsa make go high-assurance platform hap mode boot mode disables functions authorized use government authorities supposed available machines produced yet turned machines sold retail market tricked activating switch.. manipulation hap bit quickly incorporated me_cleaner project late 2017 several laptop vendors announced intentions ship laptops intel disabled none two methods disable discovered far turned effective countermeasure sa-00086 vulnerability vulnerability early-loaded module essential boot main cpu ring \u22123 rootkit demonstrated invisible things lab q35 chipset work later q45 chipset intel implemented additional protections exploit worked remapping normally protected memory region top 16 mb ram reserved rootkit could installed regardless whether amt present enabled system chipset always contains arc coprocessor \u22123 designation chosen coprocessor works even system s3 state thus considered layer system management mode rootkits vulnerable q35 chipset keystroke logger me-based rootkit demonstrated patrick stewin another security evaluation vassilios ververis showed serious weaknesses gm45 chipset implementation particular criticized amt transmitting unencrypted passwords smb provisioning mode ide redirection serial lan features used also found zero touch provisioning mode ztc still enabled even amt appears disabled bios 60 euros ververis purchased go daddy certificate accepted firmware allows remote zero touch provisioning possibly unsuspecting machines broadcast hello packets would-be configuration servers may 2017 intel confirmed many computers amt unpatched critical privilege escalation vulnerability cve-2017-5689 vulnerability nicknamed silent bob silent researchers reported intel affects numerous laptops desktops servers sold dell fujitsu hewlett-packard later hewlett packard enterprise hp inc. intel lenovo possibly others researchers claimed bug affects systems made 2010 later reports claimed bug also affects systems made long ago 2008 vulnerability described giving remote attackers june 2017 platinum cybercrime group became notable exploiting serial lan sol capabilities amt perform data exfiltration stolen documents months previous bugs subsequent warnings eff security firm positive technologies claimed developed working exploit 20 november 2017 intel confirmed number serious flaws found management engine mainstream trusted execution engine tablet/mobile server platform services high end server firmware released critical firmware update essentially every intel-based computer last several years including desktops servers found vulnerable security compromised although potential routes exploitation entirely known possible patch problems operating system firmware uefi bios update motherboard required anticipated take quite time many individual manufacturers accomplish ever would many systems none known unofficial methods disable prevent exploitation vulnerability firmware update vendor required however discovered vulnerability note firmware updates fully effective either attacker access firmware region simply flash old vulnerable version exploit bug july 2018 intel announced 3 vulnerabilities cve-2018-3628 cve-2018-3629 cve-2018-3632 discovered patch csme firmware would required intel indicated would patch 3rd generation core processors earlier despite chips chipsets far back intel core 2 duo vpro intel centrino 2 vpro affected critics like electronic frontier foundation eff security expert damien zammit accused backdoor privacy concern zammit stresses full access memory without parent cpu knowledge full access tcp/ip stack send receive network packets independently operating system thus bypassing firewall intel responded saying intel put back doors products products give intel control access computing systems without explicit permission end user intel design backdoors access products recent reports claiming otherwise misinformed blatantly false intel participate efforts decrease security technology context criticism intel amd secure technology pointed nsa budget request 2013 contained sigint enabling project goal insert vulnerabilities commercial encryption systems systems \u2026 conjectured intel amd secure technology might part programme google attempting eliminate proprietary firmware servers found hurdle shortly sa-00086 patched vendors amd processor mainboards started shipping bios updates allow disabling amd secure technology subsystem similar function management engine often confused intel amt amt runs available processors vpro amt enables owners remote administration computer like turning reinstalling operating system however built intel chipsets since 2008 amt amt unprovisioned owner official documented way disable", + "neighbors": [ + 11, + 85, + 137, + 211, + 270, + 752, + 755, + 1160, + 1351 + ], + "mask": "Validation" + }, + { + "node_id": 642, + "label": 7, + "text": "Bright_Computing:bright computing bright computing inc. developer software deploying managing high-performance hpc clusters kubernetes clusters openstack private clouds on-prem data centers well public cloud bright computing founded matthijs van leeuwen 2009 spun company clustervision co-founded alex ninaber arijan sauer alex matthijs worked together uk \u2019 compusys one first companies commercially build hpc clusters left compusys 2002 start clustervision netherlands determining growing market building managing supercomputer clusters using off-the-shelf hardware components open source software tied together customized scripts clustervision also provided delivery installation support services hpc clusters universities government entities 2004 martijn de vries joined clustervision began development cluster management software software made available customers 2008 name clustervisionos v4 2009 bright computing spun clustervision clustervisionos renamed bright cluster manager van leeuwen named bright computing \u2019 ceo 2010 ing corporate investments made 2.5 million investment bright computing 2014 draper fisher jurvetson dfj us dfj esprit uk prime ventures nl ing corporate investments invested 14.5 million bright computing time bright computing clustervision completely separated february 2016 bright appointed bill wagner chief executive officer matthijs van leeuwen became chief strategy officer left company board directors 2018 wagner presided multiple layoffs august 2019 controversial alliance huawei announced sc 18 early customers included boeing sandia national laboratories virginia tech hewlett packard nsa drexel university many early customers introduced resellers including sicorp cray dell advanced hpc 2019 company 700 customers including 50 fortune 500 companies.this citation 2016 cites much lower number removed bright cluster manager hpc lets customers deploy manage complete clusters provides management hardware operating system hpc software users 2014 company announced bright openstack software deploy provision manage openstack-based private cloud infrastructures 2016 bright started bundling several machine learning frameworks associated tools libraries product make easy get machine learning workload running bright cluster december 2018 version 8.2 released introduced support arm64 architecture edge capabilities build clusters spread many different geographical locations improved workload accounting reporting features well many improvements bright integration kubernetes bright cluster manager software frequently sold original equipment manufacturer oem resellers including dell cray technology partners include bright computing covered software magazine yahoo finance among publications 2016 bright computing awarded \u20ac1.5m horizon 2020 sme instrument grant european commission bright computing one 33 grant recipients 960 submitted proposals category 5 260 grants awarded", + "neighbors": [ + 211, + 227, + 965, + 1019, + 1354 + ], + "mask": "Test" + }, + { + "node_id": 643, + "label": 3, + "text": "Arithmetic_logic_unit:arithmetic logic unit arithmetic logic unit alu combinational digital electronic circuit performs arithmetic bitwise operations integer binary numbers contrast floating-point unit fpu operates floating point numbers alu fundamental building block many types computing circuits including central processing unit cpu computers fpus graphics processing units gpus single cpu fpu gpu may contain multiple alus inputs alu data operated called operands code indicating operation performed alu output result performed operation many designs alu also status inputs outputs convey information previous operation current operation respectively alu external status registers alu variety input output nets electrical conductors used convey digital signals alu external circuitry alu operating external circuits apply signals alu inputs response alu produces conveys signals external circuitry via outputs basic alu three parallel data buses consisting two input operands b result output data bus group signals conveys one binary integer number typically b bus widths number signals comprising bus identical match native word size external circuitry e.g. encapsulating cpu processor opcode input parallel bus conveys alu operation selection code enumerated value specifies desired arithmetic logic operation performed alu opcode size bus width determines maximum number different operations alu perform example four-bit opcode specify sixteen different alu operations generally alu opcode machine language opcode though cases may directly encoded bit field within machine language opcode status outputs various individual signals convey supplemental information result current alu operation general-purpose alus commonly status signals end alu operation status output signals usually stored external registers make available future alu operations e.g. implement multiple-precision arithmetic controlling conditional branching collection bit registers store status outputs often treated single multi-bit register referred status register condition code register status inputs allow additional information made available alu performing operation typically single carry-in bit stored carry-out previous alu operation alu combinational logic circuit meaning outputs change asynchronously response input changes normal operation stable signals applied alu inputs enough time known propagation delay passed signals propagate alu circuitry result alu operation appears alu outputs external circuitry connected alu responsible ensuring stability alu input signals throughout operation allowing sufficient time signals propagate alu sampling alu result general external circuitry controls alu applying signals inputs typically external circuitry employs sequential logic control alu operation paced clock signal sufficiently low frequency ensure enough time alu outputs settle worst-case conditions example cpu begins alu addition operation routing operands sources usually registers alu operand inputs control unit simultaneously applies value alu opcode input configuring perform addition time cpu also routes alu result output destination register receive sum alu input signals held stable next clock allowed propagate alu destination register cpu waits next clock next clock arrives destination register stores alu result since alu operation completed alu inputs may set next alu operation number basic arithmetic bitwise logic functions commonly supported alus basic general purpose alus typically include operations repertoires alu shift operations cause operand b shift left right depending opcode shifted operand appears simple alus typically shift operand one bit position whereas complex alus employ barrel shifters allow shift operand arbitrary number bits one operation single-bit shift operations bit shifted operand appears carry-out value bit shifted operand depends type shift integer arithmetic computations multiple-precision arithmetic algorithm operates integers larger alu word size algorithm treats operand ordered collection alu-size fragments arranged most-significant ms least-significant ls vice versa example case 8-bit alu 24-bit integer codice_1 would treated collection three 8-bit fragments codice_2 ms codice_3 codice_4 ls since size fragment exactly matches alu word size alu directly operate piece operand algorithm uses alu directly operate particular operand fragments thus generate corresponding fragment partial multi-precision result partial generated written associated region storage designated multiple-precision result process repeated operand fragments generate complete collection partials result multiple-precision operation arithmetic operations e.g. addition subtraction algorithm starts invoking alu operation operands ls fragments thereby producing ls partial carry bit algorithm writes partial designated storage whereas processor state machine typically stores carry bit alu status register algorithm advances next fragment operand collection invokes alu operation fragments along stored carry bit previous alu operation thus producing another significant partial carry bit carry bit stored status register partial written designated storage process repeats operand fragments processed resulting complete collection partials storage comprise multi-precision arithmetic result multiple-precision shift operations order operand fragment processing depends shift direction left-shift operations fragments processed ls first ls bit partial\u2014which conveyed via stored carry bit\u2014must obtained ms bit previously left-shifted less-significant operand conversely operands processed ms first right-shift operations ms bit partial must obtained ls bit previously right-shifted more-significant operand bitwise logical operations e.g. logical logical operand fragments may processed arbitrary order partial depends corresponding operand fragments stored carry bit previous alu operation ignored although alu designed perform complex functions resulting higher circuit complexity cost power consumption larger size makes impractical many cases consequently alus often limited simple functions executed high speeds i.e. short propagation delays external processor circuitry responsible performing complex functions orchestrating sequence simpler alu operations example computing square root number might implemented various ways depending alu complexity implementations transition fastest expensive slowest least costly square root calculated cases processors simple alus take longer perform calculation multiple alu operations must performed alu usually implemented either stand-alone integrated circuit ic 74181 part complex ic latter case alu typically instantiated synthesizing description written vhdl verilog hardware description language example following vhdl code describes simple 8-bit alu mathematician john von neumann proposed alu concept 1945 report foundations new computer called edvac cost size power consumption electronic circuitry relatively high throughout infancy information age consequently serial computers many early computers pdp-8 simple alu operated one data bit time although often presented wider word size programmers one earliest computers multiple discrete single-bit alu circuits 1948 whirlwind employed sixteen math units enable operate 16-bit words 1967 fairchild introduced first alu implemented integrated circuit fairchild 3800 consisting eight-bit alu accumulator integrated-circuit alus soon emerged including four-bit alus am2901 74181 devices typically bit slice capable meaning carry look ahead signals facilitated use multiple interconnected alu chips create alu wider word size devices quickly became popular widely used bit-slice minicomputers microprocessors began appear early 1970s even though transistors become smaller often insufficient die space full-word-width alu result early microprocessors employed narrow alu required multiple cycles per machine language instruction examples includes popular zilog z80 performed eight-bit additions four-bit alu time transistor geometries shrank following moore law became feasible build wider alus microprocessors modern integrated circuit ic transistors orders magnitude smaller early microprocessors making possible fit highly complex alus ics today many modern alus wide word widths architectural enhancements barrel shifters binary multipliers allow perform single clock cycle operations would required multiple operations earlier alus", + "neighbors": [ + 51, + 53, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 359, + 374, + 386, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 544, + 589, + 615, + 659, + 719, + 738, + 752, + 776, + 803, + 821, + 846, + 893, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1044, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1572, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 644, + "label": 1, + "text": "Object_Design,_Incorporated:object design incorporated object design incorporated often called odi software company founded 1988 developed commercialized object database called objectstore object design founded several former symbolics employees including daniel weinreb based burlington massachusetts objectstore object-oriented database shipped 1990 1994 odi listed 1 inc. magazine list fastest-growing private companies u.s. major early customer telstra used map toll-free telephone numbers end point close caller example local taxi company chain restaurant odi went public 1996 listed nasdaq odis 1999 odi shipped excelon xml application development environment marketed integration server january 2000 odi renamed excelon focussed marketing xml integration software 2002 odi acquired progress software continued develop 2013 progress software sold objectstore product line among others aurea software inc. newly formed operating subsidiary esw capital investment arm trilogy enterprises part deal objectstore moved separate operating subsidiary esw capital", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 645, + "label": 1, + "text": "DOTO_Database:doto database doto database documentation oppressed online portal data hate-crime based religious identity happened india since 2014 website launched 7 march 2018 constitution club india new delhi inauguration ceremony attended ram punyani teesta setalvad saba naqvi zafar ul islam khan john dayal social activists documentation oppressed independent non-profit documentation center based new delhi run network civil society organizations national grassroot level like quill foundation human rights watch amnesty international chri people union civil liberties others doto database functions tracker violence site in-depth narratives database mixes crowd-sourcing model investigative editorial teams past years marked increase violence conducted certain sections society violence manifests different forms organized institutional violence state actions allied groups furtherance internalized biases primary objective doto database create common documentation platform civil society report hate crime incidents happening across india database document verifiable incidents targeted violence specific communities reported english urdu media well fact-finding civil society reports also provides platform in-depth narratives doto increase media reportage amalgamation crowd-sourcing model along investigative editorial teams easy-to-use model ultimately seeks make essential information accessible address number issues systemic violation fundamental rights erosion constitutional values deployment hate towards religious minorities india", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 646, + "label": 7, + "text": "Client_(computing):client computing client computer program part operation relies sending request another program computer hardware software accesses service made available server may may located another computer example web browsers clients connect web servers retrieve web pages display email clients retrieve email mail servers online chat uses variety clients vary depending chat protocol used multiplayer video games online video games may run client computer term client may also applied computers devices run client software users use client software client part client\u2013server model still used today clients servers may computer programs run machine connect via inter-process communication techniques combined internet sockets programs may connect service operating possibly remote system internet protocol suite servers wait potential clients initiate connections may accept term first applied devices capable running stand-alone programs could interact remote computers via network computer terminals clients time-sharing mainframe computer one classification client computers devices either thick clients thin clients hybrid clients thick client also known rich client fat client client performs bulk data processing operations necessarily rely server personal computer common example fat client relatively large set features capabilities light reliance upon server example computer running art program krita sketchup ultimately shares result work network thick client computer runs almost entirely standalone machine save send receive files via network standard called workstation thin client minimal sort client thin clients use resources host computer thin client generally presents processed data provided application server performs bulk required data processing device using web application office web apps thin client hybrid client mixture two client models similar fat client processes locally relies server storing persistent data approach offers features fat client multimedia support high performance thin client high manageability flexibility device running online version video game diablo iii example hybrid client", + "neighbors": [ + 14, + 90, + 95, + 258, + 277, + 319, + 330, + 333, + 363, + 364, + 365, + 491, + 494, + 505, + 545, + 552, + 582, + 585, + 598, + 605, + 620, + 623, + 627, + 678, + 734, + 758, + 779, + 813, + 864, + 886, + 961, + 977, + 1166, + 1218, + 1228, + 1235, + 1249, + 1321, + 1339, + 1395, + 1423, + 1452, + 1517, + 1563, + 1568, + 1570, + 1585, + 1604 + ], + "mask": "Train" + }, + { + "node_id": 647, + "label": 3, + "text": "Windows_Server_2016:windows server 2016 windows server 2016 server operating system developed microsoft part windows nt family operating systems developed concurrently windows 10 first early preview version technical preview became available october 1 2014 together first technical preview system center windows server 2016 released september 26 2016 microsoft ignite conference became generally available october 12 2016 two successors windows server 2019 windows server semi-annual channel excludes graphical user interface many older components windows server 2016 variety new features including microsoft announced new installation option nano server offers minimal-footprint headless version windows server excludes graphical user interface wow64 support 32-bit software windows installer support console login either locally via remote desktop connection management performed remotely via windows management instrumentation wmi windows powershell remote server management tools collection web-based gui command line tools however technical preview 5 microsoft re-added ability administer nano server locally powershell according microsoft engineer jeffrey snover nano server 93 lower vhd size 92 fewer critical security advisories 80 fewer reboots windows server nano server available microsoft software assurance customers cloud computing platforms microsoft azure amazon web services starting new feature release windows server version 1709 nano server installed inside container host microsoft reorganized satya nadella putting server system center teams together previously server team closely aligned windows client team azure team also working closely server team march 2017 microsoft demonstrated internal version server 2016 running armv8-a architecture reported microsoft working qualcomm centriq cavium thunderx2 chips according james vincent verge decision endangers intel dominance server cpu market however later inquiry microsoft revealed version windows server internal use impacts subscribers microsoft azure service public beta version windows server 2016 still called vnext branded windows server technical preview released october 1 2014 technical preview builds aimed toward enterprise users first technical preview first set expire april 15 2015 microsoft later released tool extend expiry date last second tech preview os may 2015 second beta version technical preview 2 released may 4 2015 third preview version technical preview 3 released august 19 2015 technical preview 4 released november 19 2015 technical preview 5 released april 27 2016 windows server 2016 insider preview build 16237 released windows insiders july 13 2017 windows server 2016 officially released microsoft ignite conference september 26 2016 unlike predecessor windows server 2016 licensed number cpu cores rather number cpu sockets\u2014a change similarly adopted biztalk server 2013 sql server 2014 new licensing structure adopted windows server 2016 also moved away windows server 2012/2012r2 cpu socket licensing model amount cores covered one license limited windows server 2016 standard datacenter core licensing covers minimum 8 core licenses physical processor minimum 16 core licenses server core licenses sold packs two standard edition providing familiar rights run 2 virtualized os environments server goes 16 core licenses 2 processor server additional licenses required windows server 2016 windows server 2016 technical preview released october 1 2014 first beta version operating system made publicly available version number 6.4.9841 windows server 2016 technical preview 2 made available may 4 2015 version number 10.0.10074 similar jump significant part version number 6 10 seen windows 10 highlights version include third technical preview windows server 2016 made available august 19 2015 version number 10.0.10514 highlights version include fourth technical preview operating system made available november 19 2015 one year one month initial technical preview version number 10.0.10586 highlights include last technical preview windows server 2016 made available april 27 2016 version number 10.0.14300 highlights include windows server 2016 released manufacturing september 26 2016 bearing version number 10.0.14393 windows 10 anniversary update microsoft added following final touches windows server version 1709 based windows 10 fall creators update released october 17 2017 release dropped windows server 2016 name called windows server microsoft offered microsoft software assurance customers active windows server 2016 license system requirements first windows server product fall semi-annual channel sac release cadence product features server core nano server modes two server core mode os installed bare system nano server mode available operating system container windows server version 1803 based windows 10 april 2018 update second semi-annual channel release windows server also final version branched server 2016 codebase next release shares version number 1809 windows server 2019", + "neighbors": [ + 108, + 111, + 148, + 188, + 295, + 322, + 326, + 425, + 433, + 448, + 521, + 583, + 638, + 705, + 754, + 763, + 921, + 941, + 961, + 1019, + 1098, + 1138, + 1151, + 1193, + 1287, + 1327, + 1338, + 1361, + 1363, + 1384, + 1428, + 1436, + 1453, + 1507, + 1555, + 1578 + ], + "mask": "Train" + }, + { + "node_id": 648, + "label": 4, + "text": "NetBarrier_X4:netbarrier x4 netbarrier x4 discontinued version intego netbarrier line firewall os x features cookie cleaner browser history cleaner internet traffic statistic internet bandwidth meter cookie filters information hiding firewall customizable already configured options restrictions network client local server server client customized customized option allows flexible firewall configuration netbarrier features integrated virusbarrier x6 longer sold standalone product", + "neighbors": [ + 94, + 134, + 189, + 217, + 476, + 569, + 656, + 685, + 731, + 842, + 910, + 961, + 1138, + 1250, + 1257, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Validation" + }, + { + "node_id": 649, + "label": 9, + "text": "Game_Oriented_Assembly_Lisp:game oriented assembly lisp game oriented assembly lisp goal programming language dialect language lisp made video games developed andy gavin jak daxter team company naughty dog written using allegro common lisp used development entire jak daxter series games syntactically goal resembles lisp dialect scheme though many idiosyncratic object-oriented programming features classes inheritance virtual functions goal encourages imperative programming style programs tend consist sequence events executed rather functional programming style functions evaluated recursively diversion scheme allows side effects encourage imperative style goal run interpreter instead compiled directly playstation 2 machine code execute offers limited facilities garbage collection relying extensively runtime support offers dynamic memory allocation primitives designed make well-suited running constant memory video game console goal extensive support inlined assembly language code using special codice_1 form allowing programs freely mix assembly higher-level constructs within one function goal compiler implemented allegro common lisp supports long term compiling listener session gives compiler knowledge state compiled thus running program including symbol table addition dynamic linking allows function edited recompiled uploaded inserted running game without restart process similar edit continue feature offered c++ compilers allows programs replace arbitrary amounts code even entire object files interrupt running game debugger feature used implement code level streaming jak daxter games goal first use game predecessor language game oriented object lisp gool also developed andy gavin crash bandicoot game since naughty dog longer employs goal primary development maintenance engineer pressure new parent company sony share technology studios naughty dog transitioned away lisp however since resumed using scripting playstation 3 games including last us", + "neighbors": [ + 27, + 46, + 56, + 78, + 116, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 378, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 893, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1372, + 1375, + 1385, + 1388, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 650, + "label": 2, + "text": "Ksplice:ksplice ksplice open-source extension linux kernel allows security patches applied running kernel without need reboots avoiding downtimes improving availability technique broadly referred dynamic software updating ksplice supports patches make significant semantic changes kernel data structures ksplice implemented linux ia-32 x86-64 architectures developed ksplice inc. 21 july 2011 oracle acquired ksplice started offering support oracle linux support red hat enterprise linux dropped turned free 30-day trial rhel customers incentive migrate oracle linux premier support time use oracle unbreakable enterprise kernel uek became requirement using ksplice production systems ksplice available free desktop linux installations official support available fedora ubuntu linux distributions ksplice takes input unified diff original kernel source code updates running kernel memory using ksplice require preparation system originally booted running kernel needs special prior compiling example order generate update ksplice must determine code within kernel changed source code patch ksplice performs analysis executable linkable format elf object code layer rather c source code layer apply patch ksplice first freezes execution computer program running system verifies processors middle executing functions modified patch ksplice modifies beginning changed functions instead point new updated versions functions modifies data structures memory need changed finally ksplice resumes processor running left fully automatic ksplice design originally limited patches introduce semantic changes data structures since linux kernel security patches make kinds changes evaluation linux kernel security patches may 2005 may 2008 found ksplice able apply fixes 64 significant kernel vulnerabilities discovered interval 2009 major linux vendors asked customers install kernel update per month patches introduce semantic changes data structures ksplice requires programmer write short amount additional code help apply patch necessary 12 updates time period ksplice software created four mit students based jeff arnold master thesis later created ksplice inc. around may 2009 company mit 100k entrepreneurship competition cyber security challenge global security challenge whereas ksplice software provided open source license ksplice inc. provided service make easier use software ksplice inc. provided prebuilt tested updates red hat centos debian ubuntu fedora linux distributions virtualization technologies openvz virtuozzo also supported updates ubuntu desktop fedora systems provided free charge whereas platforms offered subscription basis 21 july 2011 oracle corporation announced acquired ksplice inc. time company acquired ksplice inc. claimed 700 companies using service protect 100,000 servers service available multiple linux distributions stated time acquisition oracle believes enterprise linux provider offer zero downtime updates explicitly oracle plan support use ksplice technology red hat enterprise linux existing legacy customers continue supported ksplice new customers accepted platforms ksplice available free fedora ubuntu january 2016 ksplice integrated oracle unbreakable enterprise kernel release 4 oracle linux 6 7 oracle redistribution red hat enterprise linux", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 213, + 219, + 265, + 267, + 292, + 294, + 305, + 306, + 322, + 327, + 346, + 400, + 401, + 413, + 465, + 477, + 571, + 583, + 630, + 664, + 688, + 720, + 725, + 728, + 736, + 754, + 797, + 800, + 860, + 891, + 897, + 935, + 941, + 961, + 966, + 986, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1060, + 1102, + 1105, + 1138, + 1155, + 1187, + 1197, + 1202, + 1208, + 1224, + 1241, + 1252, + 1278, + 1301, + 1313, + 1357, + 1360, + 1391, + 1398, + 1415, + 1441, + 1456, + 1468, + 1474, + 1494, + 1524, + 1526, + 1530, + 1546, + 1558, + 1578, + 1602, + 1616, + 1631, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 651, + "label": 1, + "text": "National_Information_Governance_Board_for_Health_and_Social_Care:national information governance board health social care national information governance board health social care nigb established united kingdom section 157 health social care act 2008 effect october 2008 range advisory functions relating information governance january 2009 nigb also gained functions section 251 nhs act 2006 previously held patient information advisory group piag abolition functions advise secretary state health use powers set aside common law duty confidentiality england identifiable patient information needed consent practicable 1 april 2013 nigb functions monitoring improving information governance practice transferred care quality commission established national information governance committee oversee work functions relating section 251 nhs act 2006 access people personal confidential information research purposes transferred health research authority confidentiality advisory group key functions nigb excerpted legislation definition \u201c relevant information \u201d legislation covers patient information information obtained generated course provision health service information obtained generated course exercise local social services authority england adult social services functions areas nigb functions e delegated nigb ethics confidentiality committee ecc functions primarily related applications use identifiable patient information without consent specific circumstances within bounds section 251 nhs act 2006 applications considered piag nigb passed health research authority confidentiality advisory group cag 1 april 2013 nigb also replaced care record development board crdb closed september 2007 nigb subsequently maintained nhs care record guarantee originally developed crdb developed companion social care record guarantee nigb consisted chair number public members appointed nhs appointments commission number representative members appointed secretary state health range stakeholder organisations representatives several stakeholder organisations served corresponding advisers nigb typically attended meetings regular observers meetings included representatives information commissioner office devolved uk administrations ecc consisted chair number members appointed nigb advice nhs appointments commission approved independent assessor ecc chair two ecc members also nigb members 1 june 2011 31 march 2013 dame fiona caldicott chair nigb succeeding harry cayton chaired nigb since inception members nigb ecc widely distributed nationally attended meetings nigb office since september 2011 based skipton house london se1 nigb staff team predominantly based office result health social care act 2012 nigb abolished effect 1 april 2013 functions delegated ecc respect research transferred health research authority nhs commissioning board responsible providing advice guidance nhs bodies functions transferred national information governance committee hosted care quality commission", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 652, + "label": 1, + "text": "Art_Recovery_Group:art recovery group art recovery international previously art recovery group private company provides due diligence dispute resolution art recovery services international art market cultural heritage institutions headquartered venice italy company founded 2013 initially specialising recovery stolen claimed works art 2015 company launched artclaim database new art market due diligence resource online-resource developed soza technical ltu technologies introducing image-recognition technology commercial due diligence first time 2016 non-profit company based us formed artclaim database became artive.org art recovery international established 2013 christopher a. marinello lawyer specialising recovery stolen claimed works art prior founding company marinello formerly general counsel art loss register marinello responsible virtually successful art recoveries art loss register 2006-2013 2013 marinello became dissatisfied methods alr chairman julian radcliffe decided form art recovery business stolen art database cases clients followed art recovery international enjoyed almost immediate success acclaim company services provided law enforcement agencies pro-bono basis since establishment art recovery overseen number high-profile recovery cases including works 2015 company launched artclaim database new due diligence resource international art market web-based platform introduced image-recognition technology searches item registrations order improve accuracy efforts reduce trade illicit art october 2015 artclaim database awarded wealth management innovator year spear wealth management awards 2016 non-profit company based us formed artclaim database became artive.org art recovery group ceo christopher a. marinello one world leading practitioners restitution recovery stolen claimed works art involved recovery 500 million worth art high-profile stolen art cases around world marinello also represented heirs paul rosenberg recovery efforts art works looted second world war may 2015 marinello oversaw recovery painting henri matisse discovered munich home cornelius gurlitt behalf rosenberg family 2013 marinello co-founded annual art crime cultural heritage symposium new york university school professional studies", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 653, + "label": 9, + "text": "Allegro_Common_Lisp:allegro common lisp allegro common lisp programming language integrated development environment ide developed franz inc dialect language lisp commercial software implementation language common lisp allegro cl provides full american national standards institute ansi common lisp standard many extensions including threads clos streams clos mop unicode ssl streams implementations various internet protocols opengl interface first version allegro common lisp finished end 1986 originally called extended common lisp allegro cl available many operating systems including microsoft windows 32/64-bit many unix unix-like 32-bit 64-bit including macos intel 32/64-bit linux 32/64-bit freebsd 32-bit solaris x64 sparc 32/64-bit unicos uts internationalization localization support based unicode supports various external text encodings provides string character types based universal coded character set 2 ucs-2 allegro cl used without integrated development environment ide available windows linux macos version 8.2 ide written allegro cl includes development tools including editor interface designer allegro cl used deliver applications allegro cl available freeware free express edition limits like constrained heap space non-commercial use customers get access much source code allegro cl allegro cl includes implementation prolog object caching database called allegrocache recent release allegro cl 10.1 supports symmetric multiprocessing allegro cl used implement various applications", + "neighbors": [ + 27, + 46, + 56, + 99, + 117, + 134, + 173, + 194, + 203, + 210, + 251, + 258, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 394, + 446, + 447, + 454, + 488, + 501, + 506, + 509, + 536, + 565, + 567, + 601, + 649, + 653, + 682, + 686, + 693, + 753, + 787, + 795, + 796, + 815, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1022, + 1066, + 1068, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1189, + 1190, + 1207, + 1221, + 1225, + 1227, + 1235, + 1245, + 1251, + 1269, + 1277, + 1298, + 1311, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1502, + 1516, + 1536, + 1588, + 1609, + 1621, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 654, + "label": 4, + "text": "Alphonse_F._La_Porta:alphonse f. la porta alphonse f. la porta born january 15 1939 career member senior foreign service served u.s ambassador mongolia december 1997 november 2000 subsequently served political advisor u.s. commander-in-chief regional headquarters allied forces southern europe january 2001 november 2003 alphonse la porta born january 15 1939 brooklyn new york family moved south shore long island \u2013 first oceanside lynbrook.when young parents first generation immigrants worked hair dressers father came sicily mother ukraine child attended davison avenue elementary school malverne junior high school finally graduating malverne high school 1956 enrolled georgetown university school foreign service graduating 1960 took foreign service exam passing written portion failing score passing grade oral exams decided pursue master degree new york university 1960 1962 entered u.s. army worked army intelligence finished enlistment 1963 began pursue ph.d. georgetown university recruited work national security agency retook foreign service exam 1963\u201364 time passed exams entered foreign service 1965 first assignment office planning management 1967 1970 political officer chief consular section u.s. embassy jakarta indonesia position attested passport application stanley ann dunham soetoro mother president barack h. obama thus become part barack obama citizenship conspiracy theories principal officer u.s. consulate medan 1978\u20131981 1985 1987 la porta served state department office management operations moved deputy chief mission u.s. embassy wellington new zealand 1987 1991 amb la porta washington-based assignments included working bureau east asian pacific affairs director office cambodian genocide investigation executive assistant president special representative philippine economic reform deputy director office indonesia malaysia brunei singapore affairs becoming u.s ambassador mongolia 1997 served president vice president american foreign service association 1995 1997 ambassador la porta retired u.s. foreign service september 2003 38 years service president united states-indonesia society usindo 2004 2007 currently managing partner trans pacific partners llc tpp provides professional support military exercises pacific europe latin america serves consultant civil preparedness disaster management amb la porta graduate national war college georgetown university school foreign service 1960 new york university served commissioned officer united states army 1961 1963 speaks indonesian turkish", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 655, + "label": 4, + "text": "Stack_buffer_overflow:stack buffer overflow software stack buffer overflow stack buffer overrun occurs program writes memory address program call stack outside intended data structure usually fixed-length buffer stack buffer overflow bugs caused program writes data buffer located stack actually allocated buffer almost always results corruption adjacent data stack cases overflow triggered mistake often cause program crash operate incorrectly stack buffer overflow type general programming malfunction known buffer overflow buffer overrun overfilling buffer stack likely derail program execution overfilling buffer heap stack contains return addresses active function calls stack buffer overflow caused deliberately part attack known stack smashing affected program running special privileges accepts data untrusted network hosts e.g webserver bug potential security vulnerability stack buffer filled data supplied untrusted user user corrupt stack way inject executable code running program take control process one oldest reliable methods attackers gain unauthorized access computer canonical method exploiting stack-based buffer overflow overwrite function return address pointer attacker-controlled data usually stack illustrated codice_1 following example code takes argument command line copies local stack variable codice_2 works fine command-line arguments smaller 12 characters see figure b arguments larger 11 characters long result corruption stack maximum number characters safe one less size buffer c programming language strings terminated null byte character twelve-character input thus requires thirteen bytes store input followed sentinel zero byte zero byte ends overwriting memory location one byte beyond end buffer program stack codice_3 various inputs notice figure c argument larger 11 bytes supplied command line codice_3 overwrites local stack data saved frame pointer importantly return address codice_3 returns pops return address stack jumps address i.e starts executing instructions address thus attacker overwritten return address pointer stack buffer codice_6 contains attacker-supplied data actual stack buffer overflow exploit string would instead shellcode suitable platform desired function program special privileges e.g suid bit set run superuser attacker could use vulnerability gain superuser privileges affected machine attacker also modify internal variable values exploit bugs example number platforms subtle differences implementation call stack affect way stack buffer overflow exploit work machine architectures store top-level return address call stack register means overwritten return address used later unwinding call stack another example machine-specific detail affect choice exploitation techniques fact risc-style machine architectures allow unaligned access memory combined fixed length machine opcodes machine limitation make jump esp technique almost impossible implement one exception program actually contains unlikely code explicitly jump stack register within topic stack buffer overflows often-discussed-but-rarely-seen architecture one stack grows opposite direction change architecture frequently suggested solution stack buffer overflow problem overflow stack buffer occurs within stack frame overwrite return pointer investigation claimed protection finds na\u00efve solution best overflow occurs buffer previous stack frame still overwrite return pointer allow malicious exploitation bug instance example return pointer codice_7 overwritten overflow actually occurs within stack frame codice_8 however buffer overflows call codice_8 resides previous stack frame return pointer codice_8 numerically higher memory address buffer means instead return pointer codice_7 overwritten return pointer codice_8 overwritten means growing stack opposite direction change details stack buffer overflows exploitable reduce significantly number exploitable bugs years number control-flow integrity schemes developed inhibit malicious stack buffer overflow exploitation may usually classified three categories stack canaries named analogy canary coal mine used detect stack buffer overflow execution malicious code occur method works placing small integer value randomly chosen program start memory stack return pointer buffer overflows overwrite memory lower higher memory addresses order overwrite return pointer thus take control process canary value must also overwritten value checked make sure changed routine uses return pointer stack technique greatly increase difficulty exploiting stack buffer overflow forces attacker gain control instruction pointer non-traditional means corrupting important variables stack another approach preventing stack buffer overflow exploitation enforce memory policy stack memory region disallows execution stack w^x write xor execute means order execute shellcode stack attacker must either find way disable execution protection memory find way put her/his shellcode payload non-protected region memory method becoming popular hardware support no-execute flag available desktop processors method definitely makes canonical approach stack buffer overflow exploitation fail without problems first common find ways store shellcode unprotected memory regions like heap little need change way exploitation even ways damning so-called return libc method shellcode creation attack malicious payload load stack shellcode proper call stack execution vectored chain standard library calls usually effect disabling memory execute protections allowing shellcode run normal works execution never actually vectors stack variant return-to-libc return-oriented programming rop sets series return addresses executes small sequence cherry-picked machine instructions within existing program code system libraries sequence ends return so-called gadgets accomplish simple register manipulation similar execution returning stringing together achieves attacker ends even possible use returnless return-oriented programming exploiting instructions groups instructions behave much like return instruction instead separating code data another mitigation technique introduce randomization memory space executing program since attacker needs determine executable code used resides either executable payload provided executable stack one constructed using code reuse ret2libc return-oriented programming rop randomizing memory layout concept prevent attacker knowing code however implementations typically randomize everything usually executable loaded fixed address hence even aslr address space layout randomization combined nonexecutable stack attacker use fixed region memory therefore programs compiled pie position-independent executables even region memory randomized entropy randomization different implementation implementation low enough entropy problem terms brute forcing memory space randomized", + "neighbors": [ + 165, + 195, + 225, + 379, + 703, + 800, + 1003, + 1088, + 1310, + 1453, + 1517 + ], + "mask": "Train" + }, + { + "node_id": 656, + "label": 4, + "text": "ZoneAlarm_Z100G:zonealarm z100g zonealarm secure wireless router z100g discontinued unified threat management security router home soho market z100g developed sofaware technologies check point company hardware similar sofaware safe office vpn-1 edge lines software differs features license allows user access degree zonealarm z100g provides networking security related features including", + "neighbors": [ + 94, + 134, + 189, + 217, + 476, + 569, + 648, + 685, + 731, + 842, + 910, + 961, + 1138, + 1239, + 1250, + 1257, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Validation" + }, + { + "node_id": 657, + "label": 3, + "text": "Colony_(video_game):colony video game colony action-adventure game released 1987 amstrad cpc atari 8-bit family commodore 64 msx zx spectrum mastertronic bulldog label owing overpopulation humanity found necessary grow food colonies planets unfortunately mushroom-growing planet player responsible also inhabited hostile native aliens resemble giant insects player must use droid control maintain harvest mushrooms well look protect colony gameplay takes place flip-screen environment consisting colony made-up storehouses specialist buildings mushroom fields areas solar panels surrounding desert alien planet filled various giant insects colony quite complicated game numerous things player must look-after purpose colony grow mushrooms shipment back earth mushrooms grow green i.e lush areas begin seeds quickly grow eventually reaching stage maturity point collected order deposited money later pick-up spacecraft unfortunately mushrooms one many things insects like eat player pick mature mushrooms partially eaten aliens deposited award payment unfit human consumption colony surrounded security fence keeps giant insects colony causing mischief therein unfortunately fence constantly attack insects chew way player droid must maintain fence destroying marauding insects replacing damaged destroyed pieces fence damaged fence sections deposited fence storehouse repair three different types security-fencing used barbed wire weakest wooden-fencing default fencing-type already use around colony game starts steel fencing strongest fencing type colony powered free-standing solar panels located within colony provide power order recharge droid shields weapons well landing beacon required spaceship land unfortunately insects chew pieces well devastate colony power supply checked fencing droid repair damaged panels correct storehouse well find replacements destroyed panels plenty mushrooms grown safely packed-away pick-up player send message earth spaceship sent en route colony pick player also order supplies extra seeds fencing panels useful items ship deliver game provides eta ship player must keep eye ship requires colony landing beacon arrives beacon ship land landing-bay player must screen time droid crushed drop crates supplies pay mushrooms money used next ordering supplies beacon ship dump supplies random surrounding desert many lost aliens beacon drains colony power-supply quickly important leave long necessary also ensure colony power-storage suitably high activating player droid also set traps almost anywhere colony desert order destroy giant insects traps work addition also permanent traps covering areas colony completely open desert e.g main entrance fencing traps always destroy insects wander without disappearing however reliant colony power supply player allows power drop low traps disappear", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 658, + "label": 4, + "text": "Government_Communications_Headquarters:government communications headquarters government communications headquarters gchq intelligence security organisation responsible providing signals intelligence sigint information assurance government armed forces united kingdom based doughnut suburbs cheltenham gchq responsibility country secretary state foreign commonwealth affairs part foreign office director ranks permanent secretary gchq originally established first world war government code cypher school gc cs known name 1946 second world war located bletchley park responsible breaking german enigma codes two main components gchq composite signals organisation cso responsible gathering information national cyber security centre ncsc responsible securing uk communications joint technical language service jtls small department cross-government resource responsible mainly technical language support translation interpreting services across government departments co-located gchq administrative purposes 2013 gchq received considerable media attention former national security agency contractor edward snowden revealed agency process collecting online telephone data uk via tempora programme snowden revelations began spate ongoing disclosures global surveillance guardian newspaper forced destroy incriminating files given snowden threats lawsuits uk government gchq led director gchq jeremy fleming corporate board made executive non-executive directors reporting corporate board first world war british army royal navy separate signals intelligence agencies mi1b nid25 initially known room 40 respectively 1919 cabinet secret service committee chaired lord curzon recommended peacetime codebreaking agency created task given director naval intelligence hugh sinclair sinclair merged staff nid25 mi1b new organisation initially consisted around 25\u201330 officers similar number clerical staff titled government code cypher school cover-name chosen victor forbes foreign office alastair denniston member nid25 appointed operational head initially control admiralty located watergate house adelphi london public function advise security codes cyphers used government departments assist provision also secret directive study methods cypher communications used foreign powers gc cs officially formed 1 november 1919 produced first decrypt prior date 19 october second world war gc cs relatively small department 1922 main focus gc cs diplomatic traffic service traffic ever worth circulating initiative lord curzon transferred admiralty foreign office gc cs came supervision hugh sinclair 1923 chief sis director gc cs 1925 organisations co-located different floors broadway buildings opposite st. james park messages decrypted gc cs distributed blue-jacketed files became known bjs 1920s gc cs successfully reading soviet union diplomatic ciphers however may 1927 row clandestine soviet support general strike distribution subversive propaganda prime minister stanley baldwin made details decrypts public second world war gc cs based largely bletchley park present-day milton keynes working understanding german enigma machine lorenz ciphers 1940 gc cs working diplomatic codes ciphers 26 countries tackling 150 diplomatic cryptosystems senior staff included alastair denniston oliver strachey dilly knox john tiltman edward travis ernst fetterlein josh cooper donald michie alan turing gordon welchman joan clarke max newman william tutte i. j jack good peter calvocoressi hugh foss outstation far east far east combined bureau set hong kong 1935 moved singapore 1939 subsequently japanese advance malay peninsula army raf codebreakers went wireless experimental centre delhi india navy codebreakers fecb went colombo ceylon kilindini near mombasa kenya gc cs renamed government communications headquarters june 1946 gchq first based eastcote 1951 moved outskirts cheltenham setting two sites \u2013 oakley benhall duncan campbell mark hosenball revealed existence gchq 1976 article time result hosenball deported uk gchq low profile media 1983 trial geoffrey prime kgb mole within gchq created considerable media interest since days second world war us british intelligence shared information gchq means shares information gets information national security agency nsa united states 1984 gchq centre political row conservative government margaret thatcher prohibited employees belonging trade union claimed joining union would conflict national security number mass national one-day strikes held protest decision seen first step wider bans trade unions appeals british courts european commission human rights unsuccessful government offered sum money employee agreed give union membership appeal ilo resulted decision government actions violation freedom association protection right organise convention ban eventually lifted incoming labour government 1997 government communications group public commercial services union pcs formed represent interested employees grades 2000 group 14 former gchq employees dismissed refusing give union membership offered re-employment three accepted intelligence services act 1994 placed activities intelligence agencies legal footing first time defining purpose british parliament intelligence security committee given remit examine expenditure administration policy three intelligence agencies objectives gchq defined working interests national security particular reference defence foreign policies majesty government interests economic wellbeing united kingdom support prevention detection serious crime introduction intelligence agency act late 1993 former prime minister jim callaghan described gchq full blown bureaucracy adding future bodies created provide oversight intelligence agencies investigate whether functions gchq carries today still necessary 1993 wake squidgygate affair gchq denied intercepting recording disclosing telephone calls british royal family late 1993 civil servant michael quinlan advised deep review work gchq following conclusion review intelligence requirements resources imposed 3 cut agency chief secretary treasury jonathan aitken subsequently held face face discussions intelligence agency directors assess savings wake quinlan review aldrich 2010 suggests sir john adye director gchq performed badly meetings aitken leading aitken conclude gchq suffering out-of-date methods management out-of-date methods assessing priorities gchq budget \u00a3850 million 1993 \u00a3 compared \u00a3125 million security service sis mi5 mi6 december 1994 businessman roger hurn commissioned begin review gchq concluded march 1995 hurn report recommended cut \u00a3100 million gchq budget large reduction suffered british intelligence agency since end world war ii j division gchq collected sigint russia disappeared result cuts cuts mostly reversed 2000 wake threats violent non-state actors risks increased terrorism organised crime illegal access nuclear chemical biological weapons david omand became director gchq 1996 greatly restructured agency face new changing targets rapid technological change omand introduced concept sinews sigint new systems allowed flexible working methods avoiding overlaps work creating fourteen domains well-defined working scope tenure omand also saw planning creation doughnut gchq modern headquarters located 176-acre site benhall near cheltenham doughnut would largest building constructed secret intelligence operations outside united states operations gchq chum hom kwok listening station hong kong ended 1994 gchq hong kong operations extremely important relationship nsa contributed investment equipment station anticipation transfer hong kong chinese government 1997 hong kong stations operations moved geraldton australia operations used gchq intelligence-gathering capabilities 1990s included monitoring communications iraqi soldiers gulf war dissident republican terrorists real ira various factions involved yugoslav wars criminal kenneth noye mid 1990s gchq began assist investigation cybercrime end 2003 gchq moved new circular hq popularly known doughnut time second-largest public-sector building project europe estimated cost \u00a3337 million new building designed gensler constructed carillion became base gchq cheltenham operations public spotlight fell gchq late 2003 early 2004 following sacking katharine gun leaked observer confidential email agents united states national security agency addressed gchq agents wiretapping un delegates run-up 2003 iraq war gchq gains intelligence monitoring wide variety communications electronic signals number stations established uk overseas listening stations cheltenham bude scarborough ascension island united states menwith hill ayios nikolaos station cyprus run british army gchq march 2010 gchq criticised intelligence security committee problems security practices failing meet targets work targeted cyber attacks revealed edward snowden guardian gchq spied foreign politicians visiting 2009 g-20 london summit eavesdropping phonecalls emails monitoring computers cases even ongoing summit via keyloggers installed summit according edward snowden gchq two principal umbrella programs collecting communications gchq also access us internet monitoring programme prism since least june 2010 prism said give national security agency fbi easy access systems nine world top internet companies including google facebook microsoft apple yahoo skype february 2014 guardian based documents provided snowden revealed gchq indiscriminately collected 1.8 million private yahoo webcam images users across world month nbc intercept based documents released snowden revealed joint threat research intelligence group cne units within gchq mission cyber operations based dirty tricks shut enemy communications discredit plant misinformation enemies operations 5 gchq operations according conference slideshow presented gchq soon becoming director gchq 2014 robert hannigan wrote article financial times topic internet surveillance stating however much large us technology companies may dislike become command control networks choice terrorists criminals gchq sister agencies tackle challenges scale without greater support private sector arguing internet users would comfortable better sustainable relationship intelligence agencies tech companies since 2013 global surveillance disclosures large us technology companies improved security become less co-operative foreign intelligence agencies including uk generally requiring us court order disclosing data however head uk technology industry group techuk rejected claims stating understood issues disclosure obligations must based upon clear transparent legal framework effective oversight rather suggested deal industry government 2015 documents obtained intercept us national security agency whistleblower edward snowden revealed gchq carried mass-surveillance operation codenamed karma police since 2008 karma police operation swept ip address internet users visiting websites program established public scrutiny oversight karma police powerful spying tool conjunction gchq programs ip addresses could cross-referenced data goal program according documents either web browsing profile every visible user internet b user profile every visible website internet 2015 gchq admitted first time court conducts computer hacking 2017 us press secretary sean spicer alleged gchq conducted surveillance us president donald trump basing allegation statements made media commentator fox news segment us government formally apologised allegations promised would repeated however surveillance russian agents pick contacts made trump campaign team run election passed us agencies 31 october 2018 gchq joined instagram well mission gather intelligence gchq long-time corresponding mission assist protection british government communications government code cypher school gc cs created 1919 overt task providing security advice gc cs security section located mansfield college oxford second world war april 1946 gc cs became gchq gchq security section moved oxford join rest organisation eastcote later year 1952 1954 intelligence mission gchq relocated cheltenham security section remained eastcote march 1954 became separate independent organisation london communications security agency lcsa 1958 renamed london communications-electronic security agency lcesa april 1965 gpo mod units merged lcesa become communications-electronic security department cesd october 1969 cesd merged gchq becoming communications-electronic security group cesg 1977 cesg relocated eastcote cheltenham cesg continued uk national technical authority information assurance including cryptography cesg manufacture security equipment worked industry ensure availability suitable products services gchq funded research areas example centre quantum computing oxford university heilbronn institute university bristol 21st century cesg ran number assurance schemes check clas commercial product assurance cpa cesg assisted products service caps late 1969 concept public key encryption developed proven james h. ellis worked cesg cesd since 1965 ellis lacked necessary number theory expertise necessary build workable system subsequently feasible implementation scheme via asymmetric key algorithm invented another staff member clifford cocks mathematics graduate fact kept secret 1997 2016 national cyber security centre established gchq located london uk authority cyber security absorbed replaced cesg well activities previously existed outside gchq centre cyber assessment cca computer emergency response team uk cert uk cyber-related responsibilities centre protection national infrastructure cpni joint technical language service jtls established 1955 drawing members small ministry defence technical language team others initially provide standard english translations organisational expressions foreign language discover correct english equivalents technical terms foreign languages discover correct expansions abbreviations language remit jtls expanded ensuing years cover technical language support interpreting translation services across uk government local public sector services gloucestershire surrounding counties jtls also produces publishes foreign language working aids crown copyright conducts research machine translation on-line dictionaries glossaries jtls co-located gchq administrative purposes gchq operates partnership equivalent agencies worldwide number bi-lateral multi-lateral relationships principal united states national security agency canada communications security establishment australia australian signals directorate new zealand government communications security bureau mechanism uk-us security agreement broad intelligence-sharing agreement encompassing range intelligence collection methods relationships alleged include shared collection methods system described popular media echelon well analysed product gchq legal basis enshrined intelligence services act 1994 section 3 follows activities involve interception communications permitted regulation investigatory powers act 2000 kind interception carried warrant issued secretary state human rights act 1998 requires intelligence agencies including gchq respect citizens rights described european convention human rights prime minister nominates cross-party members parliament intelligence security committee remit committee includes oversight intelligence security activities reports made directly parliament functions increased justice security act 2013 provide access investigatory powers judicial oversight gchq conduct exercised investigatory powers tribunal uk also independent intelligence services commissioner interception communications commissioner former senior judges investigatory powers tribunal ruled december 2014 gchq breach european convention human rights activities compliant articles 8 right privacy 10 freedom expression european convention human rights however tribunal stated february 2015 one particular aspect data-sharing arrangement allowed uk intelligence services request data us surveillance programmes prism upstream contravention human rights law prior two paragraphs additional information providing details procedures safeguards disclosed public december 2014 furthermore ipt ruled legislative framework united kingdom permit mass surveillance gchq collects analyses data bulk practice mass surveillance complements independent reports interception communications commissioner special report made intelligence security committee parliament although several shortcomings potential improvements oversight legislative framework highlighted despite inherent secrecy around much gchq work investigations carried uk government snowden disclosures admitted various abuses security services report intelligence security committee isc 2015 revealed small number staff uk intelligence agencies found misuse surveillance powers one case leading dismissal member staff gchq although laws place time make abuses criminal offence later year ruling investigatory powers tribunal found gchq acted unlawfully conducting surveillance two human rights organisations closed hearing found government breach internal surveillance policies accessing retaining communications egyptian initiative personal rights legal resources centre south africa second time ipt history made positive determination favour applicants closed session another ipt case 2015 gchq conceded january 2010 regime interception/obtaining analysis use disclosure destruction legally privileged material accordance law purposes article 8 2 european convention human rights accordingly unlawful admission made connection case brought abdel hakim belhaj libyan opponent former gaddafi regime wife fatima bouchar couple accused british ministers officials participating unlawful abduction kidnapping removal libya march 2004 gaddafi still power 2015 complaint green party mp caroline lucas british intelligence services including gchq spying mps allegedly defiance laws prohibiting gchq introduced policy march 2015 require approval prime minister minister deliberately targeting communications parliamentarian then-home secretary theresa may told parliament 2014 investigatory powers tribunal investigated complaint ruled contrary allegation law gave communications parliament special protection wilson doctrine merely acts political convention controversial gchq case determined scope judicial review prerogative powers crown residual powers common law council civil service unions v minister civil service 1985 ac 374 often known simply gchq case case prerogative order council used prime minister minister civil service ban trade union activities civil servants working gchq order issued without consultation house lords decide whether reviewable judicial review held executive action immune judicial review simply uses powers derived common law rather statute thus prerogative reviewable following list heads operational heads gchq gc cs following stations former stations operated since cold war stations former stations gchq certified training gct scheme established certify two main levels cyber security training also degree masters level courses gct scheme designed help organisations find right training also met gchq exacting standards designed assure high quality cyber security training courses training provider also undergone rigorous quality checks gct process carried apmg independent certification body scheme part national cyber security programme established government develop knowledge skills capability aspects cyber security based iisp skills framework historical drama film imitation game 2014 featured benedict cumberbatch portraying alan turing efforts break enigma code employed government code cypher school gchq set number cryptic online challenges public used attract interest recruitment starting late 1999 response 2004 challenge described excellent challenge set 2015 600,000 attempts also published gchq puzzle book 2016 sold 300,000 copies proceeds going charity second book published october 2018 gchq units gchq specifics uk agencies elsewhere", + "neighbors": [ + 289, + 658, + 1121, + 1137, + 1240, + 1309, + 1368, + 1373, + 1515 + ], + "mask": "Test" + }, + { + "node_id": 659, + "label": 3, + "text": "Transport_triggered_architecture:transport triggered architecture computer architecture transport triggered architecture tta kind processor design programs directly control internal transport buses processor computation happens side effect data transports writing data triggering port functional unit triggers functional unit start computation similar happens systolic array due modular structure tta ideal processor template application-specific instruction-set processors asip customized datapath without inflexibility design cost fixed function hardware accelerators typically transport triggered processor multiple transport buses multiple functional units connected buses provides opportunities instruction level parallelism parallelism statically defined programmer respect obviously due large instruction word width tta architecture resembles long instruction word vliw architecture tta instruction word composed multiple slots one slot per bus slot determines data transport takes place corresponding bus fine-grained control allows optimizations possible conventional processor example software transfer data directly functional units without using registers transport triggering exposes microarchitectural details normally hidden programmers greatly simplifies control logic processor many decisions normally done run time fixed compile time however also means binary compiled one tta processor run another one without recompilation even small difference architecture two binary incompatibility problem addition complexity implementing full context switch makes ttas suitable embedded systems general purpose computing one instruction set computer architectures tta architecture one processors based built one processors based sold commercially ttas seen exposed datapath vliw architectures vliw programmed using operations tta splits operation execution multiple move operations low level programming model enables several benefits comparison standard vliw example tta architecture provide parallelism simpler register files vliw programmer control timing operand result data transports complexity number input output ports register file rf need scaled according worst case issue/completion scenario multiple parallel instructions important unique software optimization enabled transport programming called software bypassing case software bypassing programmer bypasses register file write back moving data directly next functional unit operand ports optimization applied aggressively original move transports result register file eliminated completely thus reducing register file port pressure freeing general purpose register temporary variables reduced register pressure addition simplifying required complexity rf hardware lead significant cpu energy savings important benefit especially mobile embedded systems tta processors built independent function units register files connected transport buses sockets function unit implements one operations implement functionality ranging simple addition integers complex arbitrary user-defined application-specific computation operands operations transferred function unit ports function unit may independent pipeline case function unit fully pipelined new operation takes multiple clock cycles finish started every clock cycle hand pipeline always accept new operation start requests old one still executing data memory access communication outside processor handled using special function units function units implement memory accessing operations connect memory module often called load/store units control unit special case function units controls execution programs control unit access instruction memory order fetch instructions executed order allow executed programs transfer execution jump arbitrary position executed program control unit provides control flow operations control unit usually instruction pipeline consists stages fetching decoding executing program instructions register files contain general purpose registers used store variables programs like function units also register files input output ports number read write ports capability able read write multiple registers clock cycle vary register file interconnect architecture consists transport buses connected function unit ports means sockets due expense connectivity usual reduce number connections units function units register files tta said fully connected case path unit output port every unit input ports sockets provide means programming tta processors allowing select bus-to-port connections socket enabled time instant thus data transports taking place clock cycle programmed defining source destination socket/port connection enabled bus tta implementations support conditional execution conditional execution implemented aid guards data transport conditionalized guard connected register often 1-bit conditional register bus case value guarded register evaluates false zero data transport programmed bus guard connected squashed written destination unconditional data transports connected guard always executed processors including tta processors include control flow instructions alter program counter used implement subroutines if-then-else for-loop etc assembly language tta processors typically includes control flow instructions unconditional branches jump conditional relative branches bnz subroutine call call conditional return retnz etc look corresponding assembly language instructions processors like operations tta machine instructions implemented move instructions special function unit tta implementations support conditional execution sttack first move prototype implement control flow instructions conditional move program counter tta implementations support unconditional data transports maxq typically special function unit tightly connected program counter responds variety destination addresses address used destination move different effect program counter\u2014each relative branch condition instruction different destination address condition destination addresses used call retnz etc traditional processor architectures processor usually programmed defining executed operations operands example addition instruction risc architecture could look like following example operation adds values general-purpose registers r1 r2 stores result register r3 coarsely execution instruction processor probably results translating instruction control signals control interconnection network connections function units interconnection network used transfer current values registers r1 r2 function unit capable executing add operation often called alu arithmetic-logic unit finally control signal selects triggers addition operation alu result transferred back register r3 tta programs define operations data transports needed write read operand values operation triggered writing data triggering operand operation thus operation executed side effect triggering data transport therefore executing addition operation tta requires three data transport definitions also called moves move defines endpoints data transport taking place transport bus instance move state data transport function unit f port 1 register file r register index 2 take place bus b1 case multiple buses target processor bus utilized parallel clock cycle thus possible exploit data transport level parallelism scheduling several data transports instruction addition operation executed tta processor follows second move write second operand function unit called alu triggers addition operation makes result addition available output port 'result execution latency 'add ports associated alu may act accumulator allowing creation macro instructions abstract away underlying tta leading philosophy ttas move complexity hardware software due several additional hazards introduced programmer one delay slots programmer visible operation latency function units timing completely responsibility programmer programmer schedule instructions result neither read early late hardware detection lock processor case result read early consider example architecture operation add latency 1 operation mul latency 3 triggering add operation possible read result next instruction next clock cycle case mul one wait two instructions result read result ready 3rd instruction triggering instruction reading result early results reading result previously triggered operation case operation triggered previously function unit read value undefined hand result must read early enough make sure next operation result overwrite yet unread result output port due abundance programmer-visible processor context practically includes addition register file contents also function unit pipeline register contents and/or function unit input output ports context saves required external interrupt support become complex expensive implement tta processor therefore interrupts usually supported tta processors task delegated external hardware e.g. i/o processor need avoided using alternative synchronization/communication mechanism polling", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 268, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 591, + 643, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1414, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 660, + "label": 4, + "text": "Digital_watermarking:digital watermarking digital watermark kind marker covertly embedded noise-tolerant signal audio video image data typically used identify ownership copyright signal watermarking process hiding digital information carrier signal hidden information need contain relation carrier signal digital watermarks may used verify authenticity integrity carrier signal show identity owners prominently used tracing copyright infringements banknote authentication like traditional physical watermarks digital watermarks often perceptible certain conditions i.e using algorithm digital watermark distorts carrier signal way becomes easily perceivable may considered less effective depending purpose traditional watermarks may applied visible media like images video whereas digital watermarking signal may audio pictures video texts 3d models signal may carry several different watermarks time unlike metadata added carrier signal digital watermark change size carrier signal needed properties digital watermark depend use case applied marking media files copyright information digital watermark rather robust modifications applied carrier signal instead integrity ensured fragile watermark would applied steganography digital watermarking employ steganographic techniques embed data covertly noisy signals steganography aims imperceptibility human senses digital watermarking tries control robustness top priority since digital copy data original digital watermarking passive protection tool marks data degrade control access data one application digital watermarking source tracking watermark embedded digital signal point distribution copy work found later watermark may retrieved copy source distribution known technique reportedly used detect source illegally copied movies term digital watermark coined andrew tirkel charles osborne december 1992 first successful embedding extraction steganographic spread spectrum watermark demonstrated 1993 andrew tirkel charles osborne gerard rankin watermarks identification marks produced paper making process first watermarks appeared italy 13th century use rapidly spread across europe used means identify paper maker trade guild manufactured paper marks often created wire sewn onto paper mold watermarks continue used today manufacturer marks prevent forgery digital watermarking may used wide range applications information embedded signal called digital watermark although contexts phrase digital watermark means difference watermarked signal cover signal signal watermark embedded called host signal watermarking system usually divided three distinct steps embedding attack detection embedding algorithm accepts host data embedded produces watermarked signal watermarked digital signal transmitted stored usually transmitted another person person makes modification called attack modification may malicious term attack arises copyright protection application third parties may attempt remove digital watermark modification many possible modifications example lossy compression data resolution diminished cropping image video intentionally adding noise detection often called extraction algorithm applied attacked signal attempt extract watermark signal unmodified transmission watermark still present may extracted robust digital watermarking applications extraction algorithm able produce watermark correctly even modifications strong fragile digital watermarking extraction algorithm fail change made signal digital watermark called robust respect transformations embedded information may detected reliably marked signal even degraded number transformations typical image degradations jpeg compression rotation cropping additive noise quantization video content temporal modifications mpeg compression often added list digital watermark called imperceptible watermarked content perceptually equivalent original unwatermarked content general easy create either robust watermarks\u2014or\u2014imperceptible watermarks creation robust\u2014and\u2014imperceptible watermarks proven quite challenging robust imperceptible watermarks proposed tool protection digital content example embedded no-copy-allowed flag professional video content digital watermarking techniques may classified several ways digital watermark called fragile fails detectable slightest modification fragile watermarks commonly used tamper detection integrity proof modifications original work clearly noticeable commonly referred watermarks generalized barcodes digital watermark called semi-fragile resists benign transformations fails detection malignant transformations semi-fragile watermarks commonly used detect malignant transformations digital watermark called robust resists designated class transformations robust watermarks may used copy protection applications carry copy access control information digital watermark called imperceptible original cover signal marked signal perceptually indistinguishable digital watermark called perceptible presence marked signal noticeable e.g digital on-screen graphics like network logo content bug codes opaque images videos images made transparent/translucent convenience consumers due fact block portion view therefore degrading confused perceptual watermarking uses limitations human perception imperceptible length embedded message determines two different main classes digital watermarking schemes digital watermarking method referred spread-spectrum marked signal obtained additive modification spread-spectrum watermarks known modestly robust also low information capacity due host interference digital watermarking method said quantization type marked signal obtained quantization quantization watermarks suffer low robustness high information capacity due rejection host interference digital watermarking method referred amplitude modulation marked signal embedded additive modification similar spread spectrum method particularly embedded spatial domain evaluation digital watermarking schemes may provide detailed information watermark designer end-users therefore different evaluation strategies exist often used watermark designer evaluation single properties show example improvement mostly end-users interested detailed information want know given digital watermarking algorithm may used application scenario parameter sets seems best epson kodak produced cameras security features epson photopc 3000z kodak dc-290 cameras added irremovable features pictures distorted original image making unacceptable applications forensic evidence court according blythe fridrich n either camera provide undisputable proof image origin author secure digital camera sdc proposed saraju mohanty et al 2003 published january 2004 first time proposed blythe fridrich also worked sdc 2004 digital camera would use lossless watermarking embed biometric identifier together cryptographic hash reversible data hiding technique enables images authenticated restored original form removing digital watermark replacing image data overwritten would make images acceptable legal purposes us army also interested technique authentication reconnaissance images digital watermarking relational databases emerged candidate solution provide copyright protection tamper detection traitor tracing maintaining integrity relational data many watermarking techniques proposed literature address purposes survey current state-of-the-art classification different techniques according intent way express watermark cover type granularity level verifiability published 2010 halder et al journal universal computer science..", + "neighbors": [ + 59, + 895, + 1492 + ], + "mask": "Test" + }, + { + "node_id": 661, + "label": 7, + "text": "Single-chip_Cloud_Computer:single-chip cloud computer single-chip cloud computer scc computer processor cpu created intel corporation 2009 48 distinct physical cores communicate architecture similar cloud computer data center cores part processor carry instructions code allow computer run scc product project started intel research multi-core processors parallel processing multiple calculations additionally intel wanted experiment incorporating designs architecture huge cloud computer data centers cloud computing single processing chip took aspect cloud computing many remote servers communicate applied microprocessor new concept intel wanted experiment name single-chip cloud computer originated concept scc currently still used research purposes currently run simple linux operating system chip boot windows applications scc web servers data informatics bioinformatics financial analytics intel developed new chip architecture based huge cloud data centers cores separated across chip able directly communicate chip contains 48 p54c pentium cores connected 4\u00d76 2d-mesh mesh group 24 tiles set four rows six columns tile contained two cores 16 kb 8 per core message passing buffer mpb shared two cores essentially router router allows core communicate previously cores send information back main memory would re-routed cores scc contains 1.3 billion 45 nanometers nm long transistors amplify signals act switch turn core pairs transistors use anywhere 25 125 watts power depending processing demand comparison intel i7 processor uses 156 watts power four ddr3 memory controllers chip connected 2d-mesh well controllers capable addressing 64 gb random-access memory ddr3 memory used help tile communicate others without chip would functional controllers also work transistors control certain tiles turned save power use proper coding implemented pieces put together get functional processor fast powerful energy efficient framework resembling network cloud computers scc comes rcce simple message passing interface provided intel supports basic message buffering operations scc two modes operate processor mode mesh mode processor mode cores executing code system memory programmed i/o inputs outputs system connected system board fpga loading memory configuring processor bootstrapping sustaining initial load currently done software running scc management console embedded chip cores turned routers transistors ram controllers sending receiving large packets data additionally memory map intel plans share technology companies hp yahoo microsoft multiple companies researching scc efficiently quickly advance technology hope make scc scalable 100+ cores one way hope achieve chip able communicate another chip could put two chips together get double cores hope improve parallel programming productivity power management take advantage chip architecture large number cores additionally plan experiment architecture similar chip architectures develop many-core scalable processors maximizes processing power cores power efficient", + "neighbors": [ + 85, + 120, + 134, + 270, + 294, + 359, + 611, + 755, + 988, + 1507 + ], + "mask": "Test" + }, + { + "node_id": 662, + "label": 2, + "text": "Cortana:cortana cortana virtual assistant created microsoft windows 10 windows 10 mobile windows phone 8.1 invoke smart speaker microsoft band surface headphones xbox one ios android windows mixed reality amazon alexa cortana set reminders recognize natural voice without requirement keyboard input answer questions using information bing search engine cortana currently available english portuguese french german italian spanish chinese japanese language editions depending software platform region used cortana demonstrated first time microsoft build developer conference april 2\u20134 2014 san francisco launched key ingredient microsoft planned makeover future operating systems windows phone windows named cortana synthetic intelligence character microsoft halo video game franchise originating bungie folklore jen taylor character voice actress returning voice personal assistant us-specific version development cortana started 2009 microsoft speech products team general manager zig serafin chief scientist larry heck heck serafin established vision mission long-range plan microsoft digital-personal-assistant built team expertise create initial prototypes cortana key researchers early efforts included microsoft research researchers dilek hakkani-t\u00fcr gokhan tur andreas stolcke malcolm slaney research software developer madhu chinthakunta user-experience designer lisa stifelman develop cortana digital assistant team interviewed human personal assistants interviews inspired number unique features cortana including assistant notebook feature originally cortana meant codename petition windows phone uservoice site proved popular made codename official january 2015 microsoft announced availability cortana windows 10 desktops mobile devices part merging windows phone operating system large may 26 2015 microsoft announced cortana would also available mobile platforms android release set july 2015 android apk file containing cortana leaked ahead release officially released along ios version december 2015 e3 2015 microsoft announced cortana would come xbox one part universally designed windows 10 update console number people access cortana 800 million 2019 number questions asked 18 billion since launch microsoft integrated cortana numerous products microsoft edge browser bundled windows 10 microsoft cortana assistant deeply integrated edge browser cortana find opening-hours restaurant sites show retail coupons websites show weather information address bar worldwide partners conference 2015 microsoft demonstrated cortana integration upcoming products gigjam conversely microsoft announced late april 2016 would block anything bing edge used complete cortana searches raising questions anticompetitive behavior company microsoft windows car concept includes cortana concept makes possible drivers make restaurant reservations see places go microsoft build 2016 microsoft announced plans integrate cortana skype microsoft instant messaging service bot allow users order food book trips transcribe video messages make calendar appointments cortana addition bots cortana underline certain words phrases skype conversations relate contacts corporations writer engadget criticised cortana integration skype responding specific keywords feeling chatting search engine due impersonal way bots replied certain words hello bing music bot brought adele song name microsoft also announced microsoft build 2016 cortana would able cloud-synchronise notifications windows 10 mobile windows 10 action center well notifications android devices december 2016 microsoft announced preview calendar.help service enabled people delegate scheduling meetings cortana users interact cortana including email conversations cortana would check people availability outlook calendar google calendar work others cc 'd email schedule meeting service relied automation human-based computation may 2017 microsoft collaboration harman kardon announced invoke voice-activated speaker featuring cortana premium speaker cylindrical design offers 360 degree sound ability make receive calls skype features currently available cortana cortana set reminders recognize natural voice without requirement keyboard input answer questions using information bing search engine e.g. current weather traffic conditions sports scores biographies searches using windows 10 made microsoft bing search engine links open microsoft edge except screen reader narrator used links open internet explorer windows phone 8.1 universal bing smartsearch features incorporated cortana replaces previous bing search app activated user presses search button device cortana includes music recognition service cortana simulate rolling dice flipping coin 'cortana concert watch monitors bing searches determine bands musicians user interested integrates microsoft band watch band windows phone devices connected via bluetooth make reminders phone notifications since lumia denim mobile phone series launched october 2014 active listening added cortana enabling invoked phrase hey cortana controlled usual devices united kingdom o2 received lumia denim update without feature later clarified bug microsoft since fixed cortana integrates services foursquare provide restaurant local attraction recommendations lifx control smart light bulbs cortana stores personal information interests location data reminders contacts notebook draw upon add data learn user specific patterns behaviors users view specify information collected allow control privacy said level control goes beyond comparable assistants users delete information notebook cortana built system reminders example associated specific contact remind user communication contact possibly specific time phone specific location originally reminders specific device cortana installed since windows 10 microsoft synchronizes reminders across devices versions cortana take form two nested animated circles animated indicate activities searching talking main color scheme includes black white background shades blue respective circles cortana windows mobile android capable capturing device notifications sending windows 10 device allows computer user view notifications phone windows 10 action center feature announced early 2016 released later year cortana do-not-disturb mode users specify quiet hours available windows phone 8.1 users users change settings cortana calls users names nicknames also library easter eggs pre-determined remarks asked prediction cortana correctly predicted winners first 14 matches football 2014 fifa world cup knockout stage including semi-finals incorrectly picked brazil netherlands third place play-off match streak topped paul octopus correctly predicted 7 germany 2010 fifa world cup matches well final cortana forecast results various sports nba nfl super bowl icc cricket world cup various european football leagues cortana solve mathematical equations convert units measurement determine exchange rates currencies including bitcoin cortana integrate third-party apps windows 10 directly service starting late 2016 cortana integrated microsoft wunderlist service allowing cortana add act reminders microsoft build 2017 conference microsoft announced cortana would get consumer third-party skills capability similar amazon alexa feb 16 2018 microsoft announced connected home skills added ecobee honeywell lyric honeywell total connect comfort lifx tp-link kasa geeni well support ifttt also added august 15 2018 cortana-alexa integration went public preview microsoft ignite 2018 conference microsoft announced technology adopters program enterprises could build skills could developed deployed azure tenants accessible organizational units security groups presently third-party skills available us us english cortana indexes stores user information disabled cause windows search search web well local computer turned turning cortana delete user data stored microsoft servers deleted user action microsoft criticized requests bing website file called threshold.appcache contains cortana information searches made start menu even cortana disabled windows 10. cortana disabled users aged 13 years uk version cortana speaks british accent uses british idioms chinese version known xiao na speaks mandarin chinese icon featuring face two eyes used regions united kingdom english localised version cortana voiced ginnie watson anglo-french actress singer/songwriter voice-over artist united states english localised version cortana voiced jen taylor voice actress voices cortana namesake virtual assistant halo video game series table identifies localized version cortana currently available except indicated applies windows mobile windows 10 versions assistant natural language processing capabilities cortana derived tellme networks bought microsoft 2007 coupled semantic search database called satori cortana updates delivered independently main windows phone os allowing microsoft provide new features faster pace cortana-related features updated manner features hey cortana require windows phone update service qualcomm snapdragon sensorcore technology", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 339, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 689, + 704, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1096, + 1098, + 1109, + 1138, + 1142, + 1151, + 1212, + 1246, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1465, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1615, + 1620, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 663, + "label": 1, + "text": "RISE-PAK:rise-pak relief information systems earthquakes pakistan abbreviated rise-pak information-sharing web portal created pakistani-american economist asim ijaz khwaja along experts world bank pomona college national database registration authority world online pakistan largest internet service provider hosted website lahore school management sciences created 2005 earthquake kashmir claimed 80,000 lives around 70,000 injured pakistan india afghanistan website displayed maps 4000 villages affected quake database demographic information disaster information assistance received access routes villages area also provided pre-earthquake information showing village-level demographic infrastructure data major road networks distance every village epicentre earthquake", + "neighbors": [ + 139 + ], + "mask": "Test" + }, + { + "node_id": 664, + "label": 2, + "text": "Live_USB:live usb live usb usb flash drive external hard disk drive containing full operating system booted evolutionary next step live cds added benefit writable storage live usb allowing customizations booted operating system live usbs used embedded systems system administration data recovery test driving persistently save settings install software packages usb device many operating systems including windows xp embedded large portion linux bsd distributions run usb flash drive windows 8 enterprise feature titled windows go similar purpose repair computer booting issues technicians often use lightweight operating systems bootable media command line interface development first live cds graphical user interface made feasible non-technicians repair malfunctioning computers live cds linux based addition repairing computers would occasionally used right operating systems personal computers introduced usb booting early 2000s macintosh computers introducing functionality 1999 beginning power mac g4 agp graphics slot-loading imac g3 models intel-based macs carried functionality booting macos usb specialized usb-based booting proposed ibm 2004 reincarnating pcs portable soulpads boot gnu/linux firewire device live usbs share many benefits limitations live cds also incorporate various applications exist create live usbs examples include rufus fedora live usb creator unetbootin wintousb win32diskimager yumi works variety distributions linux distributions live cds ready-made scripts perform steps automatically addition knoppix ubuntu extra applications installed persistent file system used store changes base install ranges little 16 mib tiny core linux large dvd-sized install 4 gigabytes set live usb system commodity pc hardware following steps must taken knoppix live cds utility boot allows users declare intent write operating system file structures either temporarily ram disk permanently disk flash media preserve added configurations security updates easier recreating usb system may moot since many live usb tools simple use alternative live solution traditional operating system installation elimination swap partitions installation advantage efficient software live installation would still contain software removed persistent file due operating systems installer still included media however full installation without disadvantages due additional write cycles occur full installation life flash drive may slightly reduced mitigate live systems designed store changes ram user powers system writes changes another factor speed storage device destitute performance comparable legacy computers even machines modern parts flash drive transfers speeds one way solve use usb hard drive generally give better performance flash drives regardless connector although many live usbs rely booting open-source operating system linux possible create live usbs windows using diskpart wintousb syslinux common program make bootable usb storage device", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 234, + 265, + 267, + 275, + 322, + 327, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 494, + 528, + 531, + 583, + 650, + 716, + 720, + 721, + 723, + 728, + 754, + 797, + 860, + 884, + 891, + 908, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1102, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1328, + 1361, + 1369, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1524, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 665, + "label": 4, + "text": "ROCA_vulnerability:roca vulnerability roca vulnerability cryptographic weakness allows private key key pair recovered public key keys generated devices vulnerability roca acronym return coppersmith attack vulnerability given identifier cve-2017-15361 vulnerability arises problem approach rsa key generation used software library rsalib provided infineon technologies incorporated many smart cards trusted platform module tpm implementations vulnerability appears recent yubikey 4 tokens often used generate pgp keys keys lengths 512 1024 2048 bits generated using infineon library vulnerable practical roca attack research team discovered attack masaryk university led mat\u00fa\u0161 nemec marek s\u00fds estimate affects around one-quarter current tpm devices globally millions smart cards believed affected team informed infineon rsalib problem february 2017 withheld public notice mid-october citing responsible disclosure time announced attack provided tool test public keys vulnerability published details attack november generating rsa key involves selecting two large randomly-generated prime numbers process time-consuming particularly small devices smart cards addition primes numbers certain properties best security vulnerable rsalib selection process quickly creates primes desired type testing primality numbers form formula_2 product first n successive primes 2 3 5 7 11 13 ... n constant depends desired key size security based secret constants formula_3 formula_4 roca attack exploits particular format primes using variation coppersmith method addition public keys generated way distinctive fingerprint quickly recognized attempting compute discrete logarithm public key mod formula_2 base 65537 computing discrete logarithms large group usually extremely difficult case done efficiently using pohlig\u2013hellman algorithm formula_2 smooth number test site available internet roca authors consider public keys length 512 1024 2048-bits generated rsalib vulnerable details key generation differ different key lengths shorter keys necessarily vulnerable longer keys example 1952-bit rsalib key stronger 2048-bit key 4096-bit key weaker 3072-bit key best mitigation according authors generate rsa keys using stronger method openssl possible roca authors suggest using key lengths less susceptible roca 3936-bit 3072-bit 1952-bits 2048-bit key size maximum", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 412, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1240, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 666, + "label": 4, + "text": "Cutwail_botnet:cutwail botnet cutwail botnet founded around 2007 botnet mostly involved sending spam e-mails bot typically installed infected machines trojan component called pushdo affects computers running microsoft windows june 2009 estimated cutwail botnet largest botnet terms amount infected hosts security provider messagelabs estimated total size botnet around 1.5 2 million individual computers capable sending 74 billion spam messages day 51 million every minute equal 46.5 worldwide spam volume february 2010 botnet activities slightly altered started ddos attack 300 major sites including cia fbi twitter paypal reasons attack n't fully understood experts described accident mainly due lack damage disruption along infrequency attacks august 2010 researchers university california santa barbara ruhr university bochum attempted take botnet managed take offline 20 30 command control servers botnet using cutwail fairly simple botnet bots connect directly command control server receive instructions emails send done task bots report back spammer exact statistics number emails delivered many errors reported cutwail botnet known 0bulk psyche evolution underground market spammers rent instance botnet fee use send spam campaigns services offered botnet advertised russian underground forum spamdot.biz taken 2010 june 2010 least 8 different spam groups using botnet deliver junk mail", + "neighbors": [ + 149, + 450, + 490, + 522, + 531, + 576, + 961, + 1090, + 1162, + 1358, + 1365, + 1467, + 1543, + 1554 + ], + "mask": "Train" + }, + { + "node_id": 667, + "label": 1, + "text": "Ideas_bank:ideas bank ideas bank widely available shared resource usually website people post exchange discuss polish new ideas ideas banks used develop new inventions technologies many corporations installed internal ideas banks gather input employees improve ideation process ideas banks employ voting system estimate idea value cases ideas banks humor-oriented serious counterparts many ideas banks provided free charge set around certain companies general work new inventions although ideas provided community people problems arise people take ideas site begin developing possible way prove idea ideas bank original taken something else front end innovation quite distinct remainder innovation process best ideas discovered managed stage gate oriented project management system work flow defined front end innovation commonly referred fuzzy functions best collaborative system nurtures chaos disruption serendipitous discovery ideas ideas submitted via electronic suggestion box limited incremental innovation things way always better nothing wrong incremental innovation fact ideas leading projects resulting incremental innovation typically yield rapid revenue gains cost savings organizations using collaborative idea management systems get breakthrough radical innovation ideas thought box thinking fuzzy front end innovation benefits collaborative tool serving backbone nurture organization culture innovation everyone log system post objects interest users search information comment information discover experts organization needed result everyone well informed sense collaborative tool serves knowledge management system facebook-like except everyone talking work course collaborative tool also accepts submission ideas idea management software solution manages ideas allowing others comment shaping idea clustering similar ideas utilizing idea management software similarity search capabilities accepting sort voting scheme order score idea worth better idea management software systems use algorithm measure wisdom crowd gauging social media type activity instance means best ideas automatically promoted get combination votes comments votes comments views follows alerts bookmarks similar ideas posted ... combined mathematical formula determine idea best measured group collaborators working ideas unsolicited ideas typically lead incremental innovation get radical breakthrough innovation idea management system needs indulge strategic guidance issuing challenges campaigns seeding essence bottom grown organizational engagement collaborative idea management system managed little bit top strategic guidance company saying 're glad 're talking together us favor talk ... ask ideas address big issues company instance make company 'green next new product us collaborating companies assemble smart people company exchange ideas enhance ideas best ideas automatically promoted need automated promotion mechanism software problem n't wo n't get enough ideas problem 'll get many n't want someone manually filter", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 668, + "label": 5, + "text": "Galeon:galeon galeon discontinued gecko-based web browser created marco pesenti gritti goal delivering consistent browsing experience gnome desktop environment gained popularity early 2000s due speed flexibility configuration features disagreement future galeon split development team 2002 resulted departure browser initial author several developers event marked beginning browser popularity decline led discontinuation september 2008 galeon features subsequently ported epiphany called web \u2013 descendant galeon galeon made use gecko features including configuration options standards support apart galeon several features uncommon browsers time project started marco pesenti gritti goal creating web browser would fast consistent gnome desktop environment first public version galeon 0.6 released june 2000 first releases galeon criticised lack basic features cookie proxy support though browser added features every release version 1.2 galeon introduced many new features drew attention general public time galeon creation popular linux browsers including netscape mozilla large multi-functional programs made slow start often impractical due high memory usage processor requirements opera somewhat faster proprietary software distributed trialware adware versions lacked functionality microsoft windows version galeon widely seen one best linux browsers available polls revealed substantial usage share galeon though popularity regarded owing lack stability evident mozilla browsers release new version gtk+ widget toolkit used construct user interface galeon team decided write new version galeon scratch time gnome project adopted new human interface guidelines promoted simplicity uniform design galeon team differing opinions new guidelines author lead developer marco pesenti gritti endorsed saw rewrite opportunity make galeon simpler many developers believed reducing number preferences simplifying user interface would harm project november 2002 result several discussions topic gritti made decision cease work galeon fork project started development hig-compliant web browser called epiphany known web gritti longer controlled development galeon previous functionality restored subsequent releases new features added though development got slow split time rising popularity firefox status default browser major distribution overwhelming number extensions led decline galeon user base eventually galeon developers announced plans halt development galeon saying current approach unsustainable regarding resources required maintain instead planned develop set extensions epiphany provide similar functionality even development ceased september 2008 browser remained popular december 2011 still available linux distribution repositories debian 6 squeeze although part debian 7 wheezy galeon praised customizability speed compared netscape navigator firefox though konqueror opera still faster older hardware galeon noted session handling crash recovery november 2002 osnews conducted poll determine popular gecko-based browser included several browsers microsoft windows mac os x linux n't include netscape navigator mozilla suite linux-only galeon second popular cross-platform firefox time known phoenix critics noted galeon tricky plugin installation", + "neighbors": [ + 14, + 83, + 95, + 107, + 134, + 258, + 277, + 306, + 427, + 452, + 491, + 509, + 530, + 531, + 580, + 582, + 623, + 627, + 684, + 713, + 862, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1376, + 1378, + 1408, + 1423, + 1424, + 1528, + 1550, + 1569, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 669, + "label": 2, + "text": "Benoit_Schillings:benoit schillings benoit schillings belgian software engineer distinguished engineer google x leading early projects x known one lead developers operating system beos noted amateur astronomer schillings association inc. began 1990 developer software apple macintosh visited apple expo paris met jean-louis gass\u00e9e gass\u00e9e left apple computer found asked schillings become second engineer would work operating system new computer called bebox schillings accepted offer starting march 1991 developed file system known old file system ofs associated user-space database application called zookeeper indexed metadata file system file system fast efficient later replaced dominic giampaolo file system schillings also developed graphics system beos known app server well programming frameworks interface kit application kit used software developers write software operating system joining trolltech october 2005 schillings worked distinguished engineer cto openwave mike reed led team developed version 7 openwave phone suite mobile phone applications benoit also ran android ios mobile teams yahoo 2013 2017", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 670, + "label": 9, + "text": "GW-BASIC:gw-basic gw-basic dialect basic programming language developed microsoft basica originally compaq otherwise identical microsoft/ibm basica fully self-contained executable need rom basic bundled ms-dos operating systems ibm pc compatibles microsoft microsoft also sold basic compiler bascom compatible gw-basic programs needing speed language suitable simple games business programs like since included versions ms-dos also low-cost way many aspiring programmers learn fundamentals computer programming release ms-dos 5.0 gw-basic place eventually taken qbasic interpreter part separately available quickbasic compiler ibm basica gw-basic largely ports mbasic version 5.x added features specifically ibm pc hardware common features basic-80 5.x basica/gw-basic include ability crunch program lines omitting spaces common feature earlier microsoft basic implementations removed basic-80 5.x basica/gwbasic basic-80 programs using peek/poke statements would run gw-basic basica added large number features ibm pc sound graphics memory commands features present basic-80 included ability execute rnd function parameters ability also save programs protected format preventing listed basica also allowed double-precision numbers used mathematical trigonometric functions cos sin atn n't allowed 8-bit versions basic feature normally enabled required optional parameter /d startup i.e codice_1 basic memory footprint slightly increased used microsoft offer generic version ms-dos v3.20 1986 variants operating system oem versions depending oem basic distributed either basica.exe gwbasic.exe former confused ibm basica always came .com file variants basic extra features support particular machine example tandy versions dos included special gw-basic supported enhanced sound graphics capabilities initial version gw-basic one included compaq dos 1.13 released compaq portable 1983 analogous ibm basica 1.10 used cp/m-derived file control blocks disk access support subdirectories later versions added feature improved graphics capabilities gw-basic 3.20 1986 added ega graphics support version basica gw-basic vga support effect last new version released superseded qbasic buyers hercules graphics cards received special version gw-basic card utility disk called hbasic added support 720\u00d7348 monochrome graphics versions basica/gw-basic support hercules graphics could display graphics card use third-party cga emulation simcga gw-basic command line-based integrated development environment ide based dartmouth basic using cursor movement keys line displayed screen edited also includes function key shortcuts bottom screen like early microcomputer versions basic gw-basic lacked many structures needed structured programming local variables gw-basic programs executed relatively slowly interpreted language program lines must numbered non-numbered lines considered commands direct mode executed immediately program source files normally saved binary compressed format tokens replacing keywords option save ascii text form gw-basic command-line environment commands codice_2 current program quit operating codice_3 commands also used program statements little support structured programming gw-basic codice_4 conditional statements must written one line although codice_5 statements may group multiple lines functions defined using single line codice_6 statement e.g. codice_7 data type variables specified character end variable name codice_8 string characters codice_9 integer etc groups variables also set default types based initial letter name use codice_10 etc. statements default type undeclared variables identified typing statements single-precision floating point 32-bit mbf gw-basic allowed use joystick light pen input devices gw-basic read write files com ports also event trapping ports since cassette port interface original ibm pc never implemented compatibles cassette operations supported gw-basic play simple music using codice_11 statement needing string notes represented music macro language e.g. codice_12 low-level control possible codice_13 statement takes arguments frequency hertz length clock ticks standard internal pc speaker ibm machines consequently sound limited single channel beeps whistles befits 'business machine home-based pcs like tandy 1000 allowed three channels sound codice_13 codice_11 commands several theories initials gw stand greg whitten early microsoft employee developed standards company basic compiler line says bill gates picked name gw-basic whitten refers gee-whiz basic unsure gates named program microsoft user manual microsoft press also refers name may also nicknamed gee-whiz large number graphics commands common theories initials origins include graphics windows gates william microsoft president time gates-whitten two main designers program", + "neighbors": [ + 0, + 8, + 236, + 273, + 292, + 324, + 435, + 472, + 510, + 606, + 756, + 799, + 810, + 812, + 843, + 868, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1188, + 1204, + 1304, + 1306, + 1390, + 1547, + 1584, + 1593, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 671, + "label": 7, + "text": "Chromebit:chromebit chromebit dongle running google chrome os operating system placed hdmi port television monitor device turns display personal computer chromebit allows adding keyboard mouse bluetooth wi-fi device announced april 2015 began shipping november chromebit turns display hdmi port desktop variant chromebook laptop runs google chrome os operating system chrome os primarily supports single application web browser thereby relying heavily internet connection software functionality data storage chromebits superficial resemblance chromecast another google device whereas chromecast designed display video still images television large-screen display chromebit self-contained personal computer device compete intel compute stick offers similar plug-in functionality using two operating systems windows 8.1 ubuntu internally first chromebit resembles standard chromebook laptop device features 802.11ac wi-fi bluetooth 4.0 well usb 2.0 port one end end swivels enabling fit variety hdmi slots google announced chromebit march 31 2015 google asus began shipping first model november", + "neighbors": [ + 24, + 41, + 77, + 131, + 176, + 182, + 216, + 422, + 480, + 502, + 547, + 553, + 556, + 559, + 611, + 704, + 775, + 777, + 837, + 936, + 962, + 1019, + 1036, + 1061, + 1082, + 1129, + 1185, + 1259, + 1265, + 1310, + 1371, + 1377, + 1411, + 1419, + 1431, + 1480, + 1500, + 1596 + ], + "mask": "Validation" + }, + { + "node_id": 672, + "label": 5, + "text": "Internet_Control_Message_Protocol_for_IPv6:internet control message protocol ipv6 internet control message protocol version 6 icmpv6 implementation internet control message protocol icmp internet protocol version 6 ipv6 icmpv6 defined rfc 4443 icmpv6 integral part ipv6 performs error reporting diagnostic functions e.g. ping framework extensions implement future changes several extensions published defining new icmpv6 message types well new options existing icmpv6 message types neighbor discovery protocol ndp node discovery protocol ipv6 replaces enhances functions arp secure neighbor discovery send extension ndp extra security multicast listener discovery mld used ipv6 routers discovering multicast listeners directly attached link much like internet group management protocol igmp used ipv4 multicast router discovery mrd allows discovery multicast routers icmpv6 messages may classified error messages information messages icmpv6 messages transported ipv6 packets ipv6 next header value icmpv6 set value 58 icmpv6 message consists header protocol payload header contains three fields type 8 bits code 8 bits checksum 16 bits type specifies type message values range 0 127 high-order bit 0 indicate error message values range 128 255 high-order bit 1 indicate information message code field value depends message type provides additional level message granularity checksum field provides minimal level integrity verification icmp message control messages identified value type field code field gives additional context information message messages serve purpose correspondingly named icmp message types note table comprehensive current complete list assigned icmpv6 types found link iana icmpv6 parameters icmpv6 provides minimal level message integrity verification inclusion 16-bit checksum header checksum calculated starting pseudo-header ipv6 header fields according ipv6 standard consists source destination addresses packet length next header field latter set value 58 following pseudo header checksum continued icmpv6 message checksum computation performed according internet protocol standards using 16-bit ones complement summation followed final ones complement checksum inserting checksum field note differs way calculated ipv4 icmp similar calculation done tcp icmpv6 node receives packet must undertake actions depend type message icmpv6 protocol must limit number error messages sent destination avoid network overloading example node continues forward erroneous packets icmp signal error first packet periodically fixed minimum period fixed network maximum load icmp error message must never sent response another icmp error message", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 1116, + 1206, + 1218, + 1243, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 673, + "label": 3, + "text": "Brian_Jacks_Superstar_Challenge:brian jacks superstar challenge brian jacks superstar challenge 1985 sports simulation game released various home computers martech licensed british sportsman brian jacks released systems including commodore 64 bbc micro acorn electron electron user praised superb graphics variety found different games", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 674, + "label": 4, + "text": "WhiteSource:whitesource whitesource open source security license compliance management platform founded 2011 ron rymon azi cohen rami sass company founded three co-founders sold previous company eurekify ca technologies due diligence process co-founders experienced first hand challenge generating accurate open source inventory report company launched open source license management platform software discovers open source components customers \u2019 apps alerts vulnerable code added software projects used threats pop affect existing software main investors company include susquehanna growth equity 83north microsoft ventures david strohm israeli innovation authority company raised 46 million 2018 whitesource bolt launched 2016", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 675, + "label": 4, + "text": "DoublePulsar:doublepulsar doublepulsar backdoor implant tool developed u.s. national security agency nsa equation group leaked shadow brokers early 2017 tool infected 200,000 microsoft windows computers weeks used alongside eternalblue may 2017 wannacry ransomware attack variant doublepulsar first seen wild march 2016 discovered symantec sean dillon senior analyst security company risksense inc. first dissected inspected doublepulsar said nsa exploits 10 times worse heartbleed security bug use doublepulsar primary payload doublepulsar runs kernel mode grants cybercriminals high level control computer system installed uses three commands ping kill exec latter used load malware onto system", + "neighbors": [ + 11, + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 708, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1112, + 1162, + 1186, + 1243, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Train" + }, + { + "node_id": 676, + "label": 3, + "text": "Zoids:_The_Battle_Begins:zoids battle begins zoids battle begins 1986 battle simulation developed released europe zx spectrum amstrad cpc msx c64 personal computers martech licensed zoids toy manufacturer tomy players control human fused machine known spiderzoid human tasked reclaiming six parts large machine named zoidzilla parts captured enemy red zoids part reclaimed boost power player spiderzoid game well received magazines", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 677, + "label": 1, + "text": "FloraBase:florabase florabase public access web-based database flora western australia provides authoritative scientific information 12,978 taxa including descriptions maps images conservation status nomenclatural details 1,272 alien taxa naturalised weeds also recorded system takes data datasets including census western australian plants western australian herbarium specimen database nearly 725,000 vouchered plant collections operated western australian herbarium within department parks wildlife established november 1998 distribution guide uses combination ibra version 5.1 john stanley beard botanical provinces", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 678, + "label": 4, + "text": "Proxy_server:proxy server computer networks proxy server server computer system application acts intermediary requests clients seeking resources servers client connects proxy server requesting service file connection web page resource available different server proxy server evaluates request way simplify control complexity proxies invented add structure encapsulation distributed systems proxy server may reside user local computer point user computer destination servers internet open proxy forwarding proxy server accessible internet user 2008 gordon lyon estimates hundreds thousands open proxies internet anonymous open proxy allows users conceal ip address browsing web using internet services varying degrees anonymity however well number methods 'tricking client revealing regardless proxy used reverse proxy surrogate proxy server appears clients ordinary server reverse proxies forward requests one ordinary servers handle request response proxy server returned came directly original server leaving client knowledge original server reverse proxies installed neighborhood one web servers traffic coming internet destination one neighborhood web servers goes proxy server use reverse originates counterpart forward proxy since reverse proxy sits closer web server serves restricted set websites several reasons installing reverse proxy servers content-filtering web proxy server provides administrative control content may relayed one directions proxy commonly used commercial non-commercial organizations especially schools ensure internet usage conforms acceptable use policy content filtering proxy often support user authentication control web access also usually produces logs either give detailed information urls accessed specific users monitor bandwidth usage statistics may also communicate daemon-based and/or icap-based antivirus software provide security virus malware scanning incoming content real time enters network many workplaces schools colleges restrict web sites online services accessible available buildings governments also censor undesirable content done either specialized proxy called content filter commercial free products available using cache-extension protocol icap allows plug-in extensions open caching architecture websites commonly used students circumvent filters access blocked content often include proxy user access websites filter trying block requests may filtered several methods url dns blacklists blacklist url regex filtering mime filtering content keyword filtering products known employ content analysis techniques look traits commonly used certain types content providers blacklists often provided maintained web-filtering companies often grouped categories pornography gambling shopping social networks etc. assuming requested url acceptable content fetched proxy point dynamic filter may applied return path example jpeg files could blocked based fleshtone matches language filters could dynamically detect unwanted language content rejected http fetch error may returned requester web filtering companies use internet-wide crawling robot assesses likelihood content certain type resultant database corrected manual labor based complaints known flaws content-matching algorithms proxies scan outbound content e.g. data loss prevention scan content malicious software web filtering proxies able peer inside secure sockets http transactions assuming chain-of-trust ssl/tls transport layer security tampered ssl/tls chain-of-trust relies trusted root certificate authorities workplace setting client managed organization trust might granted root certificate whose private key known proxy consequently root certificate generated proxy installed browser ca list staff situations proxy analysis contents ssl/tls transaction becomes possible proxy effectively operating man-in-the-middle attack allowed client trust root certificate proxy owns destination server filters content based origin request use proxy circumvent filter example server using ip-based geolocation restrict service certain country accessed using proxy located country access service web proxies common means bypassing government censorship although 3 internet users use circumvention tools cases users circumvent proxies filter using blacklists using services designed proxy information non-blacklisted location proxies installed order eavesdrop upon data-flow client machines web content sent accessed \u2013 including passwords submitted cookies used \u2013 captured analyzed proxy operator reason passwords online services webmail banking always exchanged cryptographically secured connection ssl chaining proxies reveal data original requester possible obfuscate activities eyes user destination however traces left intermediate hops could used offered trace user activities policies administrators proxies unknown user may fall victim false sense security details sight mind inconvenience risk proxy users may find blocked certain web sites numerous forums web sites block ip addresses proxies known spammed trolled site proxy bouncing used maintain privacy caching proxy server accelerates service requests retrieving content saved previous request made client even clients caching proxies keep local copies frequently requested resources allowing large organizations significantly reduce upstream bandwidth usage costs significantly increasing performance isps large businesses caching proxy caching proxies first kind proxy server web proxies commonly used cache web pages web server poorly implemented caching proxies cause problems inability use user authentication proxy designed mitigate specific link related issues degradation performance enhancing proxy peps typically used improve tcp performance presence high round-trip times high packet loss wireless mobile phone networks highly asymmetric links featuring different upload download rates peps make efficient use network example merging tcp acks acknowledgements compressing data sent application layer translation proxy proxy server used localize website experience different markets traffic global audience routed translation proxy source website visitors browse proxied site requests go back source site pages rendered original language content response replaced translated content passes back proxy translations used translation proxy either machine translation human translation combination machine human translation different translation proxy implementations different capabilities allow customization source site local audience excluding source content substituting source content original local content proxy used automatically repair errors proxied content instance bikiniproxy system instruments javascript code fly order detect automatically repair errors happening browser.. another kind repair done proxy fix accessibility issues anonymous proxy server sometimes called web proxy generally attempts anonymize web surfing different varieties anonymizers destination server server ultimately satisfies web request receives requests anonymizing proxy server thus receive information end user address requests anonymous anonymizing proxy server however degree trust present proxy server user many proxy servers funded continued advertising link user access control proxy servers implement logon requirement large organizations authorized users must log gain access web organization thereby track usage individuals anonymizing proxy servers may forward data packets header lines http_via http_x_forwarded_for http_forwarded may reveal ip address client anonymizing proxy servers known elite high-anonymity proxies make appear proxy server client website could still suspect proxy used client sends packets include cookie previous visit use high-anonymity proxy server clearing cookies possibly cache would solve problem advertisers use proxy servers validating checking quality assurance geotargeted ads geotargeting ad server checks request source ip address uses geo-ip database determine geographic source requests using proxy server physically located inside specific country city gives advertisers ability test geotargeted ads proxy keep internal network structure company secret using network address translation help security internal network makes requests machines users local network anonymous proxies also combined firewalls incorrectly configured proxy provide access network otherwise isolated internet proxies allow web sites make web requests externally hosted resources e.g images music files etc cross-domain restrictions prohibit web site linking directly outside domains proxies also allow browser make web requests externally hosted content behalf website cross-domain restrictions place protect websites likes data theft prohibit browser directly accessing outside domains secondary market brokers use web proxy servers buy large stocks limited products limited sneakers tickets web proxies forward http requests request client regular http request except full url passed instead path request sent proxy server proxy makes request specified returns response web proxies allow http connect method set forwarding arbitrary data connection common policy forward port 443 allow https traffic examples web proxy servers include apache mod_proxy traffic server haproxy iis configured proxy e.g. application request routing nginx privoxy squid varnish reverse proxy wingate ziproxy tinyproxy rabbit4 polipo clients problem complex multiple proxy-servers solved client-serer proxy auto-config protocol pac file socks also forwards arbitrary data connection phase similar http connect web proxies also known intercepting proxy inline proxy forced proxy transparent proxy intercepts normal communication without requiring special client configuration clients need aware existence proxy transparent proxy normally located client internet proxy performing functions gateway router 'transparent proxy proxy modify request response beyond required proxy authentication identification 'non-transparent proxy proxy modifies request response order provide added service user agent group annotation services media type transformation protocol reduction anonymity filtering tcp intercept traffic filtering security feature protects tcp servers tcp syn flood attacks type denial-of-service attack tcp intercept available ip traffic 2009 security flaw way transparent proxies operate published robert auger computer emergency response team issued advisory listing dozens affected transparent intercepting proxy servers intercepting proxies commonly used businesses enforce acceptable use policy ease administrative overheads since client browser configuration required second reason however mitigated features active directory group policy dhcp automatic proxy detection intercepting proxies also commonly used isps countries save upstream bandwidth improve customer response times caching common countries bandwidth limited e.g island nations must paid diversion interception tcp connection creates several issues firstly original destination ip port must somehow communicated proxy always possible e.g. gateway proxy reside different hosts class cross site attacks depend certain behaviour intercepting proxies check access information original intercepted destination problem may resolved using integrated packet-level application level appliance software able communicate information packet handler proxy intercepting also creates problems http authentication especially connection-oriented authentication ntlm client browser believes talking server rather proxy cause problems intercepting proxy requires authentication user connects site also requires authentication finally intercepting connections cause problems http caches requests responses become uncacheable shared cache integrated firewall proxy servers router/firewall host proxy communicating original destination information done method example microsoft tmg wingate interception also performed using cisco wccp web cache control protocol proprietary protocol resides router configured cache allowing cache determine ports traffic sent via transparent redirection router redirection occur one two ways gre tunneling osi layer 3 mac rewrites osi layer 2 traffic reaches proxy machine interception commonly performed nat network address translation setups invisible client browser leave proxy visible web server devices internet side proxy recent linux bsd releases provide tproxy transparent proxy performs ip-level osi layer 3 transparent interception spoofing outbound traffic hiding proxy ip address network devices several methods often used detect presence intercepting proxy server cgi web proxy accepts target urls using web form user browser window processes request returns results user browser consequently used device network allow true proxy settings changed first recorded cgi proxy named rover time renamed 1998 cgiproxy developed american computer scientist james marshall early 1996 article unix review rich morin majority cgi proxies powered one cgiproxy written perl language glype written php language phproxy written php language april 2016 cgiproxy received 2 million downloads glype received almost million downloads whilst phproxy still receives hundreds downloads per week despite waning popularity due vpns privacy methods still several thousand cgi proxies online cgi proxies set purposes making websites accessible disabled people since shut due excessive traffic usually caused third party advertising service means bypass local filtering since many users n't care collateral damage causing became necessary organizations hide proxies disclosing urls take trouble contact organization demonstrate genuine need suffix proxy allows user access web content appending name proxy server url requested content e.g en.wikipedia.org. suffixproxy.com suffix proxy servers easier use regular proxy servers offer high levels anonymity primary use bypassing web filters however rarely used due advanced web filters tor short onion router system intended enable online anonymity tor client software routes internet traffic worldwide volunteer network servers order conceal user location usage someone conducting network surveillance traffic analysis using tor makes difficult trace internet activity including visits web sites online posts instant messages communication forms back user intended protect users personal freedom privacy ability conduct confidential business keeping internet activities monitored onion routing refers layered nature encryption service original data encrypted re-encrypted multiple times sent successive tor relays one decrypts layer encryption passing data next relay ultimately destination reduces possibility original data unscrambled understood transit tor client free software additional charges use network i2p anonymous network 'i2p proxy network aiming online anonymity implements garlic routing enhancement tor onion routing i2p fully distributed works encrypting communications various layers relaying network routers run volunteers various locations keeping source information hidden i2p offers censorship resistance goals i2p protect users personal freedom privacy ability conduct confidential business user i2p runs i2p router computer node i2p router takes care finding peers building anonymizing tunnels i2p provides proxies protocols http irc socks ... software free open-source network free charge use 'proxy refers layer-7 application osi reference model network address translation nat similar proxy operates layer-3 client configuration layer-3 nat configuring gateway sufficient however client configuration layer-7 proxy destination packets client generates must always proxy server layer-7 proxy server reads packet finds true destination nat operates layer-3 less resource-intensive layer-7 proxy also less flexible compare two technologies might encounter terminology known 'transparent firewall transparent firewall means proxy uses layer-7 proxy advantages without knowledge client client presumes gateway nat layer-3 idea inside packet method layer-3 packets sent layer-7 proxy investigation dns proxy server takes dns queries usually local network forwards internet domain name server may also cache dns records client programs socks-ify allows adaptation networked software connect external networks via certain types proxy servers mostly socks", + "neighbors": [ + 14, + 74, + 91, + 217, + 229, + 293, + 329, + 352, + 379, + 425, + 436, + 442, + 444, + 473, + 505, + 526, + 531, + 576, + 598, + 638, + 646, + 684, + 692, + 731, + 758, + 762, + 771, + 780, + 813, + 916, + 993, + 1132, + 1144, + 1172, + 1227, + 1235, + 1250, + 1309, + 1408, + 1462, + 1510, + 1552, + 1568, + 1582, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 679, + "label": 3, + "text": "La_Abad\u00eda_del_Crimen:la abad\u00eda del crimen la abad\u00eda del crimen abbey crime computer video game programmed 1987 paco men\u00e9ndez graphics made juan delc\u00e1n game originally conceived version umberto eco book name rose however paco men\u00e9ndez opera soft received reply eco order secure rights name game released la abad\u00eda del crimen abbey crime fact original working title novel name rose game videoadventure 3d isometric graphics franciscan friar william occam william baskerville book young novice adso discover perpetrator series murders medieval italian abbey player controls movement friar fra william mistakenly described monk user manual player also possibility control movement novice adso within screen fra william key controlling novice pressed follows fra william time game features characters representing monks abbey behave according programmed artificial intelligence move throughout mapping abbey show series dialogs shown written text moved along lower part screen extensive mapping abbey represented large series screens 3d isometric graphics series objects collected order successfully complete game action occurs seven days subdivided different canonical hours time day current hour indicated bottom left screen game starts abbot welcoming fra william explaining monk disappeared also explains fra william obligated obey orders abbot rules monastery attend religious services meals stay cell night research crimes pursued game novice adso remind players attend offices meals players follow forget way church refectory players disobey orders late services etc. obsequium level indicated bottom right-hand-side screen drop obsequium latin subservience obedience obsequium level drops zero abbot tolerate disrespect longer players leave abbey would result game actions missing prayer office altogether caught wandering around night result immediate expulsion end game game originally developed amstrad cpc 6128 8 bit platform ported systems zx spectrum msx pc amstrad cpc 464 version different 6128 original since several rooms decoration removed fit game 64k 464 spectrum version 128 platform music played game corresponds minuet g major sonata flute bwv 1033 bach crystal palace gwendal original pc version also featured ave maria schubert short chorus recording played speaker player went church form copy protection pc version illegal copy game created church area instead ave maria voice crying pirata pirata pirata several times heard instead game crash game programmed making capacities 8-bit computers taking high level care details plot mapping graphics artificial intelligence characters sound etc made game regarded one best video games made 8-bit computers spite singular qualities expressed positive initial reviews game modest commercial success never officially released outside spain country came achieve cult following game also considered one perfect ten games spectrum 128 according retro gamer", + "neighbors": [ + 85, + 134, + 679, + 822, + 868, + 961 + ], + "mask": "Test" + }, + { + "node_id": 680, + "label": 5, + "text": "VoiceXML:voicexml voicexml vxml digital document standard specifying interactive media voice dialogs humans computers used developing audio voice response applications banking systems automated customer service portals voicexml applications developed deployed manner analogous web browser interprets visually renders hypertext markup language html receives web server voicexml documents interpreted voice browser common deployment architectures users interact voice browsers via public switched telephone network pstn voicexml document format based extensible markup language xml standard developed world wide web consortium w3c voicexml applications commonly used many industries segments commerce applications include order inquiry package tracking driving directions emergency notification wake-up flight tracking voice access email customer relationship management prescription refilling audio news magazines voice dialing real-estate information national directory assistance applications voicexml tags instruct voice browser provide speech synthesis automatic speech recognition dialog management audio playback following example voicexml document interpreted voicexml interpreter output hello world synthesized speech typically http used transport protocol fetching voicexml pages applications may use static voicexml pages others rely dynamic voicexml page generation using application server like tomcat weblogic iis websphere historically voicexml platform vendors implemented standard different ways added proprietary features voicexml 2.0 standard adopted w3c recommendation 16 march 2004 clarified areas difference voicexml forum industry group promoting use standard provides conformance testing process certifies vendors implementations conformant corporation ibm lucent motorola formed voicexml forum march 1999 order develop standard markup language specifying voice dialogs september 1999 forum released voicexml 0.9 member comment march 2000 published voicexml 1.0 soon afterwards forum turned control standard w3c w3c produced several intermediate versions voicexml 2.0 reached final recommendation stage march 2004 voicexml 2.1 added relatively small set additional features voicexml 2.0 based feedback implementations 2.0 standard backward compatible voicexml 2.0 reached w3c recommendation status june 2007 voicexml 3.0 next major release voicexml new major features includes new xml statechart description language called scxml w3c speech interface framework also defines standards closely associated voicexml speech recognition grammar specification srgs used tell speech recognizer sentence patterns expect hear patterns called grammars speech recognizer determines likely sentence heard needs extract semantic meaning sentence return voicexml interpreter semantic interpretation specified via semantic interpretation speech recognition sisr standard sisr used inside srgs specify semantic results associated grammars i.e. set ecmascript assignments create semantic structure returned speech recognizer speech synthesis markup language ssml used decorate textual prompts information best render synthetic speech example speech synthesizer voice use speak louder softer pronunciation lexicon specification pls used define words pronounced generated pronunciation information meant used speech recognizers speech synthesizers voice browsing applications call control extensible markup language ccxml complementary w3c standard ccxml interpreter used voicexml platforms handle initial call setup caller voice browser provide telephony services like call transfer disconnect voice browser ccxml also used non-voicexml contexts media server applications often necessary several call legs interact example multi-party conference deficiencies identified voicexml application companies designed specific scripting languages deal environment media server markup language msml convedia solution media server control markup language mscml snowshore solution snowshore owned dialogic convedia owned radisys languages also contain 'hooks external scripts like voicexml run call legs ivr functionality required ietf working group called mediactrl media control working successor scripting systems hoped progress open widely adopted standard", + "neighbors": [ + 16, + 28, + 638, + 1132, + 1264, + 1280, + 1470, + 1486, + 1528, + 1550 + ], + "mask": "Test" + }, + { + "node_id": 681, + "label": 3, + "text": "ARM_Cortex-M:arm cortex-m arm cortex-m group 32-bit risc arm processor cores licensed arm holdings intended microcontroller use shipped tens billions devices cores consist cortex-m0 cortex-m0+ cortex-m1 cortex-m3 cortex-m4 cortex-m7 cortex-m23 cortex-m33 cortex-m35p cortex-m4 m7 m33 m35p cores fpu silicon option included silicon cores known cortex-mx fpu cortex-mxf x core number arm cortex-m family arm microprocessor cores designed use microcontrollers asics assps fpgas socs cortex-m cores commonly used dedicated microcontroller chips also hidden inside soc chips power management controllers i/o controllers system controllers touch screen controllers smart battery controllers sensors controllers though 8-bit microcontrollers popular past cortex-m slowly chipping away 8-bit market prices low-end cortex-m chips moved downward cortex-m become popular replacements 8-bit chips applications benefit 32-bit math operations replacing older legacy arm cores arm7 arm9 arm holdings neither manufactures sells cpu devices based designs rather licenses processor architecture interested parties arm offers variety licensing terms varying cost deliverables licensees arm provides integratable hardware description arm core well complete software development toolset right sell manufactured silicon containing arm cpu integrated device manufacturers idm receive arm processor ip synthesizable rtl written verilog form ability perform architectural level optimizations extensions allows manufacturer achieve custom design goals higher clock speed low power consumption instruction set extensions including floating point optimizations size debug support etc determine components included particular arm cpu chip consult manufacturer datasheet related documentation silicon options cortex-m cores additional silicon options cortex-m0 m0+ m1 implement armv6-m architecture cortex-m3 implements armv7-m architecture cortex-m4 cortex-m7 implements armv7e-m architecture architectures binary instruction upward compatible armv6-m armv7-m armv7e-m. binary instructions available cortex-m0 cortex-m0+ cortex-m1 execute without modification cortex-m3 cortex-m4 cortex-m7 binary instructions available cortex-m3 execute without modification cortex-m4 cortex-m7 cortex-m33 cortex-m35p thumb-1 thumb-2 instruction sets supported cortex-m architectures legacy 32-bit arm instruction set n't supported six cortex-m cores implement common subset instructions consists thumb-1 thumb-2 including 32-bit result multiply cortex-m0 cortex-m0+ cortex-m1 cortex-m23 designed create smallest silicon die thus fewest instructions cortex-m family cortex-m0 m0+ m1 include thumb-1 instructions except new instructions cbz cbnz added armv7-m architecture cortex-m0 m0+ m1 include minor subset thumb-2 instructions bl dmb dsb isb mrs msr cortex-m3 m4 m7 m33 m35p base thumb-1 thumb-2 instructions cortex-m3 adds three thumb-1 instructions thumb-2 instructions hardware integer divide saturation arithmetic instructions cortex-m4 adds dsp instructions optional single-precision floating-point unit vfpv4-sp cortex-m7 adds optional double-precision fpu vfpv5 cortex-m23 m33 add trustzone instructions arm architecture arm cortex-m series removed features older legacy cores capabilities 32-bit arm instruction set duplicated many ways thumb-1 thumb-2 instruction sets arm features n't similar feature 16-bit thumb-1 instruction set evolved time since first released legacy arm7t cores armv4t architecture new thumb-1 instructions added legacy armv5 armv6 armv6t2 architectures released 16-bit thumb-1 instructions removed cortex-m cores cortex-m0 core optimized small silicon die size use lowest price chips key features cortex-m0 core silicon options following microcontrollers based cortex-m0 core following chips cortex-m0 secondary core cortex-m0+ optimized superset cortex-m0 cortex-m0+ complete instruction set compatibility cortex-m0 thus allowing use compiler debug tools cortex-m0+ pipeline reduced 3 2 stages lowers power usage addition debug features existing cortex-m0 silicon option added cortex-m0+ called micro trace buffer mtb provides simple instruction trace buffer cortex-m0+ also received cortex-m3 cortex-m4 features added silicon options memory protection unit mpu vector table relocation key features cortex-m0+ core silicon options following microcontrollers based cortex-m0+ core following chips cortex-m0+ secondary core smallest arm microcontrollers cortex-m0+ type 2014 smallest 1.6 mm 2 mm kinetis kl03 21 june 2018 world smallest computer computer device announced based arm cortex-m0+ including ram wireless transmitters receivers based photovoltaics university michigan researchers 2018 symposia vlsi technology circuits paper 0.04mm3 16nw wireless batteryless sensor system integrated cortex-m0+ processor optical communication cellular temperature measurement device 1/10th size ibm previously claimed world-record-sized computer months back march 2018 smaller grain salt cortex-m1 optimized core especially designed loaded fpga chips key features cortex-m1 core silicon options following vendors support cortex-m1 soft-cores fpga chips key features cortex-m3 core silicon options following microcontrollers based cortex-m3 core following chips cortex-m3 secondary core following fpgas include cortex-m3 core following vendors support cortex-m3 soft-cores fpga chips conceptually cortex-m4 cortex-m3 plus dsp instructions optional floating-point unit fpu core fpu known cortex-m4f key features cortex-m4 core silicon options following microcontrollers based cortex-m4 core following microcontrollers based cortex-m4f m4 fpu core following chips either cortex-m4 m4f secondary core cortex-m7 high-performance core almost double power efficiency older cortex-m4 features 6-stage superscalar pipeline branch prediction optional floating-point unit capable single-precision optionally double-precision operations instruction data buses enlarged 64-bit wide previous 32-bit buses core contains fpu known cortex-m7f otherwise cortex-m7 key features cortex-m7 core silicon options following microcontrollers based cortex-m7 core cortex-m23 core announced october 2016 based newer armv8-m architecture previously announced november 2015 conceptually cortex-m23 similar cortex-m0+ plus integer divide instructions trustzone security features also 2-stage instruction pipeline key features cortex-m23 core silicon options following microcontrollers based cortex-m23 core cortex-m33 core announced october 2016 based newer armv8-m architecture previously announced november 2015 conceptually cortex-m33 similar cross cortex-m4 cortex-m23 also 3-stage instruction pipeline key features cortex-m33 core silicon options following microcontrollers based cortex-m33 core cortex-m35p core announced may 2018 conceptually cortex-m33 core new instruction cache plus new tamper-resistant hardware concepts borrowed arm securcore family configurable parity ecc features limited public information currently available cortex-m35p technical reference manual released 2019 following microcontrollers based cortex-m35p core documentation arm chips extensive past 8-bit microcontroller documentation would typically fit single document microcontrollers evolved everything required support documentation package arm chips typically consists collection documents ic manufacturer well cpu core vendor arm holdings typical top-down documentation tree ic manufacturers additional documents evaluation board user manuals application notes getting started guides software library documents errata see external links section links official arm documents", + "neighbors": [ + 112, + 214, + 331, + 544, + 607, + 681, + 853, + 907, + 917, + 984, + 988, + 1016, + 1022, + 1069, + 1174, + 1178, + 1220, + 1224, + 1262, + 1290, + 1305, + 1398, + 1488, + 1518, + 1572, + 1591, + 1605, + 1608 + ], + "mask": "Validation" + }, + { + "node_id": 682, + "label": 9, + "text": "Lua_(programming_language):lua programming language lua meaning moon lightweight high-level multi-paradigm programming language designed primarily embedded use applications lua cross-platform since interpreter compiled bytecode written ansi c lua relatively simple c api embed applications lua originally designed 1993 language extending software applications meet increasing demand customization time provided basic facilities procedural programming languages complicated domain-specific features included rather included mechanisms extending language allowing programmers implement features lua intended general embeddable extension language designers lua focused improving speed portability extensibility ease-of-use development lua created 1993 roberto ierusalimschy luiz henrique de figueiredo waldemar celes members computer graphics technology group tecgraf pontifical catholic university rio de janeiro brazil 1977 1992 brazil policy strong trade barriers called market reserve computer hardware software atmosphere tecgraf clients could afford either politically financially buy customized software abroad reasons led tecgraf implement basic tools needed scratch lua predecessors data-description/configuration languages sol simple object language del data-entry language independently developed tecgraf 1992\u20131993 add flexibility two different projects interactive graphical programs engineering applications petrobras company lack flow-control structures sol del petrobras felt growing need add full programming power evolution lua language authors wrote lua 1.0 designed way object constructors slightly different current light flexible style incorporated data-description syntax sol hence name lua sol also portuguese word sun lua word moon lua syntax control structures mostly borrowed modula codice_1 codice_2 codice_3/codice_4 also taken influence clu multiple assignments multiple returns function calls simpler alternative reference parameters explicit pointers c++ neat idea allowing local variable declared need snobol awk associative arrays article published dr. dobb journal lua creators also state lisp scheme single ubiquitous data-structure mechanism list major influence decision develop table primary data structure lua lua semantics increasingly influenced scheme time especially introduction anonymous functions full lexical scoping several features added new lua versions versions lua prior version 5.0 released license similar bsd license version 5.0 onwards lua licensed mit license permissive free software licences almost identical lua commonly described multi-paradigm language providing small set general features extended fit different problem types lua contain explicit support inheritance allows implemented metatables similarly lua allows programmers implement namespaces classes related features using single table implementation first-class functions allow employment many techniques functional programming full lexical scoping allows fine-grained information hiding enforce principle least privilege general lua strives provide simple flexible meta-features extended needed rather supply feature-set specific one programming paradigm result base language light\u2014the full reference interpreter 247 kb compiled\u2014and easily adaptable broad range applications lua dynamically typed language intended use extension scripting language compact enough fit variety host platforms supports small number atomic data structures boolean values numbers double-precision floating point 64-bit integers default strings typical data structures arrays sets lists records represented using lua single native data structure table essentially heterogeneous associative array lua implements small set advanced features first-class functions garbage collection closures proper tail calls coercion automatic conversion string number values run time coroutines cooperative multitasking dynamic module loading classic hello world program written follows print hello world print 'hello world comment lua starts double-hyphen runs end line similar ada eiffel haskell sql vhdl multi-line strings comments adorned double square brackets factorial function implemented function example function factorial n end lua four types loops codice_2 loop codice_3 loop similar codice_7 loop numeric codice_8 loop generic codice_8 loop -- condition true condition end repeat condition first last delta -- delta may negative allowing loop count end generic codice_8 loop key value pairs _g end would iterate table codice_11 using standard iterator function codice_12 returns codice_13 also nested loop loop inside another loop local grid row ipairs grid end lua treatment functions first-class values shown following example print function behavior modified end future calls codice_14 routed new function lua lexical scoping old print function accessible new modified print lua also supports closures demonstrated function addto x end fourplus addto 4 print fourplus 3 -- prints 7 -- also achieved calling function following way print addto 4 3 -- calling returned function 'addto 4 argument 3 directly new closure variable codice_15 created every time codice_16 called new anonymous function returned always access codice_15 parameter closure managed lua garbage collector like object tables important data structures design built-in composite data type lua foundation user-created types conceptually similar associative arrays php dictionaries python hashes ruby perl table collection key data pairs data referenced key words hashed heterogeneous associative array tables created using codice_18 constructor syntax tables always passed reference see call sharing key index value except codice_13 nan including functions table often used structure record using strings keys use common lua features special syntax accessing fields using table store related functions act namespace tables automatically assigned numerical key enabling used array data type first automatic index 1 rather 0 many programming languages though explicit index 0 allowed numeric key codice_20 distinct string key codice_21 length table codice_22 defined integer index codice_23 codice_24 codice_13 codice_26 codice_13 moreover codice_28 codice_13 codice_23 zero regular array non-nil values 1 given codice_23 length exactly codice_23 index last value array holes nil values non-nil values codice_33 indices directly precedes codice_13 value may consider nil value end array table array objects using hash map emulate array normally slower using actual array however lua tables optimized use arrays help avoid issue extensible semantics key feature lua metatable concept allows lua tables customized powerful ways following example demonstrates infinite table codice_23 codice_36 give codice_23-th fibonacci number using dynamic programming memoization fibs 1 1 -- initial values fibs 1 fibs 2 setmetatable fibs although lua built-in concept classes object-oriented programming achieved using two language features first-class functions tables placing functions related data table object formed inheritance single multiple implemented using metatable mechanism telling object look nonexistent methods fields parent object concept class techniques rather prototypes used similar self javascript new objects created either factory method constructs new objects scratch cloning existing object lua provides syntactic sugar facilitate object orientation declare member functions inside prototype table one use equivalent calling class methods also makes use colon equivalent creating basic vector object vector.__index vector function vector new x z -- constructor end function vector magnitude -- another method end local vec vector new 0 1 0 -- create vector print vec magnitude -- call method output 1 print vec.x -- access member variable output 0 lua programs interpreted directly textual lua file compiled bytecode run lua virtual machine compilation process typically invisible user performed run-time done offline order increase loading performance reduce memory footprint host environment leaving compiler lua bytecode also produced executed within lua using codice_38 function string library codice_39 functions lua version 5.3.4 implemented approximately 24,000 lines c code like cpus unlike virtual machines stack-based lua vm register-based therefore closely resembles actual hardware design register architecture avoids excessive copying values reduces total number instructions per function virtual machine lua 5 one first register-based pure vms wide use perl's parrot android dalvik two well-known register-based vms example bytecode listing factorial function defined shown codice_40 5.1 compiler lua intended embedded applications provides c api purpose api divided two parts lua core lua auxiliary library lua api design eliminates need manual reference management c code unlike python api api like language minimalistic advanced functionality provided auxiliary library consists largely preprocessor macros assist complex table operations lua c api stack based lua provides functions push pop simple c data types integers floats etc stack well functions manipulating tables stack lua stack somewhat different traditional stack stack indexed directly example negative indices indicate offsets top stack example \u22121 top recently pushed value positive indices indicate offsets bottom oldest value marshalling data c lua functions also done using stack call lua function arguments pushed onto stack codice_41 used call actual function writing c function directly called lua arguments read stack example calling lua function c int main void running example gives c api also provides special tables located various pseudo-indices lua stack codice_42 prior lua 5.2 globals table codice_11 within lua main namespace also registry located codice_44 c programs store lua values later retrieval possible write extension modules using lua api extension modules shared objects used extend functionality interpreter providing native facilities lua scripts lua side module appears namespace table holding functions variables lua scripts may load extension modules using codice_45 like modules written lua growing collection modules known rocks available package management system called luarocks spirit cpan rubygems python eggs prewritten lua bindings exist popular programming languages including scripting languages c++ number template-based approaches automatic binding generators video game development lua widely used scripting language game programmers perhaps due perceived easiness embed fast execution short learning curve 2003 poll conducted gamedev.net showed lua popular scripting language game programming 12 january 2012 lua announced winner front line award 2011 magazine game developer category programming tools large number non-game applications also use lua extensibility luatex implementation tex type-setting language redis key-value database nginx web server scribunto extension lua available scripting language mediawiki software powers wikipedia wikis among uses allowing integration data wikidata articles powering", + "neighbors": [ + 7, + 19, + 31, + 58, + 65, + 78, + 81, + 117, + 152, + 176, + 201, + 216, + 246, + 275, + 292, + 306, + 313, + 347, + 373, + 378, + 405, + 412, + 473, + 509, + 538, + 544, + 567, + 579, + 593, + 594, + 597, + 653, + 682, + 686, + 716, + 742, + 756, + 782, + 790, + 796, + 815, + 818, + 820, + 825, + 873, + 916, + 919, + 948, + 998, + 1005, + 1028, + 1068, + 1103, + 1120, + 1138, + 1146, + 1152, + 1189, + 1190, + 1221, + 1225, + 1227, + 1235, + 1242, + 1251, + 1269, + 1278, + 1298, + 1311, + 1318, + 1319, + 1324, + 1372, + 1388, + 1430, + 1457, + 1477, + 1481, + 1483, + 1491, + 1502, + 1521, + 1532, + 1535, + 1536, + 1538, + 1558, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 683, + "label": 1, + "text": "Asia-Pacific_Trade_Agreements_Database:asia-pacific trade agreements database asia-pacific trade investment agreements database aptiad resource researchers policymakers area international trade investment online database allows searches two ways one relates agreements users search agreements members key terms types scopes agreements status another possibility search publications relevant regional integration trade agreements easier use database users download glossary related terms website trade agreements database component aptiad designed give researchers policymakers overview easy access regional bilateral trade agreements entered negotiation countries asia pacific region june 2008 136 agreements including agreements notified wto official information readily available also agreements negotiation least first formal negotiation round interactive trade indicators component aptiad designed help policymakers calculate commonly used indicators related trade performance national economies and/or trade agreements interactive trade indicator database enables select indicators e.g export/import value export/import growth export/import share trade share trade intensity country region product year export flows downloaded un comtrade using world integrated trade solution wits last 10 years present 1998-2007 selected developed developing countries asia-pacific region asia-pacific trade agreements database aptiad product trade investment division united nations economic social commission asia pacific", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 684, + "label": 5, + "text": "Hypertext_Transfer_Protocol:hypertext transfer protocol hypertext transfer protocol http application protocol distributed collaborative hypermedia information systems http foundation data communication world wide web hypertext documents include hyperlinks resources user easily access example mouse click tapping screen web browser development http initiated tim berners-lee cern 1989 development early http requests comments rfcs coordinated effort internet engineering task force ietf world wide web consortium w3c work later moving ietf http/1.1 first documented 1997 specification obsoleted 1999 likewise replaced family rfcs 2014 http/2 efficient expression http semantics wire published 2015 supported major web servers browsers transport layer security tls using application-layer protocol negotiation alpn extension tls 1.2 newer required.. http/3 proposed successor http/2 using udp instead tcp underlying transport protocol like http/2 obsolete previous major versions protocol http functions request\u2013response protocol client\u2013server computing model web browser example may client application running computer hosting website may server client submits http request message server server provides resources html files content performs functions behalf client returns response message client response contains completion status information request may also contain requested content message body web browser example user agent ua types user agent include indexing software used search providers web crawlers voice browsers mobile apps software accesses consumes displays web content http designed permit intermediate network elements improve enable communications clients servers high-traffic websites often benefit web cache servers deliver content behalf upstream servers improve response time web browsers cache previously accessed web resources reuse possible reduce network traffic http proxy servers private network boundaries facilitate communication clients without globally routable address relaying messages external servers http application layer protocol designed within framework internet protocol suite definition presumes underlying reliable transport layer protocol transmission control protocol tcp commonly used however http adapted use unreliable protocols user datagram protocol udp example httpu simple service discovery protocol ssdp http resources identified located network uniform resource locators urls using uniform resource identifiers uri schemes http https example including optional components codice_1 uris encoded hyperlinks html documents form interlinked hypertext documents http/1.1 revision original http http/1.0 http/1.0 separate connection server made every resource request http/1.1 reuse connection multiple times download images scripts stylesheets etc page delivered http/1.1 communications therefore experience less latency establishment tcp connections presents considerable overhead term hypertext coined ted nelson 1965 xanadu project turn inspired vannevar bush 1930s vision microfilm-based information retrieval management memex system described 1945 essay may think tim berners-lee team cern credited inventing original http along html associated technology web server text-based web browser berners-lee first proposed worldwideweb project 1989\u2014now known world wide web first version protocol one method namely get would request page server response server always html page first documented version http http v0.9 1991 dave raggett led http working group http wg 1995 wanted expand protocol extended operations extended negotiation richer meta-information tied security protocol became efficient adding additional methods header fields officially introduced recognized http v1.0 1996 http wg planned publish new standards december 1995 support pre-standard http/1.1 based developing called http-ng rapidly adopted major browser developers early 1996 march year pre-standard http/1.1 supported arena netscape 2.0 netscape navigator gold 2.01 mosaic 2.7 lynx 2.5 internet explorer 2.0 end-user adoption new browsers rapid march 1996 one web hosting company reported 40 browsers use internet http 1.1 compliant web hosting company reported june 1996 65 browsers accessing servers http/1.1 compliant http/1.1 standard defined officially released january 1997 improvements updates http/1.1 standard released june 1999 2007 http working group formed part revise clarify http/1.1 specification june 2014 wg released updated six-part specification obsoleting http/2 published may 2015 http session sequence network request-response transactions http client initiates request establishing transmission control protocol tcp connection particular port server typically port 80 occasionally port 8080 see list tcp udp port numbers http server listening port waits client request message upon receiving request server sends back status line http/1.1 200 ok message body message typically requested resource although error message information may also returned http/0.9 1.0 connection closed single request/response pair http/1.1 keep-alive-mechanism introduced connection could reused one request persistent connections reduce request latency perceptibly client need re-negotiate tcp 3-way-handshake connection first request sent another positive side effect general connection becomes faster time due tcp slow-start-mechanism version 1.1 protocol also made bandwidth optimization improvements http/1.0 example http/1.1 introduced chunked transfer encoding allow content persistent connections streamed rather buffered http pipelining reduces lag time allowing clients send multiple requests waiting response another addition protocol byte serving server transmits portion resource explicitly requested client http stateless protocol stateless protocol require http server retain information status user duration multiple requests however web applications implement states server side sessions using instance http cookies hidden variables within web forms http provides multiple authentication schemes basic access authentication digest access authentication operate via challenge-response mechanism whereby server identifies issues challenge serving requested content http provides general framework access control authentication via extensible set challenge-response authentication schemes used server challenge client request client provide authentication information http authentication specification also provides arbitrary implementation-specific construct dividing resources common given root uri realm value string present combined canonical root uri form protection space component challenge effect allows server define separate authentication scopes one root uri client sends requests server server sends responses request message consists following request line header fields must end cr lf carriage return character followed line feed character empty line must consist cr lf whitespace http/1.1 protocol header fields except host optional request line containing path name accepted servers maintain compatibility http clients http/1.0 specification http defines methods sometimes referred verbs nowhere specification mention verb options head verb indicate desired action performed identified resource resource represents whether pre-existing data data generated dynamically depends implementation server often resource corresponds file output executable residing server http/1.0 specification defined get head post methods http/1.1 specification added five new methods options put delete trace connect specified documents semantics well-known depended client use method server configured support combination methods method unknown intermediate treated unsafe non-idempotent method limit number methods defined allows future methods specified without breaking existing infrastructure example webdav defined 7 new methods specified patch method method names case sensitive contrast http header field names case-insensitive general-purpose http servers required implement least get head methods methods considered optional specification methods example get head options trace convention defined safe means intended information retrieval change state server words side effects beyond relatively harmless effects logging web caching serving banner advertisements incrementing web counter making arbitrary get requests without regard context application state therefore considered safe however mandated standard explicitly acknowledged guaranteed contrast methods post put delete patch intended actions may cause side effects either server external side effects financial transactions transmission email methods therefore usually used conforming web robots web crawlers conform tend make requests without regard context consequences despite prescribed safety get requests practice handling server technically limited way therefore careless deliberate programming cause non-trivial changes server discouraged cause problems web caching search engines automated agents make unintended changes server example website might allow deletion resource url http //example.com/article/1234/delete arbitrarily fetched even using get would simply delete article one example occurring practice short-lived google web accelerator beta prefetched arbitrary urls page user viewing causing records automatically altered deleted en masse beta suspended weeks first release following widespread criticism methods put delete defined idempotent meaning multiple identical requests effect single request methods get head options trace prescribed safe also idempotent http stateless protocol contrast post method necessarily idempotent therefore sending identical post request multiple times may affect state cause side effects financial transactions cases may desirable cases could due accident user realize action result sending another request receive adequate feedback first request successful web browsers may show alert dialog boxes warn users cases reloading page may re-submit post request generally web application handle cases post request submitted note whether method idempotent enforced protocol web server perfectly possible write web application example database insert non-idempotent action triggered get request ignoring recommendation however may result undesirable consequences user agent assumes repeating request safe trace method used part class attacks known cross-site tracing reason common security advice disabled server configuration microsoft iis supports proprietary track method behaves similarly likewise recommended disabled response message consists following status line header fields must end cr lf empty line must consist cr lf whitespace strict requirement cr lf relaxed somewhat within message bodies consistent use system linebreaks cr lf alone http/1.0 since first line http response called status line includes numeric status code 404 textual reason phrase found way user agent handles response depends primarily code secondarily response header fields custom status codes used user agent encounters code recognize use first digit code determine general class response standard reason phrases recommendations replaced local equivalents web developer discretion status code indicated problem user agent might display reason phrase user provide information nature problem standard also allows user agent attempt interpret reason phrase though might unwise since standard explicitly specifies status codes machine-readable reason phrases human-readable http status code primarily divided five groups better explanation request responses client server named popular way establishing encrypted http connection https two methods establishing encrypted http connection also exist secure hypertext transfer protocol using http/1.1 upgrade header specify upgrade tls browser support two however nearly non-existent sample conversation http client http server running www.example.com port 80 client request consisting case request line one header field followed blank line request ends double newline form carriage return followed line feed host field distinguishes various dns names sharing single ip address allowing name-based virtual hosting optional http/1.0 mandatory http/1.1 means /index.html one etag entity tag header field used determine cached version requested resource identical current version resource server content-type specifies internet media type data conveyed http message content-length indicates length bytes http/1.1 webserver publishes ability respond requests certain byte ranges document setting field accept-ranges bytes useful client needs certain portions resource sent server called byte serving connection close sent means web server close tcp connection immediately transfer response header lines optional content-length missing length determined ways chunked transfer encoding uses chunk size 0 mark end content identity encoding without content-length reads content socket closed content-encoding like gzip used compress transmitted data gopher protocol content delivery protocol displaced http early 1990s spdy protocol alternative http developed google superseded new http protocol http/2", + "neighbors": [ + 12, + 14, + 16, + 52, + 74, + 83, + 95, + 107, + 109, + 138, + 196, + 217, + 258, + 277, + 311, + 319, + 425, + 427, + 429, + 430, + 436, + 444, + 455, + 470, + 505, + 509, + 530, + 531, + 542, + 543, + 570, + 576, + 582, + 598, + 623, + 638, + 668, + 672, + 678, + 684, + 690, + 692, + 703, + 713, + 732, + 740, + 757, + 758, + 764, + 769, + 770, + 771, + 772, + 779, + 824, + 833, + 844, + 852, + 862, + 886, + 916, + 923, + 939, + 953, + 1026, + 1033, + 1058, + 1084, + 1116, + 1132, + 1151, + 1166, + 1195, + 1200, + 1206, + 1210, + 1218, + 1225, + 1228, + 1235, + 1280, + 1309, + 1326, + 1329, + 1331, + 1376, + 1378, + 1386, + 1395, + 1408, + 1410, + 1416, + 1417, + 1423, + 1438, + 1443, + 1448, + 1452, + 1453, + 1465, + 1470, + 1517, + 1528, + 1550, + 1552, + 1569, + 1570, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 685, + "label": 4, + "text": "FireHOL:firehol firehol shell script designed wrapper iptables written ease customization linux kernel firewall netfilter firehol graphical user interface configured easy understand plain text configuration file advantage firehol friendliness beginners n't worry answer packet firehol first parses configuration file sets appropriate iptables rules achieve expected firewall behavior large complex bash script file depending iptables console tools rather communicating kernel directly advantage portability linux system iptables bash appropriate tools run main drawback slower starting times particularly older systems since delay happens per boot\u2014or less resulting rules saved disk\u2014high performance generally important except embedded systems firehol also benefits shell flexibility easily extended configured high degree firehol configuration files fully functional bash scripts one write scripts normal shell syntax operate expected one might loop firehol statement forward entire set ports example firehol free software open-source distributed terms gnu general public license", + "neighbors": [ + 94, + 134, + 189, + 217, + 476, + 569, + 648, + 656, + 731, + 842, + 910, + 961, + 1138, + 1250, + 1257, + 1403, + 1406, + 1457, + 1462, + 1514, + 1542, + 1568, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 686, + "label": 9, + "text": "Lively_Kernel:lively kernel lively kernel open-source web programming environment supports desktop-style applications rich graphics direct manipulation abilities without installation upgrade troubles conventional desktop applications development began sun microsystems laboratories menlo park california later moved hasso plattner institute potsdam-babelsberg near berlin lively kernel graphical composition integrated programming environment written fully programming language javascript using standard browser graphics w3c canvas svg thus accessible browser web page begins operating soon web page loaded able edit code graphics built-in webdav support save results even clone onto new web pages along application development abilities also function integrated development environment ide making whole system self-sufficient tools except browser lively kernel uses morphic graphics model add behavior scene graph built browser graphics simple graphics thus assembled standard widgets sliders scroll bars text views lists clipping frames simple window system built widgets offers object inspectors file browsers code browsers even rudimentary demo pages thus ability edit test new code simple code browser system running lively used build simple web sites including tutorial also client-side wiki system stores pages versioned repository content vary relatively static pages text fully dynamic models look behave like adobe flash simulations lively kernel achieves complex dynamic behavior without specific animation support use animation features svg simple scheduling multiple green-thread processes javascript lively kernel includes multifont text editor written javascript includes support centering justification similar rudimentary text composition abilities working lively thus much feel working web page design program except on-the-fly text layout done offline composition program built-in dynamic behavior text lively kernel liveliness lively graphics becomes even apparent manipulating scale rotation handles objects text whole code browser used tilted 20 degrees side text editor made entirely lively graphics works perfectly well rotated scaled scroll bars clipping frames rest entire user interface lively kernel depends browser support javascript svg canvas graphics part w3c standards 2009 means runs safari firefox chrome opera browsers requirement might seem less compatible html lively actually compatible across browsers runs html uniformity among javascript svg canvas implementations one html implementation another except one small initial file lively kernel code base entirely free tests client browser used 2011 lively kernel runs best webkit-based browsers safari macintosh chromium google chrome windows running internet explorer windows requires google chrome frame testing popular browsers planned next release lively includes integrated development environment considerable power designed work via webdav local set dozen source javascript files synchronizable versioned repository user opens systembrowser javascript source files listed file pane browser user clicks one files read parsed ometa javascript parser displayed similar smalltalk browser functions class definitions listed class method names shown user click method name edit code bottom pane save new definition new definition checked syntax correct stored back .js file moreover eval mode usual case method redefined system running allows non-critical changes made without need restart lively applications developed source files loaded rapid scan find every reference selected text present code bodies match separate sub-browser lively ide includes object inspectors morph style panels controlling fills borders text styles also facilities debugging error points profiling performance tuning pushed owing improving quality run-time support major browsers ide operates source code files versioned repository manage evolution lively code base approach used empower users control active web content form client-side wiki lively includes facilities edit content worlds scene graphs content store content web pages webdav connection allows lively store new versions page content incrementally developed new version saved viewable rest internet prior versions retrieved cases error change mind notable wiki style evolving web content extends textual graphical scripting content lively well new forms may defined yet without need wiki server kind required server providing http webdav interface increasing amounts lively project content maintained manner lively qt new implementation lively kernel kernel parts replaced functionality offered qt framework lively qt inherits basic functionality implementation widgets layout management core event handling core javascript support qt lively qt retains exceptionally interactive nature liveliness lively kernel e.g. allowing user interface application source code edited fly however lively qt development work performed using familiar well-documented apis qt platform", + "neighbors": [ + 7, + 36, + 50, + 69, + 81, + 99, + 117, + 132, + 258, + 306, + 308, + 394, + 509, + 567, + 593, + 632, + 653, + 682, + 796, + 815, + 869, + 927, + 959, + 961, + 1068, + 1138, + 1189, + 1190, + 1221, + 1225, + 1227, + 1228, + 1235, + 1251, + 1264, + 1298, + 1302, + 1311, + 1373, + 1502, + 1536, + 1566, + 1621 + ], + "mask": "Validation" + }, + { + "node_id": 687, + "label": 5, + "text": "Wireless_Framework_Telecommunication_(code_name:_Beep):wireless framework telecommunication code name beep wireless framework telecommunication beep implementation xmpp protocol mobile devices enable two roaming mobile devices positioned two different locations exchange data order communication stream successful mobile devices must connected internet wireless technology regardless wireless technologies using internet acts middle carrier developers trying best offer communication services highest possible quality relieve user paying current high costs communication moreover project empower client mobile device roaming capabilities allowing mobile device easily locate initiate interaction session another mobile device within unlimited range beep implementation generic high level abstract well-defined framework supports wireless communication internet enabling two roaming mobile devices exchange data necessarily using wireless technology use protocol enable developers program application run top protocol exchange data different types licensed gnu general public license gpl", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 688, + "label": 2, + "text": "Michael_Kerrisk:michael kerrisk michael kerrisk technical author programmer since 2004 maintainer linux man-pages project succeeding andries brouwer born 1961 new zealand lives munich germany kerrisk worked digital equipment google linux foundation editor writer lwn.net currently works freelance consultant trainer best known book linux programming interface published starch press 2010 book widely regarded definitive work linux system programming translated several languages maintainer linux man-pages project kerrisk authored co-authored third man pages worked improving project infrastructure contributions received special award 2016 new zealand open source awards", + "neighbors": [ + 134, + 209, + 213, + 219, + 265, + 267, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1197, + 1202, + 1208, + 1241, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1509, + 1524, + 1526, + 1558, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 689, + "label": 2, + "text": "Graphics_Device_Interface:graphics device interface graphics device interface gdi microsoft windows application programming interface core operating system component responsible representing graphical objects transmitting output devices monitors printers gdi responsible tasks drawing lines curves rendering fonts handling palettes directly responsible drawing windows menus etc task reserved user subsystem resides user32.dll built atop gdi systems components similar gdi example macos quartz x window system xlib/xcb gdi significant advantages direct methods accessing hardware perhaps scaling capabilities abstract representation target devices using gdi easy draw multiple devices screen printer expect proper reproduction case capability center see get applications microsoft windows simple games require fast graphics rendering may use gdi however gdi relatively hard use advanced animation lacks notion synchronizing individual video frames video card lacks hardware rasterization 3d etc modern games usually use directx opengl instead let programmers exploit features modern hardware device context dc used define attributes text images output screen printer actual context maintained gdi handle device context hdc obtained output written released elements written gdi uses bresenham line drawing algorithm draw aliased lines gdi present initial release windows ms-dos programs hitherto manipulated graphics hardware using software interrupts sometimes via video bios manipulating video memory directly code written way expects user video memory tenable windowed system like microsoft windows multiple applications would want write subwindows concurrently byte december 1983 discussed microsoft plans system output graphics printers monitors code forthcoming first release windows introduction windows xp gdi complemented c++-based gdi+ subsystem gdi+ adds anti-aliased 2d graphics floating point coordinates gradient shading complex path management intrinsic support modern graphics-file formats like jpeg png support composition affine transformations 2d view pipeline gdi+ uses argb values represent color use features apparent windows xp user interface several applications microsoft paint windows picture fax viewer photo printing wizard pictures slideshow screensaver presence basic graphics layer greatly simplifies implementations vector-graphics systems flash svg gdi+ included versions windows windows xp gdi+ dynamic library also shipped application used older versions windows windows 98 windows nt 4.0 onwards additional text processing resolution independence capabilities gdi+ text rendering performed cpu nearly order magnitude slower hardware accelerated gdi chris jackson published tests indicating piece text rendering code written could render 99,000 glyphs per second gdi code using gdi+ rendered 16,600 glyphs per second microsoft .net class library provides managed interface gdi+ via codice_1 namespace gdi+ similar purpose structure apple quickdraw gx subsystem open-source libart cairo libraries windows vista windows applications including gdi gdi+ applications run new compositing engine desktop window manager dwm built atop windows display driver model gdi rendering implemented canonical display driver cdd.dll draws system memory surfaces redirected dwm gdi longer hardware-accelerated video card driver however due nature desktop composition internal management moving bitmaps transparency anti-aliasing gdi+ handled dwm core operations like window moves faster responsive underlying content need re-rendered application windows 7 includes gdi hardware acceleration blitting operations windows display driver model v1.1 improves gdi performance canonical display driver allows dwm engine use local video memory compositing thereby reducing system memory footprint increasing performance graphics operations primitive gdi operations still hardware-accelerated unlike direct2d november 2009 amd nvidia released wddm v1.1 compatible video drivers gdi+ continues rely software rendering windows 7 gdi printer winprinter analogous winmodem printer designed accept output host computer running gdi windows host computer print processing gdi software renders page bitmap sent software printer driver usually supplied printer manufacturer processing particular printer printer combination gdi driver bidirectional receive information printer whether ready print paper ink non-gdi printers require hardware firmware memory page rendering gdi printer uses host computer making cheaper manufacture similar non-gdi printer manufacturers produce essentially printer version compatible printer control language pcl postscript cheaper gdi-only version cases lowest-cost models given manufacturer range support gdi printer control language accept input device suitable driver gdi printer requires pc running windows compatible hardware operating systems general gdi printers compatible hardware print servers although servers built-in processing capability making compatible specified gdi printers gdi printers made available computers network connected shared printers computer running windows generic gdi drivers pnm2ppa written make gdi printers compatible non-windows operating systems freebsd guarantee particular gdi printer supported order allow simpler creation drivers winprinters microsoft universal printer driver created allows printer vendors write generic printer description gpd minidrivers describe printer capabilities command set plaintext rather kernel mode driver development time window opened consumes gdi objects complexity window increases additional features buttons images gdi object usage also increases many objects use windows unable draw gdi objects leading misbehaving software frozen unresponsive program operation many applications also incorrectly coded fail release gdi objects use adds problem total available gdi objects varies one version windows next windows 95 98 millennium limit 1,200 total objects windows 2000 limit 16,384 objects windows xp vista windows 7 configurable limit via registry defaults 10,000 objects per process theoretical maximum 65,536 entire session windows 8 8.1 increase gdi object limit 65,536 per user logon session earlier versions windows windows 3.1 windows 98 included resource meter program allow user monitor much total system gdi resources use unfortunately resource meter consumed gdi objects later versions windows 2000 windows xp report gdi object usage program task manager tell user total gdi capacity available overflowing gdi capacity affect windows preventing new windows opening menus displaying alert boxes appearing situation difficult clear potentially require forced hard-reset system since prevents core system programs functioning windows 8 8.1 forced logoffs occur result gdi capacity overflow instead hard reboot example forcing frozen process end using task manager normally makes sure alert window appear free gdi windows beeps error alert choice appear gdi-overflowing processes terminated unless user uses taskkill command direct2d directwrite designed replace gdi/gdi+ uniscribe respectively screen-oriented rendering shipped windows 7 windows server 2008 r2 well windows vista windows server 2008 platform update installed wpf/uwp based-application win2d gdi like class library developed microsoft downloaded inside visual studio using nuget win2d easy-to-use windows runtime api immediate mode 2d graphics rendering gpu acceleration", + "neighbors": [ + 26, + 28, + 66, + 79, + 93, + 108, + 111, + 148, + 153, + 225, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 395, + 412, + 433, + 435, + 472, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 705, + 791, + 801, + 815, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1068, + 1092, + 1098, + 1109, + 1151, + 1177, + 1188, + 1212, + 1233, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1428, + 1461, + 1502, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 690, + "label": 9, + "text": "Maple_(software):maple software maple symbolic numeric computing environment also multi-paradigm programming language developed maplesoft maple also covers aspects technical computing including visualization data analysis matrix computation connectivity toolbox maplesim adds functionality multidomain physical modeling code generation users enter mathematics traditional mathematical notation custom user interfaces also created support numeric computations arbitrary precision well symbolic computation visualization examples symbolic computations given maple incorporates dynamically typed imperative-style programming language resembles pascal language permits variables lexical scope also interfaces languages c c fortran java matlab visual basic also interface excel maple supports mathml 2.0 w3c format representing interpreting mathematical expressions including display web pages maple based small kernel written c provides maple language functionality provided libraries come variety sources libraries written maple language viewable source code many numerical computations performed nag numerical libraries atlas libraries gmp libraries different functionality maple requires numerical data different formats symbolic expressions stored memory directed acyclic graphs standard interface calculator interface written java first concept maple arose meeting november 1980 university waterloo researchers university wished purchase computer powerful enough run macsyma instead decided would develop computer algebra system would able run lower cost computers first limited version appearing december 1980 maple demonstrated first conferences beginning 1982 name reference maple canadian heritage end 1983 50 universities copies maple installed machines 1984 research group arranged watcom products inc license distribute first commercially available version maple 3.3 1988 waterloo maple inc. founded company \u2019 original goal manage distribution software eventually company evolved r department maple development done today rest done university research labs worldwide including symbolic computation laboratory university waterloo ontario research centre computer algebra university western ontario 1989 first graphical user interface maple developed included version 4.3 macintosh x11 windows versions new interface followed 1990 maple v. 1992 maple v release 2 introduced maple worksheet combined text graphics input typeset output 1994 special issue newsletter created maple developers called mapletech published 1999 release maple 6 maple included nag numerical libraries 2003 current standard interface introduced maple 9 interface primarily written java although portions rules typesetting mathematical formulae written maple language java interface criticized slow improvements made later versions although maple 11 documentation recommends previous classic interface users less 500 mb physical memory mid 1995 2005 maple lost significant market share competitors due weaker user interface 2005 maple 10 introduced new document mode part standard interface developed following years september 2009 maple maplesoft acquired japanese software retailer cybernet systems features maple include sample imperative programming constructs simple functions also defined using maps arrow notation find answer compute determinant matrix series tanh x x=0,15 high order polynomial equation plot x*sin x x=-10..10 plot3d x^2+y^2 x=-1..1 y=-1..1 plots -animate subs k .5 f x=-30..30 t=-10..10 numpoints=200 frames=50 color=red thickness=3 plots -animate3d cos t*x *sin 3*t*y x=-pi..pi y=-pi..pi t=1..2 matrix 400,400,200 100,100 -400 1,1,1 datatype=float 8 plot3d 1 x=0..2*pi y=0..pi axes=none coords=spherical viewpoint= path=m f 1+a*t+b*t^2 *exp c*t find functions formula_17 satisfy integral equation maple engine used within several products maplesoft listed third-party commercial products longer use maple engine", + "neighbors": [ + 134, + 152, + 306, + 509, + 521, + 579, + 684, + 766, + 796, + 806, + 820, + 824, + 825, + 873, + 948, + 961, + 985, + 1006, + 1028, + 1059, + 1209, + 1221, + 1225, + 1227, + 1324, + 1418, + 1477 + ], + "mask": "Validation" + }, + { + "node_id": 691, + "label": 9, + "text": "Richard_Wexelblat:richard wexelblat richard l. wexelblat aka dick wexelblat american artisanal woodturner former computer scientist wexelblat received bsee msee cs ph.d. cs moore school electrical engineering university pennsylvania 6/1959 6/1961 12/1965 respectively doctorate believed many reported acm first ever awarded formally recognized computer science department note first cs doctorate first awarded cs department andy van dam share distinction completed cs dissertation essentially time left computer field become artisanal woodturner said originator wexelblat scheduling algorithm choose two good fast cheap stated bob rosin said originated 'm sure also credited first refer occam razor 'the law least astonishment sons alan david brother paul also computer scientists although paul mostly retired david halfway law school", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 692, + "label": 4, + "text": "Man-in-the-middle_attack:man-in-the-middle attack cryptography computer security man-in-the-middle attack mitm attack attacker secretly relays possibly alters communications two parties believe directly communicating one example mitm attack active eavesdropping attacker makes independent connections victims relays messages make believe talking directly private connection fact entire conversation controlled attacker attacker must able intercept relevant messages passing two victims inject new ones straightforward many circumstances example attacker within reception range unencrypted wireless access point wi-fi could insert man-in-the-middle aims circumvent mutual authentication mitm attack succeed attacker impersonates endpoint sufficiently well satisfy expectations cryptographic protocols include form endpoint authentication specifically prevent mitm attacks example tls authenticate one parties using mutually trusted certificate authority suppose alice wishes communicate bob meanwhile mallory wishes intercept conversation eavesdrop optionally deliver false message bob first alice asks bob public key bob sends public key alice mallory able intercept mitm attack begin mallory sends alice forged message appears originate bob instead includes mallory public key alice believing public key bob encrypts message mallory key sends enciphered message back bob mallory intercepts deciphers message using private key possibly alters wants re-enciphers using public key intercepted bob originally tried send alice bob receives newly enciphered message believes came alice example shows need alice bob way ensure truly using public keys rather public key attacker otherwise attacks generally possible principle message sent using public-key technology variety techniques help defend mitm attacks mitm attacks prevented detected two means authentication tamper detection authentication provides degree certainty given message come legitimate source tamper detection merely shows evidence message may altered cryptographic systems secure mitm attacks provide method authentication messages require exchange information public keys addition message secure channel protocols often using key-agreement protocols developed different security requirements secure channel though attempted remove requirement secure channel public key infrastructure transport layer security may harden transmission control protocol mitm attacks structures clients servers exchange certificates issued verified trusted third party called certificate authority ca original key authenticate ca subject mitm attack certificates issued ca may used authenticate messages sent owner certificate use mutual authentication server client validate communication covers ends mitm attack though default behavior connections authenticate server attestments verbal communications shared value zrtp recorded attestments audio/visual recordings public key hash used ward mitm attacks visual media much difficult time-consuming imitate simple data packet communication however methods require human loop order successfully initiate transaction corporate environment successful authentication indicated browser green padlock always imply secure connection remote server corporate security policies might contemplate addition custom certificates workstations web browsers order able inspect encrypted traffic consequence green padlock indicate client successfully authenticated remote server corporate server/proxy used ssl/tls inspection http public key pinning hpkp sometimes called certificate pinning helps prevent mitm attack certificate authority compromised server provide list pinned public key hashes first transaction subsequent transactions require one keys list must used server order authenticate transaction dnssec extends dns protocol use signatures authenticate dns records preventing simple mitm attacks directing client malicious ip address latency examination potentially detect attack certain situations long calculations lead tens seconds like hash functions detect potential attacks parties check discrepancies response times example say two parties normally take certain amount time perform particular transaction one transaction however take abnormal length time reach party could indicative third party interference inserting additional latency transaction quantum cryptography theory provides tamper-evidence transactions no-cloning theorem protocols based quantum cryptography typically authenticate part classical communication unconditionally secure authentication scheme e.g wegman-carter authentication captured network traffic suspected attack analyzed order determine whether attack determine source attack important evidence analyze performing network forensics suspected attack includes notable non-cryptographic mitm attack perpetrated belkin wireless network router 2003 periodically would take http connection routed would fail pass traffic destination instead responded intended server reply sent place web page user requested advertisement another belkin product outcry technically literate users 'feature removed later versions router firmware 2011 security breach dutch certificate authority diginotar resulted fraudulent issuing certificates subsequently fraudulent certificates used perform mitm attacks 2013 nokia xpress browser revealed decrypting https traffic nokia proxy servers giving company clear text access customers encrypted browser traffic nokia responded saying content stored permanently company organizational technical measures prevent access private information 2017 equifax withdrew mobile phone apps following concern mitm vulnerabilities notable real-life implementations include following", + "neighbors": [ + 11, + 14, + 43, + 74, + 88, + 149, + 172, + 190, + 235, + 261, + 289, + 293, + 319, + 342, + 364, + 379, + 414, + 418, + 439, + 444, + 450, + 487, + 528, + 531, + 533, + 539, + 554, + 564, + 576, + 598, + 608, + 624, + 625, + 678, + 684, + 739, + 746, + 762, + 764, + 818, + 826, + 856, + 964, + 977, + 1003, + 1089, + 1090, + 1121, + 1240, + 1309, + 1325, + 1331, + 1379, + 1444, + 1452, + 1453, + 1534, + 1552, + 1570, + 1576, + 1585, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 693, + "label": 9, + "text": "Shriram_Krishnamurthi:shriram krishnamurthi shriram krishnamurthi computer scientist currently professor computer science brown university member core development group racket programming languages responsible creation software packages including debugger frtime package networking library since 2006 krishnamurthi leading contributor bootstrap curriculum project integrate computer science education grades 6\u201312 krishnamurthi received phd rice university 2000 direction matthias felleisen dissertation linguistic reuse macro systems presence first-class modules starting topic krishnamurthi moved software engineering working topics access control modularization verification web-based interactive programming recent effort novel time-oriented programming language called flapjax support asynchronous web programming krishnamurthi also authored textbook programming language design 2012 krishnamurthi became inaugural winner robin milner young researcher award given sigplan researcher whose research career began within 20 years nomination date award citation describes krishnamurthi prolific researcher brings programming language theory bear many disciplines thus exposing foundational value", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 828, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 694, + "label": 2, + "text": "Partitioning_Communication_System:partitioning communication system partitioning communication system computer communications security architecture based information flow separation policy pcs extends four foundational security policies mils multiple independent levels security software architecture network pcs leverages software separation enable application layer entities enforce manage control application layer security policies manner application layer security policies result communications architecture allows software separation kernel pcs share responsibility security application pcs invented ois ois collaborated extensively requirements pcs", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 695, + "label": 3, + "text": "Bodhi_Linux:bodhi linux bodhi linux lightweight linux distribution based ubuntu uses moksha window manager philosophy distribution provide minimal base system users populate software want thus default includes software essential linux users including file browser pcmanfm web browser midori terminal emulator terminology include software features developers deem unnecessary make populating systems software easy bodhi linux developers maintain online database lightweight software installed one click via apturl addition standard version bodhi linux intel-compatible processors alpha release version tablet devices arm processors based debian tablet device version bodhi officially supported anymore amount time needed keep date package image updates rarely made future system requirements include 256 mb ram 4 gb hard disk space 500 mhz processor 32 bit processors without pae capability supported terms pae-enabled ones difference bodhi versions older kernel used using enlightenment dr17-based fork called moksha desktop bodhi provides rich desktop effects animations require high end computer hardware rationale forking project dr17 due established performance functionality e19 possessed optimizations break existing features users enjoy use per jeff hoogland statement enlightenment window manager well tools developed specifically bodhi linux written c programming language python bodhi linux derived ubuntu long term support releases 14.04 16.04 18.04 ... support follows pattern security bug fixes released daily basis throughout five-year period opposed ubuntu bodhi short term support installed bodhi linux upgraded latest state via command line package manager releases numbered x.y.z major release x.y.z e.g version 2.y.z 3.0.0 follows ubuntu long term support delay months goal deliver new major release july every year following new ubuntu lts expected april new functionality added release bodhi linux 3.0.0 branch released february 2015 additional legacy version older hardware update/point release x.y.z e.g version 2.3.z 2.4.0 similar point releases ubuntu 12.04.1 12.04.2 ... frequent used delivering new software versions improvements related security beginning version 2.4.0 update frequency reduced three times year every four months january may september new update come bodhi linux 2.4.0 planned release august 2013 appeared little late mid-september ready bug fix release x.y.z e.g version 2.4.0 2.4.1 meant correcting errors default configuration r_pi bodhi linux build built directly top raspbian incorporates changes improvements produce optimized \u2033hard float\u2033 code raspberry pi armhf arm hf technically r_pi bodhi linux built compilation settings adjusted produce optimized \u2033hard float\u2033 code raspberry pi armhf arm hf hard float application binary interface arm11 32-bit risc microprocessor arm architecture armv6 architectural additions provides enormous performance gains many use cases however required significant effort port elements debian wheezy armv6 cpu official builds require armv7 significantly enhance performance applications make heavy use floating point arithmetic operations previous less efficient soft float settings native armv6 architecture floating point arithmetic operations simulated software effort build working release armhf release officially supported anymore moment jack germain linuxinsider wrote positive review bodhi linux 5.0.0 noting bodhi linux elegant lightweight distribution productive computing platform", + "neighbors": [ + 112, + 113, + 134, + 301, + 351, + 357, + 393, + 404, + 431, + 716, + 754, + 897, + 974, + 1046, + 1049, + 1055, + 1126, + 1167, + 1225, + 1276, + 1286, + 1369, + 1415, + 1458, + 1539, + 1601 + ], + "mask": "Validation" + }, + { + "node_id": 696, + "label": 2, + "text": "HomeKit:homekit homekit software framework apple lets users set ios device configure communicate control smart-home appliances designing rooms items actions homekit service users enable automatic actions house simple voice dictation siri apps homekit first released ios 8 september 2014 homekit support also included macos mojave used devices siri manufacturers homekit-enabled devices required mfi program homekit products required encryption co-processor later changed ios 11 added support software authentication equipment manufactured without homekit support enabled use gateway product hub connects devices homekit service", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 214, + 228, + 252, + 269, + 345, + 356, + 394, + 395, + 403, + 477, + 489, + 511, + 528, + 551, + 596, + 607, + 610, + 625, + 634, + 797, + 810, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1189, + 1237, + 1262, + 1292, + 1305, + 1322, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 697, + "label": 4, + "text": "Zeobit:zeobit zeobit llc stylized zeobit technology software company formed 2009 ceo slava kolomiychuk located sunnyvale california company specialized computer security software internet security december 2016 longer business zeobit best known bundled utility software mackeeper software received mixed reviews reviewers divided effectiveness product zeobit llc incorporated september 2009 us state california slava kolomiychuk zeobit management headquarters sunnyvale california partnership offices europe asia house developers customer support march 2010 first product mackeeper macos released september 2010 pckeeper microsoft windows released may 13 2010 first beta version mackeeper version 0.8 released october 4 2010 pckeeper mackeeper equivalent windows pcs version 1.1.48 released october 26 2010 zeobit released mackeeper 1.0 january 30 2012 mackeeper 2.0 released updates security data control cleaning optimization 2014 pennsylvania woman filed class action lawsuit zeobit llc claiming company computer security program identifies problems n't exist generates false error messages scare users purchasing upgrade see holly yencha et al v. zeobit llc case 2:13-cv-00578 u.s. district court western district pennsylvania according complaint filed us district court installed mackeeper prompts user conduct diagnostic scan mackeeper class action lawsuit says scan purportedly detects errors lead problems identified zeobit marketing materials i.e. performance issues security privacy threats \u2014problems mackeeper supposedly designed fix however zeobit class action lawsuit alleges diagnostic scan completed mackeeper reports identified thousands issues cause computer critical condition trial version mackeeper purports fix limited number issues customers encouraged purchase full registered version security software fully repair computer yencha alleges neither free trial full versions mackeeper perform reliable diagnostic testing computer instead zeobit intentionally designed mackeeper invariably ominously report user mac needs repair at-risk due harmful fabricated errors privacy threats computer problems regardless computer actual condition class action lawsuit alleges class action settled 2015 admission wrongdoing customers given refunds mackeeper utility software macos claims provide tools security cleaning optimization data control mackeeper zeobit official sponsors macworld iworld expo san francisco california 2011 2012 acquired kromtech alliance corp may 2013 mackeeper often criticized unethical marketing tactics including pop-up advertising buying domain names similar names antivirus programs zeobit claims affiliates responsible advertising accused unethical mackeeper sometimes referred potentially unwanted program detected antivirus programs pckeeper bundle important system utilities performing different tasks p\u0441 antivirus data control optimization tools drive clean-up utilities much according virus bulletin pckeeper scored 91.9 rap test listed number 6 antivirus world acquired kromtech alliance corp may 2013 zeodisk project cloud storage solution also integrated existing zeobit products 2011 zeobit partnered avira integrate virus database technology mackeeper pckeeper internet security features partnership allowed zeobit offer internet security options macos windows linux freebsd openbsd solaris computing platforms zeobit member better business bureau f rating due complaints advertising quality products zeobit microsoft silver certified developer zeobit official opswat partner", + "neighbors": [ + 134, + 384, + 961 + ], + "mask": "Test" + }, + { + "node_id": 698, + "label": 4, + "text": "Runtime_application_self-protection:runtime application self-protection runtime application self-protection rasp security technology uses runtime instrumentation detect block computer attacks taking advantage information inside running software technology differs perimeter-based protections firewalls detect block attacks using network information without contextual awareness rasp technology said improve security software monitoring inputs blocking could allow attacks protecting runtime environment unwanted changes tampering rasp-protected applications rely less external devices like firewalls provide runtime security protection threat detected rasp prevent exploitation possibly take actions including terminating user session shutting application alerting security personnel sending warning user rasp aims close gap left application security testing network perimeter controls neither enough insight real-time data event flows either prevent vulnerabilities slipping review process block new threats unforeseen development rasp integrated framework module runs conjunction program codes libraries system calls technology also implemented virtualization application security solutions rasp technology used conjunction dynamic application security testing dast technology create interactive application security testing security product rasp solutions deployed two different ways monitor protection mode monitor mode rasp solution reports web application attacks block attack protection mode rasp solution reports blocks web application attacks", + "neighbors": [ + 11, + 144, + 149, + 293, + 310, + 338, + 379, + 439, + 479, + 518, + 528, + 576, + 703, + 739, + 740, + 750, + 762, + 800, + 898, + 1039, + 1090, + 1112, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1472, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 699, + "label": 0, + "text": "Bibliotheca_Polyglotta:bibliotheca polyglotta bibliotheca polyglotta norwegian database multilingualism project french language science per global history university oslo aim project according pages producing web corpus buddhist texts using multilingual lexicography generally texts used study sanskrit chinese tibetan", + "neighbors": [ + 429 + ], + "mask": "Test" + }, + { + "node_id": 700, + "label": 5, + "text": "IBM_1009:ibm 1009 ibm 1009 data transmission unit ibm communications controller introduced 1960 1009 used synchronous transmit-receive str protocol transfer data 150 characters per second cps single point-to-point dial leased telephone line system advertised able link magnetic core memories ibm 1401 computers telephone lines 1009 attached ibm 1400 series computers 1401 1961 transmission rate doubled 300 cps 1962 1009 part test data communications using telstar satellite link two 1401 computer systems", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 701, + "label": 4, + "text": "Cybercrime:cybercrime cybercrime computer-oriented crime crime involves computer network computer may used commission crime may target cybercrimes defined offences committed individuals groups individuals criminal motive intentionally harm reputation victim cause physical mental harm loss victim directly indirectly using modern telecommunication networks internet networks including chat rooms emails notice boards groups mobile phones bluetooth/sms/mms cybercrime may threaten person nation security financial health issues surrounding types crimes become high-profile particularly surrounding hacking copyright infringement unwarranted mass-surveillance sextortion child pornography child grooming also problems privacy confidential information intercepted disclosed lawfully otherwise debarati halder k. jaishankar define cybercrime perspective gender defined 'cybercrime women crimes targeted women motive intentionally harm victim psychologically physically using modern telecommunication networks internet mobile phones internationally governmental non-state actors engage cybercrimes including espionage financial theft cross-border crimes cybercrimes crossing international borders involving actions least one nation-state sometimes referred cyberwarfare report sponsored mcafee published 2014 estimated annual damage global economy 445 billion approximately 1.5 billion lost 2012 online credit debit card fraud us 2018 study center strategic international studies csis partnership mcafee concludes close 600 billion nearly one percent global gdp lost cybercrime year computer crime encompasses broad range activities computer fraud dishonest misrepresentation fact intended let another refrain something causes loss context fraud result obtaining benefit forms fraud may facilitated using computer systems including bank fraud carding identity theft extortion theft classified information types crime often result loss private information monetary information government officials information technology security specialists documented significant increase internet problems server scans since early 2001 growing concern among government agencies federal bureau investigations fbi central intelligence agency cia intrusions part organized effort cyberterrorists foreign intelligence services groups map potential security holes critical systems cyberterrorist someone intimidates coerces government organization advance political social objectives launching computer-based attack computers networks information stored cyberterrorism general defined act terrorism committed use cyberspace computer resources parker 1983 simple propaganda piece internet bomb attacks holidays considered cyberterrorism also hacking activities directed towards individuals families organized groups within networks tending cause fear among people demonstrate power collecting information relevant ruining peoples lives robberies blackmailing etc cyberextortion occurs website e-mail server computer system subjected threatened repeated denial service attacks malicious hackers hackers demand money return promising stop attacks offer protection according federal bureau investigation cybercrime extortionists increasingly attacking corporate websites networks crippling ability operate demanding payments restore service 20 cases reported month fbi many go unreported order keep victim name public domain perpetrators typically use distributed denial-of-service attack however cyberextortion techniques exist doxing extortion bug poaching example cyberextortion attack sony pictures 2014 u.s. department defense dod notes cyberspace emerged national-level concern several recent events geostrategic significance among included attack estonia infrastructure 2007 allegedly russian hackers august 2008 russia allegedly conducted cyber attacks time coordinated synchronized kinetic non-kinetic campaign country georgia december 2015 ukraine power grid cyberattack also attributed russia considered first successful cyber attack power grid fearing attacks may become norm future warfare among nation-states concept cyberspace operations impacts adapted warfighting military commanders future crimes committed selected group criminals unlike crimes using computer tool crimes require technical knowledge perpetrators technology evolves nature crime crimes relatively new existence long computers have\u2014which explains unprepared society world general towards combating crimes numerous crimes nature committed daily internet crimes primarily target computer networks devices include individual main target cybercrime computer considered tool rather target crimes generally involve less technical expertise human weaknesses generally exploited damage dealt largely psychological intangible making legal action variants difficult crimes existed centuries offline world scams theft likes existed even development high-tech equipment criminal simply given tool increases potential pool victims makes harder trace apprehend crimes use computer networks devices advance ends include unsolicited sending bulk email commercial purposes spam unlawful jurisdictions phishing mostly propagated via email phishing emails may contain links websites affected malware may contain links fake online banking websites used steal private account information content websites electronic communications may distasteful obscene offensive variety reasons instances communications may illegal extent communications unlawful varies greatly countries even within nations sensitive area courts become involved arbitrating groups strong beliefs one area internet pornography target strongest efforts curtailment child pornography illegal jurisdictions world whereas content may offensive non-specific way harassment directs obscenities derogatory comments specific individuals focusing example gender race religion nationality sexual orientation often occurs chat rooms newsgroups sending hate e-mail interested parties harassment internet also includes revenge porn instances committing crime using computer lead enhanced sentence example case united states v. neil scott kramer kramer served enhanced sentence according u.s sentencing guidelines manual \u00a72g1.3 b 3 use cell phone persuade induce entice coerce facilitate travel minor engage prohibited sexual conduct kramer argued claim insufficient charge included persuading computer device cellular phone technically computer although kramer tried argue point u.s sentencing guidelines manual states term computer means electronic magnetic optical electrochemically high-speed data processing device performing logical arithmetic storage functions includes data storage facility communications facility directly related operating conjunction device connecticut u.s. state pass statute making criminal offense harass someone computer michigan arizona virginia south carolina also passed laws banning harassment electronic means harassment defined u.s. computer statutes typically distinct cyberbullying former usually relates person use computer computer network communicate obscene vulgar profane lewd lascivious indecent language make suggestion proposal obscene nature threaten illegal immoral act latter need involve anything sexual nature although freedom speech protected law democratic societies us done first amendment include types speech fact spoken written true threat speech/text criminalized intent harm intimidate also applies online type network related threats written text speech us supreme court definition true threat statements speaker means communicate serious expression intent commit act unlawful violence particular individual group darknet markets used buy sell recreational drugs online drug traffickers use encrypted messaging tools communicate drug mules dark web site silk road major online marketplace drugs shut law enforcement reopened new management shut law enforcement silk road 2.0 went silk road 3 reloaded emerged however older marketplace named diabolus market used name exposure brand previous success broad diffusion cybercriminal activities issue computer crimes detection prosecution according jean-loup richet associate professor sorbonne business school technical expertise accessibility longer act barriers entry cybercrime indeed hacking much less complex years ago hacking communities greatly diffused knowledge internet blogs communities hugely contributed information sharing beginners could benefit older hackers knowledge advice furthermore hacking cheaper ever cloud computing era order spam scam one needed dedicated server skills server management network configuration maintenance knowledge internet service provider standards etc comparison mail software-as-a-service scalable inexpensive bulk transactional e-mail-sending service marketing purposes could easily set spam jean-loup richet explains cloud computing could helpful cybercriminal way leverage attack \u2013 brute-forcing password improve reach botnet facilitating spamming campaign computer source evidence see digital forensics even computer directly used criminal purposes may contain records value criminal investigators form logfile countries internet service providers required law keep logfiles predetermined amount time example european wide data retention directive applicable eu member states states e-mail traffic retained minimum 12 months method cybercrime investigation many ways cybercrime take place investigations tend start ip address trace however necessarily factual basis upon detectives solve case different types high-tech crime may also include elements low-tech crime vice versa making cybercrime investigators indispensable part modern law enforcement method cybercrime detective work dynamic constantly improving whether closed police units international cooperation framework due easily exploitable laws cybercriminals use developing countries order evade detection prosecution law enforcement developing countries philippines laws cybercrime weak sometimes nonexistent weak laws allow cybercriminals strike international borders remain undetected even identified criminals avoid punished extradited country united states developed laws allow prosecution proves difficult cases agencies fbi used deception subterfuge catch criminals example two russian hackers evading fbi time fbi set fake computing company based seattle washington proceeded lure two russian men united states offering work company upon completion interview suspects arrested outside building clever tricks like sometimes necessary part catching cybercriminals weak legislation makes impossible otherwise then-president barack obama released executive order april 2015 combat cybercrime executive order allows united states freeze assets convicted cybercriminals block economic activity within united states first solid legislation combats cybercrime way european union adopted directive 2013/40/eu offences directive definitions procedural institutions also council europe convention cybercrime.. usa european union introducing new measures cybercrime 31 may 2017 china announced new cybersecurity law takes effect date penalties computer-related crimes new york state range fine short period jail time class misdemeanor unauthorized use computer computer tampering first degree class c felony carry 3 15 years prison however hackers hired information security experts private companies due inside knowledge computer crime phenomenon theoretically could create perverse incentives possible counter courts ban convicted hackers using internet computers even released prisonthough computers internet become central everyday life type punishment may viewed harsh draconian however nuanced approaches developed manage cyber offenders behavior without resorting total computer internet bans approaches involve restricting individuals specific devices subject computer monitoring computer searches probation parole officers technology advances people rely internet store sensitive information banking credit card information criminals increasingly attempt steal information cybercrime becoming threat people across world raising awareness information protected tactics criminals use steal information continues grow importance according fbi internet crime complaint center 2014 269,422 complaints filed claims combined reported total loss 800,492,073 cybercrime yet seem average person radar 1.5 million cyber-attacks annually means 4,000 attacks day 170 attacks every hour nearly three attacks every minute studies showing us 16 victims asked people carrying attacks stop anybody uses internet reason victim important aware one protected online cybercrime proliferated professional ecosystem evolved support individuals groups seeking profit cybercriminal activities ecosystem become quite specialized including malware developers botnet operators professional cybercrime groups groups specializing sale stolen content forth leading cybersecurity companies skills resources visibility follow activities individuals group wide variety information available sources used defensive purposes including technical indicators hashes infected files malicious ips/urls well strategic information profiling goals techniques campaigns profiled groups freely published consistent on-going access typically requires subscribing adversary intelligence subscription service level individual threat actor threat intelligence often referred actor ttp tactics techniques procedures infrastructure tools technical indicators often trivial attackers change corporate sectors considering crucial role artificial intelligence cybersecurity", + "neighbors": [ + 14, + 120, + 285, + 293, + 363, + 379, + 608, + 611, + 703, + 800, + 818, + 852, + 1015, + 1171, + 1246, + 1358, + 1368 + ], + "mask": "Test" + }, + { + "node_id": 702, + "label": 3, + "text": "Pachicom:pachicom game pachinko hugely popular japan since involves playing pinball element slot machines mixed along gambling four different gameplay modes choose two assign player pachinko machine two allow players choose machine game based standard pachinko rules replicating experience playing pachinko parlor game board layout nails sticking metal balls would either fall holes created pegs order traverse board certain compartments added board metal ball find way one compartments player receive points similar credits slot machine players expect lose ball point falls bottom board similar falling bottomless pit action game initially player starts one hundred balls points mode clock goes forward 000000 seconds reaches 999999 seconds equivalent either 16666.65 non-real time minutes 2777.775 non-real time hours 115.740625 non-real time days occurs game remaining points stored top three score list mode b except clock goes backwards 999999 seconds way back 000000 seconds easy mash button repeatedly around direction pad right order accumulate mass winnings pachinko games cheat system hidden message famicom version found hex editor almost five percent entire rom 2.05 kilobytes 41 kilobyte rom image taken otherwise inaccessible message message written romaji features lengthy rant towards game executives harshly criticizing forcing changes fly particularly sound effects even showing replace initially intended sounds much shorter rant presumably written person also romaji accessed via hex editor included msx release", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 703, + "label": 4, + "text": "Security_hacker:security hacker security hacker someone explores methods breaching defenses exploiting weaknesses computer system network hackers may motivated multitude reasons profit protest information gathering challenge recreation evaluate system weaknesses assist formulating defenses potential hackers subculture evolved around hackers often referred computer underground longstanding controversy surrounds meaning term hacker controversy computer programmers reclaim term hacker arguing refers simply someone advanced understanding computers computer networks cracker appropriate term break computers whether computer criminals black hats computer security experts white hats 2014 article noted ... black-hat meaning still prevails among general public computer security hacker someone focuses security mechanisms computer network systems including endeavor strengthen mechanisms often used mass media popular culture refer seek access despite security measures media portrays 'hacker villain nevertheless parts subculture see aim correcting security problems use word positive sense white hat name given ethical computer hackers utilize hacking helpful way white hats becoming necessary part information security field operate code acknowledges breaking people computers bad discovering exploiting security mechanisms breaking computers still interesting activity done ethically legally accordingly term bears strong connotations favorable pejorative depending context subculture around hackers termed network hacker subculture hacker scene computer underground initially developed context phreaking 1960s microcomputer bbs scene 1980s implicated alt.2600 newsgroup 1980 article august issue psychology today commentary philip zimbardo used term hacker title hacker papers excerpt stanford bulletin board discussion addictive nature computer use 1982 film tron kevin flynn jeff bridges describes intentions break encom computer system saying 've little hacking clu software uses 1983 hacking sense breaking computer security already use computer jargon public awareness activities however release film wargames year featuring computer intrusion norad raised public belief computer security hackers especially teenagers could threat national security concern became real year gang teenage hackers milwaukee wisconsin known 414s broke computer systems throughout united states canada including los alamos national laboratory sloan-kettering cancer center security pacific bank case quickly grew media attention 17-year-old neal patrick emerged spokesman gang including cover story newsweek entitled beware hackers play patrick photograph cover newsweek article appears first use word hacker mainstream media pejorative sense pressured media coverage congressman dan glickman called investigation began work new laws computer hacking neal patrick testified u.s. house representatives september 26 1983 dangers computer hacking six bills concerning computer crime introduced house year result laws computer criminality white hat grey hat black hat hackers try distinguish depending legality activities moral conflicts expressed mentor hacker manifesto published 1986 phrack use term hacker meaning computer criminal also advanced title stalking wily hacker article clifford stoll may 1988 issue communications acm later year release robert tappan morris jr. so-called morris worm provoked popular media spread usage popularity stoll book cuckoo egg published one year later entrenched term public consciousness several subgroups computer underground different attitudes use different terms demarcate try exclude specific group agree eric s. raymond author new hacker dictionary advocates members computer underground called crackers yet people see hackers even try include views raymond see wider hacker culture view raymond harshly rejected instead hacker/cracker dichotomy emphasize spectrum different categories white hat grey hat black hat script kiddie contrast raymond usually reserve term cracker malicious activity according ralph d. clifford cracker cracking gain unauthorized access computer order commit another crime destroying information contained system subgroups may also defined legal status activities white hat hacker breaks security non-malicious reasons either test security system perform penetration tests vulnerability assessments client working security company makes security software term generally synonymous ethical hacker ec-council among others developed certifications courseware classes online training covering diverse arena ethical hacking black hat hacker hacker violates computer security little reason beyond maliciousness personal gain moore 2005 term coined richard stallman contrast maliciousness criminal hacker versus spirit playfulness exploration hacker culture ethos white hat hacker performs hacking duties identify places repair means legitimate employment black hat hackers form stereotypical illegal hacking groups often portrayed popular culture epitome public fears computer criminal grey hat hacker lies black hat white hat hacker grey hat hacker may surf internet hack computer system sole purpose notifying administrator system security defect example may offer correct defect fee grey hat hackers sometimes find defect system publish facts world instead group people even though grey hat hackers may necessarily perform hacking personal gain unauthorized access system considered illegal unethical social status among hackers elite used describe skilled newly discovered exploits circulate among hackers elite groups masters deception conferred kind credibility members script kiddie also known skid skiddie unskilled hacker breaks computer systems using automated tools written others usually black hat hackers hence term script i.e computer script automates hacking kiddie i.e kid child\u2014an individual lacking knowledge experience immature usually little understanding underlying concept neophyte newbie noob someone new hacking phreaking almost knowledge experience workings technology hacking blue hat hacker someone outside computer security consulting firms used bug-test system prior launch looking exploits closed microsoft also uses term bluehat represent series security briefing events hacktivist hacker utilizes technology publicize social ideological religious political message hacktivism divided two main groups intelligence agencies cyberwarfare operatives nation states groups hackers carry organized criminal activities profit typical approach attack internet-connected system order several recurring tools trade techniques used computer criminals security experts security exploit prepared application takes advantage known weakness common examples security exploits sql injection cross-site scripting cross-site request forgery abuse security holes may result substandard programming practice exploits would able used file transfer protocol ftp hypertext transfer protocol http php ssh telnet web pages common web site web domain hacking tools procedures computer underground produced specialized slang 1337speak members often advocate freedom information strongly opposing principles copyright well rights free speech privacy writing software performing activities support views referred hacktivism consider illegal cracking ethically justified goals common form website defacement computer underground frequently compared wild west common hackers use aliases conceal identities computer underground supported regular real-world gatherings called hacker conventions hacker cons events include summercon summer def con hohocon christmas shmoocon february blackhat chaos communication congress athcon hacker halted hope local hackfest groups organize compete develop skills send team prominent convention compete group pentesting exploit forensics larger scale hacker groups became popular early 1980s providing access hacking information resources place learn members computer bulletin board systems bbss utopias provided platforms information-sharing via dial-up modem hackers could also gain credibility affiliated elite groups maximum imprisonment one year fine fourth category commonly known computer fraud abuse act prohibits unauthorized access damage protected computers protected computers defined maximum imprisonment fine violations computer fraud abuse act depends severity violation offender history violations act notable hacker-oriented print publications phrack hakin9 information contained hacker magazines ezines often outdated time published enhanced contributors reputations documenting successes hackers often show interest fictional cyberpunk cyberculture literature movies adoption fictional pseudonyms symbols values metaphors works common", + "neighbors": [ + 11, + 14, + 46, + 144, + 149, + 169, + 281, + 293, + 304, + 310, + 343, + 363, + 364, + 379, + 405, + 425, + 439, + 479, + 491, + 518, + 528, + 576, + 577, + 600, + 608, + 655, + 684, + 698, + 701, + 703, + 739, + 740, + 747, + 754, + 762, + 800, + 910, + 993, + 1015, + 1039, + 1045, + 1090, + 1112, + 1129, + 1137, + 1235, + 1250, + 1303, + 1308, + 1325, + 1337, + 1361, + 1368, + 1379, + 1433, + 1452, + 1517, + 1570, + 1585, + 1607 + ], + "mask": "Test" + }, + { + "node_id": 704, + "label": 2, + "text": "Google_Assistant:google assistant google assistant artificial intelligence-powered virtual assistant developed google primarily available mobile smart home devices unlike company previous virtual assistant google google assistant engage two-way conversations assistant initially debuted may 2016 part google messaging app allo voice-activated speaker google home period exclusivity pixel pixel xl smartphones began deployed android devices february 2017 including third-party smartphones android wear wear os released standalone app ios operating system may 2017 alongside announcement software development kit april 2017 assistant extended support large variety devices including cars third party smart home appliances functionality assistant also enhanced third-party developers 2017 google assistant installed 400 million devices users primarily interact google assistant natural voice though keyboard input also supported nature manner google assistant able search internet schedule events alarms adjust hardware settings user device show information user google account google also announced assistant able identify objects gather visual information device camera support purchasing products sending money well identifying songs ces 2018 first assistant-powered smart displays smart speakers video screens announced first one released july 2018 google assistant unveiled google developer conference may 18 2016 part unveiling google home smart speaker new messaging app allo google ceo sundar pichai explained assistant designed conversational two-way experience ambient experience extends across devices later month google assigned google doodle leader ryan germick hired former pixar animator emma coats develop little personality system-level integration outside allo app google home google assistant initially exclusive pixel pixel xl smartphones february 2017 google announced begun enable access assistant android smartphones running android marshmallow nougat beginning select english-speaking markets android tablets receive assistant part rollout assistant also integrated android wear 2.0 included future versions android tv android auto october 2017 google pixelbook became first laptop include google assistant google assistant later came google pixel buds december 2017 google announced assistant would released phones running android lollipop update google play services well tablets running 6.0 marshmallow 7.0 nougat february 2019 google reportedly began testing ads google assistant results may 15 2017 android police reported google assistant would coming ios operating system separate app information confirmed two days later google developer conference january 2018 consumer electronics show first assistant-powered smart displays released smart displays shown event lenovo sony jbl lg devices support google duo video calls youtube videos google maps directions google calendar agenda viewing smart camera footage addition services work google home devices devices based android things google-developed software google unveiled smart display google home hub october 2018 utilizes different system platform december 2016 google launched actions google developer platform google assistant actions google allows 3rd party developers build apps google assistant march 2017 google added new tools developing actions google support creation games google assistant originally limited google home smart speaker actions google made available android ios devices may 2017 time google also introduced app directory overview compatible products services incentivize developers build actions google announced competition first place tickets google 2018 developer conference 10,000 walk-through google campus second place third place received 7,500 5,000 respectively google home april 2017 software development kit sdk released allowing third-party developers build hardware run google assistant integrated raspberry pi cars audi volvo smart home appliances including fridges washers ovens companies including irobot lg general electric d-link google updated sdk december 2017 add several features google home smart speakers google assistant smartphone apps previously supported features include may 2 2018 google announced new program blog focuses investing future google assistant early-stage startups focus build environment developers could build richer experiences users includes startups broaden assistant features building new hardware devices simply differentiating different industries google assistant nature manner google search internet schedule events alarms adjust hardware settings user device show information user google account unlike google however assistant engage two-way conversation using google natural language processing algorithm search results presented card format users tap open page february 2017 google announced users google home would able shop entirely voice products google express shopping service products available whole foods market costco walgreens petsmart bed bath beyond launch retailers added following months new partnerships formed google assistant maintain shopping list previously done within notetaking service google keep feature moved google express google home app april 2017 resulting severe loss functionality may 2017 google announced assistant would support keyboard typed input visual responses support identifying objects gather visual information device camera support purchasing products sending money use keyboard users see history queries made google assistant edit delete previous inputs assistant warns deleting however due use previous inputs generate better answers future november 2017 became possible identify songs currently playing asking assistant.. google assistant allows users activate modify vocal shortcut commands order perform actions device android ipad/iphone configuring hub home automation feature speech recognition available english among languages july 2018 google home version assistant gained support multiple actions triggered single vocal shortcut command annual i/o developers conference may 8 2018 google seo announced addition six new voice options google assistant one john legend made possible wavenet voice synthesizer developed deepmind significantly reduced amount audio samples voice actor required produce creating voice model august 2018 google added bilingual capabilities google assistant existing supported languages devices recent reports say may support multilingual support setting third default language android phone default option google assistant n't support two common features speech recognition transcribed texts like punctuation spelling however beta feature speech-to-text enables en-us language users ask detect insert punctuation transcription results speech-to-text recognize commas question marks periods transcription requests april 2019 popular audio games assistant crystal ball lucky trivia biggest voice change software history voice assistant able add expression games instance crystal ball game voice would speak slow soft intro answer revealed make game excitable lucky trivia game voice would become excitable like game show host british accent voice crystal ball voice would say word 'probably downwards slide like sure games used text speech voice makes voice robotic may 2019 however turned bug speech api caused games lose studio quality voices audio games fixed may 20th 2019 may 2018 google revealed duplex extension google assistant allows carry natural conversations mimicking human voice manner dissimilar robocalling assistant autonomously complete tasks calling hair salon book appointment scheduling restaurant reservation calling businesses verify holiday store hours duplex complete tasks fully autonomously able recognize situations unable complete signal human operator finish task duplex created speak natural voice language incorporating speech disfluencies filler words like hmm uh using common phrases mhm gotcha along human-like intonation response latency duplex currently development limited release late 2018 google pixel users limited release pixel phone users atlanta new york phoenix san francisco able use duplex make restaurant reservations announcement concerns made ethical societal questions artificial intelligence technology duplex raises instance human operators may notice speaking digital robot conversing duplex critics view unethical deceitful concerns privacy also identified conversations duplex recorded order virtual assistant analyze respond privacy advocates also raised concerns millions vocal samples gathered consumers fed back algorithms virtual assistants making forms ai smarter use though features individualize user experience critics unsure long term implications giving company unprecedented access human patterns preferences crucial next phase artificial intelligence could potentially lead ai outsmarting creators transparency referred key part experience technology revealed google later clarified statement saying designing feature disclosure built-in 'll make sure system appropriately identified google added certain jurisdictions assistant would inform end phone call recorded pc world mark hachman gave favorable review google assistant saying step cortana siri digital trends called smarter google ever july 2019 belgian public broadcaster vrt nws published article revealing 3rd party contractors paid transcribe audio clips collected google assistant listened sensitive information users sensitive data collected google home devices android phones included names addresses private conversations business calls bedroom conversations 1000 recordings analysed 153 recorded without \u2018 okay google \u2019 command google officially acknowledged 0.2 recordings listened language experts improve google services august 1 2019 germany \u2019 hamburg commissioner data protection freedom information initiated administrative procedure prohibit google carrying corresponding evaluations employees third parties period three months provisionally protect rights privacy data subjects time citing gdpr google spokesperson stated google paused \u201c language reviews \u201d european countries investigated recent media leaks google assistant new feature google assistant supported languages", + "neighbors": [ + 24, + 41, + 65, + 78, + 113, + 131, + 176, + 182, + 216, + 298, + 339, + 412, + 422, + 480, + 502, + 547, + 553, + 559, + 662, + 671, + 775, + 777, + 837, + 853, + 883, + 936, + 962, + 1061, + 1082, + 1096, + 1129, + 1138, + 1183, + 1185, + 1259, + 1265, + 1292, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1486, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 705, + "label": 2, + "text": "Syskey:syskey sam lock tool better known syskey name executable file discontinued component windows nt encrypts security account manager sam database using 128-bit rc4 encryption key first introduced windows nt 4.0 sp3 removed windows 10 windows server 2016 due use cryptography considered insecure modern standards use part scams form ransomware microsoft officially recommended use bitlocker disk encryption alternative first introduced windows nt 4.0 sp3 syskey intended protect offline password cracking attacks preventing possessor unauthorized copy sam file extracting useful information syskey optionally configured require user enter key boot startup password load key onto removable storage media e.g. floppy disk usb flash drive october 2 2018 microsoft removed syskey.exe future versions windows microsoft recommends use bitlocker similar technologies instead syskey.exe utility december 1999 security team bindview found security hole syskey indicated certain form offline cryptanalytic attack possible making brute force attack appear possible microsoft later issued fix problem dubbed syskey bug bug affected windows nt 4.0 pre-rc3 versions windows 2000 syskey commonly abused tech support scammers lock victims computers order coerce paying ransom", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 289, + 293, + 295, + 312, + 326, + 336, + 344, + 413, + 429, + 433, + 435, + 485, + 521, + 528, + 558, + 574, + 615, + 638, + 647, + 662, + 689, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1212, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 706, + "label": 3, + "text": "Sakhr_Computers:sakhr computers sakhr computers developed kuwaiti company al alamiah produced arabic-language version msx computers 1980s products included msx2 msx2+ yamaha ax100 models latter known sakhr msx ax170 company also first convert basic computer language arabic", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 707, + "label": 2, + "text": "Nokia_N810:nokia n810 nokia n810 internet tablet internet appliance nokia announced 17 october 2007 web 2.0 summit san francisco despite nokia strong association cellular products n810 like preceding tablets produced nokia phone instead allowed user browse internet communicate using wi-fi networks mobile phone via bluetooth built hardware software nokia n800 features added removed nokia n810 featured maemo linux distribution operating system based maemo 4.0 featured microb mozilla-based mobile browser gps navigation application new media player refreshed interface nokia n810 much common n800 internet tablet os 2008 operated significant differences two new features nokia n810 1 april 2008 nokia announced wimax equipped version n810 called n810 wimax edition device identical specifications original n810 included wimax radio use initially sprint xohm network featured color change light gray dark blue black well larger case-back bulge accommodate antenna efficient required bands production wimax edition nokia n810 ended january 2009 n810 like nokia internet tablets ran maemo similar many handheld operating systems provided home screen \u2014 central point applications settings accessed home screen divided areas launching applications menu bar large customisable area could display information rss reader internet radio player google search box example maemo modified version debian gnu/linux n810 bundled several applications including mozilla-based microb browser adobe flash gizmo skype mobile firefox fennec also made available n810 promised make users forget clunky stripped-down mobile web 're used installation added mozilla repository application manager allowing automatic notification updates", + "neighbors": [ + 3, + 21, + 134, + 238, + 253, + 264, + 270, + 309, + 322, + 484, + 527, + 571, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1051, + 1117, + 1138, + 1203, + 1313, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 708, + "label": 4, + "text": "Hacking_Team:hacking team hackingteam milan-based information technology company sells offensive intrusion surveillance capabilities governments law enforcement agencies corporations remote control systems enable governments corporations monitor communications internet users decipher encrypted files emails record skype voice ip communications remotely activate microphones camera target computers company criticized providing capabilities governments poor human rights records though hackingteam states ability disable software used unethically italian government restricted license business countries outside europe hackingteam employs around 40 people italian office subsidiary branches annapolis washington d.c. singapore products use dozens countries across six continents hackingteam founded 2003 two italian entrepreneurs david vincenzetti valeriano bedeschi 2007 company invested two italian vc fondo next innogest milan police department learned company hoping use tool spy italian citizens listen skype calls police contacted vincenzetti asked help hackingteam became first sellers commercial hacking software police \u201d according former employee alberto pelliccione company began security services provider offering penetration testing auditing defensive capabilities clients pelliccione states malware offensive capabilities developed accounted larger percentage revenues organization pivoted offensive direction became increasingly compartmentalized pelliccione claims fellow employees working aspects platform \u2013 example android exploits payloads \u2013 would communicate one another possibly leading tensions strife within organization february 2014 report citizen lab identified organisation using hosting services linode telecom italia rackspace noc4hosts notorious bullet proof hosting company santrex july 5 2015 company suffered major data breach customer data software code internal documents e-mails see \u00a7 2015 data breach april 2nd 2019 hackingteam acquired inthecyber create memento labs hackingteam enables clients perform remote monitoring functions citizens via rcs remote control systems including da vinci galileo platforms hackingteam uses advanced techniques avoid draining cell phone batteries could potentially raise suspicions methods avoid detection malware payloads android blackberry apple ios linux mac os x symbian well microsoft windows windows mobile windows phone class operating systems rcs management platform allows operators remotely deploy exploits payloads targeted systems remotely manage devices compromised exfiltrate data remote analysis hackingteam criticized selling products services governments poor human rights records including sudan bahrain venezuela saudi arabia june 2014 united nations panel monitoring implementation sanctions sudan requested information hackingteam alleged sales software country contravention united nations weapons export bans sudan documents leaked 2015 data breach hackingteam revealed organization sold sudanese national intelligence security service access remote control system software 2012 960,000 euros response united nations panel company responded january 2015 currently selling sudan follow-up exchange hackingteam asserted product controlled weapon request beyond scope panel need disclose previous sales considered confidential business information u.n. disagreed view panel software ideally suited support military electronic intelligence elint operations may potentially fall category 'military ... equipment 'assistance related prohibited items secretary wrote march thus potential use targeting belligerents darfur conflict interest panel fall 2014 italian government abruptly froze hackingteam exports citing human rights concerns lobbying italian officials company temporarily back right sell products abroad july 5 2015 twitter account company compromised unknown individual published announcement data breach hackingteam computer systems initial message read since nothing hide 're publishing e-mails files source code ... provided links 400 gigabytes data including alleged internal e-mails invoices source code leaked via bittorrent mega announcement data breach including link bittorrent seed retweeted wikileaks many others social media material voluminous early analysis appeared reveal hackingteam invoiced lebanese army sudan spy tools also sold bahrain kazakhstan hackingteam previously claimed never done business sudan leaked data revealed zero-day cross-platform flash exploit cve number cve-2015-5119 dump included demo exploit opening calculator test webpage adobe patched hole july 8 2015 another vulnerability involving adobe revealed dumps took advantage buffer overflow attack adobe open type manager dll included microsoft windows dll run kernel mode attack could perform privilege escalation bypass sandbox also revealed leaked data hackingteam employees use weak passwords including 'p4ssword 'wolverine 'universo hours without response hackingteam member christian pozzi tweeted company working closely police attackers claiming regarding company true also claimed leaked archive contains virus constituted false info shortly tweets pozzi twitter account apparently compromised responsibility attack claimed hacker known phineas fisher phisher twitter phineas previously attacked spyware firm gamma international produce malware finfisher governments corporations 2016 phineas published details attack spanish english how-to others explained motivations behind attack internal documents revealed details hackingteam contracts repressive governments 2016 italian government revoked company license sell spyware outside europe without special permission hackingteam clientele include governments also corporate clients barclay bank british telecom bt united kingdom well deutsche bank germany full list hackingteam customers leaked 2015 breach disclosed documents show hackingteam 70 current customers mostly military police federal provincial governments total company revenues disclosed exceeded 40 million euros", + "neighbors": [ + 17, + 43, + 91, + 134, + 141, + 158, + 186, + 198, + 225, + 232, + 234, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 505, + 533, + 550, + 556, + 577, + 588, + 598, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1101, + 1138, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1379, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 709, + "label": 7, + "text": "Widen_(company):widen company widen software company founded 1948 plate-engraving business developed digital print company eventually software company company founded 1948 eponymous emily arthur widen private plate engraving business focused newspaper presses 1985 company began focusing color printing scanning mid-1990s widen began investing digital printing services well software services internet developing image database system saas digital asset management company company changed name widen colourgraphics ltd. widen enterprises 1997 company headquartered monona wisconsin ranked comparably one top smes united states terms management widen \u2019 ceo matthew gonnering though company renamed position chief eudaimonia officer reflect philosophy management style appointed 2009 transitioned company largely prepress printing company software firm widen software focuses digital asset management houses corporate information helps develop digital projects like websites advertising cataloguing example widen \u2019 cloud software hosts corporate information companies like brooks running shoes widen provides services public services private companies", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 710, + "label": 3, + "text": "Gamebike:gamebike game bike interactive fitness bike requires user exercise order play video games user must pedal bike order character accelerate must turn handlebars steer game bike allows users control character game getting exercise game bike name interactive fitness device first invented patented edward h. ted parks m.d 2000 dr parks sold rights patent cateye co ltd japanese company expertise electronic bicycle accessories bike lights speedometers cateye initial embodiment parks design used traditional bicycle attached referred gb100 system front tire placed turn style platform used read direction sensors placed rear wheel mounted bicycle trainer measure speed cateye co ltd. first started production game bike gb100 form project handled group new jersey redesigned product single package incorporated stand-alone indoor exercise bike gb200 born immediate need commercial version soon covered introduction popular gb-300 game bike late 2008 cateye co ltd. stopped international distribution fitness line game bike production done source distributors inc. dallas texas source distributors produced bike made modifications unit improve controller serviceability game bike popular product within school ymca markets thousands bikes sold since start 2003 game bike owned hudson fitness llc game bike currently available hudson fitness llc continues supporting game bike service compatible titles include speed-based video game ps2/ps3/game cube/xbox", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 711, + "label": 4, + "text": "Mausezahn:mausezahn typical applications mausezahn include mausezahn allows sending arbitrary sequence bytes directly network interface card integrated packet builder provides simple command line interface complicated packets since version 0.38 mausezahn offers multi-threaded mode cisco-style command line interface version 0.38 mausezahn supports following features mausezahn sends exactly packet user specified therefore rather less suited vulnerability audits additional algorithms required detect open ports behind firewall automatically evade intrusion detection systems ids however network administrator could implement audit routines via script utilizes mausezahn creating actual packets mausezahn currently runs linux systems plans port windows operating system", + "neighbors": [ + 134, + 306, + 405, + 425, + 757, + 764, + 771, + 1138, + 1552, + 1607 + ], + "mask": "Test" + }, + { + "node_id": 712, + "label": 9, + "text": "Adobe_ColdFusion:adobe coldfusion adobe coldfusion commercial rapid web-application development platform created j. j. allaire 1995 programming language used platform also commonly called coldfusion though accurately known cfml coldfusion originally designed make easier connect simple html pages database version 2 1996 became full platform included ide addition full scripting language one distinguishing features coldfusion associated scripting language coldfusion markup language cfml cfml compares scripting components asp jsp php purpose features tag syntax closely resembles html script syntax resembles javascript coldfusion often used synonymously cfml additional cfml application servers besides coldfusion coldfusion supports programming languages cfml server-side actionscript embedded scripts written javascript-like language known cfscript originally product allaire released july 2 1995 coldfusion developed brothers joseph j. allaire jeremy allaire 2001 allaire acquired macromedia turn acquired adobe systems inc 2005 coldfusion often used data-driven websites intranets also used generate remote services rest services websockets soap web services flash remoting especially well-suited server-side technology client-side ajax coldfusion also handle asynchronous events sms instant messaging via gateway interface available coldfusion mx 7 enterprise edition coldfusion provides number additional features box main features include implementations cfml offer similar enhanced functionality running .net environment image manipulation engine written c featured among things built-in scripting language cfscript plugin modules written java syntax similar html equivalent html element coldfusion tag begins letters cf followed name indicative tag interpreted html e.g cfoutput begin output variables content addition cfscript plugins described cfstudio provided design platform wysiwyg display addition coldfusion cfstudio also supports syntax languages popular backend programming perl addition making backend functionality easily available non-programmer version 4.0 forward particular integrated easily apache web server internet information services versions coldfusion prior 6.0 written using microsoft visual c++ meant coldfusion largely limited running microsoft windows although allaire successfully port coldfusion sun solaris starting version 3.1 allaire company sold macromedia macromedia sold adobe earlier versions robust versions available version 4.0 forward release coldfusion mx 6.0 engine re-written java supported runtime environment easily replaced configuration options runtime environment sun version 6.1 included ability code debug shockwave flash version 3.1 brought port sun solaris operating system cold fusion studio gained live page preview html syntax checker cold fusion moniker renamed simply coldfusion possibly distinguish cold fusion theory version 4.5 brought ability natively invoke java objects execute system commands talk directly java ee server first release macromedia allaire corporation acquisition last legacy coded specific platform january 16 2001 allaire announced pending merger macromedia macromedia continued development released product name coldfusion 5.0 retained name coldfusion remainder version 5 releases prior 2000 edwin smith allaire architect jrun later flash player initiated project codenamed neo project later revealed coldfusion server re-written completely using java made portability easier provided layer security server ran inside java runtime environment june 2002 macromedia released version 6.0 product slightly different name coldfusion mx allowing product associated macromedia brand original branding coldfusion mx completely rebuilt ground based java ee platform coldfusion mx also designed integrate well macromedia flash using flash remoting release coldfusion mx cfml language api released oop interface release coldfusion 7.0 february 7 2005 naming convention amended rendering product name macromedia coldfusion mx 7 codename cfmx7 blackstone cfmx 7 added flash-based xforms-based web forms report builder output adobe pdf well flashpaper rtf excel adobe pdf output also available wrapper html page converting page quality printable document enterprise edition also added gateways provide interaction non-http request services im services sms directory watchers asynchronous execution xml support boosted version include native schema checking coldfusion mx 7.0.1 codename merrimack added support mac os x improvements flash forms rtf support cfreport new cfcproxy feature java/cfc integration coldfusion mx 7.0.2 codenamed mystic included advanced features working adobe flex 2 well improvements cf report builder july 30 2007 adobe systems released coldfusion 8 dropping mx name beta testing codename used scorpio eighth sign zodiac eighth iteration coldfusion commercial product 14,000 developers worldwide active beta process many testers 5,000 adobe systems originally expected coldfusion development team consisted developers based newton/boston massachusetts offshore bangalore india new features cfpdfform tag enables integration adobe acrobat forms image manipulation functions microsoft .net integration cfpresentation tag allows creation dynamic presentations using adobe acrobat connect web-based collaboration solution formerly known macromedia breeze addition coldfusion administrator enterprise version ships built-in server monitoring coldfusion 8 available several operating systems including linux mac os x windows server 2003 additions coldfusion 8 built-in ajax widgets file archive manipulation cfzip microsoft exchange server integration cfexchange image manipulation including automatic captcha generation cfimage multi-threading per-application settings atom rss feeds reporting enhancements stronger encryption libraries array structure improvements improved database interaction extensive performance improvements pdf manipulation merging capabilities cfpdf interactive debugging embedded database support apache derby ecmascript compliant cfscript development coldfusion applications several tools available primarily adobe dreamweaver cs4 macromedia homesite 5.x cfeclipse eclipse others tag updaters available applications update support new coldfusion 8 features coldfusion 9 codenamed centaur released october 5 2009 new features cf9 include coldfusion 10 codenamed zeus released may 15 2012 new improved features available editions standard enterprise developer include limited additional new improved features coldfusion enterprise developer editions include limited lists obtained adobe web site pages describing new features listed first links following list cf10 originally referred codename zeus first confirmed coming adobe adobe max 2010 much prerelease period also commonly referred coldfusion next coldfusion x blogs twitter etc. adobe finally confirmed would coldfusion 10 much 2010 coldfusion product manager adam lehman toured us setting countless meetings customers developers user groups formulate master blueprint next feature set september 2010 presented plans adobe given full support approval upper management first public beta coldfusion 10 released via adobe labs 17 february 2012 coldfusion 11 codenamed splendor released april 29 2014 new improved features available editions standard enterprise developer include coldfusion 11 also removed many features previously identified simply deprecated longer supported earlier releases example cflog tag long offered date time attributes deprecated redundant date time always logged cf11 use would cause cflog tag fail adobe coldfusion 2016 release codenamed raijin also known generically coldfusion 2016 released february 16 2016 new improved features available editions standard enterprise developer include adobe coldfusion 2018 release known generically coldfusion 2018 released july 12 2018 coldfusion 2018 codenamed aether prerelease new improved features available editions standard enterprise developer include august 13 2012 adobe announced new roadmap coldfusion including code names splendor thunder dazzle next two release versions adobe announced new features coldfusion including limited mobile streamlined mobile application development revamped new pdf functionalities enabling enterprise easily integrate social media streams enterprise mobility support responsive multi screen content digital marketing \u2013 web mobile social analytics customizable enterprise video portal adobe also announced roadmap upcoming cloud enhancements roadmap projects coldfusion development year 2021 coldfusion generate pdf documents using standard html i.e additional coding needed generate documents print cfml authors place html css within pair cfdocument tags new coldfusion 11 cfhtmltopdf tags generated document either saved disk sent client browser coldfusion 8 introduced also cfpdf tag allow control pdf documents including pdf forms merging pdfs tags however use adobe pdf engine cfdocument uses combination commercial jpedal java pdf library free open source java library itext cfhtmltopdf uses embedded webkit implementation coldfusion originally object-oriented programming language like php versions 3 coldfusion falls category oo languages support multiple inheritance along java smalltalk etc. mx release 6+ coldfusion introduced basic oo functionality component language construct resembles classes oo languages component may contain number properties methods one component may also extend another inheritance components support single inheritance object handling feature set performance enhancing occurred subsequent releases release coldfusion 8 java-style interfaces supported coldfusion components use file extension cfc differentiate coldfusion templates .cfm component methods may made available web services additional coding configuration required method access declared 'remote coldfusion automatically generates wsdl url component manner nowiki http //path/to/components/component.cfc wsdl /nowiki aside soap services offered flash remoting binary format methods declared remote may also invoked via http get post request consider get request shown br invoke component search function passing query strict arguments type invocation well-suited ajax-enabled applications coldfusion 8 introduced ability serialize coldfusion data structures json consumption client coldfusion server automatically generate documentation component navigate url insert appropriate code within component declarations application component introspection available developers coldfusion components access component documentation requires password developer view documentation components known coldfusion server navigating coldfusion url interface resembles javadoc html documentation java classes coldfusion provides several ways implement custom markup language tags i.e included core coldfusion language especially useful providing familiar interface web designers content authors familiar html imperative programming traditional common way using cfml standard cfml page interpreted tag tag name corresponding file name prefixed cf_ example file imap.cfm used tag cf_imap attributes used within tag available attributes scope tag implementation page cfml pages accessible directory calling page via special directory coldfusion web application via cfimport tag calling page latter method necessarily require cf_ prefix tag name second way developments cfx tags using java c++ cfx tags prefixed cfx_ example cfx_imap tags added coldfusion runtime environment using coldfusion administrator jar dll files registered custom tags finally coldfusion supports jsp tag libraries jsp 2.0 language specification jsp tags included cfml pages using cfimport tag standard coldfusion installation allows deployment coldfusion war file ear file deployment standalone application servers macromedia jrun ibm websphere coldfusion also deployed servlet containers apache tomcat mortbay jetty platforms officially support coldfusion leave many features inaccessible coldfusion 10 macromedia jrun replaced apache tomcat coldfusion java ee application coldfusion code mixed java classes create variety applications use existing java libraries coldfusion access underlying java classes supports jsp custom tag libraries access jsp functions retrieving jsp page context getpagecontext prior coldfusion 7.0.1 coldfusion components could used java .net declaring web services however beginning coldfusion mx 7.0.1 coldfusion components used directly within java classes using cfcproxy class recently much interest java development using alternate languages jython groovy jruby coldfusion one first scripting platforms allow style java development coldfusion 8 natively supports .net within cfml syntax coldfusion developers simply call .net assembly without needing recompile alter assemblies way data types automatically translated coldfusion .net example .net datatable \u2192 coldfusion query unique feature java ee vendor coldfusion 8 offers ability access .net assemblies remotely proxy without use .net remoting allows coldfusion users leverage .net without installed windows operating system acronym coldfusion markup language cfml coldfusion templates saved disk traditionally given extension .cfm .cfml .cfc extension used coldfusion components original extension dbm dbml stood database markup language talking coldfusion users use acronym cf used numerous coldfusion resources user groups cfugs sites cfmx common abbreviation coldfusion versions 6 7 a.k.a coldfusion mx coldfusion originated proprietary technology based web technology industry standards however becoming less closed technology availability competing products alternative products include alphabetical order argument made coldfusion even less platform-bound raw java ee .net simply coldfusion run top .net app server new atlanta top servlet container java ee application server jrun websphere jboss geronimo tomcat resin server jetty web server etc. theory coldfusion application could moved unchanged java ee application server .net application server march 2013 known issue affecting coldfusion 8 9 10 left national vulnerability database open attack vulnerability identified patch released adobe cf9 cf10 january april 2013 coldfusion vulnerability blamed linode intrusion linode manager control panel website security bulletin hotfix issued adobe week earlier may 2013 adobe identified another critical vulnerability reportedly already exploited wild targets recent versions coldfusion servers web-based administrator api locked vulnerability allows unauthorized users upload malicious scripts potentially gain full control server security bulletin hotfix issued adobe 6 days later april 2015 reported cross-site scripting xss vulnerability adobe coldfusion 10 update 16 coldfusion 11 update 5 allowed remote attackers inject arbitrary web script html however exploitable users authenticated administration panel", + "neighbors": [ + 7, + 134, + 148, + 201, + 429, + 509, + 521, + 593, + 594, + 638, + 712, + 742, + 756, + 786, + 796, + 916, + 961, + 1138, + 1232, + 1233, + 1235, + 1242, + 1264, + 1269, + 1288, + 1395, + 1416, + 1470, + 1477, + 1481 + ], + "mask": "Validation" + }, + { + "node_id": 713, + "label": 5, + "text": "Firefox_3.6:firefox 3.6 mozilla firefox 3.6 version firefox web browser released january 2010 release main improvement firefox 3.5 improved performance due speed improvements tracemonkey javascript engine uses gecko 1.9.2 engine compared 1.9.1 ff 3.5 improves compliance web standards codenamed namoroka version support x bitmap images dropped release marked beginning new development cycle firefox well receiving major updates browser also received minor updates new features allow users receive new features quickly dawn new roadmap reflected changes superseded firefox 4 released next year although ff 3.6 prolonged period use version 4 noted user interface changes firefox 3.6 last major version official firefox release run powerpc-based macintoshes see tenfourfox much-more-recent version firefox powerpc-based computers running mac os x soon 4 much less weight given major version numbers 6 numbers used september year 4 5 6 7 8 9 compared 3 nearly decade firefox development 1 2 3 firefox versions 4 9 reached end-of-life status mozilla continued supporting firefox 3.6 security updates coinciding proposal cater enterprise users optional extended support releases beginning 2012 based upon firefox 10 mozilla discontinued support firefox 3.6 april 24 2012 automatic update firefox 12 pushed compatible devices june 2012 development version started december 1 2008 first alpha version 3.6 released august 7 2009 first beta version released october 30 followed beta 2 november 10 beta 3 november 17 beta 4 november 26 beta 5 december 17 release candidate 1 released january 8 2010 followed release candidate 2 january 17 final version released january 21 2010 firefox 3.6.2 released march 23 2010 followed version 3.6.3 april 1 closed bugs aslr dep handling found pwn2own contest 2010 firefox developers created new feature called lorentz named lorentz national park preview version lorentz firefox 3.6.3plugin1 made available april 8 2010 betas firefox 3.6.4 made available starting april 20 2010 firefox 3.6.4 released june 22 2010 windows linux versions incorporate out-of-process plug-ins oopp isolates execution plug-ins adobe flash apple quicktime microsoft silverlight default separate process significantly reduces number firefox crashes experienced users watching online videos playing games user simply refresh page continue mozilla states 30 browser crashes caused third-party plugins support plug-ins default oopp mac os x platform become available firefox 4 firefox 3.6.6 lengthens amount time plug-in allowed unresponsive point plug-in quits firefox 3.6.7 security stability update fixed several issues firefox 3.6.8 security update released mere three days 3.6.7 fix another security fault firefox 3.6.9 addition fixing security stability issues introduced support codice_1 http response header help prevent clickjacking firefox 3.6.10 security stability update fixed several issues firefox 3.6.11 security stability update fixed several issues firefox 3.6.12 security update fixed critical security issue firefox 3.6.13 security stability update fixed several issues firefox 3.6.14 security stability update fixed several issues firefox 3.6.15 stability update fixed java applets issue firefox 3.6.16 security update blacklisted invalid https certificates firefox 3.6.17 security stability update fixed several issues firefox 3.6.18 security stability update fixed several issues firefox 3.6.19 stability update fixed several issues firefox 3.6.20 security stability update fixed several issues firefox 3.6.21 security update blacklisted compromised https certificate firefox 3.6.22 security update revoked ssl certificates staten der nederlanden due fraudulent ssl certificate issuance well fixing error .gov.uk domain names firefox 3.6.23 security stability update fixed several issues firefox 3.6.24 security stability update fixed several issues firefox 3.6.25 security stability update fixed several issues firefox 3.6.26 security stability update fixed several issues firefox 3.6.27 security update fixed several issues firefox 3.6.28 security stability update fixed several issues new features firefox 3.6 include mozilla discontinued support firefox 3.6 april 24 2012 27 months support made longest supported version firefox even longer firefox 2 26 months total support underlying gecko 1.9.2 engine continued used updates camino", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 452, + 491, + 509, + 530, + 580, + 582, + 623, + 627, + 668, + 684, + 796, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1302, + 1376, + 1378, + 1423, + 1424, + 1528, + 1539, + 1550, + 1566, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 714, + "label": 3, + "text": "National_Interop:national interop national interop systems integration company earliest experience radio ip technologies deployed public safety communications company founded public safety personnel one principals company testified u.s. senate 2007 applicability radio ip roip alternative expensive statewide interoperable radio systems proposed funding federal government costs us 1b per state company designed implemented roip-powered system air evac lifeteam spanning 14 states 80+ radio towers 24x7 9-1-1 type dispatch center well numerous smaller roip systems national interop works roip technologies may best suited particular public safety application", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 715, + "label": 7, + "text": "Apache_Drill:apache drill apache drill open-source software framework supports data-intensive distributed applications interactive analysis large-scale datasets drill open source version google dremel system available infrastructure service called google bigquery one explicitly stated design goal drill able scale 10,000 servers able process petabytes data trillions records seconds drill apache top-level project drill supports variety nosql databases file systems including alluxio hbase mongodb mapr-db hdfs mapr-fs amazon s3 azure blob storage google cloud storage swift nas local files single query join data multiple datastores example join user profile collection mongodb directory event logs hadoop drill datastore-aware optimizer automatically restructures query plan leverage datastore internal processing capabilities addition drill supports data locality drill datastore nodes apache drill 1.9 added dynamic user defined functions apache drill 1.11 added cryptographic-related functions pcap file format support drill primarily focused non-relational datastores including apache hadoop text files nosql cloud storage following datastores supported new datastore added developing storage plugin drill schema-free json data model enables query non-relational datastores in-situ papers influenced birth design partial list", + "neighbors": [ + 178, + 192, + 197, + 296, + 318, + 480, + 611, + 620, + 796, + 874, + 1091, + 1138, + 1163, + 1254, + 1454, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 716, + "label": 2, + "text": "Package_manager:package manager package manager package-management system collection software tools automates process installing upgrading configuring removing computer programs computer operating system consistent manner package manager deals packages distributions software data archive files packages contain metadata software name description purpose version number vendor checksum list dependencies necessary software run properly upon installation metadata stored local package database package managers typically maintain database software dependencies version information prevent software mismatches missing prerequisites work closely software repositories binary repository managers app stores package managers designed eliminate need manual installs updates particularly useful large enterprises whose operating systems based linux unix-like systems typically consisting hundreds even tens thousands distinct software packages software package archive file containing computer program well necessary metadata deployment computer program source code compiled built first package metadata include package description package version dependencies packages need installed beforehand package managers charged task finding installing maintaining uninstalling software packages upon user command typical functions package management system include computer systems rely dynamic library linking instead static library linking share executable libraries machine instructions across packages applications systems complex relationships different packages requiring different versions libraries results challenge colloquially known dependency hell microsoft windows systems also called dll hell working dynamically linked libraries good package management vital systems framework system openstep attempt solving issue allowing multiple versions libraries installed simultaneously software packages specify version linked system administrators may install maintain software using tools package management software example local administrator may download unpackaged source code compile install may cause state local system fall synchronization state package manager database local administrator required take additional measures manually managing dependencies integrating changes package manager tools available ensure locally compiled packages integrated package management distributions based .deb .rpm files well slackware linux checkinstall recipe-based systems gentoo linux hybrid systems arch linux possible write recipe first ensures package fits local package database particularly troublesome software upgrades upgrades configuration files since package managers least unix systems originated extensions file archiving utilities usually either overwrite retain configuration files rather applying rules exceptions usually apply kernel configuration broken render computer unusable restart problems caused format configuration files changes instance old configuration file explicitly disable new options disabled package managers debian dpkg allow configuration installation situations desirable install packages default configuration overwrite configuration instance headless installations large number computers kind pre-configured installation also supported dpkg give users control kinds software allowing installed system sometimes due legal convenience reasons distributors side software often downloaded number software repositories user interacts package management software bring upgrade customary present user list actions executed usually list packages upgraded possibly giving old new version numbers allow user either accept upgrade bulk select individual packages upgrades many package managers configured never upgrade certain packages upgrade critical vulnerabilities instabilities found previous version defined packager software process sometimes called version pinning instance advanced package management features offer cascading package removal packages depend target package packages target package depends also removed although commands specific every particular package manager large extent translatable package managers offer similar functions arch linux pacman/rosetta wiki offers extensive overview package managers like dpkg existed early 1994 linux distributions oriented binary packages rely heavily package management systems primary means managing maintaining software mobile operating systems android linux-based ios unix-like windows phone rely almost exclusively respective vendors app stores thus use dedicated package management systems package manager often called install manager lead confusion package managers installers differences include software configuration management systems treat building software deploying software separate independent steps build automation utility typically takes human-readable source code files already computer automates process converting binary executable package computer later package manager typically running computer downloads pre-built binary executable packages internet installs however kinds tools many commonalities example dependency graph topological sorting used package manager handle dependencies binary components also used build manager handle dependency source components example many makefiles support building executables also installing codice_1 example every package manager portage sorcery homebrew etc supports converting human-readable source code binary executables installing tools maak a-a-p designed handle building deployment used either build automation utility package manager also known binary repository manager software tool designed optimize download storage binary files artifacts packages used produced software development process package managers aim standardize way enterprises treat package types give users ability apply security compliance metrics across artifact types universal package managers referred center devops toolchain common universal package managers sonatype nexus repository manager jfrog artifactory inedo proget package manager relies format metadata packages manage package managers need groups files bundled specific package manager along appropriate metadata dependencies often core set utilities manages basic installation packages multiple package managers use utilities provide additional functionality example yum relies rpm backend yum extends functionality backend adding features simple configuration maintaining network systems another example synaptic package manager provides graphical user interface using advanced packaging tool apt library turn relies dpkg core functionality alien program converts different linux package formats supporting conversion linux standard base lsb compliant .rpm packages .deb stampede .slp solaris .pkg slackware .tgz .txz .tbz .tlz packages mobile operating systems google play consumes android application package apk package format windows store uses appx xap formats google play windows store eponymous package managers nature free open source software packages similar compatible licenses available use number operating systems packages combined distributed using configurable internally complex packaging systems handle many permutations software manage version-specific dependencies conflicts packaging systems free open source software also released free open source software one typical difference package management proprietary operating systems mac os x windows free open source software linux free open source software systems permit third-party packages also installed upgraded mechanism whereas package managers mac os x windows upgrade software provided apple microsoft respectively exception third party drivers windows ability continuously upgrade third party software typically added adding url corresponding repository package management configuration file beside system-level application managers add-on package managers operating systems limited capabilities programming languages developers need latest libraries contrast system-level package managers application-level package managers focus small part software system typically reside within directory tree maintained system-level package manager however might case package managers deal programming libraries leading possible conflict package managers may claim file might break upgrades ian murdock commented package management single biggest advancement linux brought industry blurs boundaries operating system applications makes easier push new innovations ... marketplace ... evolve os", + "neighbors": [ + 31, + 33, + 50, + 69, + 81, + 107, + 113, + 134, + 176, + 195, + 207, + 209, + 213, + 267, + 275, + 276, + 298, + 301, + 327, + 337, + 351, + 380, + 392, + 393, + 404, + 412, + 429, + 431, + 459, + 509, + 521, + 527, + 571, + 593, + 664, + 682, + 695, + 725, + 796, + 872, + 897, + 899, + 948, + 961, + 966, + 974, + 986, + 992, + 1004, + 1046, + 1055, + 1102, + 1138, + 1214, + 1225, + 1227, + 1234, + 1235, + 1241, + 1252, + 1276, + 1292, + 1301, + 1304, + 1311, + 1313, + 1360, + 1366, + 1369, + 1391, + 1394, + 1456, + 1458, + 1462, + 1509, + 1524, + 1539, + 1547, + 1578, + 1601, + 1602, + 1627 + ], + "mask": "Validation" + }, + { + "node_id": 717, + "label": 4, + "text": "Dr._Web:dr web dr.web software suite developed russian anti-malware company doctor web first released 1992 became first anti-virus service russia company also offers anti-spam solutions used yandex scan e-mail attachments also features add-on major browsers checks links online version dr web dr.web withdrawn av tests virus bulletin vb100 around 2008 stating believe virus scans viruses different subject real world malware attacks staunch anti-adware policy led software developers complaints dr web treated virus free applications virus receive responds dr web try contact dr web resolve issue dr.web discovered trojan backdoor.flashback variant affected 600,000 macs dr.web discovered trojan.skimer.18 trojan works like atm software skimmer trojan intercept transmit bank card information processed atms well data stored card pin code dr.web discovered ransomware linux.encoder.1 affected 2,000 linux users linux.encoder.2 discovered later turned earlier version ransomware doctor web received threat supposedly trojan writers criminal organization sponsoring malware development promotion march 31 two arson attacks carried igor daniloff anti-virus laboratory st. petersburg company received second threat doctor web released statement company considers duty provide users ultimate protection encroachments cybercriminals consequently efforts aimed identifying studying atm threats atm shield", + "neighbors": [ + 17, + 94, + 120, + 134, + 297, + 476, + 585, + 842, + 910, + 938, + 944, + 961, + 965, + 1038, + 1101, + 1138, + 1239, + 1291, + 1350, + 1514, + 1542 + ], + "mask": "Validation" + }, + { + "node_id": 718, + "label": 7, + "text": "INSANE_(software):insane software insane proprietary interactive streaming animation engine developed lucasarts primarily programmer/game designer vincent lee using custom video compression technology greatly compresses moving images high quality full-screen videos displayed even hi-res graphics modes pc early version first developed followed much enhanced version full throttle outlaws dig also used 1998 games mortimer riddles medallion compression technology incorporated star wars episode insider guide jar jar journey adventure book use full throttle caused problems since insane intended photorealistic contrasting general cartoony feeling rendered environment scaled match rest game world later enhancements made compression technology optimize cartoon style imagery used outlaws", + "neighbors": [ + 416, + 468, + 839, + 976, + 1159, + 1592 + ], + "mask": "Test" + }, + { + "node_id": 719, + "label": 3, + "text": "Dataflow_architecture:dataflow architecture dataflow architecture computer architecture directly contrasts traditional von neumann architecture control flow architecture dataflow architectures program counter concept executability execution instructions solely determined based availability input arguments instructions order instruction execution unpredictable i.e behavior nondeterministic although commercially successful general-purpose computer hardware used dataflow architecture successfully implemented specialized hardware digital signal processing network routing graphics processing telemetry recently data warehousing also relevant many software architectures today including database engine designs parallel computing frameworks synchronous dataflow architectures tune match workload presented real-time data path applications wire speed packet forwarding dataflow architectures deterministic nature enable programmers manage complex tasks processor load balancing synchronization accesses common resources meanwhile clash terminology since term dataflow used subarea parallel programming dataflow programming hardware architectures dataflow major topic computer architecture research 1970s early 1980s jack dennis mit pioneered field static dataflow architectures manchester dataflow machine mit tagged token architecture major projects dynamic dataflow research however never overcame problems related instructions data dependencies proved fine-grained effectively distributed large network time instructions tagged results travel large connection network longer time actually computations nonetheless out-of-order execution ooe become dominant computing paradigm since 1990s form restricted dataflow paradigm introduced idea execution window execution window follows sequential order von neumann architecture however within window instructions allowed completed data dependency order accomplished cpus dynamically tag data dependencies code execution window logical complexity dynamically keeping track data dependencies restricts ooe cpus small number execution units 2-6 limits execution window sizes range 32 200 instructions much smaller envisioned full dataflow machines designs use conventional memory addresses data dependency tags called static dataflow machines machines allow multiple instances routines executed simultaneously simple tags could differentiate designs use content-addressable memory cam called dynamic dataflow machines use tags memory facilitate parallelism normally control flow architecture compilers analyze program source code data dependencies instructions order better organize instruction sequences binary output files instructions organized sequentially dependency information recorded binaries binaries compiled dataflow machine contain dependency information dataflow compiler records dependencies creating unique tags dependency instead using variable names giving dependency unique tag allows non-dependent code segments binary executed order parallel compiler detects loops break statements various programming control syntax data flow programs loaded cam dynamic dataflow computer tagged operands instruction become available output previous instructions and/or user input instruction marked ready execution execution unit known activating firing instruction instruction completed execution unit output data sent tag cam instructions dependent upon particular datum identified tag value marked ready execution way subsequent instructions executed proper order avoiding race conditions order may differ sequential order envisioned human programmer programmed order instruction along required data operands transmitted execution unit packet also called instruction token similarly output data transmitted back cam data token packetization instructions results allows parallel execution ready instructions large scale dataflow networks deliver instruction tokens execution units return data tokens cam contrast conventional von neumann architecture data tokens permanently stored memory rather transient messages exist transit instruction storage", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 268, + 270, + 271, + 272, + 280, + 292, + 300, + 314, + 331, + 335, + 340, + 352, + 362, + 375, + 388, + 429, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 591, + 611, + 643, + 659, + 737, + 752, + 776, + 803, + 821, + 846, + 847, + 876, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1099, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 720, + "label": 2, + "text": "KernelCare:kernelcare kernelcare live kernel patching service provides security patches bugfixes range popular linux kernels installed without rebooting system kernelcare software released gpl2 first beta introduced march 2014 commercially launched may 2014 kernelcare supports centos/rhel 5.x 6.x 7.x cloudlinux 5.x 6.x 7.x parallels cloud server oracle linux/rhel 6.x 7.x amazon linux virtuozzo openvz rhel6/rhel proxmox 3.x 4.x 5.x virt-sig/xen4centos debian 6.x 7.x 8.x 9.x ubuntu 14.04 lts 16.04 lts 18.04 lts kernelcare agent resides user server periodically checks kernelcare distribution servers new patches available currently running kernel kernelcare agent downloads applies patches running kernel kernelcare patch piece code used substitute vulnerable buggy code kernel arbitrary code line modification missing security check set functions even modified data structures patch compiled usual generated code additional information changed code pieces caused original source code modification information apply code pieces resulting code modifications safely applied running kernel special kernelcare kernel module applies patches loads patches kernel address space sets relocations i.e. fixes references original kernel code data safely switches execution path original code updated code blocks code ensures patch applied safely cpu n't execute original code blocks moment switching new version", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 213, + 219, + 265, + 267, + 294, + 305, + 322, + 327, + 346, + 400, + 401, + 413, + 465, + 477, + 571, + 583, + 630, + 650, + 664, + 688, + 725, + 728, + 736, + 754, + 797, + 860, + 891, + 897, + 935, + 941, + 961, + 966, + 986, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1060, + 1102, + 1105, + 1138, + 1155, + 1187, + 1197, + 1202, + 1208, + 1224, + 1241, + 1252, + 1278, + 1301, + 1313, + 1357, + 1360, + 1391, + 1398, + 1415, + 1441, + 1456, + 1468, + 1474, + 1494, + 1524, + 1526, + 1530, + 1546, + 1558, + 1578, + 1602, + 1616, + 1631, + 1638 + ], + "mask": "Train" + }, + { + "node_id": 721, + "label": 2, + "text": "WAITS:waits waits heavily modified variant digital equipment corporation monitor operating system later renamed better known tops-10 pdp-6 pdp-10 mainframe computers used stanford artificial intelligence laboratory sail mid-1960s 1991 mainframe computer ran also went name sail never official expansion waits common variant west-coast alternative another variant worst acronym invented timesharing system name endorsed sail community public vote choosing among alternatives two contenders saints stanford ai new timesharing system sinners stanford incompatible non-new extensively rewritten system proposed systems programmers though waits less visible frequent exchange people ideas two communities innovations pioneered waits exerted enormous indirect influence waits alumni xerox parc elsewhere also played major roles developments led xerox star apple macintosh sun workstation later sold sun microsystems early screen modes emacs example directly inspired waits e editor -- one family editors first real-time editing editing commands invisible one typed text point insertion/overwriting modern style multi-region windowing said originated system also featured unusual level support called multimedia computing allowing analog audio video signals including tv radio switched programming terminals switching capability terminal video even allowed users separate offices view type virtual terminal single user instantly switch among multiple full virtual terminals also invented bucky bits thus alt key every ibm pc waits legacy one waits feature notable pre-web days news-wire search engine called ns news service allowed waits hackers instantly find store notified selected ap new york times news-wire stories searches using arbitrary combinations words news story retrieval search instantaneous story automatically indexed words came wire", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 251, + 322, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1202, + 1213, + 1224, + 1301, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Train" + }, + { + "node_id": 722, + "label": 3, + "text": "Universal_Data_Element_Framework:universal data element framework universal data element framework udef controlled vocabulary developed open group provided framework categorizing naming indexing data assigned every item data structured alphanumeric tag plus controlled vocabulary name describes meaning data allowed relating data elements similar elements defined organizations udef defined dewey-decimal like code concept example employee number often used human resource management udef tag a.5_12.35.8 controlled vocabulary description employee.person_employer.assigned.identifier udef superseded open data element framework o-def application used hospital last name first name several people could include following example concepts examples following udef ids available", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 723, + "label": 2, + "text": "Copy-on-write:copy-on-write copy-on-write cow cow sometimes referred implicit sharing shadowing resource-management technique used computer programming efficiently implement duplicate copy operation modifiable resources resource duplicated modified necessary create new resource resource shared copy original modifications must still create copy hence technique copy operation deferred first write sharing resources way possible significantly reduce resource consumption unmodified copies adding small overhead resource-modifying operations copy-on-write finds main use sharing virtual memory operating system processes implementation fork system call typically process modify memory immediately executes new process replacing address space entirely thus would wasteful copy process memory fork instead copy-on-write technique used copy-on-write implemented efficiently using page table marking certain pages memory read-only keeping count number references page data written pages kernel intercepts write attempt allocates new physical page initialized copy-on-write data although allocation skipped one reference kernel updates page table new writable page decrements number references performs write new allocation ensures change memory one process visible another copy-on-write technique extended support efficient memory allocation page physical memory filled zeros memory allocated pages returned refer page zeros marked copy-on-write way physical memory allocated process data written allowing processes reserve virtual memory physical memory use memory sparsely risk running virtual address space combined algorithm similar demand paging copy-on-write pages also used linux kernel kernel same-page merging feature loading libraries application also use copy-on-write technique dynamic linker maps libraries private like follows writing action libraries trigger cow virtual memory management codice_1 cow also used library application system code multithreaded systems cow implemented without use traditional locking instead use compare-and-swap increment decrement internal reference counter since original resource never altered safely copied multiple threads reference count increased without need performance-expensive locking mutexes reference counter turns 0 definition 1 thread holding reference resource safely de-allocated memory without use performance-expensive locking mechanisms benefit copy resource resulting performance gain traditional deep-copying therefore valid single- multithreaded systems string class provided c++ standard library specifically designed allow copy-on-write implementations initial c++98 standard newer c++11 standard php programming language types except references implemented copy-on-write example strings arrays passed reference modified duplicated non-zero reference counts allows act value types without performance problems copying assignment making immutable qt framework many types copy-on-write implicitly shared qt terms qt uses atomic compare-and-swap operations increment decrement internal reference counter since copies cheap qt types often safely used multiple threads without need locking mechanisms mutexes benefits cow thus valid single- multithreaded systems cow may also used underlying mechanism snapshots provided logical volume management file systems btrfs zfs database servers microsoft sql server typically snapshots store modified data stored close main array weak form incremental backup substitute full backup systems also use cow technique avoid fuzzy backups otherwise incurred file set files backed changes backup implementing snapshots two techniques despite names copy-on-write usually refers first technique cow two data writes compared row one difficult implement efficiently thus used infrequently copy-on-write technique used emulate read-write storage media require wear leveling physically write read many qcow2 qemu copy write disk image format uses copy-on-write technique reduce disk image size live cds live usbs use copy-on-write techniques give impression able add delete files directory without actually making changes cd usb flash drive phantom os uses cow levels database file system time computer running system fail starts software operating system resume operation small amounts work lost basic approach program data kept virtual memory schedule summary software data written virtual memory forming log tracks current value location value computer fails recent copy log data remain safe disk operation resumes operating system software reads log restore consistent copies programs data approach uses copy-on-write levels software including application software requires support within application programming language practice phantom os permits languages generate java byte codes", + "neighbors": [ + 34, + 40, + 55, + 63, + 123, + 171, + 222, + 233, + 272, + 278, + 295, + 326, + 334, + 349, + 358, + 412, + 438, + 443, + 494, + 495, + 524, + 553, + 557, + 558, + 570, + 664, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 926, + 942, + 982, + 986, + 996, + 997, + 1056, + 1057, + 1064, + 1097, + 1104, + 1124, + 1138, + 1151, + 1157, + 1201, + 1202, + 1234, + 1235, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1546, + 1565, + 1616, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 724, + "label": 3, + "text": "Squish_'em:squish 'em squish'em also known squish'em sam 1983 video game designed tony ngo published sirius software atari 8-bit family vic-20 commodore 64 msx colecovision console colecovision version features digitised speech without additional hardware published squish'em featuring sam game sequel sewer sam squish'em vertically scrolling game likened 1980 arcade game crazy climber players guide sam top uncompleted 48 storey buildings order collect suitcases money time sam reaches top building grabs money parachutes order attempt next building building represented grid girders connected vertically horizontally different patterns sometimes single way next storey building style buildings change grid layout colors change sam progresses game sam moves shimmying horizontally across grid climbing upwards moved storey climb back buildings patrolled dangerous enemies move horizontally across grid debris dropped sam must avoid making contact enemy without jumping hit falling debris results sam knocked building losing life player starts game four lives extra lives collected play 128 held player enemies 'squished jumped also jumped avoided ascending next storey enemy squished rendered harmless short period turning white becoming invulnerable enemy turned white must avoided jumped jumping enemies difficult landing squishing play progresses enemies become taller faster making harder squish avoid falling debris prevents players climbing many storeys enemies must avoided skillfully order prevent sam cornered invulnerable enemy tall easily jumped colecovision version game digitised speech employed sam performs certain actions instance exclaims squish 'em successfully attacking enemy money money money collecting suitcase top building one colecovision games contain speech unlike rival intellivision console colecovision lacks speech module craig holyoak deseret news rated colecovision version 3 5 praising game voice effects criticizing unoriginal despite boundaries technology pushed stated game contains plenty cute enabling appeal ages genders also stated little new keep experienced gamer long screen holyoak played game intensely number days lost interest mastering ability squish dangerous enemies finished stating less jaded looking climbing game new twist squish 'em may well unofficial homebrew clone even using name released atari 2600 2007", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 725, + "label": 8, + "text": "LYME_(software_bundle):lyme software bundle lyme lyce software stacks composed entirely free open-source software build high-availability heavy duty dynamic web pages stacks composed lyme lyce bundles combined many free open-source software packages e.g netsniff-ng security testing hardening snort intrusion detection ids intrusion prevention system ips rrdtool diagrams nagios collectd cacti monitoring databases mnesia couchdb well yaws also mochiweb misultin cowboy written erlang web applications developed lyme/lyce may run entirely one erlang virtual machine contrast lamp web server apache application written php perl python might process database always separate process result using erlang lyme lyce applications perform well high load distribution fault tolerance needed query data manipulation language mnesia also erlang rather sql therefore web-application lyme developed using single programming language interest lyme stack begun august 2005 soon cited high-performance web application platform used single development language throughout favorable comparisons popular stacks ruby rails soon forthcoming comparisons lamp also favourable although highlighted difficulties porting sql thinking different context mnesia successful user lyme swedish internet payment-processing company klarna built whole architecture lyme seen successful project demonstrates virtues lyme functional programming general lyme also covered erlang session software practice advancement spa 2008 besides yaws several web servers written erlang e.g mochiweb misultin cowboy besides mnesia couchdb couple databases written erlang e.g. cloudant couchbase server born membase database management system optimized storing data behind interactive web applications riak simpledb part amazon web services", + "neighbors": [ + 134, + 219, + 265, + 267, + 275, + 294, + 305, + 327, + 400, + 401, + 429, + 512, + 571, + 630, + 650, + 688, + 716, + 720, + 736, + 739, + 897, + 935, + 986, + 1019, + 1060, + 1102, + 1105, + 1138, + 1197, + 1208, + 1225, + 1227, + 1235, + 1241, + 1252, + 1357, + 1360, + 1361, + 1391, + 1456, + 1468, + 1524, + 1526, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 726, + "label": 2, + "text": "Nokia_N80:nokia n80 nokia n80 3g smartphone nokia announced november 2 2005 part multimedia nseries line runs symbian os v9.1 s60 3rd edition interface first released june 2006 support high-speed umts/wcdma connections features include 3.1-megapixel camera interpolated 2.0-megapixels built-in flash front camera videoconferencing wi-fi 802.11g universal plug play upnp fm radio bluetooth 1.2 minisd memory card slot support 3d java games 2.1-inch display pixel density 259 ppi due 352x416 resolution 2.1 displaymaking one nokia sharpest displays 2005 2006 n80 world first upnp-compatible phone allowing transfer media files compatible devices wi-fi n80 officially described multimedia computer nokia like successor nokia n95 nokia originally announced n80 supporting bluetooth 2.0 however released bluetooth 1.2 therefore n80 currently support stereo playback bluetooth nokia n80 internet edition second version handset hardware normal n80 released q4 2006 available patina bronze pearl black following additional software included january 2007 pearl black model available sale us 499 nokia announced new internet edition firmware available 'classic n80 using nokia official software updater downloadable nokia.com internet edition firmware made available nokia software updater end users could update n80 specification n80 internet edition flashing n80 firmware n80 internet edition required use several hacked nokia servicing software applications including phoenix service software nokia software update nemesis changing product code method questionable legality jurisdictions may violate terms phone warranty reports occasional failure method due user error unknown reasons leaving phone unusable state properly-equipped service center could recover", + "neighbors": [ + 3, + 21, + 162, + 238, + 253, + 264, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 833, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 727, + "label": 3, + "text": "Gyrodine:gyrodine note player fire guns time", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 728, + "label": 6, + "text": "File_attribute:file attribute file attributes metadata associated computer files define file system behavior attribute one two states set cleared attributes considered distinct metadata dates times filename extensions file system permissions addition files folders volumes file system objects may attributes traditionally ms-dos microsoft windows four attributes archive hidden read-only system windows added new ones systems derived 4.4bsd-lite freebsd netbsd openbsd dragonfly bsd macos sets system user attributes newer versions linux kernel also support set file attributes traditionally dos microsoft windows files folders accepted four attributes new versions windows came microsoft added inventory available attributes ntfs file system including limited attributes displayed attributes column windows explorer include 4.4bsd 4.4bsd-lite files directories folders accepted four attributes could set owner file superuser user attributes two attributes could set superuser system attributes freebsd added additional attributes also supported dragonfly bsd freebsd also supports whereas dragonfly bsd supports netbsd added another attribute also supported openbsd macos added three attributes dos os/2 windows codice_3 command cmd.exe command.com used change display four traditional file attributes file explorer windows show seven mentioned attributes set clear system attribute windows powershell become component windows 7 later features two commands read write attributes codice_4 codice_5 change attribute file windows nt user must appropriate file system permissions known write attributes write extended attributes 4.4bsd 4.4bsd-lite derivatives codice_6 codice_7 commands used change display file attributes change user attribute file 4.4bsd-derived operating systems user must owner file superuser change system attribute user must superuser linux codice_8 codice_9 commands used change display file attributes", + "neighbors": [ + 1, + 9, + 22, + 34, + 37, + 40, + 42, + 55, + 58, + 63, + 64, + 99, + 134, + 170, + 171, + 185, + 222, + 233, + 265, + 278, + 295, + 322, + 326, + 334, + 349, + 353, + 358, + 365, + 380, + 387, + 434, + 438, + 465, + 494, + 495, + 524, + 553, + 557, + 558, + 570, + 583, + 650, + 664, + 720, + 721, + 723, + 754, + 797, + 884, + 887, + 891, + 892, + 900, + 908, + 912, + 922, + 942, + 954, + 961, + 966, + 982, + 996, + 997, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1056, + 1063, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1188, + 1201, + 1202, + 1224, + 1234, + 1252, + 1283, + 1287, + 1301, + 1304, + 1322, + 1381, + 1391, + 1394, + 1415, + 1441, + 1445, + 1456, + 1459, + 1530, + 1546, + 1565, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 729, + "label": 4, + "text": "Inference_attack:inference attack inference attack data mining technique performed analyzing data order illegitimately gain knowledge subject database subject sensitive information considered leaked adversary infer real value high confidence example breached information security inference attack occurs user able infer trivial information robust information database without directly accessing object inference attacks piece together information one security level determine fact protected higher security level", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 730, + "label": 4, + "text": "Trusteer:trusteer trusteer portfolio digital identity trust software products belonging ibm security founded mickey boodaei rakesh k. loonkar israel 2006 trusteer acquired september 2013 ibm 1 billion highest valuation multiple ibm ever paid business ibm trusteer helps organizations seamlessly establish digital identity trust across web customer journey cloud-based intelligence backed ai patented machine learning trusteer provides holistic approach identifying new existing customers without negatively impacting user experience 500 leading organizations rely trusteer help enable secure customers \u2019 digital journey support business growth trusteer presence north america south america europe africa japan ibm trusteer helps brands accelerate digital growth establishing digital identity trust across channels helping recognize customers deter bad actors trusteer rapport adaptive endpoint solution helps protect financial institutions end-users transparently detecting protecting financial malware infections phishing attacks account takeover provides comprehensive security layer anti-virus software typically designed address financial malicious activity software service offering uses 24/7 threat intelligence including geographic customize detection matrix address new threats real-time including attacking specific financial institution used leading financial institutions worldwide trusteer rapport combines global footprint millions endpoints years threat data analysis experience innovative technology achieve high rates detection low false positives increasingly sophisticated financial threat environment specifically trusteer rapport detects alerts organization pharming phishing screenshots overlays financial malware advises end-user account risk compromised moment installed end-user \u2019 computer trusteer rapport immediately checks removes existing financial malware malicious patches starts performing continuous transparent monitoring kernel operating system browser application levels protect new threats trusteer rapport supports browser extensions google chrome microsoft edge apple safari mozilla firefox supports microsoft internet explorer use trusteer rapport end-users simply install rapport browser extension web browser choice trusteer rapport compatible microsoft windows 7 higher multiple mac os x versions supported browsers platforms end-users download trusteer rapport free charge financial institutions offer software free charge offer safer online banking customers organizations also acquire trusteer mobile sdk extend protection native mobile applications trusteer pinpoint platform digital identity trust lifecycle platform designed provide b2c access management dynamically managing digital identity trust web mobile applications platform made three products trusteer pinpoint platform allows organizations improve digital customer journey single platform dynamically manage risk-based seamless authentication user-friendly step-up authentication establish trust identity proofing new guest users happens need validate new anonymous customer user true customer intent initiating payment fraud abusing loyalty program guests new customers let unimpeded ones complete step-up authentication using advanced intelligence global visibility ibm trusteer pinpoint\u2122 assure solution designed help detect predict risk fraudulent intent new guest customers also enables companies conduct early account monitoring new accounts \u2019 type insight \u2019 critical reducing abandonment caused friction security measures increasing loyalty program registrations growing digital channel sustain trust continuous authentication trusted users better protect customer accounts payment journeys compromised detecting account takeovers unauthorized logins activity requires comprehensive view account access device session user perspective ibm trusteer pinpoint detect delivers kind visibility using behavioral biometric capabilities behavioral analytics transparently build user profiles continually authenticate online identities using machine learning patented analytics platform analyzes patterns mouse movements astonishing speeds volumes differentiate account user \u2019 \u201c normal \u201d digital behavior abnormal behavior insight combined device activity evidence transactional data geolocation data either abnormal user behavior known fraudster behavior detected trusteer pinpoint detect provides recommended action real-time along detailed reasoning session details organization take steps confirm trust necessary confirm trust combine risk assessment strong adaptive authentication confirm trust abnormal user behavior suspicious activity identified ibm trusteer pinpoint verify cloud-based authentication service seamlessly integrates pinpoint assure pinpoint detect help companies apply strong step-up authentication necessary application developers simply use exposed interfaces service challenge users perform second factor authentication via digital application users choose enroll various forms two-factor authentication one-time passcodes via email sms mobile push notification biometric authentication trusteer pinpoint products use context- based intelligence combining device id proxy emulator detection malware remote access trojan rat infection detection bot detection email phone number intelligence account history patterns behavioral biometrics navigation session analysis determine trust risk level associated user trusteer mobile sdk helps organizations build digital identity trust mobile confidence customers differentiating trusted mobile devices users suspicious ones exposes real-time mobile risk allow account compromise mitigation proactively detects mobile device risk native mobile applications available standalone assessing risk indicators mobile device integrates ibm trusteer pinpoint digital identity trust platform use threat intelligence correlate mobile device user behavior account risk factors across digital channels specifically ibm trusteer mobile sdk generates strong persistent global device id uses robust set capabilities detect mobile device risks real-time applies machine learning analytics offer actionable insights suspicious mobile user behavior threat detection capabilities include real-time overlay attacks emulators sms stealers remote access tools rats insecure wi-fi networks active pharming rooting jailbreaking uses server-side trusteer pinpoint capabilities correlated aggregated awareness device anomalies user behavior account risk indicators\u2014such account takeover phishing attacks malware infections compromised credentials advanced evasion methods\u2014across digital channels also works seamlessly trusteer pinpoint platform detect protect mobile device fraudulent activity early digital account creation process guest user new mobile device introduced trusteer apex automated solution tries prevent exploits malware compromising endpoints extracting information apex three layers security exploit prevention data exfiltration prevention credentials protection apex protects employee credentials phishing attacks validating employees submitting credentials authorized enterprise web-application login urls apex also prevents corporate employees re-using corporate credentials access non-corporate public applications like paypal e-bay facebook twitter apex requires users provide different credentials applications lower risk credentials exposure trusteer apex targeted behaviors small group applications hypothesis responsible overwhelming majority exploits namely java adobe \u2019 reader flash microsoft \u2019 office technology behind trusteer apex rely threat signatures so-called whitelists good applications instead watches applications run spots suspicious malicious behavior based knowledge normal application behavior refined large user base trusteer claims apex block web-based attacks used implant malware exploiting vulnerable applications data loss due malware infections spotting attempts untrusted applications processes send data outside organization connect internet-based command control c c networks end users reported problems rapport slow pcs due high cpu ram utilization incompatibility various security/antivirus products difficulty removing software presentation given 44con september 2011 bypassing trusteer rapport keylogger protection shown relatively trivial shortly thereafter trusteer confirmed flaw corrected said even hacker able use flaw disable anti-keylogging functions rapport secondary security protection technologies would still play rapport software incompatible windows tool driver verifier may cause blue screen system crash since driver verifier intended end users production environment workstations trusteer support recommends end users run driver verifier trusteer endpoint protection installed march 2011 blue gem rival company filed lawsuit trusteer california court blue gem accused trusteer plagiarizing code order maintain compatibility anti-keystroke logging software types intel chipset first introduced back 2007 trusteer described accusations baseless", + "neighbors": [ + 576, + 579, + 766, + 893, + 915 + ], + "mask": "Test" + }, + { + "node_id": 731, + "label": 4, + "text": "F5_Networks:f5 networks f5 networks inc. global company specializes application services application delivery networking adn f5 technologies focus delivery security performance availability web applications well availability servers cloud resources data storage devices networking components f5 headquartered seattle washington additional development manufacturing sales/marketing offices worldwide known originally load balancing product today f5 product services line expanded things related delivery applications including local load balancing acceleration global dns based load balancing acceleration security web application firewall application authentication access products ddos defense f5 technologies available data center cloud including private public multi-cloud environments based platforms aws microsoft azure google cloud openstack f5 networks originally named f5 labs established 1996 company name inspired 1996 movie twister reference made fastest powerful tornado fujita scale f5 f5 first product launched 1997 load balancer called big-ip server went became overloaded big-ip directed traffic away server servers could handle load june 1999 company initial public offering listed nasdaq stock exchange symbol ffiv 2010 2011 f5 networks fortune list 100 fastest-growing companies company also rated one top ten best-performing stocks p 500 2010 f5 also named best place work online jobs recruiting site glassdoor 2015 2016 competitors included cisco systems 2012 citrix systems radware fran\u00e7ois locoh-donou replaced john mcadam president ceo april 3 2017 may 3 2017 f5 announced would move longtime headquarters waterfront near seattle center new downtown seattle skyscraper called f5 tower move occur early 2019 2017 f5 launched dedicated site organization focused gathering global threat intelligence data analyzing application threats publishing related findings dubbed \u201c f5 labs \u201d nod company \u2019 history team continues research application threats publish findings every week benefit broader security community 2019 f5 networks occupies leading position ranking popular companies wikipedia f5 big-ip product family comprises hardware modularized software virtual appliances run f5 tmos operating system depending appliance selected one big-ip product modules added offerings include september 7 2004 f5 networks released version 9.0 big-ip software addition appliances run software version 9.0 also marked introduction company tmos architecture significant enhancements including subsequent releases enhanced performance improves application security supported cloud application deployments f5 describes big-iq framework managing big-ip devices application services irrespective form factors hardware software cloud deployment model on-premises private/public cloud hybrid big-iq supports integration ecosystem participants public cloud providers orchestration engines cloud connectors set open restful apis big-iq uses multi-tenant approach management allows organizations move closer service without concern might affect stability security services fabric silverline cloud-based application service offerings include security services waf ddos protection services 2017 company introduced technologies make f5 capabilities portable across broader range environments including", + "neighbors": [ + 85, + 94, + 134, + 189, + 363, + 473, + 476, + 569, + 611, + 648, + 656, + 678, + 685, + 731, + 762, + 857, + 910, + 965, + 1101, + 1250, + 1257, + 1403, + 1406, + 1408, + 1462, + 1514, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 732, + "label": 5, + "text": "Explicit_Congestion_Notification:explicit congestion notification explicit congestion notification ecn extension internet protocol transmission control protocol defined rfc 3168 2001 ecn allows end-to-end notification network congestion without dropping packets ecn optional feature may used two ecn-enabled endpoints underlying network infrastructure also supports conventionally tcp/ip networks signal congestion dropping packets ecn successfully negotiated ecn-aware router may set mark ip header instead dropping packet order signal impending congestion receiver packet echoes congestion indication sender reduces transmission rate detected dropped packet rather responding properly ignoring bits outdated faulty network equipment historically dropped mangled packets ecn bits set measurements suggested fraction web servers public internet setting ecn prevents network connections reduced less 1 passive support existed ubuntu linux since 12.04 windows server since 2012 passive support popular websites increased 8.5 2012 70 may 2017 adoption across internet requires clients actively request ecn june 2015 apple announced ecn enabled default supported future products help drive adoption ecn signaling industry-wide ecn requires specific support internet layer transport layer following reasons without ecn congestion indication echo achieved indirectly detection lost packets ecn congestion indicated setting ecn field within ip packet ce echoed back receiver transmitter setting proper bits header transport protocol example using tcp congestion indication echoed back setting ece bit ecn uses two least significant right-most bits diffserv field ipv4 ipv6 header encode four different code points endpoints support ecn mark packets ect 0 ect 1 packet traverses active queue management aqm queue e.g. queue uses random early detection red experiencing congestion corresponding router supports ecn may change code point codice_5 instead dropping packet act referred \u201c marking \u201d purpose inform receiving endpoint impending congestion receiving endpoint congestion indication handled upper layer protocol transport layer protocol needs echoed back transmitting node order signal reduce transmission rate ce indication handled effectively upper layer protocol supports ecn used conjunction upper layer protocols tcp support congestion control method echoing ce indication transmitting endpoint tcp supports ecn using two flags tcp header first ecn-echo ece used echo back congestion indication i.e signal sender reduce amount information sends second congestion window reduced cwr acknowledge congestion-indication echoing received use ecn tcp connection optional ecn used must negotiated connection establishment including suitable options syn syn-ack segments ecn negotiated tcp connection sender indicates ip packets carry tcp segments connection carrying traffic ecn capable transport marking ect code point allows intermediate routers support ecn mark ip packets ce code point instead dropping order signal impending congestion upon receiving ip packet congestion experienced code point tcp receiver echoes back congestion indication using ece flag tcp header endpoint receives tcp segment ece bit reduces congestion window packet drop acknowledges congestion indication sending segment cwr bit set node keeps transmitting tcp segments ece bit set receives segment cwr bit set see affected packets tcpdump use filter predicate codice_6 since transmission control protocol tcp perform congestion control control packets pure acks syn fin segments control packets usually marked ecn-capable 2009 proposal suggests marking syn-ack packets ecn-capable improvement known ecn+ shown provide dramatic improvements performance short-lived tcp connections ecn also defined transport layer protocols perform congestion control notably dccp stream control transmission protocol sctp general principle similar tcp although details on-the-wire encoding differ principle possible use ecn protocols layered udp however udp requires congestion control performed application current networking apis give access ecn bits since ecn effective combination active queue management aqm policy benefits ecn depend precise aqm used observations however appear hold across different aqms expected ecn reduces number packets dropped tcp connection avoiding retransmission reduces latency especially jitter effect drastic tcp connection single outstanding segment able avoid rto timeout often case interactive connections remote logins transactional protocols http requests conversational phase smtp sql requests effects ecn bulk throughput less clear modern tcp implementations fairly good resending dropped segments timely manner sender window large use ecn found detrimental performance highly congested networks using aqm algorithms never drop packets modern aqm implementations avoid pitfall dropping rather marking packets high load many modern implementations tcp/ip protocol suite support ecn however usually ship ecn disabled windows versions since windows server 2008 windows vista support ecn tcp since windows server 2012 enabled default windows server versions data center transmission control protocol dctcp used previous windows versions non-server versions disabled default ecn support enabled using shell command freebsd 8.0 netbsd 4.0 implement ecn support tcp activated sysctl interface setting 1 value parameter likewise sysctl used openbsd since version 2.4.20 linux kernel released november 2002 linux supports three working modes ecn tcp configured sysctl interface setting parameter one following values beginning version 4.1 linux kernel released june 2015 mechanism specified rfc 3168 section 6.1.1.1 enabled default ecn enabled value 1 fallback mechanism attempts ecn connectivity initial setup outgoing connections graceful fallback transmissions without ecn capability mitigating issues ecn-intolerant hosts firewalls mac os x 10.5 10.6 implement ecn support tcp controlled using boolean sysctl variables first variable enables ecn incoming connections already ecn flags set second one tries initiate outgoing connections ecn enabled variables default set enable respective behavior june 2015 apple inc. announced os x 10.11 released later year would ecn turned default never happened macos sierra ecn enabled 50 percent tcp sessions june 2015 apple inc. announced ios 9 next version ios would support ecn turned default tcp ecn negotiation enabled 5 randomly selected connections wi-fi ethernet ios 9 50 randomly selected connections wi-fi ethernet cellular carriers ios 10 100 ios 11 solaris kernel supports three states ecn tcp default behavior solaris 11 full ecn usage activated via since ecn marking routers dependent form active queue management routers must configured suitable queue discipline order perform ecn marking cisco ios routers perform ecn marking configured wred queuing discipline since version 12.2 8 t. linux routers perform ecn marking configured one red gred queue disciplines explicit ecn parameter using sfb discipline using codel fair queuing fq_codel discipline cake queuing discipline modern bsd implementations freebsd netbsd openbsd support ecn marking altq queueing implementation number queuing disciplines notably red blue freebsd 11 included codel pie fq-codel fq-pie queuing disciplines implementation ipfw/dummynet framework ecn marking capability data center transmission control protocol data center tcp dctcp utilizes ecn enhance transmission control protocol congestion control algorithm used data center networks whereas standard tcp congestion control algorithm able detect presence congestion dctcp using ecn able gauge extent congestion dctcp modifies tcp receiver always relay exact ecn marking incoming packets cost ignoring function meant preserve signalling reliability makes dctcp sender vulnerable loss acks receiver mechanism detect cope algorithms provide equivalent better receiver feedback reliable approach active research topic", + "neighbors": [ + 52, + 109, + 252, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 877, + 1116, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 733, + "label": 0, + "text": "Automatic_summarization:automatic summarization automatic summarization process shortening text document software order create summary major points original document technologies make coherent summary take account variables length writing style syntax automatic data summarization part machine learning data mining main idea summarization find subset data contains information entire set techniques widely used industry today search engines example others include summarization documents image collections videos document summarization tries create representative summary abstract entire document finding informative sentences image summarization system finds representative important i.e salient images surveillance videos one might want extract important events uneventful context two general approaches automatic summarization extraction abstraction extractive methods work selecting subset existing words phrases sentences original text form summary contrast abstractive methods build internal semantic representation use natural language generation techniques create summary closer human might express summary might include verbal innovations research date focused primarily extractive methods appropriate image collection summarization video summarization summarization task automatic system extracts objects entire collection without modifying objects examples include keyphrase extraction goal select individual words phrases tag document document summarization goal select whole sentences without modifying create short paragraph summary similarly image collection summarization system extracts images collection without modifying images extraction techniques merely copy information deemed important system summary example key clauses sentences paragraphs abstraction involves paraphrasing sections source document general abstraction condense text strongly extraction programs harder develop require use natural language generation technology growing field work done abstractive summarization creating abstract synopsis like human majority summarization systems extractive selecting subset sentences place summary machine learning techniques closely related fields information retrieval text mining successfully adapted help automatic summarization apart fully automated summarizers fas systems aid users task summarization mahs machine aided human summarization example highlighting candidate passages included summary systems depend post-processing human hams human aided machine summarization broadly two types extractive summarization tasks depending summarization program focuses first generic summarization focuses obtaining generic summary abstract collection whether documents sets images videos news stories etc. second query relevant summarization sometimes called query-based summarization summarizes objects specific query summarization systems able create query relevant text summaries generic machine-generated summaries depending user needs example summarization problem document summarization attempts automatically produce abstract given document sometimes one might interested generating summary single source document others use multiple source documents example cluster articles topic problem called multi-document summarization related application summarizing news articles imagine system automatically pulls together news articles given topic web concisely represents latest news summary image collection summarization another application example automatic summarization consists selecting representative set images larger set images summary context useful show representative images results image collection exploration system video summarization related domain system automatically creates trailer long video also applications consumer personal videos one might want skip boring repetitive actions similarly surveillance videos one would want extract important suspicious activity ignoring boring redundant frames captured high level summarization algorithms try find subsets objects like set sentences set images cover information entire set also called core-set algorithms model notions like diversity coverage information representativeness summary query based summarization techniques additionally model relevance summary query techniques algorithms naturally model summarization problems textrank pagerank submodular set function determinantal point process maximal marginal relevance mmr etc task following given piece text journal article must produce list keywords key phrase capture primary topics discussed text case research articles many authors provide manually assigned keywords text lacks pre-existing keyphrases example news articles rarely keyphrases attached would useful able automatically number applications discussed consider example text news article keyphrase extractor might select army corps engineers president bush new orleans defective flood-control pumps keyphrases pulled directly text contrast abstractive keyphrase system would somehow internalize content generate keyphrases appear text closely resemble human might produce political negligence inadequate protection floods abstraction requires deep understanding text makes difficult computer system keyphrases many applications enable document browsing providing short summary improve information retrieval documents keyphrases assigned user could search keyphrase produce reliable hits full-text search employed generating index entries large text corpus depending different literature definition key terms words phrases keyword extraction highly related theme beginning work turney many researchers approached keyphrase extraction supervised machine learning problem given document construct example unigram bigram trigram found text though text units also possible discussed compute various features describing example e.g. phrase begin upper-case letter assume known keyphrases available set training documents using known keyphrases assign positive negative labels examples learn classifier discriminate positive negative examples function features classifiers make binary classification test example others assign probability keyphrase instance text might learn rule says phrases initial capital letters likely keyphrases training learner select keyphrases test documents following manner apply example-generation strategy test documents run example learner determine keyphrases looking binary classification decisions probabilities returned learned model probabilities given threshold used select keyphrases keyphrase extractors generally evaluated using precision recall precision measures many proposed keyphrases actually correct recall measures many true keyphrases system proposed two measures combined f-score harmonic mean two f 2 pr p r matches proposed keyphrases known keyphrases checked stemming applying text normalization designing supervised keyphrase extraction system involves deciding several choices apply unsupervised first choice exactly generate examples turney others used possible unigrams bigrams trigrams without intervening punctuation removing stopwords hulth showed get improvement selecting examples sequences tokens match certain patterns part-of-speech tags ideally mechanism generating examples produces known labeled keyphrases candidates though often case example use unigrams bigrams trigrams never able extract known keyphrase containing four words thus recall may suffer however generating many examples also lead low precision also need create features describe examples informative enough allow learning algorithm discriminate keyphrases non- keyphrases typically features involve various term frequencies many times phrase appears current text larger corpus length example relative position first occurrence various boolean syntactic features e.g. contains caps etc turney paper used 12 features hulth uses reduced set features found successful kea keyphrase extraction algorithm work derived turney \u2019 seminal paper end system need return list keyphrases test document need way limit number ensemble methods i.e. using votes several classifiers used produce numeric scores thresholded provide user-provided number keyphrases technique used turney c4.5 decision trees hulth used single binary classifier learning algorithm implicitly determines appropriate number examples features created need way learn predict keyphrases virtually supervised learning algorithm could used decision trees naive bayes rule induction case turney genex algorithm genetic algorithm used learn parameters domain-specific keyphrase extraction algorithm extractor follows series heuristics identify keyphrases genetic algorithm optimizes parameters heuristics respect performance training documents known key phrases another keyphrase extraction algorithm textrank supervised methods nice properties like able produce interpretable rules features characterize keyphrase also require large amount training data many documents known keyphrases needed furthermore training specific domain tends customize extraction process domain resulting classifier necessarily portable turney results demonstrate unsupervised keyphrase extraction removes need training data approaches problem different angle instead trying learn explicit features characterize keyphrases textrank algorithm exploits structure text determine keyphrases appear central text way pagerank selects important web pages recall based notion prestige recommendation social networks way textrank rely previous training data rather run arbitrary piece text produce output simply based text intrinsic properties thus algorithm easily portable new domains languages textrank general purpose graph-based ranking algorithm nlp essentially runs pagerank graph specially designed particular nlp task keyphrase extraction builds graph using set text units vertices edges based measure semantic lexical similarity text unit vertices unlike pagerank edges typically undirected weighted reflect degree similarity graph constructed used form stochastic matrix combined damping factor random surfer model ranking vertices obtained finding eigenvector corresponding eigenvalue 1 i.e. stationary distribution random walk graph vertices correspond want rank potentially could something similar supervised methods create vertex unigram bigram trigram etc however keep graph small authors decide rank individual unigrams first step include second step merges highly ranked adjacent unigrams form multi-word phrases nice side effect allowing us produce keyphrases arbitrary length example rank unigrams find advanced natural language processing get high ranks would look original text see words appear consecutively create final keyphrase using four together note unigrams placed graph filtered part speech authors found adjectives nouns best include thus linguistic knowledge comes play step edges created based word co-occurrence application textrank two vertices connected edge unigrams appear within window size n original text n typically around 2\u201310 thus natural language might linked text nlp natural processing would also linked would appear string n words edges build notion text cohesion idea words appear near likely related meaningful way recommend reader since method simply ranks individual vertices need way threshold produce limited number keyphrases technique chosen set count user-specified fraction total number vertices graph top vertices/unigrams selected based stationary probabilities post- processing step applied merge adjacent instances unigrams result potentially less final keyphrases produced number roughly proportional length original text initially clear applying pagerank co-occurrence graph would produce useful keyphrases one way think following word appears multiple times throughout text may many different co-occurring neighbors example text machine learning unigram learning might co-occur machine supervised un-supervised semi-supervised four different sentences thus learning vertex would central hub connects modifying words running pagerank/textrank graph likely rank learning highly similarly text contains phrase supervised classification would edge supervised classification classification appears several places thus many neighbors importance would contribute importance supervised ends high rank selected one top unigrams along learning probably classification final post-processing step would end keyphrases supervised learning supervised classification short co-occurrence graph contain densely connected regions terms appear often different contexts random walk graph stationary distribution assigns large probabilities terms centers clusters similar densely connected web pages getting ranked highly pagerank approach also used document summarization considered like keyphrase extraction document summarization aims identify essence text real difference dealing larger text units\u2014whole sentences instead words phrases getting details summarization methods mention summarization systems typically evaluated common way using so-called rouge recall-oriented understudy gisting evaluation measure recall-based measure determines well system-generated summary covers content present one human-generated model summaries known references recall-based encourage systems include important topics text recall computed respect unigram bigram trigram 4-gram matching example rouge-1 computed division count unigrams reference appear system count unigrams reference summary multiple references rouge-1 scores averaged rouge based content overlap determine general concepts discussed automatic summary reference summary determine result coherent sentences flow together sensible manner high-order n-gram rouge measures try judge fluency degree note rouge similar bleu measure machine translation bleu precision- based translation systems favor accuracy promising line document summarization adaptive document/text summarization idea adaptive summarization involves preliminary recognition document/text genre subsequent application summarization algorithms optimized genre first summarizes perform adaptive summarization created supervised text summarization much like supervised keyphrase extraction basically collection documents human-generated summaries learn features sentences make good candidates inclusion summary features might include position document i.e. first sentences probably important number words sentence etc main difficulty supervised extractive summarization known summaries must manually created extracting sentences sentences original training document labeled summary summary typically people create summaries simply using journal abstracts existing summaries usually sufficient sentences summaries necessarily match sentences original text would difficult assign labels examples training note however natural summaries still used evaluation purposes since rouge-1 cares unigrams duc 2001 2002 evaluation workshops tno developed sentence extraction system multi-document summarization news domain system based hybrid system using naive bayes classifier statistical language models modeling salience although system exhibited good results researchers wanted explore effectiveness maximum entropy classifier meeting summarization task known robust feature dependencies maximum entropy also applied successfully summarization broadcast news domain unsupervised approach summarization also quite similar spirit unsupervised keyphrase extraction gets around issue costly training data unsupervised summarization approaches based finding centroid sentence mean word vector sentences document sentences ranked regard similarity centroid sentence principled way estimate sentence importance using random walks eigenvector centrality lexrank algorithm essentially identical textrank use approach document summarization two methods developed different groups time lexrank simply focused summarization could easily used keyphrase extraction nlp ranking task lexrank textrank graph constructed creating vertex sentence document edges sentences based form semantic similarity content overlap lexrank uses cosine similarity tf-idf vectors textrank uses similar measure based number words two sentences common normalized sentences lengths lexrank paper explored using unweighted edges applying threshold cosine values also experimented using edges weights equal similarity score textrank uses continuous similarity scores weights algorithms sentences ranked applying pagerank resulting graph summary formed combining top ranking sentences using threshold length cutoff limit size summary worth noting textrank applied summarization exactly described lexrank used part larger summarization system mead combines lexrank score stationary probability features like sentence position length using linear combination either user-specified automatically tuned weights case training documents might needed though textrank results show additional features absolutely necessary another important distinction textrank used single document summarization lexrank applied multi-document summarization task remains cases\u2014only number sentences choose grown however summarizing multiple documents greater risk selecting duplicate highly redundant sentences place summary imagine cluster news articles particular event want produce one summary article likely many similar sentences would want include distinct ideas summary address issue lexrank applies heuristic post-processing step builds summary adding sentences rank order discards sentences similar ones already placed summary method used called cross-sentence information subsumption csis methods work based idea sentences recommend similar sentences reader thus one sentence similar many others likely sentence great importance importance sentence also stems importance sentences recommending thus get ranked highly placed summary sentence must similar many sentences turn also similar many sentences makes intuitive sense allows algorithms applied arbitrary new text methods domain-independent easily portable one could imagine features indicating important sentences news domain might vary considerably biomedical domain however unsupervised recommendation -based approach applies domain multi-document summarization automatic procedure aimed extraction information multiple texts written topic resulting summary report allows individual users professional information consumers quickly familiarize information contained large cluster documents way multi-document summarization systems complementing news aggregators performing next step road coping information overload multi-document summarization may also done response question multi-document summarization creates information reports concise comprehensive different opinions put together outlined every topic described multiple perspectives within single document goal brief summary simplify information search cut time pointing relevant source documents comprehensive multi-document summary contain required information hence limiting need accessing original files cases refinement required automatic summaries present information extracted multiple sources algorithmically without editorial touch subjective human intervention thus making completely unbiased multi-document extractive summarization faces problem potential redundancy ideally would like extract sentences central i.e. contain main ideas diverse i.e. differ one another lexrank deals diversity heuristic final stage using csis systems used similar methods maximal marginal relevance mmr trying eliminate redundancy information retrieval results general purpose graph-based ranking algorithm like page/lex/textrank handles centrality diversity unified mathematical framework based absorbing markov chain random walks absorbing random walk like standard random walk except states absorbing states act black holes cause walk end abruptly state algorithm called grasshopper addition explicitly promoting diversity ranking process grasshopper incorporates prior ranking based sentence position case summarization state art results multi-document summarization however obtained using mixtures submodular functions methods achieved state art results document summarization corpora duc 04 07 similar results also achieved use determinantal point processes special case submodular functions duc-04 new method multi-lingual multi-document summarization avoids redundancy works simplifying generating ideograms represent meaning sentence document evaluates similarity qualitatively comparing shape position said ideograms recently developed tool use word frequency need training preprocessing kind works generating ideograms represent meaning sentence summarizes using two user-supplied parameters equivalence two sentences considered equivalent relevance long desired summary simplish simplifying summarizing tool performs automatic multi-lingual multi-document summarization idea submodular set function recently emerged powerful modeling tool various summarization problems submodular functions naturally model notions coverage information representation diversity moreover several important combinatorial optimization problems occur special instances submodular optimization example set cover problem special case submodular optimization since set cover function submodular set cover function attempts find subset objects cover given set concepts example document summarization one would like summary cover important relevant concepts document instance set cover similarly facility location problem special case submodular functions facility location function also naturally models coverage diversity another example submodular optimization problem using determinantal point process model diversity similarly maximum-marginal-relevance procedure also seen instance submodular optimization important models encouraging coverage diversity information submodular moreover submodular functions efficiently combined together resulting function still submodular hence one could combine one submodular function models diversity another one models coverage use human supervision learn right model submodular function problem submodular functions fitting problems summarization also admit efficient algorithms optimization example simple greedy algorithm admits constant factor guarantee moreover greedy algorithm extremely simple implement scale large datasets important summarization problems submodular functions achieved state-of-the-art almost summarization problems example work lin bilmes 2012 shows submodular functions achieve best results date duc-04 duc-05 duc-06 duc-07 systems document summarization similarly work lin bilmes 2011 shows many existing systems automatic summarization instances submodular functions breakthrough result establishing submodular functions right models summarization problems submodular functions also used summarization tasks tschiatschek et al. 2014 show mixtures submodular functions achieve state-of-the-art results image collection summarization similarly bairi et al. 2015 show utility submodular functions summarizing multi-document topic hierarchies submodular functions also successfully used summarizing machine learning datasets specific applications automatic summarization include common way evaluate informativeness automatic summaries compare human-made model summaries evaluation techniques fall intrinsic extrinsic inter-textual intra-textual intrinsic evaluation tests summarization system extrinsic evaluation tests summarization based affects completion task intrinsic evaluations assessed mainly coherence informativeness summaries extrinsic evaluations hand tested impact summarization tasks like relevance assessment reading comprehension etc intra-textual methods assess output specific summarization system inter-textual ones focus contrastive analysis outputs several summarization systems human judgement often wide variance considered good summary means making evaluation process automatic particularly difficult manual evaluation used time labor-intensive requires humans read summaries also source documents issues concerning coherence coverage one metrics used nist annual document understanding conferences research groups submit systems summarization translation tasks rouge metric recall-oriented understudy gisting evaluation essentially calculates n-gram overlaps automatically generated summaries previously-written human summaries high level overlap indicate high level shared concepts two summaries note overlap metrics like unable provide feedback summary coherence anaphor resolution remains another problem yet fully solved similarly image summarization tschiatschek et al. developed visual-rouge score judges performance algorithms image summarization domain independent summarization techniques generally apply sets general features used identify information-rich text segments recent research focus drifted domain-specific summarization techniques utilize available knowledge specific domain text example automatic summarization research medical text generally attempts utilize various sources codified medical knowledge ontologies main drawback evaluation systems existing far need least one reference summary methods one able compare automatic summaries models hard expensive task much effort done order corpus texts corresponding summaries furthermore methods need human-made summaries available comparison also manual annotation performed e.g scu pyramid method case evaluation methods need input set summaries serve gold standards set automatic summaries moreover perform quantitative evaluation regard different similarity metrics", + "neighbors": [ + 159, + 307, + 368, + 372, + 453, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 734, + "label": 5, + "text": "RSSOwl:rssowl rssowl news aggregator rss atom news feeds written java built eclipse rich client platform uses swt widget toolkit allow fit look feel different operating systems remaining cross-platform released eclipse public license rssowl free software addition full text searches saved searches notifications filters rssowl v2.1 synchronized discontinued google reader rssowl began small project sourceforge end july 2003 first public version 0.3a rssowl 1.0 released december 19 2001 released support rss atom news feeds initial release also supported exporting feeds pdf rtf html release available windows mac linux solaris rssowl 1.1 added support toolbars quicksearch news feeds version 1.2 improved toolbar customization added support atom 1.0 news feeds versions 1.2.1 1.2.2 added universal binary support mac well drag drop tabs built feed validator rssowl sourceforge project month january 2005 rssowl 2.0 announced march 7 2007 eclipsecon 2007 version 2.0 rebuilt eclipse rich client platform used db4o database storage lucene text searching several milestone versions released final 2.0 version added labeling news feeds pop-up notification new feeds storage news articles news bins final 2.0 version released milestone 9 added support secure password credential storage news filters support embedding firefox 3.0 xulrunner render news feeds proxy support windows rssowl 2.1 released july 15 2011 google reader synchronization support new layouts rssowl longer maintained original developer however maintained fork available known rssowlnix rssowl translated many languages bengali bulgarian czech chinese simplified chinese traditional danish dutch english finnish french galician german greek hungarian italian japanese korean norwegian polish portuguese russian serbian cyrillic serbian latin slovenian spanish swedish thai turkish ukrainian", + "neighbors": [ + 95, + 258, + 277, + 582, + 585, + 623, + 646, + 796, + 886, + 1138, + 1166, + 1228, + 1339, + 1423, + 1563, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 735, + "label": 2, + "text": "FlexOS:flexos flexos discontinued modular real-time multiuser multitasking operating system rtos designed computer-integrated manufacturing laboratory retail financial markets developed digital research flexible automation business unit monterey california since november 1986 marketed since january 1987 reengineered continuation digital research concurrent dos 286 multiuser multitasking operating system flexos designed frank holsworth like portable cp/m concurrent dos 286 concurrent dos 68k concurrent dos v60 flexos written c higher portability across hardware platforms featured low interrupt latency fast context switching supported popular ssl/tls libraries wolfssl original protected mode flexos 286 version 1.3 designed host machines equipped 286 cpus adaptations nec v60 nec v70 motorola 68000 processors planned flexos 286 executables using system native int dch int 220 application program interface filename extension .286 cp/m api front-end fe available well using extension .cmd executables filename extension .68k reserved flexos 68k file extension derived concurrent dos 68k 1986 may 1987 flexos version 1.31 released 80286 machines developer version required ibm pc/at-compatible machine 640 kb conventional 512 kb extended memory either monochrome cga ega graphics adapter flexos supported concept dynamically loadable unloadable subdrivers came driver prototypes floppies hard disks printers serial interfaces ram disks mice console drivers boot flex286.sys kernel would load resource managers device drivers specified config.sys binary file mixed similarly named config.sys configuration file dos shell command.286 would execute config.bat startup batch job instead common autoexec.bat flexos optional dos emulator provided limited pc dos 2.1 compatibility dos .com .exe programs certain restrictions applied since programs executed processor protected mode due bugs earlier steppings intel 80286 flexos 286 dos front-end required least 80286 e2 stepping function properly see loadall problems already caused delays delivery concurrent dos 286 earlier system optionally supported multitasking gem vdi graphical applications flexos 1.31 could linked none either two modules flexos 1.31 also supported flexnet june 1987 also versions 1.0 flexos 386 hosts flexos 186 remote cell controllers flexos 386 provided windowing feature offered pc dos 3.2 gem compatibility flexos 286 flexos 386 versions 2.0 registered 3 july 1989 among major flexos customers 1990/1991 fanuc ibm icl nixdorf siemens tec thorn emi software micrologic novell bought digital research july 1991 x/gem flexos release 1.0 a.k.a x/gem flexos 286 386 flexnet registered 21 december 1992 flexos used primary test platform new novell embedded systems technology nest novell decided abandon development various digital research operating systems multiuser dos successor concurrent dos novell dos successor dr dos sold flexos santa clara california-based integrated systems inc. isi july 1994 deal comprised direct payment half sum well shares representing 2 company company already psos+ another modular real-time multitasking operating system embedded systems continued maintain flexos well flexos version 2.33 current may 1998 flexos 2.34 released soon added support faster cpus 64 mb memory eide atapi cdrom drives integrated systems bought competitor wind river systems february 2000 owned intel since 2009 following list commands supported flexos known flexos versions include motorola 68000 freescale/nxp coldfire mcf5251 platform intel 80286 platform intel 80186/nec v20/v30 platform intel 80386 platform nec v60 platform named ibm 4680 os version 1 ibm originally chose dr concurrent dos 286 basis ibm 4680 computer ibm plant system products point-of-sale terminals 1986 last release ibm 4680 os version 4 replaced ibm 4690 version 1 versions july 1993 ibm announced adoption flexos version 2.32 basis ibm 4690 os version 1 pre-released 24 september 1993 generally made available 25 march 1994 flexos 2.32 supported 286 386 modes efficient memory management better console pipe systems brought overall quality performance improvements compared version came ibm 4680 os version 4 removed limits number applications running concurrently due efficient use kospool order support java ibm 4690 os version 2 brought support long filenames means virtual filesystem vfs architecture introduced fat32 volumes according year store ihl consulting group/ris news ibm 4690 os still market share 12 pos register/client market june 2005 ibm starting phase favour ibm retail environment suse ires ibm continue maintain 4690 os april 2015 recent version released ibm may 2012 ibm 4690 os version 6 release 3 meanwhile toshiba released toshiba 4690 os version 6 release 4 january 2014 siemens used still maintains flexos factory automation equipment well example s5 step-5 operating system s5-dos/mt based flexos 386 x/gem flexnet btrieve whereas smaller s5-dos system also present systems variant digital research personal cp/m-86 siemens industrial systems like coros ls-b/flexos coros os-b/flexos gracis/flexos os-525 flexos x/gem-based computers pc 16-20 pc 32 series available flexos well japanese post office shared terminals iii ctm iv based flexos", + "neighbors": [ + 22, + 142, + 185, + 187, + 233, + 306, + 322, + 349, + 377, + 735, + 754, + 870, + 1022, + 1188, + 1202, + 1346, + 1397, + 1430, + 1468, + 1494, + 1546 + ], + "mask": "Validation" + }, + { + "node_id": 736, + "label": 2, + "text": "SystemTap:systemtap computing systemtap codice_1 scripting language tool dynamically instrumenting running production linux kernel-based operating systems system administrators use systemtap extract filter summarize data order enable diagnosis complex performance functional problems systemtap consists free open-source software includes contributions red hat ibm intel hitachi oracle community members systemtap debuted 2005 red hat enterprise linux 4 update 2 technology preview four years development systemtap 1.0 released 2009 tracepoints cpython vm jvm added systemtap 1.2 systemtap files written systemtap language saved codice_2 files run codice_1 command-line system carries number analysis passes script allowing run scripts may executed one three backends selected codice_4 option default loadable kernel module fullest capability inspect manipulate part system therefore requires privilege another backend based dynamic program analysis library dyninst instrument user user-space programs requires least privilege newest backend based ebpf byte-code limited linux kernel interpreter capabilities requires intermediate level privilege case module unloaded script finished running scripts generally focus events starting finishing script compiled-in probe points linux tracepoints execution functions statements kernel user-space guru mode scripts may also embedded c may run codice_5 command-line option however use guru mode discouraged systemtap release includes probe points designed remove need guru-mode scripts guru mode required order permit scripts modify state instrumented software apply types emergency security fixes systemtap release 1.7 software implements new stapsys group privilege level following script shows applications setting tcp socket options system options set whether option set successfully many examples shipped systemtap also real-world examples systemtap use war stories page systemtap attach dtrace markers compiled application using macros codice_6 header file", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 294, + 305, + 306, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1511, + 1524, + 1526, + 1552, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 737, + "label": 7, + "text": "ProActive:proactive proactive parallel suite open-source software enterprise workload orchestration part ow2 community workflow model allows define set executables scripts written scripting language along dependencies proactive parallel suite schedule orchestrate executions optimising use computational resources hood proactive parallel suite relies active object -based java framework optimise task distribution ensure fault-tolerance model created denis caromel professor university nice sophia antipolis several extensions model made later members oasis team inria book theory distributed objects presents asp calculus formalizes proactive features provides formal semantics calculus together properties proactive program execution active objects basic units activity distribution used building concurrent applications using proactive active object runs thread thread executes methods invoked active object active objects passive objects subsystem belongs active object proactive programmer explicitly manipulate thread objects unlike standard java active objects created hosts involved computation active object created activity fact runs thread location local remote perfectly transparent active object manipulated passive instance class active object composed two objects body standard java object body visible outside active object body responsible receiving calls requests active object storing queue pending calls executes calls order specified synchronization policy synchronization policy specified calls managed first first fifo manner thread active object chooses method queue pending requests executes parallelism provided inside active object important decision proactive design enabling use pre-post conditions class invariants side subsystem sends call active object active object represented proxy proxy generates future objects representing future values transforms calls request objects terms metaobject reification performs deep copies passive objects passed parameters proactive library designed developing applications model introduced eiffel// parallel extension eiffel programming language model application structured subsystems one active object therefore one thread subsystem one subsystem active object thread subsystem thus composed one active object number passive objects\u2014possibly passive objects thread one subsystem executes methods objects subsystem shared passive objects subsystems features impact application topology objects make subsystem\u2014the active object passive objects\u2014only active object known objects outside subsystem objects active passive may references onto active objects object o1 reference onto passive object o2 o1 o2 part subsystem also consequences semantics message-passing subsystems object subsystem calls method active object parameters call may references passive objects subsystem would lead shared passive objects passive objects passed parameters calls active objects always passed deep-copy active objects hand always passed reference symmetrically also applies objects returned methods called active objects thanks concepts asynchronous calls futures data sharing application written proactive n't need structural change\u2014actually hardly change all\u2014whether runs sequential multi-threaded distributed environment whenever possible method call active object reified asynchronous request possible call synchronous blocks reply received request asynchronous immediately returns future object future object acts placeholder result not-yet-performed method invocation consequence calling thread go executing code long n't need invoke methods returned object need arises calling thread automatically blocked result method invocation yet available although future object structure similar active object future object active stub proxy code excerpt highlights notion future objects suppose user calls method foo method bar active object foo method returns void bar method returns object class v foo called active object returns immediately current thread execute methods subsystem similarly bar called returns immediately result v ca n't computed yet future object placeholder result method invocation returned point view caller subsystem difference future object object would returned call issued onto passive object methods returned calling thread continues executing code call effectively performed role future mechanism block caller thread gee method called v result yet set inter-object synchronization policy known wait-by-necessity", + "neighbors": [ + 51, + 86, + 123, + 227, + 280, + 314, + 340, + 465, + 507, + 611, + 719, + 796, + 846, + 847, + 876, + 1013, + 1081, + 1099, + 1138, + 1219, + 1220, + 1608, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 738, + "label": 3, + "text": "PowerPC_600:powerpc 600 powerpc 600 family first family powerpc processors built designed somerset facility austin texas jointly funded staffed engineers ibm motorola part aim alliance somerset opened 1992 goal make first powerpc processor keep designing general purpose powerpc processors personal computers first incarnation became powerpc 601 1993 second generation soon followed powerpc 603 powerpc 604 64-bit powerpc 620 powerpc 601 first generation microprocessors support basic 32-bit powerpc instruction set design effort started earnest mid-1991 first prototype chips available october 1992 first 601 processors introduced ibm rs/6000 workstation october 1993 alongside powerful multichip cousin ibm power2 line processors first apple power macintoshes march 14 1994 601 first advanced single-chip implementation power/powerpc architecture designed crash schedule establish powerpc marketplace cement aim alliance order achieve extremely aggressive schedule including substantially new function substantial performance enhancements new instructions importantly power/powerpc first symmetric multiprocessing smp implementation design leveraged number key technologies project management strategies 601 team leveraged much basic structure portions ibm risc single chip rsc processor also included support vast majority new powerpc instructions power instruction set nearly every portion rsc design modified many design blocks substantially modified completely redesigned given completely different unified i/o bus structure smp/memory coherency support new powerpc changes leveraging basic rsc structure beneficial reducing uncertainty chip area/floorplanning timing analysis/tuning worth noting 601 implemented substantial new key functions smp also acted bridge power future powerpc processors assist ibm software developers transitions powerpc start design tape-out first 601 prototype 12 months order push hard establish powerpc market early order help effort rapidly incorporate 88110 bus architecture 601 benefit alliance customers motorola management provided 88110 bus architecture specifications also handful 88110 bus-literate designers help 60x bus logic implementation verification given apple system design team familiar i/o bus structure motorola 88110 i/o bus implementation well defined documented 601 team adopted bus technology improve time market bus renamed 60x bus implemented 601 motorola small number apple designers joined 120 ibm designers creating 601 using 88110 bus basis 60x bus helped schedules number ways helped apple power macintosh team reducing amount redesign support asics reduced amount time required processor designers architects propose document negotiate close new bus interface successfully avoiding bus wars expected 601 management team 88110 bus previous rsc buses n't adopted worthy note accepting 88110 bus benefit apple efforts alliance expense first ibm rs/6000 system design team efforts support asics already implemented around rsc totally different bus structure 60x bus later became fairly long lived basic interface many variants 601 603 604 g3 g4 motorola/freescale powerquicc processors chip designed suit wide variety applications support external l2 cache symmetric multiprocessing four functional units including floating point unit integer unit branch unit sequencer unit processor also included memory management unit integer pipeline four stages long branch pipeline two stages long memory pipeline five stages long floating-point pipeline six stages long first launched ibm systems fall 1993 marketed ibm ppc601 motorola mpc601 operated speeds ranging 50 80 mhz fabricated using 0.6 \u00b5m cmos process four levels aluminum interconnect die 121 mm\u00b2 large contained 2.8 million transistors 601 32 kb unified l1 cache capacity considered large time on-chip cache thanks partly large cache considered high performance processor segment outperforming competing intel pentium powerpc 601 used first power macintosh computers apple variety rs/6000 workstations smp servers ibm groupe bull ibm sole manufacturer 601 601+ microprocessors burlington vermont east fishkill new york production facilities 601 used ibm cmos-4s process 601+ used ibm cmos-5x process extremely small number 601 601+ processors relabeled motorola logos part numbers distributed motorola facts somewhat obscured given various pictures motorola mpc601 particularly one specific case masterful motorola marketing 601 named one time magazine 1994 products year motorola marking updated version powerpc 601v powerpc 601+ operating 90 120 mhz introduced 1994 fabricated newer 0.5 \u00b5m cmos process four levels interconnect resulting die measuring 74 mm\u00b2 601+ design remapped cmos-4s cmos-5x ibm-only team avoid time-to-market delays design tool changes commonizing fab groundrules 601 601+ designed ibm eda tools ibm systems fabricated ibm-only facilities powerpc 603 first processor implementing complete 32-bit powerpc architecture specified designed low cost low end processor portable embedded use one main features power saving functions doze nap sleep mode could dramatically reduce power requirements drawing 2 mw sleep mode 603 four-stage pipeline five execution units integer unit floating point unit branch prediction unit load/store unit system registry unit separate 8 kb l1 caches instructions data 32/64 bit 60x memory bus reaching 75 mhz 603 core hardware support smp powerpc 603 1.6 million transistors fabricated ibm motorola 0.5 \u00b5m cmos process four levels interconnect die 85 mm\u00b2 large drawing 3 w 80 mhz 603 architecture direct ancestor powerpc 750 architecture marketed apple powerpc g3 603 intended used portable apple macintosh computers could run 68k emulation software performance apple considered adequate due smaller processor caches result apple chose use 603 low-cost desktop performa line caused delay apple powerbook 5300 powerbook duo 2300 apple chose wait processor revision apple use 603 performa 5200 line led processor getting poor reputation aside issue 68k emulation performance performa machines shipped variety design flaws severe related aspects computers design including networking performance stability bus problems width speed contention complexity rom bugs hard disk performance none problems 5200 line aside 68k emulation performance inherently due 603 rather processor retrofitted used 68k motherboards obsolete parts site low end mac rates performa 5200 worst mac all-time 603 found widespread use different embedded appliances performance issues 603 addressed powerpc 603e l1 cache enlarged enhanced 16 kb four-way set-associative data instruction caches clock speed processors doubled reaching 200 mhz shrinking fabrication process 0.35 \u00b5m allowed speeds 300 mhz part sometimes called powerpc 603ev 603e 603ev 2.6 million transistors 98 mm\u00b2 78 mm\u00b2 large respectively 603ev draws maximum 6 w 300 mhz powerpc 603e first mainstream desktop processor reach 300 mhz used power macintosh 6500 603e also used accelerator cards phase5 amiga line computers cpus ranging speeds 160 240 mhz powerpc 603e still sold today ibm freescale others like atmel honeywell makes radiation hardened variant rhppc powerpc 603e also heart bebox inc bebox notable since multiprocessing system something 603 n't designed ibm also used powerpc 603e processors thinkpad 800 series laptop computers certain digital oscilloscope series lecroy used powerpc 603e main processor 603e processors also power 66 satellites iridium satellite phone fleet satellites contain seven motorola/freescale powerpc 603e processors running roughly 200 mhz custom 603e processor also used mark 54 lightweight torpedo powerpc 603e core renamed g2 freescale basis many embedded powerquicc ii processors keeps developed freescale powerquicc ii soc processors bear designation mpc82xx come variety configurations reaching 450 mhz freescale enhanced 603e core calling e300 powerquicc ii pro embedded processors larger 32/32 kb l1 caches performance enhancing measures added freescale powerquicc ii pro soc processors bear designation mpc83xx come variety configurations reaching speeds 667 mhz e300 also core mpc5200b soc processor used small efika computer powerpc 604 introduced december 1994 alongside 603 designed high-performance chip workstations entry-level servers support symmetric multiprocessing hardware 604 used extensively apple high-end systems also used macintosh clones ibm low-end rs/6000 servers workstations amiga accelerator boards embedded cpu telecom applications 604 superscalar processor capable issuing four instructions simultaneously 604 six-stage pipeline six execution units work parallel finishing six instructions every cycle two simple one complex integer units one floating point unit one branch processing unit managing out-of-order execution one load/store unit separate 16 kb data instruction l1 caches external interface 32- 64-bit 60x bus operates clock rates 50 mhz powerpc 604 contains 3.6 million transistors fabricated ibm motorola 0.5 \u00b5m cmos process four levels interconnect die measured 12.4 mm 15.8 mm 196 mm\u00b2 drew 14-17 w 133 mhz operated speeds 100 180 mhz powerpc 604e introduced july 1996 added condition register unit separate 32 kb data instruction l1 caches among changes memory subsystem branch prediction unit resulting 25 performance increase compared predecessor 5.1 million transistors manufactured ibm motorola 0.35 \u00b5m cmos process five levels interconnect die 148 mm\u00b2 96 mm\u00b2 large manufactured motorola ibm respectively drawing 16-18 w 233 mhz operated speeds 166 233 mhz supported memory bus 66 mhz powerpc 604ev 604r mach 5 introduced august 1997 essentially 604e fabricated ibm motorola newer process reaching higher speeds lower energy consumption die 47 mm\u00b2 small manufactured 0.25 \u00b5m cmos process five levels interconnect drew 6 w 250 mhz operated speeds 250 400 mhz supported memory bus 100 mhz apple dropped 604ev 1998 favor powerpc 750 ibm kept using entry-level models rs/6000 computers several years powerpc 620 first implementation entire 64-bit powerpc architecture second generation powerpc alongside 603 604 geared towards high-end workstation server market powerful paper initially supposed launched alongside brethren delayed 1997 arrive performance comparably poor considerably cheaper 604e surpassed 620 therefore never produced large quantities found little use sole user powerpc 620 groupe bull escala unix machines n't deliver large numbers ibm intended use workstations servers decided wait even powerful rs64 power3 64-bit processors instead 620 produced motorola 0.5 \u00b5m process 6.9 million transistors die area 311 mm\u00b2 operated clock rates 120 150 mhz drew 30 w 133 mhz later model built using 0.35 \u00b5m process enabling reach 200 mhz 620 similar 604 five-stage pipeline support symmetric multiprocessing number execution units load/store unit branch unit fpu three integer units larger 32 kb instruction data caches support l2 cache may capacity 128 mb powerful branch load/store units buffers 620 powerful branch history table also larger could dispatch instructions processor handle out-of-order execution efficiently 604 floating point unit also enhanced compared 604 faster fetch cycle support several key instruction hardware like sqrt made combined faster wider data buses efficient fpu 604 system bus wider faster 128-bit memory bus called 6xx bus designed system bus multiprocessor systems processors caches memory i/o connected assisted system control chip supports 32- 64-bit powerpc processors memory addresses larger 32 bits numa environments also used power3 rs64 601 well 604-based rs/6000 systems bridge chip bus later evolved gx bus power4 later gx+ gx++ power5 power6 respectively gx bus also used ibm z10 z196 system z mainframes powerpc 602 stripped version powerpc 603 specially made game consoles motorola ibm introduced february 1995 smaller l1 caches 4 kb instruction 4 kb data single-precision floating-point unit scaled back branch prediction unit offered speeds ranging 50 80 mhz drew 1.2 w 66 mhz consisted 1 million transistors 50 mm\u00b2 large manufactured 0.5 \u00b5m cmos process four levels interconnect 3do developed m2 game console used two powerpc 602 never marketed october 21 1996 fabless semiconductor company quantum effect devices qed announced powerpc 603-compatible processor named powerpc 603q microprocessor forum despite name anything common 603 ground implementation 32-bit powerpc architecture targeted high-end embedded market developed two years small simple energy efficient powerful equaling expensive 603e drawing less power in-order five-stage pipeline single integer unit double precision floating point unit fpu separate 16 kb instruction 8 kb data caches integer unit brand new design fpu derived r4600 save time 69 mm\u00b2 small using 0.5 \u00b5m fabrication process drew 1.2 w 120 mhz 603q designed motorola withdrew contract 603q went full production result 603q canceled qed could continue market processor since lacked powerpc license powerpc 613 seems name motorola given third generation powerpc supposedly renamed powerpc 750 response exponential technology x704 processor designed outgun 604 wide margin hardly sources confirming though might pure speculation reference completely different processor similar powerpc 613 powerpc 614 might name given motorola third generation powerpc later renamed reason 613 suggested part renamed powerpc 7400 motorola even bumped fourth generation powerpc even though architectural differences g3 g4 small hardly sources confirming though might pure speculation reference completely different processor powerpc 615 powerpc processor announced ibm 1994 never reached mass production main feature incorporate x86 core die thus making processor able natively process powerpc x86 instructions operating system running powerpc 615 could either chose execute 32-bit 64-bit powerpc instructions 32-bit x86 instructions mix three mixing instructions would involve context switch cpu small overhead operating systems supported 615 minix special development version os/2 330 mm\u00b2 large manufactured ibm 0.35 \u00b5m process pin compatible intel pentium processors comparable speed processor introduced prototype program killed part fact microsoft never supported processor engineers working powerpc 615 would later find way transmeta worked crusoe processor powerpc 625 early name apache series 64-bit powerpc processors designed ibm based amazon powerpc-as instruction set later renamed rs64 designation powerpc 625 never used final processors powerpc 630 early name high end 64-bit powerpc processor designed ibm unify power powerpc instruction sets later renamed power3 probably distinguish consumer oriented powerpc processors used apple powerpc 641 codename habanero defunct powerpc project ibm 1994\u201396 timeframe suggested third generation powerpc based 604 processor", + "neighbors": [ + 85, + 105, + 643, + 893, + 980, + 1022, + 1100, + 1143, + 1147, + 1158, + 1174, + 1263, + 1273, + 1518, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 739, + "label": 4, + "text": "Intrusion_detection_system:intrusion detection system intrusion detection system ids device software application monitors network systems malicious activity policy violations malicious activity violation typically reported either administrator collected centrally using security information event management siem system siem system combines outputs multiple sources uses alarm filtering techniques distinguish malicious activity false alarms ids types range scope single computers large networks common classifications network intrusion detection systems nids host-based intrusion detection systems hids system monitors important operating system files example hids system analyzes incoming network traffic example nids also possible classify ids detection approach well-known variants signature-based detection recognizing bad patterns malware anomaly-based detection detecting deviations model good traffic often relies machine learning another reputation-based detection recognizing potential threat according reputation scores ids products ability respond detected intrusions systems response capabilities typically referred intrusion prevention system intrusion detection systems also serve specific purposes augmenting custom tools using honeypot attract characterize malicious traffic although relate network security ids differs firewall firewall looks outwardly intrusions order stop happening firewalls limit access networks prevent intrusion signal attack inside network ids describes suspected intrusion taken place signals alarm ids also watches attacks originate within system traditionally achieved examining network communications identifying heuristics patterns often known signatures common computer attacks taking action alert operators system terminates connections called intrusion prevention system performs access control like application layer firewall ids classified detection takes place network host detection method employed signature anomaly-based network intrusion detection systems nids placed strategic point points within network monitor traffic devices network performs analysis passing traffic entire subnet matches traffic passed subnets library known attacks attack identified abnormal behavior sensed alert sent administrator example nids would installing subnet firewalls located order see someone trying break firewall ideally one would scan inbound outbound traffic however might create bottleneck would impair overall speed network opnet netsim commonly used tools simulating network intrusion detection systems nid systems also capable comparing signatures similar packets link drop harmful detected packets signature matching records nids classify design nids according system interactivity property two types on-line off-line nids often referred inline tap mode respectively on-line nids deals network real time analyses ethernet packets applies rules decide attack off-line nids deals stored data passes processes decide attack nids also combined technologies increase detection prediction rates artificial neural network based ids capable analyzing huge volumes data smart way due self-organizing structure allows ins ids efficiently recognize intrusion patterns neural networks assist ids predicting attacks learning mistakes inn ids help develop early warning system based two layers first layer accepts single values second layer takes first layers output input cycle repeats allows system automatically recognize new unforeseen patterns network system average 99.9 detection classification rate based research results 24 network attacks divided four categories dos probe remote-to-local user-to-root host intrusion detection systems hids run individual hosts devices network hids monitors inbound outbound packets device alert user administrator suspicious activity detected takes snapshot existing system files matches previous snapshot critical system files modified deleted alert sent administrator investigate example hids usage seen mission critical machines expected change configurations signature-based ids refers detection attacks looking specific patterns byte sequences network traffic known malicious instruction sequences used malware terminology originates anti-virus software refers detected patterns signatures although signature-based ids easily detect known attacks difficult detect new attacks pattern available signature-based ids signatures released vendor products on-time updating ids signature key aspect anomaly-based intrusion detection systems primarily introduced detect unknown attacks part due rapid development malware basic approach use machine learning create model trustworthy activity compare new behavior model since models trained according applications hardware configurations machine learning based method better generalized property comparison traditional signature-based ids although approach enables detection previously unknown attacks may suffer false positives previously unknown legitimate activity may also classified malicious existing idss suffer time-consuming detection process degrades performance idss efficient feature selection algorithm makes classification process used detection reliable new types could called anomaly-based intrusion detection systems viewed gartner user entity behavior analytics ueba evolution user behavior analytics category network traffic analysis nta particular nta deals malicious insiders well targeted external attacks compromised user machine account gartner noted organizations opted nta traditional ids systems may attempt stop intrusion attempt neither required expected monitoring system intrusion detection prevention systems idps primarily focused identifying possible incidents logging information reporting attempts addition organizations use idps purposes identifying problems security policies documenting existing threats deterring individuals violating security policies idps become necessary addition security infrastructure nearly every organization idps typically record information related observed events notify security administrators important observed events produce reports many idps also respond detected threat attempting prevent succeeding use several response techniques involve idps stopping attack changing security environment e.g reconfiguring firewall changing attack content intrusion prevention systems ips also known intrusion detection prevention systems idps network security appliances monitor network system activities malicious activity main functions intrusion prevention systems identify malicious activity log information activity report attempt block stop it.. intrusion prevention systems considered extensions intrusion detection systems monitor network traffic and/or system activities malicious activity main differences unlike intrusion detection systems intrusion prevention systems placed in-line able actively prevent block intrusions detected ips take actions sending alarm dropping detected malicious packets resetting connection blocking traffic offending ip address ips also correct errors defragment packet streams mitigate tcp sequencing issues clean unwanted transport network layer options.. intrusion prevention systems classified four different types majority intrusion prevention systems utilize one three detection methods signature-based statistical anomaly-based stateful protocol analysis number techniques attackers using following considered 'simple measures taken evade ids earliest preliminary ids concept delineated 1980 james anderson national security agency consisted set tools intended help administrators review audit trails user access logs file access logs system event logs examples audit trails fred cohen noted 1987 impossible detect intrusion every case resources needed detect intrusions grow amount usage dorothy e. denning assisted peter g. neumann published model ids 1986 formed basis many systems today model used statistics anomaly detection resulted early ids sri international named intrusion detection expert system ides ran sun workstations could consider user network level data ides dual approach rule-based expert system detect known types intrusions plus statistical anomaly detection component based profiles users host systems target systems author ides intelligent system detecting intruders teresa f. lunt proposed adding artificial neural network third component said three components could report resolver sri followed ides 1993 next-generation intrusion detection expert system nides multics intrusion detection alerting system midas expert system using p-best lisp developed 1988 based work denning neumann haystack also developed year using statistics reduce audit trails 1986 national security agency started ids research transfer program rebecca bace bace later published seminal text subject intrusion detection 2000 wisdom sense w statistics-based anomaly detector developed 1989 los alamos national laboratory w created rules based statistical analysis used rules anomaly detection 1990 time-based inductive machine tim anomaly detection using inductive learning sequential user patterns common lisp vax 3500 computer network security monitor nsm performed masking access matrices anomaly detection sun-3/50 workstation information security officer assistant isoa 1990 prototype considered variety strategies including statistics profile checker expert system computerwatch bell labs used statistics rules audit data reduction intrusion detection 1991 researchers university california davis created prototype distributed intrusion detection system dids also expert system network anomaly detection intrusion reporter nadir also 1991 prototype ids developed los alamos national laboratory integrated computing network icn heavily influenced work denning lunt nadir used statistics-based anomaly detector expert system lawrence berkeley national laboratory announced bro 1998 used rule language packet analysis libpcap data network flight recorder nfr 1999 also used libpcap ape developed packet sniffer also using libpcap november 1998 renamed snort one month later snort since become world largest used ids/ips system 300,000 active users monitor local systems remote capture points using tzsp protocol audit data analysis mining adam ids 2001 used tcpdump build profiles rules classifications 2003 yongguang zhang wenke lee argue importance ids networks mobile nodes 2015 viegas colleagues proposed anomaly-based intrusion detection engine aiming system-on-chip soc applications internet things iot instance proposal applies machine learning anomaly detection providing energy-efficiency decision tree naive-bayes k-nearest neighbors classifiers implementation atom cpu hardware-friendly implementation fpga literature first work implement classifier equivalently software hardware measures energy consumption additionally first time measured energy consumption extracting features used make network packet classification implemented software hardware", + "neighbors": [ + 11, + 94, + 103, + 123, + 144, + 149, + 190, + 195, + 225, + 227, + 282, + 293, + 308, + 310, + 338, + 346, + 363, + 364, + 379, + 429, + 439, + 440, + 450, + 479, + 487, + 512, + 518, + 528, + 531, + 541, + 564, + 566, + 569, + 576, + 608, + 624, + 692, + 698, + 703, + 725, + 740, + 746, + 750, + 762, + 800, + 818, + 834, + 898, + 919, + 993, + 1039, + 1090, + 1103, + 1112, + 1138, + 1159, + 1250, + 1279, + 1303, + 1309, + 1324, + 1325, + 1355, + 1361, + 1368, + 1372, + 1379, + 1398, + 1433, + 1444, + 1462, + 1472, + 1549, + 1585, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 740, + "label": 4, + "text": "Mobile_secure_gateway:mobile secure gateway mobile secure gateway msg industry term software hardware appliance provides secure communication mobile application respective backend resources typically within corporate network addresses challenges field mobile security msg typically composed two components client library gateway client library linked mobile application establishes secure connectivity gateway using cryptographic protocol typically ssl/tls represents secured channel used communication mobile application hosts gateway separates internal infrastructure internet allowing authorized client requests reach specific set hosts inside restricted network client library linked corresponding mobile application provides secure access via gateway set hosts client library exposes public api mobile application mimicking platform default http client library application uses api communicate desired hosts secure way gateway server daemon typically installed onto physical virtual appliance placed dmz gateway public interface exposed internet untrusted network accepts tcp/ip connections mobile applications operates ipv4 and/or ipv6 networks incoming client connections typically use ssl/tls provide security network communication mutual trust communicating peers communication protocol typically based http gateway forwards requests connected apps collection configured hosts typically http https servers services within internal network response host sent back respective mobile app", + "neighbors": [ + 11, + 144, + 149, + 293, + 310, + 338, + 379, + 412, + 439, + 479, + 518, + 528, + 576, + 684, + 698, + 703, + 739, + 750, + 762, + 769, + 779, + 800, + 898, + 1039, + 1090, + 1112, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1472, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 741, + "label": 4, + "text": "Amavis:amavis amavis open-source content filter electronic mail implementing mail message transfer decoding processing checking interfacing external content filters provide protection spam viruses malware considered interface mailer mta mail transfer agent one content filters amavis used notable features common mail filtering installation amavis consists postfix mta spamassassin spam classifier clamav anti-virus protection running unix-like operating system many virus scanners 30 spam scanners crm114 dspam bogofilter supported well mtas three topologies interfacing mta supported amavisd process sandwiched two instances mta yielding classical after-queue mail filtering setup amavisd used smtp proxy filter before-queue filtering setup amavisd process consulted provide mail classification forward mail message case consulting client remains charge mail forwarding last approach used milter setup limitations historical client program amavisd-submit since version 2.7.0 before-queue setup preferred allows mail message transfer rejected smtp session sending client after-queue setup filtering takes place mail message already received enqueued mta case mail filter longer reject message deliver possibly tagged discard generate non-delivery notification cause unwanted backscatter case bouncing message fake sender address disadvantage before-queue setup requires resources cpu memory proportional current peak mail transfer rate unlike after-queue setup delay acceptable resource usage corresponds average mail transfer rate introduction option smtpd_proxy_options=speed_adjust postfix 2.7.0 resource requirements before-queue content filter much reduced countries legislation permit mail filtering discard mail message accepted mta rules after-queue filtering setup discarding quarantining messages leaves possibility delivering possibly tagged messages rejecting before-queue setup smtp proxy milter amavis receive mail messages mta one sockets protocol families pf_inet ipv4 pf_inet6 ipv6 pf_local unix domain socket using protocols esmtp lmtp simple private protocol am.pdp used helper program like amavisd-milter interface milters output side protocols esmtp lmtp used pass message back-end mta instance lda message passed spawned process unix pipe esmtp lmtp used session optionally encrypted using tls starttls rfc 3207 extension protocol smtp command pipelining rfc 2920 supported client server code spam scanning enabled daemon process amavisd conceptually similar spamd process spamassassin project cases forked child processes call spamassassin perl modules directly hence performance similar main difference protocols used amavis typically speaks standard esmtp protocol mta spamc/spamd case mta typically spawns spamc program passing message unix pipe spamc process transfers message spamd daemon using private protocol spamd calls spamassassin perl modules design priorities amavisd-new called amavis reliability security adherence standards performance functionality intention mail message could lost due unexpected events like i/o failures resources depletion unexpected program terminations amavisd program meticulously checks completion status every system call i/o operation unexpected events logged possible handled several layers event handling amavis never takes responsibility mail message delivery away mta final success status reported mta message passed back-end mta instance reception confirmed case fatal failures processing transferring message message processed stays queue front-end mta instance re-tried later approach also covers potential unexpected host failures crashes amavisd process one components use program resources like memory size file descriptors disk usage creation subprocesses controlled large mail messages kept memory available memory size impose limit size mail messages processed memory resources wasted unnecessarily great deal attention given security aspects required handling potentially malicious nonstandard garbled data mail messages coming untrusted sources process handling mail messages runs reduced privileges dedicated user id optionally run chroot-ed risks buffer overflows memory allocation bugs largely avoided implementing protocol handling mail processing perl handles dynamic memory management transparently care taken content processed messages inadvertently propagate system perl provides additional security safety net marking tainted data originating wild amavis careful put perl feature good use avoiding automatic untainting data use taint untainting explicitly strategic points late data flow amavis use several external programs enhance functionality de-archivers de-compressors virus scanners spam scanners programs often implemented languages like c c++ potential risk mail message passed one programs cause failure even open security hole risk limited running programs unprivileged user id possibly chroot-ed nevertheless external programs like unmaintained de-archivers avoided use external programs configurable disabled selectively group like decoders virus scanners despite implemented interpreted programming language perl amavis slow good performance functionality implemented amavis speaking external components achieved dealing data large chunks e.g line-by-line avoiding unnecessary data copying optimizing frequently traversed code paths using suitable data structures algorithms well low-level optimizations bottlenecks detected development profiling code benchmarking detailed timing report log help recognize bottlenecks particular installation certain external modules programs like spamassassin command-line virus scanners slow using would constitute vast majority elapsed time processing resources making resources used amavis proportionally quite small components like external mail decoders virus scanners spam scanners selectively disabled needed remains functionality implemented amavis like transferring mail message mta using smtp lmtp protocol checking mail header section validity checking banned mail content types verifying generating dkim signatures consequence mail processing tasks like dkim signing verification mail checking disabled exceptionally fast rival implementations compiled languages even full checks using fast virus scanner spam scanning disabled surprisingly fast implementation protocols message structures closely follows set applicable standards rfc 5322 rfc 5321 rfc 2033 rfc 3207 rfc 2045 rfc 2046 rfc 2047 rfc 3461 rfc 3462 rfc 3463 rfc 3464 rfc 4155 rfc 5965 rfc 6376 rfc 5451 rfc 6008 rfc 4291 several cases functionality re-implemented amavis code even though public cpan perl module exists lacks attention detail following standard lacks sufficient checking handling errors amavis licensed gplv2 license applies current code well historical branches exception supporting programs like monitoring statistics reporting covered new bsd license project started 1997 unix shell script detect block e-mail messages containing virus intended block viruses mta mail transfer agent lda local delivery stage running unix-like platform complementing virus protection mechanisms running end-user personal computers next tool re-implemented perl program later evolved daemonized process dozen developers took turns first five years project developing several variants keeping common goal project name development infrastructure since december 2008 2018-10-09 active branch officially amavisd-new developed maintained mark martinec since march 2002 agreed developers time private correspondence christian bricart lars hecking hilko bengen rainer link mark martinec project name amavis largely interchangeable name amavisd-new branch lots functionality added years like adding protection spam unwanted content besides original virus protection focus kept reliability security adherence standards performance domain amavis.org use project registered 1998 christian bricart one early developers still maintaining domain name registration domain entirely dedicated active branch project mailing list moved sourceforge amavis.org march 2011 hosted ralf hildebrandt patrick ben koetter project web page main distribution site located jo\u017eef stefan institute ljubljana slovenia handover 2018 development taking place years 2002 2018 october 9 2018 mark martinec announced general support discussion mailing list retirement project also patrick ben koetter continue new project leader patrick notified migration source code public gitlab repository plan next steps regarding project development history project name project branches varied somewhat initially spelling project name amavis mail virus scanner introduced christian bricart rewrite perl name program amavis-perl daemonized versions initially distributed name amavisd-snapshot amavisd modular rewrite hilko bengen called amavis-ng march 2002 amavisd-new branch introduced mark martinec initially patch amavisd-snapshot-20020300 later evolved self-contained project surviving actively maintained branch nowadays project name preferably spelled amavis name program amavisd name amavis mostly interchangeable amavisd-new hilko bengen", + "neighbors": [ + 225, + 306, + 455, + 620, + 769, + 1027, + 1090, + 1094, + 1138, + 1216, + 1227, + 1395 + ], + "mask": "Test" + }, + { + "node_id": 742, + "label": 8, + "text": "Mustache_(template_system):mustache template system mustache web template system implementations available actionscript c++ clojure coffeescript coldfusion common lisp dart delphi erlang fantom go haskell io java javascript julia lua .net objective-c ocaml perl php pharo python r racket ruby rust scala smalltalk swift tcl cfengine xquery mustache described logic-less system lacks explicit control flow statements like else conditionals loops however looping conditional evaluation achieved using section tags processing lists lambdas named mustache heavy use braces resemble sideways moustache mustache used mainly mobile web applications mustache-1 inspired ctemplate et started github distribution end 2009 first version template engine implemented ruby running yaml template texts preserved main principles input data class input data characterized mvc-view mustache template nothing reference methods input data view logic decisions code contained view markup ex output xml contained template mvp context input data mvp- presenter mustache template mvp- view simplest template hello template section tag text codice_1 boolean value section tag acts like conditional codice_1 array acts like foreach loop template escaped codice_3 contains html wo n't escaped syntax highlighting available atom coda emacs textmate vim visual studio code mustache templates support built many web application frameworks ex cakephp support javascript includes client-side programming many javascript libraries ajax frameworks jquery dojo yui well server-side javascript using node.js commonjs many mustache engine implementations available meet common specification see external links \u2014 final users results common syntax march 2011 last spec_version 1.1.2 mustache engines v1.x architecture render method mustache_compiler class parser class mustache inspired numerous javascript template libraries forked original simplicity add certain functionality use handlebars.js self-described br handlebars.js extension mustache templating language created chris wanstrath handlebars.js mustache logicless templating languages keep view code separated like know handlebars differs predecessor h1 /h1 h2 /h2 using context var context mustache would require either block nested object flattening context thus would h1 /h1 h2 /h2", + "neighbors": [ + 19, + 117, + 132, + 176, + 216, + 308, + 378, + 392, + 509, + 521, + 538, + 567, + 682, + 712, + 825, + 948, + 1120, + 1225, + 1227, + 1235, + 1311, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 743, + "label": 3, + "text": "UAE_(emulator):uae emulator uae computer emulator emulates hardware commodore international amiga range computers released gnu general public license uae free software uae released 1995 originally called unusable amiga emulator due inability boot early stages known unix amiga emulator later names well since none popular expansions fit abbreviation longer stands anything software simply known uae \u2014 occasionally gets backronymed universal amiga emulator ultimate amiga emulator ubiquitous amiga emulator uae almost full-featured amiga emulator emulates functions software uae may use disk images made original amiga floppy disks images file extension adf amiga disk file actual amiga disks used limitations floppy controllers used computers images amiga formatted hard drives also made uae also supports mapping host operating system directories amiga hard drives uae include original amiga operating system rom files required running amiga system included license packages like amiga forever original kickstart 3.1 rom images also included amigaos4 powerpc since version 4.1 update 4 uae also supports alternative system roms derived aros project however provide degree software compatibility original roms uae ported many host operating systems including linux macos freebsd dos microsoft windows risc os beos palm os android xbox console psp psvita gp2x handhelds ios wii dreamcast consoles even amigaos morphos aros many threads past usenet public forums people argued possibility writing amiga emulator considered uae attempting impossible demanding system read process output 100 mb/s data fastest pc 66 mhz 486 keeping various emulated chips amiga chipset sync appearing supposed appear software uae almost entirely unusable first releases slowly step step fleshed support amiga chipset end 1997 able emulate amiga 500 quality speed sufficient productivity use many games since uae usable thanks partly effort taken develop partly big improvements technology brought computers many times faster uae initially running many amiga games applications run smoothly pentium ii-era system realization useful amiga emulator could written contributed increase enthusiasm emulation started sped-up efforts write emulators often less popular computer electronic game architectures major improvement made 2000 bernd meyer use just-in-time compilation significantly improved emulation speed extent average pcs could emulate amiga software faster real amiga could run uae use much host power native mode possible balance requirements host os accurately reflect original speed depending user choice uae also provides rtg-compatible video card amiga side emulation tailored display host hardware limited emulation original amiga video hardware five main forks original program active fork winuae current versions still contain bugs compatibility issues specific versions", + "neighbors": [ + 134, + 326, + 491, + 509, + 860, + 961, + 1022, + 1138, + 1202, + 1231 + ], + "mask": "Validation" + }, + { + "node_id": 744, + "label": 3, + "text": "DNA-OS:dna-os dna-os french-made operating system supersede muteka obsolete operating system still providing posix thread api said soclib website kernel-mode lightweight operating system multiprocessor system chip build top thin hal ease porting new platforms processor architecture dna/os support virtual memory dna-os layered microkernel operating system written c99 released gnu gplv3 license", + "neighbors": [ + 210, + 322, + 1011 + ], + "mask": "Train" + }, + { + "node_id": 745, + "label": 4, + "text": "Virtual_private_database:virtual private database virtual private database vpd masks data larger database subset data appears exist without actually segregating data different tables schemas databases typical application constraining sites departments individuals etc operate records time allowing privileged users operations e.g reports data warehousing etc access whole table term typical oracle dbms implementation general tables associated sql functions return predicate sql expression whenever query executed relevant predicates involved tables transparently collected used filter rows select insert update delete different rules", + "neighbors": [ + 429 + ], + "mask": "Test" + }, + { + "node_id": 746, + "label": 4, + "text": "Dialer:dialer dialer american english dialler british english electronic device connected telephone line monitor dialed numbers alter seamlessly provide services otherwise require lengthy national international access codes dialed dialer automatically inserts modifies numbers depending time day country area code dialed allowing user subscribe service providers offer best rates example dialer could programmed use one service provider international calls another cellular calls process known prefix insertion least cost routing line powered dialer need external power instead takes power needs telephone line another type dialer computer program creates connection internet another computer network analog telephone integrated services digital network isdn many operating systems already contain program connections point-to-point protocol ppp wvdial many internet service providers offer installation cds simplify process setting proper internet connection either create entry os dialer install separate dialer aol software recent years term dialer often refers specifically dialers connect without user full knowledge cost creator dialer intending commit fraud call centers several dialling modes depending call placed 'manual dialing refers calls placed manually agent 4 different dialing modes depending software dialers selects contacts going called starts making calls automated dialers sold noble systems avaya convoso formerly safesoft solutions place calls using *preview* *power* auto dialing predictive dialing dialing modes defined according campaign type business preview dialing enables agents first view available information customer decide place call addition information customer agents may also view history customer contact center viewing information customer agent requests system make call example preview dialing useful debt collection campaigns allow agents view information customer define strategy starting talk customer system delivers preview calls agents automatically taking account priority call skills agent handle call preview dialing keeps agents dialing calls manually power dialer similar autodialer software enables telemarketers sales teams call centers dial list phone numbers automatically completely hands-free thus saving valuable time energy would otherwise wasted dialing hand predictive dialing state-of-the-art pacing mode used call large number customers within short period time predictive dialing optimizes time agents reducing idle times connected calls freeing agents dialing calls predictive dialing gathers statistics concerning duration calls long takes calls answered often calls answered agent become idle system places several calls predictive dialing campaigns achieve agent productivity 50 minutes per hour nuisance ratios 3 less system continually updating predictive dialing probabilities monitoring nuisance ratios performance compliance legislation example predictive dialing useful sales campaigns call large number contacts maximizing working time agents performance predictive dialing takes consideration accuracy contact lists policies nuisance calls contact list poor performance predictive dialing campaign risk agents connected live contacts able business power ivr used deliver pre-recorded message large call list call answered power ivr play audio file collect touch tone key responses speech command end message transfer call agent remove caller call list words ivr technology allows computer interact humans use voice dtmf tones input via keypad voice drop power ivr except wait touch tone key responses speech command end message playing message call dropped mostly used payment reminders similar dialers necessary connect internet least non-broadband connections dialers designed connect premium-rate numbers providers dialers often search security holes operating system installed user computer use set computer dial number make money calls alternatively dialers inform user promise special content accessible via special number examples content include software download usually illegal trojans posing mp3s trojans posing pornography 'underground programs cracks keygens cost setting service relatively low amounting thousand dollars telecommunications equipment whereupon unscrupulous operator typically take 90 cost premium rate call overheads users dsls similar broadband connections usually affected dialer downloaded installed dialing possible regular phone numbers dsl network users typically dial-up modem connected phone line however isdn adapter additional analog modem installed dialer might still able get connection malicious dialers identified following characteristics computers running microsoft windows without anti-virus software proper updates could vulnerable visual basic-scripts install trojan horse changes values windows registry sets internet explorer security settings way activex controls downloaded internet without warning change made user accesses malicious page email message start installing dialer script also disables modem speaker messages normally come dialing network users microsoft office outlook outlook express internet explorer especially affected running activex controls javascript allowed latest security patches microsoft installed march 2004 malicious dialers could installed fake anti-virus software e-mail spam so-called antivirus team example contained download links programs named downloadtool.exe antivirus.exe malicious dialers ways transmission include electronic greeting cards link pages tricks user install activex controls turn install dialers background therefore links spam emails never opened automatically started downloads canceled soon discovered one check dial-up internet see whether displayed phone number unchanged another way protect oneself disable premium numbers one phone services course disables services one never run foreign code privileged environment unless source trustworthy also advisable protect oneself anti-malware programs 15 august 2003 new law came effect germany called gesetz zur bek\u00e4mpfung des missbrauchs von 0 190er/ 0 900er mehrwertdiensterufnummern law combat misuse 0 190/ 0 900 value added service numbers law contains following regulations 4 march 2004 german federal supreme court karlsruhe decided fees usage dialers paid used without user knowledge december 2016 ofcom office communications announced changes call centre regulations focused persistent use dialers make call residential telephone numbers also added extra clarity call centres approach issue silent abandoned calls ofcom also regulate abandoned call messages work message state company name reason calling importantly used opportunity market business", + "neighbors": [ + 11, + 166, + 190, + 293, + 384, + 450, + 487, + 509, + 531, + 564, + 624, + 692, + 739, + 818, + 1090, + 1138, + 1206, + 1309, + 1325, + 1379, + 1417, + 1444 + ], + "mask": "Test" + }, + { + "node_id": 747, + "label": 4, + "text": "List_of_digital_forensics_tools:list digital forensics tools 1980s digital forensic investigations consisted live analysis examining digital media directly using non-specialist tools 1990s several freeware proprietary tools hardware software created allow investigations take place without modifying media first set tools mainly focused computer forensics although recent years similar tools evolved field mobile device forensics list includes notable examples digital forensic tools memory forensics tools used acquire analyze computer volatile memory ram often used incident response situations preserve evidence memory would lost system shut quickly detect stealthy malware directly examining operating system running software memory mobile forensics tools tend consist hardware software component mobile phones come diverse range connectors hardware devices support number different cables perform role write blocker computer devices software forensics science analyzing software source code binary code determine whether intellectual property infringement theft occurred centerpiece lawsuits trials settlements companies dispute issues involving software patents copyrights trade secrets software forensics tools compare code determine correlation measure used guide software forensics expert", + "neighbors": [ + 134, + 343, + 379, + 393, + 611, + 703, + 800, + 875, + 1045, + 1317, + 1328 + ], + "mask": "Test" + }, + { + "node_id": 748, + "label": 1, + "text": "KeyBase:keybase keybase database web application managing deploying interactive taxonomic keys plants animals developed royal botanic gardens victoria keybase provides medium pathway keys traditionally developed print classical types media used effectively internet environment platform uses concept called keys easily linked together joined keys merged larger seamless keys groups still available browsed independently keys keybase database filtered displayed variety ways filters formats examples keybase database", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 749, + "label": 7, + "text": "EMBRACE:embrace embrace european model bioinformatics research community education project year 2005 2010 objective drawing together wide group experts throughout europe involved use information technology biomolecular sciences embrace network worked integrate major databases software tools bioinformatics using existing methods emerging grid service technologies integration efforts driven set test problems representing key issues bioinformatics service providers end-user biologists result groups throughout europe able use embrace service interfaces local proprietary data tools embrace made many bioinformatics web services available international research community project run ebi hinxton england fred marcus eu project coordinator embrace project funded european commission within fp6 programme thematic area life sciences genomics biotechnology health contract number lhsg-ct-2004-512092", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 750, + "label": 4, + "text": "Security_bug:security bug security bug security defect software bug exploited gain unauthorized access privileges computer system security bugs introduce security vulnerabilities compromising one security bugs need identified exploited qualify security bugs like software bugs stem root causes generally traced either absent inadequate security bugs generally fall fairly small number broad categories include see software security assurance", + "neighbors": [ + 11, + 103, + 149, + 225, + 261, + 293, + 338, + 379, + 414, + 439, + 479, + 518, + 528, + 576, + 698, + 739, + 740, + 762, + 783, + 800, + 876, + 1039, + 1090, + 1112, + 1303, + 1325, + 1361, + 1368, + 1379, + 1393, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 751, + "label": 4, + "text": "MIMEDefang:mimedefang mimedefang gpl licensed framework filtering e-mail uses sendmail milter api c glue code perl code let user write high-performance mail filters perl mimedefang used mimedefang originally developed dianne skoll contracted royal college physicians surgeons canada 2000 help stop flood email viruses college network software written filter attachments originally called mimesweeper mimedefanger currently mimedefang skoll announced software public august 28 2000 december 21 2001 version incorporating support spamassassin released making mimedefang filter spam viruses skoll company roaring penguin software currently markets commercial anti-spam product known canit based open-source version mimedefang milter library included sendmail uses posix threads allow multiple concurrent filters mimedefang perl filter uses pre-forked process model similar traditional apache web server multi-processing model mimedefang therefore consists three components mimedefang users code filtering policies perl using infrastructure provided mimedefang.pl n't need worry thread synchronizations perl filter separate single-threaded process infrastructure provided mimedefang.pl follows milter api reasonably closely exactly includes convenience routines parsing rebuilding mime messages filter authors concentrate high-level policy rather worry low-level api details convenience comes small loss flexibility loss performance", + "neighbors": [ + 123, + 306, + 436, + 620, + 1090, + 1227 + ], + "mask": "Validation" + }, + { + "node_id": 752, + "label": 3, + "text": "Instruction_set_architecture:instruction set architecture instruction set architecture isa abstract model computer also referred architecture computer architecture realization isa called implementation isa permits multiple implementations may vary performance physical size monetary cost among things isa serves interface software hardware software written isa run different implementations isa enabled binary compatibility different generations computers easily achieved development computer families developments helped lower cost computers increase applicability reasons isa one important abstractions computing today isa defines everything machine language programmer needs know order program computer isa defines differs isas general isas define supported data types state main memory registers semantics memory consistency addressing modes instruction set set machine instructions comprises computer machine language input/output model instruction set architecture distinguished microarchitecture set processor design techniques used particular processor implement instruction set processors different microarchitectures share common instruction set example intel pentium advanced micro devices athlon implement nearly identical versions x86 instruction set radically different internal designs concept architecture distinct design specific machine developed fred brooks ibm design phase system/360 virtual machines support bytecode isa smalltalk java virtual machine microsoft common language runtime implement translating bytecode commonly used code paths native machine code addition virtual machines execute less frequently used code paths interpretation see just-in-time compilation transmeta implemented x86 instruction set atop vliw processors fashion isa may classified number different ways common classification architectural complexity complex instruction set computer cisc many specialized instructions may rarely used practical programs reduced instruction set computer risc simplifies processor efficiently implementing instructions frequently used programs less common operations implemented subroutines resulting additional processor execution time offset infrequent use types include long instruction word vliw architectures closely related long instruction word liw explicitly parallel instruction computing epic architectures architectures seek exploit instruction-level parallelism less hardware risc cisc making compiler responsible instruction issue scheduling architectures even less complexity studied minimal instruction set computer misc one instruction set computer oisc theoretically important types commercialized machine language built discrete statements instructions processing architecture given instruction may specify complex operations built combining simple instructions executed sequentially otherwise directed control flow instructions examples operations common many instruction sets include processors may include complex instructions instruction set single complex instruction something may take many instructions computers instructions typified instructions take multiple steps control multiple functional units otherwise appear larger scale bulk simple instructions implemented given processor examples complex instructions include complex instructions common cisc instruction sets risc instruction sets risc instruction sets may include well risc instruction sets generally include alu operations memory operands instructions move large blocks memory risc instruction sets include simd vector instructions perform arithmetic operation multiple pieces data time simd instructions ability manipulating large vectors matrices minimal time simd instructions allow easy parallelization algorithms commonly involved sound image video processing various simd implementations brought market trade names mmx 3dnow altivec traditional architectures instruction includes opcode specifies operation perform add contents memory register \u2014and zero operand specifiers may specify registers memory locations literal data operand specifiers may addressing modes determining meaning may fixed fields long instruction word vliw architectures include many microcode architectures multiple simultaneous opcodes operands specified single instruction exotic instruction sets opcode field transport triggered architectures tta operand forth virtual machine 0-operand instruction sets lack operand specifier fields stack machines including nosc conditional instructions often predicate field\u2014a bits encode specific condition cause operation performed rather performed example conditional branch instruction executed branch taken condition true execution proceeds different part program executed branch taken condition false execution continues sequentially instruction sets also conditional moves move executed data stored target location condition true executed target location modified condition false similarly ibm z/architecture conditional store instruction instruction sets include predicate field every instruction called branch predication instruction sets may categorized maximum number operands explicitly specified instructions due large number bits needed encode three registers 3-operand instruction risc architectures 16-bit instructions invariably 2-operand designs atmel avr ti msp430 versions arm thumb risc architectures 32-bit instructions usually 3-operand designs arm avr32 mips power isa sparc architectures instruction specifies number operands registers memory locations immediate values explicitly instructions give one operands implicitly stored top stack implicit register operands given implicitly fewer operands need specified instruction destination operand explicitly specifies destination additional operand must supplied consequently number operands encoded instruction may differ mathematically necessary number arguments logical arithmetic operation arity operands either encoded opcode representation instruction else given values addresses following instruction register pressure measures availability free registers point time program execution register pressure high large number available registers use thus higher register pressure often register contents must spilled memory increasing number registers architecture decreases register pressure increases cost embedded instruction sets thumb suffer extremely high register pressure small register sets general-purpose risc isas like mips alpha enjoy low register pressure cisc isas like x86-64 offer low register pressure despite smaller register sets due many addressing modes optimizations sub-register addressing memory operands alu instructions absolute addressing pc-relative addressing register-to-register spills cisc isas offer size length instruction varies widely little four bits microcontrollers many hundreds bits vliw systems processors used personal computers mainframes supercomputers instruction sizes 8 64 bits longest possible instruction x86 15 bytes 120 bits within instruction set different instructions may different lengths architectures notably reduced instruction set computers risc typically corresponding architecture word size architectures instructions variable length typically integral multiples byte halfword arm thumb-extension mixed variable encoding two fixed usually 32-bit 16-bit encodings instructions mixed freely must switched branch exception boundary armv8 risc instruction set normally fixed instruction length often 4 bytes 32 bits whereas typical cisc instruction set may instructions widely varying length 1 15 bytes x86 fixed-length instructions less complicated handle variable-length instructions several reasons check whether instruction straddles cache line virtual memory page boundary instance therefore somewhat easier optimize speed early computers memory expensive minimizing size program make sure would fit limited memory often central thus combined size instructions needed perform particular task code density important characteristic instruction set computers high code density often complex instructions procedure entry parameterized returns loops etc therefore retroactively named complex instruction set computers cisc however typical frequent cisc instructions merely combine basic alu operation add access one operands memory using addressing modes direct indirect indexed etc. certain architectures may allow two three operands including result directly memory may able perform functions automatic pointer increment etc software-implemented instruction sets may even complex powerful instructions reduced instruction-set computers risc first widely implemented period rapidly growing memory subsystems sacrifice code density simplify implementation circuitry try increase performance via higher clock frequencies registers single risc instruction typically performs single operation add registers load memory location register risc instruction set normally fixed instruction length whereas typical cisc instruction set instructions widely varying length however risc computers normally require often longer instructions implement given task inherently make less optimal use bus bandwidth cache memories certain embedded risc isas like thumb avr32 typically exhibit high density owing technique called code compression technique packs two 16-bit instructions one 32-bit instruction unpacked decode stage executed two instructions minimal instruction set computers misc form stack machine separate instructions 16-64 multiple instructions fit single machine word types cores often take little silicon implement easily realized fpga multi-core form code density misc similar code density risc increased instruction density offset requiring primitive instructions task research executable compression mechanism improving code density mathematics kolmogorov complexity describes challenges limits instructions constituting program rarely specified using internal numeric form machine code may specified programmers using assembly language commonly may generated programming languages compilers design instruction sets complex issue two stages history microprocessor first cisc complex instruction set computer many different instructions 1970s however places like ibm research found many instructions set could eliminated result risc reduced instruction set computer architecture uses smaller set instructions simpler instruction set may offer potential higher speeds reduced processor size reduced power consumption however complex set may optimize common operations improve memory cache efficiency simplify programming instruction set designers reserve one opcodes kind system call software interrupt example mos technology 6502 uses 00 zilog z80 uses eight codes c7 cf d7 df e7 ef f7 ff motorola 68000 use codes range a000..afff fast virtual machines much easier implement instruction set meets popek goldberg virtualization requirements nop slide used immunity-aware programming much easier implement unprogrammed state memory interpreted nop systems multiple processors non-blocking synchronization algorithms much easier implement instruction set includes support something fetch-and-add load-link/store-conditional ll/sc atomic compare-and-swap given instruction set implemented variety ways ways implementing particular instruction set provide programming model implementations instruction set able run executables various ways implementing instruction set give different tradeoffs cost performance power consumption size etc designing microarchitecture processor engineers use blocks hard-wired electronic circuitry often designed separately adders multiplexers counters registers alus etc kind register transfer language often used describe decoding sequencing instruction isa using physical microarchitecture two basic ways build control unit implement description although many designs use middle ways compromises designs use combination hardwired design microcode control unit cpu designs use writable control store\u2014they compile instruction set writable ram flash inside cpu rekursiv processor imsys cjip fpga reconfigurable computing isa also emulated software interpreter naturally due interpretation overhead slower directly running programs emulated hardware unless hardware running emulator order magnitude faster today common practice vendors new isas microarchitectures make software emulators available software developers hardware implementation ready often details implementation strong influence particular instructions selected instruction set example many implementations instruction pipeline allow single memory load memory store per instruction leading load-store architecture risc another example early ways implementing instruction pipeline led delay slot demands high-speed digital signal processing pushed opposite direction\u2014forcing instructions implemented particular way example perform digital filters fast enough mac instruction typical digital signal processor dsp must use kind harvard architecture fetch instruction two data words simultaneously requires single-cycle multiply\u2013accumulate multiplier", + "neighbors": [ + 51, + 53, + 61, + 76, + 78, + 85, + 86, + 105, + 123, + 127, + 137, + 193, + 195, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 641, + 643, + 659, + 719, + 776, + 796, + 803, + 821, + 830, + 846, + 907, + 937, + 946, + 979, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1044, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1143, + 1158, + 1160, + 1161, + 1174, + 1213, + 1219, + 1222, + 1224, + 1231, + 1256, + 1263, + 1272, + 1284, + 1287, + 1290, + 1320, + 1351, + 1372, + 1398, + 1437, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 753, + "label": 9, + "text": "Maclisp:maclisp maclisp maclisp sometimes styled maclisp maclisp programming language dialect language lisp originated massachusetts institute technology mit project mac derived prefix late 1960s based lisp 1.5 richard greenblatt main developer original codebase pdp-6 jon l. white responsible later maintenance development name maclisp began used early 1970s distinguish forks pdp-6 lisp notably bbn lisp maclisp descendant lisp 1.5 maclisp departs lisp 1.5 using value cell access store dynamic values variables lisp 1.5 used linear search association list determine variable value maclisp variable evaluation faster different variable semantics maclisp also employed reader macros make readable input output termed input/output i/o instead entering codice_1 one could enter codice_2 get s-expression although implementations put functions property list maclisp uses different syntax define functions maclisp also load-on-demand feature maclisp began digital equipment corporation pdp-6 pdp-10 computers running incompatible timesharing system later ported pdp-10 operating systems example timesharing total operating system tops-10 tops-20 original implementation assembly language later implementation multics used pl/i maclisp developed considerably lifetime major features added language systems would typically correspond major release numbers maclisp used implement macsyma computer algebra system cas symbolic algebra program macsyma development also drove several features maclisp shrdlu blocks-world program written maclisp language widespread use artificial intelligence ai research community early 1980s also used implement programming languages planner scheme multics maclisp used implement first lisp-based emacs maclisp influential lisp implementation longer maintained actively runs pdp-10 emulators used experimenting early ai programs maclisp began small fixed number data types cons cell atom later termed symbol integer floating-point number later additions included arrays never first-class data types arbitrary-precision integers bignums strings tuples objects except inums implemented pointers data type determined block memory pointed special case small numbers inums programs could interpreted compiled compiled behavior interpreted except local variables lexical default compiled code unless declared special error checking done inline operations car cdr ncomplr compiler mid-1970s introduced fast numeric support lisp languages generating machine code instructions arithmetic rather calling interpretive routines dispatched data type made lisp arithmetic comparable speed fortran scalar operations though fortran array loop implementation remained much faster original version limited 18-bit word memory address pdp-10 considerable effort expended keeping implementation lean simple multics maclisp far larger address space costly use memory processing power pdp-10 exceeded lisp machine invented lisp machine lisp direct descendant maclisp several lisp dialects also use need unify community resulted modern common lisp language maclisp named project mac unrelated apple macintosh mac computer predates decades various lisp systems macintosh particular similarity maclisp", + "neighbors": [ + 27, + 37, + 46, + 56, + 78, + 170, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 579, + 601, + 649, + 653, + 693, + 756, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1044, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1213, + 1217, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1437, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 754, + "label": 3, + "text": "Kernel_(operating_system):kernel operating system kernel computer program core computer operating system complete control everything system systems one first programs loaded start-up bootloader handles rest start-up well input/output requests software translating data-processing instructions central processing unit handles memory peripherals like keyboards monitors printers speakers critical code kernel usually loaded separate area memory protected access application programs less critical parts operating system kernel performs tasks running processes managing hardware devices hard disk handling interrupts protected kernel space contrast application programs like browsers word processors audio video players use separate area memory user space separation prevents user data kernel data interfering causing instability slowness well preventing malfunctioning application programs crashing entire operating system kernel interface low-level abstraction layer process makes requests kernel called system call kernel designs differ manage system calls resources monolithic kernel runs operating system instructions address space speed microkernel runs processes user space modularity kernel primary function mediate access computer resources including key aspects necessary resource management definition execution domain address space protection mechanism used mediate access resources within domain kernels also provide methods synchronization inter-process communication ipc implementations may within kernel kernel also rely processes running although kernel must provide inter-process communication order provide access facilities provided kernels must also provide running programs method make requests access facilities kernel full access system memory must allow processes safely access memory require often first step virtual addressing usually achieved paging and/or segmentation virtual addressing allows kernel make given physical address appear another address virtual address virtual address spaces may different different processes memory one process accesses particular virtual address may different memory another process accesses address allows every program behave one apart kernel running thus prevents applications crashing many systems program virtual address may refer data currently memory layer indirection provided virtual addressing allows operating system use data stores like hard drive store would otherwise remain main memory ram result operating systems allow programs use memory system physically available program needs data currently ram cpu signals kernel happened kernel responds writing contents inactive memory block disk necessary replacing data requested program program resumed point stopped scheme generally known demand paging virtual addressing also allows creation virtual partitions memory two disjointed areas one reserved kernel kernel space applications user space applications permitted processor address kernel memory thus preventing application damaging running kernel fundamental partition memory space contributed much current designs actual general-purpose kernels almost universal systems although research kernels e.g singularity take approaches perform useful functions processes need access peripherals connected computer controlled kernel device drivers device driver computer program enables operating system interact hardware device provides operating system information control communicate certain piece hardware driver important vital piece program application design goal driver abstraction function driver translate os-mandated abstract function calls programming calls device-specific calls theory device work correctly suitable driver device drivers used things video cards sound cards printers scanners modems lan cards common levels abstraction device drivers 1 hardware side 2 software side example show user something screen application would make request kernel would forward request display driver responsible actually plotting character/pixel kernel must maintain list available devices list may known advance e.g embedded system kernel rewritten available hardware changes configured user typical older pcs systems designed personal use detected operating system run time normally called plug play plug play system device manager first performs scan different hardware buses peripheral component interconnect pci universal serial bus usb detect installed devices searches appropriate drivers device management os-specific topic drivers handled differently kind kernel design every case kernel provide i/o allow drivers physically access devices port memory location important decisions made designing device management system designs accesses may involve context switches making operation cpu-intensive easily causing significant performance overhead computing system call process requests service operating system kernel normally permission run system calls provide interface process operating system operations interacting system require permissions available user level process e.g i/o performed device present system form communication processes requires use system calls system call mechanism used application program request service operating system use machine-code instruction causes processor change mode example would supervisor mode protected mode operating system performs actions like accessing hardware devices memory management unit generally operating system provides library sits operating system normal programs usually c library glibc windows api library handles low-level details passing information kernel switching supervisor mode system calls include close open read wait write actually perform useful work process must able access services provided kernel implemented differently kernel provide c library api turn invokes related kernel functions method invoking kernel function varies kernel kernel memory isolation use impossible user process call kernel directly would violation processor access control rules possibilities important consideration design kernel support provides protection faults fault tolerance malicious behaviours security two aspects usually clearly distinguished adoption distinction kernel design leads rejection hierarchical structure protection mechanisms policies provided kernel classified according several criteria including static enforced compile time dynamic enforced run time pre-emptive post-detection according protection principles satisfy e.g denning whether hardware supported language based whether open mechanism binding policy many support hierarchical protection domains typically implemented using cpu modes many kernels provide implementation capabilities i.e objects provided user code allow limited access underlying object managed kernel common example occurs file handling file representation information stored permanent storage device kernel may able perform many different operations e.g read write delete execute file contents user level application may permitted perform operations e.g may allowed read file common implementation kernel provide object application typically called file handle application may invoke operations validity kernel checks time operation requested system may extended cover objects kernel manages indeed objects provided user applications efficient simple way provide hardware support capabilities delegate mmu responsibility checking access-rights every memory access mechanism called capability-based addressing commercial computer architectures lack mmu support capabilities alternative approach simulate capabilities using commonly supported hierarchical domains approach protected object must reside address space application access kernel also maintains list capabilities memory application needs access object protected capability performs system call kernel checks whether application capability grants permission perform requested action permitted performs access either directly delegating request another user-level process performance cost address space switching limits practicality approach systems complex interactions objects used current operating systems objects accessed frequently expected perform quickly approaches protection mechanism firmware supported instead simulated higher levels e.g simulating capabilities manipulating page tables hardware direct support possible performance implications lack hardware support may issue however systems choose use language-based protection important kernel design decision choice abstraction levels security mechanisms policies implemented kernel security mechanisms play critical role supporting security higher levels one approach use firmware kernel support fault tolerance see build security policy malicious behavior top adding features cryptography mechanisms necessary delegating responsibility compiler approaches delegate enforcement security policy compiler and/or application level often called language-based security lack many critical security mechanisms current mainstream operating systems impedes implementation adequate security policies application abstraction level fact common misconception computer security security policy implemented application regardless kernel support typical computer systems today use hardware-enforced rules programs allowed access data processor monitors execution stops program violates rule e.g. user process read write kernel memory systems lack support capabilities processes isolated using separate address spaces calls user processes kernel regulated requiring use one above-described system call methods alternative approach use language-based protection language-based protection system kernel allow code execute produced trusted language compiler language may designed impossible programmer instruct something violate security requirement advantages approach include disadvantages include examples systems language-based protection include jx microsoft singularity edsger dijkstra proved logical point view atomic lock unlock operations operating binary semaphores sufficient primitives express functionality process cooperation however approach generally held lacking terms safety efficiency whereas message passing approach flexible number approaches either lower- higher-level available well many modern kernels providing support systems shared memory remote procedure calls idea kernel i/o devices handled uniformly processes parallel co-operating processes first proposed implemented brinch hansen although similar ideas suggested 1967 hansen description common processes called internal processes i/o devices called external processes similar physical memory allowing applications direct access controller ports registers cause controller malfunction system crash depending complexity device devices get surprisingly complex program use several different controllers providing abstract interface manage device important interface normally done device driver hardware abstraction layer frequently applications require access devices kernel must maintain list devices querying system way done bios one various system buses pci/pcie usb application requests operation device displaying character kernel needs send request current active video driver video driver turn needs carry request example inter process communication ipc naturally listed tasks features provided many ways differ design implementation principle separation mechanism policy substantial difference philosophy micro monolithic kernels mechanism support allows implementation many different policies policy particular mode operation instance mechanism may provide user log-in attempts call authorization server determine whether access granted policy may authorization server request password check encrypted password stored database mechanism generic policy could easily changed e.g requiring use security token mechanism policy integrated module minimal microkernel basic policies included mechanisms allows running top kernel remaining part operating system applications decide policies adopt memory management high level process scheduling file system management etc. monolithic kernel instead tends include many policies therefore restricting rest system rely per brinch hansen presented arguments favour separation mechanism policy failure properly fulfill separation one major causes lack substantial innovation existing operating systems problem common computer architecture monolithic design induced kernel mode user mode architectural approach protection technically called hierarchical protection domains common conventional commercial systems fact every module needing protection therefore preferably included kernel link monolithic design privileged mode reconducted key issue mechanism-policy separation fact privileged mode architectural approach melds together protection mechanism security policies major alternative architectural approach capability-based addressing clearly distinguishes two leading naturally microkernel design see separation protection security monolithic kernels execute code address space kernel space microkernels try run services user space aiming improve maintainability modularity codebase kernels fit exactly one categories rather found two designs called hybrid kernels exotic designs nanokernels exokernels available seldom used production systems xen hypervisor example exokernel monolithic kernel os services run along main kernel thread thus also residing memory area approach provides rich powerful hardware access developers unix developer ken thompson maintain easier implement monolithic kernel microkernels main disadvantages monolithic kernels dependencies system components bug device driver might crash entire system fact large kernels become difficult maintain monolithic kernels traditionally used unix-like operating systems contain operating system core functions device drivers traditional design unix systems monolithic kernel one single program contains code necessary perform every kernel-related task every part accessed programs put library kernel space device drivers scheduler memory handling file systems network stacks many system calls provided applications allow access services monolithic kernel initially loaded subsystems may needed tuned point fast faster one specifically designed hardware although relevant general sense modern monolithic kernels linux freebsd fall category unix-like operating systems feature ability load modules runtime thereby allowing easy extension kernel capabilities required helping minimize amount code running kernel space monolithic kernel advantages hinge points work monolithic kernel done via system calls interfaces usually kept tabular structure access subsystem within kernel disk operations essentially calls made within programs checked copy request passed system call hence far travel monolithic linux kernel made extremely small ability dynamically load modules also ease customization fact versions small enough fit together large number utilities programs single floppy disk still provide fully functional operating system one popular mulinux ability miniaturize kernel also led rapid growth use linux embedded systems types kernels consist core functions operating system device drivers ability load modules runtime provide rich powerful abstractions underlying hardware provide small set simple hardware abstractions use applications called servers provide functionality particular approach defines high-level virtual interface hardware set system calls implement operating system services process management concurrency memory management several modules run supervisor mode design several flaws limitations microkernel also abbreviated \u03bck uk term describing approach operating system design functionality system moved traditional kernel set servers communicate minimal kernel leaving little possible system space much possible user space microkernel designed specific platform device ever going needs operate microkernel approach consists defining simple abstraction hardware set primitives system calls implement minimal os services memory management multitasking inter-process communication services including normally provided kernel networking implemented user-space programs referred servers microkernels easier maintain monolithic kernels large number system calls context switches might slow system typically generate overhead plain function calls parts really require privileged mode kernel space ipc inter-process communication basic scheduler scheduling primitives basic memory handling basic i/o primitives many critical parts running user space complete scheduler memory handling file systems network stacks micro kernels invented reaction traditional monolithic kernel design whereby system functionality put one static program running special system mode processor microkernel fundamental tasks performed able access necessarily hardware manage memory coordinate message passing processes systems use micro kernels qnx hurd case qnx hurd user sessions entire snapshots system views referred essence microkernel architecture illustrates advantages micro kernels use message passing system sort handle requests one server another message passing system generally operates port basis microkernel example request memory sent port opened microkernel request sent within microkernel steps similar system calls rationale would bring modularity system architecture would entail cleaner system easier debug dynamically modify customizable users needs performing part operating systems like gnu hurd minix mklinux qnx redox os although micro kernels small combination required auxiliary code fact often larger monolithic kernels advocates monolithic kernels also point two-tiered structure microkernel systems operating system interact directly hardware creates not-insignificant cost terms system efficiency types kernels normally provide minimal services defining memory address spaces inter-process communication ipc process management functions running hardware processes handled directly micro kernels proponents micro kernels point monolithic kernels disadvantage error kernel cause entire system crash however microkernel kernel process crashes still possible prevent crash system whole merely restarting service caused error services provided kernel networking implemented user-space programs referred servers servers allow operating system modified simply starting stopping programs machine without networking support instance networking server started task moving kernel move data various applications servers creates overhead detrimental efficiency micro kernels comparison monolithic kernels disadvantages microkernel exist however disadvantages micro kernels extremely context based example work well small single purpose critical systems many processes need run complications process management effectively mitigated microkernel allows implementation remaining part operating system normal application program written high-level language use different operating systems top unchanged kernel also possible dynamically switch among operating systems one active simultaneously computer kernel grows grows size vulnerability trusted computing base besides reducing security problem enlarging memory footprint mitigated degree perfecting virtual memory system computer architectures virtual memory support reduce kernel footprint extensive editing performed carefully remove unneeded code difficult non-obvious interdependencies parts kernel millions lines code early 1990s due various shortcomings monolithic kernels versus microkernels monolithic kernels considered obsolete virtually operating system researchers result design linux monolithic kernel rather microkernel topic famous debate linus torvalds andrew tanenbaum merit sides argument presented tanenbaum\u2013torvalds debate monolithic kernels designed code address space kernel space developers argue necessary increase performance system developers also maintain monolithic systems extremely efficient well written monolithic model tends efficient use shared kernel memory rather slower ipc system microkernel designs typically based message passing performance microkernels poor 1980s early 1990s however studies empirically measured performance microkernels analyze reasons inefficiency explanations data left folklore assumption due increased frequency switches kernel-mode user-mode increased frequency inter-process communication increased frequency context switches fact guessed 1995 reasons poor performance microkernels might well 1 actual inefficiency whole microkernel approach 2 particular concepts implemented microkernels 3 particular implementation concepts therefore remained studied solution build efficient microkernel unlike previous attempts apply correct construction techniques end hierarchical protection domains architecture leads design monolithic kernel significant performance drawback time interaction different levels protection i.e process manipulate data structure 'user mode 'supervisor mode since requires message copying value mid-1990s researchers abandoned belief careful tuning could reduce overhead dramatically recently newer microkernels optimized performance l4 k42 addressed problems hybrid kernels used commercial operating systems microsoft windows nt 3.1 nt 3.5 nt 3.51 nt 4.0 2000 xp vista 7 8 8.1 10 apple inc macos uses hybrid kernel called xnu based upon code osf/1 mach kernel osfmk 7.3 freebsd monolithic kernel similar micro kernels except include additional code kernel-space increase performance kernels represent compromise implemented developers demonstrated pure micro kernels provide high performance types kernels extensions micro kernels properties monolithic kernels unlike monolithic kernels types kernels unable load modules runtime hybrid kernels micro kernels non-essential code kernel-space order code run quickly would user-space hybrid kernels compromise monolithic microkernel designs implies running services network stack filesystem kernel space reduce performance overhead traditional microkernel still running kernel code device drivers servers user space many traditionally monolithic kernels least adding actively exploiting module capability well known kernels linux kernel modular kernel essentially parts built core kernel binary binaries load memory demand important note code tainted module potential destabilize running kernel many people become confused point discussing micro kernels possible write driver microkernel completely separate memory space test going live kernel module loaded accesses monolithic portion memory space adding needs therefore opening doorway possible pollution advantages modular hybrid kernel modules generally communicate kernel using module interface sort interface generalized although particular given operating system always possible use modules often device drivers may need flexibility module interface affords essentially two system calls often safety checks done monolithic kernel may done twice disadvantages modular approach nanokernel delegates virtually services including even basic ones like interrupt controllers timer device drivers make kernel memory requirement even smaller traditional microkernel exokernels still-experimental approach operating system design differ types kernels functionality limited protection multiplexing raw hardware providing hardware abstractions top develop applications separation hardware protection hardware management enables application developers determine make efficient use available hardware specific program exokernels extremely small however accompanied library operating systems see also unikernel providing application developers functionalities conventional operating system major advantage exokernel-based systems incorporate multiple library operating systems exporting different api example one high level ui development one real-time control strictly speaking operating system thus kernel required run computer programs directly loaded executed bare metal machine provided authors programs willing work without hardware abstraction operating system support early computers operated way 1950s early 1960s reset reloaded execution different programs eventually small ancillary programs program loaders debuggers left memory runs loaded rom developed formed basis became early operating system kernels bare metal approach still used today video game consoles embedded systems general newer computers use modern operating systems kernels 1969 rc 4000 multiprogramming system introduced system design philosophy small nucleus upon operating systems different purposes could built orderly manner would called microkernel approach decade preceding unix computers grown enormously power point computer operators looking new ways get people use spare time machines one major developments era time-sharing whereby number users would get small slices computer time rate appeared connected slower machine development time-sharing systems led number problems one users particularly universities systems developed seemed want hack system get cpu time reason security access control became major focus multics project 1965 another ongoing issue properly handling computing resources users spent time staring terminal thinking input instead actually using resources computer time-sharing system give cpu time active user periods finally systems typically offered memory hierarchy several layers deep partitioning expensive resource led major developments virtual memory systems commodore amiga released 1985 among first certainly successful home computers feature advanced kernel architecture amigaos kernel executive component exec.library uses microkernel message-passing design kernel components like graphics.library direct access hardware memory protection kernel almost always running user mode special actions executed kernel mode user-mode applications ask operating system execute code kernel mode design phase unix programmers decided model every high-level device file believed purpose computation data transformation instance printers represented file known location data copied file printed systems provide similar functionality tended virtualize devices lower level devices files would instances lower level concept virtualizing system file level allowed users manipulate entire system using existing file management utilities concepts dramatically simplifying operation extension paradigm unix allows programmers manipulate files using series small programs using concept pipes allowed users complete operations stages feeding file chain single-purpose tools although end result using smaller programs way dramatically increased flexibility well ease development use allowing user modify workflow adding removing program chain unix model operating system consists two parts first huge collection utility programs drive operations second kernel runs programs unix programming standpoint distinction two fairly thin kernel program running supervisor mode acts program loader supervisor small utility programs making rest system provide locking i/o services programs beyond kernel n't intervene user space years computing model changed unix treatment everything file byte stream longer universally applicable although terminal could treated file byte stream printed read seem true graphical user interface networking posed another problem even network communication compared file access low-level packet-oriented architecture dealt discrete chunks data whole files capability computers grew unix became increasingly cluttered code also modularity unix kernel extensively scalable kernels might 100,000 lines code seventies eighties kernels modern unix successors like linux 13 million lines modern unix-derivatives generally based module-loading monolithic kernels examples linux kernel many distributions well berkeley software distribution variant kernels freebsd dragonflybsd openbsd netbsd macos apart alternatives amateur developers maintain active operating system development community populated self-written hobby kernels mostly end sharing many features linux freebsd dragonflybsd openbsd netbsd kernels and/or compatible apple first launched classic mac os 1984 bundled macintosh personal computer apple moved nanokernel design mac os 8.6 modern macos originally named mac os x based darwin uses hybrid kernel called xnu created combining 4.3bsd kernel mach kernel microsoft windows first released 1985 add-on ms-dos dependence another operating system initial releases windows prior windows 95 considered operating environment confused operating system product line continued evolve 1980s 1990s windows 9x series adding 32-bit addressing pre-emptive multitasking ended release windows 2000 microsoft also developed windows nt operating system similar interface intended high-end business users line started release windows nt 3.1 1993 introduced general users release windows xp october 2001\u2014replacing windows 9x completely different much sophisticated operating system line continues windows 10 architecture windows nt kernel considered hybrid kernel kernel contains tasks window manager ipc managers client/server layered subsystem model supervisory program supervisor computer program usually part operating system controls execution routines regulates work scheduling input/output operations error actions similar functions regulates flow work data processing system historically term essentially associated ibm line mainframe operating systems starting os/360 operating systems supervisor generally called kernel 1970s ibm abstracted supervisor state hardware resulting hypervisor enabled full virtualization i.e capacity run multiple operating systems machine totally independently hence first system called virtual machine vm although mach developed carnegie mellon university 1985 1994 best-known general-purpose microkernel microkernels developed specific aims l4 microkernel family mainly l3 l4 kernel created demonstrate microkernels necessarily slow newer implementations fiasco pistachio able run linux next l4 processes separate address spaces additionally qnx microkernel principally used embedded systems open-source software minix originally created educational purposes focussed highly reliable self-healing microkernel os", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 85, + 99, + 108, + 113, + 134, + 142, + 170, + 171, + 185, + 187, + 195, + 217, + 219, + 234, + 252, + 265, + 270, + 292, + 301, + 306, + 322, + 331, + 345, + 351, + 353, + 356, + 357, + 359, + 365, + 379, + 380, + 387, + 393, + 404, + 413, + 431, + 434, + 465, + 475, + 477, + 583, + 611, + 647, + 650, + 664, + 695, + 703, + 720, + 721, + 728, + 735, + 780, + 797, + 858, + 860, + 870, + 877, + 884, + 891, + 897, + 899, + 941, + 954, + 957, + 961, + 966, + 974, + 986, + 992, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1046, + 1049, + 1053, + 1054, + 1055, + 1057, + 1063, + 1126, + 1138, + 1155, + 1167, + 1187, + 1200, + 1202, + 1216, + 1224, + 1233, + 1257, + 1276, + 1286, + 1287, + 1301, + 1304, + 1310, + 1369, + 1391, + 1394, + 1398, + 1414, + 1415, + 1441, + 1456, + 1458, + 1462, + 1474, + 1494, + 1521, + 1530, + 1539, + 1546, + 1558, + 1578, + 1601, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 755, + "label": 7, + "text": "Hewlett-Packard:hewlett-packard hewlett-packard company commonly referred hp stylized hp hewlett-packard american multinational information technology company headquartered palo alto california developed provided wide variety hardware components well software related services consumers small- medium-sized businesses smbs large enterprises including customers government health education sectors company founded one-car garage palo alto bill hewlett david packard initially produced line electronic test equipment hp world leading pc manufacturer 2007 q2 2013 time lenovo ranked ahead hp hp specialized developing manufacturing computing data storage networking hardware designing software delivering services major product lines included personal computing devices enterprise industry standard servers related storage devices networking products software diverse range printers imaging products hp directly marketed products households small- medium-sized businesses enterprises well via online distribution consumer-electronics office-supply retailers software partners major technology vendors hp also services consulting business around products partner products hewlett-packard company events included spin-off electronic bio-analytical measurement instruments part business agilent technologies 1999 merger compaq 2002 acquisition eds 2008 led combined revenues 118.4 billion 2008 fortune 500 ranking 9 2009 november 2009 hp announced acquisition 3com deal closing april 12 2010 april 28 2010 hp announced buyout palm inc. 1.2 billion september 2 2010 hp bidding war 3par 33 share offer 2.07 billion dell declined match hewlett-packard spun enterprise products services business hewlett packard enterprise november 1 2015 hewlett-packard held onto pc printer businesses renamed hp inc. bill hewlett david packard graduated degrees electrical engineering stanford university 1935 company originated garage nearby palo alto fellowship past professor frederick terman stanford great depression considered terman mentor forming hewlett-packard 1938 packard hewlett began part-time work rented garage initial capital investment us 538 1939 hewlett packard decided formalize partnership tossed coin decide whether company founded would called hewlett-packard hp packard-hewlett hp incorporated august 18 1947 went public november 6 1957 many projects worked first financially successful product precision audio oscillator model hp200a innovation use small incandescent light bulb known pilot light temperature dependent resistor critical portion circuit negative feedback loop stabilized amplitude output sinusoidal waveform allowed sell model 200a 89.40 competitors selling less stable oscillators 200 model 200 series generators continued production least 1972 200ab still tube-based improved design years one company earliest customers walt disney productions bought eight model 200b oscillators 71.50 use certifying fantasound surround sound systems installed theaters movie fantasia worked counter-radar technology artillery shell fuses world war ii allowed packard hewlett exempt draft hp recognized symbolic founder silicon valley although actively investigate semiconductor devices years traitorous eight abandoned william shockley create fairchild semiconductor 1957 hewlett-packard hp associates division established around 1960 developed semiconductor devices primarily internal use hp associates co-founded another former bell labs researcher mosfet mos transistor inventor mohamed atalla served director semiconductor research instruments calculators products using semiconductor devices hp associates 1960s hp partnered sony yokogawa electric companies japan develop several high-quality products products huge success high costs building hp-looking products japan hp yokogawa formed joint venture yokogawa-hewlett-packard 1963 market hp products japan hp bought yokogawa electric share hewlett-packard japan 1999 hp spun small company dynac specialize digital equipment name picked hp logo hp could turned upside reverse reflect image logo dy new company eventually dynac changed dymec folded back hp 1959 hp experimented using digital equipment corporation dec minicomputers instruments deciding would easier build another small design team deal dec hp entered computer market 1966 hp 2100 hp 1000 series minicomputers simple accumulator-based design two accumulator registers hp 1000 models two index registers series produced 20 years spite several attempts replace forerunner hp 9800 hp 250 series desktop business computers hp 3000 advanced stack-based design business computing server later redesigned risc technology hp 2640 series smart intelligent terminals introduced forms-based interfaces ascii terminals also introduced screen labeled function keys commonly used gas pumps bank atms hp 2640 series included one first bit mapped graphics displays combined hp 2100 21mx f-series microcoded scientific instruction set enabled first commercial wysiwyg presentation program bruno later became program hp-draw hp 3000 although scoffed formative days computing hp would eventually surpass even ibm world largest technology vendor terms sales although programma 101 first commercial desktop computer hp identified wired magazine producer world first device called personal computer hewlett-packard 9100a introduced 1968 programma 101 called computer personale italian fiera di milano 1966 hp called desktop calculator bill hewlett said called computer would rejected customers computer gurus n't look like ibm therefore decided call calculator nonsense disappeared engineering triumph time logic circuit produced without integrated circuits assembly cpu entirely executed discrete components crt display magnetic-card storage printer price around 5,000 machine keyboard cross scientific calculator adding machine alphabetic keyboard steve wozniak co-founder apple originally designed apple computer working hp offered right first refusal work take company wanted stay scientific business industrial markets wozniak said hp turned 5 times loyalty hp made hesitant start apple steve jobs company earned global respect variety products introduced world first handheld scientific electronic calculator 1972 hp-35 first handheld programmable 1974 hp-65 first alphanumeric programmable expandable 1979 hp-41c first symbolic graphing calculator hp-28c like scientific business calculators oscilloscopes logic analyzers measurement instruments reputation sturdiness usability latter products part spin-off agilent product line later spun agilent keysight technologies company design philosophy period summarized design guy next bench 98x5 series technical desktop computers started 1975 9815 cheaper 80 series technical computers started 1979 85 machines used version basic programming language available immediately switched used proprietary magnetic tape storage hp computers similar capabilities much later ibm personal computer although limitations available technology forced prices high 1984 hp introduced inkjet laser printers desktop along scanner product line later developed successful multifunction products significant single-unit printer/scanner/copier/fax machines print mechanisms hp tremendously popular laserjet line laser printers depend almost entirely canon inc. components print engines turn use technology developed xerox hp develops hardware firmware software convert data dots printing march 3 1986 hp registered hp.com domain name making ninth internet .com domain ever registered 1987 palo alto garage hewlett packard started business designated california state historical landmark 1990s hp expanded computer product line initially targeted university research business users reach consumers hp also grew acquisitions bought apollo computer 1989 convex computer 1995 later decade hp opened hpshopping.com independent subsidiary sell online direct consumers 2005 store renamed hp home home office store 1995 1998 hewlett-packard sponsors english football team tottenham hotspur 1999 businesses related computers storage imaging spun hp form agilent technologies agilent spin-off largest initial public offering history silicon valley spin-off created 8 billion company 30,000 employees manufacturing scientific instruments semiconductors optical networking devices electronic test equipment telecom wireless r production july 1999 hp appointed carly fiorina formerly lucent first female ceo fortune-20 company dow jones industrial average fiorina received larger signing offer predecessors fiorina served ceo technology downturn early 2000s led merger compaq disastrous according cnn led firing 30,000 u.s. employees leadership company doubled size tenure ceo beset damaging leaks hp board directors asked fiorina step 2005 following boardroom disagreement resigned february 9 2005 1997 hp sold 120 million worth printers computer products iran european subsidiary dubai-based east distributor despite u.s. export sanctions prohibiting deals imposed bill clinton executive orders issued 1995 story initially reported boston globe triggered inquiry sec hp responded products worth 120 million sold fiscal year 2008 distribution way redington gulf company based netherlands sales took place foreign subsidiary hp violated sanctions hp named redington gulf wholesaler year 2003 turn published press release stating seeds redington-hewlett-packard relationship sowed six years ago one market \u2014 iran time redington gulf three employees whose sole purpose sell hp products iran market according former officials worked sanctions hp using loophole routing sales foreign subsidiary hp ended relationship redington gulf sec inquiry september 3 2001 hp announced agreement reached compaq merge two companies may 2002 passing shareholder vote hp officially merged compaq prior plans place consolidate companies product teams product lines compaq already taken digital equipment corporation 1998 hp therefore still offers support former digital equipment products pdp-11 vax alphaserver merger occurred proxy fight bill hewlett son walter objected merger compaq bought tandem computers 1997 started ex-hp employees digital equipment corporation 1998 following strategy hp became major player desktops laptops servers many different markets merger compaq new ticker symbol became hpq combination two previous symbols hwp cpq show significance alliance also key letters two companies hewlett-packard compaq latter company famous q logo products 2004 hp released dv 1000 series including hp pavilion dv 1658 1040 two years later may 2006 hp began campaign computer personal campaign designed bring back fact pc personal product campaign utilized viral marketing sophisticated visuals website www.hp.com/personal ads featured pharrell petra nemcova mark burnett mark cuban alicia keys jay-z gwen stefani shaun white january 2005 following years performance included hp compaq merger fell short disappointing earning reports board asked fiorina resign chair chief executive officer company following news fiorina departure hp stock jumped 6.9 percent robert wayman chief financial officer hp served interim ceo board undertook formal search replacement mark hurd ncr corporation hired take ceo president effective 1 april 2005 hurd board top choice given revival ncr took place leadership 2006 hp unveiled several new products including desktops enhanced notebooks workstation software manage openview client configuration manager 2.0 year hp share price skyrocketed due consistent results last couple quarters year hurd plan cutback hp workforce lower costs july 2007 hp signed definitive agreement acquire opsware cash tender deal values company 14.25 per share combined opsware software oracle enterprise management software first years hurd new role hp stock price doubled end fiscal 2007 hp hit 100 billion mark first time company annual revenue reached 104 billion allowing hp overtake competitor ibm may 13 2008 hp electronic data systems eds announced signed definitive agreement hp would purchase eds june 30 hp announced waiting period hart-scott-rodino antitrust improvements act 1976 expired transaction still requires eds stockholder approval regulatory clearance european commission non-u.s. jurisdictions subject satisfaction waiver closing conditions specified merger agreement agreement finalized august 26 2008 13 billion publicly announced eds would re-branded eds hp company first targeted layoff 24,600 former eds workers announced september 15 2008 company 2008 annual report gave number 24,700 completed end 2009 round factored purchase price 19.5 billion liability goodwill september 23 2009 eds known hp enterprise services november 11 2009 3com hewlett-packard announced hewlett-packard would acquiring 3com 2.7 billion cash acquisition one biggest size among series takeovers acquisitions technology giants push way become one-stop shops since beginning financial crisis 2007 tech giants constantly felt pressure expand beyond current market niches dell purchased perot systems recently invade technology consulting business area previously dominated ibm hewlett-packard latest move marked incursion enterprise networking gear market dominated cisco april 28 2010 palm inc. hewlett-packard announced hp would buy palm 1.2 billion cash debt announcement rumored either htc dell research motion hp would buy palm adding palm handsets hp product line created overlap ipaq series mobile devices thought significantly improve hp mobile presence ipaqdevices selling well buying palm gave hp library valuable patents well mobile operating platform known webos july 1 2010 acquisition palm final purchase palm webos began big gamble \u2013 build hp ecosystem july 1 2011 hp launched first tablet named hp touchpad bringing webos tablet devices september 2 2010 hp bidding war 3par 33 share offer 2.07 billion dell declined match hp acquisition palm phased compaq brand august 6 2010 ceo mark hurd resigned amid controversy cfo cathie lesjak assumed role interim ceo hurd turned hp around widely regarded one silicon valley star ceos leadership hp became largest computer company world measured total revenue accused sexual harassment colleague allegations deemed baseless investigation led questions concerning 1000 20000 private expenses lack disclosure related friendship observers argued hurd innocent board asked resignation avoid negative pr public analysis divided saw commendable tough action hp handling expenses irregularities saw ill-advised hasty expensive reaction ousting remarkably capable leader turned business around hp hurd oversaw series acquisitions worth 20 billion allowed company expand services networking equipment smartphones shares hp dropped 8.4 after-hours trading hitting 52-week low 9 billion market capitalization shaved larry ellison publicly attacked hp board ousting stating hp board made worst personnel decision since idiots apple board fired steve jobs many years ago september 30 2010 l\u00e9o apotheker named hp new ceo president apotheker appointment sparked strong reaction oracle chief executive larry ellison complained apotheker charge sap one subsidiaries systematically stealing software oracle sap accepted subsidiary closed illegally accessed oracle intellectual property following hurd departure hp seen market problematic margins falling failed redirect establish major new markets cloud mobile services apotheker strategy broadly aim disposing hardware moving profitable software services sector august 18 2011 hp announced would strategically exit smartphone tablet computer business focusing higher-margin strategic priorities cloud solutions software emphasis enterprise commercial government markets also contemplated selling personal computer division spinning separate company quitting 'pc business continuing sell servers equipment business customers strategy already undertaken ibm 2005 hp stock continued drop 40 including 25 one day august 19 2011 company abruptly announced number decisions discontinue webos device business mobile phones tablet computers intent sell personal computer division time hp largest personal computer manufacturer world acquire british big data software firm autonomy 79 premium seen externally absurdly high price business known concerns accounts media analysts described hp actions botched strategy shift chaotic attempt rapidly reposition hp enhance earnings ultimately cost apotheker job autonomy acquisition objected even hp cfo september 22 2011 hp board directors fired apotheker chief executive effective immediately replaced fellow board member former ebay chief meg whitman raymond j lane executive chairman though apotheker served barely ten months received 13 million compensation hp lost 30 billion market capitalization tenure weeks later hp announced review concluded pc division integrated critical business operations company reaffirmed commitment personal systems group year later november 2012 wrote-down almost 9 billion related autonomy acquisition see takeover autonomy became subject intense litigation hp accused autonomy previous management fraudulently exaggerating autonomy financial position called law enforcement regulators countries autonomy previous management accused hp textbook obfuscation finger pointing protect hp executives criticism conceal hp culpability prior knowledge autonomy financial position gross mismanagement autonomy acquisition march 21 2012 hp said printing pc divisions would become one unit headed todd bradley pc division printing chief vyomesh joshi leaving company may 23 2012 hp announced plans lay approximately 27,000 employees posting profit decline 31 second quarter 2012 profit decline account growing popularity smart phones tablets mobile devices slowed sale personal computers may 30 2012 hp unveiled first net zero energy data center hp data center plans use solar energy renewable sources instead traditional power grids july 10 2012 hp server monitoring software discovered previously unknown security vulnerability security warning given customers two vulnerabilities patch released one month later hp official site training center hacked defaced pakistani hacker known 'hitcher demonstrate web vulnerability september 10 2012 hp revised restructuring figures cutting 29,000 jobs hp already cut 3,800 jobs \u2013 around 7 percent revised 29,000 figure \u2013 july 2012 december 31 2013 hp revised number jobs cut 29,000 34,000 october 2014 current number jobs cut end 2013 24,600 end 2013 company 317,500 employees may 22 2014 hp announced would cut 11,000 16,000 jobs addition 34,000 announced 2013 gradually shaping hp nimble lower-cost customer partner-centric company successfully compete across rapidly changing landscape ceo meg whitman said time june 2014 hp discover customer event las vegas meg whitman martin fink announced project radically new computer architecture called machine based memristors silicon photonics machine supposed come commercialization end decade meanwhile representing 75 research activity hp labs october 6 2014 hewlett-packard announced planning split two separate companies separating personal computer printer businesses technology services split first reported wall street journal confirmed media would result two publicly traded companies hewlett packard enterprise hp inc. meg whitman would serve chairman hp inc. ceo hewlett packard enterprise patricia russo would chairman enterprise business dion weisler would ceo hp inc. october 29 2014 hewlett-packard announced new sprout personal computer may 2015 company announced would selling controlling 51 percent stake chinese data-networking business tsinghua unigroup fee least 2.4 billion november 1 2015 previously announced hewlett-packard changed name hp inc. spun hewlett packard enterprise new publicly traded company hp inc. retains hewlett-packard stock price history stock ticker symbol hewlett packard enterprise trades symbol hp global operations directed headquarters palo alto california usa u.s. operations directed facility unincorporated harris county texas near houston latin america offices unincorporated miami-dade county florida u.s. near miami europe offices meyrin switzerland near geneva also research center paris-saclay cluster 20 km south paris france asia-pacific offices singapore also large operations leixlip ireland austin texas boise idaho corvallis oregon fort collins colorado roseville california saint petersburg florida san diego california tulsa oklahoma vancouver washington conway arkansas plano texas former headquarters eds hp acquired uk hp based large site bracknell berkshire offices various uk locations including landmark office tower london 88 wood street recent acquisition 3com expand employee base marlborough massachusetts company also large workforce numerous offices bucharest romania bangalore india address back end operations mphasis headquartered bangalore also enabled hp increase footprint city subsidiary eds company acquired hp produces lines printers scanners digital cameras calculators pdas servers workstation computers computers home small-business use many computers came 2002 merger compaq hp promotes supplying hardware software also full range services design implement support infrastructure hp imaging printing group ipg described company 2005 leading imaging printing systems provider world printer hardware printing supplies scanning devices providing solutions across customer segments individual consumers small medium businesses large enterprises products technology associated ipg include december 23 2008 hp released iprint photo iphone free downloadable software application allows printing 4 x 6 photos hp personal systems group psg claims one leading vendors personal computers pcs world based unit volume shipped annual revenue psg deals hp resold apple ipod november 2005 hp enterprise business eb incorporates hp technology services enterprise services amalgamation former eds known hp services hp enterprise security services oversees professional services network security information security information assurance/ compliancy hp software division enterprise servers storage networking group essn enterprise servers storage networking group essn oversees back end products like storage servers hp networking former procurve responsible nw family products business unit essn hp software division company enterprise software unit years hp produced marketed brand enterprise-management software hp openview september 2005 hp purchased several software companies part publicized deliberate strategy augment software offerings large business customers hp software sells several categories software including hp software also provides software service saas cloud computing solutions software services including consulting education professional services support hp office strategy technology four main functions office strategy technology comes hp labs research arm hp founded 1966 hp labs aims deliver new technologies create business opportunities go beyond hp current strategies examples recent hp labs technology includes memory spot chip 2006 hp idealab provides web forum early-state innovations encourage open feedback consumers development community hp also offers managed services provide complete it-support solutions companies organizations examples include founders developed management style came known hp way hewlett words hp way core ideology ... includes deep respect individual dedication affordable quality reliability commitment community responsibility view company exists make technical contributions advancement welfare humanity following tenets hp way july 2007 company announced met target set 2004 recycle one billion pounds electronics toner ink cartridges set new goal recycling two billion pounds hardware end 2010 2006 company recovered 187 million pounds electronics 73 percent closest competitor 2008 hp released supply chain emissions data \u2014 industry first september 2009 newsweek ranked hp 1 2009 green rankings america 500 largest corporations according environmentalleader.com hewlett-packard earned number one position due greenhouse gas ghg emission reduction programs first major company report ghg emissions associated supply chain according ranking addition hp made effort remove toxic substances products though greenpeace targeted company better hp took top spot corporate responsibility magazine 100 best corporate citizens list 2010 list cited pr week one america important business rankings hp beat russell 1000 index companies leadership seven categories including environment climate changes corporate philanthropy 2009 hp ranked fifth fortune magazine named hp one world admired companies 2010 placing 2 computer industry 32 overall list top 50 year computer industry hp ranked 1 social responsibility long-term investment global competitiveness use corporate assets may 2011 hp released global responsibility report covering accomplishments 2010 report company tenth provides comprehensive view hp global citizenship programs performance goals describes hp uses technology influence expertise make positive impact world company 2009 report best corporate responsibility report year 2009 reports claims hp decreased total energy use 9 percent compared 2008 hp recovered total 118,000 tonnes electronic products supplies recycling 2009 including 61 million print cartridges april 2010 san francisco chronicle article hp one 12 companies commended designing products safe start following principles green chemistry commendations came environment california environmental advocacy group praised select companies golden state bay area efforts keep planet clean green may 2010 hp named one world ethical companies ethisphere institute second year row hp made list ethisphere reviewed researched analyzed thousands nominations 100 countries 35 industries create 2010 list hp one 100 companies earn distinction top winner computer hardware vendor recognized ethisphere honors firms promote ethical business standards practices going beyond legal minimums introducing innovative ideas benefit public hp listed greenpeace guide greener electronics ranks electronics manufacturers according policies sustainability energy climate green products november 2011 hp secured 1st place 15 ranking climbing 3 places increased score 5.9 5.5 scored points new sustainable operations criteria best program measuring reducing emissions greenhouse gases suppliers scoring maximum points thorough paper procurement policy november 2012 report hp ranked second score 5.7 hp especially well disclosure externally verified greenhouse gas emissions setting targets reducing however greenpeace reports hp risks penalty point future editions due fact member trade associations commented energy efficiency standards hp earned recognition work area data privacy security 2010 company ranked 4 ponemon institute annual study trusted companies privacy since 2006 hp worked directly u.s. congress federal trade commission ftc department commerce establish new strategy federal legislation hp played key role work toward december 2010 ftc report protecting consumer privacy era rapid change winning nine straight annual respected company china awards economic observer peking university hp china added 10 year contribution award list accolades award aims identify companies business china outstanding sustained performance business operations development corporate social responsibility 2012 rankings consumer electronics companies progress relating conflict minerals enough project rated hp second 24 companies calling pioneer progress according businessweek study hp world 11th valuable brand 2009 hp many sponsorships one well known sponsorship epcot walt disney world resort 1995 1999 2013 hp shirt sponsor premier league club tottenham hotspur f.c 1997 1999 sponsors australian football league club north melbourne football club also sponsored bmw williams formula 1 team 2005 sponsorship formerly held compaq 2010 sponsor renault f1 hewlett-packard also naming rights arrangement hp pavilion san jose home san jose sharks nhl hockey team 2013 arena naming rights acquired sap ag renaming arena sap center san jose company also maintains number corporate sponsorships business sector including sponsorships trade organisations including fespa print trade exhibitions o'reilly media velocity web development conference acquisition compaq 2002 hp maintained compaq presario brand low-end home desktops laptops hp compaq brand business desktops laptops hp proliant brand intel-architecture servers hp pavilion brand used home entertainment laptops home desktops tandem nonstop servers branded hp integrity nonstop march 2003 hp restated first-quarter cash flow operations reducing 18 percent accounting error actual cash flow operations 647 million 791 million reported earlier hp shifted 144 million net cash used investing activities september 5 2006 shawn cabalfin david o'neil newsweek wrote hp general counsel behest chairwoman patricia dunn contracted team independent security experts investigate board members several journalists order identify source information leak turn security experts recruited private investigators used spying technique known pretexting pretexting involved investigators impersonating hp board members nine journalists including reporters cnet new york times wall street journal order obtain phone records information leaked related hp long-term strategy published part cnet article january 2006 hp employees accused criminal acts since acquitted november 2007 hewlett-packard released bios update covering wide range laptops intent speed computer fan well run constantly whether computer reason prevent overheating defective nvidia graphics processing units gpus shipped many original equipment manufacturers including hewlett-packard dell apple defect concerned new packaging material used nvidia 2007 onwards joining graphics chip onto motherboard perform well thermal cycling prone develop stress cracks \u2013 effectively severing connection gpu motherboard leading blank screen july 2008 hp issued extension initial one-year warranty replace motherboards selected models however option extended models defective nvidia chipsets despite research showing computers also affected fault furthermore replacement motherboard temporary fix since fault inherent units affected models point manufacture including replacement motherboards offered hp free 'repair since point several websites documenting issue notably www.hplies.com forum dedicated refer hewlett-packard multi-million dollar cover issue www.nvidiadefect.com details specifics fault offers advice owners affected computers several small-claims lawsuits filed several states well suits filed countries hewlett-packard also faced class-action lawsuit 2009 i7 processor computers complainants stated systems locked within 30 minutes powering consistently even replaced newer i7 systems lockups continued june 15 2011 hp filed lawsuit california superior court santa clara claiming oracle corporation breached agreement support itanium microprocessor used hp high-end enterprise servers june 15 2011 hp sent formal legal demand letter oracle attempt force world 3 software maker reverse decision discontinue software development intel itanium microprocessor build servers hp lawsuit 2012 requiring oracle continue produce software compatible itanium processor hp awarded 3 billion damages oracle june 30 2016 hp argued oracle canceling support damaged hp itanium server brand oracle announced appeal decision damages november 2012 hp recorded writedown around 8.8 billion related acquisition year earlier uk based autonomy corporation plc hp accused autonomy deliberately inflating value company prior takeover former management team autonomy flatly rejected charge autonomy specialized analysis large scale unstructured big data 2010 uk largest successful software business maintained aggressively entrepreneurial marketing approach controls described rod iron said include zero tolerance firing weakest 5 sales force quarter compensating best sales staff like rock stars time hp fired previous ceo expenses irregularities year appointed l\u00e9o apotheker ceo president hp seen problematic market margins falling failed redirect establish major new markets cloud mobile services apotheker strategy aim disposing hardware moving profitable software services sector part strategy autonomy acquired hp october 2011 hp paid 10.3 billion 87.3 shares valuing autonomy around 11.7 billion \u00a37.4 billion overall premium around 79 market price deal widely criticized absurdly high botched strategy shift chaotic attempt rapidly reposition hp enhance earnings objected even hp cfo within year apotheker fired major culture clashes became apparent hp written 8.8 billion autonomy value hp claim resulted accounting improprieties misrepresentations disclosure failures previous management turn accuse hp textbook example defensive stalling conceal evidence prior knowledge gross mismanagement undermining company noting public awareness since 2009 financial reporting issues even hp cfo disagreed price paid external observers generally state small part write-off appears due accounting mis-statements hp overpaid businesses previously serious fraud office united kingdom u.s. securities exchange commission joined fbi investigating potential anomalies hp incurred much damage stock falling decades low three lawsuits brought shareholders hp fall value hp shares august 2014 united states district court judge threw proposed settlement autonomy previous management argued would collusive intended divert scrutiny hp responsibility knowledge essentially engaging plaintiff attorneys existing cases redirecting previous autonomy vendors management fee 48 million plaintiffs agreeing end claims hp management similarly redirect claims previous autonomy vendors management january 2015 sfo closed investigation likelihood successful prosecution low dispute still litigated us investigated uk ireland financial reporting council june 9 2015 hp agreed pay 100 million investors bought hp shares august 19 2011 november 20 2012 settle suite autonomy purchase october 25 2012 richard falk human rights council special rapporteur situation human rights palestinian territories occupied since 1967 called boycotting hp together businesses profiting israeli settlements occupied palestinian lands brought operations line international human rights humanitarian law 2014 presbyterian church voted move forward divestment hp protest israeli policies toward palestinians 2015 city portland human rights commission requested place caterpillar g4s hewlett-packard motorola solutions city buy list april 9 2014 administrative proceeding securities exchange commission settled hp consenting order acknowledging hp violated foreign corrupt practices act fcpa hp subsidiaries russia poland mexico made improper payments government officials obtain retain lucrative public contracts sec order finds hp subsidiary russia paid 2 million agents various shell companies russian government official retain multimillion-dollar contract federal prosecutor office poland hp subsidiary provided gifts cash bribes worth 600,000 polish government official obtain contracts national police agency part bid win software sale mexico state-owned petroleum company hp subsidiary mexico paid 1 million inflated commissions consultant close ties company officials money funneled one officials hp agreed pay 108 million settle sec charges parallel criminal case", + "neighbors": [ + 13, + 42, + 60, + 77, + 87, + 116, + 134, + 162, + 188, + 195, + 208, + 211, + 227, + 234, + 266, + 267, + 292, + 300, + 322, + 345, + 373, + 443, + 448, + 457, + 469, + 570, + 571, + 611, + 641, + 661, + 776, + 788, + 797, + 810, + 847, + 868, + 912, + 921, + 936, + 1002, + 1013, + 1021, + 1022, + 1066, + 1119, + 1138, + 1188, + 1193, + 1224, + 1233, + 1239, + 1284, + 1323, + 1373, + 1449, + 1484, + 1494, + 1505, + 1507, + 1553, + 1569, + 1578, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 756, + "label": 9, + "text": "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 \u2014 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 \u0455ometimes bytecode also compiled native binary using aot compiler executed natively hardware processor", + "neighbors": [ + 78, + 117, + 246, + 292, + 306, + 308, + 373, + 378, + 396, + 503, + 509, + 521, + 538, + 670, + 682, + 712, + 753, + 756, + 796, + 806, + 820, + 825, + 919, + 929, + 934, + 978, + 998, + 1028, + 1044, + 1050, + 1059, + 1221, + 1225, + 1227, + 1231, + 1233, + 1235, + 1311, + 1319, + 1320, + 1324, + 1372, + 1430, + 1477, + 1511, + 1532, + 1609 + ], + "mask": "Validation" + }, + { + "node_id": 757, + "label": 5, + "text": "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", + "neighbors": [ + 52, + 109, + 311, + 363, + 364, + 405, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 711, + 732, + 758, + 764, + 769, + 770, + 771, + 779, + 833, + 923, + 965, + 993, + 1030, + 1112, + 1116, + 1151, + 1206, + 1218, + 1243, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570, + 1587, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 758, + "label": 5, + "text": "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", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 552, + 598, + 646, + 672, + 678, + 684, + 732, + 757, + 762, + 764, + 769, + 770, + 771, + 779, + 833, + 961, + 993, + 1116, + 1196, + 1206, + 1326, + 1329, + 1386, + 1395, + 1410, + 1421, + 1438, + 1443, + 1448, + 1452, + 1453, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 759, + "label": 4, + "text": "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", + "neighbors": [ + 800, + 1452, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 760, + "label": 7, + "text": "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", + "neighbors": [ + 25, + 390, + 507, + 847, + 1131, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 761, + "label": 1, + "text": "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 \u2019 republic china using name \u201c hong kong china \u201d 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 \u2019 fourth largest ship register world \u2019 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 \u2019 condition registered hong kong ship meet safety pollution prevention standards announced international maritime organization", + "neighbors": [ + 115, + 1426 + ], + "mask": "Test" + }, + { + "node_id": 762, + "label": 4, + "text": "Authentication:authentication authentication authentikos real genuine \u03b1\u1f50\u03b8\u03ad\u03bd\u03c4\u03b7\u03c2 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 \u2019 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 \u2019 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 \u2013 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 \u2019 process questioning veracity aspect literature verifying questions via research fundamental question authentication literature \u2013 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", + "neighbors": [ + 11, + 90, + 144, + 148, + 149, + 221, + 295, + 310, + 333, + 338, + 342, + 379, + 415, + 425, + 439, + 455, + 479, + 517, + 518, + 542, + 576, + 608, + 614, + 638, + 678, + 692, + 698, + 703, + 731, + 739, + 740, + 750, + 758, + 763, + 800, + 813, + 864, + 876, + 898, + 963, + 964, + 977, + 1036, + 1039, + 1112, + 1171, + 1206, + 1218, + 1240, + 1275, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1395, + 1452, + 1472, + 1534, + 1585 + ], + "mask": "Validation" + }, + { + "node_id": 763, + "label": 4, + "text": "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 \u2013 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", + "neighbors": [ + 1, + 11, + 37, + 107, + 134, + 148, + 330, + 379, + 564, + 647, + 762, + 966, + 1090, + 1121, + 1218, + 1287, + 1452, + 1506 + ], + "mask": "Train" + }, + { + "node_id": 764, + "label": 5, + "text": "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", + "neighbors": [ + 52, + 109, + 255, + 295, + 311, + 364, + 377, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 598, + 615, + 672, + 684, + 692, + 711, + 732, + 757, + 758, + 769, + 770, + 771, + 779, + 833, + 856, + 904, + 920, + 961, + 1042, + 1050, + 1110, + 1116, + 1206, + 1218, + 1243, + 1326, + 1329, + 1370, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1451, + 1452, + 1453, + 1461, + 1517, + 1552, + 1570, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 765, + "label": 1, + "text": "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", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 766, + "label": 9, + "text": "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", + "neighbors": [ + 134, + 330, + 579, + 592, + 690, + 730, + 796, + 806, + 824, + 825, + 832, + 893, + 948, + 961, + 985, + 1012, + 1028, + 1059, + 1138, + 1209, + 1225, + 1232 + ], + "mask": "Test" + }, + { + "node_id": 767, + "label": 4, + "text": "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", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 768, + "label": 3, + "text": "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", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 769, + "label": 5, + "text": "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\u2013255.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\u2013192.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 \u00d7 32 bits 160 bits 20 bytes 4-bit field maximum value 15 words 15 \u00d7 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 \u2013 1 \u00d7 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", + "neighbors": [ + 52, + 109, + 216, + 311, + 363, + 425, + 430, + 436, + 444, + 455, + 470, + 542, + 543, + 631, + 672, + 684, + 732, + 740, + 741, + 757, + 758, + 764, + 770, + 771, + 779, + 800, + 813, + 833, + 1042, + 1116, + 1206, + 1218, + 1243, + 1326, + 1329, + 1386, + 1395, + 1400, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570, + 1587, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 770, + "label": 5, + "text": "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", + "neighbors": [ + 52, + 109, + 210, + 227, + 272, + 306, + 311, + 330, + 399, + 425, + 430, + 443, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 771, + 779, + 961, + 1006, + 1116, + 1168, + 1206, + 1218, + 1322, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 771, + "label": 5, + "text": "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", + "neighbors": [ + 14, + 52, + 109, + 111, + 148, + 187, + 189, + 257, + 311, + 349, + 363, + 425, + 430, + 438, + 444, + 455, + 470, + 505, + 512, + 542, + 543, + 566, + 576, + 627, + 672, + 678, + 684, + 711, + 732, + 757, + 758, + 764, + 769, + 770, + 779, + 833, + 852, + 856, + 965, + 977, + 1042, + 1112, + 1114, + 1116, + 1206, + 1218, + 1229, + 1243, + 1301, + 1309, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1416, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1530, + 1552, + 1570, + 1587, + 1588 + ], + "mask": "Test" + }, + { + "node_id": 772, + "label": 4, + "text": "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", + "neighbors": [ + 150, + 306, + 365, + 425, + 470, + 491, + 494, + 684, + 796, + 889, + 930, + 1138, + 1157, + 1443, + 1452, + 1459, + 1517, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 773, + "label": 8, + "text": "Cozi:cozi cozi website mobile app intended help families stay organized features include allowing multiple family members manage schedules one account well organize update shopping to-do lists website founded robbie cape jan miksovsky two left microsoft company first product cozi central released september 25 2006 included family calendar shopping lists family messaging photo collage screensaver company based seattle washington cozi freemium version paid version called cozi gold cozi gold additional features include cozi contacts birthday tracker reminders mobile month view change notifications cozi acquired time inc. 2014 meredith corporation acquired time 2018 cozi moved parents network division june 5 2011 cozi set guinness world record longest line ducks row line stretched one mile made 17,782 rubber ducks", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 774, + "label": 1, + "text": "National_Location_Code:national location code national location code nlc four-digit number allocated every railway station ticket issuing point great britain use ticketing system british railway network used issue tickets accounting purposes subset nlcs created british rail based four main digits plus two supplementary digits nlcs introduced method accounting attributing costs revenue railway assets quotation taken 14th edition january 1987 national location code listing book published british railways board widespread use computers within british railways advent national computer systems dealing payroll compilation stores recording accounting wagon control traffic data revenue expenditure accounting market traffic surveys etc. need standard location code became increasingly important order meet need asked november 1966 revise update publication known terminals mileage gazetteer code time opportunity taken include sidings yards depots offices administrative centres etc. 'railway activity ... file developed based six-digit code known british railways national location code first published 1 january 1968 six-digit code split two parts first four digits identify location asset cost centre final two give information specific asset base location including stations ticket-issuing locations 00 first four digits two-digit combinations signify types asset first four digits indicating base location relate ticket issuing first four digits used examples 1960s 1970s various ticket issuing systems use quite localised simple numerical code structures covering limited number stations relevant area universal coding system identify stations nlc introduced nlcs began appear certain types ticket southern region mainstay ncr21 almost immediately introduction fully computerised intis intermediate ticket issuing system early 1980s four-digit version nlc became fully established intis tickets partly pre-printed station name printed ticket nlc next machine printed codes origin destination stations top line ticket intis superseded aptis 1986 latter became universal ticket office system next 15\u201320 years last aptis machines removed march 2007 aptis tickets nlc station issue printed second line irrespective whether journey started example ticket issued brighton nlc 5268 journey gatwick airport london victoria 5268 nlc covered station associated accounting activities everything tickets issued self-service ticket machines ticket office staff wage slips stations site needed treated separate entities allocated different codes london waterloo east serving south eastern division destinations began late 1980s considered separate station main london waterloo nlc 5598 self-service machines got code 5158 revenue could apportioned correctly relevant division privatisation correct train operating company toc railway network privatised mid-1990s need additional nlcs created 1998 brighton supplied two wall-mounted touch-screen machines cubic transportation systems inc. issuing limited range tickets credit card code 8882 given subsequently erstwhile quickfare machines replaced six fastticket touch-screen machines manufactured shere ltd. bore nlc 8882 well whereas ticket office machines smart terminal supplied shere used station original code 5268 location railway revenue expenditure attributed coded 1960s later came existence subsequently codes allocated location fixed mobile issue tickets location ticket issued journey national rail station examples british railways created 1948 split six operating regions became five 1960s eastern london midland western southern scottish distribution nlcs broadly followed pattern southern region divided three divisions south eastern central south western based three pre-grouping companies nlcs allocated approximately following boundaries follows since privatisation need new codes grown much largely stopped allocated geographical basis especially additional codes given station new station given geographically correct code usually station planned time gap left appropriate section codes example lea green nlc 2339 proposed many years name marshalls cross opened 2000 sometimes chandler ford station reopened original code closed coleshill parkway birmingham nuneaton opened 2007 allocated 9882 relates geographically scotland quirks always existed however", + "neighbors": [ + 774 + ], + "mask": "Test" + }, + { + "node_id": 775, + "label": 2, + "text": "Android_Froyo:android froyo android froyo sixth version android codename android mobile operating system developed google spanning versions 2.2 2.2.3 versions longer supported unveiled may 20 2010 google i/o 2010 conference one prominent changes froyo release usb tethering wi-fi hotspot functionality changes include support android cloud device messaging c2dm service enabling push notifications additional application speed improvements implemented jit compilation displayed within applications top-of-the-screen banners new features introduced froyo include following", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 776, + "label": 3, + "text": "Itanium:itanium itanium family 64-bit intel microprocessors implement intel itanium architecture formerly called ia-64 intel markets processors enterprise servers high-performance computing systems itanium architecture originated hewlett-packard hp later jointly developed hp intel itanium-based systems produced hp hp integrity servers line several manufacturers 2008 itanium fourth-most deployed microprocessor architecture enterprise-class systems behind x86-64 power isa sparc february 2017 intel released current generation test customers may began shipping volume last processor itanium family intel officially announced end life product discontinuance itanium cpu family january 30th 2019 1989 hp determined reduced instruction set computing risc architectures approaching processing limit one instruction per cycle hp researchers investigated new architecture later named explicitly parallel instruction computing epic allows processor execute multiple instructions clock cycle epic implements form long instruction word vliw architecture single instruction word contains multiple instructions epic compiler determines advance instructions executed time microprocessor simply executes instructions need elaborate mechanisms determine instructions execute parallel goal approach twofold enable deeper inspection code compile time identify additional opportunities parallel execution simplify processor design reduce energy consumption eliminating need runtime scheduling circuitry hp believed longer cost-effective individual enterprise systems companies develop proprietary microprocessors partnered intel 1994 develop ia-64 architecture derived epic intel willing undertake large development effort ia-64 expectation resulting microprocessor would used majority enterprise systems manufacturers hp intel initiated large joint development effort goal delivering first product merced 1998 development intel hp industry analysts predicted ia-64 would dominate servers workstations high-end desktops eventually supplant risc complex instruction set computing cisc architectures general-purpose applications compaq silicon graphics decided abandon development alpha mips architectures respectively favor migrating ia-64 several groups ported operating systems architecture including microsoft windows openvms linux hp-ux solaris tru64 unix monterey/64 latter three canceled reaching market 1997 apparent ia-64 architecture compiler much difficult implement originally thought delivery timeframe merced began slipping intel announced official name processor itanium october 4 1999 within hours name itanic coined usenet newsgroup reference rms titanic unsinkable ocean liner sank maiden voyage 1912 itanic since often used register others imply multibillion-dollar investment itanium\u2014and early hype associated it\u2014would followed relatively quick demise time itanium released june 2001 performance superior competing risc cisc processors itanium competed low-end primarily four-cpu smaller systems servers based x86 processors high-end ibm power sun microsystems sparc processors intel repositioned itanium focus high-end business hpc computing attempting duplicate x86 successful horizontal market i.e. single architecture multiple systems vendors success initial processor version limited replacing pa-risc hp systems alpha compaq systems mips sgi systems though ibm also delivered supercomputer based processor power sparc remained strong 32-bit x86 architecture continued grow enterprise space building economies scale fueled enormous installed base thousand systems using original merced itanium processor sold due relatively poor performance high cost limited software availability recognizing lack software could serious problem future intel made thousands early systems available independent software vendors isvs stimulate development hp intel brought next-generation itanium 2 processor market year later itanium 2 processor released 2002 marketed enterprise servers rather whole gamut high-end computing first itanium 2 code-named mckinley jointly developed hp intel relieved many performance problems original itanium processor mostly caused inefficient memory subsystem mckinley contains 221 million transistors 25 million logic measured 19.5 mm 21.6 mm 421 mm fabricated 180 nm bulk cmos process six layers aluminium metallization 2003 amd released opteron cpu implements 64-bit architecture called amd64 opteron gained rapid acceptance enterprise server space provided easy upgrade x86 influence microsoft intel responded implementing amd x86-64 instruction set architecture instead ia-64 xeon microprocessors 2004 resulting new industry-wide de facto standard intel released new itanium 2 family member codenamed madison 2003 madison used 130 nm process basis new itanium processors montecito released june 2006 march 2005 intel announced working new itanium processor codenamed tukwila released 2007 tukwila would four processor cores would replace itanium bus new common system interface would also used new xeon processor later year intel revised tukwila delivery date late 2008 november 2005 major itanium server manufacturers joined intel number software vendors form itanium solutions alliance promote architecture accelerate software porting alliance announced members would invest 10 billion itanium solutions end decade 2006 intel delivered montecito marketed itanium 2 9000 series dual-core processor roughly doubled performance decreased energy consumption 20 percent intel released itanium 2 9100 series codenamed montvale november 2007 may 2009 schedule tukwila follow-on revised release oems planned first quarter 2010 itanium 9300 series processor codenamed tukwila released february 8 2010 greater performance memory capacity device uses 65 nm process includes two four cores 24 mb on-die caches hyper-threading technology integrated memory controllers implements double-device data correction helps fix memory errors tukwila also implements intel quickpath interconnect qpi replace itanium bus-based architecture peak interprocessor bandwidth 96 gb/s peak memory bandwidth 34 gb/s quickpath processor integrated memory controllers interfaces memory directly using qpi interfaces directly connect processors i/o hubs quickpath also used intel processors using nehalem microarchitecture possibly enabled tukwila nehalem use chipsets tukwila incorporates four memory controllers supports multiple ddr3 dimms via separate memory controller much like nehalem-based xeon processor code-named beckton itanium 9500 series processor codenamed poulson follow-on processor tukwila released november 8 2012 according intel skips 45 nm process technology uses 32 nm process technology features eight cores 12-wide issue architecture multithreading enhancements new instructions take advantage parallelism especially virtualization poulson l3 cache size 32 mb l2 cache size 6 mb 512 kb 256 kb per core die size 544 mm\u00b2 less predecessor tukwila 698.75 mm\u00b2 isscc 2011 intel presented paper called 32nm 3.1 billion transistor 12-wide-issue itanium processor mission critical servers given intel history disclosing details itanium microprocessors isscc paper likely referred poulson analyst david kanter speculated poulson would use new microarchitecture advanced form multithreading uses two threads improve performance single threaded multithreaded workloads information also released hot chips conference information presented improvements multithreading resiliency improvements intel instruction replay ras new instructions thread priority integer instruction cache prefetching data access hints intel product change notification pcn 111456-01 lists four models itanium 9500 series cpu later removed revised document parts later listed intel material declaration data sheets mdds database intel later posted itanium 9500 reference manual models following 2012 hewlett-packard co. v. oracle corp. support lawsuit court documents unsealed santa clara county court judge revealed 2008 hewlett-packard paid intel around 440 million keep producing updating itanium microprocessors 2009 2014 2010 two companies signed another 250 million deal obliged intel continue making itanium cpus hp machines 2017 terms agreements hp pay chips gets intel intel launches tukwila poulson kittson kittson+ chips bid gradually boost performance platform rumors successor poulson code named kittson began circulate 2012\u20132013 first associated forthcoming 22 nm process shrink later revised face declining itanium sales less-ambitious 32 nm node april 2015 intel although yet confirmed formal specifications confirm continued work project meanwhile aggressively multicore xeon e7 platform displaced itanium-based solutions intel roadmap july 2016 hp spin-off hewlett packard enterprise hpe announced computer world kittson would released mid-2017 february 2017 intel reported shipping kittson test customers plans ship volume later year intel officially launched itanium 9700 series processor family may 11 2017 notably kittson microarchitecture improvements poulson higher clock speeds intel announced 9700 series last itanium chips produced models comparison xeon family server processors itanium never high-volume product intel intel release production numbers one industry analyst estimated production rate 200,000 processors per year 2007 according gartner inc. total number itanium servers processors sold vendors 2007 55,000 unclear whether clustered servers counted single server compares 417,000 risc servers spread across risc vendors 8.4 million x86 servers idc reports total 184,000 itanium-based systems sold 2001 2007 combined power/sparc/itanium systems market idc reports power captured 42 revenue sparc captured 32 itanium-based system revenue reached 26 second quarter 2008 according idc analyst 2007 hp accounted perhaps 80 itanium systems revenue according gartner 2008 hp accounted 95 itanium sales hp itanium system sales annual rate 4.4bn end 2008 declined 3.5bn end 2009 compared 35 decline unix system revenue sun 11 drop ibm x86-64 server revenue increase 14 period december 2012 idc released research report stating itanium server shipments would remain flat 2016 annual shipment 26,000 systems decline 50 compared shipments 2008 2006 hp manufactured least 80 itanium systems sold 7,200 first quarter 2006 bulk systems sold enterprise servers machines large-scale technical computing average selling price per system excess us 200,000 typical system uses eight itanium processors 2012 manufacturers offered itanium systems including hp bull nec inspur huawei addition intel offered chassis could used system integrators build itanium systems 2015 hp supplied itanium-based systems hp split late 2015 itanium systems branded integrity handled hewlett-packard enterprise hpe recent major update 2017 integrity i6 hp-ux 11i v3 update 16 hpe also supports operating systems including windows server 2008 r2 linux openvms nonstop itanium affected spectre meltdown itanium bus interfaces rest system via chipset enterprise server manufacturers differentiate systems designing developing chipsets interface processor memory interconnections peripheral controllers chipset heart system-level architecture system design development chipset costs tens millions dollars represents major commitment use itanium ibm created chipset 2003 intel 2002 neither developed chipsets support newer technologies ddr2 pci express tukwila moved away fsb chipsets supporting technologies manufactured itanium server vendors hp fujitsu sgi nec hitachi tukwila itanium processor model designed share common chipset intel xeon processor ex intel xeon processor designed four processor larger servers goal streamline system development reduce costs server oems many develop itanium- xeon-based servers however 2013 goal pushed back evaluated future implementation opportunities itanium supported i.e windows version longer bought following operating systems microsoft announced windows server 2008 r2 would last version windows server support itanium support started xp would also discontinue development itanium versions visual studio sql server likewise red hat enterprise linux 5 first released march 2007 last itanium edition red hat enterprise linux debian longer supports itanium officially last release official support debian 7 wheezy covered long term support lts unofficial support newer debian still available limited form via debian ports last available kernel wheezy-backports linux 3.14.0 released march 30 2014 possible manually update latest 3.14.x version recent kernel versions like 4.17.17 september 2018 addition canonical ltd. chose support itanium ubuntu 10.04 lts released april 2010 discontinued hp supporting certifying linux itanium 9300 tukwila servers late september 2012 nec announced return ia-64 previous noah line proprietary mainframe processors produced quad-core variant 40 nm called noah-6 hp sells virtualization technology itanium called integrity virtual machines allow software run itanium intel supported development compilers optimized platform especially suite compilers starting november 2010 introduction new product suites intel itanium compilers longer bundled intel x86 compilers single product intel offers itanium tools intel x86 tools including compilers independently different product bundles gcc open64 microsoft visual studio 2005 later also able produce machine code itanium according itanium solutions alliance 13,000 applications available itanium-based systems early 2008 though sun contested itanium application counts past isa also supported gelato itanium hpc user group developer community ported supported open-source software itanium emulation technique allows computer execute binary code compiled different type computer ibm acquisition quicktransit 2009 application binary software irix/mips solaris/sparc could run via type emulation called dynamic binary translation linux/itanium similarly hp implemented method execute pa-risc/hp-ux itanium/hp-ux via emulation simplify migration pa-risc customers radically different itanium instruction set itanium processors also run mainframe environment gcos groupe bull several x86 operating systems via instruction set simulators itanium aimed enterprise server high-performance computing hpc markets enterprise- hpc-focused processor lines include oracle fujitsu sparc processors ibm power microprocessors measured quantity sold itanium serious competition comes x86-64 processors including intel xeon line amd opteron line since 2009 servers shipped x86-64 processors 2005 itanium systems accounted 14 hpc systems revenue percentage declined industry shifted x86-64 clusters application october 2008 gartner report tukwila processor stated ... future roadmap itanium looks strong risc peer like power sparc itanium-based computer first appeared list top500 supercomputers november 2001 best position ever achieved itanium 2 based system list 2 achieved june 2004 thunder lawrence livermore national laboratory entered list rmax 19.94 teraflops november 2004 columbia entered list 2 51.8 teraflops least one itanium-based computer top 10 june 2007 peak number itanium-based machines list occurred november 2004 list 84 systems 16.8 june 2012 dropped one system 0.2 itanium system remained list november 2012 itanium processors show progression capability merced proof concept mckinley dramatically improved memory hierarchy allowed itanium become reasonably competitive madison shift 130 nm process allowed enough cache space overcome major performance bottlenecks montecito 90 nm process allowed dual-core implementation major improvement performance per watt montvale added three new features core-level lockstep demand-based switching front-side bus frequency 667 mhz first released 2001 itanium performance disappointing compared better-established risc cisc processors emulation run existing x86 applications operating systems particularly poor one benchmark 2001 reporting equivalent best 100 mhz pentium mode 1.1 ghz pentiums market time itanium failed make significant inroads ia-32 risc suffered following arrival x86-64 systems offered greater compatibility older x86 applications 2009 article history processor \u2014 itanium killed computer industry \u2014 journalist john c. dvorak reported continues one great fiascos last 50 years tech columnist ashlee vance commented delays underperformance turned product joke chip industry interview donald knuth said itanium approach ... supposed terrific\u2014until turned wished-for compilers basically impossible write red hat microsoft announced plans drop itanium support operating systems due lack market interest however linux distributions gentoo debian remain available itanium march 22 2011 oracle corporation announced would longer develop new products hp-ux itanium although would continue provide support existing products following announcement hp sued oracle breach contract arguing oracle violated conditions imposed settlement oracle hiring former hp ceo mark hurd co-ceo requiring vendor support itanium software time hp discontinues sales itanium-based servers breach harmed business 2012 court ruled favor hp ordered oracle resume support itanium june 2016 hewlett-packard enterprise corporate successor hp server business awarded 3 billion damages lawsuit former intel official reported itanium business become profitable intel late 2009 2009 chip almost entirely deployed servers made hp 95 itanium server market share making main operating system itanium hp-ux march 22 2011 intel reaffirmed commitment itanium multiple generations chips development schedule although itanium attain limited success niche market high-end computing intel originally hoped would find broader acceptance replacement original x86 architecture amd chose different direction designing less radical x86-64 64-bit extension existing x86 architecture microsoft supported forcing intel introduce extensions x86-based processors designs run existing 32-bit applications native hardware speed offering support 64-bit memory addressing enhancements new applications architecture become predominant 64-bit architecture desktop portable market although itanium-based workstations initially introduced companies sgi longer available 1989 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2009 2010 2011 2012 2013 2014 2017 2019", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 134, + 188, + 195, + 206, + 210, + 211, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 292, + 314, + 331, + 352, + 388, + 413, + 443, + 457, + 460, + 465, + 486, + 491, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 755, + 776, + 803, + 815, + 821, + 846, + 868, + 907, + 937, + 946, + 961, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1084, + 1111, + 1113, + 1125, + 1138, + 1174, + 1193, + 1196, + 1219, + 1256, + 1263, + 1272, + 1284, + 1287, + 1290, + 1304, + 1398, + 1421, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 777, + "label": 8, + "text": "Google_Analytics:google analytics google analytics web analytics service offered google tracks reports website traffic currently platform inside google marketing platform brand google launched service november 2005 acquiring developer urchin google analytics widely used web analytics service web google analytics provides sdk allows gathering usage data ios android app known google analytics mobile apps google analytics used track website activity users session duration pages per session bounce rate etc along information source traffic integrated google ads users review online campaigns tracking landing page quality conversions goals goals might include sales lead generation viewing specific page downloading particular file google analytics approach show high-level dashboard-type data casual user in-depth data report set google analytics analysis identify poorly performing pages techniques funnel visualization visitors came referrers long stayed website geographical position also provides advanced features including custom visitor segmentation google analytics e-commerce reporting track sales activity performance e-commerce reports shows site transactions revenue many commerce-related metrics september 29 2011 google analytics launched real time analytics enabling user insight visitors currently site user 100 site profiles profile generally corresponds one website limited sites traffic fewer 5 million pageviews per month roughly 2 pageviews per second unless site linked google ads campaign google analytics includes google website optimizer rebranded google analytics content experiments google analytics cohort analysis helps understanding behaviour component groups users apart user population beneficial marketers analysts successful implementation marketing strategy google acquired urchin software corp. april 2005 google service developed urchin demand system also brings ideas adaptive path whose product measure map acquired used redesign google analytics 2006 google continued sell standalone installable urchin webanalytics software network value-added resellers discontinuation march 28 2012 google-branded version rolled november 2005 anyone wished sign however due extremely high demand service new sign-ups suspended week later capacity added system google began using lottery-type invitation-code model august 2006 google sending batches invitation codes server availability permitted since mid-august 2006 service fully available users \u2013 whether use google advertising newer version google analytics tracking code known asynchronous tracking code google claims significantly sensitive accurate able track even short activities website previous version delayed page loading performance reasons generally placed codice_1 body close html tag new code placed codice_2 html head tags triggered runs parallel page loading april 2011 google announced availability new version google analytics featuring multiple dashboards custom report options new interface design version later updated features real-time analytics goal flow charts october 2012 another new version google analytics announced called 'universal analytics key differences previous versions cross-platform tracking flexible tracking code collect data device introduction custom dimensions custom metrics march 2016 google released google analytics 360 software suite provides analytics return investment marketing indicators google analytics 360 includes five main products analytics tag manager optimize data studio surveys attribution audience center october 2017 new version google analytics announced called global site tag stated purpose unify tagging system simplify implementation june 2018 google introduced google marketing platform online advertisement analytics brand consists two former brands google doubleclick digital marketing google analytics 360 google analytics implemented page tags case called google analytics tracking code snippet javascript code website owner adds every page website tracking code runs client browser client browses page javascript enabled browser collects visitor data sends google data collection server part request web beacon tracking code loads larger javascript file google web server sets variables user account number larger file currently known ga.js typically 18 kb date file size unknown however recent size 40kbytes may 2018 c dir ga.js /s command pc shows following file sizes 2009 2018 2009/10/07 23,536 ga.js 2014/05/27 40,155 ga.js 2014/10/10 40,924 ga.js 2015/09/13 41,100 ga.js 2017/08/06 43,082 ga.js 2018/04/08 46,275 ga.js file usually loaded however due browser caching assuming caching enabled browser downloads ga.js start visit furthermore websites implement google analytics ga.js code use master file google browser previously visited website running google analytics already file cached machine addition transmitting information google server tracking code sets first party cookie cookies enabled browser visitor computer cookie stores anonymous information called clientid launch universal analytics several cookies storing information whether visitor site new returning visitor timestamp current visit referrer site campaign directed visitor page e.g. search engine keywords banner email visitor arrived site clicking link tagged utm parameters urchin traffic monitor tag values passed database addition google analytics mobile package allows google analytics applied mobile websites mobile package contains server-side tracking codes use php javaserver pages asp.net perl server-side language however many ad filtering programs extensions firefox adblock noscript mobile phone app disconnect mobile block google analytics tracking code prevents traffic users tracked leads holes collected data also privacy networks like tor mask user actual location present inaccurate geographical data small fraction users javascript-enabled/capable browsers turn feature limitations mainly ad filtering program allow significant amount visitor avoid tracker sometimes majority one potential impact data accuracy comes users deleting blocking google analytics cookies without cookies set google analytics collect data individual web user block delete cookies resulting data loss visits google analytics users website owners encourage users disable cookies example making visitors comfortable using site posting privacy policy limitations affect majority web analytics tools use page tags usually javascript programs embedded web pages collect visitor data store cookies visitor computer transmit remote database pretending load tiny graphic beacon another limitation google analytics large websites use sampling generation many reports reduce load servers provide users relatively quick response query google analytics limits reports 500,000 randomly sampled sessions profile level calculations margins error indicated visits metric margins error provided metrics google analytics reports small segments data margin error large several online discussions impact google analytics site performance however google introduced asynchronous javascript code december 2009 reduce risk slowing loading pages tagged ga.js script due ubiquity google analytics raises privacy concerns whenever someone visits website uses google analytics google tracks visit via users ip address order determine user approximate geographic location meet german legal requirements google analytics anonymize ip address google also released browser plugin turns data page visit sent google however browser extension available mobile browsers since plug-in produced distributed google met much discussion criticism furthermore realisation google scripts tracking user behaviours spawned production multiple often open-source browser plug-ins reject tracking cookies plug-ins allow users block google analytics similar sites tracking activities however partially new european privacy laws modern browsers allow users reject tracking cookies though flash cookies separate problem anecdotally reported errors occur behind proxy servers multiple firewalls changing timestamps registering invalid searches webmasters seek mitigate google analytics specific privacy issues employ number alternatives backends hosted machines discontinuation example product urchin webanalytics software google january 20 2015 associated press reported healthcare.gov providing access enrollees personal data private companies specialized advertising mentioning google analytics specifically google offers free google analytics iq lessons google analytics certification test free help center faq google groups forum official google analytics product support new product features announced google analytics blog enterprise support provided google analytics certified partners google academy ads google analytics api used third parties build custom applications reporting tools many applications exist one built run ios apple devices featured apple app store third party products also provide google analytics-based tracking management api core reporting api mcf reporting api real time reporting api subject limits quotas google analytics widely used website statistics service may 2008 pingdom released survey stating 161 500 32 biggest sites globally according alexa rank using google analytics later piece market share analysis claimed google analytics used around 49.95 top 1,000,000 websites ranked 2010 alexa 2012 use around 55 10,000 popular websites august 2013 google analytics used 66.2 10,000 popular websites ordered popularity reported builtwith", + "neighbors": [ + 24, + 41, + 124, + 131, + 176, + 182, + 207, + 216, + 422, + 480, + 502, + 509, + 531, + 547, + 553, + 559, + 632, + 671, + 704, + 775, + 780, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1185, + 1227, + 1235, + 1259, + 1265, + 1292, + 1310, + 1371, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 778, + "label": 7, + "text": "Monjin:monjin monjin digital interviewing assessment platform powered artificial intelligence described portmanteau skype linkedin monjin founded 2014 industry veterans abhijit kashyape ashutosh kulkarni aniruddha fansalkar prafulla paraskar company led abhijit 100 employees across globe 2016 monjin set operations uk usa sweden 2017 monjin partnered microsoft create first azure-based aggregator platform using interviewers create global assessment standard", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 779, + "label": 5, + "text": "Internet_protocol_suite:internet protocol suite internet protocol suite conceptual model set communications protocols used internet similar computer networks commonly known tcp/ip foundational protocols suite transmission control protocol tcp internet protocol ip occasionally known department defense dod model development networking method funded united states department defense darpa internet protocol suite provides end-to-end data communication specifying data packetized addressed transmitted routed received functionality organized four abstraction layers classify related protocols according scope networking involved lowest highest layers link layer containing communication methods data remains within single network segment link internet layer providing internetworking independent networks transport layer handling host-to-host communication application layer providing process-to-process data exchange applications technical standards underlying internet protocol suite constituent protocols maintained internet engineering task force ietf internet protocol suite predates osi model comprehensive reference framework general networking systems internet protocol suite resulted research development conducted defense advanced research projects agency darpa late 1960s initiating pioneering arpanet 1969 darpa started work number data transmission technologies 1972 robert e. kahn joined darpa information processing technology office worked satellite packet networks ground-based radio packet networks recognized value able communicate across spring 1973 vinton cerf helped develop existing arpanet network control program ncp protocol joined kahn work open-architecture interconnection models goal designing next protocol generation arpanet summer 1973 kahn cerf worked fundamental reformulation differences local network protocols hidden using common internetwork protocol instead network responsible reliability arpanet function delegated hosts cerf credits hubert zimmermann louis pouzin designer cyclades network important influences design protocol implemented transmission control program first published 1974 initially tcp managed datagram transmissions routing protocol grew researchers recommended division functionality protocol layers advocates included jonathan postel university southern california information sciences institute edited request comments rfcs technical strategic document series documented catalyzed internet development postel stated screwing design internet protocols violating principle layering encapsulation different mechanisms intended create environment upper layers could access needed lower layers monolithic design would inflexible lead scalability issues transmission control program split two distinct protocols transmission control protocol internet protocol design network included recognition provide functions efficiently transmitting routing traffic end nodes intelligence located edge network end nodes design known end-to-end principle using design became possible connect almost network arpanet irrespective local characteristics thereby solving kahn initial internetworking problem one popular expression tcp/ip eventual product cerf kahn work run two tin cans string years later joke ip avian carriers formal protocol specification created successfully tested computer called router provided interface network forwards network packets back forth originally router called gateway term changed avoid confusion types gateways 1973 1974 cerf networking research group stanford worked details idea resulting first tcp specification significant technical influence early networking work xerox parc produced parc universal packet protocol suite much existed around time darpa contracted bbn technologies stanford university university college london develop operational versions protocol different hardware platforms four versions developed tcp v1 tcp v2 tcp v3 ip v3 tcp/ip v4 last protocol still use today 1975 two-network tcp/ip communications test performed stanford university college london november 1977 three-network tcp/ip test conducted sites us uk norway several tcp/ip prototypes developed multiple research centers 1978 1983 march 1982 us department defense declared tcp/ip standard military computer networking year peter t. kirstein research group university college london adopted protocol migration arpanet tcp/ip officially completed flag day january 1 1983 new protocols permanently activated 1985 internet advisory board later internet architecture board held three-day tcp/ip workshop computer industry attended 250 vendor representatives promoting protocol leading increasing commercial use 1985 first interop conference focused network interoperability broader adoption tcp/ip conference founded dan lynch early internet activist beginning large corporations ibm dec attended meeting ibm dec first major corporations adopt tcp/ip despite competing proprietary protocols ibm 1984 barry appelman group tcp/ip development navigated corporate politics get stream tcp/ip products various ibm systems including mvs vm os/2 time several smaller companies ftp software wollongong group began offering tcp/ip stacks dos microsoft windows first vm/cms tcp/ip stack came university wisconsin early tcp/ip stacks written single-handedly programmers jay elinsky ibm research wrote tcp/ip stacks vm/cms os/2 respectively 1984 donald gillies mit wrote ntcp multi-connection tcp ran atop ip/packetdriver layer maintained john romkey mit 1983-4 romkey leveraged tcp 1986 ftp software founded starting 1985 phil karn created multi-connection tcp application ham radio systems ka9q tcp spread tcp/ip fueled june 1989 university california berkeley agreed place tcp/ip code developed bsd unix public domain various corporate vendors including ibm included code commercial tcp/ip software releases microsoft released native tcp/ip stack windows 95 event helped cement tcp/ip dominance protocols microsoft-based networks included ibm systems network architecture sna platforms digital equipment corporation decnet open systems interconnection osi xerox network systems xns british academic network janet converted tcp/ip 1991 end-to-end principle evolved time original expression put maintenance state overall intelligence edges assumed internet connected edges retained state concentrated speed simplicity real-world needs firewalls network address translators web content caches like forced changes principle robustness principle states general implementation must conservative sending behavior liberal receiving behavior must careful send well-formed datagrams must accept datagram interpret e.g. object technical errors meaning still clear second part principle almost important software hosts may contain deficiencies make unwise exploit legal obscure protocol features encapsulation used provide abstraction protocols services encapsulation usually aligned division protocol suite layers general functionality general application highest level model uses set protocols send data layers data encapsulated level early architectural document emphasizes architectural principles layering rfc 1122 titled host requirements structured paragraphs referring layers document refers many architectural principles emphasize layering loosely defines four-layer model layers names numbers follows link layer networking scope local network connection host attached regime called link tcp/ip literature lowest component layer internet protocols tcp/ip designed hardware independent result tcp/ip may implemented top virtually hardware networking technology link layer used move packets internet layer interfaces two different hosts link processes transmitting receiving packets given link controlled software device driver network card well firmware specialized chipsets perform data link functions adding packet header prepare transmission actually transmit frame physical medium tcp/ip model includes specifications translating network addressing methods used internet protocol link layer addresses media access control mac addresses aspects level however implicitly assumed exist link layer explicitly defined tcp/ip model link layer also layer packets may selected sent virtual private network networking tunnels scenario link layer data may considered application data traverses another instantiation ip stack transmission reception another ip connection connection virtual link may established transport protocol even application scope protocol serves tunnel link layer protocol stack thus tcp/ip model dictate strict hierarchical encapsulation sequence link layer tcp/ip model corresponding functions layer 2 open systems interconnection osi model internet layer responsibility sending packets across potentially multiple networks internetworking requires sending data source network destination network process called routing internet protocol performs two basic functions internet layer agnostic data structures transport layer also distinguish operation various transport layer protocols ip carries data variety different upper layer protocols protocols identified unique protocol number example internet control message protocol icmp internet group management protocol igmp protocols 1 2 respectively protocols carried ip icmp used transmit diagnostic information igmp used manage ip multicast data layered top ip perform internetworking functions illustrates differences architecture tcp/ip stack internet osi model tcp/ip model internet layer corresponds layer three open systems interconnection osi model referred network layer internet layer provides unreliable datagram transmission facility hosts located potentially different ip networks forwarding transport layer datagrams appropriate next-hop router relaying destination functionality internet layer makes possible internetworking interworking different ip networks essentially establishes internet internet protocol principal component internet layer defines two addressing systems identify network hosts computers locate network original address system arpanet successor internet internet protocol version 4 ipv4 uses 32-bit ip address therefore capable identifying approximately four billion hosts limitation eliminated 1998 standardization internet protocol version 6 ipv6 uses 128-bit addresses ipv6 production implementations emerged approximately 2006 transport layer establishes basic data channels applications use task-specific data exchange layer establishes host-to-host connectivity meaning provides end-to-end message transfer services independent structure user data logistics exchanging information particular specific purpose independent underlying network protocols layer may provide error control segmentation flow control congestion control application addressing port numbers end-to-end message transmission connecting applications transport layer categorized either connection-oriented implemented tcp connectionless implemented udp purpose providing process-specific transmission channels applications layer establishes concept network port numbered logical construct allocated specifically communication channels application needs many types services port numbers standardized client computers may address specific services server computer without involvement service announcements directory services ip provides best effort delivery transport layer protocols offer reliability however ip run reliable data link protocol high-level data link control hdlc example tcp connection-oriented protocol addresses numerous reliability issues providing reliable byte stream newer stream control transmission protocol sctp also reliable connection-oriented transport mechanism message-stream-oriented\u2014not byte-stream-oriented like tcp\u2014and provides multiple streams multiplexed single connection also provides multi-homing support connection end represented multiple ip addresses representing multiple physical interfaces one fails connection interrupted developed initially telephony applications transport ss7 ip also used applications user datagram protocol connectionless datagram protocol like ip best effort unreliable protocol reliability addressed error detection using weak checksum algorithm udp typically used applications streaming media audio video voice ip etc on-time arrival important reliability simple query/response applications like dns lookups overhead setting reliable connection disproportionately large real-time transport protocol rtp datagram protocol designed real-time data streaming audio video applications given network address distinguished tcp udp port convention certain well known ports associated specific applications tcp/ip model transport host-to-host layer corresponds roughly fourth layer open systems interconnection osi model also called transport layer application layer includes protocols used applications providing user services exchanging application data network connections established lower level protocols may include basic network support services protocols routing host configuration examples application layer protocols include hypertext transfer protocol http file transfer protocol ftp simple mail transfer protocol smtp dynamic host configuration protocol dhcp data coded according application layer protocols encapsulated transport layer protocol units tcp udp messages turn use lower layer protocols effect actual data transfer tcp/ip model consider specifics formatting presenting data define additional layers application transport layers osi model presentation session layers functions realm libraries application programming interfaces application layer protocols generally treat transport layer lower protocols black boxes provide stable network connection across communicate although applications usually aware key qualities transport layer connection end point ip addresses port numbers application layer protocols often associated particular client-server applications common services well-known port numbers reserved internet assigned numbers authority iana example hypertext transfer protocol uses server port 80 telnet uses server port 23 clients connecting service usually use ephemeral ports i.e. port numbers assigned duration transaction random specific range configured application transport layer lower-level layers unconcerned specifics application layer protocols routers switches typically examine encapsulated traffic rather provide conduit however firewall bandwidth throttling applications must interpret application data example resource reservation protocol rsvp also sometimes necessary network address translator nat traversal consider application payload application layer tcp/ip model often compared equivalent combination fifth session sixth presentation seventh application layers open systems interconnection osi model furthermore tcp/ip model distinguishes user protocols support protocols support protocols provide services system network infrastructure user protocols used actual user applications example ftp user protocol dns support protocol following table shows various networking models number layers varies three seven networking models textbooks secondary sources may conflict intent rfc 1122 ietf primary sources three top layers osi model i.e application layer presentation layer session layer distinguished separately tcp/ip model application layer transport layer pure osi protocol applications x.400 also combined requirement tcp/ip protocol stack must impose monolithic architecture transport layer example nfs application protocol runs external data representation xdr presentation protocol turn runs protocol called remote procedure call rpc rpc provides reliable record transmission safely use best-effort udp transport different authors interpreted tcp/ip model differently disagree whether link layer entire tcp/ip model covers osi layer 1 physical layer issues whether hardware layer assumed link layer several authors attempted incorporate osi model layers 1 2 tcp/ip model since commonly referred modern standards example ieee itu often results model five layers link layer network access layer split osi model layers 1 2 ietf protocol development effort concerned strict layering protocols may fit cleanly osi model although rfcs sometimes refer often use old osi layer numbers ietf repeatedly stated internet protocol architecture development intended osi-compliant rfc 3439 addressing internet architecture contains section entitled layering considered harmful example session presentation layers osi suite considered included application layer tcp/ip suite functionality session layer found protocols like http smtp evident protocols like telnet session initiation protocol sip session layer functionality also realized port numbering tcp udp protocols cover transport layer tcp/ip suite functions presentation layer realized tcp/ip applications mime standard data exchange conflicts apparent also original osi model iso 7498 considering annexes model e.g. iso 7498/4 management framework iso 8648 internal organization network layer ionl ionl management framework documents considered icmp igmp defined layer management protocols network layer like manner ionl provides structure subnetwork dependent convergence facilities arp rarp ietf protocols encapsulated recursively demonstrated tunneling protocols generic routing encapsulation gre gre uses mechanism osi uses tunneling network layer internet protocol suite presume specific hardware software environment requires hardware software layer exists capable sending receiving packets computer network result suite implemented essentially every computing platform minimal implementation tcp/ip includes following internet protocol ip address resolution protocol arp internet control message protocol icmp transmission control protocol tcp user datagram protocol udp internet group management protocol igmp addition ip icmp tcp udp internet protocol version 6 requires neighbor discovery protocol ndp icmpv6 igmpv6 often accompanied integrated ipsec security layer application programmers typically concerned interfaces application layer often also transport layer layers services provided tcp/ip stack operating system ip implementations accessible programmers sockets apis unique implementations include lightweight tcp/ip open source stack designed embedded systems ka9q nos stack associated protocols amateur packet radio systems personal computers connected via serial lines microcontroller firmware network adapter typically handles link issues supported driver software operating system non-programmable analog digital electronics normally charge physical components link layer typically using application-specific integrated circuit asic chipset network interface physical standard high-performance routers large extent based fast non-programmable digital electronics carrying link level switching", + "neighbors": [ + 16, + 52, + 109, + 187, + 311, + 412, + 425, + 430, + 444, + 455, + 470, + 483, + 491, + 542, + 543, + 566, + 576, + 646, + 672, + 684, + 732, + 740, + 757, + 758, + 764, + 769, + 770, + 771, + 813, + 852, + 860, + 961, + 966, + 1011, + 1012, + 1116, + 1144, + 1200, + 1201, + 1206, + 1218, + 1309, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1538, + 1552, + 1570, + 1588, + 1610 + ], + "mask": "Test" + }, + { + "node_id": 780, + "label": 4, + "text": "Ad_blocking:ad blocking ad blocking ad filtering software capability removing altering online advertising web browser application popular ad blocking tools browser extensions methods also available online advertising exists variety forms including web banners pictures animations embedded audio video text pop-up windows employ audio video autoplay browsers offer ways remove alter advertisements either targeting technologies used deliver ads embedded content delivered browser plug-ins via html5 targeting urls source ads targeting behaviors characteristic ads use html5 autoplay audio video standpoint internet user various fundamental reasons one would want use ad blocking addition manipulated brands publishers representative trade bodies hand argue web ads provide revenue website owners enable website owners create otherwise purchase content website publishers claim prevalent use ad blocking software devices could adversely affect website owner revenue thus turn lower availability free content websites users benefits ad blocking software include quicker loading cleaner looking web pages fewer distractions lower resource waste bandwidth cpu memory etc privacy benefits gained exclusion tracking profiling systems ad delivery platforms blocking ads also save substantial amounts electrical energy lower users power bills additional energy savings also expected grid level fewer data packets need transmitted user machine website server ad blocking software may benefits users quality life decreases internet users exposure advertising marketing industries promote purchase numerous consumer products services potentially harmful unhealthy creating urge buy immediately unwanted advertising also harm advertisers users become annoyed ads irritated users might make conscious effort avoid goods services firms using annoying pop-up ads block web content user trying view users interested making purchases blocking ads also save time ad appears website exerts toll user attention budget since ad enters user field view must either consciously ignored closed dealt way user strongly focused reading solely content seeking likely desire diverted advertisements seek sell unneeded unwanted goods services contrast users actively seeking items purchase might appreciate advertising particular targeted ads another important aspect improving security online advertising subjects users higher risk infecting devices computer viruses surfing pornography websites high-profile case malware distributed advertisements provided youtube malicious customer google doubleclick august 2015 0-day exploit firefox browser discovered advertisement website forbes required users disable ad blocking viewing website users immediately served pop-under malware australian signals directorate recommends individuals organizations block advertisements improve information security posture mitigate potential malvertising attacks machine compromise information security firm webroot also note employing ad blockers provide effective countermeasures malvertising campaigns less technically-sophisticated computer users ad blocking also save money user user personal time worth one dollar per minute unsolicited advertising adds extra minute time user requires reading webpage i.e user must manually identify ads ads click close use techniques either deal tax user intellectual focus way user effectively lost one dollar time order deal ads might generate fractional pennies display-ad revenue website owner problem lost time rapidly spiral control malware accompanies ads ad blocking also reduces page load time saves bandwidth users users pay total transferred bandwidth capped pay-for-usage connections including mobile users worldwide direct financial benefit filtering ad loaded analysis 200 popular news sites ranked alexa 2015 showed mozilla firefox tracking protection lead 39 reduction data usage 44 median reduction page load time according research performed new york times ad blockers reduced data consumption sped load time half 50 news sites including journalists concluded visiting home page boston.com site ad data study every day month would cost equivalent 9.50 data usage ads streaming audio video even presented user interface rapidly consume gigabytes transfer especially faster 4g connection even fixed connections often subject usage limits especially faster connections 100mbit/s quickly saturate network filled streaming media known problem web browsers including firefox restoring sessions often plays multiple embedded ads however annoyance easily averted simply setting web browser clear cookies browsing-history information time browser software closed another preventive option use script blocker enables user disable scripts selectively re-enable certain scripts desired order determine role script user thus quickly learn scripts truly necessary standpoint webpage functionality consequently sources scripts undesirable insight helpful visiting websites general thus precisely controlling scripts run webpage viewed user retains full control happens his/her computer cpu computer screen use mobile desktop ad blocking software designed remove traditional advertising grew 41 worldwide 48 u.s. q2 2014 q2 2015 q2 2015 45 million americans using ad blockers survey research study released q2 2016 metafacts reported 72 million americans 12.8 million adults uk 13.2 million adults france using ad blockers pcs smartphones tablet computers march 2016 internet advertising bureau reported uk adblocking already 22 among people 18 years old one method filtering simply block prevent autoplay flash animation image loading microsoft windows audio video files done browsers easily also improves security privacy crude technological method refined numerous browser extensions every web browser handles task differently general one alters options preferences application extensions filter specific media types additional add-on usually required differentiate ads non-ads using technology wanted unwanted ads behaviors advanced ad blocking filter software allow fine-grained control advertisements features blacklists whitelists regular expression filters certain security features also effect disabling ads antivirus software act ad blocker filtering intermediaries isp providers national governments increasingly common 2015 many web browsers block unsolicited pop-up ads automatically current versions konqueror internet explorer also include content filtering support content filtering added firefox chromium-based browsers opera safari browsers extensions adblock adblock plus ublock origin number sources provide regularly updated filter lists adblock plus provided german software house eyeo gmbh included freeware browser maxthon people republic china default another method filtering advertisements uses cascading style sheets css rules hide specific html xhtml elements beginning 2018 google confirmed built-in ad blocker chrome/chromium browsers would go live 15th february ad blocker blocks certain ads specified better ads standard defined coalition better ads\u00ae google board member built-in ad blocking mechanism disputed could unfairly benefit google advertising number external software applications offer ad filtering primary additional feature traditional solution customize http proxy web proxy filter content programs work caching filtering content displayed user browser provides opportunity remove ads also content may offensive inappropriate even malicious drive-by download popular proxy software blocks content effectively include netnanny privoxy squid content-control software main advantage method freedom implementation limitations browser working techniques centralization control proxy used many users proxies good filtering ads several limitations compared browser-based solutions proxies difficult filter transport layer security ssl codice_1 traffic full webpage context available filter well proxies find difficult filter javascript-generated ad content operating systems even aware domain name system dns still offer backward compatibility locally administered list foreign hosts configuration historical reasons stored flat text file default contains hostnames associated ip addresses editing hosts file simple effective dns clients read local hosts file querying remote dns server storing black-hole entries hosts file prevents browser accessing ad server manipulating name resolution ad server local nonexistent ip address codice_2 codice_3 typically used ipv4 addresses simple implement methods circumvented advertisers either hard-coding ip address server hosts ads turn worked around changing local routing table using example iptables blocking firewalls loading advertisements server serves main content blocking name resolution server would also block useful content site using dns sinkhole manipulating hosts file exploits fact operating systems store file ip address domain name pairs consulted browsers using dns server look domain name assigning loopback address known ad server user directs traffic intended reach ad server local machine virtual black hole /dev/null bit bucket advertising blocked using dns server configured block access domains hostnames known serve ads spoofing address users choose use already modified dns server set dedicated device raspberry pi manipulating dns widely employed method manipulate end user sees internet also deployed locally personal purposes china runs root dns eu considered google required google public dns used applications android devices accordingly dns addresses domains used advertising may extremely vulnerable broad form ad substitution whereby domain serves ads entirely swapped one serving local ads subset users especially likely countries notably russia india china advertisers often refuse pay clicks page views dns-level blocking domains non-commercial reasons already common china android apps run local vpn connection host filtering ability dns address without requiring root access approach allows adblocking app download adblocking host files use filter ad networks throughout device blokada dns66 adguard popular apps accomplish adblocking without root permission adblocking active local vpn turned completely stops vpn connection disconnected convenience makes easy access content blocked anti-adblock scripts approach optimizes battery usage reduces internet slowdown caused using external dns vpn adblocking needs overall less configuration devices adtrap use hardware block internet advertising based reviews adtrap device uses linux kernel running version privproxy block ads video streaming music streaming web browser another solution provided network-level ad blocking telcos israeli startup shine internet providers especially mobile operators frequently offer proxies designed reduce network traffic even targeted specifically ad filtering proxy-based arrangements block many types advertisements large bandwidth-consuming otherwise deemed unsuited specific internet connection target device many internet operators block form advertisements time injecting ads promoting services specials content providers argued widespread ad blocking results decreased revenue website sustained advertisements e-commerce-based businesses blocking detected argued since advertisers ultimately paying ads increase revenues eliminating ad blocking would dilute value per impression drive price advertising arguing like click fraud impressions served users use ad blockers little value advertisers consequently argue eliminating ad blocking would increase overall ad revenue content providers long run websites taken countermeasures ad blocking software attempting detect presence ad blockers informing users views outright preventing users accessing content unless disable ad blocking software whitelist website buy ad-removal pass several arguments supporting opposing assertion blocking ads wrong publisher companies taken steps protect rights conduct business according prevailing law suggested european union practice websites scanning ad blocking software may run afoul e-privacy directive claim validated iab europe guidelines released june 2016 stating indeed may legal issue ad blocker detection anti-blocking stakeholders tried refute seems safe assume publishers follow guidelines provided main publisher lobby iab joint effort announced iab sweden prior iab europe guideline matter never materialized would likely found european anti-competition laws august 2017 vendor counter-measures issued demand section 1201 u.s. digital millennium copyright act demand removal domain name associated service ad-blocking filter list vendor argued domain constituted component technological protection measure designed protect copyrighted work thus made violation anti-circumvention law frustrate access 2015 advertisers marketers look involve brands directly entertainment native advertising product placement also known brand integration embedded marketing example product placement would soft drink manufacturer pay reality tv show producer show cast host appear onscreen holding cans soft drink another common product placement automotive manufacturer give free cars producers tv show return show producer depicting characters using vehicles show digital publications turned customers help example guardian asking readers donations help offset falling advertising revenue according newspaper editor-in-chief katharine viner newspaper gets amount money membership paying readers advertising newspaper considered preventing readers accessing content usage ad-blocking software becomes widespread far keeps content accessible readers employ ad-blockers", + "neighbors": [ + 124, + 134, + 384, + 425, + 436, + 509, + 513, + 531, + 623, + 678, + 754, + 777, + 877, + 953, + 961, + 1090, + 1138, + 1172, + 1280, + 1423, + 1542, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 781, + "label": 3, + "text": "Trailblazer_(video_game):trailblazer video game trailblazer video game requires player direct ball along series suspended passages released originally gremlin graphics zx spectrum commodore 64 atari 8-bit family amstrad cpc c16/plus/4 1986 also enhanced version amstrad cpc 3 disc ported amiga atari st 2005 port gizmondo handheld games console released game played either time trial arcade mode music background matches gameplay electronica genre races quite brief usually last 15 45 seconds special fields track let ball jump slow speed warp speed ball invert controls holes game reviewed 1990 dragon 158 hartley patricia kirk lesser role computers column part mastertronic mega pack 10 games previously released europe reviewers gave game 5 5 stars stating favorite disk racing cosmic causeway roads clock robot one really fun zzap 64 reviewers also enjoyed game thought excellent variation race game theme overall rating given 93 steve panak reviewing atari 8-bit version analog computing concluded game original arcade action wristbuster come pike long time one best two-player competition games 've seen", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 782, + "label": 1, + "text": "SQLite:sqlite sqlite relational database management system rdbms contained c library contrast many database management systems sqlite client\u2013server database engine rather embedded end program sqlite acid-compliant implements sql standard generally following postgresql syntax however sqlite uses dynamically weakly typed sql syntax guarantee domain integrity means one example insert string column defined integer sqlite attempt convert data formats appropriate string 123 integer case guarantee conversions store data as-is conversion possible sqlite popular choice embedded database software local/client storage application software web browsers arguably widely deployed database engine used today several widespread browsers operating systems embedded systems mobile phones among others sqlite bindings many programming languages unlike client\u2013server database management systems sqlite engine standalone processes application program communicates instead sqlite library linked thus becomes integral part application program linking may static dynamic application program uses sqlite functionality simple function calls reduce latency database access function calls within single process efficient inter-process communication sqlite stores entire database definitions tables indices data single cross-platform file host machine implements simple design locking entire database file writing sqlite read operations multitasked though writes performed sequentially due server-less design sqlite applications require less configuration client-server databases sqlite called zero-conf require service management startup scripts access control based grant passwords access control handled means file system permissions given database file databases client-server systems use file system permissions give access database files daemon process another implication serverless design several processes may able write database file server-based databases several writers connect daemon able handle locks internally sqlite hand rely file-system locks less knowledge processes accessing database time therefore sqlite preferred choice write-intensive deployments however simple queries little concurrency sqlite performance profits avoiding overhead passing data another process sqlite uses postgresql reference platform would postgresql used make sense sql standard one major deviation exception primary keys sqlite enforce type checking type value dynamic strictly constrained schema although schema trigger conversion storing conversion potentially reversible sqlite strives follow postel rule d. richard hipp designed sqlite spring 2000 working general dynamics contract united states navy hipp designing software used damage-control system aboard guided missile destroyers originally used hp-ux ibm informix database back-end sqlite began tcl extension design goals sqlite allow program operated without installing database management system requiring database administrator hipp based syntax semantics postgresql 6.5 august 2000 version 1.0 sqlite released storage based gdbm gnu database manager sqlite 2.0 replaced gdbm custom b-tree implementation adding transaction capability sqlite 3.0 partially funded america online added internationalization manifest typing major improvements 2011 hipp announced plans add nosql interface managing documents expressed json sqlite databases develop unqlite embeddable document-oriented database sqlite implements sql-92 standard sql lacks features example partially provides triggers write views however provides instead triggers provide functionality provides complex queries still limited alter table function modify delete columns sqlite uses unusual type system sql-compatible dbms instead assigning type column sql database systems types assigned individual values language terms dynamically typed moreover weakly typed ways perl one insert string integer column although sqlite try convert string integer first column preferred type integer adds flexibility columns especially bound dynamically typed scripting language however technique portable sql products common criticism sqlite type system lacks data integrity mechanism provided statically typed columns products sqlite web site describes strict affinity mode feature yet added however implemented constraints like codice_1 tables normally include hidden rowid index column gives faster access database includes integer primary key column sqlite typically optimize treating alias rowid causing contents stored strictly typed 64-bit signed integer changing behavior somewhat like auto-incrementing column future versions sqlite may include command introspect whether column behavior like rowid differentiate columns weakly-typed non-autoincrementing integer primary keys sqlite full unicode function optional several computer processes threads may access database concurrently several read accesses satisfied parallel write access satisfied accesses currently serviced otherwise write access fails error code automatically retried configurable timeout expires concurrent access situation would change dealing temporary tables restriction relaxed version 3.7 write-ahead logging wal turned enabling concurrent reads writes sqlite version 3.7.4 first saw addition fts4 full text search module features enhancements older fts3 module fts4 allows users perform full text searches documents similar search engines search webpages version 3.8.2 added support creating tables without rowid may provide space performance improvements common table expressions support added sqlite version 3.8.3 2015 json1 extension new subtype interfaces sqlite version 3.9 introduced json content managing sqlite code hosted fossil distributed version control system built upon sqlite database standalone command-line program provided sqlite distribution used create database define tables insert change rows run queries manage sqlite database file also serves example writing applications use sqlite library sqlite uses automated regression testing prior release 2 million tests run part release verification starting august 10 2009 release sqlite 3.6.17 sqlite releases 100 branch test coverage one components code coverage tests test harnesses partially public domain partially proprietary sqlite included default large number programming languages provide bindings sqlite including", + "neighbors": [ + 24, + 41, + 65, + 81, + 107, + 113, + 117, + 131, + 195, + 216, + 233, + 298, + 306, + 308, + 332, + 333, + 365, + 392, + 412, + 422, + 502, + 509, + 536, + 548, + 567, + 682, + 775, + 796, + 805, + 818, + 819, + 825, + 837, + 919, + 940, + 948, + 1028, + 1034, + 1061, + 1065, + 1082, + 1120, + 1138, + 1140, + 1183, + 1185, + 1221, + 1225, + 1227, + 1228, + 1235, + 1295, + 1310, + 1311, + 1332, + 1373, + 1411, + 1417, + 1419, + 1430, + 1437, + 1480, + 1483, + 1500, + 1534, + 1569, + 1580, + 1588, + 1602, + 1604 + ], + "mask": "Validation" + }, + { + "node_id": 783, + "label": 4, + "text": "Cloudbleed:cloudbleed cloudbleed security bug discovered february 17 2017 affecting cloudflare reverse proxies caused edge servers run past end buffer return memory contained private information http cookies authentication tokens http post bodies sensitive data result data cloudflare customers leaked went cloudflare customers happened server memory particular moment data cached search engines discovery reported google project zero team tavis ormandy posted issue team issue tracker said informed cloudflare problem february 17 proof-of-concept attack got cloudflare server return private messages major dating sites full messages well-known chat service online password manager data frames adult video sites hotel bookings 're talking full https requests client ip addresses full responses cookies passwords keys data everything effects cloudbleed similar 2014 heartbleed bug allowing unauthorized third parties access data memory programs running web servers including data shielded tls extent cloudbleed also could impacted many users heartbleed since affected security content delivery service used close 2 million websites tavis ormandy first discover vulnerability immediately drew comparison heartbleed saying took every ounce strength call issue 'cloudbleed report thursday february 23 2017 cloudflare wrote post noting bug serious leaked memory could contain private information cached search engines also discovered evidence malicious exploits bug reports existence. br greatest period impact february 13 february 18 around 1 every 3,300,000 http requests cloudflare potentially resulting memory leakage \u2019 0.00003 requests .cloudflare acknowledged memory could leaked early september 22 2016 company also stated one private keys used machine-to-machine encryption leaked turned underlying bug caused memory leak present ragel-based parser many years memory leaked way internal nginx buffers used introducing cf-html subtly changed buffering enabled leakage even though problems cf-html john graham-cumming cloudflare cto noted cloudflare clients uber okcupid n't directly informed leaks due security risks involved situation \u201c backdoor communication outside cloudflare \u2014 google search engines \u201d said graham-cumming also said unfortunately ancient piece software contained latent security problem problem showed process migrating away added team already begun testing software possible issues tavis ormandy initially stated really impressed cloudflare quick response dedicated cleaning unfortunate issue however ormandy pressed cloudflare additional information gave several excuses n't make sense sending draft severely downplays risk customers uber stated impact service limited uber spokesperson added handful session tokens involved since changed passwords exposed okcupid ceo elie seidman said cloudflare alerted us last night bug 've looking impact okcupid members initial investigation revealed minimal exposure determine users impacted promptly notify take action protect fitbit representative stated company investigating issue concerned users change passwords immediately many major news outlets advised consumers sites using cloudflare change passwords even accounts protected 2-factor authentication could risk passwords mobile apps could impacted researchers arbor networks alert suggested us truly safe response large-scale information leak update passwords web sites app-related services use every day ... pretty much inc. magazine cybersecurity columnist joseph steinberg however advised people change passwords stating current risk much smaller price paid increased 'cybersecurity fatigue leading much bigger problems future", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 352, + 376, + 414, + 418, + 473, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 750, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1433, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Train" + }, + { + "node_id": 784, + "label": 4, + "text": "Cardkey:cardkey cardkey producer electronic access control products based simi valley california first company develop widely distribute electronic access control systems company original readers used cards made barium ferrite worked magnetically attracting repelling locking/unlocking cores within reader module mechanism cards primarily used fraternal organizations clubs bpoe elks others first develop wiegand cards readers magnetically based reliable require calibration used barium ferrite readers cards readers highly programmable used applications ranging adt american district telegraph government installations worldwide uk offices manchester reading sold systems companies british telecom shell bp main facility cardkey located nordhoff mason chatsworth additional location cozycroft chatsworth housed customer engineering singular engineering project pass system approximately 1978 division greer hydraulics inc. january 1999 bought johnson controls company whose founder invented electric room thermostat late 1800s", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 785, + "label": 3, + "text": "Match_Day_(series):match day series match day association football video game franchise created jon ritman 1984 1980s 8-bit home computer market following games part match day series games published ocean exception super match soccer", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 786, + "label": 9, + "text": "JRuby:jruby jruby implementation ruby programming language atop java virtual machine written largely java free software released three-way epl/gpl/lgpl license jruby tightly integrated java allow embedding interpreter java application full two-way access java ruby code similar jython python language jruby lead developers charles oliver nutter thomas enebo many current past contributors including ola bini nick sieger september 2006 sun microsystems hired enebo nutter work jruby full-time june 2007 thoughtworks hired ola bini work ruby jruby july 2009 jruby developers left sun continue jruby development engine yard may 2012 nutter enebo left engine yard work jruby red hat jruby originally created jan arne petersen 2001 time several years following code direct port ruby 1.6 c code release ruby 1.8.6 effort began update jruby 1.8.6 features semantics since 2001 several contributors assisted project leading current core team around six members jruby 1.1 added just-in-time compilation ahead-of-time compilation modes jruby already faster cases then-current ruby 1.8.7 reference implementation jruby packages available platforms fedora 9 among first include standard package jruby 1.1.1 july 2009 core jruby developers sun microsystems charles oliver nutter thomas enebo nick sieger joined engine yard continue jruby development may 2012 nutter enebo left engine yard work jruby red hat jruby supported compatibility ruby mri versions 1.6 1.9.3 jruby 1.0 supported ruby 1.8.6 jruby 1.4.0 updating compatibility ruby 1.8.7 jruby 1.6.0 added simultaneous support ruby 1.9.2 jruby 1.7.0 making ruby 1.9.3 default execution mode ruby 1.8.7 compatibility available via command-line flag jruby 9.0.0.0 added support ruby 2.2 jruby able run ruby rails web framework since version 0.9 may 2006 ability execute rubygems webrick since hiring two lead developers sun rails compatibility speed improved greatly jruby version 1.0 successfully passed nearly rails test cases since developers begun use jruby rails applications production environments february 27 2008 sun microsystems university tokyo announced joint-research project implement virtual machine capable executing one ruby jruby application one interpreter jsr 292 supporting dynamically typed languages javatm platform proposes sun open source project multi language virtual machine aims prototype jsr first working prototype developed patch openjdk announced made available end august 2008 jruby team implemented dynamic invocation codebase dynamic invocation initially shipped 1.1.5 release primitive form version 1.7.0 enabled default java 8 builds table presents releases present significant steps jruby history aside versions mainly fixed bugs improved performance performance improvements also shown table every release usually brought improvements since early 2006 current jruby core team endeavored move jruby beyond simple c port support better performance aid eventual compilation java bytecode support end team set ambitious goal able run ruby rails unmodified using jruby process achieving goal jruby test suite expanded extent team gained confidence correctness jruby result toward end 2006 beginning 2007 began commit much complicated redesigns refactorings jruby core subsystems jruby designed work mixed-mode virtual machine ruby code either interpreted directly just-in-time compiled runtime java bytecode ahead-of-time compiled java bytecode execution october 2007 interpreted mode supported ruby constructs full aot/jit compiler available since version 1.1 compiler design allows interpreted compiled code run side-by-side well decompilation reoptimize outputting generated bytecode java class files jruby built-in support rails rspec rake rubygems embeds ffi subsystem allow use c libraries bundled gems also allows launching interactive ruby shell irb ruby mri netbeans ruby pack available netbeans 6 allows ide development ruby jruby well ruby rails two implementations ruby longer included netbeans 7.0 later jruby similar standard ruby interpreter except written java jruby features concepts including object-oriented programming dynamic-typing ruby key difference jruby tightly integrated java called directly java programs java significant footing development web applications one powerful feature jruby ability invoke classes java platform one must first load jruby java support calling require 'java following example creates java jframe jlabel jruby also allows user call java code using ruby-like underscore method naming refer javabean properties attributes jruby easily called java using either jsr 223 scripting java 6 apache bean scripting framework according benchmarks jruby faster alternatives since implementations vary much code loaded execution different methods measuring speed lead biased interpretations performance advantages time takes java virtual machine load often excluded execution times calculating benchmarks jruby significant architectural advantage able leverage jvm threads without constrained global interpreter lock similarly rubinius therefore achieving full parallelism within process ruby mri achieve despite leveraging os threads real mongrel web server application tested 2007 jruby performance better ruby mri 1.8 java virtual machine instantiated 2007 benchmark ruby implementations jruby faster ruby mri 1.8 tests yarv outperformed april 2014 computer language benchmarks game jruby 1.7.4 typically performance ruby mri 2.1.0 uses memory", + "neighbors": [ + 207, + 306, + 412, + 520, + 538, + 712, + 796, + 869, + 1091, + 1138, + 1231, + 1311, + 1372, + 1481, + 1508, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 787, + "label": 9, + "text": "Le_Lisp:le lisp le lisp also le_lisp le-lisp programming language dialect language lisp developed french institute research computer science automation inria implementation language large scale integration vlsi workstation designed direction jean vuillemin le lisp also run various incompatible platforms mostly running unix operating systems used project main goals language powerful post-maclisp version lisp would portable compatible extensible efficient j\u00e9r\u00f4me chailloux led le lisp team working emmanuel st. james matthieu devin jean-marie hullot 1980 dialect historically noteworthy one first lisp implementations available apple ii ibm pc", + "neighbors": [ + 27, + 46, + 56, + 85, + 99, + 134, + 173, + 194, + 195, + 203, + 210, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 457, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1016, + 1021, + 1022, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 788, + "label": 7, + "text": "HP_Autonomy:hp autonomy hp autonomy previously autonomy corporation plc multinational enterprise software company founded cambridge united kingdom 1996 originally autonomy specialised analysis large scale unstructured big data becoming uk largest successful software business 2010 used combination technologies born research university cambridge developed variety enterprise search knowledge management applications using adaptive pattern recognition techniques centered bayesian inference conjunction traditional methods maintained aggressively entrepreneurial marketing approach controls described rod iron said include zero tolerance firing weakest 5 sales force quarter cosseting best sales staff like rock stars autonomy acquired hewlett-packard hp october 2011 deal valued autonomy 11.7 billion \u00a37.4 billion premium around 79 market price widely criticized absurdly high botched strategy shift chaotic attempt rapidly reposition hp enhance earnings expanding high-margin software services sector within year major culture clashes became apparent hp written 8.8 billion autonomy value hp claims resulted accounting improprieties misrepresentations disclosure failures previous management successful fraud case brought cfo sushovan hussain previous management turn accused hp textbook example defensive stalling conceal evidence prior knowledge gross mismanagement undermining company noting public awareness since 2009 financial reporting issues even hp cfo disagreed price paid external observers generally state small part write-off appears due accounting mis-statements hp overpaid businesses previously hp recruited robert youngjohns ex-microsoft president north america take hp autonomy september 2012 worked towards turnaround expanding information management analytics software business though company integrating hp software autonomy remains singular operational business 2017 hp sold autonomy assets part wider deal british software company micro focus autonomy founded cambridge england michael lynch david tabizel richard gaunt 1996 spin-off cambridge neurodynamics firm specializing computer-based finger print recognition autonomy floated 1998 nasdaq exchange share price approximately \u00a30.30 height dot-com bubble peak share price \u00a330 december 2005 autonomy acquired verity inc. one main competitors approximately us 500 million 2005 autonomy also acquired neurodynamics may 2007 exercising option buy stake technology start blinkx inc combining consumer division autonomy floated blinkx valuation 250 million july 2007 autonomy acquired zantaz email archiving litigation support company 375 million october 2007 autonomy acquired meridio holdings ltd uk company based northern ireland specialised records management software \u00a320 million 28 may 2008 kainos extended partnership autonomy high-end information processing information risk management irm deliver information governance solutions customer base january 2009 autonomy acquired interwoven niche provider enterprise content management software 775 million interwoven became autonomy interwoven autonomy imanage 2009 paul morland leading analyst started raising concerns autonomy exaggerated performance claims june 2010 autonomy announced acquire information governance business ca technologies terms sale disclosed 5 may 2011 mercedes formula one team announced 8 million sponsorship deal autonomy 8 july 2010 tottenham hotspur fc announced two-year sponsorship deal autonomy premier league kit 2011\u201312 season spurs premier league shirt featured autonomy augmented reality technology aurasma 16 may 2011 autonomy acquired iron mountain digital pioneer e-discovery online backup solutions provider 380 million iron mountain incorporated 18 august 2011 hewlett-packard announced would purchase autonomy us 42.11 per share transaction unanimously approved boards directors hp autonomy autonomy board recommended shareholders accept offer 3 october 2011 hp closed deal announcing acquired around 87.3 shares around 10.2 billion valuing company around 11.7 billion total may 2012 mike lynch left role autonomy ceo significant drop revenue previous quarter september 2012 robert youngjohns appointed svp gm autonomy/information management business unit november 2012 hewlett-packard announced taking 8.8 billion accounting charge claiming serious accounting improprieties outright misrepresentations autonomy share price fell decades low news however mike lynch counter-alleged problems due hp running autonomy citing internecine warfare within organization serious fraud office united kingdom u.s. securities exchange commission joined fbi investigating potential anomalies however january 2015 sfo closed investigation chance successful prosecution low three lawsuits brought shareholders hp fall value hp shares august 2014 united states district court judge threw proposed settlement autonomy previous management argued would collusive intended divert scrutiny hp executives responsibility knowledge fee 48 million april 2018 autonomy ex-cfo sushovan hussain charged us found guilty accounting fraud evidence lynch charged fraud november 30 january 2014 company announced one partners kainos integrated hp idol 10.5 new version hp autonomy \u2019 information analytics engine kainos electronic medical record platform evolve 31 october 2015 autonomy software products divided hp inc hpq hewlett packard enterprise hpe result hewlett-packard co separation hp inc assigned ownership largely consisting autonomy content management software components including teamsite qfiniti qfiniti managed services mediabin optimost explore hewlett packard enterprise retains ownership remaining software 2 may 2016 opentext acquires hp teamsite hp mediabin hp qfiniti hp explore hp aurasma hp optimost hp inc 170 million 1 september 2017 merged micro focus hp autonomy products include intelligent data operating layer idol allows search processing text taken structured data unstructured human information\u2014including e-mail mobile data\u2014whether originates database audio video text files streams processing information idol referred autonomy meaning-based computing hp autonomy offerings include api platform building data rich applications ease use quick deploy enterprise search solution built onto ondemand api platform june 2013 hp announced platform analyzing finding meaning big data petabytes structured unstructured information also aims identify information needed placed low cost storage even dumped components platform include january 2014 hp released new version hp idol strengthens integration several key components platform expanding upon idol \u2019 analytics reliability ease use cmswire reported new release lot hood catapult idol firmly center big data fray autonomy business primary offices cambridge sunnyvale california well major offices uk us canada france japan australia singapore germany smaller offices india throughout europe latin america", + "neighbors": [ + 195, + 469, + 755 + ], + "mask": "Test" + }, + { + "node_id": 789, + "label": 9, + "text": "Programming_language_theory:programming language theory programming language theory plt branch computer science deals design implementation analysis characterization classification programming languages individual features falls within discipline computer science depending affecting mathematics software engineering linguistics even cognitive science well-recognized branch computer science active research area results published numerous journals dedicated plt well general computer science engineering publications ways history programming language theory predates even development programming languages lambda calculus developed alonzo church stephen cole kleene 1930s considered world first programming language even though intended model computation rather means programmers describe algorithms computer system many modern functional programming languages described providing thin veneer lambda calculus many easily described terms first programming language invented plankalk\u00fcl designed konrad zuse 1940s publicly known 1972 implemented 1998 first widely known successful high-level programming language fortran developed 1954 1957 team ibm researchers led john backus success fortran led formation committee scientists develop universal computer language result effort algol 58 separately john mccarthy mit developed lisp programming language based lambda calculus first language origins academia successful success initial efforts programming languages became active topic research 1960s beyond key events history programming language theory since several fields study either lie within programming language theory profound influence many considerable overlap addition plt makes use many branches mathematics including computability theory category theory set theory formal semantics formal specification behaviour computer programs programming languages three common approaches describe semantics meaning computer program denotational semantics operational semantics axiomatic semantics type theory study type systems tractable syntactic method proving absence certain program behaviors classifying phrases according kinds values compute many programming languages distinguished characteristics type systems program analysis general problem examining program determining key characteristics absence classes program errors program transformation process transforming program one form language another form comparative programming language analysis seeks classify programming languages different types based characteristics broad categories programming languages often known programming paradigms metaprogramming generation higher-order programs executed produce programs possibly different language subset original language result domain-specific languages languages constructed efficiently solve problems particular part domain compiler theory theory writing compilers generally translators programs translate program written one language another form actions compiler traditionally broken syntax analysis scanning parsing semantic analysis determining program optimization improving performance program indicated metric typically execution speed code generation generation output equivalent program target language often instruction set cpu runtime systems refers development programming language runtime environments components including virtual machines garbage collection foreign function interfaces conferences primary venue presenting research programming languages well known conferences include symposium principles programming languages popl programming language design implementation pldi international conference functional programming icfp international conference object oriented programming systems languages applications oopsla international conference architectural support programming languages operating systems asplos notable journals publish plt research include acm transactions programming languages systems toplas journal functional programming jfp journal functional logic programming higher-order symbolic computation", + "neighbors": [ + 87, + 123, + 227, + 282, + 292, + 346, + 347, + 379, + 386, + 392, + 429, + 503, + 567, + 579, + 789, + 799, + 834, + 926, + 1138, + 1146, + 1159, + 1235, + 1319, + 1324, + 1372, + 1398, + 1402, + 1430, + 1549 + ], + "mask": "Test" + }, + { + "node_id": 790, + "label": 9, + "text": "Comparison_of_programming_languages_(array):comparison programming languages array comparison programming languages array compares features array data structures matrix processing 48 various computer programming languages following list contains syntax examples determine dimensions index first element last element size elements note particularly languages index zero others index one least since dijkstra famous essay zero-based indexing seen superior new languages tend use following list contains syntax examples access single element array following list contains syntax examples range element array accessed following table compiled languages ada fortran scripting languages idl matlab s-lang native support vectorized operations arrays example perform element element sum two arrays produce third necessary write addition support vectorized arithmetic relational operations languages also vectorize common mathematical functions sine example array result array whose elements sine corresponding elements array vectorized index operations also supported example one would use fortran create arrays even odd entries array another common use vectorized indices filtering operation consider clipping operation sine wave amplitudes larger 0.5 set 0.5 using s-lang done", + "neighbors": [ + 19, + 65, + 152, + 216, + 249, + 306, + 308, + 373, + 509, + 538, + 567, + 579, + 594, + 597, + 682, + 806, + 825, + 873, + 948, + 1005, + 1028, + 1059, + 1120, + 1152, + 1217, + 1221, + 1225, + 1227, + 1235, + 1311, + 1388, + 1418, + 1430, + 1477, + 1508 + ], + "mask": "Validation" + }, + { + "node_id": 791, + "label": 2, + "text": "Windows_USER:windows user windows user component microsoft windows operating system provides core functionality building simple user interfaces component existed versions windows includes functionality window management message passing input processing standard controls windows user provides large part core user experience microsoft windows historically responsible gradually windows become larger better factored windows user cooperated components provide functionality windows user implements abstractions used build windows applications include hwnd basic unit visual display input windows developer platform visual elements either hwnds live part larger hwnd many functions windows user manipulate properties hwnds size position title hwnd also communication channel wndproc window procedure delivery messages windows managed tree desktop window root hierarchy child windows usually always visually contained within parents applications operating system communicate hwnds using messages window message combination target hwnd message code details mouse position combining calls windows user right way windows application processes messages core windows message loop including calls getmessage translatemessage dispatchmessage core windows application developer functionality related windows user provided c header file winuser.h 16-bit versions windows windows user implemented file called user.exe file extension misnomer windows user fact always dynamic link library 32-bit versions windows 32-bit version windows user called user32.dll located system32 directory compatibility 16-bit applications provided modified version user.exe also present 64-bit versions windows 64-bit implementation windows user called user32.dll located system32 directory modified 32-bit version also called user32.dll present syswow64 directory", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 792, + "label": 4, + "text": "Commvault:commvault commvault publicly traded data protection information management software company headquartered tinton falls new jersey formed 1988 development group bell labs later became business unit network systems incorporated 1996 commvault software used data backup recovery cloud infrastructure management retention compliance commvault business split software licensing services march 1998 bob hammer al bunte joined commvault chairman president ceo vice president coo respectively feb. 5 2019 sanjay mirchandani replaced retiring hammer mirchandani joined commvault puppet oregon-based automation company resided ceo commvault software enterprise-level data platform contains modules back restore archive replicate search data built ground-up single platform unified code base data protected installing agent software physical virtual hosts use operating system application native apis protect data consistent state production data processed agent software client computers backed data manager mediaagent disk tape cloud storage data management activity environment tracked centralized server commserve managed administrators central user interface end users access protected data using web browsers mobile devices 2018 commvault began sell hyperscale backup appliance appliance commvault software pre-integrated hardware customers install directly data centers commvault provides consulting services customers commvault advises customers setting new data management systems architecture design implementation monitoring remote managed service commvault manages software production customers", + "neighbors": [ + 242 + ], + "mask": "Test" + }, + { + "node_id": 793, + "label": 1, + "text": "Independent_Safeguarding_Authority:independent safeguarding authority independent safeguarding authority isa non-departmental public body england northern ireland wales existed 1 december 2012 merged criminal records bureau crb form disclosure barring service dbs isa created labour government 2007-2010 tabloid media campaign decision set isa followed inquiry headed sir michael bichard set wake soham murders isa oversee new vetting barring scheme england wales northern ireland required working vulnerable groups undergo enhanced vetting procedure allowed commence relevant duties 15 june 2010 new coalition government home secretary theresa may announced plans new applicants jobs working children vulnerable along changing posts would register independent safeguarding authority halted vetting barring scheme would severely scaled back save uk taxpayer around \u00a3100 million year home secretary went say protection children vulnerable adults would focus upon common sense rather measures labour introduced said got actually trust people philosophy behind setting isa based upon assumption assumed guilty sense proven innocent told able work children review vetting barring scheme published 11 february 2011 made recommendations merger criminal records bureau independent safeguarding authority one non-departmental public body responsible barring individuals completing criminal record checks protection freedoms act new scheme require registration cases details retained database exception barred whether basis crime basis 'soft intelligence e.g dismissal employer led continued criticism variety organizations bichard report published 22 june 2004 made 31 recommendations recommendation 19 called new registration scheme stated new arrangements introduced requiring wish work children vulnerable adults registered register \u2013 perhaps supported card licence \u2013 would confirm known reason individual work client groups new register would administered central body would take decision subject published criteria approve refuse registration basis information made available police agencies responsibility judging relevance police intelligence deciding person \u2019 suitability would lie central body note recommendation use double-negative known reason individual work client groups say isa inception designed clear individuals suitable work vulnerable groups remove pose known risk proposals implement recommendations put public consultation 5 april 2005 results exercise announced rt hon ruth kelly secretary state department education skills 19 january 2006 translated primary legislation safeguarding vulnerable groups act 2006 received royal assent 8 november 2006 within act isa referred independent barring board known isa since august 2007 formally renamed following royal assent policing crime bill 2009 safeguarding vulnerable groups act covers england wales comparable legislation passed cover northern ireland scotland department children schools families known held consultations along creating isa safeguarding vulnerable groups act 2006 defines two categories work whether paid fall within scope act regulated controlled activity regulated activity primary area work covered act broadly deals direct contact vulnerable groups specifically regulated activity covers activity involves contact children vulnerable adults specified nature e.g teaching training care supervision advice treatment transport activity allowing contact children vulnerable adults specified place e.g school children \u2019 home etc. activity regulated activity must take place frequent intensive basis regulated activity also covers fostering childcare adoption child defined anyone 18 except employment settings age limit 16 addition number defined office holders position prescribed post-holder deemed engaging regulated activity irrespective actual contact vulnerable groups list includes people local authority director children \u2019 services trustees children \u2019 charities school governors distinction made paid voluntary work duties responsibilities regulated activity organisation providing activity although serious criminal offence engage regulated activity barred individuals engage regulated activity required register isa prominent example involved domestic employment individuals required register isa employed parents work children vulnerable adult arranges individuals provide care homes examples domestic employment would include groups private tutors employed directly parents individuals involved direct payments scheme policy confirmed government response isa scheme consultation document may 2008 controlled activity much limited area work tightly defined safeguarding vulnerable groups act controlled activity applies mandatory check isa registration status individuals controlled activity although possible employ barred person providing sufficient safeguards put place isa functioned decision-making element new vetting barring scheme application process monitoring functions run criminal records bureau largely retains functions 2012 entirely merged crb operational vetting barring scheme originally designed would required engaged regulated controlled activity register registration status checked would possible 'opt-out scheme would criminal offences non-compliance employer employee apply case barred individual seeks attains work successful original application process would provided unique reference number employers would verify potential employee membership allowing commence duties via free online check estimates time stated number would required register would approximately 11.3 million people quarter adult population criticised press 2009 proposal create intrusive database ever created democracy described later initial proposals withdrawn press hostility led government creation singleton review 2009 subsequent review led eileen munro 2010 cost registration originally set \u00a364 per person except volunteers would free charge fees also withdrawn requirement register abandoned 2010 point isa barred list reshaped simply list barred accessible employers certain others akin predecessor 'list 99 definition volunteer remains used crb volunteer person engaged activity involves spending time unpaid except travelling approved out-of-pocket expenses something aims benefit someone individuals groups addition close relatives aspects original design retained since singleton review isa owns maintains two lists one covering children sector one cover adults barred working vulnerable groups replaced previous barred lists list 99 protection children act 1999 poca scheme relating protection vulnerable adults pova disqualification orders inclusion barred lists result either automatic bar following police caution conviction following discretionary bar typically following dismissal resignation dismissal possible following act gross misconduct work although potential reasons secondary legislation decisions taken isa isa base decisions upon information range sources including limited held police locally police national computer local authorities social services regulatory organisations general medical council general teaching council england supervisory authorities ofsted also receive cases directly employers employer referrals constitute largest number cases considered discretionary barring receive cases directly individuals cases clear decisions escalated within isa final decisions made board chaired former chief executive barnardo roger singleton isa able consider information led cautions convictions include unproven allegations former employers professional bodies members public stories press however referral information allegations lead automatic inclusion isa barred lists barring decision made individual given information decision based opportunity explain case however hearing process caused controversy see case workers allowed undertake appropriate research internet chatrooms social networking websites although published guidance isa decision making process safeguarding vulnerable groups act 2006 state isa satisfied relevant conduct occurred able consider factor safeguarding vulnerable groups act 2006 defines relevant conduct philosophic burden proof whether event occurred balance probability used civil trials rather beyond reasonable doubt required criminal trials case assessment within risk factors obsession sex violence presence severe emotional loneliness and/or inability manage/sustain emotionally intimate relationships age-appropriate adults links anti-social peers presence impulsive chaotic unstable lifestyle using substances sex cope stress considered relation relevant conduct appeal inclusion means administrative court judicial review recent case demonstrates court minded de-register individual bar lawful disproportionate sb v independent safeguarding authority 2011 ukut 404 aac 04 october 2011 decision reflects similar decisions family criminal law regarding risk assessment conviction sexual offences isa barred lists performed separate albeit related role crb disclosure isa decision-making process considered information relating potential risk individual poses vulnerable groups using sources go beyond held police whereas crb disclosure may contain details offences may lead bar example drink driving may pertinent given role driving school bus isa-registration replace crb disclosures 2012 isa crb merged disclosure barring service dbs march 2009 elements vetting barring scheme begun rolled stages linked series pieces secondary legislation safeguarding vulnerable groups act 2006 isa came existence 2 january 2008 31 march 2008 isa began advising ministers barring decisions taken ministers current schemes 20 january 2009 barring decisions england wales began taken isa taking responsibility secretary state extended northern ireland 13 march 2009 20 february 2009 detailed guidance isa decision-making process published 12 october 2009 increased safeguards came effect around five million jobs voluntary positions \u2013 including national health service jobs \u2013 covered barring arrangements additional safeguards original intention 26 july 2010 new entrants roles working vulnerable groups switching jobs new provider within sectors would able register vbs assessed isa employers would able check registration status online subscribe notified employee registration status changes ability requirement register withdrawn 2011 following singleton munro reviews lists still maintained remains offence employ person regulated activity barred isa person seek work several prominent children authors \u2013 believed would required join scheme order conduct talks schools \u2013 criticised isa philip pullman called scheme outrageous demeaning insulting said would longer appear schools go school author illustrator talk class time else whole school earth \u2013 earth \u2013 world anybody going rape assault child circumstances preposterous author screenwriter frank cottrell boyce said author 're never alone class possible reason unless revenue-raising scam former children laureate anne fine said refuse \u2013 spoken schools without incident 32 years refuse undergo demeaning process part unhealthy situation 've got people close children seen potential paedophiles lindsay mackie representing literary charity english pen said signal children public space defined potentially dangerous space \u2013 values worlds visitors work whether writing engineering family secondary definition adult vetted safe \u2013 limiting fearful creating paranoia others questioned usefulness scheme pointing could prevented soham murders first place perpetrator ian huntley knew victims girlfriend job critical media coverage scheme launched 2009 led confusion registration requirements singleton review set due concerns expressed degree contact children trigger requirement register isa sir roger singleton chief adviser safety children chair isa produced \u2018 drawing line \u2019 report check government drawn line right place relation requirement register december 2009 government accepted recommendations found \u2018 drawing line \u2019 report included clarification number areas dcsf published vetting barring myth buster clarify requirements scheme however fact-sheet challenged rather simplistic one-sided several unions professional associations represent effected isa 2009 onwards organizations produced large amount documentation form statements conference resolutions advice either clarifying challenging isa publications referenced including written royal college nursing nurses union national union teachers nut national association schoolmasters union women teachers nasuwt unison union non-teaching staff schools even small sample responses different unions associations significant differences within opinions expressed positions adopted rcn specific branches nasuwt seemingly taking strongest oppositional stance perhaps indicates quite complex child protection debate uk currently 2010 government partly response pressure organizations mentioned launched second review isa led professor eileen munro department social policy london school economics political science lse following munro review 2011 requirement register withdrawn entirely also announced isa would merged crb 2012 isa role maintain lists accessed employers certain bodies barred working either children vulnerable adults changes extent brought end virulent press criticisms isa however also led deeper questioning thinking behind original creation isa specific accusations government overseen many changes reviews showing lack support organization isa initially created knee jerk reaction soham murders philip pullman remains one vociferous critics accusing government using soham murders 'scare story scare british public accepting intrusive database visible opposition isa came large nurses union royal college nursing rcn included successful legal cases brought rcn 2010 several journalists campaigning organizations continued voice criticism including 'civitas 'the manifesto club run journalist josie appleton criticisms concerns commonly raised regarding structure independent safeguarding authority included person barred without hearing minimum standard evidence legal support available 'minded bar right appeal limited single sanction barring 10 years anyone aged 25 refusal independent safeguarding authority use word 'sanction describe barring process formed basis rcn cases organizations continued question basis upon independent safeguarding authority created asking whether bureaucratic solution child protection issues realistic sensible isa accused vociferous critics broadsheets guardian 'unethical 'orwellian rcn campaigning groups ask whether creates problems creating 'climate fear amongst professionals simultaneously creating 'an illusion security amongst public general end pointed recent cases paedophile offences schools committed vanessa george plymouth \u2013 2010 could prevented form database cases others like offender previous criminal disciplinary record debate seems likely continue especially neither pro anti viewpoint regarding expansion systems claimed political party conventional political standpoint right left", + "neighbors": [ + 1248 + ], + "mask": "Test" + }, + { + "node_id": 794, + "label": 3, + "text": "Yie_Ar_Kung-Fu_II:yie ar kung-fu ii lee young young martial arts master son brave warrior rid china chop suey gang however one member survived declared emperor yie-gah like father lee young rid china yie-gah allies lee young goes three sections level face boss along way meets ninjas power-ups lee acquire oolong tea replenish health lo mein temporary invincibility lee carry three oolong teas time game also features two-player mode player 1 controls lee player 2 choice play either yen pei lan fang po chin making lan fang first ever playable female character fighting game predating chun li street fighter ii five years", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 795, + "label": 9, + "text": "Scott_Fahlman:scott fahlman scott elliott fahlman born march 21 1948 computer scientist professor emeritus carnegie mellon university notable early work automated planning blocks world semantic networks neural networks particular cascade correlation algorithm dylan programming language common lisp particular cmu common lisp one founders lucid inc. period standardized recognized leader common lisp recently fahlman engaged constructing knowledge base scone based part thesis work netl semantic network fahlman born medina ohio son lorna may dean john emil fahlman received bachelor degree master degree 1973 mit ph.d. mit 1977 master thesis advisor patrick winston doctoral thesis advisor gerald sussman noted doctoral diploma says degree awarded original research demonstrated thesis field artificial intelligence suggested may first use term fellow american association artificial intelligence fahlman acted thesis advisor donald cohen david b. mcdonald david s. touretzky skef wholey justin boyan michael witbrock alicia tribble sagae may 1996 july 2001 fahlman directed justsystem pittsburgh research center fahlman credited originating first smiley emoticon thought would help people message board carnegie mellon distinguish serious posts jokes proposed use purpose symbols caught original message symbols originated posted september 19 1982 message recovered jeff baird september 10 2002 quoted though credited originating smiley emoticons first emoticon user similar marker appeared article reader digest may 1967 interview printed new york times 1969 vladimir nabokov noted often think exist special typographical sign smile \u2014 sort concave mark supine round bracket", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 987, + 1021, + 1096, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 796, + "label": 3, + "text": "Cross-platform_software:cross-platform software computing cross-platform software also multi-platform software platform-independent software computer software implemented multiple computing platforms cross-platform software may divided two types one requires individual building compilation platform supports one directly run platform without special preparation e.g. software written interpreted language pre-compiled portable bytecode interpreters run-time packages common standard components platforms example cross-platform application may run microsoft windows linux macos cross-platform programs may run many existing platforms two platforms cross-platform frameworks qt flutter nativescript xamarin phonegap ionic react native exist aid cross-platform development platform refer type processor cpu hardware given operating system application runs type operating system computer combination type hardware type operating system running example common platform microsoft windows running x86 architecture well-known desktop computer platforms include linux/unix macos cross-platform however many devices smartphones also effectively computer platforms less commonly thought way application software written depend features particular platform\u2014either hardware operating system virtual machine runs java platform virtual machine platform runs many operating systems hardware types common platform software written hardware platform refer instruction set architecture example x86 architecture variants ia-32 x86-64 machines often run one version microsoft windows though run operating systems well including linux openbsd netbsd macos freebsd 32-bit arm architectures newer 64-bit version common smartphones tablet computers run android ios mobile operating systems software platforms either operating system programming environment though commonly combination notable exception java uses operating system independent virtual machine compiled code known world java bytecode examples software platforms previously noted java platform exception general rule operating system software platform java language typically compiles virtual machine virtual cpu runs code written language enables executable binary run systems implement java virtual machine jvm java programs executed natively using java processor n't common mostly used embedded systems java code running jvm access os-related services like disk i/o network access appropriate privileges granted jvm makes system calls behalf java application setup allows users decide appropriate protection level depending acl example disk network access usually enabled desktop applications browser-based applets jni also used enable access operating system specific functions currently java standard edition programs run microsoft windows macos several unix-like operating systems several non-unix-like operating systems like embedded systems mobile applications browser plugins used windows mac based devices android built-in support java also subsets java java card java platform micro edition designed resource-constrained devices piece software considered cross-platform must able function one computer architecture operating system developing program time-consuming task different operating systems different application programming interfaces api example linux uses different api application software windows software written particular operating system automatically work architectures operating system supports one example august 2006 openoffice.org natively run amd64 intel 64 lines processors implementing x86-64 standards computers since changed openoffice.org suite software \u201c mostly \u201d ported 64-bit systems also means program written popular programming language c c++ mean run operating systems support programming language\u2014or even operating system different architecture web applications typically described cross-platform ideally accessible various web browsers within different operating systems applications generally employ client\u2013server system architecture vary widely complexity functionality wide variability significantly complicates goal cross-platform capability routinely odds goal advanced functionality basic web applications perform processing stateless server pass result client web browser user interaction application consists simple exchanges data requests server responses types applications norm early phases world wide web application development applications follow simple transaction model identical serving static web pages today still relatively common especially cross-platform compatibility simplicity deemed critical advanced functionalities prominent examples advanced web applications include web interface gmail a9.com google maps website live search service bing microsoft advanced applications routinely depend additional features found recent versions popular web browsers dependencies include ajax javascript dynamic html svg components rich internet applications older versions popular web browsers tend lack support certain features competing interests cross-platform compatibility advanced functionality numerous alternative web application design strategies emerged strategies include graceful degradation attempts provide similar functionality users platforms diminishing functionality least common denominator limited client browsers example user attempting use limited-feature browser access gmail may notice gmail switches basic mode reduced functionality differs cross-platform techniques attempt provide equivalent functionality adequate functionality across platforms multiple codebase applications maintain distinct codebases different hardware os platforms equivalent functionality obviously requires duplication effort maintaining code worthwhile amount platform-specific code high strategy relies one codebase may compiled multiple platform-specific formats one technique conditional compilation technique code common platforms repeated blocks code relevant certain platforms made conditional interpreted compiled needed another technique separation functionality disables functionality supported client browsers operating systems still delivering complete application user see also separation concerns technique used web development interpreted code scripting languages query platform running execute different blocks conditionally third-party libraries attempt simplify cross-platform capability hiding complexities client differentiation behind single unified api responsive web design rwd web design approach aimed crafting visual layout sites provide optimal viewing experience\u2014easy reading navigation minimum resizing panning scrolling\u2014across wide range devices mobile phones desktop computer monitors little platform-specific code used technique one complicated aspect cross-platform web application design need software testing addition complications mentioned previously additional restriction web browsers prohibit installation different versions browser operating system although several development approaches companies use target multiple platforms result software requires substantial manual effort testing maintenance across supported platforms techniques full virtualization sometimes used workaround problem using tools page object model cross platform tests scripted way one test case usable multiple versions app long different versions similar user interfaces versions tested one time one test case web applications becoming increasingly popular many computer users still use traditional application software rely client/web-server architecture distinction traditional web applications always clear features installation methods architectures web traditional applications overlap blur distinction nevertheless simplifying distinction common useful generalization traditionally modern computing application software distributed end-users binary file especially executable files executables support operating system computer architecture built for\u2014which means making single cross-platform executable would something massive task generally replaced offering selection executables platforms supported software distributed binary executable software written c c++ programmer must build software different operating system computer architecture i.e must use toolset translates\u2014transcompiles\u2014a single codebase multiple binary executables example firefox open-source web browser available windows macos powerpc x86 apple inc. calls universal binary linux *bsd multiple computer architectures four platforms case windows macos linux *bsd separate executable distributions although come source code use different toolsets perform different builds may sufficient achieve variety working executables different platforms case software engineer must port i.e amend code suitable new computer architecture operating system example program firefox already runs windows x86 family modified re-built run linux x86 potentially architectures well multiple versions code may stored separate codebases merged one codebase conditional compilation see note porting must accompanied cross-platform building reverse case alternative porting cross-platform virtualization allows applications compiled one cpu operating system run system different cpu and/or operating system without modification source code binaries example apple rosetta built intel-based macintosh computers runs applications compiled previous generation macs used powerpc cpus another example ibm powervm lx86 allows linux/x86 applications run unmodified linux/power operating system script considered cross-platform interpreter available multiple platforms script uses facilities provided language script written python unix-like system likely run little modification windows python also runs windows also one implementation python run scripts e.g. ironpython .net framework goes many open-source programming languages available scripting languages unlike binary executable files script used computers software interpret script script generally stored plain text text file may issues however type new line character sits lines generally however little work done make script written one system run another quite popular cross-platform scripting interpreted languages cross-platform multi-platform term also apply video games released range video game consoles specialized computers dedicated task playing games examples cross-platform video games include miner 2049er fifa video game series nhl series minecraft released across variety gaming platforms wii playstation 3 xbox 360 personal computers pcs mobile devices characteristics particular system may lengthen time taken implement video game across multiple platforms video game may initially released platforms later released remaining platforms typically situation occurs new gaming system released video game developers need acquaint hardware software associated new console games may become cross-platform licensing agreements developers video game console manufacturers limit development game one particular console example disney could create game intention release latest nintendo sony game consoles disney license game sony first disney may exchange required release game solely sony \u2019 console short time indefinitely\u2014effectively prohibiting cross-platform release duration several developers implemented means play games online using different platforms psyonix epic games microsoft valve corporation possess technology allows xbox 360 playstation 3 gamers play pc gamers leaving decision platform use consumers first game allow level interactivity pc console games quake 3 games feature cross-platform online play include rocket league street fighter v killer instinct paragon fable fortune minecraft better together update windows 10 vr editions pocket edition xbox one cross-platform programming practice actively writing software work one platform different ways approaching problem writing cross-platform application program one approach simply create multiple versions program different source trees \u2014in words microsoft windows version program might one set source code files macintosh version might another foss *nix system might another straightforward approach problem potential considerably expensive development cost development time especially corporate entities idea behind create two different programs ability behave similarly also possible means developing cross-platform application result problems bug tracking fixing two different source trees would different programmers thus different defects version another approach used depend pre-existing software hides differences platforms\u2014called abstraction platform\u2014such program unaware platform running could said programs platform agnostic programs run java virtual machine jvm built fashion applications mix various methods cross-platform programming create final application example firefox web browser uses abstraction build lower-level components separate source subtrees implementing platform-specific features like gui implementation one scripting language help facilitate ease portability firefox implements xul css javascript extending browser addition classic netscape-style browser plugins much browser written xul css javascript well number tools available help facilitate process cross-platform programming certain issues associated cross-platform development include", + "neighbors": [ + 14, + 22, + 29, + 33, + 42, + 65, + 82, + 107, + 108, + 117, + 134, + 138, + 162, + 168, + 176, + 178, + 192, + 194, + 196, + 197, + 201, + 207, + 275, + 292, + 296, + 301, + 306, + 308, + 313, + 318, + 330, + 332, + 337, + 360, + 373, + 391, + 392, + 396, + 399, + 405, + 446, + 447, + 468, + 500, + 509, + 512, + 520, + 521, + 526, + 565, + 567, + 579, + 582, + 598, + 620, + 631, + 653, + 682, + 686, + 690, + 712, + 713, + 715, + 716, + 734, + 737, + 752, + 756, + 766, + 772, + 782, + 786, + 796, + 802, + 804, + 805, + 806, + 815, + 824, + 825, + 847, + 869, + 870, + 874, + 886, + 899, + 916, + 948, + 961, + 962, + 985, + 987, + 998, + 1005, + 1006, + 1028, + 1059, + 1068, + 1091, + 1094, + 1102, + 1106, + 1123, + 1132, + 1138, + 1139, + 1173, + 1179, + 1180, + 1189, + 1190, + 1207, + 1214, + 1217, + 1219, + 1225, + 1227, + 1231, + 1235, + 1242, + 1243, + 1251, + 1279, + 1280, + 1288, + 1292, + 1298, + 1302, + 1304, + 1311, + 1321, + 1366, + 1372, + 1376, + 1381, + 1398, + 1407, + 1417, + 1454, + 1466, + 1502, + 1536, + 1547, + 1550, + 1556, + 1588, + 1604, + 1607 + ], + "mask": "Test" + }, + { + "node_id": 797, + "label": 2, + "text": "Macintosh_operating_systems:macintosh operating systems family macintosh operating systems developed apple inc. includes graphical user interface-based operating systems designed use macintosh series personal computers since 1984 well related system software created compatible third-party systems 1984 apple debuted operating system known classic mac os release original macintosh system software system rebranded mac os 1996 preinstalled every macintosh 2002 offered macintosh clones short time 1990s noted ease use also criticized lack modern technologies compared competitors current mac operating system macos originally named mac os x 2012 os x 2016 developed 1997 2001 apple purchase next mac os x brought entirely new architecture based nextstep unix system eliminated many technical challenges classic mac os faced current macos preinstalled every mac updated annually basis apple current system software devices \u2013 ios watchos tvos audioos prior introduction mac os x apple experimented several concepts releasing different products designed bring macintosh interface applications unix-like systems vice versa a/ux mae mklinux apple effort expand upon develop replacement classic mac os 1990s led cancelled projects code named star trek taligent copland although different architectures macintosh operating systems share common set gui principles including menu bar across top screen finder shell featuring desktop metaphor represents files applications using icons relates concepts like directories file deletion real-world objects like folders trash overlapping windows multitasking classic mac os original macintosh operating system introduced 1984 alongside first macintosh remained primary use macs 2001 apple released original macintosh january 24 1984 early system software partially based lisa os xerox parc alto computer former apple ceo steve jobs previewed originally named system software simply system apple rebranded mac os 1996 due part macintosh clone program ended year later classic mac os characterized monolithic design initial versions system software run one application time system 5 introduced cooperative multitasking system 7 supports 32-bit memory addressing virtual memory allowing larger programs later updates system 7 enable transition powerpc architecture system considered user-friendly architectural limitations critiqued limited memory management lack protected memory access controls susceptibility conflicts among extensions nine major versions classic mac os released name classic signifies system whole reference compatibility layer helped ease transition mac os x. macos originally named mac os x 2012 os x 2016 current mac operating system officially succeeded classic mac os 2001 although system originally marketed simply version 10 mac os history largely independent classic mac os unix-based operating system built nextstep technology developed next late 1980s early 1997 apple purchased company ceo steve jobs returned apple precursors original release mac os x include openstep apple rhapsody project mac os x public beta macos makes use bsd codebase xnu kernel core set components based upon apple open source darwin operating system macos basis apple operating systems including iphone os/ios watchos tvos audioos first desktop version system released march 24 2001 supporting aqua user interface since several versions adding newer features technologies released since 2011 new releases offered annual basis early server computing version system released 1999 technology preview followed several official server-based releases server functionality instead offered add-on desktop system since 2011 apple real-time operating system environment a/rose small embedded operating system ran macintosh coprocessor platform expansion card macintosh idea offer single overdesigned hardware platform third-party vendors could build practically product reducing otherwise heavy workload developing nubus-based expansion card first version system ready use february 1988 1988 apple released first unix-based os a/ux unix operating system mac os look feel competitive time due part crowded unix market macintosh hardware lacking high-end design features present workstation-class computers a/ux success sales u.s. government posix compliance requirement mac os could meet macintosh application environment mae software package introduced apple 1994 allowed users certain unix-based computer workstations run apple macintosh application software mae used x window system emulate macintosh finder-style graphical user interface last version mae 3.0 compatible system 7.5.3 mae available sun microsystems sparcstation hewlett-packard systems discontinued may 14 1998 announced 1996 worldwide developers conference wwdc mklinux open source operating system started osf research institute apple february 1996 port linux powerpc platform thus macintosh computers mid 1998 community-led mklinux developers association took development operating system mklinux short microkernel linux refers project adaptation linux kernel run server hosted atop mach microkernel mklinux based version 3.0 mach star trek boldly go mac gone relatively unknown secret prototype beginning 1992 whose goal create version classic mac os would run intel-compatible x86 personal computers partnership apple support intel project instigated novell looking integrate dr-dos mac os gui mutual response monopoly microsoft windows 3.0 ms-dos team consisting four apple four novell able get macintosh finder basic applications quicktime running smoothly x86 architecture project canceled year later early 1993 code later reused porting mac os powerpc taligent portmanteau talent intelligent name object-oriented operating system company dedicated producing started project within apple provide replacement classic mac os later spun joint venture ibm part aim alliance purpose building competing platform microsoft cairo nextstep development process never worked taligent often cited example project death march apple pulled project 1995 code delivered copland project apple create updated version classic mac os introduced protected memory preemptive multitasking number new underlying operating system features yet still compatible existing mac software originally planned follow-up release known gershwin would add multithreading advanced features new features added rapidly could completed completion date slipped future sign release 1996 apple decided cancel project outright find suitable third-party system replace copland development ended august 1996 december 1996 apple announced buying next nextstep operating system arrival macintosh 1984 apple history operating systems began apple ii series computers 1977 ran apple dos prodos later gs/os apple iii 1980 ran apple sos apple lisa 1983 ran lisa os later macworks xl macintosh emulator apple also developed newton os newton personal digital assistant 1993 1997 recent years apple also launched several new operating systems based core macos including ios 2007 iphone ipad ipod touch mobile devices watchos 2015 apple watch tvos 2015 apple tv set-top box audioos homepod smart speakers", + "neighbors": [ + 1, + 9, + 22, + 33, + 37, + 42, + 55, + 58, + 64, + 85, + 99, + 121, + 123, + 134, + 170, + 171, + 185, + 187, + 252, + 265, + 322, + 345, + 353, + 356, + 365, + 380, + 387, + 395, + 413, + 434, + 465, + 475, + 477, + 524, + 551, + 583, + 596, + 625, + 650, + 664, + 696, + 720, + 721, + 728, + 754, + 755, + 858, + 860, + 877, + 884, + 891, + 917, + 927, + 941, + 945, + 954, + 961, + 966, + 996, + 1001, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1057, + 1063, + 1100, + 1138, + 1139, + 1140, + 1155, + 1157, + 1187, + 1189, + 1190, + 1202, + 1224, + 1232, + 1292, + 1301, + 1304, + 1334, + 1339, + 1373, + 1391, + 1394, + 1398, + 1409, + 1415, + 1441, + 1456, + 1474, + 1494, + 1496, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 798, + "label": 4, + "text": "Anderson's_rule_(computer_science):anderson rule computer science field computer security anderson rule refers principle formulated ross j. anderson nature large databases never free abuse breaches security large system designed ease access becomes insecure made watertight becomes impossible use", + "neighbors": [ + 379, + 429 + ], + "mask": "Test" + }, + { + "node_id": 799, + "label": 9, + "text": "Lexical_analysis:lexical analysis computer science lexical analysis lexing tokenization process converting sequence characters computer program web page sequence tokens strings assigned thus identified meaning program performs lexical analysis may termed lexer tokenizer scanner though scanner also term first stage lexer lexer generally combined parser together analyze syntax programming languages web pages forth lexer forms first phase compiler frontend modern processing analysis generally occurs one pass older languages algol initial stage instead line reconstruction performed unstropping removed whitespace comments scannerless parsers separate lexer steps done part lexer lexers parsers often used compilers used computer language tools prettyprinters linters lexing divided two stages scanning segments input string syntactic units called lexemes categorizes token classes evaluating converts lexemes processed values lexers generally quite simple complexity deferred parser semantic analysis phases often generated lexer generator notably lex derivatives however lexers sometimes include complexity phrase structure processing make input easier simplify parser may written partly fully hand either support features performance lexeme sequence characters source program matches pattern token identified lexical analyzer instance token authors term token using token interchangeably represent string tokenized token data structure resulting putting string tokenization process word lexeme computer science defined differently lexeme linguistics lexeme computer science roughly corresponds word linguistics confused word computer architecture although cases may similar morpheme lexical token simply token string assigned thus identified meaning structured pair consisting token name optional token value token name category lexical unit common token names consider expression c programming language lexical analysis expression yields following sequence tokens token name might termed part speech linguistics specification programming language often includes set rules lexical grammar defines lexical syntax lexical syntax usually regular language grammar rules consisting regular expressions define set possible character sequences lexemes token lexer recognizes strings kind string found lexical program takes action simply producing token two important common lexical categories white space comments also defined grammar processed lexer may discarded producing tokens considered non-significant separating two tokens codice_2 instead codice_3 two important exceptions first off-side rule languages delimit blocks indenting initial whitespace significant determines block structure generally handled lexer level see phrase structure secondly uses lexers comments whitespace must preserved \u2013 examples prettyprinter also needs output comments debugging tools may provide messages programmer showing original source code 1960s notably algol whitespace comments eliminated part line reconstruction phase initial phase compiler frontend separate phase eliminated handled lexer tokenization process demarcating possibly classifying sections string input characters resulting tokens passed form processing process considered sub-task parsing input example text string string n't implicitly segmented spaces natural language speaker would raw input 43 characters must explicitly split 9 tokens given space delimiter i.e. matching string codice_5 regular expression codice_6 tokens could represented xml sentence /sentence s-expression token class represents one possible lexeme lexer often saves enough information reproduce original lexeme used semantic analysis parser typically retrieves information lexer stores abstract syntax tree necessary order avoid information loss case numbers identifiers tokens identified based specific rules lexer methods used identify tokens include regular expressions specific sequences characters termed flag specific separating characters called delimiters explicit definition dictionary special characters including punctuation characters commonly used lexers identify tokens natural use written programming languages tokens often categorized character content context within data stream categories defined rules lexer categories often involve grammar elements language used data stream programming languages often categorize tokens identifiers operators grouping symbols data type written languages commonly categorize tokens nouns verbs adjectives punctuation categories used post-processing tokens either parser functions program lexical analyzer generally nothing combinations tokens task left parser example typical lexical analyzer recognizes parentheses tokens nothing ensure matched lexer feeds tokens parser representation used typically enumerated list number representations example identifier represented 0 assignment operator 1 addition operator 2 etc tokens defined often regular expressions understood lexical analyzer generator lex lexical analyzer generated automatically tool like lex hand-crafted reads stream characters identifies lexemes stream categorizes tokens termed tokenizing lexer finds invalid token report error following tokenizing parsing interpreted data may loaded data structures general use interpretation compiling first stage scanner usually based finite-state machine fsm encoded within information possible sequences characters contained within tokens handles individual instances character sequences termed lexemes example integer lexeme may contain sequence numerical digit characters many cases first non-whitespace character used deduce kind token follows subsequent input characters processed one time reaching character set characters acceptable token termed maximal munch longest match rule languages lexeme creation rules complex may involve backtracking previously read characters example c one l character enough distinguish identifier begins l wide-character string literal lexeme however string characters known certain kind e.g. string literal sequence letters order construct token lexical analyzer needs second stage evaluator goes characters lexeme produce value lexeme type combined value properly constitutes token given parser tokens parentheses really values evaluator function return nothing type needed similarly sometimes evaluators suppress lexeme entirely concealing parser useful whitespace comments evaluators identifiers usually simple literally representing identifier may include unstropping evaluators integer literals may pass string deferring evaluation semantic analysis phase may perform evaluation involved different bases floating point numbers simple quoted string literal evaluator needs remove quotes evaluator escaped string literal incorporates lexer unescapes escape sequences example source code computer program string might converted following lexical token stream whitespace suppressed special characters value due licensing restrictions existing parsers may necessary write lexer hand practical list tokens small general lexers generated automated tools tools generally accept regular expressions describe tokens allowed input stream regular expression associated production rule lexical grammar programming language evaluates lexemes matching regular expression tools may generate source code compiled executed construct state transition table finite-state machine plugged template code compiling executing regular expressions compactly represent patterns characters lexemes might follow example english-based language identifier token might english alphabetic character underscore followed number instances ascii alphanumeric characters and/or underscores could represented compactly string means character a-z a-z followed 0 a-z a-z 0-9 regular expressions finite-state machines generate powerful enough handle recursive patterns n opening parentheses followed statement followed n closing parentheses unable keep count verify n sides unless finite set permissible values exists n takes full parser recognize patterns full generality parser push parentheses stack try pop see stack empty end see example structure interpretation computer programs book typically tokenization occurs word level however sometimes difficult define meant word often tokenizer relies simple heuristics example languages use inter-word spaces use latin alphabet programming languages approach fairly straightforward however even many edge cases contractions hyphenated words emoticons larger constructs uris purposes may count single tokens classic example new york-based naive tokenizer may break space even though better break arguably hyphen tokenization particularly difficult languages written scriptio continua exhibit word boundaries ancient greek chinese thai agglutinative languages korean also make tokenization tasks complicated ways address difficult problems include developing complex heuristics querying table common special-cases fitting tokens language model identifies collocations later processing step lexers often generated lexer generator analogous parser generators tools often come together established lex paired yacc parser generator free equivalents flex/bison generators form domain-specific language taking lexical specification \u2013 generally regular expressions markup \u2013 emitting lexer tools yield fast development important early development get working lexer language specification may change often often provide advanced features pre- post-conditions hard program hand however automatically generated lexer may lack flexibility thus may require manual modification all-manually written lexer lexer performance concern optimizing worthwhile stable languages lexer run often c html lex/flex-generated lexers reasonably fast improvements two three times possible using tuned generators hand-written lexers sometimes used modern lexer generators produce faster lexers hand-coded ones lex/flex family generators uses table-driven approach much less efficient directly coded approach latter approach generator produces engine directly jumps follow-up states via goto statements tools like re2c proven produce engines two three times faster flex produced engines general difficult hand-write analyzers perform better engines generated latter tools following lexical analysers handle unicode lexical analysis mainly segments input stream characters tokens simply grouping characters pieces categorizing however lexing may significantly complex simply lexers may omit tokens insert added tokens omitting tokens notably whitespace comments common needed compiler less commonly added tokens may inserted done mainly group tokens statements statements blocks simplify parser line continuation feature languages newline normally statement terminator often ending line backslash immediately followed newline results line continued \u2013 following line joined prior line generally done lexer backslash newline discarded rather newline tokenized examples include bash shell scripts python many languages use semicolon statement terminator often mandatory languages semicolon optional many contexts mainly done lexer level lexer outputs semicolon token stream despite one present input character stream termed semicolon insertion automatic semicolon insertion cases semicolons part formal phrase grammar language may found input text inserted lexer optional semicolons terminators separators also sometimes handled parser level notably case trailing commas semicolons semicolon insertion feature bcpl distant descendant go though absent b c. semicolon insertion present javascript though rules somewhat complex much-criticized avoid bugs recommend always using semicolons others use initial semicolons termed defensive semicolons start potentially ambiguous statements semicolon insertion languages semicolon-terminated statements line continuation languages newline-terminated statements seen complementary semicolon insertion adds token even though newlines generally generate tokens line continuation prevents token generated even though newlines generally generate tokens off-side rule blocks determined indenting implemented lexer python increasing indenting results lexer emitting indent token decreasing indenting results lexer emitting dedent token tokens correspond opening brace codice_7 closing brace codice_8 languages use braces blocks means phrase grammar depend whether braces indenting used requires lexer hold state namely current indent level thus detect changes indenting changes thus lexical grammar context-free indent\u2013dedent depend contextual information prior indent level generally lexical grammars context-free almost thus require looking back ahead backtracking allows simple clean efficient implementation also allows simple one-way communication lexer parser without needing information flowing back lexer exceptions however simple examples include semicolon insertion go requires looking back one token concatenation consecutive string literals python requires holding one token buffer emitting see next token another string literal off-side rule python requires maintaining count indent level indeed stack indent level examples require lexical context complicate lexer somewhat invisible parser later phases complex example lexer hack c token class sequence characters determined semantic analysis phase since typedef names variable names lexically identical constitute different token classes thus hack lexer calls semantic analyzer say symbol table checks sequence requires typedef name case information must flow back parser semantic analyzer back lexer complicates design", + "neighbors": [ + 152, + 216, + 236, + 292, + 306, + 447, + 453, + 509, + 567, + 670, + 789, + 843, + 1209, + 1225, + 1227, + 1232, + 1372, + 1388, + 1390, + 1437, + 1477 + ], + "mask": "Validation" + }, + { + "node_id": 800, + "label": 4, + "text": "Vulnerability_(computing):vulnerability computing computer security vulnerability weakness exploited threat actor attacker perform unauthorized actions within computer system exploit vulnerability attacker must least one applicable tool technique connect system weakness frame vulnerability also known attack surface vulnerability management cyclical practice identifying classifying remediating mitigating vulnerabilities practice generally refers software vulnerabilities computing systems security risk often incorrectly classified vulnerability use vulnerability meaning risk lead confusion risk potential significant impact resulting exploit vulnerability vulnerabilities without risk example affected asset value vulnerability one known instances working fully implemented attacks classified exploitable vulnerability\u2014a vulnerability exploit exists window vulnerability time security hole introduced manifested deployed software access removed security fix available/deployed attacker disabled\u2014see zero-day attack security bug security defect narrower concept vulnerabilities related software hardware site personnel vulnerabilities examples vulnerabilities software security bugs constructs programming languages difficult use properly large source vulnerabilities iso 27005 defines vulnerability asset anything value organization business operations continuity including information resources support organization mission ietf rfc 4949 vulnerability committee national security systems united states america defined vulnerability cnss instruction 4009 dated 26 april 2010 national information assurance glossary many nist publications define vulnerability context different publications fismapedia term provide list sp 800-30 give broader one enisa defines vulnerability open group defines vulnerability factor analysis information risk fair defines vulnerability according fair vulnerability related control strength i.e strength control compared standard measure force threat capabilities i.e probable level force threat agent capable applying asset isaca defines vulnerability risk framework data computer security dictionary standards concepts terms authors dennis longley michael shain stockton press defines vulnerability matt bishop dave bailey give following definition computer vulnerability national information assurance training education center defines vulnerability resource either physical logical may one vulnerabilities exploited threat agent threat action result potentially compromise confidentiality integrity availability resources necessarily vulnerable one belonging organization and/or parties involved customers suppliers so-called cia triad basis information security attack active attempts alter system resources affect operation compromising integrity availability passive attack attempts learn make use information system affect system resources compromising confidentiality owasp see figure depicts phenomenon slightly different terms threat agent attack vector exploits weakness vulnerability system related security controls causing technical impact resource asset connected business impact overall picture represents risk factors risk scenario set policies concerned information security management information security management system isms developed manage according risk management principles countermeasures order ensure security strategy set following rules regulations applicable country countermeasures also called security controls applied transmission information called security services vulnerabilities classified according asset class related research shown vulnerable point information systems human user operator designer human humans considered different roles asset threat information resources social engineering increasing security concern impact security breach high fact managers upper management easily know systems applications vulnerabilities perform action manage risk seen misconduct legislations privacy law forces managers act reduce impact likelihood security risk information technology security audit way let independent people certify environment managed properly lessen responsibilities least demonstrated good faith penetration test form verification weakness countermeasures adopted organization white hat hacker tries attack organization information technology assets find easy difficult compromise security proper way professionally manage risk adopt information security management system iso/iec 27002 risk follow according security strategy set forth upper management one key concept information security principle defence depth i.e set multilayer defence system intrusion detection system example class systems used detect attacks physical security set measures protect physically information asset somebody get physical access information asset quite easy make resources unavailable legitimate users sets criteria satisfied computer operating system applications order meet good security level developed itsec common criteria two examples responsible disclosure many refer 'coordinated disclosure first biased word vulnerabilities topic great debate reported tech herald august 2010 google microsoft tippingpoint rapid7 recently issued guidelines statements addressing deal disclosure going forward responsible disclosure first alerts affected vendors confidentially alerting cert two weeks later grants vendors another 45-day grace period publishing security advisory full disclosure done details vulnerability publicized perhaps intent put pressure software procedure authors find fix urgently well respected authors published books vulnerabilities exploit good example security researchers catering needs cyberwarfare cybercrime industry stated approach provide adequate income efforts instead offer exploits privately enable zero day attacks never ending effort find new vulnerabilities fix called computer insecurity january 2014 google revealed microsoft vulnerability microsoft released patch fix microsoft representative called coordinated practices among software companies revealing disclosures mitre corporation maintains list disclosed vulnerabilities system called common vulnerabilities exposures vulnerability classified scored using common vulnerability scoring system cvss owasp collects list potential vulnerabilities aim educating system designers programmers therefore reducing likelihood vulnerabilities written unintentionally software time disclosure vulnerability defined differently security community industry commonly referred kind public disclosure security information certain party usually vulnerability information discussed mailing list published security web site results security advisory afterward time disclosure first date security vulnerability described channel disclosed information vulnerability fulfill following requirement many software tools exist aid discovery sometimes removal vulnerabilities computer system though tools provide auditor good overview possible vulnerabilities present replace human judgment relying solely scanners yield false positives limited-scope view problems present system vulnerabilities found every major operating system including windows macos various forms unix linux openvms others way reduce chance vulnerability used system constant vigilance including careful system maintenance e.g applying software patches best practices deployment e.g use firewalls access controls auditing development throughout deployment lifecycle vulnerabilities related evident pure technical approach even protect physical assets one administrative procedure let maintenance personnel enter facilities people adequate knowledge procedures motivated follow proper care see social engineering security four examples vulnerability exploits common types software flaws lead vulnerabilities include set coding guidelines developed large number static code analysers used verify code follows guidelines", + "neighbors": [ + 11, + 14, + 91, + 103, + 134, + 141, + 144, + 149, + 158, + 225, + 232, + 233, + 261, + 281, + 293, + 310, + 325, + 338, + 343, + 364, + 376, + 379, + 384, + 414, + 439, + 479, + 518, + 528, + 531, + 533, + 540, + 550, + 576, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 633, + 638, + 650, + 655, + 665, + 675, + 698, + 701, + 703, + 708, + 739, + 740, + 747, + 750, + 759, + 762, + 769, + 783, + 818, + 844, + 898, + 915, + 961, + 1003, + 1015, + 1026, + 1039, + 1063, + 1090, + 1112, + 1129, + 1137, + 1138, + 1174, + 1181, + 1186, + 1256, + 1270, + 1293, + 1303, + 1325, + 1327, + 1332, + 1336, + 1342, + 1355, + 1361, + 1368, + 1379, + 1393, + 1436, + 1467, + 1472, + 1475, + 1542, + 1543, + 1570, + 1573, + 1576, + 1585, + 1623, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 801, + "label": 2, + "text": "Microsoft_Mahjong:microsoft mahjong microsoft mahjong formerly mahjong titans taipei computer game version mahjong solitaire published microsoft version titled mahjong titans developed oberon games included windows vista windows 7 except starter home basic editions takes advantage new graphical user interface gui windows vista includes features tile set background choices windows vista builds 5219 5231 5259 game known shanghai solitaire game make windows 8 however standalone version developed arkadium published microsoft studios downloaded windows store free charge older version game known taipei bundled microsoft entertainment pack 1 best microsoft entertainment pack version included 32767 possible configurations player choice six tile layouts cat turtle crab dragon fortress spider stylized portrayal respective object animal background image chosen five different options four tile sets including traditional mahjong tiles variations fuller coloring larger print alternative pastel tile set entirely different picture theme games entirely random always least one pair within five tiles topmost five tiles turtle layout often two pairs algorithm tile organization positions tiles mostly paired level otherwise matching tile available accessible position one level check ensure matching tile positioned beneath partner since every tile 3 partners enough prove game impossible solve newer version microsoft mahjong numerous layouts improved graphics sound internet features set daily challenges reward user badges completed xbox live integration", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 802, + "label": 7, + "text": "P-GRADE_Portal:p-grade portal p-grade grid portal software web portals manage life-cycle executing parallel application grid computing developed laboratory parallel distributed systems lpds hungarian academy sciences hungary building onto gridsphere portal framework p-grade portal hides details grid systems high-level interfaces integrated middleware offers portlet based access following services p-grade portal allows multi-user development execution workflows also provides support workflow level grid interoperation portal supports various middleware technologies including globus toolkit egee lcg glite advanced resource connector p-grade portal developed gnu general public license online tutorials videos documents available p-grade portal site release p-grade grid portal version 2.10 2.9 version introduced features portable batch system pbs platform lsf cluster support edges 3g bridge resource support local ps port support extended nordugrid arc support p-grade portal served grid communities research industry providing access grids including application specific portals created adding application specific portlets p-grade portal omitting generic purpose portlets hiding underlying workflow within application specific portlet applications include grid application support centre gasuc established 2008 within laboratory parallel distributed systems supported part european grid infrastructure gasuc provides assistance porting legacy applications onto grid infrastructures", + "neighbors": [ + 25, + 796, + 847, + 1138, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 803, + "label": 3, + "text": "Minimal_instruction_set_computer:minimal instruction set computer minimal instruction set computer misc processor architecture small number basic operations corresponding opcodes instruction sets commonly stack-based rather register-based reduce size operand specifiers stack machine architecture inherently simpler since instructions operate top-most stack entries result stack architecture overall smaller instruction set smaller faster instruction decode unit overall faster operation individual instructions separate stack definition misc architecture misc architecture defined respect number instructions supported also instruction pipelines misc rule tend simple instruction pipelines branch prediction out-of-order execution register renaming speculative execution broadly exclude cpu classified misc architecture system first digital computers implemented instruction sets modern definition minimal instruction set computers among various computers illiac ordvac compatible instruction sets early stored-program computers disadvantage misc instructions tend sequential dependencies reducing overall instruction-level parallelism misc architectures much common forth programming language java virtual machine weak providing full instruction-level parallelism probably commercially successful misc original inmos transputer architecture floating-point unit however many eight-bit microcontrollers embedded computer applications fit category stereo spacecraft includes two p24 misc cpus two cpu24 misc cpus", + "neighbors": [ + 51, + 53, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 821, + 846, + 907, + 937, + 946, + 979, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 804, + "label": 3, + "text": "Transaction_processing:transaction processing transaction processing information processing computer science divided individual indivisible operations called transactions transaction must succeed fail complete unit never partially complete example purchase book online bookstore exchange money form credit book credit good series related operations ensures get book bookstore gets money however single operation series fails exchange entire exchange fails get book bookstore get money technology responsible making exchange balanced predictable called transaction processing transactions ensure data-oriented resources permanently updated unless operations within transactional unit complete successfully combining set related operations unit either completely succeeds completely fails one simplify error recovery make one application reliable transaction processing systems consist computer hardware software hosting transaction-oriented application performs routine transactions necessary conduct business examples include systems manage sales order entry airline reservations payroll employee records manufacturing shipping since though necessarily transaction processing today interactive term often treated synonymous online transaction processing transaction processing designed maintain system integrity typically database modern filesystems known consistent state ensuring interdependent operations system either completed successfully canceled successfully example consider typical banking transaction involves moving 700 customer savings account customer checking account transaction involves least two separate operations computer terms debiting savings account 700 crediting checking account 700 one operation succeeds books bank balance end day must therefore way ensure either operations succeed fail never inconsistency bank database whole transaction processing links multiple individual operations single indivisible transaction ensures either operations transaction completed without error none operations completed errors occur others attempted transaction-processing system rolls back operations transaction including successful ones thereby erasing traces transaction restoring system consistent known state processing transaction began operations transaction completed successfully transaction committed system changes database made permanent transaction rolled back done transaction processing guards hardware software errors might leave transaction partially completed computer system crashes middle transaction transaction processing system guarantees operations uncommitted transactions cancelled generally transactions issued concurrently overlap i.e need touch portion database create conflicts example customer mentioned example 150 savings account attempts transfer 100 different person time moving 100 checking account one succeed however forcing transactions processed sequentially inefficient therefore concurrent implementations transaction processing programmed guarantee end result reflects conflict-free outcome could reached executing transactions sequentially order property called serializability example means matter transaction issued first either transfer different person move checking account succeeds one fails basic principles transaction-processing systems however terminology may vary one transaction-processing system another terms used necessarily universal transaction-processing systems ensure database integrity recording intermediate states database modified using records restore database known state transaction committed example copies information database prior modification transaction set aside system transaction make modifications sometimes called image part transaction fails committed copies used restore database state transaction began also possible keep separate journal modifications database management system sometimes called images required rollback failed transactions useful updating database management system event database failure transaction-processing systems provide database management system fails entirely must restored recent back-up back-up reflect transactions committed since back-up made however database management system restored journal images applied database rollforward bring database management system date transactions progress time failure rolled back result database consistent known state includes results transactions committed moment failure cases two transactions may course processing attempt access portion database time way prevents proceeding example transaction may access portion x database transaction b may access portion database point transaction tries access portion database transaction b tries access portion x deadlock occurs neither transaction move forward transaction-processing systems designed detect deadlocks occur typically transactions cancelled rolled back started different order automatically deadlock n't occur sometimes one deadlocked transactions cancelled rolled back automatically restarted short delay deadlocks also occur among three transactions transactions involved difficult detect point transaction processing systems find practical limit deadlocks detect systems commit rollback mechanisms available undesirable compensating transaction often used undo failed transactions restore system previous state jim gray defined properties reliable transaction system late 1970s acronym acid \u2014 atomicity consistency isolation durability transaction changes state atomic either happen none happen changes include database changes messages actions transducers consistency transaction correct transformation state actions taken group violate integrity constraints associated state even though transactions execute concurrently appears transaction others executed either transaction completes successfully commits changes database survive failures retain changes transaction processing benefits standard transaction-processing software ibm information management system first developed 1960s often closely coupled particular database management systems client\u2013server computing implemented similar principles 1980s mixed success however recent years distributed client\u2013server model become considerably difficult maintain number transactions grew response various online services especially web single distributed database practical solution addition online systems consist whole suite programs operating together opposed strict client\u2013server model single server could handle transaction processing today number transaction processing systems available work inter-program level scale large systems including mainframes one effort x/open distributed transaction processing dtp see also java transaction api jta however proprietary transaction-processing environments ibm cics still popular although cics evolved include open industry standards well term extreme transaction processing xtp used describe transaction processing systems uncommonly challenging requirements particularly throughput requirements transactions per second systems may implemented via distributed cluster style architectures used least 2011", + "neighbors": [ + 123, + 154, + 270, + 330, + 347, + 429, + 457, + 572, + 587, + 611, + 796, + 903, + 925, + 1159, + 1217, + 1322 + ], + "mask": "Test" + }, + { + "node_id": 805, + "label": 9, + "text": "Free_Pascal:free pascal free pascal compiler fpc compiler closely related programming-language dialects pascal object pascal free software released gnu general public license exception clauses allow static linking runtime libraries packages purpose combination software license supports object pascal dialect well dialects several pascal family compilers certain extent including turbo pascal delphi historical macintosh compilers dialect selected per-unit module basis one dialect used per program follows write compile anywhere philosophy available many cpu architectures operating systems see targets supports inline assembly language includes internal assembler capable parsing several dialects intel style separate projects exist facilitate developing cross-platform graphical user interface gui applications prominent one lazarus integrated development environment ide initially free pascal adopted de facto standard dialect pascal programmers borland pascal later adopted delphi version 2.0 delphi compatibility continuously implemented improved project compilation mode concept developers made clear would incorporate working patches standardized dialects american national standards institute ansi international organization standardization iso create standards-compliant mode small effort made support apple pascal syntax ease interfacing classic mac os macos since apple dialect implements standard pascal features turbo pascal delphi omit free pascal bit iso-compatible 2.2 x release series significantly change dialect objectives beyond roughly delphi 7 level syntax instead aiming closer compatibility notable exception addition support generics free pascal version 2.2.0 several years supported capacity delphi several delphi 2006-specific features added development branch starting work features new delphi 2009 notably addition codice_1 type completed development branch also features objective-pascal extension objective-c cocoa interfacing version 2.7.1 free pascal implemented basic iso pascal mode though many things codice_2 codice_3 procedure file-buffer variable concept file handling still absent version 3.0.0 iso pascal mode fairly complete one remaining bug since fixed trunk branch able compile standardpascal.org p5 iso pascal compiler changes free pascal created borland clarified borland pascal development dos would stop version 7 replaced windows-only product later became delphi student florian paul kl\u00e4mpfl began developing compiler written turbo pascal dialect produced 32-bit code go32v1 dos extender used developed dj gnu programming platform djgpp project time originally compiler 16-bit dos executable compiled turbo pascal two years compiler able compile became 32-bit executable initial 32-bit compiler published internet first contributors joined project later linux port created michael van canneyt five years borland kylix compiler became available dos port adapted use os/2 using eberhard mattes extender emx made os/2 second supported compiling target well florian kl\u00e4mpfl original author dani\u00ebl mantione also contributed significantly make happen providing original port run-time library os/2 emx compiler improved gradually dos version migrated go32v2 extender culminated release 0.99.5 much widely used prior versions last release aiming turbo pascal compliance later releases added delphi compatibility mode release also ported systems using motorola 68000 family m68k processors release 0.99.8 win32 target added start made incorporating delphi features stabilizing non-beta release began version 1.0 released july 2000 1.0 x series widely used business education 1.0 x releases port 68k cpu redone compiler produced stable code several 68k unix-like amigaos operating systems stabilization would become 1.0 x also porting motorola 68k systems clear design code generator far limited many aspects principal problems adding processors meant rewriting code generator register allocation based principle always keeping three free registers building blocks inflexible difficult maintain reasons 1.1 x series branched 1.0 x main branch december 1999 first changes mostly clean-ups rewrite-redesigns parts compiler code generator register allocator also rewritten remaining missing delphi compatibility added work 1.1.x continued slowly steadily late 2003 working powerpc port became available followed arm port summer 2004 sparc port fall 2004 x86-64-amd64 port early 2004 made compiler available 64-bit platform november 2003 first beta release 1.1 x branch packaged numbered 1.9.0 quickly followed versions 1.9.2 1.9.4 latter introduced os x support work continued version 1.9.6 january 2005 1.9.8 late february 2005 2.0.0 may 2005 2.0.2 december 2005 2.0.4 august 2006 2006 major reworks planned 2.2 rewrite unit system still begun decided instead start stabilizing already implemented features motives roadmap change needs lazarus integrated development environment project particularly internal linker support win64 windows ce os x x86 related features like dwarf betas 2.1.2 2.1.4 version 2.2.0 released september 2007 followed version 2.2.2 august 2008 version 2.2.4 march 2009 2.2 x series vastly improved support activex component object model com interface object linking embedding ole though bugs still found delegation interface using codice_4 keyword partly implemented complete library support activex also improved another major feature internal linker win32 win64 windows ce greatly improve\u010f linking time memory use make compile-link-run cycle lazarus much faster efficiency smart-linking dead code elimination also improved minor new features included improved dwarf 2/3 debug format support optimizations tail recursion omission unneeded stack frames register-based common subexpression elimination cse optimization first implementation generic programming generics support also became available experimentally 2.4.x release series less clear set goals earlier releases unit system rewrite postponed branch became 2.4 created keep risky commits 2.2 stabilize mostly risky commits involved improvements new platforms mac powerpc 64 mac x86-64 iphone many fixes arm x86-64 architectures general well dwarf compiler improvements included whole program optimization wpo devirtualization arm embedded-application binary interface eabi support later 2.2 cycle delphi-like resource support based special sections binary instead pascal constants added feature direly needed lazarus became main highlight branch minor additions memory manager improved heap manager performance threaded environments small improvements delphi compatibility codice_5 improvements interface delegation january 1 2010 free pascal 2.4.0 released followed november 13 2010 bug fix release 2.4.2 support codice_6 loops codice_7 codice_8 classes changes january 2012 free pascal 2.6 released first version 2.6 release series also supported objective pascal os x ios targets implemented many small improvements bug fixes february 2013 fpc 2.6.2 released contained netbsd openbsd releases first time since 1.0.10 based fresh ports march 2014 last point release 2.6 series 2.6.4 launched featuring mostly database fcl-db updates. br version 3.0.0 released november 25 2015 first major release since january 1 2012 contains many new language features fpc new features 3.0 version 3.0.2 released february 15 2017 includes bug fixes minor compiler updates. br version 3.0.4 released november 28 2017. br includes many language improvements previous versions like internal linker executable linkable format elf arm aarch64 ios linux revived i8086 platform extended libraries much free pascal also supports byte code generation java virtual machine version 3.0.0 targets oracle java google android jvm although object pascal syntax fully supported free pascal 3.0.0 also supports armhf platforms like raspberry pi including armv6-eabihf running raspbian mips work 64-bit arm resulted support ios 3.0.0 well native arm android target added ending formerly hacked arm linux target generate native arm libraries android makes porting lazarus applications android using custom drawn interface easier since fpc 2.6.2 openbsd netbsd supported ia32 x86_64 architectures new target embedded added usage without os arm cortex mips mainly instantfpc possible run pascal programs translated time unix scripts cgi back-end like modern compilers free pascal used integrated development environment ide besides independent ides also plugins various existing ides apart compiler ide free pascal provides following libraries", + "neighbors": [ + 65, + 78, + 85, + 99, + 134, + 137, + 210, + 292, + 306, + 331, + 509, + 782, + 796, + 815, + 872, + 961, + 1016, + 1037, + 1138, + 1152, + 1189, + 1221, + 1278, + 1318, + 1417, + 1483, + 1538, + 1558, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 806, + "label": 9, + "text": "GNU_Octave:gnu octave gnu octave software featuring high-level programming language primarily intended numerical computations octave helps solving linear nonlinear problems numerically performing numerical experiments using language mostly compatible matlab may also used batch-oriented language since part gnu project free software terms gnu general public license octave one major free alternatives matlab others scilab freemat scilab however puts less emphasis bidirectional syntactic compatibility matlab octave project conceived around 1988 first intended companion chemical reactor design course real development started john w. eaton 1992 first alpha release dates back january 4 1993 february 17 1994 version 1.0 released version 4.0.0 released may 29 2015 program named octave levenspiel former professor principal author levenspiel known ability perform quick back-of-the-envelope calculations addition use desktops personal scientific computing octave used academia industry example octave used massive parallel computer pittsburgh supercomputing center find vulnerabilities related guessing social security numbers dramatic acceleration opencl cuda also possible use gpus octave language interpreted programming language structured programming language similar c supports many common c standard library functions also certain unix system calls functions however support passing arguments reference octave programs consist list function calls script syntax matrix-based provides various functions matrix operations supports various data structures allows object-oriented programming syntax similar matlab careful programming script allow run octave matlab octave made available gnu general public license may freely changed copied used program runs microsoft windows unix unix-like operating systems including macos typing tab character command line causes octave attempt complete variable function file names similar bash tab completion octave uses text cursor initial portion name complete running interactively octave saves commands typed internal buffer recalled edited octave includes limited amount support organizing data structures example see structure x elements b c integer array string respectively octave 'codice_1 'codice_2 logical operators evaluated short-circuit fashion like corresponding operators c language contrast element-by-element operators 'codice_3 'codice_4 octave includes c-like increment decrement operators 'codice_5 'codice_6 prefix postfix forms octave also augmented assignment e.g 'codice_7 octave supports limited form exception handling modelled 'codice_8 lisp general form unwind_protect block looks like general rule gnu octave recognizes termination given 'codice_9 either keyword 'codice_10 compatible matlab language specific keyword 'codice_11 consequence 'codice_8 block terminated either keyword 'codice_13 example portable keyword 'codice_10 cleanup part block always executed case exception raised body part cleanup executed immediately propagating exception outside block 'codice_8 gnu octave also supports another form exception handling compatible matlab language latter form differs 'codice_8 block two ways first exception_handling executed exception raised body second execution exception_handling exception propagated outside block unless 'codice_17 statement explicitly inserted within exception_handling code octave mechanism handling functions take unspecified number arguments without explicit upper limit specify list zero arguments use special argument codice_18 last argument list function set return number values using special return value codice_19 example also possible execute octave code directly c++ program example code snippet calling codice_20 c c++ code integrated gnu octave creating oct files using matlab compatible mex files octave built matlab compatibility mind shares many features matlab octave treats incompatibility matlab bug therefore could considered software clone infringe software copyright per lotus v. borland court case matlab scripts mathworks fileexchange repository principle compatible octave however often provided uploaded users octave compatible proper open source bsd license fileexchange terms use prohibit usage beside mathworks proprietary matlab purposeful albeit minor syntax additions many numerous matlab functions available gnu octave accessible packages octave forge functions available part either core octave forge packages listed online list unavailable functions included octave function __unimplemented.m__ unimplemented functions also listed many octave forge packages octave wiki unimplemented function called following error message shown octave comes official graphical user interface gui integrated development environment ide based qt available since octave 3.8 become default interface command line interface release octave 4.0 well-received edn contributor said octave workable gui several 3rd-party graphical front-ends also developed like toolbox coding education octave code user create gui applications examples button edit control checkboxtextboxlistbox message boxes.radiobuttons octave also packages available free packages located octave-forge available packages", + "neighbors": [ + 134, + 209, + 246, + 301, + 306, + 323, + 579, + 592, + 690, + 756, + 766, + 790, + 796, + 816, + 824, + 825, + 919, + 948, + 961, + 985, + 1006, + 1028, + 1059, + 1123, + 1138, + 1180, + 1190, + 1278, + 1318, + 1319, + 1372, + 1385, + 1413, + 1509, + 1538, + 1558 + ], + "mask": "Test" + }, + { + "node_id": 807, + "label": 3, + "text": "Murder_on_the_Mississippi:murder mississippi murder mississippi fully titled murder mississippi adventures sir charles foxworth 1986 detective adventure game developed published activision commodore 64 commodore 128 apple ii computers also licensed release exclusively japan jaleco ported game nintendo famicom msx2 adventure game player must solve murder mystery luxury ship delta princess heading new orleans st. louis ship delta princess detective sir charles watson caught midst murder case chance must solve holmes becomes second victim appearance similar painting sherlock holmes charles doyle arthur conan doyle father known regis activision version memos taken occasionally takes walks without notice charles death longs everything right way prostitute staying room 8 going new orleans visit aunt pearl aunt secret formula okra soup popular among passengers prostitute nevada staying room 2f20 judge staying room 9 reputation drinking widow millionaire staying room 2f23 bad reputation amongst passengers captain speaks incident even entering cabin discovering body philanthropist staying room 2f15 hobby shooting often hits birds crew member staying room 1f27 brown illegitimate son love taylor victim found dead room 4 owner delta princess co-manages nelson also managed many additional businesses sir charles staying room 3 normal assumption start investigation room 1- however pitfalls exist room 1 room 14 falling one holes results death instant game also trap room 16 knife flies air towards sir charles immediately enters unless knife dodged hits sir charles head kills resulting another instant game solving case reveals true criminal identity person set traps remains mystery since watson fall pitfall traps players suspect might one set suspect spoken per piece new information\u2014 consequently piece information missed first time around since impossible talk lead player becoming impossibly stuck game unable progress bears sense reality angered many players also bad ending game final stage game player must present evidence reveal prosecute true criminal however insufficient evidence examined/obtained player simply receive game due lack evidence compute called murder mississippi rich enjoyable adventure game", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 808, + "label": 5, + "text": "Physical_Layer_Convergence_Protocol:physical layer convergence protocol physical layer convergence protocol physical layer protocol several data transmission networks used 802.11 standard", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 809, + "label": 6, + "text": "Coherent_file_distribution_protocol:coherent file distribution protocol coherent file distribution protocol cfdp ietf-documented experimental protocol intended high-speed one-to-many file transfers class 1 assured delivery class 2 blind unassured delivery see rfc 1235", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 810, + "label": 9, + "text": "Integer_BASIC:integer basic integer basic written steve wozniak basic interpreter apple original apple ii computers originally available cassette included rom original apple ii computer release 1977 first version basic used many early home computer owners language supported mathematics using integers lacking floating point support using integers allowed numbers stored much compact 16-bit format could rapidly read processed 6- 9-byte floating point formats found basics era however limited applicability general purpose language integer basic phased favor applesoft basic starting apple ii plus 1979 licensed modified version microsoft basic included floating point support missing integer basic steve wozniak first used basic computer language late 1960s time-sharing computer terminal california high school read 101 basic computer games member homebrew computer club 1970s decided computer designed would able play games book run logic simulations worked hewlett-packard hp wozniak knew bill gates written altair basic intel 8080 microprocessor hoped would first write one mos technology 6502 wozniak would later describe language intended primarily games educational uses experience basic days time-sharing system high school without access system wozniak write language\u2014which called game basic \u2014on paper hand assembling language 6502 machine code without training write computer language used hp experience implement stack machine interpret expressions wozniak previously studied hp basic manual borrowed work knowing syntax hp version language different dec basic language 101 basic computer games altair basic save time games logic simulations emphasized integer math wozniak removed floating-point routines game basic interpreter would implement 16-bit integer calculations wozniak previously developed breakout atari hardware hoped implement game basic designing apple ii computer wozniak added support color graphics game paddles sound language named integer basic language needed 4k ram made minimum memory apple ii demonstrating computer brick steve jobs wozniak demonstrated could quickly change colors game used altering source code woz later wrote proved software much flexible hardware jobs realized anyone could create arcade games without design hardware wozniak demonstrated brick meeting homebrew computer club later described satisfying day life ... seemed like huge step designing hardware arcade games knew able program basic going change world integer basic roms also included machine code monitor mini-assembler disassembler create debug assembly language programs interpreter 16-bit bytecode language called sweet16 wozniak hand assembled monitor apple ii first program used write integer basic", + "neighbors": [ + 0, + 8, + 33, + 78, + 99, + 236, + 273, + 345, + 477, + 510, + 551, + 596, + 606, + 625, + 670, + 696, + 755, + 812, + 843, + 917, + 927, + 945, + 1034, + 1037, + 1044, + 1050, + 1079, + 1100, + 1156, + 1204, + 1292, + 1306, + 1372, + 1373, + 1388, + 1390, + 1409, + 1496, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 811, + "label": 3, + "text": "Xevious:_Fardraut_Saga:xevious fardraut saga msx2 version players select two modes title screen recon port original xevious scramble new 16-area game new enemies new boss battles well andor genesis four ships solvalou solgrado zeodalley gampmission two modes renamed arcade fardraut pc engine version however fardraut bit different original scramble 4-stage game new enemies different ship level end level boss battle similar andor genesis end level level players given dialogue story given game", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 812, + "label": 9, + "text": "Basic_For_Qt:basic qt basic qt successor kbasic object-oriented framework related vb.net visual basic well integrated development environment designed run multiple platforms pre-compiled binaries available mac windows gnu/linux distributions source code also available", + "neighbors": [ + 0, + 8, + 134, + 236, + 273, + 306, + 510, + 606, + 670, + 810, + 843, + 872, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1278, + 1306, + 1318, + 1390, + 1538, + 1558, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 813, + "label": 4, + "text": "Virtual_private_network:virtual private network virtual private network vpn extends private network across public network enables users send receive data across shared public networks computing devices directly connected private network applications running computing device e.g laptop desktop smartphone across vpn may therefore benefit functionality security management private network encryption common though inherent part vpn connection vpn technology developed allow remote users branch offices access corporate applications resources ensure security private network connection established using encrypted layered tunneling protocol vpn users use authentication methods including passwords certificates gain access vpn applications internet users may secure connections vpn circumvent geo-restrictions censorship connect proxy servers protect personal identity location stay anonymous internet however websites block access known vpn technology prevent circumvention geo-restrictions many vpn providers developing strategies get around roadblocks vpn created establishing virtual point-to-point connection use dedicated circuits tunneling protocols existing networks vpn available public internet provide benefits wide area network wan user perspective resources available within private network accessed remotely early data networks allowed vpn-style connections remote sites dial-up modem leased line connections utilizing x.25 frame relay asynchronous transfer mode atm virtual circuits provided networks owned operated telecommunication carriers networks considered true vpns passively secure data transmitted creation logical data streams replaced vpns based ip ip/multi-protocol label switching mpls networks due significant cost-reductions increased bandwidth provided new technologies digital subscriber line dsl fiber-optic networks vpns characterized host-to-network remote access connecting single computer network site-to-site connecting two networks corporate setting remote-access vpns allow employees access company intranet outside office site-to-site vpns allow collaborators geographically disparate offices share virtual network vpn also used interconnect two similar networks dissimilar intermediate network example two ipv6 networks ipv4 network vpn systems may classified vpns make online connections completely anonymous usually increase privacy security prevent disclosure private information vpns typically allow authenticated remote access using tunneling protocols encryption techniques vpn security model provides secure vpn protocols include following tunnel endpoints must authenticated secure vpn tunnels established user-created remote-access vpns may use passwords biometrics two-factor authentication cryptographic methods network-to-network tunnels often use passwords digital certificates permanently store key allow tunnel establish automatically without intervention administrator tunneling protocols operate point-to-point network topology would theoretically considered vpn vpn definition expected support arbitrary changing sets network nodes since router implementations support software-defined tunnel interface customer-provisioned vpns often simply defined tunnels running conventional routing protocols depending whether provider-provisioned vpn ppvpn operates layer 2 layer 3 building blocks described may l2 l3 combine multi-protocol label switching mpls functionality blurs l2-l3 identity device within customer network directly connected service provider network c devices aware vpn device edge customer network provides access ppvpn sometimes demarcation point provider customer responsibility providers allow customers configure pe device set devices edge provider network connects customer networks ce devices presents provider view customer site pes aware vpns connect maintain vpn state p device operates inside provider core network directly interface customer endpoint might example provide routing many provider-operated tunnels belong different customers ppvpns p device key part implementing ppvpns vpn-aware maintain vpn state principal role allowing service provider scale ppvpn offerings example acting aggregation point multiple pes p-to-p connections role often high-capacity optical links major locations providers virtual lan vlan layer 2 technique allow coexistence multiple local area network lan broadcast domains interconnected via trunks using ieee 802.1q trunking protocol trunking protocols used become obsolete including inter-switch link isl ieee 802.10 originally security protocol subset introduced trunking atm lan emulation lane developed institute electrical electronics engineers virtual lans vlans allow multiple tagged lans share common trunking vlans frequently comprise customer-owned facilities whereas vpls described section osi layer 1 services supports emulation point-to-point point-to-multipoint topologies method discussed extends layer 2 technologies 802.1d 802.1q lan trunking run transports metro ethernet used context vpls layer 2 ppvpn emulating full functionality traditional lan user standpoint vpls makes possible interconnect several lan segments packet-switched optical provider core core transparent user making remote lan segments behave one single lan vpls provider network emulates learning bridge optionally may include vlan service pw similar vpls provide different l2 protocols ends typically interface wan protocol asynchronous transfer mode frame relay contrast aiming provide appearance lan contiguous two locations virtual private lan service ipls would appropriate etherip ethernet ip tunneling protocol specification etherip packet encapsulation mechanism confidentiality message integrity protection etherip introduced freebsd network stack softether vpn server program subset vpls ce devices must layer 3 capabilities ipls presents packets rather frames may support ipv4 ipv6 section discusses main architectures ppvpns one pe disambiguates duplicate addresses single routing instance virtual router pe contains virtual router instance per vpn former approach variants gained attention one challenges ppvpns involves different customers using address space especially ipv4 private address space provider must able disambiguate overlapping addresses multiple customers ppvpns method defined bgp extensions advertise routes ipv4 vpn address family form 12-byte strings beginning 8-byte route distinguisher rd ending 4-byte ipv4 address rds disambiguate otherwise duplicate addresses pe pes understand topology vpn interconnected mpls tunnels either directly via p routers mpls terminology p routers label switch routers without awareness vpns virtual router architecture opposed bgp/mpls techniques requires modification existing routing protocols bgp provisioning logically independent routing domains customer operating vpn completely responsible address space various mpls tunnels different ppvpns disambiguated label need routing distinguishers virtual networks use tunneling protocols without encryption protecting privacy data vpns often provide security unencrypted overlay network neatly fit within secure trusted categorization example tunnel set two hosts generic routing encapsulation gre virtual private network neither secure trusted native plaintext tunneling protocols include layer 2 tunneling protocol l2tp set without ipsec point-to-point tunneling protocol pptp microsoft point-to-point encryption mppe trusted vpns use cryptographic tunneling instead rely security single provider network protect traffic security standpoint vpns either trust underlying delivery network must enforce security mechanisms vpn unless trusted delivery network runs among physically secure sites trusted secure models need authentication mechanism users gain access vpn users utilize mobile virtual private networks settings endpoint vpn fixed single ip address instead roams across various networks data networks cellular carriers multiple wi-fi access points without dropping secure vpn session losing application sessions mobile vpns widely used public safety give law-enforcement officers access applications computer-assisted dispatch criminal databases organizations similar requirements field service management healthcare increasing use vpns many started deploying vpn connectivity routers additional security encryption data transmission using various cryptographic techniques home users usually deploy vpns routers protect devices smart tvs gaming consoles supported native vpn clients supported devices restricted capable running vpn client many router manufacturers supply routers built-in vpn clients use open-source firmware dd-wrt openwrt tomato order support additional protocols openvpn setting vpn services router requires deep knowledge network security careful installation minor misconfiguration vpn connections leave network vulnerable performance vary depending internet service provider isp limitation traditional vpns point-to-point connections tend support broadcast domains therefore communication software networking based layer 2 broadcast packets netbios used windows networking may fully supported local area network variants vpn virtual private lan service vpls layer 2 tunneling protocols designed overcome limitation users must consider transmitted content encrypted entering vpn data visible receiving endpoint usually public vpn provider site regardless whether vpn tunnel wrapper encrypted inter-node transport secure vpn participants oversight ends entire data path content encrypted enters tunnel provider unapproved vpns reportedly illegal china used circumvent great firewall enforcement however might comprehensive", + "neighbors": [ + 35, + 52, + 111, + 148, + 232, + 252, + 295, + 333, + 415, + 483, + 502, + 505, + 526, + 528, + 542, + 545, + 552, + 569, + 576, + 611, + 613, + 646, + 678, + 762, + 769, + 779, + 837, + 922, + 1003, + 1114, + 1121, + 1144, + 1206, + 1228, + 1292, + 1309, + 1321, + 1337, + 1339, + 1377, + 1386, + 1452, + 1459, + 1462, + 1552, + 1568, + 1582, + 1586, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 814, + "label": 7, + "text": "Microsoft_Dynamics_365_for_Finance_and_Operations:microsoft dynamics 365 finance operations microsoft dynamics 365 finance operations enterprise edition microsoft enterprise resource planning erp system medium large organisations software part dynamics 365 product line first general release november 2016 initially branded dynamics 365 operations july 2017 rebranded dynamics 365 finance operations time microsoft rebranded business software suite small businesses business edition financials finance operations business edition however two applications based completely different platforms dynamics 365 finance operations available part unified operations plan also includes dynamics 365 talent dynamics 365 retail microsoft powerapps three options deployment", + "neighbors": [ + 611 + ], + "mask": "Test" + }, + { + "node_id": 815, + "label": 2, + "text": "Windows_API:windows api windows api informally winapi microsoft core set application programming interfaces apis available microsoft windows operating systems name windows api collectively refers several different platform implementations often referred names example win32 api see versions section almost windows programs interact windows api windows nt line operating systems small number programs started early windows startup process use native api developer support available form software development kit microsoft windows sdk providing documentation tools needed build software based windows api associated windows interfaces windows api win32 focused mainly programming language c exposed functions data structures described language recent versions documentation however api may used programming language compiler assembler able handle well-defined low-level data structures along prescribed calling conventions calls callbacks similarly internal implementation api function developed several languages historically despite fact c object-oriented programming language windows api windows historically described object-oriented also many wrapper classes extensions microsoft others object-oriented languages make object-oriented structure explicit microsoft foundation class library mfc visual component library vcl gdi+ etc. instance windows 8 provides windows api winrt api implemented c++ object-oriented design functions provided windows api grouped eight categories internet explorer ie web browser also exposes many apis often used applications could considered part windows api ie included operating system since windows 95 osr2 provided web-related services applications since windows 98 specifically used provide classic windows multimedia api placed winmm.dll contains functions play sound files send receive midi messages access joysticks facilitate features so-called mci subsystem windows originates multimedia extensions available windows 3.0 separately integral part operating system since windows 3.1 time located mmsystem.dll apart part every windows version since windows 95 osr2 microsoft provided directx apis\u2014a loosely related set graphics gaming services includes microsoft also provides several apis media encoding playback windows api designed mostly interaction operating system application communication among different windows applications microsoft developed series technologies alongside main windows api started dynamic data exchange dde superseded object linking embedding ole later component object model com automation objects activex controls .net framework always clear distinction technologies much overlap variety terms basically result grouping software mechanisms relate given aspect software development automation specifically relates exporting function application component application programming interface api controlled applications instead human users .net self-contained general methodology technology develop desktop web applications written variety just-in-time jit compiled languages windows.pas pascal/delphi unit contains windows-specific api declarations pascal equivalent windows.h used c. various wrappers developed microsoft took low level functions windows api allowed applications interact api abstract manner microsoft foundation class library mfc wrapped windows api functionality c++ classes thus allows object-oriented way interact api active template library atl template oriented wrapper com windows template library wtl developed extension atl intended smaller alternative mfc application frameworks windows least partly wrap windows api thus .net framework java likewise programming languages windows contain wrapper libraries windows api code pack microsoft .net framework .net wrapper library windows api windows api always exposed large part underlying structure windows systems programmers advantage giving much flexibility power applications also creates great responsibility applications handle various low-level sometimes tedious operations associated graphical user interface example beginning c programmer often write simple hello world first assignment working part program single printf line within main subroutine overhead linking standard i/o library also one line windows version still one working line code required many many lines overhead charles petzold wrote several books programming windows api said original hello world program windows 1.0 sdk bit scandal hello.c 150 lines long hello.rc resource script another 20 lines ... veteran programmers often curled horror laughter encountering windows hello-world program years various changes additions made windows systems windows api changed grew reflect windows api windows 1.0 supported fewer 450 function calls whereas modern versions windows api support thousands however general interface remained fairly consistent old windows 1.0 application still look familiar programmer used modern windows api microsoft made effort maintain backward compatibility achieve developing new versions windows microsoft sometimes implemented workarounds allow compatibility third-party software used prior version undocumented even inadvisable way raymond chen microsoft developer works windows api said could probably write months solely bad things apps get work often spite get particularly furious people accuse microsoft maliciously breaking applications os upgrades application failed run windows 95 took personal failure one largest changes windows api transition win16 shipped windows 3.1 older win32 windows nt windows 95 win32 originally introduced windows nt 3.1 win32s allowed use win32 subset windows 95 windows 95 widespread porting applications win32 began ease transition windows 95 developers outside inside microsoft complex scheme api thunks used could allow 32-bit code call 16-bit code win16 apis vice versa flat thunks allowed 32-bit code call 16-bit libraries scheme used extensively inside windows 95 libraries avoid porting whole os win32 one batch windows nt os pure 32-bit except parts compatibility 16-bit applications generic thunks available thunk win16 win32 windows 95 platform sdk shipped compiler could produce code needed thunks versions 64-bit windows also able run 32-bit applications via wow64 syswow64 folder located windows folder os drive contains several tools support 32-bit applications almost every new version microsoft windows introduced additions changes windows api name api however remained consistent different windows versions name changes kept limited major architectural platform changes windows microsoft eventually changed name current win32 api family windows api made catch-all term past future api versions wine project provides win32 api compatibility layer unix-like platforms linux kernel api programs written windows api reactos goes step aims implement full windows operating system working closely wine project promote code re-use compatibility doswin32 hx dos extender projects emulate windows api allow executing simple windows programs dos command line odin project emulate win32 os/2 superseding original win-os/2 emulation based microsoft code minor implementations include mewel zinc libraries intended implement subset win16 api dos see list platform-independent gui libraries windows interface source environment wise licensing program microsoft allowed developers recompile run windows-based applications unix macintosh platforms wise sdks based emulator windows api could run platforms efforts toward standardization included sun public windows interface pwi win16 see also sun windows application binary interface wabi willows software application programming interface windows apiw win16 win32 see also willows twin ecma-234 attempted standardize windows api bindingly develop software uses windows api compiler must able use microsoft-specific dlls listed com-objects outside win32 assume certain vtable layout compiler must either handle header files expose interior api function names supply files language c++ zortech later symantec digital mars watcom borland produced well known commercial compilers used often win16 win32s win32 supplied memory extenders allowing win32 programs run win16 microsoft redistributable win32s dll zortech compiler probably one first stable usable c++ compilers windows programming microsoft c++ compiler certain classes applications compiler system also able handle interface description language idl files collectively prerequisites compilers tools libraries headers known microsoft platform sdk time microsoft visual studio borland integrated development system integrated development environments ides could provide although sdk downloadable free separately entire ide suite microsoft windows sdk windows 7 .net framework 4 mingw cygwin projects also provide environment based gnu compiler collection gcc using stand-alone header file set make linking win32-specific dlls simple lcc-win32 c compiler maintained jacob navia freeware non-commercial use pelles c freeware c compiler maintained pelle orinius free pascal free software object pascal compiler supports windows api masm32 package mature project providing support windows api microsoft macro assembler masm using custom made converted headers libraries platform sdk flat assembler fasm allows building windows programs without using external linker even running linux windows specific compiler support also needed structured exception handling seh system serves two purposes provides substrate language-specific exception handling implemented kernel notifies applications exceptional conditions dereferencing invalid pointer stack overflow microsoft/borland c++ compilers ability use system soon introduced windows 95 nt however actual implementation undocumented reverse engineered wine project free compilers seh based pushing exception handler frames onto stack adding linked list stored thread local storage first field thread environment block exception thrown kernel base libraries unwind stack running handlers filters encountered eventually every exception unhandled application dealt default backstop handler pops windows common crash dialog", + "neighbors": [ + 26, + 28, + 99, + 108, + 111, + 117, + 258, + 268, + 278, + 292, + 306, + 308, + 378, + 394, + 412, + 435, + 472, + 509, + 521, + 567, + 653, + 682, + 686, + 689, + 776, + 796, + 805, + 961, + 1002, + 1068, + 1090, + 1138, + 1177, + 1189, + 1190, + 1193, + 1212, + 1221, + 1225, + 1227, + 1231, + 1235, + 1251, + 1287, + 1298, + 1311, + 1417, + 1428, + 1502, + 1536, + 1547, + 1573, + 1588, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 816, + "label": 6, + "text": "Pwd:pwd unix-like operating systems codice_1 command print working directory writes full pathname current working directory standard output command shell builtin unix shells bourne shell ash bash ksh zsh implemented easily posix c functions codice_2 codice_3 also available operating systems spartados x panos kolibrios equivalent dos codice_4 microsoft windows codice_5 codice_6 command arguments windows powershell provides equivalent codice_7 cmdlet standard aliases codice_8 codice_1 openvms equivalent codice_10 version codice_1 bundled gnu coreutils written jim meyering numerical computing environments matlab gnu octave include codice_1 function similar functionality note posix requires default behavior -l switch provided posix shells set following environment variables using cd command", + "neighbors": [ + 209, + 301, + 306, + 323, + 631, + 806, + 825, + 901, + 940, + 961, + 1028, + 1110, + 1138, + 1190, + 1218, + 1243, + 1374, + 1509, + 1517, + 1587 + ], + "mask": "Train" + }, + { + "node_id": 817, + "label": 8, + "text": "Archi_(tool):archi tool archi free open-source visual-modelling design tool creating archimate models modelling sketches archi initially funded 2010 2012 jisc part national project aimed supporting programme enterprise architecture uk higher education sector original project hosted institute educational cybernetics bolton university uk since january 2013 archi continued maintained volunteer basis creator phil beauvoir jean-baptiste sarrodie archi supports archimate 3.0 modelling language technical standard open group archi provides open source reference implementation archimate currently used one tools implement open group archimate model exchange file format plugins available github", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 818, + "label": 4, + "text": "Flame_(malware):flame malware flame also known flamer skywiper skywiper modular computer malware discovered 2012 attacks computers running microsoft windows operating system program used targeted cyber espionage middle eastern countries discovery announced 28 may 2012 maher center iranian national computer emergency response team cert kaspersky lab crysys lab budapest university technology economics last stated report flame certainly sophisticated malware encountered practice arguably complex malware ever found flame spread systems local network lan record audio screenshots keyboard activity network traffic program also records skype conversations turn infected computers bluetooth beacons attempt download contact information nearby bluetooth-enabled devices data along locally stored documents sent one several command control servers scattered around world program awaits instructions servers according estimates kaspersky may 2012 flame initially infected approximately 1,000 machines victims including governmental organizations educational institutions private individuals time 65 infections happened iran israel palestine sudan syria lebanon saudi arabia egypt huge majority targets within iran flame also reported europe north america flame supports kill command wipes traces malware computer initial infections flame stopped operating public exposure kill command sent flame linked equation group kaspersky lab however costin raiu director kaspersky lab global research analysis team believes group cooperates creators flame stuxnet position superiority equation group definitely masters giving others maybe bread crumbs time time giving goodies integrate stuxnet flame flame a.k.a da flame identified may 2012 maher center iranian national cert kaspersky lab crysys lab laboratory cryptography system security budapest university technology economics kaspersky lab asked united nations international telecommunication union investigate reports virus affecting iranian oil ministry computers kaspersky lab investigated discovered md5 hash filename appeared customer machines middle eastern nations discovering pieces researchers dubbed program flame one main modules inside toolkit nowiki /nowiki frog.defaultattacks.a-installflame nowiki /nowiki according kaspersky flame operating wild since least february 2010 crysys lab reported file name main component observed early december 2007 however creation date could determined directly creation dates malware modules falsely set dates early 1994 computer experts consider cause attack april 2012 caused iranian officials disconnect oil terminals internet time iranian students news agency referred malware caused attack wiper name given malware creator however kaspersky lab believes flame may separate infection entirely wiper malware due size complexity program\u2014described twenty times complicated stuxnet\u2014the lab stated full analysis could require long ten years 28 may iran cert announced developed detection program removal tool flame distributing select organizations several weeks flame exposure news media symantec reported 8 june flame command control c c computers sent suicide command infected pcs remove traces flame according estimates kaspersky may 2012 initially flame infected approximately 1,000 machines victims including governmental organizations educational institutions private individuals time countries affected iran israel palestinian territories sudan syria lebanon saudi arabia egypt flame uncharacteristically large program malware 20 megabytes written partly lua scripting language compiled c++ code linked allows attack modules loaded initial infection malware uses five different encryption methods sqlite database store structured information method used inject code various processes stealthy malware modules appear listing modules loaded process malware memory pages protected read write execute permissions make inaccessible user-mode applications internal code similarities malware exploits two security vulnerabilities used previously stuxnet infect systems malware determines antivirus software installed customises behaviour example changing filename extensions uses reduce probability detection software additional indicators compromise include mutex registry activity installation fake audio driver malware uses maintain persistence compromised system flame designed deactivate automatically supports kill function makes eliminate traces files operation system receipt module controllers flame signed fraudulent certificate purportedly microsoft enforced licensing intermediate pca certificate authority malware authors identified microsoft terminal server licensing service certificate inadvertently enabled code signing still used weak md5 hashing algorithm produced counterfeit copy certificate used sign components malware make appear originated microsoft successful collision attack certificate previously demonstrated 2008 flame implemented new variation chosen-prefix collision attack like previously known cyber weapons stuxnet duqu employed targeted manner evade current security software rootkit functionality system infected flame spread systems local network via usb stick record audio screenshots keyboard activity network traffic program also records skype conversations turn infected computers bluetooth beacons attempt download contact information nearby bluetooth enabled devices data along locally stored documents sent one several command control servers scattered around world program awaits instructions servers unlike stuxnet designed sabotage industrial process flame appears written purely espionage appear target particular industry rather complete attack toolkit designed general cyber-espionage purposes using technique known sinkholing kaspersky demonstrated huge majority targets within iran attackers particularly seeking autocad drawings pdfs text files computing experts said program appeared gathering technical diagrams intelligence purposes network 80 servers across asia europe north america used access infected machines remotely 19 june 2012 washington post published article claiming flame jointly developed u.s. national security agency cia israel \u2019 military least five years prior project said part classified effort code-named olympic games intended collect intelligence preparation cyber-sabotage campaign aimed slowing iranian nuclear efforts according kaspersky chief malware expert geography targets also complexity threat leaves doubt nation-state sponsored research went kaspersky initially said malware bears resemblance stuxnet although may parallel project commissioned attackers analysing code kaspersky later said strong relationship flame stuxnet early version stuxnet contained code propagate via usb drives nearly identical flame module exploits zero-day vulnerability iran cert described malware encryption special pattern see coming israel daily telegraph reported due flame apparent targets\u2014which included iran syria west bank\u2014israel became many commentators prime suspect commentators named china u.s. possible perpetrators richard silverstein commentator critical israeli policies claimed confirmed senior israeli source malware created israeli computer experts jerusalem post wrote israel vice prime minister moshe ya'alon appeared hinted government responsible israeli spokesperson later denied implied unnamed israeli security officials suggested infected machines found israel may imply virus could traced u.s. western nations u.s. officially denied responsibility leaked nsa document mentions dealing iran discovery flame nsa gchq jointly-worked event", + "neighbors": [ + 11, + 43, + 88, + 91, + 141, + 149, + 158, + 190, + 198, + 232, + 261, + 281, + 293, + 325, + 363, + 376, + 414, + 418, + 450, + 487, + 531, + 533, + 550, + 564, + 576, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 682, + 692, + 701, + 708, + 739, + 746, + 782, + 783, + 800, + 898, + 915, + 961, + 1043, + 1063, + 1090, + 1101, + 1162, + 1186, + 1232, + 1240, + 1270, + 1293, + 1309, + 1325, + 1327, + 1332, + 1336, + 1342, + 1365, + 1368, + 1379, + 1393, + 1436, + 1444, + 1467, + 1475, + 1543, + 1573, + 1576, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 819, + "label": 8, + "text": "Enterprise_Architect_(software):enterprise architect software sparx systems enterprise architect visual modeling design tool based omg uml platform supports design construction software systems modeling business processes modeling industry based domains used businesses organizations model architecture systems process implementation models across full application development life-cycle systems modeling using uml provides basis modeling aspects organizational architecture along ability provide foundation designing implementing new systems changing existing systems aspects covered type modeling range laying organizational systems architectures business process reengineering business analysis service-oriented architectures web modeling application database design re-engineering development embedded systems along system modeling enterprise architect covers core aspects application development life-cycle requirements management design construction testing maintenance phases support traceability project management change control processes well facilities model driven development application code using internal integrated-development platform user base ranges programmers business analysts enterprise architects organizations ranging small developer companies multi-national corporations government organizations international industry standards bodies sparx systems initially released enterprise architect 2000 originally designed uml modeling tool modeling uml 1.1 product evolved include omg uml specifications 1.3 2.0 2.1 2.3 2.4.1 2.5 enterprise architect supports range open industry standards designing modeling software business systems uml 2.5 sysml 1.5 bpmn 2.0 dmn bpel soaml spem wsdl xsd dds archimate 3.0 arcgis ifml cmmn geography markup language gml odm owl rdf enterprise integration patterns eip enterprise architect also supports industry frameworks zachman framework togaf including feaf uaf updm framework supports dodaf modaf naf service-oriented modeling framework somf supportd frameworks supplied industry bodies trak geosciml niem supports core service-oriented architectures soaml service-oriented modeling framework somf enterprise-level architecture along round trip engineering wsdl xsd used facilitate bpel generation models published industry standards development bodies using enterprise architect include underlying uml modeling key aspects modeling tools support core aspects supported enterprise architect include profiles patterns mof ocl mda transforms corba idl uml validation run model common features requirements management supported enterprise architect include customization requirements documented linking requirements design implementation details providing requirement traceability design construction phases requirements subject change management workflow processing baseline comparison auditing enterprise architect supports number methods modeling business processes using uml foundation modeling language core languages business modeling analysis include bpmn bpel along various historic profiles enterprise architect also supports definition business rules ability generate executable code rules business modeling combined gap analysis view potential gaps proposed solutions model simulation supported behavioral diagrams state machines interaction sequence diagrams activities execution flow defined using triggers guards effects simulation supports re-runs alteration triggered events supports viewing variables call stack setting debug markers also support interaction emulated user-interface screens containing common ui fields bpmn diagrams using bpsim bpmn models simulated creating tabulated results analysis. monte carlo probability based simulations sysml parametric simulation using open modelica mathematical formulas sysml blocks parametric blocks simulated plotting graphs used analysis dmn simulation simulation supports interaction dmn models bpmn models using bpsim line model driven design principles enterprise architect supports mda transforms pim class structures psm class structures round-trip engineering code 10 software languages several key embedded hdl systems languages ada vhdl verilog also supports code generation behavioral models languages supported include actionscript c c c++ delphi java including java 1.5 aspects generics php python july 2019 enterprise architect capability reverse engineer object oriented python code parse _init_ method visual basic visual basic .net accordance model driven development principles enterprise architect provides integrated development environment supports code editing syntax highlighting intellisense building debugging code testing within model compilers interpreters supported microsoft windows native c c++ visual basic.net family c j vb sun microsystems java php gnu compilers c++ c ada gcc gdb .add-ins available integration ms visual studio eclipse wireframe modeling supports using templates modeling appearance dialogs presented users interacting application supported device dialogs include screen dialogs webpages android apple windows 8.1 phones tablets code based testing support xunit testing involves mda transformation classes nunit junit classes ability generate unit tests model automatically record results tested classes testpoint testing model based code testing parallel test contracts defined \u2018 design contract \u2019 runs using debug definitions methods support test definitions test results logged related classes model integrated building debugging code enterprise architect allows developer perform abstract analysis software using profiling sequence diagram generation sequence diagram generation provides means analyze general process flow iron inconsistencies profiling summarizes thread routine code general efficiency system engineering supported sysml 1.4 modeling coupled executable code generation sysml supports modeling requirement definition system composition using sysml blocks parts parametric model simulation executable code generation supports embedded hdl system languages ada vhdl verilog coupled behavioral code generation standard code languages defined enterprise architect supports data modeling conceptual physical levels forward reverse engineering database schemas mda transformation logical platform independent physical dbms platform dependant diagram types supported include ddl notation erd notation idef1x notation information engineering notation supported dbmss include db2 firebird/interbase ms access 97 2000 2003 2007 2013 ms sql server editions 2005 including express azure mysql mariadb sqlite oracle 9i editions postgresql arcgis informix ingres sybase adaptive server anywhere sybase asa sybase adaptive server enterprise sybase ase features supporting project management include resource allocation tracking using gantt charts kanban diagrams event logging using model calendars workflow scripting setting workflow processes security model metrics key facilities supporting change management auditing baseline difference merge version control version control interface supports major version control applications subversion cvs team foundation server scc interface scc compatible version control system features support integration tools include xmi import/export supports xmi 1.1 1.2 2.1 specifications import .emx rhapsody files open services lifecycle collaboration oslc csv import/export archimate open exchange format import export version 13 automation interface \u2013 supports comprehensive api use com based language java among add-ins available interfaces vs .net eclipse microsoft office doors along third party add-ins interfacing likes jira", + "neighbors": [ + 65, + 134, + 306, + 544, + 782, + 1138, + 1225, + 1235, + 1572 + ], + "mask": "Validation" + }, + { + "node_id": 820, + "label": 9, + "text": "First-class_function:first-class function computer science programming language said first-class functions treats functions first-class citizens means language supports passing functions arguments functions returning values functions assigning variables storing data structures programming language theorists require support anonymous functions function literals well languages first-class functions names functions special status treated like ordinary variables function type term coined christopher strachey context functions first-class citizens mid-1960s first-class functions necessity functional programming style use higher-order functions standard practice simple example higher-ordered function map function takes arguments function list returns list formed applying function member list language support map must support passing function argument certain implementation difficulties passing functions arguments returning results especially presence non-local variables introduced nested anonymous functions historically termed funarg problems name coming function argument early imperative languages problems avoided either supporting functions result types e.g algol 60 pascal omitting nested functions thus non-local variables e.g c early functional language lisp took approach dynamic scoping non-local variables refer closest definition variable point function executed instead defined proper support lexically scoped first-class functions introduced scheme requires handling references functions closures instead bare function pointers turn makes garbage collection necessity section compare particular programming idioms handled functional language first-class functions haskell compared imperative language functions second-class citizens c languages functions first-class citizens functions passed arguments functions way values function taking another function argument called higher-order function language haskell languages functions first-class often still allow one write higher-order functions use features function pointers delegates language c two samples number differences two approaches directly related support first-class functions haskell sample operates lists c sample operates arrays natural compound data structures respective languages making c sample operate linked lists would made unnecessarily complex also accounts fact c function needs additional parameter giving size array c function updates array in-place returning value whereas haskell data structures persistent new list returned old left intact haskell sample uses recursion traverse list c sample uses iteration natural way express function languages haskell sample could easily expressed terms fold c sample terms recursion finally haskell function polymorphic type supported c fixed type variables type constant codice_1 languages supporting anonymous functions pass function argument higher-order function language support anonymous functions bind name instead anonymous nested functions becomes natural refer variables outside body called non-local variables functions represented bare function pointers know anymore value outside function body passed closure needs built manually therefore speak first-class functions also note codice_2 specialized functions referring two codice_1s outside environment set generally requires boilerplate code codice_4 would nested function would still run problem reason supported c. returning function fact returning closure c example local variables captured closure go scope return function builds closure forcing closure later point result undefined behaviour possibly corrupting stack known upwards funarg problem assigning functions variables storing inside global datastructures potentially suffers difficulties returning functions one test literals values equality natural ask whether programming language support testing functions equality inspection question appears difficult one distinguish several types function equality type theory type functions accepting values type returning values type b may written \u2192 b b curry-howard correspondence function types related logical implication lambda abstraction corresponds discharging hypothetical assumptions function application corresponds modus ponens inference rule besides usual case programming functions type theory also uses first-class functions model associative arrays similar data structures category-theoretical accounts programming availability first-class functions corresponds closed category assumption instance simply typed lambda calculus corresponds internal language cartesian closed categories functional programming languages scheme ml haskell f scala first-class functions lisp one earliest functional languages designed aspects first-class functions properly understood resulting functions dynamically scoped later scheme common lisp dialects lexically scoped first-class functions many scripting languages including perl python php lua tcl/tk javascript io first-class functions imperative languages distinction made algol descendants pascal traditional c family modern garbage-collected variants algol family allowed nested functions higher-order taking function arguments higher-order functions return functions results except algol 68 allows reason known deal non-local variables nested-function returned result algol 68 produces runtime errors cases c family allowed passing functions arguments returning results avoided problems supporting nested functions gcc compiler allows extension usefulness returning functions primarily lies ability return nested functions captured non-local variables instead top-level functions languages generally considered first-class functions modern imperative languages often support garbage-collection making implementation first-class functions feasible first-class functions often supported later revisions language including c 2.0 apple blocks extension c c++ objective-c. c++11 added support anonymous functions closures language non-garbage collected nature language special care taken non-local variables functions returned results see", + "neighbors": [ + 29, + 65, + 117, + 216, + 249, + 306, + 308, + 347, + 378, + 392, + 509, + 538, + 567, + 579, + 682, + 690, + 756, + 825, + 873, + 919, + 948, + 1028, + 1120, + 1152, + 1221, + 1225, + 1227, + 1235, + 1311, + 1430, + 1437, + 1477, + 1491, + 1626, + 1636 + ], + "mask": "Train" + }, + { + "node_id": 821, + "label": 3, + "text": "Cellular_architecture:cellular architecture cellular architecture type computer architecture prominent parallel computing cellular architectures relatively new ibm cell microprocessor first one reach market cellular architecture takes multi-core architecture design logical conclusion giving programmer ability run large numbers concurrent threads within single processor 'cell compute node containing thread units memory communication speed-up achieved exploiting thread-level parallelism inherent many applications cell cellular architecture containing 9 cores processor used playstation 3 another prominent cellular architecture cyclops64 massively parallel architecture currently development ibm cellular architectures follow low-level programming paradigm exposes programmer much underlying hardware allows programmer greatly optimize code platform time makes difficult develop software", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1320, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 822, + "label": 3, + "text": "Knight_Lore:knight lore knight lore 1984 action-adventure game known popularising isometric graphics video games game developed published ultimate play game written company founders chris tim stamper knight lore player character sabreman forty days collect objects throughout castle brew cure werewolf curse castle room depicted monochrome screen consists blocks climb obstacles avoid puzzles solve ultimate released knight lore third sabreman series despite completed first stamper brothers withheld release year position company advantageously anticipation game effect market knight lore novel image masking technique filmation let images appear pass atop behind without contents colliding created illusion depth priority computer natively support delaying knight lore release ultimate protected sales then-upcoming sabre wulf created another filmation game developers could copy style ultimate released original sabreman trilogy quick succession 1984 zx spectrum knight lore came last november ports followed bbc micro amstrad cpc msx family computer disk system 2008 unofficially ported atari 8-bit computers based bbc micro version game later included compilations including rare 2015 xbox one retrospective compilation rare replay knight lore regarded seminal work british gaming history included multiple lists top spectrum games critics considered technical solutions isometric 3d style harbinger future game design praised game controls atmosphere mystery noted difficult gameplay criticised sound occasional graphical slowdown knight lore best-selling game january 1985 named 1984 game year golden joystick awards popular computing weekly readers though first isometric 3d video game knight lore popularised format isometric flip-screen style fell fashion knight lore influence persisted computer role-playing games retrospective reviewers remember game first offer exploratory world rather flat surface consider controls outdated frustrating thirty years since release player sabreman bitten sabre wulf transforms werewolf nightfall 40 days collect items throughout melkhior wizard castle brew cure curse onscreen timer shows progression day night sabreman metamorphoses werewolf returning human form sunrise castle monsters attack sabreman werewolf game ends player completes potion finish task forty days game directions given poem included game cassette tape castle consists series 128 rooms displayed single non-scrolling screen sabreman must navigate 3d maze stone blocks room usually retrieve collectible object whilst avoiding spikes enemies kill contact player starts five lives loses one death running lives ends game stone blocks serve platforms player jump fall player weight move accord pushed enemies sabreman sabreman jumps higher werewolf form helps specific puzzles player often needs move blocks reach distant objects used platforms reach areas puzzles complete game player must return 14 sequential objects throughout castle wizard cauldron room end game player receives final score based remaining time amount quest completed ultimate play game represented co-founding brothers tim chris stamper uncommonly taciturn matters press marketing though provided details knight lore development crash magazine knight lore released third game sabreman series stamper brothers finished first withheld game year market reasons thought knight lore advancements\u2014copyrighted filmation engine\u2014would hurt sales then-upcoming sabre wulf used extra time prepare another filmation game alien 8 preempt sales would lost publishers would try copy technique sit everyone else far behind tim stamper recalled sabre wulf released commercial critical success 1984 alien 8 next two sabreman titles\u2014 underwurlde knight lore \u2014followed close succession end year filmation knight lore graphical novelty lay images could render without overlapping filmation introduced masked sprites whereas earlier games used planar sprites overlapped without regard depth order chris stamper solution use image masking mask version image defines background subject matter different colours combining mask on-screen composite image mask background data ignored hole shape desired image sprite added background filled sprite details thus rooms knight lore drawn one sprite time masking method recent times contemporary images render layer priority set individual pixel level knight lore depicted monochrome changes rooms avoid attribute clash computing limitation wherein object colour interfered others close proximity ultimate released knight lore zx spectrum november 1984 press release announced game beginning new class adventure games pinnacle software development 48k spectrum standard cryptic company ultimate circulate screenshots game press materials cover art knight lore subsequently released bbc micro amstrad cpc msx later 1985 amstrad version upgraded monochromatic colouring two-colour foreground setup jaleco released versions knight lore msx later famicom disk system latter 1986 release barely resembled namesake ultimate asked shahid ahmad developed knight lore -inspired chimera 1985 develop knight lore port commodore 64 come fruition knight lore later appeared spectrum version 1986 compilation sold million ii 2015 xbox one compilation 30 ultimate rare titles rare replay computer game magazines lauded knight lore writing graphics first kind marked sea change contemporaries computer video games cvg wrote never seen graphics calibre lived ultimate hype peter sweasey home computing weekly left speechless predicted knight lore would change market crash said unlikely surpassed spectrum best game crash selected knight lore crash smash recommendation january 1985 issue knight lore best selling game united kingdom month popular computing weekly readers named knight lore 1984 arcade game overall game year knight lore also named cvg game year 1985 golden joystick awards event ultimate named developer programmer year knight lore atmosphere sinclair user described crepuscular world claustrophobic menace inspired many curious questions part adventurer contemporaneous 1985 reviews crash appreciated imaginative mystery game attempted answer sabreman turns werewolf preferred play collectible objects throughout castle sabreman werewolf transformation sequence particular annoyed cvg traumatised players according well played book academic close readings video games players empathised suffering sabreman game design gave impression castle far grander scale reality crash wrote game novel eight-way direction scheme suited 3d space crash compared knight lore stylistically 1984 avalon suggested former bolder visuals magazine preferred knight lore predecessor underwurlde one critic even considered former ultimate best game crash noted knight lore masking technique addressed issues flicker attribute clash sinclair user appreciated sabreman disappeared view passing behind blocks criticism reviewers considered knight lore sound weakest component though spectrum clash also identified sometimes cruel difficulty gameplay later rooms castle require pixel-perfect precision compounded anxiety running timer game animations would slow proportional degree onscreen action reviews amstrad release amtix noted colour additions monochromatic original wrote knight lore among amstrad best adventures one complaint graphical slowdown many elements moving onscreen amstrad action shared complaint nevertheless named knight lore among amstrad best three games\u2014an improvement spectrum release par quality commodore 64 titles knight lore widely regarded seminal work british gaming history according kieron gillen rock paper shotgun knight lore second elite 1984 icon 1980s british computer game industry british magazine retro gamer described players first impressions knight lore unforgettable par experience playing space harrier 1985 wolfenstein 3d 1992 super mario 64 1996 first time retro gamer recalled knight lore striking isometric 3d visuals bold advance game graphics foretelling future british magazine edge described game graphics engine single greatest advance history video games retro gamer compared engine impact introduction sound film knight lore first use isometric graphics\u2014earlier examples include zaxxon 1982 q*bert 1982 ant attack 1983 \u2014but graphic style large in-game world popularised technique put ultimate filmation epicentre several video game clones inspired knight lore edge games struggled approximate isometric style internally visiting developer bo jangeborg devised solution result fairlight 1985 regarded another classic platform edge version filmation received branding worldmaker shahid ahmad said firebird chimera 1985 even closer knight lore ahmad shock admiration playing knight lore reportedly changed life convinced continue making games released chimera amstrad cpc atari 8-bit commodore 64 zx spectrum customising port processing limitations hardware 1986 many british video game publishers produced knight lore -style isometric games examples include sweevo world movie quazatron get dexter glider rider molecule man spindizzy bobby bearing many titles suffered slowdown issues knight lore due much on-screen activity ultimate released four filmation games alien 8 1985 rushed release developers opportunity react knight lore though retro gamer said rush noticeable alien 8 larger game world knight lore even puzzles alien 8 knight lore similar gameplay former set outer space updated filmation ii engine nightshade 1985 added colour scrolling graphics place flip-screen room changes however retro gamer regarded gameplay comparatively dull gunfright 1986 reported stampers last game also used filmation ii robust predecessor pentagram 1986 returned flip-screen rooms action-based gameplay included shooting enemies sold poorly last sabreman game meanwhile stamper brothers sought enter burgeoning console industry sold ultimate u.s. gold mid-1980s established rare develop nintendo console games ultimate last two isometric games lesser quality consumer interest genre endured isometric flip-screen trend continued britain several years apart fairlight sweevo world get dexter isometric flip-screen games included jon ritman knight lore -inspired batman 1986 head heels 1987 last ninja 1987 la abad\u00eda del crimen 1987 cadaver 1990 console games solstice 1990 landstalker 1992 players grew tired genre similar reiterations ritman games particular brought new ideas sandy white developed pre- knight lore isometric game ant attack impressed ultimate in-game balance gutsy design decisions developer great escape another isometric game considered knight lore rival title inspiration still spurred spend nine months making time stood still retro gamer wrote knight lore influence persisted 30 years later titles populous 1989 syndicate 1993 1994 civilization ii 1996 style also spread computer role-playing games like baldur gate diablo fallout though gamesradar matt cundy reported 2009 isometric perspective longer prominent topic game design 2014 chris scullion vice traced knight lore isometric influence sims 4 2014 diablo iii 2012 knight lore included multiple lists top spectrum games even top games platform inspired two fangames 1999 sequel 2010 3d remake development four years though isometric games existed previously retrospective review gillen rock paper shotgun recalled knight lore first game offer world physical depth exploration opposed simple mechanics arcade games jeremy signor usgamer agreed knight lore felt like world painting added game innovative use successive single-screen rooms flip-screen pre-dated legend zelda years gillen said game punishing style unforgiving gameplay high difficulty awkward controls become obsolete 30 years since release criticised knight lore enormously innovative incredibly atmospheric totally unplayable suggesting similar head heels 1987 aged much better peter parrish eurogamer found game frustrating though well-made dan whitehead publication appreciated 2015 rare replay compilation version knight lore emulated original choppy animations zx spectrum processor struggled render onscreen objects", + "neighbors": [ + 48, + 321, + 618, + 636, + 679, + 1307, + 1312 + ], + "mask": "Test" + }, + { + "node_id": 823, + "label": 3, + "text": "Knight_Tyme:knight tyme knight tyme computer game released zx spectrum amstrad cpc commodore 64 msx compatibles 1986 published mastertronic part mastertronic added dimension label two versions zx spectrum release published full version 128k spectrum published first cut-down version 48k spectrum removed music graphics locations published later programmed david jones third game magic knight series in-game music written david whittaker c64 version rob hubbard spectrum amstrad versions graphics ray owen rescued friend gimbal self-inflicted white-out spell magic knight finds transported far future aboard starship uss pisces magic knight must find way back time help tyme guardians apprehended paradox police board u.s.s pisces magic knight first recognized crew ship must create id card receives template derby iv ship main computer getting id completed takes command ship first arriving starbase 1 refuel ship refueling magic knight collects pieces golden sundial monopole retreat outpost returning ship pieces sundial discovers time machine appeared inside uss pisces take back time gameplay similar knight tyme predecessor spellbound game wide range commands carried-out using windimation system whereby text commands carried-out choosing options command windows importance watching magic knight energy level keeping harm rather different time around whilst spellbound required player vigilant health needed player occasionally avoid flying objects could sap strength knight tyme much focused puzzle-solving aspect although still death rooms spellbound reason regarded true graphic adventure gameworld features large number characters hero interact time around however responsible welfare help quest belong time magic knight found displaced person time around knight tyme also involves space travel magic knight commandeering uss pisces using journey various planets star systems planets communicated beamed-down via uss pisces transporter system magic knight also needs keep note ship fuel runs starship stranded means end game refuelling take place many planets uss pisces visits one magic knight game stormbringer released 1987", + "neighbors": [ + 1260, + 1612 + ], + "mask": "Test" + }, + { + "node_id": 824, + "label": 9, + "text": "Wolfram_Mathematica:wolfram mathematica wolfram mathematica usually termed mathematica modern technical computing system spanning areas technical computing including neural networks machine learning image processing geometry data science visualizations others system used many technical scientific engineering mathematical computing fields conceived stephen wolfram developed wolfram research champaign illinois wolfram language programming language used mathematica features wolfram mathematica include wolfram mathematica split two parts kernel front end kernel interprets expressions wolfram language code returns result expressions front end designed theodore gray 1988 provides gui allows creation editing notebook documents containing program code prettyprinting formatted text together results including typeset mathematics graphics gui components tables sounds content formatting generated algorithmically edited interactively standard word processing capabilities supported including real-time multi-lingual spell-checking documents structured using hierarchy cells allow outlining sectioning document support automatic numbering index creation documents presented slideshow environment presentations notebooks contents represented mathematica expressions created modified analyzed mathematica programs converted formats front end includes development tools debugger input completion automatic syntax highlighting among alternative front ends wolfram workbench eclipse based integrated development environment ide introduced 2006 provides project-based code development tools mathematica including revision management debugging profiling testing plugin intellij idea based ides work wolfram language code addition syntax highlighting analyse auto-complete local variables defined functions mathematica kernel also includes command line front end interfaces include jmath based gnu readline wolframscript ref", + "neighbors": [ + 29, + 134, + 246, + 306, + 324, + 345, + 378, + 392, + 521, + 567, + 579, + 592, + 684, + 690, + 766, + 796, + 806, + 825, + 948, + 961, + 985, + 1006, + 1028, + 1059, + 1142, + 1209, + 1225, + 1416, + 1532, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 825, + "label": 9, + "text": "R_(programming_language):r programming language r programming language free software environment statistical computing graphics supported r foundation statistical computing r language widely used among statisticians data miners developing statistical software data analysis polls data mining surveys studies scholarly literature databases show substantial increases popularity r ranks 20th tiobe index measure popularity programming languages gnu package source code r software environment written primarily c fortran r freely available gnu general public license pre-compiled binary versions provided various operating systems although r command line interface several graphical user interfaces rstudio integrated development environment r implementation programming language combined lexical scoping semantics inspired scheme created john chambers 1976 bell labs important differences much code written runs unaltered r created ross ihaka robert gentleman university auckland new zealand currently developed r development core team chambers member r named partly first names first two r authors partly play name s. project conceived 1992 initial version released 1995 stable beta version 2000 r libraries implement wide variety statistical graphical techniques including linear nonlinear modelling classical statistical tests time-series analysis classification clustering others r easily extensible functions extensions r community noted active contributions terms packages many r standard functions written r makes easy users follow algorithmic choices made computationally intensive tasks c c++ fortran code linked called run time advanced users write c c++ java .net python code manipulate r objects directly r highly extensible use user-submitted packages specific functions specific areas study due heritage r stronger object-oriented programming facilities statistical computing languages extending r also eased lexical scoping rules another strength r static graphics produce publication-quality graphs including mathematical symbols dynamic interactive graphics available additional packages r rd latex-like documentation format used supply comprehensive documentation online number formats hard copy r interpreted language users typically access command-line interpreter user types codice_1 r command prompt presses enter computer replies 4 shown calculation interpreted sum two single-element vectors resulting single-element vector prefix codice_2 indicates list elements following line starts first element vector feature useful output extends multiple lines like similar languages apl matlab r supports matrix arithmetic r data structures include vectors matrices arrays data frames similar tables relational database lists arrays stored column-major order r extensible object system includes objects among others regression models time-series geo-spatial coordinates scalar data type never data structure r. instead scalar represented vector length one many features r derive scheme r uses s-expressions represent data code functions first-class manipulated way data objects facilitating meta-programming allow multiple dispatch variables r lexically scoped dynamically typed function arguments passed value lazy -- say evaluated used function called r supports procedural programming functions functions object-oriented programming generic functions generic function acts differently depending classes arguments passed words generic function dispatches function method specific class object example r generic codice_3 function print almost every class object r simple codice_4 syntax although used mainly statisticians practitioners requiring environment statistical computation software development r also operate general matrix calculation toolbox \u2013 performance benchmarks comparable gnu octave matlab capabilities r extended user-created packages allow specialised statistical techniques graphical devices import/export capabilities reporting tools rmarkdown knitr sweave etc packages developed primarily r sometimes java c c++ fortran r packaging system also used researchers create compendia organise research data code report files systematic way sharing public archiving core set packages included installation r 15,000 additional packages available comprehensive r archive network cran bioconductor omegahat github repositories task views page subject list cran website lists wide range tasks fields finance genetics high performance computing machine learning medical imaging social sciences spatial statistics r applied packages available r also identified fda suitable interpreting data clinical research r package resources include crantastic community site rating reviewing cran packages r-forge central platform collaborative development r packages r-related software projects r-forge also hosts many unpublished beta packages development versions cran packages bioconductor project provides r packages analysis genomic data includes object-oriented data-handling analysis tools data affymetrix cdna microarray next-generation high-throughput sequencing methods list changes r releases maintained various news files cran highlights listed several major releases specialized integrated development environment ide r rstudio similar development interface r tools visual studio generic ides like eclipse also offer features work r. graphical user interfaces point-and-click approach include rattle gui r commander rkward common editors varying levels support r include emacs emacs speaks statistics vim nvim-r plugin neovim nvim-r plugin kate lyx notepad++ visual studio code winedt tinn-r. r functionality accessible several scripting languages python perl ruby f julia interfaces high-level programming languages like java .net c available well main r implementation written r c fortran several implementations aimed improving speed increasing extensibility closely related implementation pqr pretty quick r radford m. neal improved memory management support automatic multithreading renjin fastr java implementations r use java virtual machine cxxr rho riposte implementations r c++ renjin riposte pqr attempt improve performance using multiple processor cores form deferred evaluation alternative implementations experimental incomplete relatively users compared main implementation maintained r development core team tibco built runtime engine called terr part spotfire microsoft r open fully compatible r distribution modifications multi-threaded computations r vibrant active local communities worldwide users network share ideas learn growing number r events bringing users together conferences e.g user whyr conectar satrdays meetups well r-ladies groups promote gender diversity official annual gathering r users called user first event user 2004 may 2004 vienna austria skipping 2005 user conference held annually usually alternating locations europe north america subsequent conferences included future conferences planned follows r journal open access refereed journal r project statistical computing features short medium length articles use development r including packages programming tips cran news foundation news r comparable popular commercial statistical packages sas spss stata r available users charge free software license january 2009 new york times ran article charting growth r reasons popularity among data scientists threat poses commercial statistical packages sas june 2017 data scientist robert muenchen published in-depth comparison r software packages popularity data science software although r open-source project supported community developing companies strive provide commercial support and/or extensions customers section gives examples companies 2007 richard schultz martin schultz steve weston kirk mettler founded revolution analytics provide commercial support revolution r distribution r also includes components developed company major additional components include parallelr r productivity environment ide revoscaler big data analysis revodeployr web services framework ability reading writing data sas file format revolution analytics also offer distribution r designed comply established iq/oq/pq criteria enables clients pharmaceutical sector validate installation revolution r. 2015 microsoft corporation completed acquisition revolution analytics since integrated r programming language sql server 2016 sql server 2017 power bi azure sql database azure cortana intelligence microsoft r server visual studio 2017 october 2011 oracle announced big data appliance integrates r apache hadoop oracle linux nosql database exadata hardware oracle r enterprise became one two components oracle advanced analytics option alongside oracle data mining ibm offers support in-hadoop execution r provides programming model massively parallel in-database analytics r. tibco offers runtime-version r part spotfire mango offers validation package r validr make compliant drug approval agencies like fda agencies allow use statistical software submissions software validated either vendor sponsor following examples illustrate basic syntax language use command-line interface r generally preferred assignment operator arrow made two characters codice_5 although codice_6 usually used instead one r \u2019 strengths ease creating new functions objects function body remain local function data type may returned example user-created function short r code calculating mandelbrot set first 20 iterations equation z z c plotted different complex constants c example demonstrates", + "neighbors": [ + 31, + 65, + 78, + 99, + 117, + 152, + 176, + 209, + 216, + 246, + 275, + 301, + 306, + 308, + 323, + 373, + 378, + 509, + 521, + 538, + 567, + 579, + 682, + 690, + 742, + 756, + 766, + 782, + 790, + 796, + 806, + 816, + 820, + 824, + 872, + 873, + 919, + 926, + 940, + 948, + 961, + 985, + 998, + 1005, + 1006, + 1028, + 1037, + 1059, + 1120, + 1123, + 1138, + 1152, + 1163, + 1180, + 1190, + 1221, + 1225, + 1227, + 1235, + 1311, + 1324, + 1385, + 1388, + 1413, + 1418, + 1430, + 1457, + 1477, + 1509, + 1532, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 826, + "label": 4, + "text": "Automated_Certificate_Management_Environment:automated certificate management environment automatic certificate management environment acme protocol communications protocol automating interactions certificate authorities users web servers allowing automated deployment public key infrastructure low cost designed internet security research group isrg let encrypt service protocol based passing json-formatted messages https published internet standard rfc 8555 chartered ietf working group isrg provides free open-source reference implementations acme certbot python-based implementation server certificate management software using acme protocol boulder certificate authority implementation written go december 2015 web server caddy gained native support automatic certificate issuance renewal using acme protocol since spun go library called certmagic october 2017 let encrypt announced similar built-in functionality module apache httpd since large number client options appeared api v1 released april 12 2016 supports issuing certificates single domains example.com cluster.example.com let encrypt suggests users migrate v2 soon possible support v1 planned deprecated many acme clients already support v2 ahead release api v2 released march 13 2018 pushed back several times acme v2 backwards compatible v1 version 2 supports wildcard domains *.example.com allowing many subdomains trusted ssl e.g nowiki https //cluster01.example.com /nowiki nowiki https //cluster02.example.com /nowiki nowiki https //example.com /nowiki private networks single domain using single shared wildcard certificate major new requirement v2 requests wildcard certificates require modification domain name service txt record verifying control domain changes acme v2 protocol since v1 include", + "neighbors": [ + 88, + 172, + 216, + 235, + 260, + 261, + 319, + 533, + 539, + 542, + 554, + 692, + 1003, + 1089, + 1225, + 1240, + 1331, + 1452, + 1534, + 1582, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 827, + "label": 1, + "text": "Block_contention:block contention database management systems block contention data contention refers multiple processes instances competing access index data block time general caused frequent index table scans frequent updates concurrent statement executions two instances may also lead contention subsequently busy waiting process without lock situations goal spread queries greater number blocks avoid concentrating single one", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 828, + "label": 9, + "text": "Matthias_Felleisen:matthias felleisen matthias felleisen german-american computer science professor author grew germany immigrated us 21 years old felleisen currently trustee professor khoury college computer sciences northeastern university boston massachusetts past taught rice university receiving phd indiana university direction daniel p. friedman felleisen interests include programming languages including software tools program design design recipe software contracts many 1990s felleisen launched plt teachscheme programbydesign eventually giving rise bootstrap project goal teaching program-design principles beginners explore use scheme produce large systems part effort authored design programs mit press 2001 findler flatt krishnamurthi dissertation felleisen developed small-step operational semantics higher-order functional imperative extensions state control part semantics engineering plt redex derived dissertation well-known application proof type safety worked phd student andrew wright control delimiters basis delimited continuations introduced felleisen 1988 since used large number domains particularly defining new control operators see queinnec survey a-normal form anf intermediate representation programs functional compilers introduced sabry felleisen 1992 simpler alternative continuation-passing style cps felleisen gave keynote addresses 2011 technical symposium computer science education 2010 international conference functional programming 2004 european conference object-oriented programming 2001 symposium principles programming languages several conferences workshops computer science 2006 inducted fellow association computing machinery 2009 received karl v. karlstrom outstanding educator award acm 2010 received sigcse award outstanding contribution computer science education acm 2012 received acm sigplan programming languages achievement award significant lasting contribution field programming languages including small-step operational semantics control state mixin classes mixin modules fully abstract semantics sequential pcf web programming techniques higher-order contracts blame static typing dynamic languages felleisen co-author", + "neighbors": [ + 27, + 29, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 693, + 753, + 787, + 831, + 919, + 929, + 934, + 947, + 978, + 1021, + 1088, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1511, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 829, + "label": 3, + "text": "Dynamite_Bowl:dynamite bowl general concept five players play 30 bowling lanes available simulating concept bowling league players change lane positioning determine strong throw even make ball go various curves even straight ball pins player character either male female options bowling ball weights ranging", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 830, + "label": 3, + "text": "SSE2:sse2 sse2 streaming simd extensions 2 one intel simd single instruction multiple data processor supplementary instruction sets first introduced intel initial version pentium 4 2000 extends earlier sse instruction set intended fully replace mmx intel extended sse2 create sse3 2004 sse2 added 144 new instructions sse 70 instructions competing chip-maker amd added support sse2 introduction opteron athlon 64 ranges amd64 64-bit cpus 2003 sse2 instructions implement integer vector operations also found mmx instead mmx registers use xmm registers wider allow significant performance improvements specialized applications another advantage replacing mmx sse2 avoiding mode switching penalty issuing x87 instructions present mmx sharing register space x87 fpu sse2 also complements floating-point vector operations sse instruction set adding support double precision data type sse2 extensions include set cache control instructions intended primarily minimize cache pollution processing infinite streams information sophisticated complement numeric format conversion instructions amd implementation sse2 amd64 x86-64 platform includes additional eight registers doubling total number 16 xmm0 xmm15 additional registers visible running 64-bit mode intel adopted additional registers part support x86-64 architecture intel parlance intel 64 2004 fpu x87 instructions provide higher precision calculating intermediate results 80 bits precision default minimise roundoff error numerically unstable algorithms see ieee 754 design rationale references therein however x87 fpu scalar unit whereas sse2 process small vector operands parallel codes designed x87 ported lower precision double precision sse2 floating point certain combinations math operations input datasets result measurable numerical deviation issue reproducible scientific computations e.g calculation results must compared results generated different machine architecture related issue historically language standards compilers inconsistent handling x87 80-bit registers implementing double extended precision variables compared double single precision formats implemented sse2 rounding extended precision intermediate values double precision variables fully defined dependent implementation details registers spilled memory sse2 extends mmx instructions operate xmm registers therefore possible convert existing mmx code sse2 equivalent since sse2 register twice long mmx register loop counters memory access may need changed accommodate however 8 byte loads stores xmm available strictly required although one sse2 instruction operate twice much data mmx instruction performance might increase significantly two major reasons accessing sse2 data memory aligned 16-byte boundary incur significant penalty throughput sse2 instructions older x86 implementations half mmx instructions intel addressed first problem adding instruction sse3 reduce overhead accessing unaligned data improving overall performance misaligned loads last problem widening execution engine core microarchitecture core 2 duo later products since mmx x87 register files alias one another using mmx prevent x87 instructions working desired mmx used programmer must use emms instruction c _mm_empty restore operation x87 register file operating systems x87 used much may still used critical areas like pow extra precision needed cases corrupt floating-point state caused failure emit emms may go undetected millions instructions ultimately causing floating-point routine fail returning nan since problem locally apparent mmx code finding correcting bug time consuming sse2 problem usually provides much better throughput provides registers 64-bit code preferred nearly vectorization work first introduced 2000 sse2 supported software development tools example use sse2 microsoft visual studio project programmer either manually write inline-assembly import object-code external source later visual c++ processor pack added sse2 support visual c++ masm intel c++ compiler automatically generate sse4 ssse3 sse3 sse2 sse code without use hand-coded assembly since gcc 3 gcc automatically generate sse/sse2 scalar code target supports instructions automatic vectorization sse/sse2 added since gcc 4 sun studio compiler suite also generate sse2 instructions compiler flag -xvector=simd used since microsoft visual c++ 2012 compiler option generate sse2 instructions turned default sse2 extension ia-32 architecture based x86 instruction set therefore x86 processors include sse2 amd64 architecture supports ia-32 compatibility mode includes sse2 specification also doubles number xmm registers allowing better performance sse2 also requirement installing windows 8 later microsoft office 2013 later enhance reliability third-party apps drivers running windows 8 following ia-32 cpus support sse2 following ia-32 cpus released sse2 developed implement", + "neighbors": [ + 85, + 137, + 210, + 258, + 271, + 457, + 486, + 752, + 979, + 1016, + 1158, + 1160, + 1161, + 1231, + 1284, + 1287, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 831, + "label": 9, + "text": "Robert_Bruce_Findler:robert bruce findler robert bruce findler colloquially known robby american computer scientist currently professor electrical engineering computer science northwestern university also member plt group responsible creation maintenance drracket addition drracket findler contributed numerous components racket supervises web-based software library called planet findler also leading team member programbydesign project findler received phd rice university direction matthias felleisen dissertation linguistics software contracts popularly known design contract work software contracts provides careful accounting blame thereby helping programmers quickly home faulty part software system addition drracket software contracts findler focuses design implementation workbench semantics engineers workbench called redex tool specifying executing reduction semantics programming language used programming language researchers us europe recently sun fortress research team used redex specify explore key parts language findler served semantics editor revised^6 report scheme programming language phd student jacob matthews developed redex model core semantics included appendix report appendix plays role standard ml formal specification milner tofte harper macqueen executable thus visualize individual examples", + "neighbors": [ + 27, + 29, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 828, + 919, + 929, + 934, + 947, + 978, + 1006, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 832, + "label": 0, + "text": "Optical_character_recognition:optical character recognition optical character recognition optical character reader ocr mechanical electronic conversion images typed handwritten printed text machine-encoded text whether scanned document photo document scene-photo example text signs billboards landscape photo subtitle text superimposed image example television broadcast widely used form information entry printed paper data records \u2013 whether passport documents invoices bank statements computerized receipts business cards mail printouts static-data suitable documentation \u2013 common method digitizing printed texts electronically edited searched stored compactly displayed on-line used machine processes cognitive computing machine translation extracted text-to-speech key data text mining ocr field research pattern recognition artificial intelligence computer vision early versions needed trained images character worked one font time advanced systems capable producing high degree recognition accuracy fonts common support variety digital image file format inputs systems capable reproducing formatted output closely approximates original page including images columns non-textual components early optical character recognition may traced technologies involving telegraphy creating reading devices blind 1914 emanuel goldberg developed machine read characters converted standard telegraph code concurrently edmund fournier d'albe developed optophone handheld scanner moved across printed page produced tones corresponded specific letters characters late 1920s 1930s emanuel goldberg developed called statistical machine searching microfilm archives using optical code recognition system 1931 granted usa patent number 1,838,389 invention patent acquired ibm advent smart-phones smartglasses ocr used internet connected mobile device applications extract text captured using device camera devices ocr functionality built operating system typically use ocr api extract text image file captured provided device ocr api returns extracted text along information location detected text original image back device app processing text-to-speech display 1974 ray kurzweil started company kurzweil computer products inc. continued development omni-font ocr could recognize text printed virtually font kurzweil often credited inventing omni-font ocr use companies including compuscan late 1960s 1970s kurzweil decided best application technology would create reading machine blind would allow blind people computer read text loud device required invention two enabling technologiesthe ccd flatbed scanner text-to-speech synthesizer january 13 1976 successful finished product unveiled widely reported news conference headed kurzweil leaders national federation blind 1978 kurzweil computer products began selling commercial version optical character recognition computer program lexisnexis one first customers bought program upload legal paper news documents onto nascent online databases two years later kurzweil sold company xerox interest commercializing paper-to-computer text conversion xerox eventually spun scansoft merged nuance communications research group headed a. g. ramakrishnan medical intelligence language engineering lab indian institute science developed printtobraille tool open source gui front end used ocr convert scanned images printed books braille books 2000s ocr made available online service webocr cloud computing environment mobile applications like real-time translation foreign-language signs smartphone various commercial open source ocr systems available common writing systems including latin cyrillic arabic hebrew indic bengali bangla devanagari tamil chinese japanese korean characters ocr engines developed many kinds domain-specific ocr applications receipt ocr invoice ocr check ocr legal billing document ocr used ocr generally offline process analyses static document handwriting movement analysis used input handwriting recognition instead merely using shapes glyphs words technique able capture motions order segments drawn direction pattern putting pen lifting additional information make end-to-end process accurate technology also known on-line character recognition dynamic character recognition real-time character recognition intelligent character recognition ocr software often pre-processes images improve chances successful recognition techniques include segmentation fixed-pitch fonts accomplished relatively simply aligning image uniform grid based vertical grid lines least often intersect black areas proportional fonts sophisticated techniques needed whitespace letters sometimes greater words vertical lines intersect one character two basic types core ocr algorithm may produce ranked list candidate characters matrix matching involves comparing image stored glyph pixel-by-pixel basis also known pattern matching pattern recognition image correlation relies input glyph correctly isolated rest image stored glyph similar font scale technique works best typewritten text work well new fonts encountered technique early physical photocell-based ocr implemented rather directly feature extraction decomposes glyphs features like lines closed loops line direction line intersections extraction features reduces dimensionality representation makes recognition process computationally efficient features compared abstract vector-like representation character might reduce one glyph prototypes general techniques feature detection computer vision applicable type ocr commonly seen intelligent handwriting recognition indeed modern ocr software nearest neighbour classifiers k-nearest neighbors algorithm used compare image features stored glyph features choose nearest match software cuneiform tesseract use two-pass approach character recognition second pass known adaptive recognition uses letter shapes recognized high confidence first pass recognize better remaining letters second pass advantageous unusual fonts low-quality scans font distorted e.g blurred faded ocr result stored standardized alto format dedicated xml schema maintained united states library congress list optical character recognition software see comparison optical character recognition software ocr accuracy increased output constrained lexicona list words allowed occur document might example words english language technical lexicon specific field technique problematic document contains words lexicon like proper nouns tesseract uses dictionary influence character segmentation step improved accuracy output stream may plain text stream file characters sophisticated ocr systems preserve original layout page produce example annotated pdf includes original image page searchable textual representation near-neighbor analysis make use co-occurrence frequencies correct errors noting certain words often seen together example washington d.c. generally far common english washington doc knowledge grammar language scanned also help determine word likely verb noun example allowing greater accuracy levenshtein distance algorithm also used ocr post-processing optimize results ocr api recent years major ocr technology providers began tweak ocr systems deal efficiently specific types input beyond application-specific lexicon better performance may taking account business rules standard expression rich information contained color images strategy called application-oriented ocr customized ocr applied ocr license plates invoices screenshots id cards driver licenses automobile manufacturing new york times adapted ocr technology proprietary tool entitle document helper enables interactive news team accelerate processing documents need reviewed note enables process amounts many 5,400 pages per hour preparation reporters review contents several techniques solving problem character recognition means improved ocr algorithms special fonts like ocr-a ocr-b micr fonts precisely specified sizing spacing distinctive character shapes allow higher accuracy rate transcription bank check processing ironically however several prominent ocr engines designed capture text popular fonts arial times new roman incapable capturing text fonts specialized much different popularly used fonts google tesseract trained recognize new fonts recognize ocr-a ocr-b micr fonts comb fields pre-printed boxes encourage humans write legiblyone glyph per box often printed dropout color easily removed ocr system palm os used special set glyphs known graffiti similar printed english characters simplified modified easier recognition platform computationally limited hardware users would need learn write special glyphs zone-based ocr restricts image specific part document often referred template ocr crowdsourcing humans perform character recognition quickly process images like computer-driven ocr higher accuracy recognizing images obtained computers practical systems include amazon mechanical turk recaptcha national library finland developed online interface users correct ocred texts standardized alto format crowd sourcing also used perform character recognition directly invite software developers develop image processing algorithms example use rank-order tournaments commissioned u.s. department energy doe information science research institute isri mission foster improvement automated technologies understanding machine printed documents conducted authoritative annual test ocr accuracy 1992 1996 recognition latin-script typewritten text still 100 accurate even clear imaging available one study based recognition 19th- early 20th-century newspaper pages concluded character-by-character ocr accuracy commercial ocr software varied 81 99 total accuracy achieved human review data dictionary authentication areas\u2014including recognition hand printing cursive handwriting printed text scripts especially east asian language characters many strokes single character \u2014are still subject active research mnist database commonly used testing systems ability recognise handwritten digits accuracy rates measured several ways measured greatly affect reported accuracy rate example word context basically lexicon words used correct software finding non-existent words character error rate 1 99 accuracy may result error rate 5 95 accuracy worse measurement based whether whole word recognized incorrect letters example difficulties inherent digitizing old text inability ocr differentiate long f characters web-based ocr systems recognizing hand-printed text fly become well known commercial products recent years see tablet pc history accuracy rates 80 90 neat clean hand-printed characters achieved pen computing software accuracy rate still translates dozens errors per page making technology useful limited applications recognition cursive text active area research recognition rates even lower hand-printed text higher rates recognition general cursive script likely possible without use contextual grammatical information example recognizing entire words dictionary easier trying parse individual characters script reading amount line cheque always written-out number example using smaller dictionary increase recognition rates greatly shapes individual cursive characters simply contain enough information accurately greater 98 recognize handwritten cursive script programs allow users set confidence rates means software achieve desired level accuracy user notified manual review characters support ocr added unicode standard june 1993 release version 1.1 characters mapped fonts specific micr ocr-a ocr-b", + "neighbors": [ + 111, + 159, + 162, + 282, + 307, + 368, + 372, + 453, + 611, + 733, + 766, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1232, + 1249, + 1440, + 1486, + 1500, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 833, + "label": 5, + "text": "Wireless_Application_Protocol:wireless application protocol wireless application protocol wap technical standard accessing information mobile wireless network wap browser web browser mobile devices mobile phones uses protocol introduced much hype 1999 wap achieved popularity early 2000s 2010s largely superseded modern standards modern handset internet browsers fully support html need use wap markup web page compatibility therefore longer able render display pages written wml wap markup language introduction wap mobile service providers limited opportunities offer interactive data services needed interactivity support internet web applications email stock prices news sports headlines japanese i-mode system offered another major competing wireless data protocol wap standard described protocol suite stack allowing interoperability wap equipment software different network technologies gsm is-95 also known cdma bottom-most protocol suite wireless datagram protocol wdp functions adaptation layer makes every data network look bit like udp upper layers providing unreliable transport data two 16-bit port numbers origin destination upper layers view wdp one protocol several technical realizations top data bearers sms ussd etc native ip bearers gprs umts packet-radio service ppp top circuit-switched data connection wdp fact exactly udp wtls optional layer provides public-key cryptography-based security mechanism similar tls wtp provides transaction support reliable request/response adapted wireless world wtp supports effectively tcp problem packet loss occurs commonly 2g wireless technologies radio conditions misinterpreted tcp network congestion finally one think wsp initially compressed version http protocol suite allows terminal transmit requests http https equivalent wap gateway gateway translates requests plain http wireless application environment wae space defines application-specific markup languages wap version 1.x primary language wae wireless markup language wml wap 2.0 primary markup language xhtml mobile profile wap push incorporated specification allow wap content pushed mobile handset minimal user intervention wap push basically specially encoded message includes link wap address wap push specified top wireless datagram protocol wdp delivered wdp-supported bearer gprs sms gsm networks wide range modified processors gprs activation network generally supported wap push messages delivered top sms bearer receiving wap push wap 1.2 later -enabled handset automatically give user option access wap content also known wap push si service indication variant known wap push sl service loading directly opens browser display wap content without user interaction since behaviour raises security concerns handsets handle wap push sl messages way si providing user interaction network entity processes wap pushes delivers ip sms bearer known push proxy gateway ppg re-engineered 2.0 version released 2002 uses cut-down version xhtml end-to-end http dropping gateway custom protocol suite used communicate wap gateway used conjunction wap 2.0 however scenario used standard proxy server wap gateway role would shift one translation adding additional information request would configured operator could include telephone numbers location billing information handset information mobile devices process xhtml mobile profile xhtml mp markup language defined wap 2.0 subset xhtml superset xhtml basic version cascading style sheets css called wap css supported xhtml mp multimedia messaging service mms combination wap sms allowing sending picture messages wap forum founded 1998 ericsson motorola nokia unwired planet aimed primarily bring together various wireless technologies standardised protocol 2002 wap forum consolidated along many forums industry open mobile alliance oma first company launch wap site dutch mobile phone operator telfort bv october 1999 site developed side project christopher bee euan mcleod launched debut nokia 7110 marketers hyped wap time introduction leading users expect wap performance fixed non-mobile internet access bt cellnet one uk telecoms ran advertising campaign depicting cartoon wap user surfing neuromancer -like information space terms speed ease use appearance interoperability reality fell far short expectations first handsets became available 1999 led wide usage sardonic phrases worthless application protocol wait pay waplash 2003 2004 wap made stronger resurgence introduction wireless services vodafone live t-mobile t-zones easily accessible services operator revenues generated transfer gprs umts data different business model used traditional web sites isps according mobile data association wap traffic uk doubled 2003 2004 year 2013 wap use largely disappeared major companies websites since retired use wap mainstream technology web mobile number years modern handset internet browsers support full html css javascript need use kind wap markup webpage compatibility list handsets supporting html extensive includes android handsets versions iphone handset blackberry devices devices running windows phone many nokia handsets wap saw major success japan largest operator ntt docomo use wap favor in-house system i-mode rival operators kddi au softbank mobile previously vodafone japan successfully deployed wap technology particular j-phone sha-mail picture mail java jscl services well au chakuuta/chakumovie ringtone song/ringtone movie services based wap like europe wap i-mode usage declined 2010s html-capable smartphones became popular japan adoption wap us suffered many cell phone providers required separate activation additional fees data support also telecommunications companies sought limit data access approved data providers operating license signal carrier recognition problem u.s. federal communications commission fcc issued order 31 july 2007 mandated licensees 22-megahertz wide upper 700 mhz c block spectrum would implement wireless platform allows customers device manufacturers third-party application developers others use device application choice operating particular licensed network band commentators criticized several aspects wireless markup language wml wap technical criticisms include criticisms address wireless carriers particular implementations wap original wap model provided simple platform access web-like wml services e-mail using mobile phones europe se asian regions 2009 continued considerable user base later versions wap primarily targeting united states market designed different requirement enable full web xhtml access using mobile devices higher specification cost higher degree software complexity considerable discussion addressed question whether wap protocol design appropriate suggested bandwidth-sparing simple interface gopher would better match mobile phones personal digital assistants pdas initial design wap specifically aimed protocol independence across range different protocols sms ip ppp circuit switched bearer ip gprs etc. led protocol considerably complex approach directly ip might caused controversial especially many ip side design wap ip wap transmission layer protocol wtp uses retransmission mechanisms udp attempt solve problem inadequacy tcp high-packet-loss networks", + "neighbors": [ + 162, + 337, + 425, + 444, + 455, + 470, + 509, + 527, + 542, + 684, + 726, + 757, + 758, + 764, + 769, + 771, + 1051, + 1116, + 1206, + 1240, + 1280, + 1325, + 1373, + 1395, + 1408, + 1448, + 1453, + 1552, + 1570, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 834, + "label": 9, + "text": "Expressive_power_(computer_science):expressive power computer science computer science expressive power also called expressiveness expressivity language breadth ideas represented communicated language expressive language greater variety quantity ideas used represent example web ontology language expression language profile owl2 el lacks ideas negation expressed owl2 rl rule language owl2 el may therefore said less expressive power owl2 rl restrictions allow efficient polynomial time reasoning owl2 el owl2 rl owl2 el trades expressive power efficient reasoning processing knowledge representation language term expressive power may used range meaning may mean measure ideas expressible language first sense dominates areas mathematics logic deal formal description languages meaning formal language theory mathematical logic process algebra informal discussions term often refers second sense often case discussing programming languages efforts made formalize informal uses term notion expressive power always relative particular kind thing language question describe term normally used comparing languages describe kind things least comparable kinds things design languages formalisms involves trade-off expressive power analyzability formalism express harder becomes understand instances formalism say decision problems become harder answer completely undecidable formal language theory mostly studies formalisms describe sets strings context-free grammars regular expressions instance formalism e.g grammar regular expression describes particular set strings context expressive power formalism set sets strings instances describe comparing expressive power matter comparing sets important yardstick describing relative expressive power formalisms area chomsky hierarchy says instance regular expressions nondeterministic finite automatons regular grammars equal expressive power context-free grammars greater means sets sets strings described first three formalisms equal proper subset set sets strings described context-free grammars area cost expressive power central topic study known instance deciding whether two arbitrary regular expressions describe set strings hard arbitrary context-free grammars completely impossible however still efficiently decided whether given string set expressive formalisms problem harder even undecidable turing complete formalism arbitrary formal grammars problem every nontrivial property regarding set strings describe undecidable fact known rice theorem results conciseness well instance nondeterministic state machines regular grammars concise regular expressions sense latter translated former without blowup size i.e 1 reverse possible similar considerations apply formalisms describe sets strings sets trees e.g xml schema languages graphs structures database theory concerned among things database queries e.g formulas given contents database extract certain information predominant relational database paradigm contents database described finite set finite mathematical relations boolean queries always yield true false formulated first-order logic turns first-order logic lacking expressive power express certain types boolean queries e.g queries involving transitive closure however adding expressive power must done care must still remain possible evaluate queries reasonable efficiency case e.g. second-order logic consequently literature sprang many query languages language constructs compared expressive power efficiency e.g various versions datalog similar considerations apply query languages types data e.g xml query languages xquery", + "neighbors": [ + 14, + 123, + 149, + 154, + 272, + 346, + 379, + 412, + 429, + 739, + 789, + 1096, + 1138, + 1159, + 1324, + 1368, + 1372, + 1398, + 1430, + 1503, + 1549, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 835, + "label": 3, + "text": "Chack'n_Pop:chack n pop arcade rom-set also contains unused graphics mechanical wind-up zen-chan later appeared bubble bobble home ports released sg-1000 msx famicom nec pc-6001 nec pc-8801 arcade emulation included taito legends power-up psp taito legends 2 xbox playstation 2 pc chack n small yellow creature later recolored green extendable legs must traverse series single-screen mazes capable walking floors ceilings walls climb steps traverse high walls extending legs tall enough pass onto next step capable throwing hand grenades left right short period explode cloud smoke separate fire buttons control rolling left right chack n killed caught explosion cloud screen played time limit marked mighta pushing boulder along top screen mighta reappears bubble bobble recurring enemy chack n aim reach top screen time limit expires delayed process series solid walls order get past walls must free hearts cages using hand grenades obstruction comes form monstas creatures appear bubble bobble hatching eggs hand grenades also used destroy creatures eggs producing however player get bonus points completing level destroying enemies later levels include moving platforms reminiscent bubble bobble water bottles blown flood level water water destroy anything way inhibit movement enemies allows chack n swim otherwise unreachable platforms levels completed chack n able marry girlfriend miss chack n sega sg-1000 version extended introduction ending sequences small additional training stage first chack n content chack n pop appeared bubble bobble fairyland story parasol stars puzzle bobble bubble symphony bubble memories pop n pop arkanoid ds huge silver robotic chack n also mid-boss stage 5 taito arcade shooter megablast", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 836, + "label": 9, + "text": "Metacharacter:metacharacter metacharacter character special meaning computer program shell interpreter regular expression regex engine posix extended regular expressions 14 metacharacters must escaped preceded backslash order drop special meaning treated literally inside expression opening closing square brackets backslash caret dollar sign period/full stop/dot vertical bar/pipe symbol question mark asterisk plus sign opening closing curly brackets/braces opening closing parentheses example match arithmetic expression 1+1 *3=6 regex correct regex 1\\+1\\ \\*3=6 otherwise parentheses plus sign asterisk special meanings characters may special meaning environments term escape metacharacter means make metacharacter ineffective strip special meaning causing literal meaning example pcre dot stands single character regular expression a.c match abc a3c even c however escaped lose meaning metacharacter interpreted literally causing regular expression a\\.c match string a.c usual way escape character regex elsewhere prefixing backslash environments may employ different methods like ms-dos/windows command prompt caret used instead", + "neighbors": [ + 152, + 225, + 1027, + 1304, + 1374 + ], + "mask": "Train" + }, + { + "node_id": 837, + "label": 2, + "text": "Android_version_history:android version history version history android mobile operating system began public release android beta november 5 2007 first commercial version android 1.0 released september 23 2008 android continually developed google open handset alliance seen number updates base operating system since initial release versions android 1.0 1.1 released specific code names although android 1.1 unofficially known petit four android code names confectionery-themed alphabetical order since 2009 android 1.5 cupcake recent version android android 9 pie released august 2018 development android started 2003 android inc. purchased google 2005 beta released november 5 2007 software development kit sdk released november 12 2007 november 5 date popularly celebrated android birthday public beta versions sdk released following order following tables show release dates key features android operating system updates date listed chronologically official application programming interface api levels main hardware platform android arm architecture armv7 armv8-a architectures formerly also armv5 x86 mips architectures also officially supported later versions android mips support since deprecated support removed ndk r17 unofficial android-x86 project used provide support x86 mips architectures ahead official support 2012 android devices intel processors began appear including phones tablets gaining support 64-bit platforms android first made run 64-bit x86 arm64 since android 5.0 lollipop 64-bit variants platforms supported addition 32-bit variants requirements minimum amount ram devices running android 7.1 depend screen size density type cpu ranging 816mb\u20131.8gb 64-bit 512mb\u20131.3gb 32-bit meaning practice 1gb common type display minimum android watch 416mb recommendation android 4.4 least 512 mb ram low ram devices 340 mb required minimum amount include memory dedicated various hardware components baseband processor android 4.4 requires 32-bit armv7 mips x86 architecture processor latter two unofficial ports together opengl es 2.0 compatible graphics processing unit gpu android supports opengl es 1.1 2.0 3.0 3.2 since android 7.0 vulkan version 1.1 available devices applications may explicitly require certain version opengl es suitable gpu hardware required run applications android used require autofocus camera relaxed fixed-focus camera", + "neighbors": [ + 24, + 34, + 41, + 85, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 347, + 359, + 422, + 429, + 480, + 486, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 813, + 837, + 887, + 936, + 962, + 977, + 1016, + 1061, + 1082, + 1129, + 1183, + 1185, + 1231, + 1259, + 1265, + 1276, + 1310, + 1371, + 1372, + 1395, + 1411, + 1419, + 1448, + 1480, + 1483, + 1500, + 1503, + 1507, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 838, + "label": 3, + "text": "Joint_Interoperability_of_Tactical_Command_and_Control_Systems:joint interoperability tactical command control systems joint interoperability tactical command control systems jintaccs united states military program development maintenance tactical information exchange configuration items cis operational procedures originated ensure command control c2 c3 weapons systems us military services nato forces would interoperable made standard message text formats mtf man-readable machine-processable information core set common warfighting symbols data link standards called tactical data links tdls", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 839, + "label": 7, + "text": "Kynapse:kynapse kynapse artificial intelligence middleware product developed kynogon bought autodesk 2008 called autodesk kynapse 2011 re-engineered rebranded autodesk navigation kynapse used development 80 game titles including mafia ii crackdown alone dark 5 fable ii sonic hedgehog 2006 unreal engine kynapse also used companies eads bae systems \u00e9lectricit\u00e9 de france develop military industrial simulation", + "neighbors": [ + 134, + 416, + 468, + 718, + 893, + 961, + 976, + 1159, + 1592 + ], + "mask": "Test" + }, + { + "node_id": 840, + "label": 1, + "text": "Hindu_genealogy_registers_at_Haridwar:hindu genealogy registers haridwar genealogy registers families maintained brahmin pandits priests \u2018 pandas \u2019 double professional genealogists haridwar subject study many years several cases voluminous records vahis bahi also used settling legal cases regarding inheritance property disputes records held sacrosanct pilgrims pandas many places records trace family history twenty prior generations stretching across many centuries haridwar traditionally site death rites also shraaddha amongst hindus soon also became customary family pandits priest record visit family along gotra family tree marriages members present etc. grouped according family home town centuries registers became important genealogical source many families part splintered families tracing family tree family history well especially partition india 1947 later amongst indian diaspora custom similar panjis panji prabandh extensive genealogical records maintained among maithil brahmins bihar custom well known today indians settled abroad ancient custom detailed family genealogies hindu families past several generations kept professional hindu brahmin pandits popularly known pandas hindu holy city haridwar hand written registers passed generations pandit ancestors classified according original districts villages ones ancestors special designated pandit families charge designated district registers even cases ancestral districts villages left behind pakistan partition india hindus migrate india several cases present day descendants sikhs muslims christians uncommon one find details even one past seven generations genealogy registers kept pandas haridwar centuries hindu ancestors visited holy town haridwar purpose may mostly pilgrimage purposes or/and cremation dead immersion ashes bones kin cremation waters holy river ganges required hindu religious custom ancient custom go pandit charge ones family register update family genealogical family tree details marriages births deaths ones extended joint family present day india people visiting haridwar dumbfounded pundits blue solicit come update ancestral genealogical family tree news travels like wildfire among pandits ones family designated pandit quickly notified ones visit nowadays hindu joint family system broken people preferring nuclear families record keeping pandits prefer visitors haridwar come prepared getting touch ones extended family bringing relevant details regarding ones ancestral district village names grand parents great grand parents marriages births deaths occurred extended family even much details possible families married visiting family member required personally sign family genealogical register furnished ones family panda updating future family visitors generations see authenticate updated entries friends family members accompanying visit may also requested sign witnesses starting around 1977 hindu genealogy records microfilmed later housed genealogical society utah gsu usa since 1981 places records records hindu families kurukshetra pehowa chintpurni jawalapur haridwar jawalamukhi genealogical society utah currently restricts online access hindu genealogy records members church jesus christ latter-day saints lds church others notable places shraadhs performed pitrs noted sites became customary family pandits priest record visit family along gotra family tree marriages members present etc. grouped according family home town centuries registers became important genealogical source many families part splintered families tracing family tree family history thanesar kurukshetra traditionally site death rites also shraaddha amongst hindus genealogy records also kept pitrudhak teerth pehowa banks sarasvati river kurukshetra district haryana site hindu pilgrimage pandava performed death rites mahabharata war genealogy records pilgrims also kept jawalamukhi shakti peetha town nagar parishad kangra district indian state himachal pradesh site hindu pilgrimage genealogy records also kept chintpurni village una district himachal pradesh one shakti peethas major hindu pilgrimage site genealogy records also kept ghats varanasi ganges river major site hindu pilgrimage death rites performed especially manikarnika ghat genealogy records also kept ghats ganges prayagraj long place pilgrimage hindus spawned set priests maintain genealogy records often dating back centuries trimbakeshwar shiva temple ancient hindu temple town trimbak trimbakeshwar tehsil nashik district maharashtra india 28 km city nashik 40 km nashik road dedicated god shiva one twelve jyotirlingas genealogy records also kept purohits pandas tarakeswar shiva temple maintain genealogy records pilgrims", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 841, + "label": 1, + "text": "Quicklaw:quicklaw lexisnexis quicklaw canadian electronic legal research database provides court decisions levels news reports provincial federal statutes journals legal commentary also offers case citator case digests 2002 quicklaw purchased lexisnexis subsidiary lexisnexis canada lexisnexis quicklaw used lawyers law firms canada access case law legislation exclusive current awareness services expert commentary addition research lexisnexis quicklaw service also includes citation tools help lawyers law firms validate authority cases find summaries judicial considerations along treatment pinpoint references lexisnexis quicklaw composed several products providing legal practitioners access need perform research designed practices focus particular legal segments lexisnexis quicklaw essentials provides content needed research areas westlaw/ecarswell offers similar fee-based services canlii.org non-profit organization managed federation law societies canada canlii goal make canadian law accessible free internet website provides access court judgments tribunal decisions statutes regulations canadian jurisdictions canlii part collaboration legal information institute around world include austlii bailii lii etc", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 842, + "label": 4, + "text": "Symantec_Endpoint_Protection:symantec endpoint protection symantec endpoint protection developed symantec security software suite consists anti-malware intrusion prevention firewall features server desktop computers largest market-share product endpoint security first release symantec endpoint protection published september 2007 called version 11.0 endpoint protection result merger several security software products including symantec antivirus corporate edition 10.0 client security network access control sygate enterprise edition endpoint protection also included new features example block data transfers unauthorized device types usb flash drives bluetooth devices time symantec antivirus corporate edition widely criticized become bloated unwieldy endpoint protection 11.0 intended address criticisms disk footprint symantec corporate edition 10.0 almost 100 mb whereas endpoint protection projected 21 mb 2009 symantec introduced managed service whereby symantec staff deploy manage symantec endpoint protection installations remotely small business edition faster installation process released 2010 february 2011 symantec announced version 12.0 endpoint protection version 12 incorporated cloud-based database malicious files called symantec insight insight intended combat malware generates mutations files avoid detection signature-based anti-malware software late 2012 symantec released version 12.1.2 supports vmware vshield cloud version endpoint protection released september 2016 followed version 14 november version 14 incorporates machine learning technology find patterns digital data may indicative presence cyber-security threat also incorporates memory exploit mitigation performance improvements symantec endpoint protection security software suite includes intrusion prevention firewall anti-malware features according sc magazine endpoint protection also features typical data loss prevention software typically installed server running windows linux macos 2018 version 14 currently-supported release endpoint protection scans computers security threats used prevent unapproved programs running apply firewall policies block allow network traffic attempts identify block malicious traffic corporate network coming web browser uses aggregate information users identify malicious software 2016 symantec claims use data 175 million devices installed endpoint security 175 countries endpoint protection administrative console allows department modify security policies department programs files exclude antivirus scans manage mobile devices directly treats peripherals connected computer protects computer malicious software mobile device early 2012 source code symantec endpoint protection stolen published online hacker group called lords dharmaraja claimed credit alleging source code stolen indian military intelligence indian government requires vendors submit source code computer program sold government ensure used espionage july 2012 update endpoint protection caused compatibility issues triggering blue screen death windows xp machines running certain third-party file system drivers 2014 offensive security discovered exploit symantec endpoint protection penetration test financial services organization exploit application device control driver allowed logged-in user get system access patched august according gartner symantec endpoint protection 14 one comprehensive endpoint security products available regularly scores well independent tests however common criticism customers fatigued near constant changes product company direction sc magazine said enpoint protection 14 comprehensive tool type superb installation documentation review said endpoint protection no-brainer setup administration wart support fees bit steep forrester said version 12.1 complete endpoint security software product market different security functions software well-integrated report speculated lack integration would addressed version 14 network world ranked symantec endpoint protection sixth endpoint security products based data nss labs testing", + "neighbors": [ + 17, + 43, + 94, + 120, + 134, + 189, + 358, + 476, + 569, + 648, + 656, + 685, + 717, + 910, + 938, + 944, + 965, + 1015, + 1038, + 1101, + 1138, + 1239, + 1250, + 1257, + 1291, + 1350, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 843, + "label": 9, + "text": "Atari_BASIC:atari basic atari basic interpreter basic programming language shipped atari 8-bit family 6502-based home computers unlike basics home computer era atari basic derivative microsoft basic differs significant ways includes keywords atari-specific features lacks support string arrays example language originally 8 kb rom cartridge first machines 8-bit series 400 800 1200xl starting 600xl 800xl basic built-in machines disabled holding codice_1 key booting xegs disables basic powered without keyboard attached complete annotated source code design specifications atari basic published atari basic source book 1983 machines would become atari 8-bit family originally developed second-generation video game consoles intended replace atari 2600 ray kassar new president atari decided challenge apple computer building home computer instead meant designs among changes needed support basic programming language standard language home computers 1978 atari purchased source code mos 6502 version microsoft 8k basic original 8k basic referred memory footprint compiled intel 8080 instruction set lower code density 6502 expanded code 9 kb slightly larger natural 8 kb size atari rom cartridges atari felt also needed expand language add better support specific hardware features computers similar apple done applesoft basic increased size 9 kb around 11 kb paring code 11 8 kb fit rom turned significant problem adding problem fact 6502 code supplied microsoft undocumented six months later almost ready shippable version interpreter however atari facing january 1979 deadline consumer electronics show ces machines would demonstrated decided ask help get version basic ready time show september 1978 shepardson microsystems bid completing basic shepardson written number programs apple ii family used 6502 processor middle finishing new basic cromemco s-100 bus machines cromemco 32k structured basic shepardson examined existing work decided difficult continue cutting size instead recommended developing completely new version originally 10k size make fit 8k rom common routines would moved operating system roms atari accepted proposal specifications finalized october 1978 paul laughton kathleen o'brien began work new language contract specified delivery date 6 april 1979 also included file manager system later known dos 1.0 atari plans take early 8k version microsoft basic 1979 ces switch new atari basic production development proceeded quickly helped bonus clause contract 8k cartridge available release machines atari took version ces instead ms version atari microsoft basic later became available separate product version shepardson gave atari ces demo supposed final version time delivered demo final delivery weeks later shepardson found several bugs code developed fixes however unknown shepardson atari already sent ces version manufacturing version later known revision among several problems version contains major bug subroutine copies memory deleting lines code exactly 256 bytes long causes lockup sometimes known two-line lockup trigger next line code command entered notorious one problems could fixed pressing key revision b attempted fix major bugs revision released 1983 built-in rom 600xl 800xl models fixing memory copying bug programmer noticed pattern code section inserting lines applied fix fix instead introduced original bug code inserting new lines much common deleting old ones change dramatically increased number crashes another major problem revision b bug added 16 bytes memory program every time codice_2d codice_3ed eventually causing machine run memory even smallest programs mapping atari described awesome bugs advised revision b owners n't fool around get new rom available cartridge atari book provided type-in program patch revision b revision c without cartridge revision c finally eliminated memory leaks revision b version built-in later versions 800xls xe computers xegs revision c also available cartridge production run version determined typing codice_4 ready prompt result codice_5 revision codice_6 revision b codice_7 revision c. atari basic uses line editor like home computer basics unlike basics atari basic scans just-entered program line reports errors immediately error found editor re-displays line highlighting text near error inverse video errors displayed numeric codes descriptions printed manual program lines entered starting line number insert new line amend existing one lines without line number executed immediately programmer types codice_8 program executes lowest line number atari basic allows commands executed modes instance codice_9 command used inside program list statement used display either entire basic program section program lines specifying starting ending line separated comma used output program listing printer program lines logical lines three screen lines physical lines 40 characters 120 characters total cursor moved freely lines unlike basics cursor moved left right editor os handles tracking whether physical line flowed next logical line moving cursor could move within logical lines automatically pressing sends tokenizer logical line cursor sits example pictured codice_10 author needs fix error move cursor codice_11 type editor overwrite mode hit common editing technique say renumbering lines atari basic built-in renumbering command one quickly learn overwrite numbers set lines hit repeatedly put back program atari basic uses token structure handle lexical processing better performance reduced memory size contrast ms-derived basics perform tokenization line-by-line basis program runs atari basic occurs user hits immediate syntax checking described program editing section side effect converting line tokenized form stored shepardson referred early-tokenizing concept pre-compiling interpreter tokenizer converts lines using small buffer memory program stored parse tree token output buffer addressed pointer lomem \u2013 80 81 256 bytes tokenized statement larger buffer generates error 14 \u2013 line long output tokenizer moved permanent storage various locations memory set pointers addresses indicates locations variables stored variable name table pointed vntp \u2013 82 83 values stored variable value table pointed vvtp \u2013 86 87 indirecting variable names way reference variable needs two bytes address entry appropriate table strings area pointed starp \u2013 8c 8d runtime stack pointed runstk \u2013 8e 8f used store line numbers looping statements codice_12 subroutines codice_13 finally end basic memory usage indicated address stored memtop \u2013 90 91 pointer atari basic uses unique way recognize abbreviated reserved words keyword abbreviated using period point writing codice_14 expanded codice_9 codice_16 expand abbreviation tokenizer searches list reserved words find first matches portion supplied commonly used commands occur first list reserved words codice_17 beginning typed codice_18 program later codice_9ed always write full words three exceptions codice_20 synonym codice_21 codice_22 synonym codice_23 codice_24 synonym empty string mean thing separate tokens remain program listing keywords communicating peripherals see input/output section codice_25 codice_26 codice_27 actually part tokenized keyword separate symbol example codice_20 codice_29 thing presented differently atari basic includes 12 functions mathematical trigonometric calculations tan function included may derived via exp function deg rad used set whether trigonometric functions use radians degrees radians default rnd function generates number 0 1 parameter function used number derived via pokey random number register address d20a atari basic differs considerably microsoft-style basics way handles strings microsoft basic mostly copied string-handling system dec basic-plus strings first-class types variable bounds allows string variables well arrays strings represented internally computer word pointing storage heap contrast atari basic copied string-handling system hewlett-packard basic basic data type single character strings arrays characters side-effect design true string arrays string variable must dimensioned used example program 20 character string reserved characters excess string length truncated maximum possible length string atari basic 32,768 characters ms basic included function accessing bits strings instance codice_30 would return leftmost 10 characters codice_31 atari basic string represented array access using array indexing functions equivalent statement atari basic would codice_32 note arrays 1-indexed 0-indexed modern variations slicing syntax two-dimensional arrays basics way define work arrays strings atari basic initialize array variables string array may contain whatever random data present memory allocated following trick allows fast string initialization also useful clearing large areas memory unwanted garbage numeric arrays cleared slow ... next loop string concatenation atari basic works following example target string must large enough hold combined string error result input statement used prompt array variables latter must filled indirectly via statement like 20 input b 1 =a array variables atari basic also may contain two subscripts strings included data statements enclosed quote marks atari basic result also possible data items contain comma read statement also used array variables arrays base index 0 statement dim 10 actually creates 11-element array elements 0-10 atari os includes subsystem peripheral device input/output i/o known cio central input/output programs written independently device might use conform common interface rare home computers time new device drivers could written fairly easily would automatically available atari basic program using atari os existing drivers could supplanted augmented new ones replacement example could displace one rom provide 80-column display piggyback generate checksum whenever line returned used verify type-in program listing atari basic supports cio access reserved words routines os graphics fill draw available specific basic keywords line drawing supported command providing area fill fill feature used general cio entry point called using basic command basic statement prepares device i/o access means ensure channel 1 free call driver prepare device set cassette tape spools onto tension advance heads keeping cassette tape player paused means read codes write read-and-write third number auxiliary information set 0 needed name device filename filename ignored cassette driver physical devices numbers mainly disks printers serial devices might plotter daisy-wheel printer may one disk drive present 1 assumed lprint statement used output strings printer atari basic include equivalent microsoft basic get inkey commands detect keypress simulated either pokeing keyboard driver directly opening file e.g open 1,4,0 k get 1 although latter wait keypress unlike get inkey typing codice_33 basic exit atari dos command menu unsaved programs lost command display disk directory within basic must done exiting dos dos occupies roughly 5k memory thus cassette-based atari machine 48k greater around 37,000 bytes free basic program memory 32,000 bytes dos present basic use extra ram xl xe machines atari basic built-in support sound via statement graphics joysticks paddles n't supplied command fill arbitrary shape pixels limited operating system function exists called command also commands drawing lines graphics primitives combination plot drawto statements used draw lines dedicated command clearing screen atari basic usually done prints clear screen control code analogous commodore basic atari basic include tab function simulated either pokeing cursor column position 55 tab position c9 default value 10 changed values take effect print statement executed also spc function atari basic advanced aspects hardware player/missile graphics sprites redefined character sets setting color palette/luminance tables scrolling custom graphics modes supported basic require machine language routines peek/poke statements graphics modes accessed basic atari 400/800 os roms support way access machine language setting antic registers display list manually os roms xl/xe added support modes bitmap modes basic normally set text window occupying last three rows bottom screen user may display prompts enter data program 16 added mode number invoked via graphics statement entire screen bitmap mode e.g graphics 8+16 bitmap mode full screen invoked atari basic automatically switch back text mode program execution terminated unlike many basics leave user bitmap mode unreadable screen switched via typing blind command resetting computer bitmap coordinates calculated range 1 maximum row/column minus one thus mode 6 160x192 maximum coordinates pixel 159 191 user goes allowed coordinates mode basic exit error unlike ms-derived basics atari basic allows numeric variables expressions used supply line numbers codice_22 codice_35 commands used clarify code instance subroutine clears screen could written codice_36 much easier understand typical codice_37 particular subroutine executed frequently placing line number variable also improve execution speed faster basic look constant variable instead processing time statement executed basics era allow codice_9 command send source code printer device atari basic also includes codice_39 command reads source code device merges back program user typed allows programs saved sections reading using codice_39 merge replace existing code carefully using blocks line numbers overlap programmers build libraries subroutines merge new programs needed atari basic call machine code subroutines machine code generally stored strings anywhere memory code needs position independent 256-byte page 6 area starting address 1536 600 used basic operating system code loaded page 6 reading codice_41 statements machine code invoked codice_42 function first parameter address machine code routine following values parameters example machine language code stored string named codice_43 called parameters parameters pushed onto hardware stack 16-bit integers order specified codice_42 function low byte high byte order last value pushed stack byte indicating number arguments machine language code must remove values returning via codice_45 instruction value returned basic program placing addresses 212 213 d4 d5 16-bit integer running original hardware atari basic slower home computer basics often large amount two widely used benchmarks era byte magazine sieve eratosthenes creative computing benchmark test written david h. ahl atari much slower apple ii even sinclair zx81 finishing near end list terms performance despite atari cpu running 1.79 mhz twice speed 6502-based computers language slowness stemmed two problems first numeric values basic stored floating-point binary coded decimal bcd format includes numbers integers like line numbers array indexes every time number encountered interpreter convert bcd format internal binary representation using routines operating system floating point math routines atari slow notably bcd binary conversion function affected programs byte benchmark constant conversion array indexes greatly slows program ahl benchmark single exponent operation loops poorly optimized multiplication function responsible much machine poor showing second problem due atari basic implemented loops branches perform branch codice_22 codice_35 interpreter searches entire program matching line number needs atari already slowed need convert numbers binary however serious problem case codice_48 ... codice_49 loop interpreters would push pointer location codice_48 stack reached codice_49 could easily return codice_48 atari basic location memory placed stack line number meant every time codice_49 encountered system search entire program find line loops atari basic program cause large loss performance relative basics several basics atari addressed issues resulting large performance gains basic xl reduced time byte benchmark 194 58 seconds three times fast accomplished caching location codice_54 loops basics cache also used codice_22 codice_35 improvements turbo-basic xl included similar caching well re-written high-performance floating-point library ahl benchmark atari basic required 405 seconds exactly code turbo basic took 41.6 seconds", + "neighbors": [ + 0, + 8, + 236, + 273, + 510, + 606, + 670, + 799, + 810, + 812, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1306, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 844, + "label": 4, + "text": "HTTP_response_splitting:http response splitting http response splitting form web application vulnerability resulting failure application environment properly sanitize input values used perform cross-site scripting attacks cross-user defacement web cache poisoning similar exploits attack consists making server print carriage return cr ascii 0x0d line feed lf ascii 0x0a sequence followed content supplied attacker header section response typically including input fields sent application per http standard rfc 2616 headers separated one crlf response headers separated body two therefore failure remove crs lfs allows attacker set arbitrary headers take control body break response two separate responses\u2014hence name generic solution url-encode strings inclusion http headers location set-cookie typical examples sanitization include casting integers aggressive regular expression replacement although response splitting specific php php interpreter contains protection attack since version 4.4.2 5.1.2", + "neighbors": [ + 14, + 684, + 800, + 1026, + 1235 + ], + "mask": "Test" + }, + { + "node_id": 845, + "label": 1, + "text": "Dark_data:dark data dark data data acquired various computer network operations used manner derive insights decision making ability organisation collect data exceed throughput analyse data cases organisation may even aware data collected ibm estimate roughly 90 percent data generated sensors analog-to-digital conversions never get used industrial context dark data include information gathered sensors telematics organizations retain dark data multitude reasons estimated companies analyzing 1 data often stored regulatory compliance record keeping organizations believe dark data could useful future acquired better analytic business intelligence technology process information storage inexpensive storing data easy however storing securing data usually entails greater expenses even risk potential return profit lot dark data unstructured means information formats may difficult categorise read computer thus analysed often reason business analyse dark data amount resources would take difficulty data analysed according computer weekly 60 organisations believe business intelligence reporting capability inadequate 65 say somewhat disorganised content management approaches useful data may become dark data becomes irrelevant processed fast enough called perishable insights live flowing data example geolocation customer known business business make offer based location however data processed immediately may irrelevant future according ibm 60 percent data loses value immediately analysing data immediately letting go 'dark lead significant losses organisation terms identifying fraud example fast enough addressing issue late according new york times 90 energy used data centres wasted data stored energy costs could saved furthermore costs associated underutilisation information thus missed opportunities according datamation storage environments emea organizations consist 54 percent dark data 32 percent redundant obsolete trivial data 14 percent business-critical data 2020 add 891 billion storage management costs otherwise avoided continuous storage dark data put organisation risk especially data sensitive case breach result serious repercussions financial legal seriously hurt organisation reputation example breach private records customers could result stealing sensitive information could result identity theft another example could breach company sensitive information example relating research development risks mitigated assessing auditing whether data useful organisation employing strong encryption security finally determined discarded discarded way becomes unretrievable generally considered advanced computing systems analysis data built higher value dark data noted data analytics foundation modern industrial revolution course includes data currently considered dark data since enough resources process data collected used future bring maximum productivity ability organisations meet consumers demand technology advancements helping leverage dark data affordably thanks young innovative companies datumize veritas lucidworks furthermore many organisations realise value dark data right example healthcare education organisations deal large amounts data could create significant potential service students patients manner consumer financial services pursue target population", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 846, + "label": 3, + "text": "Instruction-level_parallelism:instruction-level parallelism instruction-level parallelism ilp measure many instructions computer program executed simultaneously two approaches instruction level parallelism hardware level works upon dynamic parallelism whereas software level works static parallelism dynamic parallelism means processor decides run time instructions execute parallel whereas static parallelism means compiler decides instructions execute parallel pentium processor works dynamic sequence parallel execution itanium processor works static level parallelism consider following program operation 3 depends results operations 1 2 calculated completed however operations 1 2 depend operation calculated simultaneously assume operation completed one unit time three instructions completed total two units time giving ilp 3/2 goal compiler processor designers identify take advantage much ilp possible ordinary programs typically written sequential execution model instructions execute one order specified programmer ilp allows compiler processor overlap execution multiple instructions even change order instructions executed much ilp exists programs application specific certain fields graphics scientific computing amount large however workloads cryptography may exhibit much less parallelism micro-architectural techniques used exploit ilp include known ilp exploited compiler hardware support compiler also provides inherent implicit ilp programs hardware compilation optimization optimization techniques extracting available ilp programs would include scheduling register allocation/renaming memory access optimization dataflow architectures another class architectures ilp explicitly specified recent example see trips architecture recent years ilp techniques used provide performance improvements spite growing disparity processor operating frequencies memory access times early ilp designs ibm system/360 model 91 used ilp techniques overcome limitations imposed relatively small register file presently cache miss penalty main memory costs several hundreds cpu cycles principle possible use ilp tolerate even memory latencies associated resource power dissipation costs disproportionate moreover complexity often latency underlying hardware structures results reduced operating frequency reducing benefits hence aforementioned techniques prove inadequate keep cpu stalling off-chip data instead industry heading towards exploiting higher levels parallelism exploited techniques multiprocessing multithreading", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 280, + 292, + 300, + 314, + 331, + 335, + 340, + 352, + 362, + 375, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 611, + 643, + 659, + 719, + 737, + 752, + 776, + 803, + 821, + 847, + 876, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1099, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1414, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 847, + "label": 7, + "text": "Grid_computing:grid computing grid computing use widely distributed computer resources reach common goal computing grid thought distributed system non-interactive workloads involve large number files grid computing distinguished conventional high-performance computing systems cluster computing grid computers node set perform different task/application grid computers also tend heterogeneous geographically dispersed thus physically coupled cluster computers although single grid dedicated particular application commonly grid used variety purposes grids often constructed general-purpose grid middleware software libraries grid sizes quite large grids form distributed computing whereby super virtual computer composed many networked loosely coupled computers acting together perform large tasks certain applications distributed grid computing seen special type parallel computing relies complete computers onboard cpus storage power supplies network interfaces etc connected computer network private public conventional network interface ethernet contrast traditional notion supercomputer many processors connected local high-speed computer bus grid computing combines computers multiple administrative domains reach common goal solve single task may disappear quickly size grid may vary small\u2014confined network computer workstations within corporation example\u2014to large public collaborations across many companies networks notion confined grid may also known intra-nodes cooperation whereas notion larger wider grid may thus refer inter-nodes cooperation grids form distributed computing whereby \u201c super virtual computer \u201d composed many networked loosely coupled computers acting together perform large tasks technology applied computationally intensive scientific mathematical academic problems volunteer computing used commercial enterprises diverse applications drug discovery economic forecasting seismic analysis back office data processing support e-commerce web services coordinating applications grids complex task especially coordinating flow information across distributed computing resources grid workflow systems developed specialized form workflow management system designed specifically compose execute series computational data manipulation steps workflow grid context \u201c distributed \u201d \u201c grid \u201d computing general special type parallel computing relies complete computers onboard cpus storage power supplies network interfaces etc connected network private public internet conventional network interface producing commodity hardware compared lower efficiency designing constructing small number custom supercomputers primary performance disadvantage various processors local storage areas high-speed connections arrangement thus well-suited applications multiple parallel computations take place independently without need communicate intermediate results processors high-end scalability geographically dispersed grids generally favorable due low need connectivity nodes relative capacity public internet also differences programming mc costly difficult write programs run environment supercomputer may custom operating system require program address concurrency issues problem adequately parallelized \u201c thin \u201d layer \u201c grid \u201d infrastructure allow conventional standalone programs given different part problem run multiple machines makes possible write debug single conventional machine eliminates complications due multiple instances program running shared memory storage space time one feature distributed grids formed computing resources belonging one multiple individuals organizations known multiple administrative domains facilitate commercial transactions utility computing make easier assemble volunteer computing networks one disadvantage feature computers actually performing calculations might entirely trustworthy designers system must thus introduce measures prevent malfunctions malicious participants producing false misleading erroneous results using system attack vector often involves assigning work randomly different nodes presumably different owners checking least two different nodes report answer given work unit discrepancies would identify malfunctioning malicious nodes however due lack central control hardware way guarantee nodes drop network random times nodes like laptops dial-up internet customers may also available computation network communications unpredictable periods variations accommodated assigning large work units thus reducing need continuous network connectivity reassigning work units given node fails report results expected time another set could termed social compatibility issues early days grid computing related goals grid developers carry innovation beyond original field high-performance computing across disciplinary boundaries new fields like high-energy physics impacts trust availability performance development difficulty influence choice whether deploy onto dedicated cluster idle machines internal developing organization open external network volunteers contractors many cases participating nodes must trust central system abuse access granted interfering operation programs mangling stored information transmitting private data creating new security holes systems employ measures reduce amount trust \u201c client \u201d nodes must place central system placing applications virtual machines public systems crossing administrative domains including different departments organization often result need run heterogeneous systems using different operating systems hardware architectures many languages trade-off investment software development number platforms supported thus size resulting network cross-platform languages reduce need make tradeoff though potentially expense high performance given node due run-time interpretation lack optimization particular platform various middleware projects created generic infrastructure allow diverse scientific commercial projects harness particular associated grid purpose setting new grids boinc common one various academic projects seeking public volunteers listed end article fact middleware seen layer hardware software top middleware number technical areas considered may may middleware independent example areas include sla management trust security virtual organization management license management portals data management technical areas may taken care commercial solution though cutting edge area often found within specific research projects examining field segmentation grid computing market two perspectives need considered provider side user side overall grid market comprises several specific markets grid middleware market market grid-enabled applications utility computing market software-as-a-service saas market grid middleware specific software product enables sharing heterogeneous resources virtual organizations installed integrated existing infrastructure involved company companies provides special layer placed among heterogeneous infrastructure specific user applications major grid middlewares globus toolkit glite unicore utility computing referred provision grid computing applications service either open grid utility hosting solution one organization vo major players utility computing market sun microsystems ibm hp grid-enabled applications specific software applications utilize grid infrastructure made possible use grid middleware pointed software service saas \u201c software owned delivered managed remotely one providers. \u201d gartner 2007 additionally saas applications based single set common code data definitions consumed one-to-many model saas uses pay go payg model subscription model based usage providers saas necessarily computing resources required run saas therefore saas providers may draw upon utility computing market utility computing market provides computing resources saas providers companies demand user side grid computing market different segments significant implications deployment strategy deployment strategy well type investments made relevant aspects potential grid users play important role grid adoption cpu-scavenging cycle-scavenging shared computing creates \u201c grid \u201d idle resources network participants whether worldwide internal organization typically technique exploits 'spare instruction cycles resulting intermittent inactivity typically occurs night lunch breaks even comparably miniscule though numerous moments idle waiting modern desktop cpu experience throughout day computer waiting io user network storage practice participating computers also donate supporting amount disk storage space ram network bandwidth addition raw cpu power many volunteer computing projects boinc use cpu scavenging model since nodes likely go offline time time owners use resources primary purpose model must designed handle contingencies creating opportunistic environment another implementation cpu-scavenging special workload management system harvests idle desktop computers compute-intensive jobs also refers enterprise desktop grid edg instance htcondor open-source high-throughput computing software framework coarse-grained distributed rationalization computationally intensive tasks configured use desktop machines keyboard mouse idle effectively harness wasted cpu power otherwise idle desktop workstations like full-featured batch systems htcondor provides job queueing mechanism scheduling policy priority scheme resource monitoring resource management used manage workload dedicated cluster computers well seamlessly integrate dedicated resources rack-mounted clusters non-dedicated desktop machines cycle scavenging one computing environment term grid computing originated early 1990s metaphor making computer power easy access electric power grid power grid metaphor accessible computing quickly became canonical ian foster carl kesselman published seminal work grid blueprint new computing infrastructure 1999 preceded decades metaphor utility computing 1961 computing public utility analogous phone system cpu scavenging volunteer computing popularized beginning 1997 distributed.net later 1999 seti home harness power networked pcs worldwide order solve cpu-intensive research problems ideas grid including distributed computing object-oriented programming web services brought together ian foster steve tuecke university chicago carl kesselman university southern california information sciences institute trio led effort create globus toolkit widely regarded fathers grid toolkit incorporates computation management also storage management security provisioning data movement monitoring toolkit developing additional services based infrastructure including agreement negotiation notification mechanisms trigger services information aggregation globus toolkit remains de facto standard building grid solutions number tools built answer subset services needed create enterprise global grid 2007 term cloud computing came popularity conceptually similar canonical foster definition grid computing terms computing resources consumed electricity power grid earlier utility computing indeed grid computing often always associated delivery cloud computing systems exemplified applogic system 3tera november 2006 seidel received sidney fernbach award supercomputing conference tampa florida outstanding contributions development software hpc grid computing enable collaborative numerical investigation complex problems physics particular modeling black hole collisions award one highest honors computing awarded achievements numerical relativity also march 2019 bitcoin network measured computing power equivalent 80,000,000 pflops floating-point operations per second measurement reflects number flops required equal hash output bitcoin network rather capacity general floating-point arithmetic operations since elements bitcoin network perform specific cryptographic hash computation required bitcoin protocol grid computing offers way solve grand challenge problems protein folding financial modeling earthquake simulation climate/weather modeling grids offer way using information technology resources optimally inside organization also provide means offering information technology utility commercial noncommercial clients clients paying use electricity water october 2016 4 million machines running open-source berkeley open infrastructure network computing boinc platform members world community grid one projects using boinc seti home using 400,000 computers achieve 0.828 tflops october 2016 october 2016 folding home part boinc achieved 101 x86-equivalent petaflops 110,000 machines european union funded projects framework programmes european commission beingrid business experiments grid research project funded european commission integrated project sixth framework programme fp6 sponsorship program started june 1 2006 project ran 42 months november 2009 project coordinated atos origin according project fact sheet mission \u201c establish effective routes foster adoption grid computing across eu stimulate research innovative business models using grid technologies \u201d extract best practice common themes experimental implementations two groups consultants analyzing series pilots one technical one business project significant long duration also budget 24.8 million euros largest fp6 integrated project 15.7 million provided european commission remainder 98 contributing partner companies since end project results beingrid taken carried forward it-tude.com enabling grids e-science project based european union included sites asia united states follow-up project european datagrid edg evolved european grid infrastructure along lhc computing grid lcg developed support experiments using cern large hadron collider list active sites participating within lcg found online real time monitoring egee infrastructure relevant software documentation also publicly accessible speculation dedicated fiber optic links installed cern address lcg data-intensive needs may one day available home users thereby providing internet services speeds 10,000 times faster traditional broadband connection european grid infrastructure also used research activities experiments simulation oncological clinical trials distributed.net project started 1997 nasa advanced supercomputing facility nas ran genetic algorithms using condor cycle scavenger running 350 sun microsystems sgi workstations 2001 united devices operated united devices cancer research project based grid mp product cycle-scavenges volunteer pcs connected internet project ran 3.1 million machines close 2007 today many definitions grid computing", + "neighbors": [ + 25, + 51, + 68, + 77, + 85, + 86, + 90, + 123, + 175, + 221, + 227, + 274, + 280, + 300, + 314, + 340, + 354, + 362, + 375, + 390, + 399, + 465, + 481, + 507, + 611, + 719, + 737, + 755, + 760, + 796, + 802, + 846, + 847, + 876, + 909, + 937, + 968, + 1013, + 1081, + 1099, + 1131, + 1159, + 1219, + 1220, + 1274, + 1354, + 1398, + 1416, + 1421, + 1507, + 1599, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 848, + "label": 1, + "text": "Leuven_Database_of_Ancient_Books:leuven database ancient books leuven database ancient books ldab resource ancient written literary manuscripts 500 bc ad 800 currently lists 16.000 greek latin coptic syriac demotic literary texts attempts collect basic information ancient literary texts includes authors homer gregory great 3.600 texts unidentified authors founded 1998 ku leuven willy clarysse", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 849, + "label": 4, + "text": "Session_border_controller:session border controller session border controller sbc network element deployed protect sip based voice internet protocol voip networks early deployments sbcs focused borders two service provider networks peering environment role expanded include significant deployments service provider access network backbone network provide service residential and/or enterprise customers term session refers communication two parties \u2013 context telephony would call call consists one call signaling message exchanges control call one call media streams carry call audio video data along information call statistics quality together streams make session job session border controller exert influence data flows sessions term border refers point demarcation one part network another simple example edge corporate network firewall demarcates local network inside corporation rest internet outside corporation complex example large corporation different departments security needs location perhaps kind data case filtering routers network elements used control flow data streams job session border controller assist policy administrators managing flow session data across borders term controller refers influence session border controllers data streams comprise sessions traverse borders one part network another additionally session border controllers often provide measurement access control data conversion facilities calls control sbcs commonly maintain full session state offer following functions advent webrtc sbcs also assumed role sip webrtc gateway translate sip one signalling protocol mandated webrtc specifications sip websockets rfc 7118 often used partially due applicability sip envisaged communication scenarios well availability open source software jssip case sbc acts gateway webrtc applications sip end points sbcs inserted signaling and/or media paths calling called parties voip call predominantly using session initiation protocol sip h.323 mgcp call-signaling protocols many cases sbc hides network topology protects service provider enterprise packet networks sbc terminates inbound call initiates second call leg destination party technical terms used sip protocol defines back-to-back user agent b2bua effect behavior signaling traffic also media traffic voice video controlled sbc cases sbc capability provide media services sbcs also able redirect media traffic different element elsewhere network recording generation music-on-hold media-related purposes conversely without sbc media traffic travels directly endpoints without in-network call signaling elements control path cases sbc simply modifies stream call control signaling data involved call perhaps limiting kinds calls conducted changing codec choices ultimately sbcs allow network operators manage calls made networks fix change protocols protocol syntax achieve interoperability also overcome problems firewalls network address translators nats present voip calls show operation sbc one compare simple call establishment sequence call establishment sequence sbc simplest session establishment sequence one proxy user agents proxy \u2019 task identify callee \u2019 location forward request proxy also adds via header address indicate path response traverse proxy change dialog identification information present message tag header call-id cseq proxies also alter information sip message bodies note session initiation phase user agents exchange sip messages sdp bodies include addresses agents expect media traffic successfully finishing session initiation phase user agents exchange media traffic directly without involvement proxy sbcs designed many applications used operators enterprises achieve variety goals even sbc implementation might act differently depending configuration use case hence easily possible describe exact sbc behavior would apply sbc implementations general possible identify certain features common sbcs example sbcs implemented back-to-back user agent b2bua proxy-like server splits sip transaction two call legs side facing user agent client uac acts server side facing user agent server uas acts client proxy usually keeps state information related active transactions b2buas keep state information active dialogs e.g. calls proxy receives sip request save state information transaction e.g. receiving response state information soon deleted b2bua maintain state information active calls delete information call terminated sbc included call path sbc acts b2bua behaves user agent server towards caller user agent client towards callee sense sbc actually terminates call generated caller starts new call towards callee invite message sent sbc contains longer clear reference caller invite sent sbc proxy includes via contact headers point sbc caller sbcs often also manipulate dialog identification information listed call-id tag case sbc configured also control media traffic sbc also changes media addressing information included c lines sdp body thereby sip messages traverse sbc also audio video packets invite sent sbc establishes new dialog sbc also manipulates message sequence number cseq well max-forwards value note list header manipulations listed subset possible changes sbc might introduce sip message furthermore sbcs might listed manipulations sbc expected control media traffic might need change anything sdp header sbcs change dialog identification information others might even change addressing information sbcs often used corporations along firewalls intrusion prevention systems ips enable voip calls protected enterprise network voip service providers use sbcs allow use voip protocols private networks internet connections using nat also implement strong security measures necessary maintain high quality service sbcs also replace function application-level gateways larger enterprises sbcs also used conjunction sip trunks provide call control make routing/policy decisions calls routed lan/wan often tremendous cost savings associated routing traffic internal ip networks enterprise rather routing calls traditional circuit-switched phone network additionally sbcs allow voip calls set two phones using different voip signaling protocols e.g. sip h.323 megaco/mgcp well performing transcoding media stream different codecs use sbcs also provide firewall features voip traffic denial service protection call filtering bandwidth management protocol normalization header manipulation also commonly provided sbcs enabling communication different vendors networks ip multimedia subsystem ims 3gpp 3rd generation partnership project architecture perspective sbc integration p-cscf ims-alg signaling plane ims access gateway media plane access side interconnect side sbc maps ibcf iwf signaling plane trgw transition gateway media plane ims/tispan architecture perspective sbc integration p-cscf c-bgf functions access side ibcf iwf thig i-bgf functions peering side sbcs decomposed meaning signaling functions located separate hardware platform media relay functions \u2013 words p-cscf separated c-bgf ibcf/iwf separated i-bgf functions physically standards-based protocol h.248 ia profile used signaling platform control media one sbcs use proprietary protocols infancy concept sbc controversial proponents end-to-end systems peer-to-peer networking controversy surrounding sbcs pertains whether call control remain solely two endpoints call service owners rather shared network elements owned organizations managing various networks involved connecting two call endpoints example call control remain alice bob two callers call control shared operators ip networks involved connecting alice bob voip phones together debate point vigorous almost religious nature wanted unfettered control endpoints also greatly frustrated various realities modern networks firewalls filtering/throttling side network operators typically concerned overall network performance interoperability quality want ensure secure sbc may provide session media usually rtp signaling often sip wiretap services used providers enforce requests lawful interception network sessions standards interception services provided atis tia cablelabs etsi among others according jonathan rosenberg author rfc 3261 sip numerous related rfcs dynamicsoft developed first working sbc conjunction aravox product never truly gained marketshare newport networks first ipo london stock exchange aim may 2004 nng cisco publicly traded since 1990 acme packet followed october 2006 floating nasdaq field narrowed acquisition nextone merged reefpoint becoming nextpoint subsequently acquired 2008 genband time emerged \u201c integrated \u201d sbc border control function integrated another edge device 2009 ingate systems \u2019 firewall became first sbc earn certification icsa labs milestone certifying voip security capabilities sbc continuing growth voip networks pushes sbcs edge mandating adaptation capacity complexity voip network grows traffic volume increases sessions passing sbc vendors addressing new scale requirements variety ways developed separate load balancing systems sit front sbc clusters others developed new architectures using latest generation chipsets offering higher performance sbcs scalability using service cards", + "neighbors": [ + 149, + 363, + 542, + 552, + 1448 + ], + "mask": "Test" + }, + { + "node_id": 850, + "label": 1, + "text": "Architectuul:architectuul architectuul online architecture catalog uses crowdsourcing build content founded 2010 team architects graphic designers software engineers content images uploaded site use creative commons license making process similar wikipedia architectuul buildings various era large range 20th century rare constructivist architecture architectuul utilised source several publications universities including wall street journal", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 851, + "label": 7, + "text": "CISPE_-_Cloud_Infrastructure_Services_Providers_in_Europe:cispe cloud infrastructure services providers europe cispe cloud infrastructure services providers europe trade association gathering infrastructure service iaas cloud providers express views european scale cispe non profit organisation registered belgium declared european union transparency register 041495920038-44 association started since iaas players difficulties make business model understood policy makers association aims advocate eu wide cloud first public procurement policy engage european digital single market including promotion high level security data protection rules/standards well avoiding vendor lock-in although association formally registered early 2017 operating since 2015 order help iaas providers customers reach compliance coming eu general data protection regulation gdpr enter force 25 may 2018 cispe released cispe data protection code conduct top required compliance meet gdpr code also ensures iaas customers may choose data located processed exclusively europe supplier re-use customer data compliance declared cisps/iaas providers service service cispe code conduct launched 27 september 2016 european parliament first 30 services declared first cisps/iaas providers 14 february 2017 announcements received large press coverage across europe including le monde infodsi el pais la repubblica silicon cloud magazine computer sweden tom hardware l'informaticien global security mag eu observer politico computer weekly iapp il corriere della sicurezza lemagit bloomberg tv itr manager heise.de cor.com zdnet eleconomista.es channel europapress 01net register cio dive many others members supportive organizations manage operations 15 european countries including france germany italy ireland uk finland sweden netherlands spain bulgaria poland switzerland companies members cispe and/or supporting code conduct includes arsys art automation aruba aws bit dada daticum dominion enter fasthosts fjordit gigas hetzner online home host europe group ids ikoula leaseweb lomaco netalia netcetera outscale ovh seeweb serverplan solidhost upcloud vtx xxl webhosting 1 1 internet cispe non profit association belgian law general assembly elects within members board less 10 members composition board directors time take account composition rules majority board composed european headquartered companies majority board composed small mid caps eur 1b turnover represent least 3 different eu countries considering worldwide hq location first chairman board alban schmutz general secretary named board first general secretary francisco mingorance board also names code conduct task force cispe cctf charge working evolution improvements cispe data protection code conduct organization open member operating least one iaas service one european country engaging declare least one service cispe code conduct within 6 months", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 852, + "label": 4, + "text": "Internet_police:internet police internet police generic term police government agencies departments organizations charge policing internet number countries major purposes internet police depending state fighting cybercrime well censorship propaganda several attempts made introduce tools would allow law enforcement security agencies eavesdrop online communications without warrant latest bill c-30 tabled february 2012 abandoned strong public opposition computer emergency response team estonia cert estonia established 2006 organization responsible management security incidents .ee computer networks task assist estonian internet users implementation preventive measures order reduce possible damage security incidents help responding security threats cert estonia deals security incidents occur estonian networks started notified citizens institutions either estonia abroad cyber crime investigation cell wing mumbai police india deal computer crimes enforce provisions india information technology law namely information technology act 2000 various cyber crime related provisions criminal laws including indian penal code companies act india subsection it-sector responsibilities corporate measures protect cybersecurity cyber crime investigation cell part crime branch criminal investigation department mumbai police andhra pradesh cyber crime investigation cell wing hyderabad police india deal cyber crimes indian computer emergency response team cert-in also deals cyber security cyber police hi-tech crime enquire cell kerala police dutch police reported set internet brigade fight cybercrime allowed infiltrate internet newsgroups discussion forums intelligence gathering make pseudo-purchase provide services reported 2005 departments provincial municipal governments mainland china began creating teams internet commentators propaganda police departments offering classes marxism propaganda techniques internet reported guide discussion public bulletin boards away politically sensitive topics posting opinions anonymously false names chinese internet police also erase anti-communist comments posts pro-government messages chinese communist party leader hu jintao declared party intent strengthen administration online environment maintain initiative online opinion 2006 coup thailand thai police active monitoring silencing dissidents online censorship internet carried ministry information communications technology thailand royal thai police collaboration communications authority thailand telecommunication authority thailand 29 april 2010 wipas raksakulthai arrested charges l\u00e8se majest\u00e9 following post facebook account criticizing king bhumibol may 2011 amnesty international named prisoner conscience internet watch foundation iwf recognised organisation united kingdom operating internet 'hotline public professionals report exposure potentially illegal content online works partnership police government public internet service providers wider online industry", + "neighbors": [ + 14, + 257, + 425, + 684, + 701, + 771, + 779, + 1309, + 1395, + 1464 + ], + "mask": "Test" + }, + { + "node_id": 853, + "label": 3, + "text": "List_of_Qualcomm_Snapdragon_systems-on-chip:list qualcomm snapdragon systems-on-chip list qualcomm snapdragon chips snapdragon family mobile system chip soc made qualcomm use smartphones tablets watches smartbook devices three types snapdragon s4 s4 play s4 plus s4 pro launched 2012 snapdragon s4 prime mpq8064 processor announced part snapdragon 600 series snapdragon 208 snapdragon 210 announced september 9 2014 snapdragon 212 announced july 28 2015 qualcomm 205 mobile platform formally falls mobile platform brand practically snapdragon 208 x5 lte modem announced march 20 2017 qualcomm 215 announced july 9 2019 snapdragon 410 announced december 9 2013 qualcomm first 64-bit mobile system chip snapdragon 412 announced july 28 2015 snapdragon 415 older snapdragon 425 later cancelled announced february 18 2015 snapdragon 425 427 430 435 pin software compatible software compatible snapdragon 429 439 450 625 626 632 snapdragon 430 announced september 15 2015 new snapdragon 425 snapdragon 435 announced february 11 2016 snapdragon 427 announced october 18 2016 snapdragon 450 announced june 28 2017 pin software compatible snapdragon 625 626 632 software compatible snapdragon 425 427 429 430 435 439 snapdragon 429 439 announced june 26 2018 snapdragon 429 439 pin software compatibility software compatible snapdragon 425 427 430 435 450 625 626 632 snapdragon 600 announced january 8 2013 snapdragon 610 snapdragon 615 announced february 24 2014 snapdragon 615 qualcomm first octa-core soc snapdragon 616 announced july 31 2015 snapdragon 617 announced september 15 2015 snapdragon 625 announced february 11 2016 snapdragon 626 announced october 18 2016 snapdragon 625 626 632 450 pin software compatible software compatible snapdragon 425 427 429 430 435 439 snapdragon 618 snapdragon 620 announced february 18 2015 since renamed snapdragon 650 snapdragon 652 respectively snapdragon 653 announced october 18 2016 snapdragon 630 636 660 pin software compatible snapdragon 630 snapdragon 660 announced may 9 2017 snapdragon 636 announced october 17 2017 snapdragon 632 announced june 26 2018 pin software compatible snapdragon 625 626 450 software compatible snapdragon 425 427 429 430 435 439 snapdragon 670 announced august 8 2018 pin software compatible snapdragon 710 snapdragon 675 announced october 22 2018 snapdragon 665 announced april 9 2019 february 27 2018 qualcomm introduces new snapdragon 700 mobile platform series snapdragon 710 announced may 23 2018 pin software compatible snapdragon 670 snapdragon 712 announced february 6 2019 snapdragon 730 730g announced april 9 2019 snapdragon 802 chip 8092 use smart tvs formerly announced qualcomm later confirmed released demand processors market smaller anticipated snapdragon 800 announced january 8 2013 snapdragon 801 announced february 24 2014. notable features snapdragon 805 announced november 20 2013 snapdragon 808 810 announced april 7 2014 snapdragon 808 notable features predecessor 805 snapdragon 810 notable features lower end 808 snapdragon 820 announced mobile world congress march 2015 first phones featuring soc released early 2016 snapdragon 821 announced july 2016 821 provides 10 improvement performance 820 due faster clocked cpu otherwise similar features qualcomm stating 821 designed complement rather replace 820. notable features predecessor snapdragon 808 810 snapdragon 835 announced november 17 2016 snapdragon 835 mobile compute platform windows 10 pcs announced december 5 2017. notable features predecessor 821 snapdragon 845 announced december 7 2017 snapdragon 845 notable features snapdragon 850 mobile compute platform windows 10 pcs announced june 4 2018 essentially over-clocked version snapdragon 845 snapdragon 855 announced december 5 2018 snapdragon 855 qualcomm first 7 nm finfet chipset notable features predecessor 845 snapdragon 8cx compute platform windows 10 pcs announced december 6 2018. notable features 855 snapdragon 855+ announced july 15 2019 different video codecs supported snapdragon socs decode e encode fhd fullhd 1080p 1920x1080px hd 720p 1366x768px 1280x720px different video codecs supported snapdragon 200 series different video codecs supported snapdragon 400 series different video codecs supported snapdragon 600 series different video codecs supported snapdragon 700 series different video codecs supported snapdragon 800 series qualcomm snapdragon wear 2100 processor designed smartwatches available connected 4g/lte 3g tethered bluetooth wi-fi versions lg watch style uses processor snapdragon wear 2500 announced june 26 2018 snapdragon wear 3100 announced september 10 2018 snapdragon 602a application motor industry announced january 6 2014 snapdragon 820a announced january 6 2016 snapdragon 410e embedded snapdragon 600e embedded announced september 28 2016 snapdragon 800 embedded snapdragon 810 embedded snapdragon 820e embedded announced february 21 2018 qualcomm vision intelligence platform announced april 11 2018 qualcomm vision intelligence platform purpose built bring powerful visual computing edge computing machine learning wide range iot devices qualcomm smart audio platform apq8009 apq8017 announced june 14 2017 qualcomm 212 home hub apq8009 qualcomm 624 home hub apq8053 announced january 9 2018 qcs400 series announced march 19 2019 may 2018 qualcomm announced snapdragon xr1 platform first purpose-built soc augmented reality virtual reality mixed reality qualcomm also announced htc vive pico meta vuzix would announcing consumer products featuring xr1 end 2018 following qualcomm acquisition csr 2015 qualcomm designs ultra-low-power bluetooth socs csr qca qcc brands wireless headphones earbuds qualcomm worked amazon google reference designs help manufactures develop headsets support alexa google assistant google fast pair qualcomm announced qcc5100 series ces 2018", + "neighbors": [ + 112, + 162, + 166, + 214, + 270, + 435, + 607, + 681, + 704, + 853, + 917, + 988, + 1069, + 1147, + 1176, + 1178, + 1262, + 1305, + 1384, + 1488, + 1503, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 854, + "label": 3, + "text": "Disk_array:disk array disk array disk storage system contains multiple disk drives differentiated disk enclosure array cache memory advanced functionality like raid virtualization components typical disk array include typically disk array provides increased availability resiliency maintainability using additional redundant components controllers power supplies fans etc often point single points failure spofs eliminated design additionally disk array components often hot-swappable typically disk arrays divided categories primary vendors storage systems include coraid inc. datadirect networks dell emc fujitsu hewlett packard enterprise hitachi data systems huawei ibm infortrend netapp oracle corporation panasas pure storage companies often act oem vendors market storage components manufacture", + "neighbors": [ + 352, + 359, + 494, + 1085, + 1099, + 1322 + ], + "mask": "Train" + }, + { + "node_id": 855, + "label": 3, + "text": "The_Tower_of_Cabin:tower cabin tower cabin unusual spinoff fantasy role-playing video game series called japanese developer microcabin tower cabin released microcabin decided discontinue development msx tower cabin also ported nec pc9801 game player plays new microcabin employee wander microcabin headquarters building japan goal work various lead programmers developers making company successful similar japanese game known segagaga dreamcast player runs entire sega company president sega corporation game featured many characters xak series latok fray pixie two unlockable mini-games tower cabin short fighting game pixie fray text adventure called crusader took place within xak universe game setting takes place microcabin office building japan player descends ascends various floors throughout building carrying various business related tasks besides main character player several miscellaneous npc player talk order proceed game addition characters microcabin games make cameo appearance game played traveling office building various departments relaying information employees completing various business related tasks order ensure success microcabin company", + "neighbors": [ + 1482 + ], + "mask": "Test" + }, + { + "node_id": 856, + "label": 4, + "text": "ARP_spoofing:arp spoofing computer networking arp spoofing arp cache poisoning arp poison routing technique attacker sends spoofed address resolution protocol arp messages onto local area network generally aim associate attacker mac address ip address another host default gateway causing traffic meant ip address sent attacker instead arp spoofing may allow attacker intercept data frames network modify traffic stop traffic often attack used opening attacks denial service man middle session hijacking attacks attack used networks use arp requires attacker direct access local network segment attacked address resolution protocol arp widely used communications protocol resolving internet layer addresses link layer addresses internet protocol ip datagram sent one host another local area network destination ip address must resolved mac address transmission via data link layer another host ip address known mac address needed broadcast packet sent local network packet known arp request destination machine ip arp request responds arp reply contains mac address ip arp stateless protocol network hosts automatically cache arp replies receive regardless whether network hosts requested even arp entries yet expired overwritten new arp reply packet received method arp protocol host authenticate peer packet originated behavior vulnerability allows arp spoofing occur basic principle behind arp spoofing exploit lack authentication arp protocol sending spoofed arp messages onto lan arp spoofing attacks run compromised host lan attacker machine connected directly target lan generally goal attack associate attacker host mac address ip address target host traffic meant target host sent attacker host attacker may choose inspect packets spying forwarding traffic actual default destination avoid discovery modify data forwarding man-in-the-middle attack launch denial-of-service attack causing packets network dropped simplest form certification use static read-only entries critical services arp cache host ip address-to-mac address mappings local arp cache may statically entered hosts n't need transmit arp requests entries exist static entries provide security spoofing result maintenance efforts address mappings systems network must generated distributed scale large network since mapping set pair machines resulting n n arp entries configured n machines present machine must arp entry every machine network n-1 arp entries n machines software detects arp spoofing generally relies form certification cross-checking arp responses uncertified arp responses blocked techniques may integrated dhcp server dynamic static ip addresses certified capability may implemented individual hosts may integrated ethernet switches network equipment existence multiple ip addresses associated single mac address may indicate arp spoof attack although legitimate uses configuration passive approach device listens arp replies network sends notification via email arp entry changes antiarp also provides windows-based spoofing prevention kernel level arpstar linux module kernel 2.6 linksys routers drops invalid packets violate mapping contains option repoison/heal virtualized environment kvm also provides security mechanism prevent mac spoofing guest running host additionally ethernet adapters provides mac vlan anti-spoofing features openbsd watches passively hosts impersonating local host notifies case attempt overwrite permanent entry operating systems react differently linux ignores unsolicited replies hand uses responses requests machines update cache solaris accepts updates entries timeout microsoft windows behavior arp cache configured several registry entries hkey_local_machine\\system\\currentcontrolset\\services\\tcpip\\parameters arpcachelife arpcacheminreferencelife arpuseethersnap arptrsingleroute arpalwayssourceroute arpretrycount techniques used arp spoofing also used implement redundancy network services example software allows backup server issue gratuitous arp request order take defective server transparently offer redundancy arp spoofing often used developers debug ip traffic two hosts switch use host host b communicating ethernet switch traffic would normally invisible third monitoring host m. developer configures mac address b b mac address also configures forward packets monitor traffic exactly man-in-the-middle attack tools used carry arp spoofing attacks", + "neighbors": [ + 52, + 149, + 352, + 363, + 364, + 444, + 512, + 598, + 608, + 692, + 764, + 771, + 1042, + 1045, + 1116, + 1208, + 1337, + 1410 + ], + "mask": "Test" + }, + { + "node_id": 857, + "label": 7, + "text": "SAP_Converged_Cloud:sap converged cloud sap converged cloud private managed cloud developed marketed sap set cloud computing services offers managed private cloud based openstack technology-based public cloud used sap organization internal resources create mix different cloud computing environments made openstack services offers compute storage platform services accessible sap 2012 sap promoted aspects cloud computing october 2012 sap announced platform service offering called sap cloud platform may 2013 managed private cloud offering called s/4hana enterprise cloud service announced sap converged cloud announced january 2015 sap converged cloud managed sap business unit established 2015 named converged cloud unit headed markus riedinger unit manager converged cloud beta went live may 2017 included openstack technology-based storage compute network components shared new services made sap later designate dns service added well 2017 year sap charged superior cloud innovation customers sizes sap s/4hana cloud sap ariba sap successfactors sap cloud applications customers access complete portfolio cloud-based solutions support digital transformation journeys june 7 2017 sap announced company plans invest 1 billion cloud next two years business organizations want use cloud computing choice using private cloud cloud infrastructure run specifically single organization built third-party public cloud whereby service provider makes available applications storage resources general public decision use based number factors whether company operates highly regulated sector pharmaceuticals industry must comply rules regarding control security data business must bring services market quickly web applications developer first would opt private cloud security peace mind web developer would choose public cloud offering companies would operate mixture two also known hybrid cloud delivery employing hybrid delivery cloud strategy lets organizations use different cloud delivery services specific applications instance public cloud may cost-effective service compute-intensive task processing analytics data would remain local private comply regulations hybrid delivery strategy lets organizations run applications services across different clouds collocation data centers example benefit delivery mechanism organizations move app one geographic location another major storms different types hybrid clouds specific tasks infrastructure service iaas model hybrid cloud could use operating systems virtualization technologies public private cloud infrastructure provide cloud services models mix on-premises cloud public cloud technologies include platform service paas includes infrastructure services combined development tools middleware software service saas used develop packaged software however moving data cloud difficult procedure case software service saas difficult particularly incumbent cloud provider used proprietary software altered open source application way mitigate cloud migration difficulties architect applications cloud reduce eliminate dependencies cloud application stack capabilities cloud service provider another way select generic higher-level applications move cloud first place another method select open standards cloud computing best practice avoiding cloud migration problems use management platform support applications environment user organization likely use described using best-of-breed approach companies engage cloud professional services consultants help plan incorporate cloud services business operations consultants advise businesses whether use public private hybrid delivery model implement consume delivery models example cloud professional services consultants might recommend businesses interested cost savings place appropriate applications public cloud keep higher-security application private cloud hybrid cloud 2013 competitive vendor analysis report international data corporation market research firm authors state cloud professional services help companies map short-term long-term strategy use cloud way aids business goals common reason businesses engage cloud professional services assistance incorporating cloud technology existing environments plan implement cloud according study published february 2014 independent research firm technology business research inc according published reports use cloud professional services indicates businesses adequate internal resources knowledgeable implementing cloud sap converged cloud follows premise converged infrastructure integration compute storage networking components technologies self-provisioning pools shared resources supported services one benefits data center based converged infrastructure including converged infrastructure data center delivers cloud services manual tasks automated thus reducing time cost carry sap converged cloud supporting vmware hypervisors supports multiple operating systems microsoft red hat ubuntu etc supports wide range development environments based openstack technology means compatible public cloud platforms based openstack technology rackspace nebula sap converged cloud consultants work sap users help configure best cloud approach users receive advice implement cloud consistent manner get value cloud investment users also receive advice manage cloud sap cloud marketing\u2014delivers information possible uses cloud services solutions identifies opportunities begin implementing cloud sap converged cloud includes security features businesses connect private cloud on-site network using software-defined networking technology multiple copies virtual lan vlan supplied providing method businesses connect firewall on-site network converged cloud appearing part on-site network backup service load balancing using f5 networks allows service load balancing across virtual servers cloud storage data stored off-site file systems server operating systems sap retains local backups postgresql swift containers 30 days user organizations choose 50gb 100gb one-terabyte blocks storage area network san storage server nodes high-availability clustering added instances microsoft windows server red hat enterprise linux suse linux enterprise server sap converged cloud service solution sap hana private service developed sap sap hana in-memory database migration services businesses want move sap hana platform system designed enable businesses analyze big data november 2016 sap opened walldorf first data centers host converged cloud according published reports data centers provide disaster recovery services high availability", + "neighbors": [ + 77, + 134, + 272, + 556, + 611, + 731, + 1019, + 1036, + 1138, + 1225, + 1377, + 1431, + 1582 + ], + "mask": "Train" + }, + { + "node_id": 858, + "label": 2, + "text": "IOS_8:ios 8 ios 8 eighth major release ios mobile operating system developed apple inc. successor ios 7 announced company worldwide developers conference june 2 2014 released september 17 2014 succeeded ios 9 september 16 2015. ios 8 incorporated significant changes operating system introduced continuity cross-platform mac iphone ipad system enables communication devices different product categories ability answer calls reply sms mac ipad continuity includes handoff feature lets users start task one device continue another changes included new spotlight suggestions search results feature provides detailed results family sharing family link together accounts share content one parent administrator permission controls updated keyboard quicktype providing contextual predictive word suggestions extensibility allows easier sharing content apps third-party developers got additional features integrate apps deeper operating system including support widgets notification center ability make keyboards users replace default ios keyboard app updates release included new health app aggregate data different fitness apps well enabling medical id accessible lock screen emergencies support icloud photo library photos app enables photos synchronized stored cloud icloud drive lets users store files cloud browse across devices ios 8.4 apple updated music app streaming service called apple music 24-hour radio station called beats 1 reception ios 8 positive critics praised continuity extensibility major features enabling easier control interaction different apps devices also liked quicktype keyboard word suggestions highlighted spotlight suggestions making iphone almost portable search portal everything however reviewers noted full potential ios 8 would realized third-party developers integrated apps support new features particularly widgets notification center roughly week release ios 8 reached 46 ios usage share october 2014 reported adoption rate stalled increasing single percentage point previous month situation blamed requirement high amount free storage space install upgrade especially difficult iphones sold 8 16 gigabytes maximum storage space following december ios 8 reached 63 usage share notable 16 increase october measurement ios 8 introduced company worldwide developers conference june 2 2014 first beta made available conference attendees keynote presentation ios 8 officially released september 17 2014. ios 8.0.1 released september 24 2014 first update ios 8 update meant bring various bug fixes however update withdrawn due issue disabled touch id cellular network connectivity models apple instead recommended affected users reinstall initial ios 8 release wait version 8.0.2 ready ios 8.0.2 released september 25 2014 day release ios 8.0.1 included fixes bugs present previous update ios 8.1 released october 20 2014 update introduced apple pay iphone 6 6 plus united states added icloud photo library beta status returned camera roll photos added continuity features enable iphone users read send sms mms ipad mac also introduced instant hotspot allowing mac users remotely activate personal hotspot feature nearby iphone ios 8.1.1 released november 17 2014 bug fixes performance improvements iphone 4s ipad 2. ios 8.1.2 released december 9 2014 fix issue ringtones purchased itunes store would removed ios device ios 8.1.3 released january 27 2015 update included bug fixes reduced amount storage space required perform ios update ios 8.2 released march 9 2015 update included support apple watch apple watch app iphone providing app store configuration options access health options units measurement well lots stability improvements bug fixes release ios 8.3 apple announced public beta testing program allowing consumers receive test upcoming versions ios software official general release ios 8.3 released april 8 2015 update included emoji improvements updated emoji keyboard picker organizes emoji categories new diversified emoji skin tone modifiers new languages siri support wireless carplay well major bug fixes improvements ios 8.4 released june 30 2015 update introduced apple music therefore overhauled existing music app apple music service ios 8.4 also relocated audiobooks music app ibooks app ios 8.4.1 released august 13 2015 various fixes apple music ios 8 introduced continuity cross-platform mac iphone ipad system enables communication devices different product categories continuity enables phone call functionality ipad mac calls routed iphone secondary device secondary device serves speaker phone also brings sms support ipad mac extension imessage feature previous versions continuity adds feature called handoff lets users start task one device continue another composing e-mail iphone continuing ipad sending mac order support handoff continuity macs needed os x yosemite operating system released october 2014 well support bluetooth low energy ios 8 introduced spotlight suggestions new search feature integrates many websites services show detailed search results including snippets wikipedia articles local news quick access apps installed device itunes content movie showtimes nearby places info various websites spotlight suggestions available ios home screen well safari web browser search bar drop-down notification center redesigned allow widget functionality third-party apps add widget support apps let users see information notification center without open respective app users add rearrange remove widgets time examples widgets include weather app showing current weather calendar app showing upcoming events notifications actionable allowing users reply message appears quick drop-down act notification notification center ios 8 includes new predictive typing feature called quicktype displays word predictions keyboard user types apple allows third-party developers make keyboard apps users replace default ios keyboard added privacy apple added settings toggle called allow full access optionally enables keyboard act outside app sandbox synchronizing keyboard data cloud third-party keyboards allowed use siri voice dictation secure text fields allow input ios 8 introduced family sharing allows 6 people register unique itunes accounts linked together one parent becoming administrator controlling overall experience purchases made one account shared family members purchases made kids 13 years age require parental approval purchases made adults visible kids family sharing also extends apps shared album automatically generated photos app family member allowing everyone add photos videos comments shared place ask buy feature allows anyone request purchase items app store itunes store ibooks store well in-app purchases icloud storage administrator option either approve deny purchase multitasking screen shows list recently called favorited contacts feature turned settings ios 8 includes additional data roaming option settings european users allowing greater control data usage abroad siri personal voice assistant integrated shazam support asking siri song identify song playing wi-fi calling added allow mobile phone calls wi-fi mobile operator carriers enable voice-over-wi-fi functionality services camera app gets two new features time-lapse self-timer time-lapse records frames shorter intervals normal film frequencies builds movies showing events faster speed self-timer gives user option three-second ten-second countdown automatically taking photo ipads take pictures panoramic mode ios 8 added icloud photo library support photos app enabling photo synchronization different apple devices photos videos backed full resolution original formats feature almost meant lower-quality versions photos could cached device rather full-size images potentially saving significant storage space models limited storage availability photos app received better search different search categorization options including nearby one year ago favorites home based geolocation date photo capture additionally photos app gained precise editing controls including improved rotation one-touch auto-enhancement tools deeper color adjustments brightness contrast exposure shadows also option hide photo without deleting apple added extensibility feature ios 8 allows filters effects third-party apps accessed directly within menu standard photos app rather import export photos respective app apply effects initial release ios 8 apple removed camera roll feature photos app camera roll overview photos device replaced recently added photo view displaying photos recently user captured despite replaced recently added album removal camera roll sparked user complaints apple returned feature ios 8.1 update ios 8 messages gets new features group conversations including disturb mode disables conversation notifications well ability remove participants chat new tap talk chat button lets users send quick voice comments recipient record button allows users record short videos interaction two apple users messages app allows users send short picture video audio clips 2-minute expiration time settings app user option messages automatically deleted certain time period safari web browser developers add support safari password sharing allows share credentials sites apps potentially cutting number times users need type credentials apps services browser also adds support webgl graphics api similar style file manager icloud drive file hosting service enabled settings lets users save kind file app media synchronized ios devices well mac ios 8 apple updated app store explore tab providing improved app discovery trending searches search tab ability developers bundle multiple apps single discounted package new preview videos allow developers visually show app function healthkit service allows developers make apps integrate new health app health app primarily aggregates data fitness apps installed user device except steps flights climbed tracked motion processor user iphone users enter medical history medical id accessible lock screen case emergency homekit serves software framework lets users set iphone configure communicate control smart-home appliances designing rooms items actions homekit service users enable automatic actions house simple voice dictation siri apps manufacturers homekit-enabled devices required purchase license homekit products required encryption co-processor equipment manufactured without homekit-support enabled use gateway product hub connects devices homekit service passbook app ios 8 updated include apple pay digital payment service available iphone 6 6 plus release ios 8.1 new music streaming service apple music introduced ios 8.4 update allows subscribers listen unlimited number songs on-demand subscriptions release music service standard music app ios revamped visually functionally include apple music well 24-hour live radio station beats 1 notes received rich text editing support ability bold italicize underline text image support allowing users post photos app weather app uses weather data weather channel instead yahoo app also received slight changes user interface ios 8 added new tips app shows tips brief information features ios weekly basis ios 8 allows touch id used third-party apps ios 8 received positive reviews brad molen engadget highlighted continuity major advancement users multiple apple devices also praised extensibility feature allowing apps share data liked support third-party keyboards however molen noted new introductions family sharing continuity icloud drive require diving apple ecosystem work particularly enjoyed actionable notifications third-party widget support notification center charles arthur guardian also liked extensibility well new quicktype word suggestions functionality ios keyboard criticized lack option choosing default apps also criticized settings menu confusing unintuitive darrell etherington techcrunch praised improvements imessage writing best ability mute leave group conversations something \u2019 sorely missing since introduction group imessage conversations liked new search editing features photos quicktype feature keyboard particularly highlighted spotlight suggestions one better features ios 8 even \u2019 small service addition noting makes iphone almost portable search portal everything martin bryant next web wrote real advances yet come adding apple included demonstrations done true power \u2019 hood realized coming days weeks months third-party developers gradually incorporate new features apps september 23 2014 roughly week release ios 8 user adoption ios 8 reached 46 october 2014 andrew cunningham ars technica reported ios 8 user adoption rate stalled climbing single percentage point since previous september measurement 46 cunningham blamed over-the-air update requiring 5 gigabytes install unusually large amount may posed challenges using 8 gigabyte 16 gigabyte devices alternative apple offered update via itunes software cunningham noted itunes hookup going even way days years ago least apple spent last three years coaching people use idevices independently computers december new report ars technica stated ios 8 usage increased 63 solid 16 percent study apteligent formerly crittercism found rate apps crashed tests 3.56 ios 8 higher 2 found ios 7.1 september 2014 ios 8.0.1 update caused significant issues touch id iphone 6 cellular network connectivity models apple stated affected users reinstall initial ios 8 release version 8.0.2 ready ios 8.0.2 released one day 8.0.1 fix issues caused 8.0.1 update forbes published several articles focusing problems ios 8 regarding wi-fi battery bluetooth calendar may 2015 news outlets reported bug receiving text message specific combination symbols arabic characters caused messages application crash iphone reboot bug named effective power could potentially continuously reboot device message visible lock screen flaw exploited purpose trolling intentionally causing others phones crash bug fixed ios 8.4 update released june 2015 september 2014 hoax apple advertisement alleged feature called wave ios 8 circulated twitter promised users would able recharge iphone heating microwave oven feature exist media cited numerous people reporting twitter destroyed iphone following procedure described advertisement release apple dropped support iphone 4", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 141, + 228, + 252, + 269, + 337, + 345, + 352, + 356, + 394, + 403, + 475, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 754, + 797, + 877, + 917, + 927, + 941, + 945, + 956, + 972, + 1001, + 1061, + 1089, + 1100, + 1140, + 1178, + 1237, + 1246, + 1292, + 1305, + 1334, + 1339, + 1373, + 1408, + 1409, + 1488, + 1496, + 1544, + 1591, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 859, + "label": 5, + "text": "Route_poisoning:route poisoning route poisoning method prevent router sending packets route become invalid within computer networks distance-vector routing protocols computer networks use route poisoning indicate routers route longer reachable considered routing tables unlike split horizon poison reverse route poisoning provides sending updates unreachable hop counts immediately nodes network protocol detects invalid route routers network informed bad route infinite \u221e route metric makes nodes invalid route seem infinitely distant preventing routers sending packets invalid route distance-vector routing protocols rip use maximum hop count determine many routers traffic must go reach destination route hop count number assigned incremented routing information passed router router route considered unreachable hop count exceeds maximum allowed route poisoning method quickly forgetting outdated routing information router routing tables changing hop count unreachable higher maximum number hops allowed sending routing update case rip maximum hop count 15 perform route poisoning route hop count changed 16 deeming unreachable routing update sent updates lost nodes network would informed route invalid could attempt send packets bad route cause problem known routing loop therefore route poisoning used conjunction holddowns keep update messages falsely reinstating validity bad route prevents routing loops improving overall efficiency network", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 860, + "label": 2, + "text": "TRIPOS:tripos tripos trivial portable operating system computer operating system development started 1976 computer laboratory cambridge university headed dr. martin richards first version appeared january 1978 originally ran pdp-11 later ported computer automation lsi4 data general nova work motorola 68000 version started 1981 university bath metacomco acquired rights 68000 version continued development tripos chosen commodore amiga march 1985 form part operating system new computer also used cambridge part cambridge distributed computing system july 1985 amiga introduced incorporating tripos amigados module amigaos amigados included command line interface amiga file system entire amigados module originally written bcpl ancestor c programming language language used write tripos amigados would later rewritten c amigaos 2.x onwards retaining backwards compatibility 1.x amigaos 4 completely rewritten c amigados abandoned bcpl legacy tripos provided features pre-emptive multi-tasking using strict-priority scheduling hierarchical file system multiple command line interpreters important tripos concepts non-memory-management approach meaning checks performed stop programs using unallocated memory message passing means passing pointers instead copying message contents two concepts together allowed sending receiving 1250 packets per second 10 mhz motorola 68010 cpu tripos implemented bcpl kernel device drivers implemented assembly language one notable feature tripos/bcpl cultural use shared libraries untypical time resulting small therefore fast loading utilities example many standard system utilities well 0.5 kbytes size compared typical minimum 20 kbytes functionally equivalent code modern unix linux tripos ported number machines including data general nova 2 computer automation lsi4 motorola 68000 intel 8086- based hardware included support cambridge ring local area network recently martin richards produced port tripos run linux using cintcode bcpl virtual machine january 2019 tripos still actively maintained open g ltd. formerly misys financial systems worcestershire uk many british insurance brokers linux/intel based tripos system serving networked workstations tcp/ip connection systems used run open g brooms application suite open g added number features support modern office ability integrate many mainstream applications services sql server citrix xenapp terminal servers etc following list commands supported tripos cli cintpos experimental interpretive version tripos runs cintcode bcpl virtual machine also developed martin richards", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 99, + 134, + 170, + 171, + 185, + 265, + 306, + 322, + 326, + 353, + 380, + 387, + 434, + 465, + 583, + 650, + 664, + 720, + 721, + 743, + 754, + 779, + 797, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1022, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1415, + 1441, + 1456, + 1530, + 1546, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 861, + "label": 8, + "text": "Tcpkill:tcpkill tcpkill network utility program used kill connections particular host network port combination programs take standard berkeley packet filter bpf filters used port mirroring arp spoofing prevent connections host www.google.com use command computer attempting go site blocked site surf site good idea either redirect output nothingness 2 /dev/null 1 /dev/null file later analysis file.tcpkill default redirect output console hosts specified command block well\u2212known ports e.g. napster port 8888 port 6699 gnutella port 6346 command tcpkill used create dos attack within wan lan done using sniffer like dsniff tcpdump look packets transmitted pick target want deny service assume target identified 192.168.100.38 simple command like tcpkill -9 host 192.168.100.38 kill outgoing tcp packets tcp segment target rest network prior attack target receive packets rest network -i -i option specify interface want program listen default option interface computers eth0 computers one interface -1 ... 9 -1 -9 specify degree brute force want attack use target -1 least brute -9 brute computers network fast connection usually require brute force order successfully perform dos attack otherwise command run without -1 -9 option -i option description one various dsniff programs text belongs dsniff \u201c readme \u201d written author dug song see also filesnarf macof mailsnarf msfsnarf sshmitm tcpnice urlsnarf webmitm webspy", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 862, + "label": 4, + "text": "Cliqz:cliqz cliqz privacy oriented web browser developed cliqz gmbh majority-owned hubert burda media available desktop mobile web browser well extension firefox fork firefox web browser privacy-oriented changes among crowdsourced anti-tracking mechanism in-house search engine embedded within browser utilizing index web pages produce suggestions within address bar dropdown menu rather separate pages browser developers argued privacy-focused search engines may still pass user ip address third-party search providers august 2016 mozilla developer firefox made minority investment cliqz cliqz plans eventually monetize software program known cliqz offers deliver sponsored offers users based interests browsing history however recommendations processed locally based remote repository offers personally identifiable data sent remote servers 15 february 2017 cliqz international gmbh wholly owned subsidiary cliqz gmbh acquired privacy-oriented browser extension ghostery 6 october 2017 mozilla announced test approximately 1 users downloading firefox germany would receive version cliqz software included feature providedrecommendations directly browser search field including news weather sports websites based user browsing history activities press release noted users receive version firefox cliqz browsing activity sent cliqz servers including urls pages visit cliqz uses several techniques attempt remove sensitive information browsing data sent firefox according firefox support website version firefox collects sends data cliqz corporation including text typed address bar queries search engines information visited webpages interactions including mouse movement scrolling amount time spent user interactions user interface cliqz software data tied unique identifier allowing cliqz track long-term performance interaction data collected sent mozilla corporation includes among things counts visits search engine pages search engines used cliqz identifier data collection enabled default users must actively opt-out wish data transmitted", + "neighbors": [ + 83, + 95, + 134, + 258, + 277, + 306, + 509, + 530, + 582, + 623, + 668, + 684, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1120, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1378, + 1423, + 1550 + ], + "mask": "Test" + }, + { + "node_id": 863, + "label": 5, + "text": "TCP_fusion:tcp fusion tcp fusion feature providing tcp loopback implemented transmission control protocol stack within oracle solaris-10 solaris-11 operating systems well number software projects based open source codebase opensolaris project idea trivial client server connection local loopback interface within system need entire tcp/ip protocol stack exchange data therefore provide faster data path fusion two end points source code well documented inet/tcp/tcp_fusion.c clearly states tcp fusion protocol-less data path tcp loopback connections fusion two local tcp endpoints occurs connection establishment time various conditions see details tcp_fuse need met fusion successful fails fall back regular tcp data path succeeds endpoints proceed use tcp_fuse_output transmit path tcp_fuse_output enqueues application data directly onto peer receive queue protocol processing involved sychronization handled squeue mutex tcp_non_sq_lock one requirements fusion succeed endpoints need using squeue ensures neither side disappear side still sending data flow control information manipulated outside squeue tcp_non_sq_lock must held touching tcp_flow_stopped feature may enabled disabled via /etc/system config file solaris genunix kernel line required set ip do_tcp_fusion 0x0 set feature false 0x1 hexadecimal true see https //github.com/illumos/illumos-gate/blob/master/usr/src/uts/common/inet/tcp/", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 864, + "label": 4, + "text": "Kerberos_(protocol):kerberos protocol kerberos computer-network authentication protocol works basis tickets allow nodes communicating non-secure network prove identity one another secure manner protocol named character kerberos cerberus greek mythology ferocious three-headed guard dog hades designers aimed primarily client\u2013server model provides mutual authentication\u2014both user server verify identity kerberos protocol messages protected eavesdropping replay attacks kerberos builds symmetric key cryptography requires trusted third party optionally may use public-key cryptography certain phases authentication kerberos uses udp port 88 default massachusetts institute technology mit developed kerberos protect network services provided project athena protocol based earlier needham\u2013schroeder symmetric key protocol several versions protocol exist versions 1\u20133 occurred internally mit kerberos version 4 primarily designed steve miller clifford neuman published late 1980s version 4 also targeted project athena neuman kohl published version 5 1993 intention overcoming existing limitations security problems version 5 appeared rfc 1510 made obsolete rfc 4120 2005 authorities united states classified kerberos auxiliary military equipment us munitions list banned export used data encryption standard des encryption algorithm 56-bit keys non-us kerberos 4 implementation kth-krb developed royal institute technology sweden made system available outside us us changed cryptography export regulations circa 2000 swedish implementation based limited version called ebones ebones based exported mit bones release stripped encryption functions calls based version kerberos 4 patch-level 9 2005 internet engineering task force ietf kerberos working group updated specifications updates included mit makes implementation kerberos freely available copyright permissions similar used bsd 2007 mit formed kerberos consortium foster continued development founding sponsors include vendors oracle apple inc. google microsoft centrify corporation teamf1 inc. academic institutions royal institute technology sweden stanford university mit vendors cybersafe offering commercially supported versions windows 2000 later versions use kerberos default authentication method microsoft additions kerberos suite protocols documented rfc 3244 microsoft windows 2000 kerberos change password set password protocols rfc 4757 documents microsoft use rc4 cipher microsoft uses extends kerberos protocol use mit software kerberos used preferred authentication method general joining client windows domain means enabling kerberos default protocol authentications client services windows domain domains trust relationships domain contrast either client server joined domain part trusted domain environment windows instead use ntlm authentication client server intranet web applications enforce kerberos authentication method domain joined clients using apis provided sspi many unix unix-like operating systems including freebsd openbsd apple macos red hat enterprise linux oracle solaris ibm aix z/os hp hp-ux openvms others include software kerberos authentication users services embedded implementation kerberos v authentication protocol client agents network services running embedded platforms also available companies client authenticates server forwards username key distribution center kdc kdc issues ticket-granting ticket tgt time stamped encrypts using ticket-granting service tgs secret key returns encrypted result user workstation done infrequently typically user logon tgt expires point although may transparently renewed user session manager logged client needs communicate another node principal kerberos parlance service node client sends tgt tgs usually shares host kdc service must registered tgt service principal name spn client uses spn request access service verifying tgt valid user permitted access requested service tgs issues ticket session keys client client sends ticket service server ss along service request protocol described detail data encryption standard des cipher used combination kerberos longer internet standard weak security vulnerabilities exist many legacy products implement kerberos updated use newer ciphers like aes instead des november 2014 microsoft released patch ms14-068 rectify exploitable vulnerability windows implementation kerberos key distribution center kdc vulnerability purportedly allows users elevate abuse privileges domain level", + "neighbors": [ + 88, + 148, + 178, + 195, + 318, + 342, + 517, + 528, + 614, + 646, + 762, + 1003, + 1039, + 1138, + 1201, + 1210, + 1240, + 1318, + 1452, + 1453, + 1506 + ], + "mask": "Test" + }, + { + "node_id": 865, + "label": 2, + "text": "Driver_Verifier:driver verifier driver verifier tool included microsoft windows replaces default operating system subroutines ones specifically developed catch device driver bugs enabled monitors stresses drivers detect illegal function calls actions may causing system corruption acts within kernel mode target specific device drivers continual checking make driver verifier functionality multithreaded several device drivers stressed time simulate certain conditions low memory i/o verification pool tracking irql checking deadlock detection dma checks irp logging etc verifier works forcing drivers work minimal resources making potential errors might happen rarely working system manifest immediately typically fatal system errors generated stressed drivers test environment producing core dumps analysed debugged immediately without stressing intermittent faults would occur field without proper troubleshooting facilities personnel driver verifier verifier.exe first introduced command-line utility windows 2000 windows xp gained easy-to-use graphical user interface called driver verifier manager makes possible enable standard custom set settings select drivers test verify new windows version since introduced several new stringent checks testing verifying drivers detecting new classes driver defects driver verifier normally used machines used productive work cause undetected relatively harmless errors drivers manifest especially ones digitally signed windows hardware quality labs causing blue screen fatal system errors also causes resource-starved drivers underperform slow general operation constraints imposed verifier reversed debugging microsoft recommends verifying drivers time", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 866, + "label": 3, + "text": "SigmaTel_STMP3700:sigmatel stmp3700 sigmatel stmp3700 low power system chip made pmp portable media players stmp3700 using single arm processor core clocked maximum 300 mhz system chip developed 2007 use portable media players supports playing video qvga decoding various media formats used creative zen 2007 creative zen x-fi 2008 stmp378x supports vga resolutions 640\u00d7480 higher clock frequencies video hardware assist sony walkman models using product line include salsa newton freed appeared ces 2009 see freescale stmp3700 series site info", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 867, + "label": 3, + "text": "Full_Throttle_(1984_video_game):full throttle 1984 video game full throttle video game released 1984 zx spectrum msx player races 500cc grand prix motorcycle ten world top racing circuits selecting track race player starts back grid 39 bikes cornering quickly cause skid running road slow bike making contact another rider forces bike halt allowing following riders stream past player bike gets going ten circuits game part key winning know circuit well enough predict bends practice mode player rides round track without riders player choose race one five laps best position achieved shown bottom menu-screen along player time ahead second-place man soon track number laps changed record reset game written mervyn estcourt creator 3d deathchase reviews positive crash giving 91 crash smash spectrum rating 4/5 computer video games sinclair user rating 8/10", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 868, + "label": 3, + "text": "IBM_PC_compatible:ibm pc compatible ibm pc compatible computers computers similar original ibm pc xt able use software expansion cards computers referred pc clones ibm clones duplicate almost exactly significant features pc architecture facilitated ibm choice commodity hardware components various manufacturers ability reverse engineer bios firmware using clean room design technique columbia data products built first clone ibm personal computer clean room implementation bios early ibm pc compatibles used computer bus original pc models ibm compatible bus later named industry standard architecture isa bus manufacturers compatible computers term ibm pc compatible historical description since ibm ended personal computer sales descendants ibm pc compatibles comprise majority personal computers market presently dominant operating system microsoft windows although interoperability bus structure peripherals original pc architecture may limited non-existent computers ran ms-dos enough hardware differences ibm compatible software could used examples include slight differences memory map serial ports video hardware macintosh kept significant market share without compatibility ibm pc ibm decided 1980 market low-cost single-user computer quickly possible 12 august 1981 first ibm pc went sale three operating systems os available least expensive popular pc dos made microsoft crucial concession ibm agreement allowed microsoft sell version ms-dos non-ibm computers component original pc architecture exclusive ibm bios basic input/output system ibm first asked developers avoid writing software addressed computer hardware directly instead make standard calls bios functions carried hardware-dependent operations software would run machine using ms-dos pc-dos software directly addressed hardware instead making standard calls faster however particularly relevant games software addressing ibm pc hardware way would run ms-dos machines different hardware ibm pc sold high enough volumes justify writing software specifically encouraged manufacturers produce machines could use programs expansion cards peripherals pc 808x computer marketplace rapidly excluded machines hardware- software-compatible pc 640 kb barrier conventional system memory available ms-dos legacy period non-clone machines subject limit could exceed 640 kb rumors lookalike compatible computers created without ibm approval began almost immediately ibm pc release infoworld wrote first anniversary ibm pc june 1983 pc magazine defined pc 'clone computer accommodate user takes disk home ibm pc walks across room plugs 'foreign machine shortage ibm pcs year many customers purchased clones instead columbia data products produced first computer less compatible ibm pc standard june 1982 soon followed eagle computer compaq announced first ibm pc compatible november 1982 compaq portable compaq first sewing machine-sized portable computer essentially 100 pc-compatible company could copy bios directly result court decision apple v. franklin could reverse-engineer ibm bios write bios using clean room design time many manufacturers tandy/radioshack xerox hewlett-packard digital equipment corporation sanyo texas instruments tulip wang olivetti introduced personal computers supported ms-dos completely software- hardware-compatible ibm pc tandy described tandy 2000 example 'next generation true 16-bit cpu speed disk storage expansion ibm pc ms-dos computers admitting 1984 many ms-dos programs support computer company stated popular sophisticated software market available either immediately next six months like ibm microsoft intention application writers would write application programming interfaces ms-dos firmware bios would form would termed hardware abstraction layer computer would original equipment manufacturer oem version ms-dos customized hardware software written ms-dos would operate ms-dos computer despite variations hardware design expectation seemed reasonable computer marketplace time microsoft based primarily computer languages basic established small system operating software cp/m digital research use hobbyist level professional using microcomputers achieve widespread use thus make product viable economically os operate across range machines different vendors widely varying hardware customers needed applications starter programs could reasonably expect publishers offer products variety computers suitable media microsoft competing os intended initially operate similar varied spectrum hardware although based 8086 processor thus ms-dos several years sold oem product microsoft-branded ms-dos ms-dos could purchased directly microsoft oem release packaged trade dress given pc vendor malfunctions reported oem microsoft however machines compatible ibm hardware\u2014thus supporting direct calls hardware\u2014became widespread soon became clear oem versions ms-dos virtually identical except perhaps provision utility programs ms-dos provided adequate functionality character-oriented applications could implemented text-only terminal bulk commercially important software nature low-level hardware compatibility might mattered however order provide maximum performance leverage hardware features work around hardware bugs pc applications quickly developed beyond simple terminal applications ms-dos supported directly spreadsheets wysiwyg word processors presentation software remote communication software established new markets exploited pc strengths required capabilities beyond ms-dos provided thus early development ms-dos software environment many significant commercial software products written directly hardware variety reasons may 1983 future computing defined four levels compatibility development compaq engineers found microsoft flight simulator would run sublogic bruce artwick described bug one intel chips forcing make new computer bug compatible ibm pc first clones compaq offered truly full compatibility jerry pournelle purchased ibm pc mid-1983 rotten keyboard four cubic feet unevaluated software much wo n't run anything ibm pc although lot machines claim 100 percent ibm pc compatible 've yet one arrive ... alas lot stuff n't run eagle z-100 compupro anything else around columbia university reported january 1984 kermit ran without modification compaq columbia data products clones eagle seequa ms-dos computers also required custom code many companies reluctant products pc compatibility tested pc magazine requested samples computer manufacturers claimed produce compatibles april 1984 review 14 31 declined corona data systems specified systems run software conforms ibm pc programming standards popular software byte journalist asked test peachtext spring 1983 comdex corona representatives hemmed hawed bit finally led ... corner one would see fail magazine reported hesitancy unnecessary disk booted without problem zenith data systems bolder bragging z-150 ran applications people brought test 1984 west coast computer faire creative computing 1985 stated reiterate standard line regarding ibm pc compatibles try package want use buy computer companies modified computers bios work newly discovered incompatible applications reviewers users developed stress tests measure compatibility 1984 ability operate lotus 1-2-3 flight simulator became standard compatibles specifically designed run ibm believed companies eagle corona handwell infringed copyright apple computer inc. v. franklin computer corp. successfully forced clone makers stop using bios phoenix bios 1984 however similar products ami bios permitted computer makers legally build essentially 100 -compatible clones without reverse-engineer pc bios september 1985 infoworld chart listed seven compatibles 256 kb ram two disk drives monochrome monitors 1,495 2,320 equivalent ibm pc cost 2,820 1986 compute stated clones generally reliable 99 percent compatible february 1984 byte wrote ibm burgeoning influence pc community stifling innovation many companies mimicking big blue market grew ibm influence diminished november 1985 pc magazine stated created pc market market n't necessarily need ibm machines may depend ibm set standards develop higher-performance machines ibm better conform existing standards hurt users january 1987 bruce webster wrote byte rumors ibm would introduce proprietary personal computers proprietary operating system cares ibm likely isolate largest marketplace really ca n't compete anymore anyway magazine predicted 1987 market complete transition ibm standard intel/ms-dos/expansion bus standard ... folks n't much concerned ibm compatibility lotus 1-2-3 compatibility 1992 macworld stated clones ibm lost control market became minor player technology ibm announced os/2-oriented ps/2 line early 1987 sales existing dos-compatible pc compatibles rose part proprietary operating system available 1988 gartner group estimated public purchased 1.5 clones every ibm pc 1989 compaq influential industry executives spoke compaq compatible observers stating customers saw company ibm equal 1987 ibm pc compatibles dominated home business markets commodity computers notable alternative architectures used niche markets like macintosh computers offered apple inc. used mainly desktop publishing time aging 8-bit commodore 64 selling 150 time became world best-selling computer 32-bit commodore amiga line used television video production 32-bit atari st used music industry however ibm lost main role market ibm pc compatibles 1990 events retrospect important despite popularity thinkpad set laptop pc ibm finally relinquished role consumer pc manufacturer april 2005 sold laptop desktop pc divisions lenovo us 1.75 billion october 2007 hewlett-packard dell largest shares pc market north america also successful overseas acer lenovo toshiba also notable worldwide huge number pcs white box systems assembled myriad local systems builders despite advances computer technology current ibm pc compatibles remain much compatible original ibm pc computers although components implement compatibility special backward compatibility modes used system boot often practical run old software modern system using emulator rather relying features 2014 lenovo acquired ibm x86-based server business us 2.1 billion one strengths pc compatible design modular hardware design end-users could readily upgrade peripherals degree processor memory without modifying computer motherboard replacing whole computer case many microcomputers time however processor speed memory width increased limits original xt/at bus design soon reached particularly driving graphics video cards ibm introduce upgraded bus ibm ps/2 computer overcame many technical limits xt/at bus rarely used basis ibm compatible computers since required licence payments ibm ps/2 bus prior at-bus designs produced company seeking license unpopular hardware manufacturers several competing bus standards developed consortiums agreeable license terms various attempts standardize interfaces made practice many attempts either flawed ignored even many expansion options despite confusion users pc compatible design advanced much faster competing designs time even market dominance 1990s ibm influence pc architecture started decline ibm-brand pc became exception rather rule instead placing importance compatibility ibm pc vendors began emphasize compatibility windows 1993 version windows nt released could operate processors x86 set required applications recompiled developers hardware independence used silicon graphics sgi x86 workstations\u2013thanks nt hardware abstraction layer hal could operate nt vast application library mass-market personal computer hardware vendor dared incompatible latest version windows microsoft annual winhec conferences provided setting microsoft could lobby for\u2014and cases dictate\u2014the pace direction hardware pc industry microsoft intel become important ongoing development pc hardware industry writers began using word wintel refer combined hardware-software system terminology becoming misnomer intel lost absolute control direction x86 hardware development amd amd64 also non-windows operating systems like macos linux established presence x86 architecture although ibm pc designed expandability designers could anticipate hardware developments 1980s size industry would engender make things worse ibm choice intel 8088 cpu introduced several limitations developing software pc compatible platform example 8088 processor 20-bit memory addressing space expand pc beyond one megabyte lotus intel microsoft jointly created expanded memory ems bank-switching scheme allow memory provided add-in hardware accessed set four 16-kilobyte windows inside 20-bit addressing later intel cpus larger address spaces could directly address 16- megabytes mibs 80286 causing microsoft develop extended memory xms require additional hardware expanded extended memory incompatible interfaces anyone writing software used one megabyte provide systems greatest compatibility ms-dos began including emm386 simulated ems memory using xms memory protected mode os also written 80286 dos application compatibility difficult expected dos applications accessed hardware directly bypassing bios routines intended ensure compatibility also bios requests made first 32 interrupt vectors marked reserved protected mode processor exceptions intel video cards suffered incompatibilities standard interface using higher-resolution svga graphics modes supported later video cards manufacturer developed methods accessing screen memory including different mode numberings different bank switching arrangements latter used address large images within single 64kb segment memory previously vga standard used planar video memory arrangements effect easily extend greater colour depths higher resolutions offered svga adapters attempt creating standard named vesa bios extensions vbe made manufacturers used 386 introduced protected mode os could written time dos compatibility much easier virtual 8086 mode unfortunately programs could switch directly eventually new memory-model apis developed vcpi dpmi latter becoming popular great number third-party adapters standard programming pc could difficult professional developers would operate large test-suite various known-to-be-popular hardware combinations meanwhile consumers overwhelmed competing incompatible standards many different combinations hardware offer give idea sort pc would need operate software multimedia pc mpc standard set 1990 pc met minimum mpc standard could marketed mpc logo giving consumers easy-to-understand specification look software could operate minimally mpc-compliant pc would guaranteed operate mpc mpc level 2 mpc level 3 standards set later term mpc compliant never became popular mpc level 3 1996 mpc standards established late 1990s success microsoft windows driven rival commercial operating systems near-extinction ensured \u201c ibm pc compatible \u201d computer dominant computing platform meant developer made software wintel platform would still able reach vast majority computer users late 1980s major competitor windows percentage points market share apple inc. macintosh mac started billed computer rest us mac high prices closed architecture meant dos/windows onslaught quickly drove macintosh education desktop publishing niche emerged mid-2000s mid-1990s mac market share dwindled around 5 introducing new rival operating system become risky commercial venture experience shown even operating system technically superior windows would failure market beos os/2 example 1989 steve jobs said new next system either last new hardware platform succeed first fail four years later 1993 next announced ending production nextcube porting nextstep intel processors early pc history companies introduced xt-compatible chipsets example chips technologies introduced 82c100 xt controller integrated replaced six original xt circuits one 8237 dma controller one 8253 interrupt timer one 8255 parallel interface controller one 8259 interrupt controller one 8284 clock generator one 8288 bus controller similar non-intel chipsets appeared at-compatibles example opti 82c206 82c495xlc found many 486 early pentium systems x86 chipset market volatile though 1993 vlsi technology become dominant market player virtually wiped intel year later intel uncontested leader ever since wintel platform gained dominance intel gradually abandoned practice licensing technologies chipset makers 2010 intel involved litigation related refusal license processor bus related technologies companies like nvidia companies amd cyrix developed alternative cpus functionally compatible intel towards end 1990s amd taking increasing share cpu market pcs amd even ended playing significant role directing development x86 platform athlon line processors continued develop classic x86 architecture intel deviated netburst architecture pentium 4 cpus ia-64 architecture itanium set server cpus amd developed amd64 first major extension created intel intel later adopted x86-64 2006 intel began abandoning netburst release set core processors represented development earlier pentium iii major alternative wintel domination rise alternative operating systems since early 2000s marked start post-pc era term ibm pc compatible commonly used presently current mainstream desktop laptop computers based pc architecture ibm longer makes pcs competing hardware architectures either discontinued like amiga relegated niche enthusiast markets past successful exception apple macintosh platform used non-intel processors inception although macintosh initially based motorola 68000 family transitioned powerpc architecture macintosh computers transitioned intel processors beginning 2006 today macintosh computers share system architecture wintel counterparts boot microsoft windows without dos compatibility card processor speed memory capacity modern pcs many orders magnitude greater original ibm pc yet backwards compatibility largely maintained 32-bit operating system still operate many simpler programs written os early 1980s without needing emulator though emulator like dosbox near-native functionality full speed additionally many modern pcs still run dos directly although special options usb legacy mode sata-to-pata emulation may need set bios setup utility computers using extensible firmware interface might need set legacy bios mode able boot dos however bios/efi options mass-produced consumer-grade computers limited configured truly handle oses original variants dos recent spread x86-64 architecture distanced current computers operating systems internal similarity original ibm pc introducing yet another processor mode instruction set modified 64-bit addressing x86-64 capable processors also retain standard x86 compatibility", + "neighbors": [ + 11, + 22, + 42, + 85, + 106, + 108, + 134, + 185, + 211, + 234, + 236, + 345, + 413, + 564, + 571, + 639, + 670, + 679, + 755, + 776, + 870, + 897, + 961, + 1002, + 1024, + 1085, + 1090, + 1100, + 1138, + 1156, + 1188, + 1204, + 1215, + 1284, + 1287, + 1304, + 1421, + 1503, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 869, + "label": 9, + "text": "Rhino_(JavaScript_engine):rhino javascript engine rhino javascript engine written fully java managed mozilla foundation open source software separate spidermonkey engine also developed mozilla written c++ used mozilla firefox rhino project started netscape 1997 time netscape planning produce version netscape navigator written fully java needed implementation javascript written java netscape stopped work javagator called rhino project finished javascript engine since couple major companies including sun microsystems licensed rhino use products paid netscape allowing work continue originally rhino compiled javascript code java bytecode generated java class files produced best performance often beating c++ implementation javascript run just-in-time compilation jit suffered two faults first compiling time long since generating bytecode loading generated classes resource-intensive process also implementation effectively leaked memory since java virtual machines jvm n't collect unused classes strings interned result loading class file changed later versions java result fall 1998 rhino added interpretive mode classfile generation code moved optional dynamically loaded package compiling faster scripts longer use collected like java object rhino released mozilla foundation april 1998 originally rhino classfile generation held back release however licensors rhino agreed release rhino open source including class file generation since release open source rhino found variety uses increasing number people contributed code project gets name animal cover javascript book o'reilly media version 1.7r11 rhino supports java 8 supports number ecmascript es6/es2015 features rhino converts javascript scripts classes rhino works compiled interpreted mode intended used desktop server-side applications hence built-in support web browser objects commonly associated javascript rhino used debugger using rhino shell javascript shell provides simple way run scripts batch mode within interactive environment exploratory programming used applications embedding rhino slightly modified version rhino 1.6r2 comes bundled sun microsystems release java se version 6 released december 2006 makes easier integrate javascript part java programs access java resources javascript implementations java 6 may differ", + "neighbors": [ + 7, + 36, + 50, + 69, + 81, + 107, + 132, + 258, + 292, + 347, + 378, + 427, + 509, + 520, + 538, + 593, + 632, + 686, + 713, + 786, + 796, + 886, + 959, + 1091, + 1120, + 1138, + 1166, + 1210, + 1231, + 1264, + 1302, + 1372, + 1376, + 1423, + 1481, + 1508, + 1539, + 1566, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 870, + "label": 2, + "text": "IBM_PC_DOS:ibm pc dos ibm pc dos acronym ibm personal computer disk operating system discontinued operating system ibm personal computer manufactured sold ibm early 1980s 2000s ibm task force assembled develop pc decided critical components machine including operating system would come outside vendors radical break company tradition in-house development one key decisions made ibm pc industry standard time private company microsoft founded five years earlier bill gates eventually selected operating system ibm wanted microsoft retain ownership whatever software developed wanted nothing helping microsoft making suggestions afar according task force member jack sams reasons internal terrible problem sued people claiming stolen stuff could horribly expensive us programmers look code belonged someone else would come back say stole made money lost series suits n't want product clearly someone else product worked ibm people went microsoft proposition wanted product ibm first contacted microsoft look company july 1980 negotiations continued months followed paperwork officially signed early november although ibm expected customers would use pc dos ibm pc also supported cp/m-86 became available six months pc dos ucsd p-system operating systems ibm expectation proved correct one survey found 96.3 pcs ordered 40 pc dos compared 3.4 240 cp/m-86 history ibm pc dos various versions developed ibm and/or microsoft time pc dos 3.0 completed ibm team developers covering full os point time either ibm microsoft completely developed versions ibm pc dos going forward 1985 joint development agreement jda ibm microsoft development pc dos company giving company completely developed version time branded versions identical however cases companies made minor modifications version dos fall 1984 ibm gave source code documentation internally developed ibm topview dos microsoft microsoft could fully understand develop object-oriented operating environment overlapping windows development windows 2.0 multitasking windows used cooperative method share cpu entire life windows 1.0 millennium microsoft first licensed purchased 86-dos seattle computer products scp modified ibm pc microsoft employee bob o'rear assistance scp later microsoft employee tim paterson o'rear got 86-dos run prototype pc february 1981 86-dos converted 8-inch 5.25-inch floppy disks integrated bios microsoft helping ibm write ibm people writing requirements computer microsoft writing code o'rear often felt overwhelmed number people deal esd entry systems division facility boca raton florida perhaps first public mention operating system july 1981 byte discussed rumors forthcoming personal computer cp/m-like dos ... called simply 'ibm personal computer dos 86-dos rebranded ibm pc dos 1.0 august 1981 release ibm pc initial version dos largely based cp/m-80 1.x architecture function calls file-naming conventions copied directly older os significant difference fact introduced different file system fat12 unlike later dos versions date time commands separate executables rather part command.com single-sided 160 kilobyte kb 5.25 floppies disk format supported late 1981 paterson microsoft began writing pc dos 1.10 debuted may 1982 along revision b ibm pc support new double-sided drives added allowing 320 kb per disk number bugs fixed error messages prompts made less cryptic debug utility able load files greater 64k size later group microsoft programmers primarily paul allen mark zbikowski aaron reynolds began work pc dos 2.0 completely rewritten dos 2.0 added subdirectories hard disk support new ibm xt debuted march 1983 new 9-sector format bumped capacity floppy disks 360 kb unix-inspired kernel featured file handles place cp/m-derivative file control blocks loadable device drivers could used adding hardware beyond ibm pc bios supported basic utilities provided dos substantially upgraded well major undertaking took almost 10 months work dos 2.0 twice big dos 1.x occupying around 28k ram compared 12k predecessor would form basis microsoft consumer-oriented oses 2001 windows xp based windows nt released october 1983 officially november 1 dos 2.1 debuted fixed bugs added support half-height floppy drives new ibm pcjr 1983 compaq released compaq portable first 100 ibm pc compatible licensed oem version dos 1.10 quickly replaced dos 2.00 microsoft pc compatibles followed suit included hardware-specific dos features although generic august 1984 ibm introduced intel 80286-derived ibm pc/at next-generation machine along dos 3.00 despite jumping whole version number proved little incremental upgrade adding nothing substantial support new 1.2 megabyte mb floppy disks planned networking capabilities dos 3.00 judged buggy usable microsoft disabled prior os release case ibm original plans equip proper next-generation os would use extended features never materialized pc dos 3.1 released march 1985 fixed bugs dos 3.00 supported ibm network adapter card ibm pc network pc dos 3.2 added support 3\u00bd-inch double-density 720 kb floppy disk drives supporting ibm pc convertible ibm first computer use 3\u00bd-inch floppy disks released april 1986 later ibm personal system/2 1987 june 1985 ibm microsoft signed long-term joint development agreement share specified dos code create new operating system scratch known time advanced dos april 2 1987 os/2 announced first product produced agreement time ibm released next generation personal computers ibm personal system/2 ps/2 pc dos 3.3 released ps/2 line added support high density 3\u00bd-inch 1.44 megabyte mb floppy disk drives ibm introduced 80286-based higher ps/2 models upgrade dos 3.2 3.3 completely written ibm development effort part microsoft working advanced dos 1.0 dos 3.30 last version designed ibm xt floppy-only systems mind became one popular versions many users preferred buggy successor pc dos 4.0 internally known dos 3.4 originally shipped july 1988 dos 4.0 compatibility issues low-level disk utilities due internal data structure changes dos 4.0 used memory dos 3.30 also glitches newly added ems drivers compatible ibm ems boards common intel ast ones dos 4.0 also notable including first version dos shell full-screen utility designed make command-line os user-friendly microsoft took back control development released bug-fixed dos 4.01 dos 5 debuted june 1991 one biggest upgrades dos history dos 5 supported use high memory area hma upper memory blocks umbs 80286 later systems reduce conventional memory usage also dos commands supported option display command syntax aside ibm pc dos ms-dos version available oem editions vanished since time pcs 100 compatible customizations hardware differences longer necessary last version dos ibm microsoft shared full code dos integrated os/2 2.0 later windows nt virtual dos machine pc dos remained rebranded version ms-dos 1993 ibm microsoft parted ways\u2014ms-dos 6 released march pc dos 6.1 separately developed followed june new features ms-dos 6.0 appeared pc dos 6.1 including new boot menu support new commands choice deltree move qbasic dropped ms-dos editor replaced ibm e editor pc dos 6.1 reports dos 6.00 pc dos 6.3 followed december pc dos 6.3 also used os/2 powerpc pc dos 6.3 also featured superstor disk compression technology addstor pc dos 7 released april 1995 last release dos ibm software development development ibm viavoice moved austin rexx programming language added well support new floppy disk format xdf extended standard 1.44 mb floppy disk 1.86 mb superstor disk compression technology replaced stac electronics stacker algebraic command line calculator utility program load device drivers command line added pc dos 7 also included many optimizations increase performance reduce memory usage recent retail release pc dos 2000 \u2013 released austin 1998 \u2013 found niche embedded software market elsewhere pc dos 2000 slipstream 7.0 y2k fixes applied applications pc dos 2000 reports ibm pc dos 7.00 revision 1 contrast original pc dos 7 reported ibm pc dos 7.00 revision 0 hitachi used pc dos 2000 legacy drive fitness test 4.15 hitachi feature tool 2.15 2009 thinkpad products copy latest version pc dos rescue recovery partition pc dos 7.1 added support logical block addressing lba fat32 partitions various builds 1999 2003 released retail used products ibm serverguide scripting toolkit build version dos appeared norton ghost symantec version 7.1 indicates support fat32 also ms-dos builds version dos limited kernel files ibmbio.com ibmdos.com command.com updated programs fdisk32 format32 allow one prepare fat32 disks additional utilities taken pc dos 2000 needed 1986 ibm announced pc dos support client access file services defined distributed data management architecture ddm enabled programs pcs create manage access record-oriented files available ibm system/36 ibm system/38 ibm mainframe computers running cics 1988 client support stream-oriented files hierarchical directories added pc dos became available ddm server systems", + "neighbors": [ + 22, + 78, + 85, + 142, + 234, + 236, + 306, + 377, + 413, + 434, + 735, + 754, + 796, + 868, + 925, + 941, + 1012, + 1049, + 1050, + 1110, + 1138, + 1139, + 1188, + 1287, + 1304, + 1346, + 1394, + 1445, + 1546 + ], + "mask": "Validation" + }, + { + "node_id": 871, + "label": 4, + "text": "WANSecure_Firewall:wansecure firewall wanbound company provides hardware software products small medium-sized offices products include firewalls vpn backup devices content filtering wansecure firewall remotely monitored managed firewall top management services provided secured wanbound services offered wansecure firewall include", + "neighbors": [ + 494, + 576 + ], + "mask": "Validation" + }, + { + "node_id": 872, + "label": 9, + "text": "PhpStorm:phpstorm jetbrains phpstorm commercial cross-platform ide integrated development environment php built jetbrains intellij idea platform phpstorm provides editor php html javascript on-the-fly code analysis error prevention automated refactorings php javascript code phpstorm code completion supports php 5.3 5.4 5.5 5.6 7.0 7.1 7.2 modern legacy projects including generators coroutines finally keyword list foreach namespaces closures traits short array syntax includes full-fledged sql editor editable query results phpstorm built intellij idea written java users extend ide installing plugins created intellij platform write plugins features available webstorm included phpstorm adds support php databases webstorm ships pre-installed javascript plugins node.js ultimate edition jetbrains polyglot ide intellij idea supports functionality phpstorm plugins november 2015 jetbrains switched licensing phpstorm subscription basis annual subscriptions monthly subscriptions maintained 12 consecutive months also receive perpetual fallback license major version available time purchase phpstorm available individual developers business organizations additional discounted complementary licenses available startups students teachers non-commercial open source projects complementary licenses require approval include perpetual fallback clause i.e expire", + "neighbors": [ + 50, + 69, + 81, + 134, + 176, + 201, + 306, + 509, + 593, + 716, + 805, + 812, + 825, + 886, + 959, + 961, + 1005, + 1037, + 1050, + 1138, + 1221, + 1225, + 1235, + 1264, + 1280, + 1452, + 1550, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 873, + "label": 9, + "text": "Assignment_(computer_science):assignment computer science computer programming assignment statement sets and/or re-sets value stored storage location denoted variable name words copies value variable imperative programming languages assignment statement expression fundamental construct today commonly used notation basic operation come codice_1 originally superplan 1949\u201351 popularized fortran 1957 c followed codice_2 originally algol 1958 popularised pascal although many notations use languages symbol used regarded operator meaning assignment statement whole returns value others define assignment statement meaning used expression assignments typically allow variable hold different values different times life-span scope however languages primarily strictly functional allow kind destructive reassignment might imply changes non-local state purpose enforce referential transparency i.e functions depend state variable produce results given set parametric inputs point time modern programs languages also often use similar strategies although less strict certain parts order reduce complexity normally conjunction complementing methodologies data structuring structured programming object orientation assignment operation process imperative programming different values associated particular variable name time passes program model operates changing state using successive assignment statements primitives imperative programming languages rely assignment iteration lowest level assignment implemented using machine operations codice_3 codice_4 variables containers values possible put value variable later replace new one assignment operation modifies current state executing program consequently assignment dependent concept variables assignment example assuming codice_7 numeric variable assignment codice_8 means content variable codice_7 doubled execution statement example segment c code sample variable codice_10 first declared int assigned value 10 notice declaration assignment occur statement second line codice_11 declared without assignment third line codice_10 reassigned value 23 finally codice_11 assigned value 32.4 assignment operation necessary value codice_5 well-defined valid rvalue codice_6 represents modifiable entity valid modifiable non-const lvalue languages typically dynamic ones necessary declare variable prior assigning value languages variable automatically declared first time assigned scope declared varying language assignment changes existing value e.g codice_16 disallowed purely functional languages functional programming assignment discouraged favor single assignment also called initialization single assignment example name binding differs assignment described article done usually variable created subsequent reassignment allowed evaluation expression side effect change observable state machine produces values input imperative assignment introduce side effects destroying making old value unavailable substituting new one referred destructive assignment reason lisp functional programming similar destructive updating single assignment form assignment available purely functional languages haskell variables sense imperative programming languages rather named constant values possibly compound nature elements progressively defined on-demand purely functional languages provide opportunity computation performed parallel avoiding von neumann bottleneck sequential one step time execution since values independent impure functional languages provide single assignment well true assignment though true assignment typically used less frequency imperative programming languages example scheme single assignment codice_17 true assignment codice_18 used variables specialized primitives provided destructive update inside lists vectors strings etc ocaml single assignment allowed variables via codice_19 syntax however destructive update used elements arrays strings separate codice_20 operator well fields records objects explicitly declared mutable meaning capable changed initial declaration programmer functional programming languages use single assignment include clojure data structures vars erlang accepts multiple assignment values equal contrast haskell f haskell lava ocaml oz dataflow variables cells racket data structures like lists symbols sasl scala vals sisal standard ml non-backtracking prolog code considered explicit single-assignment explicit sense named variables explicitly unassigned state set exactly haskell contrast unassigned variables every variable thought implicitly set value rather computational object produce value demand created programming languages assignment statement returns value others expression-oriented programming languages example c assignment statement returns assigned value allowing idioms codice_21 assignment statement codice_22 returns value codice_7 assigned codice_10 statement codice_25 return value function used control loop assigning value variable programming languages scheme example return value assignment undefined idioms invalid haskell variable assignment operations similar assignment like assigning field array field mutable data structure usually evaluate unit type represented codice_26 type one possible value therefore containing information typically type expression evaluated purely side effects certain use patterns common thus often special syntax support primarily syntactic sugar reduce redundancy source code also assists readers code understanding programmer intent provides compiler clue possible optimization case assigned value depends previous one common many imperative languages notably c majority descendants provide special operators called augmented assignment like codice_27 codice_28 instead written codice_29 beyond syntactic sugar assists task compiler making clear in-place modification variable codice_7 possible statement like codice_31 called chained assignment value codice_32 assigned multiple variables codice_33 codice_11 chained assignments often used initialize multiple variables codice_35 programming languages support chained assignment chained assignments equivalent sequence assignments evaluation strategy differs languages simple chained assignments like initializing multiple variables evaluation strategy matter targets l-values assignment connected way evaluation strategy affects result programming languages c example chained assignments supported assignments expressions values case chain assignment implemented right-associative assignment assignments happen right-to-left example codice_36 equivalent codice_37 c++ also available values class types declaring appropriate return type assignment operator python assignment statements expressions thus value instead chained assignments series statements multiple targets single expression assignments executed left-to-right codice_36 evaluates expression codice_39 assigns result leftmost target codice_40 assigns result next target codice_41 using new value codice_40 essentially equivalent codice_43 though actual variable produced temporary value programming languages apl common lisp go javascript since 1.7 php maple lua occam 2 perl python rebol ruby windows powershell allow several variables assigned parallel syntax like simultaneously assigns 0 codice_7 1 codice_45 often known parallel assignment introduced cpl 1963 name simultaneous assignment sometimes called multiple assignment though confusing used single assignment opposites right-hand side assignment single variable e.g array structure feature called unpacking destructuring assignment list unpacked 0 assigned codice_7 1 codice_45 furthermore swaps values codice_7 codice_45 languages without parallel assignment would written use temporary variable since codice_50 leaves codice_7 codice_45 original value codice_45 languages go python combine parallel assignment tuples automatic allow multiple return values single function python example provides alternative use output parameters returning multiple values function dates clu 1974 clu helped popularize parallel assignment generally c c++ comma operator similar parallel assignment allowing multiple assignments occur within single statement writing codice_54 instead codice_55 primarily used loops replaced parallel assignment languages go however c++ code ensure perfect simultaneity since right side following code codice_56 evaluated left side languages python codice_57 assign two variables concurrently using initial value compute new b use equals sign codice_58 assignment operator frequently criticized due conflict equals comparison equality results confusion novices writing code confusion even experienced programmers reading code use equals assignment dates back heinz rutishauser language superplan designed 1949 1951 particularly popularized fortran beginning programmers sometimes confuse assignment relational operator equality means equality mathematics used assignment many languages assignment alters value variable equality testing tests whether two expressions value languages basic single equals sign codice_59 used assignment operator equality relational operator context determining meant languages use different symbols two operators example similarity two symbols lead errors programmer forgets form codice_58 codice_67 codice_68 appropriate mistypes codice_58 codice_67 intended common programming problem languages c including one famous attempt backdoor linux kernel assignment operator also returns value assigned way function returns value validly nested inside expressions intention compare two values codice_71 statement instance assignment quite likely return value interpretable boolean true case codice_72 clause executed leading program behave unexpectedly language processors gcc detect situations warn programmer potential error two common representations copying assignment equals sign codice_58 colon-equals codice_68 forms may semantically denote either assignment statement assignment operator also value depending language and/or usage possibilities include left arrow keyword though rarer variants mathematical pseudo code assignments generally depicted left-arrow platforms put expression left variable right expression-oriented languages lisp tcl uniformly use prefix postfix syntax statements including assignment", + "neighbors": [ + 65, + 78, + 117, + 152, + 216, + 246, + 251, + 306, + 308, + 373, + 392, + 447, + 488, + 509, + 538, + 567, + 579, + 594, + 597, + 682, + 690, + 790, + 820, + 825, + 919, + 1095, + 1152, + 1217, + 1221, + 1225, + 1227, + 1235, + 1311, + 1324, + 1418, + 1430, + 1477, + 1508, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 874, + "label": 7, + "text": "Gremlin_(programming_language):gremlin programming language gremlin graph traversal language virtual machine developed apache tinkerpop apache software foundation gremlin works oltp-based graph databases well olap-based graph processors gremlin automata functional language foundation enable gremlin naturally support imperative declarative querying host language agnosticism user-defined domain specific languages extensible compiler/optimizer single- multi-machine execution models hybrid depth- breadth-first evaluation well turing completeness explanatory analogy apache tinkerpop gremlin graph databases jdbc sql relational databases likewise gremlin traversal machine graph computing java virtual machine general purpose computing gremlin apache2-licensed graph traversal language used graph system vendors typically two types graph system vendors oltp graph databases olap graph processors table outlines graph vendors support gremlin following examples gremlin queries responses gremlin-groovy environment relative graph representation movielens dataset dataset includes users rate movies users one occupation movie one categories associated movielens graph schema detailed gremlin supports declarative graph pattern matching similar sparql instance following query uses gremlin match -step gremlin virtual machine composed instruction set well execution engine analogy drawn gremlin java following traversal gremlin traversal gremlin-java8 dialect gremlin language i.e fluent-style expressing graph traversal represented host language supports function composition function nesting due simple requirement exists various gremlin dialects including gremlin-groovy gremlin-scala gremlin-clojure etc gremlin-java8 traversal ultimately compiled step sequence called traversal string representation traversal provided steps primitives gremlin graph traversal machine parameterized instructions machine ultimately executes gremlin instruction set approximately 30 steps steps sufficient provide general purpose computing typically required express common motifs graph traversal query given gremlin language instruction set virtual machine possible design another traversal language compiles gremlin traversal machine analogous scala compiles jvm instance popular sparql graph pattern match language compiled execute gremlin machine following sparql query would compile gremlin-java8 sparql query would represented compile identical gremlin step sequence i.e traversal gremlin graph traversal machine execute single machine across multi-machine compute cluster execution agnosticism allows gremlin run graph databases oltp graph processors olap", + "neighbors": [ + 18, + 154, + 178, + 192, + 296, + 318, + 538, + 620, + 715, + 796, + 1091, + 1138, + 1163, + 1254, + 1454, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 875, + "label": 4, + "text": "Xplico:xplico xplico network forensics analysis tool nfat software reconstructs contents acquisitions performed packet sniffer e.g wireshark tcpdump netsniff-ng unlike protocol analyzer whose main characteristic reconstruction data carried protocols xplico born expressly aim reconstruct protocol application data able recognize protocols technique named port independent protocol identification pipi name xplico refers latin verb explico significance xplico free open-source software subject requirements gnu general public license gpl version 2 clarify xplico imagine raw data ethernet ppp web navigation http protocol case xplico able extract reconstruct web pages contents images files cookies similarly xplico able reconstruct e-mail exchanged imap pop smtp protocols among protocols xplico identifies reconstructs voip msn irc http imap pop smtp ftp xplico software architecture provides output module xplico different user interfaces fact used command line web user interface called xplico interface protocol dissector modules decoding individual protocol protocol dissector reconstruct extract data protocol modules plug-in configuration file loaded execution program allows focus decoding want decode voip calls web traffic configure xplico load rtp sip modules excluding http module another feature xplico ability process reconstruct huge amounts data able manage pcap files multiple gigabytes even terabytes multiple capture probes simultaneously thanks use various types input modules pcap files uploaded many ways directly xplico web user interface sftp transmission channel called pcap-over-ip features xplico used contexts lawful interception network forensics xplico also specific version called pcap2wav able decode voip calls based rtp protocol sip h323 mgcp skinny supports decodidica audio codecs g711ulaw g711alaw g722 g729 g723 g726 msrta microsoft real-time audio examples assumed eth0 used network interface xplico -m rltm -i eth0 xplico -m pcap -f example.pcap xplico -m pcap -d /path/dir/ cases data decoded stored directory named xdecode parameter -m select input module type input module named rltm acquires data directly network interface vice versa input module named pcap acquires data form pcap files directory xplico installed default major distributions digital forensics penetration testing", + "neighbors": [ + 134, + 138, + 160, + 306, + 747, + 1138, + 1206, + 1225, + 1235, + 1317, + 1337, + 1395, + 1400, + 1448 + ], + "mask": "Train" + }, + { + "node_id": 876, + "label": 4, + "text": "Race_condition:race condition race condition race hazard behavior electronics software system system substantive behavior dependent sequence timing uncontrollable events becomes bug one possible behaviors undesirable term race condition already use 1954 example david a. huffman doctoral thesis synthesis sequential switching circuits race conditions occur especially logic circuits multithreaded distributed software programs typical example race condition may occur logic gate combines signals traveled along different paths source inputs gate change slightly different times response change source signal output may brief period change unwanted state settling back designed state certain systems tolerate glitches output functions clock signal systems contain memory example system rapidly depart designed behaviour effect temporary glitch becomes permanent glitch consider example two-input gate fed logic signal one input negation another input theory output never true however changes value take longer propagate second input first changes false true brief period ensue inputs true gate output also true design techniques karnaugh maps encourage designers recognize eliminate race conditions cause problems often logic redundancy added eliminate kinds races well problems logic elements enter metastable states create problems circuit designers critical race condition occurs order internal variables changed determines eventual state state machine end non-critical race condition occurs order internal variables changed determine eventual state state machine end static race condition occurs signal complement combined together dynamic race condition occurs results multiple transitions one intended due interaction gates eliminated using two levels gating essential race condition occurs input two transitions less total feedback propagation time sometimes cured using inductive delay line elements effectively increase time duration input signal race conditions arise software application depends sequence timing processes threads operate properly electronics critical race conditions result invalid execution bugs critical race conditions often happen processes threads depend shared state operations upon shared states critical sections must mutually exclusive failure obey rule opens possibility corrupting shared state concept called data race type race condition data races important parts various formal memory models notably memory model defined c11 c++11 standards specify c c++ program containing data race undefined behavior race conditions reputation difficult reproduce debug since end result nondeterministic depends relative timing interfering threads problems occurring production systems therefore disappear running debug mode additional logging added attaching debugger often referred heisenbug therefore better avoid race conditions careful software design rather attempting fix afterwards simple example let us assume two threads want increment value global integer variable one ideally following sequence operations would take place case shown final value 2 expected however two threads run simultaneously without locking synchronization outcome operation could wrong alternative sequence operations demonstrates scenario case final value 1 instead expected result 2 occurs increment operations mutually exclusive mutually exclusive operations interrupted accessing resource memory location regard data races subset race conditions precise definition data race specific formal concurrency model used typically refers situation memory operation one thread could potentially attempt access memory location time memory operation another thread writing memory location context dangerous implies data race different race condition possible nondeterminism due timing even program without data races example program memory accesses use atomic operations dangerous many platforms two threads write memory location time may possible memory location end holding value arbitrary meaningless combination bits representing values thread attempting write could result memory corruption resulting value one neither thread attempted write sometimes called 'torn write similarly one thread reads location another thread writing may possible read return value arbitrary meaningless combination bits representing value memory location held write bits representing value written many platforms special memory operations provided simultaneous access cases typically simultaneous access using special operations safe simultaneous access using memory operations dangerous sometimes special operations safe simultaneous access called atomic synchronization operations whereas ordinary operations unsafe simultaneous access called data operations probably term data race many platforms race condition involving synchronization operations race may nondeterministic otherwise safe data race could lead memory corruption undefined behavior precise definition data race differs across formal concurrency models matters concurrent behavior often non-intuitive formal reasoning sometimes applied c++ standard draft n4296 2014-11-19 defines data race follows section 1.10.23 page 14 two actions potentially concurrent execution program contains data race contains two potentially concurrent conflicting actions least one atomic neither happens except special case signal handlers described omitted data race results undefined behavior parts definition relating signal handlers idiosyncratic c++ typical definitions data race paper detecting data races weak memory systems provides different definition two memory operations conflict access location least one write operation ... two memory operations x sequentially consistent execution form race \u3008x y\u3009 iff x conflict ordered hb1 relation execution race \u3008x y\u3009 data race iff least one x data operation two memory operations accessing location one write hb1 relation defined elsewhere paper example typical happens-before relation intuitively prove situation one memory operation x guaranteed executed completion another memory operation begins say x happens-before neither x happens-before happens-before x say x ordered hb1 relation clause ... ordered hb1 relation execution intuitively translated ... x potentially simultaneous paper considers dangerous situations least one memory operations data operation parts paper paper also defines class synchronization operations safe potentially simultaneous use contrast data operations java language specification provides different definition two accesses reads writes variable said conflicting least one accesses write ... program contains two conflicting accesses \u00a717.4.1 ordered happens-before relationship said contain data race ... data race cause incorrect behavior returning wrong length array critical difference c++ approach java approach c++ data race undefined behavior whereas java data race merely affects inter-thread actions means c++ attempt execute program containing data race could still adhering spec crash could exhibit insecure bizarre behavior whereas java attempt execute program containing data race may produce undesired concurrency behavior otherwise assuming implementation adheres spec safe important facet data races contexts program free data races guaranteed execute sequentially consistent manner greatly easing reasoning concurrent behavior program formal memory models provide guarantee said exhibit sc drf sequential consistency data race freedom property approach said achieved recent consensus presumably compared approaches guarantee sequential consistency cases approaches guarantee example java guarantee directly specified program correctly synchronized sequentially consistent executions free data races program correctly synchronized executions program appear sequentially consistent \u00a717.4.3 extremely strong guarantee programmers programmers need reason reorderings determine code contains data races therefore need reason reorderings determining whether code correctly synchronized determination code correctly synchronized made programmer need worry reorderings affect code program must correctly synchronized avoid kinds counterintuitive behaviors observed code reordered use correct synchronization ensure overall behavior program correct however use allow programmer reason possible behaviors program simple way behavior correctly synchronized program much less dependent possible reorderings without correct synchronization strange confusing counterintuitive behaviors possible contrast draft c++ specification directly require sc drf property merely observes exists theorem providing note shown programs correctly use mutexes memory_order_seq_cst operations prevent data races use synchronization operations behave operations executed constituent threads simply interleaved value computation object taken last side effect object interleaving normally referred \u201c sequential consistency \u201d however applies data-race-free programs data-race-free programs observe program transformations change single-threaded program semantics fact single-threaded program transformations continue allowed since program behaves differently result must perform undefined operation.\u2014 end note note c++ draft specification admits possibility programs valid use synchronization operations memory_order memory_order_seq_cst case result may program correct guarantee sequentially consistency provided words c++ correct programs sequentially consistent approach thought give c++ programmers freedom choose faster program execution cost giving ease reasoning program various theorems often provided form memory models provide sc drf guarantees given various contexts premises theorems typically place constraints upon memory model therefore upon implementation also upon programmer say typically case programs meet premises theorem could guaranteed execute sequentially consistent manner drf1 memory model provides sc drf allows optimizations wo weak ordering rcsc release consistency sequentially consistent special operations vax memory model data-race-free-0 memory models plpc memory model provides sc drf allows optimizations tso total store order pso pc processor consistency rcpc release consistency processor consistency special operations models drfrlx provides sketch sc drf theorem presence relaxed atomics many software race conditions associated computer security implications race condition allows attacker access shared resource cause actors utilize resource malfunction resulting effects including denial service privilege escalation specific kind race condition involves checking predicate e.g authentication acting predicate state change time check time use kind bug exists security-sensitive code security vulnerability called time-of-check-to-time-of-use tocttou bug created race conditions also intentionally used create hardware random number generators physically unclonable functions pufs created designing circuit topologies identical paths node relying manufacturing variations randomly determine paths complete first measuring manufactured circuit specific set race condition outcomes profile collected circuit kept secret order later verify circuit identity two programs may collide attempts modify access file system result data corruption privilege escalation file locking provides commonly used solution cumbersome remedy involves organizing system way one unique process running daemon like exclusive access file processes need access data file via interprocess communication one process requires synchronization process level different form race condition exists file systems unrelated programs may affect suddenly using available resources disk space memory space processor cycles software carefully designed anticipate handle race situation may become unpredictable risk may overlooked long time system seems reliable eventually enough data may accumulate enough software may added critically destabilize many parts system example occurred near loss mars rover spirit long landing solution software request reserve resources need beginning task request fails task postponed avoiding many points failure could occurred alternatively points equipped error handling success entire task verified afterwards continuing common approach simply verify enough system resources available starting task however may adequate complex systems actions running programs unpredictable networking consider distributed chat network like irc user starts channel automatically acquires channel-operator privileges two users different servers different ends network try start same-named channel time user respective server grant channel-operator privileges user since neither server yet received server signal allocated channel problem largely solved various irc server implementations case race condition concept shared resource covers state network channels exist well users started therefore privileges server freely change long signals servers network changes update conception state network however latency across network makes possible kind race condition described case heading race conditions imposing form control access shared resource\u2014say appointing one server control holds privileges\u2014would mean turning distributed network centralized one least one part network operation race conditions also exist computer program written non-blocking sockets case performance program dependent speed network link software flaws life-critical systems disastrous race conditions among flaws therac-25 radiation therapy machine led death least three patients injuries several another example energy management system provided ge energy used ohio-based firstenergy corp among power facilities race condition existed alarm subsystem three sagging power lines tripped simultaneously condition prevented alerts raised monitoring technicians delaying awareness problem software flaw eventually led north american blackout 2003 ge energy later developed software patch correct previously undiscovered error neuroscience demonstrating race conditions occur mammal rat brains well many software tools exist help detect race conditions software largely categorized two groups static analysis tools dynamic analysis tools thread safety analysis static analysis tool annotation-based intra-procedural static analysis originally implemented branch gcc reimplemented clang supporting pthreads dynamic analysis tools include several benchmarks designed evaluate effectiveness data race detection tools", + "neighbors": [ + 86, + 123, + 216, + 227, + 280, + 300, + 314, + 338, + 340, + 362, + 363, + 375, + 379, + 465, + 572, + 611, + 719, + 737, + 750, + 762, + 846, + 847, + 980, + 1013, + 1081, + 1099, + 1219, + 1308, + 1361, + 1473, + 1507, + 1525 + ], + "mask": "Validation" + }, + { + "node_id": 877, + "label": 2, + "text": "IOS_9:ios 9 ios 9 ninth major release ios mobile operating system developed apple inc. successor ios 8 announced company worldwide developers conference june 8 2015 released september 16 2015 succeeded ios 10 september 13 2016. ios 9 incorporated many feature updates built-in apps notably notes received ability draw sketches different tools image insertion prominent visual appearance website links map locations advanced list formatting all-new apple news app aggregates articles different sources apple maps received mass transit support although limited number locations launch major new system updates include proactivity siri advanced search combined make operating system contextually aware information time location provide user information ahead time searching proactive intelligence display instant results widget-like format including weather sports news ios 9 also added multiple forms multitasking ipad ios 9.3 apple added night shift mode changes color device display warmer less blue light shade prevent potential negative screen effect users circadian rhythms additionally ios 9 brought new user experience functions including quick actions peek pop based touch-sensitive display technology iphone 6s quick actions shortcuts home screen app icons users preview peek content without moving away current screen enter pop previewed content full view reception ios 9 positive critics praised proactivity siri making notification center central location information potential future updates improve functionality new multitasking features ipad complimented drawing photo insertion notes app however apple news criticized low number decent-looking articles apple maps criticized limited geographical availability mass transit support five days release apple announced ios 9 installed 50 active ios devices apple described fastest adoption rate ever new operating system ios 9 introduced apple worldwide developers conference june 8 2015 first beta made available registered developers keynote public beta made available july marked first time general public able test new versions ios official release eddy cue apple senior vice president internet software services telling fast company public beta program started maps referring company apple maps launch significant issues early days ios 9 officially released september 16 2015. ios 9.0.1 released september 23 2015 first update ios 9 fixed playback issues alarms timers made setup assistant work properly resolved distortion paused frames video playback photos safari ios 9.0.2 released september 30 2015 fix multiple bugs including lock screen bypass issue ios 9.1 released october 21 2015 update included support ipad pro apple pencil 4th-generation apple tv also added support 150 new emoji part unicode 7.0 8.0 emoji standards live photos intelligently sense user raises lowers phone n't record movements bug fixes improvements security performance also included ios 9.2 released december 8 2015 update included arabic language support siri iphone support apple lightning-to-sd-card reader accessory lets users transfer photos videos sd card commonly used dslr cameras iphone without need computer ios 9.2 also included new visual download indicator apple music support wi-fi calling users along bug fixes stability improvements ios 9.2.1 released january 19 2016 bug fixes february 18 2016 second version ios 9.2.1 released fix bricking issue impacted iphones touch id sensors repaired third-party ios 9.3 released march 21 2016 new 3d touch quick actions several apple built-in apps night shift mode notes password protection touch id news better personalized recommendations support in-line video iphone landscape view health activity view carplay updates apple music apple maps new languages siri multi-user mode ipad education support pairing multiple apple watches one iphone wi-fi calling verizon users support playing videos encoded dolby digital plus audio streams select lightning-equipped ios devices well major bug fixes ios 9.3.1 released march 31 2016 fix issue caused apps become unresponsive crash tapping links ios 9.3.2 released may 16 2016 update made possible use night shift low power mode simultaneously previously possible also fixed bluetooth issue iphone se however ios 9.3.2 bricked 9.7-inch ipad pros preventing used apple pulled update ipad pro may 20 2016 re-released 9.3.2 device june 2 2016 fixing issue ios 9.3.3 released july 18 2016 bug fixes performance improvements ios 9.3.4 released august 4 2016 fix memory corruption issue could enable app execute arbitrary code kernel privileges update consequently patched ios jailbreaking method used chinese programming group pangu team ios 9.3.5 released august 25 2016 fix three critical security vulnerabilities user clicked malicious link jailbreak enabled device installed spyware pegasus intercept collect information device well activate microphone track device location spyware used strong encryption avoid detection ios 9.3.6 released july 22 2019 address issue could impact gps location performance could cause system date time incorrect update available iphone 4s cellular models ipad mini 1st generation ipad 2 ipad 3rd generation iphone 6s iphone 6s plus touch-sensitive display feature called 3d touch incorporated ios 9 similar force touch found trackpad apple macbook computers quick actions shortcuts added apps support 3d touch feature triggered pressing slightly harder app icon also introduces actions known peek pop lets users firmly hold preview peek kind content hovering window optionally apply pressure enter pop content full view taptic engine iphone 6s provides haptic feedback time users press screen harder ios 9 comes two important battery-saving updates phone placed face-down screen light upon receiving notifications apple also added low power mode modifies amount energy dedicated background services animations example background app refresh push email paused low power mode phone reaches 20 battery level users automatically prompted turn low power mode changes color battery icon top row status bar screen yellow battery goes higher 80 level low power mode automatically turns back san francisco new system font replaced helvetica neue system typeface ios ios 9 added new battery widget notification center displayed battery life charging status connected bluetooth device shift button inactive lowercase letters displayed keyboard instead all-caps representation previous ios versions ios 9 smaller update ios 8 requiring 1.3 gb space compared 4.58 gb ios 8 additionally ios 9 includes option temporarily delete apps allow update install update installed apps automatically restored ios 9 also features app thinning functionality whereby necessary assets needed run apps individual device downloaded rather entire app potentially saving space ios 9 adds number features ipad improve productivity include slide split screen picture picture enhanced multitasking similar experience found os x el capitan slide allows user pull second app swipe right edge display app takes 1/3 screen sticks right side screen interactivity within full-screen app disabled left inactive background feature allows users perform quick tasks dismiss app user taps handle next slide window extends window towards left screen user enters split screen allows interact two apps simultaneously side-by-side 50/50 split users also switch another app either slide mode split screen view pulling handle top either app selecting another app list replace existing one picture picture mode allows users minimize facetime calls supported videos smaller window continue watching tasks ipad split screen multitasking feature available ipad air 2 ipad mini 4 ipad pro slide picture picture features available ipad air ipad air 2 ipad mini 2 newer ipad pro banner notifications tapped causing another app open back button top-left corner screen added bringing user back previous app night shift display mode introduced ios 9.3 mode shifts colors device display warmer similar f.lux popular program microsoft windows apple macos computers enabled uses device clock geographic location determine turn feature optionally user set manual schedule schedule ease access new night shift toggle control center settings night shift located display brightness settings app top enabling feature setting schedule user also set warmth display despite introduced ios 9.3 march 2016 n't possible use night shift low power mode simultaneously release ios 9.3.2 two months later night shift requires 64-bit processor found apple a7 newer chips means older ios devices including iphone 4s iphone 5 iphone 5c ipad 2 ipad 3 ipad 4 first-generation ipad mini ipod touch 5 receive night shift mode ios 9 includes performance speed improvements thanks expanded use metal api metal introduced ios 8 previously limited game developers ios 9 use metal expanded let handle many core user interface elements graphics intelligence one main features ios 9 consisting newly integrated siri search previously known spotlight well proactivity throughout operating system ios aware contextual information time location proactively provides user may need advance save time effort typing search also improved display instant answers at-a-glance widget-like format similar provided siri interface search display current weather sports scores news search screen proactive suggestions accessed either pulling notifications window safari web browser search bar left home screen intelligence also extends apps instance mail events automatically added calendar details found message content likely additional recipients suggested message composition siri also aware currently screen engaged holding home button ios 9 introduces multiple security enhancements introduces 6-digit passcode default extra two digits previous 4-digit default well support two-factor authentication original ios 9 release september 2015 fixed security issue within previous ios versions flaw allowed anyone within range airdrop user install malware target device tweak ios settings exploit would still work victim rejected incoming airdrop file settings app ios 9 search bar makes easier find settings options user also options notifications grouped app came ability turn shake undo ipad two-finger drag keyboard moves cursor freely like traditional trackpad making positioning cursor selecting text easier keyboard-to-trackpad feature also extended iphone 6s 6s plus users 3d touch force press keyboard enable trackpad also ipad shortcut bar added cut copy paste undo redo functions folders display 16 apps per page 4-by-4 arrangement compared 9 iphone allowing increased total 240 apps single folder ios 9 introduced wi-fi assist feature default automatically switches phone cellular data wi-fi connection spotty whenever user presented flight information user click link view preview flight ios 9.3 pdfs saved ibooks application via safari itunes synced icloud ios 9 setting enables icloud drive app home screen icloud drive lets user save browse files folders icloud health app introduced ios 8 received landscape mode iphone also added support reproductive health uv exposure water intake sedentary state data types ios 9.3 also tracks sleep exercise weight apple watch messages app allows user search text text highlighted scrolled apple maps adds support transit directions baltimore berlin chicago london los angeles mexico city new york city paris philadelphia san francisco toronto washington d.c. along 300 locations china maps app also enhanced location details including nearby feature recommends shops restaurants places drink close proximity user places serving food users specify exactly type food want ios 9 includes new apple news app replacing newsstand app aggregates news different sources similar style flipboard app features mobile-formatted layout loads quickly informative animations full-bleed images additionally news supports rss feeds safari web browser launch news app available united states expanded united kingdom australia ios 9.1 update march 2016 apple opened news platform news agencies including independent bloggers notes app received number enhancements ios 9 including ability draw sketches number different tools including ruler straight lines images also added links websites map locations get prominent visual appearance added notes ipad iphone landscape mode notes range color options drawing well eraser advanced formatting options including checked bulleted dashed numbered lists app also supports icloud allows easy folder creation secure notes feature introduced ios 9.3 lets ios user protect notes either passcode touch id photos app ios 9 included improved scrubber bar photo viewer screenshots selfies albums ability hold select multiple photos easily without delete individually also allows user hide sensitive material new hide option app also allows user pinch-to-zoom playing video release ios 9 safari web browser allows third-party content blocking apps safari also allows users customize appearance reader mode options font background color days release ios 9 ad blocking software topped app store charts marco arment developer peace app saying web advertising behavioral tracking control ... 're unacceptably creepy bloated annoying insecure 're getting worse alarming pace passbook application renamed wallet ios 9 includes many new changes support store loyalty cards gift cards discover credit/debit cards apple pay uk wallet app also accessed lock screen ios 9.3 music api allows developers integrate apps apple music streaming service ios 9 received mostly positive reviews dan seifert verge praised improvements proactivity siri highlighting notification drop-down contains information user needs although pointed google google microsoft cortana personal assistants offer similar services sometimes better varied ways achieving results improvements ios lay foundation even capabilities future chris velazco engadget liked small thoughtful design changes impressed new multitasking features ipad referring split screen lovely little feature however criticize low number decent-looking articles apple news writing 'll notice discrepancy articles handled -- formatted text white background outlet logo top also noted limited number locations apple maps launch supported mass transit directions matt swider techradar wrote siri proactivity lists robust enjoyed notifications sorted chronologically rather app samuel gibbs guardian welcomed changes built-in apps drawing photo insertion notes unknown number identification emails phone siri automatically launching music app upon plugging headphones also praised updates keyboard calling much easier use apple facing 5 million lawsuit allegedly slowing iphone 4s ios 9 according lawsuit ios 9 update slowed iphone 4s point phone unusable performance sluggish apple knew fact planned obsolescence september 21 2015 apple announced ios 9 installed 50 active ios devices measured app store according apple fastest adoption rate ever new operating system february 2016 news outlets reported users updated ios 9 particular device components repaired third-party notably touch id fingerprint recognition sensor rendered phone bricked issue named error 53 according ifixit limited iphone 6 6 plus devices apple stated protect fingerprint data using secure enclave uniquely paired touch id sensor iphone serviced authorised apple service provider apple retail store changes affect touch id sensor pairing re-validated ... check ensures device ios features related touch id remain secure without unique pairing malicious touch id sensor could substituted thereby gaining access secure enclave ios detects pairing fails touch id including apple pay disabled device remains secure apple released new version ios 9.2.1 later february fix issue february 2016 bug discovered could permanently disable 64-bit devices bug setting time 1 january 1970 would cause device get stuck reboot process ios 9.3 released march 21 2016 fixed issue may 2016 apple released ios 9.3.2 update followed reports bricked 9.7-inch ipad pros connect itunes message error 56 message itunes could n't restore tablet apple temporarily stopped offering 9.3.2 update re-release version june 2016 fixed issue release ios 9.3.3 july 2016 followed reports ibooks store crashed however apple explained august timing coincidence ibooks app crash result server issue software update release ios 9.3.5 august 2016 fixed three critical security vulnerabilities vulnerabilities could exploited silently enable jailbreak allow malicious installation spyware called pegasus pegasus could intercept read text messages emails track calls trace phone location activate microphone gather information apps including limited imessage gmail viber facebook whatsapp telegram skype discovery vulnerabilities dated 10 days 9.3.5 update released arab human rights defender ahmed mansoor received suspicious text message link sent citizen lab investigation ensued collaboration lookout revealed mansoor clicked link would jailbroken phone implanted spyware citizen lab linked attack israeli surveillance company known nso group sells pegasus governments lawful interception regarding widespread issue lookout explained blog post believe spyware wild significant amount time based indicators within code pointed code shows signs kernel mapping table values way back ios 7 news spyware received significant media attention particularly called sophisticated smartphone attack ever first time iphone history remote jailbreak exploit detected july 2017 information critical wi-fi security vulnerability affecting one billion ios android devices published issue named broadpwn allows attacker remotely take control nearby vulnerable smartphones turn affected devices rogue access points spreading infection nearby devices apple released security patch issue part ios 10.3.3 update though older devices running ios 9 including ipad 2 iphone 4s left without available update causing concerns safety product schools release apple drop support ios devices devices supporting ios 8 also able run ios 9", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 162, + 228, + 252, + 269, + 337, + 345, + 356, + 376, + 394, + 403, + 475, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 732, + 754, + 780, + 797, + 858, + 917, + 927, + 941, + 945, + 956, + 961, + 972, + 1001, + 1100, + 1140, + 1178, + 1237, + 1292, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 878, + "label": 4, + "text": "Rohit_Khare:rohit khare rohit khare computer science entrepreneur active many aspects development world wide web founder \u00e5ngstr\u00f6 co-founder knownow former director commercenet labs key player microformats community holds ph.d. university california irvine bachelors caltech computer science previously worked internet security w3c also active representational state transfer rest community august 2007 authored arrested paper syndication-oriented architecture variant service-oriented architecture", + "neighbors": [ + 14, + 576 + ], + "mask": "Test" + }, + { + "node_id": 879, + "label": 4, + "text": "Australian_Information_Security_Association:australian information security association nationally recognised not-for-profit organisation charity australian information security association aisa champions development robust information security sector building capacity professionals australia advancing cyber security safety australian public well businesses governments australia established 1999 aisa become recognised authority information security australia membership 3000 individuals across country aisa caters domains information security industry particular focus sharing expertise field meetings focus groups networking opportunities around australia aisa vision world people businesses governments educated risks dangers cyber attack data theft enable take reasonable precautions protect independent non-profit association created provide leadership development promotion improvement profession strategic plan calls continued work areas advocacy diversity education organisational excellence aisa hosts australia largest independent not-for-profit cyber security conference australian cyber conference https //cyberconference.com.au/ guidelines provide direction post-nominals represented indicate aisa membership status post-nominals letters placed following person \u2019 last name indicate aisa membership status encourage members use maisa aaisa faisa applicable post-nominals every opportunity including email sign-offs official letters tender documents etc helps raise profile professional status membership aisa post-nominals listed following order", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 880, + "label": 3, + "text": "Lot_Lot:lot lot player controls one arrow move pellets resemble pachinko balls upper cells four-second delay lower ones without confront evil crab grab player pellets try prevent player scoring cutting elastic crab forced leave board pellets find", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 881, + "label": 7, + "text": "Proven_(company):proven company proven hiring tool content hub small businesses across united states proven software allowed managers post jobs 100 job sites including simply hired craigslist indeed proven proven also offered tools allow users sort evaluate message onboard applicants job seekers could apply directly jobs proven mobile apps proven website proven job board partners proven based san francisco california austin texas used 1,000 small businesses throughout united states proven co-founded pablo fuentes sean falconer joe mellin 2009 company privately held seed investment andreessen horowitz greylock partners kapor capital 500 startups founder collective morado ventures angels august 2012 proven launched free proven job search app ios december 2012 proven job search android launched proven job search allows users search apply jobs directly ios android device users also import resume create one directly within app 2013 proven pivoted become hiring tool job board specifically restaurant hospitality industries proven app remains active tool applicants apply jobs early 2015 proven also rolled onboarding feature stores documents allows applicants sign electronically fall 2015 proven expanded hiring tool job board small businesses industries nationwide august 2019 proven announced acquired upward.net job site headquartered newark california", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 882, + "label": 8, + "text": "WalkMe:walkme walkme owned walkme inc. software-as-a-service saas company helps users navigate features web-based services walkme digital adoption platform dap works overlaying information tip-balloons browser window balloons break online processes step-by-step instructions according company dap collects data users behaviors action patterns platforms helps users complete online tasks without leaving screen watch video tutorials read manuals faq pages also allows users automatically get specific guidance according preference language walkme inc. founded 2011 dan adika raphael sweary eyal cohen yuval shalom ozanna april 2012 launched product walkme headquarters san francisco california january 2017 walkme acquired abbi startup specializes mobile a/b testing app engagement walkme retired abbi brand integrated services walkme \u2019 platform process also migrated abbi \u2019 existing customers april year walkme acquired jaco", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 883, + "label": 0, + "text": "Chatbot:chatbot chatbot piece software conducts conversation via auditory textual methods programs often designed convincingly simulate human would behave conversational partner although 2019 far short able pass turing test chatbots typically used dialog systems various practical purposes including customer service information acquisition chatbots use sophisticated natural language processing systems many simpler ones scan keywords within input pull reply matching keywords similar wording pattern database term chatterbot originally coined michael mauldin creator first verbot julia 1994 describe conversational programs today chatbots accessed via virtual assistants google assistant amazon alexa via messaging apps facebook messenger wechat via individual organizations apps websites chatbots classified usage categories conversational commerce e-commerce via chat analytics communication customer support design developer tools education entertainment finance food games health hr marketing news personal productivity shopping social sports travel utilities beyond chatbots conversational ai refers use messaging apps speech-based assistants chatbots automate communication create personalized customer experiences scale 1950 alan turing famous article computing machinery intelligence published proposed called turing test criterion intelligence criterion depends ability computer program impersonate human real-time written conversation human judge sufficiently well judge unable distinguish reliably\u2014on basis conversational content alone\u2014between program real human notoriety turing proposed test stimulated great interest joseph weizenbaum program eliza published 1966 seemed able fool users believing conversing real human however weizenbaum claim eliza genuinely intelligent introduction paper presented debunking exercise artificial intelligence ... machines made behave wondrous ways often sufficient dazzle even experienced observer particular program unmasked inner workings explained ... magic crumbles away stands revealed mere collection procedures ... observer says could written thought moves program question shelf marked intelligent reserved curios ... object paper cause re-evaluation program explained programs ever needed eliza key method operation copied chatbot designers ever since involves recognition clue words phrases input output corresponding pre-prepared pre-programmed responses move conversation forward apparently meaningful way e.g responding input contains word 'mother 'tell family thus illusion understanding generated even though processing involved merely superficial eliza showed illusion surprisingly easy generate human judges ready give benefit doubt conversational responses capable interpreted intelligent interface designers come appreciate humans readiness interpret computer output genuinely conversational\u2014even actually based rather simple pattern-matching\u2014can exploited useful purposes people prefer engage programs human-like gives chatbot-style techniques potentially useful role interactive systems need elicit information users long information relatively straightforward falls predictable categories thus example online help systems usefully employ chatbot techniques identify area help users require potentially providing friendlier interface formal search menu system sort usage holds prospect moving chatbot technology weizenbaum shelf ... reserved curios marked genuinely useful computational methods classic historic early chatbots eliza 1966 parry 1972 recent notable programs include a.l.i.c.e. jabberwacky d.u.d.e agence nationale de la recherche cnrs 2006 eliza parry used exclusively simulate typed conversation many chatbots include functional features games web searching abilities 1984 book called policeman beard half constructed published allegedly written chatbot racter though program released would capable one pertinent field ai research natural language processing usually weak ai fields employ specialized software programming languages created specifically narrow function required example a.l.i.c.e uses markup language called aiml specific function conversational agent since adopted various developers called alicebots nevertheless a.l.i.c.e still purely based pattern matching techniques without reasoning capabilities technique eliza using back 1966 strong ai would require sapience logical reasoning abilities jabberwacky learns new responses context based real-time user interactions rather driven static database recent chatbots also combine real-time learning evolutionary algorithms optimise ability communicate based conversation held still currently general purpose conversational artificial intelligence software developers focus practical aspect information retrieval chatbot competitions focus turing test specific goals two annual contests loebner prize chatterbox challenge latter offline since 2015 however materials still found web archives chatbots used diverse fashion across verticals many different types channel e.g websites social messaging etc business application accelerated rapidly 2019 leading van baker research vice president gartner predict \u201c 2020 50 medium large enterprises deployed product chatbots many companies chatbots run messaging apps simply via sms used b2c customer service sales marketing 2016 facebook messenger allowed developers place chatbots platform 30,000 bots created messenger first six months rising 100,000 september 2017 since september 2017 also part pilot program whatsapp airlines klm aerom\u00e9xico announced participation testing airlines previously launched customer services facebook messenger platform bots usually appear one user contacts sometimes act participants group chat many banks insurers media companies e-commerce companies airlines hotel chains retailers health care providers government entities restaurant chains used chatbots answer simple questions increase customer engagement promotion offer additional ways order 2017 study showed 4 companies used chatbots according 2016 study 80 businesses said intended one 2020 previous generations chatbots present company websites e.g ask jenn alaska airlines debuted 2008 expedia virtual customer service agent launched 2011 newer generation chatbots includes ibm watson-powered rocky introduced february 2017 new york city-based e-commerce company rare carat provide information prospective diamond buyers used marketers script sequences messages similar autoresponder sequence sequences triggered user opt-in use keywords within user interactions trigger occurs sequence messages delivered next anticipated user response user response used decision tree help chatbot navigate response sequnces deliver correct response message companies explore ways use chatbots internally example customer support human resources even internet-of-things iot projects overstock.com one reportedly launched chatbot named mila automate certain simple yet time-consuming processes requesting sick leave large companies lloyds banking group royal bank scotland renault citro\u00ebn using automated online assistants instead call centres humans provide first point contact saas chatbot business ecosystem steadily growing since f8 conference facebook mark zuckerberg unveiled messenger would allow chatbots app large companies like hospitals aviation organizations architects designing reference architectures intelligent chatbots used unlock share knowledge experience organization efficiently reduce errors answers expert service desks significantly intelligent chatbots make use kinds artificial intelligence like image moderation natural language understanding nlu natural language generation nlg machine learning deep learning nowadays high majority high-tech banking organizations looking integration automated ai-based solutions chatbots customer service order provide faster cheaper assistance clients becoming increasingly technodexterous particularly chatbots efficiently conduct dialogue usually substituting communication tools email phone sms banking area major application related quick customer service answering common requests transactional support several studies accomplished analytics agencies juniper gartner report significant reduction cost customer services leading billions dollars economy next 10 years gartner predicts integration 2020 chatbots least 85 client applications customer service juniper study announces impressive amount 8 billion retained annually 2022 due use chatbots since 2016 facebook allows businesses deliver automated customer support e-commerce guidance content interactive experiences chatbots large variety chatbots facebook messenger platform developed 2016 russia-based tochka bank launched world first facebook bot range financial services particularly including possibility making payments july 2016 barclays africa also launched facebook chatbot making first bank africa france third largest bank total assets soci\u00e9t\u00e9 g\u00e9n\u00e9rale launched chatbot called sobot march 2018 80 users sobot express satisfaction tested il never remplace expertise provided human advisor according sg deputy director bertrand cozzarolo several potential advantages using chatbots interaction customer banking chatbots also incorporated devices primarily meant computing toys hello barbie internet-connected version doll uses chatbot provided company toytalk previously used chatbot range smartphone-based characters children characters behaviors constrained set rules effect emulate particular character produce storyline ibm watson computer used basis chatbot-based educational toys companies cognitoys intended interact children educational purposes process building testing deploying chatbots done cloud-based chatbot development platforms offered cloud platform service paas providers oracle cloud platform snatchbot ibm watson cloud platforms provide natural language processing artificial intelligence mobile backend service chatbot development api companies like microsoft azure aarc currently providing bot engines chatbot platforms software developed malicious chatbots frequently used fill chat rooms spam advertisements mimicking human behavior conversations entice people revealing personal information bank account numbers commonly found yahoo messenger windows live messenger aol instant messenger instant messaging protocols also published report chatbot used fake personal ad dating service website tay ai chatbot learns previous interaction caused major controversy due targeted internet trolls twitter bot exploited 16 hours began send extremely offensive tweets users suggests although bot learnt effectively experience adequate protection put place prevent misuse text-sending algorithm pass human instead chatbot message would credible therefore human-seeming chatbots well-crafted online identities could start scattering fake news seem plausible instance making false claims presidential election enough chatbots might even possible achieve artificial social proof creation implementation chatbots still developing area heavily related artificial intelligence machine learning provided solutions possessing obvious advantages important limitations terms functionalities use cases however changing time common ones listed chatbots increasingly present businesses often used automate tasks require skill-based talents customer service taking place via messaging apps well phone calls growing numbers use-cases chatbot deployment gives organisations clear return investment call centre workers may particularly risk ai-driven chatbots study forrester june 2017 predicts 25 today jobs likely impacted ai technologies 2019", + "neighbors": [ + 159, + 307, + 368, + 372, + 429, + 453, + 596, + 625, + 704, + 733, + 832, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1443, + 1448, + 1486, + 1615 + ], + "mask": "Validation" + }, + { + "node_id": 884, + "label": 2, + "text": "Virtual_memory_compression:virtual memory compression virtual memory compression also referred ram compression memory compression memory management technique utilizes data compression reduce size number paging requests auxiliary storage virtual memory compression system paging requests compressed stored physical memory usually random-access memory ram sent compressed auxiliary storage hard disk drive hdd solid-state drive ssd cases virtual memory range whose contents compressed paging request marked inaccessible attempts access compressed pages trigger page faults reversal process retrieval auxiliary storage decompression footprint data paged reduced compression process first instance freed ram returned available physical memory pool compressed portion kept ram second instance compressed data sent auxiliary storage resulting i/o operation smaller therefore takes less time implementations including zswap zram helix software company \u2019 hurricane entire process implemented software systems ibm mxt compression process occurs dedicated processor handles transfers local cache ram virtual memory compression distinct garbage collection gc systems remove unused memory blocks cases consolidate used memory regions reducing fragmentation improving efficiency virtual memory compression also distinct context switching systems connectix ram doubler though also online compression apple os 7.1 inactive processes suspended compressed whole reducing i/o activity caused paging requests virtual memory compression produce overall performance improvements degree performance improvement depends variety factors including availability compression co-processors spare bandwidth cpu speed i/o channel speed physical memory compressibility physical memory contents multi-core multithreaded cpus benchmarks show performance improvements 50 situations embedded devices auxiliary storage limited non-existent cases virtual memory compression allow virtual memory system operate otherwise virtual memory would disabled allows system run certain software would otherwise unable operate environment virtual memory flash memory certain endurance limitations maximum number erase cycles undergo low 100 erase cycles systems flash memory used auxiliary storage system implementing virtual memory compression reduce total quantity data written auxiliary storage improving system reliability one primary issues degree contents physical memory compressed real-world loads program code much data held physical memory often highly compressible since efficient programming techniques data architectures designed automatically eliminate redundancy data sets various studies show typical data compression ratios ranging 2:1 2.5:1 program data similar typically achieval compression ratios disk compression order virtual memory compression provide measurable performance improvements throughput virtual memory system must improved compared uncompressed equivalent thus additional amount processing introduced compression must increase overall latency however i/o-bound systems applications highly compressible data sets gains substantial physical memory used compression system reduces amount physical memory available processes system runs may result increased paging activity reduced overall effectiveness virtual memory compression relationship paging activity available physical memory roughly exponential meaning reducing amount physical memory available system processes results exponential increase paging activity circumstances amount free physical memory low paging fairly prevalent performance gains provided compression system compared paging directly auxiliary storage may offset increased page fault rate leads thrashing degraded system performance opposite state enough physical memory available paging activity low compression may impact performance enough noticeable middle ground two circumstanceslow ram high paging activity plenty ram low paging activityis virtual memory compression may useful however compressible program data pronounced performance improvements less physical memory needed hold compressed data example order maximize use compressed pages cache helix software company hurricane 2.0 provides user-configurable compression rejection threshold compressing first 256 512 bytes 4 kib page virtual memory compression system determines whether configured compression level threshold achieved particular page achievable rest page would compressed retained compressed cache otherwise page would sent auxiliary storage normal paging system default setting threshold 8:1 compression ratio hardware implementations technology also relies price differentials various components system example difference cost ram cost processor dedicated compression relative price/performance differences various components tend vary time example addition compression co-processor may minimal impact cost cpu typical virtual memory implementation paging happens least recently used basis potentially causing compression algorithm use cpu cycles dealing lowest priority data furthermore program code usually read-only therefore never paged-out instead code simply discarded re-loaded program \u2019 auxiliary storage file needed case bar compression higher since i/o cycle attempting eliminate much shorter particularly flash memory devices virtual memory compression gone favor technology price speed ram external storage plummeted due moore law improved ram interfaces ddr3 thus reducing need virtual memory compression multi-core processors server farms mobile technology together advent flash based systems make virtual memory compression attractive paul r. wilson proposed compressed caching virtual memory pages 1990 paper circulated acm oopsla/ecoop '90 workshop garbage collection issues strategies heap management memory hierarchies appearing acm sigplan notices january 1991 helix software company pioneered virtual memory compression 1992 filing patent application process october year 1994 1995 helix refined process using test-compression secondary memory caches video cards devices however helix release product incorporating virtual memory compression july 1996 release hurricane 2.0 used stac electronics lempel\u2013ziv\u2013stac compression algorithm also used off-screen video ram compression buffer gain performance benefits 1995 ram cost nearly 50 per megabyte microsoft windows 95 listed minimum requirement 4 mb ram due high ram requirement several programs released claimed use compression technology gain \u201c memory \u201d notorious softram program syncronys softcorp softram revealed \u201c placebo software \u201d include compression technology products including hurricane magnaram included virtual memory compression implemented run-length encoding poor results giving technology negative reputation 8 april 1997 issue pc magazine published comprehensive test performance enhancement claims several software virtual memory compression tools testing pc magazine found minimal 5 overall performance improvement use hurricane none packages however tests run intel pentium systems single core single threaded thus compression directly impacted system activity 1996 ibm began experimenting compression 2000 ibm announced memory expansion technology mxt mxt stand-alone chip acted cpu cache cpu memory controller mxt integrated compression engine compressed data heading to/from physical memory subsequent testing technology intel showed 5\u201320 overall system performance improvement similar results obtained pc magazine hurricane", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 225, + 265, + 322, + 347, + 352, + 359, + 387, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 891, + 941, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1098, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1398, + 1415, + 1441, + 1474, + 1494, + 1518, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 885, + "label": 0, + "text": "Trigram:trigram trigrams special case n -gram n 3 often used natural language processing performing statistical analysis texts cryptography control use ciphers codes context important varying analysis rankings percentages easily derived drawing different sample sizes different authors different document types poetry science-fiction technology documentation writing levels stories children versus adults military orders recipes typical cryptanalytic frequency analysis finds 16 common character-level trigrams english encrypted messages sent telegraph often omit punctuation spaces cryptographic frequency analysis messages includes trigrams straddle word boundaries causes trigrams edt occur frequently even though may never occur one word messages sentence quick red fox jumps lazy brown dog following word level trigrams word-level trigram quick red following character-level trigrams underscore marks space", + "neighbors": [ + 159, + 289, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 886, + "label": 5, + "text": "SeaMonkey:seamonkey seamonkey free open-source internet suite continuation former mozilla application suite based source code grew netscape communicator formed base netscape 6 netscape 7 seamonkey created 2005 mozilla foundation decided focus standalone projects firefox thunderbird development seamonkey community-driven contrast mozilla application suite last released version 1.7.13 governed mozilla foundation new project-leading group called seamonkey council compared firefox seamonkey web browser keeps traditional-looking interface netscape mozilla suite many xul-based firefox thunderbird add-ons modified compatibility seamonkey although add-ons built webextensions architecture used newer firefox versions yet compatible seamonkey consists web browser descendant netscape family e-mail news client program seamonkey mail newsgroups shares code mozilla thunderbird html editor seamonkey composer software suite supports skins comes two skins default installation modern classic recent versions include irc client chatzilla installed extension seamonkey mail traditional e-mail client includes support multiple accounts junk mail detection message filters html message support address books among features shares code mozilla thunderbird thunderbird seamonkey built mozilla comm-central source tree seamonkey composer wysiwyg html editor main user interface features four tabs normal wysiwyg html tags html code browser preview generated code html 4.01 transitional seamonkey composer longer actively maintained underlying editor code shared mail component seamonkey project releases official builds linux macos windows also releases \u201c unofficial \u201d x86-64 builds linux avoid confusing organizations still want use original mozilla suite new product needed new name initial speculation members community july 2 2005 announcement confirmed seamonkey would officially become name internet suite superseding mozilla suite seamonkey lowercase refers brine shrimp used netscape mozilla foundation code name never-released netscape communicator 5 later mozilla suite originally name seamonkey derived netscape management replace buttmonkey developers chosen following internal contest codename.. seamonkey council trademarked name help mozilla foundation project uses separate numbering scheme first release called seamonkey 1.0 despite different name version number seamonkey 1.0 based code mozilla suite 1.7 trademark copyright reasons debian rebranded seamonkey distributed iceape 2013 march 10 2005 mozilla foundation announced would release official versions mozilla application suite beyond 1.7.x since focused standalone applications firefox thunderbird however foundation emphasized would still provide infrastructure community members wished continue development effect meant suite would still continue developed seamonkey council instead mozilla foundation seamonkey first released september 15 2005 seamonkey 1 released january 30 2006 core mozilla project source code licensed disjunctive tri-license changing mpl 2.0 gave choice one three following sets licensing terms mozilla public license version 1.1 later gnu general public license version 2.0 later gnu lesser general public license version 2.1 later seamonkey council team responsible project release management currently consists philip chee karsten d\u00fcsterloh jens hatlak robert kaiser ian neal neil rashbrook justin wood parts table based seamonkey release notes roadmap meeting notes", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 258, + 277, + 312, + 427, + 452, + 491, + 509, + 530, + 531, + 580, + 582, + 585, + 623, + 627, + 646, + 668, + 684, + 713, + 734, + 796, + 862, + 869, + 872, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1302, + 1331, + 1339, + 1376, + 1378, + 1395, + 1407, + 1408, + 1423, + 1424, + 1528, + 1539, + 1550, + 1563, + 1569, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 887, + "label": 6, + "text": "YAFFS:yaffs yaffs yet another flash file system designed written charles manning whitecliffs new zealand company aleph one yaffs1 first version file system designed then-current nand chips 512 byte page size 16 byte spare oob out-of-band area work started 2002 first released later year initial work sponsored toby churchill ltd brightstar engineering older chips also generally allow 2 3 write cycles per page yaffs takes advantage dirty pages marked writing specific spare area byte newer nand flash chips larger pages first 2k pages 64 bytes oob later 4k stricter write requirements page within erase block 128 kilobytes must written sequential order page must written designing storage system enforces write rule write property several advantages yaffs2 designed accommodate newer chips based yaffs1 source code major difference internal structures fixed assume 512 byte sizing block sequence number placed written page way older pages logically overwritten without violating write rule released late 2003 yaffs robust log-structured file system holds data integrity high priority secondary yaffs goal high performance yaffs typically outperform alternatives also designed portable used linux wince psos rtems ecos threadx various special-purpose oses variant 'yaffs/direct used situations os embedded oses bootloaders core filesystem simpler interfacing higher lower level code nand flash hardware yaffs codebase licensed gpl per-product licenses available aleph one special procedure initialize yaffs filesystem beyond simply erasing flash memory bad block encountered yaffs follows smart media scheme marking fifth byte block spare area blocks marked remain unallocated write file data yaffs initially writes whole page chunk yaffs terminology describes file metadata timestamps name path etc new file assigned unique object id number every data chunk within file contain unique object id within spare area yaffs maintains tree structure ram physical location chunks chunk longer valid file deleted parts file overwritten yaffs marks particular byte spare area chunk \u2018 dirty \u2019 entire block 32 pages marked dirty yaffs erase block reclaim space filesystem free space low yaffs consolidates group good pages onto new block yaffs reclaims space used dirty pages within original blocks yaffs system mounts nand flash device must visit block check valid data scanning spare area information reconstitutes memory-resident tree data structure yaffs2 similar concept yaffs1 shares much code yaffs2 code base supports yaffs1 data formats backward compatibility main difference yaffs2 needs jump significant hoops meet write requirement modern nand flash yaffs2 marks every newly written block sequence number monotonically increasing sequence chunks inferred block sequence number chunk offset within block thereby yaffs2 scans flash detects multiple chunks identical objectids chunknumbers choose use taking greatest sequence number efficiency reasons yaffs2 also introduces concept shrink headers example file resized smaller size yaffs1 mark affected chunks dirty yaffs2 due write rule yaffs2 instead writes shrink header indicates certain number pages point invalid lets yaffs2 reconstruct final state filesystem system reboots yaffs2 uses abstract definition nand flash allowing used wider variety flash parts different geometries bad block handling rules etc yaffs2 later added support checkpointing bypasses normal mount scanning allowing fast mount times performance vary mount times 3 seconds 2 gb reported", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 837, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1185, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1538, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 888, + "label": 4, + "text": "The_Project_Formerly_Known_As_Kindle_Forkbomb:project formerly known kindle forkbomb project project formerly known kindle forkbomb work done swiss-austrian-american duo known ubermorgen artists known creative use digital media combined means performance various offline medium convey ideas project showcased ubermorgen website www.uuuuuuuntitled.com project name project formerly known kindle forkbomb broken better understand meaning behind work forkbomb term used computing describing attack computer process continuously self-replicates machine resources depleted system crashes art project depicts machine process strips comments youtube uses algorithm compile comments finally titling work video title respective uploader make book book uploaded kindle publishing service placed kindle store machine monitors books making sure enough sales made keep alive store n't thriving store machine directed purchase copies thus prolonging shelf-life using process artists message intent show easily could clog store rapidly multiplying number books hence kindle forkbomb example critique digital world problems poses merely demonstration makes easier visualize world live ubermorgen describes media created human-machine combination creation new genre decentralized fiction writing artist group says books compressed form contemporary world describe snapshot frozen time type work form art sometimes referred uncreative spurred famous writer kenneth goldsmith efforts uncreative writing examples works produced project one thing note cover books feature uploader video title underneath everything text string bash shell version computer forkbomb following reference link takes website aloud read full pdf version books one project similar stephanie barber american artist uses many forms media art project relates kindle forkbomb book titled night moves book grouping youtube comments bob seger song night moves", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 889, + "label": 4, + "text": "Comparison_of_backup_software:comparison backup software feature comparison backup software general comparison see list backup software", + "neighbors": [ + 278, + 397, + 505, + 528, + 772, + 930, + 1459 + ], + "mask": "Validation" + }, + { + "node_id": 890, + "label": 3, + "text": "Hundra_(video_game):hundra video game hundra action game developed spanish studio zeus software published dinamic software amstrad cpc msx zx spectrum 1988 loosely inspired 1983 film hundra based hundra well received spanish press including review scores 44/50 amstrad accion 9/10 micromania game famous erotic cover art best title art 1988 award microhobby", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 891, + "label": 2, + "text": "Bus_error:bus error computing bus error fault raised hardware notifying operating system os process trying access memory cpu physically address invalid address address bus hence name modern use architectures much rarer segmentation faults occur primarily due memory access violations problems logical address permissions posix-compliant platforms bus errors usually result sigbus signal sent process caused error sigbus also caused general device fault computer detects though bus error rarely means computer hardware physically broken\u2014it normally caused bug software bus errors may also raised certain paging errors see least three main causes bus errors software instructs cpu read write specific physical memory address accordingly cpu sets physical address address bus requests hardware connected cpu respond results answer specific address hardware responds cpu raises exception stating requested physical address unrecognized whole computer system note covers physical memory addresses trying access undefined virtual memory address generally considered segmentation fault rather bus error though mmu separate processor tell difference cpus byte-addressable unique memory address refers 8-bit byte cpus access individual bytes memory address generally access larger units 16 bits 32 bits 64 bits without units aligned specific boundary x86 platform notable exception example multi-byte accesses must 16 bit-aligned addresses given bytes 0 2 4 6 would considered aligned therefore accessible addresses 1 3 5 would considered unaligned similarly multi-byte accesses must 32-bit aligned addresses 0 4 8 12 would considered aligned therefore accessible addresses would considered unaligned attempting access unit larger byte unaligned address cause bus error systems may hybrid depending architecture used example hardware based ibm system/360 mainframe including ibm system z fujitsu b8000 rca spectra univac series 90 instructions must 16-bit boundary execution addresses must start even byte attempts branch odd address results specification exception data however may retrieved address memory may one byte longer depending instruction cpus generally access data full width data bus times address bytes access memory full width data bus mask shift address individual byte systems tolerate inefficient algorithm essential feature software especially string processing unlike bytes larger units span two aligned addresses would thus require one fetch data bus possible cpus support functionality rarely required directly machine code level thus cpu designers normally avoid implementing instead issue bus errors unaligned memory access freebsd linux solaris signal bus error virtual memory pages paged e.g disappeared e.g accessing memory-mapped file executing binary image truncated program running just-created memory-mapped file physically allocated disk full x86 exists older memory management mechanism known segmentation application loads segment register selector non-present segment posix-compliant oses done assembly language exception generated oses used swapping linux generates sigbus example unaligned memory access written c programming language assembly syntax compiling running example posix compliant os x86 demonstrates error gdb debugger shows immediate value 0x2a stored location stored eax register using x86 assembly language example register indirect addressing printing low order bits address shows aligned word boundary dword using x86 terminology", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 85, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 270, + 272, + 306, + 322, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1022, + 1024, + 1027, + 1040, + 1044, + 1049, + 1053, + 1054, + 1063, + 1069, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Train" + }, + { + "node_id": 892, + "label": 6, + "text": "Filesystem-level_encryption:filesystem-level encryption filesystem-level encryption often called file-based encryption fbe file/folder encryption form disk encryption individual files directories encrypted file system contrast full disk encryption entire partition disk file system resides encrypted types filesystem-level encryption include advantages filesystem-level encryption include unlike cryptographic file systems full disk encryption general-purpose file systems include filesystem-level encryption typically encrypt file system metadata directory structure file names sizes modification timestamps problematic metadata needs kept confidential words files stored identifying file names anyone access physical disk know documents stored disk although contents documents one exception encryption support added zfs filesystem filesystem metadata filenames ownership acls extended attributes stored encrypted disk zfs metadata relating storage pool stored plaintext possible determine many filesystems datasets available pool including ones encrypted content stored files directories remain encrypted another exception cryfs replacement encfs cryptographic file systems specialized general-purpose file systems specifically designed encryption security mind usually encrypt data contain \u2013 including metadata instead implementing on-disk format block allocation file systems often layered top existing file systems e.g residing directory host file system many file systems also offer advanced features deniable encryption cryptographically secure read-only file system permissions different views directory structure depending key user ... one use cryptographic file system part existing file system synchronized 'cloud storage cases cryptographic file system could 'stacked top help protect data confidentiality", + "neighbors": [ + 34, + 35, + 40, + 55, + 63, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 528, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1240, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 893, + "label": 3, + "text": "Cell_(microprocessor):cell microprocessor cell multi-core microprocessor microarchitecture combines general-purpose powerpc core modest performance streamlined coprocessing elements greatly accelerate multimedia vector processing applications well many forms dedicated computation developed sony toshiba ibm alliance known sti architectural design first implementation carried sti design center austin texas four-year period beginning march 2001 budget reported sony approaching us 400 million cell shorthand cell broadband engine architecture commonly abbreviated cbea full cell part first major commercial application cell sony playstation 3 game console mercury computer systems dual cell server dual cell blade configuration rugged computer pci express accelerator board available different stages production toshiba announced plans incorporate cell high definition television sets seems abandoned idea exotic features xdr memory subsystem coherent element interconnect bus eib interconnect appear position cell future applications supercomputing space exploit cell processor prowess floating point kernels cell architecture includes memory coherence architecture emphasizes power efficiency prioritizes bandwidth low latency favors peak computational throughput simplicity program code reasons cell widely regarded challenging environment software development ibm provides linux-based development platform help developers program cell chips architecture widely used unless adopted software development community however cell strengths may make useful scientific computing regardless mainstream success mid-2000 sony computer entertainment toshiba corporation ibm formed alliance known sti design manufacture processor sti design center opened march 2001 cell designed period four years using enhanced versions design tools power4 processor 400 engineers three companies worked together austin critical support eleven ibm design centers period ibm filed many patents pertaining cell architecture manufacturing process software environment early patent version broadband engine shown chip package comprising four processing elements patent description known power processing element ppe processing element contained 8 apus referred spes current broadband engine chip chip package widely regarded run clock speed 4 ghz 32 apus providing 32 gigaflops fp8 quarter precision broadband engine shown 1 teraflops raw computing power design fabricated using 90 nm soi process march 2007 ibm announced 65 nm version cell production plant time globalfoundries east fishkill new york bandai namco entertainment used cell processor 357 arcade board well subsequent 369 february 2008 ibm announced begin fabricate cell processors 45 nm process may 2008 ibm introduced high-performance double-precision floating-point version cell processor powerxcell 8i 65 nm feature size may 2008 opteron- powerxcell 8i-based supercomputer ibm roadrunner system became world first system achieve one petaflops fastest computer world third quarter 2009 world three energy efficient supercomputers represented green500 list similarly based powerxcell 8i 45 nm cell processor introduced concert sony playstation 3 slim august 2009 november 2009 ibm discontinued development cell processor 32 apus still developing cell products may 17 2005 sony computer entertainment confirmed specifications cell processor would shipping then-forthcoming playstation 3 console cell configuration one ppe core eight physical spes silicon playstation 3 one spe locked-out test process practice helps improve manufacturing yields another one reserved os leaving 6 free spes used games code target clock-frequency introduction 3.2 ghz introductory design fabricated using 90 nm soi process initial volume production slated ibm facility east fishkill new york relationship cores threads common source confusion ppe core dual threaded manifests software two independent threads execution active spe manifests single thread playstation 3 configuration described sony cell processor provides nine independent threads execution june 28 2005 ibm mercury computer systems announced partnership agreement build cell-based computer systems embedded applications medical imaging industrial inspection aerospace defense seismic processing telecommunications mercury since released blades conventional rack servers pci express accelerator boards cell processors fall 2006 ibm released qs20 blade module using double cell processors tremendous performance certain applications reaching peak 410 gigaflops fp8 quarter precision per module qs22 based powerxcell 8i processor used ibm roadrunner supercomputer mercury ibm uses fully utilized cell processor eight active spes april 8 2008 fixstars corporation released pci express accelerator board based powerxcell 8i processor sony high performance media computing server zego uses 3.2 ghz cell/b.e processor cell broadband engine cell commonly known microprocessor intended hybrid conventional desktop processors athlon 64 core 2 families specialized high-performance processors nvidia ati graphics-processors gpus longer name indicates intended use namely component current future online distribution systems may utilized high-definition displays recording equipment well hdtv systems additionally processor may suited digital imaging systems medical scientific etc physical simulation e.g scientific structural engineering modeling simple analysis cell processor split four components external input output structures main processor called power processing element ppe two-way simultaneous-multithreaded powerpc 2.02 core eight fully functional co-processors called synergistic processing elements spes specialized high-bandwidth circular data bus connecting ppe input/output elements spes called element interconnect bus eib achieve high performance needed mathematically intensive tasks decoding/encoding mpeg streams generating transforming three-dimensional data undertaking fourier analysis data cell processor marries spes ppe via eib give access via fully cache coherent dma direct memory access main memory external data storage make best eib overlap computation data transfer nine processing elements ppe spes equipped dma engine since spe load/store instructions access local scratchpad memory spe entirely depends dmas transfer data main memory spes local memories dma operation transfer either single block area size 16kb list 2 2048 blocks one major design decisions architecture cell use dmas central means intra-chip data transfer view enabling maximal asynchrony concurrency data processing inside chip ppe capable running conventional operating system control spes start stop interrupt schedule processes running spes end ppe additional instructions relating control spes unlike spes ppe read write main memory local memories spes standard load/store instructions despite turing complete architectures spes fully autonomous require ppe prime useful work horsepower system comes synergistic processing elements use dma method data transfer limited local memory footprint spe pose major challenge software developers wish make horsepower demanding careful hand-tuning programs extract maximal performance cpu ppe bus architecture includes various modes operation giving different levels memory protection allowing areas memory protected access specific processes running spes ppe ppe spe risc architectures fixed-width 32-bit instruction format ppe contains 64-bit general purpose register set gpr 64-bit floating point register set fpr 128-bit altivec register set spe contains 128-bit registers used scalar data types ranging 8-bits 64-bits size simd computations variety integer floating point formats system memory addresses ppe spe expressed 64-bit values theoretic address range 2 bytes 16 exabytes 16,777,216 terabytes practice bits implemented hardware local store addresses internal spu synergistic processor unit processor expressed 32-bit word documentation relating cell word always taken mean 32 bits doubleword means 64 bits quadword means 128 bits 2008 ibm announced revised variant cell called powerxcell 8i available qs22 blade servers ibm powerxcell manufactured 65 nm process adds support 32 gb slotted ddr2 memory well dramatically improving double-precision floating-point performance spes peak 12.8 gflops 102.4 gflops total eight spes coincidentally peak performance nec sx-9 vector processor released around time ibm roadrunner supercomputer world fastest 2008-2009 consisted 12,240 powerxcell 8i processors along 6,562 amd opteron processors powerxcell 8i powered super computers also dominated top 6 greenest systems green500 list highest mflops/watt ratio supercomputers world beside qs22 supercomputers powerxcell processor also available accelerator pci express card used core processor qpace project since powerxcell 8i removed rambus memory interface added significantly larger ddr2 interfaces enhanced spes chip layout reworked resulted larger chip die packaging cell chip number different configurations basic configuration multi-core chip composed one power processor element ppe sometimes called processing element pe multiple synergistic processing elements spe ppe spes linked together internal high speed bus dubbed element interconnect bus eib ppe powerpc based dual-issue in-order two-way simultaneous-multithreaded core 23-stage pipeline acting controller eight spes handle computational workload ppe limited order execution capabilities perform loads order delayed execution pipelines ppe work conventional operating systems due similarity 64-bit powerpc processors spes designed vectorized floating point code execution ppe contains 64 kib level 1 cache 32 kib instruction 32 kib data 512 kib level 2 cache size cache line 128 bytes additionally ibm included altivec vmx unit fully pipelined single precision floating point altivec 1 support double precision floating-point vectors 32-bit fixed point unit fxu 64-bit register file per thread load store unit lsu 64-bit floating-point unit fpu branch unit bru branch execution unit bxu ppe consists three main units instruction unit iu execution unit xu vector/scalar execution unit vsu iu contains l1 instruction cache branch prediction hardware instruction buffers dependency checking login xu contains integer execution units fxu load-store unit lsu vsu contains execution resources fpu vmx ppe complete two double precision operations per clock cycle using scalar fused-multiply-add instruction translates 6.4 gflops 3.2 ghz eight single precision operations per clock cycle vector fused-multiply-add instruction translates 25.6 gflops 3.2 ghz ppe designed specifically cell processor development microsoft approached ibm wanting high performance processor core xbox 360 ibm complied made tri-core xenon processor based slightly modified version ppe added vmx128 extensions spe dual issue order processor composed synergistic processing unit spu memory flow controller mfc dma mmu bus interface spes n't branch prediction hardware hence heavy burden compiler spe 6 execution units divided among odd even pipelines spe spu runs specially developed instruction set isa 128-bit simd organization single double precision instructions current generation cell spe contains 256 kib embedded sram instruction data called local storage mistaken local memory sony documents refer vram visible ppe addressed directly software spe support 4 gib local store memory local store operate like conventional cpu cache since neither transparent software contain hardware structures predict data load spes contain 128-bit 128-entry register file measures 14.5 mm 90 nm process spe operate sixteen 8-bit integers eight 16-bit integers four 32-bit integers four single-precision floating-point numbers single clock cycle well memory operation note spu directly access system memory 64-bit virtual memory addresses formed spu must passed spu spe memory flow controller mfc set dma operation within system address space one typical usage scenario system load spes small programs similar threads chaining spes together handle step complex operation instance set-top box might load programs reading dvd video audio decoding display data would passed spe spe finally ending tv another possibility partition input data set several spes performing kind operation parallel 3.2 ghz spe gives theoretical 25.6 gflops single precision performance compared personal computer contemporaries relatively high overall floating point performance cell processor seemingly dwarfs abilities simd unit cpus like pentium 4 athlon 64 however comparing floating point abilities system one-dimensional application-specific metric unlike cell processor desktop cpus suited general purpose software usually run personal computers addition executing multiple instructions per clock processors intel amd feature branch predictors cell designed compensate compiler assistance prepare-to-branch instructions created double-precision floating point operations sometimes used personal computers often used scientific computing cell performance drops order magnitude still reaches 20.8 gflops 1.8 gflops per spe 6.4 gflops per ppe powerxcell 8i variant specifically designed double-precision reaches 102.4 gflops double-precision calculations tests ibm show spes reach 98 theoretical peak performance running optimized parallel matrix multiplication toshiba developed co-processor powered four spes ppe called spursengine designed accelerate 3d movie effects consumer electronics spe local memory 256 kb total spes 2 mb local memory eib communication bus internal cell processor connects various on-chip system elements ppe processor memory controller mic eight spe coprocessors two off-chip i/o interfaces total 12 participants ps3 number spu vary industrial applications eib also includes arbitration unit functions set traffic lights documents ibm refers eib participants 'units eib presently implemented circular ring consisting four 16 bytes wide unidirectional channels counter-rotate pairs traffic patterns permit channel convey three transactions concurrently eib runs half system clock rate effective channel rate 16 bytes every two system clocks maximum concurrency three active transactions four rings peak instantaneous eib bandwidth 96 bytes per clock 12 concurrent transactions 16 bytes wide 2 system clocks per transfer figure often quoted ibm literature unrealistic simply scale number processor clock speed arbitration unit imposes additional constraints discussed bandwidth assessment section ibm senior engineer david krolak eib lead designer explains concurrency model participant eib one 16 byte read port one 16 byte write port limit single participant read write rate 16 byte per eib clock simplicity often regarded 8 byte per system clock note spu processor contains dedicated dma management queue capable scheduling long sequences transactions various endpoints without interfering spu ongoing computations dma queues managed locally remotely well providing additional flexibility control model data flows eib channel stepwise around ring since twelve participants total number steps around channel back point origin twelve six steps longest distance pair participants eib channel permitted convey data requiring six steps data must take shorter route around circle direction number steps involved sending packet little impact transfer latency clock speed driving steps fast relative considerations however longer communication distances detrimental overall performance eib reduce available concurrency despite ibm original desire implement eib powerful cross-bar circular configuration adopted spare resources rarely represents limiting factor performance cell chip whole worst case programmer must take extra care schedule communication patterns eib able function high concurrency levels david krolak explained 3.2 ghz channel flows rate 25.6 gb/s viewing eib isolation system elements connects achieving twelve concurrent transactions flow rate works abstract eib bandwidth 307.2 gb/s based view many ibm publications depict available eib bandwidth greater 300 gb/s number reflects peak instantaneous eib bandwidth scaled processor frequency however technical restrictions involved arbitration mechanism packets accepted onto bus ibm systems performance group explained quote apparently represents full extent ibm public disclosure mechanism impact eib arbitration unit snooping mechanism interrupt generation segment page translation faults well described documentation set yet made public ibm practice effective eib bandwidth also limited ring participants involved nine processing cores sustain 25.6 gb/s read write concurrently memory interface controller mic tied pair xdr memory channels permitting maximum flow 25.6 gb/s reads writes combined two io controllers documented supporting peak combined input speed 25.6 gb/s peak combined output speed 35 gb/s add confusion older publications cite eib bandwidth assuming 4 ghz system clock reference frame results instantaneous eib bandwidth figure 384 gb/s arbitration-limited bandwidth figure 256 gb/s things considered theoretic 204.8 gb/s number often cited best one bear mind ibm systems performance group demonstrated spu-centric data flows achieving 197 gb/s cell processor running 3.2 ghz number fair reflection practice well cell contains dual channel rambus xio macro interfaces rambus xdr memory memory interface controller mic separate xio macro designed ibm xio-xdr link runs 3.2 gbit/s per pin two 32-bit channels provide theoretical maximum 25.6 gb/s i/o interface also rambus design known flexio flexio interface organized 12 lanes lane unidirectional 8-bit wide point-to-point path five 8-bit wide point-to-point paths inbound lanes cell remaining seven outbound provides theoretical peak bandwidth 62.4 gb/s 36.4 gb/s outbound 26 gb/s inbound 2.6 ghz flexio interface clocked independently typ 3.2 ghz 4 inbound 4 outbound lanes supporting memory coherency companies leadtek released pci-e cards based upon cell allow faster real time transcoding h.264 mpeg-2 mpeg-4 video august 29 2007 ibm announced bladecenter qs21 generating measured 1.05 giga\u2013floating point operations per second gigaflops per watt peak performance approximately 460 gflops one power efficient computing platforms date single bladecenter chassis achieve 6.4 tera\u2013floating point operations per second teraflops 25.8 teraflops standard 42u rack may 13 2008 ibm announced bladecenter qs22 qs22 introduces powerxcell 8i processor five times double-precision floating point performance qs21 capacity 32 gb ddr2 memory on-blade ibm discontinued blade server line based cell processors january 12 2012 several companies provide pci-e boards utilising ibm powerxcell 8i performance reported 179.2 gflops sp 89.6 gflops dp 2.8 ghz sony playstation 3 video game console first production application cell processor clocked 3.2 ghz containing seven eight operational spes allow sony increase yield processor manufacture six seven spes accessible developers one reserved os toshiba produced hdtvs using cell presented system decode 48 standard definition mpeg-2 streams simultaneously 1920\u00d71080 screen enable viewer choose channel based dozens thumbnail videos displayed simultaneously screen ibm supercomputer ibm roadrunner hybrid general purpose x86-64 opteron well cell processors system assumed 1 spot june 2008 top 500 list first supercomputer run petaflops speeds gained sustained 1.026 petaflops speed using standard linpack benchmark ibm roadrunner used powerxcell 8i version cell processor manufactured using 65 nm technology enhanced spus handle double precision calculations 128-bit registers reaching double precision 102 gflops per chip clusters playstation 3 consoles attractive alternative high-end systems based cell blades innovative computing laboratory group led jack dongarra computer science department university tennessee investigated application depth terrasoft solutions selling 8-node 32-node ps3 clusters yellow dog linux pre-installed implementation dongarra research first reported wired october 17 2007 interesting application using playstation 3 cluster configuration implemented astrophysicist gaurav khanna physics department university massachusetts dartmouth replaced time used supercomputers cluster eight playstation 3s subsequently next generation machine called playstation 3 gravity grid uses network 16 machines exploits cell processor intended application binary black hole coalescence using perturbation theory particular cluster performs astrophysical simulations large supermassive black holes capturing smaller compact objects generated numerical data published multiple times relevant scientific research literature cell processor version used playstation 3 main cpu 6 spes available user giving gravity grid machine net 16 general-purpose processors 96 vector processors machine one-time cost 9,000 build adequate black-hole simulations would otherwise cost 6,000 per run conventional supercomputer black hole calculations memory-intensive highly localizable well-suited architecture khanna claims cluster performance exceeds 100+ intel xeon core based traditional linux cluster simulations ps3 gravity grid gathered significant media attention 2007 2008 2009 2010 computational biochemistry biophysics lab universitat pompeu fabra barcelona deployed 2007 boinc system called ps3grid collaborative computing based cellmd software first one designed specifically cell processor united states air force research laboratory deployed playstation 3 cluster 1700 units nicknamed condor cluster analyzing high-resolution satellite imagery air force claims condor cluster would 33rd largest supercomputer world terms capacity lab opened supercomputer use universities research help computing power half million playstation 3 consoles distributed computing project folding home recognized guinness world records powerful distributed network world first record achieved september 16 2007 project surpassed one petaflops never previously attained distributed computing network additionally collective efforts enabled ps3 alone reach petaflops mark september 23 2007 comparison world second-most powerful supercomputer time ibm bluegene/l performed around 478.2 teraflops means folding home computing power approximately twice bluegene/l although cpu interconnect bluegene/l one million times faster mean network speed folding home may 7 2011 folding home runs 9.3 x86 petaflops 1.6 petaflops generated 26,000 active ps3s alone late 2008 cluster 200 playstation 3 consoles used generate rogue ssl certificate effectively cracking encryption ibm announced april 25 2007 would begin integrating cell broadband engine architecture microprocessors company line mainframes led gameframe architecture processor makes better suited hardware-assisted cryptographic brute force attack applications conventional processors due flexible nature cell several possibilities utilization resources limited different computing paradigms ppe maintains job queue schedules jobs spes monitors progress spe runs mini kernel whose role fetch job execute synchronize ppe kernel scheduling distributed across spes tasks synchronized using mutexes semaphores conventional operating system ready-to-run tasks wait queue spe execute spes use shared memory tasks configuration spe runs distinct program data comes input stream sent spes spe terminated processing output data sent output stream provides flexible powerful architecture stream processing allows explicit scheduling spe separately processors also able perform streaming tasks limited kernel loaded 2005 patches enabling cell support linux kernel submitted inclusion ibm developers arnd bergmann one developers aforementioned patches also described linux-based cell architecture linuxtag 2005 release 2.6.16 march 20 2006 linux kernel officially supports cell processor ppe spes programmable c/c++ using common api provided libraries fixstars solutions provides yellow dog linux ibm mercury cell-based systems well playstation 3 terra soft strategically partnered mercury provide linux board support package cell support development software applications various cell platforms including ibm bladecenter js21 cell qs20 mercury cell-based solutions terra soft also maintains y-hpc high performance computing cluster construction management suite y-bio gene sequencing tools y-bio built upon rpm linux standard package management offers tools help bioinformatics researchers conduct work greater efficiency ibm developed pseudo-filesystem linux coined spufs simplifies access use spe resources ibm currently maintaining linux kernel gdb ports sony maintains gnu toolchain gcc binutils november 2005 ibm released cell broadband engine cbe software development kit version 1.0 consisting simulator assorted tools web site development versions latest kernel tools fedora core 4 maintained barcelona supercomputing center website august 2007 mercury computer systems released software development kit playstation r 3 high-performance computing november 2007 fixstars corporation released new cvcell module aiming accelerate several important opencv apis cell series software calculation tests recorded execution times 3.2 ghz cell processor 6x 27x faster compared software 2.4 ghz intel core 2 duo illustrations different generations cell/b.e processors powerxcell 8i images scale cell/b.e packages measures 42.5\u00d742.5 mm powerxcell 8i measures 47.5\u00d747.5 mm", + "neighbors": [ + 86, + 101, + 105, + 116, + 127, + 134, + 193, + 210, + 270, + 271, + 331, + 445, + 457, + 460, + 571, + 579, + 643, + 649, + 730, + 738, + 766, + 839, + 893, + 907, + 1013, + 1016, + 1138, + 1143, + 1147, + 1158, + 1174, + 1224, + 1284, + 1503, + 1507, + 1518, + 1521, + 1538, + 1558 + ], + "mask": "Test" + }, + { + "node_id": 894, + "label": 3, + "text": "North_&_South_(video_game):north amp south video game north south combined strategy action game released 1989 commodore amiga atari st ported later nes amstrad cpc msx dos zx spectrum developed published infogrames north south offshoot belgian comic series les tuniques bleues raoul cauvin louis salverius/willy lambillotte dupuis based american civil war player basically acts civil war choosing play either north south player may choose start game year 1861 year civil war erupted 1864 year different array armies states side starts north south contains lot humorous elements example features parodies national anthems accessible player selects one different languages supported game english french spanish german italian addition game filled numerous comical situations gags taking simplified board interface game features strategic map united states separated states territories army units moved around state owns railway station fort capture leads player overtaking whole state otherwise capturing state involves simple movement unless another army state armies reinforced two ways turning option main menu player controlling state north carolina get periodic reinforcements ship also railways generate money turn generates soldiers moving army units player may expand westwards unoccupied territory two antagonistic armies clash result battle option main menu player turn in-game missions battles make purely like board game whenever opposing armies meet board-game mode results battles left chance outcome weighted towards larger army either army may retreat battles whenever side attempts capture enemy fort rob train result also randomised battle screen one action elements game different strategic map player starts opposite sides screen controls army consisting infantry cavalry artillery standard army consists six infantry three cavalry one cannon armies increased three times standard size merging together team six infantry three cavalry three cannons battlefield one time human player control one class units one time although cavalry starts charge left moving automatically forward straight line player focuses either cannon infantry computer-controlled opponent move three classes units infantry cavalry aggressive units class move fire simultaneously infantry move direction including backwards short-range weapon cavalry melee units much faster infantry move backwards cavalry instead return battle field every time reach end seconds cavalry returns way stop moving returning start position left-right axis unhindered movement up-down axis note cavalry movement started stop moving forwards unless player actively pulls horse reigns pushing backwards control method choice cannons move vertically sideways cannon fired nine times battle automatically withdraw battle army wins cannons withdrawn battle cannons available next battle however rest army killed cannons withdrawn cannons also lost middle battle map may river chasm case bridge serves choke point fighters likely meet bridge destroyed cannons one hit leave hole bridge units fall die instantly two hits bridge destroy every battlefield either river canyon narrow indestructible passage across cannons long-range weapons aiming \u2013 rather determining exact range \u2013 always easy care taken firing cannons avoid friendly fire battle usually deathmatch although player may retreat attacking army retreats return state beginning turn defending army decides retreat move adjacent state still control surrendering state battle enemy defenders retreat adjacent states retreating result loss cannons army army computer-controlled opponent retreat cannons destroyed enemy three times units states train station player must short side-scrolling mission fort capture state player controls single soldier runs towards goal clock reaches end meeting obstacles enemy soldiers dynamite crates dogs help knives punches send enemies towards sky asterix style occasions player also gets opportunity capture enemy train similar manner attacker running along train long see leave successfully capturing enemy train gets gold option turned storm cloud sit one state turn cloud move adjacent state twice month player turn army state cloud able move turn option main menu turned two non-player sides pose threat player armies native american lives west territory might hurl giant tomahawk randomly one westernmost states destroying army unfortunate enough garrisoned similarly sombrero-clad mexican living southwest might suddenly wake siesta toss bomb texas result option turned side controls north carolina chance turn free reinforcements arrive state via ship computer gaming world gave north south one-plus stars five wargamers three five arcade gamers 2011 wirtualna polska ranked tenth best amiga game june 2012 micro\u00efds anuman interactive \u2019 adventure game label released bluecoats north vs south remake ios android compatible devices windows ios version received metascore 60 metacritic another remake titled north south game released ios november 6 2012 bitcomposer entertainment ag", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 895, + "label": 4, + "text": "Copy-evident_document:copy-evident document copy-evident documents features make detectable copy original security printing various methods void pantograph used create patterns hard copy exactly copied inexactly produces easily detectable image include halftone screens affected copying process fine line patterns different directions differently affected copying hence produce mark metallic inks causing diffraction reflection copy-evident computer image files also possible example embedding high-frequency pattern jpeg image imperceptible produces obvious message re-compressed different quality factor forms paper watermarking digital watermarking regarded copy-evidence although detecting document file copied typically requires special inspection tools software example 3d printed objects equipped marks genuinity identified using measurement device hard deduce sample objects copies lack marks", + "neighbors": [ + 660 + ], + "mask": "Validation" + }, + { + "node_id": 896, + "label": 7, + "text": "LOCKSS:lockss lockss lots copies keep stuff safe project auspices stanford university peer-to-peer network develops supports open source system allowing libraries collect preserve provide readers access material published web main goal digital preservation system attempts replicate way libraries material published paper originally designed scholarly journals also used range materials examples include solinet project preserve theses dissertations eight universities us government documents metaarchive cooperative program preserving at-risk digital archival collections including electronic theses dissertations etds newspapers photograph collections audio-visual collections similar project called clockss controlled lockss tax-exempt 501 c 3 not-for-profit organization governed board directors made librarians publishers clockss runs lockss technology rutgers university libraries webpage comparing lockss clockss portico traditionally academic libraries retained issues scholarly journals either individually collaboratively providing readers access content received even publisher ceased subscription canceled digital age libraries often subscribe journals available digitally internet although convenient patron access model digital subscriptions allow libraries retain copy journal publisher ceases publish library cancels subscription publisher website day content paid longer available lockss system allows library permission publisher collect preserve disseminate patrons copy materials subscribed well open access material perhaps published creative commons license library system collects copy using specialized web crawler verifies publisher granted suitable permission system format-agnostic collecting whatever formats publisher delivers via http libraries collected material cooperate peer-to-peer network ensure preservation peers network vote cryptographic hash functions preserved content nonce peer outvoted regards copy damaged repairs publisher peers lockss license used publishers allows library readers access copy allow similar access libraries unaffiliated readers system support file sharing request library may supply another library content effect repair requesting library proved past good copy voting majority reader browser longer supports format copy collected format migration process convert current format limits use may made preserved copies copyright material effective persuading copyright owners grant necessary permission lockss approach selective collection permission publisher distributed storage restricted dissemination contrasts example internet archive approach omnivorous collection without permission publisher centralized storage unrestricted dissemination lockss system far smaller preserve subscription materials internet archive access since library administers lockss peer maintains copy preserved material since libraries worldwide see list participating libraries system provides much higher degree replication usual fault-tolerant system voting process makes use high degree replication eliminate need backups off-line media provide robust defenses attacks aimed corrupting preserved content addition preserving access libraries traditionally made difficult rewrite suppress printed material existence indeterminate large number identical copies somewhat tamper-resistant medium many independent administrations meant attempts alter remove copies published work would likely fail detected web publishing based single copy single administration provides none safeguards subversion web publishing therefore amenable tool rewriting history preserving many copies diverse administration automatically auditing copies intervals future publisher copy alerting libraries changes detected lockss system attempts restore many safeguards digital world publication prior implementing lockss system questions need considered carefully order make sure content verified evaluated auditable users user must ask questions procedures methods system evaluated disaster preparedness program questions enable user evaluate system create successful maintenance plan materials enable system reinforced carefully evaluated support structure source code entire lockss system carries bsd-style open-source licenses available github lockss trademark stanford university", + "neighbors": [ + 12, + 494, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 897, + "label": 2, + "text": "Linus_Torvalds:linus torvalds linus benedict torvalds born december 28 1969 finnish-american software engineer creator historically principal developer linux kernel kernel linux operating systems distributions operating systems android chrome os also created distributed version control system git scuba dive logging planning software subsurface honored along shinya yamanaka 2012 millennium technology prize technology academy finland recognition creation new open source operating system computers leading widely used linux kernel also recipient 2014 ieee computer society computer pioneer award 2018 ieee masaru ibuka consumer electronics award torvalds born helsinki finland 1969 son journalists anna nils torvalds grandson statistician leo t\u00f6rnqvist poet ole torvalds parents campus radicals university helsinki 1960s family belongs swedish-speaking minority torvalds named linus pauling nobel prize-winning american chemist although book rebel code linux open source revolution torvalds quoted saying think named equally linus peanuts cartoon character noting makes half nobel prize-winning chemist half blanket-carrying cartoon character torvalds attended university helsinki 1988 1996 graduating master degree computer science nodes research group academic career interrupted first year study joined finnish army uusimaa brigade summer 1989 selecting 11-month officer training program fulfill mandatory military service finland army held rank second lieutenant role ballistic calculation officer torvalds bought computer science professor andrew tanenbaum book tanenbaum describes minix educational stripped-down version unix 1990 resumed university studies exposed unix first time form dec microvax running ultrix m.sc thesis titled linux portable operating system interest computers began commodore vic-20 age 11 1981 initially programming basic later directly accessing 6502 cpu machine code make use assembly language vic-20 purchased sinclair ql modified extensively especially operating system hard get software finland linus wrote assembler editor addition pac-man graphics libraries ql well games wrote pac-man clone named cool man january 5 1991 purchased intel 80386-based clone ibm pc receiving minix copy turn enabled begin work linux first prototypes linux publicly released later year 1991 version 1.0 released march 14 1994 torvalds first encountered gnu project 1991 another swedish-speaking computer science student lars wirzenius took university technology listen free software guru richard stallman speech torvalds used stallman gnu general public license version 2 gplv2 linux kernel visit transmeta late 1996 torvalds accepted position company california would work february 1997 june 2003 moved open source development labs since merged free standards group become linux foundation whose auspices continues work june 2004 torvalds family moved dunthorpe oregon closer osdl beaverton oregon-based headquarters 1997 1999 involved 86open helping choose standard binary format linux unix 1999 named mit technology review tr100 one world top 100 innovators age 35 1999 red hat va linux leading developers linux-based software presented torvalds stock options gratitude creation year companies went public torvalds share value temporarily shot roughly us 20 million personal mascot penguin nicknamed tux widely adopted linux community mascot linux kernel although torvalds believes open source right way software also said uses best tool job even includes proprietary software criticized use alleged advocacy proprietary bitkeeper software version control linux kernel torvalds subsequently wrote free-software replacement bitkeeper called git 2008 torvalds stated used fedora distribution linux fairly good support powerpc processor architecture favored time usage fedora confirmed later 2012 interview also posted updates choice desktop environment often response perceived feature regressions currently linux foundation sponsors torvalds work full-time improving linux linus torvalds known disagreeing developers linux kernel mailing list calling really unpleasant person later explained 'd like nice person curse less encourage people grow rather telling idiots 'm sorry \u2013 tried attitude torvalds considers necessary making point clear drawn criticism intel programmer sage sharp systemd developer lennart poettering among others sunday september 16 2018 linux kernel code conflict suddenly replaced new code conduct based contributor covenant shortly thereafter release notes linux 4.19-rc4 linus apologized behavior calling personal attacks past unprofessional uncalled announced period time get assistance understand people \u2019 emotions respond appropriately soon transpired events followed new yorker approaching linus series questions critical conduct following release linux 4.19 october 22 linus went back maintaining kernel initially torvalds wanted call kernel developed freax combination free freak letter x indicate unix-like system friend ari lemmke administered ftp server kernel first hosted download named torvalds directory linux 2006 approximately two percent linux kernel written torvalds thousands contributed linux kernel percentage one largest contributions however stated 2012 personal contribution mostly merging code written others little programming torvalds retains highest authority decide new code incorporated standard linux kernel torvalds holds linux trademark monitors use chiefly linux mark institute linus torvalds married tove torvalds n\u00e9e monni \u2014a six-time finnish national karate champion\u2014whom first met late 1993 linus running introductory computer laboratory exercises students instructed course attendees send e-mail test tove responded e-mail asking date tove linus later married three daughters patricia miranda born 1996 daniela yolanda born 1998 celeste amanda born 2000 two born united states linux kernel reboot system call accepts dates birth written hexadecimal magic values torvalds described completely a-religious\u2014atheist adding find people seem think religion brings morals appreciation nature actually think detracts gives people excuse say 'oh nature created act creation seen something miraculous appreciate fact 'wow incredible something like could happened first place later added europe religion mostly personal issue united states become politicized discussing issue church state separation torvalds also said yeah kind ironic many european countries actually kind legal binding state state religion however story march linuxworld conference titled linus liberator torvalds quoted saying like two golden rules life one 'do unto others would want unto reason people associate christianity 'm christian 'm agnostic rule 'be proud 2010 torvalds became united states citizen registered vote united states unaffiliated u.s. political party saying way much personal pride want associated quite frankly linus developed interest scuba diving early 2000s went achieve numerous certifications later led creating subsurface project time magazine recognized torvalds multiple times infoworld presented 2000 award industry achievement 2005 torvalds appeared one best managers survey businessweek 2006 business 2.0 magazine named one 10 people n't matter growth linux shrunk torvalds individual impact summer 2004 viewers yle finnish broadcasting company placed torvalds 16th network 100 greatest finns 2010 part series called britannica guide world influential people torvalds listed among 100 influential inventors time october 11 2017 linux company suse made song titled linus said", + "neighbors": [ + 78, + 113, + 134, + 209, + 213, + 219, + 265, + 267, + 275, + 305, + 327, + 346, + 351, + 357, + 393, + 400, + 401, + 404, + 431, + 491, + 571, + 630, + 650, + 688, + 695, + 716, + 720, + 725, + 736, + 754, + 868, + 925, + 935, + 961, + 974, + 986, + 1004, + 1044, + 1046, + 1055, + 1060, + 1102, + 1126, + 1138, + 1167, + 1188, + 1197, + 1202, + 1208, + 1241, + 1276, + 1278, + 1286, + 1313, + 1318, + 1357, + 1360, + 1361, + 1369, + 1391, + 1415, + 1456, + 1458, + 1468, + 1509, + 1524, + 1526, + 1539, + 1558, + 1578, + 1582, + 1601, + 1635, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 898, + "label": 4, + "text": "Cyber_security_standards:cyber security standards information storage transit applications services systems connected directly indirectly networks principal objective reduce risks including prevention mitigation cyber-attacks published materials consist collections tools policies security concepts security safeguards guidelines risk management approaches actions training best practices assurance technologies cybersecurity standards existed several decades users providers collaborated many domestic international forums effect necessary capabilities policies practices generally emerging work stanford consortium research information security policy 1990s 2016 us security framework adoption study reported 70 surveyed organizations nist cybersecurity framework popular best practice information technology computer security many note requires significant investment iso/iec 27001 part growing iso/iec 27000 family standards information security management system isms standard last revision published october 2013 international organization standardization iso international electrotechnical commission iec full name iso/iec 27001:2013 \u2013 information technology \u2013 security techniques \u2013 information security management systems \u2013 requirements iso/iec 27001 formally specifies management system intended bring information security explicit management control iso/iec 27002 incorporates mainly part 1 bs 7799 good security management practice standard latest versions bs 7799 bs 7799-3 sometimes iso/iec 27002 therefore referred iso 17799 bs 7799 part 1 sometimes refers part 1 part 7 bs 7799 part 1 provides outline good practice guide cybersecurity management whereas bs 7799 part 2 iso/iec 27001 normative therefore provide framework certification iso/iec 27002 high level guide cybersecurity beneficial explanatory guidance management organisation obtain certification iso/iec 27001 standard certification obtained lasts three years depending auditing organisation intermediate audits may carried three years iso/iec 27001 isms replaces bs 7799 part 2 since backward compatible organization working toward bs 7799 part 2 easily transition iso/iec 27001 certification process also transitional audit available make easier organization bs 7799 part 2-certified organization become iso/iec 27001-certified iso/iec 27002 provides best practice recommendations information security management use responsible initiating implementing maintaining information security management systems isms states information security systems required implement iso/iec 27002 control objectives without iso/iec 27001 iso/iec 27002 control objectives ineffective iso/iec 27002 controls objectives incorporated iso 27001 annex a. iso/iec 21827 sse-cmm \u2013 iso/iec 21827 international standard based systems security engineering capability maturity model sse-cmm measure maturity iso controls objectives north american electric reliability corporation nerc addresses patching nerc cip 007-6 requirement 2 summarily requires bulk power system bps operators/owners identify source sources utilized provide entiter security related patches cyber assets utilized operation registered entities required check new patches every thirty five calendar days upon identification new patch entities required evaluate applicability patch complete mitigation installation activities within 35 calendar days completion assessment applicability.e bps.y initial attempt create information security standards electrical power industry created nerc 2003 known nerc css cyber security standards subsequent css guidelines nerc evolved enhanced requirements widely recognized modern nerc security standard nerc 1300 modification/update nerc 1200 newest version nerc 1300 called cip-002-3 cip-009-3 cip=critical infrastructure protection standards used secure bulk electric systems although nerc created standards within areas bulk electric system standards also provide network security administration still supporting best-practice industry processes standard develops called \u201c common criteria \u201d allows many different software hardware products integrated tested secure way iasme governance uk-based standard information assurance small-to-medium enterprises smes provides criteria certification small-to-medium business cybersecurity readiness also allows small medium business provide potential existing customers clients accredited measurement cybersecurity posture enterprise protection personal/business data iasme governance standard developed enable businesses achieve accreditation similar iso 27001 reduced complexity cost administrative overhead specifically focused sme recognition difficult small cap businesses achieve maintain iso 27001 certifications iasme governance standard include free basic cyber security insurance uk-based sme applicants cost certification progressively graduated based upon employee population sme e.g. 10 fewer 11 25 26 100 101 250 employees certification based upon self-assessment iasme questionnaire third-party professional assessor insurance companies reduce premiums cybersecurity related coverage based upon iasme certification october 2016 federal reserve board office comptroller currency federal deposit insurance corporation jointly issued advance notice proposed rulemaking anpr regarding cyber risk management standards regulated entities anpr aims enhance ability large interconnected financial services entities prevent recover cyber attacks goes beyond existing requirements proposal requires entities total assets 50 billion third party service providers take steps strengthen incident response programs enhance cyber risk governance management practices may 2017 us based federal financial institutions examination council issued cyber security assessment tool tool includes completing inherent risk profile organization covers five areas european telecommunications standards institute etsi established new cyber security committee tc cyber 2014 meet growing demand ev guidance protect internet communications business carries tc cyber working closely relevant stakeholders develop appropriate standards increase privacy security organisations citizens across europe committee looking particular security infrastructures devices services protocols well security tools techniques ensure security offers security advice guidance users manufacturers network infrastructure operators standards freely available on-line principal work item effort production cyber security ecosystem standardization activities 1990s information security forum isf published comprehensive list best practices information security published standard good practice sogp isf continues update sogp every two years latest version published 2018 among programs isf offers member organizations comprehensive benchmarking program based sogp furthermore important charge security management understand adhere nerc cip compliance requirements ansi/isa 62443 series standards technical reports related information define procedures implementing secure industrial automation control systems iacs guidance applies stakeholders implementing managing iacs documents originally referred ansi/isa-99 isa99 standards created international society automation isa publicly released american national standards institute ansi documents 2010 renumbered ansi/isa-62443 series change intended align isa ansi document numbering corresponding international electrotechnical commission iec standards isa99 remains name industrial automation control system security committee isa since 2002 committee developing multi-part series standards technical reports subject iacs security work products submitted isa approval publishing ansi also submitted iec input iec 62443 series international standards following iec standards development process established 2007 international security compliance institute isci created first conformity assessment scheme commonly known certification scheme ansi/isa 62443 standards program certifies commercial off-the-shelf cots automation control systems iot devices addressing securing control systems supply chain isci development processes include maintenance policies ensure isasecure certifications remain alignment iec 62443 standards evolve ansi/isa 62443 standards designed horizontally address technical cybersecurity requirements cross-section industries isasecure working groups included subject matter experts traditional process industries building management system suppliers asset owners isasecure scheme requires products properly tested supplier development process conformance ansi/isa 62443-4-1. exida united states first certification body accredited isasecure scheme american national standards institute ansi followed control systems security center \u2013 certification laboratory cssc-cl accredited japan accreditation board jab t\u00fcv rheinland accredited deutsche akkreditierungsstelle dakks five additional certification bodies accredited 2019 including tuv sud two cots product certifications available isasecure\u00ae brand isasecure-csa component security assurance certifying automation products iec 62443-4-1 iec 62443-4-2 cybersecurity standards isasecure-ssa system security assurance certifying systems iec 62443-3-3 standard third certification sdla secure development lifecycle assurance available isci certifies automation systems development organizations iec 62443-4-1 cybersecurity standard isasecure 62443 conformity assessment scheme iso 17065 program whose labs certification bodies cb independently accredited ansi/anab jab dakks singapore accreditation council global iso 17011 accreditation bodies ab certification labs must also meet iso 17025 lab accreditation requirements ensure consistent application certification requirements recognized tools mutual recognition arrangements mra iaf ilac others accreditation isasecure labs isa 17011 accreditation bodies ensures certificates issued isasecure labs globally recognized iec-62443 cybersecurity standards multi-industry standards listing cybersecurity protection methods techniques documents result iec standards creation process ansi/isa-62443 proposals inputs submitted country committees review done comments regarding changes submitted comments reviewed various iec 62443 committees comments discussed changes made agreed upon many members iec committees persons isa s99 committees date fundamental concepts original ansi/isa 62443 documents utilized iec 62443 certification schemes also established several global certification bodies defined scheme based upon referenced standards procedures describes test methods surveillance audit policy public documentation policies specific aspects program cybersecurity certification programs iec 62443 standards offered globally several recognized cbs including exida sgs-t\u00fcv saar t\u00fcv nord t\u00fcv rheinland t\u00fcv sud ul certx automation system market space cybersecurity certifications done exida global infrastructure established ensure consistent evaluation per standards impartial third party organizations called certification bodies cb accredited operate iso/iec 17065 iso/iec 17025 certification bodies accredited perform auditing assessment testing work accreditation body ab often one national ab country abs operate per requirements iso/iec 17011 standard contains requirements competence consistency impartiality accreditation bodies accrediting conformity assessment bodies abs members international accreditation forum iaf work management systems products services personnel accreditation international laboratory accreditation cooperation ilac laboratory accreditation multilateral recognition arrangement mla abs ensure global recognition accredited cbs ...", + "neighbors": [ + 11, + 149, + 293, + 379, + 439, + 479, + 518, + 528, + 550, + 576, + 621, + 698, + 739, + 740, + 762, + 800, + 818, + 1039, + 1090, + 1112, + 1137, + 1275, + 1303, + 1325, + 1342, + 1361, + 1368, + 1379, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 899, + "label": 2, + "text": "TrueOS:trueos trueos formerly pc-bsd pcbsd unix-like server-oriented operating system built upon recent releases freebsd-current 2018 aimed easy install using graphical installation program easy ready-to-use immediately providing kde sc lumina lxde mate xfce desktop environment june 2018 developers announced trueos core os provides basis projects thus n't include graphical installer anymore graphical end-user-orientated oses based trueos ghostbsd trident trueos provides official binary nvidia intel drivers hardware acceleration optional 3d desktop interface kwin wine ready-to-use running microsoft windows software trueos able run linux software addition freebsd ports collection .txz package manager trueos supports openzfs installer offers disk encryption geli trueos founded freebsd professional kris moore early 2005 pc-bsd august 2006 voted beginner-friendly operating system osweekly.com first beta pc-bsd consisted gui installer get user running freebsd 6 system kde3 pre-configured major innovation time anyone wishing install freebsd would manually tweak run text installer kris moore goal make freebsd easy everyone use desktop since diverged even direction usability including additional gui administration tools .pbi application installers pc-bsd application installer management involved different approach installing software many unix-like operating systems including version 8.2 means pbidir website instead using freebsd ports tree directly although remained available pc-bsd used files .pbi filename extension push button installer double-clicked brought installation wizard program autobuild system tracked freebsd ports collection generated new .pbi files daily software packages dependencies installed inside .pbi files self-contained directories /programs convention aimed decrease confusion binary programs reside remove possibility package breaking system libraries upgraded changed prevent dependency hell october 10 2006 pc-bsd acquired enterprise-class hardware solution provider ixsystems ixsystems employs kris moore full-time developer leader project november 2007 ixsystems entered distribution agreement fry electronics whereby fry electronics stores nationwide carry boxed copies pc-bsd version 1.4 da vinci edition january 2008 ixsystems entered similar agreement micro center september 1 2016 pc-bsd team announced name operating system change trueos along rebranding project also became rolling release distribution based freebsd-current branch november 15 2016 trueos began transition freebsd rc.d openrc default init system apart gentoo/alt openrc initially developed major bsd based operating system using openrc july 2018 trueos announced would spin desktop edition separate project named project trident since version 7 pc-bsd began following numbering system freebsd since version 9.0 kde sc customized support tighter application integration .txz package management system longer desktop environment supported pc-bsd manual installation desktops xfce gnome technically possible earlier releases none supported earlier versions major functionality lost using pc-bsd special build kde sc starting version 9.0 pc-bsd added desktop environments including gnome xfce lxde mate pc-bsd used support amd64 i686 architectures support i686 dropped version 9.2 starting september 2016 rebranding pc-bsd trueos became rolling release distribution based freebsd current branch trueos package manager takes similar approach installing software many unix-like operating systems instead using freebsd ports tree directly although remains available trueos uses files .txz filename extension packages contain compiled ports autobuild system tracks freebsd ports collection generates new .txz files daily trueos package management system aims visually similar major operating systems microsoft windows apple macos applications installed single download link graphical prompts maintaining internally traditional .txz package management systems many unix-like systems use trueos package manager also takes care creating categorized links kde menu kde sc desktop 2014 pc-bsd project announced development new desktop environment scratch named lumina ken moore main developer lumina based qt toolkit july 2016 lumina web site desktop environment application development toolkit aims graphical interface uses plugins customization trueos originally licensed gnu general public license gpl developers impression applications using qt trueos uses interface development must licensed gpl q public license upon discovering fact restriction trueos developers later relicensed code bsd-like 3-clause license trueos trueos logo registered trademarks ixsystems inc new york city *bsd user group runs service named dmesgd provides user-submitted dmesg information different computer hardware laptops workstations single-board computers embedded systems virtual machines etc capable running trueos according trueos wiki trueos following hardware requirements uefi support amd64 added installer boot manager since version 10.1 default efi boot manager refind includes acpi detection setup root system description pointer rsdp extended system descriptor table xsdt root system description table rsdt pass-through values kernel new installation needed order install uefi support requires creation small fat partition current uefi support secure boot", + "neighbors": [ + 33, + 38, + 63, + 101, + 106, + 116, + 134, + 189, + 207, + 272, + 275, + 290, + 301, + 322, + 323, + 337, + 359, + 377, + 477, + 494, + 500, + 509, + 521, + 716, + 754, + 796, + 899, + 953, + 961, + 992, + 1003, + 1004, + 1046, + 1049, + 1138, + 1202, + 1214, + 1225, + 1227, + 1235, + 1257, + 1278, + 1292, + 1301, + 1311, + 1318, + 1322, + 1366, + 1397, + 1458, + 1521, + 1547, + 1578 + ], + "mask": "Test" + }, + { + "node_id": 900, + "label": 6, + "text": "OrangeFS:orangefs orangefs open-source parallel file system next generation parallel virtual file system parallel file system type distributed file system distributes file data across multiple servers provides concurrent access multiple tasks parallel application orangefs designed use large-scale cluster computing used companies universities national laboratories similar sites worldwide orangefs emerged development branch pvfs2 much history shared history pvfs spanning twenty years extensive history behind orangefs summarized time line development branch new direction development orangefs branch begun 2007 leaders pvfs2 user community determined orangefs often described next generation pvfs2", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 908, + 912, + 922, + 942, + 982, + 997, + 1019, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 901, + "label": 2, + "text": "Research_Unix:research unix research unix refers early versions unix operating system dec pdp-7 pdp-11 vax interdata 7/32 8/32 computers developed bell labs computing sciences research center term research unix first appeared bell system technical journal vol 57 6 pt 2 jul/aug 1978 distinguish versions internal bell labs pwb/unix mert whose code-base diverged primary csrc version however term little-used version 8 unix retroactively applied earlier versions well prior v8 operating system commonly called simply unix caps unix time-sharing system licensed version 5 educational institutions version 6 also commercial sites schools paid 200 others 20,000 discouraging commercial use version 6 widely used version 1980s research unix versions often referred edition manual describes early versions last never officially released outside bell labs grew organically first research unix would first edition last tenth edition another common way referring version x v x unix x manual edition modern editions unix\u2014excepting unix-like implementations coherent minix linux\u2014derive 7th edition starting 8th edition versions research unix close relationship bsd began using 4.1cbsd basis 8th edition usenet post 2000 dennis ritchie described later versions research unix closer bsd unix system v also included bsd code 2002 caldera international released unix v1 v2 v3 v4 v5 v6 v7 pdp-11 unix 32v vax foss permissive bsd-like software license 2017 unix heritage society alcatel-lucent usa inc. behalf nokia bell laboratories released v8 v9 v10 condition assert copyright rights respect non-commercial copying distribution performance display creation derivative works research unix\u00ae1 editions 8 9 10", + "neighbors": [ + 63, + 106, + 134, + 195, + 292, + 306, + 322, + 380, + 443, + 475, + 477, + 491, + 579, + 816, + 919, + 954, + 957, + 1138, + 1216, + 1221, + 1234, + 1301, + 1318, + 1372, + 1374, + 1570, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 902, + "label": 4, + "text": "InSSIDer:inssider inssider wi-fi network scanner application microsoft windows os x developed metageek llc received awards 2008 infoworld bossie award best open source software networking inssider 3 longer open-source inssider began replacement netstumbler popular windows wi-fi scanner actively developed several years reputedly work modern 64-bit operating systems versions windows higher windows xp project inspired charles putney code project", + "neighbors": [ + 33, + 306, + 364, + 521, + 961, + 1042, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 903, + "label": 1, + "text": "Database_administration:database administration database administration function managing maintaining database management systems dbms software mainstream dbms software oracle ibm db2 microsoft sql server need ongoing management corporations use dbms software often hire specialized information technology personnel called database administrators dbas three types dbas individuals usually specialize one type database administration smaller organizations uncommon find single individual group performing one type database administration degree administration database automated dictates skills personnel required manage databases one end spectrum system minimal automation require significant experienced resources manage perhaps 5-10 databases per dba alternatively organization might choose automate significant amount work could done manually therefore reducing skills required perform tasks automation increases personnel needs organization splits highly skilled workers create manage automation group lower skilled line dbas simply execute automation database administration work complex repetitive time-consuming requires significant training since databases hold valuable mission-critical data companies usually look candidates multiple years experience database administration often requires dbas put work off-hours example planned hours downtime event database-related outage performance severely degraded dbas commonly well compensated long hours one key skill required often overlooked selecting dba database recovery part disaster recovery case \u201c \u201d case \u201c \u201d database suffers failure ranging simple failure full catastrophic failure failure may data corruption media failure user induced errors either situation dba must skills recover database given point time prevent loss data often dbms software comes certain tools help dbas manage dbms tools called native tools example microsoft sql server comes sql server management studio oracle tools sql*plus oracle enterprise manager/grid control addition 3rd parties bmc quest software embarcadero technologies sql maestro group offer gui tools monitor dbms help dbas carry certain functions inside database easily another kind database software exists manage provisioning new databases management existing databases related resources process creating new database consist hundreds thousands unique steps satisfying prerequisites configuring backups step must successful next start human expected complete procedure exact way time time exactly goal multiple databases exist number dbas grows without automation number unique configurations frequently grows costly/difficult support complicated procedures modeled best dbas database automation software executed standard dbas software created specifically improve reliability repeatability procedures stratavia data palette gridapp systems clarity automated database operations grown since 2009 following amazon web services introduction aws rds providing automated managed database service microsoft azure launched similar automated database service 2010 sql azure providing automated backups geo-replication high availability introduction docker software containers enhanced support fast delivery containerized database instances amazon web serices microsoft azure enhanced automated support containers respective services third party support database container images grown including mongodb postgres mysql oracle microsoft sql server microsoft independent port docker software windocks newer technologies stratavia data palette suite gridapp systems clarity begun increase automation databases causing reduction database related tasks however best reduces amount mundane repetitive activities eliminate need dbas intention dba automation enable dbas focus proactive activities around database architecture deployment performance service level management every database requires database owner account perform schema management operations account specific database log data director add database owner accounts database creation data director users must log database-specific credentials view database entities data perform database management tasks database administrators application developers manage databases appropriate permissions roles granted organization administrator permissions roles must granted database group database apply within organization granted several education institutes offer professional courses including late-night programs allow candidates learn database administration also dbms vendors oracle microsoft ibm offer certification programs help companies hire qualified dba practitioners college degree computer science related field helpful necessarily prerequisite", + "neighbors": [ + 154, + 429, + 804, + 1019, + 1606 + ], + "mask": "Validation" + }, + { + "node_id": 904, + "label": 4, + "text": "WBAdmin:wbadmin computing codice_1 command-line utility built windows vista windows server 2008 windows 7 windows server 2008 r2 windows 8 windows server 2012 windows 10 operating systems command used perform backups restores operating systems drive volumes computer files folders applications command-line interface codice_1 disk-based backup system create bare metal backup used restore windows operating system similar dissimilar hardware backup file created primarily form microsoft virtual hard disk .vhd files accompanying .xml configuration files backup .vhd file mounted windows disk manager view content however .vhd backup file direct disk clone utility replaces previous microsoft windows backup command-line tool ntbackup came built-into windows nt 4.0 windows 2000 windows xp windows server 2003 command-line version backup restore codice_1 also graphical user interface gui option available simplify creation computer backup restore workstation editions windows 7 use backup wizard located control panel server version done easily installed windows feature using windows management console wbadmin.msc wbadmin management console simplifies restoration whether single file multiple folders using command-line graphical user interface codice_1 creates backup quickly restored using windows media install dvd backup files located removable usb disk without need re-install scratch codice_1 uses differencing engine update backup files original backup file created volume shadow copy service updates changes subsequent full backups take matter moments rather many minutes taken create original backup file automatic backups scheduled regular basis using wizard two kinds restore operations supported", + "neighbors": [ + 255, + 295, + 365, + 377, + 615, + 764, + 920, + 961, + 1042, + 1050, + 1110, + 1138, + 1243, + 1289, + 1370, + 1461, + 1517, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 905, + "label": 7, + "text": "Chaser_(company):chaser company chaser cloud-based credit control software founded ceo david tuck former finance director wayn idio financial controller fever-tree ltd 2015 future 50 named chaser one britain disruptive businesses well awarding friend business award 2016 chaser named xero add-on partner year", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 906, + "label": 3, + "text": "Cabbage_Patch_Kids:_Adventures_in_the_Park:cabbage patch kids adventures park cabbage patch kids adventures park 1984 action/platform game based cabbage patch kids franchise first game cabbage patch kids adventures series mobygames described gameplay thus player cabbage patch kid pigtails day park day includes jumping onto vines leaping holes bouncing onto correct platforms misplaced jump lose life additionally creatures bees end player turn touched several screens challenge different combinations obstacles atariprotos wrote according colecovision version manual anna lee decided go exercise local park soon caught wild adventure hence subtitle adventures park game separated several different screens referred game scenes different obstacle kid overcome obstacles include bouncing balls water filled pits floating platforms bees even fires level consists ten scenes must overcome time limit runs along way anna may also collect various objects hidden trees using well placed trampolines points objects necessary win wake video game crash 1983 game served coleco attempt use one properties way cabbage patch kids give boost-through-association one properties way colecovision unreleased atari 2600 version developed individeo seen light day thanks discovery alex handy flea market california 2008 game known exist time thanks interview conducted former coleco programmer ed english many years prior atariage wrote atari 2600 version luck would cabbage patch kids adventures park impressive game comparable quality many modern homebrew games atariprotos said may able compare graphically colecovision version atari 2600 version cpk amazing feat programming gameplay retained conversion even included cute little background tune rarity 2600 games appears cpk simply victim collapsing game market time final version ready september 1984 coleco stopped 2600 operations", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 907, + "label": 3, + "text": "Coprocessor:coprocessor coprocessor computer processor used supplement functions primary processor cpu operations performed coprocessor may floating point arithmetic graphics signal processing string processing cryptography i/o interfacing peripheral devices offloading processor-intensive tasks main processor coprocessors accelerate system performance coprocessors allow line computers customized customers need extra performance need pay coprocessors vary degree autonomy fpus rely direct control via coprocessor instructions embedded cpu instruction stream others independent processors right capable working asynchronously still optimized general-purpose code incapable due limited instruction set focused accelerating specific tasks common driven direct memory access dma host processor building command list playstation 2 emotion engine contained unusual dsp-like simd vector unit capable modes operation make best use mainframe computer processor time input/output tasks delegated separate systems called channel i/o mainframe would require i/o processing instead would set parameters input output operation signal channel processor carry whole operation dedicating relatively simple sub-processors handle time-consuming i/o formatting processing overall system performance improved coprocessors floating-point arithmetic first appeared desktop computers 1970s became common throughout 1980s early 1990s early 8-bit 16-bit processors used software carry floating-point arithmetic operations coprocessor supported floating-point calculations could carried many times faster math coprocessors popular purchases users computer-aided design cad software scientific engineering calculations floating-point units amd 9511 intel 8231/8232 weitek fpus treated peripheral devices others intel 8087 motorola 68881 national 32081 closely integrated cpu another form coprocessor video display coprocessor used atari 8-bit family texas instruments ti-99/4a msx home-computers called video display controllers commodore amiga custom chipset included unit known copper well blitter accelerating bitmap manipulation memory microprocessors developed cost integrating floating point arithmetic functions processor declined high processor speeds also made closely integrated coprocessor difficult implement separately packaged mathematics coprocessors uncommon desktop computers demand dedicated graphics coprocessor grown however particularly due increasing demand realistic 3d graphics computer games original ibm pc included socket intel 8087 floating-point coprocessor aka fpu popular option people using pc computer-aided design mathematics-intensive calculations architecture coprocessor speeds floating-point arithmetic order fiftyfold users used pc word processing example saved high cost coprocessor would accelerated performance text manipulation operations 8087 tightly integrated 8086/8088 responded floating-point machine code operation codes inserted 8088 instruction stream 8088 processor without 8087 could interpret instructions requiring separate versions programs fpu non-fpu systems least test run time detect fpu select appropriate mathematical library functions another coprocessor 8086/8088 central processor 8089 input/output coprocessor used programming technique 8087 input/output operations transfer data memory peripheral device reducing load cpu ibm n't use ibm pc design intel stopped development type coprocessor intel 80386 microprocessor used optional math coprocessor 80387 perform floating point operations directly hardware intel 80486dx processor included floating-point hardware chip intel released cost-reduced processor 80486sx floating point hardware also sold 80487sx coprocessor essentially disabled main processor installed since 80487sx complete 80486dx different set pin connections intel processors later 80486 integrated floating-point hardware main processor chip advances integration eliminated cost advantage selling floating point processor optional element would difficult adapt circuit-board techniques adequate 75 mhz processor speed meet time-delay power consumption radio-frequency interference standards required gigahertz-range clock speeds on-chip floating point processors still referred coprocessors operate parallel main cpu era 8- 16-bit desktop computers another common source floating-point coprocessors weitek coprocessors different instruction set intel coprocessors used different socket motherboards supported weitek processors provide transcendental mathematics functions example trigonometric functions like intel x87 family required specific software libraries support functions motorola 68000 family 68881/68882 coprocessors provided similar floating-point speed acceleration intel processors computers using 68000 family equipped hardware floating point processor could trap emulate floating-point instructions software although slower allowed one binary version program distributed cases 68451 memory-management coprocessor designed work 68020 processor dedicated graphics processing units gpus form graphics cards commonplace certain models sound cards fitted dedicated processors providing digital multichannel mixing real-time dsp effects early 1990 1994 gravis ultrasound sound blaster awe32 typical examples sound blaster audigy sound blaster x-fi recent examples 2006 ageia announced add-in card computers called physx ppu physx designed perform complex physics computations cpu gpu perform time consuming calculations designed video games although mathematical uses could theoretically developed 2008 nvidia purchased company phased physx card line functionality added software allowing gpus render physx cores normally used graphics processing using nvidia physx engine software 2006 bigfoot systems unveiled pci add-in card christened killernic ran special linux kernel freescale powerquicc running 400 mhz calling freescale chip network processing unit npu spursengine media-oriented add-in card coprocessor based cell microarchitecture spus vector coprocessors 2008 khronos group released opencl aim support general-purpose cpus ati/amd nvidia gpus accelerators single common language compute kernels 2010s mobile computation devices implemented sensor hub coprocessor examples coprocessors used handling sensor integration mobile devices include apple m7 m8 motion coprocessors qualcomm snapdragon sensor core qualcomm hexagon holographic processing unit microsoft hololens 2012 intel announced intel xeon phi coprocessor various companies developing coprocessors aimed accelerating artificial neural networks vision cognitive tasks e.g vision processing units truenorth zeroth 2018 ai chips smartphones apple several android phone vendors time cpus tended grow absorb functionality popular coprocessors fpus considered integral part processors main pipeline simd units gave multimedia acceleration taking role various dsp accelerator cards even gpus become integrated cpu dies nonetheless specialized units remain popular away desktop machines additional power allow continued evolution independently main processor product lines", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 681, + 719, + 752, + 776, + 803, + 821, + 846, + 893, + 937, + 946, + 980, + 984, + 988, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1044, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1143, + 1147, + 1174, + 1188, + 1215, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1605, + 1608, + 1616, + 1620, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 908, + "label": 6, + "text": "F2FS:f2fs f2fs flash-friendly file system flash file system initially developed samsung electronics linux kernel motive f2fs build file system start takes account characteristics nand flash memory-based storage devices solid-state disks emmc sd cards widely used computer systems ranging mobile devices servers f2fs designed basis log-structured file system approach adapted newer forms storage jaegeuk kim principal f2fs author stated remedies known issues older log-structured file systems snowball effect wandering trees high cleaning overhead addition since nand-based storage device shows different characteristics according internal geometry flash memory management scheme flash translation layer ftl supports various parameters configuring on-disk layout also selecting allocation cleaning algorithms f2fs divides whole volume number segments fixed 2 mb section composed consecutive segments zone consists set sections default section zone sizes set size users easily modify size codice_1 f2fs splits entire volume six areas except superblock area consist multiple segments described order avoid misalignment file system flash storage f2fs aligns start block address cp segment size also aligns main area start block address zone size reserving segments ssa area f2fs uses checkpoint scheme maintain file system integrity mount time f2fs first tries find last valid checkpoint data scanning cp area order reduce scanning time f2fs uses two copies cp one always indicates last valid data called shadow copy mechanism addition cp nat sit also use shadow copy mechanism file system consistency cp points nat sit copies valid key data structure node similar traditional file structures f2fs three types nodes inode direct node indirect node f2fs assigns 4 kb inode block contains 923 data block indices two direct node pointers two indirect node pointers one double indirect node pointer described direct node block contains 1018 data block indices indirect node block contains 1018 node block indices thus one inode block i.e. file covers note node blocks mapped nat means location node translated nat mitigate wandering tree problem f2fs able cut propagation node updates caused leaf data writes directory entry dentry occupies 11 bytes consists following attributes dentry block consists 214 dentry slots file names bitmap used represent whether dentry valid dentry block occupies 4 kb following composition f2fs implements multi-level hash tables directory structure level hash table dedicated number hash buckets shown note 2b means bucket includes 2 data blocks f2fs finds file name directory first hash value file name calculated f2fs scans hash table level 0 find dentry consisting file name inode number found f2fs scans next hash table level 1 way f2fs scans hash tables level incrementally 1 n level f2fs needs scan one bucket determined following equation shows log files complexity case file creation f2fs finds empty consecutive slots cover file name f2fs searches empty slots hash tables whole levels 1 n way lookup operation runtime f2fs manages six active logs inside main area hot/warm/cold node hot/warm/cold data lfs two schemes free space management threaded log copy-and-compaction copy-and-compaction scheme known cleaning well-suited devices showing good sequential write performance since free segments served time writing new data however suffers cleaning overhead high utilization conversely threaded log scheme suffers random writes cleaning process needed f2fs adopts hybrid scheme copy-and-compaction scheme adopted default policy dynamically changed threaded log scheme according file system status order align f2fs underlying flash-based storage f2fs allocates segment unit section f2fs expects section size garbage collection unit size ftl respect mapping granularity ftl f2fs allocates section active logs many different zones possible ftl write active log data one allocation unit according mapping granularity f2fs cleaning demand background on-demand cleaning triggered enough free segments serve vfs calls background cleaner executed kernel thread triggers cleaning job system idle f2fs supports two victim selection policies greedy cost-benefit algorithms greedy algorithm f2fs selects victim segment smallest number valid blocks cost-benefit algorithm f2fs selects victim segment according segment age number valid blocks order address log block thrashing problem present greedy algorithm f2fs uses greedy algorithm on-demand cleaning background cleaner uses cost-benefit algorithm order identify whether data victim segment valid f2fs manages bitmap bit represents validity block bitmap composed bit stream covering whole blocks main area motorola mobility used f2fs moto g/e/x droid phones since 2012 google first used f2fs nexus 9 2014 however google products n't adopt f2fs pixel 3 f2fs updated inline crypto hardware support huawei used f2fs since huawei p9 2016 oneplus used f2fs since oneplus 3t 2016 zte used f2fs since zte axon 10 pro 2019", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 664, + 723, + 728, + 887, + 892, + 900, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1187, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 909, + "label": 7, + "text": "Volunteer_computing:volunteer computing volunteer computing type distributed computing arrangement people so-called volunteers provide computing resources projects use resources distributed computing and/or storage thus computer owners users donate computing resources processing power storage one projects volunteers frequently members general public possession personal computers internet connection also organizations act volunteers provide computing resources projects context mostly science-related projects executed universities academia general first volunteer computing project great internet mersenne prime search started january 1996 followed 1997 distributed.net 1997 1998 several academic research projects developed java-based systems volunteer computing examples include bayanihan popcorn superweb charlotte term volunteer computing coined luis f. g. sarmenta developer bayanihan also appealing global efforts social responsibility corporate social responsibility reported harvard business review used responsible forum 1999 seti home folding home projects launched projects received considerable media coverage one attracted several hundred thousand volunteers 1998 2002 several companies formed business models involving volunteer computing examples include popular power porivo entropia united devices 2002 berkeley open infrastructure network computing boinc project founded university california berkeley space sciences laboratory funded national science foundation boinc provides complete middleware system volunteer computing including client client gui application runtime system server software software implementing project web site first project based boinc predictor home based scripps research institute began operation 2004 soon thereafter seti home climateprediction.net began using boinc number new boinc-based projects created next years including rosetta home einstein home aqua home 2007 ibm world community grid switched united devices platform boinc client software early volunteer computing projects consisted single program combined scientific computation distributed computing infrastructure monolithic architecture inflexible example difficult deploy new application versions recently volunteer computing moved middleware systems provide distributed computing infrastructure independent scientific computation examples include systems basic structure client program runs volunteer computer periodically contacts project-operated servers internet requesting jobs reporting results completed jobs pull model necessary many volunteer computers behind firewalls allow incoming connections system keeps track user credit numerical measure much work user computers done project volunteer computing systems must deal several issues involving volunteered computers heterogeneity churn tendency individual computers join leave network time sporadic availability need interfere performance regular use addition volunteer computing systems must deal problems related correctness one common approach problems replicated computing job performed least two computers results corresponding credit accepted agree sufficiently effects may may noticeable even noticeable volunteer might choose continue participating however increased power consumption remedied extent setting option limit percentage processor used client available client software although issues lack accountability trust participants researchers implementing projects volunteer computing crucially important especially projects limited funding", + "neighbors": [ + 175, + 227, + 274, + 362, + 481, + 611, + 847, + 968 + ], + "mask": "Test" + }, + { + "node_id": 910, + "label": 4, + "text": "Kaspersky_Internet_Security:kaspersky internet security kaspersky internet security often abbreviated kis internet security suite developed kaspersky lab compatible microsoft windows mac os x. kis offers protection malware well email spam phishing hacking attempts data leaks kaspersky lab diagnostics results distributed relevant developers version 6.0 first release kis pc world magazine praised version 6.0 detection malware kis detected 100 percent threats subset january 2006 wild-list list prevalent threats suite detected almost 100 99.57 percent adware samples kis ability scan within compressed packed files detecting 83.3 percent hidden malware however version 6.0 criticized completely removing malware leaving registry entries files pc world also highlighted suite false positives \u2014 eight 20,000 clean files incorrectly flagged malicious \u2014 noticeable impact computer performance however data cached scan making subsequent scan faster firewall blocked attacks inside outside computer tested magazine found graphical user interface awkward navigate features parental controls instant messaging protection found competing suites symantec mcafee part version 6.0 cnet pc world criticized suite relatively high retail price us 79.95 kis 6.0 supports windows 98 se nt workstation 4.0 2000 professional xp home edition xp professional xp professional x64 vista 50 megabytes free space internet explorer 5.5 windows installer 2.0 required ram cpu requirements dependent operating system version 7.0 introduced redesigned gui components renamed reorganized anti-hacker module renamed firewall anti-spy module integrated privacy control module pc world described new interface intuitive great-looking parental controls introduced specific settings different age categories child parent within age categories content categories drugs violence users manually configure profiles filtering profiles associated users since content filtered network level feature work internet browser filter relies database known urls analyse websites real-time attempts access forbidden urls logged sites visited tracked well raising privacy issues limits internet access may set based time chat rooms along webmail sites manually blocked spam filtering integrates microsoft outlook outlook express windows mail bat e-mail content analysed scored e-mail scores two specified thresholds either marked spam probably spam mail dispatcher feature shows subject sender information messages allows users avoid downloading blatant spam selecting messages download filter self-trains analyzing incoming outgoing e-mail marked spam analyzing folders containing spam valid e-mail senders verified valid e-mail whitelisted e-mail also whitelisted blacklisted based phrases present text e-mail non-ascii characters invisible text also blocked however version 7.0 relatively poor showing misidentifying 30 percent valid messages pc magazine testing 30 percent spam also made inbox protection data leaks incorporated release suite warns users programs attempt access send data certain areas internet explorer stores webform information malware protection mostly positive detection disinfection tests av-test.org version 7.0 detected 100 percent wildlist threats using one-month-old signatures set new malware however detection fell 14 percent files scanned 5.24 megabytes per second version 7.0 successfully identified six actively running rootkits four six inactive rootkits able remove two six rootkits firewall correctly blocked attempted outside connections reasonable level security left default settings version drops support windows 98 2000 nt windows xp service pack 2 required except case xp professional x64 edition vista supported well ram cpu requirements dependent operating system 75 megabytes free space internet explorer 5.5 windows installer 2.0 version introduces revised user interface application filtering module updated anti-virus engine vulnerability scanner main window separates settings four categories compared eight predecessor status bar changes colour green yellow red reflect overall program status flashes divert attention needed pc magazine also noted pop-up notifications kept minimum kaspersky claims core anti-virus engine revised increase scan speed pc magazine found initial scan took two hours however subsequent scans took two minutes complete however malware detection relatively low comparison anti-virus applications tested 650 thousand samples version 8.0 detected 95.6 percent top score around 99 percent using two-week-old signatures version 8.0 detected 52 percent viruses different set samples kaspersky also blocked 60 percent malware based solely behaviour top performers scored 55.3 percent 80 percent respectively version 2009 detected 98.1 percent adware however pc world noted achieve kind performance users modify program settings default settings kis allowed zango install block installation users must enable kis scan malware security analyzer looks operating system program patches also looks vulnerable system settings presenting users list recommended actions prevent malware gaining access system however pc world criticized amount computer jargon used lack information adjust settings appropriately hand pc magazine found feature straightforward often solution involved downloading installing update kis uses whitelist carbon black classify trusted malicious programs malicious programs allowed run unknown programs falling two categories restricted actions perform firewall blocked attacks pc magazine testing phishing protection introduced release testing pc magazine found feature blocked 44 percent phishing urls internet explorer 7 blocked 67 percent urls mozilla firefox blocked 81 percent spam filtering integrates mozilla thunderbird scans nntp traffic spam automatically diverted folder using unsupported e-mail client download pop3 imap nntp mail kaspersky still generate report messages however unsupported client toolbar program classify messages spam client version 2010 kaspersky internet security introduced overhauled user interface sandbox running applications virtualized environment 9.0.0.736 build kis 2010 fully supported windows 7 operating system beta version released windows users 8 june 2010 version included new interface well gadget available windows vista windows 7 users pc mag rated version good 4/5 stars firewall noted good made adequate malware detection rates two critical fixes released kaspersky lab making current version 11.0.2.556 1 march 2011 kaspersky released first build version 2012 came beta version english french russian version versions due later 7 june 2011 kaspersky lab announced commercial release kaspersky internet security 2012 france germany switzerland current version 12.0.0.374 beta version released windows users 3 march 2012 version includes interface looks currently least much like internet security 2012 safe run option proactive defense instead behavioural monitoring system watcher seems taking greater responsibility detecting malware safe banking feature added release candidate build 13.0.1.4088 rc released windows users 20 july 2012 final version released 28 august 2012 build 13.0.1.4190 beta testing started 12 march 2013 version introduced windows 8 like gui design final version released 3 august 2013 build 14.0.0.4651 india russia august 13 usa august 27 uk 2014 release frequently characterized inferior user expectations largely due removal range granular fine-tuning options 2013 earlier used experienced users number added back 2015 beta time technical release build 463 february 13 2014 build 14.0.0.4651 e released build 14.0.0.4651 latest current version april 2014 beta version 2015 product build 463 released followed technical release preview near-complete 2015 product first official release product bangladesh june 2014 march 2015 bloomberg accused kaspersky close ties russian military intelligence officials kaspersky slammed claims blog calling coverage sensationalist guilty exploiting paranoia increase readership result alleged russian involvement 2016 presidential election ongoing investigations department homeland security officially banned use kaspersky internet security united states federal government september 2017 december 12 2017 use kaspersky software banned use american federal government law", + "neighbors": [ + 17, + 43, + 77, + 94, + 120, + 134, + 189, + 217, + 270, + 310, + 359, + 470, + 476, + 569, + 576, + 648, + 656, + 685, + 703, + 717, + 731, + 842, + 938, + 944, + 961, + 965, + 1038, + 1101, + 1138, + 1193, + 1239, + 1250, + 1257, + 1291, + 1350, + 1379, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 911, + "label": 5, + "text": "SC-FDE:sc-fde single-carrier frequency domain equalization sc-fde single-carrier sc modulation combined frequency-domain equalization fde alternative approach inter symbol interference isi mitigation", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 912, + "label": 6, + "text": "Extent_(file_systems):extent file systems extent contiguous area storage reserved file file system represented range block numbers tracks count key data devices file consist zero extents one file fragment requires one extent direct benefit storing range compactly two numbers instead canonically storing every block number range also extent allocation results less file fragmentation extent-based file systems also eliminate metadata overhead large files would traditionally taken block-allocation tree savings small compared amount stored data file sizes general make large portion metadata large files overall benefits storage efficiency performance slight order resist fragmentation several extent-based file systems allocate-on-flush many modern fault-tolerant file systems also copy-on-write although increases fragmentation similar design cp/m file system uses extents well correspond definition given cp/m extents appear contiguously single block combined directory/allocation table necessarily correspond contiguous data area disk ibm os/360 successors allocates files multiples disk tracks cylinders files could originally 16 extents restriction since lifted initial allocation size size additional extents allocated required specified user via job control language system attempts allocate initial size contiguous area although may split contiguous space available systems supporting filesystem extents include following", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 142, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 755, + 887, + 892, + 900, + 908, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1157, + 1187, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1421, + 1445, + 1456, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 913, + "label": 3, + "text": "Higemaru_Makaijima_-_Nanatsu_no_Shima_Daib\u014dken:higemaru makaijima nanatsu shima daib\u014dken higemaru makaijima hero pirate ship higemaru named momotaru must pilot sailing vessel around ocean surrounding seven islands goal find greatest treasure must collect keys open dock gates islands invading several pirate ships defeating captain board combat gameplay pirate ships taken directly arcade predecessor small modifications momotaru collected key pirate ship must sail around islands search correct dock gate key corresponds player embarks exploration island find items defeat boss collect treasures heading search another island key island exploration sections extremely reminiscent dungeon exploration aspects legend zelda game often compared", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 914, + "label": 1, + "text": "Croatian_Register_of_Shipping:croatian register shipping croatian register shipping also known crs independent classification society established 1949 non-profit organisation working marine market developing technical rules supervising implementation managing risk performing surveys ships society head office split croatian register shipping member international association classification societies iacs since may 2011 register officially recognized malta maritime authority", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 915, + "label": 4, + "text": "Rootpipe:rootpipe rootpipe security vulnerability found versions os x allows privilege escalation whereby user administrative rights program executed administrative user obtain superuser root access considered problematic first user account created os x furnished administrator rights default leveraging security vulnerabilities system unpatched web browser rootpipe could used attacker help gain complete control operating system emil kvarnhammar truesec security firm credited discovery says found vulnerability several days binary analysis recommends creating account without administrative privileges used normal everyday work using filevault older exploit issue later published exploit-db suggesting issue dates back june 2010 appears exploit used author presentation trusteer rapport 44con 2011 vulnerability reported apple inc. october 2014 reported present os x versions 10.7.5 10.8.2 10.9.5 10.10.2 os x 10.10.3 officially designated patched apple kvarnhammar crediting patrick wardle blogged vulnerability still present version 1 july 2015 kvarnhammer noted additional restrictions introduced os x 10.10.4 adding comment two days later believed then-current versions os x 10.9 security update 2015-005 10.10 safe exploit november 2017 similar vulnerability revealed allowed logging root password", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 730, + 783, + 800, + 818, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 916, + "label": 8, + "text": "CL-HTTP:cl-http cl-http web server client proxy written common lisp based web application framework written john c. mallery 10 days starting 1994 symbolics lisp machine year port macintosh common lisp done 1996 cl-http became first web server support http 1.1 protocol runs unix linux bsd variants mac os x solaris symbolics genera microsoft windows cl-http makes extensive use common lisp object system macro capabilities lisp cl-http used several applications elm-art tutoring system written common lisp using cl-http later commercialized netcoach interbook early adaptive electronic textbook also written top cl-http cl-http used early tool create web interfaces applications 1994 cl-http used w3c members ietf http working group develop reference clients servers http 1.1 prominently cl-http used presidency bill clinton web server white house publications web site distributed daily press releases official publications clinton administration cl-http used example non-trivial lisp application", + "neighbors": [ + 7, + 117, + 134, + 201, + 203, + 251, + 308, + 360, + 509, + 538, + 567, + 593, + 601, + 653, + 678, + 682, + 684, + 712, + 796, + 961, + 987, + 1021, + 1118, + 1138, + 1180, + 1225, + 1227, + 1235, + 1242, + 1251, + 1269, + 1277, + 1298, + 1311, + 1315, + 1385, + 1389, + 1481 + ], + "mask": "Test" + }, + { + "node_id": 917, + "label": 3, + "text": "Apple-designed_processors:apple-designed processors apple inc. developed range system chip soc well system package sip processors powering mobile consumer devices tasks meet stringent power space constraints common mobile devices chips combine central processing unit cpu components single compact physical package johny srouji executive charge apple silicon design prior introduction apple series socs apple used several socs early revisions iphone ipod touch specified apple manufactured samsung integrate single arm-based processing core cpu graphics processing unit gpu electronics necessary provide mobile computing functions within single physical package apl0098 also 8900b s5l8900 package package pop system chip soc introduced june 29 2007 launch original iphone includes 412 mhz single-core arm11 cpu powervr mbx lite gpu manufactured samsung 90 nm process first generation ipod touch also used apl0278 also s5l8720 package package pop system chip soc introduced september 9 2008 launch second generation ipod touch includes 533 mhz single-core arm11 cpu powervr mbx lite gpu manufactured samsung 65 nm process apl0298 also s5l8920 package package pop system chip soc introduced june 8 2009 launch iphone 3gs includes 600 mhz single-core cortex-a8 cpu powervr sgx535 gpu manufactured samsung 65 nm process apl2298 also s5l8922 45 nm die shrunk version iphone 3gs soc introduced september 9 2009 launch third generation ipod touch family systems chip soc used multiple devices including apple portable devices certain models iphone ipad ipod touch apple tv digital media player integrate one arm-based processing cores cpu graphics processing unit gpu cache memory electronics necessary provide mobile computing functions within single physical package designed apple manufactured samsung tsmc apple a4 package package pop system chip soc designed apple inc. manufactured samsung combines arm cortex-a8 cpu powervr gpu emphasizes power efficiency chip commercially debuted release apple ipad tablet followed shortly iphone 4 smartphone 4th generation ipod touch 2nd generation apple tv superseded ipad 2 released following year apple a5 processor apple a4 based arm processor architecture first version released ran 1 ghz ipad contains arm cortex-a8 cpu core paired powervr sgx 535 graphics processor gpu built samsung 45-nanometer nm silicon chip fabrication process clock speed units used iphone 4 ipod touch 4th generation 800 mhz clock speed unit used apple tv revealed cortex-a8 core used a4 thought use performance enhancements developed chip designer intrinsity subsequently acquired apple collaboration samsung resulting core dubbed hummingbird able run far higher clock rates implementations remaining fully compatible cortex-a8 design provided arm performance improvements include additional l2 cache cortex-a8 cpu core used a4 also used samsung s5pc110a01 soc sgx535 a4 could theoretically push 35 million polygons per second 500 million pixels per second although real world performance may considerably less a4 processor package contain ram supports pop installation hence package two low-power 128 mb ddr sdram chips totaling 256 mb mounted top a4 used first-generation ipad fourth-generation ipod touch second-generation apple tv iphone 4 two 256 mb packages total 512 mb ram connected processor using arm 64-bit-wide amba 3 axi bus support ipad demand high graphics bandwidth width ram data bus double used previous arm11 arm9 based apple devices apple a5 system chip soc designed apple inc. manufactured samsung replaced a4 chip commercially debuted release apple ipad 2 tablet march 2011 followed release iphone 4s smartphone later year apple claims compared predecessor a4 a5 cpu twice work gpu nine times graphics performance a5 contains dual-core arm cortex-a9 cpu arm advanced simd extension marketed neon dual core powervr sgx543mp2 gpu gpu push 70 80 million polygons/second pixel fill rate 2 billion pixels/second apple lists a5 clocked 1 ghz ipad 2 technical specifications page though dynamically adjust frequency save battery life clock speed unit used iphone 4s 800 mhz like a4 a5 process size 45 nm updated 32 nm version a5 processor used third generation apple tv ipod touch 5th generation ipad mini new version ipad 2 version ipad2,4 chip apple tv one core locked markings square package indicates named apl2498 software chip called s5l8942 32 nm variant a5 provides around 15 better battery life web browsing 30 better playing 3d games approximately 20 better battery life video playback march 2013 apple released updated version third generation apple tv appletv3,2 containing smaller single-core version a5 processor unlike a5 variants version a5 package-on-package pop stacked ram chip small 6.1\u00d76.2 mm decrease size due decrease feature size still 32 nm fabrication process indicates a5 revision new design markings tell named apl7498 software chip called s5l8947 apple a5x system-on-a-chip soc designed apple inc. announced march 7 2012 launch third generation ipad high performance variant apple a5 apple claims twice graphics performance a5 superseded fourth generation ipad apple a6x processor soc quad-core graphics unit powervr sgx543mp4 instead previous dual-core well quad-channel memory controller provides memory bandwidth 12.8 gb/s roughly three times a5 added graphics cores extra memory channels add large die size 165 mm\u00b2 example twice size nvidia tegra 3 mainly due large powervr sgx543mp4 gpu clock frequency dual arm cortex-a9 cores shown operate 1 ghz frequency a5 ram a5x separate main cpu package apple a6 package package pop system chip soc designed apple introduced september 12 2012 launch iphone 5 year later inherited minor successor iphone 5c apple states twice fast twice graphics power compared predecessor apple a5 22 smaller draws less power 45 nm a5 a6 said use 1.3 ghz custom apple-designed armv7 based dual-core cpu called swift rather licensed cpu arm like previous designs integrated 266 mhz triple-core powervr sgx 543mp3 graphics processing unit gpu swift core a6 uses new tweaked instruction set armv7s featuring elements arm cortex-a15 support advanced simd v2 vfpv4 a6 manufactured samsung high-\u03ba metal gate hkmg 32 nm process apple a6x system-on-a-chip soc designed apple inc. introduced launch fourth generation ipad october 23 2012 high performance variant apple a6 apple claims a6x twice cpu performance twice graphics performance predecessor apple a5x like a6 soc continues use dual-core swift cpu new quad core gpu quad channel memory slightly higher 1.4 ghz cpu clock rate uses integrated quad-core powervr sgx 554mp4 graphics processing unit gpu running 300 mhz quad-channel memory subsystem compared a6 a6x 30 larger continues manufactured samsung high-\u03ba metal gate hkmg 32 nm process apple a7 package package pop 64-bit system-on-a-chip soc designed apple first appearance iphone 5s introduced september 10 2013 chip would also used ipad air ipad mini 2 ipad mini 3 apple states twice fast twice graphics power compared predecessor apple a6 a7 features apple-designed 1.3\u20131.4 ghz 64-bit armv8-a dual-core cpu called cyclone integrated powervr g6430 gpu four cluster configuration armv8-a architecture doubles number registers a7 compared a6 31 general purpose registers 64-bits wide 32 floating-point/neon registers 128-bits wide a7 manufactured samsung high-\u03ba metal gate hkmg 28 nm process chip includes 1 billion transistors die 102 mm size apple a8 package package pop 64-bit system-on-a-chip soc designed apple manufactured tsmc first appearance iphone 6 iphone 6 plus introduced september 9 2014 year later would drive ipad mini 4 apple states 25 cpu performance 50 graphics performance drawing 50 power compared predecessor apple a7 february 9 2018 apple released homepod powered apple a8 1 gb ram a8 features apple-designed 1.4 ghz 64-bit armv8-a dual-core cpu integrated powervr gx6450 gpu four cluster configuration a8 manufactured 20 nm process tsmc replaced samsung manufacturer apple mobile device processors contains 2 billion transistors despite double number transistors compared a7 physical size reduced 13 89 mm consistent shrink known new microarchitecture apple a8x 64-bit system chip soc designed apple introduced launch ipad air 2 october 16 2014 high performance variant apple a8 apple states 40 cpu performance 2.5 times graphics performance predecessor apple a7 unlike a8 soc uses triple-core cpu new octa-core gpu dual channel memory slightly higher 1.5 ghz cpu clock rate uses integrated octa-core powervr gxa6850 graphics processing unit gpu running 450 mhz dual-channel memory subsystem manufactured tsmc 20 nm fabrication process consists 3 billion transistors apple a9 64-bit arm based system chip soc designed apple inc first appeared iphone 6s 6s plus introduced september 9 2015 apple states 70 cpu performance 90 graphics performance compared predecessor apple a8 dual sourced first apple soc manufactured samsung 14 nm finfet lpe process tsmc 16 nm finfet process subsequently included iphone se ipad 2017 apple a9x 64-bit system chip soc designed apple inc announced september 9 2015 released november 11 2015 first appeared ipad pro offers 80 cpu performance two times gpu performance predecessor apple a8x manufactured tsmc using 16 nm finfet process apple a10 fusion 64-bit arm based system chip soc designed apple inc first appeared iphone 7 7 plus introduced september 7 2016 a10 also featured ipad 2018 ipod touch 7th generation new quad core design two high performance cores two smaller highly efficient cores 40 faster a9 50 faster graphics made tsmc 16 nm finfet process apple a10x fusion 64-bit arm based system chip soc designed apple inc first appeared 10.5 ipad pro second generation 12.9 ipad pro announced june 5 2017 variant a10 apple claims 30 percent faster cpu performance 40 percent faster gpu performance predecessor a9x september 12 2017 apple announced apple tv 4k would powered a10x chip made tsmc 10 nm finfet process apple a11 bionic 64-bit arm-based system chip soc designed apple inc first appeared iphone 8 iphone 8 plus iphone x introduced september 12 2017 two high-performance cores 25 faster a10 fusion four high-efficiency cores 70 faster energy-efficient cores a10 apple a12 bionic 64-bit arm-based system chip soc designed apple inc first appeared iphone xs xs max xr introduced september 12 2018 also within 2019 models ipad air ipad mini two high-performance cores 15 faster a11 bionic four high-efficiency cores 50 lower power usage energy-efficient cores a11 bionic a12 manufactured tsmc using 7 nm finfet process first ship smartphone apple a12x bionic 64-bit arm-based system chip soc designed apple inc first appeared 11.0 ipad pro third generation 12.9 ipad pro announced october 30 2018 offers 35 faster single-core 90 faster multi-core cpu performance predecessor a10x four high-performance cores four high-efficiency cores a12x manufactured tsmc using 7 nm finfet process first ship tablet apple series family systems package sip used apple watch uses customized application processor together memory storage support processors wireless connectivity sensors i/o comprise complete computer single package designed apple manufactured contract manufacturers samsung apple s1 integrated computer designed apple includes memory storage support circuits like wireless modems i/o controllers sealed integrated package announced september 9 2014 part wish could say event first appearance original apple watch used apple watch series 1 dual-core processor almost identical s2 exception built-in gps receiver used apple watch series 2 dual-core processor built-in gps receiver used apple watch series 3 dual-core processor 70 faster apple s2 built-in gps receiver also option cellular modem internal esim module also includes w2 chip used apple watch series 4 apple designed custom 64-bit dual-core processor 2x faster performance also contains w3 wireless chip supports bluetooth 5 apple t1 chip armv7 soc apple driving system management controller smc touch id sensor 2016 2017 macbook pro touch bar addition traditional tasks smc chip operates secure enclave processing encryption fingerprints well acting gatekeeper microphone facetime hd camera protecting possible targets potential hacking attempts t1 runs bridgeos variant watchos separate intel cpu running macos apple t2 chip soc apple first released imac pro 2017 64-bit armv8 chip variant a10 t8010 runs separate operating system called bridgeos 2.0 watchos derivative provides secure enclave encrypted keys gives users ability lock computer boot process handles system functions like camera audio control handles on-the-fly encryption decryption solid-state drive t2 also delivers enhanced imaging processing imac pro facetime hd camera july 12 2018 apple released updated macbook pro includes t2 chip among things enables hey siri feature november 7 2018 apple released updated mac mini macbook air t2 chip apple w series family system chip soc wireless chips focus bluetooth wi-fi connectivity apple w1 soc apple used 2016 airpods select beats headphones maintains bluetooth class 1 connection computer device decodes audio stream sent apple w2 wireless chip apple used apple watch series 3 integrated apple s3 sip apple released implementation chip makes wi-fi 85 faster bluetooth wi-fi 50 power efficient previous model chip design apple w3 wireless chip apple used apple watch series 4 integrated apple s4 sip supports bluetooth 5.0 apple h1 chip first used 2019 version airpods specifically designed headphones bluetooth 5.0 offers 30 lower latency compared w1 chip prior version airpods", + "neighbors": [ + 33, + 51, + 71, + 75, + 99, + 112, + 121, + 130, + 162, + 208, + 211, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 359, + 394, + 395, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 797, + 810, + 853, + 858, + 877, + 917, + 927, + 945, + 956, + 965, + 972, + 988, + 1001, + 1069, + 1100, + 1140, + 1147, + 1176, + 1178, + 1215, + 1219, + 1237, + 1262, + 1272, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1384, + 1409, + 1421, + 1488, + 1496, + 1503, + 1507, + 1518, + 1544, + 1591, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 918, + "label": 4, + "text": "Cyrix_coma_bug:cyrix coma bug cyrix coma bug design flaw cyrix 6x86 6x86l early 6x86mx processors allows non-privileged program hang computer according andrew balsa around time discovery f00f bug intel pentium serguei shtyliov moscow found flaw cyrix processor developing ide disk driver assembly language alexandr konosevich omsk researched bug coauthored article uwe post german technology magazine c't calling hidden cli bug cli instruction disables interrupts x86 architecture balsa member linux-kernel mailing list confirmed following c program uses inline x86-specific assembly language could compiled run unprivileged user execution program renders processor completely useless rebooted enters infinite loop interrupted allows user access cyrix system bug perform denial-of-service attack similar execution halt catch fire instruction although coma bug one particular instruction causes bug interrupt mask interrupts explicitly disabled instead anomaly cyrix instruction pipeline prevents interrupts serviced duration loop since loop never ends interrupts never serviced xchg instruction atomic meaning instructions allowed change state system executed order ensure atomicity designers cyrix made xchg uninterruptible due pipelining branch predicting however another xchg enters pipeline previous one completes causing deadlock fix unintentional instances bug insert another instruction loop nop instruction good candidate cyrix suggested serializing xchg opcode thus bypassing pipeline however techniques serve prevent deliberate attacks one way prevent bug enable bit 0x10 configuration register ccr1 disables implicit bus locking normally done xchg instruction since cpus affected bug designed work multi-processor systems loss xchg atomicity harmless", + "neighbors": [ + 78, + 85, + 134, + 270, + 306, + 363, + 1174 + ], + "mask": "Test" + }, + { + "node_id": 919, + "label": 9, + "text": "Lisp_(programming_language):lisp programming language lisp historically lisp family computer programming languages long history distinctive fully parenthesized prefix notation originally specified 1958 lisp second-oldest high-level programming language widespread use today fortran older one year lisp changed since early days many dialects existed history today best-known general-purpose lisp dialects clojure common lisp scheme lisp originally created practical mathematical notation computer programs influenced notation alonzo church lambda calculus quickly became favored programming language artificial intelligence ai research one earliest programming languages lisp pioneered many ideas computer science including tree data structures automatic storage management dynamic typing conditionals higher-order functions recursion self-hosting compiler read\u2013eval\u2013print loop name lisp derives list processor linked lists one lisp major data structures lisp source code made lists thus lisp programs manipulate source code data structure giving rise macro systems allow programmers create new syntax new domain-specific languages embedded lisp interchangeability code data gives lisp instantly recognizable syntax program code written s-expressions parenthesized lists function call syntactic form written list function operator name first arguments following instance function takes three arguments would called john mccarthy developed lisp 1958 massachusetts institute technology mit mccarthy published design paper communications acm 1960 entitled recursive functions symbolic expressions computation machine part showed simple operators notation functions one build turing-complete language algorithms information processing language first ai language 1955 1956 already included many concepts list-processing recursion came used lisp mccarthy original notation used bracketed m-expressions would translated s-expressions example m-expression equivalent s-expression lisp implemented programmers rapidly chose use s-expressions m-expressions abandoned m-expressions surfaced short-lived attempts mlisp horace enea cgol vaughan pratt lisp first implemented steve russell ibm 704 computer russell read mccarthy paper realized mccarthy surprise lisp eval function could implemented machine code result working lisp interpreter could used run lisp programs properly evaluate lisp expressions two assembly language macros ibm 704 became primitive operations decomposing lists contents address part register number contents decrement part register number register used refer registers computer central processing unit cpu lisp dialects still use operations return first item list rest list respectively first complete lisp compiler written lisp implemented 1962 tim hart mike levin mit compiler introduced lisp model incremental compilation compiled interpreted functions intermix freely language used hart levin memo much closer modern lisp style mccarthy earlier code lisp difficult system implement compiler techniques stock hardware 1970s garbage collection routines developed mit graduate student daniel edwards made practical run lisp general-purpose computing systems efficiency still problem led creation lisp machines dedicated hardware running lisp environments programs 1980s 1990s great effort made unify work new lisp dialects mostly successors maclisp zetalisp nil new implementation lisp single language new language common lisp somewhat compatible dialects replaced book common lisp language notes compatibility various constructs 1994 ansi published common lisp standard ansi x3.226-1994 information technology programming language common lisp since inception lisp closely connected artificial intelligence research community especially pdp-10 systems lisp used implementation programming language micro planner used famous ai system shrdlu 1970s ai research spawned commercial offshoots performance existing lisp systems became growing issue sixty-year history lisp spawned many variations core theme s-expression language moreover given dialect may several implementations\u2014for instance dozen implementations common lisp differences dialects may quite visible\u2014for instance common lisp uses keyword codice_1 name function scheme uses codice_2 within dialect standardized however conforming implementations support core language different extensions libraries declined somewhat 1990s lisp experienced resurgence interest 2000 new activity focused around implementations common lisp scheme emacs lisp clojure racket includes development new portable libraries applications many new lisp programmers inspired writers paul graham eric s. raymond pursue language others considered antiquated new lisp programmers often describe language eye-opening experience claim substantially productive languages increase awareness may contrasted ai winter lisp brief gain mid-1990s dan weinreb lists survey common lisp implementations eleven actively maintained common lisp implementations scieneer common lisp new commercial implementation forked cmucl first release 2002 open source community created new supporting infrastructure cliki wiki collects common lisp related information common lisp directory lists resources lisp popular irc channel allows sharing commenting code snippets support lisppaste irc bot written lisp planet lisp collects contents various lisp-related blogs lispforum users discuss lisp topics lispjobs service announcing job offers weekly news service weekly lisp news common-lisp.net hosting site open source common lisp projects quicklisp library manager common lisp fifty years lisp 1958\u20132008 celebrated lisp50 oopsla regular local user meetings boston vancouver hamburg events include european common lisp meeting european lisp symposium international lisp conference scheme community actively maintains twenty implementations several significant new implementations chicken gambit gauche ikarus larceny ypsilon developed 2000s decade revised report algorithmic language scheme standard scheme widely accepted scheme community scheme requests implementation process created lot quasi standard libraries extensions scheme user communities individual scheme implementations continue grow new language standardization process started 2003 led rrs scheme standard 2007 academic use scheme teaching computer science seems declined somewhat universities longer using scheme computer science introductory courses mit uses python instead scheme undergraduate computer science program mitx massive open online course several new dialects lisp arc hy nu liskell lfe lisp flavored erlang parser julia implemented femtolisp dialect scheme julia inspired scheme often considered lisp common lisp scheme represent two major streams lisp development languages embody significantly different design choices common lisp successor maclisp primary influences lisp machine lisp maclisp nil s-1 lisp spice lisp scheme many features lisp machine lisp large lisp dialect used program lisp machines designed efficiently implementable personal computer workstation common lisp general-purpose programming language thus large language standard including many built-in data types functions macros language elements object system common lisp object system common lisp also borrowed certain features scheme lexical scoping lexical closures common lisp implementations available targeting different platforms llvm java virtual machine x86-64 powerpc alpha arm motorola 68000 mips operating systems windows macos linux solaris freebsd netbsd openbsd dragonfly bsd heroku scheme statically scoped properly tail-recursive dialect lisp programming language invented guy l. steele jr. gerald jay sussman designed exceptionally clear simple semantics different ways form expressions designed decade earlier common lisp scheme minimalist design much smaller set standard features certain implementation features tail-call optimization full continuations specified common lisp wide variety programming paradigms including imperative functional message passing styles find convenient expression scheme scheme continues evolve series standards revised report algorithmic language scheme series scheme requests implementation clojure recent dialect lisp targets mainly java virtual machine common language runtime clr python vm ruby vm yarv compiling javascript designed pragmatic general-purpose language clojure draws considerable influences haskell places strong emphasis immutability clojure provides access java frameworks libraries optional type hints type inference calls java avoid reflection enable fast primitive operations lisp dialects used scripting languages many applications best-known emacs lisp emacs editor autolisp later visual lisp autocad nyquist audacity scheme lilypond potential small size useful scheme interpreter makes particularly popular embedded scripting examples include siod tinyscheme successfully embedded gimp image processor generic name script-fu librep lisp interpreter john harper originally based emacs lisp language embedded sawfish window manager lisp first language structure program code represented faithfully directly standard data structure\u2014a quality much later dubbed homoiconicity thus lisp functions manipulated altered even created within lisp program without lower-level manipulations generally considered one main advantages language regard expressive power makes language suitable syntactic macros metacircular evaluation conditional using if\u2013then\u2013else syntax invented mccarthy fortran context proposed inclusion algol made part algol 58 specification lisp mccarthy used general cond -structure algol 60 took if\u2013then\u2013else popularized lisp deeply influenced alan kay leader research team developed smalltalk xerox parc turn lisp influenced smalltalk later dialects adopting object-oriented programming features inheritance classes encapsulating instances message passing etc 1970s flavors object system introduced concept multiple inheritance mixin common lisp object system provides multiple inheritance multimethods multiple dispatch first-class generic functions yielding flexible powerful form dynamic dispatch served template many subsequent lisp including scheme object systems often implemented via metaobject protocol reflective metacircular design object system defined terms lisp second language smalltalk still one languages possess metaobject system many years later alan kay suggested result confluence features smalltalk lisp could regarded properly conceived object-oriented programming systems lisp introduced concept automatic garbage collection system walks heap looking unused memory progress modern sophisticated garbage collection algorithms generational garbage collection stimulated use lisp edsger w. dijkstra 1972 turing award lecture said largely resource requirements respect early computing hardware including early microprocessors lisp become popular outside ai community fortran algol-descended c language suitability complex dynamic applications lisp enjoying resurgence popular interest 2010s lisp expression oriented language unlike languages distinction made expressions statements code data written expressions expression evaluated produces value common lisp possibly multiple values embedded expressions value data type mccarthy 1958 paper introduced two types syntax symbolic expressions s-expressions sexps mirror internal representation code data meta expressions m-expressions express functions s-expressions m-expressions never found favor almost lisps today use s-expressions manipulate code data use parentheses lisp immediately obvious difference programming language families result students long given lisp nicknames lost stupid parentheses lots irritating superfluous parentheses however s-expression syntax also responsible much lisp power syntax extremely regular facilitates manipulation computer however syntax lisp limited traditional parentheses notation extended include alternative notations example xmlisp common lisp extension employs metaobject protocol integrate s-expressions extensible markup language xml reliance expressions gives language great flexibility lisp functions written lists processed exactly like data allows easy writing programs manipulate programs metaprogramming many lisp dialects exploit feature using macro systems enables extension language almost without limit lisp list written elements separated whitespace surrounded parentheses example list whose elements three atoms values implicitly typed respectively two integers lisp-specific data type called symbol declared empty list also represented special atom entity lisp atom list expressions written lists using prefix notation first element list name function name macro lambda expression name special operator see remainder list arguments example function returns arguments list expression evaluates list quote preceding example special operator returns argument without evaluating unquoted expressions recursively evaluated enclosing expression evaluated example evaluates list note third argument list lists nested arithmetic operators treated similarly expression evaluates 10 equivalent infix notation would lisp notion operators implemented algol-derived languages arithmetic operators lisp variadic functions n-ary able take number arguments c-style '++ increment operator sometimes implemented name incf giving syntax equivalent setq x x 1 returning new value x special operators sometimes called special forms provide lisp control structure example special operator takes three arguments first argument non-nil evaluates second argument otherwise evaluates third argument thus expression evaluates course would useful non-trivial expression substituted place lisp also provides logical operators operators short circuit evaluation return first nil non-nil argument respectively evaluate james another special operator used bind variables values evaluated within expression operator also used create functions arguments list arguments expression expressions function evaluates returned value value last expression evaluated expression evaluates function applied takes one argument binds returns number one greater argument lambda expressions treated differently named functions invoked way therefore expression evaluates 're function application execute anonymous function passing value 5 named functions created storing lambda expression symbol using defun macro original lisp two fundamental data types atoms lists list finite ordered sequence elements element either atom list atom number symbol symbol essentially unique named item written alphanumeric string source code used either variable name data item symbolic processing example list contains three elements symbol list number 2 essential difference atoms lists atoms immutable unique two atoms appeared different places source code written exactly way represented object whereas list separate object could altered independently lists could distinguished lists comparison operators data types introduced later lisp dialects programming styles evolved concept atom lost importance many dialects still retained predicate atom legacy compatibility defining true object cons lisp list implemented singly linked list cell list called cons scheme pair composed two pointers called car cdr respectively equivalent fields discussed article linked list many data structures built cons cells one basic called proper list proper list either special empty list symbol cons points datum may another cons structure list points another proper list given cons taken head linked list car points first element list cdr points rest list reason functions also called referring conses part linked list rather say tree thus lisp list atomic object instance container class c++ java would list nothing aggregate linked conses variable refers given list simply pointer first cons list traversal list done cdring list taking successive cdrs visit cons list using several higher-order functions map function list conses lists universal lisp systems common misconception lisp data structures fact simplistic lisps data structures vectors arrays hash tables structures forth parenthesized s-expressions represent linked list structures several ways represent list s-expression cons written dotted-pair notation car cdr longer proper list might written dotted-pair notation conventionally abbreviated list notation improper list may written combination two \u2013 list three conses whose last cdr i.e. list fully specified form lisp provides many built-in procedures accessing controlling lists lists created directly procedure takes number arguments returns list arguments way lists constructed cons pairs procedure used add element front list note procedure asymmetric handles list arguments lists constructed procedure appends two lists one another lisp lists linked lists appending two lists asymptotic time complexity formula_1 lisp lists simple linked lists share structure one another say two lists tail final sequence conses instance execution following common lisp code lists respectively however tail structure lists copy cons cells pointing memory locations lists sharing structure rather copying give dramatic performance improvement however technique interact undesired ways functions alter lists passed arguments altering one list replacing affect changes thereby also changes \u2013 possibly unexpected result source bugs functions alter arguments documented destructive reason aficionados functional programming avoid destructive functions scheme dialect favors functional style names destructive functions marked cautionary exclamation point bang \u2014such read set car bang replaces car cons common lisp dialect destructive functions commonplace equivalent named replace car function rarely seen however common lisp includes special facility make easier define use destructive functions frequent style common lisp write code functionally without destructive calls prototyping add destructive calls optimization safe lisp evaluates expressions entered user symbols lists evaluate usually simpler expression \u2013 instance symbol evaluates value variable names evaluates however forms evaluate entering lisp returns expression also marked prevent evaluated necessary symbols lists role special operator abbreviation one quotation mark instance usually entering symbol returns value corresponding variable error variable refer literal symbol enter usually common lisp scheme also support backquote operator termed quasiquote scheme entered character grave accent almost plain quote except allows expressions evaluated values interpolated quoted list comma unquote comma-at splice operators variable value evaluates evaluates backquote often used defining macro expansions self-evaluating forms quoted forms lisp equivalent literals may possible modify values mutable literals program code instance function returns quoted form code calls function modifies form may alter behavior function subsequent iterations modifying quoted form like generally considered bad style defined ansi common lisp erroneous resulting undefined behavior compiled files file-compiler coalesce similar constants put write-protected memory etc. lisp formalization quotation noted douglas hofstadter g\u00f6del escher bach others example philosophical idea self-reference lisp family splits use dynamic static a.k.a lexical scope clojure common lisp scheme make use static scoping default newlisp picolisp embedded languages emacs autocad use dynamic scoping since version 24.1 emacs uses dynamic lexical scoping fundamental distinction lisp languages lisp textual representation program simply human-readable description internal data structures linked lists symbols number characters etc would used underlying lisp system lisp uses implement powerful macro system like macro languages c macro returns code compiled however unlike c macros macros lisp functions exploit full power lisp lisp code structure lists macros built list-processing functions language short anything lisp data structure lisp macros code contrast languages parser output purely internal language implementation manipulated programmer feature makes easy develop efficient languages within languages example common lisp object system implemented cleanly language extension using macros means application needs different inheritance mechanism use different object system stark contrast languages example java support multiple inheritance reasonable way add simplistic lisp implementations list structure directly interpreted run program function literally piece list structure traversed interpreter executing however substantial lisp systems also include compiler compiler translates list structure machine code bytecode execution code run fast code compiled conventional languages c. macros expand compilation step thus offer interesting options program needs precomputed table macro might create table compile time compiler need output table need call code create table run time lisp implementations even mechanism codice_3 allows code present compile time macro would need present emitted module lisp languages often used interactive command line may combined integrated development environment ide user types expressions command line directs ide transmit lisp system lisp reads entered expressions evaluates prints result reason lisp command line called read\u2013eval\u2013print loop repl basic operation repl follows simplistic description omits many elements real lisp quoting macros function accepts textual s-expressions input parses internal data structure instance type text prompt translates linked list three elements symbol number 1 number 2 happens list also valid piece lisp code evaluated car list names function\u2014the addition operation note read single symbol read number one hundred twenty-three read string 123 function evaluates data returning zero lisp data result evaluation mean interpretation lisp systems compile every expression native machine code simple however describe evaluation interpretation evaluate list whose car names function first evaluates arguments given cdr applies function arguments case function addition applying argument list yields answer result evaluation symbol evaluates value symbol foo data like string 123 evaluates string list evaluates list 1 2 3 job function represent output user simple result trivial expression evaluated piece list structure would require traverse list print s-expression implement lisp repl necessary implement three functions infinite-loop function naturally implementation complex since must also implement special operators like done basic repl one line code lisp repl typically also provides input editing input history error handling interface debugger lisp usually evaluated eagerly common lisp arguments evaluated applicative order 'leftmost innermost scheme order arguments undefined leaving room optimization compiler lisp originally control structures many added language evolution lisp original conditional operator precursor later structures programmers scheme dialect often express loops using tail recursion scheme commonality academic computer science led students believe tail recursion common way write iterations lisp incorrect oft-seen lisp dialects imperative-style iteration constructs scheme loop common lisp complex expressions moreover key issue makes objective rather subjective matter scheme makes specific requirements handling tail calls thus reason use tail recursion generally encouraged scheme practice expressly supported language definition contrast ansi common lisp require optimization commonly termed tail call elimination thus fact tail recursive style casual replacement use traditional iteration constructs discouraged common lisp matter stylistic preference potentially one efficiency since apparent tail call common lisp may compile simple jump program correctness since tail recursion may increase stack use common lisp risking stack overflow lisp control structures special operators equivalent languages syntactic keywords expressions using operators surface appearance function calls differ arguments necessarily evaluated\u2014or case iteration expression may evaluated contrast major programming languages lisp allows implementing control structures using language several control structures implemented lisp macros even macro-expanded programmer wants know work common lisp scheme operators non-local control flow differences operators deepest differences two dialects scheme supports re-entrant continuations using procedure allows program save later restore particular place execution common lisp support re-entrant continuations support several ways handling escape continuations often algorithm expressed lisp either imperative functional style noted scheme tends favor functional style using tail recursion continuations express control flow however imperative style still quite possible style preferred many common lisp programmers may seem familiar programmers used structured languages c preferred schemers closely resembles pure-functional languages haskell lisp early heritage list processing wide array higher-order functions relating iteration sequences many cases explicit loop would needed languages like loop c lisp task accomplished higher-order function true many functional programming languages good example function scheme called common lisp called given function one lists applies function successively lists elements order collecting results new list applies function corresponding pair list elements yielding result examples common lisp code basic hello world program lisp syntax lends naturally recursion mathematical problems enumeration recursively defined sets simple express notation evaluate number factorial alternative implementation takes less stack space previous version underlying lisp system optimizes tail recursion contrast iterative version uses common lisp macro following function reverses list lisp built-in reverse function thing various object systems models built top alongside lisp including", + "neighbors": [ + 27, + 29, + 31, + 46, + 53, + 56, + 65, + 78, + 87, + 117, + 134, + 152, + 173, + 176, + 194, + 203, + 210, + 216, + 225, + 246, + 249, + 251, + 270, + 292, + 306, + 308, + 313, + 322, + 332, + 347, + 360, + 373, + 383, + 391, + 392, + 396, + 446, + 447, + 454, + 488, + 491, + 501, + 503, + 506, + 509, + 536, + 538, + 565, + 567, + 579, + 601, + 649, + 653, + 682, + 693, + 739, + 753, + 756, + 782, + 787, + 795, + 806, + 820, + 825, + 828, + 831, + 873, + 901, + 919, + 929, + 934, + 947, + 948, + 978, + 984, + 987, + 990, + 998, + 1005, + 1010, + 1021, + 1028, + 1044, + 1066, + 1076, + 1111, + 1118, + 1119, + 1120, + 1123, + 1138, + 1146, + 1152, + 1173, + 1180, + 1189, + 1207, + 1213, + 1221, + 1225, + 1227, + 1231, + 1233, + 1235, + 1245, + 1251, + 1269, + 1277, + 1298, + 1311, + 1315, + 1319, + 1324, + 1372, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1437, + 1457, + 1466, + 1477, + 1491, + 1511, + 1516, + 1536, + 1578, + 1588, + 1609, + 1633, + 1635, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 920, + "label": 2, + "text": "DriveSpace:drivespace drivespace initially known doublespace disk compression utility supplied ms-dos starting version 6.0 1993 purpose drivespace increase amount data user could store disks transparently compressing decompressing data on-the-fly primarily intended use hard drives use floppy disks also supported common usage scenario user would one hard drive computer space allocated one partition usually drive c software would compress entire drive contents one large file root partition booting system driver would allocate large file drive c enabling files accessed normal microsoft decision add disk compression ms-dos 6.0 influenced fact competing dr dos earlier started include disk compression software since version 6.0 1991 instead developing product scratch microsoft licensed technology doubledisk product developed vertisoft adapted become doublespace instance loading driver controlling compression/decompression dblspace.bin became deeply integrated operating system loaded undocumented pre-load api even config.sys file microsoft originally sought license technology stac electronics similar product called stacker negotiations failed microsoft later successfully sued patent infringement stac electronics violating compression patents court case stac electronics claimed microsoft refused pay money attempted license stacker offering possibility stac electronics develop enhancement products computer programs particularly games incompatible doublespace effectively bypassed doublespace driver doublespace also consumed significant amount conventional memory making difficult run memory-intensive programs shortly release reports data loss emerged company called blossom software claimed found bug could lead data corruption bug occurred writing files heavily fragmented disks demonstrated program called bust.exe company sold program called doublecheck could used check fragmentation condition could lead error microsoft position error occurred unlikely conditions fixed problem ms-dos 6.2 fragmentation condition related way doublespace compresses individual clusters size say 8k fits disk occupying fewer sectors size 512 bytes fixed number required without doublespace 16 sectors example created possibility kind internal fragmentation issue doublespace would unable find enough consecutive sectors storing compressed cluster even plenty space available potential causes data loss included corruption doublespace memory areas programs doublespace memory areas protected ms-dos ran real mode microsoft attempted remedy ms-dos 6.2 version doublespace via feature called doubleguard would check corruption fact compressed contents compressed drive stored single file implied possibility user accidentally deleting his/her data deleting file could happen user inadvertently got access host drive containing file host drive usually mapped letter h compression driver however compression driver failed load user might see drive c turning computer doublespace could finish updating data structures could also result data loss problem compounded microsoft making write caching enabled default smartdrv disk cache software came ms-dos 6.0 change exiting application ms-dos prompt might appear data written disk however due lack controlled shutdown procedure found modern operating systems many users saw appearance ms-dos prompt indication safe switch computer typically case prior ms-dos 6.0 microsoft addressed issue ms-dos 6.2 write caching still enabled default cache would flushed allowing command prompt reappear addstor inc. offered add-on product called double tools doublespace contained number tools enhance functions version doublespace came ms-dos 6.0 included various diagnostic features ability compressed removable media auto-mounted used well support background defragmentation doublespace compressed drives defragment files background possible let doubletools replace low-level doublespace driver dblspace.bin one supplied doubletools replacing driver also enabled enhanced functionality product use 32-bit code paths detected intel 80386 higher cpu caching capabilities addition supporting use upper memory area also permitted use extended memory buffers reducing driver total footprint conventional upper memory albeit cost somewhat reduced speed another function ability split compressed volume multiple floppy disks able see entire volume first disk inserted prompted change discs necessary also possible share compressed volume remote computer double tools also capability put special utility compressed floppy disks made possible access compressed data even computers n't doublespace double tools vertisoft company developed doubledisk program microsoft subsequently licensed turned doublespace developed sold doublespace add-on program called spacemanager contained number usability enhancements also offered improved compression ratios products like later versions stacker stac electronics capable converting existing doublespace compressed drives format ms-dos 6.2 featured new improved version doublespace ability remove doublespace added program scandisk introduced release able scan non-compressed compressed drives including checks internal doublespace structures security features known doubleguard added prevent memory corruption leading data loss memory footprint doublespace driver reduced compared version shipped ms-dos 6.0 fix made fragmentation issue discussed following successful lawsuit stac electronics regarding demonstrated patent infringement microsoft released ms-dos 6.21 without doublespace court injunction also prevented distribution previous versions ms-dos included doublespace ms-dos 6.22 contained reimplemented version disk compression software time released name drivespace software essentially identical ms-dos 6.2 version doublespace user point view compatible previous versions windows 95 full support doublespace/drivespace via native 32-bit driver accessing compressed drives along graphical version software tools ms-dos drivespace users could upgrade windows 95 without troubles furthermore microsoft plus windows 95 pack contained version 3 drivespace version introduced new compression formats hipack ultrapack different performance characteristics even greater compression ratios along tool could recompress files disk using different formats depending frequently files used one could upgrade drivespace 2 drivespace 3 downgrade path back drivespace 2 one could however decompress drivespace 3 drive dos device driver drivespace 3 memory footprint around 150 kb new features caused difficulty users rebooting ms-dos mode windows 95 running games reduced amount conventional memory available drivespace 3 also shipped windows 95 osr2 many features disabled unless plus also installed drivespace could also used fat32 making little use pcs large hard drives windows 98 shipped drivespace 3 part operating system functionality windows 95 plus removal real mode support fat32 going mainstream decreasing popularity drivespace drivespace windows limited support drivespace longer supported hard disk compression still supported reading writing compressed removable media although drivespace operation supported beside deleting reallocating compressed drives possible restore full function drivespace 3 unofficially windows copying executable file windows 98 installation using replace executable included windows one could compress new drives could windows 98 dmsdos linux kernel driver developed late 1990s support reading writing doublespace/drivespace disks however reading especially writing compressed filesystems reliable specific versions 2.0 2.1 2.2 versions kernel dr-dos supported disk compression technology originally based superstor later stacker novell dos 7 1993 higher introduced emulation undocumented pre-load api order provide seamless support doublespace well since dr-dos drivers dpms-enabled whereas ms-dos one offer advantages dr-dos users allowed easier coexistence migration due possibility shared use already existing compressed volumes multi-boot scenarios dr-dos 7.02 higher also added support drivespace 1998", + "neighbors": [ + 22, + 26, + 66, + 79, + 93, + 148, + 153, + 255, + 262, + 268, + 295, + 312, + 326, + 336, + 344, + 377, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 639, + 662, + 689, + 705, + 764, + 791, + 801, + 865, + 904, + 961, + 989, + 1025, + 1035, + 1042, + 1050, + 1092, + 1098, + 1109, + 1110, + 1138, + 1151, + 1188, + 1212, + 1243, + 1247, + 1261, + 1304, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1587, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 921, + "label": 4, + "text": "Disaster_recovery:disaster recovery disaster recovery involves set policies tools procedures enable recovery continuation vital technology infrastructure systems following natural human-induced disaster disaster recovery focuses technology systems supporting critical business functions opposed business continuity involves keeping essential aspects business functioning despite significant disruptive events disaster recovery therefore considered subset business continuity service continuity itsc subset business continuity planning bcp encompasses disaster recovery planning wider resilience planning also incorporates elements infrastructure services relate communications voice telephony data communications itsc plan reflects recovery point objective rpo recent transactions recovery time objective rto time intervals planning includes arranging backup sites hot warm cold standby sites hardware needed continuity 2008 british standards institution launched specific standard connected supporting business continuity standard bs 25999 titled bs25777 specifically align computer continuity business continuity withdrawn following publication march 2011 iso/iec 27031 security techniques \u2014 guidelines information communication technology readiness business continuity itil defined terms recovery time objective rto targeted duration time service level within business process must restored disaster disruption order avoid unacceptable consequences associated break business continuity accepted business continuity planning methodology rto established business impact analysis bia owner process including identifying options time frames alternate manual workarounds good deal literature subject rto spoken complement recovery point objective rpo two metrics describing limits acceptable tolerable itsc performance terms time lost rto normal business process functioning terms data lost backed period time rpo respectively forbes overview noted recovery time actual rta critical metric business continuity disaster recovery rta established exercises actual events business continuity group times rehearsals actuals makes needed refinements recovery point objective rpo defined business continuity planning maximum targeted period data transactions might lost service due major incident rpo measured minutes even hours practice off-site mirrored backups must continuously maintained daily off-site backup tape suffice recovery instantaneous restore data/transactions period time goal without incurring significant risks significant losses rpo measures maximum time period recent data might permanently lost event major incident direct measure quantity loss instance bc plan restore last available backup rpo maximum interval backup safely vaulted offsite business impact analysis used determine rpo service rpo determined existent backup regime level preparation off-site data required period data might lost often starts near time beginning work prepare backups time backups taken off-site although data synchronization point point time timing performing physical backup must included one approach used halt processing update queue disk-to-disk copy made backup reflects earlier time copy operation data copied tape transmitted elsewhere rto rpo must take business risk account along major system design criteria rpo tied times backups sent offsite offsiting via synchronous copies offsite mirror allows unforeseen difficulty use physical transportation tapes transportable media comfortably covers backup needs relatively low cost recovery enacted predetermined site shared offsite space hardware completes package needed high volumes high value transaction data hardware split across two sites splitting across geographic areas adds resiliency planning disaster recovery information technology developed mid- late 1970s computer center managers began recognize dependence organizations computer systems time systems batch-oriented mainframes another offsite mainframe could loaded backup tapes pending recovery primary site downtime relatively less critical disaster recovery industry developed provide backup computer centers one earliest centers located sri lanka sungard availability services 1978 1980s 90s internal corporate timesharing online data entry real-time processing grew availability systems needed regulatory agencies became involved even rapid growth internet 2000s objectives 2 3 4 5 nines 99.999 often mandated high-availability solutions hot-site facilities sought service continuity essential many organizations implementation business continuity management bcm information security management icm part implementation operation information security management well business continuity management specified iso/iec 27001 iso 22301 respectively rise cloud computing since 2010 continues trend nowadays matters even less computing services physically served long network sufficiently reliable separate issue less concern since modern networks highly resilient design 'recovery service raas one security features benefits cloud computing promoted cloud security alliance disasters classified two broad categories first natural disasters floods hurricanes tornadoes earthquakes preventing natural disaster impossible risk management measures avoiding disaster-prone situations good planning help second category man-made disasters hazardous material spills infrastructure failure bio-terrorism disastrous bugs failed change implementations instances surveillance testing mitigation planning invaluable recent research supports idea implementing holistic pre-disaster planning approach cost-effective long run every 1 spent hazard mitigation disaster recovery plan saves society 4 response recovery costs 2015 disaster recovery statistics suggest downtime lasting one hour cost systems become increasingly critical smooth operation company arguably economy whole importance ensuring continued operation systems rapid recovery increased example companies major loss business data 43 never reopen 29 close within two years result preparation continuation recovery systems needs taken seriously involves significant investment time money aim ensuring minimal losses event disruptive event control measures steps mechanisms reduce eliminate various threats organizations different types measures included disaster recovery plan drp disaster recovery planning subset larger process known business continuity planning includes planning resumption applications data hardware electronic communications networking infrastructure business continuity plan bcp includes planning non-it related aspects key personnel facilities crisis communication reputation protection refer disaster recovery plan drp related infrastructure recovery continuity disaster recovery control measures classified following three types good disaster recovery plan measures dictate three types controls documented exercised regularly using so-called dr tests prior selecting disaster recovery strategy disaster recovery planner first refers organization business continuity plan indicate key metrics recovery point objective recovery time objective metrics business processes mapped systems infrastructure failure properly plan extend disaster impact metrics mapped organization reviews budget rto rpo metrics must fit available budget cost-benefit analysis often dictates disaster recovery measures implemented adding cloud-based backup benefits local offsite tape archiving new york times wrote adds layer data protection common strategies data protection include many cases organization may elect use outsourced disaster recovery provider provide stand-by site systems rather using remote facilities increasingly via cloud computing addition preparing need recover systems organizations also implement precautionary measures objective preventing disaster first place may include disaster recovery service draas arrangement third party although vendor lists published disaster recovery product even though several large hardware vendors developed mobile/modular offerings installed made operational short time", + "neighbors": [ + 272, + 397, + 463, + 494, + 611, + 647, + 755, + 930, + 965, + 1137 + ], + "mask": "Test" + }, + { + "node_id": 922, + "label": 6, + "text": "List_of_cryptographic_file_systems:list cryptographic file systems list filesystems support filesystem-level encryption confused full-disk encryption", + "neighbors": [ + 34, + 35, + 40, + 55, + 63, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 813, + 887, + 892, + 900, + 908, + 912, + 942, + 961, + 982, + 997, + 1003, + 1056, + 1064, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1578, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 923, + "label": 4, + "text": "Shinken_(software):shinken software shinken open source computer system network monitoring software application compatible nagios watches hosts services gathers performance data alerts users error conditions occur conditions clear shinken architecture aims offer easier load balancing high availability administrator manages single configuration system automatically cuts parts dispatches worker nodes takes name functionality shinken japanese sword shinken written jean gab\u00e8s proof concept new nagios architecture believing new implementation faster flexible old c code proposed new development branch nagios 4 proposal turned nagios authors shinken became independent network monitoring software application compatible nagios shinken designed run operating systems python runs development environment linux also runs well unix variants windows reactionner process responsible sending notifications also run android os free software licensed terms affero general public license published free software foundation shinken installation consists several processes optimized specific task multiple instances type process either single host spread many hosts adding processes automatically distributes load shinken webui builtin web interface provides near real time status information configuration interaction dashboard visualize trending data graphite databases visualization dependency tree graphs shinken skonfui independent web front-end used manage discovery process configuration tasks shinken-admin cli script used manage runtime process level aspects system changing logging levels getting health reports install.sh cli script main management script install remove update shinken associated software shinken open test-driven development approach contributors project providing new features code refactoring code quality bug fixing source code hosted github integration server runs tests commit depth tests regular intervals shinken documentation hosted wiki", + "neighbors": [ + 134, + 270, + 306, + 470, + 528, + 684, + 757, + 961, + 1138, + 1225, + 1227, + 1235, + 1311, + 1395, + 1452, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 924, + "label": 7, + "text": "Toast,_Inc.:toast inc. toast inc. cloud-based restaurant software company based boston massachusetts company provides restaurant management point sale pos system built android operating system toast founded cambridge massachusetts 2012 steve fredette aman narang jonathan grimm 2016 toast received 30 million round series b funding bessemer venture partners gv formerly google ventures toast used thousands restaurants small cafes nationwide enterprises across u.s. toast founders steve fredette aman narang jonathan grimm met software company endeca graduating mit cambridge endeca acquired oracle 2011 left start toast grimm narang fredette initially created consumer app centered mobile payments customer loyalty promotions social aspects integrated restaurants \u2019 existing pos systems company started realize restaurants far needs able accept payments using phone tablet company pivoted full restaurant technology platform solutions pos online ordering gift cards analytics features two years later company signed 1,000 merchants across united states grew 120 employees requiring company upgrade space 7,000 square feet cambridge 40,000 square feet hatch fenway co-working space 2013 toast received investments several boston executives including former ceo endeca steve papa serves board member company early 2015 toast announced chris comparato chief executive officer comparato previously served senior vice president customer success acquia senior vice president worldwide customer solutions endeca august toast announced signed 1,000 customers two years revealing 550 year-over-year growth november toast released first restaurant report analyzed market restaurant technology well restaurant owners \u2019 challenges preferred technology features january 2016 toast received 30 million round series b funding bessemer venture partners gv previously known google ventures alphabet company funding led bvp partner kent bennett general partner android co-founder rich miner several undisclosed investors also participated round february 2018 needham-based tripadvisor partnered toast inc july 2018 company became one unicorn startup companies series round financing raising 115 million valuing company 1.4 billion first quarter 2019 company raised 250 million based valuation 2.7 billion equity raise led tcv tiger global management july 2019 toast acquired chicago-based human resources payroll software company stratex company also said would add additional 1,000 employees 2019 toast restaurant management system operates android operating system backend managed via mobile device via web browser real-time associated hardware includes receipt printer cash drawer kitchen display screen magstripe card reader 2015 merchant maverick named toast one best pos systems pizza parlors 2016 toast recognized notable player restaurant technology landscape pymnts.com may 2016 new england venture capital association nevca named toast winner hottest startup a+ 2016 nevy awards", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 925, + "label": 2, + "text": "Time-sharing_system_evolution:time-sharing system evolution article covers evolution time-sharing systems providing links major early time-sharing operating systems showing subsequent evolution time-sharing developed late 1950s realization single expensive computer could efficiently utilized multitasking multiprogramming operating system allowed multiple users simultaneous interactive access typically individual user would enter bursts information followed long pauses group users working time pauses one user would filled activity others similarly small slices time spent waiting disk tape network input could granted users given optimal group size overall process could efficient user would use computer terminal initially electromechanical teleprinters teletype model 33 asr friden flexowriter 1970 progressively superseded crt-based units dec vt05 datapoint 2200 lear siegler adm-3a terminals initially linked nearby computer via current loop serial cables conventional telegraph circuits provided ptts specialist digital leased lines t1 modems bell 103 successors allowed remote higher-speed use analogue voice telephone network see details additional systems table relationships shown purpose grouping entries reflect influences e.g. os/2 influenced vax/vms ms-dos legacy x86 platform cambridge multiple-access system first time-sharing system developed outside united states", + "neighbors": [ + 1, + 37, + 64, + 85, + 134, + 166, + 170, + 373, + 457, + 804, + 870, + 897, + 941, + 961, + 966, + 1002, + 1012, + 1053, + 1087, + 1213, + 1284, + 1287, + 1304, + 1494, + 1546, + 1616 + ], + "mask": "Train" + }, + { + "node_id": 926, + "label": 9, + "text": "Lazy_evaluation:lazy evaluation programming language theory lazy evaluation call-by-need evaluation strategy delays evaluation expression value needed non-strict evaluation also avoids repeated evaluations sharing sharing reduce running time certain functions exponential factor non-strict evaluation strategies call-by-name however lengthy operations would appropriate perform time-sensitive operations handling user inputs video game benefits lazy evaluation include lazy evaluation often combined memoization described jon bentley writing efficient programs function value computed parameter set parameters result stored lookup table indexed values parameters next time function called table consulted determine whether result combination parameter values already available stored result simply returned function evaluated another entry added lookup table reuse lazy evaluation lead reduction memory footprint since values created needed however lazy evaluation difficult combine imperative features exception handling input/output order operations becomes indeterminate lazy evaluation introduce memory leaks opposite lazy evaluation eager evaluation sometimes known strict evaluation eager evaluation evaluation strategy employed programming languages lazy evaluation introduced lambda calculus christopher wadsworth programming languages independently introduced peter henderson james h. morris daniel p. friedman david s. wise delayed evaluation used particularly functional programming languages using delayed evaluation expression evaluated soon gets bound variable evaluator forced produce expression value statement codice_1 i.e assignment result expression variable clearly calls expression evaluated result placed codice_2 actually codice_2 irrelevant need value via reference codice_2 later expression whose evaluation could deferred though eventually rapidly growing tree dependencies would pruned produce symbol rather another outside world see delayed evaluation advantage able create calculable infinite lists without infinite loops size matters interfering computation example one could create function creates infinite list often called stream fibonacci numbers calculation n -th fibonacci number would merely extraction element infinite list forcing evaluation first n members list example haskell programming language list fibonacci numbers written haskell syntax codice_5 prepends element list codice_6 returns list without first element codice_7 uses specified function case addition combine corresponding elements two lists produce third provided programmer careful values required produce particular result evaluated however certain calculations may result program attempting evaluate infinite number elements example requesting length list trying sum elements list fold operation would result program either failing terminate running memory almost common eager languages statements evaluate lazy fashion evaluates evaluates true evaluate b otherwise evaluates c either b c evaluated conversely eager language expected behavior still evaluate e computing value f e even though e unused function f. however user-defined control structures depend exact syntax example j would evaluated eager language lazy language j would evaluated never lazy evaluation allows control structures defined normally primitives compile-time techniques j side effects introduce run time errors subtle differences l l complex usually possible introduce user-defined lazy control structures eager languages functions though may depart language syntax eager evaluation often involved code bodies like j need wrapped function value executed called short-circuit evaluation boolean control structures sometimes called lazy many languages offer notion infinite data-structures allow definitions data given terms infinite ranges unending recursion actual values computed needed take example trivial program haskell function numberfrominfinitelist value infinity infinite range actual value specifically specific value certain index needed list evaluated even evaluated needed desired index compound expression might form easilycomputed lotsofwork easy part gives true lot work could avoided instance suppose large number n checked determine prime number function isprime n available alas require lot computation evaluate perhaps n=2 mod n,2 \u22600 isprime n help many evaluations arbitrary values n. compound expression might form safetotry expression whereby safetotry false attempt evaluating expression lest run-time error signalled divide-by-zero index-out-of-bounds etc instance following pseudocode locates last non-zero element array elements array zero loop work l 0 case loop must terminated without attempting reference element zero array exist computer windowing systems painting information screen driven expose events drive display code last possible moment windowing systems avoid computing unnecessary display content updates another example laziness modern computer systems copy-on-write page allocation demand paging memory allocated value stored memory changed laziness useful high performance scenarios example unix mmap function provides demand driven loading pages disk pages actually touched loaded memory unneeded memory allocated matlab implements copy edit arrays copied actual memory storage replicated content changed possibly leading memory error updating element afterwards instead copy operation programming languages delay evaluation expressions default others provide functions special syntax delay evaluation miranda haskell evaluation function arguments delayed default many languages evaluation delayed explicitly suspending computation using special syntax scheme codice_8 codice_9 ocaml codice_10 codice_11 generally wrapping expression thunk object representing explicitly delayed evaluation called lazy future perl 6 uses lazy evaluation lists one assign infinite lists variables use arguments functions unlike haskell miranda perl 6 n't use lazy evaluation arithmetic operators functions default lazy programming languages haskell although default evaluate expressions demanded possible cases make code eager\u2014or conversely make lazy made eager done explicitly coding something forces evaluation may make code eager avoiding code may make code lazy strict evaluation usually implies eagerness technically different concepts however optimisation implemented compilers called strictness analysis cases allows compiler infer value always used cases may render programmer choice whether force particular value irrelevant strictness analysis force strict evaluation haskell marking constructor fields strict means values always demanded immediately codice_12 function also used demand value immediately pass useful constructor field generally lazy however neither techniques implements recursive strictness\u2014for function called codice_13 invented also pattern matching haskell 98 strict default codice_14 qualifier used make lazy python 2.x codice_15 function computes list integers entire list stored memory first assignment statement evaluated example eager immediate evaluation python 3.x codice_15 function returns special range object computes elements list demand elements range object generated needed e.g. codice_17 evaluated following example example lazy deferred evaluation python 2.x possible use function called codice_18 returns object generates numbers range demand advantage codice_19 generated object always take amount memory version 2.2 forward python manifests lazy evaluation implementing iterators lazy sequences unlike tuple list sequences instance python 2 .net framework possible lazy evaluation using class system.lazy class easily exploited f using lazy keyword force method force evaluation also specialized collections like microsoft.fsharp.collections.seq provide built-in support lazy evaluation let fibonacci seq.unfold fun x x x 0i,1i fibonacci seq.nth 1000 c vb.net class system.lazy directly used public int sum practical example // recursive calculation n'th fibonacci number public int fib int n public void main another way use yield keyword // eager evaluation public ienumerable int fibonacci int x // lazy evaluation public ienumerable int lazyfibonacci int x", + "neighbors": [ + 29, + 386, + 392, + 521, + 538, + 567, + 723, + 789, + 825, + 998, + 1028, + 1207, + 1225, + 1227, + 1254, + 1256, + 1311, + 1388, + 1418, + 1430, + 1491, + 1532 + ], + "mask": "Test" + }, + { + "node_id": 927, + "label": 2, + "text": "IPad:ipad ipad line tablet computers designed developed marketed apple inc. run ios ipados mobile operating systems first ipad released april 3 2010 recent ipad models sixth-generation ipad released march 27 2018 fifth-generation ipad mini released march 18 2019 third-generation ipad air released march 18 2019 third-generation ipad pro released november 7 2018. apple sold 360 million ipads though sales peaked 2013 popular tablet computer sales second quarter 2018 user interface built around device multi-touch screen including virtual keyboard ipads connect via wi-fi models also cellular connectivity ipads shoot video take photos play music perform internet functions web-browsing emailing functions games reference gps navigation social networking etc enabled downloading installing apps app store million apps ipad apple third parties nine versions ipad first generation established design precedents persisted models 2nd-generation ipad ipad 2 introduced new thinner design dual-core apple a5 processor vga front-facing 720p rear-facing cameras designed facetime video calling third generation added retina display new apple a5x processor quad-core graphics processor 5-megapixel camera hd 1080p video recording voice dictation 4g lte fourth generation added apple a6x processor replaced 30-pin connector all-digital lightning connector ipad air added apple a7 processor apple m7 motion coprocessor reduced thickness first time since ipad 2 ipad air 2 added apple a8x processor apple m8 motion coprocessor 8-megapixel camera touch id fingerprint sensor reduced thickness ipad introduced 2017 added apple a9 processor sacrificing improvements ipad air 2 introduced exchange lower launch price 2018 apple released 2018 model ipad apple a10 fusion processor apple pencil support year later 2019 ipad air released 10.5-inch display apple a12 chip five versions ipad mini screen size first generation similar internal specifications ipad 2 uses lightning connector instead ipad mini 2 added retina display apple a7 processor apple m7 motion coprocessor closely matching internal specifications ipad air ipad mini 3 added touch id fingerprint sensor ipad mini 4 features apple a8 apple m8 motion coprocessor 5th generation features apple a12 soc three generations ipad pro first generation came 9.7 12.9 screen sizes second came 10.5 12.9 sizes third 11 12.9 sizes ipad pros unique features smart connector exclusive series ipads apple co-founder steve jobs said 1983 speech company strategy simple want want put incredibly great computer book carry around learn use 20 minutes ... really want radio link n't hook anything 're communication larger databases computers apple first tablet computer newton messagepad 100 introduced 1993 powered arm6 processor core developed arm 1990 spinout acorn computers apple invested apple also developed prototype powerbook duo based tablet penlite decided sell order avoid hurting messagepad sales apple released several newton-based pdas final one messagepad 2100 discontinued 1998 apple re-entered mobile-computing markets 2007 iphone smaller ipad featuring camera mobile phone pioneered multi-touch finger-sensitive touchscreen interface apple ios mobile operating system late 2009 ipad release rumored several years speculation mostly talked apple tablet specific names included itablet islate ipad announced january 27 2010 steve jobs apple press conference yerba buena center arts san francisco jobs later said apple begun developing ipad iphone jonathan ive 1991 created industrial design stylus-based tablet macintosh folio first project apple 2004 studio company participating development large tablet prototype later described crude involving projectors ive stated seeking produce tablet first came agree jobs phone important tablet innovations would work well ipad internal codename k48 revealed court case surrounding leaking ipad information launch apple began taking pre-orders first-generation ipad march 12 2010 major change device announcement available pre-order change behavior side switch perform either sound muting screen rotation locking user selectable wi-fi version ipad went sale united states april 3 2010 wi-fi 3g version released april 30 3g service united states provided initially sold two prepaid contract-free data plan options one unlimited data 250 mb per month half price june 2 2010 announced effective june 7 unlimited plan would replaced new customers 2 gb plan slightly lower cost existing customers would option keep unlimited plan plans activated ipad cancelled time initially ipad available order apple store since become available purchase retailers including amazon walmart network operators ipad launched countries including australia canada france germany japan united kingdom may 28 online pre-orders countries began may 10 apple released ipad hong kong ireland mexico new zealand singapore july 23 2010 israel briefly prohibited importation ipad concerns wi-fi might interfere devices september 17 2010 ipad officially launched china jobs unveiled ipad 2 press conference march 2 2011 33 thinner predecessor 15 lighter ipad 2 better processor dual core apple a5 apple says twice fast predecessor cpu operations nine times fast gpu operations ipad 2 includes front back cameras support facetime videophone application well three-axis gyroscope retained original 10\u2011hour battery life similar pricing scheme successor ipad 2 unveiled march 7 2012 apple ceo tim cook yerba buena center arts new ipad contained new dual core a5x processor quad-core graphics retina display resolution 2,048 1,536 pixels 50 percent pixels standard high definition tv screen brief controversy erupted revealed lte advertised work countries october 23 2012 apple announced fourth generation ipad began shipping november 2 2012 new hardware includes a6x processor hd facetime camera improved lte compatibility all-digital lightning connector available storage increments pricing structure third generation following announcement fourth-generation ipad previous generation discontinued alongside launch fourth generation hardware apple announced ipad mini screen measuring 7.9 inches aimed emerging sector smaller tablets kindle fire nexus 7 hardware new ipad mini similar ipad 2 1,024 768 pixel resolution screen dual core a5 processor 53 lighter 7.2 mm thick released november 2 2012 16 gb 32 gb 64 gb capacities wi-fi wi\u2011fi cellular versions october 22 2013 apple introduced fifth generation ipad called ipad air second generation ipad mini called ipad mini 2 comes retina display ipad air went sale november 1 2013 starting 499 ipad mini 2 released november 12 2013 starting 399 first quarter 2014 apple reported sold 25 million ipads all-time quarterly record compared 22.9 million year-ago quarter october 2014 apple released ipad air 2 ipad mini 3 ipad air 2 first ios device feature triple core cpu 2gb ram well thinner faster predecessor ipad air features touch id available gold color option ipad mini 3 similar ipad mini 2 design hardware also includes touch id available gold color september 2015 ipad pro announced included 12.9-inch screen 9.7-inch version announced march 2016 addition 256 gb option ipad pro models march 21 2017 new ipad announced hardware includes a9 processor designed budget version ipad june 2017 ipad pro second generation hardware announced 12.9 10.5-inch screens march 28 2018 new ipad 9.7-inch 2018 model 6th generation announced new model uses a10 fusion processor fully supports apple pencil replaces 2017 model october 30 2018 third-generation ipad pro announced first generation support 1tb storage march 18 2019 apple announced ipad air 2019 ipad mini 2019 a12 bionic processors ipad first two generations touchscreen display 1,024 768 pixel liquid-crystal display diagonal fingerprint- scratch-resistant glass steve jobs said 7-inch screen would small express software 10 inches minimum tablet screen like iphone ipad designed controlled bare fingers normal non-conductive gloves styli work although special gloves capacitive styli designed use display responds sensors ambient light sensor adjust screen brightness 3-axis accelerometer sense ipad orientation switch portrait landscape modes unlike iphone ipod touch built-in applications work three orientations portrait landscape-left landscape-right ipad built-in applications support screen rotation four orientations including upside-down consequently device intrinsic native orientation relative position home button changes four physical switches ipad including home button near display returns user main menu three plastic physical switches sides wake/sleep volume up/down plus software-controlled switch whose function changed software updates originally switch locked screen current orientation ios 4.2 changed mute switch rotation lock available onscreen menu ios 4.3 update released ipad 2 setting added allow user specify whether side switch used rotation lock mute first generation ipad camera ipad 2 front vga camera rear-facing 720p camera capable still images taken low quality 0.3 megapixels 30fps video rear-facing camera 5\u00d7 digital zoom still images shoot photo video fullscreen aspect ratio unlike iphone 4 shoots widescreen aspect ratio unlike iphone ipad support tap focus allow tap set auto exposure cameras allow facetime video messaging iphone 4 fourth generation ipod touch snow leopard lion mountain lion macs ipad two internal speakers reproducing left right channel audio located bottom-right unit original ipad speakers push sound two small sealed channels leading three audio ports carved device ipad 2 speakers behind single grill volume switch right side unit 3.5-mm trrs connector audio-out jack top-left corner device provides stereo sound headphones without microphones and/or volume controls ipad also contains microphone used voice recording built-in bluetooth 2.1 edr interface allows wireless headphones keyboards used ipad however ios currently support file transfer via bluetooth ipad also features 1,024\u00d7768 vga video output limited applications screen capture connecting external display television accessory adapter ipad uses internal rechargeable lithium-ion polymer lipo battery batteries made taiwan simplo technology 60 dynapack international technology ipad designed charged high current 2 amperes using included 10 w usb power adapter usb cord usb connector one end 30-pin dock connector end charged standard usb port computer limited 500 milliamperes 0.5 amps result ipad running powered normal usb computer port may charge slowly high-power usb ports found newer apple computers accessories provide full charging capabilities apple claims battery generations ipad provide 10 hours video 140 hours audio playback one month standby like rechargeable battery technology ipad battery loses capacity time designed user-replaceable program similar battery-replacement program ipod original iphone apple replace ipad hold electrical charge refurbished ipad fee us 99 plus 6.95 shipping different unit supplied user data preserved refurbished unit new case warranty refurbished unit may vary jurisdictions independent companies also provide battery replacement service returning original unit new battery original case alternatively possible technically competent user buy install new battery task require soldering technically challenging ipad released three capacity options storage 16 32 64 gb internal flash memory january 29 2013 apple announced 128 gb model fourth generation ipad released february 5 data stored internal flash memory option expand storage apple sells camera connection kit sd card reader used transfer photos videos march 21 2016 apple announced 256 gb model ipad pro released march 31 2017 apple released 10.5-inch ipad pro revised 12.9-inch ipad pro 512 gb option first kind ios device 2018 apple released 11-inch 12.9-inch ipad pro 1tb option apple ios combination specific hardware uses crypto-shredding activating erase content settings obliterating keys 'effaceable storage renders user data device cryptographically inaccessible ipad models come two basic variants wi-fi wi-fi cellular support cellular variants however support circuit-switched voice calls texts data connectivity side wi-fi 3g ipad micro-sim slot mini-sim 3g ipad used compatible gsm carrier unlike iphone usually sold 'locked specific carriers first generations ipad u.s. data network access via t-mobile network limited slower edge cellular speeds t-mobile 3g network time used different frequencies second generation ipad introduced third tier models cdma support verizon wireless united states available separately capable version ipad 4th generation uses micro-sim first generation ipad mini uses nano-sim introduced iphone 5 ipad mini available two different frequency bands worldwide devices support quad-band gsm quad-band umts frequencies one variant also supports lte bands 4 17 principally intended use u.s. network adds support lte bands 1 3 5 13 25 cdma ev-do rev rev b 5th generation ipad 2nd generation ipad mini introduced support many additional lte bands worldwide ipad air mini retina display cellular models come two variants support nano-sims quad-band gsm penta-band umts dual-band cdma ev-do rev b. additionally one variant ipad also supports lte bands 1 2 3 4 5 7 8 13 17 18 19 20 25 26 variant supports lte bands 1 2 3 5 7 8 18 19 20 td-lte bands 38 39 40 apple ability handle many different bands one device allowed offer first time single ipad variant supports cellular bands technologies deployed major north american wireless providers time device introduction moreover t-mobile usa selling ipad air mini retina display models became first ipads made available purchase directly four nationwide u.s. wireless carriers previously indicated u.s. carriers selling hardware variant device apple offers several ipad accessories adapters proprietary 30-pin dock connector ipad port besides headphone jack dock holds ipad upright angle dock connector audio line port generation ipad requires corresponding dock dock included physical keyboard supported original ipad generations compatible bluetooth keyboards also work macs pcs ipad charged standalone power adapter wall charger also used ipods iphones 10 w charger included ipad apple sells camera connection kit consists two separate adapters dock connector one usb type sd card reader adapter used transfer photos videos plug usb audio card midi keyboard third party sells adapter includes usb sd microsd single unit adapter vga connectors allows ipad work external monitors projectors another adapter mirrors screen onto hdmi compatible devices 1080p works apps rotations unlike adapters allows ipad charge another dock connector hdmi adapter released advertised second generation ipad also works first-generation ipad iphone 4 fourth generation ipod touch smart covers screen protectors magnetically attach align face ipad 2 3 4 cover three folds allow convert stand also held together magnets original ipad owners could purchase black case included similarly folding cover smart cover meant minimal easily detachable protects screen smart covers microfiber bottom cleans front ipad wakes cover removed five different colors polyurethane leather leather expensive smart covers compatible original ipad june 2012 apple started selling smart case case combined function smart cover back protection case compatible ipad 2 ipad 3rd 4th generation devices like iphone shares development environment ipad runs software software downloaded apple app store software written developers paid developer license registered devices ipad runs almost third-party iphone applications displaying iphone size enlarging fill ipad screen developers may also create modify apps take advantage ipad features onemillion apps optimized ipad application developers use ios sdk developing applications ipad ipad originally shipped customized ipad-only version iphone os dubbed v3.2 september 1 announced ipad would get ios 4.2 november 2010 fulfill apple released ios 4.2.1 public november 22 interface centred around home screen graphical list available applications home screen accessed time hardware button screen closing open application process users also add delete icons dock every home screen home screen holds twenty icons dock holds six icons users delete web clips third-party applications time may select certain applications transfer itunes apple default programs however may removed almost input given touch screen understands complex gestures using multi-touch ipad interaction techniques enable user move content touch-drag motion finger example zooming web pages photos done placing two fingers screen spreading farther apart bringing closer together gesture known pinching scrolling long list menu achieved sliding finger display bottom top vice versa go back either case list moves pasted outer surface wheel slowly decelerating affected friction way interface simulates physics real object user-centered interactive effects include horizontally sliding sub-selection vertically sliding keyboard bookmarks menu widgets turn around allow settings configured side menu bars found top bottom screen necessary options vary program always follow consistent style motif menu hierarchies back button top-left corner screen displays name parent folder layout music library similar ipod current symbian s60 phones ipad sort media library songs artists albums videos playlists genres composers podcasts audiobooks compilations options always presented alphabetically except playlists retain order itunes iphone uses large font allows users plenty room touch selection users rotate device horizontally landscape mode access cover flow likewise feature may disabled purposely wishing view screen another angle like itunes feature shows different album covers scroll-through photo library scrolling achieved swiping finger across screen alternatively headset controls used pause play skip repeat tracks ipad supports gapless playback like fifth-generation ipods introduced 2005 ipad play digital video allowing users watch tv shows movies widescreen double-tapping switches widescreen video playback ipad allows users purchase download songs itunes store directly ipad includes software allows user upload view email photos taken camera user zooms photos sliding two fingers apart closer together much like safari camera application also lets users view camera roll pictures taken ipad camera pictures also available photos application along transferred iphoto aperture mac photoshop windows pc ipad use wi-fi network trilateration skyhook wireless provide location information applications google maps 3g model supports a-gps allow position calculated gps relative nearby cellphone towers also black strip back aid 3g reception ipad headphone jack proprietary apple dock connector ethernet usb port however apple camera connection kit accessory provides two dock connector adapters importing photos videos via usb sd memory cards ipad comes several applications including safari mail photos video ipod itunes app store ibooks maps notes calendar contacts several improved versions applications developed iphone mac apps currently missing weather calculator health apps ipad syncs itunes mac windows pc apple ported iwork suite mac ipad sells pared versions pages numbers keynote apps app store although ipad designed replace mobile phone user use wired headset built-in speaker microphone place telephone calls wi-fi 3g using voip application ipad specific apps app store december 2010 reuters reported iphone ipad users lodged lawsuit apple alleging applications passing information third party advertisers without consent ipad optional ibooks application downloaded app store displays books epub-format content downloaded ibookstore ipad launch april 3 2010 ibookstore available united states several major book publishers including penguin books harpercollins simon schuster macmillan committed publishing books ipad despite direct competitor amazon kindle barnes noble nook amazon.com barnes noble made kindle nook apps available ipad february 2010 cond\u00e9 nast said would sell ipad subscriptions several magazines june april 2010 new york times announced would begin publishing daily ipad top news section available free charge remainder payment subscription major news organizations including wall street journal bbc reuters released ipad applications newscorp created ipad-only publication daily february 2011 ceased operations december 2012 ipad assembled foxconn also manufactures apple ipod iphone mac mini largest plant shenzhen china pegatron shanghai china april 2011 foxconn announced would moving production ipad apple products brazil could begin production end 2011. isuppli estimated first-generation ipad 16 gb wi-fi version costs us 259.60 manufacture total excludes research development licensing royalty patent costs apple disclose makers ipad components teardown reports analysis industry insiders indicate various parts suppliers include ipad employ digital rights management drm os prevents users copying transferring certain content outside apple platform without authorization tv shows movies apps also ipad development model requires anyone creating app ipad sign non-disclosure agreement pay developer subscription critics argue apple centralized app approval process control platform could stifle software innovation particular concern digital rights advocates apple ability remotely disable delete apps ipad time digital rights advocates including free software foundation electronic frontier foundation computer engineer activist brewster kahle criticized ipad digital rights restrictions april 2010 paul sweeting analyst gigaom quoted national public radio saying ipad anti-internet hands ... offers major media companies opportunity essentially re-create old business model wherein pushing content terms rather going finding content search engine discovering content sweeting also thought limitations imposed apple impart feeling safe neighborhood saying apple offering gated community guard gate probably maid service laura sydell article author concludes consumers fears security internet viruses malware may happy opt apple gated community russian government switched ipads android devices security concerns like certain ios devices ipad jailbroken depending version ios running thus allowing applications programs authorized apple run device jailbroken users able download many applications previously unavailable app store via unofficial installers cydia well illegally pirated applications apple claims jailbreaking void factory warranty device united states even though jailbreaking legal ipad released april 2010 first jailbroken may 2010 spirit jailbreak ios version 3.1.2 ipad jailbroken ios versions 4.3 4.3.3 web-based tool jailbreakme 3.0 released july 2011 ios versions including 5.0 5.0.1 using redsn0w absinthe 2.0 released may 25 2012 first jailbreak method ios 5.1.1 devices except 32 nm version ipad 2 apple app store provides iphone ipad applications imposes censorship content become issue book publishers magazines seeking use platform guardian newspaper described role apple analogous british magazine distributor wh smith many years imposed content restrictions due exclusion pornography app store youporn others changed video format flash h.264 html5 specifically ipad e-mail exchange ryan tate valleywag steve jobs claimed ipad offers freedom porn leading many upset replies including adbustings berlin artist johannes p. osterhoff san francisco wwdc10 may 28 2010 ipad released australia canada japan well several larger european countries media reaction launch mixed media noted positive response fans device thousands people queued first day sale number countries media reaction ipad announcement mixed walter mossberg wrote software stupid meaning hardware features build less important ipad success software user interface first impressions largely positive mossberg also called price modest device capabilities praised ten-hour battery life others including pc advisor sydney morning herald wrote ipad would also compete proliferating netbooks use microsoft windows base model 499 price lower pre-release estimates tech press wall street analysts apple competitors expecting much higher entry price point cnet also criticized ipad apparent lack wireless sync portable devices microsoft zune number years built-in itunes app able download internet well reviews ipad generally favorable walt mossberg wall street journal called pretty close laptop killer david pogue new york times wrote dual review one part technology-minded people part non-technology-minded people former section notes laptop offers features cheaper price ipad review latter audience however claims readers like concept device understand intended uses enjoy using device pc magazine tim gideon wrote winner undoubtedly driving force shaping emerging tablet landscape michael arrington techcrunch said ipad beats even optimistic expectations new category device also replace laptops many people pc world criticized ipad file sharing printing abilities ars technica said sharing files computer one least favorite parts ipad experience media also praised quantity applications well bookstore media applications contrast criticized ipad closed system mentioned ipad faces competition android-based tablets outsold ipads 2013 surpassing ipads second quarter 2013 overtaken ipad installed base lost majority web browsing android statcounter estimates south america africa asia many large countries eastern europe independent criticized ipad readable bright light paper praised able store large quantities books uk release daily telegraph said ipad lack adobe flash support annoying ipad selected time magazine one 50 best inventions year 2010 popular science chose top gadget behind overall best new 2010 winner groasis waterboxx ipad tablets still wide margin globally second used android tablets market share however differs widely regions ipad lost market share globally every year since 2012 statcounter started tracking tablets separately according statcounter statistics tracks web use gives operating system/platform share based ipad lost majority use south america android also lose majority gaining back asia africa lost wide margin android 70 ipad mostly used consumers also taken business users within 90 days release ipad managed penetrate 50 fortune 100 companies companies adopting ipads business offices distributing making available ipads employees examples uses workplace include attorneys responding clients medical professionals accessing health records patient exams managers approving employee requests survey frost sullivan shows ipad usage office workplaces linked goals increased employee productivity reduced paperwork increased revenue research firm estimates mobile-office application market north america may reach 6.85 billion 2015 estimated 1.76 billion 2010 since march 2011 us federal aviation administration faa approved ipad in-cockpit use cut paper consumption several airlines 2011 alaska airlines became first airline replace pilots paper manuals ipads weighing compared printed flight manuals hopes fewer back muscle injuries dozen airlines followed suit including united distributed ipads cockpits also many airlines offer inflight magazine downloadable application ipad ipad several uses classroom praised valuable tool homeschooling soon ipad released reported 81 top book apps children ipad also called revolutionary tool help children autism learn communicate socialize easily healthcare field ipads iphones used help hospitals manage supply chain example novation healthcare contracting services company developed vha pricelynx based mobile application platform business intelligence software vendor microstrategy business intelligence app help health care organizations manage purchasing procedures efficiently save money hospitals guillermo ramas novation states doctors wo n't walk around hospital laptop ipad perfect walk around hospital long information need 2013 gianna chien aged 14 presented 8,000 doctors heart rhythm society meeting apple ipad 2 cases interfere life-saving heart devices pacemakers magnets inside ipad user guide advised pacemaker users keep ipads least away pacemaker study 2014 found ipad 2 could cause electromagnetic interference emi implantable cardioverter defibrillators united states fans attending super bowl xlv first super bowl since ipad released could use official national football league nfl app navigate cowboys stadium 2011 tampa bay buccaneers became first nfl club discontinue use paper copies playbooks instead distributed players playbook videos electronic format via ipad 2 ipad able support many music creation applications addition itunes music playback software include sound samplers guitar voice effects processors sequencers synthesized sounds sampled loops virtual synthesizers drum machines theremin-style touch responsive instruments drum pads many gorillaz 2010 album fall created almost exclusively using ipad damon albarn tour band music video luna sea 2012 single rouge filmed entirely ipad ipad greatly increased social television use viewers use ipad convenient second networked computer second screen communicating viewers television provider viewers use web browser specialized applications discuss program viewers broadcast content providers may use second screen interact viewers real time example latter facility allows content providers conduct real-time polls collect comments program displayed text main television screen viewer interaction via second screen becoming increasingly popular", + "neighbors": [ + 24, + 33, + 62, + 71, + 75, + 99, + 121, + 130, + 134, + 211, + 214, + 228, + 252, + 269, + 270, + 322, + 337, + 345, + 355, + 356, + 359, + 394, + 395, + 396, + 403, + 475, + 477, + 489, + 511, + 551, + 577, + 583, + 596, + 607, + 610, + 625, + 634, + 686, + 696, + 797, + 810, + 858, + 877, + 917, + 945, + 956, + 961, + 972, + 1001, + 1018, + 1100, + 1138, + 1140, + 1178, + 1189, + 1215, + 1232, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1503, + 1507, + 1521, + 1544, + 1563, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 928, + "label": 4, + "text": "Ari_Schwartz:ari schwartz ari m. schwartz former senior director cybersecurity united states national security council staff white house left role october 2015 previously director cybersecurity privacy civil liberties policy schwartz came white house serving senior advisor technology policy united states secretary commerce previously national institute standards technology served internet policy advisor working internet policy task force department commerce government service schwartz vice president chief operating officer center democracy technology cdt washington d.c. united states formerly cdt senior policy analyst subsequently center vice president coo cdt schwartz rsa conference award excellence public policy online trust alliance award excellence public policy october 2015 revealed schwartz stepped role senior director cybersecurity two-year tenure remarked always planned leave role period schwartz praised departure helping develop government cybersecurity framework voluntary guideline help companies bolster security programs honest broker industry civil society schwartz detroit michigan area holds bachelor degree sociology brandeis university", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 929, + "label": 9, + "text": "MSWLogo:mswlogo mswlogo programming language interpreted based language logo graphical user interface gui front end developed george mills massachusetts institute technology mit core ucblogo brian harvey free open-source software source code available borland c++ mswlogo supports multiple turtle graphics 3d computer graphics allows input ports com lpt also supports windows interface input/output i/o available gui keyboard mouse events trigger interrupts simple gif animations may also produced mswlogo version 6.5 command codice_1 program also used educational software jim muller wrote great logo adventure complete logo manual using mswlogo demonstration language mswlogo evolved fmslogo educational programming environment free open source implementation language logo microsoft windows released gnu general public license gpl mainly developed maintained david costanzo mswlogo version 6.5b supports many functions including", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 756, + 787, + 795, + 828, + 831, + 919, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 930, + "label": 4, + "text": "Remote_backup_service:remote backup service remote online managed backup service sometimes marketed cloud backup backup-as-a-service service provides users system backup storage recovery computer files online backup providers companies provide type service end users clients backup services considered form cloud computing online backup systems typically built client software program runs given schedule systems run day usually night computers n't use newer cloud backup services run continuously capture changes user systems nearly real-time online backup system typically collects compresses encrypts transfers data remote backup service provider servers off-site hardware many products market \u2013 offering different feature sets service levels types encryption providers type service frequently target specific market segments high-end lan-based backup systems may offer services active directory client remote control open file backups consumer online backup companies frequently beta software offerings and/or free-trial backup services fewer live support options mid-1980s computer industry great state change modems speeds 1200 2400 baud making transfers large amounts data slow 1 mb 72 minutes faster modems secure network protocols development tape backup systems gained popularity period need affordable reliable online backup system becoming clear especially businesses critical data online/remote backup services came existence heyday dot-com boom late 1990s initial years large industry service providers capturing market share understanding importance role online backup providers playing web services arena today service providers online backup services position services using saas software service paas platform service strategy relevance predicted increase exponentially years come personal enterprise data storage needs rise last years also witnessed healthy rise number independent online backup providers enterprise-class cloud backup solution must include on-premises cache mitigate issues due inconsistent internet connectivity hybrid cloud backup works storing data local disk backup captured high speed either backup software d2d2c disk disk cloud appliance encrypts transmits data service provider adds protection local disasters recent backups retained locally speed data recovery operations number cloud storage appliances market used backup target including appliances ctera networks storsimple twinstrata hybrid cloud backup also beneficial enterprise users security concerns storing data locally sending cloud backup users perform necessary encryption operations incl technologies like data encryption additionally applied choose public cloud service provider important compression backup data local backup cache used compress data sending cloud order lower network bandwidth load improve backup speed becomes critical enterprises backup huge databases like oracle ms sql huge files like virtual machine images mail server databases edb files exchange recent improvements cpu availability allow increased use software agents instead hardware appliances enterprise cloud backup software-only approach offer advantages including decreased complexity simple scalability significant cost savings improved data recovery times online backup services usually priced function following things vendors limit number versions file kept system services omit restriction provide unlimited number versions add-on features plug-ins like ability back currently open locked files usually charged extra services provide built remote backup services reduce amount data sent wire backing changed files approach backing means customers total stored data reduced reducing amount data sent also stored drastically reduced transmitting changed data bits binary block level incremental backups solutions transmit changed binary data bits waste bandwidth transmitting file data small amounts change remote backup advantages traditional backup methods remote backup disadvantages traditional backup methods services provide expert backup management services part overall offering services typically include three distinct types backup modes scheduled manual event-based", + "neighbors": [ + 148, + 365, + 494, + 528, + 556, + 611, + 772, + 889, + 921, + 1447 + ], + "mask": "Test" + }, + { + "node_id": 931, + "label": 1, + "text": "Australian_Plant_Census:australian plant census australian plant census apc provides online interface currently accepted published scientific names vascular flora australia one output interfaces national government integrated biodiversity information system ibis \u2013 oracle co. relational database management system australian national herbarium australian national botanic gardens australian biological resources study council heads australasian herbaria coordinate system australian plant census interface provides currently accepted scientific names synonyms illegitimate misapplied excluded names well state distribution data item output hyperlinks online interfaces information system including australian plant name index apni australian plant image index apii outputs australian plant census interface provide information native naturalised vascular plant taxa australia including offshore islands excludes taxa known australia cultivation yet naturalised classification plant families based angiosperm phylogeny group iii system 2009", + "neighbors": [ + 96, + 1478 + ], + "mask": "Test" + }, + { + "node_id": 932, + "label": 6, + "text": "Mkdosfs:mkdosfs mkdosfs one applications included dosfstools package used create dos file system linux data storage device usually disk partition mkdosfs options device may specify number blocks device allow mkdosfs guess mkdosfs support creating boot-able partitions", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 933, + "label": 1, + "text": "Plants_of_the_World_Online:plants world online plants world online online database published royal botanic gardens kew launched march 2017 ultimate aim enable users access information world known seed-bearing plants 2020 initial focus tropical african floras particularly flora zambesiaca flora west tropical africa flora tropical east africa", + "neighbors": [ + 96, + 124, + 179, + 1478 + ], + "mask": "Test" + }, + { + "node_id": 934, + "label": 9, + "text": "Logo_(programming_language):logo programming language logo educational programming language designed 1967 wally feurzeig seymour papert cynthia solomon logo acronym name coined feurzeig bolt beranek newman derives greek logos meaning word thought general-purpose language logo widely known use turtle graphics commands movement drawing produced line vector graphics either screen small robot termed turtle language conceived teach concepts programming related lisp later enable papert called body-syntonic reasoning students could understand predict reason turtle motion imagining would turtle substantial differences among many dialects logo situation confused regular appearance turtle graphics programs named logo logo multi-paradigm adaptation dialect lisp functional programming language standard logo ucblogo best facilities handling lists files i/o recursion scripts used teach computer science concepts uc berkeley lecturer brian harvey computer science logo style trilogy logo usually interpreted language although developed compiled logo dialects lhogho liogo logo case-sensitive retains case used formatting logo created 1967 bolt beranek newman bbn cambridge massachusetts research firm wally feurzeig cynthia solomon seymour papert intellectual roots artificial intelligence mathematical logic developmental psychology first four years logo research development teaching work done bbn first implementation logo called ghost written lisp pdp-1 goal create mathematical land children could play words sentences modeled lisp design goals logo included accessible power informative error messages use virtual turtles allowed immediate visual feedback debugging graphic programming first working logo turtle robot created 1969 display turtle preceded physical floor turtle modern logo changed much basic concepts first turtle first turtle tethered floor roamer radio-controlled wireless bbn paul wexelblat developed turtle named irving touch sensors could move forwards backwards rotate ding bell earliest year-long school users logo 1968-69 muzzey jr high lexington virtual physical turtles first used fifth-graders bridge school lexington 1970-71 logo most-known feature turtle derived originally robot name on-screen cursor showed output commands movement small retractable pen together producing line graphics traditionally displayed either triangle turtle icon though represented icon turtle graphics added logo language seymour papert late 1960s support papert version turtle robot simple robot controlled user workstation designed carry drawing functions assigned using small retractable pen set attached robot body practical matter use turtle geometry instead traditional model mimics actual movement logic turtle robot turtle moves commands relative position left 90 means spin left 90 degrees logo implementations particularly allow use concurrency multiple turtles support collision detection allow user redefine appearance turtle cursor essentially allowing logo turtles function sprites multiple turtles supported mswlogo well 3d graphics input com ports lpt ports also allowed mswlogo windows gui interrupts triggered via keyboard mouse events simple gif animations may also produced mswlogo version 6.5 gifsave command turtle geometry also sometimes used environments logo alternative strictly coordinate-addressed graphics system instance idea turtle graphics also useful lindenmayer system generating fractals modern derivatives logo allow thousands independently moving turtles two popular implementations massachusetts institute technology starlogo northwestern university center connected learning ccl netlogo allow exploring emergent phenomena come many experiments social studies biology physics areas netlogo widely used agent-based simulation biological social sciences although one agreed-upon standard broad consensus core aspects language march 2009 197 implementations dialects logo strengths 197 longer wide use many still active development commercial logos still widely used schools include microworlds logo imagine logo logo primary influence smalltalk programming language also main influence etoys educational programming environment language essentially logo written squeak variant smalltalk logo influenced procedure/method model agentsheets agentcubes program agents similar notion turtle logo logo provided underlying language boxer boxer developed university california berkeley mit based literacy model making easier use nontechnical people kturtle variation logo implemented qt kde environment loosely based logo another result logo influence kojo variant scala scratch educational programming language runs squeak variant smalltalk inspired logo 2015 cubetto education robotics system children 3 years older developed crowd-source funding cubetto influenced logo montessori cubetto features small cubic turtle turns 90 degrees cubetto described update button-box mit logo system tortis", + "neighbors": [ + 27, + 29, + 46, + 56, + 87, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 396, + 446, + 447, + 454, + 488, + 501, + 506, + 521, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 756, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1225, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 935, + "label": 2, + "text": "AppArmor:apparmor apparmor application armor linux kernel security module allows system administrator restrict programs capabilities per-program profiles profiles allow capabilities like network access raw socket access permission read write execute files matching paths apparmor supplements traditional unix discretionary access control dac model providing mandatory access control mac included mainline linux kernel since version 2.6.36 development supported canonical since 2009 addition manually creating profiles apparmor includes learning mode profile violations logged prevented log used generating apparmor profile based program typical behavior apparmor implemented using linux security modules lsm kernel interface apparmor offered part alternative selinux critics consider difficult administrators set maintain unlike selinux based applying labels files apparmor works file paths proponents apparmor claim less complex easier average user learn selinux also claim apparmor requires fewer modifications work existing systems example selinux requires filesystem supports security labels thus provide access control files mounted via nfs apparmor filesystem-agnostic apparmor represents one several possible approaches problem restricting actions installed software may take selinux system generally takes approach similar apparmor one important difference selinux identifies file system objects inode number instead path apparmor inaccessible file become accessible hard link created selinux inode-based model would still deny access newly created hard links hard link would pointing inaccessible inode selinux apparmor also differ significantly administered integrate system isolation processes also accomplished mechanisms like virtualization one laptop per child olpc project example sandboxes individual applications lightweight vserver 2007 simplified mandatory access control kernel introduced 2009 new solution called tomoyo included linux 2.6.30 like apparmor also uses path-based access control apparmor first used immunix linux 1998\u20132003 time apparmor known subdomain reference ability security profile specific program segmented different domains program switch dynamically apparmor first made available sles opensuse first enabled default sles 10 opensuse 10.1 may 2005 novell acquired immunix rebranded subdomain apparmor began code cleaning rewriting inclusion linux kernel 2005 september 2007 apparmor maintained novell novell suse legal owner trademarked name apparmor apparmor first successfully ported/packaged ubuntu april 2007 apparmor became default package starting ubuntu 7.10 came part release ubuntu 8.04 protecting cups default ubuntu 9.04 items mysql installed profiles apparmor hardening continued improve ubuntu 9.10 ships profiles guest session libvirt virtual machines evince document viewer optional firefox profile apparmor integrated october 2010 2.6.36 kernel release apparmor integrated synology dsm 5.1 beta 2014 apparmor enabled solus release 3 2017/8/15 apparmor enabled default debian 10 buster", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 278, + 294, + 305, + 306, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 986, + 1060, + 1102, + 1105, + 1126, + 1138, + 1167, + 1187, + 1197, + 1202, + 1208, + 1227, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1403, + 1415, + 1456, + 1468, + 1524, + 1526, + 1538, + 1558, + 1578, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 936, + "label": 7, + "text": "Chromebox:chromebox chromebox small form-factor pc running google chrome os operating system device debuted may 2012 chromeboxes like chrome os devices including chromebook laptops primarily support web applications thereby relying heavily internet connection software functionality data storage connection via local area network wireless ethernet port machines classed small form-factor pcs typically feature power switch set connections support keyboard pointing device one monitors solid state drives used storage wireless printers supported first chromebox released samsung may 29 2012 ran dual-core intel celeron processor 867 1.3 ghz featured six usb 2.0 ports two displayport++ slots compatible hdmi dvi vga february 2014 google bundled intel core i7 chromebox business video conferencing package 1080p high definition camera module external microphone/speaker remote control chromebox meetings system retailed 999 plus 250 annual management fee waived first year\u2014a cost thousands dollars less unified videoconferencing systems including cisco polycom system employed google hangouts-like interface 15 participants dedicated url sharing screens management accounts scheduling meetings updated system announced november 2017 featured 4k camera machine learning feature automatically identifies frames participants march 2014 asus established new price low-end chromebox market compact 1.32 pound model retailed 179 featured celeron cpu four usb 3.0 ports yahoo tech columnist david pogue called asus device among smallest least-expensive desktop computers ever sold likening smart car \u2019 hauling lumber home depot \u2019 terrific deal\u2014and days \u2019 get want go may asus released faster model intel core i3 processor hewlett-packard entered market june chromebox powered intel celeron processor optionally bundling keyboard mouse august acer introduced two models could stand vertically provided business-oriented features including encryption fast deletion local data september dell entered market entry-level machine well dell implementation google video conferencing system august 2015 aopen announced family chromeboxes designed principally driving content digital commercial signage models ruggedized on-site operation capability run android apps chrome os devices introduced google 2016 realized certain chromebooks 2017 seemed bypass chromeboxes cluster new chromebox offerings appeared 2018 including acer asus hp oregon-based ctl compute teach learn maker chromebooks since 2014 launched first chromebox march 2018", + "neighbors": [ + 24, + 41, + 77, + 131, + 176, + 182, + 211, + 216, + 422, + 480, + 502, + 547, + 553, + 556, + 559, + 611, + 671, + 704, + 755, + 775, + 777, + 837, + 962, + 1019, + 1036, + 1061, + 1082, + 1129, + 1185, + 1246, + 1259, + 1265, + 1310, + 1371, + 1377, + 1411, + 1419, + 1431, + 1480, + 1500, + 1578, + 1596 + ], + "mask": "Validation" + }, + { + "node_id": 937, + "label": 3, + "text": "Instruction_cycle:instruction cycle instruction cycle also known fetch\u2013decode\u2013execute cycle simply fetch-execute cycle cycle central processing unit cpu follows boot-up computer shut order process instructions composed three main stages fetch stage decode stage execute stage simpler cpus instruction cycle executed sequentially instruction processed next one started modern cpus instruction cycles instead executed concurrently often parallel instruction pipeline next instruction starts processed previous instruction finished possible cycle broken separate steps program counter pc special register holds memory address next instruction executed fetch stage address stored pc copied memory address register mar pc incremented order point memory address next instruction executed cpu takes instruction memory address described mar copies memory data register mdr mdr also acts two-way register holds data fetched memory data waiting stored memory also known memory buffer register mbr eventually instruction mdr copied current instruction register cir acts temporary holding ground instruction fetched memory decode stage control unit cu decode instruction cir cu sends signals components within cpu arithmetic logic unit alu floating point unit fpu alu performs arithmetic operations addition subtraction also multiplication via repeated addition division via repeated subtraction also performs logic operations binary shifts well fpu reserved performing floating-point operations computer cpu different cycles based different instruction sets similar following cycle cycle begins soon power applied system initial pc value predefined system architecture instance intel ia-32 cpus predefined pc value codice_1 typically address points set instructions read-only memory rom begins process loading booting operating system fetch step instruction control unit fetches instruction address memory unit decoding process allows cpu determine instruction performed cpu tell many operands needs fetch order perform instruction opcode fetched memory decoded next steps moved appropriate registers decoding done cpu control unit step evaluates type operation performed memory operation computer checks whether direct indirect memory operation i/o register instruction computer checks type executes instruction function instruction performed instruction involves arithmetic logic alu utilized stage instruction cycle useful perspective end user everything else overhead required make execute step happen", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 354, + 388, + 413, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 847, + 907, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 938, + "label": 4, + "text": "Norton_AntiVirus:norton antivirus norton antivirus anti-virus anti-malware software product developed distributed symantec corporation since 1991 part norton family computer security products uses signatures heuristics identify viruses features included e-mail spam filtering phishing protection symantec distributes product download box copy oem software norton antivirus norton internet security related product held 61 us retail market share security suites first half 2007 competitors terms market share study include antivirus products ca trend micro kaspersky lab norton antivirus runs microsoft windows linux macos windows 7 support development versions 2006 2008 version 2009 windows 7 supported update already versions 2010 2011 2012 natively support windows 7 without needing update version 12 version fully compatible mac os x lion 2015 series products symantec made changes portfolio briefly discontinued norton antivirus action later reversed introduction norton antivirus basic may 1989 symantec launched symantec antivirus macintosh sam sam 2.0 released march 1990 incorporated technology allowing users easily update sam intercept eliminate new viruses including many n't exist time program release august 1990 symantec acquired peter norton computing peter norton norton company developed various dos utilities including norton utilities include antivirus features symantec continued development acquired technologies technologies marketed name norton tagline symantec norton crossed-arm pose registered u.s. trademark traditionally featured norton product packaging however pose later moved spine packaging eventually dropped altogether early 1991 u.s. computers invaded hundreds foreign virus strains corporate pc infection becoming serious problem symantec norton group launched norton antivirus 1.0 nav pc compatible computers ads product suggested retail 129 featured norton crossed-arm pose wearing pink shirt surgical mask covering nose mouth 1998 version 5.0 update sam renamed norton antivirus nav macintosh product activation introduced norton antivirus 2004 addressing estimated 3.6 million counterfeit norton products sold alphanumeric code generated identify computer configuration ties product key users allowed activate product five times product key spyware adware detection removal introduced 2005 version tagline antispyware edition tagline dropped later releases however norton antivirus 2009 classic include spyware adware detection classic edition marketed alongside norton antivirus 2009 include spyware adware detection existing users 2006 2007 2008 2009 versions upgrade latest 2010 version without buying new subscription upgrading preserve number days left user subscription redesigned main graphical user interface aggregates information central user interface cnet reports norton protection center useful attempts advertise additional products facilitate detection zero-day malware bloodhound disassembles variety programming languages scans code malicious instructions using predefined algorithms internet explorer homepage hijacking protection introduced release well however notably missing search engine hijacking protection cnet highlighted norton antivirus 2006 noticeable impact system performance operating system requirements call windows 2000 service pack 3 windows xp 150 mb free space 300 mhz processor required either operating system 128 mb ram required windows 2000 256 mb required windows xp norton antivirus released september 12 2006 symantec revised norton antivirus goal reducing high system resource utilization windows vista compatibility introduced release well despite 80 code rewritten cnet reports mixed results performance testing windows 2000 compatibility dropped release compatibility 32-bit versions windows vista added release patch symantec hardware requirements vista call 150 mb free space 800 mhz processor 512 mb ram requirements windows xp similarly call 150 mb free space 300 mhz processor 256 mb ram norton antivirus 2008 released august 28 2007 emphasizing malware prevention new features include sonar looks suspicious application behavior release adds real-time exploit protection preventing attackers leveraging common browser application vulnerabilities installed 32-bit versions windows xp service pack 2 300 mb free space 300 mhz processor 256 mb ram required installed 32-bit 64-bit versions windows vista 300 mb free space 800 mhz processor 256 mb ram needed norton antivirus 2009 released september 8 2008 addressing performance issues 300 changes made zero-impact goal.benchmarking conducted passmark software pty ltd highlights 47-second install time 32 second scan time 5 mb memory utilization symantec funded benchmark test provided scripts used benchmark participating antivirus software security status settings displayed single main interface cpu usage monitor displays total cpu utilization norton cpu usage main interface features include norton insight whitelisting technology cuts scanning times mapping known safe files using information online database address malware response times updates delivered every 5 15 minutes however updates tested symantec may cause false positives incorrectly identify files malicious exploit scanner found 2007 2008 versions dropped release installed 32-bit versions windows xp service pack 2 150 mb free space 300 mhz processor 256 mb ram required installed 32-bit 64-bit versions windows vista 150 mb free space 800 mhz processor 512 mb ram required two variations norton antivirus 2009 also marketed symantec gaming edition provides finer control norton downloads updates allows components suite disabled either manually automatically computer enters full-screen mode classic edition find remove adware spyware version 17.0 released september 9 2009 several features updated release including sonar dubbed sonar 2 uses information determine application truly malicious norton insight present users information origins activities performance applications along reputation data new feature codenamed autospy helps users understand norton malware found previous releases removed threats sight quietly warned users potentially confusing users deceived downloading rogue security software much information placed back main window toggle button switches sides symantec also added windows 7 support aside symantec also added norton download insight prevent drive drive downloads symantec briefly discontinued standalone norton antivirus product 2015 instead replacing norton security fbi confirmed active development magic lantern keylogger intended obtain passwords encrypted e-mail documents criminal investigations magic lantern first reported media bob sullivan msnbc 20 november 2001 ted bridis associated press fbi intends deploy magic lantern form e-mail attachment attachment opened installs trojan horse suspect computer activated suspect uses pgp encryption often used increase security sent email messages activated trojan log pgp password allows fbi decrypt user communications symantec major antivirus vendors whitelisted magic lantern trojan rendering antivirus products including norton antivirus incapable detecting concerns around whitelisting include uncertainties magic lantern full surveillance potential whether hackers could subvert redeploy purposes outside law enforcement graham cluley technology consultant sophos said way knowing written fbi even \u2019 know whether used fbi commandeered third party another reaction came marc maiffret chief technology officer co-founder eeye digital security states customers paying us service protect forms malicious code us law enforcement job make exceptions law enforcement malware tools proponents magic lantern argue technology would allow law enforcement efficiently quickly decrypt time-sensitive messages protected encryption schemes implementing magic lantern require physical access suspect computer unlike carnivore predecessor magic lantern since physical access computer would require court order fbi spokesman paul bresson response question whether magic lantern also needed court order deploy would say like technology projects tools deployed fbi would used pursuant appropriate legal process january 28 2010 symantec anti-virus update marked spotify trojan horse disabling software across millions pcs retail customers report slow indifferent service bugs examples include faulty error message stating current subscriptions expired users received error stating virus protection updated error occurred update software refused allow daily updates though bug reported 2004 corrected 2005 2006 versions another incident occurred may 2007 norton antivirus flagged components pegasus email client malicious rendering program corrupted symantec customer service addressed problem running checklist troubleshooting steps always successful july 25 2006 symantec released faulty update norton antivirus 2006 users users reported onscreen message stating norton antivirus 2006 support repair feature please uninstall reinstall. symantec claimed faulty update downloaded customers 1:00 pm 7:00 pm july 25 2006 symantec developed workaround tool listed troubleshooting steps available company released statement stating expected deliver repair patch affected users monday july 31 2006 norton antivirus criticized refusing uninstall completely leaving unnecessary files behind another issue versions prior 2009 installed liveupdate updates norton-branded software separately user must uninstall norton antivirus liveupdate component manually liveupdate component purposely left behind update norton-branded products present response symantec developed norton removal tool symnrt remove leftover registry keys values along files folders however neither route uninstallation remove subscription data preserved prevent users installing multiple trial copies symnrt remove norton programs symnrt started removal process stopped recommended close running programs prior running symnrt act winfax users recommended back databases running symnrt norton antivirus 2007 install alongside zonealarm incompatibility caused annoyance norton customers purchased norton antivirus 2007 prior warning notice incompatibility symantec recommends removing zonealarm reinstalling internet worm protection feature disabled controls applications access internet protocols use march 9 2009 users norton antivirus 2006 2007 experienced firewall warning stating norton-associated file pifts.exe trying connect internet although file revealed harmless diagnostic patch program gained attention media symantec removed posts forum concerning pifts information available purpose program speculation program malware backdoor sans internet storm center claimed spoken symantec employee confirmed program part update process intended harm graham cluley consultant antivirus vendor sophos found pifts connected symantec server forwarding product computer information march 10 symantec made official response pifts program claiming posts support forum deleted due forum spam rules however deletion pifts-related posts began spam attacks symantec stated pifts diagnostic patch cole stated purpose update help determine many customers would need migrated windows 7-compatible versions norton antivirus pifts apparently released without digital signature verify identity causing firewalls prompt permission attempted connect internet symantec criticized consumers perceived ethical violations including allegations support technicians would tell customers systems infected needed technician resolve remotely extra fee refuse refund customers alleged systems actually infected norton antivirus 11 mac introduced support mac os x v10.5 leopard platform capability detect macintosh windows malware features include vulnerability scanner blocks attackers leveraging software exploits norton antivirus 11 also includes ability scan within compressed archived files time capsule volumes operating requirements call mac os x tiger powerpc intel core processor 128 mb ram 100 mb free hard disk space also required norton antivirus dual protection mac intended macintosh users windows running systems using boot camp virtualization software vmware fusion provides license norton antivirus 11 norton antivirus 2009 2009 2012 editions symantec made huge changes products speed performance norton products 2 running processes using 24 mb ram soon virus recognized information regards virus virus signature stored pandemic definitions file contains vital know-how become aware get rid virus according tests sponsored symantec passmark security benchmark 2012 norton antivirus norton internet security lightest suites available av-comparatives.org also tested products gave similar results pcmag recognises 2011 2012 lines fastest strongest protection pcworld tests security software put norton internet security 2009 1st place 2011 test pcworld norton internet security winner dennis technology labs tests sponsored symantec confirms performance effectiveness norton 2011 2012 lines 14th august 2013 prime minister new zealand john key addressed identified misinformation surrounding gcsb amendment bill claiming actions government communications security bureau analogous norton antivirus", + "neighbors": [ + 11, + 17, + 85, + 94, + 120, + 134, + 310, + 358, + 379, + 476, + 569, + 576, + 717, + 842, + 910, + 944, + 961, + 965, + 1038, + 1090, + 1101, + 1138, + 1239, + 1291, + 1350, + 1406, + 1514, + 1542 + ], + "mask": "Test" + }, + { + "node_id": 939, + "label": 5, + "text": "Lynx_(web_browser):lynx web browser lynx customizable text-based web browser use cursor-addressable character cell terminals oldest web browser still general use active development started 1992 lynx product distributed computing group within academic computing services university kansas initially developed 1992 team students staff university lou montulli michael grobe charles rezac hypertext browser used solely distribute campus information part campus-wide information server browsing gopher space beta availability announced usenet 22 july 1992 1993 montulli added internet interface released new version 2.0 browser garrett blythe created doslynx april 1994 later joined lynx effort well foteos macrides ported much lynx vms maintained time 1995 lynx released gnu general public license maintained group volunteers led browsing lynx consists highlighting chosen link using cursor keys links page numbered entering chosen link number current versions support ssl many html features tables formatted using spaces frames identified name explored separate pages lynx inherently display various types non-text content web images video launch external programs handle image viewer video player unlike web browsers lynx support javascript adobe flash websites require work correctly speed benefits text-only browsing apparent using low bandwidth internet connections older computer hardware may slow render image-heavy content lynx support graphics web bugs track user information fetched therefore web pages read without privacy concerns graphic web browsers however lynx support http cookies also used track user information lynx therefore supports cookie whitelisting blacklisting alternatively cookie support disabled permanently conventional browsers lynx also supports browsing histories page caching raise privacy concerns lynx accepts configuration options either command-line options configuration files 142 command line options according help message template configuration file codice_1 lists 233 configurable features overlap two although command-line options codice_2 matched codice_1 addition pre-set options command-line configuration file lynx behavior adjusted runtime using options menu overlap settings lynx implements many runtime optional features optionally controlled setting configuration file allowing choices saved separate writable configuration file reason restricting options saved originated usage lynx common mid-1990s i.e. using lynx front-end application internet accessed dial-in connections refreshable braille display text-to-speech\u2013friendly interface lynx used internet access visually impaired users lynx substitutes images frames non-textual content text codice_4 codice_5 codice_6 html attributes allows hiding user interface elements browser becomes specifically suitable use cost-effective general purpose screen reading software version lynx specifically enhanced use screen readers windows developed indian institute technology madras lynx also useful accessing websites remotely connected system graphical display available despite text-only nature age still used effectively browse much modern web including performing interactive tasks editing wikipedia since lynx take keystrokes text file still useful automated data entry web page navigation web scraping consequently lynx used web crawlers web designers may use lynx determine way search engines web crawlers see sites develop online services provide lynx view given web page available lynx also used test websites performance one run browser different locations remote access technologies like telnet ssh one use lynx test web site connection performance different geographical locations simultaneously another possible web design application browser quick checking site links lynx originally designed unix-like operating systems though ported vms soon public release systems including dos microsoft windows classic mac os os/2 included default openbsd installation openbsd 2.3 may 1998 5.5 may 2014 main tree prior july 2014 subsequently made available ports tree also found repositories linux distributions well homebrew fink repositories macos ports beos minix qnx amigaos os/2 also available sources built many platforms e.g. mention made google android operating system", + "neighbors": [ + 14, + 16, + 83, + 95, + 99, + 107, + 134, + 207, + 258, + 277, + 306, + 427, + 452, + 470, + 491, + 509, + 530, + 531, + 580, + 582, + 623, + 627, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1376, + 1378, + 1408, + 1423, + 1424, + 1452, + 1528, + 1550, + 1569, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 940, + "label": 9, + "text": "Linker_(computing):linker computing computing linker link editor computer utility program takes one object files generated compiler assembler combines single executable file library file another 'object file simpler version writes output directly memory called loader though loading typically considered separate process computer programs typically composed several parts modules parts/modules need contained within single object file cases refer means symbols addresses modules mapped memory addresses linked execution typically object file contain three kinds symbols compilers object file result compiling one input source code file program comprises multiple object files linker combines files unified executable program resolving symbols goes along linkers take objects collection called library runtime library linkers include whole library output include files referenced object files libraries library linking may thus iterative process modules included requiring additional modules linked libraries exist diverse purposes one system libraries usually linked default linker also takes care arranging objects program address space may involve relocating code assumes specific base address another base since compiler seldom knows object reside often assumes fixed base location example zero relocating machine code may involve re-targeting absolute jumps loads stores executable output linker may need another relocation pass finally loaded memory execution pass usually omitted hardware offering virtual memory every program put address space conflict even programs load base address pass may also omitted executable position independent executable unix variants sintran iii process performed linker assembling object files program called loading loading executable code onto file additionally operating systems program handles jobs linking loading program dynamic linking many operating system environments allow dynamic linking deferring resolution undefined symbols program run means executable code still contains undefined symbols plus list objects libraries provide definitions loading program load objects/libraries well perform final linking approach offers two advantages also disadvantages static linking result linker copying library routines used program executable image may require disk space memory dynamic linking portable since require presence library system runs static linking also prevents dll hell since program includes exactly versions library routines requires conflict programs program using routines library require entire library installed compiler information layout objects final output take advantage shorter efficient instructions place requirement address another object example jump instruction reference absolute address offset current location offset could expressed different lengths depending distance target generating conservative instruction usually largest relative absolute variant depending platform adding relaxation hints possible substitute shorter efficient instructions final link step performed input objects read assigned temporary addresses linker relaxation pass subsequently reassigns addresses may turn allow relaxations occur general substituted sequences shorter allows process always converge best solution given fixed order objects case relaxations conflict linker needs weigh advantages either option instruction relaxation typically occurs link-time inner-module relaxation already take place part optimising process compile-time cases relaxation also occur load-time part relocation process combined dynamic dead-code elimination techniques ibm system/360 mainframe environments os/360 including z/os z/architecture mainframes type program known linkage editor name implies linkage editor additional capability allowing addition replacement and/or deletion individual program sections operating systems os/360 format executable load-modules containing supplementary data component sections program individual program section replaced parts program updated relocatable addresses references corrected linkage editor part process one advantage allows program maintained without keep intermediate object files without re-compile program sections n't changed also permits program updates distributed form small files originally card decks containing object module replaced systems object code form format 80-byte punched-card images updates introduced system using medium later releases os/360 subsequent systems load-modules contain additional data versions components modules create traceable record updates term linkage editor construed implying program operates user-interactive mode like text editor intended batch-mode execution editing commands supplied user sequentially organized files punched cards dasd magnetic tape tapes often used initial installation os", + "neighbors": [ + 78, + 292, + 306, + 386, + 412, + 503, + 782, + 816, + 825, + 984, + 1044, + 1110, + 1138, + 1188, + 1287, + 1320, + 1372, + 1374, + 1477, + 1483, + 1546, + 1558, + 1616, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 941, + "label": 2, + "text": "Timeline_of_operating_systems:timeline operating systems article presents timeline events history computer operating systems 1951 current day narrative explaining overall developments see history operating systems", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 65, + 85, + 99, + 106, + 108, + 134, + 142, + 170, + 171, + 185, + 187, + 195, + 210, + 252, + 265, + 322, + 353, + 356, + 380, + 387, + 434, + 465, + 475, + 477, + 583, + 595, + 647, + 650, + 664, + 720, + 721, + 754, + 797, + 858, + 860, + 870, + 877, + 884, + 891, + 925, + 954, + 957, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1087, + 1138, + 1152, + 1188, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1397, + 1415, + 1441, + 1456, + 1494, + 1530, + 1546, + 1578, + 1610, + 1632, + 1637 + ], + "mask": "Train" + }, + { + "node_id": 942, + "label": 6, + "text": "IBM_Spectrum_Scale:ibm spectrum scale ibm spectrum scale high-performance clustered file system software developed ibm deployed shared-disk shared-nothing distributed parallel modes used many world largest commercial companies well supercomputers top 500 list example filesystem asc purple supercomputer composed 12,000 processors 2 petabytes total disk storage spanning 11,000 disks 2015 spectrum scale known ibm general parallel file system gpfs like typical cluster filesystems spectrum scale provides concurrent high-speed file access applications executing multiple nodes clusters used aix 5l clusters linux clusters microsoft windows server heterogeneous cluster aix linux windows nodes addition providing filesystem storage capabilities spectrum scale provides tools management administration spectrum scale cluster allows shared access file systems remote spectrum scale clusters spectrum scale available ibm aix since 1998 linux since 2001 windows server since 2008 spectrum scale known gpfs began tiger shark file system research project ibm almaden research center early 1993 tiger shark initially designed support high throughput multimedia applications design turned well suited scientific computing another ancestor spectrum scale ibm vesta filesystem developed research project ibm thomas j. watson research center 1992 1995 vesta introduced concept file partitioning accommodate needs parallel applications run high-performance multicomputers parallel i/o subsystems partitioning file sequence bytes rather multiple disjoint sequences may accessed parallel partitioning abstracts away number type i/o nodes hosting filesystem allows variety logically partitioned views files regardless physical distribution data within i/o nodes disjoint sequences arranged correspond individual processes parallel application allowing improved scalability vesta commercialized piofs filesystem around 1994 succeeded gpfs around 1998 main difference older newer filesystems gpfs replaced specialized interface offered vesta/piofs standard unix api features support high performance parallel i/o hidden users implemented hood spectrum scale available ibm aix since 1998 linux since 2001 windows server since 2008 spectrum scale offered part ibm system cluster 1350 today spectrum scale used many top 500 supercomputers listed top 500 supercomputing sites web site since inception spectrum scale successfully deployed many commercial applications including digital media grid analytics scalable file services 2010 ibm previewed version gpfs included capability known gpfs-snc snc stands shared nothing cluster officially released gpfs 3.5 december 2012 known fpo features spectrum scale file systems include high availability ability used heterogeneous cluster disaster recovery security dmapi hsm ilm spectrum scale clustered file system breaks file blocks configured size less 1 megabyte distributed across multiple cluster nodes system stores data standard block storage values includes internal raid layer called spectrum scale raid virtualize volumes redundancy parallel access much like raid block storage system also ability replicate across volumes higher file level features architecture include hadoop hdfs filesystem designed store similar greater quantities data commodity hardware \u2014 datacenters without raid disks storage area network san compared spectrum scale storage pools allow grouping disks within file system administrator create tiers storage grouping disks based performance locality reliability characteristics example one pool could high-performance fibre channel disks another economical sata storage fileset sub-tree file system namespace provides way partition namespace smaller manageable units filesets provide administrative boundary used set quotas specified policy control initial data placement data migration data single fileset reside one storage pools file data resides migrated based set rules user defined policy two types user defined policies spectrum scale file placement file management file placement policies direct file data files created appropriate storage pool file placement rules selected attributes file name user name fileset file management policies allow file data moved replicated files deleted file management policies used move data one pool another without changing file location directory structure file management policies determined file attributes last access time path name size file spectrum scale policy processing engine scalable run many nodes allows management policies applied single file system billions files complete hours", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 227, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 362, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 943, + "label": 5, + "text": "LAPDm:lapdm lapdm data link layer protocol used gsm cellular networks lapdm forms layer 2 um interface base transceiver station mobile station say used radio link cellular network subscriber handset lapdm derived much older link layer protocol called hdlc specified 3gpp specifications ts 04.05 ts 04.06 lapdm similar isdn layer 2 lapd simplifications another important difference lapdm lapd establishment contention resolution procedure gsm 04.06 section 5.4.1.4 wherein ms sends l3 message information field sabm frame echoed back bts corresponding ua frame procedure required lapdm possibility handset accidentally attempting use wrong channel lapd require contention resolution since hard-wired isdn devices accidentally use wrong channel associated control procedure used layer 2 iden rf interface similar lapdm", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 944, + "label": 4, + "text": "Avast_Antivirus:avast antivirus avast antivirus family internet security applications developed avast microsoft windows macos android ios avast antivirus products include free proprietary versions provide computer security browser security antivirus software firewall anti-phishing antispyware anti-spam among services 2017 avast popular antivirus vendor market largest share market antivirus applications avast programs available internet-connected devices available 45 languages avast product range includes following february 2018 test various antimalware products av-test avast free antivirus earned 6 6 points protection category detecting 100 malware samples used test earning av-test certified seal avast mobile security antivirus app also performed well detected 100 malware samples january 2018 test android malware av-comparatives", + "neighbors": [ + 17, + 94, + 120, + 297, + 379, + 476, + 531, + 569, + 576, + 717, + 842, + 910, + 938, + 961, + 965, + 1038, + 1101, + 1138, + 1239, + 1291, + 1350, + 1514, + 1542 + ], + "mask": "Validation" + }, + { + "node_id": 945, + "label": 2, + "text": "Game_Center:game center game center got removed home screen ios 10 update still exists today mac os also games ios pop open certain games ios today game center app released apple allows users play challenge friends playing online multiplayer social gaming network games games share multiplayer functionality mac ios versions app game center implemented developers ios 4.1 later mac os x 10.8 later gamekit framework game center available ipod touch 2nd generation later ios 4.1 higher required iphone 3gs later ios 4.1 higher required models ipad ios 4.2 higher required mac computers running os x 10.8 mountain lion later apple tv 4 running tvos apple watch running watchos 3 gaming became major part ios platform apple launched app store july 10 2008 unlike console systems currently market apple unified multiplayer social system platform gap soon filled third parties openfeint plus agon online scoreloop third parties control online gaming environment multiple third parties involved left non-unified experience game center announced ios 4 preview event hosted apple april 8 2010 preview released registered apple developers august released september 8 2010 ios 4.1 iphone 4 iphone 3gs ipod touch 2nd generation 4th generation included ios 4.2 ipad updated version game center released ios 5 featured addition turn-based gaming player photos friend suggestions achievement points ios 6 update added challenges way players challenge players beat leaderboard scores earn achievements june 13 2016 application removed ios 10 macos sierra however service still exists within game center players connect friends send friend requests start playing games organize online multiplayer games number friends connected single game center account limited 500 games may feature achievements completing certain task player rewarded points depending game leaderboard may present player compare score friends world many ios games use game center use every feature apps choose include following features supported game center", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 214, + 228, + 252, + 269, + 345, + 356, + 394, + 395, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 797, + 810, + 858, + 877, + 917, + 927, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1189, + 1237, + 1262, + 1292, + 1305, + 1322, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 946, + "label": 3, + "text": "Heterogeneous_System_Architecture:heterogeneous system architecture heterogeneous system architecture hsa cross-vendor set specifications allow integration central processing units graphics processors bus shared memory tasks hsa developed hsa foundation includes among many others amd arm platform stated aim reduce communication latency cpus gpus compute devices make various devices compatible programmer perspective relieving programmer task planning moving data devices disjoint memories must currently done opencl cuda cuda opencl well fairly advanced programming languages use hsa increase execution performance heterogeneous computing widely used system-on-chip devices tablets smartphones mobile devices video game consoles hsa allows programs use graphics processor floating point calculations without separate memory scheduling rationale behind hsa ease burden programmers offloading calculations gpu originally driven solely amd called fsa idea extended encompass processing units gpus manufacturers dsps well modern gpus well suited perform single instruction multiple data simd single instruction multiple threads simt modern cpus still optimized branching etc originally introduced embedded systems cell broadband engine sharing system memory directly multiple system actors makes heterogeneous computing mainstream heterogeneous computing refers systems contain multiple processing units central processing units cpus graphics processing units gpus digital signal processors dsps type application-specific integrated circuits asics system architecture allows accelerator instance graphics processor operate processing level system cpu among main features hsa defines unified virtual address space compute devices gpus traditionally memory separate main cpu memory hsa requires devices share page tables devices exchange data sharing pointers supported custom memory management units render interoperability possible also ease various aspects programming hsa intended isa-agnostic cpus accelerators support high-level programming languages far hsa specifications cover hsa intermediate layer hsail virtual instruction set parallel programs mobile devices one hsa application areas yields improved power efficiency block diagrams provide high-level illustrations hsa operates compares traditional architectures hsa-specific features implemented hardware need supported operating system kernel specific device drivers example support amd radeon amd firepro graphics cards apus based graphics core next gcn merged version 3.19 linux kernel mainline released 8 february 2015 programs interact directly queue jobs utilizing hsa runtime first implementation known focuses berlin apus works alongside existing radeon kernel graphics driver additionally supports heterogeneous queuing hq aims simplify distribution computational jobs among multiple cpus gpus programmer perspective support heterogeneous memory management hmm suited graphics hardware featuring version 2 amd iommu accepted linux kernel mainline version 4.14 integrated support hsa platforms announced sumatra release openjdk due 2015 amd app sdk amd proprietary software development kit targeting parallel computing available microsoft windows linux bolt c++ template library optimized heterogeneous computing gpuopen comprehends couple software tools related hsa codexl version 2.0 includes hsa profiler amd kaveri a-series apus cf kaveri desktop processors kaveri mobile processors sony playstation 4 allowed integrated gpu access memory via version 2 amd iommu earlier apus trinity richland included version 2 iommu functionality use external gpu connected via pci express post-2015 carrizo bristol ridge apus also include version 2 iommu functionality integrated gpu arm bifrost microarchitecture implemented mali-g71 fully compliant hsa 1.1 hardware specifications arm announced software support would use hardware feature", + "neighbors": [ + 51, + 76, + 85, + 105, + 123, + 127, + 162, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 306, + 314, + 335, + 388, + 445, + 457, + 460, + 508, + 521, + 579, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1231, + 1256, + 1272, + 1284, + 1290, + 1469, + 1503, + 1505, + 1507, + 1518, + 1525, + 1557, + 1616, + 1632 + ], + "mask": "Train" + }, + { + "node_id": 947, + "label": 9, + "text": "AutoLISP:autolisp autolisp dialect programming language lisp built specifically use full version autocad derivatives include autocad map 3d autocad architecture autocad mechanical neither application programming interface api interpreter execute autolisp code included autocad lt product line autolisp small dynamically scoped dynamically typed lisp language dialect garbage collection immutable list structure settable symbols lacking regular lisp features macro system records definition facilities arrays functions variable number arguments let bindings aside core language primitive functions geometry accessing autocad internal dwg database manipulation graphical entities autocad properties graphical entities revealed autolisp association lists values paired autocad group codes indicate properties definitional points radii colors layers linetypes etc autocad loads autolisp code .lsp files autolisp code interact user autocad graphical editor use primitive functions allow user pick points choose objects screen input numbers data autolisp also built-in graphical user interface gui mini- domain-specific language dsl dialog control language creating modal dialog boxes automated layout within autocad autolisp derived early version xlisp created david betz language introduced autocad version 2.18 january 1986 continued enhanced successive releases release 13 february 1995 development neglected autodesk favor fashionable development environments like visual basic applications vba .net framework objectarx however remained autocad main user customizing language vital-lisp considerably enhanced version autolisp including integrated development environment ide debugger compiler activex support developed sold third party developer basis software vital lisp superset existing autolisp language added vba-like access autocad object model reactors event handling autocad objects general activex support general lisp functions autodesk purchased renamed visual lisp briefly sold add-on autocad release 14 released may 1997 incorporated autocad 2000 released march 1999 replacement autolisp since autodesk ceased major enhancements visual lisp focused effort vba .net c++ autodesk longer supports vba versions older 7.1 part long-term process changing vba .net user customizing autolisp strong following computer-aided design cad application vendors add products bricscad intellicad others autolisp functionality autolisp users consider using alternative autocad development involving autolisp since autocad 2000 performed within visual lisp since original autolisp engine replaced visual lisp engine thousands utilities applications developed using autolisp visual lisp distributed lsp fas vlx files simple hello world program autolisp would note final line inside function definition evaluated arguments codice_1 function returns null symbol displayed autocad command-line interface autocad command line functions read\u2013eval\u2013print loop repl would normally print hello world command line followed immediately return value call codice_1 therefore without final call codice_1 function result would codice_5 function may also used achieve result complex example might code defines new function generates autocad point object given point one-line text object displaying x coordinates beside name function includes special prefix c causes autocad recognize function regular command user upon typing 'pointlabel autocad command line would prompted pick point either typing x coordinates clicking location drawing function would place marker point create one-line text object next containing x coordinates point expressed relative active user coordinate system ucs function requires parameters contains one local variable 'pnt example could also written using built-in autocad commands achieve result however approach susceptible changes command prompts autocad releases", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 521, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1372, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1417, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 948, + "label": 9, + "text": "Julia_(programming_language):julia programming language julia high-level general-purpose dynamic programming language designed high-performance numerical analysis computational science also useful low-level systems programming specification language web programming server web use web client programming distinctive aspects julia design include type system parametric polymorphism types fully dynamic programming language multiple dispatch core programming paradigm allows concurrent parallel distributed computing direct calling c fortran libraries without glue code just-in-time compiler referred just-ahead-of-time julia community used julia garbage-collected uses eager evaluation includes efficient libraries floating-point calculations linear algebra random number generation regular expression matching many libraries available including e.g. fast fourier transforms previously bundled julia separate tools available julia include ides integrated tools e.g linter debugger rebugger.jl package supports repeated-execution debugging work julia started 2009 jeff bezanson stefan karpinski viral b. shah alan edelman set create free language high-level fast 14 february 2012 team launched website blog post explaining language mission interview infoworld april 2012 karpinski said name julia good reason really seemed like pretty name bezanson said chose name recommendation friend since 2012 launch julia community grown 9,000,000 downloads used 1,500 universities official julia docker images docker hub seen 4,000,000 downloads january 2019 juliacon academic conference julia users developers held annually since 2014 version 0.3 released august 2014 version 0.4 october 2015 version 0.5 october 2016 julia 0.6 released june 2017 stable release version 8 august 2018 julia 0.7 useful release testing packages knowing upgrade 1.0 version 1.0 released 8 august 2018 work julia 0.7 huge undertaking e.g. entirely new optimizer changes made syntax syntax stable 1.x 0.7 semantics iteration interface simplified release candidate julia 1.0 julia 1.0.0-rc1 released 7 august 2018 final version day later julia 1.1 released 21 january 2019 e.g. new exception stack language feature bugfix releases expected roughly monthly julia 1.1.x 1.0.x 1.0.x currently long-term support least year julia 1.0.1 1.0.4 followed schedule bugfix releases pipeline 0.7-release julia 1.2 released 20 august 2019 julia 1.1.x release longer maintained 1.0.x 1.2.x e.g built-in support web browsers testing running javascript vm packages work julia 1.0.x also work 1.1.x newer enabled forward compatible syntax guarantee major exception interacting non-julia code javacall.jl package however calling languages e.g r language works package r fixed call java scala etc use languages julia e.g jdbc.jl apache spark spark.jl users choose stay lts version julia milestone set fix julia 1.4 however already workaround julia-1.3.0-rc1 julia attracted high-profile users investment manager blackrock uses time-series analytics british insurer aviva uses risk calculations 2015 federal reserve bank new york used julia make models us economy noting language made model estimation 10 times faster previous matlab implementation julia co-founders established julia computing 2015 provide paid support training consulting services clients though julia remains free use 2017 juliacon conference jeffrey regier keno fischer others announced celeste project used julia achieve peak performance 1.54 petaflops using 1.3 million threads 9300 knights landing knl nodes cori cray xc40 supercomputer 5th fastest world time november 2017 8th fastest julia thus joins c c++ fortran high-level languages petaflops computations achieved three julia co-creators recipients 2019 james h. wilkinson prize numerical software awarded every four years creation julia innovative environment creation high-performance tools enable analysis solution computational science problems julia received contributions 800 developers worldwide dr. jeremy kepner mit lincoln laboratory founding sponsor julia project early days addition funds gordon betty moore foundation alfred p. sloan foundation intel agencies nsf darpa nih nasa faa essential development julia julia computing inc. founded 2015 viral b. shah deepak vinchhi alan edelman jeff bezanson stefan karpinski keno fischer june 2017 julia computing raised 4.6m seed funding general catalyst founder collective according official website main features language multiple dispatch also termed multimethods lisp generalization single dispatch polymorphic mechanism used common object-oriented programming oop languages uses inheritance julia concrete types subtypes abstract types directly indirectly subtypes type top type hierarchy concrete types subtyped way languages composition used instead see also inheritance vs subtyping julia draws significant inspiration various dialects lisp including scheme common lisp shares many features dylan also multiple-dispatch-oriented dynamic language features algol-like free-form infix syntax rather lisp-like prefix syntax julia everything expression fortress another numerical programming language features multiple dispatch sophisticated parametric type system common lisp object system clos adds multiple dispatch common lisp functions generic functions julia dylan fortress extensibility default system built-in functions generic extensible dylan multiple dispatch fundamental julia user-defined functions even basic built-in operations like codice_1 generic dylan type system however fully support parametric types typical ml lineage languages default clos allow dispatch common lisp parametric types extended dispatch semantics added extension clos metaobject protocol convergent design fortress also features multiple dispatch parametric types unlike julia however fortress statically rather dynamically typed separate compiling executing phases language features summarized following table default julia runtime must pre-installed user-provided source code run alternatively standalone executable needs julia source code built applicationbuilder.jl packagecompiler.jl julia syntactic macros used metaprogramming like lisp macros powerful different text-substitution macros used preprocessor languages c work level abstract syntax trees asts julia macro system hygienic also supports deliberate capture desired like anaphoric macros using codice_2 construct julia official distribution includes interactive session shell called julia read\u2013eval\u2013print loop repl used experiment test code quickly following fragment represents sample session example strings concatenated automatically println repl gives user access system shell help mode pressing codice_3 codice_4 prompt preceding command respectively also keeps history commands including sessions code tested inside julia interactive section saved file codice_5 extension run command line typing julia supported jupyter online interactive notebooks environment julia practice interoperable many languages julia keyword used call c-exported fortran shared library functions individually julia unicode 12.0 support latest 12.1.0 support adds one letter julia 1.3 utf-8 used strings default julia source code meaning also allowing option common math symbols many operators \u2208 codice_6 operator julia packages supporting markup languages html also http xml json bson databases web use general julia core implemented julia c together c++ llvm dependency parsing code-lowering implemented femtolisp scheme dialect llvm compiler infrastructure project used back end generation 64-bit 32-bit optimized machine code depending platform julia runs exceptions e.g. pcre standard library implemented julia notable aspect julia implementation speed often within factor two relative fully optimized c code thus often order magnitude faster python r development julia began 2009 open-source version publicized february 2012 julia uses jit mcjit llvm julia generates native machine code directly function first run bytecodes run virtual machine vm translated bytecode running e.g java jvm dalvik android julia four support tiers currently supports x86-64 processors 64-bit optimized latest generations ia-32 x86 processors except decades old ones i.e. 32-bit mode i686 excepting cpus pre-pentium 4-era supports lower tiers e.g. tier 2 fully supports armv8 aarch64 processors supports armv7 armv6 aarch32 caveats cuda i.e nvidia ptx tier 1 support help external package least platforms may need compiled source code e.g. original raspberry pi options changed download page otherwise executables source available julia successfully built several arm platforms e.g. armv8 data center cloud processors cavium thunderx first arm 48 cores arm v7 32-bit tier 2 support binaries first get x86 arm v8 64-bit ptx 64-bit meaning nvidia cuda gpus external support powerpc 64-bit tier 3 support may may build julia supported raspbian support better newer e.g. armv7 pis julia support promoted raspberry pi foundation also support web browsers/javascript jsexpr.jl alternative language web browsers webassembly support minimal support julia supports several upcoming external julia projects", + "neighbors": [ + 31, + 65, + 78, + 117, + 134, + 176, + 216, + 246, + 275, + 292, + 306, + 308, + 324, + 347, + 373, + 429, + 447, + 509, + 538, + 567, + 575, + 579, + 594, + 597, + 682, + 690, + 716, + 742, + 766, + 782, + 790, + 796, + 806, + 820, + 824, + 825, + 919, + 948, + 961, + 985, + 998, + 1005, + 1006, + 1027, + 1028, + 1044, + 1059, + 1120, + 1138, + 1152, + 1221, + 1225, + 1227, + 1231, + 1235, + 1278, + 1311, + 1318, + 1319, + 1324, + 1389, + 1430, + 1457, + 1483, + 1532, + 1538, + 1558, + 1582, + 1626 + ], + "mask": "Test" + }, + { + "node_id": 949, + "label": 3, + "text": "Renegade_III:_The_Final_Chapter:renegade iii final chapter renegade iii final chapter scrolling beat'em computer game released amstrad cpc commodore 64 msx zx spectrum systems 1989 ocean software imagine label game sequel sequel arcade game renegade unlike first two games renegade iii follows character known renegade travels time rescue captured girlfriend also dropped two-player mode found previous title though game highly praised critics receiving high scores several prominent gaming publications 91 score awarded crash 84 c+vg derided fans criticised game storyline lack deep gameplay glitches poor physics lack two-player option demonstrated video created internet comedian stuart ashen reviews zx spectrum version repeatedly criticises game whilst praising spectrum versions first two games video also includes fellow youtube user ex-television presenter larry bundy jr reviewing amstrad cpc version video game journalist jon blyth reviewing commodore 64 version game criticising game well spanish magazine microhobby valued game following scores originality 30 graphics 80 motion 80 sound 80 difficulty 100 addiction 80", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 950, + "label": 7, + "text": "Advania:advania advania nordic information technology service corporation headquartered stockholm sweden company largest field iceland 9th largest nordic countries advania corporate clients public private sector provides wide range it-services platforms cloud solutions support multinational enterprises governments big small medium-sized businesses according swedish clients advania sweden leader creating customer value advania traces roots three nordic countries iceland norway sweden long period time country generated component eventually braided one company advania ab 2012 1939 icelandic entrepreneur einar j. sk\u00falason founded ejs office equipment repair workshop reykjavik soon expanded business opened store started importing office machinery cash registers etc world war ii company also repaired guns lighters ejs eventually became dominant business iceland 1952 icelandic government city reykjavik founded sk\u00fdrr company whose purpose take leading role computing recordkeeping iceland company privatized 1995 later became core element group companies \u2013 including ejs \u2013 merged sk\u00fdrr brand 1971 company nokia elektronic ab \u2013 later renamed datapoint svenska ab \u2013 founded sweden company sold datapoint computer terminals later became network pioneer key system integrator sweden 2003 datapoint merged virtus ab it-company founded 1994 grew rapidly virtus soon became key player swedish market focusing microsoft based solutions offering storage backup services 2003 one strongest comprehensive system integrators sweden created datapoint virtus merged new company named kerfi ab 1991 merkantildata applikasjon founded norway originally business unit within merkantildata later atea company focused implementing erp solutions nordic market industry solutions retail property management logistics legal transport waste management 2000 company changed name hands listed oslo stock exchange 2005 hands unlisted acquired icelandic company k\u00f6gun later merged sk\u00fdrr see despite changes ownership hands kept norwegian identity acquired nett.2.3 completo 2005 2012 advania ab born sk\u00fdrr iceland kerfi sweden hands norway merged became key challenger scandinavian it-market since four companies acquired merged advania listed swedish company caperio included 2018 finnish digital service provider vintor become advania finland advania finland strong roots providing ict services public private sector customers focused providing wide range services related digitalization ict infrastructure", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 951, + "label": 1, + "text": "Norwegian_Ship_Register:norwegian ship register norwegian ship register domestic ship register norway managed norwegian maritime authority physically located bergen registry 12,000 ships include commercial non-commercial vessels ships exceeding mobile offshore installations must registered smaller vessels volunteer norwegian shipbuilding register subordinate register ship registration norway became codified 1902 task handed district courts magistrates city clerks first 50 registers reduced 27 1972 responsibility centralized taken norwegian ship registers 1992 merged maritime authority 2012 third norwegian code signed christian v 15 april 1687 dedicated shipping established principals collateral insurance well arrest procedure following accidents however register ships established 1901 process establish public ship register commenced 1881 background bank considered would purpose lend money purchase ships would require legal framework would firmly establish ownership collateral ships sea law commission appointed 1882 consider legal aspects shipping industry soon became clear commission would ship registration main purpose aspects sea law coordinated internationally reached conclusion resulted 1888 proposal parliament based single central register ships parliament decided consider law similar proposals 1892 1893 1894 1897 similarly dismissed break-through ship registration came 1900\u201301 parliamentary session private alternative proposal launched. latter instead involved establishing series local registers ship registration act approved parliament 4 may 1901 government commission looked detailed aspects registration council state approved 23 july 1902 resulted fifty district courts given task maintaining local ship registers covering jurisdiction known names bergen ship register first significant reform came 1972 number registers reduced 27 norwegian international ship register nis created 1 july 1987 allowed flag convenience registration ships international traffic remaining norwegian flag jurisdiction instead using local registers nis established office bergen ship register part city clerk bergen nis took march 1990 initiative centralize local ship registers jointly locate nis emphasized nis operated around-the-clock duty service joint location registers would allow economies scale cutting costs would also allow time freed magistrate offices district courts another concern recent rationalization program following introduction electronic registers given little savings due decentralized nature operations parliament looked possibility centralizing local ship registers 1990 issue postponed consider merger nis ministry justice established commission look matter concluded july 1991 registers centralized located bergen proposed new register administratively part maritime authority issue concluded march government decided create norwegian ship registers located bergen would organized government agency subordinate ministry foreign affairs city clerk bergen merged magistrate bergen 1 april 1992 nis split merged office 1 may responsibility local registries transferred new norwegian ship registries 1 july time 12,000 ships registered 880 nis staff nis office increased six eight jobs lost magistrate offices district courts able use workforce tasks norwegian ship registries became part ministry trade industry 1996 minister trade industry trond giske took initiative june 2010 investigate merger norwegian ship registers norwegian maritime authority internal ministry committee concluded 1 november merger would favorable cited common organization would uniform user-friendly competitive allowing shipping companies relate single organization handling registers would remain bergen despite maritime authority based haugesund merger took effect 1 january 2012 time eighteen employees agency register required certain types vessels vessels optional register norwegian ship exceeding length well oil platforms mobile installations required registered registered foreign registry volunteer registration available ships certain fishing vessels boats length used commercially mobile cranes hovercrafts docks drags fixed maritime installations used petroleum extraction nor-registered ships must norwegian nationality nationality european economic area ownership need norwegian entity although operations must norwegian owner norwegian representative ships construction norway may registered norwegian shipbuilding register open registration recreational vessels allows owner use boat collateral loan nor-registered boat also registered volunteer boat register recreational boats sometimes sold without proper reregistration times purchasers bought boats without checking see boat collateral tied", + "neighbors": [ + 451 + ], + "mask": "Test" + }, + { + "node_id": 952, + "label": 8, + "text": "GolfBOO:golfboo golfboo golf course search engine optimized towards finding golf courses online bargains co-founded 2013 antonio conde fabio peral headquartered marbella spain engine provides search tool find locations descriptions facility list reviews golf courses europe golfboo golf course search engine locates golf courses golf vacation travel packages real estate options website uses algorithms rating system search filters golfboo founded january 2013 antonio conde online marketer fabio peral former golf consultant royal troon golf club golf director la quinta lumine buenaventura located panama first version website launched june 2013 former version site focused advertised golf courses golf bargain packages later site expanded listing tee times hotels deals real estate located specific golfing spots golfboo received online exposure initial debut due fact golf-specific travel search engine comparison website first travel website curtail search optimization towards finding real estate golf recreational areas", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 953, + "label": 5, + "text": "QtWeb:qtweb qtweb discontinued free open-source web browser developed logicware lsoft technologies qtweb used webkit browser engine embedded qt framework qtweb described lightweight web browser offers amount customisable features speed simplicity navigate however criticised lack extensions support way run java problems work several websites", + "neighbors": [ + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 505, + 509, + 530, + 531, + 582, + 623, + 668, + 684, + 713, + 780, + 862, + 886, + 899, + 939, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1232, + 1280, + 1331, + 1376, + 1378, + 1408, + 1423, + 1528, + 1550, + 1569 + ], + "mask": "Test" + }, + { + "node_id": 954, + "label": 2, + "text": "SOX_(operating_system):sox operating system sox name unix clone developed scratch brazil late 1980s computadores e sistemas brasileiros s/a cobra tecnologia leadership ivan da costa marques certified unix-compatible x/open unisoft early 1989 sox one first re-implementation unix fully independent passed x/open verification tests one ever completed 100 outside united states sox designed run cobra minicomputers part brazilian informatics policy aimed achieve technological independence united states despite technical success sox came late cobra largely lost support sox development stopped soon certified government decided instead allow import unix system v release 4.0", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 106, + 134, + 170, + 171, + 187, + 195, + 322, + 413, + 443, + 465, + 475, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 891, + 901, + 941, + 957, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 955, + "label": 4, + "text": "Pre-shared_key:pre-shared key cryptography pre-shared key psk shared secret previously shared two parties using secure channel needs used build key shared secret key derivation function typically used systems almost always use symmetric key cryptographic algorithms term psk used wi-fi encryption wired equivalent privacy wep wi-fi protected access wpa method called wpa-psk wpa2-psk also extensible authentication protocol eap known eap-psk cases wireless access points ap clients share key characteristics secret key determined system uses system designs require keys particular format password passphrase hexadecimal string secret used systems involved cryptographic processes used secure traffic systems crypto systems rely one keys confidentiality one particular attack always possible keys brute force key space search attack sufficiently long randomly chosen key resist practical brute force attack though principle attacker sufficient computational power see password strength password cracking discussion unavoidably however pre-shared keys held parties communication compromised one end without knowledge anyone several tools available help one choose strong passwords though network connection inherently unsafe one general know anyone may eavesdropping interaction choosing keys used cryptographic algorithms somewhat different pattern whatsoever avoided pattern may provide attacker lower effort attack brute force search implies random key choice force attackers spend much effort possible difficult principle practice well general rule software except cryptographically secure pseudorandom number generator csprng avoided", + "neighbors": [ + 289, + 333, + 364, + 542, + 560, + 1045, + 1240, + 1325, + 1451 + ], + "mask": "Test" + }, + { + "node_id": 956, + "label": 2, + "text": "IPhone_X:iphone x iphone x roman numeral x pronounced ten smartphone designed developed marketed apple inc eleventh generation iphone announced september 12 2017 alongside iphone 8 iphone 8 plus steve jobs theater apple park campus release date \u2013 november 3 2017 \u2013 marked iphone series tenth anniversary iphone x intended showcase apple considered technology future using glass stainless-steel form factor beze-less design shrinking bezels chin unlike many android phones first iphone use oled screen offer wireless charging home button replaced new type password authentication called face id using advanced technologies scan user face unlock device face-recognition capability also enabled emojis animated following user expression animoji bezel-less design iphone user interaction changed significantly using gestures navigate operating system rather home button used previous iphones time november 2017 launch price tag us 999 also made expensive iphone ever even higher prices internationally due additional local sales import taxes iphone x received mixed reviews display build quality universally praised camera also scored positively tests phone received particularly polarized reception due sensor housing notch top screen introduction all-new authentication method notch heavily mocked users social media although app developers responded either neutrally positively changes brought user experience apps games reviewers mixed reactions condemning others acknowledging unusual first moments use getting accustomed presence face id facial recognition praised simple setup criticized requiring direct eyes screen though option disabled within system preferences along iphone 6s plus variant iphone se iphone x discontinued september 12 2018 following announcement new iphone xs iphone xs max iphone xr devices result shelf life 10 months iphone x shortest ever tenure flagship device history iphone november 22 2018 apple reportedly resumed production iphone x due weak sales successors iphone x remains discontinued february 2019 apple started selling refurbished models 769 technology behind iphone x development five years far back 2012 rumors drastic iphone redesign began circulating around time iphone 7 announcement third quarter 2016 intensified homepod firmware leak july 2017 suggested apple would shortly release phone nearly bezel-less design lack physical home button facial recognition new features near-final development version ios 11 operating system also leaked september 2017 confirming new design features august 31 2017 apple invited journalists september 12 press event first public event held steve jobs theater company new apple park campus cupertino california iphone x unveiled keynote us 999 starting price expensive iphone launch price price even higher international markets due currency fluctuations import fees sales taxes unlocked version phone made available purchase united states december 5 2017 april 2018 federal communications commission divulged images unreleased gold-colored iphone x model opposed space gray silver color options iphone x ships divulged initial plans release gold option device however put hold due production issues apple released revised b model iphone x fixed nfc issues users japan china america iphone x 5.8-inch oled color-accurate screen supports dci-p3 wide color gamut srgb high dynamic range contrast ratio 1,000,000:1 super retina display true tone technology found ipad pro uses ambient light sensors adapt display white balance surrounding ambient light although iphone x feature promotion technology used displays second-generation ipad pro display delivers refresh rate 120hz sample touch input 120hz oled screen technology known negative trend burn-in effects particular elements consistently screen long periods time leave faint trace even new images appear apple acknowledged oled screens excluded issue writing support document also expected behavior greg joswiak apple vice president product marketing told tom guide oled panels apple used iphone x engineered avoid oversaturation colors using oled panels typically results made color adjustments subpixel -level refinements crisp lines round corners out-of-warranty servicing damages relating manufacturing defects screen repairs iphone x cost us 279 damage repairs cost us 549 iphone x two color options silver space gray sides phone composed surgical-grade stainless steel improve durability front back made glass design intended ip67 water dust resistant iphone x contains apple a11 bionic system-on-chip also used iphone 8 8 plus six-core processor two cores optimized performance 25 faster a10 fusion processor along four cores optimized efficiency 70 faster previous generation also features first apple-designed graphics processing unit neural engine powers artificial intelligence accelerator face id replaces touch id authentication system facial recognition sensor consists two parts romeo module projects 30,000 infrared dots onto user face juliet module reads pattern pattern sent secure enclave a11 bionic chip confirm match phone owner face default system work eyes closed effort prevent unauthorized access requirement disabled settings iphone x two cameras rear one 12-megapixel wide-angle camera f/1.8 aperture support face detection high dynamic range optical image stabilization capable capturing 4k video 24 30 60 frames per second 1080p video 30 60 120 240 frames per second secondary telephoto lens features 2\u00d7 optical zoom 10\u00d7 digital zoom aperture f/2.4 optical image stabilization portrait mode capable producing photos specific depth-of-field lighting effects also quad-led true tone flash 2\u00d7 better light uniformity front phone 7-megapixel truedepth camera f/2.2 aperture features face detection hdr capture 1080p video 30 frames per second 720p video 240 frames per second exclusively allows use animoji animated emojis placed top user face intelligently react user facial expressions iphone x also supports qi-standard wireless charging tests conducted macrumors iphone x charging speed varies significantly depending types cables powerbanks adapters wireless chargers used due different screen layout ios developers required update apps make full use additional screen real estate changes include rounded corners sensor notch top screen indicator area bottom accessing home screen apple published human interface guidelines document explain areas focus discouraged developers attempting mask call special attention new changes additionally text within app needs configured properly reference face id rather touch id authentication technology used iphone x anticipation release phone major apps quickly updated support new changes brought iphone x though required changes cause delayed app updates major apps traditional home button found previous devices iphone lineup removed entirely replaced touch-based gestures wake device users tap display use side button access home screen users must swipe bottom display access multitasking window users must swipe similarly method accessing home screen stop finger middle screen causing app carousel appear iphone x rear camera received overall rating 97 dxomark camera testing company short highest score 99 awarded samsung galaxy s9+ smartphone google pixel 2 received rating 98 consumer reports non-profit independent organization aiming write impartial reviews consumer products ranked iphone x iphone 8 iphone 8 plus well samsung galaxy s8 s8+ note 8 due less durability shorter battery life although praised x camera highest-rated smartphone camera ever tested nilay patel verge praised display calling polished tight clean bright colorful criticized repeated lack headphone jack device fragility despite apple claims durability sensor notch calling ugly patel highlighted fact apps required updates fit new screen writing popular apps received updates time review resulting apps huge black borders resembling iphone 8 especially criticized positioning sensor notch holding phone landscape mode causing notch go somewhat forgettable element top status bar giant interruption side screen cameras given positive feedback maintaining detail low-light patel particularly praised animoji calling probably single best feature iphone x writing work work incredibly well finally wrote face id whole foundation iphone x stated generally works great though acknowledging occasional misstep users must actively move phone closer face compensate specifically criticized limited range face id authentication working holding phone 25\u201350 centimeters away face chris velazco engadget also praised display writing experience sensor notch goes weird first noticeable due action videos usually happening center build quality given particular acclaim called beautifully made device construction seamlessly connects front back glass stainless-steel frame velazco noted new gesture-based interaction takes time getting used particularly control center moved bottom top right display camera processor performance battery life also given positive thoughts heavily negative review dennis green business insider significantly criticized impossible one-handed use iphone x writing new gestures use phone swiping top access notifications control center work using phone one hand due able reach top review sparked outrage among twitter users many used condescending tones green reasoned n't know whether anger directed toward loyalty apple justify choice spend 1,000 phone obvious much criticism came people never used phone macworld roman loyola praised face id authentication system writing setup process easy system integration seamless touch id fingerprint authentication past said loyola note half-second slower unlocking time touch id well needing look directly screen making impossible unlock phone next user desk face id raised concerns regarding possibility law enforcement accessing individual phone pointing device user face united states senator al franken asked apple provide information security privacy face id day announcement apple responding highlighting recent publication security white paper knowledge base detailing answers inconsistent results shown testing face id identical twins tests showing system managing separate two tests failed however despite apple promise increased security face id compared touch id fingerprint authentication system multiple media reports indicating otherwise verge noted courts united states granted different fifth amendment rights united states constitution biometric unlocking systems opposed keycodes keycodes considered testimonial evidence based contents users thoughts whereas fingerprints considered physical evidence suspects ordered unlock phones via fingerprint many attempts break face id sophisticated masks attempted though failed week iphone x released vietnamese security firm bkav announced blog post successfully created 150 mask tricked face id though wired noted bkav technique proof-of-concept rather active exploitation risk technique requiring detailed measurement digital scan iphone owner face putting real risk danger targets espionage world leaders additionally reuters reported early november 2017 apple would share certain facial data users third-party app developers precise selfie filters fictional game characters mirror real-world user facial expressions although developers required seek customer permission allowed sell data others create profiles users use data advertising limited rough map rather full capabilities still get access 50 kinds facial expressions american civil liberties union aclu center democracy technology raised privacy questions apple enforcement privacy restrictions connected third-party access apple maintaining app store review processes effective safeguards rough map facial data third-parties access also enough unlock device according reuters however overall idea letting developers access sensitive facial information still satisfactorily handled according jay stanley senior policy analyst aclu stanley telling reuters privacy issues around use sophisticated facial recognition technology unlocking phone overblown \u2026 real privacy issues access third-party developers much debate iphone x revolved around design sensor housing dubbed notch media top display outline described visually disgusting element verge posted report focusing public criticism people mocking apple odd design choice every reviewer equally negative opinions third-party ios developers interviewed ars technica said despite work restructuring design elements apps notch cause problems even arguing notch good push simplify designs two weeks iphone x release apple approved notch remover app app store places black bars across top home screen make notch visually disappear approval done despite company user interface guidelines discouraging developers specifically masking design iphone x first device notch\u2013both essential phone sharp aquos s2 announced display notch\u2013but iphone x arguably popularized november 2017 early adopters new phone reported experiencing activation issues certain cellular carriers notably announced within hours issue fixed end spokesperson verizon carrier told media none customers affected despite reports problems november 2017 iphone x users reported reddit device screen would become unresponsive experiencing rapid temperature drops apple released ios 11.1.2 update november 16 2017 fixing issue forbes contributor gordon kelly reported march 2018 1,000 users experienced problems using camera flash cold weather problem still persisting ios 11.3 beta 1 apple engaged legal battle qualcomm allegedly anti-competitive practices dual-sourcing cellular modem chips reduce reliance semiconductor manufacturer starting iphone 7 2016 apple used half qualcomm modem chips half intel professional measurement tests performed wireless signal testing firm cellular insights indicated previous-gen iphone 7 qualcomm chips outperform intel lte download speeds 67 faster weak signal conditions resulting sources recommending purchase unlocked iphone x one bought cellular carrier verizon order get models featuring faster qualcomm modem additionally cnet reported september 2017 new iphone models including x 8 8 plus ability connect next-generation wireless lte data connection despite 10 new android devices including flagships main smartphone competitor samsung capability apple new smartphones support lte advanced theoretical peak speed 500 megabits per second android models ability connect gigabit lte allowing theoretical speeds 1 gigabit per second doubling apple speed releasing iphone x japan china customers experienced issues related phone nfc trying access public transit smart card readers april 2018 apple released revision iphone x included vastly improved nfc chip solved problem nfc reader errors cases previously around 1 3 nfc attempts would fail initial reports issue also affected users america", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 162, + 166, + 214, + 228, + 252, + 269, + 270, + 337, + 345, + 356, + 359, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 972, + 1001, + 1100, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1384, + 1409, + 1488, + 1496, + 1503, + 1507, + 1544, + 1591 + ], + "mask": "Train" + }, + { + "node_id": 957, + "label": 2, + "text": "Xenix:xenix xenix discontinued version unix operating system various microcomputer platforms licensed microsoft corporation late 1970s santa cruz operation sco later acquired exclusive rights software eventually replaced sco unix known sco openserver mid-to-late 1980s xenix common unix variant measured according number machines installed microsoft chairman bill gates said 1996 long time microsoft highest-volume unix license bell labs developer unix part regulated bell system could sell unix directly end customers instead licensed software others microsoft expected unix would operating system future personal computers became powerful enough purchased license version 7 unix 1978 announced august 25 1980 would make available 16-bit microcomputer market microsoft able license unix name company gave original name microsoft called xenix universal operating environment sell xenix directly end users licensed software oems ibm intel management systems development tandy altos sco siemens sinix ported proprietary computer architectures 1981 microsoft said first version xenix close original unix version 7 source pdp-11 later versions incorporate fixes improvements company stated intended port operating system zilog z8000 series digital lsi-11 intel 8086 80286 motorola 68000 possibly numerous processors provide microsoft full line system software products including basic languages first port z8001 16-bit processor first customer ship january 1981 central data corporation illinois followed march 1981 paradyne corporation z8001 product first 8086 port altos computer systems non-pc-compatible 8600-series computers first customer ship date q1 1982 intel sold complete computers xenix intel system 86 brand specific models 86/330 86/380x also offered individual boards made computers isbc brand included processor boards like isbc 86/12 also mmu boards isbc 309 first intel xenix systems shipped july 1982 tandy doubled xenix installed base made trs-xenix default operating system trs-80 model 16 68000-based computer early 1983 largest unix vendor 1984 seattle computer products also made pc-incompatible 8086 computers bundled xenix like gazelle ii used s-100 bus available late 1983 early 1984 also port ibm system 9000 sco initially worked pdp-11 port v7 called dynix struck agreement microsoft joint development technology exchange xenix 1982 1984 port 68000-based apple lisa 2 jointly developed sco microsoft first shrink-wrapped binary product sold sco 1983 oem directory microsoft said difficulty porting various 8086 z8000-based machines lack standardized memory management unit protection facilities hardware manufacturers compensated designing hardware ensuing complexity made extremely difficult impossible small manufacturer develop computer capable supporting system xenix scratch xenix kernel must custom-tailored new hardware environment generally available port unmapped intel 8086/8088 architecture done santa cruz operation around 1983 sco xenix pc xt shipped sometime 1984 contained enhancement 4.2bsd also supported micnet local area networking later 286 version xenix leveraged integrated mmu present chip running 286 protected mode 286 xenix accompanied new hardware xenix oems example sperry pc/it ibm pc clone advertised capable supporting eight simultaneous dumb terminal users version xenix 2.0 still based version 7 unix version 3.0 upgraded unix system iii code base 1984 intel manual xenix 286 noted xenix kernel 10,000 lines time followed system v.2 codebase xenix 5.0 a.k.a xenix system v microsoft hopes xenix become preferred choice software production exchange company stated 1981 microsoft referred ms-dos single-user single-tasking operating system advised customers wanted multiuser multitasking support buy xenix planned time improve ms-dos would almost indistinguishable single-user xenix xedos would also run 68000 z8000 lsi-11 would upwardly compatible xenix byte 1983 described multi-user ms-dos future microsoft chris larson described ms-dos 2.0 xenix compatibility second important feature company advertised dos xenix together listing shared features single-user os multi-user multi-tasking unix-derived operating system promising easy porting started selling system v however breakup bell system microsoft believing could compete unix developer decided abandon xenix decision immediately transparent led term vaporware agreed ibm develop os/2 xenix team together best ms-dos developers assigned project 1987 microsoft transferred ownership xenix sco agreement left microsoft owning slightly less 20 sco amount prevented companies disclose exact amount event sco ipo microsoft eventually lost interest os/2 well company based high-end strategy windows nt 1987 sco ported xenix 386 processor 32-bit chip securing knowledge microsoft insiders microsoft longer developing xenix xenix system v release 2.3.1 introduced support i386 scsi tcp/ip sco xenix system v/386 first 32-bit operating system available market x86 cpu architecture microsoft continued use xenix internally submitting patch support functionality unix 1987 trickled code base xenix sco unix microsoft said used xenix sun workstations vax minicomputers extensively within company late 1988 internal microsoft email transport done xenix-based 68000 systems 1995\u20131996 company moved exchange server product sco released sco unix higher-end product based system v.3 offering number technical advances xenix xenix remained product line meantime sun microsystems completed merge xenix bsd sunos system v.3 system v release 4 last version sco xenix/386 system v.2.3.4 released 1991 aside unix base xenix incorporated elements bsd notably vi text editor supporting libraries termcap curses kernel featured original extensions microsoft notably file locking semaphores userland microsoft added visual shell menu-driven operation instead traditional unix shell limited form local networking serial lines rs-232 ports possible micnet software supported file transfer electronic mail although uucp still used networking via modems oems often added modifications xenix system trusted xenix variant initially developed ibm name secure xenix later versions trusted xenix name developed trusted information systems incorporated bell-lapadula model multilevel security multilevel secure interface stu-iii secure communications device stu-iii connection would made available applications running privilege level key loaded stu-iii evaluated formal methods achieved b2 security rating dod trusted computer system evaluation criteria\u2014the second highest rating ever achieved evaluated operating system version 2.0 released january 1991 version 3.0 april 1992 version 4.0 september 1993 still use late 1995", + "neighbors": [ + 63, + 85, + 106, + 134, + 166, + 185, + 195, + 254, + 322, + 377, + 380, + 443, + 475, + 477, + 491, + 595, + 622, + 754, + 901, + 941, + 954, + 961, + 1022, + 1049, + 1138, + 1188, + 1203, + 1287, + 1301, + 1304, + 1398, + 1415, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 958, + "label": 7, + "text": "WestGrid:westgrid westgrid government-funded infrastructure program started 2003 mainly western canada provides institutional research faculty students access high performance computing distributed data storage using combination grid networking collaboration tools westgrid one four partners within umbrella organization compute canada westgrid 14 partner institutions across four provinces british columbia alberta saskatchewan manitoba participating institutions include westgrid also works partnership province optical regional advanced network westgrid network partners include", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 959, + "label": 9, + "text": "Brendan_Eich:brendan eich brendan eich born july 4 1961 american technologist creator javascript programming language co-founded mozilla project mozilla foundation mozilla corporation served mozilla corporation chief technical officer briefly chief executive officer ceo brave software brendan eich grew palo alto attended ellwood p. cubberley high school graduated class 1979 eich received bachelor degree mathematics computer science santa clara university received master degree 1985 university illinois urbana-champaign eich started career silicon graphics working seven years operating system network code worked three years microunity systems engineering writing microkernel dsp code first mips r4000 port gcc started work netscape communications corporation april 1995 eich originally joined intending put scheme browser netscape superiors insisted language \u2019 syntax resemble java result language much functionality scheme object orientation self syntax java first version completed ten days order accommodate navigator 2.0 beta release schedule called mocha renamed livescript september 1995 later javascript month eich continued oversee development spidermonkey specific implementation javascript navigator early 1998 eich co-founded mozilla project jamie zawinski others creating mozilla.org website meant manage open-source contributions netscape source code served mozilla chief architect aol bought netscape 1999 aol shut netscape browser unit july 2003 eich helped spin mozilla foundation august 2005 serving lead technologist member board directors mozilla foundation eich became chief technical officer newly founded mozilla corporation meant mozilla foundation for-profit arm eich continued mozilla spidermonkey module javascript engine passed ownership 2011 march 24 2014 eich promoted ceo mozilla corporation gary kovacs john lilly ellen siminoff resigned mozilla board prior appointment anonymously expressing disagreements eich strategy desire ceo experience mobile industry employees mozilla foundation separate organization mozilla corporation tweeted calls resignation reference donation 1,000 california proposition 8 called banning same-sex marriage california eich stood decision fund campaign wrote blog sorry \u201c causing pain \u201d pledged promote equality mozilla activists created online campaign eich online dating site okcupid automatically displaying message firefox users information eich donation suggesting users switch different browser although giving link continue firefox others mozilla corporation spoke blogs favor board members wanted stay company different role april 3 2014 eich resigned ceo left mozilla personal blog posted present circumstances effective leader eich ceo brave software internet security company raised 2.5 million early funding angel investors january 20 2016 company released developer versions open-source brave web browser blocked ads trackers included micropayments system offer users choice viewing selected ads paying websites display brave software eich co-created basic attention token bat cryptocurrency designed use brave browser bat launched ico may 31 2017 raised 35 million", + "neighbors": [ + 7, + 14, + 36, + 50, + 69, + 81, + 83, + 107, + 132, + 176, + 258, + 427, + 509, + 593, + 632, + 686, + 713, + 869, + 872, + 886, + 1016, + 1120, + 1138, + 1146, + 1166, + 1210, + 1264, + 1280, + 1288, + 1302, + 1376, + 1421, + 1423, + 1430, + 1539, + 1566, + 1604 + ], + "mask": "Validation" + }, + { + "node_id": 960, + "label": 3, + "text": "Streaker_(video_game):streaker video game streaker arcade adventure game published mastertronic bulldog label 1987 game runs amstrad cpc msx sinclair zx spectrum hero game carlin naked man mugged stripped needs find clothes carlin town planet zuggi resembles town earth many ways locations including hotel cafe supermarket chemist shop streaker finds clothes able enter locations game fully dressed game arcade adventure somewhere puzzle-based adventure game action game gameplay controlled nested menu system mastertronic spellbound multitude items game many used seem purpose streaker pick keys open doors eat food items raise hunger levels needs solve number simple puzzles aspects life zuggi similar earth number fantastic elements world example streaker may teleport beam transfer using number different coloured beamers teleport streaker location corresponding beampad beampads moved streaker good way avoid thieves nice touches include streaker ability advance time acquiring stopwatch game played real time often need wait particular location open save load options appearing streaker picks tape recorder streaker quest made difficult presence number thieves steal streaker clothes contact cause lose life naked clothes may regained thieves finding offering thief item wants thieves follows despite rather unusual aim game seem prurient content therein 1980s young children occasionally unwittingly perplexed embarrassed teachers telling spent evening playing streaker", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 961, + "label": 2, + "text": "Microsoft_Windows:microsoft windows microsoft windows group several graphical operating system families developed marketed sold microsoft family caters certain sector computing industry active microsoft windows families include windows nt windows iot may encompass subfamilies e.g windows server windows embedded compact windows ce defunct microsoft windows families include windows 9x windows mobile windows phone microsoft introduced operating environment named windows november 20 1985 graphical operating system shell ms-dos response growing interest graphical user interfaces guis microsoft windows came dominate world personal computer pc market 90 market share overtaking mac os introduced 1984 apple came see windows unfair encroachment innovation gui development implemented products lisa macintosh eventually settled court microsoft favor 1993 pcs windows still popular operating system however 2014 microsoft admitted losing majority overall operating system market android massive growth sales android smartphones 2014 number windows devices sold less 25 android devices sold comparison however may fully relevant two operating systems traditionally target different platforms still numbers server use windows comparable competitors show one third market share similar end user use recent version windows pcs tablets smartphones embedded devices windows 10 recent version server computers windows server version 1903 specialized version windows also runs xbox one video game console microsoft developer windows registered several trademarks denote family windows operating systems target specific sector computing industry 2014 following windows families actively developed following windows families longer developed term windows collectively describes several generations microsoft operating system products products generally categorized follows history windows dates back 1981 microsoft started work program called interface manager announced november 1983 apple lisa macintosh name windows windows 1.0 released november 1985 windows 1.0 compete apple operating system achieved little popularity windows 1.0 complete operating system rather extends ms-dos shell windows 1.0 program known ms-dos executive components included calculator calendar cardfile clipboard viewer clock control panel notepad paint reversi terminal write windows 1.0 allow overlapping windows instead windows tiled modal dialog boxes may appear windows microsoft sold included windows development libraries c development environment included numerous windows samples windows 2.0 released december 1987 popular predecessor features several improvements user interface memory management windows 2.03 changed os tiled windows overlapping windows result change led apple computer filing suit microsoft alleging infringement apple copyrights windows 2.0 also introduced sophisticated keyboard shortcuts could make use expanded memory windows 2.1 released two different versions windows/286 windows/386 windows/386 uses virtual 8086 mode intel 80386 multitask several dos programs paged memory model emulate expanded memory using available extended memory windows/286 spite name runs intel 8086 intel 80286 processors runs real mode make use high memory area addition full windows-packages runtime-only versions shipped early windows software third parties made possible run windows software ms-dos without full windows feature set early versions windows often thought graphical shells mostly ran top ms-dos use file system services however even earliest windows versions already assumed many typical operating system functions notably executable file format providing device drivers timer graphics printer mouse keyboard sound unlike ms-dos windows allowed users execute multiple graphical applications time cooperative multitasking windows implemented elaborate segment-based software virtual memory scheme allows run applications larger available memory code segments resources swapped thrown away memory became scarce data segments moved memory given application relinquished processor control windows 3.0 released 1990 improved design mostly virtual memory loadable virtual device drivers vxds allow windows share arbitrary devices multi-tasked dos applications windows 3.0 applications run protected mode gives access several megabytes memory without obligation participate software virtual memory scheme run inside address space segmented memory provides degree protection windows 3.0 also featured improvements user interface microsoft rewrote critical operations c assembly windows 3.0 first microsoft windows version achieve broad commercial success selling 2 million copies first six months windows 3.1 made generally available march 1 1992 featured facelift august 1993 windows workgroups special version integrated peer-to-peer networking features version number 3.11 released sold along windows 3.1 support windows 3.1 ended december 31 2001 windows 3.2 released 1994 updated version chinese version windows 3.1 update limited language version fixed issues related complex writing system chinese language windows 3.2 generally sold computer manufacturers ten-disk version ms-dos also simplified chinese characters basic output translated utilities next major consumer-oriented release windows windows 95 released august 24 1995 still remaining ms-dos-based windows 95 introduced support native 32-bit applications plug play hardware preemptive multitasking long file names 255 characters provided increased stability predecessors windows 95 also introduced redesigned object oriented user interface replacing previous program manager start menu taskbar windows explorer shell windows 95 major commercial success microsoft ina fried cnet remarked time windows 95 finally ushered market 2001 become fixture computer desktops around world microsoft published four oem service releases osr windows 95 roughly equivalent service pack first osr windows 95 also first version windows bundled microsoft web browser internet explorer mainstream support windows 95 ended december 31 2000 extended support windows 95 ended december 31 2001 windows 95 followed release windows 98 june 25 1998 introduced windows driver model support usb composite devices support acpi hibernation support multi-monitor configurations windows 98 also included integration internet explorer 4 active desktop aspects windows desktop update series enhancements explorer shell also made available windows 95 may 1999 microsoft released windows 98 second edition updated version windows 98 windows 98 se added internet explorer 5.0 windows media player 6.2 amongst upgrades mainstream support windows 98 ended june 30 2002 extended support windows 98 ended july 11 2006 september 14 2000 microsoft released windows millennium edition last dos-based version windows windows incorporated visual interface enhancements windows nt-based counterpart windows 2000 faster boot times previous versions however required removal ability access real mode dos environment removing compatibility older programs expanded multimedia functionality including windows media player 7 windows movie maker windows image acquisition framework retrieving images scanners digital cameras additional system utilities system file protection system restore updated home networking tools however windows faced criticism speed instability along hardware compatibility issues removal real mode dos support pc world considered windows one worst operating systems microsoft ever released 4th worst tech product time november 1988 new development team within microsoft included former digital equipment corporation developers dave cutler mark lucovsky began work revamped version ibm microsoft os/2 operating system known nt os/2 nt os/2 intended secure multi-user operating system posix compatibility modular portable kernel preemptive multitasking support multiple processor architectures however following successful release windows 3.0 nt development team decided rework project use extended 32-bit port windows api known win32 instead os/2 win32 maintained similar structure windows apis allowing existing windows applications easily ported platform also supported capabilities existing nt kernel following approval microsoft staff development continued windows nt first 32-bit version windows however ibm objected changes ultimately continued os/2 development first release resulting operating system windows nt 3.1 named associate windows 3.1 released july 1993 versions desktop workstations servers windows nt 3.5 released september 1994 focusing performance improvements support novell netware followed windows nt 3.51 may 1995 included additional improvements support powerpc architecture windows nt 4.0 released june 1996 introducing redesigned interface windows 95 nt series february 17 2000 microsoft released windows 2000 successor nt 4.0 windows nt name dropped point order put greater focus windows brand next major version windows nt windows xp released october 25 2001 introduction windows xp aimed unify consumer-oriented windows 9x series architecture introduced windows nt change microsoft promised would provide better performance dos-based predecessors windows xp would also introduce redesigned user interface including updated start menu task-oriented windows explorer streamlined multimedia networking features internet explorer 6 integration microsoft .net passport services modes help provide compatibility software designed previous versions windows remote assistance functionality retail windows xp marketed two main editions home edition targeted towards consumers professional edition targeted towards business environments power users included additional security networking features home professional later accompanied media center edition designed home theater pcs emphasis support dvd playback tv tuner cards dvr functionality remote controls tablet pc edition designed mobile devices meeting specifications tablet computer support stylus pen input additional pen-enabled applications mainstream support windows xp ended april 14 2009 extended support ended april 8 2014 windows 2000 microsoft also changed release schedules server operating systems server counterpart windows xp windows server 2003 released april 2003 followed december 2005 windows server 2003 r2 lengthy development process windows vista released november 30 2006 volume licensing january 30 2007 consumers contained number new features redesigned shell user interface significant technical changes particular focus security features available number different editions subject criticism drop performance longer boot time criticism new uac stricter license agreement vista server counterpart windows server 2008 released early 2008 july 22 2009 windows 7 windows server 2008 r2 released rtm release manufacturing former released public 3 months later october 22 2009 unlike predecessor windows vista introduced large number new features windows 7 intended focused incremental upgrade windows line goal compatible applications hardware windows vista already compatible windows 7 multi-touch support redesigned windows shell updated taskbar home networking system called homegroup performance improvements windows 8 successor windows 7 released generally october 26 2012 number significant changes made windows 8 including introduction user interface based around microsoft metro design language optimizations touch-based devices tablets all-in-one pcs changes include start screen uses large tiles convenient touch interactions allow display continually updated information new class apps designed primarily use touch-based devices changes include increased integration cloud services online platforms social networks microsoft onedrive formerly skydrive xbox live services windows store service software distribution new variant known windows rt use devices utilize arm architecture update windows 8 called windows 8.1 released october 17 2013 includes features new live tile sizes deeper onedrive integration many revisions windows 8 windows 8.1 subject criticism removal start menu september 30 2014 microsoft announced windows 10 successor windows 8.1 released july 29 2015 addresses shortcomings user interface first introduced windows 8 changes pc include return start menu virtual desktop system ability run windows store apps within windows desktop rather full-screen mode windows 10 said available update qualified windows 7 sp1 windows 8.1 windows phone 8.1 devices get windows 10 application windows 7 windows 8.1 windows update windows 7 february 2017 microsoft announced migration windows source code repository perforce git migration involved 3.5 million separate files 300 gigabyte repository may 2017 90 percent engineering team uses git 8500 commits 1760 windows builds per day multilingual support built windows since windows 3 language keyboard interface changed region language control panel components supported input languages input method editors automatically installed windows installation windows xp earlier files east asian languages chinese right-to-left scripts arabic may need installed separately also said control panel third-party imes may also installed user feels provided one insufficient needs interface languages operating system free download languages limited certain editions windows language interface packs lips redistributable may downloaded microsoft download center installed edition windows xp later translate windows interface require certain base language language windows originally shipped used languages emerging markets full language packs translates complete operating system available specific editions windows ultimate enterprise editions windows vista 7 editions windows 8 8.1 rt except single language require specific base language commonly used popular languages french chinese languages downloaded download center available optional updates windows update service except windows 8 interface language installed applications affected changes windows interface language availability languages depends application developers windows 8 windows server 2012 introduces new language control panel interface input languages simultaneously changed language packs regardless type downloaded central location pc settings app windows 8.1 windows server 2012 r2 also includes counterpart settings page changing interface language also changes language preinstalled windows store apps mail maps news certain microsoft-developed apps remote desktop limitations language packs however still effect except full language packs installed edition except single language caters emerging markets windows nt included support several different platforms x86-based personal computer became dominant professional world windows nt 4.0 predecessors supported powerpc dec alpha mips r4000 although platforms implement 64-bit computing operating system treated 32-bit however windows 2000 successor windows nt 4.0 dropped support platforms except third generation x86 known ia-32 newer 32-bit mode client line windows nt family still runs ia-32 although windows server line ceased supporting platform release windows server 2008 r2 introduction intel itanium architecture ia-64 microsoft released new versions windows support itanium versions windows xp windows server 2003 released time mainstream x86 counterparts windows xp 64-bit edition released 2005 last windows client operating systems support itanium windows server line continues support platform windows server 2012 windows server 2008 r2 last windows operating system support itanium architecture april 25 2005 microsoft released windows xp professional x64 edition windows server 2003 x64 editions support x86-64 simply x64 eighth generation x86 architecture windows vista first client version windows nt released simultaneously ia-32 x64 editions x64 still supported edition windows 8 known windows rt specifically created computers arm architecture arm still used windows smartphones windows 10 tablets windows rt updated starting windows 10 fall creators update later includes support pcs arm architecture windows ce officially known windows embedded compact edition windows runs minimalistic computers like satellite navigation systems mobile phones windows embedded compact based dedicated kernel dubbed windows ce kernel microsoft licenses windows ce oems device makers oems device makers modify create user interfaces experiences windows ce provides technical foundation windows ce used dreamcast along sega proprietary os console windows ce core windows mobile derived successor windows phone 7 based components windows ce 6.0 r3 windows ce 7.0 windows phone 8 however based nt-kernel windows 8 windows embedded compact confused windows xp embedded windows nt 4.0 embedded modular editions windows based windows nt kernel xbox os unofficial name given version windows runs xbox one specific implementation emphasis virtualization using hyper-v three operating systems running consisting core operating system second implemented games windows-like environment applications microsoft updates xbox one os every month updates downloaded xbox live service xbox subsequently installed using offline recovery images downloaded via pc windows 10-based core replaced windows 8-based one update new system sometimes referred windows 10 xbox one onecore xbox one system also allows backward compatibility xbox 360 xbox 360 system backwards compatible original xbox 2017 microsoft announced would start using git open source version control system created linus torvalds microsoft previously used proprietary version control system called source depot microsoft began integrate git team foundation server 2013 windows continued rely source depot however decision came complexity windows codebase especially well suited decentralized nature linux development git originally created manage git repository contains complete history files proved unworkable windows developers cloning repository takes several hours microsoft working new project called virtual file system git vfsforgit address challenges according net applications tracks use operating systems devices active web windows used operating-system family personal computers july 2017 close 90 usage share including personal computers kinds e.g. desktops laptops mobile devices windows oses accounted 35.24 usage share july 2017 compared android highest 41.24 ios 13.22 macos 4.64 according statcounter tracks use operating systems use devices active web windows used less half market developing countries also developed ones\u2014such united states use windows desktops plurality operating system fallen 46.18 united kingdom ireland numbers easiest monthly numbers find track real use may mirror installed base sales numbers recent years devices consistent server numbers next section terms number devices shipped operating system installed smartphones windows phone third-most-shipped os 2.6 android 82.8 ios 13.9 second quarter 2015 according idc across pcs mobile devices 2014 windows oses second-most-shipped 333 million devices 14 android 1.2 billion 49 ahead ios macos combined 263 million 11 use latest version windows 10 exceeded windows 7 globally since early 2018 developed countries japan australia us windows 10 already popular version since early 2017 usage share windows serversthose running web servers also kinds servers 33.6 consumer versions windows originally designed ease-of-use single-user pc without network connection security features built outset however windows nt successors designed security including network multi-user pcs initially designed internet security mind much since first developed early 1990s internet use less prevalent design issues combined programming errors e.g buffer overflows popularity windows means frequent target computer worm virus writers june 2005 bruce schneier counterpane internet security reported seen 1,000 new viruses worms previous six months 2005 kaspersky lab found around 11,000 malicious programs\u2014viruses trojans back-doors exploits written windows microsoft releases security patches windows update service approximately month usually second tuesday month although critical updates made available shorter intervals necessary versions windows including windows 2000 sp3 windows xp updates automatically downloaded installed user selects result service pack 2 windows xp well service pack 1 windows server 2003 installed users quickly otherwise might windows 9x series offered option profiles multiple users concept access privileges allow concurrent access true multi-user operating systems addition implemented partial memory protection accordingly widely criticised lack security windows nt series operating systems contrast true multi-user implement absolute memory protection however lot advantages true multi-user operating system nullified fact prior windows vista first user account created setup process administrator account also default new accounts though windows xp limited accounts majority home users change account type fewer rights \u2013 partially due number programs unnecessarily required administrator rights \u2013 home users ran administrator time windows vista changes introducing privilege elevation system called user account control logging standard user logon session created token containing basic privileges assigned way new logon session incapable making changes would affect entire system logging user administrators group two separate tokens assigned first token contains privileges typically awarded administrator second restricted token similar standard user would receive user applications including windows shell started restricted token resulting reduced privilege environment even administrator account application requests higher privileges run administrator clicked uac prompt confirmation consent given including administrator credentials account requesting elevation member administrators group start process using unrestricted token leaked documents published wikileaks codenamed vault 7 dated 2013\u20132016 detail capabilities cia perform electronic surveillance cyber warfare ability compromise operating systems microsoft windows august 2019 computer experts reported bluekeep security vulnerability potentially affects older unpatched microsoft windows versions via program remote desktop protocol allowing possibility remote code execution may include related flaws collectively named dejablue affecting newer windows versions i.e. windows 7 recent versions well addition experts reported microsoft security vulnerability based legacy code involving microsoft ctf ctfmon ctfmon.exe affects windows versions older windows xp version recent windows 10 versions patch correct flaw currently available windows versions windows nt 3 based file system permission system referred agdlp accounts global local permissions file permissions applied file/folder form 'local group 'global groups members global groups hold groups users depending different windows versions used system varies vendor products linux netware due 'static allocation permission applied directory file folder however using process aglp/agdlp/agudlp allows small number static permissions applied allows easy changes account groups without reapplying file permissions files folders january 6 2005 microsoft released beta version microsoft antispyware based upon previously released giant antispyware february 14 2006 microsoft antispyware became windows defender release beta 2 windows defender freeware program designed protect spyware unwanted software windows xp windows server 2003 users genuine copies microsoft windows freely download program microsoft web site windows defender ships part windows vista 7 windows 8 windows defender microsoft security essentials combined single program named windows defender based microsoft security essentials borrowing features user interface although enabled default turned use another anti-virus solution windows malicious software removal tool optional microsoft safety scanner two free security products offered microsoft windows 10 anniversary update microsoft introduced limited periodic scanning feature allows windows defender scan detect remove threats third-party anti-virus software missed advanced threat protection service introduced enterprise users new service uses cloud service detect take actions advanced network attacks article based report symantec internetnews.com described microsoft windows fewest number patches shortest average patch development time five operating systems monitored last six months 2006 study conducted kevin mitnick marketing communications firm avantgarde 2004 found unprotected unpatched windows xp system service pack 1 lasted four minutes internet compromised unprotected also unpatched windows server 2003 system compromised connected internet 8 hours computer running windows xp service pack 2 compromised aol national cyber security alliance online safety study october 2004 determined 80 windows users infected least one spyware/adware product much documentation available describing increase security microsoft windows products typical suggestions include deploying microsoft windows behind hardware software firewall running anti-virus anti-spyware software installing patches become available windows update owing operating system popularity number applications released aim provide compatibility windows applications either compatibility layer another operating system standalone system run software written windows box include", + "neighbors": [ + 1, + 9, + 11, + 22, + 25, + 26, + 28, + 33, + 36, + 37, + 42, + 43, + 55, + 58, + 64, + 66, + 78, + 79, + 83, + 85, + 91, + 93, + 94, + 95, + 99, + 107, + 108, + 111, + 134, + 137, + 138, + 142, + 148, + 150, + 153, + 160, + 162, + 165, + 170, + 171, + 175, + 176, + 185, + 186, + 187, + 189, + 198, + 203, + 207, + 221, + 225, + 233, + 234, + 242, + 252, + 255, + 258, + 260, + 262, + 265, + 267, + 268, + 275, + 278, + 295, + 299, + 301, + 306, + 308, + 312, + 313, + 322, + 326, + 329, + 332, + 336, + 337, + 344, + 345, + 353, + 355, + 360, + 363, + 364, + 365, + 373, + 377, + 380, + 387, + 390, + 392, + 396, + 399, + 405, + 412, + 413, + 414, + 416, + 427, + 433, + 434, + 435, + 446, + 447, + 448, + 457, + 465, + 468, + 469, + 472, + 476, + 477, + 485, + 487, + 494, + 500, + 507, + 509, + 521, + 533, + 550, + 551, + 558, + 566, + 569, + 572, + 574, + 583, + 593, + 598, + 611, + 613, + 615, + 622, + 623, + 631, + 638, + 639, + 646, + 647, + 648, + 650, + 653, + 656, + 662, + 664, + 666, + 668, + 675, + 679, + 685, + 686, + 689, + 690, + 697, + 705, + 708, + 712, + 713, + 716, + 717, + 720, + 721, + 728, + 743, + 754, + 758, + 764, + 766, + 770, + 776, + 779, + 780, + 787, + 791, + 796, + 797, + 800, + 801, + 805, + 806, + 815, + 816, + 818, + 824, + 825, + 839, + 860, + 862, + 865, + 868, + 872, + 877, + 884, + 886, + 891, + 897, + 899, + 902, + 904, + 910, + 916, + 920, + 922, + 923, + 925, + 927, + 929, + 934, + 938, + 939, + 941, + 944, + 948, + 954, + 957, + 962, + 966, + 985, + 987, + 989, + 996, + 998, + 1002, + 1003, + 1011, + 1012, + 1016, + 1024, + 1025, + 1027, + 1028, + 1033, + 1034, + 1035, + 1037, + 1040, + 1043, + 1045, + 1049, + 1050, + 1053, + 1054, + 1056, + 1059, + 1063, + 1064, + 1068, + 1084, + 1089, + 1090, + 1092, + 1097, + 1098, + 1101, + 1103, + 1109, + 1110, + 1114, + 1120, + 1130, + 1132, + 1138, + 1139, + 1140, + 1149, + 1151, + 1152, + 1155, + 1157, + 1166, + 1179, + 1180, + 1187, + 1188, + 1189, + 1190, + 1193, + 1202, + 1203, + 1204, + 1208, + 1210, + 1212, + 1214, + 1216, + 1217, + 1221, + 1224, + 1225, + 1227, + 1228, + 1232, + 1234, + 1235, + 1243, + 1247, + 1250, + 1251, + 1254, + 1257, + 1261, + 1270, + 1274, + 1279, + 1287, + 1288, + 1292, + 1296, + 1298, + 1301, + 1304, + 1311, + 1321, + 1327, + 1328, + 1330, + 1331, + 1338, + 1342, + 1346, + 1348, + 1358, + 1363, + 1366, + 1368, + 1370, + 1373, + 1376, + 1379, + 1381, + 1385, + 1390, + 1391, + 1393, + 1394, + 1398, + 1400, + 1403, + 1406, + 1415, + 1417, + 1421, + 1427, + 1428, + 1436, + 1441, + 1452, + 1453, + 1456, + 1461, + 1462, + 1470, + 1474, + 1492, + 1494, + 1502, + 1503, + 1513, + 1514, + 1517, + 1528, + 1530, + 1531, + 1533, + 1535, + 1536, + 1538, + 1543, + 1545, + 1546, + 1547, + 1550, + 1553, + 1555, + 1556, + 1558, + 1561, + 1566, + 1568, + 1570, + 1573, + 1578, + 1582, + 1587, + 1588, + 1592, + 1604, + 1609, + 1610, + 1613, + 1616, + 1620, + 1621, + 1627, + 1631, + 1634, + 1637 + ], + "mask": "Train" + }, + { + "node_id": 962, + "label": 4, + "text": "Google_App_Runtime_for_Chrome:google app runtime chrome android runtime chrome arc discontinued compatibility layer sandboxing technology running android applications desktop laptop computers isolated environment allowed applications safely run web browser independent user operating system near-native speeds since discontinued google developed another method run android apps chrome os devices android runtime chrome partially open-sourced project development google announced sundar pichai google i/o 2014 developer conference limited beta consumer release september 2014 duolingo evernote sight words vine android applications made available chrome web store installation chromebook devices running os version 37 higher development google taking place behind closed doors individual repository commits code reviews issue tracking kept internal company open sourced parts arc licensed bsd-style license limited beta consumer release september 2014 duolingo evernote sight words vine android applications made available chrome web store installation chromebook devices running os version 37 higher october 2014 three apps added cloudmagic onefootball podcast addict march 2015 anandtech reported vlc media player added coming months april 1 2015 google released arc welder chrome packaged app providing arc runtime application packager intended give android developers preview upcoming technology chance test android apps chrome platform arc builds upon google native client native client platform extended posix-compatible layer top nacl integrated runtime pepper apis emulate linux environment foundation android phone allows running almost unchanged dalvik vm sandboxed environment arc uses chrome permission system android one according security evaluation meng xu arc apps may communicate installed chrome extensions files stored underlying operating system might open avenues various attacks threats mitigated heavily sandboxed environment arc second half 2014 developer tools documentation released google several community efforts arc appeared vlad filippov maintains archon unofficial distribution arc runtime installed non-chromebook computers developer also maintains javascript nodejs tool automate packaging android apps use arc developers created user-friendly tools beyond chromeos-apk simplify packaging applications arcon runtime first chrome packaged app called twerk android application arcon packager used named chrome apk packager name changed google request active reddit community maintains list android apps work arcon runtime vlad filippov published guide run opera mini inside chromium browser reception mostly positive developers expressed confusion wide scale competing development platforms google offers web apps chrome packaged apps android apps delivered arc google responded fully committed platforms encourage developers choose one fits best", + "neighbors": [ + 24, + 134, + 176, + 182, + 216, + 306, + 480, + 509, + 547, + 553, + 559, + 671, + 704, + 777, + 796, + 837, + 936, + 961, + 1082, + 1138, + 1259, + 1265, + 1318, + 1371, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 963, + "label": 4, + "text": "SAML_1.1:saml 1.1 security assertion markup language saml xml standard exchanging authentication authorization data security domains saml product oasis organization security services technical committee saml 1.1 ratified oasis standard september 2003 critical aspects saml 1.1 covered detail official documents samlcore samlbind new saml probably read introductory saml topic first samloverview document oasis prior saml 1.1 saml 1.0 adopted oasis standard november 2002 saml undergone one minor v1.1 one major revision v2.0 since v1.0 relatively simple protocol saml 1.0 historical interest however since us federal e-authentication initiative adopted saml 1.0 core technology versions 1.0 1.1 saml similar see samldiff specific differences two standards article concentrates saml 1.1 since important standard upon many standards implementations depend warning implementers deployers note well code examples article non-normative illustration purposes consult oasis saml specifications normative requirements saml assertions contain statements service providers use make access control decisions instance authentication statements assert service provider principal indeed authenticate identity provider particular time using particular method authentication information principal may disclosed authentication statement authentication statement example e-mail address principal asserted service provider e-mail address example suffice large number situations cases however additional information needed service provider make access control decision example suppose students allowed access scholarships data attribute statement indicate whether principal affiliation student service provider uses allow deny access resp scholarships application attributes often obtained ldap directory consistent representations attributes across security domains crucial example showing student might obtain access scholarships application service provider functioning policy enforcement point policy decision point situations may preferable associate policy decision point identity provider case service provider passes uri identity provider asserts authorization decision statement dictates whether principal allowed access secured resource given uri three statement types mutually exclusive example authentication statements attribute statements may included single assertion shown precludes need make subsequent round trips service provider identity provider saml protocol simple request-response protocol saml requester sends saml codice_1 element responder similarly saml responder returns saml codice_2 element requester bindings profiles needed affect message exchange detailed following sections saml 1.1 formally defines one protocol binding saml soap binding compatible saml 1.1 implementation must implement saml soap http synchronous protocol binding transport mechanisms besides http permitted provided protocol-independent aspects saml soap binding observed see section 3.1.2 samlbind saml 1.1 soap binding built top version 1.1 soap numbering purely coincidental saml requester wraps saml codice_1 element within body soap message similarly saml responder returns saml codice_2 element within body returned soap message error responder returns soap fault code instead saml markup must included soap body saml 1.1 define saml-specific soap headers requester free insert soap headers wishes although none required recall soap 1.1 codice_5 http header must included http request although value may empty saml requester may give following value codice_5 header saml responder must depend value however secure connection required saml requests responses situations message integrity confidentiality required http ssl 3.0 tls 1.0 server-side certificate required saml responder may return 403 forbidden response refuses respond saml requester responder must return 500 internal server error response event soap error soap fault element must included well otherwise 200 ok response returned even presence saml processing error response include saml codice_7 element soap body general profiles describe use cases message exchanges required ultimately transfer assertions identity provider service provider saml 1.1 specifies two web browser sso profiles browser/post profile relies push operation passes sso assertion value browser using http post say identity provider pushes assertion service provider browser/artifact profile employs pull mechanism profile essentially passes sso assertion identity provider service provider reference browser using http redirect subsequently dereferenced via back-channel exchange i.e. service provider pulls assertion identity provider using saml soap http profiles support cross-domain single sign-on sso specification define additional profiles particular saml 1.1 support profile secure web service message support single logout profile saml 1.1 profiles begin inter-site transfer service managed identity provider principal arrives transfer service first place dictated specification see sections 4.1 4.2 samloverview possible scenarios practice client accessing secured resource service provider redirected inter-site transfer service identity provider precise sequence steps needed accomplish outlined saml 1.1 see section 4.3 samloverview rough ideas along lines scenario thoroughly addressed saml 2.0 visiting inter-site transfer service principal transferred assertion consumer service service provider exactly principal transferred inter-site transfer service assertion consumer service depends profile used case browser/artifact profile redirect used case browser/post profile client issues post request without user intervention expedite processing assertion consumer service two separate urls specified endpoint locations may recorded metadata files exactly identity provider obtains trusted metadata file otherwise determines trusted endpoint locations particular service provider scope respect saml 1.1 note conforming saml 1.1 identity provider must provide inter-site transfer service similarly saml 1.1 service provider must provide assertion consumer service saml 1.1 browser/post profile specifies following four 4 steps terminology used original specification modified slightly conform saml 2.0 specification message flow begins request directed idp principal via http user agent requests inter-site transfer service identity provider codice_8 desired resource service provider say nowiki https //sp.example.com/home /nowiki words following get request issued user agent ssl/tls profile specify url transfer service codice_9 parameter obtained user agent inter-site transfer service returns html document containing codice_10 element codice_9 parameter preserved step 1 value codice_12 parameter base64 encoding saml codice_2 element following saml response must digitally signed identity provider important assumed principal already established security context identity provider otherwise inter-site transfer service would unable provide authentication statement saml codice_2 element user agent requests assertion consumer service service provider values codice_9 codice_12 parameters taken html form step 2 note automate submission form following line javascript may appear anywhere page assumes course page contains single codice_10 element codice_18 assertion consumer service consumes saml codice_2 element creates security context service provider redirects user agent target resource saml 1.1 browser/artifact profile specifies following six 6 steps terminology used original specification modified slightly conform saml 2.0 specification message flow begins request directed idp principal via http user agent requests inter-site transfer service identity provider codice_8 desired resource service provider say nowiki https //sp.example.com/home /nowiki words following get request issued user agent ssl/tls profile specify url transfer service codice_9 parameter obtained user agent principal redirected assertion consumer service service provider following response returned user agent codice_22 reference assertion identity provider willing provide upon request important assumed principal already established security context identity provider otherwise inter-site transfer service would unable provide authentication statement user agent requests assertion consumer service service provider codice_8 codice_22 words following get request issued user agent ssl/tls assertion consumer service service provider begins back-channel exchange artifact resolution service identity provider saml soap message bound http post request codice_22 previously sent identity provider service provider steps 2 3 identity provider completes back-channel exchange responding saml assertion bound saml soap message case authentication statement includes codice_26 containing principal e-mail address assertion consumer service parses saml codice_2 element creates security context service provider redirects user agent target resource", + "neighbors": [ + 762, + 964, + 1039, + 1470 + ], + "mask": "Test" + }, + { + "node_id": 964, + "label": 4, + "text": "SAML_2.0:saml 2.0 security assertion markup language 2.0 saml 2.0 version saml standard exchanging authentication authorization data security domains saml 2.0 xml-based protocol uses security tokens containing assertions pass information principal usually end user saml authority named identity provider saml consumer named service provider saml 2.0 enables web-based cross-domain single sign-on sso helps reduce administrative overhead distributing multiple authentication tokens user saml 2.0 ratified oasis standard march 2005 replacing saml 1.1 critical aspects saml 2.0 covered detail official documents samlcore samlbind samlprof samlmeta 30 individuals 24 companies organizations involved creation saml 2.0 particular special note liberty alliance donated identity federation framework id-ff specification oasis became basis saml 2.0 specification thus saml 2.0 represents convergence saml 1.1 liberty id-ff 1.2 shibboleth 1.3 assertion package information supplies zero statements made saml authority saml assertions usually made subject represented codice_1 element saml 2.0 specification defines three different kinds assertion statements created saml authority saml-defined statements associated subject three kinds statements defined follows important type saml assertion so-called bearer assertion used facilitate web browser sso example short-lived bearer assertion issued identity provider nowiki https //idp.example.org/saml2 /nowiki service provider nowiki https //sp.example.com/saml2 /nowiki assertion includes authentication assertion codice_2 attribute assertion codice_3 presumably service provider uses make access control decision prefix codice_4 represents saml v2.0 assertion namespace note example codice_5 element contains following child elements words assertion encodes following information assertion b07b804c-7c29-ea16-7300-4f3d6f7928ac issued time 2004-12-05t09:22:05z identity provider nowiki https //idp.example.org/saml2 /nowiki regarding subject 3f7b3dcf-1674-4ecd-92c8-1544f346baf8 exclusively service provider nowiki https //sp.example.com/saml2 /nowiki authentication statement particular asserts following principal identified codice_9 element authenticated time 2004-12-05t09:22:00z means password sent protected channel likewise attribute statement asserts principal identified codice_9 element staff member institution following protocols specified samlcore important protocols\u2014the authentication request protocol\u2014is discussed detail saml 1.1 web browser sso profiles idp-initiated unsolicited codice_15 element transmitted identity provider service provider via browser prefix codice_16 denotes saml protocol namespace saml 2.0 however flow begins service provider issues explicit authentication request identity provider resulting authentication request protocol significant new feature saml 2.0 principal entity acting principal behalf wishes obtain assertion containing authentication statement codice_17 element transmitted identity provider codice_17 element implicitly requests assertion containing authentication statement evidently issued service provider nowiki https //sp.example.com/saml2 /nowiki subsequently presented identity provider via browser identity provider authenticates principal necessary issues authentication response transmitted back service provider via browser saml message transmitted one entity another either value reference reference saml message called artifact receiver artifact resolves reference sending codice_19 request directly issuer artifact responds actual message referenced artifact suppose example identity provider sends following codice_19 request directly service provider via back channel response service provider returns saml element referenced enclosed artifact protocol forms basis http artifact binding bindings supported saml 2.0 outlined bindings specification samlbind web browser sso http redirect binding http post binding commonly used example service provider may use http redirect send request identity provider uses http post transmit response example illustrates entity choice binding independent partner choice binding saml protocol messages carried directly url query string http get request since length urls limited practice http redirect binding suitable short messages codice_17 message longer messages e.g containing signed encrypted saml assertions saml responses usually transmitted via bindings http post binding saml requests responses transmitted via http redirect codice_22 codice_23 query string parameter respectively sent message deflated without header checksum base64-encoded url-encoded order upon receipt process reversed recover original message example encoding codice_17 message yields message formatted readability may signed additional security practice data contained codice_17 codice_26 contains sp id codice_27 agreed idp sp beforehand via manual information exchange via saml metadata case signing request security constraint codice_17 contains information known idp beforehand assertion consumer service url signing request recommended security purposes following example service provider identity provider use http post binding initially service provider responds request user agent document containing xhtml form value codice_22 parameter base64-encoding codice_17 element transmitted identity provider via browser sso service identity provider validates request responds document containing another xhtml form value codice_23 parameter base64 encoding codice_15 element likewise transmitted service provider via browser automate submission form following line javascript may appear anywhere xhtml page assumes course first form element page contains samlresponse containing codice_33 element codice_34 http artifact binding uses artifact resolution protocol saml soap binding http resolve saml message reference consider following specific example suppose service provider wants send codice_17 message identity provider initially service provider transmits artifact identity provider via http redirect next identity provider sends codice_19 request artifactresolverequest shown earlier directly service provider via back channel finally service provider returns codice_37 element containing referenced codice_17 message course flow go direction well identity provider may issue artifact fact common see example double artifact profile example later topic general saml 2.0 artifact defined follows samlbind thus saml 2.0 artifact consists three components two-byte codice_39 two-byte codice_40 arbitrary sequence bytes called codice_41 three pieces information concatenated base64-encoded yield complete artifact codice_39 uniquely identifies artifact format saml 2.0 predefines one artifact type 0x0004 codice_40 reference particular artifact resolution endpoint managed artifact issuer may either idp sp mentioned earlier codice_41 determined type definition meat artifact format type 0x0004 artifact defined follows thus type 0x0004 artifact size 44 bytes unencoded codice_45 arbitrary sequence bytes although practice codice_45 sha-1 hash issuer entityid codice_47 random sequence bytes references saml message artifact issuer willing produce on-demand example consider hex-encoded type 0x0004 artifact look closely see codice_39 0x0004 codice_40 0x0000 front artifact next 20 bytes sha-1 hash issuer entityid nowiki https //idp.example.org/saml2 /nowiki followed 20 random bytes base64-encoding 44 bytes see artifactresolverequest example saml 2.0 saml 1.1 primary use case still web browser sso scope saml 2.0 broader previous versions saml suggested following exhaustive list profiles although number supported profiles quite large profiles specification samlprof simplified since binding aspects profile factored separate bindings specification samlbind saml 2.0 specifies web browser sso profile involving identity provider idp service provider sp principal wielding http user agent service provider four bindings choose identity provider three leads twelve 12 possible deployment scenarios outline three deployment scenarios one common scenarios service provider sends saml request idp sso service using http-redirect binding identity provider returns saml response sp assertion consumer service using http-post binding message flow begins request secured resource service provider 1 request target resource sp principal via http user agent requests target resource service provider service provider performs security check behalf target resource valid security context service provider already exists skip steps 2\u20137 service provider may use kind mechanism discover identity provider used e.g. ask user use preconfigured idp etc 2 redirect idp sso service service provider generates appropriate samlrequest relaystate redirects browser idp sso service using standard http 302 redirect codice_50 token opaque reference state information maintained service provider value codice_22 parameter deflated base64-encoded url-encoded value codice_17 element samlrequest may signed using sp signing key typically however necessary 3 request sso service idp user agent issues get request sso service identity provider values codice_22 codice_50 parameters provided redirect sso service identity provider processes codice_17 element url-decoding base64-decoding inflating request order performs security check user valid security context identity provider identifies user mechanism details omitted 4 respond xhtml form sso service validates request responds document containing xhtml form value codice_50 parameter preserved step 3 value codice_23 parameter base64 encoding following codice_15 element 5 request assertion consumer service sp user agent issues post request assertion consumer service service provider values codice_23 codice_50 parameters taken xhtml form step 4 6 redirect target resource assertion consumer service processes response creates security context service provider redirects user agent target resource 7 request target resource sp user agent requests target resource service provider 8 respond requested resource since security context exists service provider returns resource user agent relatively simple deployment saml 2.0 web browser sso profile samlprof service provider sp identity provider idp use http post binding message flow begins request secured resource sp 1 request target resource sp principal via http user agent requests target resource service provider service provider performs security check behalf target resource valid security context service provider already exists skip steps 2\u20137 2 respond xhtml form service provider responds document containing xhtml form codice_50 token opaque reference state information maintained service provider value codice_22 parameter base64 encoding following codice_17 element codice_17 element inserted xhtml form first base64-encoded 3 request sso service idp user agent issues post request sso service identity provider values codice_22 codice_50 parameters taken xhtml form step 2 sso service processes codice_17 element url-decoding base64-decoding inflating request order performs security check user valid security context identity provider identifies user details omitted 4 respond xhtml form sso service validates request responds document containing xhtml form value codice_50 parameter preserved step 3 value codice_23 parameter base64 encoding following codice_15 element 5 request assertion consumer service sp user agent issues post request assertion consumer service service provider values codice_23 codice_50 parameters taken xhtml form step 4 6 redirect target resource assertion consumer service processes response creates security context service provider redirects user agent target resource 7 request target resource sp user agent requests target resource service provider 8 respond requested resource since security context exists service provider returns resource user agent complex deployment saml 2.0 web browser sso profile samlprof service provider sp identity provider idp use http artifact binding artifacts delivered respective endpoints via http get message flow begins request secured resource sp 1 request target resource sp principal via http user agent requests target resource service provider service provider performs security check behalf target resource valid security context service provider already exists skip steps 2\u201311 2 redirect single sign-on sso service idp service provider redirects user agent single sign-on sso service identity provider codice_50 parameter codice_74 parameter appended redirect url 3 request sso service idp user agent requests sso service identity provider codice_75 opaque reference state information maintained service provider codice_76 saml artifact issued step 2 4 request artifact resolution service sp sso service dereferences artifact sending codice_19 element bound saml soap message artifact resolution service service provider value codice_78 element saml artifact transmitted step 3 5 respond saml authnrequest artifact resolution service service provider returns codice_37 element containing codice_17 element bound saml soap message sso service identity provider sso service processes codice_17 element performs security check user valid security context identity provider identifies user details omitted 6 redirect assertion consumer service sso service identity provider redirects user agent assertion consumer service service provider previous codice_50 parameter new codice_74 parameter appended redirect url 7 request assertion consumer service sp user agent requests assertion consumer service service provider codice_75 token value step 3 codice_85 saml artifact issued step 6 8 request artifact resolution service idp assertion consumer service dereferences artifact sending codice_19 element bound saml soap message artifact resolution service identity provider value codice_78 element saml artifact transmitted step 7 9 respond saml assertion artifact resolution service identity provider returns codice_37 element containing codice_15 element bound saml soap message assertion consumer service service provider 10 redirect target resource assertion consumer service processes response creates security context service provider redirects user agent target resource 11 request target resource sp user agent requests target resource service provider 12 respond requested resource since security context exists service provider returns resource user agent saml 2.0 identity provider discovery profile introduces following concepts hypothetical example common domain let suppose example uk example.co.uk example deutschland example.de belong virtual organization example global alliance example.com example domain example.com common domain example uk example deutschland presence domain uk.example.com de.example.com resp. common domain cookie secure browser cookie scoped common domain browser user cookie stores history list recently visited idps name value cookie specified idp discovery profile samlprof successful act authentication idp requests common domain cookie writing service service appends idp unique identifier common domain cookie sp receives unauthenticated request protected resource requests common domain cookie reading service discover browser user recently used idp assertion query/request profile general profile accommodates numerous types so-called queries using following saml 2.0 elements saml soap binding often used conjunction queries attribute query perhaps important type saml query often requester acting behalf principal queries identity provider attributes give example query issued principal directly note codice_26 codice_97 case sometimes called attribute self-query identity provider might return following assertion wrapped codice_15 element shown contrast bearerassertion shown earlier assertion longer lifetime corresponding lifetime x.509 certificate principal used authenticate identity provider moreover since assertion signed user push assertion relying party long user prove possession corresponding private key hence name holder-of-key relying party assured assertion authentic quite literally metadata makes saml work work well let look important uses metadata metadata ensures secure transaction identity provider service provider metadata trust information encoded implementation proprietary manner sharing trust information facilitated standard metadata saml 2.0 provides well-defined interoperable metadata format entities leverage bootstrap trust process identity provider publishes data codice_101 element note following details entity descriptor definition identity provider manages sso service supports saml web browser sso profile specified samlprof see example identity provider described codice_107 element shown next section sso service identity provider described codice_107 element previous metadata element describes sso service identity provider note following details element noted beginning section values codice_112 attributes used service provider route saml messages minimizes possibility rogue identity provider orchestrating man-in-the-middle attack like identity provider service provider publishes data codice_101 element note following details entity descriptor definition service provider manages assertion consumer service supports saml web browser sso profile specified samlprof see example service provider described codice_133 element shown next section assertion consumer service contained codice_133 element note following details codice_133 metadata element noted beginning section values codice_112 attributes used identity provider route saml messages minimizes possibility rogue service provider orchestrating man-in-the-middle attack previous examples codice_101 element shown digitally signed practice however multiple codice_101 elements grouped together codice_159 element single digital signature entire aggregate note following details codice_159 element typically metadata aggregates published trusted third parties called federations vouch integrity metadata aggregate note metadata aggregates large composed hundreds even thousands entities per aggregate primary references secondary references deprecated references", + "neighbors": [ + 302, + 517, + 692, + 762, + 963, + 1039 + ], + "mask": "Test" + }, + { + "node_id": 965, + "label": 4, + "text": "Cisco_Systems:cisco systems cisco systems inc. american multinational technology conglomerate headquartered san jose california center silicon valley cisco develops manufactures sells networking hardware telecommunications equipment high-technology services products numerous acquired subsidiaries opendns webex jabber jasper cisco specializes specific tech markets internet things iot domain security energy management cisco stock added dow jones industrial average june 8 2009 also included p 500 index russell 1000 index nasdaq-100 index russell 1000 growth stock index cisco systems founded december 1984 leonard bosack sandy lerner two stanford university computer scientists pioneered concept local area network lan used connect geographically disparate computers multiprotocol router system time company went public 1990 cisco market capitalization 224 million end dot-com bubble year 2000 cisco 500 billion market capitalization cisco systems founded december 1984 sandy lerner director computer facilities stanford university graduate school business lerner partnered husband leonard bosack charge stanford university computer science department computers cisco initial product roots stanford university campus technology early 1980s students staff stanford including bosack used technology campus link school computer systems talk one another creating box functioned multiprotocol router called blue box blue box used software originally written stanford research engineer william yeager due underlying architecture ability scale well yeager well-designed invention became key cisco early success 1985 bosack stanford employee kirk lougheed began project formally network stanford campus adapted yeager software became foundation cisco ios despite yeager claims denied permission sell blue box commercially july 11 1986 bosack lougheed forced resign stanford university contemplated filing criminal complaints cisco founders theft software hardware designs intellectual properties 1987 stanford licensed router software two computer boards cisco addition bosack lerner lougheed greg satz programmer richard troiano handled sales completed early cisco team company first ceo bill graves held position 1987 1988 1988 john morgridge appointed ceo name cisco derived city name san francisco company engineers insisted using lower case cisco early years logo intended depict two towers golden gate bridge february 16 1990 cisco systems went public market capitalization 224 million listed nasdaq stock exchange august 28 1990 lerner fired upon hearing news husband bosack resigned protest couple walked away cisco 170 million 70 committed charity although cisco first company develop sell dedicated network nodes one first sell commercially successful routers supporting multiple network protocols classical cpu-based architecture early cisco devices coupled flexibility operating system ios allowed keeping evolving technology needs means frequent software upgrades popular models time cisco 2500 managed stay production almost decade virtually unchanged company quick capture emerging service provider environment entering sp market product lines cisco 7000 cisco 8500 1992 1994 cisco acquired several companies ethernet switching kalpana grand junction notably mario mazzola crescendo communications together formed catalyst business unit time company envisioned layer 3 routing layer 2 ethernet token ring switching complementary functions different intelligence architecture\u2014the former slow complex latter fast simple philosophy dominated company product lines throughout 1990s 1995 john morgridge succeeded john chambers internet protocol ip became widely adopted mid-to-late 1990s cisco introduced products ranging modem access shelves as5200 core gsr routers making major player market late march 2000 height dot-com bubble cisco became valuable company world market capitalization 500 billion july 2014 market cap us 129 billion still one valuable companies perceived complexity programming routing functions silicon led formation several startups determined find new ways process ip mpls packets entirely hardware blur boundaries routing switching one juniper networks shipped first product 1999 2000 chipped away 30 cisco sp market share response cisco later developed homegrown asics fast processing cards gsr routers catalyst 6500 switches 2004 cisco also started migration new high-end hardware crs-1 software architecture ios-xr part rebranding campaign 2006 cisco systems adopted shortened name cisco created human network advertising campaign efforts meant make cisco household brand\u2014a strategy designed support low-end linksys products future consumer products traditional business side cisco continued develop routing switching security portfolio quickly growing importance ethernet also influenced company product lines limits ios aging crescendo architecture also forced cisco look merchant silicon carrier ethernet segment resulted new asr9000 product family intended consolidate company carrier ethernet subscriber management business around ezchip-based hardware ios-xr throughout mid-2000s cisco also built significant presence india establishing globalization centre east bangalore 1 billion cisco also expanded new markets acquisition\u2014one example 2009 purchase mobile specialist starent networks cisco continued challenged domestic alcatel-lucent juniper networks overseas competitors huawei due lower-than-expected profit 2011 cisco reduced annual expenses 1 billion company cut around 3,000 employees early-retirement program accepted buyout planned eliminate many 10,000 jobs around 14 percent 73,400 total employees curtailment 2011 analyst call cisco ceo john chambers called several competitors name including juniper hp july 24 2012 cisco received approval eu acquire nds tv software developer us 5 billion 2013 cisco sold linksys home-router unit belkin international inc. signaling shift sales businesses rather consumers july 23 2013 cisco systems announced definitive agreement acquire sourcefire 2.7 billion august 14 2013 cisco systems announced would cut 4,000 jobs workforce roughly 6 starting 2014 end 2013 cisco announced poor revenue due depressed sales emerging markets caused economic uncertainty fears national security agency planting backdoors products april 2014 cisco announced funding early-stage firms focus internet things investment fund allocated investments iot accelerators startups alchemist accelerator ayla networks evrythng later year company announced laying another 6,000 workers 8 global workforce part second restructuring november 4 2014 cisco announced investment stratoscale may 4 2015 cisco announced ceo chairman john chambers would step ceo july 26 2015 remain chairman chuck robbins senior vice president worldwide sales operations 17-year cisco veteran announced next ceo july 23 2015 cisco announced divesture television set-top-box cable modem business technicolor sa 600 million division originally formed cisco 6.9 billion purchase scientific atlanta deal came part cisco gradual exit consumer market part effort cisco new leadership focus cloud-based products enterprise segments cisco indicated would still collaborate technicolor video products november 19 2015 cisco alongside arm holdings dell intel microsoft princeton university founded openfog consortium promote interests development fog computing january 2016 cisco invested velocloud software-defined wan sd-wan start-up cloud offering configuring optimizing branch office networks cisco contributed velocloud 27 million series c round led march capital partners february 2017 cisco launched cloud-based secure internet gateway called cisco umbrella provide safe internet access users n't use corporate networks vpns connect remote data centers immediately reporting fourth quarter earnings 2017 cisco price-per-share value jumped 7 earnings per share ratio increased 60 61 cents per share due part cisco outperformance analyst expectations september 2017 chambers announced would step executive chairman role end term board december 2017 december 11 2017 robbins elected succeed chambers executive chairman retaining role ceo chambers given title chairman emeritus reuters reported cisco systems inc \u2019 csco.o product revenue russia grew 20 percent 2017 ahead cisco \u2019 technology product revenue growth so-called bric countries brazil china india may 1 2018 cisco systems agreed buy ai-driven business intelligence startup accompany 270 million june 2018 cisco systems ranked 444th forbes global 2000 list 221.3 billion market cap fiscal year 2017 cisco reported earnings us 0.1 billion annual revenue us 49.3 billion increase 2.8 previous fiscal cycle cisco shares traded 43 per share market capitalization valued us 213.2 billion september 2018 low net income fiscal year 2018 attributed one time tax charge allowed cisco bring back capital overseas cisco used money able bring back lower tax rate fund share buybacks acquisitions cisco acquired variety companies spin products talent company 1995\u20131996 company completed 11 acquisitions several acquisitions stratacom biggest deals industry occurred internet boom 1999 company acquired cerent corporation start-up company located petaluma california us 7 billion expensive acquisition made cisco date acquisition scientific atlanta larger 1999 cisco also acquired stake 1 billion kpmg consulting enable establishing internet firm metrius founded keyur patel fuse several acquired companies grown 1bn+ business units cisco including lan switching enterprise voice internet protocol voip platform webex home networking latter came result cisco acquiring linksys 2003 2010 supplemented new product line dubbed cisco valet cisco announced january 12 2005 would acquire airespace us 450 million reinforce wireless controller product lines cisco announced january 4 2007 would buy ironport deal valued us 830 million completed acquisition june 25 2007 ironport best known ironport antispam senderbase email reputation service email security appliances accordingly ironport integrated cisco security business unit ironport senderbase renamed sensorbase take account input database cisco devices provide sensorbase allows devices build risk profile ip addresses therefore allowing risk profiles dynamically created http sites smtp email sources cisco announced march 15 2012 would acquire nds group 5bn transaction completed july 30 2012 recent merger deals cisco bought starent networks mobile packet core company moto development group product design consulting firm helped develop cisco flip video camera also 2010 cisco became key stakeholder e-skills week march 2011 cisco completed acquisition privately held network configuration change management software company pari networks although many buy-ins crescendo networks 1993 tandberg 2010 resulted acquisition flagship technology cisco many others failed\u2014partially completely instance 2010 cisco occupied meaningful share packet-optical market revenues still par us 7 billion price tag paid 1999 cerent acquired technologies flip pure digital saw product lines terminated january 2013 cisco systems acquired israeli software maker intucell around 475 million cash move expand mobile network management offerings month cisco systems acquired cognitive security company focused cyber threat protection cisco also acquired solvedirect cloud services march 2013 ubiquisys mobile software april 2013 cisco acquired cyber-security firm sourcefire october 2013 june 16 2014 cisco announced completed acquisition threatgrid company provided dynamic malware analysis threat intelligence technology june 17 2014 cisco announced intent acquire privately held tail-f systems leader multi-vendor network service orchestration solutions traditional virtualized networks april 2 2015 cisco announced plans buy embrane software-defined networking startup deal give cisco embrane software platform provides layer 3\u20137 network services things firewalls vpn termination server load balancers ssl offload may 7 2015 cisco announced plans buy tropo cloud api platform simplifies addition real-time communications collaboration capabilities within applications june 30 2015 cisco acquired privately held opendns company best known dns service adds level security monitoring domain name requests august 6 2015 cisco announced completed acquisition privately held maintenancenet us-based company best known cloud-based contract management platform serviceexchange month cisco acquired pawaa privately held company bangalore india provides secure on-premises cloud-based file-sharing software september 30 2015 cisco announced intent acquire privately held portcullis computer security uk-based company provides cybersecurity services enterprise clients government sectors october 26 2015 cisco announced intent acquire parstream privately held company based cologne germany provides analytics database allows companies analyze large amounts data store near real time anywhere network october 27 2015 cisco announced would acquire lancope company focuses detecting threat activity 452.5 million cash-and-equity deal june 28 2016 cisco announced intent acquire cloudlock privately held cloud security company founded 2011 three israeli military veterans 293 million deal expected close first quarter 2017 august 2016 cisco announced getting closer making deal acquire springpath startup whose technology used cisco hyperflex systems cisco already owns undisclosed stake hyper-converged provider january 2017 cisco announced would acquire appdynamics company monitors application performance 3.7 billion acquisition came one day appdynamics set ipo january 26 2017 cisco founded innovation alliance germany eleven companies bringing together 40 sites 2,000 staff provide small businesses germany expertise august 1 2017 cisco completed acquisition viptela inc. 610 million cash assumed equity awards viptela privately held software-defined wide area network sd-wan company based san jose ca october 23 2017 cisco systems announced would acquiring broadsoft 1.9 billion entrench cloud communication collaboration area 2017 cisco systems shares mainly held institutional investors vanguard group blackrock state street corporation others cisco products services focus upon three market segments\u2014enterprise service provider midsize small business cisco provides products services across five major technology areas networking including ethernet optical wireless mobility security collaboration including voice video data data center internet things cisco grown increasingly popular asia-pacific region last three decades dominant vendor australian market leadership across market segments uses australian office one main headquarters asia-pacific region offering diverse product portfolio long-term stability integration sustainable competitive advantage cisco became major provider voice ip enterprises moving home user market acquisitions scientific atlanta linksys scientific atlanta provides voip equipment cable service providers time warner cablevision rogers communications upc others linksys partnered companies skype microsoft yahoo integrate consumer voip services wireless cordless phones cisco partners offer cloud-based services based cisco virtualized unified computing system ucs part cisco unified services delivery solution includes hosted versions cisco unified communications manager ucm cisco unified contact center cisco unified mobility cisco unified presence cisco unity connection unified messaging cisco webex meeting center part tactical operations initiative cisco maintains several network emergency response vehicles nerv s. vehicles maintained deployed cisco employees natural disasters public crises vehicles self-contained provide wired wireless services including voice radio interoperability voice ip network-based video surveillance secured high-definition video-conferencing leaders first responders crisis areas 3 mbit/s bandwidth via 1.8-meter satellite antenna nervs based cisco headquarters sites san jose california research triangle park north carolina allowing strategic deployment north america become fully operational within 15 minutes arrival high-capacity diesel fuel-tanks allow largest vehicles run 72 hours continuously nerv deployed incidents october 2007 california wildfires hurricanes gustav ike katrina 2010 san bruno gas pipeline explosion tornado outbreaks north carolina alabama 2011 hurricane sandy 2012 tactical operations team maintains deploys smaller portable communication kits emergencies outside north america 2010 team deployed assist earthquake recovery haiti christchurch new zealand 2011 deployed flooding brazil well response 2011 earthquake tsunami japan 2011 cisco received innovation preparedness award american red cross silicon valley chapter development use vehicles disasters cisco systems also sponsors line professional certifications cisco products four five path network designers levels certification entry ccent associate ccna/ccda professional ccnp/ccdp expert ccie/ccde recently architect ccar ccde previous well nine different paths routing switching design industrial network network security service provider service provider operations storage networking voice datacenter wireless number specialist technician sales datacenter certifications also available cisco also provides training certifications via portal called cisco networking academy qualifying schools become members cisco networking academy provide ccna level level courses cisco academy instructors must ccna certified ccai certified instructor cisco often finds involved technical education 10,000 partnerships 65 countries cisco academy program operates many exotic locations example march 2013 cisco announced interest myanmar investing two cisco networking academies yangon mandalay channel partner network cisco products including ip phones telepresence seen movies tv series company featured documentary film something ventured premiered 2011 cisco 2002\u201303 recipient ron brown award u.s. presidential honor recognize companies exemplary quality relationships employees communities cisco included part fortune 100 best companies work ranking 20 2011 according report technology consulting firm lexinnova cisco one leading recipients network security-related patents largest portfolio within companies 6,442 security-related patents 2015 class action lawsuit filed april 20 2001 accused cisco making misleading statements relied purchasers cisco stock insider trading cisco denied allegations suit august 18 2006 cisco liability insurers directors officers paid plaintiffs us 91.75 million settle suit december 11 2008 free software foundation filed suit cisco regarding cisco failure comply gpl lgpl license models make applicable source code publicly available may 20 2009 cisco settled lawsuit complying fsf licensing terms making monetary contribution fsf cisco criticized involvement censorship people republic china according author ethan gutmann cisco telecommunications equipment providers supplied chinese government surveillance internet infrastructure equipment used block internet websites track online activities china cisco stated customize develop specialized unique filtering capabilities enable governments block access information sells equipment china sells worldwide wired news uncovered leaked confidential cisco powerpoint presentation detailed commercial opportunities golden shield project internet control may 2011 group falun gong practitioners filed lawsuit alien tort statute alleging cisco knowingly developed customized product assist chinese government prosecution abuse falun gong practitioners lawsuit dismissed september 2014 united states district court northern district california decision appealed united states court appeals ninth circuit september 2015 october 2007 employees cisco brazilian unit arrested charges imported equipment without paying import duties response cisco stated import directly brazil instead use middlemen december 1 2008 multiven filed antitrust lawsuit cisco systems inc. multiven complaint alleges cisco harmed multiven consumers bundling tying bug fixes/patches updates operating system software maintenance services smartnet may 2010 cisco accused person filed antitrust suit british-nigerian technology entrepreneur peter alfred-adekeye hacking pressured us government extradite canada cisco settled antitrust lawsuit two months alfred-adekeye arrest making software updates available multiven customers cisco linksys e2700 e3500 e4500 devices reported remotely updated firmware version forces users register cloud service allows cisco monitor network use ultimately shut cloud service account thus render affected router unusable according german magazine der spiegel nsa developed jetplow gaining access asa series 5505 5510 5520 5540 5550 500-series pix firewalls cisco chief security officer addressed allegations publicly denied working government weaken cisco products exploitation implement security back doors document included trove national security agency files released glenn greenwald book place hide details agency tailored access operations tao unit nsa employees intercept servers routers network gear shipped organizations targeted surveillance install covert firmware onto delivered trojan horse systems described nsa manager \u201c productive operations tao pre-position access points hard target networks around world. \u201d cisco denied allegations customer document saying information included specific cisco products supply chain intervention implant techniques new security vulnerabilities cisco general counsel also said cisco work government including united states government weaken products allegations reported prompted company ceo express concern president united states march 2014 cisco systems sued patent infringement spherix says 43 billion cisco sales infringe old nortel patents owned spherix officials spherix saying wide range cisco products switches routers infringe 11 former nortel patents company owns january 2008 cisco announced investment 10 million three years towards job creation technology sector development palestinian territories according cisco project cooperation palestinian authority president mahmoud abbas ramallah-based exalt technologies handles software development cisco outsources palestinian territories", + "neighbors": [ + 17, + 88, + 94, + 120, + 186, + 211, + 311, + 322, + 343, + 363, + 430, + 476, + 512, + 533, + 543, + 546, + 598, + 614, + 642, + 717, + 731, + 757, + 771, + 842, + 910, + 917, + 921, + 938, + 944, + 965, + 1038, + 1063, + 1101, + 1116, + 1138, + 1196, + 1239, + 1246, + 1266, + 1278, + 1291, + 1327, + 1350, + 1355, + 1358, + 1373, + 1375, + 1384, + 1397, + 1443, + 1447, + 1514, + 1542 + ], + "mask": "Test" + }, + { + "node_id": 966, + "label": 2, + "text": "RSTS/E:rsts/e rsts multi-user time-sharing operating system initially developed evans griffiths hart boston acquired digital equipment corporation dec part hewlett packard pdp-11 series 16-bit minicomputers first version rsts rsts-11 version 1 implemented 1970 dec software engineers developed tss-8 time-sharing operating system pdp-8 last version rsts rsts/e version 10.1 released september 1992 rsts-11 rsts/e usually referred rsts article generally use shorter form kernel rsts programmed assembly language macro-11 compiled installed disk using cilus program running dos-11 operating system rsts booted extended version basic programming language dec called basic-plus system software cusps operating system including programs resource accounting login logout managing system written basic-plus 1970 1973 rsts ran 56k bytes magnetic core memory 64 kilobytes including memory-mapped i/o space would allow system 16 terminals maximum 17 jobs maximum program size 16k bytes end 1973 dec estimated 150 licensed systems running rsts 1973 memory management support included rsts rsts/e newer dec pdp-11/40 pdp-11/45 minicomputers pdp-11/20 supported rsts-11 introduction memory management newer pdp-11 computers meant machines able address four times amount memory 18-bit addressing 256k bytes also paved way developers separate user mode processes core kernel 1975 memory management support updated newer 22-bit addressable pdp-11/70 rsts systems could expanded use much two megabytes memory running 63 jobs rts ccl concepts introduced although compiled sysgen multi-terminal service introduced would allow single job ability control multiple terminals 128 total large-message send/receive interprocess communication became sophisticated efficient august 1,200 licensed systems 1977 installation process rsts longer dependent dos-11 rsts kernel could compiled rt-11 rts formatted kernel file rt-11 silus copied system disks computer time-sharing basic-plus rts well rt-11 rsx-11 teco third party rtss ran user mode processes independent rsts kernel systems manager could decide bootstrap phase rts run systems default kbm 3,100 licensed systems 1978 final memory management update included machines could support 22bit addressing rsts could use maximum amount memory available pdp-11 4 megabytes support also included supervisory mode made rsts first dec operating system capability decnet also supported well remote diagnostics field service technicians rdc colorado springs colorado dec subscription service end decade 5,000 licensed systems 1981 support separate instruction data space users unibus machines pdp-11/44 pdp-11/45 pdp-11/55 pdp-11/70 provided extension memory constraints individual program compiling programs use separate instruction data space would soon give program 64 kb instructions 64 kb buffering data dcl rts included well support newer revision decnet iii 1983 rsts/e v8.0-06 included support smallest 18-bit pdp-11 sold dec micropdp-11 pre-generated kernel cusps included distribution make installation micropdp-11 easier dec sold pre-generated version micropdp-11 microrsts reduced price however users needed purchase full version need generate kernel file system upgraded given designation rsts directory structure 1 rds1 previous versions rsts file system given designation rds0 newer file system designed support 1700 user accounts thought well 10,000 licensed users least equal number unlicensed users 1985 1989 rsts became mature product version 9 revisions dcl installed primary rts file system upgraded rds1.2 support new user account features passwords encrypted using modified des algorithm instead limited six 6 characters stored dec radix-50 format version 9 non-user system account project group zero designation 0,1 accounts project number 1 privileged unlike root account unix systems version 9 released additional accounts could created project zero multiple privileges could individually set account support lat protocol included well ability run newest version decnet iv network enhancements gave user connected terminal decserver ability communicate rsts machine easily could vax running vms dcl command structure dec operating systems also contributed familiar look feel another pseudo command file processor based vms features dcl command file processor fully supported integrated rsts extensive changes dcl monitor dcl executes command files part job therefore pseudo keyboard forcing commands keyboard necessary atpk 1994 dec sold pdp-11 software business mentec digital continued support pdp-11 customers short period assistance mentec staff issue ip rights digital later compaq later still hewlett packard straightforward much mis-information pervaded hobbyist user community digital mentec granted no-cost license anyone non-commercial hobby purpose use specific non-current versions several operating systems developed pdp-11 use specific pdp-11 emulator known simh emulators versions pdp software released use authorized disk images authorized operating systems may found internet along simh emulator ibm pc class computers thus possible hobbyist run rsts/e personal computer using software emulation fast faster originally ran real hardware standard complement documentation manuals accompanies rsts distribution consists least 11 large three-ring binders collectively known orange wall one small three-ring binder containing rsts/e quick reference guide paperback copy introduction basic aa-0155b-tk 11 three-ring binders contains volume 1 general information installation volume 2 system management volume 3 system usage volume 4 utilities volume 4a utilities volume 4b utilities volume 5 basic-plus volume 6 system programming volume 7 macro programming volume 7a macro programming volume 8 rms last software product description dec outlined following topics major features rsts/e version 10.1 rsts uses serial communication connection interact operator connection might local computer terminal 20 current loop interface rs-232 interface either local serial port remote connection via modem ethernet connection utilizing decnet lat many 128 terminals using multi-terminal service could connect rsts system running maximum 63 jobs depending processor used amount memory disk space system load rsts systems nowhere near many terminals users could also submit jobs run batch mode also batch program called atpk allowed users run series commands imaginary terminal pseudo-terminal semi-interactive mode similar batch commands ms-dos users connected system typing login command hello logged-out terminal pressing return actually typing command logged-out terminal simply started login program interpreted command one commands allowed used user yet logged logged associated program command chained otherwise message please say hello printed terminal prior version 9 user could also initiate 1 line login however left password screen anyone behind view examples follow one could determine status terminal command responses printed command interpreter logged-in user communicating basic-plus kbm given prompt ready user logged given prompt bye user would log supplying ppn number password user numbers consisted project number would equivalent group number unix comma programmer number numbers range 0 254 special exceptions specifying account project programmer number enclosed brackets typical user number could 10,5 project 10 programmer 5 2,146 254,31 200,220 etc user running system program logged system manager enabled ppn number 0,0 would appear systat cusp ** ** thus valid account number every project programmer number 0 usually reserved group account could referenced special symbol one user number 20,103 reference file name beginning would refer file stored account user number 20,0 feature would useful educational environments programmer number 0 could issued instructor class individuals students given accounts project number instructor could store account files marked shared project number would students class two special classes project numbers existed project number 0 generally reserved system software prior version 9 1 project 0 account named 0,1 programmers project number 1 privileged accounts equivalent single account root unix systems except account numbers 1,0 1,254 privileged accounts version 9 released account could granted specific privileges systems manager account 0,1 used store operating system file run-time library systems certain system files relating booting system author comments appear right bold dir command installed ccl equivalent run command direct program 0,1 account number directory name operating system storage account would referred project number 0 programmer number 1 numbers shown file represent size disk blocks block 512 bytes 1/2 kilobyte k c indicates file contiguous stored one file without separated pieces similar files microsoft windows system drive defragmented p indicates specially protected deleted even privileged user unless p bit cleared separate command numbers brackets like 40 represent protections file always displayed decimal protections indicate file may seen user users programmer number file read may altered another user whether file may executed ordimary user giving additional privileges protection codes similar r w x protections unix similar operating systems bsd linux code 60 equivalent private file code 63 private non-deletable file 40 public file library files kept account 1,1 usually referenced logical name lb account 1,2 system startup account much like unix system starting root contains system cusps could referenced prefixing cusp name dollar sign used account 1,3 1,4 1,5 account 1,1 also special privilege account user logged account permitted execute poke system call put values memory system thus account number 1,1 closest equivalent root unix-based systems one features rsts means execution programs environment used run various environments allowed programming basic-plus enhanced basic-plus-2 traditional programming languages cobol fortran environments separate one could start program one environment system would switch different environment running different program return user original environment started environments referred rts term command line interface rtss kbm prior version 9 systems manager needed define rts system would start one would execute compiled programs systems manager may also install special ccl commands take precedence kbm commands exception dcl ccl analogous shortcut program windows system symbolic link unix-based systems ccls installed memory-resident command either startup dynamically system running system manager i.e permanent like disk file logged user switch environments type language statements basic-plus programming language issue run commands specific programs issue special command called ccl execute program command options rsts systems managers generated kernel include control-t one line status option could tell program running rts program using much memory program taking much could expand much memory rts using programs written basic-plus ran basic rts allowed 32k bytes memory 64k total language interpreted different keyword internally converted unique byte code variables data indexed stored separately within memory space internal byte-code format known pcode interactive save command issued basic plus rts simply saved working memory area disk file .bac extension although format undocumented two electronic engineering undergraduates southampton university uk nick de smith david garrod developed decompiler could reverse engineer bac files original basic plus source complete original line numbers variable names subsequently worked dec rest memory used basic rts one wrote programs language permitted true binary executables basic-plus-2 fortran-iv macro assembler amount memory available would 56k 8k allocated rts standard basic-plus prompt ready response example starting version 9 dcl became primary startup rts even though ability execute binary programs became possible advent disappearing rsx rts see dcl incorporated recent versions dec operating systems rsx-11 rt-11 vms later openvms compatibility standard dcl prompt dollar sign example programs written rsx rts cobol macro assembler later releases basic-plus-2 could utilize maximum amount memory available binary program 56k due requirements rts needing top 8k use rsts version 7 later allowed rsx rts included kernel making completely disappear user address space thus allowing 64k bytes memory user programs programs got around limitations amount available memory using libraries permissible complicated overlay strategies calling programs chaining passing commands shared memory area called core common among practices rsx default kbm standard rsx prompt logged logged mcr monitor console routine sign example rt-11 rts emulated single job version rt-11 distribution like rsx emulation rt-11 occupied top 8k memory leaving bottom 56k cusps programs written fortran-iv macro assembler rt-11 default kbm standard rt-11 prompt logged logged sign example teco editor implemented rts maximize amount memory available editing buffer also first implemented rsts v5b release general purpose runtime systems rsx rt11 teco rts distributed rsts contain built-in kbm user would start teco like program running teco program teco.tec teco affine qedit direct ancestors first unix-based text editor ed rsts systems used ccl create file make filespec edit file teco filespec run teco program mung filespec data following program example teco could used calculate pi currently set 20 digits user typed unrecognised command system boot option prompt init.sys startup utility message type 'help help displayed user subsequently typed 'help including quotes prompt response amusing anyway ... followed actual help message one nice features system manager could compile kernel rotating display pattern gave illusion 2 snakes chasing around console lights normal kernel would give illusion 1 snake moving right left data lights across bottom system manager also compiled lights object module would see additional snake moving left right address lights across top accomplished using supervisory mode versions prior 9.0 rsx also similar display pattern would appear 2 snakes playing chicken would run center console command 'make allowed user make text file automatically enter teco text editor user typed 'make love system created file called 'love typed back 'not war kevin herbert later working dec added undocumented feature 90 allow user enter ^f see list open files user process complete blocks use file sizes beginning version 9.0 undocumented feature would allow system manager change display system date rsts became first operating system would display system date set numbers representing stardate commonly known tv series system industries bought source license rsts implement enhancement called simacs simultaneous machine access allowed special disk controller set semaphore flag disk access allowing multiple writes files rsts system disk shared multiple pdp-11 rsts systems feature implemented system industries controllers attached many dec computers designed dr. albert chu worked system industries required many changes way access disks accomplished rsts operating system fips file information processing system system handled i/o access single-threaded rsts allow disk access stall another machine active access block required fips could timeout request go next request 'come back stalled one round robin fashion code allow written philip hunt working system industries milipitas ca eventually worked digital equipment new england area late 1980s early '90s 1981 evans griffiths hart marketed ross/v product ross/v allowed user mode processes rsts cusps rtss user programs ability run unmodified vms vax-11 machines code emulation handled kernel processes would normally handled rsts kernel running pdp-11 original basic-plus language carried versions rsts subcontracted evans griffiths hart inc. fixed price 10,500 rsts applications run pdp-11 emulator information see pdp-11 rsts originally called btss name changed btss rtss product name btss marketed honeywell simple typing mistake changed name rtss rsts addition new memory management support ability install memory pdp-11/40 pdp-11/45 led another name change rsts-11 became rsts/e computer bureaus sometimes deployed user-11 rsts/e-based data management", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 99, + 134, + 166, + 170, + 171, + 185, + 187, + 265, + 270, + 292, + 322, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 503, + 583, + 650, + 664, + 716, + 720, + 721, + 728, + 754, + 763, + 779, + 797, + 860, + 884, + 891, + 925, + 941, + 954, + 961, + 996, + 998, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1433, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1632, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 967, + "label": 4, + "text": "BPO_security:bpo security information security emerged significant concern banks mobile phone companies businesses use call centers business process outsourcing bpo instances theft personal data reported call centers britain financial services authority examined standards india april 2005 banking code standards board audited eight india-based call centres 2006 handling million calls per month uk examinations extend africa-based call centres staffed workers indian origin bcsb report stated customer data subject level security uk high risk complex processes subject higher levels scrutiny similar activities onshore india nasscom said take breach security extremely seriously assist police probe three identifiable types illicit activities concerning fraud emanating call centers items 1 2 mostly subject police action call centres use internal procedures minimise risk mitigation measures include limited", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 968, + "label": 7, + "text": "Utility_computing:utility computing utility computing computer utility service provisioning model service provider makes computing resources infrastructure management available customer needed charges specific usage rather flat rate like types on-demand computing grid computing utility model seeks maximize efficient use resources and/or minimize associated costs utility packaging system resources computation storage services metered service model advantage low initial cost acquire computer resources instead resources essentially rented repackaging computing services became foundation shift demand computing software service cloud computing models propagated idea computing application network service initial skepticism significant shift however new model computing caught eventually became mainstream ibm hp microsoft early leaders new field utility computing business units researchers working architecture payment development challenges new computing model google amazon others started take lead 2008 established utility services computing storage applications utility computing support grid computing characteristic large computations sudden peaks demand supported via large number computers utility computing usually envisioned form virtualization amount storage computing power available considerably larger single time-sharing computer multiple servers used back end make possible might dedicated computer cluster specifically built purpose rented even under-utilized supercomputer technique running single calculation multiple computers known distributed computing term grid computing often used describe particular form distributed computing supporting nodes geographically distributed cross administrative domains provide utility computing services company bundle resources members public sale might paid portion revenue clients one model common among volunteer computing applications central server dispense tasks participating nodes behest approved end-users commercial case paying customers another model sometimes called virtual organization vo decentralized organizations buying selling computing resources needed go idle definition utility computing sometimes extended specialized tasks web services utility computing merely means pay use regards computing power utility computing new concept rather quite long history among earliest references ibm mainframe providers conducted kind business following two decades often referred time-sharing offering computing power database storage banks large organizations worldwide data centers facilitate business model mainframe operating systems evolved include process control facilities security user metering advent mini computers changed business model making computers affordable almost companies intel amd increased power pc architecture servers new generation processor data centers became filled thousands servers late 90 utility computing re-surfaced insynq inc. launched on-demand applications desktop hosting services 1997 using hp equipment 1998 hp set utility computing division mountain view ca assigning former bell labs computer scientists begin work computing power plant incorporating multiple utilities form software stack services ip billing-on-tap marketed hp introduced utility data center 2001 sun announced sun cloud service consumers 2000 december 2005 alexa launched alexa web search platform web search building tool underlying power utility computing alexa charges users storage utilization etc space market specific industries applications well niche applications powered utility computing example polyserve inc. offers clustered file system based commodity server storage hardware creates highly available utility computing environments mission-critical applications including oracle microsoft sql server databases well workload optimized solutions specifically tuned bulk storage high-performance computing vertical industries financial services seismic processing content serving database utility file serving utility enable organizations independently add servers storage needed retask workloads different hardware maintain environment without disruption spring 2006 3tera announced applogic service later summer amazon launched amazon ec2 elastic compute cloud services allow operation general purpose computing applications based xen virtualization software commonly used operating system virtual computers linux though windows solaris supported common uses include web application saas image rendering processing also general-purpose business applications decision support business intelligence 8th edition page 680", + "neighbors": [ + 77, + 90, + 124, + 227, + 349, + 399, + 611, + 847, + 909, + 1416 + ], + "mask": "Test" + }, + { + "node_id": 969, + "label": 4, + "text": "Slide_attack:slide attack slide attack form cryptanalysis designed deal prevailing idea even weak ciphers become strong increasing number rounds ward differential attack slide attack works way make number rounds cipher irrelevant rather looking data-randomizing aspects block cipher slide attack works analyzing key schedule exploiting weaknesses break cipher common one keys repeating cyclic manner attack first described david wagner alex biryukov bruce schneier first suggested term slide attack used 1999 paper describing attack requirements slide attack work cipher broken multiple rounds identical f function probably means cyclic key schedule f function must vulnerable known-plaintext attack slide attack closely related related-key attack idea slide attack roots paper published edna grossman bryant tuckerman ibm technical report 1977 grossman tuckerman demonstrated attack weak block cipher named new data seal nds attack relied fact cipher identical subkeys round cipher cyclic key schedule cycle one key makes early version slide attack summary report including description nds block cipher attack given cipher systems beker piper 1982 first introduce notation section assume cipher takes n bit blocks key-schedule using formula_1 keys length slide attack works breaking cipher identical permutation functions f f function may consist one round cipher defined key-schedule example cipher uses alternating key schedule switches formula_2 formula_3 round f function would consist two rounds formula_4 appear least f next step collect formula_5 plaintext-ciphertext pairs depending characteristics cipher fewer may suffice birthday paradox formula_5 needed pairs denoted formula_7 used find slid pair denoted formula_8 slid pair property formula_9 formula_10 slid pair identified cipher broken vulnerability known-plaintext attacks key easily extracted pairing slid pair thought happens message one application function f \u2019 slid \u2019 one encryption round attack gets name process finding slid pair somewhat different cipher follows basic scheme one uses fact relatively easy extract key one iteration f choose pair plaintext-ciphertext pairs formula_8 check see keys corresponding formula_9 formula_10 keys match slid pair otherwise move next pair formula_5 plaintext-ciphertext pairs one slid pair expected along small number false-positives depending structure cipher false positives eliminated using keys different message-ciphertext pair see encryption correct probability wrong key correctly encipher two messages low good cipher sometimes structure cipher greatly reduces number plaintext-ciphertext pairs needed thus also large amount work clearest examples feistel cipher using cyclic key schedule reason given formula_15 search formula_16 reduces possible paired messages formula_17 formula_5 since half message fixed formula_19 plaintext-ciphertext pairs needed order find slid pair", + "neighbors": [ + 32, + 104, + 174, + 284, + 289, + 382, + 633, + 995, + 1071, + 1181, + 1232, + 1233, + 1240, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 970, + "label": 3, + "text": "Alcazar:_The_Forgotten_Fortress:alcazar forgotten fortress alcazar forgotten fortress dungeon action-adventure game similar dungeon master legend zelda released 1985 coleco adam computer accessory also port colecovision created tom loughry activision graphics keri janssen longaway game also ported commodore 64 later plot alcazar get main castle alcazar going multiple enemy castles retrieve stolen crown game starts world map contains 22 castles player main goal move character various castles ultimately arrive main castle fortress right side map castle multiple rooms traps floors map routes change every time new game started game four difficulty levels beginner intermediate advanced expert various items may also obtained game pistol used attacking hook used cross gaps also map bottom left corner help prevent lost castle dungeons also many traps enemies present player either fight evade player incurs much damage lose life losing lives ends game though extra lives may also obtained well game continues adam version game supports saving game one earliest adventure games demo mode shows demonstration game play wait title screen 30 seconds game go mode ahoy praised alcazar beautifully written theme song stated graphics insufficiently detailed magazine concluded game enticing blend mental physical stimulation ... electronic passport hours entertainment", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 971, + "label": 4, + "text": "FADO:fado fado stands false authentic documents online european image-archiving system set help combat illegal immigration organised crime established joint action council european union enacted 1998 proliferation genuine false documents means frequent updating essential ever sophisticated techniques used produce genuine documents forgeries computerised system restricted access therefore built enables fast secure information exchange general secretariat council european union document experts european union member states iceland norway switzerland database established fado joint acts includes following data fado currently available document experts 31 fado partner states member states european union eu iceland norway switzerland part information shared document experts classified restricted system fado made publicly available via public register authentic documents online prado website managed council european union document descriptions fado available 24 official languages european union documents introduced document experts languages standardised descriptions translated automatically thus documents immediately available supported languages additional free text information contained translated later specialised linguists general secretariat council", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 972, + "label": 2, + "text": "IPhone_5S:iphone 5s iphone 5s stylized marketed iphone 5s smartphone designed marketed apple inc seventh generation iphone succeeding iphone 5 device unveiled september 10 2013 apple cupertino headquarters released september 20 2013 along lower-cost counterpart iphone 5c iphone 5s maintains almost external design predecessor iphone 5 although 5s received new white/gold color scheme addition white/silver space gray/black 5s vastly upgraded internal hardware however introduced a7 64-bit dual-core system-on-chip first 64-bit processor used smartphone accompanied m7 motion co-processor redesigned home button touch id fingerprint recognition system used unlock phone authenticate app store itunes store purchases also introduced camera also updated larger aperture dual-led flash optimized different color temperatures iphone 5s originally shipped ios 7 introduced revamped visual appearance among new features designed jony ive ios 7 departed skeuomorphic elements used previous versions ios favor flat colorful design among new software features introduced iphone 5s airdrop ad-hoc wi-fi sharing platform control center control panel containing number commonly used functions itunes radio internet radio service earphones known earpods included 5s apple released accessories including case dock reception towards device generally positive outlets considering best smartphone available market due upgraded hardware touch id changes introduced ios 7 criticized iphone 5s keeping design small display iphone 5 others expressed security concerns touch id system nine million units iphone 5s iphone 5c sold weekend release breaking apple sales record iphones iphone 5s best selling phone major u.s. carriers september 2013 iphone 5s succeeded apple flagship smartphone larger iphone 6 september 2014 march 21 2016 5s received direct replacement announcement iphone se incorporated internal hardware similar iphone 6s retaining smaller form factor design 5s iphone 5s iphone supported six major versions ios second ios device support six major updates first ipad 2 supported ios 4 9 official unveiling media speculation primarily centered reports next iphone would include fingerprint scanner including apple july 2012 acquisition authentec developer mobile security products references fingerprint sensor home button beta release ios 7 leaked packaging iphone 5s showing traditional home button metallic ring around similar ring-based imagery seen official invitation apple iphone press event september 2013 new device unveiled shortly official unveiling wall street journal also reported rumor apple announced iphone 5c iphone 5s media event cupertino headquarters september 10 2013 iphone 5c became available preorder september 13 2013 iphone 5s available preorder devices released september 20 2013 promotion focused touch id 64-bit apple a7 processor also highlight event schiller showed demos infinity blade iii demonstrate a7 processing power device camera using untouched photographs release ios 7 september 18 2013 also announced keynote iphone 5s released september 20 2013 united states united kingdom canada china france germany australia japan hong kong singapore released 25 additional countries october 25 2013 12 countries november 1 2013 indonesia last country receive iphone 5s january 26 2014 september 19 2014 iphone 5s succeeded apple flagship smartphone iphone 6 iphone 6 plus older model remained available purchase reduced price 64gb version discontinued gold edition iphone 5s discontinued september 9 2015 apple revealed iphone 6s iphone 6s plus iphone 5s discontinued march 21 2016 succeeded iphone se continues form factor features vastly upgraded internals similar flagship iphone 6s break apple product positioning trend north america western europe starting iphone 4s released october 2011 gave newly released model one year flagship phone moving midrange second year production third final year entry-level offering discontinuation iphone 5s expected continue sale september 2016 replacing a7 processor early meant apple reduced long-term chip support window year ios addition new iphone launch meant stimulate demand sales iphone 6s 6s plus met expectations since september 2015 release iphone family expected suffer first ever negative growth quarter 2016 iphone 5s maintains similar design iphone 5 lcd multi-touch retina display screen resolution 640\u00d71136 326 ppi home button updated new flat design using laser-cut sapphire cover surrounded metallic ring button longer concave contain familiar squircle icon seen previous models phone thick weighs phone uses aluminum composite frame device available three color finishes space gray replacing black slate trim iphone 5 white silver trim white gold trim iphone 5s first iphone available gold color decision influenced fact gold seen popular sign luxury product among chinese customers iphone 5s powered apple a7 system-on-chip first 64-bit processor ever used smartphone device operating system pre-loaded software optimized run 64-bit mode promising increased performance although third-party app developers would need optimize apps take advantage enhanced capabilities a7 processor designed apple manufactured samsung a7 processor accompanied m7 motion co-processor dedicated processor processing motion data iphone accelerometer gyroscopes without requiring attention main processor integrates ios 7 new coremotion apis a7 soc m7 motion co-processor also found ipad air ipad mini 2 released quarter iphone 5s phone includes 1560 mah battery provides 10 hours talk time 250 hours standby time camera still 8 megapixels resolution image capture size 3264 \u00d7 2448 4:3 lens larger aperture 2.2 larger sized pixels image sensor previous iphone models flashlight dual true tone flashes consisting amber led white led variably used based color temperature photo improve color balancing camera also includes automatic image stabilization dynamic tone mapping 10 fps burst mode best shot mode slow motion video 120 fps home button iphone 5s incorporates fingerprint recognition system known touch id based technology authentec company apple acquired 2012 sensor uses capacitive cmos-based sensor detect sub-epidermal layers fingers 500 pixels per inch uses 360-degree design read print angle sensor activated touch-sensitive metallic ring surrounding button touch id used various authentication activities within operating system unlocking device authenticating app store itunes purchases instead apple id password sensor trained recognize fingerprints multiple fingers multiple users fingerprint data stored encrypted format within secure enclave a7 chip accessible apps servers including icloud iphone 5s camera paired double led flash allowing higher quality nighttime photos included ios 7 new camera app allowing iphone 5s capture fast continuous shots record slow-motion videos earphones known apple earpods included iphone 5s according technology commentators design earphones aimed improve sound quality allowing air travel freely apple states design earphones allows rival high-end headphones cost hundreds dollars reviews gizmodo techradar reported although earphones sounded better predecessor reviewers felt quality sound produced poor techradar opined earpods inferior earphones similar price iphone 5s initially supplied ios 7 released september 20 2013 jonathan ive designer ios 7 new elements described update bringing order complexity highlighting features refined typography new icons translucency layering physics gyroscope-driven parallaxing major changes design design ios 7 os x yosemite version 10.10 noticeably departs skeuomorphic elements green felt game center wood newsstand leather calendar favor flat colorful design ios 7 adds airdrop ad-hoc wi-fi sharing platform users share files iphone 5 onwards ipod touch 5th generation ipad 4th generation onwards ipad mini 1st generation onwards operating system also adds control center control panel accessed swiping bottom screen control center contains number commonly used functions volume brightness controls along toggles enabling wi-fi bluetooth airplane mode using rear camera flash led flashlight itunes radio internet radio service also included iphone 5s free ad-supported service available itunes users featuring siri integration ios users able skip tracks customize stations purchase station songs itunes store users could also search history previous songs apple announced june 2018 iphone 5s support ios 12 update made iphone 5s longest supported ios device supported six major versions ios operating system par ipad 2 supported ios 4 ios 9 iphone 5s also receive major speed boosts 70 according apple includes camera keyboard functions supported 6 versions ios ios 7 ios 12 iphone revealed iphone 5s receiving ios 13 update debuted june 3 2019 wwdc come later 2019 autumn keynote apple announced case iphone 5s made soft microfiber inside leather outside case announced along iphone 5c case first cases apple announced since iphone 4 bumpers docks iphone 5s 5c found apple online store announcement casing difference iphone 5s 5c separate docks made specifically respective phone iphone 5s received mostly positive reception reviewers commentators walt mossberg things digital gave phone favorable review saying touch id sounds like gimmick \u2019 real advance biggest step ever biometric authentication everyday devices labeled best smartphone market david pogue new york times praised touch id said innovation smartphone market saturated maybe age annual mega-leaps focused much review ios 7 believed biggest change device previous generations praising new siri features control center airdrop editorial pogue stated ios 7 biggest change iphone series citing utilitarian interface changes main contributor scott stein cnet criticized lack design change iphone 5 said although iphone 5s required upgrade easily fastest advanced apple smartphone date although praised camera 64-bit a7 chip m7 motion-chip fingerprint scanning capabilities investors thought iphone 5s although notable improvement iphone 5 still relatively unchanged predecessor worried iphone line become stagnant dull product apple share price fell 5.4 launch close month low 467.71 nasdaq darrell etherington techcrunch praised iphone 5s best smartphone available said looks may different iphone 5 internal components dramatic impact day-to-day activities normal smartphone user went detail explaining impact improved camera specifications phone etherington suggested 64-bit a7 processor reach full potential developers create applications supporting myriam joire engadget found iphone 5s could benefit significantly a7 developers created applications optimized 64-bit processor anand lal shimpi anandtech praised phone a7 processor describing seriously impressive stated futureproof iphone ever launched much pains use word futureproof one people likes hold onto device iphone 5s good starting point scott lowe ign also spoke highly 64-bit processor substantial lead processing power htc one samsung galaxy s4 accounting graphics boost 32 38 cpu benchmarks debut apple 64-bit a7 processor took rival android smartphone makers surprise particularly qualcomm whose 64-bit system-on-chip released 2015 reviewers recommended iphone 5s iphone 5c released time 5c retained almost hardware discontinued iphone 5 iphone 5s featured substantially improved performance/features thanks new 64-bit a7 processor well extra storage space relatively small additional upfront cost iphone 5c us 650 versus us 550 march 2014 especially case ios 8 released iphone 5s iphone 5c moved mid low end iphone range respectively iphone 5s still 16 32 gb storage available iphone 5c make 8 gb storage 4.9gb available user installing ios 8 furthermore 5c polycarbonate exterior received mixed reception seen cost-cutting downgrade compared iphone 5 aluminum/glass case 5s retained latter design looked even premium due additional gold finish 2015\u201316 still significant number customers preferred 4-inch screen size iphone 5s remained second-most popular iphone iphone 6 ahead iphone 6s apple stated event sold 30 million 4-inch iphones 2015 even form factor succeeded flagship iphone redesigned larger display 4.7/5.5-inch iphone 6 6 plus back september 2014 furthermore 5/5s design regarded long golden child apple phone design benchmark phones general 5s gold finish adding premium touch 5 already well-regarded look succeeding 6 6s design less critically acclaimed felt little bit wrong though holding slick 650 bar soap iphone 5 described elegance rooted way aluminum glass work together felt streamlined yet substantial different iphone 6 feels substantial size alone plus unlike ubiquitous rounded corners 6 iphone 5 \u2019 really look like anything else market time however iphone 5/5s design suited scaling contrast iphone 6/6s could better accommodate growing consumer trend towards larger screen sizes indeed spawned 6/6s plus phablet models apple discontinued iphone 5s replaced iphone se outwardly appears almost identical 5s even se internal hardware upgraded significantly iphone 5s 5c sold nine million units first three days setting record first weekend smartphone sales 5s selling three times units 5c first day release 1 iphones us iphone 5ss 0.3 iphone 5cs. ref name= cnet ip5s/c sales 1 /ref gene munster piper jaffray reported line fifth avenue apple store contained 1,417 people release day compared 1,300 iphone 4 2010 549 iphone 3g 2008 respective release days first time apple launched two models simultaneously first-day release china also contributed record sales result launch day major in-stock shortages reported stores across countries iphone 5s initially went sale great many customers line outside apple stores worldwide left disappointed due severe shortages across 5s models gold model particular highly limited supply situation eased us days following launch countries reported receiving restocks commentators questioned apple handled initial release online pre-orders offered iphone 5s meaning large numbers people queuing outside physical stores line receiving unit us apple offered online reservation system customers could keep checking units available local apple stores order pickup online orders also short supply launch day shipping date across model sizes colors changing 7-10 working days october countries within hours online orders taken iphone 5s best selling phone sprint verizon t-mobile september 2013 united states outselling iphone 5c samsung galaxy s4 according consumer intelligence research partners iphone 5s outsold 5c two-to-one margin september release confirming apple ceo tim cook view high-end smartphone market reaching point market saturation commentators viewed 5c flop supply chain cuts signifying decline demand 5s viewed massive success apple admitted failed anticipate sales ratio leading overstocking 5c shortages 5s six months release iphone 5s march 25 2014 apple announced sales iphone brand exceeded 500 million units may 2014 despite market eight months iphone 5s reportedly outsold newly released samsung galaxy s5 40 7 million iphone 5s units versus 5 million galaxy s5 units galaxy s5 failure oust iphone 5s top selling spot major setback samsung mobile preceding samsung galaxy siii samsung galaxy s4 first quarter releases outsold iphone 4s iphone 5 respectively number technology writers including adrian kingsley-hughes zdnet kevin roose new york believed fingerprint scanning functionality iphone 5s could help spur adoption technology alternative passwords mainstream users especially bring device scenarios fingerprint-based authentication systems enjoyed wider usage enterprise environments however citing research biometrics engineer geppy parziale roose suggested cmos-based sensor could become inaccurate wear time unless apple designed sensor prevent occurring brent kennedy researcher united states computer emergency readiness team recommended users immediately rely technology citing uncertainty whether system could properly reject spoofed fingerprint following release iphone 5s german chaos computer club announced september 21 2013 bypassed apple new touch id fingerprint sensor using easy everyday means group explained security system defeated photographing fingerprint glass surface using captured image make latex model thumb pressed sensor gain access spokesman group stated hope finally puts rest illusions people fingerprint biometrics plain stupid use something ca n't change leave everywhere every day security token however 2013 39 american smartphone users used security measures protect smartphone others also tried chaos computer club method concluded easy process either time effort given user use high resolution photocopy complete fingerprint special chemicals expensive equipment spoofing process takes time achieve several problems experienced iphone 5s hardware release widely reported issue angle reported phone level sensor drifted several degrees caused gyroscope compass accelerometer become inaccurate reports suggested hardware-induced problem encountered problems crashing blue screen restarting power button making rattling noise phone shaken overheating microphone working touch id working itunes purchases issues since fixed software updates", + "neighbors": [ + 71, + 75, + 130, + 162, + 214, + 228, + 252, + 269, + 270, + 337, + 356, + 394, + 403, + 477, + 489, + 511, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 1001, + 1140, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1325, + 1334, + 1339, + 1373, + 1384, + 1488, + 1503, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 973, + "label": 2, + "text": "Android_Tactical_Assault_Kit:android tactical assault kit android tactical assault kit atak android smartphone geospatial infrastructure military situational awareness app built using nasa worldwind initially created 2010 air force research laboratory based nasa worldwind mobile codebase development deployment grew slowly rapidly since 2016 2013 officials draper laboratory said system would compatible android mobile operating systems could used navigation spatial awareness controlling drones atak plugin architecture allows developers add functionality atak polaris integrated ground guidance software atak plugin allow off-road routing mounted dismounted soldiers accounting terrain weather enemy activity equipment load connections programs atak began august 2010 originally based nasa worldwind mobile goal demonstrate robust information sharing mobile format oct 14 2014 u.s. army geospatial center recommended afrl android tactical assault kit atak world-leader esri commercial joint mapping tool kit cjmtk nasa world wind army globe engine age map engine driving nett warrior end user device atak selected due similar capabilities cjmtk similar risk less one-third total cost read full public released report nett warrior map engine trade study september 2015 darpa reported atak used successful demonstration persistent close air support program use thousands users according january 2016 article national defense magazine atak already fielded afsoc units atak excellent suitability coordinating people geography atak made available federal government users contractors need coordination atak also made available government researchers wish experiment geospatial collaboration without building systems versions addition android version also windows version wintak iphone version development itak wintak application developed microsoft windows operating system uses maps allow precise targeting intelligence surrounding land formations navigation generalized situational awareness developed conjunction atak provide similar functionality windows platform commercial licensing january 2015 afrl began licensing atak techlink u. s. companies commercial use support state/local government uses well civilian uses november 2015 twenty-five companies licensed atak commercial uses techlink licensing site", + "neighbors": [ + 337, + 973 + ], + "mask": "Validation" + }, + { + "node_id": 974, + "label": 2, + "text": "LXLE_Linux:lxle linux lxle linux distribution based upon recent ubuntu/lubuntu lts release using lxde desktop environment lxle lightweight distro focus visual aesthetics works well old new hardware january 2014 review full circle magazine gabriele tettamanzi noted lxle minor localization issues otherwise described nice light fast desktop rich software stable jesse smith reviewed lxle 12.04.3 distrowatch weekly jesse smith also reviewed lxde 14.04", + "neighbors": [ + 113, + 134, + 301, + 351, + 357, + 393, + 404, + 431, + 695, + 716, + 754, + 897, + 1046, + 1055, + 1126, + 1167, + 1276, + 1278, + 1286, + 1318, + 1369, + 1458, + 1538, + 1539, + 1558, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 975, + "label": 1, + "text": "GuideStar:guidestar guidestar usa inc. information service specializing reporting u.s. nonprofit companies 2016 database provided information 2.5 million organizations guidestar one first central sources information u.s. nonprofits world largest source information nonprofit organizations guidestar founded williamsburg virginia september 1994 received tax-exempt status 1996 year company began posting nonprofit organizations financial reports world wide web guidestar also serves verify recipient organization established donated funds go donor intended individuals looking give wake disasters 2013 guidestar announced major changes guidestar exchange program allows nonprofits supplement public information available irs guidestar nonprofit profiles implemented three seals based information nonprofit provides profile bronze silver gold 2016 new seal allowed nonprofits share progress results mission guidestar platinum introduced 2019 guidestar merged foundation center form new organization candid charity watch investigator compared charity navigator charity watch better business bureau combined federal campaign great nonprofits investigator praised guidestar offering information rather making judgments guidestar placed notice pages charities listed southern poverty law center splc hate list one groups sued guidestar defamation charities echoed criticism guidestar use splc list", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 976, + "label": 7, + "text": "Nvidia_GameWorks:nvidia gameworks nvidia gameworks middleware software suite developed nvidia visual fx physx optix sdks provide wide range enhancements pre-optimised nvidia gpus gameworks distributed form compiled dlls rather traditional source code competing solution development amd gpuopen announced free open-source software mit license march 2016 nvidia made source code gameworks available github nvidia gameworks consists several main components addition suite contains sample code directx opengl developers well tools debugging profiling optimization android development gameworks criticized proprietary closed nature competing gpu manufacturers amd intel unable properly optimize nvidia libraries hardware due developers allowed see code necessary properly optimize products amd chief gaming scientist richard huddy claimed developers use gameworks contractually forbidden work amd also claims gameworks adds specific performance-crippling effects older nvidia cards unnecessary tessellation marginally affects recent cards 2014 amd considering making open source gameworks competitor released gpuopen december 2015", + "neighbors": [ + 270, + 416, + 435, + 468, + 718, + 839, + 1138, + 1159, + 1219, + 1582, + 1592 + ], + "mask": "Test" + }, + { + "node_id": 977, + "label": 4, + "text": "IEEE_802.1X:ieee 802.1x ieee 802.1x ieee standard port-based network access control pnac part ieee 802.1 group networking protocols provides authentication mechanism devices wishing attach lan wlan ieee 802.1x defines encapsulation extensible authentication protocol eap ieee 802 known eap lan eapol eapol originally designed ieee 802.3 ethernet 802.1x-2001 clarified suit ieee 802 lan technologies ieee 802.11 wireless fiber distributed data interface iso 9314-2 802.1x-2004 eapol protocol also modified use ieee 802.1ae macsec ieee 802.1ar secure device identity devid 802.1x-2010 support service identification optional point point encryption local lan segment 802.1x authentication involves three parties supplicant authenticator authentication server supplicant client device laptop wishes attach lan/wlan term 'supplicant also used interchangeably refer software running client provides credentials authenticator authenticator network device provides data link client network allow block network traffic two ethernet switch wireless access point authentication server typically trusted server receive respond requests network access tell authenticator connection allowed various settings apply client connection setting authentication servers typically run software supporting radius eap protocols cases authentication server software may running authenticator hardware authenticator acts like security guard protected network supplicant i.e. client device allowed access authenticator protected side network supplicant identity validated authorized 802.1x port-based authentication supplicant must initially provide required credentials authenticator specified advance network administrator could include user name/password permitted digital certificate authenticator forwards credentials authentication server decide whether access granted authentication server determines credentials valid informs authenticator turn allows supplicant client device access resources located protected side network eapol operates data link layer ethernet ii framing protocol ethertype value 0x888e 802.1x-2001 defines two logical port entities authenticated port\u2014the controlled port uncontrolled port controlled port manipulated 802.1x pae port access entity allow authorized state prevent unauthorized state network traffic ingress egress to/from controlled port uncontrolled port used 802.1x pae transmit receive eapol frames 802.1x-2004 defines equivalent port entities supplicant supplicant implementing 802.1x-2004 may prevent higher level protocols used content authentication successfully completed particularly useful eap method providing mutual authentication used supplicant prevent data leakage connected unauthorized network typical authentication procedure consists windows xp windows vista windows 7 support 802.1x network connections default windows 2000 support latest service pack sp4 wired connections windows mobile 2003 later operating systems also come native 802.1x client open source project known open1x produces client xsupplicant client currently available linux windows main drawbacks open1x client provide comprehensible extensive user documentation fact linux vendors provide package general wpa_supplicant used 802.11 wireless networks wired networks support wide range eap types iphone ipod touch support 802.1x release ios 2.0 android support 802.1x since release 1.6 donut chrome os supported 802.1x since mid-2011 mac os x offered native support since 10.3 avenda systems provides supplicant windows linux mac os x also plugin microsoft nap framework avenda also offers health checking agents windows defaults responding 802.1x authentication requests 20 minutes failed authentication cause significant disruption clients block period configured using hkey_local_machine\\software\\microsoft\\dot3svc\\blocktime dword value hkey_local_machine\\software\\microsoft\\wlansvc\\blocktime wireless networks registry entered minutes hotfix required windows xp sp3 windows vista sp2 make period configurable wildcard server certificates supported eaphost windows component provides eap support operating system implication using commercial certification authority individual certificates must purchased windows xp major issues handling ip address changes result user-based 802.1x authentication changes vlan thus subnet clients microsoft stated back port sso feature vista resolves issues users logging roaming profiles hotfix must downloaded installed authenticating via peap peap-mschapv2 windows vista based computers connected via ip phone may authenticate expected result client placed wrong vlan hotfix available correct windows 7 based computers connected via ip phone may authenticate expected result client placed wrong vlan hotfix available correct windows 7 respond 802.1x authentication requests initial 802.1x authentication fails cause significant disruption clients hotfix available correct enterprises deploying rolling operating systems remotely worth noting windows pe native support 802.1x however support added winpe 2.1 winpe 3.0 hotfixes available microsoft although full documentation yet available preliminary documentation use hotfixes available via microsoft blog linux distributions support 802.1x via wpa_supplicant desktop integration like networkmanager eduroam international roaming service mandates use 802.1x authentication providing network access guests visiting eduroam enabled institutions bt british telecom plc employs identity federation authentication services delivered wide variety industries governments devices support 802.1x authentication examples include network printers ethernet-based electronics like environmental sensors cameras wireless phones devices used protected network environment alternative mechanisms must provided authenticate one option would disable 802.1x port leaves port unprotected open abuse another slightly reliable option use mab option mab configured port port first try check connected device 802.1x compliant reaction received connected device try authenticate aaa server using connected device mac address username password network administrator must make provisions radius server authenticate mac-addresses either adding regular users implementing additional logic resolve network inventory database many managed ethernet switches offer options summer 2005 microsoft steve riley posted article detailing serious vulnerability 802.1x protocol involving man middle attack summary flaw stems fact 802.1x authenticates beginning connection authentication possible attacker use authenticated port ability physically insert perhaps using workgroup hub authenticated computer port riley suggests wired networks use ipsec combination ipsec 802.1x would secure eapol-logoff frames transmitted 802.1x supplicant sent clear contain data derived credential exchange initially authenticated client therefore trivially easy spoof shared media used part targeted dos wired wireless lans eapol-logoff attack malicious third party access medium authenticator attached repeatedly sends forged eapol-logoff frames target device mac address authenticator believing targeted device wishes end authentication session closes target authentication session blocking traffic ingressing target denying access network 802.1x-2010 specification began 802.1af addresses vulnerabilities previous 802.1x specifications using macsec ieee 802.1ae encrypt data logical ports running top physical port ieee 802.1ar secure device identity devid authenticated devices stopgap enhancements widely implemented vendors extended 802.1x-2001 802.1x-2004 protocol allowing multiple concurrent authentication sessions occur single port prevents traffic devices unauthenticated mac addresses ingressing 802.1x authenticated port stop malicious device snooping traffic authenticated device provides protection mac spoofing eapol-logoff attacks ietf-backed alternative protocol carrying authentication network access pana also carries eap although works layer 3 using udp thus tied 802 infrastructure", + "neighbors": [ + 134, + 430, + 444, + 542, + 544, + 546, + 560, + 646, + 692, + 762, + 771, + 837, + 1042, + 1116, + 1151, + 1338, + 1373, + 1552, + 1572 + ], + "mask": "Test" + }, + { + "node_id": 978, + "label": 9, + "text": "Wally_Feurzeig:wally feurzeig wallace wally feurzeig june 10 1927 \u2013 january 4 2013 co-inventor seymour papert cynthia solomon programming language logo well-known researcher artificial intelligence ai wallace feurzeig born chicago parents mandel pauline feurzeig earned bachelor philosophy bachelor science degrees university chicago master science degree illinois institute technology worked argonne national laboratory university chicago joining bolt beranek newman bbn early 1960s bolt beranek newman become major center computer science research innovative applications 1962 wally feurzeig joined firm work newly available facilities artificial intelligence department one earliest ai organizations colleagues actively engaged pioneering ai work computer pattern recognition natural-language understanding automated theorem proving lisp language development robot problem solving much work done collaboration distinguished researchers massachusetts institute technology mit marvin minsky john mccarthy regular bbn consultants early 1960s groups bbn original work cognitive science instructional research man-computer communication first work knowledge representation reasoning semantic networks question answering interactive computer graphics computer-aided instruction cai actively underway j. c. r. licklider spiritual scientific leader much work championing cause on-line interaction era almost computing done via batch processing wally initial focus expanding intellectual abilities extant teaching systems led first intelligent cai system mentor employed production rules support problem-solving interactions medical diagnosis decision-making domains 1965 wally organized bbn educational technology department development computer methods improve learning teaching focus work shifted investigating programming languages educational environments shift partly due two recent technological advances invention computer time-sharing development first high-level conversational programming language idea sharing computer cycles among autonomous users working simultaneously stirred imagination cambridge 1963 1964 bbn mit teams raced first realize concept bbn winning days holding first successful demonstration computer time-sharing 1964 bbn initial system designed sheldon boilen supported five simultaneous users dec pdp-1 sharing one cathode-ray tube crt screen output seeing dynamic displays several distinct programs simultaneously asynchronously time tune breathtaking experience time sharing made feasible economic use remote distributed terminals opened possibilities interactive computer use schools bbn recently implemented telcomp one new breed high-level interactive programming languages telcomp dialect joss first conversational interpreted language developed 1962\u201363 cliff shaw rand corporation syntax similar language basic yet appeared like basic telcomp fortran-derived language originally designed numerical computational applications shortly telcomp created wally decided introduce children tool teach mathematics 1965\u201366 u.s. office education support explored use auxiliary resource eight elementary secondary schools served bbn time-sharing system students introduced telcomp worked standard arithmetic algebra trigonometry problems writing telcomp programs project strongly confirmed expectations use interactive computation high-level interpretive language would highly motivating students wally collaborators research daniel bobrow richard grant cynthia solomon bbn consultant seymour papert recently arrived mit jean piaget institute geneva idea programming language expressly designed children arose directly project group realized extant languages designed computation generally lacked facilities nonnumeric symbolic manipulation current languages inappropriate education respects also often employed extensive data type declarations got way students expressive impetus serious deficiencies control structures programs lacked procedural constructs facilities dynamic definition execution well-developed articulate debugging diagnostic editing facilities essential educational uses", + "neighbors": [ + 27, + 29, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 756, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1437, + 1466, + 1516, + 1536, + 1588, + 1609, + 1615, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 979, + "label": 3, + "text": "CPUID:cpuid codice_1 instruction identified codice_1 opcode processor supplementary instruction name derived cpu identification x86 architecture allowing software discover details processor introduced intel 1993 introduced pentium sl-enhanced 486 processors program use codice_1 determine processor type whether features mmx/sse implemented prior general availability codice_1 instruction programmers would write esoteric machine code exploited minor differences cpu behavior order determine processor make model outside x86 family developers mostly still required use esoteric processes involving instruction timing cpu fault triggers determine variations cpu design present motorola 680x0 family -- never cpuid instruction kind -- certain specific instructions required elevated privileges could used tell various cpu family members apart 68000 offered unprivileged move sr 2 different cpus could told apart cpu error condition triggered codice_1 instruction specific x86 architecture architectures like arm often provide on-chip registers read prescribed ways obtain sorts information provided x86 cpuid instruction codice_1 opcode 0fh a2h two bytes a20fh single word assembly language codice_1 instruction takes parameters codice_1 implicitly uses eax register determine main category information returned intel recent terminology called cpuid leaf codice_1 called codice_10 first store eax register highest eax calling parameter leaf cpu implements obtain extended function information codice_1 called significant bit eax set determine highest extended function calling parameter call codice_1 codice_13 cpuid leaves greater 3 less 80000000 accessible model-specific registers ia32_misc_disable.boot_nt4 bit 22 0 default name suggests windows nt4 boot properly unless bit set later versions windows need basic leaves greater 4 assumed visible current windows systems basic valid leaves go 14h information returned leaves disclosed publicly available documentation i.e reserved recently added leaves also sub-leaves selected via ecx register calling cpuid returns cpu manufacturer id string twelve-character ascii string stored ebx edx ecx order highest basic calling parameter largest value eax set calling codice_1 returned eax list processors highest function implemented following known processor manufacturer id strings following known id strings virtual machines instance genuineintel processor values returned ebx 0x756e6547 edx 0x49656e69 ecx 0x6c65746e following code written gnu assembler x86-64 architecture displays vendor id string well highest calling parameter cpu implements returns cpu stepping model family information register eax also called signature cpu feature flags registers edx ecx additional feature info register ebx processor info feature flags manufacturer specific usually intel values used manufacturers sake compatibility reserved fields masked using processor identification purposes returns list descriptors indicating cache tlb capabilities eax ebx ecx edx registers returns processor serial number processor serial number introduced intel pentium iii due privacy concerns feature longer implemented later models psn feature bit always cleared transmeta efficeon crusoe processors also provide feature amd cpus however implement feature cpu models intel pentium iii cpus serial number returned edx ecx registers transmeta efficeon cpus returned ebx eax registers transmeta crusoe cpus returned ebx register note processor serial number feature must enabled bios setting order function two leaves used processor topology thread core package cache hierarchy enumeration intel multi-core hyperthreaded processors amd use leaves alternate ways core enumeration unlike cpuid leaves leaf bh return different values edx depending logical processor cpuid instruction runs value returned edx actually x2apic id logical processor x2apic id space continuously mapped logical processors however gaps mapping meaning intermediate x2apic ids n't necessarily correspond logical processor additional information mapping x2apic ids cores provided registers although leaf bh sub-leaves selected ecx described value returned edx affected logical processor instruction running subleaf processor topology exposed leaf bh hierarchical one strange caveat order logical levels hierarchy n't necessarily correspond order physical hierarchy smt/core/package however every logical level queried ecx subleaf bh leaf correspondence level type either smt core invalid level id space starts 0 continuous meaning level id invalid higher level ids also invalid level type returned bits 15:08 ecx number logical processors level queried returned ebx finally connection levels x2apic ids returned eax 4:0 number bits x2apic id must shifted order obtain unique id next level example dual-core westmere processor capable hyperthreading thus two cores four threads total could x2apic ids 0 1 4 5 four logical processors leaf bh =eax subleaf 0 =ecx cpuid could instance return 100h ecx meaning level 0 describes smt hyperthreading layer return 2 ebx two logical processors smt units per physical core value returned eax 0-subleaf 1 case shifting aforementioned x2apic ids right one bit gives unique core number next level level id hierarchy erases smt id bit inside core simpler way interpret information last bit bit number 0 x2apic id identifies smt/hyperthreading unit inside core example advancing subleaf 1 making another call cpuid eax=bh ecx=1 could instance return 201h ecx meaning core-type level 4 ebx 4 logical processors package eax returned could value greater 3 happens bit number 2 used identify core x2apic id note bit number 1 x2apic id used example however eax returned level could well 4 happens clarkdale core i3 5x0 also gives unique id package level =0 obviusly shifting x2apic id 4 bits finally may wonder eax=4 leaf tell us n't find already eax 31:26 returns apic mask bits reserved package would 111b example bits 0 2 used identifying logical processors inside package bit 1 also reserved although used part logical processor identification scheme words apic ids 0 7 reserved package even though half values n't map logical processor cache hierarchy processor explored looking sub-leaves leaf 4 apic ids also used hierarchy convey information different levels cache shared smt units cores continue example l2 cache shared smt units core physical cores westmere indicated eax 26:14 set 1 information l3 cache shared whole package indicated setting bits least 111b cache details including cache type size associativity communicated via registers leaf 4 beware older versions intel app note 485 contain misleading information particularly respect identifying counting cores multi-core processor errors misinterpreting information even incorporated microsoft sample code using cpuid even 2013 edition visual studio also sandpile.org page cpuid intel code sample identifying processor topology correct interpretation current intel software developer \u2019 manual clear language open source cross-platform production code wildfire games also implements correct interpretation intel documentation topology detection examples involving older pre-2010 intel processors lack x2apic thus n't implement eax=bh leaf given 2010 intel presentation beware using older detection method 2010 newer intel processors may overestimate number cores logical processors old detection method assumes gaps apic id space assumption violated newer processors starting core i3 5x0 series newer processors also come x2apic topology correctly determined using eax=bh leaf method returns extended feature flags ebx ecx edx highest calling parameter returned eax returns extended feature flags edx ecx amd feature flags follows return processor brand string eax ebx ecx edx codice_1 must issued parameter sequence get entire 48-byte null-terminated ascii processor brand string necessary check whether feature present cpu issuing codice_1 codice_13 first checking returned value greater equal 80000004h function contains processor \u2019 l1 cache tlb characteristics returns details l2 cache ecx including line size bytes type associativity encoded 4 bits cache size function provides advanced power management feature identifiers returns largest virtual physical address sizes eax bits 07-00 physical address bits bits 15-8 linear address bits bits 31-16 reserved 0 could used hypervisor virtual machine system report physical/virtual address sizes possible virtual cpu specific amd k7 k8 cpus returns string hammer time eax ebx ecx edx information easy access languages well instance c code gcc prints first five values returned cpuid generally useful c implementation works 32- 64-bit systems gcc also provides header called codice_18 systems cpuid codice_19 macro expanding inline assembly typical usage would one requested extended feature present cpu would notice might get random unexpected results safer version also provided codice_18 checks extended features safety checks output values passed using reference-like macro parameters conventional pointers notice ampersands codice_21 conditional statement codice_22 call receives correct request return non-zero value fails zero microsoft visual c compiler builtin function codice_23 cpuid instruction may embedded without using inline assembly handy since x86-64 version msvc allow inline assembly program msvc would borland/embarcadero c compilers bcc32 native asm function calls necessary asm implementation pseudo code many interpreted compiled scripting languages capable using cpuid via ffi library one implementation shows usage ruby ffi module execute assembly language includes cpuid opcode non-x86 cpu architectures also provide certain forms structured information processor abilities commonly set special registers dsp transputer-like chip families taken instruction noticeable way spite relative terms many variations design alternate ways silicon identification might present example dsps texas instruments contain memory-based register set functional unit starts identifiers determining unit type model asic design revision features selected design phase continues unit-specific control data registers access areas performed simply using existing load store instructions thus devices need extending register set device identification purposes according note former intel app note 485 specifically cpuid incorporated intel\u00ae 64 ia-32 architectures software developer \u2019 manual manual however still directs reader app note 485 information latest published version app note 485 dating may 2012 available via archive.org app note 485 contains information easily misinterpreted though particularly respect big intel manuals tend lag behind intel isa document available top page updated even processors yet publicly available thus usually contains cpuid bits example writing isa book revision 19 dated may 2014 documents clflushopt bit leaf 7 big manuals although apparently up-to-date revision 51 dated june 2014 n't mention", + "neighbors": [ + 53, + 78, + 85, + 137, + 210, + 234, + 270, + 457, + 529, + 752, + 803, + 830, + 996, + 1009, + 1013, + 1016, + 1044, + 1158, + 1160, + 1161, + 1174, + 1208, + 1284, + 1351, + 1363, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 980, + "label": 3, + "text": "Out-of-order_execution:out-of-order execution computer engineering out-of-order execution formally dynamic execution paradigm used high-performance central processing units make use instruction cycles would otherwise wasted paradigm processor executes instructions order governed availability input data execution units rather original order program processor avoid idle waiting preceding instruction complete meantime process next instructions able run immediately independently out-of-order execution restricted form data flow computation major research area computer architecture 1970s early 1980s important academic research subject led yale patt hpsm simulator paper james e. smith a. r. pleszkun published 1985 completed scheme describing precise behavior exceptions could maintained out-of-order machines arguably first machine use out-of-order execution cdc 6600 1964 uses scoreboard resolve conflicts although modern usage scoreboarding considered in-order execution out-of-order execution since machines stall first raw conflict \u2013 strictly speaking machines initiate execution in-order although may complete execution out-of-order three years later ibm system/360 model 91 1966 introduced tomasulo algorithm makes full out-of-order execution possible 1990 ibm introduced first out-of-order microprocessor power1 although out-of-order execution limited floating-point instructions also case model 91 1990s out-of-order execution became common featured ibm/motorola powerpc 601 1993 fujitsu/hal sparc64 1995 intel pentium pro 1995 mips r10000 1996 hp pa-8000 1996 amd k5 1996 dec alpha 21264 1996 notable exceptions trend include sun ultrasparc hp/intel itanium intel atom silvermont architecture ibm power6 high logical complexity out-of-order technique reason reach mainstream machines mid-1990s many low-end processors meant cost-sensitive markets still use paradigm due large silicon area required implementation low power usage another design goal harder achieve out-of-order execution oooe design vulnerability microprocessor manufacturers implementations out-of-order execution mechanism reported manufacturers june 1 2017 publicized january 2018 exploitable vulnerability led millions vulnerable systems vulnerability named spectre similar vulnerability meltdown disclosed time took advantage assumption manufacturers made loading data processor cache allowing data cached privileged security boundary resulted race condition could timed leak privileged information earlier processors processing instructions performed instruction cycle normally consisting following steps new paradigm breaks processing instructions steps key concept oooe processing allow processor avoid class stalls occur data needed perform operation unavailable outline oooe processor avoids stall occurs step 2 in-order processor instruction completely ready processed due missing data oooe processors fill slots time instructions ready re-order results end make appear instructions processed normal way instructions ordered original computer code known program order processor handled data order order data operands become available processor registers fairly complex circuitry needed convert one ordering maintain logical ordering output processor runs instructions seemingly random order benefit oooe processing grows instruction pipeline deepens speed difference main memory cache memory processor widens modern machines processor runs many times faster memory time in-order processor spends waiting data arrive could processed large number instructions one differences created new paradigm creation queues allows dispatch step decoupled issue step graduation stage decoupled execute stage early name paradigm decoupled architecture earlier in-order processors stages operated fairly lock-step pipelined fashion instructions program may run correct order long end result correct separates fetch decode stages execute stage pipelined processor using buffer buffer purpose partition memory access execute functions computer program achieve high-performance exploiting fine-grain parallelism two effectively hides memory latency processor perspective larger buffer theory increase throughput however processor branch misprediction entire buffer may need flushed wasting lot clock cycles reducing effectiveness furthermore larger buffers create heat use die space reason processor designers today favour multi-threaded design approach decoupled architectures generally thought useful general purpose computing handle control intensive code well control intensive code include things nested branches occur frequently operating system kernels decoupled architectures play important role scheduling long instruction word vliw architectures avoid false operand dependencies would decrease frequency instructions could issued order technique called register renaming used scheme physical registers defined architecture physical registers tagged multiple versions architectural register exist time queue results necessary resolve issues branch mispredictions exceptions/traps results queue allows programs restarted exception requires instructions completed program order queue allows results discarded due mispredictions older branch instructions exceptions taken older instructions ability issue instructions past branches yet resolve known speculative execution", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 158, + 193, + 206, + 210, + 212, + 214, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 486, + 508, + 529, + 589, + 643, + 659, + 719, + 738, + 752, + 776, + 803, + 821, + 846, + 876, + 907, + 937, + 946, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1069, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 981, + "label": 5, + "text": "Bias_tee:bias tee bias tee three-port network used setting dc bias point electronic components without disturbing components bias tee diplexer low-frequency port used set bias high-frequency port passes radio-frequency signals blocks biasing levels combined port connects device sees bias rf called tee 3 ports often arranged shape t. conceptually bias tee viewed ideal capacitor allows ac blocks dc bias ideal inductor blocks ac allows dc although bias tees made simple inductor capacitor wideband bias tees considerably complicated practical components parasitic elements bias tees designed transmission-line environments typically characteristic impedance z 50 ohms 75 ohms impedance capacitor x chosen much less z impedance inductor x chosen much greater z \u03c9 angular frequency radians per second f frequency hertz bias tees designed operate range signal frequencies reactances chosen minimal impact lowest frequency wide-range bias tees inductor must large lowest frequency large inductor stray capacitance creates self-resonant frequency high enough frequency stray capacitance presents low-impedance shunt path signal bias tee becomes ineffective practical wide-band bias tees must use circuit topologies avoid shunt path instead one inductor series string inductors addition additional resistors capacitors prevent resonances example picosecond pulse labs model 5580 bias tee works 10 khz 15 ghz consequently simple design would need inductance least 800 \u03bch x j 50 ohms 10 khz inductor must still look like inductor 15 ghz however commercial 820 \u03bch inductor self-resonant frequency 1.8 mhz \u2013 four orders magnitude low johnson gives example wideband microstrip bias tee covering 50 khz 1 ghz using four inductors 330 nh 910 nh 18 \u00b5h 470 \u00b5h series design cribbed commercial bias tee modeled parasitic element values simulated results optimized component selection show advantage additional components johnson provided simulation bias tee used inductors capacitors without q suppression johnson provides simulated actual performance details girardi duplicated improved johnson design points additional construction issues bias tee used insert dc power ac signal power remote antenna amplifiers devices usually positioned receiving end coaxial cable pass dc power external source coaxial cable running powered device bias \u201c \u201d consists feed inductor deliver dc connector device side blocking capacitor keep dc passing receiver rf signal connected directly one connector blocking capacitor series internal blocking diode prevents damage bias \u201c \u201d reverse supply voltage applied bias tees used variety applications generally used provide rf signal dc power remote device running two separate cables would advantageous biasing often used photodiodes vacuum solid state microchannel plate detectors transistors triodes high frequencies signal leak common power supply rail conversely noise power supply appear signal line examples include power ethernet active antennas low-noise amplifiers converters telephone line plain old telephone service early microphones use bias tee circuit\u2014often gyrator replacing inductor\u2014this enables thin cable 2 conductors send power system device send audio device back system modern microphones often use 3 conductors phantom power circuit similar bias tee circuit several bias tee designs construction horizontal bar based rigid coaxial cable air dielectric radius chosen large possible without allowing higher modes design bias based upon power going remote device seen base station receiver using capacitor rf output terminal effectively creating open circuit dc current incoming rf signal one antenna output dc power front-end bias typically consists bandpass filter low noise amplifier mixer coupled local oscillator one point small slice cut center conductor therefore capacitor formed low frequencies blocked kind capacitor advantage nearly invisible higher frequencies pass frequencies 1 mhz capacitance increased dielectric like npo multiplies capacitance factor 65 thickness capacitor minimal without leading electric breakdown dielectric means avoid peaks electric field means smooth electrodes rounded edges dielectric protruding electrodes doorknob design stack capacitors used every capacitor needs access surface inner conductor hidden behind another capacitor high frequencies wo n't see electric field needs lot time travel dielectric high dielectric constant small coil made fine wire air core mnfezn-core connects inner conductor one sides capacitor port outer conductor leading t. frequencies 1 ghz hit coil side apply equal electric field whole coil therefore higher modes excited within coil inductiveness coil almost current leaks center conductor port frequencies 1 mhz 1 ghz leak port second coil cone shaped core outside outer conductor inside housing avoid interference components cone acts like tapered transmission line transformer starts high impedance lot power reflected rest travel coil leakage low frequency port oscillations capacitor coil composed lc circuit damped dielectric core also small coil 10 ohm resistance damp oscillations avoid ripple transmitted spectrum", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 982, + "label": 6, + "text": "SSHFS:sshfs computing sshfs ssh filesystem filesystem client mount interact directories files located remote server workstation normal ssh connection client interacts remote file system via ssh file transfer protocol sftp network protocol providing file access file transfer file management functionality reliable data stream designed extension secure shell protocol ssh version 2.0 current implementation sshfs using fuse rewrite earlier version rewrite done miklos szeredi also wrote fuse sftp provides secure file transfer secure remote file system sftp clients may transfer files directories related file system may mounted locally using sftp alone using sshfs remote file system may treated way volumes cds dvds usb flash drives shared disks using unix command ls sshfs sometimes list owner file correctly although possible map manually distributed remote file systems multiple users protocols apple filing protocol network file system server message block often used sshfs alternative protocols situations users confident files directories targeted writing another user time advantage sshfs compared network file system protocols given user already ssh access host require additional configuration work opening additional entry ports firewall", + "neighbors": [ + 34, + 40, + 55, + 63, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 365, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1452, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 983, + "label": 7, + "text": "Multisite_cloud:multisite cloud multisite cloud cloud composed several single sites data centers different providers explicitly accessible cloud users multisite cloud environment tasks program workflow scheduled order achieve efficient processing", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 984, + "label": 3, + "text": "Von_Neumann_architecture:von neumann architecture von neumann architecture\u2014also known von neumann model princeton architecture\u2014is computer architecture based 1945 description mathematician physicist john von neumann others first draft report edvac document describes design architecture electronic digital computer components term von neumann architecture evolved mean stored-program computer instruction fetch data operation occur time share common bus referred von neumann bottleneck often limits performance system design von neumann architecture machine simpler harvard architecture machine\u2014which also stored-program system one dedicated set address data buses reading writing memory another set address data buses fetch instructions stored-program digital computer keeps program instructions data read-write random-access memory ram stored-program computers advancement program-controlled computers 1940s colossus eniac programmed setting switches inserting patch cables route data control signals various functional units vast majority modern computers use memory data program instructions von neumann vs. harvard distinction applies cache architecture main memory split cache architecture earliest computing machines fixed programs simple computers still use design either simplicity training purposes example desk calculator principle fixed program computer basic mathematics run word processor games changing program fixed-program machine requires rewiring restructuring redesigning machine earliest computers much programmed designed particular task reprogramming \u2014when possible all\u2014was laborious process started flowcharts paper notes followed detailed engineering designs often-arduous process physically rewiring rebuilding machine could take three weeks set debug program eniac proposal stored-program computer changed stored-program computer includes design instruction set store memory set instructions program details computation stored-program design also allows self-modifying code one early motivation facility need program increment otherwise modify address portion instructions operators manually early designs became less important index registers indirect addressing became usual features machine architecture another use embed frequently used data instruction stream using immediate addressing self-modifying code largely fallen favor since usually hard understand debug well inefficient modern processor pipelining caching schemes large scale ability treat instructions data makes assemblers compilers linkers loaders automated programming tools possible makes programs write programs possible made sophisticated self-hosting computing ecosystem flourish around von neumann architecture machines high level languages leverage von neumann architecture providing abstract machine-independent way manipulate executable code runtime e.g. lisp using runtime information tune just-in-time compilation e.g languages hosted java virtual machine languages embedded web browsers smaller scale repetitive operations bitblt pixel vertex shaders accelerated general purpose processors just-in-time compilation techniques one use self-modifying code remained popular mathematician alan turing alerted problem mathematical logic lectures max newman university cambridge wrote paper 1936 entitled computable numbers application entscheidungsproblem published proceedings london mathematical society described hypothetical machine called universal computing machine known universal turing machine hypothetical machine infinite store memory today terminology contained instructions data john von neumann became acquainted turing visiting professor cambridge 1935 also turing phd year institute advanced study princeton new jersey 1936 \u2013 1937 whether knew turing paper 1936 time clear 1936 konrad zuse also anticipated two patent applications machine instructions could stored storage used data independently j. presper eckert john mauchly developing eniac moore school electrical engineering university pennsylvania wrote stored-program concept december 1943 von neumann involved manhattan project los alamos national laboratory required huge amounts calculation drew eniac project summer 1944 joined ongoing discussions design stored-program computer edvac part group wrote description titled first draft report edvac based work eckert mauchly unfinished colleague herman goldstine circulated von neumann name consternation eckert mauchly paper read dozens von neumann colleagues america europe influenced next round computer designs jack copeland considers historically inappropriate refer electronic stored-program digital computers 'von neumann machines los alamos colleague stan frankel said von neumann regard turing ideas time first draft report circulated turing producing report entitled proposed electronic calculator described engineering programming detail idea machine called automatic computing engine ace presented executive committee british national physical laboratory february 19 1946 although turing knew wartime experience bletchley park proposed feasible secrecy surrounding colossus subsequently maintained several decades prevented saying various successful implementations ace design produced von neumann turing papers described stored-program computers von neumann earlier paper achieved greater circulation computer architecture outlined became known von neumann architecture 1953 publication faster thought symposium digital computing machines edited b. v. bowden section chapter computers america reads follows machine institute advanced studies princeton 1945 professor j. von neumann working moore school engineering philadelphia e.n.i.a.c built issued behalf group co-workers report logical design digital computers report contained detailed proposal design machine since become known e.d.v.a.c electronic discrete variable automatic computer machine recently completed america von neumann report inspired construction e.d.s.a.c electronic delay-storage automatic calculator cambridge see page 130 1947 burks goldstine von neumann published another report outlined design another type machine parallel machine time would exceedingly fast capable perhaps 20,000 operations per second pointed outstanding problem constructing machine development suitable memory instantaneously accessible contents first suggested using special vacuum tube\u2014called selectron \u2014which princeton laboratories rca invented tubes expensive difficult make von neumann subsequently decided build machine based williams memory machine\u2014completed june 1952 princeton\u2014has become popularly known maniac design machine inspired least half dozen machines built america known affectionately johniacs book first two paragraphs chapter ace read follows automatic computation national physical laboratory one modern digital computers embodies developments improvements technique automatic electronic computing recently demonstrated national physical laboratory teddington designed built small team mathematicians electronics research engineers staff laboratory assisted number production engineers english electric company limited equipment far erected laboratory pilot model much larger installation known automatic computing engine although comparatively small bulk containing 800 thermionic valves judged plates xii xiii xiv extremely rapid versatile calculating machine basic concepts abstract principles computation machine formulated dr. a. m. turing f.r.s. paper read london mathematical society 1936 work machines britain delayed war 1945 however examination problems made national physical laboratory mr. j. r. womersley superintendent mathematics division laboratory joined dr. turing small staff specialists 1947 preliminary planning sufficiently advanced warrant establishment special group already mentioned april 1948 latter became electronics section laboratory charge mr. f. m. colebrook first draft described design used many universities corporations construct computers among various computers illiac ordvac compatible instruction sets date information following chronology difficult put proper order dates first running test program dates first time computer demonstrated completed dates first delivery installation decades 1960s 1970s computers generally became smaller faster led evolutions architecture example memory-mapped i/o lets input output devices treated memory single system bus could used provide modular system lower cost sometimes called streamlining architecture subsequent decades simple microcontrollers would sometimes omit features model lower cost size larger computers added features higher performance shared bus program memory data memory leads von neumann bottleneck limited throughput data transfer rate central processing unit cpu memory compared amount memory single bus access one two classes memory time throughput lower rate cpu work seriously limits effective processing speed cpu required perform minimal processing large amounts data cpu continually forced wait needed data move memory since cpu speed memory size increased much faster throughput bottleneck become problem problem whose severity increases every new generation cpu von neumann bottleneck described john backus 1977 acm turing award lecture according backus surely must less primitive way making big changes store pushing vast numbers words back forth von neumann bottleneck tube literal bottleneck data traffic problem importantly intellectual bottleneck kept us tied word-at-a-time thinking instead encouraging us think terms larger conceptual units task hand thus programming basically planning detailing enormous traffic words von neumann bottleneck much traffic concerns significant data find several known methods mitigating von neumann performance bottleneck example following improve performance problem also sidestepped somewhat using parallel computing using example non-uniform memory access numa architecture\u2014this approach commonly employed supercomputers less clear whether intellectual bottleneck backus criticized changed much since 1977 backus proposed solution major influence modern functional programming object-oriented programming much less geared towards pushing vast numbers words back forth earlier languages like fortran internally still computers spend much time even highly parallel supercomputers 1996 database benchmark study found three four cpu cycles spent waiting memory researchers expect increasing number simultaneous instruction streams multithreading single-chip multiprocessing make bottleneck even worse context multi-core processors additional overhead required maintain cache coherence processors threads aside von neumann bottleneck program modifications quite harmful either accident design simple stored-program computer designs malfunctioning program damage programs operating system possibly leading computer crash memory protection forms access control usually protect accidental malicious program modification", + "neighbors": [ + 29, + 51, + 61, + 76, + 78, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 246, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 359, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 681, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 919, + 937, + 940, + 946, + 980, + 994, + 1002, + 1009, + 1013, + 1016, + 1044, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1138, + 1174, + 1219, + 1220, + 1222, + 1224, + 1231, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 985, + "label": 9, + "text": "Gretl:gretl gretl open-source statistical package mainly econometrics name acronym g nu r egression e conometrics ime-series l ibrary graphical user interface gui command-line interface written c uses gtk+ widget toolkit creating gui calls gnuplot generating graphs native scripting language gretl known hansl see also used together tramo/seats r stata python octave ox julia gretl output models latex files besides english gretl also available albanian basque bulgarian catalan chinese czech french galician german greek italian polish portuguese varieties romanian russian spanish turkish ukrainian gretl reviewed several times journal applied econometrics recently australian economic review review also appeared journal statistical software 2008 since journal featured several articles gretl used implement various statistical techniques gretl offers fully documented xml-based data format also import ascii csv databank eviews excel gnumeric gnu octave jmulti opendocument spreadsheets pcgive rats 4 sas xport spss stata files export stata gnu octave r csv jmulti pcgive file formats gretl scripting language called hansl recursive acronym hansl neat scripting language hansl turing-complete interpreted programming language featuring loops conditionals user-defined functions complex data structures considered domain-specific language econometrics like scientifically oriented programming languages matlab julia matrices supported natively primitive variable type gretl add-ons known function packages written hansl simple example hansl running code produces random number generation rng gretl examined tested yalta schreiber 2012 authors conclude results show rng related procedures gretl implemented soundly perform well three crush test suites testu01 due libre nature breadth econometric techniques contains gretl widely used teaching econometrics undergraduate level onwards datasets gretl format available several popular textbooks following list textbooks use gretl software choice addition free supplement hill griffiths lim principles econometrics wiley available", + "neighbors": [ + 209, + 301, + 306, + 323, + 690, + 766, + 796, + 806, + 824, + 825, + 948, + 961, + 1006, + 1028, + 1059, + 1138, + 1190, + 1225, + 1509 + ], + "mask": "Test" + }, + { + "node_id": 986, + "label": 2, + "text": "Kernel_same-page_merging:kernel same-page merging computing kernel same-page merging abbreviated ksm also known kernel shared memory memory merging kernel feature makes possible hypervisor system share identical memory pages amongst different processes virtualized guests directly linked kernel-based virtual machine kvm use ksm merge memory pages occupied virtual machines ksm performs memory sharing scanning main memory finding duplicate pages detected duplicate pair merged single page mapped original locations page also marked copy-on-write cow kernel automatically separate one process modify data ksm originally intended run virtual machines one host sharing memory processes well virtual machines upon implementation different users found ksm also useful non-virtualized environments memory premium experimental implementation ksm red hat found 52 virtual instances windows xp 1 gb memory could run host computer 16 gb ram ksm merged linux kernel mainline kernel version 2.6.32 released december 3 2009 effective operating system kernel must find identical memory pages held different processes kernel also needs decide whether pages going update infrequently enough merging would efficient use processor resources concern although memory usage reduced cpu usage increased thus negating potential increases performance security also concern", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 716, + 720, + 723, + 725, + 736, + 754, + 897, + 935, + 1060, + 1063, + 1102, + 1105, + 1181, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1361, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 987, + "label": 9, + "text": "CMU_Common_Lisp:cmu common lisp cmucl free common lisp implementation originally developed carnegie mellon university cmucl runs unix-like platforms including linux bsd experimental windows port well steel bank common lisp derived cmucl scieneer common lisp commercial derivative cmucl earliest implementation predates common lisp part spice lisp around 1980 1985 rob maclachlan started re-writing compiler would become python compiler cmucl ported unix workstations ibm pc rt mips sparc early cmucl releases support intel x86 architecture due lack registers cmucl strictly separated type-tagged immediate data types garbage collector would rely knowing one half cpu registers could hold tagged types half untagged types leave enough registers python backend cmu canceled project favor dylan implementation using cmucl compiler base maintenance taken group volunteers 1996 group making regular releases infrastructure around time port intel x86 architecture completed first running freebsd later linux problem lacking registers solved new conservative garbage collector new garbage collector accepts value type registers treats anything might pointer pointer purpose collecting moving target", + "neighbors": [ + 27, + 46, + 134, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 392, + 446, + 447, + 503, + 506, + 536, + 565, + 601, + 649, + 653, + 753, + 787, + 795, + 796, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 1021, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1225, + 1245, + 1251, + 1269, + 1277, + 1298, + 1301, + 1315, + 1375, + 1385, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 988, + "label": 3, + "text": "ZiiLABS:ziilabs ziilabs global technology company producing line media-oriented application processors reference platforms enabling software series platforms named zms designed create products target range low-power consumer electronics embedded devices including android-based phones tablets ziilabs founded 1994 3dlabs became wholly owned subsidiary creative technology ltd 2002 january 2009 company re-branded ziilabs re-branding reflected 3dlabs focus supplying low-power media-rich application processors hardware platforms middleware rather 3d gpus previously case company announced first applications/media processor dms-02 2005 followed zms-05 zms-08 recently zms-20 zms-40 zms processors combine ziilabs \u2019 core asset stemcell computing array arm cores integrated peripheral functions create system chip soc 3dlabs company developed glint permedia gpus used personal workstation graphics cards 2002 company acquired intense3d group become vertically integrated graphics board vendor supplying workstation graphics card realizm brand 3dlabs stopped developing graphics gpus cards 2006 focus media processor business november 2012 creative technology limited announced entered agreement intel corporation intel license certain technology patents ziilabs inc. ltd acquire certain engineering resources assets related uk branch part 50 million deal ziilabs still wholly owned creative continues retain ownership stemcell media processor technologies patents continue supply support zms series chips customers company products include range arm-based zms processors feature so-called stemcell media processing architecture plus portfolio tablet reference platforms based in-house android board support package application software recent platform jaguar android reference tablet announced may 2011 core asset ziilabs zms chips seem array processing units called stemcells programmed perform media processing described 32-bit floating-point processing units likely form digital signal processor cores used accelerate various operations video codec 3d graphics handling zms processors handled programming array coprocessors job years number development platforms made introduced including zii development kits traditional large form factor systems", + "neighbors": [ + 85, + 112, + 120, + 214, + 294, + 607, + 661, + 681, + 853, + 907, + 917, + 1069, + 1147, + 1176, + 1178, + 1262, + 1305, + 1488, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 989, + "label": 2, + "text": "Windows_Aero:windows aero windows aero backronym authentic energetic reflective open design language introduced windows vista operating system changes made aero interface affected many elements windows interface including incorporation new look along changes interface guidelines reflecting appearance layout phrasing tone instructions text applications windows aero force development windows vista windows 7 2012 development windows 8 windows server 2012 microsoft moved design language codenamed metro aero interface unveiled windows vista complete redesign windows interface replacing windows xp luna theme release windows vista beta 1 july 2005 little shown aero public leaked builds previous user interfaces plex featured longhorn builds 3683\u20134042 slate first featured lab06 compile build 4042 used development reset jade builds 4074 4094 microsoft started using aero theme public builds build 5048 first build full-featured aero build 5219 build 5270 released december 2005 contained implementation aero theme virtually complete according sources microsoft though number stylistic changes introduced operating system release windows aero incorporated following features windows vista windows aero revised windows 7 several ui changes touch friendly interface many new visual effects features including pointing device gestures windows 8 windows server 2012 adopted metro design language inherit elements aero aero glass theme replaced flatter solid colored theme transparency effects removed interface aside taskbar maintains transparency longer blur effect flip 3d also removed switches metro-style apps pre-release versions windows 8 used updated version aero glass flatter squared look glass theme ultimately removed final version first time since release windows 95 microsoft completely revised user interface guidelines covering aesthetics common controls buttons radio buttons task dialogs wizards common dialogs control panels icons fonts user notifications tone text used windows vista windows 7 computers meet certain hardware software requirements aero glass theme used default primarily incorporating various animation transparency effects desktop using hardware acceleration desktop window manager dwm personalize section added control panel windows vista users customize glass effects either opaque transparent change color tinted enabling aero glass also enables new features including enhanced alt-tab menu taskbar thumbnails live previews windows flip 3d window switching mechanism cascades windows 3d effect windows 7 features refinements aero glass including larger window buttons default minimize maximize close query revised taskbar thumbnails ability manipulate windows dragging top sides screen side make fill half screen top maximize ability hide windows hovering show desktop button taskbar ability minimize windows shaking one use dwm extension aero glass theme requires video card 128mb graphics memory least 64mb video ram 1gb system ram on-board graphics supporting pixel shader 2.0 wddm-compatible drivers aero glass also available windows 7 starter available limited extent windows vista home basic automatically disabled user detected running non-genuine copy windows windows server 2008 windows server 2008 r2 also support aero glass part desktop experience component disabled default wizard 97 prevailing standard wizard design visual layout functionality used windows 98 windows server 2003 well microsoft products time frame aero wizards replacement wizard 97 incorporating visual updates match aesthetics rest aero well changing interaction flow specifically notifications allow application operating system component icon notification area create pop-up window information event problem windows first introduced windows 2000 known colloquially balloons similar appearance speech balloons commonly seen comics balloons often criticized prior versions windows due intrusiveness especially regard interacted full-screen applications games entire application minimized bubble came notifications aero aim less intrusive gradually fading appearing full-screen application screensaver displayed\u2014in cases notifications queued appropriate time larger icons multiple font sizes colors also introduced aero notification windows segoe ui typeface default font aero languages use latin greek cyrillic character sets default font size also increased 8pt 9pt improve readability segoe ui typeface prior windows 8 numeral zero 0 narrow capital letter wider windows 8 segoe ui keeps difference numeral one 1 top hook capital letter equal crown base windows 8 1 base crown base aero base icons designed iconfactory previously designed windows xp icons vista user experience guidelines also address issue tone writing text used aero user interface prior design guidelines microsoft done much address issue user interface text phrased way information requests presented user consistent parts operating system guidelines vista applications suggest messages present technically accurate advice concisely objectively positively assume intelligent user motivated solve particular problem specific advice includes use second person active voice e.g print photos camera avoidance words like please sorry thank", + "neighbors": [ + 26, + 66, + 79, + 93, + 111, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1608, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 990, + "label": 9, + "text": "PC-LISP:pc-lisp pc-lisp implementation franz lisp dialect peter ashwood-smith version 2.11 released may 15 1986 current version may downloaded external link currently pc-lisp ported 32 64 bit linux mac windows note franz lisp dialect immediate portable successor version maclisp perhaps closest thing lisp steven levy book practical operate pc-lisp runs well dos emulators modern windows versions pc-lisp implements franz lisp dynamically scoped predecessor modern common lisp therefore historically important implementation session running following code demonstrates dynamic scoping franz lisp note pc-lisp implement codice_1 special form emacs lisp provides local variables instead variables algol-based language would call global first dialect lisp incorporate algol scoping rules called lexical scoping scheme although common lisp language also added feature another example showing use backquote power lisp differentiation example", + "neighbors": [ + 27, + 46, + 170, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 991, + "label": 4, + "text": "Justniffer:justniffer justniffer tcp packet sniffer log network traffic 'standard web server-like customized way also log response times useful tracking network services performances e.g web server application server etc. output format traffic easily customized example written python delivered official package stores transferred contents output directory separated domains means transferred files like html css javascript images sounds etc saved directory justniffer born help troubleshooting performance network tcp-based services http rtsp sip smtp imap pop ldap telnet etc collect low high level protocol performance information reconstructing tcp flow reliable way using portions linux kernel code uses slightly modified version libnids libraries already include modified version linux kernel code reusable way extended external scripts bash python executable generate logs customizable way man page justniffer explains options", + "neighbors": [ + 134, + 138, + 160, + 1138, + 1225, + 1337, + 1395, + 1400, + 1448, + 1513, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 992, + "label": 2, + "text": "Debian_GNU/kFreeBSD:debian gnu/kfreebsd debian gnu/kfreebsd discontinued operating system released debian project used freebsd kernel gnu userland majority software debian gnu/kfreebsd built sources debian kernel packages freebsd k kfreebsd abbreviation kernel refers freebsd kernel discontinuing project debian maintained i386 amd64 ports last version debian kfreebsd debian 8 jessie rc3 debian gnu/kfreebsd created 2002 included debian 6.0 squeeze technology preview debian 7.0 wheezy official port debian gnu/kfreebsd discontinued officially supported platform debian 8.0 failed attract enough users justify burden rest project debian developers cited oss pf jails ndis zfs reasons interested freebsd kernel updated since debian 8 july 2019 however operating system continues maintained unofficially", + "neighbors": [ + 38, + 101, + 116, + 189, + 272, + 275, + 290, + 306, + 323, + 377, + 477, + 716, + 754, + 899, + 1011, + 1049, + 1138, + 1202, + 1214, + 1225, + 1227, + 1257, + 1278, + 1322, + 1397, + 1415, + 1428, + 1445, + 1509, + 1521 + ], + "mask": "Test" + }, + { + "node_id": 993, + "label": 4, + "text": "Port_scanner:port scanner port scanner application designed probe server host open ports application may used administrators verify security policies networks attackers identify network services running host exploit vulnerabilities port scan portscan process sends client requests range server port addresses host goal finding active port nefarious process majority uses port scan attacks rather simple probes determine services available remote machine portsweep scan multiple hosts specific listening port latter typically used search specific service example sql-based computer worm may portsweep looking hosts listening tcp port 1433 design operation internet based internet protocol suite commonly also called tcp/ip system network services referenced using two components host address port number 65536 distinct usable port numbers services use limited range port numbers port scanners scan common port numbers ports commonly associated vulnerable services given host result scan port usually generalized one three categories open ports present two vulnerabilities administrators must wary filtered ports tend present vulnerabilities forms port scanning rely assumption targeted host compliant rfc 793 transmission control protocol although case time still chance host might send back strange packets even generate false positives tcp/ip stack host non-rfc-compliant altered especially true less common scan techniques os-dependent fin scanning example tcp/ip stack fingerprinting method also relies types different network responses specific stimulus guess type operating system host running simplest port scanners use operating system network functions generally next option go syn feasible option described next nmap calls mode connect scan named unix connect system call port open operating system completes tcp three-way handshake port scanner immediately closes connection avoid performing denial-of-service attack otherwise error code returned scan mode advantage user require special privileges however using os network functions prevents low-level control scan type less common method noisy particularly portsweep services log sender ip address intrusion detection systems raise alarm syn scan another form tcp scanning rather using operating system network functions port scanner generates raw ip packets monitors responses scan type also known half-open scanning never actually opens full tcp connection port scanner generates syn packet target port open respond syn-ack packet scanner host responds rst packet closing connection handshake completed port closed unfiltered target instantly respond rst packet use raw networking several advantages giving scanner full control packets sent timeout responses allowing detailed reporting responses debate scan less intrusive target host syn scan advantage individual services never actually receive connection however rst handshake cause problems network stacks particular simple devices like printers conclusive arguments either way udp scanning also possible although technical challenges udp connectionless protocol equivalent tcp syn packet however udp packet sent port open system respond icmp port unreachable message udp port scanners use scanning method use absence response infer port open however port blocked firewall method falsely report port open port unreachable message blocked ports appear open method also affected icmp rate limiting alternative approach send application-specific udp packets hoping generate application layer response example sending dns query port 53 result response dns server present method much reliable identifying open ports however limited scanning ports application specific probe packet available tools e.g. nmap generally probes less 20 udp services commercial tools many 70 cases service may listening port configured respond particular probe packet ack scanning one unusual scan types exactly determine whether port open closed whether port filtered unfiltered especially good attempting probe existence firewall rulesets simple packet filtering allow established connections packets ack bit set whereas sophisticated stateful firewall might rarely used outdated nature window scanning fairly untrustworthy determining whether port opened closed generates packet ack scan checks whether window field packet modified packet reaches destination design flaw attempts create window size packet port open flagging window field packet 1 returns sender using scanning technique systems longer support implementation returns 0 window field labeling open ports closed since syn scans surreptitious enough firewalls general scanning blocking packets form syn packets fin packets bypass firewalls without modification closed ports reply fin packet appropriate rst packet whereas open ports ignore packet hand typical behavior due nature tcp ways inescapable downfall unusual scan types exist various limitations widely used nmap supports many internet service providers restrict customers ability perform port scans destinations outside home networks usually covered terms service acceptable use policy customer must agree isps implement packet filters transparent proxies prevent outgoing service requests certain ports example isp provides transparent http proxy port 80 port scans address appear port 80 open regardless target host actual configuration information gathered port scan many legitimate uses including network inventory verification security network port scanning however also used compromise security many exploits rely upon port scans find open ports send specific data patterns attempt trigger condition known buffer overflow behavior compromise security network computers therein resulting loss exposure sensitive information ability work threat level caused port scan vary greatly according method used scan kind port scanned number value targeted host administrator monitors host port scan often viewed first step attack therefore taken seriously disclose much sensitive information host despite probability port scan alone followed real attack small probability attack much higher port scan associated vulnerability scan inherently open decentralized architecture internet lawmakers struggled since creation define legal boundaries permit effective prosecution cybercriminals cases involving port scanning activities example difficulties encountered judging violations although cases rare time legal process involves proving intent commit break-in unauthorized access existed rather performance port scan 2006 uk parliament voted amendment computer misuse act 1990 person guilty offence makes adapts supplies offers supply article knowing designed adapted use course connection offence section 1 3 cma nevertheless area effect amendment blurred widely criticized security experts germany strafgesetzbuch \u00a7 202a b c also similar law council european union issued press release stating plan pass similar one albeit precise", + "neighbors": [ + 149, + 225, + 310, + 363, + 364, + 405, + 512, + 678, + 703, + 739, + 757, + 758, + 1138, + 1243, + 1552, + 1607 + ], + "mask": "Test" + }, + { + "node_id": 994, + "label": 3, + "text": "TRIPS_architecture:trips architecture trips microprocessor architecture designed team university texas austin conjunction ibm intel sun microsystems trips uses instruction set architecture designed easily broken large groups instructions graphs run independent processing elements design collects related data graphs attempting avoid expensive data reads writes keeping data high speed memory close processing elements prototype trips processor contains 16 elements trips hoped reach 1 tflop single processor papers published 2003 2006 computer programs consist series instructions stored memory processor runs program fetching instructions memory examining performing actions instruction calls early machines speed main memory generally order time basic operation within processor instance instruction adds two numbers might take three four instruction cycles fetching numbers memory might take one two cycles machines penalty data main memory instruction set architectures generally designed allow direct access instance add instruction might take value one location memory add value another store result third location introduction increasingly fast microprocessors cheap-but-slower dynamic ram changed equation dramatically modern machines fetching value main memory might take equivalent thousands cycles one key advances risc concept include processor registers earlier designs typically several dozen rather two three instructions formerly provided memory locations eliminated replaced ones worked registers loading data register explicit separate load action performed results explicitly saved back one could improve performance eliminating many memory instructions possible technique quickly reached limits since 1990s modern cpus added increasing amounts cpu cache increase local storage although cache slower registers since late 1990s performance gains mostly made use additional functional units allow instructions run parallel instance two addition instructions working different data run time effectively doubling speed program modern cpus generally dozens units integer math boolean logic floating point math long-data words others dealing memory housekeeping chores however programs work independent data instead use outputs one calculation input another limits set instructions run parallel factor based many instructions processor able examine on-the-fly level instruction parallelism quickly plateaued mid-2000s one attempt break limit long instruction word vliw concept vliw hands task looking instruction parallelism compiler removing processor theory allows entire program examined independent instructions sent processor order make maximal use functional units however proven difficult practice vliw processors become widely popular even case vliw another problem grown become issue traditional designs data instructions handled different parts cpu processing speeds low cause problems performance increased communication times one side chip registers functional units grows become significant fraction overall processing time gains performance registers distributed closer functional units trips processor based explicit data graph execution edge concept edge attempts bypass certain performance bottlenecks come dominate modern systems edge based processor able better understand instruction stream sent seeing linear stream individual instructions rather blocks instructions related single task using isolated data edge attempts run instructions block distributing internally along data need process compilers examine code find blocks code share information specific way assembled compiled hyperblocks fed cpu since compiler guaranteeing blocks specific interdependencies processor isolate code single functional unit local memory consider simple example adds two numbers memory adds result another value memory case traditional processor would notice dependency schedule instructions run one storing intermediate results registers edge processor interdependencies data code would noticed compiler would compile instructions single block block would fed along data needed complete single functional unit private set registers ensures additional memory fetching required well keeping registers physically close functional unit needs values code rely intermediate data would compiled separate hyperblocks course possible entire program would use data compilers also look instances data handed code effectively abandoned original block common access pattern case compiler still produce two separate hyperblocks explicitly encode handoff data rather simply leaving stored shared memory location processor see communications events schedule run proper order blocks considerable interdependencies re-arranged compiler spread communications order avoid bottlenecking transport effect change greatly increase isolation individual functional units edge processors limited parallelism capabilities compiler on-chip systems whereas modern processors reaching plateau four-wide parallelism edge designs scale much wider also scale deeper well handing blocks one unit another chain scheduled reduce contention due shared values university texas austin implementation edge concept trips processor tera-op reliable intelligently adaptive processing system trips cpu built repeating single basic functional unit many times needed trips design use hyperblocks loaded en-masse allows dramatic gains speculative execution whereas traditional design might hundred instructions examine possible scheduling functional units trips design thousands hundreds instructions per hyperblock hundreds hyperblocks examined leads greatly improved functional unit utilization scaling performance typical 4-issue superscalar design trips process three times many instructions per cycle traditional designs variety different types units integer floating point etc. allowing parallelism four-wide schedulers would otherwise allow however order keep units active instruction stream include different types instruction often case practice traditional cpus often lots idle functional units trips individual units general purpose allowing instruction run core avoid need carefully balance number different kinds cores also means trips design built number cores needed reach particular performance requirement single-core trips cpu simplified eliminated scheduler run set hyperblocks exactly like one hundreds cores slower better yet performance dependent types data fed meaning trips cpu run much wider variety tasks level performance instance traditional cpu fed math-heavy workload bog soon floating point units busy integer units lying idle fed data intensive program like database job floating point units lie idle integer units bog trips cpu every functional unit add performance every task every task run every unit designers refer polymorphic processor trips flexible regard developers suggested would even replace custom high-speed designs like dsps like trips dsps gain additional performance limiting data inter-dependencies unlike trips allowing limited workflow run trips would fast custom dsp workloads equally able run workloads time designers noted unlikely trips processor could used replace highly customized designs like gpus modern graphics cards may able replace outperform many lower-performance chips like used media processing reduction global register file also results non-obvious gains addition new circuitry modern processors meant overall size remained even move smaller process sizes result relative distance register file grown limits possible cycle speed due communications delays edge data generally local isolated well defined inter-core links eliminating large cross-chip delays means individual cores run higher speeds limited signaling time much shorter data paths combination two design changes effects greatly improves system performance goal produce single-processor system 1 tflops performance 2012 however 2008 gpus ati nvidia already exceeded 1 teraflop barrier albeit specialized applications traditional cpus contemporary 2007 mac pro using 2-core intel xeon perform 5 gflops single applications 2003 trips team started implementing prototype chip chip two complete cores one 16 functional units 4-wide 4-deep arrangement current implementation compiler constructs hyperblocks 128 instructions allows system keep 8 blocks flight time total 1,024 instructions per core basic design include 32 chips interconnected approaching 500 gflops", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 995, + "label": 4, + "text": "Higher-order_differential_cryptanalysis:higher-order differential cryptanalysis cryptography higher-order differential cryptanalysis generalization differential cryptanalysis attack used block ciphers standard differential cryptanalysis difference two texts used higher-order differential cryptanalysis studies propagation set differences larger set texts xuejia lai 1994 laid groundwork showing differentials special case general case higher order derivates lars knudsen year able show concept higher order derivatives used mount attacks block ciphers attacks superior standard differential cryptanalysis higher-order differential cryptanalysis notably used break kn-cipher cipher previously proved immune standard differential cryptanalysis block cipher maps formula_1-bit strings formula_1-bit strings fixed key thought function formula_3 standard differential cryptanalysis one interested finding pair input difference formula_4 output difference formula_5 two input texts difference formula_4 likely result output texts difference formula_5 i.e. formula_8 true many formula_9 note difference used xor usual case though definitions difference possible motivates defining derivative function formula_3 point formula_4 formula_12 using definition formula_13-th derivative formula_14 recursively defined formula_15 thus example formula_16 higher order derivatives defined many properties common ordinary derivative sum rule product rule importantly also taking derivative reduces algebraic degree function implement attack using higher order derivatives knowledge probability distribution derivative cipher needed calculating estimating distribution generally hard problem cipher question known low algebraic degree fact derivatives reduce degree used example cipher s-box function analysis known algebraic degree 8 9th order derivative must 0 therefore important cipher s-box function specific maximal close maximal degree defy attack cube attacks considered variant higher-order differential attacks works small low algebraic degree s-boxes small s-boxes addition xor operations", + "neighbors": [ + 32, + 104, + 174, + 284, + 289, + 382, + 633, + 969, + 1071, + 1181, + 1232, + 1233, + 1240, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 996, + "label": 2, + "text": "Page_table:page table page table data structure used virtual memory system computer operating system store mapping virtual addresses physical addresses virtual addresses used program executed accessing process physical addresses used hardware specifically ram subsystem page table key component virtual address translation necessary access data memory operating systems use virtual memory every process given impression working large contiguous sections memory physically memory process may dispersed across different areas physical memory may moved paged another storage typically hard disk drive process requests access data memory responsibility operating system map virtual address provided process physical address actual memory data stored page table operating system stores mappings virtual addresses physical addresses mapping also known page table entry pte cpu memory management unit mmu stores cache recently used mappings operating system page table called translation lookaside buffer tlb associative cache virtual address needs translated physical address tlb searched first match found tlb hit physical address returned memory access continue however match called tlb miss memory management unit operating system tlb miss handler typically look address mapping page table see whether mapping exists page walk one exists written back tlb must done hardware accesses memory tlb virtual memory system faulting instruction restarted may happen parallel well subsequent translation find tlb hit memory access continue page table lookup may fail two reasons physical memory full simple operation page written back physical memory page table tlb updated instruction restarted however physical memory full one pages physical memory need paged make room requested page page table needs updated mark pages previously physical memory longer mark page disk physical memory tlb also needs updated including removal paged-out page instruction restarted page page subject page replacement algorithms simplest page table systems often maintain frame table page table frame table holds information frames mapped advanced systems frame table also hold information address space page belongs statistics information background information page table holds mapping virtual address page address physical frame also auxiliary information page present bit dirty modified bit address space process id information amongst others secondary storage hard disk used augment physical memory pages paged physical memory disk present bit indicate pages currently present physical memory disk indicate treat different pages i.e whether load page disk page another page physical memory dirty bit allows performance optimization page disk paged physical memory read subsequently paged need written back disk since page changed however page written paged dirty bit set indicating page must written back backing store strategy requires backing store retain copy page paged memory dirty bit used backing store need large instantaneous total size paged-out pages moment dirty bit used times pages exist physical memory backing store operating systems single address space operating systems address space process id information necessary virtual memory management system knows pages associate process two processes may use two identical virtual addresses different purposes page table must supply different virtual memory mappings two processes done assigning two processes distinct address map identifiers using process ids associating process ids virtual memory pages also aid selection pages page pages associated inactive processes particularly processes whose main code page paged less likely needed immediately pages belonging active processes alternative tagging page table entries process-unique identifiers page table may occupy different virtual-memory page process page table becomes part process context implementation process page table paged whenever process longer resident memory several types page tables best suited different requirements essentially bare-bones page table must store virtual address physical address virtual address possibly address space information inverted page table ipt best thought off-chip extension tlb uses normal system ram unlike true page table necessarily able hold current mappings os must prepared handle misses would mips-style software-filled tlb ipt combines page table frame table one data structure core fixed-size table number rows equal number frames memory 4000 frames inverted page table 4000 rows row entry virtual page number vpn physical page number physical address data means creating collision chain see later search entries core ipt structure inefficient hash table may used map virtual addresses address space/pid information need index ipt collision chain used hash table known hash anchor table hashing function generally optimized coverage raw speed desirable course hash tables experience collisions due chosen hashing function may experience lot collisions usage entry table vpn provided check searched entry collision searching mapping hash anchor table used entry exists page fault occurs otherwise entry found depending architecture entry may placed tlb memory reference restarted collision chain may followed exhausted page fault occurs virtual address schema could split two first half virtual page number second half offset page major problem design poor cache locality caused hash function tree-based designs avoid placing page table entries adjacent pages adjacent locations inverted page table destroys spatial locality reference scattering entries operating system may minimize size hash table reduce problem trade-off increased miss rate normally one hash table contiguous physical memory shared processes per-process identifier used disambiguate pages different processes somewhat slow remove page table entries given process os may avoid reusing per-process identifier values delay facing alternatively per-process hash tables may used impractical memory fragmentation requires tables pre-allocated inverted page tables used example powerpc ultrasparc ia-64 architecture inverted page table keeps listing mappings installed frames physical memory however could quite wasteful instead could create page table structure contains mappings virtual pages done keeping several page tables cover certain block virtual memory example create smaller 1024-entry 4k pages cover 4m virtual memory useful since often top-most parts bottom-most parts virtual memory used running process top often used text data segments bottom stack free memory multilevel page table may keep smaller page tables cover top bottom parts memory create new ones strictly necessary smaller page tables linked together master page table effectively creating tree data structure need two levels possibly multiple ones virtual address schema could split three parts index root page table index sub-page table offset page multilevel page tables also referred hierarchical page tables mentioned creating page table structure contained mappings every virtual page virtual address space could end wasteful get around excessive space concerns putting page table virtual memory letting virtual memory system manage memory page table however part linear page table structure must always stay resident physical memory order prevent circular page faults look key part page table present page table present page table etc nested page tables implemented increase performance hardware virtualization providing hardware support page-table virtualization need emulate greatly reduced x86 virtualization current choices intel extended page table feature amd rapid virtualization indexing feature", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 85, + 99, + 134, + 170, + 171, + 185, + 187, + 225, + 265, + 322, + 347, + 359, + 387, + 413, + 465, + 477, + 583, + 664, + 723, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 961, + 966, + 979, + 1002, + 1011, + 1012, + 1013, + 1024, + 1027, + 1040, + 1049, + 1063, + 1138, + 1151, + 1155, + 1187, + 1202, + 1224, + 1301, + 1398, + 1415, + 1441, + 1474, + 1494, + 1518, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 997, + "label": 6, + "text": "Reiser4:reiser4 reiser4 computer file system successor reiserfs file system developed scratch namesys sponsored darpa well linspire reiser4 named former lead developer hans reiser reiser4 patch set still maintained according phoronix unlikely merged mainline linux without corporate backing goals reiser4 file system advanced reiser4 features user-defined transactions also available lack vfs api present reiser4 lacks standard file system features online repacker similar defragmentation utilities provided file systems creators reiser4 say implement later sooner someone pays reiser4 uses b*-trees conjunction dancing tree balancing approach underpopulated nodes merged flush disk except memory pressure transaction completes system also allows reiser4 create files directories without waste time space fixed blocks synthetic benchmarks performed namesys 2003 show reiser4 10 15 times faster serious competitor ext3 working files smaller 1 kib namesys benchmarks suggest typically twice performance ext3 general-purpose filesystem usage patterns benchmarks 2006 show results reiser4 slower many operations benchmarks conducted 2013 linux kernel version 3.10 show reiser4 considerably faster various tests compared in-kernel filesystems ext4 btrfs xfs reiser4 patches linux 2.6 3.x 4.x 5.x. reiser4 merged mainline linux kernel consequently still supported many linux distributions however predecessor reiserfs v3 widely adopted reiser4 also available andrew morton -mm kernel sources zen patch set linux kernel developers claim reiser4 follow linux coding standards hans reiser suggested political reasons latest released reiser4 kernel patches tools downloaded reiser4 project page sourceforge.net hans reiser convicted murder april 28 2008 leaving future reiser4 uncertain arrest employees namesys assured would continue work events would slow software development immediate future order afford increasing legal fees hans reiser announced december 21 2006 going sell namesys march 26 2008 sold although website unavailable january 2008 edward shishkin employee programmer namesys quoted cnet interview saying commercial activity namesys stopped shishkin others continued development reiser4 making source code available shishkin web site later relocated kernel.org since 2008 namesys employees received 100 sponsored funding darpa 2010 phoronix wrote edward shishkin exploring options get reiser4 merged linux kernel mainline file system still updated new kernel releases submitted merging 2015 michael larabel metioned unlikely happen without corporate backing suggested april 2019 main obstacle could renaming reiser4 refers initial author involved murder case", + "neighbors": [ + 34, + 40, + 55, + 63, + 82, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1459, + 1538, + 1565, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 998, + "label": 9, + "text": "MUMPS:mumps mumps massachusetts general hospital utility multi-programming system general-purpose computer programming language originally designed 1966 healthcare industry differentiating feature built-in database enabling high-level access disk storage using simple symbolic program variables subscripted arrays similar variables used languages access main memory continues used today many large hospitals banks provide high-throughput transaction data processing mumps developed neil pappalardo robert greenes curt marble dr. octo barnett animal lab massachusetts general hospital mgh boston 1966 1967 original mumps system like unix years later built spare dec pdp-7 octo barnett neil pappalardo also involved mgh planning hospital information system obtained backward compatible pdp-9 began using mumps admissions cycle laboratory test reporting mumps interpreted language yet even incorporated hierarchical database file system standardize interaction data aspects mumps traced rand corporation joss bbn telcomp stringcomp mumps team deliberately chose include portability machines design goal another feature widely supported machines era operating systems computer hardware multitasking also built language portability soon useful mumps shortly adapted dec pdp-15 lived time mumps developed support government research grant mumps released public domain longer requirement grants soon ported number systems including popular dec pdp-8 data general nova dec pdp-11 artronix pc12 minicomputer word mumps spread mostly medical community early 1970s widespread use often locally modified needs early 1970s many varied implementations mumps range hardware platforms widespread dec mumps-11 pdp-11 meditech miis 1972 many mumps users attended conference standardized then-fractured language created mumps users group mumps development committee mdc efforts proved successful standard complete 1974 approved september 15 1977 ansi standard x11.1-1977 time dec launched dsm-11 digital standard mumps pdp-11 quickly dominated market became reference implementation time also intersystems sold ism-11 pdp-11 identical dsm-11 early 1980s several vendors brought mumps-based platforms met ansi standard market significant companies developed important mumps implementations period also saw considerable mdc activity second revision ansi standard mumps x11.1-1984 approved november 15 1984 us department veterans affairs formerly veterans administration one earliest major adopters mumps language development work subsequent contributions free mumps application codebase influence many medical users worldwide 1995 veterans affairs patient admission/tracking/discharge system decentralized hospital computer program dhcp recipient computerworld smithsonian award best use information technology medicine july 2006 department veterans affairs va veterans health administration vha recipient innovations american government award presented ash institute john f. kennedy school government harvard university extension dhcp veterans health information systems technology architecture vista nearly entire va hospital system united states indian health service major parts department defense chcs hospital system use mumps databases clinical data tracking 2015 department defense awarded 10 year contract leidos cerner accenture replace chcs 2017 veterans health administration vha announced would replace vista cerner 2024 2025 2019 vha announced would also replace epic systems online appointment scheduling system one cerner 2024 healthcare companies using mumps include epic meditech ge healthcare formerly idx systems centricity ameripath part quest diagnostics care centric allscripts coventry healthcare emis sunquest information systems formerly misys healthcare many reference laboratories dasa quest diagnostics dynacare use mumps software written based antrim corporation code antrim purchased misys healthcare sunquest information systems 2001 mumps also widely used financial applications mumps gained early following financial sector use many banks credit unions used ameritrade largest online trading service us 12 billion transactions per day well bank england barclays bank among others since 2005 use mumps either form gt.m intersystems cach\u00e9 latter aggressively marketed intersystems success penetrating new markets telecommunications addition existing markets european space agency announced may 13 2010 use intersystems cach\u00e9 database support gaia mission mission aims map milky way unprecedented precision mumps language intended designed build database applications secondary language features included help programmers make applications using minimal computing resources original implementations interpreted though modern implementations may fully partially compiled individual programs run memory partitions early mumps memory partitions limited 2048 bytes aggressive abbreviation greatly aided multi-programming severely resource limited hardware one mumps job could fit small memories extant hardware time ability provide multi-user systems another language design feature word multi-programming acronym points even earliest machines running mumps supported multiple jobs running time change mini-computers micro-computers years later even single user pc single 8-bit cpu 16k 64k memory could support multiple users could connect non-graphical video display terminals since memory tight originally language design mumps valued terse code thus every mumps command function name could abbreviated one three letters length e.g quit exit program q p piece function r read command tr translate function spaces end-of-line markers significant mumps line scope promoted terse language design thus single line program code could express characters idea programming languages could require 5 10 times many characters abbreviation common feature languages designed period e.g. focal-69 early basics tiny basic etc. unfortunate side effect coupled early need write minimalist code mumps programmers routinely comment code used extensive abbreviations meant even expert mumps programmer could skim page code see function would analyze line line database interaction transparently built language mumps language provides hierarchical database made persistent sparse arrays implicitly opened every mumps application variable names prefixed caret character use permanent instead ram storage maintain values application exits visible modifiable running applications variables using shared permanent storage called globals mumps scoping variables globally available jobs system recent common use name global variables languages limited scoping names coming fact unscoped variables globally available programs running process shared among multiple processes mumps storage mode i.e globals stored persistent sparse arrays gives mumps database characteristics document-oriented database variable names prefixed caret character temporary private like global variables also hierarchical storage model locally available single job thus called locals globals locals child nodes called subscripts mumps terminology subscripts limited numerals\u2014any ascii character group characters subscript identifier uncommon modern languages perl javascript highly unusual feature late 1970s capability universally implemented mumps systems 1984 ansi standard canonically numeric subscripts required standard allowed thus variable named 'car subscripts door steering wheel engine contain value subscripts variable ^car door could nested variable subscript color example thus could say modify nested child node ^car mumps terms color 2nd subscript variable ^car names child-nodes child-nodes likewise called subscripts hierarchical variables similar objects properties many object oriented languages additionally mumps language design requires subscripts variables automatically kept sorted order numeric subscripts including floating-point numbers stored lowest highest non-numeric subscripts stored alphabetical order following numbers mumps terminology canonical order using non-negative integer subscripts mumps programmer emulate arrays data type languages although mumps natively offer full set dbms features mandatory schemas several dbms systems built top provide application developers flat-file relational network database features additionally built-in operators treat delimited string e.g. comma-separated values array early mumps programmers would often store structure related information delimited string parsing read saved disk access time offered considerable speed advantages hardware mumps data types numbers treated strings digits strings treated numbers numeric operators coerced mumps terminology coercion odd side effects however example string coerced parser turns much string starting left number discards rest thus statement codice_1 evaluated codice_2 mumps features language intended help mumps applications interact multi-user environment database locks process identifiers atomicity database update transactions required standard mumps implementations contrast languages c wirth traditions space characters mumps statements significant single space separates command argument space newline separates argument next mumps token commands take arguments e.g. codice_3 require two following spaces concept one space separates command nonexistent argument next separates argument next command newlines also significant codice_4 codice_3 codice_6 command processes skips everything else till end-of-line make statements control multiple lines must use codice_7 command create code block simple hello world program mumps might would run mumps command line command codice_8 since mumps allows commands strung together line since commands abbreviated single letter routine could made compact 'codice_9 text generates newline ansi x11.1-1995 gives complete formal description language annotated version standard available online data types one universal datatype implicitly coerced string integer floating-point datatypes context requires booleans called truthvalues mumps commands syntax expressions evaluated conditions string value evaluated numeric value nonzero value interpreted true codice_10 yields 1 less b 0 otherwise declarations none variables dynamically created first time value assigned lines important syntactic entities unlike status languages patterned c pascal multiple statements per line allowed common scope else command remainder current line case sensitivity commands intrinsic functions case-insensitive contrast variable names labels case-sensitive special meaning upper vs. lower-case widely followed conventions percent sign legal first character variables labels postconditionals execution almost command controlled following colon truthvalue expression codice_11 sets foo n less 10 codice_12 performs printerr n greater 100 construct provides conditional whose scope less full line abbreviation abbreviate nearly commands native functions one two three characters reserved words none since mumps interprets source code context need reserved words may use names language commands variables following perfectly legal mumps code mumps made obfuscated using contracted operator syntax shown terse example derived example arrays created dynamically stored b-trees sparse i.e use almost space missing nodes use number subscripts subscripts strings numeric including floating point arrays always automatically stored sorted order never occasion sort pack reorder otherwise reorganize database built functions data order next deprecated query functions provide efficient examination traversal fundamental array structure disk memory local arrays variable names beginning caret i.e stored memory process private creating process expire creating process terminates available storage depends implementation implementations using partitions limited partition size small partition might 32k implementations may several megabytes global arrays codice_13 stored disk available processes persistent creating process terminates large globals example hundreds gigabytes practical efficient implementations mumps main database mechanism used instead calling operating system create write read files indirection many contexts codice_14 used effectively substitutes contents vbl another mumps statement codice_15 sets variable abc 123. codice_16 performs subroutine named report substitution allows lazy evaluation late binding well effectively operational equivalent pointers languages piece function breaks variables segmented pieces guided user specified separator string sometimes called delimiter know awk find familiar codice_17 means third caret-separated piece stringvar piece function also appear assignment set command target codice_18 yields std codice_19 causes x become office world.std.com note p equivalent piece could written order function function treats input structure finds next index exists structure except last subscript returns sorted value ordered one given input treats array reference content-addressable data rather address value codice_20 yields 6 codice_21 yields 10 codice_22 yields 10 codice_23 yields 15 codice_24 yields argument-less repeats stopped terminating quit line prints table stuff successively 6 10 15 iterating database order function returns next key use multi-user/multi-tasking/multi-processor mumps supports multiple simultaneous users processes even underlying operating system e.g. ms-dos additionally ability specify environment variable specifying machine name variable codice_25 allow access data remote machines aspects mumps syntax differ strongly modern languages cause confusion whitespace allowed within expressions ends statement codice_26 error must written codice_27 operators precedence left-associative codice_28 evaluates 50 operators less equal greater equal codice_29 codice_30 boolean negation operator codice_31 plus strict comparison operator periods codice_32 used indent lines block whitespace else command need corresponding operates inspecting value builtin system variable codice_33 mumps scoping rules permissive modern languages declared local variables scoped using stack routine normally see declared locals routines call stack routines prevent routines call modifying declared locals contrast undeclared variables variables created using rather declaration scope routines running process remain scope program exits following positions supported knowledgeable people various times contention arose response strong advocacy part one commercial interest intersystems whose chief executive disliked name mumps felt represented serious marketing obstacle thus favoring extent became identified alignment intersystems dispute also reflected rivalry organizations technology association mumps development committee ansi iso standards committees determines official name language writers attempted defuse issue referring language umps square brackets customary notation optional syntax elements leading authority author open source mumps implementation professor kevin o'kane uses 'mumps recent standard iso/iec 11756:1999 re-affirmed 25 june 2010 still mentions mumps officially accepted names massachusetts general hospital registered mumps trademark uspto november 28 1971 renewed november 16 1992 let expire august 30 2003 mumps invites comparison pick operating system similarities include", + "neighbors": [ + 37, + 78, + 99, + 134, + 187, + 216, + 292, + 306, + 373, + 387, + 457, + 509, + 538, + 567, + 579, + 597, + 682, + 756, + 796, + 825, + 919, + 926, + 948, + 961, + 966, + 1028, + 1079, + 1095, + 1120, + 1138, + 1221, + 1225, + 1227, + 1235, + 1311, + 1324, + 1372, + 1457, + 1477, + 1494 + ], + "mask": "Test" + }, + { + "node_id": 999, + "label": 5, + "text": "Metro_Ring_Protocol:metro ring protocol metro ring protocol mrp layer 2 resilience protocol developed foundry networks currently delivered products manufactured brocade communications systems hewlett packard protocol quite tightly specifies topology layer 2 devices usually core larger network configured able achieve much faster failover times layer 2 protocols spanning tree", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1000, + "label": 3, + "text": "INT_16H:int 16h int 16h int 16h int 22 shorthand bios interrupt call 16hex 22nd interrupt vector x86-based computer system bios typically sets real mode interrupt handler vector provides keyboard services interruption responsible control pc keyboard interruption responsible obtaining basic keyboard functionality i.e responsible collecting keystrokes obtain status buffer keyboard etc standard encoding keyboard offers int 16 h us keyboard adapt coding int 16h another type keyboard example hebrew keyboard must attend scan-code key pressed perform suitable interpreting key want 101 letters keyboard keys int 16h interprets expanded keys scan-code different normal keys e.g. key pause", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1001, + "label": 2, + "text": "Notification_Center:notification center notification center feature ios macos provides overview alerts applications displays notifications user completes associated action rather requiring instant resolution users may choose applications appear notification center handled initially released ios 5 october 2011 notification center made available macs part os x mountain lion july 2012 notification center released ios 5 replace previous system dealing push local notifications instead interrupting user alert notification center instead displays banner top screen allows user continue using device disappears set period time previous notifications collated notification center panel displayed ios dragging status bar os x clicking notification center button using track-pad gestures swiping right left notifications may selected user redirects user application notification initially created marking alert read notification read removed panel users may also remove notifications without reading deleting individual alerts dismissing application alerts within application generating ios device locked new notifications appear lock screen users may access application generating alert swiping application icon finger left right along notification notification center iphone ipod touch also includes weather stocks widgets displaying information weather user current location stocks user selected stocks application feature available ipad os x release ios 7 added weather widget ipad notification center users also select option display twitter facebook buttons allowing send tweets update status directly notification center ios 7 however option send tweets update facebook statuses removed application uses push notifications system provided apple local notifications may use notification center users may customise want appear notification center may opt stop certain applications appearing center sending alerts screen os x users may also disable alerts banners day stopping notifications appearing screen however notifications sent time still visible notification center panel similar service included ios 6 part disturb feature", + "neighbors": [ + 33, + 66, + 71, + 75, + 99, + 121, + 130, + 228, + 252, + 269, + 356, + 394, + 395, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 797, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1138, + 1140, + 1178, + 1189, + 1237, + 1292, + 1305, + 1322, + 1334, + 1339, + 1373, + 1488, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1002, + "label": 3, + "text": "IA-64:ia-64 ia-64 also called intel itanium architecture instruction set architecture isa itanium family 64-bit intel microprocessors basic isa specification originated hewlett-packard hp evolved implemented new processor microarchitecture intel hp continued partnership expertise underlying epic design concepts order establish first new isa 20 years bring entirely new product line market intel made massive investment product definition design software development tools os software industry partnerships marketing support effort intel created largest design team history new marketing industry enabling team completely separate x86 first itanium processor codenamed merced released 2001 itanium architecture based explicit instruction-level parallelism compiler decides instructions execute parallel contrasts superscalar architectures depend processor manage instruction dependencies runtime itanium models including tukwila cores execute six instructions per clock cycle 2008 itanium fourth-most deployed microprocessor architecture enterprise-class systems behind x86-64 power isa sparc 1989 hp began become concerned reduced instruction set computing risc architectures approaching processing limit one instruction per cycle intel hp researchers exploring computer architecture options future designs separately began investigating new concept known long instruction word vliw came research yale university early 1980s vliw computer architecture concept like risc cisc single instruction word contains multiple instructions encoded one long instruction word facilitate processor executing multiple instructions clock cycle typical vliw implementations rely heavily sophisticated compilers determine compile time instructions executed time proper scheduling instructions execution also help predict direction branch operations value approach useful work fewer clock cycles simplify processor instruction scheduling branch prediction hardware requirements penalty increased processor complexity cost energy consumption exchange faster execution time hp begun believe longer cost-effective individual enterprise systems companies develop proprietary microprocessors intel also researching several architectural options going beyond x86 isa address high end enterprise server high performance computing hpc requirements thus intel hp partnered 1994 develop ia-64 isa using variation vliw design concepts intel named explicitly parallel instruction computing epic intel goal leverage expertise hp developed early vliw work along develop volume product line targeted high-end enterprise class servers high performance computing hpc systems could sold original equipment manufacturers oems hp wished able purchase off-the-shelf processors built using intel volume manufacturing leading edge process technology higher performance cost effective current pa-risc processors resulting products would intel hp would one many customers order achieve volumes necessary successful product line itanium products would required meet needs broader customer base software applications os development tools available customers required itanium products designed documented manufactured quality support consistent rest intel products therefore intel took lead microarchitecture design productization packaging test steps industry software operating system enabling linux windows nt marketing part intel definition marketing process engaged wide variety enterprise oem software os vendors well end customers order understand requirements ensure reflected product family meet needs broad range customers end-users hp made substantial contribution isa definition merced/itanium microarchitecture itanium 2 productization responsibility intel original goal delivering first itanium family product codenamed merced 1998 intel product marketing industry engagement efforts substantial achieved design wins majority enterprise server oem including based risc processors time industry analysts predicted ia-64 would dominate servers workstations high-end desktops eventually supplant risc complex instruction set computing cisc architectures general-purpose applications compaq silicon graphics decided abandon development alpha mips architectures respectively favor migrating ia-64 1997 apparent ia-64 architecture compiler much difficult implement originally thought delivery itanium began slipping since itanium first ever epic processor development effort encountered unanticipated problems team accustomed addition epic concept depends compiler capabilities never implemented research needed several groups developed operating systems architecture including microsoft windows unix unix-like systems linux hp-ux freebsd solaris tru64 unix monterey/64 last three canceled reaching market 1999 intel led formation open source industry consortium port linux ia-64 named trillium later renamed trillian due trademark issue led intel included caldera systems cern cygnus solutions hewlett-packard ibm red hat sgi suse turbolinux va linux systems result working ia-64 linux delivered ahead schedule first os run new itanium processors intel announced official name processor itanium october 4 1999 within hours name itanic coined usenet newsgroup pun name titanic unsinkable ocean liner sank maiden voyage 1912 time itanium released june 2001 performance superior competing risc cisc processors recognizing lack software could serious problem future intel made thousands early systems available independent software vendors isvs stimulate development hp intel brought next-generation itanium 2 processor market year later itanium 2 processor released 2002 relieved many performance problems original itanium processor mostly caused inefficient memory subsystem 2003 amd released opteron implemented 64-bit architecture x86-64 opteron gained rapid acceptance enterprise server space provided easy upgrade x86 intel responded implementing x86-64 em64t xeon microprocessors 2004 november 2005 major itanium server manufacturers joined intel number software vendors form itanium solutions alliance promote architecture accelerate software porting 2006 intel delivered montecito marketed itanium 2 9000 series dual-core processor roughly doubled performance decreased energy consumption 20 percent itanium 9300 series processor codenamed tukwila released 8 february 2010 greater performance memory capacity tukwila originally slated release 2007 device uses 65 nm process includes two four cores 24 mb on-die caches hyper-threading technology integrated memory controllers implements double-device data correction dddc helps fix memory errors tukwila also implements intel quickpath interconnect qpi replace itanium bus-based architecture peak interprocessor bandwidth 96 gb/s peak memory bandwidth 34 gb/s quickpath processor integrated memory controllers interfaces memory directly using qpi interfaces directly connect processors i/o hubs quickpath also used intel processors using nehalem microarchitecture making probable tukwila nehalem able use chipsets tukwila incorporates four memory controllers supports multiple ddr3 dimms via separate memory controller much like nehalem-based xeon processor code-named beckton itanium 9500 series processor codenamed poulson follow-on processor tukwila features eight cores 12-wide issue architecture multithreading enhancements new instructions take advantage parallelism especially virtualization poulson l3 cache size 32 mb l2 cache size 6 mb 512 kb 256 kb per core die size 544 mm\u00b2 less predecessor tukwila 698.75 mm\u00b2 isscc 2011 intel presented paper called 32nm 3.1 billion transistor 12-wide-issue itanium processor mission critical servers given intel history disclosing details itanium microprocessors isscc paper likely refers poulson analyst david kanter speculates poulson use new microarchitecture advanced form multi-threading uses many two threads improve performance single threaded multi-threaded workloads new information released hotchips conference new information presents improvements multithreading resiliency improvements instruction replay ras new instructions thread priority integer instruction cache prefetching data access hints kittson 9500 poulson slightly higher clocked january 2019 intel announced kittson would discontinued last order date january 2020 planned successor intel extensively documented itanium instruction set technical press provided overviews architecture renamed several times history hp originally called pa-wideword intel later called ia-64 itanium processor architecture ipa settling intel itanium architecture still widely referred ia-64 64-bit register-rich explicitly parallel architecture base data word 64 bits byte-addressable logical address space 2 bytes architecture implements predication speculation branch prediction uses variable-sized register windowing parameter passing mechanism also used permit parallel execution loops speculation prediction predication renaming control compiler instruction word includes extra bits approach distinguishing characteristic architecture architecture implements large number registers 128-bit instruction word called bundle contains three slots holding 41-bit instruction plus 5-bit template indicating type instruction slot types m-unit memory instructions i-unit integer alu non-alu integer long immediate extended instructions f-unit floating-point instructions b-unit branch long branch extended instructions template also encodes stops indicate data dependency exists data stop instructions pair stops constitute instruction group regardless bundling must free many types data dependencies knowledge allows processor execute instructions parallel without perform complicated data analysis since analysis already done instructions written within slot instructions predicated specifying predicate register value true false determine whether instruction executed predicated instructions always execute predicated codice_4 always reads true ia-64 assembly language instruction format deliberately designed written mainly compilers humans instructions must grouped bundles three ensuring three instructions match allowed template instructions must issue stops certain types data dependencies stops also used limited places according allowed templates fetch mechanism read two bundles per clock l1 cache pipeline compiler take maximum advantage processor execute six instructions per clock cycle processor thirty functional execution units eleven groups unit execute particular subset instruction set unit executes rate one instruction per cycle unless execution stalls waiting data units group execute identical subsets instruction set common instructions executed multiple units execution unit groups include ideally compiler often group instructions sets six execute time since floating-point units implement multiply\u2013accumulate operation single floating point instruction perform work two instructions application requires multiply followed add common scientific processing occurs processor execute four flops per cycle example 800 mhz itanium theoretical rating 3.2 gflops fastest itanium 2 1.67 ghz rated 6.67 gflops practice processor may often underutilized slots filled useful instructions due e.g data dependencies limitations available bundle templates densest possible code requires 42.6 bits per instruction compared 32 bits per instruction traditional risc processors time no-ops due wasted slots decrease density code additional instructions speculative loads hints branches cache difficult generate optimally even modern compilers 2002 2006 itanium 2 processors shared common cache hierarchy 16 kb level 1 instruction cache 16 kb level 1 data cache l2 cache unified instruction data 256 kb level 3 cache also unified varied size 1.5 mb 24 mb 256 kb l2 cache contains sufficient logic handle semaphore operations without disturbing main arithmetic logic unit alu main memory accessed bus off-chip chipset itanium 2 bus initially called mckinley bus usually referred itanium bus speed bus increased steadily new processor releases bus transfers 2\u00d7128 bits per clock cycle 200 mhz mckinley bus transferred 6.4 gb/s 533 mhz montecito bus transfers 17.056 gb/s itanium processors released prior 2006 hardware support ia-32 architecture permit support legacy server applications performance ia-32 code much worse native code also worse performance contemporaneous x86 processors 2005 intel developed ia-32 execution layer ia-32 el software emulator provides better performance montecito intel therefore eliminated hardware support ia-32 code 2006 release montecito intel made number enhancements basic processor architecture including see chipsets ... markets", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 134, + 175, + 193, + 195, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 292, + 314, + 335, + 388, + 397, + 443, + 445, + 457, + 460, + 486, + 491, + 508, + 571, + 589, + 643, + 659, + 719, + 752, + 755, + 776, + 803, + 815, + 821, + 846, + 868, + 907, + 925, + 937, + 961, + 980, + 984, + 994, + 996, + 1009, + 1013, + 1016, + 1052, + 1081, + 1111, + 1113, + 1125, + 1174, + 1193, + 1208, + 1219, + 1222, + 1224, + 1256, + 1263, + 1272, + 1284, + 1287, + 1290, + 1398, + 1421, + 1469, + 1505, + 1507, + 1518, + 1525, + 1538, + 1557, + 1578, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1003, + "label": 2, + "text": "LibreSSL:libressl libressl open-source implementation transport layer security tls protocol implementation named secure sockets layer ssl deprecated predecessor tls support removed release 2.3.0 openbsd project forked libressl openssl 1.0.1g april 2014 response heartbleed security vulnerability goals modernizing codebase improving security applying development best practices heartbleed security vulnerability discovered openssl openbsd team audited codebase decided necessary fork openssl remove dangerous code libressl.org domain registered 11 april 2014 project announced name 22 april 2014 first week development 90,000 lines c code removed unused code removed support obsolete operating systems removed libressl initially developed intended replacement openssl openbsd 5.6 ported platforms stripped-down version library stable project seeking stable commitment external funding 17 may 2014 bob beck presented libressl first 30 days future holds 2014 bsdcan conference described progress made first month 5 june 2014 several openssl bugs became public several projects notified advance libressl theo de raadt accused openssl developers intentionally withholding information openbsd libressl 20 june 2014 google created another fork openssl called boringssl promised exchange fixes libressl google already relicensed contributions isc license requested libressl developers 21 june 2014 theo de raadt welcomed boringssl outlined plans libressl-portable starting 8 july code porting macos solaris began initial porting linux began 20 june libressl default provider tls libressl selectable provider tls changes include replacement custom memory calls ones standard library example codice_1 codice_2 codice_3 codice_4 etc. process may help later catch buffer overflow errors advanced memory analysis tools observing program crashes via aslr use nx bit stack canaries etc. fixes potential double free scenarios also cited vcs commit logs including explicit assignments null pointer values extra sanity checks also cited commit logs related ensuring length arguments unsigned-to-signed variable assignments pointer values method returns order maintain good programming practice number compiler options flags designed safety enabled default help spotting potential issues fixed earlier -wall -werror -wextra -wuninitialized also code readability updates help future contributors verifying program correctness knf white-space line-wrapping etc. modification removal unneeded method wrappers macros also help code readability auditing error i/o abstraction library references changes made ensure libressl year 2038 compatible along maintaining portability similar platforms addition codice_5 codice_6 calls added prevent compiler optimizing prevent attackers reading previously allocated memory changes help ensure proper seeding random number generator-based methods via replacements insecure seeding practices taking advantage features offered kernel natively terms notable additions made openbsd added support newer reputable algorithms chacha stream cipher poly1305 message authentication code along safer set elliptic curves brainpool curves rfc 5639 512 bits strength initial release libressl added number features chacha poly1305 algorithm brainpool anssi elliptic curves aes-gcm chacha20-poly1305 aead modes later versions added following initial release libressl disabled number features default code features later removed including kerberos us-export ciphers tls compression dtls heartbeat ssl v2 ssl v3 later versions disabled features initial release libressl removed number features deemed insecure unnecessary deprecated part openbsd 5.6 dual ec drbg algorithm suspected back door cut along support fips 140-2 standard required unused protocols insecure algorithms also removed including support fips 140-2 md4/md5 j-pake srp one complaints openssl number open bugs reported bug tracker gone unfixed years older bugs fixed libressl", + "neighbors": [ + 11, + 35, + 38, + 78, + 88, + 99, + 134, + 172, + 195, + 225, + 235, + 260, + 261, + 295, + 306, + 319, + 333, + 379, + 412, + 533, + 539, + 542, + 554, + 655, + 692, + 800, + 813, + 826, + 864, + 899, + 922, + 961, + 1089, + 1114, + 1138, + 1227, + 1240, + 1318, + 1331, + 1339, + 1452, + 1459, + 1534, + 1582, + 1597, + 1604, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 1004, + "label": 2, + "text": "Snappy_(package_manager):snappy package manager snappy software deployment package management system developed canonical linux operating system packages called snaps tool using snapd work across range linux distributions allowing distro-agnostic upstream software packaging snappy originally designed ubuntu touch system designed work internet things cloud desktop computing snapcraft tool developing snap packages snap application packages software self-contained work across range linux distributions unlike traditional linux package management approaches like apt yum require specifically adapted packages linux distribution therefore adding delay application development deployment end-users snaps dependency app store obtained source therefore used upstream software deployment snaps deployed ubuntu versions linux ubuntu app store used default back-end stores enabled well developers use snaps create command line tools background services well desktop applications snap application upgrades via atomic operation deltas possible june 2016 snapd ported wide range linux distributions enable snaps used across linux distribution all-snap ubuntu core snapd also available progress arch linux centos debian fedora solus manjaro linux linux mint openembedded raspbian openwrt opensuse distribution able interpret snap metadata implement security expectations snap distribution-specific fashion snapcraft tool developers package programs snap format snappy snap file format single compressed filesystem based squashfs format mounted dynamically host operating system together declarative metadata interpreted snap system set appropriately shaped secure sandbox container application file format extension .snap snappy packaging deployed internet things environments ranging consumer-facing products enterprise device management gateways snappy included default ubuntu desktop images version 16.04 onwards developer screen capture tool peek discontinued support snap packages continuing support flatpak appimage stating developers systems administrators voiced complaints snap highly unsuitable mission-critical applications since autoupdates turned basic feature missing design choice snap developers led unexpected downtime services restart buggy software enters snap distribution system red hat employee adam williamson acknowledging bias criticized snap keeping server side closed source mechanism using third party servers sign contributor license agreement contribute development", + "neighbors": [ + 33, + 134, + 207, + 216, + 275, + 301, + 306, + 716, + 897, + 899, + 1046, + 1110, + 1126, + 1138, + 1167, + 1214, + 1225, + 1292, + 1366, + 1403, + 1547 + ], + "mask": "Train" + }, + { + "node_id": 1005, + "label": 9, + "text": "Hack_(programming_language):hack programming language hack programming language hiphop virtual machine hhvm created facebook dialect php language implementation open-source licensed mit license hack allows programmers use dynamic typing static typing kind type system called gradual typing also implemented programming languages actionscript hack type system allows types specified function arguments function return values class properties however types local variables always inferred specified hack introduced march 20 2014 announcement new programming language facebook already implemented code battle tested large portion web site hack designed interoperate seamlessly php widely used open-source scripting language focus web development embedded html majority valid php scripts also valid hack however numerous less frequently used php features language constructs supported hack hack extends type hinting available php 5 introduction static typing adding new type hints example scalar types integer string well extending use type hints example class properties function return values however types local variables specified since hack uses gradual typing system default mode type annotations mandatory even places inferred type system assume author correct admit code however strict mode available requires annotations thus enforces fully sound code basic file structure hack script similar php script changes hack file n't include codice_1 opening markup tag forbids using top-level declarations thus would need write code within entrypoint function entrypoint functions automatically executed top-level file automatically executed file included via include require autoloader like functions hack function names must unique within project \u2013 i.e projects multiple entrypoints call main \u00ab __entrypoint \u00bb function main void script similar php executed following output sent browser hello world important point note unlike php hack html code mix normally mix php html code together file like html /html type code supported hack either xhp another template engine needs used hack allows types specified function arguments function return values functions hack thus annotated types like following // hack functions annotated types function negate bool x bool", + "neighbors": [ + 78, + 178, + 201, + 216, + 306, + 373, + 378, + 509, + 538, + 567, + 579, + 682, + 790, + 796, + 825, + 872, + 919, + 948, + 1028, + 1120, + 1138, + 1221, + 1225, + 1227, + 1235, + 1242, + 1311, + 1457 + ], + "mask": "Test" + }, + { + "node_id": 1006, + "label": 9, + "text": "Fortress_(programming_language):fortress programming language fortress discontinued experimental programming language high-performance computing created sun microsystems funding darpa high productivity computing systems project one language designers guy l. steele jr. whose previous work includes scheme common lisp java name fortress intended connote secure fortran i.e. language high-performance computation provides abstraction type safety par modern programming language principles language features included implicit parallelism unicode support concrete syntax similar mathematical notation language designed similar fortran syntactically resembles scala standard ml haskell fortress designed outset multiple syntactic stylesheets source code rendered ascii text unicode prettied image would allow support mathematical symbols symbols rendered output easier reading emacs-based tool called fortify transforms ascii-based fortress source code latex output fortress also designed highly parallel rich functionality contained within libraries drawing java example codice_1 loop construct parallel operation would necessarily iterate strictly linear manner depending underlying implementation however codice_1 construct library function could replaced another version programmer liking rather built language fortress designers made syntax close possible pseudocode analyzed hundreds computer science mathematics papers courses books journals using pseudocode extract common usage patterns english language standard mathematical notation used represent algorithms pseudocode made compiler trying maintain one-to-one correspondence pseudocode executable fortress fortress one three languages created funding high productivity computing systems project others x10 ibm chapel cray inc november 2006 darpa approved funding third phase hpcs project x10 chapel funded fortress leading uncertainty future fortress january 2007 fortress transformed open-source project open-source community people outside sun write fortress code test using open-source fortress interpreter version 1.0 fortress language specification released april 2008 along compliant implementation targeting java virtual machine july 2012 steele announced active development fortress would cease brief winding-down period citing complications using fortress type system existing virtual machines fortress version archetypal hello world program presented fortress reference card export statement makes program executable every executable program fortress must implement run function file program saved compilation must name one specified initial component statement println function outputs hello world words screen", + "neighbors": [ + 210, + 227, + 251, + 272, + 308, + 399, + 538, + 567, + 579, + 690, + 770, + 796, + 806, + 824, + 825, + 831, + 948, + 985, + 1028, + 1059, + 1138, + 1168, + 1288, + 1318, + 1322, + 1430 + ], + "mask": "Test" + }, + { + "node_id": 1007, + "label": 0, + "text": "Machine_translation:machine translation machine translation sometimes referred abbreviation mt confused computer-aided translation machine-aided human translation maht interactive translation sub-field computational linguistics investigates use software translate text speech one language another basic level mt performs simple substitution words one language words another alone usually produce good translation text recognition whole phrases closest counterparts target language needed solving problem corpus statistical neural techniques rapidly growing field leading better translations handling differences linguistic typology translation idioms isolation anomalies current machine translation software often allows customization domain profession weather reports improving output limiting scope allowable substitutions technique particularly effective domains formal formulaic language used follows machine translation government legal documents readily produces usable output conversation less standardised text improved output quality also achieved human intervention example systems able translate accurately user unambiguously identified words text proper names assistance techniques mt proven useful tool assist human translators limited number cases even produce output used e.g. weather reports progress potential machine translation debated much history since 1950s number scholars questioned possibility achieving fully automatic machine translation high quality first notably yehoshua bar-hillel critics claim in-principle obstacles automating translation process idea machine translation may traced back 17th century 1629 ren\u00e9 descartes proposed universal language equivalent ideas different tongues sharing one symbol field machine translation appeared warren weaver memorandum translation 1949 first researcher field yehosha bar-hillel began research mit 1951 georgetown university mt research team followed 1951 public demonstration georgetown-ibm experiment system 1954 mt research programs popped japan russia 1955 first mt conference held london 1956 researchers continued join field association machine translation computational linguistics formed u.s. 1962 national academy sciences formed automatic language processing advisory committee alpac study mt 1964 real progress much slower however alpac report 1966 found ten-year-long research failed fulfill expectations funding greatly reduced according 1972 report director defense research engineering ddr e feasibility large-scale mt reestablished success logos mt system translating military manuals vietnamese conflict french textile institute also used mt translate abstracts french english german spanish 1970 brigham young university started project translate mormon texts automated translation 1971 xerox used systran translate technical manuals 1978 beginning late 1980s computational power increased became less expensive interest shown statistical models machine translation various mt companies launched including trados 1984 first develop market translation memory technology 1989 first commercial mt system russian english german-ukrainian developed kharkov state university 1991 mt web started systran offering free translation small texts 1996 followed altavista babelfish racked 500,000 requests day 1997 franz josef och future head translation development google darpa speed mt competition 2003 innovations time included moses open-source statistical mt engine 2007 text/sms translation service mobiles japan 2008 mobile phone built-in speech-to-speech translation functionality english japanese chinese 2009 recently google announced google translate translates roughly enough text fill 1 million books one day 2012 idea using digital computers translation natural languages proposed early 1946 a. d. booth possibly others warren weaver wrote important memorandum translation 1949 georgetown experiment means first application demonstration made 1954 apexc machine birkbeck college university london rudimentary translation english french several papers topic published time even articles popular journals example article cleave zacharov september 1955 issue wireless world similar application also pioneered birkbeck college time reading composing braille texts computer human translation process may described behind ostensibly simple procedure lies complex cognitive operation decode meaning source text entirety translator must interpret analyse features text process requires in-depth knowledge grammar semantics syntax idioms etc. source language well culture speakers translator needs in-depth knowledge re-encode meaning target language therein lies challenge machine translation program computer understand text person create new text target language sounds written person general application beyond current technology though works much faster automated translation program procedure human participation produce output even close quality human translator produce however provide general though imperfect approximation original text getting gist process called gisting sufficient many purposes including making best use finite expensive time human translator reserved cases total accuracy indispensable problem may approached number ways evolution accuracy improved machine translation use method based linguistic rules means words translated linguistic way \u2013 suitable orally speaking words target language replace ones source language often argued success machine translation requires problem natural language understanding solved first generally rule-based methods parse text usually creating intermediary symbolic representation text target language generated according nature intermediary representation approach described interlingual machine translation transfer-based machine translation methods require extensive lexicons morphological syntactic semantic information large sets rules given enough data machine translation programs often work well enough native speaker one language get approximate meaning written native speaker difficulty getting enough data right kind support particular method example large multilingual corpus data needed statistical methods work necessary grammar-based methods grammar methods need skilled linguist carefully design grammar use translate closely related languages technique referred rule-based machine translation may used rule-based machine translation paradigm includes transfer-based machine translation interlingual machine translation dictionary-based machine translation paradigms type translation used mostly creation dictionaries grammar programs unlike methods rbmt involves information linguistics source target languages using morphological syntactic rules semantic analysis languages basic approach involves linking structure input sentence structure output sentence using parser analyzer source language generator target language transfer lexicon actual translation rbmt biggest downfall everything must made explicit orthographical variation erroneous input must made part source language analyser order cope lexical selection rules must written instances ambiguity adapting new domains hard core grammar across domains domain-specific adjustment limited lexical selection adjustment transfer-based machine translation similar interlingual machine translation creates translation intermediate representation simulates meaning original sentence unlike interlingual mt depends partially language pair involved translation interlingual machine translation one instance rule-based machine-translation approaches approach source language i.e text translated transformed interlingual language i.e language neutral representation independent language target language generated interlingua one major advantages system interlingua becomes valuable number target languages turned increases however interlingual machine translation system made operational commercial level kant system nyberg mitamura 1992 designed translate caterpillar technical english cte languages machine translation use method based dictionary entries means words translated dictionary statistical machine translation tries generate translations using statistical methods based bilingual text corpora canadian hansard corpus english-french record canadian parliament europarl record european parliament corpora available good results achieved translating similar texts corpora still rare many language pairs first statistical machine translation software candide ibm google used systran several years switched statistical translation method october 2007 2005 google improved internal translation capabilities using approximately 200 billion words united nations materials train system translation accuracy improved google translate similar statistical translation programs work detecting patterns hundreds millions documents previously translated humans making intelligent guesses based findings generally human-translated documents available given language likely translation good quality newer approaches statistical machine translation metis ii presemt use minimal corpus size instead focus derivation syntactic structure pattern recognition development may allow statistical machine translation operate monolingual text corpus smt biggest downfall includes dependent upon huge amounts parallel texts problems morphology-rich languages especially translating languages inability correct singleton errors example-based machine translation ebmt approach proposed makoto nagao 1984 example-based machine translation based idea analogy approach corpus used one contains texts already translated given sentence translated sentences corpus selected contain similar sub-sentential components similar sentences used translate sub-sentential components original sentence target language phrases put together form complete translation hybrid machine translation hmt leverages strengths statistical rule-based translation methodologies several mt organizations claim hybrid approach uses rules statistics approaches differ number ways recently advent neural mt new version hybrid machine translation emerging combines benefits rules statistical neural machine translation approach allows benefitting pre- post-processing rule guided workflow well benefitting nmt smt downside inherent complexity makes approach suitable specific use cases one proponents approach complex use cases omniscien technologies deep learning based approach mt neural machine translation made rapid progress recent years google announced translation services using technology preference previous statistical methods word-sense disambiguation concerns finding suitable translation word one meaning problem first raised 1950s yehoshua bar-hillel pointed without universal encyclopedia machine would never able distinguish two meanings word today numerous approaches designed overcome problem approximately divided shallow approaches deep approaches shallow approaches assume knowledge text simply apply statistical methods words surrounding ambiguous word deep approaches presume comprehensive knowledge word far shallow approaches successful claude piron long-time translator united nations world health organization wrote machine translation best automates easier part translator job harder time-consuming part usually involves extensive research resolve ambiguities source text grammatical lexical exigencies target language require resolved ideal deep approach would require translation software research necessary kind disambiguation would require higher degree ai yet attained shallow approach simply guessed sense ambiguous english phrase piron mentions based perhaps kind prisoner-of-war camp often mentioned given corpus would reasonable chance guessing wrong fairly often shallow approach involves ask user ambiguity would piron estimate automate 25 professional translator job leaving harder 75 still done human one major pitfalls mt inability translate non-standard language accuracy standard language heuristic statistical based mt takes input various sources standard form language rule-based translation nature include common non-standard usages causes errors translation vernacular source colloquial language limitations translation casual speech present issues use machine translation mobile devices name entities narrow sense refer concrete abstract entities real world including people organizations companies places etc also refers expressing time space quantity 1 july 2011 79.99 named entities occur text analyzed statistical machine translation initial difficulty arises dealing named entities simply identifying text consider list names common particular language illustrate \u2013 common names different language also constantly changing named entities recognized machine translator may erroneously translated common nouns would likely affect bleu rating translation would change text human readability also possible identified named entities omitted output translation would also implications text readability message another way deal named entities use transliteration instead translation meaning find letters target language closely correspond name source language attempts incorporate machine translation adding transliteration step translation procedure however attempts still problems even cited worsening quality translation named entities still identified incorrectly words transliterated transliterated n't example southern california first word translated directly second word transliterated however machines would often transliterate treated one entity words like hard machine translators even transliteration component process lack attention issue named entity translation recognized potentially stemming lack resources devote task addition complexity creating good system named entity translation one approach named entity translation transliterate translate words second create do-not-translate list end goal \u2013 transliteration opposed translation approaches still rely correct identification named entities however third approach successful named entity translation class-based model method named entities replaced token represent class belong example ted erica would replaced person class token way statistical distribution use person names general analyzed instead looking distributions ted erica individually problem class based model solves probability given name specific language affect assigned probability translation study stanford improving area translation gives examples different probabilities assigned david going walk ankit going walk english target language due different number occurrences name training data frustrating outcome study stanford attempts improve named recognition translation many times decrease bleu scores translation result inclusion methods named entity translation work done utilization multiparallel corpora body text translated 3 languages using methods text translated 2 languages may utilized combination provide accurate translation third language compared one source languages used alone ontology formal representation knowledge includes concepts objects processes etc domain relations stored information linguistic nature one speak lexicon nlp ontologies used source knowledge machine translation systems access large knowledge base systems enabled resolve many especially lexical ambiguities following classic examples humans able interpret prepositional phrase according context use world knowledge stored lexicons machine translation system initially would able differentiate meanings syntax change large enough ontology source knowledge however possible interpretations ambiguous words specific context reduced areas usage ontologies within nlp include information retrieval information extraction text summarization ontology generated pangloss knowledge-based machine translation system 1993 may serve example ontology nlp purposes compiled system provides holy grail fully automatic high-quality machine translation unrestricted text many fully automated systems produce reasonable output quality machine translation substantially improved domain restricted controlled despite inherent limitations mt programs used around world probably largest institutional user european commission project example coordinated university gothenburg received 2.375 million euros project support eu create reliable translation tool covers majority eu languages development mt systems comes time budget cuts human translation may increase eu dependency reliable mt programs european commission contributed 3.072 million euros via isa programme creation mt ec statistical machine translation program tailored administrative needs eu replace previous rule-based machine translation system 2005 google claimed promising results obtained using proprietary statistical machine translation engine statistical translation engine used google language tools arabic english chinese english overall score 0.4281 runner-up ibm bleu-4 score 0.3954 summer 2006 tests conducted national institute standards technology recent focus terrorism military sources united states investing significant amounts money natural language engineering in-q-tel venture capital fund largely funded us intelligence community stimulate new technologies private sector entrepreneurs brought companies like language weaver currently military community interested translation processing languages like arabic pashto dari within languages focus key phrases quick communication military members civilians use mobile phone apps information processing technology office darpa hosts programs like tides babylon translator us air force awarded 1 million contract develop language translation technology notable rise social networking web recent years created yet another niche application machine translation software \u2013 utilities facebook instant messaging clients skype googletalk msn messenger etc \u2013 allowing users speaking different languages communicate machine translation applications also released mobile devices including mobile telephones pocket pcs pdas etc due portability instruments come designated mobile translation tools enabling mobile business networking partners speaking different languages facilitating foreign language learning unaccompanied traveling foreign countries without need intermediation human translator despite labelled unworthy competitor human translation 1966 automated language processing advisory committee put together united states government quality machine translation improved levels application online collaboration medical field investigated application technology medical settings human translators absent another topic research difficulties arise due importance accurate translations medical diagnoses many factors affect machine translation systems evaluated factors include intended use translation nature machine translation software nature translation process different programs may work well different purposes example statistical machine translation smt typically outperforms example-based machine translation ebmt researchers found evaluating english french translation ebmt performs better concept applies technical documents easily translated smt formal language certain applications however e.g. product descriptions written controlled language dictionary-based machine-translation system produced satisfactory translations require human intervention save quality inspection various means evaluating output quality machine translation systems oldest use human judges assess translation quality even though human evaluation time-consuming still reliable method compare different systems rule-based statistical systems automated means evaluation include bleu nist meteor lepor relying exclusively unedited machine translation ignores fact communication human language context-embedded takes person comprehend context original text reasonable degree probability certainly true even purely human-generated translations prone error therefore ensure machine-generated translation useful human publishable-quality translation achieved translations must reviewed edited human late claude piron wrote machine translation best automates easier part translator job harder time-consuming part usually involves extensive research resolve ambiguities source text grammatical lexical exigencies target language require resolved research necessary prelude pre-editing necessary order provide input machine-translation software output meaningless addition disambiguation problems decreased accuracy occur due varying levels training data machine translating programs example-based statistical machine translation rely vast array real example sentences base translation many sentences analyzed accuracy jeopardized researchers found program trained 203,529 sentence pairings accuracy actually decreases optimal level training data seems 100,000 sentences possibly training data increases number possible sentences increases making harder find exact translation match although concerns machine translation accuracy dr. ana nino university manchester researched advantages utilizing machine translation classroom one pedagogical method called using mt bad model mt bad model forces language learner identify inconsistencies incorrect aspects translation turn individual hopefully possess better grasp language dr. nino cites teaching tool implemented late 1980s end various semesters dr. nino able obtain survey results students used mt bad model well models overwhelmingly students felt observed improved comprehension lexical retrieval increased confidence target language early 2000s options machine translation spoken signed languages severely limited common belief deaf individuals could use traditional translators however stress intonation pitch timing conveyed much differently spoken languages compared signed languages therefore deaf individual may misinterpret become confused meaning written text based spoken language researchers zhao et al 2000 developed prototype called team translation english asl machine completed english american sign language asl translations program would first analyze syntactic grammatical morphological aspects english text following step program accessed sign synthesizer acted dictionary asl synthesizer housed process one must follow complete asl signs well meanings signs entire text analyzed signs necessary complete translation located synthesizer computer generated human appeared would use asl sign english text user works original subject copyright protection scholars claim machine translation results entitled copyright protection mt involve creativity copyright issue derivative work author original work original language lose rights work translated translator must permission publish translation", + "neighbors": [ + 159, + 282, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1219, + 1327, + 1440, + 1465, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1008, + "label": 3, + "text": "Joe_Blade:joe blade joe blade title series budget-price platform games written colin swinbourne published players three titles flick-screen adventures player controls title character number rooms dispatching enemies rescuing innocent people manner varies three games first joe blade title portrayed blade lone commando sent evil mastermind complex release number diplomats one earliest video games placed index germany due accusations glorified war villains resembled ss troopers game still legally obtainable effectively banned game distribution technologies internet available time german publications permitted advertise titles joe blade 2 took rather different approach first game instead soldier blade time vigilante taking city rid streets criminals rescuing old-age pensioners along way blade longer armed gun jump villains touching feet dispatch almost surreal take game stark contrast comparatively gritty realism first installment game also known considerably easier first title almost point many players managed complete game one hour-long sitting spectrum version game featured version invade-a-load featuring pac man joe blade 3 returned first title formula arming blade machine gun exclusively released zx spectrum amstrad cpc included commodore 64 instructions inlay commodore 64 version ever released 1991 players game prison riot plays similarly joe blade titles hacked version identifies joe blade 4 distributed internet", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1009, + "label": 3, + "text": "Microcode:microcode microcode computer hardware technique interposes layer organisation cpu hardware programmer-visible instruction set architecture computer microcode layer hardware-level instructions implement higher-level machine code instructions internal state machine sequencing many digital processing elements microcode used general-purpose central processing units although current desktop cpus fallback path cases faster hardwired control unit handle microcode typically resides special high-speed memory translates machine instructions state machine data input sequences detailed circuit-level operations separates machine instructions underlying electronics instructions designed altered freely also facilitates building complex multi-step instructions reducing complexity computer circuits writing microcode often called microprogramming microcode particular processor implementation sometimes called microprogram extensive microcoding allows small simple microarchitectures emulate powerful architectures wider word length execution units relatively simple way achieve software compatibility different products processor family hardware vendors especially ibm use term microcode synonym firmware way code within device termed microcode regardless microcode machine code example hard disk drives said microcode updated though typically contain microcode firmware lowest layer computer software stack traditionally raw binary machine code instructions processor microcode sits one level avoid confusion microprogram-related element differentiated micro prefix microinstruction microassembler microprogrammer microarchitecture etc engineers normally write microcode design phase processor storing read-only memory rom programmable logic array pla structure combination however machines also exist microcode stored sram flash memory traditionally denoted writeable control store context computers either read-only read-write memory latter case cpu initialization process loads microcode control store another storage medium possibility altering microcode correct bugs instruction set implement new machine instructions complex digital processors may also employ one possibly microcode-based control unit order delegate sub-tasks must performed essentially asynchronously parallel high-level programmer even assembly programmer normally see change microcode unlike machine code often retains backward compatibility among different processors family microcode runs exact electronic circuitry designed constitutes inherent part particular processor design microprograms consist series microinstructions control cpu fundamental level hardware circuitry example single typical horizontal microinstruction might specify following operations simultaneously control processor features one cycle microinstruction often wider 50 bits e.g. 128 bits 360/85 emulator feature microprograms carefully designed optimized fastest possible execution slow microprogram would result slow machine instruction degraded performance related application programs use instructions microcode originally developed simpler method developing control logic computer initially cpu instruction sets hardwired step needed fetch decode execute machine instructions including operand address calculations reads writes controlled directly combinational logic rather minimal sequential state machine circuitry efficient need powerful instruction sets multi-step addressing complex operations see made hard-wired processors difficult design debug highly encoded varied-length instructions contribute well especially irregular encodings used microcode simplified job allowing much processor behaviour programming model defined via microprogram routines rather dedicated circuitry even late design process microcode could easily changed whereas hard-wired cpu designs cumbersome change thus greatly facilitated cpu design 1940s late 1970s large portion programming done assembly language higher-level instructions mean greater programmer productivity important advantage microcode relative ease powerful machine instructions defined ultimate extension directly executable high level language designs statement high-level language pl/i entirely directly executed microcode without compilation ibm future systems project data general fountainhead processor examples 1970s cpu speeds grew quickly memory speeds numerous techniques memory block transfer memory pre-fetch multi-level caches used alleviate high-level machine instructions made possible microcode helped fewer complex machine instructions require less memory bandwidth example operation character string done single machine instruction thus avoiding multiple instruction fetches architectures instruction sets implemented complex microprograms included ibm system/360 digital equipment corporation vax approach increasingly complex microcode-implemented instruction sets later called cisc alternate approach used many microprocessors use plas roms instead combinational logic mainly instruction decoding let simple state machine without much microcode sequencing mos technology 6502 example microprocessor using pla instruction decode sequencing pla visible photomicrographs chip operation seen transistor-level simulation microprogramming still used modern cpu designs cases microcode debugged simulation logic functions substituted control store logic functions often faster less expensive equivalent microprogram memory processor microprograms operate primitive totally different much hardware-oriented architecture assembly instructions visible normal programmers coordination hardware microcode implements programmer-visible architecture underlying hardware need fixed relationship visible architecture makes easier implement given instruction set architecture wide variety underlying hardware micro-architectures ibm system/360 32-bit architecture 16 general-purpose registers system/360 implementations actually use hardware implemented much simpler underlying microarchitecture example system/360 model 30 8-bit data paths arithmetic logic unit alu main memory implemented general-purpose registers special unit higher-speed core memory system/360 model 40 8-bit data paths alu 16-bit data paths main memory also implemented general-purpose registers special unit higher-speed core memory model 50 full 32-bit data paths implements general-purpose registers special unit higher-speed core memory model 65 model 195 larger data paths implement general-purpose registers faster transistor circuits way microprogramming enabled ibm design many system/360 models substantially different hardware spanning wide range cost performance making architecturally compatible dramatically reduces number unique system software programs must written model similar approach used digital equipment corporation dec vax family computers result different vax processors use different microarchitectures yet programmer-visible architecture change microprogramming also reduces cost field changes correct defects bugs processor bug often fixed replacing portion microprogram rather changes made hardware logic wiring 1947 design mit whirlwind introduced concept control store way simplify computer design move beyond ad hoc methods control store diode matrix two-dimensional lattice one dimension accepts control time pulses cpu internal clock connects control signals gates circuits pulse distributor takes pulses generated cpu clock breaks eight separate time pulses activates different row lattice row activated activates control signals connected described another way signals transmitted control store played much like player piano roll controlled sequence wide words constructed bits played sequentially control store however song short repeated continuously 1951 maurice wilkes enhanced concept adding conditional execution concept akin conditional computer software initial implementation consisted pair matrices first one generated signals manner whirlwind control store second matrix selected row signals microprogram instruction word speak invoke next cycle conditionals implemented providing way single line control store could choose alternatives second matrix made control signals conditional detected internal signal wilkes coined term microprogramming describe feature distinguish simple control store microinstruction microprogram provides bits control functional elements internally compose cpu advantage hard-wired cpu internal cpu control becomes specialized form computer program microcode thus transforms complex electronic design challenge control cpu less complex programming challenge take advantage cpu divided several parts may also memory address register memory data register used access main computer storage together elements form execution unit modern cpus several execution units even simple computers usually one unit read write memory another execute user code elements could often brought together single chip chip comes fixed width would form slice execution unit known bit slice chips amd am2900 family one best known examples bit slice elements parts execution units execution units interconnected bundle wires called bus programmers develop microprograms using basic software tools microassembler allows programmer define table bits symbolically close relationship underlying architecture microcode several properties make difficult generate using compiler simulator program intended execute bits way electronics allows much freedom debug microprogram microprogram finalized extensively tested sometimes used input computer program constructs logic produce data program similar used optimize programmable logic array even without fully optimal logic heuristically optimized logic vastly reduce number transistors number required rom control store reduces cost producing electricity consumed cpu microcode characterized horizontal vertical referring primarily whether microinstruction controls cpu elements little decoding horizontal microcode requires extensive decoding combinatorial logic vertical microcode consequently horizontal microinstruction wider contains bits occupies storage space vertical microinstruction horizontal microcode several discrete micro-operations combined single microinstruction simultaneous operation horizontal microcode typically contained fairly wide control store uncommon word 108 bits tick sequencer clock microcode word read decoded used control functional elements make cpu typical implementation horizontal microprogram word comprises fairly tightly defined groups bits example one simple arrangement might type micromachine implement jump instruction address following opcode microcode might require two clock ticks engineer designing would write microassembler source code looking something like tick common find portions cpu used remaining groups bits microinstruction no-ops careful design hardware microcode property exploited parallelise operations use different areas cpu example case alu required first tick could potentially used complete earlier arithmetic instruction vertical microcode microinstruction significantly encoded bit fields generally pass intermediate combinatory logic turn generates actual control sequencing signals internal cpu elements alu registers etc. contrast horizontal microcode bit fields either directly produce control sequencing signals minimally encoded consequently vertical microcode requires smaller instruction lengths less storage requires time decode resulting slower cpu clock vertical microcode assembly language simple conventional computer emulating complex computer processors dec alpha processors cmos microprocessors later ibm system/390 mainframes z/architecture mainframes palcode term used alpha processors millicode term used ibm mainframe microprocessors form machine code access special registers hardware resources available regular machine code used implement instructions functions page table walks alpha processors another form vertical microcode two fields field select selects part cpu controlled word control store field value actually controls part cpu type microcode designer explicitly chooses make slower cpu save money reducing unused bits control store however reduced complexity may increase cpu clock frequency lessens effect increased number cycles per instruction transistors became cheaper horizontal microcode came dominate design cpus using microcode vertical microcode used less often vertical horizontal microcode used horizontal microcode may referred nanocode picocode computers built using writable microcode design rather storing microcode rom hard-wired logic microcode stored ram called writable control store wcs computer sometimes called writable instruction set computer wisc many experimental prototype computers use writable control stores also commercial machines use writable microcode burroughs small systems early xerox workstations dec vax 8800 nautilus family symbolics l- g-machines number ibm system/360 system/370 implementations dec pdp-10 machines data general eclipse mv/8000 many machines offer user-programmable writable control stores option including hp 2100 dec pdp-11/60 varian data machines v-70 series minicomputers ibm system/370 includes facility called initial-microprogram load iml impl invoked console part power-on reset por another processor tightly coupled multiprocessor complex commercial machines example ibm 360/85 read-only storage writable control store microcode wcs offers several advantages including ease patching microprogram certain hardware generations faster access roms provide user-programmable wcs allows user optimize machine specific purposes starting pentium pro 1995 several x86 cpus writable intel microcode example allowed bugs intel core 2 intel xeon microcodes fixed patching microprograms rather requiring entire chips replaced second prominent example set microcode patches intel offered processor architectures 10 years age bid counter security vulnerabilities discovered designs spectre meltdown went public start 2018 microcode update installed linux freebsd microsoft windows motherboard bios design trend toward heavily microcoded processors complex instructions began early 1960s continued roughly mid-1980s point risc design philosophy started becoming prominent cpu uses microcode generally takes several clock cycles execute single instruction one clock cycle step microprogram instruction cisc processors include instructions take long time execute variations interfere interrupt latency far important modern systems pipelining designing new processor hardwired control risc following advantages microcoded cisc counterpoints well many risc vliw processors designed execute every instruction long cache single cycle similar way cpus microcode execute one microinstruction per cycle vliw processors instructions behave similarly wide horizontal microcode although typically without fine-grained control hardware provided microcode risc instructions sometimes similar narrow vertical microcode microcoding popular application-specific processors network processors microcontrollers digital signal processors channel controllers disk controllers network interface controllers graphics processing units hardware modern cisc implementations x86 family decode instructions dynamically buffered micro-operations \u03bcops instruction encoding similar risc traditional microcode hardwired instruction decode unit directly emits \u03bcops common x86 instructions falls back traditional microcode rom complex rarely used instructions example x86 might look \u03bcops microcode handle complex multistep operations loop string instructions floating point unit transcendental functions unusual values denormal numbers special purpose instructions cpuid", + "neighbors": [ + 51, + 61, + 76, + 78, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 234, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 374, + 388, + 445, + 457, + 460, + 465, + 491, + 503, + 508, + 529, + 579, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 979, + 980, + 984, + 994, + 1002, + 1013, + 1016, + 1022, + 1044, + 1052, + 1072, + 1081, + 1111, + 1113, + 1118, + 1125, + 1174, + 1188, + 1213, + 1217, + 1219, + 1220, + 1222, + 1231, + 1256, + 1263, + 1272, + 1284, + 1290, + 1319, + 1335, + 1346, + 1372, + 1398, + 1414, + 1469, + 1499, + 1503, + 1505, + 1507, + 1511, + 1518, + 1519, + 1523, + 1525, + 1557, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1010, + "label": 9, + "text": "TinyScheme:tinyscheme tinyscheme free software implementation scheme programming language lightweight scheme interpreter subset rrs standard meant used embedded scripting interpreter programs much functionality tinyscheme included conditionally allow developers balance features size/footprint tinyscheme used gnu image manipulation program gimp starting version 2.4 released 2007 gimp previously used siod tinyscheme used core direct revenue adware making world widely distributed scheme runtime", + "neighbors": [ + 27, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 1011, + "label": 3, + "text": "Microkernel:microkernel computer science microkernel often abbreviated \u03bc-kernel near-minimum amount software provide mechanisms needed implement operating system os mechanisms include low-level address space management thread management inter-process communication ipc hardware provides multiple rings cpu modes microkernel may software executing privileged level generally referred supervisor kernel mode traditional operating system functions device drivers protocol stacks file systems typically removed microkernel instead run user space terms source code size microkernels often smaller monolithic kernels minix 3 microkernel example approximately 12,000 lines code microkernels trace roots back danish computer pioneer per brinch hansen tenure danish computer company regnecentralen led software development efforts rc 4000 computer 1967 regnecentralen installing rc 4000 prototype polish fertilizer plant pu\u0142awy computer used small real-time operating system tailored needs plant brinch hansen team became concerned lack generality reusability rc 4000 system feared installation would require different operating system started investigate novel general ways creating software rc 4000 1969 effort resulted completion rc 4000 multiprogramming system nucleus provided inter-process communication based message-passing 23 unprivileged processes 8 time protected one another implemented scheduling time slices programs executed parallel initiation control program execution request running programs initiation data transfers peripherals besides elementary mechanisms built-in strategy program execution resource allocation strategy implemented hierarchy running programs parent processes complete control child processes acted operating systems following brinch hansen work microkernels developed since 1970s term microkernel first appeared later 1981 microkernels meant response changes computer world several challenges adapting existing mono-kernels new systems new device drivers protocol stacks file systems low-level systems developed time code normally located monolithic kernel thus required considerable work careful code management work microkernels developed idea services would implemented user-space programs like allowing worked monolithically started stopped like program would allow services easily worked also separated kernel code allow finely tuned without worrying unintended side effects moreover would allow entirely new operating systems built common core aiding os research microkernels hot topic 1980s first usable local area networks introduced mechanisms allowed kernel distributed user space also allowed system distributed across network links first microkernels notably mach proved disappointing performance inherent advantages appeared great major line research late 1990s however time speed computers grew greatly relation networking systems disadvantages performance came overwhelm advantages development terms many attempts made adapt existing systems better performance overhead always considerable efforts required user-space programs moved back kernel 2000 large-scale mach-like efforts ended although apple macos released 2001 uses hybrid kernel called xnu combines heavily modified hybrid osfmk 7.3 kernel code bsd unix kernel also used ios tvos watchos mach-based gnu hurd also functional included testing versions arch linux debian although major work microkernels largely ended experimenters continued development since shown many performance problems earlier designs fundamental limitation concept instead due designer desire use single-purpose systems implement many services possible using pragmatic approach problem including assembly code relying processor enforce concepts normally supported software led new series microkernels dramatically improved performance microkernels closely related exokernels also much common hypervisors latter make claim minimality specialized supporting virtual machines indeed l4 microkernel frequently finds use hypervisor capacity early operating system kernels rather small partly computer memory limited capability computers grew number devices kernel control also grew throughout early history unix kernels generally small even though contained various device drivers file system implementations address spaces increased 16 32 bits kernel design longer constrained hardware architecture kernels began grow larger berkeley software distribution bsd unix began era larger kernels addition operating basic system consisting cpu disks printers bsd added complete tcp/ip networking system number virtual devices allowed existing programs work 'invisibly network growth continued many years resulting kernels millions lines source code result growth kernels prone bugs became increasingly difficult maintain microkernel intended address growth kernels difficulties resulted theory microkernel design allows easier management code due division user space services also allows increased security stability resulting reduced amount code running kernel mode example networking service crashed due buffer overflow networking service memory would corrupted leaving rest system still functional inter-process communication ipc mechanism allows separate processes communicate usually sending messages shared memory strictly speaking also inter-process communication mechanism abbreviation ipc usually refers message passing latter particularly relevant microkernels ipc allows operating system built number small programs called servers used programs system invoked via ipc support peripheral hardware handled fashion servers device drivers network protocol stacks file systems graphics etc ipc synchronous asynchronous asynchronous ipc analogous network communication sender dispatches message continues executing receiver checks polls availability message alerted via notification mechanism asynchronous ipc requires kernel maintains buffers queues messages deals buffer overflows also requires double copying messages sender kernel kernel receiver synchronous ipc first party sender receiver blocks party ready perform ipc require buffering multiple copies implicit rendezvous make programming tricky programmers prefer asynchronous send synchronous receive first-generation microkernels typically supported synchronous well asynchronous ipc suffered poor ipc performance jochen liedtke assumed design implementation ipc mechanisms underlying reason poor performance l4 microkernel pioneered methods lowered ipc costs order magnitude include ipc system call supports send well receive operation making ipc synchronous passing much data possible registers furthermore liedtke introduced concept direct process switch ipc execution incomplete context switch performed sender directly receiver l4 part message passed registers transfers in-register part message without copying furthermore overhead invoking scheduler avoided especially beneficial common case ipc used rpc-type fashion client invoking server another optimization called lazy scheduling avoids traversing scheduling queues ipc leaving threads block ipc ready queue scheduler invoked moves threads appropriate waiting queue many cases thread gets unblocked next scheduler invocation approach saves significant work similar approaches since adopted qnx minix 3 series experiments chen bershad compared memory cycles per instruction mcpi monolithic ultrix microkernel mach combined 4.3bsd unix server running user space results explained mach poorer performance higher mcpi demonstrated ipc alone responsible much system overhead suggesting optimizations focused exclusively ipc limited impact liedtke later refined chen bershad results making observation bulk difference ultrix mach mcpi caused capacity cache-misses concluding drastically reducing cache working set microkernel solve problem client-server system communication essentially synchronous even using asynchronous primitives typical operation client invoking server waiting reply also lends efficient implementation microkernels generally followed l4 lead provided synchronous ipc primitive asynchronous ipc could implemented top using helper threads however experience shown utility synchronous ipc dubious synchronous ipc forces multi-threaded design onto otherwise simple systems resulting synchronization complexities moreover rpc-like server invocation sequentializes client server avoided running separate cores versions l4 deployed commercial products therefore found necessary add asynchronous notification mechanism better support asynchronous communication signal-like mechanism carry data therefore require buffering kernel two forms ipc nonetheless violated principle minimality versions l4 switched asynchronous ipc completely synchronous ipc blocks first party ready unrestricted use could easily lead deadlocks furthermore client could easily mount denial-of-service attack server sending request never attempting receive reply therefore synchronous ipc must provide means prevent indefinite blocking many microkernels provide timeouts ipc calls limit blocking time practice choosing sensible timeout values difficult systems almost inevitably use infinite timeouts clients zero timeouts servers consequence trend towards providing arbitrary timeouts flag indicates ipc fail immediately partner ready approach effectively provides choice two timeout values zero infinity recent versions l4 minix gone path older versions l4 used timeouts qnx avoids problem requring client specify reply buffer part message send call server replies kernel copies data client buffer without wait client receive response explicitly microkernel servers essentially daemon programs like others except kernel grants privileges interact parts physical memory otherwise limits programs allows servers particularly device drivers interact directly hardware basic set servers general-purpose microkernel includes file system servers device driver servers networking servers display servers user interface device servers set servers drawn qnx provides roughly set services offered unix monolithic kernel necessary servers started system startup provide services file network device access ordinary application programs servers running environment user application server development similar ordinary application development rather build-and-boot process needed kernel development additionally many crashes corrected simply stopping restarting server however part system state lost failing server hence approach requires applications cope failure good example server responsible tcp/ip connections server restarted applications experience lost connection normal occurrence networked system services failure less expected may require changes application code qnx restart capability offered qnx high availability toolkit device drivers frequently perform direct memory access dma therefore write arbitrary locations physical memory including various kernel data structures drivers must therefore trusted common misconception means must part kernel fact driver inherently less trustworthy part kernel running device driver user space necessarily reduce damage misbehaving driver cause practice beneficial system stability presence buggy rather malicious drivers memory-access violations driver code opposed device may still caught memory-management hardware furthermore many devices dma-capable drivers made untrusted running user space recently increasing number computers feature iommus many used restrict device access physical memory also allows user-mode drivers become untrusted user-mode drivers actually predate microkernels michigan terminal system mts 1967 supported user space drivers including file system support first operating system designed capability historically drivers less problem number devices small trusted anyway kernel simplified design avoided potential performance problems led traditional driver-in-the-kernel style unix linux windows nt proliferation various kinds peripherals amount driver code escalated modern operating systems dominates kernel code size microkernel must allow building arbitrary operating system services top must provide core functionality minimum includes minimal design pioneered brinch hansen nucleus hypervisor ibm vm since formalised liedtke minimality principle concept tolerated inside microkernel moving outside kernel i.e. permitting competing implementations would prevent implementation system required functionality everything else done usermode program although device drivers implemented user programs may processor architectures require special privileges access i/o hardware related minimality principle equally important microkernel design separation mechanism policy enables construction arbitrary systems top minimal kernel policy built kernel overwritten user level therefore limits generality microkernel policy implemented user-level servers changed replacing servers letting application choose competing servers offering similar services efficiency microkernels contain schedulers manage timers violation minimality principle principle policy-mechanism separation start booting microkernel-based system requires device drivers part kernel typically means packaged kernel boot image kernel supports bootstrap protocol defines drivers located started traditional bootstrap procedure l4 microkernels microkernels simplify placing key drivers inside kernel violation minimality principle lynxos original minix examples even include file system kernel simplify booting microkernel-based system may boot via multiboot compatible boot loader systems usually load statically-linked servers make initial bootstrap mount os image continue bootstrapping key component microkernel good ipc system virtual-memory-manager design allows implementing page-fault handling swapping usermode servers safe way since services performed usermode programs efficient means communication programs essential far monolithic kernels design ipc system makes breaks microkernel effective ipc system must low overhead also interact well cpu scheduling mainstream processors obtaining service inherently expensive microkernel-based system monolithic system monolithic system service obtained single system call requires two mode switches changes processor ring cpu mode microkernel-based system service obtained sending ipc message server obtaining result another ipc message server requires context switch drivers implemented processes function call implemented procedures addition passing actual data server back may incur extra copying overhead monolithic system kernel directly access data client buffers performance therefore potential issue microkernel systems indeed experience first-generation microkernels mach chorusos showed systems based performed poorly however jochen liedtke showed mach performance problems result poor design implementation specifically mach excessive cache footprint liedtke demonstrated l4 microkernel careful design implementation especially following minimality principle ipc costs could reduced order magnitude compared mach l4 ipc performance still unbeaten across range architectures results demonstrate poor performance systems based first-generation microkernels representative second-generation kernels l4 constitutes proof microkernel-based systems built good performance shown monolithic linux server ported l4 exhibits percent overhead native linux however single-server system exhibits advantages microkernels supposed provide structuring operating system functionality separate servers number commercial multi-server systems exist particular real-time systems qnx integrity comprehensive comparison performance relative monolithic systems published multiserver systems furthermore performance seem overriding concern commercial systems instead emphasize reliably quick interrupt handling response times qnx simplicity sake robustness attempt build high-performance multiserver operating system ibm sawmill linux project however project never completed shown meantime user-level device drivers come close performance in-kernel drivers even high-throughput high-interrupt devices gigabit ethernet seems imply high-performance multi-server systems possible security benefits microkernels frequently discussed context security minimality principle microkernels argued direct consequence principle least privilege according code privileges needed provide required functionality minimality requires system trusted computing base tcb kept minimal kernel code executes privileged mode hardware unvetted access data thus violate integrity confidentiality kernel always part tcb minimizing natural security-driven design consequently microkernel designs used systems designed high-security applications including keykos eros military systems fact common criteria cc highest assurance level evaluation assurance level eal 7 explicit requirement target evaluation simple acknowledgment practical impossibility establishing true trustworthiness complex system unfortunately term simple misleading ill-defined least department defense trusted computer system evaluation criteria introduced somewhat precise verbiage b3/a1 classes recent work microkernels focusing formal specifications kernel api formal proofs api security properties implementation correctness first example mathematical proof confinement mechanisms eros based simplified model eros api recently comprehensive set machine-checked proofs performed properties protection model version l4 led referred third-generation microkernels characterised security-oriented api resource access controlled capabilities virtualization first-class concern novel approaches kernel resource management design goal suitability formal analysis besides usual goal high performance examples coyotos nova redox fiasco.oc case sel4 complete formal verification implementation achieved i.e mathematical proof kernel implementation consistent formal specification provides guarantee properties proved api actually hold real kernel degree assurance goes beyond even cc eal7 followed proofs security-enforcement properties api proof demonstrating executable binary code correct translation c implementation taking compiler tcb taken together proofs establish end-to-end proof security properties kernel term nanokernel picokernel historically referred also least one case term nanokernel used refer small kernel one supports nanosecond clock resolution", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 108, + 127, + 134, + 170, + 171, + 185, + 187, + 212, + 225, + 265, + 322, + 353, + 379, + 380, + 387, + 413, + 434, + 465, + 477, + 567, + 583, + 650, + 664, + 720, + 721, + 728, + 744, + 754, + 779, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 992, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1057, + 1063, + 1120, + 1138, + 1155, + 1187, + 1202, + 1224, + 1287, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1518, + 1530, + 1535, + 1538, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1012, + "label": 2, + "text": "VM_(operating_system):vm operating system vm often vm/cms family ibm virtual machine operating systems used ibm mainframes system/370 system/390 zseries system z compatible systems including hercules emulator personal computers first version released 1972 vm/370 officially virtual machine facility/370 system/370 reimplementation earlier cp/cms operating system milestone versions included vm/sp current version z/vm still widely used one main full virtualization solutions mainframe market cms usually coupled vm name refers conversational monitor system single-user operating system developed provide conversational time-sharing vm heart vm architecture control program hypervisor called vm-cp usually cp sometimes ambiguously vm runs physical hardware creates virtual machine environment vm-cp provides full virtualization physical machine \u2013 including i/o privileged operations performs system resource-sharing including device management dispatching virtual storage management traditional operating system tasks vm user provided separate virtual machine address space virtual devices etc. capable running software could run stand-alone machine given vm mainframe typically runs hundreds thousands virtual machine instances vm-cp began life cp-370 reimplementation cp-67 reimplementation cp-40 running within virtual machine another guest operating system might one time cms capable running bare machine true operating system though configuration would unusual runs guest os vm cms relies hypervisor interface vm-cp perform file system operations request vm services paravirtualization interface ibm coined term hypervisor 360/65 later used diag handler cp-67 diagnose instruction '83 x\u2014no mnemonic privileged instruction originally intended ibm perform built-in diagnostic functions model-dependent functions vm/370 repurposed communication virtual machine cp instruction contains two four-bit register numbers called rx ry contain operand storage addresses return codes passed diagnose interface two-byte code cp uses determine diagnose function perform available diagnose functions listed early history vm described articles cp/cms history cp/cms vm/370 reimplementation cp/cms made available 1972 part ibm system/370 advanced function announcement added virtual memory hardware operating systems system/370 series early releases vm vm/370 release 6 continued open source today considered public domain policy ended late 1970s chargeable vm/se vm/bse upgrades 1980 vm/system product vm/sp however ibm continued providing updates source form existing code many years cp-67 privileged instructions virtual machine cause program interrupt cp simulated behavior privileged instruction vm remained important platform within ibm used operating system development time-sharing use customers remained ibm operating system os dos families remained ibm strategic products customers encouraged run vm formed close working relationships continuing community-support model early cp/cms users meantime system struggled political infighting within ibm resources available project compared ibm efforts basic problem system seen ibm field sales level vm/cms demonstrably reduced amount hardware needed support given number time-sharing users ibm business selling computer systems melinda varian provides fascinating quote illustrating vm unexpected success marketing forecasts vm/370 predicted one 168 would ever run vm entire life product fact first 168 delivered customer ran cp cms ten years later ten percent large processors shipped poughkeepsie would destined run vm would substantial portion mid-range machines built endicott fifteen years passed would vm licenses mvs licenses pc dos version runs xt/370 later at/370 called vm/pc vm/pc 1.1 based vm/sp release 3 ibm introduced system/370 extended architecture 3081 customers faced need run production mvs/370 system testing mvs/xa machine ibm solution vm/xa migration aid used new start interpretive execution sie instruction run virtual machine sie automatically handled privileged instructions returned cp cases could n't handle processor resource/system manager pr/sm later 3090 also used sie several vm/xa products eventually supplanted vm/esa z/vm vm role changed within ibm hardware evolution led significant changes processor architecture backward compatibility remained cornerstone ibm mainframe family still uses basic instruction set introduced original system/360 need efficient use 64-bit zseries made vm approach much attractive vm also utilized data centers converting dos/vse mvs useful running mainframe aix linux platforms become increasingly important current z/vm platform finally achieved recognition within ibm vm users long felt deserved z/vm sites run thousands simultaneous virtual machine users single system z/vm first released october 2000 remains active use development ibm third parties offered many applications tools run vm examples include ramis focus spss nomad db2 rexx racf officevision current vm offerings run gamut mainframe applications including http servers database managers analysis tools engineering packages financial systems release 6 vm/370 control program number commands general users concerned defining controlling user virtual machine lower-case portions command optional early 1980s vm group within share ibm user group sought mascot logo community adopt part response ibm mvs users selecting turkey mascot hilariously chosen according legend mvs performance group early days mvs performance sore topic 1983 teddy bear became vm de facto mascot share 60 teddy bear stickers attached nametags cuddlier oldtimers flag newcomers friendly approached bears hit soon appeared widely bears awarded inductees order knights vm individuals made useful contributions community", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 142, + 170, + 171, + 185, + 187, + 206, + 265, + 322, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 564, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 766, + 779, + 797, + 860, + 870, + 884, + 891, + 925, + 941, + 954, + 961, + 966, + 996, + 1011, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1087, + 1132, + 1138, + 1155, + 1187, + 1202, + 1217, + 1224, + 1232, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1013, + "label": 3, + "text": "Simultaneous_multithreading:simultaneous multithreading simultaneous multithreading smt technique improving overall efficiency superscalar cpus hardware multithreading smt permits multiple independent threads execution better utilize resources provided modern processor architectures name multithreading ambiguous multiple threads executed simultaneously one cpu core also multiple tasks different page tables different task state segments different protection rings different i/o permissions etc. although running core completely separated multithreading similar concept preemptive multitasking implemented thread level execution modern superscalar processors simultaneous multithreading smt one two main implementations multithreading form temporal multithreading also known super-threading temporal multithreading one thread instructions execute given pipeline stage time simultaneous multithreading instructions one thread executed given pipeline stage time done without great changes basic processor architecture main additions needed ability fetch instructions multiple threads cycle larger register file hold data multiple threads number concurrent threads decided chip designers two concurrent threads per cpu core common processors support eight concurrent threads per core really efficiency technique inevitably increases conflict shared resources measuring agreeing effectiveness difficult however measured energy efficiency smt parallel native managed workloads historical 130 nm 32 nm intel smt hyper-threading implementations found 45 nm 32 nm implementations smt extremely energy efficient even inorder atom processors modern systems smt effectively exploits concurrency little additional dynamic power even performance gains minimal power consumption savings considerable researchers shown extra threads used proactively seed shared resource like cache improve performance another single thread claim shows smt increase efficiency others use smt provide redundant computation level error detection recovery however current cases smt hiding memory latency increasing efficiency increasing throughput computations per amount hardware used processor design two ways increase on-chip parallelism fewer resource requirements one superscalar technique tries exploit instruction level parallelism ilp multithreading approach exploiting thread level parallelism tlp superscalar means executing multiple instructions time thread-level parallelism tlp executes instructions multiple threads within one processor chip time many ways support one thread within chip namely key factor distinguish look many instructions processor issue one cycle many threads instructions come example sun microsystems ultrasparc t1 known niagara november 14 2005 release multicore processor combined fine-grain multithreading technique instead simultaneous multithreading core issue one instruction time multithreading cpus around since 1950s simultaneous multithreading first researched ibm 1968 part acs-360 project first major commercial microprocessor developed smt alpha 21464 ev8 microprocessor developed dec coordination dean tullsen university california san diego susan eggers henry levy university washington microprocessor never released since alpha line microprocessors discontinued shortly hp acquired compaq turn acquired dec. dean tullsen work also used develop hyper-threading hyper-threading technology htt versions intel pentium 4 microprocessors northwood prescott intel pentium 4 first modern desktop processor implement simultaneous multithreading starting 3.06 ghz model released 2002 since introduced number processors intel calls functionality hyper-threading provides basic two-thread smt engine intel claims 30 speed improvement compared otherwise identical non-smt pentium 4 performance improvement seen application-dependent however running two programs require full attention processor actually seem like one programs slows slightly hyper-threading turned due replay system pentium 4 tying valuable execution resources increasing contention resources bandwidth caches tlbs re-order buffer entries equalizing processor resources two programs adds varying amount execution time pentium 4 prescott core gained replay queue reduces execution time needed replay system enough completely overcome performance hit latest imagination technologies mips architecture designs include smt system known mips mt mips mt provides heavyweight virtual processing elements lighter-weight hardware microthreads rmi cupertino-based startup first mips vendor provide processor soc based eight cores runs four threads threads run fine-grain mode different thread executed cycle threads also assigned priorities imagination technologies mips cpus two smt threads per core ibm blue gene/q 4-way smt ibm power5 announced may 2004 comes either dual core dual-chip module dcm quad-core oct-core multi-chip module mcm core including two-thread smt engine ibm implementation sophisticated previous ones assign different priority various threads fine-grained smt engine turned dynamically better execute workloads smt processor would increase performance ibm second implementation generally available hardware multithreading 2010 ibm released systems based power7 processor eight cores four simultaneous intelligent threads switches threading mode one thread two threads four threads depending number process threads scheduled time optimizes use core minimum response time maximum throughput ibm power8 8 intelligent simultaneous threads per core smt8 ibm z13 two threads per core smt-2 although many people reported sun microsystems ultrasparc t1 known niagara 14 november 2005 release defunct processor codenamed rock originally announced 2005 many delays cancelled 2009 implementations sparc focused almost entirely exploiting smt cmp techniques niagara actually using smt sun refers combined approaches cmt overall concept throughput computing niagara eight cores core one pipeline actually uses fine-grained multithreading unlike smt instructions multiple threads share issue window cycle processor uses round robin policy issue instructions next active thread cycle makes similar barrel processor sun microsystems rock processor different complex cores one pipeline oracle corporation sparc t3 eight fine-grained threads per core sparc t4 sparc t5 sparc m5 m6 m7 eight fine-grained threads per core two executed simultaneously fujitsu sparc64 vi coarse-grained vertical multithreading vmt sparc vii newer 2-way smt intel itanium montecito used coarse-grained multithreading tukwila newer use 2-way smt dual-domain multithreading intel xeon phi 4-way smt time-multiplexed multithreading hardware based threads ca n't disabled unlike regular hyperthreading intel atom released 2008 first intel product feature 2-way smt marketed hyper-threading without supporting instruction reordering speculative execution register renaming intel reintroduced hyper-threading nehalem microarchitecture absence core microarchitecture amd bulldozer microarchitecture flexfpu shared l2 cache multithreaded integer cores module single threaded partial smt implementation amd zen microarchitecture 2-way smt visc architecture uses virtual software layer translation layer dispatch single thread instructions global front end splits instructions virtual hardware threadlets dispatched separate virtual cores virtual cores send available resources physical cores multiple virtual cores push threadlets reorder buffer single physical core split partial instructions data multiple threadlets execution ports time virtual core keeps track position relative output form multithreading increase single threaded performance allowing single thread use resources cpu allocation resources dynamic near-single cycle latency level 1-4 cycles depending change allocation depending individual application needs therefore two virtual cores competing resources appropriate algorithms place determine resources allocated depending design architecture processor simultaneous multithreading decrease performance shared resources bottlenecks performance critics argue considerable burden put software developers test whether simultaneous multithreading good bad application various situations insert extra logic turn decreases performance current operating systems lack convenient api calls purpose preventing processes different priority taking resources also security concern certain simultaneous multithreading implementations intel hyperthreading netburst based processors vulnerability possible one application steal cryptographic key another application running processor monitoring cache use also sophisticated machine learning exploits ht implementation explained black hat 2018", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 280, + 300, + 314, + 331, + 335, + 340, + 343, + 352, + 362, + 375, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 611, + 643, + 659, + 719, + 737, + 752, + 755, + 776, + 803, + 821, + 846, + 847, + 876, + 893, + 907, + 937, + 946, + 979, + 980, + 984, + 994, + 996, + 1002, + 1009, + 1016, + 1052, + 1069, + 1072, + 1081, + 1099, + 1111, + 1113, + 1125, + 1151, + 1174, + 1186, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1014, + "label": 1, + "text": "Common_Database_on_Designated_Areas:common database designated areas common database designated areas cdda data bank officially designated protected areas nature reserves protected landscapes national parks etc europe data bank went live 1999 community project european environment agency eea council europe united nations environment programme world conservation monitoring centre unep-wcmc data bank divided national area international area national area member states eu eea european environment information observation network eionet data cleansing national area non-eea members international area carried unep-wcmc systems data bank follows system international union conservation nature natural resources iucn standards united nations order ensure compatibility similar data banks worldwide especially world database protected areas wdpa data bank accessed internet using website european nature information system eunis date true marine protected areas marine protected areas atlantic arc maia included data bank pursued", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1015, + "label": 4, + "text": "Penetration_test:penetration test penetration test colloquially known pen test pentest ethical hacking authorized simulated cyberattack computer system performed evaluate security system test performed identify weaknesses also referred vulnerabilities including potential unauthorized parties gain access system features data well strengths enabling full risk assessment completed process typically identifies target systems particular goal reviews available information undertakes various means attain goal penetration test target may white box provides background system information black box provides basic information except company name gray box penetration test combination two limited knowledge target shared auditor penetration test help determine whether system vulnerable attack defenses sufficient defenses test defeated security issues penetration test uncovers reported system owner penetration test reports may also assess potential impacts organization suggest countermeasures reduce risk national cyber security center describes penetration testing following method gaining assurance security system attempting breach system security using tools techniques adversary might goals penetration test vary depending type approved activity given engagement primary goal focused finding vulnerabilities could exploited nefarious actor informing client vulnerabilities along recommended mitigation strategies penetration tests component full security audit example payment card industry data security standard requires penetration testing regular schedule system changes flaw hypothesis methodology systems analysis penetration prediction technique list hypothesized flaws software system compiled analysis specifications documentation system list hypothesized flaws prioritized basis estimated probability flaw actually exists ease exploiting extent control compromise prioritized list used direct actual testing system mid 1960s growing popularity time-sharing computer systems made resources accessible communications lines created new security concerns scholars deborah russell g. t. gangemi sr. explain 1960s marked true beginning age computer security june 1965 example several country leading computer security experts held one first major conferences system security\u2014hosted government contractor system development corporation sdc conference someone noted one sdc employee able easily undermine various system safeguards added sdc an/fsq-32 time-sharing computer system hopes system security study would useful attendees requested ... studies conducted areas breaking security protection time-shared system words conference participants initiated one first formal requests use computer penetration tool studying system security spring 1967 joint computer conference many leading computer specialists met discuss system security concerns conference computer security experts willis ware harold petersen rein tern rand corporation bernard peters national security agency nsa used phrase penetration describe attack computer system paper ware referred military remotely accessible time-sharing systems warning deliberate attempts penetrate computer systems must anticipated colleagues petersen turn shared concerns observing online communication systems ... vulnerable threats privacy including deliberate penetration bernard peters nsa made point insisting computer input output ... could provide large amounts information penetrating program conference computer penetration would become formally identified major threat online computer systems threat computer penetration posed next outlined major report organized united states department defense dod late 1967 essentially dod officials turned willis ware lead task force experts nsa cia dod academia industry formally assess security time-sharing computer systems relying many papers presented spring 1967 joint computer conference task force largely confirmed threat system security computer penetration posed ware report initially classified many country leading computer experts quickly identified study definitive document computer security jeffrey r. yost charles babbage institute recently described ware report ... far important thorough study technical operational issues regarding secure computing systems time period effect ware report reaffirmed major threat posed computer penetration new online time-sharing computer systems better understand system weaknesses federal government contractors soon began organizing teams penetrators known tiger teams use computer penetration test system security deborah russell g. t. gangemi sr. stated 1970s ... 'tiger teams first emerged computer scene tiger teams government industry-sponsored teams crackers attempted break defenses computer systems effort uncover eventually patch security holes leading scholar history computer security donald mackenzie similarly points rand done penetration studies experiments circumventing computer security controls early time-sharing systems behalf government jeffrey r. yost charles babbage institute work history computer security also acknowledges rand corporation sdc engaged first so-called 'penetration studies try infiltrate time-sharing systems order test vulnerability virtually early studies tiger teams successfully broke targeted computer systems country time-sharing systems poor defenses early tiger team actions efforts rand corporation demonstrated usefulness penetration tool assessing system security time one rand analyst noted tests ... demonstrated practicality system-penetration tool evaluating effectiveness adequacy implemented data security safeguards addition number rand analysts insisted penetration test exercises offered several benefits justified continued use noted one paper penetrator seems develop diabolical frame mind search operating system weaknesses incompleteness difficult emulate reasons others many analysts rand recommended continued study penetration techniques usefulness assessing system security perhaps leading computer penetration expert formative years james p. anderson worked nsa rand government agencies study system security early 1971 u.s. air force contracted anderson private company study security time-sharing system pentagon study anderson outlined number major factors involved computer penetration anderson described general attack sequence steps time anderson description general computer penetration steps helped guide many security experts relied technique assess time-sharing computer system security following years computer penetration tool security assessment became refined sophisticated early 1980s journalist william broad briefly summarized ongoing efforts tiger teams assess system security broad reported dod-sponsored report willis ware ... showed spies could actively penetrate computers steal copy electronic files subvert devices normally guard top-secret information study touched decade quiet activity elite groups computer scientists working government tried break sensitive computers succeeded every attempt various studies may suggested computer security u.s. remained major problem scholar edward hunt recently made broader point extensive study computer penetration security tool hunt suggests recent paper history penetration testing defense establishment ultimately ... created many tools used modern day cyberwarfare carefully defined researched many ways computer penetrators could hack targeted systems wide variety security assessment tools available assist penetration testing including free-of-charge free software commercial software several operating system distributions geared towards penetration testing distributions typically contain pre-packaged pre-configured set tools penetration tester hunt individual tool might increase risk complications\u2014such compile errors dependency issues configuration errors also acquiring additional tools may practical tester context notable penetration testing os examples include many specialized operating systems facilitate penetration testing\u2014each less dedicated specific field penetration testing number linux distributions include known os application vulnerabilities deployed targets practice systems help new security professionals try latest security tools lab environment examples include damn vulnerable linux dvl owasp web testing environment wtw metasploitable process penetration testing may simplified five phases attacker exploited one vulnerability may gain access machines process repeats i.e look new vulnerabilities attempt exploit process referred pivoting legal operations let tester execute illegal operation include unescaped sql commands unchanged hashed passwords source-visible projects human relationships old hashing cryptographic functions single flaw may enough enable critically serious exploit leveraging multiple known flaws shaping payload way appears valid operation almost always required metasploit provides ruby library common tasks maintains database known exploits budget time constraints fuzzing common technique discovers vulnerabilities aims get unhandled error random input tester uses random input access less often used code paths well-trodden code paths usually free errors errors useful either expose information http server crashes full info trace-backs\u2014or directly usable buffer overflows imagine website 100 text input boxes vulnerable sql injections certain strings submitting random strings boxes hopefully hits bugged code path error shows broken html page half rendered sql error case text boxes treated input streams however software systems many possible input streams cookie session data uploaded file stream rpc channels memory errors happen input streams test goal first get unhandled error understand flaw based failed test case testers write automated tool test understanding flaw correct may become obvious package payload target system triggers execution viable one hope another error produced fuzzer yields fruit use fuzzer saves time checking adequate code paths exploits unlikely illegal operation payload metasploit terminology include functions logging keystrokes taking screenshots installing adware stealing credentials creating backdoors using shellcode altering data companies maintain large databases known exploits provide products automatically test target systems vulnerabilities general services administration gsa standardized penetration test service pre-vetted support service rapidly address potential vulnerabilities stop adversaries impact us federal state local governments services commonly referred highly adaptive cybersecurity services hacs listed us gsa advantage website effort identified key service providers technically reviewed vetted provide advanced penetration services gsa service intended improve rapid ordering deployment services reduce us government contract duplication protect support us infrastructure timely efficient manner 132-45a penetration testing security testing service assessors mimic real-world attacks identify methods circumventing security features application system network hacs penetration testing services typically strategically test effectiveness organization preventive detective security measures employed protect assets data part service certified ethical hackers typically conduct simulated attack system systems applications another target environment searching security weaknesses testing typically document vulnerabilities outline defenses effective defeated exploited also typically provide recommended remediation plans address weaknesses discovered uk penetration testing services standardized via professional bodies working collaboration national cyber security centre", + "neighbors": [ + 103, + 134, + 338, + 364, + 379, + 393, + 405, + 701, + 703, + 800, + 842, + 1368, + 1369, + 1623 + ], + "mask": "Test" + }, + { + "node_id": 1016, + "label": 3, + "text": "MIPS_architecture:mips architecture mips microprocessor without interlocked pipelined stages reduced instruction set computer risc instruction set architecture isa developed mips computer systems mips technologies based united states multiple versions mips including mips ii iii iv v well five releases mips32/64 32- 64-bit implementations respectively early mips architectures 32-bit 64-bit versions developed later april 2017 current version mips mips32/64 release 6 mips32/64 primarily differs mips i\u2013v defining privileged kernel mode system control coprocessor addition user mode architecture computer architecture courses universities technical schools often study mips architecture architecture greatly influenced later risc architectures alpha april 2017 mips processors used embedded systems residential gateways routers originally mips designed general-purpose computing 1980s 1990s mips processors personal workstation server computers used many companies digital equipment corporation mips computer systems nec pyramid technology sicortex siemens nixdorf silicon graphics tandem computers historically video game consoles nintendo 64 sony playstation playstation 2 playstation portable used mips processors mips processors also used popular supercomputers 1990s systems dropped top500 list uses complemented embedded applications first 1990s mips became major presence embedded processor market 2000s mips processors applications mid- late-1990s estimated one three risc microprocessors produced mips processor mips modular architecture supporting four coprocessors cp0/1/2/3 mips terminology cp0 system control coprocessor essential part processor implementation-defined mips i\u2013v cp1 optional floating-point unit fpu cp2/3 optional implementation-defined coprocessors mips iii removed cp3 reused opcodes purposes example playstation video game console cp2 geometry transformation engine gte accelerates processing geometry 3d computer graphics mips architecture several optional extensions mips-3d simple set floating-point simd instructions dedicated common 3d tasks mdmx madmax extensive integer simd instruction set using 64-bit floating-point registers mips16e adds compression instruction stream make programs take less room mips mt adds multithreading capability december 2018 wave computing new owner mips architecture see mips technologies announced mips isa open-sourced program dubbed mips open initiative program planned 2019 intended open access recent versions 32-bit 64-bit designs making available without licensing royalty fees well granting participants licenses existing mips patents first version mips architecture designed mips computer systems r2000 microprocessor first mips implementation mips r2000 introduced together 1985 mips ii introduced mips renamed mips distinguish new version mips load/store architecture also known register-register architecture except load/store instructions used access memory instructions operate registers mips thirty-two 32-bit general-purpose registers gpr register 0 hardwired zero writes discarded register 31 link register integer multiplication division instructions run asynchronously instructions pair 32-bit registers hi lo provided small set instructions copying data general-purpose registers hi/lo registers program counter 32 bits two low-order bits always contain zero since mips instructions 32 bits long aligned natural word boundaries instructions divided three types r j every instruction starts 6-bit opcode addition opcode r-type instructions specify three registers shift amount field function field i-type instructions specify two registers 16-bit immediate value j-type instructions follow opcode 26-bit jump target following three formats used core instruction set mips instructions load store 8-bit bytes 16-bit halfwords 32-bit words one addressing mode supported base displacement since mips 32-bit architecture loading quantities fewer 32 bits requires datum either signed- zero-extended 32 bits load instructions suffixed unsigned perform zero extension otherwise sign extension performed load instructions source base contents gpr rs write result another gpr rt store instructions source base contents gpr rs store data another gpr rt load store instructions compute memory address summing base sign-extended 16-bit immediate mips requires memory accesses aligned natural word boundaries otherwise exception signaled support efficient unaligned memory accesses load/store word instructions suffixed left right load instructions followed load delay slot instruction load delay slot use data loaded load instruction load delay slot filled instruction dependent load nop substituted instruction found mips instructions perform addition subtraction instructions source operands two gprs rs rt write result third gpr rd alternatively addition source one operands 16-bit immediate sign-extended 32 bits instructions addition subtraction two variants default exception signaled result overflows instructions unsigned suffix signal exception overflow check interprets result 32-bit two complement integer mips instructions perform bitwise logical xor instructions source operands two gprs write result third gpr xor instructions alternatively source one operands 16-bit immediate zero-extended 32 bits set relation instructions write one zero destination register specified relation true false instructions source operands two gprs one gpr 16-bit immediate sign-extended 32 bits write result third gpr default operands interpreted signed integers variants instructions suffixed unsigned interpret operands unsigned integers even source operand sign-extended 16-bit immediate load immediate upper instruction copies 16-bit immediate high-order 16 bits gpr used conjunction immediate instruction load 32-bit immediate register mips instructions perform left right logical shifts right arithmetic shifts operand obtained gpr rt result written another gpr rd shift distance obtained either gpr rs 5-bit shift amount sa field mips instructions signed unsigned integer multiplication division instructions source operands two gprs write results pair 32-bit registers called hi lo since may execute separately concurrently cpu instructions multiplication high- low-order halves 64-bit product written hi lo respectively division quotient written lo remainder hi access results pair instructions move hi move lo provided copy contents hi lo gpr instructions interlocked reads hi lo proceed past unfinished arithmetic instruction write hi lo another pair instructions move hi move lo copies contents gpr hi lo instructions used restore hi lo original state exception handling instructions read hi lo must separated two instructions write hi lo mips control flow instructions followed branch delay slot unless branch delay slot filled instruction performing useful work nop substituted mips branch instructions compare contents gpr rs zero another gpr rt signed integers branch specified condition true control transferred address computed shifting 16-bit offset left two bits sign-extending 18-bit result adding 32-bit sign-extended result sum program counter instruction address 8 jumps two versions absolute register-indirect absolute jumps jump jump link compute address control transferred shifting 26-bit instr_index left two bits concatenating 28-bit result four high-order bits address instruction branch delay slot register-indirect jumps transfer control instruction address sourced gpr rs address sourced gpr must word-aligned else exception signaled instruction branch delay slot executed branch jump instructions link except jump link register save return address gpr 31 jump link register instruction permits return address saved writable gpr mips two instructions software signal exception system call breakpoint system call used user mode software make kernel calls breakpoint used transfer control debugger via kernel exception handler instructions 20-bit code field contain operating environment-specific information exception handler mips 32 floating-point registers two registers paired double precision numbers odd numbered registers used arithmetic branching part double precision register pair resulting 16 usable registers instructions moves/copies loads/stores affected single precision denoted .s suffix double precision denoted .d suffix mips ii removed load delay slot added several sets instructions shared-memory multiprocessing synchronize shared memory load linked word store conditional word instructions added set trap-on-condition instructions added instructions caused exception evaluated condition true existing branch instructions given branch-likely versions executed instruction branch delay slot branch taken instructions improve performance certain cases allowing useful instructions fill branch delay slot doubleword load store instructions cop1\u20133 added consistent memory access instructions loads stores required doubleword naturally aligned instruction set floating point coprocessor also several instructions added ieee 754-compliant floating-point square root instruction added supported single- double-precision operands set instructions converted single- double-precision floating-point numbers 32-bit words added complemented existing conversion instructions allowing ieee rounding mode specified instruction instead floating point control status register mips computer systems r6000 microprocessor 1989 first mips ii implementation designed servers r6000 fabricated sold bipolar integrated technology commercial failure mid-1990s many new 32-bit mips processors embedded systems mips ii implementations introduction 64-bit mips iii architecture 1991 left mips ii newest 32-bit mips architecture mips32 introduced 1999.a mips iii backwards-compatible extension mips ii added support 64-bit memory addressing integer operations 64-bit data type called doubleword mips iii extended general-purpose registers hi/lo registers program counter 64 bits support new instructions added load store doublewords perform integer addition subtraction multiplication division shift operations move doubleword gprs hi/lo registers existing instructions originally defined operate 32-bit words redefined necessary sign-extend 32-bit results permit words doublewords treated identically instructions among instructions redefined load word mips iii sign-extends words 64 bits complement load word version zero-extends added r instruction format inability specify full shift distance 64-bit shifts 5-bit shift amount field narrow specify shift distance doublewords required mips iii provide three 64-bit versions mips shift instruction first version 64-bit version original shift instructions used specify constant shift distances 0\u201331 bits second version similar first adds 32 shift amount field value constant shift distances 32\u201364 bits specified third version obtains shift distance six low-order bits gpr mips iii added supervisor privilege level existing kernel user privilege levels feature affected implementation-defined system control processor coprocessor 0 mips iii removed coprocessor 3 cp3 support instructions reused opcodes new doubleword instructions remaining coprocessors gained instructions move doublewords coprocessor registers gprs floating general registers fgrs extended 64 bits requirement instructions use even-numbered register removed incompatible earlier versions architecture bit floating-point control/status register used operate mips iii floating-point unit fpu mips i- ii-compatible mode floating-point control registers extended compatibility new floating-point instructions added copy doublewords cpu fpu convert single- double-precision floating-point numbers doubleword integers vice versa mips computer systems r4000 microprocessor 1991 first mips iii implementation designed use personal workstation server computers mips computer systems aggressively promoted mips architecture r4000 establishing advanced computing environment ace consortium advance advanced risc computing arc standard aimed establish mips dominant personal computing platform arc found little success personal computers r4000 r4400 derivative widely used workstation server computers especially largest user silicon graphics uses r4000 included high-end embedded systems supercomputers mips iii eventually implemented number embedded microprocessors quantum effect design r4600 1993 derivatives widely used high-end embedded systems low-end workstations servers mips technologies r4200 1994 designed embedded systems laptop personal computers derivative r4300i fabricated nec electronics used nintendo 64 game console nintendo 64 along playstation among highest volume users mips architecture processors mid-1990s mips iv fourth version architecture superset mips iii compatible existing versions mips mips iv designed mainly improve floating-point fp performance improve access operands indexed addressing mode base index sourced gprs fp loads stores added prefetch instructions performing memory prefetching specifying cache hints supported base offset base index addressing modes mips iv added several features improve instruction-level parallelism alleviate bottleneck caused single condition bit seven condition code bits added floating-point control status register bringing total eight fp comparison branch instructions redefined could specify condition bit written read respectively delay slot fp branch read condition bit written prior fp comparison removed support partial predication added form conditional move instructions gprs fprs implementation could choose precise imprecise exceptions ieee 754 traps mips iv added several new fp arithmetic instructions single- double-precision fpns fused-multiply add subtract reciprocal reciprocal square-root fp fused-multiply add subtract instructions perform either one two roundings implementation-defined exceed meet ieee 754 accuracy requirements respectively fp reciprocal reciprocal square-root instructions comply ieee 754 accuracy requirements produce results differ required accuracy one two units last place implementation defined instructions serve applications instruction latency important accuracy first mips iv implementation mips technologies r8000 microprocessor chipset 1994 design r8000 began silicon graphics inc. used high-end workstations servers scientific technical applications high performance large floating-point workloads important later implementations mips technologies r10000 1996 quantum effect devices r5000 1996 rm7000 1998 r10000 fabricated sold nec electronics toshiba derivatives used nec pyramid technology silicon graphics inc. tandem computers among others workstations servers supercomputers r5000 r7000 found use high-end embedded systems personal computers low-end workstations servers derivative r5000 toshiba r5900 used sony computer entertainment emotion engine powered playstation 2 game console announced october 21 1996 microprocessor forum 1996 alongside mips digital media extensions mdmx extension mips v designed improve performance 3d graphics transformations mid-1990s major use non-embedded mips microprocessors graphics workstations sgi mips v completed integer-only mdmx extension provide complete system improving performance 3d graphics applications mips v implementations never introduced may 12 1997 sgi announced h1 beast h2 capitan microprocessors former first mips v implementation due introduced first half 1999 h1 h2 projects later combined eventually canceled 1998 mips v implementations mips64 release 1 1999 based mips v retains features optional coprocessor 1 fpu feature called paired-single mips v added new data type paired single ps consisted two single-precision 32-bit floating-point numbers stored existing 64-bit floating-point registers variants existing floating-point instructions arithmetic compare conditional move added operate data type simd fashion new instructions added loading rearranging converting ps data first instruction set exploit floating-point simd existing resources mips technologies spun-out silicon graphics 1998 refocused embedded market mips v successive version strict superset previous version property found problem architecture definition changed define 32-bit 64-bit architecture mips32 mips64 introduced 1999 mips32 based mips ii additional features mips iii mips iv mips v mips64 based mips v. nec toshiba sibyte later acquired broadcom obtained licenses mips64 soon announced philips lsi logic idt raza microelectronics inc. cavium loongson technology ingenic semiconductor since joined first release mips32 based mips ii added conditional moves prefetch instructions features r4000 r5000 families 64-bit processors first release mips64 adds mips32 mode run 32-bit code mul madd multiply-add instructions previously available implementations added mips32 mips64 specifications cache control instructions announced december 6 2012 release 4 skipped number four perceived unlucky many asian cultures mips32/mips64 release 6 2014 added following removed infrequently used instructions reorganized instruction encoding freeing space future expansions micromips32/64 architectures supersets mips32 mips64 architectures respectively designed replace mips16e ase disadvantage mips16e requires mode switch 16-bit instructions processed micromips adds versions most-frequently used 32-bit instructions encoded 16-bit instructions allows programs intermix 16- 32-bit instructions without switch modes micromips introduced alongside mips32/64 release 3 subsequent release mips32/64 corresponding micromips32/64 version processor may implement micromips32/64 micromips32/64 corresponding mips32/64 subset starting mips32/64 release 6 support mips16e ended micromips form code compression mips base mips32 mips64 architectures supplemented number optional architectural extensions collectively referred application-specific extensions ases ases provide features improve efficiency performance certain workloads digital signal processing enhancements microcontroller applications mcu ase application-specific extension developed extend interrupt controller support reduce interrupt latency enhance i/o peripheral control function typically required microcontroller system designs mips16 application-specific extension mips v designed lsi logic mips technologies announced october 21 1996 alongside first implementation lsi logic tinyrisc processor mips16 subsequently licensed nec electronics philips semiconductors toshiba among others implemented extension mips ii iii architectures mips16 decreases size application 40 using 16-bit instructions instead 32-bit instructions also improves power efficiency instruction cache hit rate equivalent performance base architecture supported hardware software development tools mips technologies providers mips16e improved version mips16 first supported mips32 mips64 release 1 mips16e2 improved version mips16 supported mips32 mips64 release 5 release 6 replaced micromips dsp ase optional extension mips32/mips64 release 2 newer instruction sets used accelerate large range media computations\u2014particularly audio video dsp module comprises set instructions state integer pipeline requires minimal additional logic implement mips processor cores revision 2 ase introduced second half 2006 revision adds extra instructions original ase otherwise backwards-compatible unlike bulk mips architecture fairly irregular set operations many chosen particular relevance key algorithm main novel features vs original mips32 make use mips dsp ase may linux 2.6.12-rc5 starting 2005-05-31 adds support dsp ase note actually make use dsp ase toolchain support required gcc already support dsp dspr2 instruction set extensions designed accelerate multimedia hardware supported virtualization technology multi-threaded mips core support two vpes virtual processing elements share single pipeline well hardware resources however since vpe includes complete copy processor state seen software system vpe appears complete standalone processor smp linux operating system fine-grained thread processing applications vpe capable supporting nine tcs allocated across two vpes tcs share common execution unit program counter core register files handle thread software mips mt architecture also allows allocation processor cycles threads sets relative thread priorities optional quality service qos manager block enables two prioritization mechanisms determine flow information across bus first mechanism allows user prioritize one thread another second mechanism used allocate specified ratio cycles specific threads time combined use mechanisms allows effective allocation bandwidth set threads better control latencies real-time systems system-level determinism critical qos block facilitates improvement predictability system hardware designers advanced systems may replace standard qos block provided mips technologies one specifically tuned application single-threaded microprocessors today waste many cycles waiting access memory considerably limiting system performance use multi-threading masks effect memory latency increasing processor utilization one thread stalls additional threads instantly fed pipeline executed resulting significant gain application throughput users allocate dedicated processing bandwidth real-time tasks resulting guaranteed quality service qos mips \u2019 mt technology constantly monitors progress threads dynamically takes corrective actions meet exceed real-time requirements processor pipeline achieve 80-90 utilization switching threads data-dependent stalls cache misses leads improved mobile device user experience responsiveness greatly increased smartmips application-specific extension ase designed gemplus international mips technologies improve performance reduce memory consumption smart card software supported mips32 since smart cards require capabilities mips64 processors smart cards use smartmips open virtual platforms ovp includes freely available non-commercial use simulator ovpsim library models processors peripherals platforms apis enable users develop models models library open source written c include mips 4k 24k 34k 74k 1004k 1074k m14k microaptiv interaptiv proaptiv 32-bit cores mips 64-bit 5k range cores models created maintained imperas partnership mips technologies tested assigned mips-verified tm mark sample mips-based platforms include bare metal environments platforms booting unmodified linux binary images platforms\u2013emulators available source binaries fast free non-commercial usage easy use ovpsim developed maintained imperas fast hundreds million instructions per second built handle multicore homogeneous heterogeneous architectures systems freely available mips32 simulator earlier versions simulated r2000/r3000 called spim use education edumips64 gpl graphical cross-platform mips64 cpu simulator written java/swing supports wide subset mips64 isa allows user graphically see happens pipeline assembly program run cpu mars another gui-based mips emulator designed use education specifically use hennessy computer organization design webmips browser-based mips simulator visual representation generic pipelined processor simulator quite useful register tracking step step execution advanced free emulators available gxemul formerly known mips64emul project qemu projects emulate various mips iii iv microprocessors addition entire computer systems use commercial simulators available especially embedded use mips processors example wind river simics mips 4kc 5kc pmc rm9000 qed rm7000 broadcom/netlogic ec4400 cavium octeon imperas mips32 mips64 cores vast systems r3000 r4000 coware mips4ke mips24k mips25kf mips34k wepsim browser-based simulator subset mips instructions micro-programmed simulator useful order learn cpu works microprogramming mips routines traps interruptions system calls etc", + "neighbors": [ + 29, + 51, + 61, + 76, + 85, + 86, + 105, + 108, + 123, + 127, + 134, + 137, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 270, + 271, + 272, + 313, + 314, + 322, + 331, + 335, + 352, + 388, + 392, + 413, + 445, + 457, + 460, + 465, + 508, + 521, + 529, + 571, + 589, + 643, + 659, + 681, + 719, + 752, + 776, + 787, + 803, + 805, + 821, + 830, + 837, + 846, + 893, + 907, + 937, + 946, + 959, + 961, + 979, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1044, + 1052, + 1061, + 1072, + 1081, + 1111, + 1113, + 1120, + 1125, + 1143, + 1158, + 1160, + 1161, + 1174, + 1176, + 1193, + 1196, + 1207, + 1213, + 1219, + 1220, + 1222, + 1256, + 1263, + 1272, + 1284, + 1287, + 1290, + 1302, + 1346, + 1351, + 1398, + 1421, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1538, + 1557, + 1578, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1017, + "label": 8, + "text": "Scieno_Sitter:scieno sitter scieno sitter content-control software installed computer blocks certain websites critical scientology viewed software released church scientology 1998 church members using windows 95 term scieno sitter coined critics scientology assert program form internet censorship program started late summer 1998 scientologists mailed software cds told program would help members build web sites would link scientology main site however recipients program told also censorship program blocked critical sites viewed user computer sites deemed dangerous critics scientology referred program cult mind-control 21st century asserted stifles freedom speech one software developer stated though thought spam filters general good idea found disturbing huge number terms banned completely unrelated stated goals however vice president office special affairs branch scientology stated scientologists make personal choice whether use filtering software different spokesperson claimed members scientology asked software stating many parishioners want use internet asked filter protection elements sought twist pervert religion packaging cd mailed users specifically request filter states popular demand scientologists program developed prevent subjected 'entheta hate mail internet filter allows direct access sites rapidly without dev-t 'd vilifying material forgeries hate messages fashion attention remain focused dissemination setting people feet bridge total freedom order gain access software scientologists must first sign contract section 7 contract states members must agree use specific internet filter program csi provided allows freedom view sites dianetics scientology principals without threat accessing sites deemed using marks works unauthorized fashion deemed improper discreditable scientology religion program works preventing user accessing sites certain keywords scientology identified objectionable material viewing members use keywords functions way prevent members learning guarded scientology doctrine xenu ot iii material relating space opera scientology scripture keywords notable topics blocked program include names several notable critics scientology including robert vaughn young keith henson well several hundred frequent participants alt.religion.scientology newsgroup together terms like suppressive person lisa mcpherson screening process limited viewing web sites however also blocks users discussing forbidden keywords chat programs internet relay chat keywords mentioned certain individuals identified undesirable enter chat room user kicked discussion tory christman worked operative osa osa operatives removed program computer allow analyze critical material spread internet scientology time software removed christman encountered operation clambake web site online discussions operator andreas heldal-lund eventually led leaving scientology public announcement alt.religion.scientology december 1998 software discussed e network program investigative reports program showed web page operation clambake described software piece entitled church scientology\u2014afraid real world censors net members bob minton quoted report stating scientologists given filtering software allow go internet want scientologists subjected critical information 2006 film bridge scientologist character diane wheat attempts find information internet google search word zeenu directed search word xenu operation clambake web site comes first search results wheat attempts view site message appears computer stating page requested identified containing racist/hate-oriented material scientology symbol displayed left-hand side warning box", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1018, + "label": 2, + "text": "S60_(software_platform):s60 software platform s60 platform formerly series 60 user interface software platform smartphones runs top symbian operating system created nokia based 'pearl user interface symbian ltd introduced comdex november 2001 first shipped nokia 7650 smartphone platform since seen 5 updated editions series 60 renamed s60 november 2005 2008 symbian foundation formed consolidate assets different symbian platforms s60 uiq moap making open source 2009 based code base s60 first iteration platform since creation symbian foundation launched s60 5th edition symbian^1 top symbian os 9.4 base subsequent iterations named symbian^2 japanese market symbian^3 s60 software multivendor standard smartphones supports application development java midp c++ python adobe flash api called avkon ui s60 consists suite libraries standard applications telephony personal information manager pim tools helix-based multimedia players intended power fully featured modern phones large colour screens commonly known smartphones originally distinguishing feature s60 phones allowed users install new applications purchase unlike standard desktop platform however built-in apps rarely upgraded vendor beyond bug fixes new features added phones developed rather public release certain buttons standardized menu key four way joystick d-pad left right soft keys clear key s60 mainly used nokia also licensed manufacturers including lenovo lg electronics panasonic samsung sendo siemens mobile sony ericsson solstice vertu sony ericsson notably main vendor using competing uiq symbian interface addition manufacturers community includes four major releases s60 series 60 2001 series 60 second edition 2002 s60 3rd edition 2005 s60 5th edition 2008 release updated version called feature pack sometimes known relay runs different symbian version many devices capable running s60 software platform symbian os devices ranging early nokia 7650 running s60 v0.9 symbian os v6.1 latest samsung i8910 omnia hd running s60 v5.0 symbian os v9.4 symbian^3 version revised platform v5.2 table lists devices carrying version s60 well symbian os version based note new devices since symbian^3 may capable upgrading later systems symbian anna symbian belle therefore may see device listed many systems symbian progressing period organisational change metamorph open source software platform project os symbian os originally provided user interface ui visual layer runs atop operating system implemented separately examples symbian uis moap series 60 series 80 series 90 uiq separation ui underlying os created flexibility confusion market place nokia purchase symbian brokered involvement ui developers major user interface layers pledged donated open source foundation independently symbian operating system new symbian foundation announced intent unify different symbian uis single ui based s60 platform announcements made march 2009 indicated would s60 5th edition feature pack 1 12 april 2011 nokia announced symbian anna software update symbian^3 release three new devices 500 x7 e6 announced symbian anna pre-installed symbian anna available software update symbian^3 based devices well significant updates come anna 24 august 2011 nokia announced symbian belle later renamed nokia belle software update symbian anna release three new devices 603 700 701 nokia 600 cancelled replaced nokia 603 announced symbian belle pre-installed symbian belle available software update symbian anna-based devices well significant updates came belle november 2011 nokia announced carla donna updates carla expected released late 2012 early 2013 feature new web browser new widgets new nfc capabilities dolby surround audio enhancement donna going dual-core processor exclusive planned released late 2013 early 2014 may 2012 nokia executive claimed carla donna cancelled nokia would instead release belle feature pack 2 later 2012 lacking many new features planned carla donna february 2011 nokia announced partnership microsoft adopt windows phone 7 nokia primary operating system leaving symbian development question nokia promised support symbian newer devices least 2016 new symbian devices released nokia 808 pureview 29 april 2011 nokia announce would transfer symbian activities accenture along 3,000 employees symbian belle symbian belle \u2013 facts features pictures", + "neighbors": [ + 3, + 21, + 101, + 113, + 162, + 238, + 253, + 264, + 298, + 309, + 337, + 484, + 520, + 527, + 602, + 603, + 619, + 622, + 707, + 726, + 927, + 1020, + 1051, + 1117, + 1138, + 1140, + 1203, + 1225, + 1314, + 1422, + 1493, + 1520, + 1522, + 1529, + 1602, + 1619, + 1621 + ], + "mask": "Train" + }, + { + "node_id": 1019, + "label": 7, + "text": "Amazon_Web_Services:amazon web services amazon web services aws subsidiary amazon provides on-demand cloud computing platforms individuals companies governments metered pay-as-you-go basis aggregate cloud computing web services provide set primitive abstract technical infrastructure distributed computing building blocks tools one services amazon elastic compute cloud allows users disposal virtual cluster computers available time internet aws version virtual computers emulate attributes real computer including hardware central processing units cpus graphics processing units gpus processing local/ram memory hard-disk/ssd storage choice operating systems networking pre-loaded application software web servers databases customer relationship management crm etc aws technology implemented server farms throughout world maintained amazon subsidiary fees based combination usage hardware/os/software/networking features chosen subscriber required availability redundancy security service options subscribers pay single virtual aws computer dedicated physical computer clusters either part subscription agreement amazon provides security subscribers system aws operates many global geographical regions including 6 north america 2017 aws comprised 90 165 2019 services spanning wide range including computing storage networking database analytics application services deployment management mobile developer tools tools internet things popular include amazon elastic compute cloud ec2 amazon simple storage service amazon s3 services exposed directly end users instead offer functionality apis developers use applications amazon web services offerings accessed http using rest architectural style soap protocol amazon markets aws subscribers way obtaining large scale computing capacity quickly cheaply building actual physical server farm services billed based usage service measures usage varying ways 2017 aws owns dominant 34 cloud iaas paas next three competitors microsoft google ibm 11 8 6 respectively according synergy group aws platform launched july 2002 early stages platform consisted disparate tools services late 2003 aws concept publicly reformulated chris pinkham benjamin black presented paper describing vision amazon retail computing infrastructure completely standardized completely automated would rely extensively web services services storage would draw internal work already underway near end paper mentioned possibility selling access virtual servers service proposing company could generate revenue new infrastructure investment november 2004 first aws service launched public usage simple queue service sqs thereafter pinkham lead developer christopher brown developed amazon ec2 service team cape town south africa amazon web services officially re-launched march 14 2006 combining three initial service offerings amazon s3 cloud storage sqs ec2 aws platform finally provided integrated suite core online services chris pinkham benjamin black proposed back 2003 service offered developers web sites client-side applications companies andy jassy aws founder vice president 2006 said time amazon s3 one first scalable elements aws helps free developers worrying going store data whether safe secure available need costs associated server maintenance whether enough storage available amazon s3 enables developers focus innovating data rather figuring store it. 2016 jassy promoted ceo division reflecting success aws annual compensation 2017 hit nearly 36 million support industry-wide training skills standardization aws began offering certification program computer engineers april 30 2013 highlight expertise cloud computing james hamilton aws engineer wrote retrospective article 2016 highlight ten-year history online service 2006 2016 early fan outspoken proponent technology joined aws engineering team 2008 january 2018 amazon launched autoscaling service aws november 2018 aws announced customized arm cores use servers also november 2018 aws developing ground stations communicate customer satellites november 2010 reported amazon.com retail sites migrated aws prior 2012 aws considered part amazon.com revenue delineated amazon financial statements year industry watchers first time estimated aws revenue 1.5 billion april 2015 amazon.com reported aws profitable sales 1.57 billion first quarter year 265 million operating income founder jeff bezos described fast-growing 5 billion business analysts described surprisingly profitable forecast october 2015 amazon.com said q3 earnings report aws operating income 521 million operating margins 25 percent aws 2015 q3 revenue 2.1 billion 78 increase 2014 q3 revenue 1.17 billion 2015 q4 revenue aws segment increased 69.5 y/y 2.4 billion 28.5 operating margin giving aws 9.6 billion run rate 2015 gartner estimated aws customers deploying 10x infrastructure aws combined adoption next 14 providers 2016 q1 revenue 2.57 billion net income 604 million 64 increase 2015 q1 resulted aws profitable amazon north american retail business first time first quarter 2016 amazon experienced 42 rise stock value result increased earnings aws contributed 56 corporate profits aws 17.46 billion annual revenue 2017 end 2018 number grown 25.65 billion notable customers include nasa obama presidential campaign 2012 netflix 2019 reported 80 germany listed dax companies use aws 2019 aws distinct operations 20 geographical regions 6 north america 1 south america 5 emea 8 asia pacific aws announced 5 new regions coming online hong kong sar bahrain milan cape town jakarta region wholly contained within single country data services stay within designated region region multiple availability zones consist one discrete data centers redundant power networking connectivity housed separate facilities availability zones automatically provide additional scalability redundancy within region since intentionally isolated prevent outages spreading zones several services operate across availability zones e.g. s3 dynamodb others configured replicate across zones spread demand avoid downtime failures december 2014 amazon web services operated estimated 1.4 million servers across 28 availability zones global network aws edge locations consists 54 points presence worldwide including locations united states europe asia australia south america 2014 aws claimed aim achieve 100 renewable energy usage future united states aws partnerships renewable energy providers include community energy virginia support us east region pattern development january 2015 construct operate amazon wind farm fowler ridge iberdrola renewables llc july 2015 construct operate amazon wind farm us east edp renewables north america november 2015 construct operate amazon wind farm us central tesla motors apply battery storage technology address power needs us west northern california region aws also pop-up lofts different locations around world market aws entrepreneurs startups different tech industries physical location visitors work relax inside loft learn aws june 2014 aws opened first temporary pop-up loft san francisco may 2015 expanded new york city september 2015 expanded berlin aws opened fourth location tel aviv march 1 2016 march 22 2016 pop-up loft open london september 10 october 29 2015 2017 aws launched amazon start united kingdom help young adults military veterans retrain technology-related skills partnership prince trust ministry defence mod aws help provide re-training opportunities young people disadvantaged backgrounds former military personnel aws working alongside number partner companies including cloudreach sage edf energy tesco bank", + "neighbors": [ + 17, + 77, + 124, + 148, + 178, + 227, + 270, + 318, + 339, + 379, + 399, + 429, + 479, + 480, + 505, + 556, + 611, + 642, + 647, + 671, + 725, + 857, + 900, + 903, + 936, + 1036, + 1053, + 1087, + 1102, + 1208, + 1235, + 1326, + 1363, + 1377, + 1416, + 1431, + 1433, + 1447, + 1483, + 1503, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1020, + "label": 2, + "text": "Series_90_(software_platform):series 90 software platform series 90 formerly hildon platform mobile phones uses symbian os developed nokia collaboration psion released 2003 going platform nokia 7700 cancelled eventually make market nokia 7710 nokia discontinued series 90 platform merged technology s60 although one production series 90 device made form gui continued nokia hildon user interface maemo shipped nokia internet tablets series 90 completely incompatible series 60 s60 uiq popular platforms symbian smartphones however applications nokia series 80 communicator devices \u2013 nokia 9300 \u2013 function series 90 essentially series 90 development psion eikon gui used series 5 series 5mx revo netpad series 7 netbook machines modified controlled entirely touchscreen supplemented 77x0 seven hardware buttons rocker-dial nokia 7700 never released on-screen keyboard text input 7710 added basic handwriting recognition applications single menu tree accessible title bar top screen exit quit option apps button bar added right hand side screen resembling nokia communicator smartphones", + "neighbors": [ + 3, + 21, + 101, + 113, + 162, + 238, + 253, + 264, + 298, + 309, + 337, + 477, + 484, + 520, + 527, + 603, + 619, + 622, + 629, + 707, + 726, + 1018, + 1051, + 1117, + 1138, + 1140, + 1193, + 1203, + 1314, + 1422, + 1493, + 1520, + 1522, + 1529, + 1602, + 1619 + ], + "mask": "Test" + }, + { + "node_id": 1021, + "label": 9, + "text": "CommonLoops:commonloops commonloops common lisp object-oriented programming system acronym reminiscent earlier lisp oo system loops interlisp-d system early programming language extended common lisp include object-oriented programming functionality dynamic object system differs oop facilities found static languages c++ java like new flavors commonloops supported multiple inheritance generic functions method combination commonloops also supported multi-methods made use metaobjects commonloops new flavors primary ancestors clos commonloops supported portable implementation known portable commonloops pcl ran common lisp implementations day", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 246, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 755, + 787, + 795, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1022, + "label": 3, + "text": "Motorola_68000:motorola 68000 motorola 68000 'sixty-eight-thousand also called m68k motorola 68k sixty-eight-kay 16/32-bit cisc microprocessor introduced 1979 motorola semiconductor products sector design implements 32-bit instruction set 32-bit registers 32-bit internal data bus address bus 24-bits use memory segmentation made popular programmers internally uses 16-bit data alu two additional 16-bit alus used mostly addresses 16-bit external data bus reason motorola referred 16/32-bit processor one first widely available processors 32-bit instruction set running relatively high speeds era 68k popular design 1980s widely used new generation personal computers graphical user interfaces including apple macintosh commodore amiga atari st many others competed primarily intel 8088 found ibm pc easily outperformed 68k 8088 pushed designs like zilog z8000 niche markets made motorola major player cpu space 68k soon expanded additional family members implementing full 32-bit alus part growing motorola 68000 series original 68k generally software forward-compatible rest line despite limited 16-bit wide external bus 40 years production 68000 architecture still use motorola first widely-produced cpu motorola 6800 although capable design eclipsed powerful designs like zilog z80 less powerful faster designs like mos 6502 sales prospects 6800 dimmed motorola began totally new design replace became motorola advanced computer system silicon project macss begun 1976 macss aimed develop entirely new architecture without backward compatibility 6800 ultimately retain bus protocol compatibility mode existing 6800 peripheral devices version 8-bit data bus produced however designers mainly focused future forward compatibility gave 68000 design head start later 32-bit instruction set architectures instance cpu registers 32 bits wide though self-contained structures processor operate 32 bits time macss team drew heavily influence minicomputer processor design pdp-11 vax systems similarly microcode-based mid 1970s 8-bit microprocessor manufacturers raced introduce 16-bit generation national semiconductor first imp-16 pace processors 1973\u20131975 issues speed intel worked advanced 16/32-bit intel iapx 432 alias 8800 since 1975 intel 8086 since 1976 introduced 1978 became really widespread form almost identical 8088 ibm pc years later arriving late 16-bit arena afforded new processor transistors roughly 40,000 active versus 20,000 active 8086 32-bit macroinstructions acclaimed general ease use original mc68000 fabricated using hmos process 3.5 \u00b5m feature size formally introduced september 1979 initial samples released february 1980 production chips available counter november initial speed grades 4 6 8 mhz 10 mhz chips became available 1981 12.5 mhz chips june 1982 16.67 mhz 12f version mc68000 fastest version original hmos chip produced late 1980s 68k instruction set particularly well suited implement unix 68000 successors became dominant cpus unix-based workstations including sun workstations apollo/domain workstations 68000 also used mass-market computers apple lisa macintosh amiga atari st 68000 used microsoft xenix systems well early netware unix-based server 68000 used first generation desktop laser printers including original apple inc. laserwriter hp laserjet 1982 68000 received minor update isa support virtual memory conform popek goldberg virtualization requirements updated chip called 68010 also added new loop mode sped small loops increased overall performance 10 clock speeds extended version exposed 31 bits address bus also produced small quantities 68012 support lower-cost systems control applications smaller memory sizes motorola introduced 8-bit compatible mc68008 also 1982 68000 8-bit data bus smaller 20-bit address bus 1982 motorola devoted attention 68020 88000 projects several companies second-source manufacturers hmos 68000 included hitachi hd68000 shrank feature size 2.7 \u00b5m 12.5 mhz version mostek mk68000 rockwell r68000 signetics scn68000 thomson/sgs-thomson originally ef68000 later ts68000 toshiba tmp68000 toshiba also second-source maker cmos 68hc000 tmp68hc000 encrypted variants 68000 hitachi fd1089 fd1094 store decryption keys opcodes opcode data battery-backed memory used certain sega arcade systems including system 16 prevent piracy illegal bootleg games 68hc000 first cmos version 68000 designed hitachi jointly introduced 1985 motorola version called mc68hc000 hitachi hd68hc000 68hc000 eventually offered speeds 8\u201320 mhz except using cmos circuitry behaved identically hmos mc68000 change cmos greatly reduced power consumption original hmos mc68000 consumed around 1.35 watts ambient temperature 25 \u00b0c regardless clock speed mc68hc000 consumed 0.13 watts 8 mhz 0.38 watts 20 mhz unlike cmos circuits hmos still draws power idle power consumption varies little clock rate apple selected 68hc000 use macintosh portable motorola replaced mc68008 mc68hc001 1990 chip resembled 68hc000 respects data bus could operate either 16-bit 8-bit mode depending value input pin reset thus like 68008 could used systems cheaper 8-bit memories later evolution 68000 focused modern embedded control applications on-chip peripherals 68ec000 chip scm68000 core expanded address bus 32 bits removed m6800 peripheral bus excluded move sr instruction user mode programs 1996 motorola updated standalone core fully static circuitry drawing 2 \u00b5w low-power mode calling mc68sec000 motorola ceased production hmos mc68000 mc68008 1996 spin-off company freescale semiconductor still producing mc68hc000 mc68hc001 mc68ec000 mc68sec000 well mc68302 mc68306 microcontrollers later versions dragonball family 68000 architectural descendants 680x0 cpu32 coldfire families also still production recently sendai fab closure 68hc000 68020 68030 68882 parts discontinued leaving 68sec000 production succeeded true 32-bit microprocessors 68000 used core many microcontrollers 1989 motorola introduced mc68302 communications processor introduction 68000 first used high-priced systems including multiuser microcomputers like wicat 150 early alpha microsystems computers sage ii iv tandy trs-80 model 16 single-user workstations hewlett-packard hp 9000 series 200 systems first apollo/domain systems sun microsystems sun-1 corvus concept graphics terminals like digital equipment corporation vaxstation 100 silicon graphics iris 1000 1200 unix systems rapidly moved capable later generations 68k line remained popular market throughout 1980s mid-1980s falling production cost made 68000 viable use personal home computers starting apple lisa macintosh followed commodore amiga atari st sharp x68000 hand sinclair ql microcomputer commercially important utilisation 68008 along derivatives icl one per desk business terminal helix systems missouri united states designed extension swtpc ss-50 bus ss-64 produced systems built around 68008 processor adoption risc x86 displaced 68000 series desktop/workstation cpu processor found substantial use embedded applications early 1980s quantities 68000 cpus could purchased less 30 usd per part video game manufacturers used 68000 backbone many arcade games home game consoles atari food fight 1982 one first 68000-based arcade games others included sega system 16 capcom cp system cps-2 snk neo geo late 1980s 68000 inexpensive enough power home game consoles sega mega drive/genesis console also sega cd attachment sega cd system three cpus two 68000s 1993 multi-processor atari jaguar console used 68000 support chip although developers used primary processor due familiarity 1994 multi-processor sega saturn console used 68000 sound co-processor much mega drive/genesis uses z80 co-processor sound and/or purposes certain arcade games steel gunner others based namco system 2 use dual 68000 cpu configuration systems triple 68000 cpu configuration also exist galaxy force others based sega board along quad 68000 cpu configuration used jaleco one 68000 sound lower clock rate compared 68000 cpus games big run cisco heat fifth 68000 different clock rate compared 68000 cpus additionally used jaleco arcade game wild pilot i/o processing 68000 also saw great success embedded controller early 1981 laser printers imagen imprint-10 controlled external boards equipped 68000 first hp laserjet\u2014introduced 1984\u2014came built-in 8 mhz 68000 printer manufacturers adopted 68000 including apple introduction laserwriter 1985 first postscript laser printer 68000 continued widely used printers throughout rest 1980s persisting well 1990s low-end printers 68000 also saw success field industrial control systems among systems benefited 68000 derivative microprocessor families programmable logic controllers plcs manufactured allen-bradley texas instruments subsequently following acquisition division ti siemens users systems accept product obsolescence rate domestic users entirely likely despite installed 20 years ago many 68000-based controllers continue reliable service well 21st century number digital oscilloscopes 80s 68000 used waveform display processor models including lecroy 9400/9400a also use 68000 waveform math processor including addition subtraction multiplication division two waveforms/references/waveform memories digital oscilloscopes using 68000 including 9400/9400a also perform fft functions waveform 683xx microcontrollers based 68000 architecture used networking telecom equipment television set-top boxes laboratory medical instruments even handheld calculators mc68302 derivatives used many telecom products cisco 3com ascend marconi cyclades others past models palm pdas handspring visor used dragonball derivative 68000 alphasmart uses dragonball family later versions portable word processors texas instruments uses 68000 high-end graphing calculators ti-89 ti-92 series voyage 200 early versions used specialized microcontroller static 68ec000 core later versions use standard mc68sec000 processor modified version 68000 formed basis ibm xt/370 hardware emulator system 370 processor 68000 24-bit external address bus two byte-select signals replaced a0 24 lines therefore address 16 mb physical memory byte resolution address storage computation uses 32 bits internally however 8 high-order address bits ignored due physical lack device pins allows run software written logically flat 32-bit address space accessing 24-bit physical address space motorola intent internal 32-bit address space forward compatibility making feasible write 68000 software would take full advantage later 32-bit implementations 68000 instruction set however prevent programmers writing forward incompatible software 24-bit software discarded upper address byte used purposes addressing could fail 32-bit 68000 implementations example early pre-7.0 versions apple mac os used high byte memory-block master pointers hold flags locked purgeable later versions os moved flags nearby location apple began shipping computers 32-bit clean roms beginning release 1989 mac iici 68000 family stores multi-byte integers memory big-endian order cpu eight 32-bit general-purpose data registers d0-d7 eight address registers a0-a7 last address register stack pointer assemblers accept label sp equivalent a7 good number registers time many ways small enough allow 68000 respond quickly interrupts even worst case 8 data registers d0\u2013d7 7 address registers a0\u2013a6 needed saved 15 registers total yet large enough make calculations fast could done entirely within processor without keeping partial results memory note exception routine supervisor mode also save user stack pointer a7 would total 8 address registers however dual stack pointer a7 supervisor-mode a7 design 68000 makes normally unnecessary except task switch performed multitasking system two types registers mildly annoying times hard use practice reportedly allowed cpu designers achieve higher degree parallelism using auxiliary execution unit address registers 68000 comparison arithmetic logic operations set bit flags status register record results use later conditional jumps bit flags zero z carry c overflow v extend x negative n extend x flag deserves special mention separate carry flag permits extra bit arithmetic logic shift operations separated carry flow-of-control linkage designers attempted make assembly language orthogonal instructions divided operations address modes almost address modes available almost instructions 56 instructions minimum instruction size 16 bits many instructions addressing modes longer include additional address mode bits cpu later whole family implements two levels privilege user mode gives access everything except privileged instructions interrupt level controls supervisor privilege gives access everything interrupt always becomes supervisory supervisor bit stored status register visible user programs advantage system supervisor level separate stack pointer permits multitasking system use small stacks tasks designers allocate memory required hold stack frames maximum stack-up interrupts cpu recognizes seven interrupt levels levels 1 5 strictly prioritized higher-numbered interrupt always interrupt lower-numbered interrupt status register privileged instruction allows one set current minimum interrupt level blocking lower equal priority interrupts example interrupt level status register set 3 higher levels 4 7 cause exception level 7 level triggered non-maskable interrupt nmi level 1 interrupted higher level level 0 means interrupt level stored status register visible user-level programs hardware interrupts signalled cpu using three inputs encode highest pending interrupt priority separate encoder usually required encode interrupts though systems require three hardware interrupts possible connect interrupt signals directly encoded inputs cost additional software complexity interrupt controller simple 74ls148 priority encoder may part vlsi peripheral chip mc68901 multi-function peripheral used atari st range computers sharp x68000 also provided uart timer parallel i/o exception table interrupt vector table interrupt vector addresses fixed addresses 0 1023 permitting 256 32-bit vectors first vector reset consists two vectors namely starting stack address starting code address vectors 3 15 used report various errors bus error address error illegal instruction zero division chk chk2 vector privilege violation block privilege escalation reserved vectors became line 1010 emulator line 1111 emulator hardware breakpoint vector 24 starts real interrupts spurious interrupt hardware acknowledgement level 1 level 7 autovectors 16 trap vectors reserved vectors user defined vectors since minimum starting code address vector must always valid reset systems commonly included nonvolatile memory e.g rom starting address zero contain vectors bootstrap code however general purpose system desirable operating system able change vectors runtime often accomplished either pointing vectors rom jump table ram use bank switching allow rom replaced ram runtime 68000 meet popek goldberg virtualization requirements full processor virtualization single unprivileged instruction move sr allows user-mode software read-only access small amount privileged state 68000 also unable easily support virtual memory requires ability trap recover failed memory access 68000 provide bus error exception used trap save enough processor state resume faulted instruction operating system handled exception several companies succeed making 68000-based unix workstations virtual memory worked using two 68000 chips running parallel different phased clocks leading 68000 encountered bad memory access extra hardware would interrupt main 68000 prevent also encountering bad memory access interrupt routine would handle virtual memory functions restart leading 68000 correct state continue properly synchronized operation main 68000 returned interrupt problems fixed next major revision 68k architecture release mc68010 bus error address error exceptions push large amount internal state onto supervisor stack order facilitate recovery move sr instruction made privileged new unprivileged move ccr instruction provided use place user mode software operating system trap emulate user-mode move sr instructions desired standard addressing modes plus access status register later models special registers instructions dot-letter suffixes permitting operations occur 8-bit bytes .b 16-bit words .w 32-bit longs .l like many cpus era cycle timing instructions varied depending source operand example unsigned multiply instruction takes 38+2n clock cycles complete n equal number bits set operand create function took fixed cycle count required addition extra code multiply instruction would typically consume extra cycles bit n't set original multiplication operand instructions dyadic operation source destination destination changed notable instructions 68ec000 low-cost version 68000 slightly different pinout designed embedded controller applications 68ec000 either 8-bit 16-bit data bus switchable reset processors available variety speeds including 8 16 mhz configurations producing 2,100 4,376 dhrystones processors floating-point unit difficult implement fpu coprocessor mc68881/2 one ec series lacks necessary coprocessor instructions 68ec000 used controller many audio applications including ensoniq musical instruments sound cards part midi synthesizer ensoniq sound boards controller provided several advantages compared competitors without cpu board processor allowed board configured perform various audio tasks mpu-401 midi synthesis mt-32 emulation without use tsr program improved software compatibility lowered cpu usage eliminated host system memory usage motorola 68ec000 core later used m68k-based dragonball processors motorola/freescale also used sound controller sega saturn game console controller hp jetdirect ethernet controller boards mid-1990s laserjet printers 68000 assembly code subroutine named copies null-terminated string 8-bit characters destination string converting alphabetic characters lower case subroutine establishes call frame using register a6 frame pointer kind calling convention supports reentrant recursive code typically used languages like c c++ subroutine retrieves parameters passed stack loops reading ascii character single byte string checking whether capital alphabetic character converting lower-case character otherwise leaving writing character string finally checks whether character null character repeats loop otherwise restores previous stack frame a6 register returns note string pointers registers a0 a1 auto-incremented iteration loop contrast code stand-alone function even restrictive version ams ti-89 series calculators kernel-independent values looked tables files libraries executing system calls exception processing minimal registers used need save valid historical julian dates 1 march 1 ad gregorian ones less two dozen operations calculates day number compatible iso 8601 called three inputs stored corresponding locations", + "neighbors": [ + 78, + 99, + 195, + 206, + 270, + 271, + 306, + 322, + 331, + 388, + 413, + 465, + 475, + 508, + 529, + 540, + 575, + 643, + 653, + 681, + 735, + 738, + 743, + 752, + 755, + 787, + 860, + 891, + 907, + 957, + 1009, + 1143, + 1147, + 1188, + 1207, + 1221, + 1233, + 1284, + 1294, + 1304, + 1398, + 1421, + 1605, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1023, + "label": 4, + "text": "Frank_W._Lewis:frank w. lewis frank waring lewis august 25 1912 \u2013 november 18 2010 american cryptographer cryptic crossword compiler puzzles printed nation 60 years total 2,962 puzzles leonard bernstein kurt vonnegut katha pollitt listed among fans puzzles lewis born august 25 1912 salt lake city utah father england lewis attended secretarial school university utah later earned degree absentia passed federal civil service test earned master degree music catholic university america washington d.c washington lewis worked government secretarial jobs world war ii lewis approached col. william f. friedman head u.s. army cryptography section looking smart people lewis hired civilian helped break code used coordinate japanese ships war joined national security agency nsa awarded decoration exceptional civilian service war department nsa may person two medals much work remains classified 1969 retired wife caribbean relocated massachusetts eruption montserrat volcano died november 18 2010 age 98 survived wife 74 years sylvia n\u00e9e shosteck six children lewis discovered british-style cryptic crosswords stationed war bletchley park code-breaking station england lewis took nation puzzle setter 1947 nation started running puzzles every week instead weekly starting 2008 public outcry great resumed printing puzzles weekly lewis published last puzzle nation december 2009 magazine began reprinting old ones lewis death magazine continued reprint old puzzles searched new puzzle setter", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1024, + "label": 2, + "text": "Visi_On:visi visicorp visi short-lived highly influential graphical user interface-based operating environment program ibm compatible personal computers running ms-dos although visi never popular steep minimum system requirements day major influence later development microsoft windows spring 1981 personal software cash-flush ever-increasing sales visicalc corporate directors sat planned future directions ed esber introduced concept family products could sold together technical perspective none products similar anything name instance use visiplot visicalc data numbers plotted exported raw format re-imported dan fylstra led technical discussion sorts actions user would need able accomplish order products truly integrated decided three key concepts one universal data exchange would supported set common data structures used programs another common consistent interface users would re-learn ui moved one program another finally fylstra concerned time needed move one program another long useful \u2013 user needing quickly look something visidex would save exit visicalc look information quit re-launch visicalc process made quicker simpler july 1981 xerox announced xerox star advanced workstation computer featuring graphical user interface point well known secret apple computer working low-cost computer gui would later released apple lisa personal software president terry opdendyk knew two-man team texas working gui arranged scott warren dennis abbe visit personal software headquarters sunnyvale california demonstrated version smalltalk programming language running trs-80 microcomputer seriously underpowered machine task personal software extremely impressed contract soon signed work project quasar started almost immediately name shortly thereafter changed visi play vision retained visi naming experimental port ill-fated apple iii completed november development work shifted dec vax cross-compilers number different machines early 1982 personal software changed name visicorp betting much future success company visi visi many features modern gui included become common many years later fully mouse-driven used bit-mapped display text graphics included on-line help allowed user open number programs window visi however include graphical file manager visi also demanded hard drive order implement virtual memory system used fast switching time hard drives expensive piece equipment tom powers visicorp new vp marketing pushed system demonstrated fall comdex show 1982 others company worried product ready shipping showing early would leave potential customers distributors upset n't ready soon another concern visiword released show worry might lost shuffle demonstrations comdex huge success many viewers told simply movie watching bill gates speculated pc fact simply terminal real machine like vax became one talked-about products industry however huge success led number serious problems separate june july 1983 byte articles company mentioned late summer 1983 release visi development continued visicorp entity process self-destruction terry opdendyk president hand-picked early venture capital investors extremely autocratic management style led departure many key executives late 1981 eventual release visi product management company left notably mitch kapor charge visicalc development ed esber roy folk visi product marketing manager among others referred corporate civil war mitch kapor departure would prove devastating company however kapor developer visiplot visitrend pressing development greatly improved spreadsheet succeed visicalc opdendyk uninterested time visicorp visicalc developers impasse visicalc growing increasingly outdated kapor decided leave executives pressed clause forbidding kapor work integrated spreadsheet opdendyk could n't bothered exclaiming kapor spaghetti programmer denigrating abilities kapor would go release lotus 1-2-3 became major competitor visicalc 1983 end year sales cut half combined exodus major portions senior executive staff ongoing battle visicalc developers visicorp soon serious financial difficulty hopes company future placed visi october 31 1983 infoworld article titled finally visi flatly stated ... publisher putting product computer store shelves ... visi scheduled available last week october november 14 1983 issue said visicorp released visi however july 2 1984 issue says time visi actually shipped december 16 1983 ... pc magazine reported february 7 1984 issue still n't received product commercially available form operating system known visi applications manager released december 1983 sold 495 requiring mouse another 250 main disadvantage visi extremely high system requirements 1982 standards needed 512 kilobytes ram hard disk time pcs shipped 64k-128k ibm yet offer hard disk pc ibm first model hard drive pc xt n't ship march 1983 third-party drives however available time typically 5mb units connected floppy controller treated operating system oversized floppy disk subdirectory support brought total cost running visi 7500 three-quarters cost apple lisa press continued laud product going far claim represented end operating systems end-users less impressed however due high cost required hardware also general slowness system market computers generally used one two tasks usually business related whole purpose visi seriously diluted january 1984 apple computer released macintosh much fanfare although macintosh seriously lacking software faster cheaper included one feature visi lacked graphical file manager finder although n't compete directly visi really pc product nevertheless demonstrated gui could indeed fast relatively inexpensive visi failed deliver adding release problems bill gates took page visicorp book announced product microsoft windows would available may 1984 muddied waters significantly notably claimed would similar feature set n't require hard disk cost 250 windows released even longer delay visi shipping november 1985 lacking features forced visi demand hard drive eight visicorp employees still developing visi visicorp sold source code control data mid-1984 raise cash sued software arts continuing sell software sales apparently slow february 1985 visicorp responded lowering price basic os 99 knowing anyone purchasing would also need buy applications bundled three 990 improved situation somewhat sales still far projections certainly helping company stave problems due lotus 1-2-3 following declining visicalc sales low revenues visi november 1985 company merged paladin software new company kept paladin name visicorp line visiproducts history official system requirements visi work newer pcs requires compatible mouse hard disk partition 15mb fat12 file system supported addition revectors irqs used pc/ats later visionxt.exe requires modifications prevent graph applications functioning properly visi required mouse systems-compatible mice microsoft-compatible pc mice time became standard introduced later may 1983 visi used two mouse drivers first loaded text mode made mouse registers accessible embedded driver translated coordinates cursor position internal driver built-in subroutine visionxt.exe required mouse systems pc-mouse pointing device compatible microsoft mouse standard writing visi applications required unix development environment visi targeted toward high-end expensive pc workstations visi applications written subset c visic third-party could ported core software visihost visimachine virtual machine visionxt.exe ibm pc dos version unix never occurred 1984 visicorp assets sold control data corporation making working copies original floppy disks using modern methods difficult protected using pre-created bad sectors methods floppy disk identification", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 306, + 322, + 353, + 359, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 868, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1188, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1025, + "label": 2, + "text": "Windows_DVD_Maker:windows dvd maker windows dvd maker dvd authoring utility developed microsoft first released 2007 windows vista utility allows users create dvd slideshows videos playback media devices dvd player comparable apple idvd released 2001 dvd maker removed windows 8 windows dvd maker first reported paul thurrott windows hardware engineering conference 2003 thurrott stated windows vista known codename longhorn would support dvd movie creation independent application shell information accompanied additional reports windows vista would support major dvd packet writing formats mount rainier would also eliminate staging burning steps writing optical media\u2014files copied recordable media would instead written immediately latter functionality exposed via live file system windows dvd maker available home premium enterprise ultimate editions windows vista well home premium professional enterprise ultimate editions windows 7 simple aero wizard-style user interface takes user process creating dvd-video first step involves importing video files arranging play proper order windows dvd maker automatically splits videos scenes accessed special scene selection page dvd menu next step animated dvd menus added compilation windows dvd maker also add slide show pictures musical accompaniment transition effects many similar transition effects available windows movie maker users also customize font button styles application show interactive preview dvd look act like burned example users navigate dvd menus testing windows dvd maker designed encode video background process reduced scheduling priority ensure computer remains responsive compilation process", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 365, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1026, + "label": 4, + "text": "HTTP_header_injection:http header injection http header injection general class web application security vulnerability occurs hypertext transfer protocol http headers dynamically generated based user input header injection http responses allow http response splitting session fixation via set-cookie header cross-site scripting xss malicious redirect attacks via location header http header injection relatively new area web-based attacks primarily pioneered amit klein work request/response smuggling/splitting", + "neighbors": [ + 14, + 684, + 800, + 844 + ], + "mask": "Test" + }, + { + "node_id": 1027, + "label": 2, + "text": "Shell_(computing):shell computing computing shell user interface access operating system services general operating system shells use either command-line interface cli graphical user interface gui depending computer role particular operation named shell outermost layer around operating system kernel cli shells require user familiar commands calling syntax understand concepts shell-specific scripting language example bash also easily operated via refreshable braille display provide certain advantages screen readers graphical shells place low burden beginning computer users characterized easy use since also come certain disadvantages gui-enabled operating systems also provide cli shells operating systems provide various services users including file management process management running terminating applications batch processing operating system monitoring configuration operating system shells direct interfaces underlying kernel even shell communicates user via peripheral devices attached computer directly shells actually special applications use kernel api way used application programs shell manages user\u2013system interaction prompting users input interpreting input handling output underlying operating system much like read\u2013eval\u2013print loop repl since operating system shell actually application may easily replaced another similar application operating systems addition shells running local systems different ways make remote systems available local users approaches usually referred remote access remote administration initially available multi-user mainframes provided text-based uis active user simultaneously means text terminal connected mainframe via serial line modem remote access extended unix-like systems microsoft windows unix-like systems secure shell protocol usually used text-based shells ssh tunneling used x window system\u2013based graphical user interfaces guis microsoft windows remote desktop protocol used provide gui remote access since windows vista powershell remote used text-based remote access via wmi rpc ws-management operating system shells fall one two categories command-line graphical command line shells provide command-line interface cli operating system graphical shells provide graphical user interface gui possibilities although common include voice user interface various implementations text-based user interface tui cli relative merits cli- gui-based shells often debated command-line interface cli operating system shell uses alphanumeric characters typed keyboard provide instructions data operating system interactively example teletypewriter send codes representing keystrokes command interpreter program running computer command interpreter parses sequence keystrokes responds error message recognize sequence characters may carry program action loading application program listing files logging user many others operating systems unix large variety shell programs different commands syntax capabilities operating systems single style command interface commodity operating systems ms-dos came standard command interface third-party interfaces also often available providing additional features functions menuing remote program execution application programs may also implement command-line interface example unix-like systems telnet program number commands controlling link remote computer system since commands program made keystrokes data sent remote computer means distinguishing two required escape sequence defined using either special local keystroke never passed always interpreted local system program becomes modal switching interpreting commands keyboard passing keystrokes data processed feature many command-line shells ability save sequences commands re-use data file contain sequences commands cli made follow typed user special features cli may apply carrying stored instructions batch files script files used repeatedly automate routine operations initializing set programs system restarted batch mode use shells usually involves structures conditionals variables elements programming languages bare essentials needed purpose others sophisticated programming languages conversely programming languages used interactively operating system shell purpose-built program command-line shell may offer features command-line completion interpreter expands commands based characters input user command-line interpreter may offer history function user recall earlier commands issued system repeat possibly editing since commands operating system typed user short command names compact systems representing program options common short names sometimes hard user recall early systems lacked storage resources provide detailed on-line user instruction guide graphical shells desktop shells provide means manipulating programs based graphical user interface gui allowing operations opening closing moving resizing windows well switching focus windows graphical shells may included desktop environments come separately even set loosely coupled utilities graphical user interfaces develop metaphor electronic desktop data files represented paper documents desk application programs similarly graphical representations instead invoked command names graphical shells typically build top windowing system case x window system wayland shell consists x window manager wayland compositor respectively well one multiple programs providing functionality start installed applications manage open windows virtual desktops often support widget engine case macos quartz could thought windowing system shell consists finder dock systemuiserver mission control modern versions microsoft windows operating system use windows shell shell windows shell provides familiar desktop environment start menu task bar well graphical user interface accessing file management functions operating system older versions also include program manager shell 3.x series microsoft windows fact shipped later versions windows 95 nt types least windows xp interfaces windows versions 1 2 markedly different desktop applications also considered shells long use third-party engine likewise many individuals developers dissatisfied interface windows explorer developed software either alters functioning appearance shell replaces entirely windowblinds stardock good example former sort application litestep emerge desktop good examples latter interoperability programmes purpose-designed software lets windows users use equivalents many various unix-based guis discussed well macintosh equivalent os/2 presentation manager version 3.0 run os/2 programmes conditions using os/2 environmental subsystem versions windows nt shell also used loosely describe application software built around particular component web browsers email clients analogy shells found nature also sometimes referred wrappers expert systems shell piece software empty expert system without knowledge base particular application", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 101, + 108, + 134, + 166, + 170, + 171, + 185, + 265, + 322, + 324, + 338, + 353, + 364, + 380, + 387, + 395, + 434, + 465, + 583, + 650, + 664, + 720, + 721, + 741, + 754, + 797, + 836, + 884, + 891, + 948, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1110, + 1138, + 1188, + 1190, + 1202, + 1216, + 1218, + 1224, + 1301, + 1304, + 1391, + 1394, + 1415, + 1441, + 1456, + 1521, + 1530, + 1546, + 1570, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1028, + "label": 9, + "text": "MATLAB:matlab matlab matrix laboratory multi-paradigm numerical computing environment proprietary programming language developed mathworks matlab allows matrix manipulations plotting functions data implementation algorithms creation user interfaces interfacing programs written languages including c c++ c java fortran python although matlab intended primarily numerical computing optional toolbox uses mupad symbolic engine allowing access symbolic computing abilities additional package simulink adds graphical multi-domain simulation model-based design dynamic embedded systems 2018 matlab 3 million users worldwide matlab users come various backgrounds engineering science economics cleve moler chairman computer science department university new mexico started developing matlab late 1970s designed give students access linpack eispack without learn fortran soon spread universities found strong audience within applied mathematics community jack little engineer exposed visit moler made stanford university 1983 recognizing commercial potential joined moler steve bangert rewrote matlab c founded mathworks 1984 continue development rewritten libraries known jackpac 2000 matlab rewritten use newer set libraries matrix manipulation lapack matlab first adopted researchers practitioners control engineering little specialty quickly spread many domains also used education particular teaching linear algebra numerical analysis popular amongst scientists involved image processing matlab application built around matlab scripting language common usage matlab application involves using command window interactive mathematical shell executing text files containing matlab code variables defined using assignment operator codice_1 matlab weakly typed programming language types implicitly converted inferred typed language variables assigned without declaring type except treated symbolic objects type change values come constants computation involving values variables output function example simple array defined using colon syntax initial codice_2 increment codice_2 terminator instance defines variable named codice_4 assigns new value existing variable name codice_4 array consisting values 1 3 5 7 9 array starts 1 initial value increments step previous value 2 increment value stops reaches avoid exceeding 9 terminator value increment value actually left syntax along one colons use default value 1. assigns variable named codice_6 array values 1 2 3 4 5 since default value 1 used incrementer indexing one-based usual convention matrices mathematics although programming languages c c++ java matrices defined separating elements row blank space comma using semicolon terminate row list elements surrounded square brackets parentheses used access elements subarrays also used denote function argument list sets indices specified expressions 2:4 evaluates 2 3 4 example submatrix taken rows 2 4 columns 3 4 written square identity matrix size n generated using function eye matrices size zeros ones generated functions zeros ones respectively transposing vector matrix done either function transpose adding prime dot matrix without dot matlab perform conjugate transpose matlab functions accept matrices apply element example codice_7 multiply every element j 2 reduce element modulo n matlab include standard loops similar applications r using vectorized notation often produces code faster execute code excerpted function magic.m creates magic square odd values n matlab function codice_8 used generate square matrices j containing 1 n matlab structure data types since variables matlab arrays adequate name structure array element array field names addition matlab supports dynamic field names field look-ups name field manipulations etc. unfortunately matlab jit support matlab structures therefore simple bundling various variables structure come cost creating matlab function name file match name first function file valid function names begin alphabetic character contain letters numbers underscores functions often case sensitive matlab supports elements lambda calculus introducing function handles function references implemented either .m files anonymous/nested functions matlab supports object-oriented programming including classes inheritance virtual dispatch packages pass-by-value semantics pass-by-reference semantics however syntax calling conventions significantly different languages matlab value classes reference classes depending whether class handle super-class reference classes value classes method call behavior different value reference classes example call method alter member object object instance reference class example simple class provided put file named hello.m executed following commands matlab supports developing applications graphical user interface gui features matlab includes guide gui development environment graphically designing guis also tightly integrated graph-plotting features example function plot used produce graph two vectors x code produces following figure sine function matlab program produce three-dimensional graphics using functions surf plot3 mesh matlab graphical user interfaces programmed gui design environment guide tool matlab call functions subroutines written programming languages c fortran wrapper function created allowing matlab data types passed returned mex files matlab executables dynamically loadable object files created compiling functions since 2014 increasing two-way interfacing python added libraries written perl java activex .net directly called matlab many matlab libraries example xml sql support implemented wrappers around java activex libraries calling matlab java complicated done matlab toolbox sold separately mathworks using undocumented mechanism called jmi java-to-matlab interface confused unrelated java metadata interface also called jmi official matlab api java added 2016 alternatives mupad based symbolic math toolbox available mathworks matlab connected maple mathematica libraries also exist import export mathml matlab proprietary product mathworks users subject vendor lock-in although matlab builder products deploy matlab functions library files used .net java application building environment future development still tied matlab language toolbox purchased separately evaluation license requested mathworks sales department requires detailed information project matlab evaluated granted often evaluation license valid two four weeks student version matlab available home-use license matlab simulink subset mathwork toolboxes substantially reduced prices reported european union eu competition regulators investigating whether mathworks refused sell licenses competitor regulators dropped investigation complainant withdrew accusation evidence wrongdoing found matlab number competitors commercial competitors include mathematica tk solver maple idl also free open source alternatives matlab particular gnu octave scilab freemat sagemath intended mostly compatible matlab language julia programming language also initially used matlab-like syntax among languages treat arrays basic entities array programming languages apl fortran 90 higher s-lang well statistical languages r s. also libraries add similar functionality existing languages it++ c++ perl data language perl ilnumerics .net numpy/scipy/matplotlib python scilua/torch lua sciruby ruby numeric.js javascript gnu octave unique alternatives treats incompatibility matlab bug see matlab compatibility gnu octave theory octave thus superset matlab language practice octave implement matlab functionality number release number version reported concurrent license manager program flexlm complete list changes matlab official toolboxes consult matlab release notes several easter eggs exist matlab include hidden pictures jokes example typing spy used generate picture spies spy vs spy displays image dog typing randomly outputs philosophical answer commands include penny toilet image life every easter egg appears every version matlab", + "neighbors": [ + 19, + 31, + 65, + 78, + 117, + 134, + 152, + 176, + 210, + 216, + 246, + 306, + 324, + 373, + 509, + 521, + 538, + 567, + 579, + 592, + 597, + 682, + 690, + 756, + 766, + 782, + 790, + 796, + 806, + 816, + 820, + 824, + 825, + 919, + 926, + 948, + 961, + 985, + 998, + 1005, + 1006, + 1044, + 1059, + 1088, + 1120, + 1138, + 1152, + 1219, + 1221, + 1225, + 1227, + 1235, + 1311, + 1324, + 1372, + 1417, + 1457, + 1511, + 1532, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1029, + "label": 7, + "text": "Caspio:caspio caspio privately held global software company headquartered santa clara california offices ukraine poland philippines founded frank zamani 2000 caspio provides non-technical business professionals ability create database-centric web applications without coding caspio founder ceo frank zamani worked microsoft developer late 1990s vision enable organizations build custom cloud applications ease fraction time cost versus traditional software development \u201c wanted build tool business users create applications without coding \u201d zamani said \u201c time lot people said \u2019 done \u2019 going stop me. \u201d today caspio powers 1 million applications 100 countries research projects global low-code development platform market size grow us 4.32 billion 2017 us 27.23 billion 2022 compound annual growth rate cagr 44.49 forecast period", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1030, + "label": 4, + "text": "MTR_(software):mtr software traceroute originally named matt traceroute mtr computer program combines functions traceroute ping programs one network diagnostic tool mtr probes routers route path limiting number hops individual packets may traverse listening responses expiry regularly repeat process usually per second keep track response times hops along path original matt traceroute program written matt kimball 1997 roger wolff took maintaining mtr renamed traceroute october 1998 mtr licensed terms gnu general public license gpl works modern unix-like operating systems normally works text console also optional gtk+-based graphical user interface gui mtr relies internet control message protocol icmp time exceeded type 11 code 0 packets coming back routers icmp echo reply packets packets hit destination host mtr also user datagram protocol udp mode invoked -u command line pressing u key curses interface sends udp packets time live ttl field ip header increasing one probe sent toward destination host udp mode used mtr relies icmp port unreachable packets type 3 code 3 destination reached mtr also supports ipv6 works similar manner instead relies icmpv6 messages tool often used network troubleshooting showing list routers traversed average round-trip time well packet loss router allows users identify links two given routers responsible certain fractions overall latency packet loss network help identify network overuse problems example shows mtr running linux tracing route host machine example.lan web server yahoo p25.www.re2.yahoo.com across level 3 communications network additional example shows recent version mtr running freebsd mpls labels displayed default -e switch used command line e key pressed curses interface winmtr windows gui application functionally equivalent mtr originally developed appnor msp s.r.l maintained white-tiger although similar winmtr shares common code mtr console version mtr exist windows fewer features mtr platforms", + "neighbors": [ + 134, + 255, + 306, + 757, + 1138, + 1243, + 1246, + 1287, + 1582, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 1031, + "label": 1, + "text": "Australian_Rock_Database:australian rock database australian rock database website searchable online database listed details australian rock music artists albums bands producers record labels established 2000 swedish national magnus holmgren developed interest australian music visiting exchange student information database entries initially gleaned chris spencer zbig nowara paul mchenry australian rock 3rd ed 1993 ian mcfarlane encyclopedia australian rock pop 1999 australian government former website culture recreation listed australian rock database resource australian rock music", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1032, + "label": 0, + "text": "Terminology-oriented_database:terminology-oriented database terminology-oriented database terminology-oriented database management system conceptual extension object-oriented database implements concepts defined terminology model compared object-oriented databases terminology-oriented database requires minor conceptual extensions schema level supporting set relations super-set subset intersection etc weak-typed collections shared inheritance data model terminology-oriented database high-level terminology-oriented database provides facilities transforming terminology model provided subject area experts completely database schema target schema might database schema object-oriented database well relational database schema even xml schema typically terminology-oriented databases bound specific database type since information content stored object-oriented databases relational databases identical data terminology-oriented database stored theoretically type database well xml file thus terminology-oriented databases may support several database systems storing application data terminology databases contain terms vocabularies become valuable ontologies turn ontologies help process associated triples complex predicates thus going deeper hierarchies keys rdbms semantic mapping also enhance performance", + "neighbors": [ + 429 + ], + "mask": "Test" + }, + { + "node_id": 1033, + "label": 5, + "text": "SpaceTime_(software):spacetime software spacetime also known spacetime3d 3d graphical user interface displays web pages 3d tabbed stack interface available online flash application free desktop software download microsoft windows operating system technology presented 2008 ces tradeshow ceo eddie bakhash began working spacetime 1993 product debuted beta june 4 2007 day release san jose mercury news noted software advanced 3-d navigation system 've seen n't make dizzy except thoughts could become software capabilities compared current browsing 3d technologies techcrunch comment spacetime pure eye candy sort like second life meets firefox online version spacetime features ability search google google images wikipedia youtube desktop application released beta form june 4 2007 currently available windows 2000 xp vista systems mac os x version planned 2008 yet come fruition spacetime developers currently working port product opengl framework order support linux unix operating systems using search engines including google google images yahoo yahoo image ebay flickr spacetime loads first ten results stack pages beta browser received mixed reviews katherine boehret wall street journal stated though \u2019 still rely google basic searches visual search save time turn searching fun process jack m. germain technewsworld described spacetime delivers promise save time provide revolutionary online searching stating continue use 3-d searching environment though fun work edward n. albro pcworld gave beta browser 2.5/5 stating visual results make searches easier basic browsing spacetime appeal browser buggy slow basic browsing", + "neighbors": [ + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 509, + 530, + 531, + 582, + 623, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1376, + 1378, + 1408, + 1423, + 1528, + 1550, + 1569 + ], + "mask": "Test" + }, + { + "node_id": 1034, + "label": 9, + "text": "AutoIt:autoit autoit freeware programming language microsoft windows earliest release primarily intended create automation scripts sometimes called macros microsoft windows programs since grown include enhancements programming language design overall functionality scripting language autoit 1 2 statement-driven designed primarily simulating user interaction version 3 onward autoit syntax similar found basic family languages form autoit general-purpose third-generation programming language classical data model variant data type store several types data including arrays autoit automation script converted compressed stand-alone executable run computers autoit interpreter installed wide range function libraries known udfs user defined functions also included standard available website add specialized functionality autoit also distributed ide based free scite editor compiler help text fully integrated provide de facto standard environment developers using autoit autoit typically used produce utility software microsoft windows automate routine tasks systems management monitoring maintenance software installation also used simulate user interaction whereby application driven via automated form entry keypresses mouse clicks things autoit script autoit also used low-cost laboratory automation applications include instrument synchronisation alarm monitoring results gathering devices cnc routers 3d-printers also controlled developers autoit originally released source code gnu general public license gpl practice discontinued beginning version 3.2.0 august 2006 following terms gpl code version 3.1 used create fork autohotkey project community continuing develop release code gpl", + "neighbors": [ + 0, + 8, + 152, + 236, + 273, + 510, + 606, + 670, + 782, + 810, + 812, + 843, + 961, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1306, + 1324, + 1390, + 1552, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1035, + "label": 2, + "text": "Commit_charge:commit charge computing commit charge term used microsoft windows operating systems describe total amount virtual memory guaranteed processes fit physical memory page file systems pagefile may thought maximum potential pagefile usage systems pagefile still counted virtual address space must remain physical memory ram times accessed windows task manager utility windows xp server 2003 performance tab shows three counters related commit charge program process explorer reports set values labeling total current additionally providing percentages peak current towards limit value commit charge increases program opened used goes program closed also change already-running programs allocate free private virtual memory example virtualalloc virtualfree apis task manager utility windows xp windows server 2003 graphical displays labeled pf usage page file usage history despite labels reflect pagefile contents total current commit charge height graph area corresponds commit limit show much actually written pagefile maximum potential pagefile usage amount pagefile would used current contents ram removed windows 2000 windows nt 4.0 displays labeled mem usage actually show commit charge commit limit similar displays task manager windows vista later changed reflect usage physical memory task manager processes display process contribution total commit charge shown vm size column windows xp server 2003 value labeled commit size windows vista later total commit charge always larger sum values total includes system-wide allocations paged pool display mem usage column windows xp server 2003 working set memory column windows vista later shows process current working set count physical memory ram rather virtual address space represents subset process virtual address space valid meaning referenced without incurring page fault commit charge process include major contributions process virtual address space mapped files reason process working set portion address space referenced without incurring page fault may larger contribution total commit charge total commit charge inclusive total memory physical virtual actually use commit limit may increased either creating additional pagefiles pagefile expansion enabled expanding existing one operating system expand pagefile automatically possible total commit charge approaches limit event popup window displayed stating system running low virtual memory system ever runs completely commit charge total reaches limit popup window displayed stating system virtual memory may become extremely sluggish even nonresponsive closing programs user still able point decreases total commit charge may thereby free system", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 278, + 295, + 312, + 326, + 344, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1092, + 1098, + 1138, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1531, + 1533, + 1545, + 1547, + 1561, + 1613, + 1616, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1036, + "label": 4, + "text": "Security_as_a_service:security service security service secaas business model service provider integrates security services corporate infrastructure subscription basis cost effectively individuals corporations provide total cost ownership considered secaas inspired software service model applied information security type services require on-premises hardware avoiding substantial capital outlays security services often include authentication anti-virus anti-malware/spyware intrusion detection penetration testing security event management among others outsourced security licensing delivery boasting multibillion-dollar market secaas provides users internet security services providing protection online threats attacks ddos constantly searching access points compromise websites demand use cloud computing skyrockets users vulnerable attacks due accessing internet new access points secaas serves buffer persistent online threats cloud security alliance csa organization dedicated defining raising awareness secure cloud computing csa defined following categories secaas tools created series technical implementation guidance documents help businesses implement understand secaas categories include secaas typically offered several forms security service offers number benefits including secaas number deficiencies make insecure many applications individual security service request adds least one across-the-'net round-trip counting installer packages four opportunities hacker intercept conversation secaas makes security handling uniform security breach one request security broken requests broadest attack surface also multiplies rewards incentive hacker value gained effort dramatically increased factors especially tailored resources nation/state-sponsored hacker biggest challenge secaas market maintaining reputation reliability superiority standard non-cloud services secaas whole seemingly become mainstay cloud market cloud-based website security \u2019 cater businesses specific requirements must properly assessed individual needs business cater end consumers afford keep data loose vulnerable hacker attacks heaviest part secaas educating businesses since data biggest asset businesses cios ctos take care overall security company", + "neighbors": [ + 77, + 310, + 480, + 505, + 517, + 528, + 556, + 576, + 611, + 671, + 762, + 857, + 936, + 1019, + 1090, + 1377, + 1431, + 1447, + 1472 + ], + "mask": "Test" + }, + { + "node_id": 1037, + "label": 9, + "text": "Liberty_BASIC:liberty basic liberty basic lb commercial computer programming language integrated development environment ide interpreter developed smalltalk recognizes dialect basic programming language runs 16- 32-bit windows os/2 liberty basic written carl gundel published first release company shoptalk systems 1992 progressed steadily since last published update software june 2018 current version v4.5.1 though liberty basic share limitations design advanced programming provides introductory integrated development environment ide moderate advanced users windows os/2 dlls available current version runs microsoft windows wine linux alpha testing liberty basic v5.0 underway versions run microsoft windows mac os x linux raspberry pi well liberty basic compile native code instead compiles code written ide encrypted file extension tkn file executed exe file carries file name although may change release version 5 liberty basic allows programming style similar dos basics run console mode using default main window displays formatted text accepts user input also supports gui-based event-driven programming using several types windows may contain standard controls buttons menus textboxes etc central idea creating liberty basic model handling windows syntax file handling example liberty basic help file open command opens communication device disk file window dynamic link library serial communications port \u201c device \u201d open data also commands control device \u201c printed \u201d type device set commands sent way recent versions lb word print may dropped print statement making syntax even simpler simplicity heart liberty basic beginning makes easier learn cost perhaps limiting functionality two data types supported lb4.03 numeric string type declarations required variable sign end name string variable otherwise numeric plan lb5 support types user defined types well purpose making calls api 3rd party dlls struct additional types necessary dll data structure currently supported array arrays one two dimensions supported lb5 may support arrays user-defined types examples language hello world program program display pop-up message box words hello world program display input box running another application using liberty basic printing multiplication table 5 form gnu/liberty basic compiler collection glbcc anthony liguori set tools compile liberty basic programs runs windows linux systems project updated since 2001 2011 alternative windows implementation liberty basic lb booster lbb became available although substantially compatible liberty basic 4 language syntax lbb developed entirely independently richard russell written bbc basic lbb offers typically increased execution speed smaller self-contained executables additional capabilities however lbb 100 compatible lb4 whilst many programs run without modification may need adapted even unsuitable running lbb", + "neighbors": [ + 0, + 8, + 134, + 236, + 273, + 306, + 510, + 606, + 670, + 805, + 810, + 812, + 825, + 843, + 872, + 961, + 1034, + 1050, + 1079, + 1138, + 1156, + 1204, + 1221, + 1225, + 1235, + 1306, + 1324, + 1372, + 1390, + 1584, + 1593, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1038, + "label": 4, + "text": "AVG_Technologies:avg technologies avg technologies cz s.r.o czech security software company headquartered brno founded 1991 jan gritzbach tom\u00e1\u0161 hofer wholly owned subsidiary avast since 2016 company develops antivirus software internet security services avg antivirus corporate offices europe israel brazil canada united states 2 february 2015 200 million active users used avg software products services include internet security performance optimization personal privacy identity protection applications july 2016 avast announced intended acquire avg acquisition completed 30 september 2016 avast avg operated single company since 3 october 2016 retaining two separate brands company founded brno czech republic jan gritzbach tom\u00e1\u0161 hofer 1991 grisoft /c/ software spol r. o.. owned jan gritzbach 2001 jan gritzbach decided sell grisoft benson oak capital acquisitions holding company grisoft inc. based wilmington delaware used transaction 2002 company renamed grisoft s.r.o.. three years later benson oak sold 65 share company intel capital enterprise investors us 52 million holding company grisoft holdings b.v. based amsterdam netherlands later grisoft international b.v. gradually became main company 19 april 2006 grisoft acquired german company ewido networks anti-spyware software manufacturer incorporated ewido features new versions avg software 6 november 2006 microsoft announced avg security products would available directly windows security center windows vista since 7 june 2006 avg software also used optional component gfi mailsecurity produced gfi software 5 december 2007 grisoft announced acquisition exploit prevention labs developer linkscanner safe surfing technology 2008 grisoft s.r.o renamed avg technologies cz s.r.o grisoft international b.v. avg technologies n.v.. change made increase effectiveness marketing activities january 2009 avg announced plans acquire sana security finalized plans integrate sana technologies free consumer product avg anti-virus still consideration according jr smith avg chief executive sana security developed technologies currently licensed symantec 5 october 2009 ta associates announced bought minority stake avg technologies us 200 million april 2010 avg announced appointed security industry veteran yuval ben-itzhak senior vice president engineering ben-itzhak became chief technology officer later year 9 june 2010 avg announced acquisition north carolina-based walling data north america security software distribution distributed avg offerings across united states since 2001 10 november 2010 avg announced acquisition tel aviv-based droidsecurity company specializes field mobile security solutions android devices upon completion acquisition droidsecurity become wholly owned subsidiary avg droidsecurity ceo co-founder eran pfeffer become general manager avg \u2019 mobile solutions team december 2010 avg released mandatory-install update 2011 version antivirus software caused thousands 64 bit windows vista windows 7 computers become completely inoperable avg since released fix attempts repair computers bricked installing update affected users watch following video avg official youtube page resolve issue 28 january 2011 dangerous rogue appeared interface graphics resemble previous version software uses sophisticated social engineering deceive users infect systems malware also portrays so-called emergency mode internet explorer exist genuine application 1 december 2011 avg technologies announced acquisition bsecure technologies inc. bsecure leading provider proprietary cloud-based technology internet filtering industry since 2001 endorsed software provider family online safety 2011 group restructured avg technologies holdings b.v. founded avg technologies cz s.r.o avg technologies n.v. subsidiaries 7 february 2012 avg technologies n.v. listed new york stock exchange 12 june 2013 avg technologies announced acquisition level platforms 8 march 2013 jr smith ceo tendered resignation avg eight years ceo leading company successful ipo nyse delivering eight quarters successive high-growth 30 july 2013 avg technologies announced gary kovacs company new ceo november 2014 avg technologies announced acquisition norman safeground asa oslo-based company known norman suite security products avg technologies announced may 2015 acquisition privax uk based company owner hidemyass vpn service september 2015 company announced acquisition location labs company personal security products four major us cellular carriers 7 july 2016 avast announced intended acquire avg technologies purchase price 25.00 per share cash total around 1.3 billion acquisition completed 30 september 2016 avast avg operate single company monday 3 october 2016 company delisted new york stock exchange 20 august 2010 avg entered partnership moka5 secure desktop virtualisation solutions partnership adds critical security layer virtual desktop marketplace enterprise companies turning desktop virtualization secure solution bringing computer byoc work home initiatives employees 1 july 2010 avg partnered opera software provide malware security web browser opera protection added existing fraud protection technology netcraft phishtank haute secure july 2011 avg joined forces israeli company zbang launch multimi free windows ipad app integrates e-mail social media multimedia one interface avg provides linkscanner app checking link sent e-mail shared social network found via search december 2012 avg yahoo partnered secure search toolbar september 2013 avg partnered facebook launch facebook privacy application avg crowd control may 2012 avg technologies issued copyright claim referred 'takedown request youtube video 1987 pop song never gon na give performed british singer rick astley video october 2015 150 million views 300,000 comments uploaded 2007 restored within 24 hours youtube video name refers internet meme commonly referred 'rickrolling someone pranks others tricking going video avg browser add-on avg secure search criticized adware since frequently bundled software often mistakenly installed exhibits malware-like behavior avg secure search also advertised users free versions avg products although add-on offers legitimate malware-blocking capabilities default behavior changing internet browser default search engine homepage new tab page avg secure search reminiscent potentially unwanted program pup problems uninstalling add-on widely reported add-on could potentially make internet browser vulnerable attacks", + "neighbors": [ + 17, + 94, + 120, + 297, + 476, + 576, + 717, + 842, + 910, + 938, + 944, + 965, + 1101, + 1228, + 1239, + 1291, + 1350, + 1514, + 1542 + ], + "mask": "Validation" + }, + { + "node_id": 1039, + "label": 4, + "text": "Authorization:authorization authorization function specifying access rights/privileges resources related information security computer security general access control particular formally authorize define access policy example human resources staff normally authorized access employee records policy usually formalized access control rules computer system operation system uses access control rules decide whether access requests authenticated consumers shall approved granted disapproved rejected resources include individual files item data computer programs computer devices functionality provided computer applications examples consumers computer users computer software hardware computer access control computer systems networks rely access policies access control process divided following phases policy definition phase access authorized policy enforcement phase access requests approved disapproved authorization function policy definition phase precedes policy enforcement phase access requests approved disapproved based previously defined authorizations modern multi-user operating systems include access control thereby rely authorization access control also uses authentication verify identity consumers consumer tries access resource access control process checks consumer authorized use resource authorization responsibility authority department manager within application domain often delegated custodian system administrator authorizations expressed access policies types policy definition application e.g form access control list capability policy administration point e.g xacml basis principle least privilege consumers authorized access whatever need jobs older single user operating systems often weak non-existent authentication access control systems anonymous consumers guests consumers required authenticate often limited authorization distributed system often desirable grant access without requiring unique identity familiar examples access tokens include keys certificates tickets grant access without proving identity trusted consumers often authorized unrestricted access resources system must verified access control system make access approval decision partially trusted guests often restricted authorization order protect resources improper access usage access policy operating systems default grant consumers full access resources others opposite insisting administrator explicitly authorizes consumer use resource even access controlled combination authentication access control lists problems maintaining authorization data trivial often represents much administrative burden managing authentication credentials often necessary change remove user authorization done changing deleting corresponding access rules system using atomic authorization alternative per-system authorization management trusted third party securely distributes authorization information public policy authorization feature trusted systems used security social control banking authorization hold placed customer account purchase made using debit card credit card publishing sometimes public lectures freely available texts published without approval author called unauthorized texts example 2002 'the theory everything origin fate universe collected stephen hawking lectures published without permission per copyright law", + "neighbors": [ + 11, + 90, + 144, + 148, + 149, + 197, + 293, + 302, + 310, + 338, + 379, + 439, + 455, + 479, + 517, + 518, + 528, + 576, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 864, + 898, + 963, + 964, + 1090, + 1112, + 1138, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1472, + 1535, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1040, + "label": 2, + "text": "Nemesis_(operating_system):nemesis operating system nemesis operating system designed university cambridge university glasgow swedish institute computer science citrix systems nemesis conceived multimedia uses mind microkernel environment application typically implemented number processes servers performing work behalf one client leads enormous difficulty accounting resource usage kernel-based system multimedia applications spend time kernel leading similar problems guiding principle design nemesis structure operating system way majority code could execute application process nemesis therefore extremely small lightweight kernel performed operating system functions shared libraries executed user process isas nemesis supports include x86 intel i486 pentium pentium pro pentium ii alpha arm strongarm sa-110 nemesis also runs evaluation boards 21064 21164", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 85, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 380, + 387, + 412, + 413, + 434, + 457, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1041, + "label": 7, + "text": "Gestigon:gestigon gestigon stylized gestigon software development company founded september 2011 sascha klement erhardt barth thomas martinetz company develops software solutions gesture control body tracking based 3d depth data gestigon developing augmented reality automotive solutions audi renault volkswagen company also working ar/vr headsets well consumer electronics smart home devices march 2017 gestigon acquired valeo french automotive supplier sascha klement worked student assistant ph.d. student professors thomas martinetz erhardt barth developing software solutions based time-of-flight sensors university l\u00fcbeck since 2002 together founded gestigon 2011 seed-funding high-tech gr\u00fcnderfonds mittelst\u00e4ndische beteiligungsgesellschaft schleswig-holstein local business angels march 2012 moritz von grotthuss joined company advisor later became ceo considered late-founder month gestigon received innovation award cebit 2012 one 15 startups receive award 276 candidates january 2013 gestigon participated ces las vegas later year also techcrunch disrupt new york city next year visteon volkswagen used gestigon gestures solutions products presented ces 2014 cebit 2014 \u201c cebit innovation award \u201d public displays gestigon technologies include audi ces 2015 ces 2016 volkswagen infineon gestigon launched virtual reality solution carnival techcrunch disrupt san francisco september 2015 using oculus rift different depth sensors first demo using mobile device done ces 2015 gestigon partnered several companies develop hardware solutions especially depth sensors provide sensing solutions 2015 gestigon partnered inuitive 3d computer vision image processors developer create vr unit system presented ces 2016 assembled oculus rift development kit july 2015 gestigon closed series financing round nbr technology ventures gmbh primary investor headed fabian von kuenheim financing round company received additional investments high-tech gr\u00fcnderfonds vorwerk direct selling ventures march 2017 gestigon developed software recognizes driving gestures gestigon develops software works 3d sensors recognize human gestures poses biometrical features real time gecko feature tracker developed company tracks individual measuring biometric features flamenco software finger hand gesture control gestigon developed carnival sdk software augmented reality virtual reality allows users see use hands virtual interfaces gestigon solutions based skeleton recognition software recognizes body parts 3d data making recognition faster accurate software sensor agnostic work based data depth module using time-of-flight- stereo- structured light technologies", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1042, + "label": 5, + "text": "MAC_address:mac address media access control address mac address device unique identifier assigned network interface controller nic communications within network segment used network address ieee 802 network technologies including ethernet wi-fi bluetooth within open systems interconnection osi model mac addresses used medium access control protocol sublayer data link layer typically represented mac addresses recognizable six groups two hexadecimal digits separated hyphens colons separator see notational conventions mac address may referred burned-in address also known ethernet hardware address hardware address physical address confused memory physical address network node multiple nics must unique mac address sophisticated network equipment multilayer switch router may require one permanently assigned mac addresses mac addresses often assigned manufacturer network interface cards stored hardware card read-only memory firmware mechanism mac address typically includes manufacturer organizationally unique identifier oui mac addresses formed according principles two numbering spaces based extended unique identifiers eui managed institute electrical electronics engineers ieee eui-48 replaces obsolete term mac-48 eui-64 original ieee 802 mac address comes original xerox network systems ethernet addressing scheme 48-bit address space contains potentially 2 281,474,976,710,656 possible mac addresses ieee manages allocation mac addresses originally known mac-48 refers eui-48 identifiers ieee target lifetime 100 years 2080 applications using eui-48 space restricts applications accordingly ieee encourages adoption plentiful eui-64 non-ethernet applications distinction eui-48 mac-48 identifiers name application mac-48 used address hardware interfaces within existing 802-based networking applications eui-48 used 802-based networking also used identify devices software example bluetooth ieee considers mac-48 obsolete term eui-48 used cases addition eui-64 numbering system originally encompassed mac-48 eui-48 identifiers simple translation mechanism translations since deprecated individual address block iab inactive registry activity replaced ma-s ma-s previously named oui-36 registry product january 1 2014 iab uses oui ma-l ma-l registry previously named oui registry term oui still use calling registry belonging ieee registration authority concatenated 12 additional ieee-provided bits total 36 bits leaving 12 bits iab owner assign 4096 individual devices iab ideal organizations requiring 4096 unique 48-bit numbers eui-48 unlike oui allows assignee assign values various different number spaces example eui-48 eui-64 various context-dependent identifier number spaces individual address block could used assign eui-48 identifiers potential uses based oui iabs allocated reserved remain property ieee registration authority also noted 2007 september 2012 oui value 00:50 c2 used iab assignments september 2012 value 40 d8:55 used owners already assigned iab may continue use assignment another registry called ma-m mac addresses medium ma-m assignment block provides 2 eui-48 identifiers 2 eui-64 identifiers means first 28 bits ieee assigned bits first 24-bits assigned ma-m block oui assigned ieee reassigned addresses either universally administered addresses uaa locally administered addresses laa universally administered address uniquely assigned device manufacturer first three octets transmission order identify organization issued identifier known organizationally unique identifier oui remainder address three octets eui-48 five eui-64 assigned organization nearly manner please subject constraint uniqueness locally administered address assigned device network administrator overriding burned-in address universally administered locally administered addresses distinguished setting second-least-significant bit first octet address bit also referred u/l bit short universal/local identifies address administered bit 0 address universally administered 1 address locally administered example address first octet 06 hex binary form 00000110 second-least-significant bit 1 therefore locally administered address another example uses locally administered addresses decnet protocol mac address ethernet interface changed decnet software reflects decnet network address xx.yy host eliminates need address resolution protocol since mac address decnet host simply determined least significant bit address first octet 0 zero frame meant reach one receiving nic type transmission called unicast unicast frame transmitted nodes within collision domain modern wired setting collision domain usually length ethernet cable two network cards wireless setting collision domain receivers detect given wireless signal switch know port leads given mac address switch forward unicast frame ports except originating port action known unicast flood node matching hardware mac address accept frame network frames non-matching mac-addresses ignored unless device promiscuous mode least significant bit first octet set 1 frame still sent however nics choose accept based criteria matching mac address example based configurable list accepted multicast mac addresses called multicast addressing ieee built several special address types allow one network interface card addressed one time examples group addresses opposed individual addresses least significant bit first octet mac address distinguishes individual addresses group addresses bit set 0 individual addresses set 1 group addresses group addresses like individual addresses universally administered locally administered following network technologies use eui-48 identifier format every device connects ieee 802 network ethernet wifi eui-48 address common networked consumer devices pcs smartphones tablet computers use eui-48 addresses eui-64 identifiers used broadcast networks ethernet mac address expected uniquely identify node segment allows frames marked specific hosts thus forms basis link layer osi layer 2 networking upon upper layer protocols rely produce complex functioning networks many network interfaces support changing mac address unix-like systems command utility ifconfig may used remove add link address aliases instance active ifconfig directive may used netbsd specify attached addresses activate hence various configuration scripts utilities permit randomization mac address time booting establishing network connection changing mac addresses necessary network virtualization mac spoofing practiced exploiting security vulnerabilities computer system modern operating systems apple ios android especially mobile devices designed randomize assignment mac address network interface scanning wireless access points avert tracking systems internet protocol ip networks mac address interface corresponding ip address may queried address resolution protocol arp ipv4 neighbor discovery protocol ndp ipv6 relating osi layer 3 addresses layer 2 addresses according edward snowden us national security agency system tracks movements mobile devices city monitoring mac addresses avert practice apple started using random mac addresses ios devices scanning networks vendors followed quickly mac address randomization scanning added android starting version 6.0 windows 10 linux kernel 3.18 actual implementations mac address randomization technique vary largely different devices moreover various flaws shortcomings implementations may allow attacker track device even mac address changed instance probe requests elements timing random mac addresses used researchers confirmed possible link real identity particular wireless mac address using wireless access points ssid-hidden mode network cloaking mobile wireless device may disclose mac address traveling even mac addresses associated ssids device already connected configured send part probe request packets alternative modes prevent include configuring access points either beacon-broadcasting mode probe-response ssid mode modes probe requests may unnecessary sent broadcast mode without disclosing identity previously-known networks standard ieee 802 format printing eui-48 addresses human-friendly form six groups two hexadecimal digits separated hyphens transmission order e.g form also commonly used eui-64 e.g conventions include six groups two hexadecimal digits separated colons e.g three groups four hexadecimal digits separated dots e.g transmission order standard notation also called canonical format mac addresses written transmission order least significant bit byte transmitted first used output codice_1 codice_2 codice_3 commands example however since ieee 802.3 ethernet ieee 802.4 token bus send bytes octets wire left-to-right least significant bit byte first ieee 802.5 token ring ieee 802.6 fddi send bytes wire significant bit first confusion may arise address latter scenario represented bits reversed canonical representation example address canonical form would transmitted wire bits codice_4 standard transmission order least significant bit first token ring networks would transmitted bits codice_5 most-significant-bit first order latter might incorrectly displayed referred bit-reversed order non-canonical form msb format ibm format token ring format explained", + "neighbors": [ + 109, + 111, + 138, + 255, + 336, + 364, + 377, + 379, + 405, + 430, + 444, + 560, + 598, + 615, + 764, + 769, + 771, + 856, + 902, + 904, + 920, + 977, + 1042, + 1110, + 1116, + 1151, + 1243, + 1410, + 1461, + 1517, + 1527, + 1587, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 1043, + "label": 4, + "text": "Carbanak:carbanak carbanak apt-style campaign targeting limited financial institutions claimed discovered 2014 russian/uk cyber crime company kaspersky lab said used steal money banks microsoft windows malware said introduced targets via phishing emails hacker group said stolen 900 million dollars 140 billion dollars reports banks thousand private customers criminals able manipulate access respective banking networks order steal money variety ways instances atms instructed dispense cash without locally interact terminal money mules would collect money transfer swift network criminals \u2019 accounts kaspersky said carbanak group went far alter databases pump balances existing accounts pocketing difference unbeknownst user whose original balance still intact intended targets primarily russia followed united states germany china ukraine according kaspersky lab one bank lost 7.3 million atms programmed spew cash certain times henchmen would collect separate firm 10 million taken via online platform kaspersky lab helping assist investigations countermeasures disrupt malware operations cybercriminal activity investigations provide technical expertise analyzing infection vectors malicious programs supported command control infrastructure exploitation methods fireeye published research tracking activities referring group fin7 including sec-themed spear phishing campaign proofpoint also published research linking group bateleur backdoor expanded list targets u.s.-based chain restaurants hospitality organizations retailers merchant services suppliers others beyond initial financial services focus march 26th 2018 europol claimed arrested mastermind carbanak associated cobalt cobalt strike group alicante spain investigation led spanish national police cooperation law enforcement multiple countries well private cybersecurity companies group campaigns appear continued however hudson bay company breach using point sale malware recently attributed group controversy exists around carbanak attacks seemingly described several months earlier report internet security companies group-ib russia fox-it netherlands dubbed attack anunak anunak report shows also greatly reduced amount financial losses according statement issued fox-it release new york times article compromise banks outside russia match research also interview conducted russian newspaper kommersant controversy claims kaspersky lab group-ib come light group-ib claims banks outside russia ukraine hit activity outside region focused point sale systems reuters issued statement referencing private industry notification issued fbi usss united states secret service claiming received reports carbanak affected financial sector two representative groups us banking industry fs-isac aba american bankers association interview bank technology news say us banks affected", + "neighbors": [ + 11, + 91, + 141, + 158, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 429, + 533, + 550, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 818, + 915, + 961, + 1101, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1044, + "label": 3, + "text": "Machine_code:machine code machine code computer program written machine language instructions executed directly computer central processing unit cpu instruction causes cpu perform specific task load store jump alu operation one units data cpu registers memory machine code strictly numerical language intended run fast possible may regarded lowest-level representation compiled assembled computer program primitive hardware-dependent programming language possible write programs directly machine code tedious error prone manage individual bits calculate numerical addresses constants manually reason programs rarely written directly machine code modern contexts may done low level debugging program patching especially assembler source available assembly language disassembly overwhelming majority practical programs today written higher-level languages assembly language source code translated executable machine code utilities compilers assemblers linkers important exception interpreted programs translated machine code however interpreter may seen executor processor performing instructions source code typically consists directly executable machine code generated assembly high-level language source code machine code definition lowest level programming detail visible programmer internally many processors use microcode optimise transform machine code instructions sequences micro-ops generally considered machine code per se every processor processor family instruction set instructions patterns bits physical design correspond different commands machine thus instruction set specific class processors using mostly architecture successor derivative processor designs often include instructions predecessor may add additional instructions occasionally successor design discontinue alter meaning instruction code typically needed new purposes affecting code compatibility extent even nearly completely compatible processors may show slightly different behavior instructions rarely problem systems may also differ details memory arrangement operating systems peripheral devices program normally relies factors different systems typically run machine code even type processor used processor instruction set may instructions length may variable-length instructions patterns organized varies strongly particular architecture often also type instruction instructions one opcode fields specifies basic instruction type arithmetic logical jump etc actual operation add compare fields may give type operand addressing mode addressing offset index actual value constant operands contained instruction called immediates machines individual instructions explicit operands accumulator machine combined left operand result implicit accumulator arithmetic instructions architectures 8086 x86-family accumulator versions common instructions accumulator regarded one general registers longer instructions stack machine operands implicit stack special purpose instructions also often lack explicit operands cpuid x86 architecture writes values four implicit destination registers instance distinction explicit implicit operands important code generators especially register allocation live range tracking parts good code optimizer track implicit well explicit operands may allow frequent constant propagation constant folding registers register assigned result constant expression freed replacing constant code enhancements computer program list instructions executed central processing unit program execution done order cpu executing solve specific problem thus accomplish specific result simple processors able execute instructions one another superscalar processors capable executing variety different instructions program flow may influenced special 'jump instructions transfer execution instruction numerically following one conditional jumps taken execution continues another address execution continues next instruction depending condition much readable rendition machine language called assembly language uses mnemonic codes refer machine code instructions rather using instructions numeric values directly example zilog z80 processor machine code codice_1 causes cpu decrement codice_2 processor register would represented assembly language codice_3 mips architecture provides specific example machine code whose instructions always 32 bits long general type instruction given op operation field highest 6 bits j-type jump i-type immediate instructions fully specified op r-type register instructions include additional field funct determine exact operation fields used types rs rt rd indicate register operands shamt gives shift amount address immediate fields contain operand directly example adding registers 1 2 placing result register 6 encoded load value register 8 taken memory cell 68 cells location listed register 3 jumping address 1024 computer architectures machine code implemented even fundamental underlying layer called microcode providing common machine language interface across line family different models computer widely different underlying dataflows done facilitate porting machine language programs different models example use ibm system/360 family computers successors dataflow path widths 8 bits 64 bits beyond nevertheless present common architecture machine language level across entire line using microcode implement emulator enables computer present architecture entirely different computer system/360 line used allow porting programs earlier ibm machines new family computers e.g ibm 1401/1440/1460 emulator ibm s/360 model 40 machine code generally different bytecode also known p-code either executed interpreter compiled machine code faster direct execution exception processor designed use particular bytecode directly machine code case java processors machine code assembly code sometimes called native code referring platform-dependent parts language features libraries harvard architecture computer architecture physically separate storage signal pathways code instructions data today processors implement separate signal pathways performance reasons implement modified harvard architecture support tasks like loading executable program disk storage data executing harvard architecture contrasted von neumann architecture data code stored memory read processor allowing computer execute commands point view process code space part address space code execution stored multitasking systems comprises program code segment usually shared libraries multi-threading environment different threads one process share code space along data space reduces overhead context switching considerably compared process switching pamela samuelson wrote machine code unreadable united states copyright office identify whether particular encoded program original work authorship however us copyright office allow copyright registration computer programs program machine code sometimes decompiled order make functioning easily understandable humans cognitive science professor douglas hofstadter compared machine code genetic code saying looking program written machine language vaguely comparable looking dna molecule atom atom", + "neighbors": [ + 11, + 29, + 53, + 78, + 85, + 111, + 246, + 270, + 292, + 306, + 308, + 359, + 373, + 378, + 386, + 396, + 412, + 439, + 488, + 503, + 521, + 529, + 567, + 579, + 592, + 643, + 752, + 753, + 756, + 810, + 891, + 897, + 907, + 919, + 940, + 948, + 979, + 984, + 1009, + 1016, + 1028, + 1068, + 1138, + 1183, + 1225, + 1231, + 1290, + 1306, + 1311, + 1319, + 1320, + 1324, + 1335, + 1372, + 1398, + 1413, + 1414, + 1437, + 1483, + 1503, + 1511, + 1532, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1045, + "label": 4, + "text": "Cain_and_Abel_(software):cain abel software cain abel often abbreviated cain password recovery tool microsoft windows recover many kinds passwords using methods network packet sniffing cracking various password hashes using methods dictionary attacks brute force cryptanalysis attacks cryptanalysis attacks done via rainbow tables generated winrtgen.exe program provided cain abel cain abel maintained massimiliano montoro sean babcock virus scanners browsers e.g chrome 20.0.1132.47 detect cain abel malware avast detects win32 cain-b tool classifies potentially dangerous program microsoft security essentials detects win32/cain 4_9_14 classifies tool program potentially unwanted behavior even cain install directory well word cain added avast exclude list real-time scanner known stop cain functioning however latest version avast longer blocks cain", + "neighbors": [ + 160, + 342, + 483, + 703, + 747, + 856, + 955, + 961, + 1138, + 1337, + 1448, + 1451, + 1527, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 1046, + "label": 2, + "text": "Source_Mage:source mage source mage linux distribution package installed source code automatically downloaded compiled installed source mage descended sorcerer source mage name suggests source-based linux distribution instead delivering binaries users source code compiled method allows greater control software precompiled distributions ubuntu individual dependencies selected deselected saving valuable hard drive space freeing ram cpu cycles instance openssh compiled without support x11 sharing one choose set cflags cxxflags ldflags specific situation using source-based distribution one way unlock full performance computer many binary distros compile software wide audience particular group users specific processor source mage spell cast latest stable release downloaded developer site rather source mage allows up-to-date system unlike gentoo another popular source-based distribution maintains customized cache packages smgl changes little possible packages fit bare standards filesystem hierarchy standard immune kind errors resulting distribution developers tampering 2000 kyle sallee released linux distribution named sorcerer gnu/linux due several issues 2002 chuck s. mead forked sorcerer lunar linux soon afterwards kyle sallee took sorcerer gnu/linux offline remaining sorcerer gnu/linux development team brought back online continued development month later kyle sallee brought version sorcerer back online new license prevented forking dropping gnu/linux name consequently request sallee sorcerer gnu/linux team renamed project source mage source mage tagline linux advanced may well magic commands sorcerous theme package called spell package management program called sorcery install package user must cast spell casting spell consists downloading source code already downloaded checking dependencies casting necessary compiling program installing set available spells called grimoire uninstall package user must dispel spell source mage established distribution commitment source mage social contract establishes basic rules similar though identical debian first part contract ensures freedom source mage source mage restrict user choice software free software installing source mage involves first creating minimal installation kernel run gcc c compiler network connection basic tools support downloading compiling source code enables system download compile install components compilation results tailored specific system source mage-maintained code designed presume minimal system base system n't explicitly require c++ compiler gcc 4.x+ replaced besides posix-compliant tools core components require bash sed either gawk mawk instead heavyweight languages like perl python makes source mage suitable small installation", + "neighbors": [ + 33, + 113, + 134, + 207, + 275, + 301, + 351, + 357, + 393, + 404, + 431, + 695, + 716, + 754, + 897, + 899, + 974, + 1004, + 1049, + 1055, + 1126, + 1167, + 1214, + 1225, + 1227, + 1276, + 1286, + 1292, + 1366, + 1369, + 1374, + 1458, + 1539, + 1547, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 1047, + "label": 4, + "text": "Open_Vulnerability_and_Assessment_Language:open vulnerability assessment language open vulnerability assessment language oval international information security community standard promote open publicly available security content standardize transfer information across entire spectrum security tools services oval includes language used encode system details assortment content repositories held throughout community language standardizes three main steps assessment process repositories collections publicly available open content utilize language oval community developed three schemas written extensible markup language xml serve framework vocabulary oval language schemas correspond three steps assessment process oval system characteristics schema representing system information oval definition schema expressing specific machine state oval results schema reporting results assessment content written oval language located one many repositories found within community one repository known oval repository hosted mitre corporation central meeting place oval community discuss analyze store disseminate oval definitions definition oval repository determines whether specified software vulnerability configuration issue program patch present system information security community contributes development oval participating creation oval language oval developers forum writing definitions oval repository oval community forum oval board consisting representatives broad spectrum industry academia government organizations around world oversees approves oval language monitors posting definitions hosted oval web site means oval funded us-cert u.s. department homeland security benefit community reflects insights combined expertise broadest possible collection security system administration professionals worldwide oval used security content automation protocol scap oval language standardizes three main steps assessment process representing configuration information systems testing analyzing system presence specified machine state vulnerability configuration patch state etc reporting results assessment oval interpreter freely available reference implementation created show data collected computer testing based set oval definitions evaluated determine results definition oval interpreter demonstrates usability oval definitions used definition writers ensure correct syntax adherence oval language development draft definitions fully functional scanning tool simplistic user interface running oval interpreter provide list result values evaluated definition oval repository central meeting place oval community discuss analyze store disseminate oval definitions repositories community also host oval content include oval system characteristics files oval results files well definitions oval repository contains community-developed oval vulnerability compliance inventory patch definitions supported operating systems definitions free use implement information security products services oval repository top contributor award program grants awards quarterly basis top contributors oval repository repository community effort contributions new content modifications instrumental success awards serve public recognition organization \u2019 support oval repository incentive others contribute organizations receiving award also receive oval repository top contributor logo indicating quarter award e.g. 1st quarter 2007 may used see fit awards granted organizations made significant contribution new modified content quarter oval board advisory body provides valuable input oval moderator currently mitre important organizational support oval individuals sit oval board input activity truly make difference board \u2019 primary responsibilities work moderator community define oval provide input oval \u2019 strategic direction advocate oval community", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1048, + "label": 8, + "text": "DataNucleus:datanucleus datanucleus formerly known java persistent objects jpox open source project apache 2 license provides software products around data management java datanucleus project started 2008 jpox project started 2003 relaunched datanucleus 2008 broader scope datanucleus access platform fully compliant implementation java data objects jdo 1.0 2.0 2.1 2.2 3.0 3.1 3.2 specifications jsr 0012 jsr 0243 java persistence api jpa 1.0 2.0 2.1 2.2 specifications jsr 0220 jsr 0317 jsr 0338 providing transparent persistence java objects supports persistence widest range datastores java persistence software supporting main object-relational mapping orm patterns allows querying using either jdoql jpql sql comes byte-code enhancer allows persistence relational datastores rdbms object-based datastores db4o neodatis odb document-based storage xml excel opendocument spreadsheets web-based storage json google storage amazon simple storage service map-based datastores hbase google bigtable apache cassandra graph-based datastores neo4j document stores mongodb well types datastores e.g ldap plugins osgi-compliant used equally osgi environment datanucleus access platform also utilised persistence layer behind google app engine java vmforce cloud offering salesforce.com vmware", + "neighbors": [ + 178, + 1431 + ], + "mask": "Test" + }, + { + "node_id": 1049, + "label": 3, + "text": "Monolithic_kernel:monolithic kernel monolithic kernel operating system architecture entire operating system working kernel space monolithic model differs operating system architectures microkernel architecture alone defines high-level virtual interface computer hardware set primitives system calls implement operating system services process management concurrency memory management device drivers added kernel modules modular operating systems os-9 modern monolithic operating systems openvms linux bsd sunos aix multics dynamically load unload executable modules runtime modularity operating system binary image level architecture level modular monolithic operating systems confused architectural level modularity inherent server-client operating systems derivatives sometimes marketed hybrid kernel use microkernels servers mistaken modules daemons practically speaking dynamically loading modules simply flexible way handling operating system image runtime\u2014as opposed rebooting different operating system image modules allow easy extension operating systems capabilities required dynamically loadable modules incur small overhead compared building module operating system image however cases loading modules dynamically as-needed helps keep amount code running kernel space minimum example minimize operating system footprint embedded devices limited hardware resources namely unloaded module need stored scarce random access memory", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 108, + 113, + 134, + 170, + 171, + 185, + 187, + 195, + 265, + 322, + 351, + 353, + 357, + 380, + 387, + 393, + 413, + 431, + 434, + 443, + 465, + 475, + 477, + 583, + 650, + 664, + 695, + 720, + 721, + 728, + 754, + 797, + 860, + 870, + 884, + 891, + 899, + 941, + 954, + 957, + 961, + 966, + 992, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1046, + 1053, + 1054, + 1055, + 1057, + 1063, + 1126, + 1138, + 1155, + 1167, + 1187, + 1202, + 1224, + 1276, + 1286, + 1301, + 1304, + 1369, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1458, + 1474, + 1494, + 1530, + 1538, + 1539, + 1546, + 1578, + 1601, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1050, + "label": 9, + "text": "QBasic:qbasic qbasic short form quick beginners purpose symbolic instruction code integrated development environment interpreter variety basic programming languages based quickbasic code entered ide integrated development environment compiled intermediate representation ir ir immediately interpreted demand within ide run nearly versions dos 32-bit versions windows emulation via dosbox/dosemu linux freebsd 64-bit versions windows qbasic dos program requires dos dos emulator windows xp comes emulator called dos virtual machine subsequent versions windows require emulator dosbox time qbasic provided state-of-the-art ide including debugger features on-the-fly expression evaluation code modification supports various inbuilt functions like quickbasic unlike earlier versions microsoft basic qbasic structured programming language supporting constructs subroutines line numbers concept often associated basic supported compatibility considered good form replaced descriptive line labels qbasic limited support user-defined data types structures several primitive types used contain strings text numeric data qbasic intended replacement gw-basic based earlier quickbasic 4.5 compiler without quickbasic compiler linker elements version 1.0 shipped together ms-dos 5.0 higher well windows 95 windows nt 3.x windows nt 4.0 ibm recompiled qbasic included pc dos 5.x well os/2 2.0 onwards ecomstation descended os/2 code includes qbasic 1.0 qbasic 1.1 included ms-dos 6.x without codice_1 windows 95 windows 98 windows starting windows 2000 microsoft longer includes qbasic operating systems still obtained use newer versions windows qbasic well built-in ms-dos editor backwards-compatible dos releases prior 5.0 least dos 3.20 however used 8088/8086 computers 80286 computers qbasic program may run slowly perhaps due dos memory size limits ms-dos 7 ms-dos editor help required qbasic codice_2 codice_3 programs simply started qbasic editor help mode also entered running codice_4 codice_5 codice_6 switches i.e. command lines codice_7 codice_8 qbasic came complete four pre-written example programs nibbles variant snake game gorillas artillery game money manager personal finance manager remline q-basic code line-number-removing program qbasic easter egg see press hold screenprint seen easter egg archive qbasic page", + "neighbors": [ + 0, + 8, + 108, + 134, + 236, + 255, + 273, + 306, + 377, + 435, + 472, + 510, + 594, + 606, + 615, + 670, + 756, + 764, + 810, + 812, + 843, + 870, + 872, + 904, + 920, + 961, + 1034, + 1037, + 1079, + 1110, + 1138, + 1156, + 1188, + 1204, + 1243, + 1304, + 1306, + 1324, + 1390, + 1394, + 1457, + 1461, + 1511, + 1517, + 1547, + 1584, + 1587, + 1593, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1051, + "label": 2, + "text": "List_of_open-source_mobile_phones:list open-source mobile phones list mobile phones open-source operating systems available mobile phones proprietary baseband chip gsm module open-source baseband project osmocombb project based illicit leaked source code calypso modem called freecalypso android-based devices appear list heavy use proprietary components particularly drivers applications numerous versions android lineageos successor now-defunct cyanogenmod freedom-respecting replicant installed large number phones after-market webos initially available proprietary license source code later released free license hp still open webos run webos devices sailfish os proprietary user interface atop mer software distribution main components make open mobile phone postmarketos ubports kde neon open-source distributions running existing smartphones originally running android maemo leste available nokia n900 motorola droid 4 possible home-build phone partially open hardware software arduinophone touchscreen mit diy cellphone segmented display use arduino open-hardware single-board computer added components piphone zerophone similar based raspberry pi", + "neighbors": [ + 101, + 113, + 162, + 238, + 264, + 298, + 337, + 408, + 477, + 484, + 520, + 527, + 622, + 629, + 707, + 833, + 1018, + 1020, + 1140, + 1193, + 1203, + 1313, + 1325, + 1373, + 1602 + ], + "mask": "Validation" + }, + { + "node_id": 1052, + "label": 3, + "text": "Pipeline_stall:pipeline stall design pipelined computer processors pipeline stall delay execution instruction order resolve hazard decoding stage control unit determine decoded instruction reads register instruction currently execution stage writes condition holds control unit stall instruction one clock cycle also stalls instruction fetch stage prevent instruction stage overwritten next instruction program prevent new instructions fetched instruction decoding stage stalled value pc register instruction fetch stage preserved prevent changes values preserved instruction causing conflict passed execution stage event often called bubble analogy air bubble fluid pipe architectures execution stage pipeline must always performing action every cycle case bubble implemented feeding nop operation instructions execution stage bubble flushed past following two executions four instructions 4-stage pipeline whatever reason delay fetching purple instruction cycle 2 leads bubble created delaying instructions well example shows bubble inserted classic risc pipeline five stages instruction fetch id instruction decode ex execute mem memory access wb register write back example data available mem stage 4th stage first instruction required input ex stage 3rd stage second instruction without bubble ex stage 3rd stage access output previous ex stage thus adding bubble resolves time dependence without needing propagate data backwards time impossible", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 386, + 388, + 445, + 457, + 460, + 465, + 486, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1053, + "label": 2, + "text": "CP/CMS:cp/cms cp/cms control program/cambridge monitor system discontinued time-sharing operating system late 60s early 70s known excellent performance advanced features three distinct versions implementation substantial redesign predecessor evolutionary step forward cp-67/cms first widely available virtual machine architecture ibm pioneered idea research systems m44/44x used partial virtualization cp-40 used full virtualization addition role predecessor vm family cp/cms played important role development operating system os theory design ibm system/370 time-sharing industry creation self-supporting user community anticipated today free software movement cp/cms built ibm cambridge scientific center csc research development lab ties mit leadership robert creasy system goals development process release legacy breakthrough technology set system apart oses day large ibm projects open-source system made available source code form ibm customers charge \u2013 part unsupported ibm type-iii library cp/cms users supported unusual circumstances described history section led situation cp/cms consisted two main components cp/cms virtual machine concept important step forward operating system design ibm reimplemented cp/cms vm/370 product line released 1972 virtual memory added s/370 series vm/370 successors z/vm remain wide use today important note ibm reimplemented cp-67 cp-40 simply rename repackage vm coexisted cp/cms successors many years thus appropriate view cp/cms independent os distinct vm family cp/cms distributed source code form many cp/cms users actively involved studying modifying source code direct user involvement vendor-supplied operating system unusual cp/cms era many vendors distributed operating systems machine-readable source code possible os/360 dos/360 number later mainstream ibm operating systems distributed way systems awareness system source code also involved sysgen process comparable kernel build modern systems also installing starter set forty years later hercules emulator used run fossilized versions systems based source code treated part public domain importance operating system source code changed time 1969 os software included cost hardware vendor complete responsibility entire system hardware software made distribution medium relatively unimportant ibm unbundling os software delivered ibm system control program scp software eventually object code form still additional charge complicated reasons cp/cms released normal way supported ibm made part unsupported ibm type-iii library collection software contributed ibm personnel similarly software contributed customers formed type-iv library ibm distributed library customers use 'as lack direct ibm support products forced active users support encouraged modifications mutual support cp/cms type-iii products early forms free software source code distribution ibm operating systems may continued time e.g os/360 dos/360 dos/vse mvs even tss/370 today generally considered public domain since arguably published without copyright notice 1978 however unsupported status cp/cms placed different pressures user community created need source code distribution curiously cp/cms contributed type-iii library mit lincoln laboratory ibm despite fact system built ibm cambridge scientific center surprising decision described form collusion outmaneuver ibm political forces opposed time-sharing may also reflect amount formal informal input mit union carbide contributed design implementation cp-40 s/360-67 cp-67 cms see history cp/cms historical notes insights references topic many cp/cms users made extensive modifications copies source code much work shared among sites important changes found way back core system users national css academic sites continued independent development cp/cms rather switching vm/370 became available efforts diverged community today would termed software fork ibm released vm/370 source code distribution vm continued several releases vm project adopt use pl/s internal systems programming language mandated use within ibm many comparable projects use pl/s would made source code distribution impossible ibm attempted turn away assembly language higher level languages early 1965 making substantial use pl/s 1969 e.g mvs pl/s considered trade secret time available customers ibm apparently made exceptions policy much later vm user community continued make important contributions software cp/cms type-iii period os dos sites exhibited active user involvement deep operating system internals found many vm sites reverse support helped cp/cms concepts survive evolve despite vm second class citizen status ibm fundamental cp/cms architectural strategic parameters established cp-40 began production use ibm cambridge scientific center early 1967 effort occurred complex political technical milieu discussed length supported first-hand quotes wikipedia article history cp/cms nutshell cp/cms architecture revolutionary time system consisted virtualizing control program cp created multiple independent virtual machines vms platform virtualization possible two elements ibm system/360-67 program running 'problem state using privileged instruction invalid memory address would cause hardware raise exception condition trapping conditions cp could simulate appropriate behavior e.g performing i/o paging operations guest operating system would run 'supervisor state bare machine run 'problem state cp result fully virtualized environment virtual machine set virtual devices mapped system real hardware environment thus given dial-up teletype presented vm instance virtual console note cp-67 certain model-dependent diagnostic instructions virtualized notably diag instruction ultimately later development ibm elsewhere diag instructions used create non-virtualized interface became called hypervisor client operating systems could use mechanism communicate directly control program offered dramatic performance improvements s/360 operating system could fact run cp normal users ran cambridge monitor system cms simple single-user operating system cms allowed users run programs manage virtual devices cp-67 versions 1 2 support virtual memory inside virtual machine added version 3 point testing development cp could done running full copy cp/cms inside single virtual machine cp/cms operating system work cp-370 development mvs testing ran four- five-level deep stacks hardware os simulations cp/cms design different ibm previous monolithic operating systems separates complex big system dispatching hardware management mass storage little system application program execution file i/o console input/output re-categorization systems entities prevents bug one users system affecting model feature microkernel operating systems ibm decision implement virtualization virtual memory features subsequent s/370 design although missing initial s/370 series reflects least part success cp/cms approach turn survival success ibm vm operating system family virtualization technology general owe much s/360-67 many respects ibm cp-67 cp/cms products anticipated heavily influenced contemporary virtualization software vmware workstation xen microsoft virtual pc", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 142, + 170, + 171, + 187, + 322, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 891, + 925, + 941, + 961, + 966, + 1011, + 1012, + 1019, + 1024, + 1027, + 1040, + 1049, + 1053, + 1087, + 1138, + 1155, + 1187, + 1202, + 1208, + 1224, + 1232, + 1301, + 1346, + 1363, + 1398, + 1415, + 1441, + 1474, + 1483, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 1054, + "label": 2, + "text": "Usage_share_of_desktop_operating_systems:usage share desktop operating systems usage share desktop operating systems percentage operating systems os used computers approximately market share so-called retronym desktop operating system also run e.g laptops originally computers running operating systems desktop computers introduction so-called new class mobile operating systems desktop got part name former class oses computers running oses desktop metaphor style gui unlike mobile oses see also usage share operating systems breakdown share desktop mobile styles operating systems separately share operating systems part across classes three main divisions desktop computer operating systems microsoft windows apple macos linux variants section complete section complete section complete", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 322, + 337, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 797, + 860, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Train" + }, + { + "node_id": 1055, + "label": 2, + "text": "CRUX:crux crux lightweight x86-64-optimized linux distribution targeted experienced linux users delivered tar.gz-based package system bsd-style initscripts based linux distribution also utilizes ports system install upgrade applications although crux latin word cross choice name crux meaning per lid\u00e9n chose sounded cool ends x puts line various unix flavors irix ultrix mac os x ibm aix crux include gui installation program instead user boots kernel stored either cd diskette partitions hard disk drive operating system installed using program fdisk cfdisk creates appropriate file systems various partitions mounts cd nfs share along partitions made previously use package installation script compiles new kernel installs bootloader via shell commands crux implements infrastructure similar bsd-based operating systems package management packages consist pkgfile shell script patches required adjust program work md5sum hashes used verify integrity downloaded files footprint file listing files included packages files downloaded crux software repository compiled installed using prt-get frontend pkgutils software sources downloaded websites respective upstream address specified pkgfile simone rota reviewed crux osnews blog named reviewr reviewed crux 2.2", + "neighbors": [ + 113, + 134, + 301, + 351, + 357, + 377, + 393, + 404, + 413, + 431, + 695, + 716, + 754, + 897, + 974, + 1046, + 1049, + 1126, + 1138, + 1167, + 1276, + 1286, + 1369, + 1415, + 1457, + 1458, + 1539, + 1601 + ], + "mask": "Train" + }, + { + "node_id": 1056, + "label": 6, + "text": "NetWare_Core_Protocol:netware core protocol netware core protocol ncp network protocol used products novell inc usually associated client-server operating system novell netware originally supported primarily ms-dos client stations later support platforms microsoft windows classic mac os linux windows nt mac os x various flavors unix added ncp used access file print directory clock synchronization messaging remote command execution network service functions originally took advantage easy network configuration little memory footprint ipx/spx protocol stack since mid-1990s tcp/ip implementation available novell edirectory uses ncp synchronizing data changes servers directory service tree original ipx/spx implementation provided novell netware platform obsolete tcp/ip implementation uses tcp/udp port 524 relies slp name resolution ncp operation ipx/spx networks bare ipx protocol used packet type field set 17 workstation client station side ipx socket number 0x4003 used server side socket number 0x0451 ncp pdu following structure ncp type field determines type operation individual requests identified sequence number modulo 256 connection number identifies individual client station connection server novell netware servers version 2.x supported 255 connections connection number occupied 1 octet later extended 2 octets task number value 3 requests 1 replies data field starts ncp function number octet distinguishes individual services contents length rest data field depends ncp function", + "neighbors": [ + 34, + 40, + 55, + 63, + 99, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1064, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1287, + 1304, + 1322, + 1381, + 1445, + 1459, + 1552, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1057, + "label": 3, + "text": "Mach_(kernel):mach kernel mach kernel developed carnegie mellon university support operating system research primarily distributed parallel computing mach often mentioned one earliest examples microkernel however versions mach microkernels mach derivatives basis modern operating system kernels gnu hurd apple operating systems macos ios ipados tvos watchos project carnegie mellon ran 1985 1994 ending mach 3.0 true microkernel mach developed replacement kernel bsd version unix new operating system would designed around mach derivatives exist within number commercial operating systems include using xnu operating system kernel incorporates earlier non-microkernel mach major component mach virtual memory management system also adopted 4.4bsd bsd developers csrg appears modern bsd-derived unix systems freebsd mach logical successor carnegie mellon accent kernel lead developer mach project richard rashid working microsoft since 1991 various top-level positions revolving around microsoft research division another original mach developers avie tevanian formerly head software next chief software technology officer apple inc. march 2006 mach name mach evolved euphemization spiral developers naming phase bike lunch rainy pittsburgh mud puddles tevanian joked word muck could serve backronym multi-user multiprocessor universal communication kernel italian cmu engineer dario giuse later asked project leader rick rashid project current title received muck answer though spelled pronounced according italian alphabet wrote mach rashid liked giuse spelling mach much prevailed key concept original unix operating system idea pipe pipe abstraction allowed data moved unstructured stream bytes program program using pipes users programmers could link together multiple programs complete tasks feeding data several small programs turn contrasted typical operating systems era required single large program could handle entire task alternately used files pass data resource expensive time consuming pipes built underlying input/output system system turn based model drivers expected periodically block waited tasks complete instance printer driver might send line text line printer nothing printer completed printing line case driver would indicate blocked operating system would allow program run printer indicated ready data pipes system limited resource memory one program filled memory assigned pipe would naturally block normally would cause consuming program run emptying pipe contrast file entire file read written next program use pipes made movement data across multiple programs occur piecemeal fashion without programmer intervention however implementation pipes memory buffers meant data copied program program time consuming resource intensive operation made pipe concept unsuitable tasks quick turnaround low latency needed case device drivers operating system kernel core functionality instead written single large program operating system added new functionality computer networking instance size complexity kernel grew unix pipes offered conceptual system could used build arbitrarily complex solutions small interacting programs smaller programs easy program maintain well defined interfaces simplified programming debugging qualities even valuable device drivers small size bug-free performance extremely important strong desire model kernel basis small interacting programs one first systems use pipe-like system basis operating system aleph kernel developed university rochester introduced concept ports essentially shared memory implementation aleph kernel reduced providing access hardware including memory ports conventional programs using ports system implemented behavior device drivers user programs concept greatly reduced size kernel allowed users experiment different drivers simply loading connecting together runtime greatly eased problems developing new operating system code otherwise generally required machine restarted general concept small kernel external drivers became known microkernel aleph implemented data general eclipse minicomputers tightly bound machine far ideal required memory copied programs involved considerable performance overhead also quite expensive nevertheless aleph proved basis system sound went demonstrate computer clustering copying memory early ethernet interface around time new generation central processors cpus coming market offering 32-bit address spaces initially optional support memory management unit mmu mmu handled instructions needed implement virtual memory vm system keeping track pages memory use various programs offered new solution port concept using copy write mechanism used vm instead copying data programs sent data needed instruct mmu provide access memory system would implement interprocess communications system dramatically higher performance concept picked carnegie-mellon adapted aleph perq workstation implemented using copy-on-write port successful resulting accent kernel limited practical use run existing software moreover accent tightly tied perq aleph eclipse major change experimental kernels mach decision make version existing 4.2bsd kernel re-implemented accent message-passing concepts kernel would binary compatible existing bsd software making system immediately useful everyday use still useful experimental platform additionally new kernel would designed start support multiple processor architectures even allowing heterogeneous clusters constructed order bring system quickly possible system would implemented starting existing bsd code re-implementing bit bit inter-process communication-based ipc-based programs thus mach would begin monolithic system similar existing unix systems evolve toward microkernel concept time mach started largely effort produce cleanly defined unix-based highly portable accent result short list generic concepts mach developed accent ipc concepts made system much unix-like nature even able run unix programs little modification mach introduced concept port representing endpoint two-way ipc ports security rights like files unix allowing unix-like model protection applied additionally mach allowed program handle privileges would normally given operating system order allow user space programs handle things like interacting hardware mach like unix operating system becomes primarily collection utilities unix mach keeps concept driver handling hardware therefore drivers present hardware included microkernel architectures based hardware abstraction layer exokernels could move drivers microkernel main difference unix instead utilities handling files handle task operating system code moved kernel user space resulting much smaller kernel rise term microkernel unlike traditional systems mach process task consist number threads common modern systems mach first system define tasks threads way kernel job reduced essentially operating system maintaining utilities scheduling access hardware existence ports use ipc perhaps fundamental difference mach traditional kernels unix calling kernel consists operation known system call trap program uses library place data well known location memory causes fault type error system first started kernel set handler faults program causes fault kernel takes examines information passed carries instructions mach ipc system used role instead order call system functionality program would ask kernel access port use ipc system send messages port although messages triggered system calls would kernels mach pretty much kernel did\u2014handling actual request would program thread concurrency support benefited message passing ipc mechanisms since tasks consisted multiple code threads mach could freeze unfreeze message handling allowed system distributed multiple processors either using shared memory directly mach messages adding code copy message another processor needed traditional kernel difficult implement system sure different programs n't try write memory different processors however mach ports process memory access make well defined easy implement made first-class citizen system ipc system initially performance problems strategies developed minimize impact like predecessor accent mach used single shared-memory mechanism physically passing message one program another physically copying message would slow mach relies machine memory management unit mmu quickly map data one program another data written would physically copied process called copy-on-write messages also checked validity kernel avoid bad data crashing one many programs making system ports deliberately modeled unix file system concepts allowed user find ports using existing file system navigation concepts well assigning rights permissions would file system development system would easier would code worked exist traditional program could built using existing tools could also started debugged killed using tools monokernel bug new code would take entire machine require reboot whereas mach would require program restarted additionally user could tailor system include exclude whatever features required since operating system simply collection programs could add remove parts simply running killing would program finally mach features deliberately designed extremely platform neutral quote one text mach number disadvantages however relatively mundane one clear find ports unix problem solved time programmers agreed number well known locations file system serve various duties approach worked mach ports well mach operating system assumed much fluid ports appearing disappearing time without mechanism find ports services represented much flexibility would lost mach initially hosted additional code written directly existing 4.2bsd kernel allowing team work system long complete work started already functional accent ipc/port system moved key portions os tasks threads virtual memory portions completed various parts bsd system re-written call mach change 4.3bsd also made process 1986 system complete point able run dec vax although little practical value goal making microkernel realized soon followed versions ibm rt pc sun microsystems 68030-based workstations proving system portability 1987 list included encore multimax sequent balance machines testing mach ability run multiprocessor systems public release 1 made year release 2 followed next year throughout time promise true microkernel yet delivered early mach versions included majority 4.3bsd kernel system known poe server resulting kernel actually larger unix based idea however move unix layer kernel user-space could easily worked even replaced outright unfortunately performance proved major problem number architectural changes made order solve problem unwieldy unix licensing issues also plaguing researchers early effort provide non-licensed unix-like system environment continued find use well development mach resulting mach 3 released 1990 generated intense interest small team built mach ported number platforms including complex multiprocessor systems causing serious problems older-style kernels generated considerable interest commercial market number companies midst considering changing hardware platforms existing system could ported run mach would seem would easy change platform underneath mach received major boost visibility open software foundation osf announced would hosting future versions osf/1 mach 2.5 investigating mach 3 well mach 2.5 also selected nextstep system number commercial multiprocessor vendors mach 3 led number efforts port operating systems parts microkernel including ibm workplace os several efforts apple build cross-platform version classic mac os mach originally intended replacement classical monolithic unix reason contained many unix-like ideas instance mach used permissioning security system patterned unix file system since kernel privileged running kernel-space os servers software possible malfunctioning malicious programs send commands would cause damage system reason kernel checked every message validity additionally operating system functionality located user-space programs meant needed way kernel grant programs additional privileges operate hardware instance mach esoteric features also based ipc mechanism instance mach able support multi-processor machines ease traditional kernel extensive work needs carried make reentrant interruptible programs running different processors could call kernel time mach bits operating system isolated servers able run like program processor although theory mach kernel would also reentrant practice n't issue response times fast simply wait serve requests turn mach also included server could forward messages programs even network area intense development late 1980s early 1990s unfortunately use ipc almost tasks turned serious performance impact benchmarks 1997 hardware showed mach 3.0-based unix single-server implementations 50 slower native unix study exact nature performance problems turned number interesting facts one ipc problem overhead associated memory mapping needed support added small amount time making call rest 80 time spent due additional tasks kernel running messages primary among port rights checking message validity benchmarks 486dx-50 standard unix system call took average 21\u03bcs complete equivalent operation mach ipc averaged 114\u03bcs 18\u03bcs hardware related rest mach kernel running various routines message given syscall nothing full round-trip bsd would require 40\u03bcs whereas user-space mach system would take 500\u03bcs mach first seriously used 2.x versions performance slower traditional monolithic operating systems perhaps much 25 cost considered particularly worrying however system also offering multi-processor support easy portability many felt expected acceptable cost pay mach 3 attempted move operating system user-space overhead became higher still benchmarks mach ultrix mips r3000 showed performance hit great 67 workloads example getting system time involves ipc call user-space server maintaining system clock caller first traps kernel causing context switch memory mapping kernel checks caller required access rights message valid another context switch memory mapping complete call user-space server process must repeated return results adding total four context switches memory mappings plus two message verifications overhead rapidly compounds complex services often code paths passing many servers source performance problems another centered problems trying handle memory properly physical memory ran low paging occur traditional monolithic operating systems authors direct experience parts kernel called others allowing fine-tune pager avoid paging code used mach n't possible kernel real idea operating system consisted instead use single one-size-fits-all solution added performance problems mach 3 attempted address problem providing simple pager relying user-space pagers better specialization turned little effect practice benefits wiped expensive ipc needed call performance problems related mach support multiprocessor systems mid-1980s early 1990s commodity cpus grew performance rate 60 year speed memory access grew 7 year meant cost accessing memory grew tremendously period since mach based mapping memory around programs cache miss made ipc calls slow ipc overhead major issue mach 3 systems however concept multi-server operating system still promising though still requires research developers careful isolate code modules call server server instance majority networking code would placed single server thereby minimizing ipc normal networking tasks developers instead stuck original poe concept single large server providing operating system functionality order ease development allowed operating system server run either user-space kernel-space allowed develop user-space advantages original mach idea move debugged server kernel-space order get better performance several operating systems since constructed using method known co-location among lites mklinux osf/1 nextstep/openstep/macos chorus microkernel made feature basic system allowing servers raised kernel space using built-in mechanisms mach 4 attempted address problems time radical set upgrades particular found program code typically writable potential hits due copy-on-write rare thus made sense map memory programs ipc instead migrate program code used local space program led concept shuttles seemed performance improved developers moved system semi-usable state mach 4 also introduced built-in co-location primitives making part kernel mid-1990s work microkernel systems largely stagnant although market generally believed modern operating systems would microkernel based 1990s primary remaining widespread uses mach kernel apple macos sibling ios run atop heavily modified hybrid open software foundation mach kernel osfmk 7.3 called xnu also used osf/1 xnu file systems networking stacks process memory management functions implemented kernel file system networking process memory management functions invoked user mode via ordinary system calls rather message passing xnu mach messages used communication user-mode processes requests user-mode code kernel kernel user-mode servers analysis demonstrated ipc performance problem obvious seemed recall single-side syscall took 20\u03bcs bsd 114\u03bcs mach running system 114 11 due context switch identical bsd additional 18 used mmu map message user-space kernel space adds 29\u03bcs longer traditional syscall much rest majority actual problem due kernel performing tasks checking message port access rights would seem important security concern fact makes sense unix-like system instance single-user operating system running cell phone robot might need features exactly sort system mach pick-and-choose operating system would valuable likewise mach caused problems memory moved operating system another task really makes sense system one address space dos early mac os single large address space shared programs systems mapping provide benefits realizations led series second generation microkernels reduced complexity system placed almost functionality user space instance l4 kernel version 2 includes seven system calls uses 12k memory whereas mach 3 includes 140 functions uses 330k memory ipc calls l4 486dx-50 take 5\u03bcs faster unix syscall system 20 times fast mach course ignores fact l4 handling permissioning security leaving user-space programs select much little overhead require potential performance gains l4 tempered fact user-space applications often provide many functions formerly supported kernel order test end-to-end performance mklinux co-located mode compared l4 port running user-space l4 added 5 \u201310 overhead compared mach 29 newer microkernels revitalized industry whole projects gnu hurd received new attention result following list operating system kernels derived mach operating systems kernels derived mach", + "neighbors": [ + 99, + 270, + 322, + 356, + 360, + 377, + 412, + 465, + 477, + 723, + 754, + 797, + 1011, + 1049, + 1057, + 1100, + 1138, + 1278, + 1287, + 1301, + 1318, + 1415, + 1530, + 1538, + 1558, + 1616 + ], + "mask": "Train" + }, + { + "node_id": 1058, + "label": 5, + "text": "HTTP/3:http/3 http/3 h3 upcoming third major version hypertext transfer protocol used exchange binary information world wide web http/3 draft based previous rfc draft named hypertext transfer protocol http quic quic transport layer network protocol initially developed google user space congestion control used user datagram protocol udp 28 october 2018 mailing list discussion mark nottingham chair ietf http quic working groups made official request rename http-over-quic http/3 clearly identify another binding http semantics wire protocol ... people understand separation quic pass development quic working group http working group finalizing publishing draft subsequent discussions followed stretched several days nottingham proposal accepted fellow ietf members november 2018 gave official seal approval http-over-quic become http/3", + "neighbors": [ + 14, + 83, + 95, + 107, + 258, + 277, + 427, + 509, + 530, + 531, + 582, + 623, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 1033, + 1084, + 1132, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1376, + 1378, + 1408, + 1415, + 1423, + 1528, + 1550, + 1569 + ], + "mask": "Test" + }, + { + "node_id": 1059, + "label": 9, + "text": "IDL_(programming_language):idl programming language idl short interactive data language programming language used data analysis popular particular areas science astronomy atmospheric physics medical imaging idl shares common syntax pv-wave originated codebase though languages subsequently diverged detail also two free implementations gnu data language gdl fawlty language fl idl vectorized numerical interactive commonly used interactive processing large amounts data including image processing syntax includes many constructs fortran c. idl originated early vax/vms/fortran syntax still shows heritage findgen function example returns one-dimensional array floating point numbers values equal series integers starting 0 note operation second line applies vectorized manner whole 100-element array created first line analogous way general-purpose array programming languages apl j k would example contains divide zero idl report arithmetic overflow store nan value corresponding element array first one array elements finite nan excluded visualization generated plot command array programming languages idl fast vector operations sometimes fast well-coded custom loop fortran c quite slow elements need processing individually hence part art using idl array programming language matter numerically heavy computations make use built-in vector operations predecessor versions idl developed 1970s laboratory atmospheric space physics lasp university colorado boulder lasp david stern involved efforts allow scientists test hypotheses without employing programmers write modify individual applications first program evolutionary chain idl stern developed named rufus simple vector-oriented calculator ran pdp-12 accepted two-letter codes specified arithmetic operation input registers serve operands destination register version rufus developed pdp-8 mars mariner spectrum editor mmed mmed used lasp scientists interpret data mariner 7 mariner 9 later stern wrote program named sol also ran pdp-8 unlike predecessors true programming language fortran-like syntax sol array-oriented language primitive graphics capabilities stern left lasp found research systems inc. rsi 1977 first rsi product idl pdp-11 release graphics supported idl primarily tektronix terminals raster graphics displays rsi sold first idl licenses nasa goddard space flight center ball aerospace technologies corp. 1979 two years later rsi released initial vax/vms version idl written vax-11 macro fortran took advantage vax virtual memory 32-bit address space national center atmospheric research ncar university michigan university colorado naval research laboratory started use idl version 1987 rsi shifted development work idl unix environment required complete re-write code c rather port existing version vax idl stern ali bahrami rewrote idl unix sun 3 taking advantage re-write extend improve language subsequently idl expanded ported several variants unix vms linux microsoft windows 1992 mac os 1994 widgets added idl 1992 providing event-driven programming graphical user interfaces 1997 ion idl net web server-based system commercially released first version envi application remote sensing multispectral hyperspectral image analysis written idl released 1994 envi created developed owned better solutions consulting llc purchased bsc october 2000 eastman kodak coincident purchase rsi rsi sold marketed supported envi terms license agreement bsc llc 1994 october 2000 new object pointer types limited object-oriented programming capabilities added idl 1997 idl applied widely space science example solar physics european space agency used idl process almost pictures halley comet taken giotto spacecraft team repairing hubble space telescope used idl help diagnose anomalies main mirror 1995 astronauts board space shuttle used idl loaded laptop study ultraviolet radiation currently amongst applications idl used analysis secchi part stereo mission nrl usa rutherford appleton laboratory uk rsi became wholly owned subsidiary itt industries march 2004 15 may 2006 rsi began business itt visual information solutions effective 31 october 2011 result restructuring company became exelis visual information solutions idl owned maintained harris geospatial solutions computer language idl features make idl simple use interactively also cause difficulties building large programs single namespace particularly problematic example language updates include new built-in functions occasion invalidated large scientific libraries arrays passed reference mechanism advertised feature language pass data back subroutine \u2013 contrast array slices copied passed data modifications flow back array ranges subroutine exits violating principle least surprise many historical irregularities survive early heritage language requiring individual workarounds programmer example preceding issue alleviated using compiler option also provision idl eula effect australia result sections 47d 47h country copyright act following graphics created idl source code included", + "neighbors": [ + 306, + 579, + 592, + 690, + 756, + 766, + 790, + 796, + 806, + 824, + 825, + 948, + 961, + 985, + 1006, + 1028, + 1225, + 1227, + 1324, + 1388, + 1418, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 1060, + "label": 2, + "text": "Greg_Kroah-Hartman:greg kroah-hartman greg kroah-hartman gkh major linux kernel developer linux kernel maintainer codice_1 branch staging subsystem usb driver core debugfs kref kobject sysfs kernel subsystems userspace i/o hans j. koch tty layer also created linux-hotplug udev project linux driver project worked novell suse labs division works linux foundation co-author linux device drivers 3rd edition author linux kernel nutshell used contributing editor linux journal also contributes articles lwn.net computing news site kroah-hartman frequently helps documentation kernel driver development talks tutorials 2006 released cd image material introduce programmer working linux device driver development kroah-hartman strong advocate stable kernel\u2013user space api i.e advocate stable kernel interface/binary kernel interface general user space programs also initiated development opensuse tumbleweed bleeding-edge rolling release model edition opensuse", + "neighbors": [ + 134, + 209, + 213, + 219, + 265, + 267, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1102, + 1197, + 1202, + 1208, + 1241, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1509, + 1524, + 1526, + 1558, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1061, + "label": 2, + "text": "Android_Lollipop:android lollipop android lollipop codenamed android l development fifth major version android mobile operating system developed google spanning versions 5.0 5.1.1 unveiled june 25 2014 google i/o 2014 conference became available official over-the-air ota updates november 12 2014 select devices run distributions android serviced google nexus google play edition devices source code made available november 3 2014 fifth major update twelfth version android one prominent changes lollipop release redesigned user interface built around design language known material design made retain paper-like feel interface changes include improvements notifications accessed lockscreen displayed within applications top-of-the-screen banners google also made internal changes platform android runtime art officially replacing dalvik improved application performance changes intended improve optimize battery usage statistics issued google indicate lollipop versions 14.5 share combined android devices accessing google play android lollipop succeeded android marshmallow released october 2015 release internally codenamed lemon meringue pie android 5.0 first unveiled codename android l june 25 2014 keynote presentation google i/o developers conference alongside lollipop presentation focused number new android-oriented platforms technologies including android tv in-car platform android auto wearable computing platform android wear health tracking platform google fit part presentation dedicated new cross-platform design language referred material design expanding upon card motifs first seen google design increased use grid-based layouts responsive animations transitions padding depth effects lighting shadows designer mat\u00edas duarte explained unlike real paper digital material expand reform intelligently material physical surfaces edges seams shadows provide meaning touch material design language used android across google suite web software well providing consistent experience across platforms android 5.0 introduces refreshed notification system individual notifications displayed cards adhere material design language batches notifications grouped app produced notifications displayed lock screen cards heads notifications also displayed large banners across top screen along respective action buttons do-not-disturb feature also added notifications recent apps menu redesigned use three-dimensional stack cards represent open apps individual apps also display multiple cards recents menu web browser open tabs lollipop also contains major new platform features developers 5,000 new apis added use applications example possibility save photos raw image format additionally dalvik virtual machine officially replaced android runtime art new runtime environment introduced technology preview kitkat art cross-platform runtime supports x86 arm mips architectures 32-bit 64-bit environments unlike dalvik uses just-in-time compilation jit art compiles apps upon installation run exclusively compiled version technique removes processing overhead associated jit process improving system performance lollipop also aims improve battery consumption series optimizations known project volta among changes new battery saver mode job scheduling apis restrict certain tasks occur wi-fi batching tasks reduce overall amount time internal radios active new developer tool called battery historian used tracking battery consumption apps use android extension pack apis also provide graphics functions new shaders aiming provide pc-level graphics 3d games android devices number system-level enterprise-oriented features also introduced banner android work samsung knox security framework initially planned used foundation android work instead google opted use technology segregating personal work-oriented data device along accompanying apis managing environment smart lock feature devices also configured users perform device unlocking pin pattern trusted location proximity designated bluetooth device nfc tag lollipop additionally device encryption enabled default capable devices however due performance issues change held successor android marshmallow developer preview android l build lpv79 released nexus 5 2013 nexus 7 june 26 2014 form flashable images source code gpl-licensed components developer preview released via android open source project aosp july 2014 second developer preview build lpv81c released august 7 2014 alongside beta version google fit platform sdk previous build second developer preview build available nexus 5 2013 nexus 7 october 15 2014 google officially announced android l would known android 5.0 lollipop company also unveiled launch devices android5.0including motorola nexus 6 htc nexus 9for release november 3 2014 google stated nexus including nexus 4 5 7 10 google play edition devices would receive updates lollipop coming weeks one developer preview build nexus devices new sdk revision application developers would released october 17 2014 update schedules third-party android devices may vary manufacturer full source code android5.0 pushed aosp november 3 2014 allowing developers oems begin producing builds operating system december 2 2014 factory images nexus smartphones tablets updated 5.0.1 version introduces bug fixes serious bug affects nexus 4 devices prevents audio working phone calls device-specific lollipop 5.0.2 lrx22g version released first-generation nexus 7 december 19 2014 android5.1 updated version lollipop unveiled february 2015 part indonesian launch android one preloaded android one devices sold indonesia philippines google officially announced 5.1 releasing updates existing devices march 9 2015 2015 amazon.com forked lollipop produce fire os 5 bellini amazon fire hd-series devices", + "neighbors": [ + 24, + 41, + 67, + 85, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 858, + 936, + 1016, + 1082, + 1183, + 1185, + 1231, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1062, + "label": 0, + "text": "Text_corpus:text corpus linguistics corpus plural corpora text corpus large structured set texts nowadays usually electronically stored processed corpus linguistics used statistical analysis hypothesis testing checking occurrences validating linguistic rules within specific language territory corpus may contain texts single language monolingual corpus text data multiple languages multilingual corpus multilingual corpora specially formatted side-by-side comparison called aligned parallel corpora two main types parallel corpora contain texts two languages translation corpus texts one language translations texts language comparable corpus texts kind cover content translations exploit parallel text kind text alignment identifying equivalent text segments phrases sentences prerequisite analysis machine translation algorithms translating two languages often trained using parallel fragments comprising first language corpus second language corpus element-for-element translation first language corpus order make corpora useful linguistic research often subjected process known annotation example annotating corpus part-of-speech tagging pos-tagging information word part speech verb noun adjective etc added corpus form tags another example indicating lemma base form word language corpus working language researchers use interlinear glossing used make annotation bilingual corpora structured levels analysis applied particular number smaller corpora may fully parsed corpora usually called treebanks parsed corpora difficulty ensuring entire corpus completely consistently annotated means corpora usually smaller containing around one three million words levels linguistic structured analysis possible including annotations morphology semantics pragmatics corpora main knowledge base corpus linguistics analysis processing various types corpora also subject much work computational linguistics speech recognition machine translation often used create hidden markov models part speech tagging purposes corpora frequency lists derived useful language teaching corpora considered type foreign language writing aid contextualised grammatical knowledge acquired non-native language users exposure authentic texts corpora allows learners grasp manner sentence formation target language enabling effective writing text corpora also used study historical documents example attempts decipher ancient scripts biblical scholarship archaeological corpora short duration provide snapshot time one shortest corpora time may 15\u201330 year amarna letters texts 1350 bc corpus ancient city example k\u00fcltepe texts turkey may go series corpora determined find site dates", + "neighbors": [ + 159, + 282, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1096, + 1128, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1063, + "label": 4, + "text": "Row_hammer:row hammer row hammer also written rowhammer unintended undesirable side effect dynamic random-access memory dram memory cells leak charges interact electrically possibly leaking changing contents nearby memory rows addressed original memory access bypass isolation dram memory cells results high cell density modern dram triggered specially crafted memory access patterns rapidly activate memory rows numerous times row hammer effect used privilege escalation computer security exploits network-based attacks also theoretically possible fast network connection attacker victim different hardware-based techniques exist prevent row hammer effect occurring including required support processors types dram memory modules row hammer rarely never affects ddr ddr2 sdram modules affects many ddr3 ddr4 sdram modules dynamic ram dram bit stored data occupies separate memory cell electrically implemented one capacitor one transistor charge state capacitor charged discharged determines whether dram cell stores 1 0 binary value huge numbers dram memory cells packed integrated circuits together additional logic organises cells purposes reading writing refreshing data memory cells blue squares illustration organised matrices addressed rows columns memory address applied matrix broken row address column address processed row column address decoders illustration vertical horizontal green rectangles respectively row address selects row read operation selection also known row activation bits cells row transferred sense amplifiers form row buffer red squares illustration exact bit selected using column address consequently read operations destructive nature design dram requires memory cells rewritten values read transferring cell charges row buffer write operations decode addresses similar way result design entire rows must rewritten value single bit changed result storing data bits using capacitors natural discharge rate dram memory cells lose state time require periodic rewriting memory cells process known refreshing another result design dram memory susceptible random changes stored data known soft memory errors attributed cosmic rays causes different techniques counteract soft memory errors improve reliability dram error-correcting code ecc memory advanced variants lockstep memory commonly used increased densities dram integrated circuits ics led physically smaller memory cells capable storing smaller charges resulting lower operational noise margins increased rates electromagnetic interactions memory cells greater possibility data loss result disturbance errors observed caused cells interfering operation manifesting random changes values bits stored affected memory cells awareness disturbance errors dates back early 1970s intel 1103 first commercially available dram ic since dram manufacturers employed various mitigation techniques counteract disturbance errors improving isolation cells performing production testing however researchers proved 2014 analysis commercially available ddr3 sdram chips manufactured 2012 2013 susceptible disturbance errors using term row hammer name associated side effect led observed bit flips opportunity row hammer effect occur ddr3 memory primarily attributed ddr3 high density memory cells results associated interactions cells rapid dram row activations determined primary cause frequent row activations cause voltage fluctuations associated row selection lines observed induce higher-than-natural discharge rates capacitors belonging nearby adjacent cases memory rows called victim rows affected memory cells refreshed lose much charge disturbance errors occur tests show disturbance error may observed performing around 139,000 subsequent memory row accesses cache flushes one memory cell every 1,700 cells may susceptible tests also show rate disturbance errors substantially affected increased environment temperature depends actual contents dram certain bit patterns result significantly higher disturbance error rates variant called double-sided hammering involves targeted activations two dram rows surrounding victim row illustration provided section variant would activating yellow rows aim inducing bit flips purple row case would victim row tests show approach may result significantly higher rate disturbance errors compared variant activates one victim row neighbouring dram rows different methods exist less successful detection prevention correction mitigation row hammer effect tests show simple ecc solutions providing single-error correction double-error detection sec ded capabilities able correct detect observed disturbance errors include two flipped bits per memory word flipping three bits prevents ecc noticing modification effective solution introduce frequent memory refreshing refresh intervals shorter usual 64 ms technique results higher power consumption increased processing overhead vendors provide firmware updates implement type mitigation one complex prevention measures performs counter-based identification frequently accessed memory rows proactively refreshes neighbouring rows another method issues additional infrequent random refreshes memory rows neighbouring accessed rows regardless access frequency research shows two prevention measures cause negligible performance impacts since release ivy bridge microarchitecture intel xeon processors support so-called pseudo target row refresh ptrr used combination ptrr-compliant ddr3 dual in-line memory modules dimms mitigate row hammer effect automatically refreshing possible victim rows negative impact performance power consumption used dimms ptrr-compliant xeon processors default fall back performing dram refreshes twice usual frequency results slightly higher memory access latency may reduce memory bandwidth 2\u20134 lpddr4 mobile memory standard published jedec includes optional hardware support so-called target row refresh trr prevents row hammer effect without negatively impacting performance power consumption additionally manufacturers implement trr ddr4 products although part ddr4 memory standard published jedec internally trr identifies possible victim rows counting number row activations comparing predefined chip-specific maximum activate count mac maximum activate window values refreshes rows prevent bit flips mac value maximum total number row activations may encountered particular dram row within time interval equal shorter amount time neighbouring rows identified victim rows trr may also flag row victim row sum row activations two neighbouring rows reaches mac limit within time window due necessity huge numbers rapidly performed dram row activations row hammer exploits issue large numbers uncached memory accesses cause cache misses detected monitoring rate cache misses unusual peaks using hardware performance counters version 5.0 memtest86 memory diagnostic software released december 3 2013 added row hammer test checks whether computer ram susceptible disturbance errors works computer boots uefi without uefi boots older version hammer test memory protection way preventing processes accessing memory assigned one concepts behind modern operating systems using memory protection combination security-related mechanisms protection rings possible achieve privilege separation processes programs computer systems general divided parts limited specific privileges require perform particular task using privilege separation also reduce extent potential damage caused computer security attacks restricting effects specific parts system disturbance errors explained section effectively defeat various layers memory protection short circuiting low hardware level practically creating unique attack vector type allows processes alter contents arbitrary parts main memory directly manipulating underlying memory hardware comparison conventional attack vectors buffer overflows aim circumventing protection mechanisms software level exploiting various programming mistakes achieve alterations otherwise inaccessible main memory contents initial research row hammer effect published june 2014 described nature disturbance errors indicated potential constructing attack provide examples working security exploit subsequent october 2014 research paper imply existence security-related issues arising row hammer effect march 9 2015 google project zero revealed two working privilege escalation exploits based row hammer effect establishing exploitable nature x86-64 architecture one revealed exploits targets google native client nacl mechanism running limited subset x86-64 machine instructions within sandbox exploiting row hammer effect escape sandbox gain ability issue system calls directly nacl vulnerability tracked mitigated modifying nacl allow execution codice_1 cache line flush machine instruction previously believed required constructing effective row hammer attack second exploit revealed project zero runs unprivileged linux process x86-64 architecture exploiting row hammer effect gain unrestricted access physical memory installed computer combining disturbance errors memory spraying exploit capable altering page table entries ptes used virtual memory system mapping virtual addresses physical addresses results exploit gaining unrestricted memory access due nature inability x86-64 architecture make codice_1 privileged machine instruction exploit hardly mitigated computers use hardware built-in row hammer prevention mechanisms testing viability exploits project zero found half 29 tested laptops experienced disturbance errors occurring vulnerable laptops less five minutes running row-hammer-inducing code tested laptops manufactured 2010 2014 used non-ecc ddr3 memory july 2015 group security researchers published paper describes architecture- instruction-set-independent way exploiting row hammer effect instead relying codice_1 instruction perform cache flushes approach achieves uncached memory accesses causing high rate cache eviction using carefully selected memory access patterns although cache replacement policies differ processors approach overcomes architectural differences employing adaptive cache eviction strategy algorithm proof concept approach provided native code implementation pure javascript implementation runs firefox 39 javascript implementation called rowhammer.js uses large typed arrays relies internal allocation using large pages result demonstrates high-level exploit low-level vulnerability october 2016 researchers vusec systems network security group vu amsterdam published drammer android app uses rowhammer methods reliably gain root access several popular models smartphones vulnerability acknowledged cve-2016-6728 patch released google within month mitigate effect however due general nature possible implementations attack effective software patch difficult reliably implement fact june 2018 proposals made academia industry either impractical deploy insufficient stopping attacks mitigate attacks researchers vusec systems proposed lightweight defense prevents dma-based attacks isolating dma buffers guard rows software states vulnerable rowhammer attacks attacker thus needs find right target states order utilise rowhammer errors practice one main challenges identifying target states typically done domain experts mainstream fault tolerance community responded rowhammer attacks systematic methodology used identify validate evaluate rowhammer attack target states exploitability work based well-established fault injection-based experimental methodology generalised attack target states found practical target states previously unknown", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 91, + 99, + 134, + 141, + 158, + 170, + 171, + 187, + 225, + 232, + 261, + 270, + 281, + 293, + 322, + 325, + 343, + 359, + 376, + 379, + 413, + 414, + 465, + 477, + 509, + 533, + 550, + 577, + 583, + 588, + 604, + 613, + 621, + 624, + 633, + 664, + 665, + 675, + 708, + 728, + 754, + 783, + 797, + 800, + 818, + 860, + 891, + 915, + 941, + 961, + 965, + 966, + 986, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1186, + 1187, + 1202, + 1224, + 1270, + 1291, + 1293, + 1301, + 1327, + 1332, + 1336, + 1342, + 1393, + 1398, + 1415, + 1436, + 1441, + 1467, + 1474, + 1475, + 1494, + 1518, + 1530, + 1543, + 1546, + 1573, + 1576, + 1578, + 1582, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 1064, + "label": 6, + "text": "File_system_API:file system api file system api application programming interface utility user program requests services file system operating system may provide abstractions accessing different file systems transparently file system apis may also include interfaces maintenance operations creating initializing file system verifying file system integrity defragmentation operating system includes apis needed file systems supports microsoft windows file system apis ntfs several fat file systems linux systems include apis ext2 ext3 reiserfs btrfs name early operating systems capable handling tape disk file systems provided basic interfaces coordination device allocation deallocation required addition file systems provided services interfaces defined additional file system types hierarchy structure supported media increased additional features needed specialized functions multi-user systems required apis writing user data file system provided use directly user program run-time library run-time library programming languages may provide type conversion formatting blocking file systems provide identification records key may include re-writing existing record operation sometimes called codice_1 record exists reading user data sometimes called get may include direction forward reverse case keyed file system specific key writing run-time libraries may intercede user program positioning includes adjusting location next record may include skipping forward reverse well positioning beginning end file open api may explicitly requested implicitly invoked upon issuance first operation process object may cause mounting removable media establishing connection another host validating location accessibility object updates system structures indicate object use usual requirements requesting access file system object include additional information may necessary example requested via programming language library may provide coordination among modules process addition forwarding request file system must expected something may go wrong processing open depending programming language additional specifications open may establish modules handle conditions libraries specify library module file system permitting analysis opening program unable perform meaningful action result failure example failure attempt open necessary input file action may report failure abort program languages simply return code indicating type failure always must checked program decides report continue close may cause dismounting ejecting removable media updating library file system structures indicate object longer use minimal specification close references object additionally file systems provide specifying disposition object may indicate object discarded longer part file system similar open must expected something may go wrong considerations handling failure similar open information data file called metadata metadata maintained file system example last-modification date various dates depending file system location beginning file size file file system backup utility saved current version files items usually altered user program additional meta data supported file systems may include owner file group file belongs well permissions and/or access control i.e access updates various users groups may perform whether file normally visible directory listed items usually modifiable file system utilities may executed owner applications store metadata images metadata may include camera model settings used take photo audio files meta data may include album artist recorded recording comments recording may specific particular copy file i.e different copies recording may different comments update owner file documents may include items like checked-by approved-by etc renaming file moving file subdirectory one directory another deleting file examples operations provide file system management directories metadata operations permitting restricting access directory various users groups users usually included filesystem used directories files records may added deleted modified usually causes inefficiencies underlying data structures things like logically sequential blocks distributed across media way causes excessive repositioning partially used even empty blocks included linked structures incomplete structures inconsistencies may caused device media errors inadequate time detection impending loss power actual power loss improper system shutdown media removal rare occasions file system coding errors specialized routines file system included optimize repair structures usually invoked user directly triggered within file system internal counters number levels structures number inserted objects may compared thresholds may cause user access suspended specific structure usually displeasure user users effected may started low priority asynchronous tasks may deferred time low user activity sometimes routines invoked scheduled system manager case defragmentation api kernel-level kernel provides interfaces filesystems developers also space filesystem code resides differs old schema kernel uses facilities talk filesystem driver vice versa contrary kernel one handles filesystem layout filesystem one directly access hardware cleanest scheme resolves difficulties major rewrite old scheme modular kernels allows adding filesystems kernel module even third party ones non-modular kernels however requires kernel recompiled new filesystem code closed-source kernels makes third party filesystem impossible unixes unix-like systems linux used modular scheme variation scheme used ms-dos dos 4.0 onward compatibles support cd-rom network file systems instead adding code kernel old scheme using kernel facilities kernel-based scheme traps calls file identifies redirected kernel equivalent function handled specific filesystem driver filesystem driver directly access disk contents using low-level bios functions api driver-based kernel provides facilities file system code resides totally external kernel even module modular kernel cleaner scheme filesystem code totally independent allows filesystems created closed-source kernels online filesystem additions removals system examples scheme windows nt os/2 respective ifss api filesystems kernel like kernel-based apis automatically trapped another api driver-based os scheme used windows 3.1 providing fat filesystem driver 32-bit protected mode cached vfat bypassed dos fat driver kernel msdos.sys completely later windows 9x series 95 98 vfat iso9660 filesystem driver along joliet network shares third party filesystem drivers well adding original dos apis lfn api ifs drivers intercept already existent dos file apis also add new ones within 32-bit protected mode executable however api completely documented third parties found make-it-by-yourself scenario even worse kernel-based apis api user space filesystem directly use kernel facilities accesses disks using high-level operating system functions provides functions library series utilities use access filesystem useful handling disk images advantage filesystem made portable operating systems high-level operating system functions uses common ansi c disadvantage api unique application implements one examples scheme hfsutils adflib filesystems least disk ones need equivalent functions provided kernel possible easily port filesystem code one api another even different types example ext2 driver os/2 simply wrapper linux vfs os/2 ifs linux ext2 kernel-based hfs driver os/2 port hfsutils os/2 ifs also exists project uses windows nt ifs driver making ntfs work linux", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 234, + 278, + 295, + 326, + 334, + 349, + 358, + 412, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1056, + 1097, + 1104, + 1124, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1287, + 1304, + 1322, + 1381, + 1415, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1065, + "label": 8, + "text": "Tntnet:tntnet tntnet web server software coded c++ enables c++ programs bundle requests modules enables developing web applications c++ get post requests interpreted tntnet server sent web application program send reply back network tntnet free software released gnu lesser general public license lgpl tntnet provides many features script-based cgi different tradeoffs c++ based tntnet allows use methods object-oriented programming polymorphism also supported modern scripting languages tntnet web application compiled ahead time script-based cgis often interpreted compiled modules native generally faster scripts programs cgid fastcgi used improve performance script-based cgis tntnet directly integrates web application webserver webservers often apis apache http server uses module system internet information services iis uses internet server application programming interface isapi tntnet originally used apache module system changed due difficulty interfacing apache c api maintaining benefits using c++ situation tommi m\u00e4kitalo developed tntnet framework tntnet also webserver present source code way tntnet acts layer front actual web application use webserver part receives http requests interpretes sends binary web application part web application webserver communicate constantly extra libraries provide tools programmer tntnet uses library tools named cxxtools build applications written using tntnet cxxtools needed library tntdb database abstraction layer programs developed using tntdb depend specific type underlying database system tntdb handle following database systems", + "neighbors": [ + 134, + 306, + 638, + 782, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 1066, + "label": 9, + "text": "RPL_(programming_language):rpl programming language /ref rpl derived reverse polish lisp according original developers whilst short 1987 hp marketing attempted coin backronym rom-based procedural language handheld calculator operating system application programming language used hewlett-packard scientific graphing rpn reverse polish notation calculators hp 28 48 49 50 series also usable non-rpn calculators 38 39 40 series rpl structured programming language based rpn equally capable processing algebraic expressions formulae implemented threaded interpreter rpl many similarities forth languages stack-based well list-based lisp contrary previous hp rpn calculators fixed four-level stack stack used rpl limited available calculator ram rpl originated hp corvallis oregon development facility 1984 replacement previous practice implementing operating systems calculators assembly language last pocket calculator supporting rpl hp 50g discontinued 2015 however multiple emulators emulate hp rpl calculators exist run range operating systems devices including ios android smartphones internal low- medium-level variant rpl called system rpl sysrpl used earlier hp calculators well aforementioned ones part operating system implementation language hp 48 series variant rpl accessible calculator user without use external tools hp 49/50 series compiler built rom use sysrpl possible cause serious crash coding sysrpl caution must used using high-level user rpl userrpl version language available said graphing calculators developing textual well graphical application programs userrpl programs internally represented sysrpl programs use safe subset available sysrpl commands error checking part userrpl commands however makes userrpl programs noticeably slower equivalent sysrpl programs userrpl command syseval tells calculator process designated parts userrpl program sysrpl code rpl control blocks strictly postfix although notable exceptions control block structures appear would standard infix language calculator manages allowing implementation blocks skip ahead program stream necessary rpl supports basic conditional testing if/then/else structure basic syntax block following example tests see number bottom stack 1 replaces equal one construct evaluates condition tests bottom stack result result rpl optionally support forth-style blocks allowing condition determined block leaving condition empty statement make changes stack condition execution use existing result bottom stack test postfix conditional testing may accomplished using ift if-then ifte if-then-else functions ift ifte pop two three commands stack respectively topmost value evaluated boolean true second topmost value pushed back stack ifte allows third else value pushed back stack boolean false following example uses ift function pop object bottom stack equal 1 replaces one following example uses ifte function pop object bottom stack equal 1 replaces one equal 1 replaces string one ift ifte evaluate program block given one arguments allowing compact form conditional logic if/then/else/end structure following example pops object bottom stack replaces one less depending whether equal less greater 1 support complex conditional logic rpl provides case/then/end structure handling multiple exclusive tests one branches within case statement executed basic syntax block following code illustrates use case/then/end block given letter bottom stack replaces string equivalent unknown letter code identical following nested if/then/else/end block equivalent rpl provides for/next statement looping one index another index loop stored temporary local variable accessed loop syntax for/next block following example uses loop sum numbers 1 10 index variable loop start/next block used simple block runs start index end index unlike for/next loop looping variable available syntax start/next block for/next start/next support user-defined step increment replacing terminating next keyword increment step keyword loop variable incremented decremented different value default +1 instance following loop steps back 10 2 decrementing loop index 2 while/repeat/end block rpl supports indefinite loop condition test start loop syntax while/repeat/end block do/until/end block rpl supports indefinite loop condition test end loop syntax do/until/end block", + "neighbors": [ + 27, + 46, + 78, + 194, + 251, + 308, + 313, + 332, + 359, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 755, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1138, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Validation" + }, + { + "node_id": 1067, + "label": 4, + "text": "Juliana_Mickwitz:juliana mickwitz juliana mickwitz 1889-1976 finnish-born russian became naturalized american citizen employed american military later national security agency translator linguist cryptanalyst inducted cryptologic hall honor 2012 juliane charlotte ernestine von mickwitz born elisabeth marie caroline n\u00e9e von dittmann ernst theodor leopold von mickwitz aka mikvits minckwitz 15 may 1889 vyborg grand duchy finland russian empire grandfather estate called halila oldest two children brother alexander would later join united states learning english german russian home tutor entered st ann gymnasium saint petersburg 1903 graduated gold medal excellence 1907 tutored students 1909 year began working secretary michael lazareff president russian unified oil company continued working widow eugenia lazareff death 1919 rise bolsheviks russian civil war mickwitz managed hide assets lazareff turn secured passage poland story mickwitz engaged polish doctor 15 april 1920 two women arrived warsaw mickwitz began trying preserve lazareff assets outside soviet union protect confiscation worked translator various organizations including american consulate warsaw british embassy canadian us timber corporation 1925 year began working foreign correspondent polish agricultural syndicate kooprolna cooperative year applied full-time position american military attach\u00e9 office 1926 mickwitz became employed us military attach\u00e9 office warsaw working major general william h. colbern colonel r. i. mckenney colonel john winslow general emer yeager thirteen years worked warsaw nazi invasion poland december 1939 transferred rest office hague netherlands taking lazareff aunt months germans invaded low countries office evacuated berlin three months august 1940 relocated athens germans followed july 1941 mickwitz lazareff fled lisbon assistance former employers able secure travel visas united states march 1942 arriving u.s. mickwitz began working war department military intelligence directorate translating german polish russian documents october 1946 released service awarded meritorious civilian service medal month hired army security agency stationed arlington hall 1952 transferred national security agency nsa founded linguistic unit managed translate plaintext voice remained agency 1963 retired receiving second meritorious service award continued consult nsa 1966 inducted cryptologic hall honor 2012 mickwitz member russian orthodox church helped founding construction russian orthodox cathedral st. john baptist washington dc served head parish many years worked establish congress russian americans virginia help russian immigrants became naturalized american citizen mickwitz died 21 august 1976 sacred heart nursing home hyattsville maryland suffering stroke previous november priest greece father nicolas pekatoros officiated funeral", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1068, + "label": 2, + "text": "Windows_Runtime_XAML_Framework:windows runtime xaml framework 'windows runtime xaml framework code name jupiter user interface api part windows runtime winrt programming model forms backbone windows store apps formerly known metro-style immersive windows 8 windows 8.1 windows phone 8.1 operating systems enables declaring user interfaces using extensible application markup language xaml technology xaml framework one multiple ui apis windows runtime others html5 e.g. via winjs directx windows phone 8.0 windows runtime xaml framework supported xaml applications based silverlight xaml framework deployed xap format windows phone 8.1 windows runtime xaml available along improved windows runtime support convergence platforms enable universal apps target windows 8.1 windows phone 8.1 sharing code including user interface windows phone 8.1 still capable running silverlight based xaml apps new features api also added framework called silverlight 8.1 xaml framework related windows presentation foundation wpf silverlight\u2014similar xaml-based ui frameworks used desktop applications portable applications respectively xaml framework uses lot names apis older technologies\u2014especially silverlight use limited windows os specifically windows 8 later wpf major difference silverlight wpf largely based common language runtime clr require using programming languages c visual basic xaml framework part windows runtime written native code also available tools development c++ c++/cx", + "neighbors": [ + 28, + 99, + 117, + 258, + 268, + 306, + 308, + 394, + 412, + 435, + 472, + 509, + 521, + 567, + 653, + 682, + 686, + 689, + 796, + 815, + 961, + 1044, + 1138, + 1177, + 1189, + 1190, + 1221, + 1225, + 1227, + 1235, + 1251, + 1298, + 1311, + 1417, + 1428, + 1502, + 1536, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1069, + "label": 3, + "text": "List_of_ARM_microarchitectures:list arm microarchitectures list microarchitectures based arm family instruction sets designed arm holdings 3rd parties sorted version arm instruction set release name arm provides summary numerous vendors implement arm cores design keil also provides somewhat newer summary vendors arm based processors arm provides chart displaying overview arm processor lineup performance functionality versus capabilities recent arm core families dhrystone synthetic benchmark developed 1980s longer representative prevailing workloadsuse caution cores implement arm instruction set developed independently companies architectural license arm following table lists core year announced cores arm7 n't included table", + "neighbors": [ + 112, + 214, + 607, + 681, + 853, + 891, + 917, + 980, + 988, + 1013, + 1069, + 1147, + 1160, + 1176, + 1178, + 1224, + 1256, + 1262, + 1305, + 1384, + 1488, + 1518, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 1070, + "label": 8, + "text": "Path_analysis_(computing):path analysis computing path analysis analysis path portrayal chain consecutive events given user cohort performs set period time using website online game ecommerce platform subset behavioral analytics path analysis way understand user behavior order gain actionable insights data path analysis provides visual portrayal every event user cohort performs part path set period time possible track user \u2019 path site even show path visual representation real question gain actionable insights path analysis simply outputs pretty graph may look nice provide anything concrete act upon order get path analysis first step would determine needs analyzed goals analysis company might trying figure site running slow certain types users interested certain pages products user interface set logical way goal set ways performing analysis large percentage certain cohort people ages 18-25 logs online game creates profile spends next 10 minutes wandering around menu page may user interface logical seeing group users following path developer able analyze data realize creating profile \u201c play game \u201d button appear thus path analysis able provide actionable data company act fix error ecommerce path analysis help customize shopping experience user looking products customers certain cohort looked buying one company suggest \u201c items may also like \u201d next customer increase chances making purchase also path analysis help solve performance issues platform example company looks path realizes site freezes certain combinations events analyzing path progression events led error company pinpoint error fix historically path analysis fell broad category website analytics related analysis paths websites path analysis website analytics process determining sequence pages visited visitor session prior desired event visitor purchasing item requesting newsletter precise order pages visited may may important may may specified practice analysis done aggregate ranking paths sequences pages visited prior desired event descending frequency use idea determine features website encourage desired result fallout analysis subset path analysis looks black holes site paths lead dead end frequently paths features confuse lose potential customers advent big data along web-based applications online games ecommerce platforms path analysis come include much web path analysis understanding users move app game web platform part modern-day path analysis real world visit shop shelves products placed random order shop owner carefully analyzes visitors path walk shop especially selecting buying products next shop owner reorder shelves products optimize sales putting everything logical order visitors supermarket typically result wine shelf next variety cookies chips nuts etc simply people drink wine eat nuts web sites logic applied visitors questions product go product information support section web site make logical step frequently asked questions page specific question web site owner also wants analyze visitor behavior example web site offers products sale owner wants convert many visitors completed purchase sign-up form multiple pages web site owners want guide visitors final sign-up page path analysis answers typical questions like visitors go enter home page strong visitor relation product product b web site questions ca n't answered page hits unique visitors statistics google analytics provides path function funnels goals predetermined path web site pages specified every visitor walking path goal approach helpful analyzing many visitors reach certain destination page called end point analysis paths visitors walk web site lead endless number unique paths result point analyzing path look strongest paths strongest paths typically shown graphical map text like page -- page b -- page -- exit", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1071, + "label": 4, + "text": "Mod_n_cryptanalysis:mod n cryptanalysis cryptography mod n cryptanalysis attack applicable block stream ciphers form partitioning cryptanalysis exploits unevenness cipher operates equivalence classes congruence classes modulo n method first suggested 1999 john kelsey bruce schneier david wagner applied rc5p variant rc5 m6 family block ciphers used firewire standard attacks used properties binary addition bit rotation modulo fermat prime rc5p analysis conducted modulo 3 observed operations cipher rotation addition 32-bit words somewhat biased congruence classes mod 3 illustrate approach consider left rotation single bit follows thus left rotation single bit simple description modulo 3 analysis operations data dependent rotation modular addition reveals similar notable biases although theoretical problems analysing operations combination bias detected experimentally entire cipher kelsey et al. 1999 experiments conducted seven rounds based conjecture many 19 20 rounds rc5p distinguished random using attack also corresponding method recovering secret key m6 attacks mod 5 mod 257 even effective", + "neighbors": [ + 32, + 104, + 174, + 284, + 289, + 382, + 633, + 969, + 995, + 1181, + 1232, + 1233, + 1240, + 1351 + ], + "mask": "Train" + }, + { + "node_id": 1072, + "label": 3, + "text": "Reservation_station:reservation station unified reservation station also known unified scheduler decentralized feature microarchitecture cpu allows register renaming used tomasulo algorithm dynamic instruction scheduling reservation stations permit cpu fetch re-use data value soon computed rather waiting stored register re-read instructions issued designate reservation station want input read multiple instructions need write register proceed logically last one need actually written checks operands available raw execution unit free structural hazard starting execution instructions stored available parameters executed ready results identified unit execute corresponding instruction implicitly register renaming solves war waw hazards since fully associative structure high cost comparators need compare results returned processing units stored addresses tomasulo algorithm instructions issued sequence reservation stations buffer instruction well operands instruction operand available reservation station listens common data bus operand become available operand becomes available reservation station buffers execution instruction begin functional units adder multiplier corresponding reservation station output functional unit connects common data bus reservation stations listening operands need", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 314, + 335, + 388, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1469, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1073, + "label": 3, + "text": "Ganbare_Goemon!_Karakuri_D\u014dch\u016b:ganbare goemon karakuri d\u014dch\u016b game revolves around main character goemon exploits name suggests character based ishikawa goemon noble thief japanese folklore unlike sequels game still n't feature comic situation strange characters define series goemon portrayed noble thief rather plain hero game plays top view action/adventure game similar legend zelda though separated stages level goemon must find three passes order advance passes found boxes secret passages bought finishing stages game present new japanese province eight total levels remain ending however different like rest series goemon powered certain items found and/or bought lost hits msx version option played turns two players second player playing ninja named nezumi koz\u014d basis goemon sidekick ebisumaru addition unlike family computer version game six provinces completely new levels finishing game", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1074, + "label": 6, + "text": "Source_Code_Control_System:source code control system source code control system sccs version control system designed track changes source code text files development piece software allows user retrieve previous versions original source code changes stored originally developed bell labs 1972 marc rochkind ibm system/370 computer running os/360 sccs also known codice_1 string example string contains file name date also contain comment compilation string found binary object files looking pattern used determine source code files used compilation command available automate search version strings 1972 marc rochkind developed sccs snobol4 bell labs ibm system/370 computer running os/360 mvt later rewritten c unix running pdp-11 first publicly released version sccs version 4 february 18 1977 available programmer workbench pwb edition operating system release 4 sccs first version used text-based history file format earlier versions use binary history file formats release 4 longer written maintained marc rochkind subsequently sccs included commercial system iii system v distributions licensed 32v ancestor bsd sccs command set part single unix specification sccs dominant version control system unix later version control systems notably rcs later cvs gained widespread adoption today early version control systems generally considered obsolete particularly open-source community largely embraced distributed version control systems however sccs file format still used internally newer version control programs including bitkeeper teamware latter frontend sccs sablime developed modified version sccs uses history file format incompatible sccs sccs file format uses storage technique called interleaved deltas weave storage technique considered many version control system developers foundational advanced merging versioning techniques precise codeville pcdv merge apart fixing year 2000 problems 1999 active development various unix vendor specific sccs versions 2006 sun microsystems today part oracle released solaris version sccs open-source cddl license part efforts open-source solaris source code control system sccs system controlling file history changes software typically upgraded new version fixing bugs optimizing algorithms adding extra functions changing software causes problems require version control solve sccs built solve problems sccs five major versions ibm os five major versions unix two specific implementations using sccs pdp 11 unix ibm 370 os sccs consists two parts sccs commands sccs files basic operations e.g. create delete edit realized sccs commands sccs files unique format prefix codice_2 controlled sccs commands sccs file composed three different parts sccs delta refers change sccs file deltas stored delta table sccs file record changes every operation sccs file tracked flags functions three types control records used keep track insertions deletions applied different deltas insertion control record deletion control record end control record whenever user changes part text control record inserted surrounding change control records stored body along original source code text records lots commands used sccs commands helps users finish want achieve without understanding worked also sccs allows users access history files moreover also provides commands allow edit monitor change source files sccs create command uses text source file create new history file example outputs name version lines create command macro expands admin create new history file followed get retrieve file edit specific file edit command macro expands get -e. check new version get new version sccs delget command macro expands delta check new version file followed get retrieve file outputs version lines want get specific file command produces report changes made unix versions include version sccs however often longer actively developed j\u00f6rg schilling requested release sccs early days opensolaris project maintains fork sccs based opensolaris source code received major feature enhancements remains compatible original sccs versions unless using new project mode heirloom project includes version sccs derived opensolaris source code maintained december 2006 april 2007 gnu offers sccs compatible program gnu cssc compatibly stupid source control occasionally used convert sccs archives newer systems like cvs subversion complete sccs implementation recommended use new projects mostly meant converting modern version control system since 1990s many new version control systems developed become popular designed managing projects large number files offer advanced functionality multi-user operation access control automatic building network support release management distributed version control bitkeeper teamware use sccs file format internally considered successors sccs src version control system also use sccs file format internally rcs aims provide better user interface sccs still managing single-file projects", + "neighbors": [ + 306, + 330, + 443, + 1138, + 1301 + ], + "mask": "Train" + }, + { + "node_id": 1075, + "label": 4, + "text": "Humming_Heads:humming heads humming heads inc. eip enterprise information protection software developer based japan humming heads inc. founded 1999 focus computer security shipped first product security platform sep 2001 anti-virus software taking sox seriously humming heads introduced functionality preventing unauthorized access confidential information theft electronic systems humming heads came implementation desktop file manager 2017 firm entered us market sep prevents unauthorized information access pc well external devices sep client controlling storage devices automatically performs operations like encryption also keeps log user operations stored server side analyzed needed one important features sep marginal effect client pc performance originally sep available japanese language chinese english versions sep software development", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1076, + "label": 9, + "text": "S-1_Lisp:s-1 lisp s-1 lisp lisp implementation written lisp 36-bit pipelined s-1 mark iia supercomputer computer architecture 32 megawords ram", + "neighbors": [ + 27, + 46, + 194, + 227, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1220, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1398, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 1077, + "label": 1, + "text": "TRICS:trics trics trip rate information computer system database trip rates developments used united kingdom transport planning purposes specifically quantify trip generation new developments trics consortium describes trics follows database established 1989 six county councils south east england county councils dorset east sussex hampshire kent surrey west sussex run trics consortium limited trics 7 major update released late 2013 trics includes following development categories trics also developed sam standard assessment methodology system measure effectiveness travel plans", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1078, + "label": 4, + "text": "Malware_Bell:malware bell malware bell malware program made taiwan somewhere 2006 2007 malware bell tries install automatically upon visiting website promoting containing malware", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1079, + "label": 9, + "text": "Tiny_BASIC:tiny basic tiny basic dialect basic programming language fit little 2 3 kb memory small size made invaluable early days mid-1970s typical memory size 4 8 kb meet strict size limits math purely integer based lacked arrays language written part alternative microsoft basic ms basic would also run 4 kb machines left 790 bytes free programs free space significant advantage tiny basic another reason tiny basic popularity open letter published bill gates complaining users ripping ms basic tiny basic published openly later invented term copyleft describe made popular burgeoning early microcomputer market tiny basic published newsletter offshoot people computer company dozens versions created almost every platform era many variations additions published time newsletter eventually became dr. dobb journal long-lived computing magazine tiny basic example free software project existed free software movement dennis allison member computer science faculty stanford university wrote specification simple version basic programming language urged create standard bob albrecht homebrew computer club seen basic minicomputers felt would perfect match new machines like mits altair 8800 released january 1975 allison proposed design used integer arithmetic support arrays goal program fit 2 3 kilobytes memory first version published people computer company separate newsletter format known tiny basic journal full name dr. dobb tiny basic journal calisthenics orthodontia running light without overbyte first issue released january 1976 point programmers began modifying code sending results back published future issues sending magazines like interface age scope original newsletter expanded eventually became known simply dr. dobb journal dick whipple john arnold wrote interpreter required 3k ram middle 1976 tiny basic interpreters available intel 8080 motorola 6800 mos technology 6502 processors forerunner free software community collaborative development internet allowed easy transfer files example free software project free software movement computer hobbyists would exchange paper tapes cassettes even retype files printed listings jim warren editor dr. dobb wrote july 1976 acm programming language newsletter motivations methods successful project started viable alternative problems raised bill gates irate letter computer hobbyists concerning 'ripping software software free inexpensive easier pay duplicate wo n't 'stolen bill gates letter written make software products alternative method experienced professional overall design outline implementation strategy knowledgeable amateurs would implement design variety computer systems warren predicted strategy would continued expanded may 1976 issue dr. dobbs li-chen wang palo alto tiny basic intel 8080 microprocessor listing began usual title author name date also copyleft wrongs reserved fellow homebrew computer club member roger rauskolb modified improved li-chen wang program published december 1976 issue interface age magazine roger added name preserved copyleft notice versions tiny basic existed one written thomas f. waitman 1976 hewlett-packard hp-2640 hp-2645 terminals used intel 8008 8080 processors 8080 ran tiny basic interpreter thomas f. waitman wrote articles hewlett-packard journal 1977 radioshack released first computer trs-80 basic interpreter rom derived palo-alto tiny basic dr. wang version occupied less 2kb radioshack derivation replaced integer representation numbers floating point representation added i/o support e.g cassette tape interface version known level basic fit 4kb rom grammar listed backus-naur form listing asterisk denotes zero object left \u2014 except first asterisk definition term multiplication operator parentheses group objects epsilon \u03b5 signifies empty set common computer language grammar notation vertical bar distinguishes alternatives listed separate lines symbol cr denotes carriage return usually generated keyboard enter key break console interrupt execution program implementations including first tiny basic tom pittman tiny basic virtual machine used others palo alto tiny basic 6800 tiny basic direct interpreters virtual machine implementation tiny basic interpreter run virtual machine interpreter designer idea use application virtual machine goes back val schorre meta ii 1964 glennie syntax machine following table gives partial list commands virtual machine first tiny basic interpreter written length whole interpreter program 120 virtual machine operations thus choice virtual machine approach economized memory space implementation effort although basic programs run thereon executed somewhat slowly", + "neighbors": [ + 0, + 8, + 236, + 273, + 510, + 606, + 670, + 810, + 812, + 843, + 998, + 1034, + 1037, + 1050, + 1156, + 1204, + 1306, + 1372, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1080, + "label": 7, + "text": "Epos_Now:epos epos cloud-based software provider specialising design manufacture electronic point sale commonly referred epos encompasses features including limited reporting stock control crm retail hospitality businesses epos software operated device platform web-browser using epos ios android app epos uk headquarters located norwich england us headquarters orlando florida founded june 2011 company pioneer cloud-technology epos industry notable first epos company introduce appstore customers allows users customise system epos appstore introduced december 2014 epos innovation recognised 2016 company queen award enterprise uk highest accolade business success epos uk 13th fastest growing private technology company fastest growing epos company uk epos founded jacyn heavens 2011 external investment ceo founder jacyn heavens identified gap market affordable epos system whilst managing bar searching epos system would suitable business started building software would suit business owners like epos appstore officially launched september 2015 making first appstore released within epos industry 30,000 businesses using epos 2015 epos awarded 'epos innovation year retail systems shortlisted edp business awards tech cities 2015 2016 epos shortlisted uk cloud awards innovative smb product year category engagement loyalty awards innovative technology category epos also finalist 2016 grocer gold awards technology supplier year category 21 april 2016 announced epos queen award enterprise innovation category epos named gold stevie award winners international business awards innovative company year 2016 epos three eastern daily press business awards 2016 categories employer year tech innovator year business year sponsored barclays company made tech track 100 three years running named 13th 32nd 53rd fastest growing tech company uk named 30th fastest growing company 2016 deloitte fast 50 growth 597 epos named 179th fastest growing tech company deloitte 2016 fast 500 emea epos named europes 46th fastest growing company financial times 1000 listing epos recognised commitment professional development employees winning princess royal training award 2017 epos noted 'best saas product small business/smbs 2017 saas awards", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1081, + "label": 3, + "text": "Manycore_processor:manycore processor manycore processors specialist multi-core processors designed high degree parallel processing containing large number simpler independent processor cores tens cores thousands manycore processors used extensively embedded computers high-performance computing manycore processors distinct multi-core processors optimized outset higher degree explicit parallelism higher throughput lower power consumption expense latency lower single thread performance broader category multi-core processors contrast usually designed efficiently run parallel serial code therefore place emphasis high single thread performance e.g devoting silicon order execution deeper pipelines superscalar execution units larger general caches shared memory techniques devote runtime resources toward figuring implicit parallelism single thread used systems evolved continuously backward compatibility single core processors usually 'few cores e.g 2,4,8 may complemented manycore accelerator gpu heterogeneous system cache coherency issue limiting scaling multicore processors manycore processors may bypass tricks message passing scratchpad memory dma partitioned global address space read-only/non-coherent caches manycore processor using network chip local memories gives software opportunity explicitly optimise spatial layout tasks e.g seen tooling developed truenorth manycore processors may common conceptually technologies originating high performance computing clusters vector processors gpus may considered form manycore processor multiple shader processing units suitable highly parallel code high throughput extremely poor single thread performance number computers built multicore processors one million individual cpu cores examples include", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 227, + 230, + 268, + 270, + 271, + 272, + 280, + 300, + 314, + 331, + 335, + 340, + 352, + 362, + 375, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 591, + 611, + 643, + 659, + 719, + 737, + 752, + 776, + 803, + 821, + 846, + 847, + 876, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1099, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1082, + "label": 2, + "text": "Android_Auto:android auto android auto mobile app developed google mirror features android device smartphone car compatible in-dash information entertainment head unit android device paired head unit system mirrors qualified apps device vehicle display simple driver-friendly user interface supported apps include gps mapping/navigation music playback sms telephone web search system supports touchscreen button-controlled head unit displays although hands-free operation voice commands encouraged minimize driving distraction android auto part open automotive alliance announced june 25 2014 joint effort 28 automobile manufacturers nvidia tech supplier available 36 countries common way android auto deployed via android mobile device running android auto app acting master vehicle dashboard head unit supports functionality user android device connected vehicle head unit serve external display android device presenting supported software car-specific user interface provided android auto app android auto first iterations device required connected via usb car alternatively november 2016 google added option run android auto regular app android device i.e. tethered car head unit allows used android-powered head units simply personal phone tablet vehicle addition january 1 2018 announced jvckenwood would exhibiting wireless android auto-enabled head units ces 2018 would capable operating without need wired connection may 2019 android auto available 36 countries availability apps system varies android auto sdk released allowing third parties modify apps work android auto initially apis music messaging apps would available expected android auto mobile device access several automobile sensors inputs gps high-quality gps antennas steering-wheel mounted buttons sound system directional speakers directional microphones wheel speed compass mobile antennas etc also partial access car data feature still development ces 2018 google confirmed google assistant would coming android auto later year currently supported apps include google maps waze popular music players google play music youtube music amazon music apple music spotify messaging apps including whatsapp facebook messenger google hangouts skype telegram may 2015 hyundai became first manufacturer offer android auto support making available first 2015 hyundai sonata automobile manufacturers offer android auto support cars include abarth acura alfa romeo audi bentley buick cadillac chevrolet chrysler dodge fiat ford gmc genesis holden honda hyundai infiniti jaguar land rover jeep kia lamborghini lexus lincoln mahindra mahindra maserati mazda mercedes-benz mitsubishi nissan opel peugeot ram renault seat \u0161koda ssangyong subaru suzuki tata motors cars toyota volkswagen volvo additionally aftermarket car-audio systems supporting android auto add technology host vehicles including pioneer kenwood panasonic sony may 2019 italy filed antitrust complaint targeting android auto citing google policy allowing third-party media messaging apps platform prevented enel offering app locating vehicle charging stations", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 962, + 1061, + 1129, + 1138, + 1183, + 1185, + 1259, + 1265, + 1276, + 1303, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1486, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1083, + "label": 1, + "text": "African_Origins:african origins african origins project database run researchers emory university aims document known facts african diaspora including documentary material pertaining transatlantic slave trade sister project", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1084, + "label": 2, + "text": "Internet_Explorer_8:internet explorer 8 windows internet explorer 8 ie8 eighth version internet explorer web browser microsoft released march 19 2009 successor internet explorer 7 released 2006 default browser windows 7 windows server 2008 r2 operating systems internet explorer 8 first version ie pass acid2 test last major browsers later acid3 test scores 24/100. according microsoft security ease use improvements rss css ajax support priorities ie8 internet explorer 8 last version internet explorer run windows server 2003 windows xp following version internet explorer 9 works windows vista later support internet explorer 8 bound lifecycle windows version installed considered os component thus unsupported windows xp due end extended support latter april 2014 effective january 12 2016 internet explorer 8 longer supported client server version windows due new policies specifying newest version ie available supported version windows supported however several windows embedded versions remain supported respective eol unless otherwise specified ie8 development started march 2006 february 2008 microsoft sent private invitations ie8 beta 1 march 5 2008 released beta 1 general public although focus web developers release launched windows internet explorer 8 readiness toolkit website promoting ie8 white papers related software tools new features addition download links beta microsoft developer network msdn added new sections detailing new ie8 technology major press focused controversy version targeting two new features called webslice activities readiness toolkit promoted something developers exploit make internet explorer 8 'light august 27 2008 microsoft made ie8 beta 2 generally available pc world noted various beta 2 features inprivate mode tab isolation color-coding improved standards compatibility compared internet explorer 7 two name changes included activities accelerators ie7 phishing filter renamed safety filter first beta smartscreen accompanied incremental technical changes well august 2008 new feature called inprivate taken spotlight first non-beta version released march 19 2009 january 5 2009 tool provided microsoft block automatic install internet explorer 8 via windows update may 20 2009 windows xpe embedded supported platform internet explorer 8 announcements planned support may 27 2010 microsoft released internet explorer 8 optimized bing msn file name boie8_enus_xp.exe support versions ie windows xp ended effective april 8 2014 due end-of-life january 12 2016 support ie8 supported windows operating systems ceased due new support policies dictating newest version ie available supported version windows supported internet explorer 11 supported except windows vista windows server 2008 internet explorer 9 supported windows server 2012 internet explorer 10 supported language support localization complete release ie8 released 25 languages grew 63 vista 32-bit june 2009 support additional languages come pre-installed based os downloaded installed via multilingual user interface mui packages ie8 contains many new features including webslices accelerators accelerators form selection-based search allow user invoke online service page using mouse actions selecting text objects give users access usable accelerator services blogging selected text viewing map selected geographical location invoked selected object according microsoft accelerators eliminate need copy paste content web pages ie8 specifies xml-based encoding allows web application web service invoked accelerator service service invoked categories content show specified xml file similarities drawn accelerators controversial smart tags feature experimented ie 6 beta withdrawn criticism though later included ms office address bar features domain highlighting added security top-level domain shown black whereas parts url grayed domain highlighting turned users web sites features address bar include support pasting multi-line urls improved model inserting selection caret selecting words entire urls address bar inline autocomplete feature dropped internet explorer 8 leading criticism beta users website add-on causes tab crash internet explorer 8 tab affected browser remains stable tabs remain unaffected thereby minimizing disruption browsing experience tab unexpectedly closes crashes automatically reloaded content crash developers internet explorer 8 includes tools allow debugging html css javascript vbscript within browser another new feature ie8 redesigned favorites bar host content web slices web feeds documents addition website links internet explorer 8 replaced find ... dialog box inline find toolbar activated pressing ctrl+f search box drop-down menu f3 kind keyboard-driven nextfind command gone internet explorer 8 highlights instances found words allowing user continue navigation normally new security mode called inprivate debuted ie8 consists two main features inprivate browsing inprivate filtering inprivate browsing described porn mode various news outlets similar feature first introduced safari 2005 later implemented firefox 3.5 opera 10.5 google chrome informationweek mentioned stealth privacy mode inprivate browsing internet explorer 8 helps prevent one browsing history temporary internet files form data cookies usernames passwords retained browser leaving easily accessible evidence browsing search history inprivate filtering provides users added level control choice information third party websites use track browsing activity inprivate subscriptions allow augment capability inprivate blocking subscribing lists websites block allow private browsing modes ways information browsing session recovered internet explorer 8 includes performance improvements across html parser css engine mark-up tree manipulation well jscript runtime associated garbage collector memory leaks due inconsistent handling circular references jscript objects dom objects corrected better security stability ie8 uses loosely coupled internet explorer lcie architecture runs browser frame tabs separate processes lcie prevents glitches hangs bringing entire browser leads higher performance scalability permissions activex controls made flexible instead enabling disabling globally allowed per-site basis smartscreen filter extended internet explorer 7 phishing filter include protection socially engineered malware every website download checked local list popular legitimate websites site listed entire address sent microsoft checks labeled impostor harmful internet explorer 8 show screen prompting site reported harmful n't visited user either visit homepage visit previous site continue unsafe page user attempts download file location reported harmful download cancelled effectiveness smartscreen filtering reported superior socially engineered malware protection browsers feature disabled enforced using group policy feature described microsoft tool suggest websites done browser sending information microsoft secure connection keeps information per-session uniquely generated identifier short time suggested sites feature turned default disabled user browsing inprivate enabled visiting ssl-secured intranet ip address idn address sites information could personally identifiable user ip address browser information sent microsoft artifact https protocol microsoft stated store information functionality defended microsoft itworld.com gregg keizer described phone home feature web slices snippets entire page user subscribe web slices kept updated browser automatically viewed directly favorites bar complete graphics visuals developers mark parts pages web slices using codice_1 codice_2 microformat web slices compared active desktop introduced internet explorer 4 1997 microsoft donated specification public domain creative commons public domain dedication also covered microsoft open specification promise windows rss platform also supports authenticated feeds beginning internet explorer 8 full-page zoom reflows text remove appearance horizontal scrollbars zooming image scaling done using bicubic interpolation resulting smoother looking images scaled using compatibility mode cause style issues select form elements changing zoom levels information bar lets users allow activex control run web sites current one users easily make changes behavior manage add-ons dialog box activex control list sites approved user internet explorer 8 main rendering mode known standards mode improved support various web standards especially css compared internet explorer 7 earlier versions web standards supported ie8 include following however ie8 support w3c standards ie8 passes acid2 test fails acid3 test score 20/100 development microsoft developed 7,000 tests css level 2 compliance submitted w3c inclusion test suite internet explorer 8 promoted microsoft stricter adherence w3c described web standards internet explorer 7 result every ie version percentage web pages coded behavior older versions would break ie8 would repetition situation ie7 fixed bugs ie6 broke pages used ie6-specific hacks work around non-compliance especially problem offline html documents may updatable e.g stored read-only medium cd-rom dvd-rom avoid situation ie8 implements form version targeting whereby page could authored specific version browser using codice_8 declaration either meta element http headers order maintain backwards compatibility sites opt-into ie7-like handling content inserting specially created meta element web page triggers compatibility mode browser using five weeks release ie 8 beta 2 august 2008 beta 1 market share grown 0.05 percent 0.61 percent according net applications july 2009 four months final release market share jumped 13 percent estimates ie8 global market share ranged 6.93 8.73 according net applications web analytics october 2014 internet explorer 8 accounts 17.31 web traffic overtaken ie11 usage march 19 2009 review benny har-even pro offered praise internet explorer 8 noting reliability good features concluding certainly best version internet explorer long time also yet anything make firefox users want jump ship offered praise microsoft paying attention competition producing better featured faster reliable browsing experience masses suggested microsoft continues improve product would become harder persuade unconverted switch away ie next month april 2 mark joseph edwards wrote newsletter windows secrets new edition internet explorer greatly improved security speed compatibility opined still lagged behind competitors three areas edwards noted time internet explorer 8 still underperforming relative browsers speed successful displaying webpages intended display browsers firefox opera terms security wrote continued reliance activex makes browser vulnerable foundation reasons suggested firefox remained better alternative internet explorer 8 even though much better browser ie 7 ie8 requires least", + "neighbors": [ + 14, + 83, + 95, + 107, + 111, + 258, + 277, + 347, + 491, + 509, + 530, + 582, + 623, + 627, + 668, + 684, + 713, + 776, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1132, + 1138, + 1151, + 1166, + 1195, + 1210, + 1228, + 1280, + 1376, + 1378, + 1416, + 1417, + 1423, + 1528, + 1533, + 1550, + 1566, + 1570, + 1621 + ], + "mask": "Validation" + }, + { + "node_id": 1085, + "label": 4, + "text": "Core_International:core international core international inc. commonly known core multinational computer technology corporation headquartered boca raton florida united states company part sony longer exists stand-alone identity company founded 1979 hal prewitt technology firm develop market support computer related products services best known supporting ibm first business microcomputers 5100 5110 5120 introduction ibm pc pc company provided extensive line disk drives backup personal computer products core became well known leading industry developer disk array computer data storage many core products first kind direct competition widely regarded superior performance reliability users computer press raved core products infoworld described core atplus built like sherman tank offering exceptional performance reliability pc magazine called workhorses performance computing high-quality construction..breaks speed barrier access times asked manufactures follow suit core known advertising perhaps produced pc industry greatest promotions 1985 1986 rebate recall ad ibm pc hard disk drives successful controversial rumor topic ibm board directors meeting time gave away free ibm pc purchasing one core atplus 72 mb drives core remained private company solely owned prewitt 1993 purchased aiwa wholly owned subsidiary sony business history pre-incorporation company built early work prewitt using business personal computer development experiences period creation first microcomputers launch altair 8800 founding microsoft selling programming minicomputers assembling microcomputers attaching computer peripherals programming building business computer systems core created different business model initially marketed association structured for-profit organization specifically users ibm 5100 series ibm system/23 objective sell mail-order computer supplies pre-developed off-the-shelf programs hardware maintenance service supplies included printer ribbons paper diskettes tape cartridges software ranged simple mortgage interest calculations word processing games utilities advanced payroll accounting industry specific applications users wanted readily available simple install support software also low cost core able fill niche ibm developed machines engineering scientific applications mind business programs construction agriculture manufacturing generally available computer maintenance insurance program provided on-site repairs replacement parts provided ibm service lower cost available directly ibm company successful attracting users ibm 5100 series many ibm sales representatives referred customers organization core grew profits used continuing development computer data storage ibm machines closed architecture design information unpublished held secret computer systems design extremely likely impossible ability swap components obtain support vendors upgrade better configuration/another model unless option available original manufacturer limitations make customer dependent one vendor products services software hardware parts system core sensed opportunity provide greater faster computer data storage five-year effort september 1982 announced availability first hard disk drives local area network lan ibm 5100 series ibm systems sold storage limited without network option 5100 tape 5110 5120 restricted 1.2 mb floppy disks core drives available starting 10 mb increased 160 mb removable fixed configurations corenet lan built core storage system allowed interconnection eight ibm 5100 series systems providing ability share storage data configuration pre-dated lans period ibm pc compatibles 1983 core introduced two major solutions ibm withdrawing marketing ibm 5100 series first software called pc51 would run allowed 5100 series computer programs written basic run unmodified ibm pc compatibles ms-dos second lan card ibm pc compatibles provided connection ibm 5100 series network solutions allowed ibm 5110/5120 series users add new technology increase productivity retaining investment equipment software core development storage systems lan pc51 software major technology engineering feat without rivals due complexity successful reverse engineering systems resulted captive market organization able provide upgrade path ibm owners 1984 core expanded product focus entered personal computer pc marketplace company first product introduced year called pc-51 completely new operating system language ibm pc compatibles enabled pc function like ibm 5110/5120 system demonstrating company strong software development capabilities allow users continue using application software already developed increased processing speed factor two ten times reduced maintenance cost 90 new product opened unexplored marketplace core allowing company become ibm value-added dealer vad sell ibm pc core products individually combined package ibm authorized promoted relationship provided upgrade path customers previously unavailable result early development effort ibm 5100 series core released family high-performance hard disk drives called atplus series better capacity reliability performance ibm drives weeks introduction new ibm august 1984 core discovered problems factory-issued hard disk drive media marketplace learned ibm disk problems core unique position capitalize opportunity without significant competition six months ibm model cmi short supply delays attributed lack drives technical problems machine undisclosed issues core desired major partner selected control data corporation cdc assist introduction drives pc marketplace announcement made february 1985 generated significant amount press coverage core discovered general lack understanding existed among news media users regarding technology different computer mass storage systems understood value different systems end-user rate many choices marketplace response core began placing considerable emphasis user education resulted major contribution computer industry directly efforts news media computer magazines product reviewers dealers computer manufactures started discussing providing promoting seek time access time transfer time value understand hard disk drives importance computer system company believed end-users learned computers engineering behind core products less users wanted product purchasers ibm reporting dealers installing inferior drives computer without disclosing fact help buyers industry education core developed diskp program later replaced coretest dos based identify sub-standard products providing visual demonstration speed comparative measurements hard disk drives controllers many computer publications hardware manufacturers distributors dealers independent evaluation firms relied coretest product comparison made coretest industry standard often quoted benchmark programs provide without charge freely available bbs computer magazines dealers believed installed base million copies worldwide promoting core technology education two years newspapers magazines computer publications ran stories ibm computer memories inc. cmi hard disk drives problems", + "neighbors": [ + 272, + 494, + 854, + 868, + 1289, + 1304 + ], + "mask": "Validation" + }, + { + "node_id": 1086, + "label": 3, + "text": "Dynamite_Dan:dynamite dan dynamite dan platform game written rod bowkett zx spectrum published mirrorsoft 1985 ported amstrad cpc commodore 64 msx sequel dynamite dan 2 released following year gameplay similar jet set willy highly rated game time game starts dan lands airship top evil dr blitzen hideout aim game find eight sticks dynamite placed randomly around playing area whilst avoiding perils game moving monsters drowning falling great heights dan eight sticks dynamite player must make way central safe blow open steal plans evil doctor death ray escape airship playing area essentially one large building split multiple screens wrap around central elevator screen contains number moving monsters player moves destroyed take life return exception destroyed walked dr blitzen assistant donner donner blitzen located screen safe perils dan life include running energy caused collecting enough food falling heights hit laser beams dan also fall underground river flows beneath building player receive game unless dan picked oxygen case sent back start game completed game provides secret code deciphered telephone number call answer number longer works prize ride mirrorsoft blimp background music choosing game settings waiting game start third movement rondo alla turca wolfgang amadeus mozart piano sonata 11 major k. 331 readers crash magazine voted best platform game year zx spectrum version voted 24th best game time special issue sinclair magazine 2004", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1087, + "label": 2, + "text": "Z/VM:z/vm z/vm current version ibm vm family virtual machine operating systems z/vm first released october 2000 remains active use development directly based technology concepts dating back 1960s ibm cp/cms ibm system/360-67 see article history cp/cms historical details z/vm runs ibm system z family computers used support large numbers thousands linux virtual machines see linux z systems october 16 2018 ibm released z/vm version 7.1 requires z/architecture implemented ibm ec12 bc12 later models", + "neighbors": [ + 13, + 64, + 142, + 322, + 373, + 583, + 925, + 941, + 1012, + 1019, + 1053, + 1138, + 1208, + 1217, + 1232, + 1346, + 1363, + 1483, + 1546, + 1578 + ], + "mask": "Validation" + }, + { + "node_id": 1088, + "label": 4, + "text": "Integer_overflow:integer overflow computer programming integer overflow occurs arithmetic operation attempts create numeric value outside range represented given number digits \u2013 either larger maximum lower minimum representable value common result overflow least significant representable digits result stored result said wrap around maximum i.e modulo power radix usually two modern computers sometimes ten another radix overflow condition may give results leading unintended behavior particular possibility anticipated overflow compromise program reliability security applications timers clocks wrapping overflow desirable c11 standard states unsigned integers modulo wrapping defined behavior term overflow never applies computation involving unsigned operands never overflow processors like graphics processing units gpus digital signal processors dsps support saturation arithmetic overflowed results would clamped i.e set minimum maximum value representable range rather wrapped around register width processor determines range values represented registers though vast majority computers perform multiple-precision arithmetic operands memory allowing numbers arbitrarily long overflow avoided register width limits sizes numbers operated e.g added subtracted using single instruction per operation typical binary register widths unsigned integers include arithmetic operation produces result larger maximum n-bit integer overflow reduces result modulo n-th power 2 retaining least significant bits result effectively causing wrap around particular multiplying adding two integers may result value unexpectedly small subtracting small integer may cause wrap large positive value example 8-bit integer addition 255 2 results 1 similarly subtraction 0 \u2212 1 results 255 two complement representation \u22121 wraparound may cause security problems\u2014if overflowed value used number bytes allocate buffer buffer allocated unexpectedly small potentially leading buffer overflow depending usage buffer might turn cause arbitrary code execution variable signed integer type program may make assumption variable always contains positive value integer overflow cause value wrap become negative violates program assumption may lead unexpected behavior example 8-bit integer addition 127 1 results \u2212128 two complement 128 solution particular problem use unsigned integer types values program expects assumes never negative computers two dedicated processor flags check overflow conditions carry flag set result addition subtraction considering operands result unsigned numbers fit given number bits indicates overflow carry borrow significant bit immediately following add carry subtract borrow operation would use contents flag modify register memory location contains higher part multi-word value overflow flag set result operation signed numbers sign one would predict signs operands e.g negative result adding two positive numbers indicates overflow occurred signed result represented two complement form would fit given number bits unsigned type ideal result operation outside types representable range returned result obtained wrapping event commonly defined overflow contrast c11 standard defines event overflow states computation involving unsigned operands never overflow ideal result integer operation outside types representable range returned result obtained clamping event commonly defined saturation usage varies whether saturation overflow eliminate ambiguity terms wrapping overflow saturating overflow used term underflow commonly used floating-point math integer math many references found integer underflow term integer underflow used means ideal result closer minus infinity output type representable value closest minus infinity term integer underflow used definition overflow may include types overflows may include cases ideal result closer positive infinity output type representable value closest positive infinity ideal result operation exact integer meaning overflow ambiguous edge cases consider case ideal result value 127.25 output type maximum representable value 127 overflow defined ideal value outside representable range output type case would classified overflow operations well defined rounding behavior overflow classification may need postponed rounding applied c11 standard defines conversions floating point integer must round toward zero c used convert floating point value 127.25 integer rounding applied first give ideal integer output 127 since rounded integer outputs range c standard would classify conversion overflow several methods handling overflow programming languages implement various mitigation methods accidental overflow ada seed7 certain variants functional languages trigger exception condition overflow python since 2.4 seamlessly converts internal representation number match growth eventually representing codice_1 \u2013 whose ability limited available memory run-time overflow detection implementation codice_2 also available c compilers languages native support arbitrary-precision arithmetic type safety python common lisp numbers promoted larger size automatically overflows occur exceptions thrown conditions signaled range constraint exists using languages may thus helpful mitigate issue however languages situations still possible integer overflow occur example explicit optimization code path considered bottleneck profiler case common lisp possible using explicit declaration type-annotate variable machine-size word fixnum lower type safety level zero particular code block java 8 overloaded methods example like throw case overflow computer emergency response team cert developed as-if infinitely ranged air integer model largely automated mechanism eliminate integer overflow truncation c/c++ using run-time error handling computer graphics signal processing typical work data ranges 0 1 \u22121 1 example grayscale image 0 represents black 1 represents white values in-between represent varying shades gray one operation one may want support brightening image multiplying every pixel constant saturated arithmetic allows one blindly multiply every pixel constant without worrying overflow sticking reasonable outcome pixels larger 1 i.e brighter white become white values darker black become black unanticipated arithmetic overflow fairly common cause program errors overflow bugs may hard discover diagnose may manifest large input data sets less likely used validation tests taking arithmetic mean two numbers adding dividing two done many search algorithms causes error sum although resulting mean large represented hence overflows unhandled arithmetic overflow engine steering software primary cause crash 1996 maiden flight ariane 5 rocket software considered bug-free since used many previous flights used smaller rockets generated lower acceleration ariane 5 frustratingly part software overflow error occurred even required running ariane 5 time caused rocket fail\u2014it launch-regime process smaller predecessor ariane 5 remained software adapted new rocket furthermore actual cause failure flaw engineering specification software dealt overflow detected diagnostic dump bus would connected test equipment software testing development connected rocket steering motors flight data dump drove engine nozzle hard one side put rocket aerodynamic control precipitated rapid breakup air 30 april 2015 federal aviation authority announced order boeing 787 operators reset electrical system periodically avoid integer overflow could lead loss electrical power ram air turbine deployment boeing deployed software update fourth quarter european aviation safety agency followed 4 may 2015 error happens 2\u00b3\u00b9 centiseconds 2^31/100/3600/24 days indicating 32-bit signed integer overflow bugs evident computer games arcade game donkey kong impossible advance past level 22 due integer overflow time/bonus game takes level number user multiplies 10 adds 40 reach level 22 time/bonus number 260 large 8-bit 256 value register resets 0 gives remaining 4 time/bonus \u2013 short finish level donkey kong jr math trying calculate number 10000 shows first 4 digits overflow cause famous split-screen level pac-man nuclear gandhi civilization also caused far lands minecraft existed infdev development period beta 1.7.3 however later fixed beta 1.8 still exists pocket edition windows 10 edition versions minecraft super nintendo game lamborghini american challenge player cause amount money drop 0 race fined limit remaining money paying fee race glitches integer grants player 65,535,000 would going negative similar glitch occurs player drop negative amount fast travelling without sufficient funds proceeding event player gets robbed currency taken away game attempts take players money away amount 0 player granted 2147482963 game currency microsoft ibm macro assembler masm version 1.00 likely programs built pascal compiler integer overflow signedness error stack setup code prevented running newer dos machines emulators common configurations 512 kb memory program either hangs displays error message exits dos 2014 music video psy gangnam style received many views youtube breached maximum possible viewership number within signed 32-bit integer youtube subsequently amended maximum count 64-bit integer august 2016 casino machine resorts world casino printed prize ticket 42,949,672.76 result overflow bug casino refused pay amount calling malfunction using defense machine clearly stated maximum payout 10,000 prize higher result programming bug iowa supreme court ruled favor casino", + "neighbors": [ + 65, + 225, + 270, + 306, + 308, + 509, + 577, + 655, + 828, + 1028, + 1225, + 1310, + 1430, + 1453, + 1503 + ], + "mask": "Test" + }, + { + "node_id": 1089, + "label": 4, + "text": "FREAK:freak freak factoring rsa export keys security exploit cryptographic weakness ssl/tls protocols introduced decades earlier compliance u.s. cryptography export regulations involved limiting exportable software use public key pairs rsa moduli 512 bits less so-called rsa_export keys intention allowing broken easily national security agency nsa organizations lesser computing resources however early 2010s increases computing power meant could broken anyone access relatively modest computing resources using well-known number field sieve algorithm using little 100 cloud computing services combined ability man-in-the-middle attack manipulate initial cipher suite negotiation endpoints connection fact finished hash depended master secret meant man-in-the-middle attack modest amount computation could break security website allowed use 512-bit export-grade keys exploit discovered 2015 underlying vulnerabilities present many years dating back 1990s flaw found researchers imdea software institute inria microsoft research freak attack openssl identifier vulnerable software devices included apple safari web browser default browser google android operating system microsoft internet explorer openssl microsoft also stated schannel implementation transport-layer encryption vulnerable version freak attack versions microsoft windows cve id microsoft vulnerability schannel cve id apple vulnerability secure transport sites affected vulnerability included us federal government websites fbi.gov whitehouse.gov nsa.gov around 36 https-using websites tested one security group shown vulnerable exploit based geolocation analysis using ip2location lite 35 vulnerable servers located us press reports exploit described effects potentially catastrophic unintended consequence us government efforts control spread cryptographic technology vendors process releasing new software would fix flaw march 9 2015 apple released security updates ios 8 os x operating systems fixed flaw march 10 2015 microsoft released patch fixed vulnerability supported versions windows server 2003 vista later google chrome 41 opera 28 also mitigated flaw mozilla firefox vulnerable flaw research paper explaining flaw published 36th ieee symposium security privacy awarded distinguished paper award", + "neighbors": [ + 88, + 172, + 235, + 260, + 261, + 319, + 533, + 539, + 542, + 554, + 611, + 692, + 826, + 858, + 961, + 1003, + 1228, + 1240, + 1331, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 1090, + "label": 4, + "text": "Computer_virus:computer virus computer virus type malware executed replicates modifying computer programs inserting code replication succeeds affected areas said infected computer virus virus writers use social engineering deceptions exploit detailed knowledge security vulnerabilities initially infect systems spread virus vast majority viruses target systems running microsoft windows employing variety mechanisms infect new hosts often using complex anti-detection/stealth strategies evade antivirus software motives creating viruses include seeking profit e.g. ransomware desire send political message personal amusement demonstrate vulnerability exists software sabotage denial service simply wish explore cybersecurity issues artificial life evolutionary algorithms computer viruses currently cause billions dollars worth economic damage year due causing system failure wasting computer resources corrupting data increasing maintenance costs stealing personal information etc response free open-source antivirus tools developed industry antivirus software cropped selling freely distributing virus protection users various operating systems even though currently existing antivirus software able uncover computer viruses especially new ones computer security researchers actively searching new ways enable antivirus solutions effectively detect emerging viruses already become widely distributed term virus also misused extension refer types malware malware encompasses computer viruses along many forms malicious software computer worms ransomware spyware adware trojan horses keyloggers rootkits bootkits malicious browser helper object bhos malicious software majority active malware threats actually trojan horse programs computer worms rather computer viruses term computer virus coined fred cohen 1985 misnomer viruses often perform type harmful activity infected host computers acquisition hard disk space central processing unit cpu time accessing private information e.g. credit card numbers corrupting data displaying political humorous messages user screen spamming e-mail contacts logging keystrokes even rendering computer useless however viruses carry destructive payload attempt hide themselves\u2014the defining characteristic viruses self-replicating computer programs modify software without user consent first academic work theory self-replicating computer programs done 1949 john von neumann gave lectures university illinois theory organization complicated automata work von neumann later published theory self-reproducing automata essay von neumann described computer program could designed reproduce von neumann design self-reproducing computer program considered world first computer virus considered theoretical father computer virology 1972 veith risak directly building von neumann work self-replication published article selbstreproduzierende automaten mit minimaler informations\u00fcbertragung self-reproducing automata minimal information exchange article describes fully functional virus written assembler programming language siemens 4004/35 computer system 1980 j\u00fcrgen kraus wrote diplom thesis selbstreproduktion bei programmen self-reproduction programs university dortmund work kraus postulated computer programs behave way similar biological viruses first known description self-reproducing program short story occurs 1970 story gregory benford describes computer program called virus installed computer telephone modem dialling capability randomly dials phone numbers hit modem answered another computer attempts program answering computer program second computer also begin dialling random numbers search yet another computer program program rapidly spreads exponentially susceptible computers countered second program called vaccine idea explored two 1972 novels harlie one david gerrold terminal man michael crichton became major theme 1975 novel shockwave rider john brunner 1973 michael crichton sci-fi movie westworld made early mention concept computer virus central plot theme causes androids run amok alan oppenheimer character summarizes problem stating ... clear pattern suggests analogy infectious disease process spreading one ... area next replies stated perhaps superficial similarities disease must confess find difficult believe disease machinery creeper virus first detected arpanet forerunner internet early 1970s creeper experimental self-replicating program written bob thomas bbn technologies 1971 creeper used arpanet infect dec pdp-10 computers running tenex operating system creeper gained access via arpanet copied remote system message 'm creeper catch displayed reaper program created delete creeper 1982 program called elk cloner first personal computer virus appear wild \u2014that outside single computer computer lab created written 1981 richard skrenta ninth grader mount lebanon high school near pittsburgh attached apple dos 3.3 operating system spread via floppy disk 50th use elk cloner virus would activated infecting personal computer displaying short poem beginning elk cloner program personality 1984 fred cohen university southern california wrote paper computer viruses \u2013 theory experiments first paper explicitly call self-reproducing program virus term introduced cohen mentor leonard adleman 1987 fred cohen published demonstration algorithm perfectly detect possible viruses fred cohen theoretical compression virus example virus malicious software malware putatively benevolent well-intentioned however antivirus professionals accept concept benevolent viruses desired function implemented without involving virus automatic compression instance available windows operating system choice user virus definition make unauthorised changes computer undesirable even damage done intended page one dr solomon virus encyclopaedia undesirability viruses even nothing reproduce thoroughly explained article describes useful virus functionalities published j b. gunn title use virus functions provide virtual apl interpreter user control 1984 first ibm pc virus wild boot sector virus dubbed c brain created 1986 farooq alvi brothers lahore pakistan reportedly deter unauthorized copying software written first virus specifically target microsoft windows winvir discovered april 1992 two years release windows 3.0 virus contain windows api calls instead relying dos interrupts years later february 1996 australian hackers virus-writing crew vlad created bizatch virus also known boza virus first known virus target windows 95 late 1997 encrypted memory-resident stealth virus win32.cabanas released\u2014the first known virus targeted windows nt also able infect windows 3.0 windows 9x hosts even home computers affected viruses first one appear commodore amiga boot sector virus called sca virus detected november 1987 viable computer virus must contain search routine locates new files new disks worthwhile targets infection secondly every computer virus must contain routine copy program search routine locates three main virus parts infection mechanism also called 'infection vector virus spreads propagates virus typically search routine locates new files new disks infection trigger also known logic bomb compiled version could activated time within executable file virus run determines event condition malicious payload activated delivered particular date particular time particular presence another program capacity disk exceeding limit double-click opens particular file payload actual body data performs actual malicious purpose virus payload activity might noticeable e.g. causes system slow freeze time payload harmful activity times non-destructive distributive called virus hoax virus phases life cycle computer virus described using analogy biology life cycle divided four phases virus program idle stage virus program managed access target user computer software stage virus take action virus eventually activated trigger states event execute virus date presence another program file capacity disk exceeding limit user taking certain action e.g. double-clicking certain icon opening e-mail etc. viruses stage virus starts propagating multiplying replicating virus places copy programs certain system areas disk copy may identical propagating version viruses often morph change evade detection professionals anti-virus software infected program contain clone virus enter propagation phase dormant virus moves phase activated perform function intended triggering phase caused variety system events including count number times copy virus made copies actual work virus payload released destructive deleting files disk crashing system corrupting files relatively harmless popping humorous political messages screen computer viruses infect variety different subsystems host computers software one manner classifying viruses analyze whether reside binary executables .exe .com files data files microsoft word documents pdf files boot sector host hard drive combination memory-resident virus simply resident virus installs part operating system executed remains ram time computer booted shut resident viruses overwrite interrupt handling code functions operating system attempts access target file disk sector virus code intercepts request redirects control flow replication module infecting target contrast non-memory-resident virus non-resident virus executed scans disk targets infects exits i.e remain memory done executing many common applications microsoft outlook microsoft word allow macro programs embedded documents emails programs may run automatically document opened macro virus document virus virus written macro language embedded documents users open file virus code executed infect user computer one reasons dangerous open unexpected suspicious attachments e-mails opening attachments e-mails unknown persons organizations help reduce likelihood contracting virus cases virus designed e-mail appears reputable organization e.g. major bank credit card company boot sector viruses specifically target boot sector and/or master boot record mbr host hard disk drive solid-state drive removable storage media flash drives floppy disks etc. email viruses viruses intentionally rather accidentally uses email system spread virus infected files may accidentally sent email attachments email viruses aware email system functions generally target specific type email system microsoft outlook commonly used harvest email addresses various sources may append copies email sent may generate email messages containing copies attachments order avoid detection users viruses employ different kinds deception old viruses especially dos platform make sure last modified date host file stays file infected virus approach fool antivirus software however especially maintain date cyclic redundancy checks file changes viruses infect files without increasing sizes damaging files accomplish overwriting unused areas executable files called cavity viruses example cih virus chernobyl virus infects portable executable files files many empty gaps virus 1 kb length add size file viruses try avoid detection killing tasks associated antivirus software detect example conficker 2010s computers operating systems grow larger complex old hiding techniques need updated replaced defending computer viruses may demand file system migrate towards detailed explicit permission every kind file access kinds antivirus software employ various techniques counter stealth mechanisms infection occurs recourse clean system unreliable microsoft windows operating systems ntfs file system proprietary leaves antivirus software little alternative send read request windows os files handle requests viruses trick antivirus software intercepting requests operating system os virus hide intercepting request read infected file handling request returning uninfected version file antivirus software interception occur code injection actual operating system files would handle read request thus antivirus software attempting detect virus either given permission read infected file read request served uninfected version file reliable method avoid stealth viruses reboot medium known clear security software used check dormant operating system files security software relies virus signatures employ heuristics security software may also use database file hashes windows os files security software identify altered files request windows installation media replace authentic versions older versions windows file cryptographic hash functions windows os files stored windows\u2014to allow file integrity/authenticity checked\u2014could overwritten system file checker would report altered system files authentic using file hashes scan altered files would always guarantee finding infection modern antivirus programs try find virus-patterns inside ordinary programs scanning so-called virus signatures unfortunately term misleading viruses possess unique signatures way human beings virus signature merely sequence bytes antivirus program looks known part virus better term would search strings different antivirus programs employ different search strings indeed different search methods identifying viruses virus scanner finds pattern file perform checks make sure found virus merely coincidental sequence innocent file notifies user file infected user delete cases clean heal infected file viruses employ techniques make detection means signatures difficult probably impossible viruses modify code infection infected file contains different variant virus one method evading signature detection use simple encryption encipher encode body virus leaving encryption module static cryptographic key cleartext change one infection next case virus consists small decrypting module encrypted copy virus code virus encrypted different key infected file part virus remains constant decrypting module would example appended end case virus scanner directly detect virus using signatures still detect decrypting module still makes indirect detection virus possible since would symmetric keys stored infected host entirely possible decrypt final virus probably required since self-modifying code rarity may reason virus scanners least flag file suspicious old compact way use arithmetic operation like addition subtraction use logical conditions xoring byte virus constant exclusive-or operation repeated decryption suspicious code modify code encryption/decryption may part signature many virus definitions simpler older approach use key encryption consisted operations parameters like incrementing decrementing bitwise rotation arithmetic negation logical viruses called polymorphic viruses employ means encryption inside executable virus encrypted certain events virus scanner disabled updates computer rebooted called cryptovirology said times executable decrypt virus execute hidden runtimes infecting computer sometimes disabling antivirus software polymorphic code first technique posed serious threat virus scanners like regular encrypted viruses polymorphic virus infects files encrypted copy decoded decryption module case polymorphic viruses however decryption module also modified infection well-written polymorphic virus therefore parts remain identical infections making difficult detect directly using signatures antivirus software detect decrypting viruses using emulator statistical pattern analysis encrypted virus body enable polymorphic code virus polymorphic engine also called mutating engine mutation engine somewhere encrypted body see polymorphic code technical detail engines operate viruses employ polymorphic code way constrains mutation rate virus significantly example virus programmed mutate slightly time programmed refrain mutating infects file computer already contains copies virus advantage using slow polymorphic code makes difficult antivirus professionals investigators obtain representative samples virus bait files infected one run typically contain identical similar samples virus make likely detection virus scanner unreliable instances virus may able avoid detection avoid detected emulation viruses rewrite completely time infect new executables viruses utilize technique said metamorphic code enable metamorphism metamorphic engine needed metamorphic virus usually large complex example w32/simile consisted 14,000 lines assembly language code 90 part metamorphic engine software often designed security features prevent unauthorized use system resources many viruses must exploit manipulate security bugs security defects system application software spread infect computers software development strategies produce large numbers bugs generally also produce potential exploitable holes entrances virus order replicate virus must permitted execute code write memory reason many viruses attach executable files may part legitimate programs see code injection user attempts launch infected program virus code may executed simultaneously operating systems use file extensions determine program associations microsoft windows extensions may hidden user default makes possible create file different type appears user example executable may created named picture.png.exe user sees picture.png therefore assumes file digital image likely safe yet opened runs executable client machine vast majority viruses target systems running microsoft windows due microsoft large market share desktop computer users diversity software systems network limits destructive potential viruses malware open-source operating systems linux allow users choose variety desktop environments packaging tools etc. means malicious code targeting systems affect subset users many windows users running set applications enabling viruses rapidly spread among microsoft windows systems targeting exploits large numbers hosts linux unix general always natively prevented normal users making changes operating system environment without permission windows users generally prevented making changes meaning viruses easily gain control entire system windows hosts difference continued partly due widespread use administrator accounts contemporary versions like windows xp 1997 researchers created released virus linux\u2014known bliss bliss however requires user run explicitly infect programs user access modify unlike windows users unix users log administrator root user except install configure software result even user ran virus could harm operating system bliss virus never became widespread remains chiefly research curiosity creator later posted source code usenet allowing researchers see worked many users install antivirus software detect eliminate known viruses computer attempts download run executable file may distributed email attachment usb flash drives example antivirus software blocks known malicious websites attempt install malware antivirus software change underlying capability hosts transmit viruses users must update software regularly patch security vulnerabilities holes antivirus software also needs regularly updated order recognize latest threats malicious hackers individuals always creating new viruses german av-test institute publishes evaluations antivirus software windows android examples microsoft windows anti virus anti-malware software include optional microsoft security essentials windows xp vista windows 7 real-time protection windows malicious software removal tool included windows security updates patch tuesday second tuesday month windows defender optional download case windows xp additionally several capable antivirus software programs available free download internet usually restricted non-commercial use free programs almost good commercial competitors common security vulnerabilities assigned cve ids listed us national vulnerability database secunia psi example software free personal use check pc vulnerable out-of-date software attempt update ransomware phishing scam alerts appear press releases internet crime complaint center noticeboard ransomware virus posts message user screen saying screen system remain locked unusable ransom payment made phishing deception malicious individual pretends friend computer security expert benevolent individual goal convincing targeted individual reveal passwords personal information commonly used preventative measures include timely operating system updates software updates careful internet browsing avoiding shady websites installation trusted software certain browsers flag sites reported google confirmed hosting malware google two common methods antivirus software application uses detect viruses described antivirus software article first far common method virus detection using list virus signature definitions works examining content computer memory random access memory ram boot sectors files stored fixed removable drives hard drives floppy drives usb flash drives comparing files database known virus signatures virus signatures strings code used identify individual viruses virus antivirus designer tries choose unique signature string found legitimate program different antivirus programs use different signatures identify viruses disadvantage detection method users protected viruses detected signatures recent virus definition update protected new viruses see zero-day attack second method find viruses use heuristic algorithm based common virus behaviors method ability detect new viruses antivirus security firms yet define signature also gives rise false positives using signatures false positives disruptive especially commercial environment may lead company instructing staff use company computer system services checked system viruses slow productivity regular workers one may reduce damage done viruses making regular backups data operating systems different media either kept unconnected system time hard drive read-only accessible reasons using different file systems way data lost virus one start using backup hopefully recent backup session optical media like cd dvd closed becomes read-only longer affected virus long virus infected file copied onto cd/dvd likewise operating system bootable cd used start computer installed operating systems become unusable backups removable media must carefully inspected restoration gammima virus example propagates via removable flash drives many websites run antivirus software companies provide free online virus scanning limited cleaning facilities purpose websites sell antivirus products services websites\u2014like google subsidiary virustotal.com\u2014allow users upload one suspicious files scanned checked one antivirus programs one operation additionally several capable antivirus software programs available free download internet usually restricted non-commercial use microsoft offers optional free antivirus utility called microsoft security essentials windows malicious software removal tool updated part regular windows update regime older optional anti-malware malware removal tool windows defender upgraded antivirus product windows 8 viruses disable system restore important windows tools task manager cmd example virus ciadoor many viruses removed rebooting computer entering windows safe mode networking using system tools microsoft safety scanner system restore windows windows xp windows vista windows 7 restore registry critical system files previous checkpoint often virus cause system hang freeze subsequent hard reboot render system restore point day corrupted restore points previous days work provided virus designed corrupt restore files exist previous restore points microsoft system file checker improved windows 7 later used check repair corrupted system files restoring earlier clean virus-free copy entire partition cloned disk disk image backup copy one solution\u2014restoring earlier backup disk image relatively simple usually removes malware may faster disinfecting computer\u2014or reinstalling reconfiguring operating system programs scratch described restoring user preferences reinstalling operating system another approach virus removal may possible recover copies essential user data booting live cd connecting hard drive another computer booting second computer operating system taking great care infect computer executing infected programs original drive original hard drive reformatted os programs installed original media system restored precautions must taken avoid reinfection restored executable files computer networks became widespread viruses spread removable media particularly floppy disks early days personal computer many users regularly exchanged information programs floppies viruses spread infecting programs stored disks others installed disk boot sector ensuring would run user booted computer disk usually inadvertently personal computers era would attempt boot first floppy one left drive floppy disks fell use successful infection strategy boot sector viruses common wild many years traditional computer viruses emerged 1980s driven spread personal computers resultant increase bulletin board system bbs modem use software sharing bulletin board\u2013driven software sharing contributed directly spread trojan horse programs viruses written infect popularly traded software shareware bootleg software equally common vectors viruses bbss viruses increase chances spreading computers infecting files network file system file system accessed computers macro viruses become common since mid-1990s viruses written scripting languages microsoft programs microsoft word microsoft excel spread throughout microsoft office infecting documents spreadsheets since word excel also available mac os could also spread macintosh computers although viruses ability send infected email messages viruses take advantage microsoft outlook component object model com interface old versions microsoft word allow macros replicate additional blank lines two macro viruses simultaneously infect document combination two also self-replicating appear mating two would likely detected virus unique parents virus may also send web address link instant message contacts e.g. friends colleagues e-mail addresses stored infected machine recipient thinking link friend trusted source follows link website virus hosted site may able infect new computer continue propagating viruses spread using cross-site scripting first reported 2002 academically demonstrated 2005 multiple instances cross-site scripting viruses wild exploiting websites myspace samy worm yahoo", + "neighbors": [ + 11, + 78, + 103, + 134, + 144, + 149, + 166, + 171, + 190, + 232, + 233, + 260, + 270, + 293, + 297, + 310, + 326, + 338, + 343, + 349, + 363, + 365, + 373, + 379, + 413, + 429, + 439, + 450, + 479, + 487, + 490, + 491, + 494, + 495, + 503, + 518, + 528, + 531, + 550, + 564, + 576, + 617, + 621, + 624, + 666, + 692, + 698, + 703, + 739, + 740, + 741, + 746, + 750, + 751, + 763, + 780, + 800, + 815, + 818, + 868, + 898, + 938, + 961, + 1036, + 1039, + 1112, + 1138, + 1162, + 1213, + 1246, + 1287, + 1303, + 1309, + 1325, + 1355, + 1358, + 1361, + 1365, + 1368, + 1379, + 1444, + 1467, + 1472, + 1504, + 1514, + 1535, + 1542, + 1543, + 1554, + 1573, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1091, + "label": 7, + "text": "Apache_ZooKeeper:apache zookeeper apache zookeeper software project apache software foundation essentially service distributed systems offering hierarchical key-value store used provide distributed configuration service synchronization service naming registry large distributed systems zookeeper sub-project hadoop top-level apache project right zookeeper architecture supports high availability redundant services clients thus ask another zookeeper leader first fails answer zookeeper nodes store data hierarchical name space much like file system tree data structure clients read write nodes way shared configuration service zookeeper viewed atomic broadcast system updates totally ordered zookeeper atomic broadcast zab protocol core system zookeeper used companies including yelp rackspace yahoo odnoklassniki reddit netapp solidfire facebook twitter ebay well open source enterprise search systems like solr zookeeper originally developed yahoo streamlining processes running big-data clusters storing status local log files zookeeper servers servers communicate client machines provide information zookeeper developed order fix bugs occurred deploying distributed big-data applications prime features apache zookeeper common terminologies regarding zookeeper architecture services cluster replicated stored set servers called ensemble maintains in-memory database containing entire data tree state well transaction log snapshots stored persistently multiple client applications connect server client maintains tcp connection sends requests heartbeats receives responses watch events monitoring addition client libraries included zookeeper distribution number third-party libraries apache curator kazoo available make using zookeeper easier add additional functionality additional programming languages etc etc", + "neighbors": [ + 178, + 192, + 197, + 296, + 318, + 520, + 538, + 556, + 620, + 715, + 786, + 796, + 869, + 874, + 1138, + 1163, + 1246, + 1254, + 1454, + 1481, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 1092, + "label": 2, + "text": "Security_Account_Manager:security account manager security account manager sam often security accounts manager database file windows xp windows vista windows 7 8.1 10 stores users passwords used authenticate local remote users beginning windows 2000 sp4 active directory authenticates remote users sam uses cryptographic measures prevent unauthenticated users accessing system user passwords stored hashed format registry hive either lm hash ntlm hash file found codice_1 mounted codice_2 attempt improve security sam database offline software cracking microsoft introduced syskey function windows nt 4.0 syskey enabled on-disk copy sam file partially encrypted password hash values local accounts stored sam encrypted key usually also referred syskey enabled running codice_3 program since hash function one-way provides measure security storage passwords case online attacks possible simply copy sam file another location sam file moved copied windows running since windows kernel obtains keeps exclusive filesystem lock sam file release lock operating system shut blue screen death exception thrown however in-memory copy contents sam dumped using various techniques including pwdump making password hashes available offline brute-force attack lm hash compromised protocol replaced ntlm hash versions windows configured disable creation storage valid lm hashes user changes password windows vista later versions windows disable lm hash default note enabling setting immediately clear lm hash values sam rather enables additional check password change operations instead store dummy value location sam database lm hash otherwise stored dummy value relationship user password value used user accounts windows nt 3.51 nt 4.0 2000 attack devised bypass local authentication system sam file deleted hard drive e.g mounting windows os volume alternate operating system attacker could log account password flaw corrected windows xp shows error message shuts computer however exist software utilities aforementioned methodology using either emulated virtual drive boot disk usually unix/linux another copy windows like windows preinstallation environment based environment mount local drive housing active ntfs partition using programmed software routines function calls within assigned memory stacks isolate sam file windows nt system installation directory structure default codice_1 depending particular software utility used removes password hashes stored user accounts entirety cases modify user account passwords directly environment software highly pragmatic beneficial use password clearing account recovering utility individuals lost forgotten windows account passwords well possible use malicious software security bypassing utility essentially granting user enough ability experience familiarity cracking utility software security routines windows nt kernel well offline immediate local access target computer capability entirely bypass remove windows account passwords potential target computer recently microsoft released utility called locksmith part msdart msdart freely available end-users however", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1098, + 1109, + 1151, + 1212, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1093, + "label": 5, + "text": "NISO_Circulation_Interchange_Protocol:niso circulation interchange protocol niso circulation interchange protocol ncip protocol limited exchange messages among computer-based applications enable perform functions necessary lend borrow items provide controlled access electronic resources facilitate cooperative management functions released may 2001 approved october 17 2002 ansi/niso z39.83-2002 ncip niso draft standard trial use protocol defines repertoire messages associated rules syntax semantics use applications perform functions necessary lend items provide controlled access electronic resources facilitate co-operative management functions intended address conditions application applications initiate lending items control access must acquire transmit information user items and/or access essential successful conclusion function", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1094, + "label": 4, + "text": "Anti-Spam_SMTP_Proxy:anti-spam smtp proxy anti-spam smtp proxy assp open-source perl based platform-independent transparent smtp proxy server assp features", + "neighbors": [ + 617, + 620, + 741, + 796, + 1138, + 1172, + 1227, + 1249, + 1510, + 1548 + ], + "mask": "Test" + }, + { + "node_id": 1095, + "label": 9, + "text": "Niklaus_Wirth:niklaus wirth niklaus emil wirth born 15 february 1934 swiss computer scientist designed several programming languages including pascal pioneered several classic topics software engineering 1984 turing award generally recognized highest distinction computer science developing sequence innovative computer languages wirth born winterthur switzerland 1934 1959 earned degree electronics engineering swiss federal institute technology z\u00fcrich eth z\u00fcrich 1960 earned m.sc universit\u00e9 laval canada 1963 awarded ph.d. electrical engineering computer science eecs university california berkeley supervised computer designer pioneer harry huskey 1963 1967 served assistant professor computer science stanford university university zurich 1968 became professor informatics eth z\u00fcrich taking two one-year sabbaticals xerox parc california 1976\u20131977 1984\u20131985 wirth retired 1999 2004 made fellow computer history museum seminal work programming languages algorithms including euler algol-w pascal modula oberon wirth chief designer programming languages euler algol w pascal modula modula-2 oberon oberon-2 oberon-07 also major part design implementation team lilith oberon operating systems lola digital hardware design simulation system received association computing machinery acm turing award development languages 1984 1994 inducted fellow acm book written jointly kathleen jensen pascal user manual report served basis many language implementation efforts 1970s 1980s united states across europe article program development stepwise refinement teaching programming considered classic text software engineering 1975 wrote book algorithms data structures programs gained wide recognition major revisions book new title algorithms data structures published 1985 2004 examples first edition written pascal replaced later editions examples written modula-2 oberon respectively textbook systematic programming introduction considered good source students wanted coding regarded challenging text work sought imperative reading interested numerical mathematics 1992 published together j\u00fcrg gutknecht full documentation oberon os.. second book together martin reiser intended programmer guide 1995 popularized adage known wirth law states software getting slower rapidly hardware becomes faster 1995 paper plea lean software attributes martin reiser", + "neighbors": [ + 87, + 249, + 292, + 322, + 373, + 873, + 998, + 1138, + 1146, + 1152, + 1221, + 1324, + 1606 + ], + "mask": "Test" + }, + { + "node_id": 1096, + "label": 0, + "text": "Natural_language_processing:natural language processing natural language processing nlp subfield linguistics computer science information engineering artificial intelligence concerned interactions computers human natural languages particular program computers process analyze large amounts natural language data challenges natural language processing frequently involve speech recognition natural language understanding natural language generation history natural language processing nlp generally started 1950s although work found earlier periods 1950 alan turing published article titled computing machinery intelligence proposed called turing test criterion intelligence georgetown experiment 1954 involved fully automatic translation sixty russian sentences english authors claimed within three five years machine translation would solved problem however real progress much slower alpac report 1966 found ten-year-long research failed fulfill expectations funding machine translation dramatically reduced little research machine translation conducted late 1980s first statistical machine translation systems developed notably successful natural language processing systems developed 1960s shrdlu natural language system working restricted blocks worlds restricted vocabularies eliza simulation rogerian psychotherapist written joseph weizenbaum 1964 1966 using almost information human thought emotion eliza sometimes provided startlingly human-like interaction patient exceeded small knowledge base eliza might provide generic response example responding head hurts say head hurts 1970s many programmers began write conceptual ontologies structured real-world information computer-understandable data examples margie schank 1975 sam cullingford 1978 pam wilensky 1978 talespin meehan 1976 qualm lehnert 1977 politics carbonell 1979 plot units lehnert 1981 time many chatterbots written including parry racter jabberwacky 1980s natural language processing systems based complex sets hand-written rules starting late 1980s however revolution natural language processing introduction machine learning algorithms language processing due steady increase computational power see moore law gradual lessening dominance chomskyan theories linguistics e.g transformational grammar whose theoretical underpinnings discouraged sort corpus linguistics underlies machine-learning approach language processing earliest-used machine learning algorithms decision trees produced systems hard if-then rules similar existing hand-written rules however part-of-speech tagging introduced use hidden markov models natural language processing increasingly research focused statistical models make soft probabilistic decisions based attaching real-valued weights features making input data cache language models upon many speech recognition systems rely examples statistical models models generally robust given unfamiliar input especially input contains errors common real-world data produce reliable results integrated larger system comprising multiple subtasks many notable early successes occurred field machine translation due especially work ibm research successively complicated statistical models developed systems able take advantage existing multilingual textual corpora produced parliament canada european union result laws calling translation governmental proceedings official languages corresponding systems government however systems depended corpora specifically developed tasks implemented systems often continues major limitation success systems result great deal research gone methods effectively learning limited amounts data recent research increasingly focused unsupervised semi-supervised learning algorithms algorithms able learn data hand-annotated desired answers using combination annotated non-annotated data generally task much difficult supervised learning typically produces less accurate results given amount input data however enormous amount non-annotated data available including among things entire content world wide web often make inferior results algorithm used low enough time complexity practical 2010s representation learning deep neural network-style machine learning methods became widespread natural language processing due part flurry results showing techniques achieve state-of-the-art results many natural language tasks example language modeling parsing many others popular techniques include use word embeddings capture semantic properties words increase end-to-end learning higher-level task e.g. question answering instead relying pipeline separate intermediate tasks e.g. part-of-speech tagging dependency parsing areas shift entailed substantial changes nlp systems designed deep neural network-based approaches may viewed new paradigm distinct statistical natural language processing instance term neural machine translation nmt emphasizes fact deep learning-based approaches machine translation directly learn sequence-to-sequence transformations obviating need intermediate steps word alignment language modeling used statistical machine translation smt early days many language-processing systems designed hand-coding set rules e.g writing grammars devising heuristic rules stemming however rarely robust natural language variation since so-called statistical revolution late 1980s mid 1990s much natural language processing research relied heavily machine learning machine-learning paradigm calls instead using statistical inference automatically learn rules analysis large corpora typical real-world examples corpus plural corpora set documents possibly human computer annotations many different classes machine-learning algorithms applied natural-language-processing tasks algorithms take input large set features generated input data earliest-used algorithms decision trees produced systems hard if-then rules similar systems hand-written rules common increasingly however research focused statistical models make soft probabilistic decisions based attaching real-valued weights input feature models advantage express relative certainty many different possible answers rather one producing reliable results model included component larger system systems based machine-learning algorithms many advantages hand-produced rules following list commonly researched tasks natural language processing tasks direct real-world applications others commonly serve subtasks used aid solving larger tasks though natural language processing tasks closely intertwined frequently subdivided categories convenience coarse division given first published work artificial intelligence published 2018 1 road marketed novel contains sixty million words", + "neighbors": [ + 14, + 123, + 159, + 227, + 282, + 307, + 339, + 346, + 368, + 372, + 379, + 429, + 453, + 662, + 704, + 733, + 795, + 832, + 834, + 883, + 885, + 1007, + 1062, + 1128, + 1138, + 1142, + 1151, + 1159, + 1209, + 1225, + 1324, + 1372, + 1398, + 1440, + 1486, + 1549, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1097, + "label": 6, + "text": "Coda_(file_system):coda file system coda distributed file system developed research project carnegie mellon university since 1987 direction mahadev satyanarayanan descended directly older version andrew file system afs-2 offers many similar features intermezzo file system inspired coda coda many features desirable network file systems several features found elsewhere coda uses local cache provide access server data network connection lost normal operation user reads writes file system normally client fetches hoards data user listed important event network disconnection network connection lost coda client local cache serves data cache logs updates operating state called disconnected operation upon network reconnection client moves reintegration state sends logged updates servers transitions back normal connected-mode operation also different afs coda data replication method afs uses pessimistic replication strategy files allowing one read/write server receive updates servers acting read-only replicas coda allows servers receive updates allowing greater availability server data event network partitions case afs handle unique features introduce possibility semantically diverging copies files directories known conflicts disconnected operation local updates potentially clash connected users updates objects preventing reintegration optimistic replication potentially cause concurrent updates different servers object preventing replication former case called local/global conflict latter case server/server conflict coda extensive repair tools manual automated handle repair types conflicts coda developed linux support appeared 2.1 linux kernel series also ported freebsd subsequently obsoleted efforts way bring back efforts made port coda microsoft windows windows 95/windows 98 era windows nt windows xp means open source projects like djgcc dos c compiler cygwin", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1056, + 1064, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1287, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1098, + "label": 2, + "text": "Windows_Insider:windows insider windows insider open software testing program microsoft allows users valid license windows 10 windows server 2016 register pre-release builds operating system previously accessible software developers microsoft launched windows insider developers enterprise testers technically able test new developer features pre-release software builds given publicly released gather low level diagnostics feedback order identify investigate mitigate improve windows 10 os help support guidance insider program participants direct communication microsoft engineers via proprietary communication diagnostic channel announced september 30 2014 along windows 10 september 2015 7 million people took part windows insider program february 12 2015 microsoft started test previews windows 10 mobile microsoft announced windows insider program would continue beyond official release windows 10 future updates gabriel aul previous head charge windows insider program current head windows insider program dona sarkar similar windows insider program microsoft office bing xbox visual studio code teams set insider programs microsoft originally launched windows insider enterprise testers technically able test new developer features gather feedback improve features built windows 10 time official launch windows 10 pcs total 5 million volunteers registered windows 10 windows 10 mobile also among first people receive official update windows 10 release windows 10 windows insider app merged settings app made ability install windows insider preview builds optional feature could accessed directly within windows 10 may 2017 microsoft announced program would extend windows server 2016 first insider build operating system released 13 july 2017 windows 10 insider preview updates delivered testers different rings logical categories windows insiders fast ring receive updates prior windows insiders slow ring might experience bugs issues february 2016 microsoft introduced new rings windows insider preview july 17 2017 reports began come windows 10 creators update refused install pcs tablets sporting intel atom clover trail processors first appeared though might temporary block microsoft hardware partners work fix issues preventing operating system run well however microsoft later confirmed devices running clover trail intel atom processors would receiving creators update processors longer supported intel appropriate firmware properly run versions windows 10 newer anniversary update following processors longer supported remain windows 10 anniversary update pcs unsupported processors could receive new features updates microsoft agreed extend support pcs bug fixes security updates latest compatible version windows 10 versions windows 10 released microprocessor released also supported installations operating systems may actively blocked example windows 10 version 1507 ltsb install kaby lake processors microsoft initially launched windows 10 technical preview certain third-generation x30 series phones lumia family subsequently released second-generation x20 series devices throughout testing phase hacked non-lumia phones supported time download preview builds microsoft responded blocking unsupported models roll back installed technical preview back windows phone 8.1 microsoft launched windows device recovery tool removes windows 10 recovers latest officially released software firmware preview build 10080 released may 14 2015 first support non-lumia device htc one m8 windows followed xiaomi partnership microsoft released rom port windows 10 flagship mi 4 handset june 1 2015 time limited certain registered users china build 10080 follow-up build 10166 also added support fourth-generation lumia x40 series devices result compatible windows phone 8 later lumia phones support preview august 2015 microsoft stated windows phone devices including microsoft new hardware partners announced previous year would receive final version windows 10 mobile would receive preview builds insider program however company provide information time whether new devices would added preview program microsoft instead focused promoting new devices come windows 10 mobile including lumia 950 lumia 950 xl flagships low-cost lumia 550 lumia 650 since release new windows 10 devices became eligible receive future updates advance via insider program beginning build 10586 december 4 2015 windows-based lg lancet also received version upgraded since february 19 2016 microsoft released first windows 10 mobile redstone preview build 14267 starting build future preview versions became exclusively available devices already running non-insider preview os except mi4 rom version followed build 14291 released existing windows 10 devices march 17 2016 conjunction official rtm release windows 10 mobile third fourth-generation lumias following week became available newly upgraded older lumias addition several devices already windows 10 mobile time supported devices subsequently received insider preview builds far build 15063 creators update released march 20 2017 included official release build 14393 anniversary update august 2 2016 however announced april 2017 many devices including third-generation lumias would receive rtm version creators update redstone development builds following feedback users devices remain supported nearly except lumia 640 xl variant originally come windows 10 mobile instead windows phone 8.1", + "neighbors": [ + 26, + 66, + 79, + 93, + 108, + 111, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 647, + 662, + 689, + 705, + 791, + 801, + 865, + 884, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1109, + 1138, + 1151, + 1193, + 1212, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1555, + 1561, + 1582, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1099, + "label": 3, + "text": "Scalability:scalability scalability property system handle growing amount work adding resources system economic context scalable business model implies company increase sales given increased resources example package delivery system scalable packages delivered adding delivery vehicles however packages first pass single warehouse sorting system would scalable one warehouse handle limited number packages computing scalability characteristic computers networks algorithms networking protocols programs applications example search engine must support increasing numbers users number topics indexes incident command system ics emergency management system used across emergency response agencies united states ics scale resource coordination single-engine roadside brushfire interstate wildfire first resource scene establishes command authority order resources delegate responsibility managing five seven officers delegate seven incident grows incident expands senior officers assume command scalability measured multiple dimensions resources fall two broad categories horizontal vertical scaling horizontally out/in means adding nodes removing nodes system adding new computer distributed software application example might involve scaling one web server three high-performance computing applications seismic analysis biotechnology workloads scaled horizontally support tasks would required expensive supercomputers workloads large social networks exceed capacity largest supercomputer handled scalable systems exploiting scalability requires software efficient resource management maintenance scaling vertically up/down means adding resources removing resources single node typically involving addition cpus memory storage single computer larger numbers elements increases management complexity sophisticated programming allocate tasks among resources handle issues throughput latency across nodes applications scale horizontally note network function virtualization defines terms differently scaling out/in ability scale add/remove resource instances e.g virtual machine whereas scaling up/down ability scale changing allocated resources e.g memory/cpu/storage capacity scalability databases requires database system able perform additional work given greater hardware resources additional servers processors memory storage workloads continued grow demands databases followed suit algorithmic innovations include row-level locking table index partitioning architectural innovations include shared nothing shared everything architectures managing multi-server configurations context scale-out data storage scalability defined maximum storage cluster size guarantees full data consistency meaning ever one valid version stored data whole cluster independently number redundant physical data copies clusters provide lazy redundancy updating copies asynchronous fashion called 'eventually consistent type scale-out design suitable availability responsiveness rated higher consistency true many web file hosting services web caches want latest version wait seconds propagate classical transaction-oriented applications design avoided many open source even commercial scale-out storage clusters especially built top standard pc hardware networks provide eventual consistency idem nosql databases like couchdb others mentioned write operations invalidate copies often n't wait acknowledgements read operations typically n't check every redundant copy prior answering potentially missing preceding write operation large amount metadata signal traffic would require specialized hardware short distances handled acceptable performance i.e act like non-clustered storage device database whenever strong data consistency expected look indicators indicators eventually consistent designs suitable transactional applications often advised focus system design hardware scalability rather capacity typically cheaper add new node system order achieve improved performance partake performance tuning improve capacity node handle approach diminishing returns discussed performance engineering example suppose 70 program sped parallelized run multiple cpus instead one formula_1 fraction calculation sequential formula_2 fraction parallelized maximum speedup achieved using p processors given according amdahl law substituting value example using 4 processors get double compute power 8 processors get doubling processing power improved speedup roughly one-fifth whole problem parallelizable speed would also double therefore throwing hardware necessarily optimal approach context high performance computing two common notions scalability", + "neighbors": [ + 51, + 52, + 77, + 86, + 123, + 195, + 227, + 272, + 274, + 280, + 300, + 314, + 322, + 340, + 362, + 375, + 425, + 429, + 465, + 611, + 719, + 737, + 846, + 847, + 854, + 876, + 1013, + 1081, + 1219, + 1220, + 1322, + 1357, + 1454, + 1465, + 1507, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 1100, + "label": 2, + "text": "NeXT:next next inc. later next computer inc. next software inc. american computer software company founded 1985 apple computer co-founder steve jobs name usually pronounced next based redwood city california company developed manufactured series computer workstations intended higher education business markets next founded jobs fired apple along several co-workers next introduced first next computer 1988 smaller nextstation 1990 next computers experienced relatively limited sales estimates 50,000 units shipped total nevertheless innovative object-oriented nextstep operating system development environment interface builder highly influential first major outside investment ross perot invested seeing segment next entrepreneurs 1987 invested 20 million exchange 16 percent next stock subsequently joined board directors 1988 next later released much nextstep system programming environment standard called openstep next withdrew hardware business 1993 concentrate marketing openstep mach openstep implementation several original equipment manufacturers oems next also developed webobjects one first enterprise web application frameworks webobjects never became popular initial high price 50,000 remains prominent early example web server based dynamic page generation rather static content apple purchased next 1997 429 million equivalent million 1.5 million shares apple stock part agreement steve jobs chairman ceo next software returned apple company co-founded 1976 founder promised merge software next apple hardware platforms eventually resulting macos ios watchos tvos operating systems completely based upon nextstep openstep foundation 1985 apple co-founder steve jobs led apple supermicro division responsible development macintosh lisa personal computers macintosh successful university campuses partly apple university consortium allowed students institutions buy computers discount consortium earned 50 million computers february 1984 chairman jobs visited university departments faculty members sell macintosh jobs met paul berg nobel laureate chemistry luncheon held silicon valley honor fran\u00e7ois mitterrand president france berg frustrated expense teaching students recombinant dna textbooks instead wet laboratories used testing analysis chemicals drugs materials biological matter wet labs prohibitively expensive lower-level courses complex simulated personal computers time berg suggested jobs use influence apple create 3m computer workstation higher education featuring least one megabyte random-access memory ram megapixel display megaflops performance hence name 3m jobs intrigued berg concept workstation contemplated starting higher education computer company fall 1985 amidst increasing turmoil apple jobs division release upgraded versions macintosh much macintosh office system result sales plummeted apple forced write millions dollars unsold inventory apple chief executive officer ceo john sculley ousted jobs day-to-day role apple replacing jean-louis gass\u00e9e 1985 later year jobs began power struggle regain control company board directors sided sculley jobs took business visit western europe soviet union behalf apple several months sidelined jobs resigned apple september 13 1985 told board leaving set new computer company would taking several apple employees supermicro division also told board new company would compete apple might even consider licensing designs back market macintosh brand jobs named new company next inc. number former apple employees followed next including joanna hoffman bud tribble george crow rich page susan barnes susan kare dan l lewin consulting major educational buyers around country including follow-up meeting paul berg tentative specification workstation drawn designed powerful enough run wet lab simulations cheap enough college students use dormitory rooms specifications finished however apple sued next nefarious schemes take advantage cofounders insider information jobs remarked hard think 2 billion company 4,300-plus people could n't compete six people blue jeans suit eventually dismissed trial 1986 jobs recruited famous graphic designer paul rand create brand identity costing 100,000 jobs recalled asked would come options said 'no solve problem pay \u2019 use solution want options go talk people rand created 20-page brochure detailing brand including precise angle used logo 28\u00b0 new company name spelling next next changed business plan mid-1986 company decided develop computer hardware software instead low-end workstation team led avie tevanian joined company working one mach kernel engineers carnegie mellon university develop nextstep operating system hardware division led rich page \u2014 one cofounders previously led apple lisa team \u2014 designed developed hardware next first factory completed fremont california 1987 capable producing 150,000 machines per year next first workstation officially named next computer although widely termed cube distinctive case 1 ft magnesium cube designed apple iic case designer frogdesign accordance edict jobs original design team anticipated releasing computer us 3,000 spring 1987 ready sale summer year next computer received standing ovations revealed lavish invitation-only gala event next introduction \u2014 introduction next generation computers education louise m. davies symphony hall san francisco california wednesday october 12 1988 following day selected educators software developers invited 100 registration fee attend first public technical overview next computer event called next day held san francisco hilton event gave developers interested developing next software insight software architecture object-oriented programming developing next computer luncheon speaker steve jobs first machines tested 1989 next started selling limited numbers universities beta version nextstep operating system installed initially next computer targeted u.s. higher education establishments base price 6,500 machine widely reviewed magazines generally concentrating hardware asked upset computer debut delayed several months jobs responded late computer five years ahead time next computer based new 25 mhz motorola 68030 central processing unit cpu motorola 88000 risc chip originally considered available sufficient quantities included 8 64 mb random-access memory ram 256 mb magneto-optical mo drive 40 mb swap-only 330 mb 660 mb hard disk drive 10base2 ethernet nubus 17-inch megapixel grayscale display measuring 1120 832 pixels 1989 typical new pc macintosh amiga computer included megabytes ram 640\u00d7480 16-color 320x240 4000-color display 10 20 megabyte hard drive networking capabilities also first computer ship general-purpose dsp chip motorola 56001 motherboard used support sophisticated music sound processing including music kit software magneto-optical drive manufactured canon inc. used primary mass storage device drives relatively new market next first computer use cheaper hard drives blank media especially though cost 150 canon jobs negotiations saw canon agree retail 50 apiece slower average seek time 96 ms design made impossible move files computers without network since next computer one mo drive disk could removed without shutting system storage options proved challenging first next computers magneto-optical media relatively expensive performance reliability problems despite faster floppy drive drive sufficient run primary medium running nextstep operating system terms speed capacity 1989 next struck deal former compaq reseller businessland sell next computers select markets nationwide selling retailer major change next original business model selling directly students educational institutions businessland founder david norman predicted sales next computer would surpass sales compaq computers 12 months 1989 canon invested us 100 million next giving 16.67 percent stake making next worth almost 600 million canon invested next condition would able use nextstep environment workstations would mean greatly expanded market software next exited hardware business canon produced line pcs called object.station including models 31 41 50 52 specifically designed run nextstep/intel canon also served next distributor japan next computers first released retail market 1990 9,999 next original investor ross perot resigned board directors june 1991 dedicate time perot systems plano texas-based systems integrator next released second generation workstations 1990 new range included revised next computer renamed nextcube nextstation nicknamed slab pizza box case form-factor jobs explicit ensuring next staff use latter terminology lest next machines compared competing sun workstations already nickname magneto-optical drive replaced 2.88 mb floppy drive 2.88 mb floppy disks expensive technology supplant 1.44 mb floppy realizing next utilized cd-rom drive eventually became industry standard storage color graphics available nextstation color nextdimension graphics processor hardware nextcube new computers cheaper faster predecessors new motorola 68040 processor 1992 next launched turbo variants nextcube nextstation 33 mhz 68040 processor maximum ram capacity increased 128 mb next sold 20,000 computers 1992 next counted upgraded motherboards back order system sales \u2014 small number compared competitors however company reported sales 140 million year encouraging canon invest 30 million keep company afloat total 50,000 next machines sold including thousands super secret national reconnaissance office located chantilly virginia next long-term aim migrate risc reduced instruction set computing architecture processor design strategy intended increase performance project known next risc workstation nrw initially nrw based motorola 88110 processor due lack confidence motorola commitment 88000-series architecture later redesigned around dual powerpc 601s next produced motherboards enclosures exited hardware business full production next computers delivered mathematica pre-installed several developers used next platform write pioneering programs tim berners-lee used next computer 1990 create first web browser web server accordingly next instrumental development world wide web next used professors scientific engineering applications developing finished newspaper layouts using news george mason university early 1990s set next workstations publishing well silicon graphics cad/gl mathematica astrophysics games doom quake developed id software next machines games based doom engine heretic raven software well strife rogue entertainment also developed next hardware using id tools commercial programs released next computers including altsys virtuoso vector drawing program page-layout features ported mac os microsoft windows aldus freehand v4 lotus improv spreadsheet program systems bundled number smaller built-in applications merriam-webster collegiate dictionary oxford quotations complete works william shakespeare digital librarian search engine access next started porting nextstep operating system ibm pc compatible computers using intel 80486 processor late 1991 change business strategy withdraw hardware business entirely demonstration port displayed nextworld expo january 1992 mid-1993 product complete version 3.1 also known nextstep 486 released prior release chrysler planned buy 3,000 copies 1992 nextstep 3.x later ported pa-risc sparc-based platforms total four versions nextstep/next next 68k black boxes nextstep/intel nextstep/pa-risc nextstep/sparc although ports widely used nextstep gained popularity institutions first chicago nbd swiss bank corporation o'connor company organizations owing programming model used many american federal agencies united states naval research laboratory national security agency advanced research projects agency central intelligence agency national reconnaissance office ibm pc clone vendors offered somewhat customized hardware solutions delivered running nextstep intel elonex nextstation canon object.station 41 next withdrew hardware business 1993 company renamed next software inc consequently 300 540 staff employees laid next negotiated sell hardware business including fremont factory canon later pulled deal work powerpc machines stopped along hardware production ceo sun microsystems scott mcnealy announced plans invest 10 million 1993 use next software future sun systems next partnered sun create openstep nextstep application layer hosted third party operating system exiting hardware business next focused operating systems effect returning original business plan new products based openstep released including openstep enterprise version microsoft windows nt company launched webobjects platform building large-scale dynamic web applications many large businesses including dell disney worldcom bbc used webobjects short time eventually webobjects used solely power apple itunes store corporate website discontinuing apple computer announced intention acquire next december 20 1996 apple paid 429 million cash went initial investors 1.5 million apple shares went steve jobs deliberately given cash part deal main purpose acquisition use nextstep foundation replace dated classic mac os instead beos in-development copland deal finalized february 7 1997 bringing jobs back apple consultant later appointed interim ceo 2000 jobs took ceo position permanent assignment holding position resignation august 24 2011 jobs died six weeks later october 5 2011 complications relapsed pancreatic neuroendocrine tumor several next executives replaced apple counterparts steve jobs restructured company board directors next five years nextstep operating system ported powerpc architecture time intel port openstep enterprise toolkit windows produced operating system code named rhapsody toolkit development platforms called yellow box backwards compatibility apple added blue box rhapsody allowing existing mac applications run self-contained cooperative multitasking environment server version new operating system released mac os x server 1.0 1999 first consumer version mac os x 10.0 2001 openstep developer toolkit renamed cocoa rhapsody blue box renamed classic environment changed run applications full-screen without requiring separate window apple included updated version original macintosh toolbox called carbon gave existing mac applications access environment without constraints blue box nextstep interface features used mac os x including dock services menu finder column view cocoa text system nextstep processor-independent capabilities retained mac os x leading powerpc intel x86 versions although powerpc versions publicly available 2006 apple moved intel processors august 2006 jobs created different corporate culture next terms facilities salaries benefits jobs experimented structural changes apple next abandoned conventional corporate structures instead making community members instead employees two different salaries next early 1990s team members joined 1986 paid 75,000 joined afterwards paid 50,000 caused awkward situations managers paid less employees employees given performance reviews raises every six months spartan salary plans foster openness employees full access payrolls although employees ever took advantage privilege next health insurance plan offered benefits married couples unmarried couples same-sex couples although latter privilege later withdrawn due insurance complications payroll schedule also different companies silicon valley time instead getting paid twice month arrears end pay period employees would get paid month advance beginning words jobs found office space palo alto california 3475 deer creek road occupying glass concrete building featured staircase designed architect i. m. pei first floor used hardwood flooring large worktables workstations would assembled avoid inventory errors next used just-in-time jit inventory strategy company contracted major components mainboards cases finished components shipped first floor assembly second floor office space open floor plan enclosed rooms jobs office conference rooms next expanded office space needed company rented office 800 900 chesapeake drive redwood city also designed pei architectural centerpiece floating staircase visible supports open floor plan retained although furnishings became luxurious 5,000 chairs 10,000 sofas ansel adams prints next first campus palo alto subsequently occupied sap ag second campus redwood city occupied apnicure oncomed pharmaceuticals inc first issue nextworld magazine printed 1991 published san francisco integrated media edited michael miley later dan ruby mainstream periodical discuss next computers operating system next software publication discontinued 1994 four volumes nextworld expo followed developer conference held 1991 1992 san francisco civic center 1993 1994 moscone center san francisco steve jobs keynote speaker though profitable company wide-ranging impact computer industry object-oriented programming graphical user interfaces became common 1988 release nextcube nextstep technologically successful platform often held trendsetter companies started emulate success next object-oriented system widely seen response next microsoft announced cairo project 1991 cairo specification included similar object-oriented user interface features coming consumer version windows nt although cairo ultimately abandoned elements integrated projects 1994 microsoft next collaborating windows nt port openstep never released 1993 taligent considered press competitor objects operating systems even without product release next main point comparison first years taligent theoretical newness often compared next older mature commercially established platform taligent debut release 1995 called little late especially compared next webobjects failed achieve wide popularity partly initial high price us 50,000 remains first prominent early example web application server enabled dynamic page generation based user interactions opposed static content webobjects bundled macos server xcode", + "neighbors": [ + 16, + 33, + 71, + 75, + 99, + 121, + 130, + 210, + 211, + 214, + 228, + 269, + 270, + 322, + 345, + 356, + 359, + 395, + 403, + 412, + 475, + 477, + 511, + 551, + 596, + 610, + 625, + 634, + 696, + 738, + 797, + 810, + 858, + 868, + 877, + 917, + 927, + 945, + 956, + 1057, + 1132, + 1138, + 1143, + 1178, + 1189, + 1190, + 1207, + 1233, + 1237, + 1262, + 1284, + 1287, + 1292, + 1301, + 1305, + 1334, + 1339, + 1373, + 1407, + 1409, + 1488, + 1496, + 1544, + 1578, + 1591, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 1101, + "label": 4, + "text": "Kaspersky_Lab:kaspersky lab kaspersky lab russian \u043b\u0430\u0431\u043e\u0440\u0430\u0442\u043e\u0440\u0438\u044f \u043a\u0430\u0441\u043f\u0435\u0440\u0441\u043a\u043e\u0433\u043e laboratoriya kasperskogo multinational cybersecurity anti-virus provider headquartered moscow russia operated holding company united kingdom founded 1997 eugene kaspersky natalya kaspersky alexey de-monderik eugene kaspersky currently ceo kaspersky lab develops sells antivirus internet security password management endpoint security cybersecurity products services kaspersky expanded abroad 2005\u20132010 grew 698 million annual revenues 2017 8 2016 though annual revenues 8 north america due u.s. government security concerns 2016 software 400 million users largest market-share cybersecurity software vendors europe kaspersky lab ranks fourth global ranking antivirus vendors revenue first russian company included rating world leading software companies called software top 100 79th list 6/29/2012 kaspersky lab ranked 4th endpoint security segment according idc data 2010 according gartner kaspersky lab currently third largest vendor consumer security software worldwide fifth largest vendor enterprise endpoint protection kaspersky lab named leader gartner magic quadrant endpoint protection platforms kaspersky global research analysis team great led discovery sophisticated espionage platforms conducted nations equation group stuxnet worm various covert government-sponsored cyber-espionage efforts uncovered research kaspersky also publishes annual global security risks survey 2014 kaspersky research hubs analyze 350,000 malware samples per day kaspersky faced controversy allegations engaged russian federal security service fsb \u2014ties company actively denied u.s. department homeland security banned kaspersky products government departments 13 september 2017 october 2017 subsequent reports alleged hackers working russian government stole confidential data home computer american national security agency contractor via kaspersky antivirus software kaspersky denied allegations reporting software detected equation group malware samples uploaded servers analysis normal course operation company since announced commitments increased accountability soliciting independent reviews verification software source code announcing would migrate core infrastructure foreign customers russia switzerland first version kaspersky lab antivirus software developed eugene kaspersky 1989 response cascade virus early versions 40 virus definitions mostly distributed friends family members eugene continued developing software kami resulting antiviral toolkit pro avp product released 1992 popularized 1994 competitive analysis hamburg university gave eugene software first place 1997 eugene kaspersky wife natalya kaspersky alexey de-monderik left kami form kaspersky lab continue developing antivirus product called avp product renamed kaspersky anti-virus american company registered avp trademark us 1998 taiwanese student released virus called cih first three weeks outbreak kaspersky lab avp software time able remove increased demand led deals antivirus companies japan finland germany integrate avp software according wired kaspersky software advanced time example first software monitor viruses isolated quarantine company revenue grew 280 percent 1998 2000 60 percent revenue coming foreign sales natalya worked broker deals abroad localize software opened offices uk poland holland china later expanded germany france us japan 2000 company 65 employees sales 40 countries kaspersky opened new offices south east asia middle east 2008 south africa 2009 also expanded india middle east africa 2010 2009 retail sales kaspersky lab antivirus products reached almost 4.5 million copies per year 2011 general atlantic bought 20 percent share kaspersky lab 200 million expectation helping company go public months later decision made keep firm private kaspersky re-purchased shares general atlantic followed numerous executive departures 2011 2014 regarding disputes going public eugene management style january 1 2012 kaspersky lab officially left business software alliance bsa sopa bsa supported controversial anti-piracy bill kaspersky lab support stating believe measures used contrary modern advances technology needs consumers show disapproval announced intent leave december 5 2011 2013 company unaudited 667 million annual revenues 2014 kaspersky lab signed distribution deal ingram micro significantly expanded reseller program august 2015 two former kaspersky employees alleged company introduced modified files virustotal antivirus database trick software kaspersky competitors triggering false positives virus malware scans possible motive eugene allegedly furious competitors perceived unfairly free-riding kaspersky malware discoveries via open-source virustotal database company denied allegations personal blog eugene kaspersky compared accusations unsubstantiated conspiracy theories reuters followed publishing leaked emails allegedly kaspersky alluding falsies rubbing foreign competitors kaspersky lab stated emails may legitimate obtained anonymous sources hidden agenda 2016 kaspersky executive ruslan stoyanov arrested russian authorities charges predating work kaspersky 2019 convicted treason kaspersky lab develops markets antivirus internet security password management endpoint security cybersecurity products services fourth fifth largest endpoint security vendor third largest consumer security software company sixth largest overall security company revenues 15 percent russian companies domestically one-third european organizations one-fourth u.s. organizations software 400 million users kaspersky consumer software include antivirus internet security total security products antivirus software includes malware protection monitors pc suspicious program behavior warns users potentially dangerous websites internet security software adds privacy features parental controls anti-phishing tools total security adds parental controls adult website filters diagnostic tools password manager application features kaspersky software available macs pcs android ios windows mobile blackberry symbian businesses company markets kaspersky endpoint security business suite includes centralized user interface management application called kaspersky security center cybersecurity software called kaspersky security network kaspersky administration kitsecurity center manages configuration installation remote use business suite also quarantine reporting features software product businesses 25 staff less called kaspersky small office security ksos within suite products specifically virtualization security mobile security fraud protection among others kaspersky also develops free tool helps businesses gain access windows devices infected ransomware kaspersky anti-virus engine also powers products solutions security vendors check point bluecoat juniper networks microsoft forefront netintelligence clearswift frontbridge netasq wedge networks others altogether 120 companies licensing technology kaspersky lab kaspersky lab also number partnerships various technology companies international multilateral partnership cyber threats datuk mohd noor amin acts chairman announced appointment harry cheung \u2013 managing director kaspersky lab apac \u2013 goodwill ambassador greater china kaspersky lab runs several global sponsorships example scuderia ferrari racing team geographical expeditions according pc magazine kaspersky antivirus competitor bitdefender consistently ranked top independent competitive tests pc magazine malware phishing tests similar results praised software bonus security tools cons magazine said took longer-than-expected complete scan magazine said kaspersky total security product impressive feature list praised extra features total security product like password management encryption parental controls pc magazine said product scored highly lab tests antivirus antiphishing features so-so scores antimalware tests n't able catch spam kaspersky 2013 endpoint security windows product top-ranked enterprise antivirus software competitive test dennis technology labs followed symantec endpoint protection av-comparatives awarded kaspersky product year 2015 based number high scores gotten throughout year wide range tests pc magazine praised software features said lacked policy management deployment options kaspersky parental controls software reviewed pc magazine reviewer said well-rounded affordable parental control monitoring praised software content filtering child profiles social media monitoring features criticize features available ios android anti-virus software testing group av-comparatives gave windows xp version kaspersky av advanced+ rating highest february 2008 on-demand detection test fourth highest detection rate among 16 products tested however retrospective/proactive test may 2008 kaspersky received standard rating detecting 21 new malware 1-month old signatures receiving substantial amount false positives firewall included kaspersky internet security 7.0 got good rating matousec firewall challenge result 85 kaspersky anti-virus 7.0 achieved 6.5 result 8 anti malware labs rootkit detection test also achieved 31 33 detection polymorphic viruses 97 result self-protection test 2007 kaspersky internet security 7 received award british magazine pc pro also place list kaspersky passed virus bulletin comparative tests since august 2003 2005 according pc world magazine kaspersky anti-virus software provided fastest updates new virus security threats industry pc world magazine march 2010 comparison consumer security suites kaspersky internet security 2010 scored 4.5/5 stars rated second overall december 2011 version av-comparatives annual reports kaspersky lab software achieved highest overall ranking earned av comparatives product year award 1 february 2012 kaspersky internet security earned av-test award best repair 2011 award field home user products av-test institute 28 january 2013 kaspersky endpoint security earned av-test award best protection 2012 av-test award best repair 2012 awards field corporate products av-test institute later 2013 kaspersky earned product year award av-comparatives highest score among enterprise solutions dennis technology labs report kaspersky also received certification products oesis ok certification program verifies applications interoperable third-party technology solutions like nac ssl vpn products cisco systems juniper networks f5 networks others kaspersky lab global research analysis team great established 2008 investigates cybersecurity threats work malware operations security companies often evaluated ability uncover previously unknown viruses vulnerabilities kaspersky reputation investigating cyber-security threats influential gaining sales prestige beginning around 2010 kaspersky exposed series government-sponsored cyber-espionage sabotage efforts include stuxnet duqu flame gauss regin equation group according wired many seemingly launched us uk israeli allies kaspersky especially well-known work uncovering stuxnet flame 2010 kaspersky lab worked microsoft counter-act stuxnet worm infected 14 industrial locations iran using four zero-day vulnerabilities microsoft windows according ieee spectrum circumstances strongly suggest worm developed united states israel damage centrifuges iran nuclear-enrichment program first discovery major government-sponsored cyber-attack may 2012 kaspersky lab identified malware flame researcher described potentially sophisticated cyber weapon yet unleashed according researchers kaspersky lab malware infected estimated 1,000 5,000 machines worldwide asked united nations international telecommunications union investigate reports virus affecting iranian oil ministry computers kaspersky lab investigated discovered md5 hash filename appeared customer machines middle eastern nations discovering pieces researchers dubbed program flame name one modules flame earlier variant stuxnet kaspersky never verified source software suspected developed national security agency nsa transmit keystrokes skype calls data kaspersky created algorithms find similar malware found gauss july collected transmitted data devices infected bluetooth usb drives january 2013 kaspersky discovered red october malware used widespread cyber-espionage five years targeted political targets like embassies nuclear sites mostly europe switzerland north america malware likely written russian-speaking hackers exploits chinese hackers june kaspersky discovered nettraveler said obtaining data emerging technology government targets oil companies kaspersky identify behind similar cyber-espionage coming beijing china later year kaspersky discovered hacker group called icefog investigating cybersecurity attack japanese television company kaspersky said hacker group possibly china unique targeted specific files seemed know planting malware extract february 2014 kaspersky identified malware mask infected 380 organizations 31 countries many organizations affected morocco files spanish group believed nation-state conducting espionage kaspersky speculate country may developed november 2014 symantec kaspersky authored papers contained first disclosure malicious software named regin according kaspersky regin similar qwerty malware program discovered next year regin used take remote control computer believed originated five eyes alliance month kaspersky reported darkhotel attack targeted users wireless networks hotels asia asked users update software downloaded malware gave passwords 2015 kaspersky identified highly sophisticated threat actor called equation group group incorporated sophisticated spying software firmware hard drives banks government agencies nuclear researchers military facilities countries frequent targets us intelligence efforts suspected developed national security agency nsa included many unique technical achievements better avoid detection day kaspersky announced discovery hacker group called carbanak targeting banks moving millions dollars fake accounts carbanak discovered one bank asked kaspersky investigate suspicious behavior atms similar malware using techniques carbanak discovered 2016 dubbed carbanak 2.0 june 2015 kaspersky reported network infiltrated government-sponsored malware evidence suggested malware created developers duqu stuxnet order get intelligence would help better avoid detection kaspersky future kaspersky called duqu 2.0 malicious software resided memory avoid detection hack believed done group duqu 2011 used exploits microsoft installer files june 2015 kaspersky lab citizen lab independently discovered software developed hacking team used 60 governments around world covertly record data mobile phones citizens software gave police enforcement menu features access emails text messages keystrokes call history data kaspersky also identified 37,000 attacks banking companies used modifications malware called asacub took control android devices asacub targeted mostly banking customers u.s. russia ukraine using sms message baited users installing trojan 2016 kaspersky discovered zero day vulnerability microsoft silverlight kaspersky identified string code often used exploits created suspected author used yara rules network kaspersky software users find string code uncover rest exploit afterwards microsoft issued critical software patch protect software vulnerability 2016 kaspersky uncovered poseidon group would infiltrate corporations malware using phishing emails get hired company security firm correct problem hired poseidon would install additional malware backdoors june 2016 kaspersky helped uncover russian hacking group leading 50 arrests since 2015 kaspersky alleged close ties russian government various western media outlets finally us government 2017 president trump signed legislation ban software kaspersky government computers us government institutions prohibited buying installing kaspersky software computers devices", + "neighbors": [ + 17, + 43, + 94, + 120, + 144, + 198, + 232, + 293, + 297, + 379, + 476, + 542, + 624, + 708, + 717, + 731, + 818, + 842, + 910, + 938, + 944, + 961, + 965, + 1038, + 1043, + 1239, + 1291, + 1327, + 1342, + 1350, + 1358, + 1368, + 1514, + 1542, + 1555, + 1573, + 1621 + ], + "mask": "Validation" + }, + { + "node_id": 1102, + "label": 2, + "text": "Linux_range_of_use:linux range use linux kernel-based operating systems widely adopted wide range uses advantages benefits free open-source software apply linux kernel rest system software common human interface devices hids available desktop computers laptops similar devices determine design graphical human-computer interface implemented software software packages choose among building accordingly designed graphical user interface generic input driver linux kernel evdev several input methods implemented middleware i.e. atop part linux kernel adoption proving linux kernel suitable gaming platform course added software needed either augment typical desktop installation suitable gaming platform create linux-based operating system dedicated gaming platform abundance server software cf client\u2013server model supporting various communications protocols http web server smtp mail transfer agents pop3 imap e-mail server lightweight directory access protocol ldap server message block smb-cifs samba simple network management protocol snmp system network monitoring session initiation protocol sip various routing protocols run partly exclusively linux kernel software bundles also called solution stacks widely adopted acronyms become well known examples include dynamic web pages cloud computing three types virtualization hardware-based software-based paravirtualization implemented projects run linux linux-exclusive linux kernel customized adapted hardened various scenarios especially operation bastion host already mainlined developed maintained out-of-tree linux kernel-based operating systems still employed routing servers server computers commodity hardware cases professional routing equipment cisco catalyst either overkill costly components linux kernel netfilter linux network scheduler along available free open-source routing daemons bird internet routing daemon bird b.a.t.m.a.n. quagga xorp fulfill task well low-cost low-performance routing performed wireless routers running openwrt anonymity routing solution tor cross-platform exclusive linux components linux kernel logical volume manager lvm well suited support computer clusters also software managing clusters e.g. pacemaker linux-ha drbd ovirt openqrm ganeti eucalyptus appscale opennebula single system image multi system image clusters least linuxpmi openssi open-sharedroot diskless shared-root cluster kerrighed available three solutions operating-system-level virtualization linux-vserver lxc openvz offer similarities freebsd jails solaris containers linux operating systems runs virtualized xen micro-kernel-type hypervisor published license linux kernel gnu gpl 2.0 kvm possible turn linux kernel hypervisor managing libvirt libguestfs several utilities building programs openstack controller nodes run exclusively linux compute nodes cross-platform software projects serving similar use-case openstack nimbus ganeti appscale opennebula eucalyptus openqrm one best known linux-based operating systems mobile devices smartphones android operating system android employs modified linux kernel combines libbionic instead glibc surfaceflinger display server replacements specifically written purpose many mobile devices touchscreen sole human interface device hid gui partly middleware operating system adapted enable software designers create according human-computer interface linux kernel gained wide use operating systems used embedded systems real-time non-real-time variants patches exist transform linux kernel real-time kernel termed real-time operating system rtos several actively maintained minimally operating system includes less modified linux kernel uclibc busybox non-rtos variants exist openwrt also linux distribution use customer-premises equipment cpe devices like wireless routers rockbox based \u03bcclinux operating system portable media players fastest supercomputers decade since earth simulator used linux linux also ran first teraflops supercomputer asci red 1997 ibm roadrunner 2008 first petascale computer 500 100 world fastest supercomputers run operating system based linux kernel world \u2019 fastest supercomputer china \u2019 sunway taihulight powered colossal 650,000+ cpus runs customised version linux called \u2018 sunway raiseos \u2019 processing speed 93 petaflops", + "neighbors": [ + 13, + 134, + 162, + 209, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 327, + 330, + 380, + 400, + 401, + 429, + 431, + 455, + 571, + 611, + 630, + 650, + 664, + 688, + 716, + 720, + 725, + 736, + 796, + 897, + 935, + 986, + 1019, + 1060, + 1105, + 1138, + 1159, + 1197, + 1208, + 1225, + 1235, + 1241, + 1252, + 1313, + 1357, + 1360, + 1361, + 1391, + 1395, + 1448, + 1456, + 1468, + 1509, + 1524, + 1526, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1103, + "label": 4, + "text": "Suricata_(software):suricata software suricata open source-based intrusion detection system ids intrusion prevention system ips developed open information security foundation oisf beta version released december 2009 first standard release following july 2010 third-party tools available snort compatible suricata like following", + "neighbors": [ + 134, + 306, + 512, + 682, + 739, + 961, + 1120, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 1104, + "label": 6, + "text": "Flash_file_system:flash file system flash file system file system designed storing files flash memory\u2013based storage devices flash file systems closely related file systems general optimized nature characteristics flash memory avoid write amplification use particular operating systems block device layer emulate disk drive general-purpose file system used flash-based storage device suboptimal several reasons log-structured file systems desirable properties flash file system file systems include jffs2 yaffs particular characteristics flash memory best used either controller perform wear leveling error correction specifically designed flash file systems spread writes media deal long erase times nand flash blocks basic concept behind flash file systems flash store updated file system write new copy changed data fresh block remap file pointers erase old block later time practice flash file systems used memory technology devices mtds embedded flash memories controller removable flash memory cards usb flash drives built-in controllers manage mtd dedicated algorithms like wear leveling bad block recovery power loss recovery garbage collection error correction use flash file system limited benefit flash-based memory devices becoming prevalent number mobile devices increasing cost per memory size decreases capacity flash memory chips increases earliest flash file system managing array flash freely writable disk trueffs m-systems israel presented software product pc-card expo santa clara california july 1992 patented 1993 one earliest flash file systems microsoft ffs2 use ms-dos released autumn 1992 ffs2 preceded earlier product called ffs however fell short flash file system managing flash array write read many worm space rather freely writable disk around 1994 pcmcia industry group approved flash translation layer ftl specification based design m-systems trueffs specification authored jointly proposed m-systems scm microsystems also provided first working implementations ftl endorsed intel ftl became popular flash file system design non-pcmcia media well overlayfs unionfs aufs union filesystems allow multiple filesystems combined presented user single tree allows system designer place parts operating system nominally read-only different media normal read-write areas openwrt usually installed raw flash chips without ftl uses overlayfs combine compressed read-only squashfs jffs2", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 365, + 438, + 495, + 524, + 528, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1304, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1105, + "label": 3, + "text": "IP_Virtual_Server:ip virtual server ipvs ip virtual server implements transport-layer load balancing usually called layer 4 lan switching part linux kernel configured via user-space utility tool ipvs incorporated linux virtual server lvs runs host acts load balancer front cluster real servers ipvs direct requests tcp- udp-based services real servers make services real servers appear virtual services single ip address ipvs built top netfilter ipvs merged versions 2.4.x newer linux kernel mainline", + "neighbors": [ + 213, + 219, + 265, + 267, + 305, + 327, + 346, + 400, + 401, + 571, + 650, + 720, + 725, + 736, + 935, + 986, + 1102, + 1138, + 1202, + 1208, + 1241, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 1106, + "label": 7, + "text": "Internet_OS:internet os internet operating system internet os type operating system designed run applications services internet client generally web browser advantages os would would run thin client allowing cheaper easily manageable computer systems would require applications designed cross-platform open standards would tie user applications documents preferences single computer rather place internet cloud internet os also promoted perfect type platform software service talk internet os began surface 1995 browser war started heating microsoft netscape response limited capabilities html time microsoft began developing online content authoring platform would based distributed ole object linking embedding codenamed blackbird using ole applications put web would contain processing logic would act similar applications typical desktop environment immediately concerns would tie web proprietary microsoft technology would n't guaranteed run across different systems challenge marc andreessen netscape announced set new products would help transform browser called internet os would provide tools programming interfaces new generation internet-based applications so-called internet os would still run top regular os \u2013 based around netscape navigator \u2013 dismissed desktop operating systems like windows simply bag drivers reiterating goal would turn windows mundane collection entirely debugged device drivers andreessen explained newest versions navigator web browsers suites internet applications including programs mail ftp news would come viewers variety document types like adobe acrobat apple quicktime sun java applets would give programming interfaces publishing tools developers netscape also would continue sell server software java applets would run cross-platform clients servers scripting language form javascript would also provide facilities backend transaction processing elaborating client/server model navigating clients application servers database servers pointed \u2013 broad capabilities gave browser \u2013 difference technically netscape navigator traditional operating system navigator n't include device drivers technical problems blackbird growth web saw competitive statements netscape soon led microsoft rethink strategy began position ole primary tool within netscape proposed ecosystem ole would embeddable web pages using activex plug-in would easily integrated server side using asp active server pages development opposition industry microsoft began grow concept internet os led formation alliance around developing java alternative windows \u2013 chief partners netscape sun oracle ibm companies informally referred industry press gang four novell later joined alliance leading called gang five may 1997 group published position paper discussed integration software component models within corba \u2013 commonly used architecture allowing computer applications different vendors running different systems work together networks issued several rfps request proposals object management group omg standards body responsible managing corba meant help integrate different aspects java proposals included support javabeans \u2013 serialized component architecture java \u2013 javascript called java-tization corba group positioning java distributed object architecture similar microsoft intended ole blackbird ole would exist second-class technology would interface corba using javabeans group also promoted idea javaos \u2013 minimal java-based operating system \u2013 would turn run netscape web browser browser run javabeans components would front new ecosystem based open standards first html web browser second java hoped would become widely adopted corba javaos would hosted network computer nc concept long advocated oracle nc would thin client designed internet use leaving access applications documents stored entirely online oracle saw role providing tools server layer network-hosted applications would provided network application server turn would make use oracle7 relationship database management system oracle web server oracle also outlined referred network computing architecture nca would separate presentation application data access logic java applets nca cartridges microsoft intel response challenge put forward standard competing model called netpc diskless pc would primarily adapted web browser use would run simplified version windows 95 codenamed pegasus later road idea evolved netbook microsoft publicly criticized idea internet os instead argued traditional desktop os internet-enabled beginning idea active platform internet strategy culminated later release windows 98 strategy involved tightly bundling internet explorer windows became center united states anti-trust suit microsoft gang five \u2013 netscape sun ibm oracle novell \u2013 involved lobbying anti-trust action microsoft 1998 java alliance started fall apart oracle continued developing server-side java databases given idea network computer netscape given java browser efforts instead aiming position internet portal pressure investors given blame google revived idea internet os 2009 development chrome os linux-based operating system designed work exclusively ajax-based web applications operating system designed look operate like chrome web browser sold laptops developed partners called chromebooks also promoted g suite suite web applications alternative traditional desktop software microsoft office google tried address standard criticisms internet os concept development projects google native client allows browser run intel x86 native code sandbox complex programs could run fully take advantage system hardware google gears also created allow offline access online applications although deprecated favor web storage model process standardization world wide web consortium w3c", + "neighbors": [ + 16, + 77, + 134, + 509, + 611, + 796, + 1138, + 1417 + ], + "mask": "Test" + }, + { + "node_id": 1107, + "label": 4, + "text": "Electric_grid_security:electric grid security electric grid security refers activities utilities regulators stakeholders play securing national electricity grid american electrical grid going one largest changes history move smart grid technology smart grid allows energy customers energy providers efficiently manage generate electricity similar new technologies smart grid also introduces new concerns security utility owners operators whether investor-owned municipal cooperative typically responsible implementing system improvements regards cybersecurity executives utilities industry beginning recognize business impact cybersecurity electric utility industry u.s. leads number initiatives help protect national electric grid threats industry partners federal government particularly national institute standards technology north american electric reliability corporation federal intelligence law enforcement agencies electric grids targets military terrorist activity american military leaders created first air war plan axis 1941 germany electric grid top target list north american electrical power grid highly connected system ongoing modernization grid generally referred smart grid reliability efficiency two key drivers development smart grid another example ability electrical system incorporate renewable energy sources wind power geothermal power one key issues electric grid security ongoing improvements modernizations created risk system example one risk specifically comes integration digital communications computer infrastructure existing physical infrastructure power grid according academic journal ieee security privacy magazine smart grid uses intelligent transmission distribution networks deliver electricity approach aims improve electric system reliability security efficiency two-way communication consumption data dynamic optimization electric-system operations maintenance planning u.s. federal energy regulatory commission ferc charge cybersecurity standards bulk power system system includes systems necessary operating interconnected grid investor-owned utilities operate different authority state public utility commissions falls outside ferc jurisdiction 2018 two evolutions taking place power economic sector evolutions could make harder utilities defend cyber threat first hackers become sophisticated attempts disrupt electric grids attacks targeted including spear phishing efforts aimed individuals shifting corporate networks include industrial control systems second grid becoming distributed connected growing internet things world could make every device could potential vulnerability 2006 200,000 miles transmission lines 230 kv higher existed united states main problem impossible secure whole system terrorist attacks scenario terrorist attack however would minimal would disrupt small portion overall grid example attack destroys regional transmission tower would temporary impact modern-day electric grid system capable restoring equipment damaged natural disasters tornadoes hurricanes ice storms earthquakes generally short period time due resiliency national grid events would difficult even well-organized large group terrorists cause physical damage small- moderate-scale tornado 2016 members russian hacker organization grizzly steppe infiltrated computer system vermont utility company burlington electric exposing vulnerability nation electric grid attacks hackers disrupt state electric grid however burlington electric discovered malware code computer system connected grid today utility industry advancing cybersecurity series initiatives partnering federal agencies goal improve sector-wide resilience physical cyber threats industry also working national institute standards technology north american electric reliability corporation federal intelligence law enforcement agencies 2017 electric companies spent 57.2 billion grid security september 2018 brien sheahan chairman ceo illinois commerce commission member u.s. department energy doe nuclear energy advisory committee robert powelson former federal energy regulatory commission ferc commissioner wrote published piece utility dive cyberthreats national power system require stronger national standards collaboration levels government recent article u.s. department homeland security confirmed russian hackers targeted control room american public utilities electric distribution system become networked together interconnected critical public services depend system water delivery financial institutions hospitals public safety prevent disruption network sheahan powelson recommended national standards collaboration federal state energy regulators utility companies cybersecurity-specific practices teams baltimore gas electric conducts regular drills employees also shares cyber-threat related information industry government partners duke energy put together corporate incident response team devoted cybersecurity 24 hours day unit works closely government emergency management law enforcement states cybersecurity procedures practices december 2018 u.s senators cory gardner michael bennet introduced legislation intended improve grid security nation-wide bills would create 90 million fund would distributed states develop energy security plans legislation would also require u.s. energy department identify vulnerabilities cyberattacks nation \u2019 electrical power grid electricity subsector coordinating council escc main liaison organization federal government electric power industry mission coordinate efforts prepare respond national-level disasters threats critical infrastructure escc composed electric company ceos trade association leaders segments industry federal government counterparts include senior administration officials white house relevant cabinet agencies federal law enforcement national security organizations", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1108, + "label": 1, + "text": "Media_contacts_database:media contacts database media contacts database media database specific people media commonly journalists media contacts database consists mainly list journalists reporters editors publishers contributors freelance journalists tv show anchors radio show hosts djs etc media-type work media contacts database usually contains following information information available may less based research methods media research company creates database media contacts database pr tool used pr professionals pitch stories particular topic product company specific group journalists journalists would write speak particular topic relevant issue episode shows media contacts database allows pr professional gain easy access hundreds journalists within short span time media contacts database created sold many media research companies offer pr software professionals", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1109, + "label": 8, + "text": "Application_Request_Routing:application request routing application request routing arr extension internet information server iis enables iis server function load balancer arr iis server configured route incoming requests one multiple web servers using one several routing algorithms load balancing requests high availability web servers achieved without incurring typically-high costs dedicated load balancing products arr currently available version 3.0 released july 26 2013 current version supported x86 x64 installed iis 7.0 later windows 2008 later arr available download microsoft download center via microsoft web platform installer webpi arr requires url rewrite extension function uses routing requests arr configured redirect traffic based server variables urls cookies performs full layer 7 load balancing arr functionality described load balancing reverse proxy although advanced dedicated reverse proxy products microsoft uag dedicated load balancing solutions arr 3.0 supports following features", + "neighbors": [ + 26, + 66, + 79, + 85, + 93, + 148, + 153, + 262, + 278, + 295, + 312, + 326, + 344, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1092, + 1098, + 1138, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1531, + 1533, + 1545, + 1547, + 1555, + 1561, + 1582, + 1586, + 1613, + 1620 + ], + "mask": "Validation" + }, + { + "node_id": 1110, + "label": 2, + "text": "Environment_variable:environment variable environment variable dynamic-named value affect way running processes behave computer part environment process runs example running process query value temp environment variable discover suitable location store temporary files home userprofile variable find directory structure owned user running process introduced modern form 1979 version 7 unix included unix operating system flavors variants point onward including linux macos pc dos 2.0 1982 succeeding microsoft operating systems including microsoft windows os/2 also included feature although somewhat different syntax usage standard variable names unix unix-like systems process separate set environment variables default process created inherits duplicate environment parent process except explicit changes made parent creates child api level changes must done running codice_1 codice_2 alternatively command shells bash user change environment variables particular command invocation indirectly invoking via codice_3 using codice_4 notation running program access values environment variables configuration purposes shell scripts batch files use environment variables communicate data preferences child processes also used store temporary values reference later shell script however unix variables usually used unix environment variable changed script compiled program affect process possibly child processes parent process unrelated processes affected similarly changing removing variable value inside dos batch file change variable duration codice_5 existence unix environment variables normally initialized system startup system init scripts hence inherited processes system users often augment profile script command shell using microsoft windows environment variable default value stored windows registry set codice_6 file unix setuid program given environment chosen caller runs different authority caller dynamic linker usually load code locations specified environment variables codice_7 codice_8 run process authority setuid program would insecure caller could get run arbitrary code hence misuse authority reason libc unsets environment variables startup setuid process setuid programs usually unset unknown environment variables check others set reasonable values variables used scripts command line usually referenced putting special symbols front around variable name instance display user home directory scripting environments user type dos os/2 windows command-line interpreters codice_5 codice_10 user type windows powershell user type commands codice_3 codice_12 codice_13 display environment variables values codice_13 also used print single variable giving variable name sole argument command commands codice_3 codice_12 also used set environment variables often incorporated directly shell unix following commands also used often dependent certain shell simple principles govern environment variables achieve effect environment variables local process set two shell processes spawned value environment variable changed one change seen child process created inherits environment variables values parent process usually program calls another program first creates child process forking child adjusts environment needed lastly child replaces program called procedure gives calling program control environment called program unix unix-like systems names environment variables case-sensitive unix shells variables may assigned without codice_17 keyword variables defined way displayed codice_12 command true environment variables stored shell recognized kernel codice_13 command display child processes inherit however used front program run variables added program environment persistence environment variable session-wide system-wide unset builtin command implemented bourne shell family sh ksh bash etc c shell family csh tcsh etc unix command line shells unsets shell variable removing memory shell exported environment implemented shell builtin directly manipulates internals shell read-only shell variables unset one tries unset read-only variable unset command print error message return non-zero exit code dos os/2 windows command-line interpreters codice_5 codice_10 codice_22 command used assign environment variables values using following arguments codice_22 command without arguments displays environment variables along values examples environment variables include dos master environment provided primary command processor inherits pre-environment defined codice_64 first loaded size configured codice_65 parameter 160 32767 bytes local environment segments inherited child processes typically reduced size contents hold command-line processors like 4dos allow define minimum amount free environment space available launching secondary shells content environment variables remains unchanged upon storage names without codice_66 always converted uppercase exception pre-environment variables defined via codice_64 directive codice_22 dr dos 6.0 higher codice_69 allow lowercase names dr-dos 7.02 higher principle ms-dos 7.0 higher also supports lowercase variable names codice_70 provides means user define environment variable names containing lowercase letters stored environment like normal environment variables remain invisible dos software since written expect uppercase variables command processors limit maximum length variable name 80 characters principally limited size environment segment dos 16-bit windows programs expect contents environment variables exceed 128 characters dr-dos codice_5 supports environment variables 255 4dos even 512 characters since codice_5 configured via codice_73 support command lines 1024 characters internally ms-dos 7.0 higher environment variables expected contain least 1024 characters well versions dr-dos environment passed drivers often need environment installation shrunken relocated codice_74 codice_75/codice_76 options codice_77 zero environment codice_78 substitute drive e.g codice_79 codice_80 relocate environment program order minimize driver effectively resulting resident memory footprint batch mode non-existent environment variables replaced zero-length string standard environment variables reserved environment variables include dr-dos family supports number additional standard environment variables including datalight rom-dos supports number additional standard environment variables well including codice_364 codice_365 codice_366 codice_367 codice_368 codice_369 also used rom-dos system path variables refer locations critical operating system resources generally user-dependent user management variables store information related resources settings owned various user profiles within system general rule variables refer critical system resources locations necessary os run optional system variables explicitly specified default used modify default behavior certain built-in console commands variables also need explicitly specified command line arguments following tables shows typical default values certain environment variables english versions windows retrieved codice_427 list environment variable refers location user documents directory standard method setting program home directory documents directory besides true environment variables statically stored environment changed deleted number pseudo-environment variables exist batch processing so-called replacement parameters replaceable parameters microsoft ibm terminology aka replacement variables digital research novell caldera terminology batch file parameters jp software terminology codice_432..codice_433 codice_434 used retrieve calling parameters batchjob see codice_435 batchjobs retrieved like environment variables actually stored environment command-line processors like dr-dos codice_5 multiuser dos codice_437/codice_438 terminal message process jp software 4dos 4os2 4nt take command windows cmd.exe support type pseudo-environment variables named system information variables novell caldera terminology internal variables jp software terminology used retrieve various possibly dynamic read-only information running system batch jobs returned values represent status system moment variables queried reading multiple times row may return different values even within command querying direct effect system since stored environment listed set exist external programs retrieve true environment variable name defined takes precedence corresponding variable environment variable deleted case-sensitive almost variables prefixed underscore codice_439 4dos etc convention f.e codice_440 dr-dos codice_5 f.e codice_260 addition 4dos 4os2 4nt take command also support called variable functions including user-definable ones work like internal variables take optional parameters f.e codice_443 may even change system status depending function system information variables supported dr-dos codice_5 system information variables supported dr-dos codice_5 networking loaded dynamic environment variables also named internal variables system information variables dos pseudo-environment variables supported codice_427 command-line extensions enabled expand various discrete values whenever queried values change queried multiple times even within command used batch jobs prompt stored environment consequently neither listed codice_22 exist external programs read case-sensitive indirectly also supported windows codice_5 modified internally call codice_602 execute commands", + "neighbors": [ + 22, + 108, + 134, + 234, + 255, + 275, + 295, + 338, + 377, + 412, + 503, + 579, + 615, + 631, + 764, + 816, + 870, + 904, + 920, + 940, + 961, + 1004, + 1027, + 1042, + 1050, + 1110, + 1138, + 1151, + 1188, + 1218, + 1243, + 1287, + 1304, + 1370, + 1374, + 1457, + 1458, + 1461, + 1517, + 1587 + ], + "mask": "Validation" + }, + { + "node_id": 1111, + "label": 3, + "text": "Classic_RISC_pipeline:classic risc pipeline history computer hardware early reduced instruction set computer central processing units risc cpus used similar architectural solution called classic risc pipeline cpus mips sparc motorola 88000 later notional cpu dlx invented education classic scalar risc designs fetched tried execute one instruction per cycle main common concept design five-stage execution instruction pipeline operation pipeline stage worked one instruction time stages consisted initial set flip-flops combinational logic operated outputs flip-flops instruction cache machines latency one cycle meaning instruction cache would ready next clock cycle instruction fetch stage 32-bit instruction fetched cache program counter pc register holds address current instruction feeds pc predictor sends program counter pc instruction cache read current instruction time pc predictor predicts address next instruction incrementing pc 4 instructions 4 bytes long prediction always wrong case taken branch jump exception see delayed branches later machines would use complicated accurate algorithms branch prediction branch target prediction guess next instruction address unlike earlier microcoded machines first risc machines microcode fetched instruction cache instruction bits shifted pipeline simple combinational logic pipeline stage could produce control signals datapath directly instruction bits result little decoding done stage traditionally called decode stage consequence lack decoding meant however instruction bits used specifying instruction also leaves fewer bits things like register indices mips sparc dlx instructions two register inputs decode stage two register names identified within instruction two registers named read register file mips design register file 32 entries time register file read instruction issue logic stage determined pipeline ready execute instruction stage issue logic would cause instruction fetch stage decode stage stall stall cycle stages would prevent initial flip-flops accepting new bits instruction decoded branch jump target address branch jump computed parallel reading register file branch condition computed register file read branch taken instruction jump pc predictor first stage assigned branch target rather incremented pc computed architectures made use alu execute stage cost slightly decreased instruction throughput decode stage ended quite lot hardware mips possibility branching two registers equal 32-bit-wide tree ran series register file read making long critical path stage also branch target computation generally required 16 bit add 14 bit incrementer resolving branch decode stage made possible single-cycle branch mispredict penalty since branches often taken thus mispredicted important keep penalty low execute stage actual computation occurs typically stage consists arithmetic logic unit also bit shifter may also include multiple cycle multiplier divider arithmetic logic unit responsible performing boolean operations nand xor xnor also performing integer addition subtraction besides result alu typically provides status bits whether result 0 overflow occurred bit shifter responsible shift rotations instructions simple risc machines divided three latency classes according type operation data memory needs accessed done stage stage single cycle latency instructions simply results forwarded next stage forwarding ensures one two cycle instructions always write results stage pipeline one write port register file used always available direct mapped virtually tagged data caching simplest far numerous data cache organizations two srams used one storing data storing tags stage single cycle two cycle instructions write results register file hennessy patterson coined term hazard situations instructions pipeline would produce wrong answers structural hazards occur two instructions might attempt use resources time classic risc pipelines avoided hazards replicating hardware particular branch instructions could used alu compute target address branch alu used decode stage purpose alu instruction followed branch would seen instructions attempt use alu simultaneously simple resolve conflict designing specialized branch target adder decode stage data hazards occur instruction scheduled blindly would attempt use data data available register file classic risc pipeline data hazards avoided one two ways bypassing also known operand forwarding suppose cpu executing following piece code instruction fetch decode stages send second instruction one cycle first flow pipeline shown diagram naive pipeline without hazard consideration data hazard progresses follows cycle 3 codice_1 instruction calculates new value codice_2 cycle codice_3 operation decoded value codice_2 fetched register file however codice_1 instruction yet written result codice_2 write-back normally occurs cycle 5 green box therefore value read register file passed alu execute stage codice_3 operation red box incorrect instead must pass data computed codice_1 back execute stage i.e red circle diagram codice_3 operation normally written-back solution problem pair bypass multiplexers multiplexers sit end decode stage flopped outputs inputs alu multiplexer selects decode stage logic compares registers written instructions execute access stages pipeline registers read instruction decode stage cause multiplexers select recent data bypass multiplexers make possible pipeline execute simple instructions latency alu multiplexer flip-flop without multiplexers latency writing reading register file would included latency instructions note data passed forward time data bypassed back earlier stage processed yet case data passed forward time codice_3 ready register alu codice_1 already computed however consider following instructions data read address codice_13 n't present data cache memory access stage codice_14 instruction time codice_3 instruction already alu resolve would require data memory passed backwards time input alu possible solution delay codice_3 instruction one cycle data hazard detected decode stage fetch decode stages stalled prevented flopping inputs stay state cycle execute access write-back stages downstream see extra no-operation instruction nop inserted codice_14 codice_3 instructions nop termed pipeline bubble since floats pipeline like air bubble occupying resources producing useful results hardware detect data hazard stall pipeline hazard cleared called pipeline interlock pipeline interlock used data forwarding however first example codice_1 followed codice_3 second example codice_14 followed codice_3 solved stalling first stage three cycles write-back achieved data register file correct causing correct register value fetched codice_3 decode stage causes quite performance hit processor spends lot time processing nothing clock speeds increased less forwarding logic wait data hazard detected quite easily program machine code written compiler stanford mips machine relied compiler add nop instructions case rather circuitry detect taxingly stall first two pipeline stages hence name mips microprocessor without interlocked pipeline stages turned extra nop instructions added compiler expanded program binaries enough instruction cache hit rate reduced stall hardware although expensive put back later designs improve instruction cache hit rate point acronym longer made sense control hazards caused conditional unconditional branching classic risc pipeline resolves branches decode stage means branch resolution recurrence two cycles long three implications four schemes solve performance problem branches delayed branches controversial first semantics complicated delayed branch specifies jump new location happens next instruction next instruction one unavoidably loaded instruction cache branch delayed branches criticized poor short-term choice isa design suppose 32-bit risc processes add instruction adds two large numbers result fit 32 bits happens simplest solution provided architectures wrapping arithmetic numbers greater maximum possible encoded value significant bits chopped fit usual integer number system 3000000000+3000000000=6000000000 unsigned 32 bit wrapping arithmetic 3000000000+3000000000=1705032704 6000000000 mod 2^32 may seem terribly useful largest benefit wrapping arithmetic every operation well defined result programmer especially programming language supporting large integers e.g lisp scheme may want wrapping arithmetic architectures e.g mips define special addition operations branch special locations overflow rather wrapping result software target location responsible fixing problem special branch called exception exceptions differ regular branches target address specified instruction branch decision dependent outcome instruction common kind software-visible exception one classic risc machines tlb miss see virtual memory exceptions different branches jumps control flow changes resolved decode stage exceptions resolved writeback stage exception detected following instructions earlier pipeline marked invalid flow end pipe results discarded program counter set address special exception handler special registers written exception location cause make easy fast software fix problem restart program cpu must take precise exception precise exception means instructions excepting instruction executed excepting instruction everything afterwards executed take precise exceptions cpu must commit changes software visible state program order in-order commit happens naturally classic risc pipeline instructions write results register file writeback stage writes automatically happen program order store instructions however write results store data queue access stage store instruction takes exception store data queue entry invalidated written cache data sram later occasionally either data instruction cache n't contain required datum instruction cases cpu must suspend operation cache filled necessary data must resume execution problem filling cache required data potentially writing back memory evicted cache line specific pipeline organization discussed two strategies handle suspend/resume problem first global stall signal signal activated prevents instructions advancing pipeline generally gating clock flip-flops start stage disadvantage strategy large number flip flops global stall signal takes long time propagate since machine generally stall cycle identifies condition requiring stall stall signal becomes speed-limiting critical path another strategy handle suspend/resume reuse exception logic machine takes exception offending instruction instructions invalidated cache filled necessary data instruction caused cache miss restarts expedite data cache miss handling instruction restarted access cycle happens one cycle data cache filled", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 919, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1113, + 1125, + 1143, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1430, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1112, + "label": 4, + "text": "Payload_(computing):payload computing computing telecommunications payload part transmitted data actual intended message headers metadata sent enable payload delivery context computer virus worm payload portion malware performs malicious action term borrowed transportation payload refers part load pays transportation computer security payload part private user text could also contain malware worms viruses performs malicious action deleting data sending spam encrypting data addition payload malware also typically overhead code aimed simply spreading avoiding detection computer programming common usage term context message protocols differentiate protocol overhead actual data example json web service response might string hello world payload rest protocol overhead computer networking data transmitted payload almost always encapsulated type frame composed framing bits frame check sequence examples ethernet frames point-to-point protocol ppp frames fibre channel frames v.42 modem frames", + "neighbors": [ + 11, + 91, + 144, + 149, + 225, + 293, + 310, + 338, + 343, + 379, + 439, + 479, + 518, + 528, + 576, + 675, + 698, + 703, + 739, + 740, + 750, + 757, + 762, + 771, + 800, + 898, + 1039, + 1090, + 1206, + 1303, + 1325, + 1327, + 1355, + 1361, + 1368, + 1379, + 1386, + 1416, + 1472, + 1573, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1113, + "label": 3, + "text": "Stack_register:stack register stack register computer central processor register whose purpose keep track call stack accumulator-based architecture machine may dedicated register sp intel x86 machine general register machine may register reserved convention pdp-11 risc machines designs data general eclipse dedicated register used reserved hardware memory address function machines late 1960s\u2014such pdp-8 hp 2100\u2014did compilers supported recursion subroutine instructions typically would save current location jump address set program counter next address simpler maintaining stack since one return location per subroutine code section recursion without considerable effort part programmer stack machine 2 stack registers \u2014 one keeps track call stack keep track stack 8086 main stack register called stack pointer sp stack segment register ss usually used store information memory segment stores call stack currently executed program sp points current stack top default stack grows downward memory newer values placed lower memory addresses push value stack codice_1 instruction used pop value stack codice_2 instruction used example assuming ss 1000h sp 0xf820 means current stack top physical address 0x1f820 due memory segmentation 8086 next two machine instructions program illustrates push works usually running program pushes registers stack make use registers purposes like call routine may change current values registers restore values stored stack program shall contain machine instructions like note program pops bx first pushed last note 8086 codice_1 codice_2 instructions work 16-bit elements simpler processors store stack pointer regular hardware register use arithmetic logic unit alu manipulate value typically push pop translated multiple micro-ops separately add/subtract stack pointer perform load/store memory newer processors contain dedicated stack engine optimize stack operations pentium first x86 processor introduce stack engine implementation stack pointer split among two registers esp 32-bit register esp 8-bit delta value updated directly stack operations push pop call ret opcodes operate directly esp register esp near overflow esp register referenced instructions esp \u2260 0 synchronisation micro-op inserted updates esp using alu resets esp 0 design remained largely unmodified later intel processors although esp expanded 64 bits stack engine similar intel also adopted amd k8 microarchitecture bulldozer need synchronization micro-ops removed internal design stack engine known", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1114, + "label": 5, + "text": "LogMeIn_Hamachi:logmein hamachi logmein hamachi virtual private network vpn application written alex pankratov 2004 capable establishing direct links computers behind network address translation nat firewalls without requiring reconfiguration user pc accessed directly without relays internet/wan side words establishes connection internet emulates connection would exist computers connected local area network lan hamachi acquired pankratov logmein 2009 currently available production version microsoft windows macos beta version linux system-vpn-based client compatible android ios paid subscribers hamachi runs background idle computers feature previously available users became restricted paid subscribers hamachi proprietary centrally-managed vpn system consisting server cluster managed vendor system client software installed end-user computers client software adds virtual network interface computer used intercepting outbound well injecting inbound vpn traffic outbound traffic sent operating system interface delivered client software encrypts authenticates sends destination vpn peer specially initiated udp connection hamachi currently handles tunneling ip traffic including broadcasts multicast windows version also recognizes tunnels ipx traffic client establishes maintains control connection server cluster connection established client goes login sequence followed discovery process state synchronization login step authenticates client server vice versa discovery used determine topology client internet connection specifically detect presence nat firewall devices route internet synchronization step brings client view private networks sync members networks member network goes online offline server instructs network peers either establish tear tunnels former establishing tunnels peers hamachi uses server-assisted nat traversal technique similar udp hole punching detailed information works made public process work certain combinations nat devices requiring user explicitly set port forward additionally 1.0 series client software capable relaying traffic vendor-maintained 'relay servers event unexpectedly losing connection server client retains tunnels starts actively checking status server unexpectedly loses client connection informs client peers fact expects also start liveliness checks enables hamachi tunnels withstand transient network problems route client server well short periods complete server unavailability hamachi clients also get closed port clients repaired port forwarding hamachi frequently used gaming remote administration vendor provides free basic service extra features fee february 2007 ip-level block imposed hamachi servers parts vietnamese internet space due scale system abuse originating blocked addresses company working less intrusive solution problem hamachi client normally assigned ip address logs system first time avoid conflicting existing private networks client side normal private ip address blocks 10.0.0.0/8 172.16.0.0/12 192.168.0.0/16 used november 19 2012 5.0.0.0/8 range used range previously unallocated allocated ripe ncc late 2010 space range used hosting providers public internet hamachi switched 25.0.0.0/8 block 25.0.0.0/8 block allocated british ministry defence organisations need communicate mod may experience problems specific internet routes attract traffic meant internal hosts alternatively find unable reach legitimate users addresses addresses used internally squatting established practice internet client supports ipv6 selected address assigned picked range registered logmein ip address assigned hamachi client henceforth associated client public crypto key long client retains key log system use ip address hamachi creates single broadcast domain clients makes possible use lan protocols rely ip broadcasts discovery announcement services hamachi networks following considerations apply hamachi use vpn application current builds hamachi available following operating systems prior versions 1.0.2.0 1.0.2.1 windows release many windows vista users experienced compatibility connection issues using hamachi march 30 2007 software includes vista tweaks answer os-related problems among specific solutions", + "neighbors": [ + 134, + 333, + 542, + 545, + 552, + 771, + 813, + 961, + 1003, + 1138, + 1386, + 1586 + ], + "mask": "Train" + }, + { + "node_id": 1115, + "label": 5, + "text": "SVDO:svdo svdo simultaneous voice ev-do data technology allows supported cdma2000 ev-do cellular phones maintain active 3g data session phone call previously capability able use data call found mobile phones using gsm cellular networks 2011 verizon released first svdo-supported phone htc thunderbolt following year sprint released first svdo-supported phone htc evo 4g lte although phones support lte already allows simultaneous voice data devices 3g data coverage use svdo 3g data session phone call", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1116, + "label": 5, + "text": "Data_link_layer:data link layer data layer layer 2 second layer seven-layer osi model computer networking layer protocol layer transfers data adjacent network nodes wide area network wan nodes local area network lan segment data link layer provides functional procedural means transfer data network entities might provide means detect possibly correct errors may occur physical layer data link layer concerned local delivery frames nodes level network data-link frames protocol data units called cross boundaries local area network inter-network routing global addressing higher-layer functions allowing data-link protocols focus local delivery addressing media arbitration way data link layer analogous neighborhood traffic cop endeavors arbitrate parties contending access medium without concern ultimate destination devices attempt use medium simultaneously frame collisions occur data-link protocols specify devices detect recover collisions may provide mechanisms reduce prevent examples data link protocols ethernet local area networks multi-node point-to-point protocol ppp hdlc adccp point-to-point dual-node connections internet protocol suite tcp/ip data link layer functionality contained within link layer lowest layer descriptive model also includes functionality encompassed osi model physical layer frame header contains source destination addresses indicate device originated frame device expected receive process contrast hierarchical routable addresses network layer layer-2 addresses flat meaning part address used identify logical physical group address belongs data link thus provides data transfer across physical link transfer reliable unreliable many data-link protocols acknowledgments successful frame reception acceptance data-link protocols might even form checksum check transmission errors cases higher-level protocols must provide flow control error checking acknowledgments retransmission networks ieee 802 local area networks data link layer described detail media access control mac logical link control llc sublayers means ieee 802.2 llc protocol used ieee 802 mac layers ethernet token ring ieee 802.11 etc. well non-802 mac layers fddi data-link-layer protocols hdlc specified include sublayers although protocols cisco hdlc use hdlc low-level framing mac layer combination different llc layer itu-t g.hn standard provides way create high-speed 1 gigabit/s local area network using existing home wiring power lines phone lines coaxial cables data link layer divided three sub-layers application protocol convergence logical link control media access control within semantics osi network architecture data-link-layer protocols respond service requests network layer perform function issuing service requests physical layer data link layer two sublayers logical link control llc media access control mac uppermost sublayer llc multiplexes protocols running top data link layer optionally provides flow control acknowledgment error notification llc provides addressing control data link specifies mechanisms used addressing stations transmission medium controlling data exchanged originator recipient machines mac may refer sublayer determines allowed access media one time e.g csma/cd times refers frame structure delivered based mac addresses inside generally two forms media access control distributed centralized may compared communication people network made people speaking i.e conversation pause random amount time attempt speak effectively establishing long elaborate game saying first media access control sublayer also determines one frame data ends next one starts \u2013 frame synchronization four means frame synchronization time based character counting byte stuffing bit stuffing services data link layer provides beside framing data link layers also include mechanisms detect even recover transmission errors receiver detect transmission error sender must add redundant information form bits error detection code frame sent receiver obtains frame error detection code recomputes verifies whether received error detection code matches computed error detection code match frame considered valid error detection code defined function computes amount redundant bits corresponding string total number bits simplest error detection code parity bit allows receiver detect transmission errors affected single bit among transmitted bits multiple flipped bits checking method might able unveil receiver side advanced methods parity error detection exist providing higher grades quality features simple example works using metadata transmitting word hello encoding letter position alphabet thus letter coded 1 b 2 shown table right adding resulting numbers yields 8 5 12 12 15 52 5 2 7 calculates metadata finally 8 5 12 12 15 7 numbers sequence transmitted receiver see end transmission errors receiver knows last number received error-detecting metadata data message receiver recalculate math metadata matches concluded data received error-free though receiver sees something like 7 5 12 12 15 7 sequence first element altered error run check calculating 7 5 12 12 15 51 5 1 6 discard received data defective since 6 equal 7 internet protocol suite tcp/ip osi data link layer functionality contained within lowest layer link layer tcp/ip link layer operating scope link host connected concerns hardware issues point obtaining hardware mac addresses locating hosts link transmitting data frames onto link link layer functionality described rfc 1122 defined differently data link layer osi encompasses methods affect local link tcp/ip model top-down comprehensive design reference networks formulated purpose illustrating logical groups scopes functions needed design suite internetworking protocols tcp/ip needed operation internet general direct strict comparisons osi tcp/ip models avoided layering tcp/ip principal design criterion general considered harmful rfc 3439 particular tcp/ip dictate strict hierarchical sequence encapsulation requirements attributed osi protocols following table shows various networking models number layers varies three seven networking models textbooks secondary sources may conflict intent rfc 1122 ietf primary sources", + "neighbors": [ + 52, + 109, + 311, + 346, + 425, + 430, + 442, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 833, + 856, + 965, + 977, + 1042, + 1206, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1428, + 1438, + 1443, + 1448, + 1452, + 1453, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 1117, + "label": 2, + "text": "Nokia_N81:nokia n81 nokia n81 symbian os smartphone announced nokia 29 august 2007 released next month runs s60 3rd edition feature pack 1 n81 marketed entertainment device focused music gaming first device came preloaded n-gage 2.0 gaming service 2008 albeit public beta features two dedicated gaming keys used n-gage games would later also appear n96 n85 5730 xpressmusic launch n-gage 2.0 n81 specifically chosen nokia advertisements also much marketed music-centric smartphone one first support nokia music store service stereo speakers considered loud several reviewers claimed n81 much like older nokia n91 high sound output quality therefore highly suitable audiophiles four-way silver-coloured d-pad display also contains new capacitive sensor called navi wheel allows scrolling s60 gallery music player applications 'stroking key similar manner ipod click wheel unique feature rarely appears mobile handsets navi wheel would later also appear nokia nseries handsets n78 n85 n79 n81 modest specifications compared nokia n95 2-megapixel camera lacking gps hsdpa weighing 20 grams heavier however n81 arm11 369 mhz processor fastest nokia device time nokia n81 notably features sliding spring-loaded physical keylock top device located next 3.5 mm jack first nseries device swapped miniusb port favour microusb variant called n81 8gb 8-gigabytes internal flash memory also announced time version retailed 430 euros taxes 70 euros standard version requires microsd memory card expand 12 megabytes storage n81 would succeeded n85 nokia n81 lower sound output compared n91 due release new firmware version according nokia must follow international standard wherein device initial default volume must set low cause damage users cnet found buggy slow badly designed s21 gave 3/5 praising feature set criticising plasticky design however musical capabilities highly praised", + "neighbors": [ + 3, + 21, + 112, + 162, + 238, + 253, + 264, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1118, + "label": 9, + "text": "Spice_Lisp:spice lisp spice lisp scientific personal integrated computing environment programming language dialect lisp implementation originally written carnegie mellon university cmu spice lisp group targeted microcode 16-bit workstation perq operating system accent used workstation microcode abilities provided microcodes languages pascal c ada implement stack machine architecture store data structures 32-bit objects enable run time type-checking would later popular workstations spice lisp evolved implementation common lisp renamed cmu common lisp cmucl", + "neighbors": [ + 27, + 46, + 56, + 65, + 173, + 194, + 203, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1009, + 1010, + 1021, + 1066, + 1076, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1213, + 1221, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1119, + "label": 9, + "text": "Flavors_(programming_language):flavors programming language flavors early object-oriented extension lisp developed howard cannon mit artificial intelligence laboratory lisp machine programming language lisp machine lisp first programming language include mixins symbolics used lisp machines eventually developed new flavors original new flavors message passing oo models hugely influential development common lisp object system clos implementations flavors also available common lisp new flavors replaced message sending calling generic functions flavors offers daemons default method combination called flavors offers features found clos clos offers following features found flavors", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 755, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1120, + "label": 9, + "text": "Rust_(programming_language):rust programming language rust multi-paradigm system programming language focused safety especially safe concurrency rust syntactically similar c++ designed provide better memory safety maintaining high performance rust originally designed graydon hoare mozilla research contributions dave herman brendan eich others designers refined language writing servo layout browser engine rust compiler compiler free open-source software dual-licensed mit license apache license 2.0 rust loved programming language stack overflow developer survey 2016 2017 2018 2019 rust intended language highly concurrent highly safe systems programming large creating maintaining boundaries preserve large-system integrity led feature set emphasis safety control memory layout concurrency performance idiomatic rust comparable performance idiomatic c++ concrete syntax rust similar c c++ blocks code delimited curly brackets control flow keywords codice_1 codice_2 codice_3 codice_4 c c++ keywords implemented however rust functions use keyword codice_5 pattern matching less familiar versed languages despite superficial resemblance c c++ syntax rust deeper sense closer ml family languages haskell language nearly every part function body expression even control flow operators example ordinary codice_1 expression also takes place function need end codice_7 expression case last expression function creates return value system designed memory safe permit null pointers dangling pointers data races safe code data values initialized fixed set forms require inputs already initialized replicate function languages pointers either valid codice_8 linked list binary tree data structures rust core library provides option type used test pointer codice_9 value codice_10 rust also introduces added syntax manage lifetimes compiler reasons borrow checker rust use automated garbage collection system like used go java .net framework instead memory resources managed resource acquisition initialization raii convention optional reference counting rust provides deterministic management resources low overhead rust also favors stack allocation values perform implicit boxing also concept references using codice_11 symbol involve run-time reference counting safety using pointers verified compile time borrow checker preventing dangling pointers forms undefined behavior rust ownership system values unique owner scope value scope owner values passed immutable reference using codice_12 mutable reference using codice_13 value using codice_14 times either multiple immutable references one mutable reference rust compiler enforces rules compile time also checks references valid type system supports mechanism similar type classes called traits inspired directly haskell language facility ad hoc polymorphism achieved adding constraints type variable declarations features haskell higher-kinded polymorphism yet supported rust features type inference variables declared keyword codice_15 variables require value initially assigned determine type compile-time error results branch code fails assign value variable variables assigned multiple times must marked keyword codice_16 functions given generic parameters usually require generic type implement certain trait traits within function generic value used traits means generic function type-checked soon defined contrast c++ templates fundamentally duck typed checked instantiated concrete types c++ concepts address issue expected part c++20 2020 however implementation rust generics similar typical implementation c++ templates separate copy code generated instantiation called monomorphization contrasts type erasure scheme typically used java haskell benefit monomorphization optimized code specific use case drawback increased compile time size resulting binaries object system within rust based around implementations traits structured types implementations fulfill role similar classes within languages defined keyword codice_17 inheritance polymorphism provided traits allow methods defined mixed implementations structured types used define fields implementations traits define fields traits provide inheritance among benefits prevents diamond problem multiple inheritance c++ words rust supports interface inheritance replaces implementation inheritance composition see composition inheritance language grew personal project begun 2006 mozilla employee graydon hoare stated project possibly named rust family fungi mozilla began sponsoring project 2009 announced 2010 year work shifted initial compiler written ocaml self-hosting compiler written rust named successfully compiled 2011. uses llvm back end first numbered pre-alpha release rust compiler occurred january 2012 rust 1.0 first stable release released may 15 2015 following 1.0 stable point releases delivered every six weeks features developed nightly rust tested alpha beta releases last six weeks along conventional static typing version 0.4 rust also supported typestates typestate system modeled assertions program statements use special codice_18 statement discrepancies could discovered compile time rather program running might case assertions c c++ code typestate concept unique rust first introduced language nil typestates removed practice little used though function still achieved branding pattern style object system changed considerably within versions 0.2 0.3 0.4 rust version 0.2 introduced classes first time version 0.3 adding several features including destructors polymorphism use interfaces rust 0.4 traits added means provide inheritance interfaces unified traits removed separate feature classes also removed replaced combination implementations structured types starting rust 0.9 ending rust 0.11 rust two built-in pointer types codice_19 codice_20 simplifying core memory model reimplemented pointer types standard library codice_21 removed codice_22 january 2014 editor-in-chief dr dobb andrew binstock commented rust chances become competitor c++ upcoming languages go nim nimrod according binstock rust widely viewed remarkably elegant language adoption slowed changed repeatedly versions rust third-most-loved programming language 2015 stack overflow annual survey took first place 2016 2017 2018 2019 language referenced oxidised metal simple hello world program written rust codice_23 macro prints message standard output fn main fn factorial u64 u64 fn factorial u64 u64 fn factorial u64 u64 web browser several related components written rust including many operating systems os related components written rust january 2019 oses included blogos intermezzos quiltos redox rustos rux tefflin tock wikipedia articles exist", + "neighbors": [ + 31, + 65, + 78, + 81, + 107, + 117, + 134, + 152, + 176, + 210, + 216, + 225, + 258, + 275, + 292, + 306, + 331, + 347, + 373, + 378, + 392, + 427, + 506, + 509, + 521, + 538, + 567, + 579, + 594, + 597, + 682, + 713, + 742, + 782, + 790, + 820, + 825, + 862, + 869, + 886, + 919, + 948, + 959, + 961, + 998, + 1005, + 1011, + 1016, + 1028, + 1103, + 1138, + 1152, + 1166, + 1210, + 1221, + 1225, + 1227, + 1235, + 1302, + 1311, + 1324, + 1376, + 1388, + 1414, + 1418, + 1423, + 1430, + 1457, + 1491, + 1532, + 1539, + 1582, + 1604, + 1626 + ], + "mask": "Validation" + }, + { + "node_id": 1121, + "label": 4, + "text": "Global_surveillance_disclosures_(2013\u2013present):global surveillance disclosures 2013\u2013present ongoing news reports international media revealed operational details united states national security agency nsa international partners global surveillance foreign nationals u.s. citizens reports mostly emanate cache top secret documents leaked ex-nsa contractor edward snowden obtained whilst working booz allen hamilton one largest contractors defense intelligence united states addition trove u.s. federal documents snowden cache reportedly contains thousands australian british canadian intelligence files accessed via exclusive five eyes network june 2013 first snowden documents published simultaneously washington post guardian attracting considerable public attention disclosure continued throughout 2013 small portion estimated full cache documents later published media outlets worldwide notably new york times united states canadian broadcasting corporation australian broadcasting corporation der spiegel germany globo brazil le monde france l'espresso italy nrc handelsblad netherlands dagbladet norway el pa\u00eds spain sveriges television sweden media reports shed light implications several secret treaties signed members ukusa community efforts implement global surveillance example der spiegel revealed german foreign intelligence service bnd transfers massive amounts intercepted data nsa swedish television revealed national defence radio establishment fra provided nsa data cable collection secret treaty signed 1954 bilateral cooperation surveillance security intelligence agencies involved practice global surveillance include australia asd britain gchq canada csec denmark pet france dgse germany bnd italy aise netherlands aivd norway nis spain cni switzerland ndb singapore sid well israel isnu receives raw unfiltered data u.s. citizens shared nsa june 14 2013 united states prosecutors charged edward snowden espionage theft government property late july 2013 granted one-year temporary asylum russian government contributing deterioration russia\u2013united states relations august 6 2013 u.s. president barack obama made public appearance national television told americans n't domestic spying program spying americans towards end october 2013 british prime minister david cameron warned guardian publish leaks receive da-notice november 2013 criminal investigation disclosure undertaken britain metropolitan police service december 2013 guardian editor alan rusbridger said published think 26 documents far 58,000 've seen extent media reports responsibly informed public disputed january 2014 obama said sensational way disclosures come often shed heat light critics sean wilentz noted many snowden documents released concern domestic surveillance us uk defense establishment weigh strategic harm period following disclosures heavily civic public benefit first assessment disclosures pentagon concluded snowden committed biggest theft u.s. secrets history united states sir david omand former director gchq described snowden disclosure catastrophic loss british intelligence ever barton gellman pulitzer prize\u2013winning journalist led washington post coverage snowden disclosures summarized leaks follows disclosure revealed specific details nsa close cooperation u.s. federal agencies federal bureau investigation fbi central intelligence agency cia addition agency previously undisclosed financial payments numerous commercial partners telecommunications companies well previously undisclosed relationships international partners britain france germany secret treaties foreign governments recently established sharing intercepted data citizens disclosures made public course several months since june 2013 press several nations trove leaked former nsa contractor edward j. snowden obtained trove working booz allen hamilton george brandis attorney-general australia asserted snowden disclosure serious setback western intelligence since second world war global surveillance programs include nsa also getting data directly telecommunications companies codenamed artifice lithium serenade steelknight x real identities companies behind codenames included snowden document dump protected exceptionally controlled information prevents wide circulation even like snowden otherwise necessary security clearance although exact size snowden disclosure remains unknown following estimates put various government officials contractor nsa snowden granted access u.s. government documents along top secret documents several allied governments via exclusive five eyes network snowden claims currently physical possession documents surrendered copies journalists met hong kong according lawyer snowden pledged release documents russia leaving responsibility disclosures solely journalists 2014 following news outlets accessed documents provided snowden australian broadcasting corporation canadian broadcasting corporation channel 4 der spiegel el pais el mundo l'espresso le monde nbc nrc handelsblad dagbladet globo south china morning post s\u00fcddeutsche zeitung sveriges television guardian new york times washington post 1970s nsa analyst perry fellwock pseudonym winslow peck revealed existence ukusa agreement forms basis echelon network whose existence revealed 1988 lockheed employee margaret newsham months september 11 attacks aftermath details global surveillance apparatus provided various individuals former mi5 official david shayler journalist james bamford followed aftermath snowden revelations pentagon concluded snowden committed biggest theft u.s. secrets history united states australia coalition government described leaks damaging blow dealt australian intelligence history sir david omand former director gchq described snowden disclosure catastrophic loss british intelligence ever april 2012 nsa contractor edward snowden began downloading documents year snowden made first contact journalist glenn greenwald employed guardian contacted documentary filmmaker laura poitras january 2013 may 2013 snowden went temporary leave position nsa citing pretext receiving treatment epilepsy towards end may traveled hong kong greenwald poitras guardian defence intelligence correspondent ewen macaskill flew hong kong meet snowden u.s.-based editor guardian janine gibson held several meetings new york city decided greenwald poitras guardian defence intelligence correspondent ewen macaskill would fly hong kong meet snowden june 5 first media report based leaked material guardian exposed top secret court order showing nsa collected phone records 120 million verizon subscribers order numbers parties call well location data unique identifiers time call duration call handed fbi turned records nsa according wall street journal verizon order part controversial data program seeks stockpile records calls made u.s. collect information directly t-mobile us verizon wireless part foreign ownership ties june 6 2013 second media disclosure revelation prism surveillance program collects e-mail voice text video chats foreigners unknown number americans microsoft google facebook yahoo apple tech giants published simultaneously guardian washington post der spiegel revealed nsa spying multiple diplomatic missions european union eu united nations headquarters new york specific episodes within four-year period nsa hacked several chinese mobile-phone companies chinese university hong kong tsinghua university beijing asian fiber-optic network operator pacnet australia canada new zealand uk explicitly exempted nsa attacks whose main target eu germany method bugging encrypted fax machines used eu embassy codenamed dropmire 2009 g-20 london summit british intelligence agency government communications headquarters gchq intercepted communications foreign diplomats addition gchq intercepting storing mass quantities fiber-optic traffic via tempora two principal components tempora called mastering internet mti global telecoms exploitation data preserved three days metadata kept thirty days data collected gchq tempora shared national security agency nsa united states 2001 2011 nsa collected vast amounts metadata records detailing email internet usage americans via stellar wind later terminated due operational resource constraints subsequently replaced newer surveillance programs shelltrumpet processed one trillionth metadata record end december 2012 nsa follows specific procedures target non-u.s. persons minimize data collection u.s. persons court-approved policies allow nsa according boundless informant 97 billion pieces intelligence collected 30-day period ending march 2013 97 billion sets information 3 billion data sets originated u.s. computer networks around 500 million metadata records collected german networks august 2013 revealed bundesnachrichtendienst bnd germany transfers massive amounts metadata records nsa der spiegel disclosed germany targeted country 27 members european union due nsa systematic monitoring storage germany telephone internet connection data according magazine nsa stores data around half billion communications connections germany month data includes telephone calls emails mobile-phone text messages chat transcripts nsa gained massive amounts information captured monitored data traffic europe example december 2013 nsa gathered average day metadata 15 million telephone connections 10 million internet datasets nsa also monitored european commission brussels monitored eu diplomatic facilities washington united nations placing bugs offices well infiltrating computer networks u.s. government made part upstream data collection program deals companies ensure access hence capability surveil undersea fiber-optic cables deliver e-mails web pages electronic communications phone calls one continent another speed light according brazilian newspaper globo nsa spied millions emails calls brazilian citizens australia new zealand involved joint operation nsa global analytical system xkeyscore among numerous allied facilities contributing xkeyscore four installations australia one new zealand globo released nsa document titled revealed specific locations codenames fornsat intercept stations 2002 according edward snowden nsa established secret intelligence partnerships many western governments foreign affairs directorate fad nsa responsible partnerships according snowden organized foreign governments insulate political leaders public outrage event global surveillance partnerships leaked interview published der spiegel snowden accused nsa bed together germans nsa granted german intelligence agencies bnd foreign intelligence bfv domestic intelligence access controversial xkeyscore system return bnd turned copies two systems named mira4 veras reported exceed nsa sigint capabilities certain areas every day massive amounts metadata records collected bnd transferred nsa via bad aibling station near munich germany december 2012 alone bnd handed 500 million metadata records nsa document dated january 2013 nsa acknowledged efforts bnd undermine privacy laws according nsa document dated april 2013 germany become nsa prolific partner section separate document leaked snowden titled success stories nsa acknowledged efforts german government expand bnd international data sharing partners addition german government well aware prism surveillance program long edward snowden made details public according angela merkel spokesman steffen seibert two separate prism programs \u2013 one used nsa used nato forces afghanistan two programs identical guardian revealed details nsa xkeyscore tool allows government analysts search vast databases containing emails online chats browsing histories millions individuals without prior authorization microsoft developed surveillance capability deal interception encrypted chats outlook.com within five months service went testing nsa access outlook.com emails prism collects data prior encryption addition microsoft worked fbi enable nsa gain access cloud storage service skydrive internal nsa document dating august 3 2012 described prism surveillance program team sport even reason suspect u.s. citizens wrongdoing cia national counterterrorism center allowed examine federal government files possible criminal behavior previously ntc barred unless person terror suspect related investigation snowden also confirmed stuxnet cooperatively developed united states israel report unrelated edward snowden french newspaper le monde revealed france dgse also undertaking mass surveillance described illegal outside serious control documents leaked edward snowden seen s\u00fcddeutsche zeitung sz norddeutscher rundfunk revealed several telecom operators played key role helping british intelligence agency government communications headquarters gchq tap worldwide fiber-optic communications telecom operators assigned particular area international fiber-optic network individually responsible following networks infiltrated gchq tat-14 europe-usa atlantic crossing 1 europe-usa circe south france-uk circe north netherlands-uk flag atlantic-1 flag europa-asia sea-me-we 3 southeast asia-middle east-western europe sea-me-we 4 southeast asia-middle east-western europe solas ireland-uk uk-france 3 uk-netherlands 14 ulysses europe-uk yellow uk-usa pan european crossing telecommunication companies participated forced choice matter companies subsequently paid gchq participation infiltration cables according sz gchq access majority internet telephone communications flowing throughout europe listen phone calls read emails text messages see websites internet users around world visiting also retain analyse nearly entire european internet traffic gchq collecting data transmitted united kingdom northern europe via undersea fibre optic telecommunications cable sea-me-we 3 security intelligence division sid singapore co-operates australia accessing sharing communications carried sea-me-we-3 cable australian signals directorate asd also partnership british american singaporean intelligence agencies tap undersea fibre optic telecommunications cables link asia middle east europe carry much australia international phone internet traffic u.s. runs top-secret surveillance program known special collection service scs based 80 u.s. consulates embassies worldwide nsa hacked united nations video conferencing system summer 2012 violation un agreement nsa intercepting communications americans direct contact foreigners targeted overseas also searching contents vast amounts e-mail text communications country americans mention information foreigners surveillance also spied al jazeera gained access internal communications systems nsa built surveillance network capacity reach roughly 75 u.s. internet traffic u.s. law-enforcement agencies use tools used computer hackers gather information suspects internal nsa audit may 2012 identified 2776 incidents i.e violations rules court orders surveillance americans foreign targets u.s. period april 2011 march 2012 u.s. officials stressed mistakes intentional fisa court supposed provide critical oversight u.s. government vast spying programs limited ability must trust government report improperly spies americans legal opinion declassified august 21 2013 revealed nsa intercepted three years many 56,000 electronic communications year americans suspected links terrorism fisa court oversees surveillance found operation unconstitutional 2011 corporate partner access project major u.s. telecommunications providers receive hundreds millions dollars year nsa voluntary cooperation nsa providers global communications took 1970s cover name blarney letter drafted obama administration specifically inform congress government mass collection americans telephone communications data withheld lawmakers leaders house intelligence committee months key vote affecting future program nsa paid gchq \u00a3100 million 2009 2012 exchange funds gchq must pull weight seen pull weight documents referenced article explain weaker british laws regarding spying selling point nsa gchq also developing technology exploit mobile phone time nsa legal authority secret backdoor databases gathered large internet companies enabling search u.s. citizens email phone calls without warrant privacy civil liberties oversight board urged u.s. intelligence chiefs draft stronger us surveillance guidelines domestic spying finding several guidelines updated 30 years u.s. intelligence analysts deliberately broken rules designed prevent spying americans choosing ignore so-called minimisation procedures aimed protecting privacy used nsa agency enormous eavesdropping power spy love interests u.s. foreign secret intelligence court ruled october 2011 nsa activities unconstitutional agency paid millions dollars major internet companies cover extra costs incurred involvement prism surveillance program mastering internet mti part interception modernisation programme imp british government involves insertion thousands dpi deep packet inspection black boxes various internet service providers revealed british media 2009 2013 revealed nsa made \u00a317.2 million financial contribution project capable vacuuming signals 200 fibre-optic cables physical points entry great britain guardian new york times reported secret documents leaked snowden showing nsa collaboration technology companies part aggressive multipronged effort weaken encryption used commercial software gchq team dedicated cracking hotmail google yahoo facebook traffic germany domestic security agency bundesverfassungsschutz bfv systematically transfers personal data german residents nsa cia seven members united states intelligence community exchange information espionage software israel sweden italy also cooperating american british intelligence agencies secret treaty codenamed lustre french intelligence agencies transferred millions metadata records nsa obama administration secretly permission foreign intelligence surveillance court 2011 reverse restrictions national security agency use intercepted phone calls e-mails permitting agency search deliberately americans communications massive databases searches take place surveillance program congress authorized 2008 section 702 foreign intelligence surveillance act law target must foreigner reasonably believed outside united states court must approve targeting procedures order good one year warrant target would thus longer required means communications americans could picked without court first determining probable cause people talking terrorists spies foreign powers fisc extended length time nsa allowed retain intercepted u.s. communications five years six years extension possible foreign intelligence counterintelligence purposes measures done without public debate specific authority congress special branch nsa called follow money ftm monitors international payments banking credit card transactions later stores collected data nsa financial databank tracfin nsa monitored communications brazil president dilma rousseff top aides agency also spied brazil oil firm petrobras well french diplomats gained access private network ministry foreign affairs france swift network united states nsa uses analysis phone call e-mail logs american citizens create sophisticated graphs social connections identify associates locations certain times traveling companions personal information nsa routinely shares raw intelligence data israel without first sifting remove information u.s. citizens effort codenamed genie computer specialists control foreign computer networks using covert implants form remotely transmitted malware tens thousands devices annually worldwide sales smartphones began exceeding feature phones nsa decided take advantage smartphone boom particularly advantageous smartphone combines myriad data would interest intelligence agency social contacts user behavior interests location photos credit card numbers passwords internal nsa report 2010 stated spread smartphone occurring extremely rapidly \u2014developments certainly complicate traditional target analysis according document nsa set task forces assigned several smartphone manufacturers operating systems including apple inc. iphone ios operating system well google android mobile operating system similarly britain gchq assigned team study crack blackberry heading iphone capability document notes smaller nsa programs known scripts perform surveillance 38 different features ios 3 ios 4 operating systems include mapping feature voicemail photos well google earth facebook yahoo messenger september 9 2013 internal nsa presentation iphone location services published der spiegel one slide shows scenes apple 1984 -themed television commercial alongside words knew 1984 ... another shows steve jobs holding iphone text ... would big brother ... third shows happy consumers iphones completing question ... zombies would paying customers october 4 2013 washington post guardian jointly reported nsa gchq made repeated attempts spy anonymous internet users communicating secret via anonymity network tor several surveillance operations involved implantation malicious code computers tor users visit particular websites nsa gchq partly succeeded blocking access anonymous network diverting tor users insecure channels government agencies also able uncover identity anonymous internet users communications security establishment cse using program called olympia map communications brazil mines energy ministry targeting metadata phone calls emails ministry australian federal government knew prism surveillance program months edward snowden made details public nsa gathered hundreds millions contact lists personal e-mail instant messaging accounts around world agency target individuals instead collected contact lists large numbers amount sizable fraction world e-mail instant messaging accounts analysis data enables agency search hidden connections map relationships within much smaller universe foreign intelligence targets nsa monitored public email account former mexican president felipe calder\u00f3n thus gaining access communications high-ranking cabinet members emails several high-ranking members mexico security forces text mobile phone communication current mexican president enrique pe\u00f1a nieto nsa tries gather cellular landline phone numbers\u2014often obtained american diplomats\u2014for many foreign officials possible contents phone calls stored computer databases regularly searched using keywords nsa monitoring telephone conversations 35 world leaders u.s. government first public acknowledgment tapped phones world leaders reported october 28 2013 wall street journal internal u.s. government review turned nsa monitoring 35 world leaders gchq tried keep mass surveillance program secret feared damaging public debate scale activities could lead legal challenges guardian revealed nsa monitoring telephone conversations 35 world leaders given numbers official another u.s. government department confidential memo revealed nsa encouraged senior officials departments white house state pentagon share rolodexes agency could add telephone numbers leading foreign politicians surveillance systems reacting news german leader angela merkel arriving brussels eu summit accused u.s. breach trust saying need trust allies partners must established repeat spying among friends acceptable anyone goes every citizen germany nsa collected 2010 data ordinary americans cellphone locations later discontinued operational value britain muscular programme nsa gchq secretly broken main communications links connect yahoo google data centers around world thereby gained ability collect metadata content hundreds millions user accounts mobile phone german chancellor angela merkel might tapped u.s. intelligence according spiegel monitoring goes back 2002 ended summer 2013 new york times reported germany evidence nsa surveillance merkel began george w. bush tenure learning der spiegel magazine nsa listening personal mobile phone merkel compared snooping practices nsa stasi reported march 2014 der spiegel merkel also placed nsa surveillance list alongside 122 world leaders october 31 2013 hans-christian str\u00f6bele member german bundestag met snowden moscow revealed former intelligence contractor readiness brief german government nsa spying highly sensitive signals intelligence collection program known stateroom involves interception radio telecommunications internet traffic operated diplomatic missions five eyes australia britain canada new zealand united states numerous locations around world program conducted u.s. diplomatic missions run concert u.s. intelligence agencies nsa cia joint venture group called special collection service scs whose members work undercover shielded areas american embassies consulates officially accredited diplomats enjoy special privileges diplomatic protection able look listen unhindered scs example used american embassy near brandenburg gate berlin monitor communications germany government district parliament seat government stateroom surveillance programme australia operates clandestine surveillance facilities intercept phone calls data across much asia france nsa targeted people belonging worlds business politics french state administration nsa monitored recorded content telephone communications history connections target i.e metadata actual surveillance operation performed french intelligence agencies behalf nsa cooperation france nsa confirmed director nsa keith b. alexander asserted foreign intelligence services collected phone records war zones areas outside borders provided nsa french newspaper le monde also disclosed new prism upstream slides see page 4 7 8 coming prism/us-984xn overview presentation spain nsa intercepted telephone conversations text messages emails millions spaniards spied members spanish government december 10 2012 january 8 2013 nsa collected metadata 60 million telephone calls spain according documents leaked snowden surveillance spanish citizens jointly conducted nsa intelligence agencies spain new york times reported nsa carries eavesdropping effort dubbed operation dreadnought iranian leader ayatollah ali khamenei 2009 visit iranian kurdistan agency collaborated gchq u.s. national geospatial-intelligence agency collecting radio transmissions aircraft airports examining khamenei convoy satellite imagery enumerating military radar stations according story objective operation communications fingerprinting ability distinguish khamenei communications people iran story revealed operation code-named ironavenger nsa intercepted e-mails sent country allied united states government adversary ally conducting spear-phishing attack e-mails contained malware nsa gathered documents login credentials belonging enemy country along knowledge ally capabilities attacking computers according british newspaper independent british intelligence agency gchq maintains listening post roof british embassy berlin capable intercepting mobile phone calls wi-fi data long-distance communications german capital including adjacent government buildings reichstag seat german parliament chancellery seat germany head government clustered around brandenburg gate operating code-name quantum insert gchq set fake website masquerading linkedin social website used professional networking part efforts install surveillance software computers telecommunications operator belgacom addition headquarters oil cartel opec infiltrated gchq well nsa bugged computers nine opec employees monitored general secretary opec three years gchq using automated monitoring system code-named royal concierge infiltrate reservation systems least 350 prestigious hotels many different parts world order target search analyze reservations detect diplomats government officials first tested 2010 aim royal concierge track travel plans diplomats often supplemented surveillance methods related human intelligence humint covert operations include wiretapping room telephones fax machines used targeted hotels well monitoring computers hooked hotel network november 2013 australian broadcasting corporation guardian revealed australian signals directorate dsd attempted listen private phone calls president indonesia wife indonesian foreign minister marty natalegawa confirmed president contacted ambassador canberra natalegawa said tapping indonesian politicians personal phones violates every single decent legal instrument think of\u2014national indonesia national australia international well high-ranking indonesian politicians targeted dsd include carrying title 3g impact update classified presentation leaked snowden revealed attempts asd/dsd keep pace rollout 3g technology indonesia across southeast asia asd/dsd motto placed bottom page reads reveal secrets\u2014protect secret deal approved british intelligence officials nsa storing analyzing internet email records uk citizens since 2007 nsa also proposed 2005 procedure spying citizens uk five-eyes nations alliance even partner government explicitly denied u.s. permission proposal partner countries must neither informed particular type surveillance procedure towards end november new york times released internal nsa report outlining agency efforts expand surveillance abilities five-page document asserts law united states kept needs nsa conduct mass surveillance golden age signals intelligence grounds optimism nsa words report titled sigint strategy 2012\u20132016 also said u.s. try influence global commercial encryption market commercial relationships emphasized need revolutionize analysis vast data collection radically increase operational impact november 23 2013 dutch newspaper nrc handelsblad reported netherlands targeted u.s. intelligence agencies immediate aftermath world war ii period surveillance lasted 1946 1968 also included interception communications european countries including belgium france west germany norway dutch newspaper also reported nsa infected 50,000 computer networks worldwide often covertly malicious spy software sometimes cooperation local authorities designed steal sensitive information according classified documents leaked snowden australian signals directorate asd formerly known defence signals directorate offered share intelligence information collected intelligence agencies ukusa agreement data shared foreign countries include bulk unselected unminimised metadata collected asd provided information condition australian citizens targeted time asd assessed unintentional collection metadata australian nationals viewed significant issue target later identified australian national asd required contacted ensure warrant could sought consideration given whether medical legal religious information would automatically treated differently types data however decision made agency would make determinations case-by-case basis leaked material specify asd collected intelligence information however section 7 intelligence services act 2001 commonwealth states asd role ... obtain intelligence capabilities intentions activities people organisations outside australia ... possible asd metadata intelligence holdings focused foreign intelligence collection within bounds australian law washington post revealed nsa tracking locations mobile phones world tapping cables connect mobile networks globally serve u.s. cellphones well foreign ones process nsa collects five billion records phone locations daily basis enables nsa analysts map cellphone owners relationships correlating patterns movement time thousands millions phone users cross paths washington post also reported gchq nsa make use location data advertising tracking files generated normal internet browsing cookies operated google known pref pinpoint targets government hacking bolster surveillance norwegian intelligence service nis cooperates nsa gained access russian targets kola peninsula civilian targets general nis provides information nsa politicians energy armament top secret memo nsa lists following years milestones norway\u2013united states america sigint agreement norus agreement nsa considers nis one reliable partners agencies also cooperate crack encryption systems mutual targets according nsa norway made objections requests nis december 5 sveriges television reported national defence radio establishment fra conducting clandestine surveillance operation sweden targeting internal politics russia operation conducted behalf nsa receiving data handed fra swedish-american surveillance operation also targeted russian energy interests well baltic states part ukusa agreement secret treaty signed 1954 sweden united states united kingdom canada australia new zealand regarding collaboration intelligence sharing result snowden disclosures notion swedish neutrality international politics called question internal document dating year 2006 nsa acknowledged relationship sweden protected top secret level nation political neutrality specific details sweden cooperation members ukusa agreement include according documents leaked snowden special source operations nsa sharing information containing logins cookies googleprefid tailored access operations division nsa well britain gchq agency 2010 g-20 toronto summit u.s. embassy ottawa transformed security command post six-day spying operation conducted nsa closely coordinated communications security establishment canada csec goal spying operation among others obtain information international development banking reform counter trade protectionism support u.s. policy goals behalf nsa csec set covert spying posts 20 countries around world italy special collection service nsa maintains two separate surveillance posts rome milan according secret nsa memo dated september 2010 italian embassy washington d.c. targeted two spy operations nsa due concerns terrorist criminal networks may secretly communicating via computer games nsa gchq cia fbi conducting surveillance scooping data networks many online games including massively multiplayer online role-playing games mmorpgs world warcraft well virtual worlds second life xbox gaming console nsa cracked commonly used cellphone encryption technology a5/1 according classified document leaked snowden agency process encrypted a5/1 even acquired encryption key addition nsa uses various types cellphone infrastructure links carrier networks determine location cellphone user tracked visitor location registers us district court judge district columbia richard leon declared december 16 2013 mass collection metadata americans telephone records national security agency probably violates fourth amendment prohibition unreasonable searches seizures leon granted request preliminary injunction blocks collection phone data two private plaintiffs larry klayman conservative lawyer charles strange father cryptologist killed afghanistan helicopter shot 2011 ordered government destroy records gathered judge stayed action ruling pending government appeal recognizing 68-page opinion significant national security interests stake case novelty constitutional issues however federal judge william h. pauley iii new york city ruled u.s. government global telephone data-gathering system needed thwart potential terrorist attacks work everyone calls swept u.s. district judge pauley also ruled congress legally set program violate anyone constitutional rights judge also concluded telephone data swept nsa belong telephone users telephone companies ruled nsa obtains data telephone companies probes find links callers potential terrorists use data even search fourth amendment also concluded controlling precedent smith v. maryland smith bedrock holding individual legitimate expectation privacy information provided third parties judge pauley wrote american civil liberties union declared january 2 2012 appeal judge pauley ruling nsa bulk phone record collection legal government legitimate interest tracking associations suspected terrorists tracking associations require government subject every citizen permanent surveillance deputy aclu legal director jameel jaffer said statement recent years american british intelligence agencies conducted surveillance 1,100 targets including office israeli prime minister heads international aid organizations foreign energy companies european union official involved antitrust battles american technology businesses catalog high-tech gadgets software developed nsa tailored access operations tao leaked german news magazine der spiegel dating 2008 catalog revealed existence special gadgets modified capture computer screenshots usb flash drives secretly fitted radio transmitters broadcast stolen data airwaves fake base stations intended intercept mobile phone signals well many secret devices software implants listed tailored access operations tao division nsa intercepted shipping deliveries computers laptops order install spyware physical implants electronic gadgets done close cooperation fbi cia nsa officials responded spiegel reports statement said tailored access operations unique national asset front lines enabling nsa defend nation allies tao work centred computer network exploitation support foreign intelligence collection separate disclosure unrelated snowden french tr\u00e9sor public runs certificate authority found issued fake certificates impersonating google order facilitate spying french government employees via man-in-the-middle attacks nsa working build powerful quantum computer capable breaking types encryption effort part us 79.7 million research program known penetrating hard targets involves extensive research carried large shielded rooms known faraday cages designed prevent electromagnetic radiation entering leaving currently nsa close producing basic building blocks allow agency gain complete quantum control two semiconductor qubits quantum computer successfully built would enable nsa unlock encryption protects data held banks credit card companies retailers brokerages governments health care providers according new york times nsa monitoring approximately 100,000 computers worldwide spy software named quantum quantum enables nsa conduct surveillance computers one hand also create digital highway launching cyberattacks hand among targets chinese russian military also trade institutions within european union nyt also reported nsa access alter computers connected internet secret technology use nsa since 2008 prerequisite physical insertion radio frequency hardware spy manufacturer unwitting user technology relies covert channel radio waves transmitted tiny circuit boards usb cards inserted surreptitiously computers cases sent briefcase-size relay station intelligence agencies set miles away target technology also transmit malware back infected computer channel 4 guardian revealed existence dishfire massive database nsa collects hundreds millions text messages daily basis gchq given full access database uses obtain personal information britons exploiting legal loophole day database receives stores following amounts data database supplemented analytical tool known prefer program processes sms messages extract types information including contacts missed call alerts privacy civil liberties oversight board report mass surveillance released january 23 2014 recommends end bulk telephone metadata i.e. bulk phone records \u2013 phone numbers dialed call times durations call content collection \u2013 collection program create special advocate involved cases fisa court judge release future past fisc decisions involve novel interpretations fisa significant questions law technology compliance according joint disclosure new york times guardian propublica nsa gchq begun working together collect store data dozens smartphone application software 2007 latest 2008 gchq report leaked snowden asserts anyone using google maps smartphone working support gchq system nsa gchq traded recipes various purposes grabbing location data journey plans made target uses google maps vacuuming address books buddy lists phone logs geographic data embedded photos posted mobile versions numerous social networks facebook flickr linkedin twitter services separate 20-page report dated 2012 gchq cited popular smartphone game angry birds example application could used extract user data taken together forms data collection would allow agencies collect vital information user life including home country current location geolocation age gender zip code marital status income ethnicity sexual orientation education level number children etc gchq document dated august 2012 provided details squeaky dolphin surveillance program enables gchq conduct broad real-time monitoring various social media features social media traffic youtube video views like button facebook blogspot/blogger visits without knowledge consent companies providing social media features agency squeaky dolphin program collect analyze utilize youtube facebook blogger data specific situations real time analysis purposes program also collects addresses billions videos watched daily well user information analysis purposes 2009 united nations climate change conference copenhagen nsa five eyes partners monitored communications delegates numerous countries done give policymakers negotiating advantage communications security establishment canada csec tracking canadian air passengers via free wi-fi services major canadian airport passengers exited airport terminal continued tracked showed wi-fi locations across canada csec document dated may 2012 agency described gained access two communications systems 300,000 users order pinpoint specific imaginary target operation executed behalf nsa trial run test new technology capable tracking target makes occasional forays cities/regions technology subsequently shared canada five eyes partners \u2013 australia new zealand britain united states according research s\u00fcddeutsche zeitung tv network ndr mobile phone former german chancellor gerhard schr\u00f6der monitored 2002 onwards reportedly government opposition military intervention iraq source latest information document leaked edward snowden document containing information national sigint requirement list nsrl previously interpreted referring angela merkel mobile however s\u00fcddeutsche zeitung ndr claim confirmation nsa insiders surveillance authorisation pertains individual political post \u2013 2002 still held schr\u00f6der according research two media outlets schr\u00f6der placed number 388 list contains names persons institutions put surveillance nsa gchq launched cyber-attack activist network anonymous using denial-of-service attack dos shut chatroom frequented network members spy attack dubbed rolling thunder conducted gchq unit known joint threat research intelligence group jtrig unit successfully uncovered true identities several anonymous members nsa section 215 bulk telephony metadata program seeks stockpile records calls made u.s. collecting less 30 percent americans call records inability keep pace explosion cellphone use according washington post controversial program permits nsa warrant granted secret foreign intelligence surveillance court record numbers length location every call participating carriers intercept reported u.s. government using primarily nsa surveillance target people drone strikes overseas report intercept author detail flawed methods used locate targets lethal drone strikes resulting deaths innocent people according washington post nsa analysts collectors i.e nsa personnel controls electronic surveillance equipment use nsa sophisticated surveillance capabilities track individual targets geographically real time drones tactical units aimed weaponry targets take unnamed us law firm reported mayer brown targeted australia asd according snowden documents asd offered hand intercepted communications nsa allowed government authorities able continue cover talks providing highly useful intelligence interested us customers nsa gchq documents revealed anti-secrecy organization wikileaks activist groups targeted government surveillance criminal prosecution particular ip addresses visitors wikileaks collected real time us government urged allies file criminal charges founder wikileaks julian assange due organization publication afghanistan war logs wikileaks organization designated malicious foreign actor quoting unnamed nsa official germany bild sonntag reported whilst president obama order stop spying merkel obeyed focus shifted bugging leading government business figures including interior minister thomas de maiziere close confidant merkel caitlin hayden security adviser president obama quoted newspaper report saying us made clear gathers intelligence exactly way states intercept reveals government agencies infiltrating online communities engaging false flag operations discredit targets among people nothing terrorism national security threats two main tactics currently used injection sorts false material onto internet order destroy reputation targets use social sciences techniques manipulate online discourse activism generate outcomes considers desirable guardian reported britain surveillance agency gchq aid national security agency intercepted stored webcam images millions internet users suspected wrongdoing surveillance program codenamed optic nerve collected still images yahoo webcam chats one image every five minutes bulk saved agency databases agency discovered surprising number people use webcam conversations show intimate parts body person estimating 3 11 yahoo webcam imagery harvested gchq contains undesirable nudity nsa built infrastructure enables covertly hack computers mass scale using automated systems reduce level human oversight process nsa relies automated system codenamed turbine essence enables automated management control large network implants form remotely transmitted malware selected individual computer devices bulk tens thousands devices quoted intercept turbine designed allow current implant network scale large size millions implants creating system automated control implants groups instead individually nsa shared many files use implants counterparts so-called five eyes surveillance alliance \u2013 united kingdom canada new zealand australia among things due turbine control implants nsa capable turbine implants linked relies upon large network clandestine surveillance sensors nsa installed locations across world including agency headquarters maryland eavesdropping bases used agency misawa japan menwith hill england codenamed turmoil sensors operate sort high-tech surveillance dragnet monitoring packets data sent across internet turbine implants exfiltrate data infected computer systems turmoil sensors automatically identify data return nsa analysis targets communicating turmoil system used send alerts tips turbine enabling initiation malware attack identify surveillance targets nsa uses series data selectors flow across internet cables selectors include email addresses ip addresses unique cookies containing username identifying information sent user computer websites google facebook hotmail yahoo twitter unique google advertising cookies track browsing habits unique encryption key fingerprints traced specific user computer ids sent across internet windows computer crashes updates cia accused u.s. senate intelligence committee chairwoman dianne feinstein spying stand-alone computer network established committee investigation allegations cia abuse george w. bush-era detention interrogation program voice interception program codenamed mystic began 2009 along retro short retrospective retrieval retro voice audio recording buffer allows retrieval captured content 30 days past mystic program capable recording 100 percent foreign country telephone calls enabling nsa rewind review conversations 30 days relating metadata capability store 30 days recorded conversations mystic enables nsa pull instant history person movements associates plans march 21 le monde published slides internal presentation communications security establishment canada attributed piece malicious software french intelligence csec presentation concluded list malware victims matched french intelligence priorities found french cultural reference malware code including name babar popular french children character developer name titi french telecommunications corporation orange s.a. shares call data french intelligence agency dgse hands intercepted data gchq nsa spied chinese technology company huawei huawei leading manufacturer smartphones tablets mobile phone infrastructure wlan routers installs fiber optic cable according der spiegel kind technology \u2026 decisive nsa battle data supremacy nsa operation named shotgiant able access huawei email archive source code huawei communications products us government longstanding concerns huawei may independent people liberation army chinese government might use equipment manufactured huawei conduct cyberespionage cyberwarfare goals nsa operation assess relationship huawei pla learn chinese government plans use information huawei spy huawei customers including iran afghanistan pakistan kenya cuba former chinese president hu jintao chinese trade ministry banks well telecommunications companies also targeted nsa intercept published document nsa employee discussing build database ip addresses webmail facebook accounts associated system administrators nsa gain access networks systems administer end march 2014 der spiegel intercept published based series classified files archive provided reporters nsa whistleblower edward snowden articles related espionage efforts gchq nsa germany british gchq targeted three german internet firms information internet traffic passing internet exchange points important customers german internet providers technology suppliers well future technical trends business sector company employees nsa granted foreign intelligence surveillance court authority blanket surveillance germany people institutions regardless whether affected suspected committed offense without individualized court order specifying march 7 2013 addition germany chancellor angela merkel listed surveillance search machine database named nymrod along 121 others foreign leaders intercept wrote nsa uses nymrod system 'find information relating targets would otherwise tough track according internal nsa documents nymrod sifts secret reports based intercepted communications well full transcripts faxes phone calls communications collected computer systems 300 'cites merkel listed available intelligence reports transcripts nsa operatives read towards end april edward snowden said united states surveillance agencies spy americans anyone else world contrary anything said government point article published ars technica shows nsa tailored access operations tao employees intercepting cisco router intercept wikileaks revealed information countries communications collected part mystic surveillance program may 19 intercept reported nsa recording archiving nearly every cell phone conversation bahamas system called somalget subprogram mystic mass surveillance occurring without bahamian government permission aside bahamas intercept reported nsa interception cell phone metadata kenya philippines mexico fifth country name due credible concerns could lead increased violence wikileaks released statement may 23 claiming afghanistan unnamed nation statement responding revelations nsa said implication nsa foreign intelligence collection arbitrary unconstrained false global surveillance operations nsa exploits flood images included emails text messages social media videoconferences communications harvest millions images images used nsa sophisticated facial recognition programs track suspected terrorists intelligence targets vodafone revealed secret wires allowed government agencies direct access networks access require warrants direct access wire often equipment locked room six countries vodafone operates law requires telecommunication companies install access allows governments vodafone name countries case governments retaliated imprisoning staff shami chakrabarti liberty said governments access phone calls flick switch unprecedented terrifying snowden revealed internet already treated fair game bluster well wearing pretty thin \u2013 analogue laws need digital overhaul vodafone published first law enforcement disclosure report june 6 2014 vodafone group privacy officer stephen deadman said pipes exist direct access model exists making call end direct access means government agencies obtaining people communication data without official warrant external visibility receive demand push back agency fact government issue piece paper important constraint powers used gus hosein director privacy international said never thought telcos would complicit brave step vodafone hopefully telcos become brave disclosure need braver fighting back illegal requests laws above-top-secret documentation covert surveillance program named overseas processing centre 1 opc-1 codenamed circuit gchq published register based documents leaked edward snowden gchq taps undersea fiber optic cables via secret spy bases near strait hormuz yemen bt vodafone implicated danish newspaper dagbladet information intercept revealed june 19 2014 nsa mass surveillance program codenamed rampart-a rampart-a 'third party countries tap fiber optic cables carrying majority world electronic communications secretly allowing nsa install surveillance equipment fiber-optic cables foreign partners nsa turn massive amounts data like content phone calls faxes e-mails internet chats data virtual private networks calls made using voice ip software like skype nsa return partners receive access nsa sophisticated surveillance equipment spy mass data flows territory among partners participating nsa mass surveillance program denmark germany week july 4 31-year-old male employee germany intelligence service bnd arrested suspicion spying united states employee suspected spying german parliamentary committee investigating nsa spying scandal former nsa official whistleblower william binney spoke centre investigative journalism conference london according binney least 80 audio calls metadata recorded stored us nsa lies stores also stated majority fiber optic cables run u.s. accident allows us view communication coming washington post released review cache provided snowden containing roughly 160,000 text messages e-mails intercepted nsa 2009 2012 newspaper concluded nine ten account holders whose conversations recorded agency intended surveillance targets caught net agency cast somebody else analysis post also noted many account holders americans july 9 soldier working within germany federal ministry defence bmvg fell suspicion spying united states result july 4 case one german government expelled cia station chief germany july 17 july 18 former state department official john tye released editorial washington post highlighting concerns data collection executive order 12333 tye concerns rooted classified material access state department though publicly released classified materials intercept reported nsa secretly providing data nearly two dozen u.s. government agencies 'google-like search engine called icreach database intercept reported accessible domestic law enforcement agencies including fbi drug enforcement administration built contain 850 billion metadata records phone calls emails cellphone locations text messages based documents obtained snowden intercept reported nsa gchq broken internal computer network gemalto stolen encryption keys used sim cards later 2010. company world largest manufacturer sim cards making two billion cards year keys intelligence agencies could eavesdrop cell phones without knowledge mobile phone operators foreign governments new zealand herald partnership intercept revealed new zealand government used xkeyscore spy candidates position world trade organization director general also members solomon islands government january 2015 dea revealed collecting metadata records telephone calls made americans 116 countries linked drug trafficking dea program separate telephony metadata programs run nsa april usa today reported dea data collection program began 1992 included telephone calls united states canada mexico current former dea officials described program precursor nsa similar programs dea said program suspended september 2013 review nsa programs ultimately terminated snowden provided journalists intercept gchq documents regarding another secret program karma police calling world biggest data mining operation formed create profiles every visible internet user browsing habits 2009 stored 1.1 trillion web browsing sessions 2012 recording 50 billion sessions per day 2017 disclosures wikileaks dubbed vault7 disclosure provided impetus creation social movements mass surveillance restore fourth actions like stop watching us day fight back legal front electronic frontier foundation joined coalition diverse groups filing suit nsa several human rights organizations urged obama administration prosecute protect whistleblower snowden amnesty international human rights watch transparency international index censorship among others economic front several consumer surveys registered drop online shopping banking activity result snowden revelations domestically president barack obama claimed spying americans white house press secretary jay carney asserted surveillance programs revealed snowden authorized congress international front u.s. attorney general eric holder stated target even foreign persons overseas without valid foreign intelligence purpose prime minister david cameron warned journalists n't demonstrate social responsibility difficult government stand back act deputy prime minister nick clegg emphasized media absolutely defend principle secrecy intelligence agencies foreign secretary william hague claimed take great care balance individual privacy duty safeguard public uk national security hague defended five eyes alliance reiterated british-u.s. intelligence relationship must endangered saved many lives former prime minister tony abbott stated every australian governmental agency every australian official home abroad operates accordance law abbott criticized australian broadcasting corporation unpatriotic due reporting documents provided snowden abbott described traitor foreign minister julie bishop also denounced snowden traitor accused unprecedented treachery bishop defended five eyes alliance reiterated australian\u2013u.s intelligence relationship must endangered saves lives july 2013 chancellor angela merkel defended surveillance practices nsa described united states truest ally throughout decades nsa surveillance merkel revealed however chancellor compared nsa stasi according guardian berlin using controversy nsa spying leverage enter exclusive five eyes alliance interior minister hans-peter friedrich stated americans take data privacy concerns seriously testifying german parliament friedrich defended nsa surveillance cited five terrorist plots german soil prevented nsa however april 2014 another german interior minister criticized united states failing provide sufficient assurances germany reined spying tactics thomas de maiziere close ally merkel told der spiegel u.s. intelligence methods may justified large extent security needs tactics excessive over-the-top minister foreign affairs carl bildt defended fra described surveillance practices national necessity minister defence karin enstr\u00f6m said sweden intelligence exchange countries critical security intelligence operations occur within framework clear legislation strict controls parliamentary oversight interior minister ronald plasterk apologized incorrectly claiming nsa collected 1.8 million records metadata netherlands plasterk acknowledged fact dutch intelligence services collected records transferred nsa danish prime minister helle thorning-schmidt praised american intelligence agencies claiming prevented terrorist attacks denmark expressed personal belief danish people grateful americans surveillance later claimed danish authorities basis assuming american intelligence agencies performed illegal spying activities towards denmark danish interests july 2013 german government announced extensive review germany intelligence services august 2013 u.s. government announced extensive review u.s. intelligence services october 2013 british government announced extensive review british intelligence services december 2013 canadian government announced extensive review canada intelligence services january 2014 u.s. president barack obama said sensational way disclosures come often shed heat light critics sean wilentz claimed nsa acted far responsibly claims made leakers publicized press wilentz view leakers gone far beyond justifiably blowing whistle abusive programs addition alarmism u.s. domestic surveillance many snowden documents released thus far nothing whatsoever domestic surveillance edward lucas former moscow bureau chief economist agreed asserting snowden revelations neatly suspiciously fits interests one country russia citing masha gessen statement russian propaganda machine gotten much mileage us citizen since angela davis murder trial 1971 bob cesca objected new york times failing redact name nsa employee specific location al qaeda group targeted series slides paper made publicly available russian journalist andrei soldatov argued snowden revelations negative consequences internet freedom russia russian authorities increased surveillance regulation pretext protecting privacy russian users snowden name invoked russian legislators supported measures forcing platforms google facebook twitter gmail youtube locate servers russian soil install sorm black boxes servers russian authorities could control soldatov also contended result disclosures international support national governments take powers organizations involved coordinating internet global architectures grown could lead balkanization internet restricted free access information montevideo statement future internet cooperation issued october 2013 icann organizations warned internet fragmentation national level expressed strong concern undermining trust confidence internet users globally due recent revelations late 2014 freedom house said ome states using revelations widespread surveillance u.s. national security agency nsa excuse augment monitoring capabilities frequently little oversight often aimed political opposition human rights activists", + "neighbors": [ + 43, + 88, + 162, + 186, + 234, + 363, + 365, + 379, + 415, + 429, + 483, + 509, + 528, + 658, + 692, + 763, + 813, + 1138, + 1309, + 1368, + 1373, + 1480 + ], + "mask": "Test" + }, + { + "node_id": 1122, + "label": 3, + "text": "Barrett_Communications:barrett communications barrett communications specialist manufacturer supplier commercial high frequency hf tactical hf high frequency vhf communications equipment head office design manufacturing located perth western australia barrett communications founded 1976 company steadily grew began exporting first commercial hf radios 1987 range expanded include transceivers base portable mobile modems power supplies amplifiers antennas accessories may 2009 barrett communication acquired q-mac electronics increased barrett communications product range include vhf radio systems august 2011 barrett communications received certification joint interoperability test command jitc barrett 2050 hf mobile base station transceiver certification includes conformance mil-std-188-141b well automatic link establishment ale specifications mil-std-188-141b appendix 2012 barrett communications exports 150 countries global dealer network 65 countries company maintains quality assurance system covering design manufacturing approved iso 9001 2008 barrett communications also operates marketing office united kingdom barrett europe limited wholly owned subsidiary barrett communications located whiteley hampshire nvis communications/barrett consulting division north american systems integrator barrett communications usa canada barrett communications designs manufactures range hf communications equipment commercial tactical use range includes transceivers base portable mobile modems power supplies amplifiers antennas accessories barrett \u2019 range hf communications equipment ranges basic voice communication data email fax gps tracking barrett \u2019 prc-2090 tactical radio meets mil-std 180g fed-std 1045 mil-std 188-141b ale jitc certifiable as-nzs 4770:200 barrett communications designs manufactures range vhf communications equipment specifically tactical use range known barrett prc-2080 tactical vhf radio system includes vhf 30 88 mhz squad brigade base mobile transceivers rebroadcast units equipment provides digital voice encryption frequency hopping data positional awareness rebroadcast capability", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1123, + "label": 9, + "text": "MIT/GNU_Scheme:mit/gnu scheme mit/gnu scheme programming language dialect implementation language scheme type lisp produce native binary files x86 ia-32 x86-64 processor architecture supports standard r7rs mostly free open-source software released gnu general public license gpl first released developers massachusetts institute technology mit 1986 free software even free software foundation gnu gpl existed part gnu project features rich runtime software library powerful source code level debugger native code compiler built-in emacs-like editor named edwin books structure interpretation computer programs structure interpretation classical mechanics include software run mit/gnu scheme edwin built-in emacs-like editor comes mit/gnu scheme edwin normally displays codice_1 data buffer mode line mini-buffer starts emacs mode line gives information like name buffer whether buffer read-only modified unmodified", + "neighbors": [ + 27, + 46, + 56, + 85, + 134, + 173, + 194, + 203, + 209, + 251, + 292, + 301, + 308, + 313, + 323, + 332, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 806, + 825, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1138, + 1173, + 1180, + 1190, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1509, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1124, + "label": 6, + "text": "Tmpfs:tmpfs tmpfs temporary file storage paradigm implemented many unix-like operating systems intended appear mounted file system data stored volatile memory instead persistent storage device similar construction ram disk appears virtual disk drive hosts disk file system everything stored tmpfs temporary sense files directly created non-volatile storage hard drive although swap space used backing store case low memory situations reboot everything tmpfs lost memory used tmpfs grows shrinks accommodate files contains many unix distributions enable use tmpfs default /tmp branch file system shared memory observed df example linux distributions e.g debian ubuntu /tmp normal directory /dev/shm uses tmpfs several independent variants tmpfs concept one earliest developed sun microsystems sunos operating systems like bsds linux provided sunos 4 includes likely earliest implementation tmpfs first appeared sunos 4.0 late 1987 together new orthogonal address space management allowed object memory mapped solaris /tmp directory made tmpfs file system default starting solaris 2.1 released december 1992 output solaris codice_1 command show swap background storage tmpfs volume tmpfs supported linux kernel beginning version 2.4 linux tmpfs previously known shmfs based ramfs code used bootup also uses page cache unlike ramfs supports swapping less-used pages swap space well filesystem size inode limits prevent memory situations defaulting half physical ram half number ram pages respectively 4.2bsd introduced mfs memory-based file system implemented applying existing ffs disk filesystem virtual memory region tmpfs memory filesystem implemented using conventional in-memory data structures order improve performance mfs merged official netbsd source tree september 10 2005 available 4.0 later versions freebsd ported netbsd implementation available 7.0 later versions dragonfly bsd also ported netbsd implementation available 2.5.1 later versions openbsd ported netbsd tmpfs implementation well initially started pedro martelletto improved many others enabled builds december 17 2013 first release openbsd tmpfs included 5.5 openbsd 6.0 disabled tmpfs due lack maintenance", + "neighbors": [ + 34, + 38, + 40, + 55, + 63, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1157, + 1201, + 1202, + 1234, + 1241, + 1252, + 1257, + 1283, + 1301, + 1322, + 1366, + 1381, + 1445, + 1449, + 1459, + 1538, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1125, + "label": 3, + "text": "Scalar_processor:scalar processor scalar processors represent class computer processors scalar processor processes one data item time typical data items integers floating point numbers scalar processor classified sisd processor single instructions single data flynn taxonomy contrast vector processor single instruction operates simultaneously multiple data items referred simd difference analogous difference scalar vector arithmetic superscalar processor hand executes one instruction clock cycle simultaneously dispatching multiple instructions redundant functional units processor functional unit separate cpu core execution resource within single cpu arithmetic logic unit bit shifter multiplier", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1126, + "label": 2, + "text": "Lubuntu:lubuntu lubuntu lightweight linux distribution based ubuntu using lxqt desktop environment place ubuntu gnome desktop lubuntu originally touted lighter less resource hungry energy-efficient aims functional yet modular distribution focused getting way letting users use computer lubuntu originally used lxde desktop moved lxqt desktop release lubuntu 18.10 october 2018 name lubuntu portmanteau lxqt ubuntu lxqt name derives merger lxde razor-qt projects word ubuntu means humanity towards others zulu xhosa languages lubuntu received official recognition formal member ubuntu family 11 may 2011 commencing lubuntu 11.10 released 13 october 2011 lxde desktop first made available ubuntu october 2008 release ubuntu 8.10 intrepid ibex early versions lubuntu including 8.10 9.04 9.10 available separate iso image downloads could installed ubuntu separate lubuntu-desktop packages ubuntu repositories lxde also retroactively installed earlier ubuntu versions february 2009 mark shuttleworth invited lxde project become self-maintained project within ubuntu community aim leading dedicated new official ubuntu derivative called lubuntu march 2009 lubuntu project started launchpad mario behling including early project logo project also established official ubuntu wiki project page includes listings applications packages components august 2009 first test iso released live cd installation option initial testing september 2009 linux magazine reviewer christopher smart showed lubuntu ram usage half xubuntu ubuntu normal installation desktop use two thirds less live cd use 2014 project announced gtk+-based lxde qt-based razor-qt would merging new qt-based lxqt desktop lubuntu would consequently moving lxqt transition complete release lubuntu 18.10 october 2018 first regular release employ lxqt desktop lenny became lubuntu mascot 2014 2018 transition becoming lxqt-based aim lubuntu re-thought development team previously intended users older computers typically ten years old newer introduction windows vista pcs older computers gained faster processors much ram 2018 ten-year-old computers remained much capable case five years earlier result lubuntu development team simon quigley decided change focus emphasize well-documented distribution based lxqt give users functional yet modular experience lightweight default available language developers also decided stop recommending minimum system requirements 18.04 lts release developer simon quigley announced august 2018 lubuntu 20.10 switch wayland display server protocol default january 2019 developers formed lubuntu council new body formalize previous organization written constitution 30 december 2009 first alpha 1 preview version iso lubuntu 10.04 lucid lynx made available testing alpha 2 following 24 january 2010 first beta released 20 march 2010 stable version lubuntu 10.04 released 2 may 2010 four days behind main ubuntu release date 28 april 2010 lubuntu 10.04 released 32-bit iso file users could install 64-bit version 64-bit mini iso install required packages lubuntu 10.04 intended long-term support lts release unlike ubuntu 10.04 lucid lynx going supported 18 months however since infrastructure ubuntu 10.10 maverick meerkat thus lubuntu 10.10 dropped support i586 processors including via c3 amd k6 amd geode/national semiconductor cpus release lubuntu 10.10 prompted community extend support april 2013 lubuntu 10.04 long term support version reviewing lubuntu 10.04 alpha 1 january 2010 joey sneddon omg ubuntu wrote many preconceptions regarding lxde/lubuntu found presently surprised pleasant look pleasant use although doubt would switch gnome lxde give excellent performance would benefit writing final 10.10 release 10 october 2010 sneddon termed nimble easy-to-use desktop writing lubuntu 10.04 may 2010 damien oh make tech easier said looking lightweight alternative install old pc netbook lubuntu great choice \u2019 get eye candy special graphical effects get fast speed low cost \u2019 time put old pc back work also reviewing lubuntu 10.04 may 2010 robin catling full circle magazine said first thing impresses running lubuntu modest compaq evo laptop pentium-m 512 mb ram small memory footprint ... beats karmic gnome xubuntu xfce mile evo used take 60 seconds-plus boot desktop lxde takes exactly 30 yet 're restricted gtk2 applications well supported synaptic hooks ubuntu repositories package management pull open office replace default abi-word without crippling machine catling note file manager pcmanfm file manager needs little maturity compete thunar competent robust application n't hog resources like nautilus dolphin june 2010 jim lynch reviewed lubuntu 10.04 saying one thing \u2019 notice using lubuntu desktop \u2019 fast fast even underpowered machine lubuntu perform well \u2019 one best things distro leaves behind bloated eye candy sometimes bog gnome kde ... \u2019 run noticeable problems lubuntu fast stable \u2019 see noticeable bugs problems hate happens since \u2019 much interesting readers run one nasty problem another hopefully next version lubuntu chock full horrendous problems bugs kidding september 2010 lead developer julien lavergne announced lubuntu project granted official status derivative ubuntu part ubuntu 10.04 release cycle work would continue goal ubuntu 10.10 lavergne explained reasons still resource problem canonical /ubuntu infrastructure resolved cycle also writing real process integrate new member ubuntu family \u2019 still finished lubuntu 10.10 released schedule 10 october 2010 day ubuntu 10.10 maverick meerkat built underlying infrastructure ubuntu 10.10 developer julien lavergne said lubuntu actually part ubuntu family build current ubuntu infrastructure release considered \u00ab stable beta \u00bb result could final stable release included ubuntu family version 10.10 introduced new artwork distribution including new panel menu backgrounds new openbox theme new lubuntu menu logo splash images desktop wallpaper lubuntu 10.10 accepted official ubuntu derivative release point due lack integration infrastructure canonical ubuntu work continuing towards goal lubuntu 10.10 released 32-bit iso file users could install 64-bit version 64-bit mini iso install required packages developer julien lavergne wrote 10.10 incorporated many changes 10.04 changes considered improvements improvements included new theme designed rafael laguna incorporation xpad note taking ace-of-penguins games lxtask lxde task manager place xfce application replacing epdfview pdf reader evince due memory leak problem removing pyneighborhood minuses included last-minute rewrite installer integrate properly resulted installation instability raising minimum installation ram 180 mb 256 mb issue incorporation ubuntu update manager increased ram usage 10 mb lubuntu 10.04 indication updates available deemed necessary minimum system requirements lubuntu 10.10 described mario behling comparable pentium ii celeron systems 128 mb ram configuration may yield slow yet usable system lubuntu chief developer julien lavergne stated minimum ram install lubuntu 10.10 256 mb reviewing lubuntu 10.10 right release october 2010 jim lynch eye linux said lubuntu \u2019 biggest appeal speed \u2019 disappointment area applications load open quickly overall experience lubuntu quite positive detected stability problems lubuntu 10.10 quite solid reliable entire time used lynch fault choice synaptic package manager one strange things lubuntu offers synaptic package manager xubuntu 10.10 hand offers ubuntu software center well synaptic \u2019 sure ubuntu software center missing lubuntu would make lot sense include since much easier attractive way manage software synaptic gets job done \u2019 less friendly new users \u2019 match ubuntu software center terms usability comfort mid-december 2010 lubuntu risen 11th place distrowatch six month list popular linux distributions 319 distributions right behind puppy linux well ahead xubuntu 36th place reviewing linux distribution rankings distrowatch early january 2011 year 2010 versus 2009 ladislav bodn\u00e1r noted looking tables interesting thing rise distributions use lightweight full-featured lxde desktop openbox window manager example lubuntu comfortably beats kubuntu terms page hits ... project announced development schedule november 2010 lubuntu 11.04 released time 28 april 2011 lubuntu 11.04 released 32-bit iso file users could install 64-bit version 64-bit mini iso install required packages unofficial 64-bit iso 11.04 also released kendall weaver peppermint os improvements lubuntu 11.04 included replacing aqualung audacious default music player elimination hardware abstraction layer introducing movable desktop icons ubuntu font used default improved menu translations reorganized menus release also introduced new default theme artwork designed raphael laguna known ozone partly based xubuntu \u2019 default bluebird theme lubuntu 11.04 run little 128 mb ram requires 256 mb ram install using graphical installer lubuntu 11.04 completed process official status member ubuntu family mario behling stated next goals project clear apart constantly improving distribution lubuntu project aims become official flavour ubuntu mark shuttleworth remarked lubuntu developers upon release 11.04 reviewing lubuntu 11.04 release joey sneddon omg ubuntu commented look lubuntu \u2019 'traditional interface comfort agitated interface revolution heralded gnome 3 ubuntu unity certainly \u2019 appeal 'bling fans \u2019 say attention \u2019 paid appearance new default theme raphael laguna use ubuntu font helps give sometimes-basic-feeling os distinctly professional look subject official status sneddon said lubuntu long sought official sanction ubuntu project family classed official 'derivative ubuntu earning place alongside kubuntu xubuntu accomplished release lubuntu 11.04 hold acceptance remains disappointing expected review 12 may 2011 jim lynch desktop linux reviews faulted 11.04 using ubuntu software center lack alternative wallpapers use abiword place libreoffice praise lubuntu saying speed one nice things lubuntu even slow older system \u2019 usually quite fast \u2019 amazing achieve cut unnecessary eye-candy bloat also 12 may 2011 koen vervloesem writing linux user developer criticized applications bundled lubuntu saying software choices rather odd however instance chromium default web browser sensible move distro aimed low-end computers developers also ship firefox lubuntu shows web browsers internet menu also default screenshot program scrot command-line program shown accessories menu everyone find another odd choice install applications synaptic default lubuntu \u2019 ubuntu software center preferred software installation program ubuntu good releases minor inconveniences though since get access full ubuntu software repositories meaning install favourite applications blink eye one month release lubuntu 11.04 risen ninth place distrowatch 30-day list popular distributions lubuntu 11.10 first version lubuntu official sanction member ubuntu family part status change lubuntu 11.10 used latest ubuntu infrastructure iso files hosted ubuntu release include many new features work focused integration ubuntu instead 11.10 released 13 october 2011 day ubuntu 11.10 released september 2011 announced work lubuntu software center progressing ubuntu software center resource intensive lubuntu lubuntu using less user-friendly synaptic package manager recent releases development new lightweight application manager lubuntu intended rectify problem although users course install ubuntu software center using synaptic changes lubuntu 11.10 include built ubuntu official build system using current packages default alternative install 64-bit isos provided use xfce4-power-manager new microblog client pidgin-microblog new theme rafael laguna lubuntu 11.10 requires minimum 128 mb ram run 256 mb ram install graphic installer recommended minimum ram run live cd session 384 mb lubuntu 11.10 iso file contains known issue causes fail load live cd session hardware instead loading command prompt users required enter codice_1 prompt run live cd session review lubuntu 11.10 pc mech writer rich menga described simple rock-solid reliable trustworthy added ubuntu point suffering major bloat interface side things even say xubuntu point \u2013 lubuntu gets back great linux distro end october 2011 lubuntu risen seventh place distrowatch one month popularity list review linux user developer november 2011 russell barnes praised lubuntu 11.10 low system hardware requirements providing alternative gnome kde saying aesthetic appeal functionality minimally compromised effort sleek light possible barnes noted mark shuttleworth may wise offer full status lubuntu release given fuss bluster surrounding unity aesthetics stated trademark pale blue desktop almost hypnotic \u2019 incredibly clean clear logically laid \u2013 user experience million miles away ubuntu 11.10 \u2019 unity gnome shell counterparts comparison \u2019 almost cleansing nature simplicity barnes rated 4/5 concluded \u2019 flexible pretty gnome 2 lubuntu 11.10 certainly got everything need keep computer happy desktop clean clutter-free igor ljubuncic dedoimedo said lubuntu 11.10 lubuntu meant offer valid alternative heavier kde unity flavors tries bravely fails heroically advantage somewhat reduced system resource usage triply negatively compensated drawbacks desktop environment well incomplete integration samba-related crashes laptop hotkeys jumbled system tray icons low battery life want really mean could add lack customization average software arsenal dozen smaller things get way ... lubuntu could work exciting spectacular way packages handsome bag problems easily avoid using main release ... would recommend edition ... grade 6/10 lubuntu 12.04 released 26 april 2012 planning release took place ubuntu developer summit held early november 2011 changes planned time release included use lightdm x display manager blueman instead gnome-bluetooth managing bluetooth devices lubuntu software center added release provide user-friendly graphical interface managing applications synaptic package manager still installed default allows users manage packages system gdebi allows installation downloaded .deb packages lubuntu 12.04 released linux v3.2.14 linux kernel also introduced large number bug fixes particularly lx panel pcmanfm file manager ubuntu backports repository enabled default meaning backport packages installed default installed automatically upgraded newer versions lubuntu 12.10 released 18 october 2012 includes new version session manager customization integration options also includes new version pcman file manager external thumbnail support version new artwork including new wallpaper new icon set entitled box adjusted gtk themes notification-daemon replaced xfce4-notifyd default installation previous versions lubuntu gui search function catfish search utility added default installation version lubuntu uses linux kernel 3.5.5 python 3.2 openjdk7 default java implementation installation requires cpu physical address extensions pae indicates intel pentium pro newer cpu except 400 mhz-bus versions pentium m. case powerpcs tested powerpc g4 running 867 mhz 640 mb ram also run intel-based apple macs also version supports arm architecture developers currently provide installation instructions one arm-based device toshiba ac100 netbook release lubuntu support uefi secure boot unlike ubuntu 12.10 would allowed run hardware designed windows 8 lubuntu 12.10 could run uefi secure boot hardware turning secure boot feature lubuntu 13.04 released 25 april 2013 version incorporated minor changes lubuntu 12.10 including new version pcmanfm file manager incorporates built-in search utility due particular file manager update catfish search utility longer required deleted lubuntu 13.04 also introduced artwork improvements new wallpaper offerings new icons new installation slideshow minimum system requirements lubuntu 13.04 pentium ii celeron cpu pae support 128 mb ram least 2 gb hard-drive space release also still supports powerpc architecture requiring g4 867 mhz processor 640 mb ram minimum julien lavergne announced june 2013 lubuntu 13.10 would ship firefox default browser place chromium release also used lightdm screen locking included zram reviewing beta release september 2013 joey sneddon omg ubuntu said lubuntu never looked good latest beta noted new box icon theme expanded progress bar colours softened window controls enlarged along sharpened start button final release incorporated minor changes 13.04 included new version pcmanfm includes file search function allowed catfish desktop search removed also new artwork included bug fixes gnome-mplayer gpicview image viewer reviewing lubuntu 13.10 jim lynch said sometimes less much much comes linux distributions lubuntu 13.10 offers advantages ubuntu much minimalist package tentative plans announced april 2013 make lubuntu 14.04 long term support release november 2013 confirmed 14.04 would first lubuntu lts release three years support release also saw xscreensaver replaced light-locker screen lock released 17 april 2014 lubuntu 14.04 included minor updates version 13.10 along featured file manager download media lubuntu 14.04 available pc 32 bit pc 64 bit mac intel 64 bit mac powerpc early intel macs 32 bit core solo processor 32-bit pc image available reviewing lubuntu 14.04 lts silviu stahie softpedia noted uses similar layout one found old defunct windows xp os considered good appropriate replacement microsoft operating system 1 june 2014 jim lynch reviewed lubuntu 14.04 lts concluded lubuntu 14.04 lts performed well fast quite stable using problems running applications system whole lived reputation great choice ubuntu minimalists ... lxde desktop environment different unity ubuntu gnome 3 ubuntu gnome \u2019 traditional desktop means \u2019 quick easy learn use someone \u2019 like unity gnome lxde lubuntu 14.04 lts might doctor ordered \u2019 get benefits ubuntu without discomfort unity interface release 23 october 2014 originally intended feature version lxde based upon qt toolkit called lxqt development latter delayed feature implemented time lubuntu 14.10 incorporated general bug fixes preparation implementation lxqt updated lxde components new artwork including icons theme update silviu stahie writing softpedia stated one main characteristics lubuntu fact fast even older computers basically lubuntu able run anything built last decade operating systems claim thing ... like ubuntu base lubuntu 14.10 seen important visual modifications although many packages updated hood theme icons updated developers preparing make switch lxqt project still works igor ljubuncic dedoimedo said lubuntu 14.10 nothing functionally wrong lubuntu bad simply interesting meat without flavor hybrid car accounting lessons local evening school morning news visit pompei blindfolded excitement ... liked desktop environment past stagnated n't evolved competitors left far behind reflects poorly lubuntu despite calm stable record spartan behavior left absolute zero emotional attachment toward released 23 april 2015 lubuntu 15.04 consisted primarily bug fixes project prepared planned switch lxqt lubuntu 15.10 lubuntu box theme updated merged ubuntu light theme incorporate recent gtk+ features including new header bars gnome native applications plus improved artwork icons minimum system requirements release include 512 mb ram 1 gb recommended plus pentium 4 pentium amd k8 processor release notes indicated graphics cards nvidia amd/ati/radeon intel work box marius nestor softpedia noted ... lubuntu 15.04 operating system comes updated artwork includes updated theme beautiful icons updated gtk+ infrastructure better compatibility qt applications released 22 october 2015 lubuntu 15.10 originally planned move lxqt qt libraries place gtk+ libraries used lxde june 2015 delayed future release release ended minor bug fix application version update changes versions included new artwork ibus replaced fcitx allowing fonts chinese japanese korean included lubuntu-extra-sessions optional instead default minimum system requirements release stated advanced internet services like google+ youtube google docs facebook computer needs 1 gb ram local programs like libre office simple browsing habits computer needs 512 mb ram ... minimum specification cpu pentium 4 pentium amd k8 older processors slow amd k7 problems flash video ... nvidia amd/ati/radeon intel work box system tweaked work fairly easily joey sneddon omg ubuntu humorously noted lubuntu 15.10 another highly minor bug fix release released 21 april 2016 lubuntu 16.04 long term support lts version supported three years april 2019 second lubuntu lts version preceded 14.04 april 2014 release retains lxde desktop make transition lxqt allow lxqt better tested later non-lts releases release large file fit cd requires dvd usb flash drive installation lubuntu 16.04 lts primarily bug-fix release includes new features updated artwork however system requirements include 512 mb ram 1 gb recommended pentium 4 pentium amd k8 newer cpu first point release 16.04.1 released 21 july 2016 release lubuntu 16.04.2 delayed number times eventually released 17 february 2017 lubuntu 16.04.3 released 3 august 2017 lubuntu 16.04.4 delayed 15 february 2018 released 1 march 2018 lubuntu 16.04.5 released 2 august 2018 8 march 2017 new version firefox 52.0 arrived update process version removed alsa audio support firefox favour pulseaudio something initially mentioned mozilla release notes since lubuntu 16.04 lts shipped alsa audio broke default lubuntu audio system default lubuntu browser response bug filed mozilla developers declined fix issue lubuntu 16.10 released 13 october 2016 uses lxde lxqt implementation lxqt delayed release 17.04 release also features small bug fixes updated lxde components updated artwork particularly wallpaper developers recommended system requirements release advanced internet services like google+ youtube google drive facebook computer needs least 1 gb ram local programs like libreoffice simple browsing habits computer needs least 512 mb ram minimum specification cpu pentium 4 pentium amd k8 older processors slow amd k7 problems flash video joey sneddon omg ubuntu noted new features lubuntu 16.10 longer uses lubuntu software centre switched gnome software ubuntu also sneddon wrote lubuntu 16.10 largely lubuntu 16.04 lts work switching lxqt desktop \u2014 expected next release \u2014 continues july 2016 article sneddon singled new wallpaper design lubuntu 16.10 saying jaggedy geometric layout new backdrop stands one visually distinct ship recent years marius nestor softpedia wrote appears lot known issues release 're using lubuntu 16.04 lts xenial xerus n't recommend upgrading lubuntu 16.10 least read attempting upgrade operation lubuntu 17.04 released 13 april 2017 like previous releases uses lxde lxqt implementation lxqt lubuntu delayed time 17.10 release incorporated linux kernel 4.10 updated lxde components general bug fixes new artwork recommended system requirements included 1 gb ram 512 mb minimum minimum pentium 4 pentium amd k8 processor joey sneddon omg ubuntu said release compromised mainly bug fixes core app system updates rather screenshot-able new features lubuntu 17.10 released 19 october 2017 release general bug fix release project prepares implementation lxqt also included new versions lxde components new artwork minimum system requirements release remained 512 mb ram 1 gb recommended least pentium 4 pentium amd k8 processor alternate version entitled lubuntu next 17.10 provided lxqt 0.11.1 desktop release available install ... recommend people use production unless aware somewhat critical bugs associated 10 point writing also \u2019 bad idea contact us well wrote lubuntu developer simon quigley lubuntu 18.04 long term support version released 26 april 2018 last release lubuntu use lxde desktop 18.10 moved using lxqt like past releases 18.04 lts used lxde desktop although work continued move towards deployment lxqt desktop referred lubuntu next release included new artwork including new star field wallpaper system requirements lubuntu 18.04 lts included minimum 1 gb ram although 2 gb recommended better performance plus pentium 4 pentium amd k8 cpu newer ram requirements increased lubuntu 17.10 point releases include 18.04.1 26 july 2018 18.04.2 14 february 2019 14 may 2018 announcement project developers confirmed lubuntu would transition lxqt desktop lubuntu 18.10 released 18 october 2018 included lxqt transition planned release lubuntu 18.04 lts allow testing development three regular releases first long term support version lubuntu 20.04 lts released lxqt project also changed logo early april 2018 anticipation move transitioning lxqt release uses lxqt 0.13.0 based upon qt 5.11.1 applications include libreoffice 6.1.1 office suite vlc media player 3.0.4 player discover software center 5.13.5 featherpad 0.9.0 text editor kde falkon 3.0.1 beta tested default web browser found lack stability replaced firefox 63.0 installer 18.10 calamares system installer place previous ubiquity installer starting release developers longer make recommendations minimum system requirements reviewing beta version 18.10 may 2018 marius nestor softpedia wrote took first lubuntu 18.10 daily build lxqt test drive say 're impressed ... layout simple yet stylish sleek dark theme default single panel bottom screen access everything need ... give five-star rating writing official release 20 october 2018 marius nestor softpedia noted many trials tribulations lot hard work lubuntu team finally managed ship release lxqt desktop environment default instead lxde lightweight x11 desktop environment used default lubuntu releases beginning project also believe lxqt future lxde desktop environment uses old soon deprecated technologies welcome lubuntu 18.10 cosmic cuttlefish shiny lxqt 0.13.0 desktop environment default built latest qt 5.11.1 libraries patched upstream improvements reviewing lubuntu 18.10 distrowatch jesse smith wrote mixed feelings release lubuntu one hand features worked well distribution easy install liked theme operating system pretty easy use aspects n't like usually programs settings modules felt overly complex confusing compared counterparts distributions part though lubuntu nice job capable relatively lightweight distribution ... whole think transition lxde lxqt gone smoothly choices n't like mostly changes minor think people able make leap two desktops fairly easily think settings modules still need polish 'd like see discover replaced modern software manager otherwise felt like graceful mostly positive move 18.04 18.10 lxde lxqt detailed review lubuntu 18.10 mahmudin asharin writing ubuntu buzz found faults release particular network manager concluded users recommend lubuntu 18.04 lts instead sake usability support duration first timer installed/want install 18.10 lxqt go ahead get beautiful user interface nice experience recommend use wicd instead default network manager lxqt desktop pursuer lubuntu 18.10 great example lxqt system try first review full circle magazine noted overall lxqt seen lubuntu 18.10 ready day-to-day use also still room ongoing refinement.introducing lxqt lubuntu 18.10 careful choice lubuntu developers coming right lubuntu 18.04 lts final lxde release gives developers three standard releases continue polish lxqt first lts release ... standard release made schedule 18 april 2019 release marked first lubuntu version without 32-bit support lubuntu developer simon quigley wrote december 2018 release featured lxqt 0.14.1 based upon qt 5.12.2 included working full-disk encryption easier customization calamares installer configurations employing xdg configuration variables austrian keymapping minimum installation ram reduced 500 mb changes include trash home computer network icons added desktop split view pcmanfm-qt exif data display image viewer lximage-qt touchpad settings fixed 18.10 review softpedia writer marius nestor described use lxqt 0.14.1 employed lubuntu 19.04 much-improved richer lxqt experience review full circle magazine concluded lubuntu 18.10 \u2019 ready prime time 19.04 lxqt looks fresh new everything works right installation even runs fine dvd live session \u2019 find anything needs fixing 19.04 nine month support period regular release could long term support release least quality user experience lack bugs standard release last one next lts release expected 17 october 2019 standard release expected october 2020 16 august 2018 lubuntu development team announced plans port openbox mir time lubuntu 20.10 allow lubuntu move away x display server implementation wayland instead lxde versions lubuntu 18.04 lts earlier included following applications user applications lxde including 18.04 lts lubuntu also access ubuntu software repositories lubuntu software center synaptic package manager apt allowing installation applications available ubuntu lxqt versions lubuntu 18.10 later include following applications internet applications office applications graphics applications accessories sound video 18.10 lubuntu also access ubuntu software repositories discover software center synaptic package manager apt allowing installation applications available ubuntu", + "neighbors": [ + 113, + 134, + 171, + 301, + 351, + 357, + 393, + 404, + 431, + 695, + 754, + 897, + 935, + 974, + 1004, + 1046, + 1049, + 1055, + 1167, + 1214, + 1276, + 1278, + 1286, + 1318, + 1369, + 1403, + 1415, + 1458, + 1509, + 1538, + 1539, + 1558, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 1127, + "label": 8, + "text": "Broadjam:broadjam broadjam us-based music community website founded september 1999 service aimed primarily independent musicians users interact artists enter contests collaborate peers email reviews blogs social networking tools broadjam also works related industries provide various licensing opportunities including placement films tv shows advertising campaigns video games radio play professional reviews broadjam claims one world largest web communities catering independent musicians site online database 500,000 searchable songs home approximately 110,000 artists world company founded roy elkins assistance stephanie essex elkins former corporate sales marketing executive classical singer classical music radio deejay intention provide promotional services unsigned musicians company based madison wisconsin roy formerly vice president sales marketing sonic foundry prior roy training director ensoniq corporation broadjam offers variety services artists gain exposure feedback musicians make bulk site membership broadjam also offers template-based hosting services help members create website broadjam founded 1999 site initially launched 2000 broadjam originally headquartered new glarus wisconsin relocated 2003 madison wisconsin site originally developed provide services independent musicians hoping get foot door music industry time service evolved provides wide range services artists music industry professionals broadjam holds variety sponsored contests aim expose reward exceptional musicianship songwriting broadjam hosts song month contests every month artist reviews scoring system based good better best used determine winner members submit songs radio play professional reviews placement films tv shows commercials video games music supervisors film television utilize broadjam provide music feature films tv shows commercials members give another feedback reviewing mechanism review songs specific genre random songs entire site highest rated songs appear broadjam top 10s broadjam 200 different top 10 charts sortable genre region production style reviewer demographics broadjam calculates top 10s daily based factors include song plays downloads reviews star ratings broadjam offers site hosting services premium members artists host existing sites create one using templates artists mark songs download mp3 file format members browse broadjam library genre region production based fan picks part professional services group broadjam provides online mechanism tallies votes popular music award ceremonies current customers service include academy country music madison area music awards broadjam also provides music encoding service major record labels use service encode catalog control metadata", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1128, + "label": 0, + "text": "Neural_machine_translation:neural machine translation neural machine translation nmt approach machine translation uses large artificial neural network predict likelihood sequence words typically modeling entire sentences single integrated model require fraction memory needed traditional statistical machine translation smt models furthermore unlike conventional translation systems parts neural translation model trained jointly end-to-end maximize translation performance deep learning applications appeared first speech recognition 1990s first scientific paper using neural networks machine translation appeared 2014 followed lot advances following years large-vocabulary nmt application image captioning subword-nmt multilingual nmt multi-source nmt character-dec nmt zero-resource nmt google fully character-nmt zero-shot nmt 2017 2015 first appearance nmt system public machine translation competition openmt'15 wmt'15 also first time nmt contender following year already 90 nmt systems among winners popularity nmt also owes events introducing nmt section nmt neural mt training annual wmt workshop machine translation first independent workshop nmt google continued afterwards year nmt departs phrase-based statistical approaches use separately engineered subcomponents neural machine translation nmt drastic step beyond traditionally done statistical machine translation smt main departure use vector representations embeddings continuous space representations words internal states structure models simpler phrase-based models separate language model translation model reordering model single sequence model predicts one word time however sequence prediction conditioned entire source sentence entire already produced target sequence nmt models use deep learning representation learning word sequence modeling first typically done using recurrent neural network rnn bidirectional recurrent neural network known encoder used neural network encode source sentence second rnn known decoder used predict words target language convolutional neural networks convnets principle somewhat better long continuous sequences initially used due several weaknesses successfully compensated 2017 using so-called attention -based approaches coverage models addressing issues traditional attention mechanism ignoring past alignment information leading over-translation under-translation 2016 best mt systems using neural networks google microsoft yandex promt translation services use nmt google uses google neural machine translation gnmt preference previous statistical methods microsoft uses similar technology speech translations including microsoft translator live skype translator open source neural machine translation system opennmt released harvard nlp group different linguistic knowledges different language families borrowed idea traditional statistical machine translation smt researchers focus one specific language pairs introducing linguistic knowledge nmt work apply chinese radicals reflecting meaning upper-level composed character sub-character level chinese-english nmt address rare word out-of-vocabulary translation issue", + "neighbors": [ + 159, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1142, + 1209, + 1440, + 1486, + 1615 + ], + "mask": "Validation" + }, + { + "node_id": 1129, + "label": 4, + "text": "Google_hacking:google hacking google hacking also named google dorking computer hacking technique uses google search google applications find security holes configuration computer code websites use google hacking involves using advanced operators google search engine locate specific strings text within search results popular examples finding specific versions vulnerable web applications search query codice_1 would locate web pages particular text contained within normal default installations applications include running version every page serve example powered xoops 2.2.3 final one even retrieve username password list microsoft frontpage servers inputting given microscript google search field devices connected internet found search string codice_2 find public web cameras another useful search following codice_3 followed search keyword give list files servers example codice_4 give mp3 files available various servers many similar advanced operators used exploit insecure websites link search operator google used turned 2017 concept google hacking dates back 2002 johnny long began collect google search queries uncovered vulnerable systems and/or sensitive information disclosures labeling googledorks list google dorks grew large dictionary queries eventually organized original google hacking database ghdb 2004 since heyday concepts explored google hacking extended search engines bing shodan automated attack tools use custom search dictionaries find vulnerable systems sensitive information disclosures public systems indexed search engines", + "neighbors": [ + 12, + 24, + 176, + 182, + 186, + 216, + 480, + 547, + 553, + 559, + 671, + 703, + 704, + 777, + 800, + 837, + 936, + 1082, + 1259, + 1265, + 1371, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1130, + "label": 9, + "text": "Uniface_(programming_language):uniface programming language uniface development deployment platform enterprise applications run large range runtime environments including mobile mainframe web service-oriented architecture soa windows java ee .net uniface model-driven rapid application development rad environment used create mission-critical applications uniface applications database- platform-independent uniface provides integration framework enables uniface applications integrate major dbms products oracle microsoft sql server mysql ibm db2 addition uniface also supports file systems rms hp openvms sequential files operating system text files wide range technologies mainframe-based products cics ims web services smtp pop email ldap directories .net activex component object model com c ++ programs java uniface operates microsoft windows windows mobile various flavors unix linux vms ibm iseries z/os uniface used complex systems maintain critical enterprise data supporting mission-critical business processes point-of sale web-based online shopping financial transactions salary administration inventory control currently used thousands companies 30 countries effective installed base millions end-users uniface applications range client/server web data entry workflow well portals accessed locally via intranets internet originally developed netherlands inside automation later uniface b.v. product company acquired detroit-based compuware corp 1994 2014 acquired marlin equity partners independent company uniface b.v. global headquarters amsterdam uniface development environment\u2014an integrated collection tools modeling implementing compiling debugging distributing applications uniface applications including use common runtime infrastructure consisting addition uniface anywhere formerly uniface jti java thin client interface deliver client/server uniface applications computer connected internet thin client solution uniface procedural scripting language called uniface proc used code application behavior uniface automates input/output operations kernel default code much fundamental behavior need coded uniface applications component-based infrastructure-independent software programs create use data stored one databases file-systems composite applications include non-uniface components created using development tools deployed distributed client/server web environments mobile applications web services mainframe environments uniface variety component types intended use different layers multi-tier application architecture components presentation tier responsible user interface include components business logic tier handle business rules task-specific behavior user interface data access tier contains physical database structures captured uniface application model uniface ensures physical data access encapsulating sql dbms connectors network middleware access encapsulated middleware drivers uniface router runtime engine executes application components displays presentation components using appropriate user interface connector either gui character-based sends receives data via dbms connector uniface applications developed uniface development environment originally possible develop apple dec platforms windows supported platform development uniface applications development model-driven component-based data structure business rules default behavior application captured application model model definitions reused inherited components override inherited definitions provide component-specific behavior characteristics templates improve productivity enforce consistency defining models application model defines entities tables fields keys indexes relationships together referential integrity entity field model properties set triggers business rules added model declaratively setting properties procedurally adding proc code uniface procedural language triggers triggers containers code triggers represent user system events example occurrence gets focus read leave field others cover matters validation act place holders methods associated particular object use model-level triggers enables uniface collect properties behavior within business objects separating logical physical data structures makes possible define default behavior reuse throughout application speeding development facilitating 3-tier application architecture entity table first defined application model exported physical database form create table scripts objects described application model reused components developers embed objects model component drawing layout canvas presentation components inserting tree view component structure also add component-level objects application model control fields menus component variables properties triggers defined application model inherited copied component definitions changed component level provide specific functionality breaks link application model component although possible restore link model model code properties changed model level components holding object need recompiled collect new definitions provides benefits maintenance ensures rules associated object available wherever used uniface maintains database metadata purposes reuse\u2014application models component definitions component layouts procedural code repository proprietary intended access via uniface development environment ensure repository integrity however repository structure documented making possible though recommended interface directly example reporting using centralized repository application development shared teams software developers uniface integrate version control system vcs supports microsoft common source code control interface specification vcs functionality available within uniface depends vcs used software vendors interpreted implemented ms cscc api differently uniface applications deployed platforms mainframe mobile without changing code components objects startup shells menus toolbars panels glyphs global included proc entries compiled runtime objects packaged zip files deployed onto platform runtime objects executed using virtual machine platform-specific interpreter java later followed uniface respect components compiled one machine executed another providing uniface virtual machine present uniface router uniface server make uniface scalable balanceable make possible run processes asynchronously uniface accesses many databases file systems supports means database connectors drivers dbms connectors map convert uniface data types suitable format particular storage medium runtime possible pass parameters invoke disable database-specific extensions provided database connector licensed possible convert different data sources uniface also provides api database connector interface used create proprietary connectors sql-based database licensing managed compuware distributed license manager dlm server based system distributing licenses clients request precluding need held locally originally called unis product created netherlands 1984 inside automation company headed bodo douqu\u00e9 frits kress technical director 1986 product company changed name uniface early logo product included red capital reflected red capital inside automation logo uniface developed principles american national standards institute ansi 3-schema architecture first proposed 1975 standard approach building database management systems consisting 3 schema metamodels uniface developed dec vax machine using native vax file-management system rms vestige still seen today \u2019 product continued use \u201c gold \u201d key change modes dec vt terminals actually gold yellow key keyboard today \u201c gold \u201d simply mapped numeric keyboard key function key early versions product bundled sybase rdbms name fastbuild although limited accessing database uniface continuously evolved handle new technologies application architectures critical success applications built uniface migrated updated modernized without losing original development investment uniface version 3 1986 uniface 3 first public release featured support multiple databases rms oracle c_isam ingres rdb virtual machine interpretation structure editor uniface text command editor uniface version 4 1988 uniface 4 improved text editor form editor improved printing display support introduced support ms-dos added case tool interface uniface version 5 1990 uniface 5 enabled client/server deployment introduction remote database access polyserver introduced graphical user interface via universal presentation interface upi database support extended total 13 databases file systems available dos vms os/2 stratus vos unix japanese character support also introduced uniface six 1994 uniface six completed move fully graphical development environments included graphical form painter application model editor improved deployment dynamic object libraries added support microsoft object linking embedding ole included support apple macintosh added permissions control integrated version control added personal series reporting tools although later removed 3rd party decided enhance product wider platform support uniface seven 1997 uniface seven focused component integration uniface external components introduction uniface request broker urb architecture urb supports bi-directional synchronous asynchronous communication components well remote data access added partitioned application servers messaging uniface seven also delivered first uniface web development deployment tools web application server uniface request dispatcher enhancements included new component types services server pages reports signature editor assembly workbench subsystems operations non-modal forms component instances improved editors navigation enhanced editor plug-in new debugger integrated online help component templates web application server improved validation uniface name server graphical partitioning manager uniface seven also saw introduction several tools uniface 8 2001 uniface 8 brought major changes area process integration uniface router uniface server provided scalable balanced deployment web request dispatcher wrd replaced urd improving performance support web services soap xml introduced connectivity interoperability improved method implementing 3-tier application architecture introduced connectors soap com corba mqseries added window file management improved new deployment utility introduced improving application distribution component subtypes 3-tier architecture added handles added component instances automatic garbage collection added uniface 9 2006 uniface 9 release focused gui usability improvements thin deployment integration support windows mobile added configuration deployment simplified using zipped archives support unicode improved already impressive multilingual capability improvements web development xml handling brought uniface line industry standards dynamic field movement form components removed old barriers flexibility features included improved color handling dynamic menus xml api diagram editor application model cross-referencing functionality support refactoring deployment enhanced web services functionality uniface 9.4 2010 despite point release uniface 9.4 introduced enough major new functionality considered major release major focus rich internet application ria functionality making possible develop web 2.0 applications rich functionality client/server applications using tools methodologies used develop classic client/server applications language locale support substantially improved support html email security encryption uniface 9.5 2011 release uniface 9.5 improved product \u2019 integration world wide web introduction javascript api together improvements means client-side processing bring benefits areas performance integration functionality user-friendliness session management capability extended offer improved security processing web services fully supports complex datatypes soap restful services also improvements customers business-critical client/server applications particularly area grid widget uniface 9.6 2012 uniface 9.6 provided significant overhaul uniface client server gui capabilities functionality included html5 control leveraging javascript apis originally delivered web enhanced tab control updates image handling buttons plus improvements form container control enables 'forms within forms enabling development dynamic user experiences addition gui enhancements uniface 9.6 also delivered enhancements uniface web web services capabilities including ability dynamically change scope web transactions web pagination hitlist processing improved wsdl xml capabilities uniface 9.7 2015 uniface 9.7 delivered significant enhancements development web applications including extensions facilitate development deployment mobile applications based hybrid application enhancing multi-channel development/deployment capability uniface significantly extended uniface 9.7.02 release may 2016 providing integration build service provider enable hybrid applications packaged distribution via google play apple store addition mobile web enhancements uniface 9.7 delivered integration client server enhancements ms windows 10 uniface development environment ude modernized new look feel providing new look front screen refreshed visual user experience approach uniface took modernize ude shared developer conferences community website uniface.info help advise promote client server modernization existing customer base uniface 9.7 provides two new database drivers enabling connectivity postgresql sap hana uniface 10 2015 uniface 10 delivered rewritten development environment based core concepts integrated development environments ide initial release positioned preview early adopter release showed significant change proprietary development style highly productive implementation industry standard development enabling development web applications may 2015 first edition uniface 10 released early adopters test develop web applications full enterprise edition uniface 10 released september 2016 delivering mobile client server development migration path enable existing customer base move applications uniface 10", + "neighbors": [ + 134, + 306, + 592, + 961, + 1138, + 1395, + 1416, + 1417, + 1632 + ], + "mask": "Train" + }, + { + "node_id": 1131, + "label": 7, + "text": "Open_Grid_Forum:open grid forum open grid forum ogf community users developers vendors standardization grid computing formed 2006 merger global grid forum enterprise grid alliance ogf models process internet engineering task force ietf produces documents many acronyms ogsa ogsi jsdl ogf two principal functions plus administrative function standards organization grid computing building communities within overall grid community including extending within academia industry function areas divided groups three types working groups generally tightly defined role usually producing standard research groups looser role bringing together people discuss developments within field generate use cases spawn working groups community groups restricted community functions three meetings organized per year divided approximately evenly averaging number years north america europe east asia many working groups organize face-to-face meetings interim concept forum bring together developers practitioners users distributed computing known grid computing time discussed birds feather session november 1998 sc98 supercomputing conference based response idea bof ian foster bill johnston convened first grid forum meeting nasa ames research center june 1999 drawing roughly 100 people mostly us group organizers nominated charlie catlett argonne national laboratory university chicago serve initial chair confirmed via plenary vote held 2nd grid forum meeting chicago october 1999 advice assistance internet engineering task force ietf ogf established process based ietf ogf managed steering group 1998 groups similar grid forum began organize europe called egrid japan discussions among leaders groups resulted combining form global grid forum met first time amsterdam march 2001 ggf-1 amsterdam followed five grid forum meetings catlett served ggf chair two 3-year terms succeeded mark linesch hewlett packard september 2004 enterprise grid alliance ega formed 2004 focused large data center businesses emc corporation netapp oracle corporation ggf-18 23rd gathering forum counting first five gf meetings september 2006 ggf became open grid forum ogf based merger ega september 2007 craig lee aerospace corporation became chair technologies specified ogf include addition technical standards ogf published community-developed informational experimental documents first version drmaa api implemented sun grid engine also university wisconsin-madison program condor cycle scavenger separate globus alliance maintains implementation standards globus toolkit release unicore based ogsa architecture jsdl", + "neighbors": [ + 25, + 90, + 161, + 399, + 760, + 847, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 1132, + "label": 5, + "text": "Line_Mode_Browser:line mode browser line mode browser also known lmb wwwlib www second web browser ever created browser first demonstrated portable several different operating systems operated simple command-line interface could widely used many computers computer terminals throughout internet browser developed starting 1990 supported world wide web consortium w3c example test application libwww library one fundamental concepts world wide web projects cern universal readership 1990 tim berners-lee already written first browser worldwideweb later renamed nexus program worked proprietary software next computers limited use berners-lee team could port worldwideweb application features\u2014including graphical wysiwyg editor\u2014 widely deployed x window system since experience programming team recruited nicola pellow math student intern working cern write passive browser basic could run computers time name line mode browser refers fact ensure compatibility earliest computer terminals teletype machines program displayed text images line-by-line text input cursor positioning development started november 1990 browser demonstrated december 1990 development environment used resources priam project french language acronym projet interdivisionnaire d'assistance aux microprocesseurs project standardise microprocessor development across cern short development time produced software simplified dialect c programming language official standard ansi c yet available platforms line mode browser released limited audience vax rs/6000 sun-4 computers march 1991 release first publicly available version integrated cern program library cernlib used mostly high-energy physics-community first beta browser released 8 april 1991 berners-lee announced browser availability august 1991 alt.hypertext newsgroup usenet users could use browser anywhere internet telnet protocol info.cern.ch machine also first web server spreading news world wide web 1991 increased interest project cern laboratories desy germany elsewhere throughout world first stable version 1.1 released january 1992 since version 1.2l released october 1992 browser used common code library later called libwww main developer pellow started working macwww project browsers began share source code may 1993 world wide web newsletter berners-lee announced browser released public domain reduce work new clients 21 march 1995 release version 3.0 cern put full responsibility maintaining line mode browser w3c line mode browser libwww library closely tied together\u2014the last independent release separate browser component 1995 browser became part libwww agora world wide web email browser based line mode browser line mode browser popular beginning web since web browser available operating systems statistics january 1994 show mosaic quickly changed web browser landscape 2 world wide web users browsed line mode browser new niche text-only web browser filled lynx made line mode browser largely irrelevant browser one reason lynx much flexible line mode browser became test application libwww simplicity line mode browser several limitations line mode browser designed work operating system using called dumb terminals user interface simple possible user began command-line interface specifying uniform resource locator url requested web page printed line line screen like teleprinter websites displayed using first versions html formatting achieved capitalization indentation new lines header elements capitalized centered separated normal text empty lines navigation controlled pointing device mouse arrow keys text commands typed program numbers brackets displayed link links opened typing corresponding number program led one journalist time write web way finding information typing numbers page scrolled empty command carriage return entered scrolled command codice_1 command codice_2 navigated backwards history new pages navigated codice_3 go url browser authoring functions pages could read edited considered unfortunate robert cailliau one developers think retrospect biggest mistake made whole project public release line-mode browser gave internet hackers immediate access point view passive browser \u2014 editing capabilities line mode browser designed able platform independent official ports apollo/domain ibm rs6000 decstation/ultrix vax/vms vax/ultrix ms-dos unix windows classic mac os linux mvs vm/cms freebsd solaris macos browser supports many protocols like file transfer protocol ftp gopher hypertext transfer protocol http network news transfer protocol nntp wide area information server wais features included rlogin telnet hyperlinks cyrillic support added 25 november 1994 version 2.15 ability set proxy client browser could run background process download files line mode browser problems recognizing character entities properly collapsing whitespace supporting tables frames", + "neighbors": [ + 14, + 16, + 83, + 95, + 99, + 107, + 134, + 258, + 277, + 306, + 412, + 427, + 452, + 470, + 491, + 509, + 530, + 531, + 580, + 582, + 623, + 627, + 668, + 678, + 680, + 684, + 713, + 796, + 862, + 886, + 939, + 953, + 961, + 1012, + 1033, + 1058, + 1084, + 1100, + 1138, + 1166, + 1195, + 1210, + 1218, + 1228, + 1280, + 1304, + 1331, + 1376, + 1378, + 1408, + 1423, + 1424, + 1470, + 1528, + 1550, + 1569, + 1570, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1133, + "label": 8, + "text": "Orion_Application_Server:orion application server orion application server java ee application server developed swedish company ironflare ab founded magnus stenman karl avedal first released 1999 orion claims first commercially available application server full java ee support current stable version 2.0.7 compliant java ee version 1.3 oracle corporation acquired license source orion 2001 developed oracle application server containers java ee oc4j oc4j documentation contains reference orion server orion developers involved maintenance enhancements source oracle ironflare became official java ee licensee 2003 enabled access sun microsystems compatibility testing tools ensure correct implementation java ee specification orion orion product ironflare hence orion marketed company", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1134, + "label": 1, + "text": "BioSearch:biosearch biosearch web application developed manage marine biodiversity data indian waters recent demand indian marine biodiversity information increased manifolds owing mainly realization marine biodiversity potential biotechnology pollution control energy generation however recently web based open access database could provide comprehensive information indian coastal biodiversity lacking biosearch created address need biosearch enables access anyone anywhere time biosearch search page user search information organism name location presence recorded ecology economic importance user obtain information organism names image description ecology economic importance also referred literature biosearch web-based application user-end requirements minimal basic requirement includes computer system internet connection web browser biosearch designed enable easy access organism pages lowest internet connection speeds particularly important parts country rely dial\u2013up 56kbit/s internet connections various applications biosearch anticipated biosearch basic level used fishermen information fish catch general public learn marine biodiversity browsing name indices students lecturers use description lifecycle reproduction taxonomic literature information project work activities conservationist obtain organism distribution diversity particular area iucn red list status organism biotechnologist use biosearch know distribution biotechnologically important organism may help future specimen collection advance applications anticipated fields pisciculture remote sensing geographical information systems gis ecological modeling", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1135, + "label": 0, + "text": "Robby_Garner:robby garner robby garner born 1963 american natural language programmer software developer 1998 1999 loebner prize contests program called albert one listed 2001 guinness book world records written human computer program native cedartown georgia robby attended cedartown high school worked father television repair shop began programming family business age 15 commander afjrotc squadron junior high school attending joint-enrollment college classes local community college forming software company called robitron software research inc. 1987 father robert j. garner sister pam worked software developer 1997 father retired company disbanded one first web chatterbots named max headcold written garner 1995 max served two purposes collect data web chat behavior entertain customers fringeware online bookstore program eventually implemented java package called jfred written paco nathan based c++ fred cgi program influences stanford various corporations garner nathan took part world largest online turing test 1998 jfred program perceived human 17 participants computational behaviorist term coined dr. thomas whalen 1995 garner first attempts simulating conversation involved collections internet chat viewed sequence stimuli responses kevin copple ellaz systems collaborated garner several projects including copple ella garner contributed voice recordings music garner copple believe intelligence may built one facet time rather depending general purpose theory emerge competing six loebner prize contests used competition way test prototypes judges year winning contest twice 1998 1999 program called albert one began collaborating software developers variety conversational systems garner created robitron yahoo group 2002 forum virtual watering hole loebner prize contest participants discussion related topics multifaceted approach presented colloquium conversational systems november 2005 involves multiple chat bots working control master control program using technique strengths various web agents may united control java applet servlet control program categorizes stimuli delegates responses programs hierarchy spin-off technique turing hub automated turing test featuring four top loebner prize contest competitors", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1136, + "label": 3, + "text": "Way_of_the_Tiger:way tiger way tiger series adventure gamebooks mark smith jamie thomson set fantasy world orb reader takes part young monk/ninja avenger initially quest avenge foster father recover stolen scrolls later books presented challenges avenger overcome notably taking ruling city world orb originally created mark smith dungeons dragons game ran pupil brighton college mid-1970s orb also used setting fighting fantasy gamebook talisman death smith thomson book disclaimer front performing ninja related feats book could lead serious injury death untrained user sixth book inferno ends cliffhanger avenger trapped web black widow orb darkest blight new books released fate avenger orb unknown mark smith confirmed cliffhanger ending deliberate august 2013 original creators series working megara entertainment develop re-edited hardcover collector editions gamebooks including new prequel book 0 sequel book 7 potentially role-playing game based series two new books plus six re-edited original books reprinted paperback format megara entertainment 2014 made available pdfs 2019 december 2013 announced tin man games would releasing original six books series digital platforms 2014 2015 however 2017 nothing released original series comprises six books books could played sequence standalone adventures although playing sequence preserves continuity storyline played sequence abilities bonuses penalties special items avenger acquired carried next book expanded eight-book series consists following titles first last printed many years original six series featured combat system based unarmed fighting moves colourful names cobra strike punch leaping tiger kick avenger could also choose list ninja skills acrobatics poison needle spitting used variety appropriate weaponry garotte shuriken luck also played part form fate tests see fate smiled turned back avenger could also enhance skill using inner force similar qi energy series avenger could learn new skills shinren means understanding people intentions observing subtle clues books large number opponents recurring characters aside certain ancient titans called elder gods orb ruled various deities two video games based books released first way tiger beat 'em released gremlin graphics amstrad cpc zx spectrum commodore 16 commodore 64 game avenger fighting staves swords well utilizing unarmed combat avenger rarely used weapons apart shuriken books way tiger ii avenger action-adventure made gremlin graphics 1986 computers commodore 64 amstrad cpc zx spectrum msx game story yaemon grand master flame killed player foster-father naijish stolen scrolls kettsuin recover scrolls player find enough keys penetrate quench heart keep kill three guards game viewed top-down perspective superficially resembles gauntlet", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1137, + "label": 4, + "text": "Information_assurance:information assurance information assurance ia practice assuring information managing risks related use processing storage transmission information data systems processes used purposes information assurance includes protection integrity availability authenticity non-repudiation confidentiality user data uses physical technical administrative controls accomplish tasks focused predominantly information digital form full range ia encompasses digital also analog physical form protections apply data transit physical electronic forms well data rest various types physical electronic storage facilities ia best thought superset information security i.e umbrella term business outcome information risk management information assurance ia process getting right information right people right time ia benefits business use information risk management trust management resilience appropriate architecture system safety security increases utility information authorized users reduces utility information unauthorized strongly related field information security also business continuity ia relates business level strategic risk management information related systems rather creation application security controls therefore addition defending malicious hackers code e.g. viruses ia practitioners consider corporate governance issues privacy regulatory standards compliance auditing business continuity disaster recovery relate information systems information security draws primarily computer science ia interdisciplinary field requiring expertise business accounting user experience fraud examination forensic science management science systems engineering security engineering criminology addition computer science information assurance also term used governments including government united kingdom provision holistic security information systems use term interdisciplinary approach set somewhat lessened security/ systems engineering business continuity/ enterprise resilience forensic investigation threat analysis considered management science accounting criminology considered developing mitigation risks developed risk assessments conducted hmg information assurance standard 1 2 replaced hmg information security standard 2 sets principles requirements risk management accordance principles one information assurance standards currently used within uk public sector information assurance process typically begins enumeration classification information assets protected next ia practitioner perform risk assessment assets vulnerabilities information assets determined order enumerate threats capable exploiting assets assessment considers probability impact threat exploiting vulnerability asset impact usually measured terms cost asset stakeholders sum products threats impact probability occurring total risk information asset risk assessment complete ia practitioner develops risk management plan plan proposes countermeasures involve mitigating eliminating accepting transferring risks considers prevention detection response threats framework published standards organization nist rmf risk cobit pci dss iso/iec 27002 may guide development countermeasures may include technical tools firewalls anti-virus software policies procedures requiring controls regular backups configuration hardening employee training security awareness organizing personnel dedicated computer emergency response team cert computer security incident response team csirt cost benefit countermeasure carefully considered thus ia practitioner seek eliminate risks possible manage cost-effective way risk management plan implemented tested evaluated often means formal audits ia process iterative one risk assessment risk management plan meant periodically revised improved based data gathered completeness effectiveness number international national bodies issue standards information assurance practices policies procedures uk include information assurance advisory council information assurance collaboration group information assurance also evolved due social media", + "neighbors": [ + 103, + 289, + 658, + 703, + 800, + 898, + 921 + ], + "mask": "Test" + }, + { + "node_id": 1138, + "label": 2, + "text": "Operating_system:operating system operating system os system software manages computer hardware software resources provides common services computer programs time-sharing operating systems schedule tasks efficient use system may also include accounting software cost allocation processor time mass storage printing resources hardware functions input output memory allocation operating system acts intermediary programs computer hardware although application code usually executed directly hardware frequently makes system calls os function interrupted operating systems found many devices contain computer cellular phones video game consoles web servers supercomputers dominant desktop operating system microsoft windows market share around 82.74 macos apple inc. second place 13.23 varieties linux collectively third place 1.57 mobile smartphone tablet combined sector use 2017 70 google android according third quarter 2016 data android smartphones dominant 87.5 percent growth rate 10.3 percent per year followed apple ios 12.1 percent per year decrease market share 5.2 percent operating systems amount 0.3 percent linux distributions dominant server supercomputing sectors specialized classes operating systems embedded real-time systems exist many applications single-tasking system run one program time multi-tasking operating system allows one program running concurrency achieved time-sharing available processor time divided multiple processes processes interrupted repeatedly time slices task-scheduling subsystem operating system multi-tasking may characterized preemptive co-operative types preemptive multitasking operating system slices cpu time dedicates slot programs unix-like operating systems solaris linux\u2014as well non-unix-like amigaos\u2014support preemptive multitasking cooperative multitasking achieved relying process provide time processes defined manner 16-bit versions microsoft windows used cooperative multi-tasking 32-bit versions windows nt win9x used preemptive multi-tasking single-user operating systems facilities distinguish users may allow multiple programs run tandem multi-user operating system extends basic concept multi-tasking facilities identify processes resources disk space belonging multiple users system permits multiple users interact system time time-sharing operating systems schedule tasks efficient use system may also include accounting software cost allocation processor time mass storage printing resources multiple users distributed operating system manages group distinct computers makes appear single computer development networked computers could linked communicate gave rise distributed computing distributed computations carried one machine computers group work cooperation form distributed system os distributed cloud computing context templating refers creating single virtual machine image guest operating system saving tool multiple running virtual machines technique used virtualization cloud computing management common large server warehouses embedded operating systems designed used embedded computer systems designed operate small machines like pdas less autonomy able operate limited number resources compact extremely efficient design windows ce minix 3 examples embedded operating systems real-time operating system operating system guarantees process events data specific moment time real-time operating system may single- multi-tasking multitasking uses specialized scheduling algorithms deterministic nature behavior achieved event-driven system switches tasks based priorities external events time-sharing operating systems switch tasks based clock interrupts library operating system one services typical operating system provides networking provided form libraries composed application configuration code construct unikernel specialized single address space machine image deployed cloud embedded environments early computers built perform series single tasks like calculator basic operating system features developed 1950s resident monitor functions could automatically run different programs succession speed processing operating systems exist modern complex forms early 1960s hardware features added enabled use runtime libraries interrupts parallel processing personal computers became popular 1980s operating systems made similar concept used larger computers 1940s earliest electronic digital systems operating systems electronic systems time programmed rows mechanical switches jumper wires plug boards special-purpose systems example generated ballistics tables military controlled printing payroll checks data punched paper cards programmable general purpose computers invented machine languages consisting strings binary digits 0 1 punched paper tape introduced sped programming process stern 1981 early 1950s computer could execute one program time user sole use computer limited period time would arrive scheduled time program data punched paper cards punched tape program would loaded machine machine would set work program completed crashed programs could generally debugged via front panel using toggle switches panel lights said alan turing master early manchester mark 1 machine already deriving primitive conception operating system principles universal turing machine later machines came libraries programs would linked user program assist operations input output generating computer code human-readable symbolic code genesis modern-day operating system however machines still ran single job time cambridge university england job queue one time washing line clothes line tapes hung different colored clothes-pegs indicate job-priority improvement atlas supervisor introduced manchester atlas commissioned 1962 considered many first recognisable modern operating system brinch hansen described significant breakthrough history operating systems 1950s many major features pioneered field operating systems mainframe computers including batch processing input/output interrupt buffering multitasking spooling runtime libraries link-loading programs sorting records files features included included application software option application programmers rather separate operating system used applications 1959 share operating system released integrated utility ibm 704 later 709 7090 mainframes although quickly supplanted ibsys/ibjob 709 7090 7094 1960s ibm os/360 introduced concept single os spanning entire product line crucial success system/360 machines ibm current mainframe operating systems distant descendants original system applications written os/360 still run modern machines os/360 also pioneered concept operating system keeps track system resources used including program data space allocation main memory file space secondary storage file locking update process terminated reason resources re-claimed operating system alternative cp-67 system s/360-67 started whole line ibm operating systems focused concept virtual machines operating systems used ibm s/360 series mainframes included systems developed ibm cos/360 compatibility operating system dos/360 disk operating system tss/360 time sharing system tos/360 tape operating system bos/360 basic operating system acp airline control program well non-ibm systems mts michigan terminal system music multi-user system interactive computing orvyl stanford timesharing system control data corporation developed scope operating system 1960s batch processing cooperation university minnesota kronos later nos operating systems developed 1970s supported simultaneous batch timesharing use like many commercial timesharing systems interface extension dartmouth basic operating systems one pioneering efforts timesharing programming languages late 1970s control data university illinois developed plato operating system used plasma panel displays long-distance time sharing networks plato remarkably innovative time featuring real-time chat multi-user graphical games 1961 burroughs corporation introduced b5000 mcp master control program operating system b5000 stack machine designed exclusively support high-level languages machine language assembler indeed mcp first os written exclusively high-level language espol dialect algol mcp also introduced many ground-breaking innovations first commercial implementation virtual memory development as/400 ibm made approach burroughs license mcp run as/400 hardware proposal declined burroughs management protect existing hardware production mcp still use today unisys clearpath/mcp line computers univac first commercial computer manufacturer produced series exec operating systems like early main-frame systems batch-oriented system managed magnetic drums disks card readers line printers 1970s univac produced real-time basic rtb system support large-scale time sharing also patterned dartmouth bc system general electric mit developed general electric comprehensive operating supervisor gecos introduced concept ringed security privilege levels acquisition honeywell renamed general comprehensive operating system gcos digital equipment corporation developed many operating systems various computer lines including tops-10 tops-20 time sharing systems 36-bit pdp-10 class systems widespread use unix tops-10 particularly popular system universities early arpanet community rt-11 single-user real-time os pdp-11 class minicomputer rsx-11 corresponding multi-user os late 1960s late 1970s several hardware capabilities evolved allowed similar ported software run one system early systems utilized microprogramming implement features systems order permit different underlying computer architectures appear others series fact 360s 360/40 except 360/165 360/168 microprogrammed implementations enormous investment software systems made since 1960s caused original computer manufacturers continue develop compatible operating systems along hardware notable supported mainframe operating systems include first microcomputers capacity need elaborate operating systems developed mainframes minis minimalistic operating systems developed often loaded rom known monitors one notable early disk operating system cp/m supported many early microcomputers closely imitated microsoft ms-dos became widely popular operating system chosen ibm pc ibm version called ibm dos pc dos 1980s apple computer inc. apple inc. abandoned popular apple ii series microcomputers introduce apple macintosh computer innovative graphical user interface gui mac os introduction intel 80386 cpu chip october 1985 32-bit architecture paging capabilities provided personal computers ability run multitasking operating systems like earlier minicomputers mainframes microsoft responded progress hiring dave cutler developed vms operating system digital equipment corporation would lead development windows nt operating system continues serve basis microsoft operating systems line steve jobs co-founder apple inc. started next computer inc. developed nextstep operating system nextstep would later acquired apple inc. used along code freebsd core mac os x macos latest name change gnu project started activist programmer richard stallman goal creating complete free software replacement proprietary unix operating system project highly successful duplicating functionality various parts unix development gnu hurd kernel proved unproductive 1991 finnish computer science student linus torvalds cooperation volunteers collaborating internet released first version linux kernel soon merged gnu user space components system software form complete operating system since combination two major components usually referred simply linux software industry naming convention stallman free software foundation remain opposed preferring name gnu/linux berkeley software distribution known bsd unix derivative distributed university california berkeley starting 1970s freely distributed ported many minicomputers eventually also gained following use pcs mainly freebsd netbsd openbsd unix originally written assembly language ken thompson wrote b mainly based bcpl based experience multics project b replaced c unix rewritten c developed large complex family inter-related operating systems influential every modern operating system see history unix-like family diverse group operating systems several major sub-categories including system v bsd linux name unix trademark open group licenses use operating system shown conform definitions unix-like commonly used refer large set operating systems resemble original unix unix-like systems run wide variety computer architectures used heavily servers business well workstations academic engineering environments free unix variants linux bsd popular areas four operating systems certified open group holder unix trademark unix hp hp-ux ibm aix descendants original system v unix designed run respective vendor hardware contrast sun microsystems solaris run multiple types hardware including x86 sparc servers pcs apple macos replacement apple earlier non-unix mac os hybrid kernel-based bsd variant derived nextstep mach freebsd unix interoperability sought establishing posix standard posix standard applied operating system although originally created various unix variants subgroup unix family berkeley software distribution family includes freebsd netbsd openbsd operating systems commonly found webservers although also function personal computer os internet owes much existence bsd many protocols commonly used computers connect send receive data network widely implemented refined bsd world wide web also first demonstrated number computers running os based bsd called nextstep 1974 university california berkeley installed first unix system time students staff computer science department began adding new programs make things easier text editors berkeley received new vax computers 1978 unix installed school undergraduates modified unix even order take advantage computer hardware possibilities defense advanced research projects agency us department defense took interest decided fund project many schools corporations government organizations took notice started use berkeley version unix instead official one distributed steve jobs upon leaving apple inc. 1985 formed next inc. company manufactured high-end computers running variation bsd called nextstep one computers used tim berners-lee first webserver create world wide web developers like keith bostic encouraged project replace non-free code originated bell labs done however sued two years legal disputes bsd project spawned number free derivatives netbsd freebsd 1993 openbsd netbsd 1995 macos formerly mac os x later os x line open core graphical operating systems developed marketed sold apple inc. latest pre-loaded currently shipping macintosh computers macos successor original classic mac os apple primary operating system since 1984 unlike predecessor macos unix operating system built technology developed next second half 1980s apple purchased company early 1997 operating system first released 1999 mac os x server 1.0 followed march 2001 client version mac os x v10.0 cheetah since six distinct client server editions macos released two merged os x 10.7 lion prior merging macos server edition macos server architecturally identical desktop counterpart usually ran apple line macintosh server hardware macos server included work group management administration software tools provide simplified access key network services including mail transfer agent samba server ldap server domain name server others mac os x v10.7 lion server aspects mac os x server integrated client version product re-branded os x dropping mac name server tools offered application linux kernel originated 1991 project linus torvalds university student finland posted information project newsgroup computer students programmers received support assistance volunteers succeeded creating complete functional kernel linux unix-like developed without unix code unlike bsd variants open license model linux kernel code available study modification resulted use wide range computing machinery supercomputers smart-watches although estimates suggest linux used 1.82 desktop laptop pcs widely adopted use servers embedded systems cell phones linux superseded unix many platforms used supercomputers including top 385 many computers also green500 different order linux runs top 10 linux also commonly used small energy-efficient computers smartphones smartwatches linux kernel used popular distributions red hat debian ubuntu linux mint google android chrome os chromium os microsoft windows family proprietary operating systems designed microsoft corporation primarily targeted intel architecture based computers estimated 88.9 percent total usage share web connected computers latest version windows 10 2011 windows 7 overtook windows xp common version use microsoft windows first released 1985 operating environment running top ms-dos standard operating system shipped intel architecture personal computers time 1995 windows 95 released used ms-dos bootstrap backwards compatibility win9x could run real-mode ms-dos 16-bit windows 3.x drivers windows released 2000 last version win9x family later versions based windows nt kernel current client versions windows run ia-32 x86-64 32-bit arm microprocessors addition itanium still supported older server version windows server 2008 r2 past windows nt supported additional architectures server editions windows widely used recent years microsoft expended significant capital effort promote use windows server operating system however windows usage servers widespread personal computers windows competes linux bsd server market share reactos windows-alternative operating system developed principles windows without using microsoft code many operating systems significant day longer amigaos os/2 ibm microsoft classic mac os non-unix precursor apple macos beos xts-300 risc os morphos haiku baremetal freemint still used niche markets continue developed minority platforms enthusiast communities specialist applications openvms formerly dec still active development hewlett-packard yet operating systems used almost exclusively academia operating systems education research operating system concepts typical example system fulfills roles minix example singularity used purely research another example oberon system designed eth z\u00fcrich niklaus wirth j\u00fcrg gutknecht group students former computer systems institute 1980s used mainly research teaching daily work wirth group operating systems failed win significant market share introduced innovations influenced mainstream operating systems least bell labs plan 9 components operating system exist order make different parts computer work together user software needs go operating system order use hardware whether simple mouse keyboard complex internet component aid firmware device drivers kernel provides basic level control computer hardware devices manages memory access programs ram determines programs get access hardware resources sets resets cpu operating states optimal operation times organizes data long-term non-volatile storage file systems media disks tapes flash memory etc operating system provides interface application program computer hardware application program interact hardware obeying rules procedures programmed operating system operating system also set services simplify development execution application programs executing application program involves creation process operating system kernel assigns memory space resources establishes priority process multi-tasking systems loads program binary code memory initiates execution application program interacts user hardware devices interrupts central operating systems provide efficient way operating system interact react environment alternative operating system watch various sources input events polling require action found older systems small stacks 50 60 bytes unusual modern systems large stacks interrupt-based programming directly supported modern cpus interrupts provide computer way automatically saving local register contexts running specific code response events even basic computers support hardware interrupts allow programmer specify code may run event takes place interrupt received computer hardware automatically suspends whatever program currently running saves status runs computer code previously associated interrupt analogous placing bookmark book response phone call modern operating systems interrupts handled operating system kernel interrupts may come either computer hardware running program hardware device triggers interrupt operating system kernel decides deal event generally running processing code amount code run depends priority interrupt example person usually responds smoke detector alarm answering phone processing hardware interrupts task usually delegated software called device driver may part operating system kernel part another program device drivers may relay information running program various means program may also trigger interrupt operating system program wishes access hardware example may interrupt operating system kernel causes control passed back kernel kernel processes request program wishes additional resources wishes shed resources memory triggers interrupt get kernel attention modern microprocessors cpu mpu support multiple modes operation cpus capability offer least two modes user mode supervisor mode general terms supervisor mode operation allows unrestricted access machine resources including mpu instructions user mode operation sets limits instruction use typically disallows direct access machine resources cpus might modes similar user mode well virtual modes order emulate older processor types 16-bit processors 32-bit one 32-bit processors 64-bit one power-on reset system begins supervisor mode operating system kernel loaded started boundary user mode supervisor mode also known kernel mode established supervisor mode used kernel low level tasks need unrestricted access hardware controlling memory accessed communicating devices disk drives video display devices user mode contrast used almost everything else application programs word processors database managers operate within user mode access machine resources turning control kernel process causes switch supervisor mode typically transfer control kernel achieved executing software interrupt instruction motorola 68000 codice_1 instruction software interrupt causes microprocessor switch user mode supervisor mode begin executing code allows kernel take control user mode programs usually access restricted set microprocessor instructions generally execute instructions could potentially cause disruption system operation supervisor mode instruction execution restrictions typically removed allowing kernel unrestricted access machine resources term user mode resource generally refers one cpu registers contain information running program n't allowed alter attempts alter resources generally causes switch supervisor mode operating system deal illegal operation program attempting example forcibly terminating killing program among things multiprogramming operating system kernel must responsible managing system memory currently use programs ensures program interfere memory already use another program since programs time share program must independent access memory cooperative memory management used many early operating systems assumes programs make voluntary use kernel memory manager exceed allocated memory system memory management almost never seen since programs often contain bugs cause exceed allocated memory program fails may cause memory used one programs affected overwritten malicious programs viruses may purposefully alter another program memory may affect operation operating system cooperative memory management takes one misbehaved program crash system memory protection enables kernel limit process access computer memory various methods memory protection exist including memory segmentation paging methods require level hardware support 80286 mmu n't exist computers segmentation paging certain protected mode registers specify cpu memory address allow running program access attempts access addresses trigger interrupt cause cpu re-enter supervisor mode placing kernel charge called segmentation violation seg-v short since difficult assign meaningful result operation usually sign misbehaving program kernel generally resorts terminating offending program reports error windows versions 3.1 level memory protection programs could easily circumvent need use general protection fault would produced indicating segmentation violation occurred however system would often crash anyway use virtual memory addressing paging segmentation means kernel choose memory program may use given time allowing operating system use memory locations multiple tasks program tries access memory n't current range accessible memory nonetheless allocated kernel interrupted way would program exceed allocated memory see section memory management unix kind interrupt referred page fault kernel detects page fault generally adjusts virtual memory range program triggered granting access memory requested gives kernel discretionary power particular application memory stored even whether actually allocated yet modern operating systems memory accessed less frequently temporarily stored disk media make space available use programs called swapping area memory used multiple programs memory area contains swapped exchanged demand virtual memory provides programmer user perception much larger amount ram computer really multitasking refers running multiple independent computer programs computer giving appearance performing tasks time since computers one two things one time generally done via time-sharing means program uses share computer time execute operating system kernel contains scheduling program determines much time process spends executing order execution control passed programs control passed process kernel allows program access cpu memory later control returned kernel mechanism another program may allowed use cpu so-called passing control kernel applications called context switch early model governed allocation time programs called cooperative multitasking model control passed program kernel may execute long wants explicitly returning control kernel means malicious malfunctioning program may prevent programs using cpu hang entire system enters infinite loop modern operating systems extend concepts application preemption device drivers kernel code operating system preemptive control internal run-times well philosophy governing preemptive multitasking ensuring programs given regular time cpu implies programs must limited much time allowed spend cpu without interrupted accomplish modern operating system kernels make use timed interrupt protected mode timer set kernel triggers return supervisor mode specified time elapsed see sections interrupts dual mode operation many single user operating systems cooperative multitasking perfectly adequate home computers generally run small number well tested programs amigaos exception preemptive multitasking first version windows nt first version microsoft windows enforced preemptive multitasking n't reach home user market windows xp since windows nt targeted professionals access data stored disks central feature operating systems computers store data disks using files structured specific ways order allow faster access higher reliability make better use drive available space specific way files stored disk called file system enables files names attributes also allows stored hierarchy directories folders arranged directory tree early operating systems generally supported single type disk drive one kind file system early file systems limited capacity speed kinds file names directory structures could use limitations often reflected limitations operating systems designed making difficult operating system support one file system many simpler operating systems support limited range options accessing storage systems operating systems like unix linux support technology known virtual file system vfs operating system unix supports wide array storage devices regardless design file systems allowing accessed common application programming interface api makes unnecessary programs knowledge device accessing vfs allows operating system provide programs access unlimited number devices infinite variety file systems installed use specific device drivers file system drivers connected storage device hard drive accessed device driver device driver understands specific language drive able translate language standard language used operating system access disk drives unix language block devices kernel appropriate device driver place access contents disk drive raw format may contain one file systems file system driver used translate commands used access specific file system standard set commands operating system use talk file systems programs deal file systems basis filenames directories/folders contained within hierarchical structure create delete open close files well gather various information including access permissions size free space creation modification dates various differences file systems make supporting file systems difficult allowed characters file names case sensitivity presence various kinds file attributes makes implementation single interface every file system daunting task operating systems tend recommend using support natively file systems specifically designed example ntfs windows ext3 reiserfs linux however practice third party drivers usually available give support widely used file systems general-purpose operating systems example ntfs available linux ntfs-3g ext2/3 reiserfs available windows third-party software support file systems highly varied among modern operating systems although several common file systems almost operating systems include support drivers operating systems vary file system support disk formats may installed windows file system usually limited application certain media example cds must use iso 9660 udf windows vista ntfs file system operating system installed possible install linux onto many types file systems unlike operating systems linux unix allow file system used regardless media stored whether hard drive disc cd dvd ... usb flash drive even contained within file located another file system device driver specific type computer software developed allow interaction hardware devices typically constitutes interface communicating device specific computer bus communications subsystem hardware connected providing commands and/or receiving data device end requisite interfaces operating system software applications specialized hardware-dependent computer program also operating system specific enables another program typically operating system applications software package computer program running operating system kernel interact transparently hardware device usually provides requisite interrupt handling necessary necessary asynchronous time-dependent hardware interfacing needs key design goal device drivers abstraction every model hardware even within class device different newer models also released manufacturers provide reliable better performance newer models often controlled differently computers operating systems expected know control every device future solve problem operating systems essentially dictate every type device controlled function device driver translate operating system mandated function calls device specific calls theory new device controlled new manner function correctly suitable driver available new driver ensures device appears operate usual operating system point view versions windows vista versions linux 2.6 driver execution co-operative meaning driver entered infinite loop would freeze system recent revisions operating systems incorporate kernel preemption kernel interrupts driver give tasks separates process receives response device driver gives tasks currently operating systems support variety networking protocols hardware applications using means computers running dissimilar operating systems participate common network sharing resources computing files printers scanners using either wired wireless connections networks essentially allow computer operating system access resources remote computer support functions could resources connected directly local computer includes everything simple communication using networked file systems even sharing another computer graphics sound hardware network services allow resources computer accessed transparently ssh allows networked users direct access computer command line interface client/server networking allows program computer called client connect via network another computer called server servers offer host various services network computers users services usually provided ports numbered access points beyond server ip address port number usually associated maximum one running program responsible handling requests port daemon user program turn access local hardware resources computer passing requests operating system kernel many operating systems support one vendor-specific open networking protocols well example sna ibm systems decnet systems digital equipment corporation microsoft-specific protocols smb windows specific protocols specific tasks may also supported nfs file access protocols like esound esd easily extended network provide sound local applications remote system sound hardware computer secure depends number technologies working properly modern operating system provides access number resources available software running system external devices like networks via kernel operating system must capable distinguishing requests allowed processed others processed systems may simply distinguish privileged non-privileged systems commonly form requester identity user name establish identity may process authentication often username must quoted username may password methods authentication magnetic cards biometric data might used instead cases especially connections network resources may accessed authentication reading files network share also covered concept requester identity authorization particular services resources accessible requester logged system tied either requester user account variously configured groups users requester belongs addition allow disallow model security system high level security also offers auditing options would allow tracking requests access resources reading file internal security security already running program possible possibly harmful requests must carried interrupts operating system kernel programs directly access hardware resources secured external security involves request outside computer login connected console kind network connection external requests often passed device drivers operating system kernel passed onto applications carried directly security operating systems long concern highly sensitive data held computers commercial military nature united states government department defense dod created trusted computer system evaluation criteria tcsec standard sets basic requirements assessing effectiveness security became vital importance operating system makers tcsec used evaluate classify select trusted operating systems considered processing storage retrieval sensitive classified information network services include offerings file sharing print services email web sites file transfer protocols ftp compromised security front line security hardware devices known firewalls intrusion detection/prevention systems operating system level number software firewalls available well intrusion detection/prevention systems modern operating systems include software firewall enabled default software firewall configured allow deny network traffic service application running operating system therefore one install running insecure service telnet ftp threatened security breach firewall would deny traffic trying connect service port alternative strategy sandbox strategy available systems meet popek goldberg virtualization requirements operating system running user programs native code instead either emulates processor provides host p-code based system java internal security especially relevant multi-user systems allows user system private files users tamper read internal security also vital auditing use since program potentially bypass operating system inclusive bypassing auditing every computer operated individual requires user interface user interface usually referred shell essential human interaction supported user interface views directory structure requests services operating system acquire data input hardware devices keyboard mouse credit card reader requests operating system services display prompts status messages output hardware devices video monitor printer two common forms user interface historically command-line interface computer commands typed line-by-line graphical user interface visual environment commonly wimp present modern computer systems support graphical user interfaces gui often include computer systems original implementation classic mac os gui integrated kernel technically graphical user interface operating system service incorporating support one operating system kernel allow gui responsive reducing number context switches required gui perform output functions operating systems modular separating graphics subsystem kernel operating system 1980s unix vms many others operating systems built way linux macos also built way modern releases microsoft windows windows vista implement graphics subsystem mostly user-space however graphics drawing routines versions windows nt 4.0 windows server 2003 exist mostly kernel space windows 9x little distinction interface kernel many computer operating systems allow user install create user interface desire x window system conjunction gnome kde plasma 5 commonly found setup unix unix-like bsd linux solaris systems number windows shell replacements released microsoft windows offer alternatives included windows shell shell separated windows numerous unix-based guis existed time derived x11 competition among various vendors unix hp ibm sun led much fragmentation though effort standardize 1990s cose cde failed various reasons eventually eclipsed widespread adoption gnome k desktop environment prior free software-based toolkits desktop environments motif prevalent toolkit/desktop combination basis upon cde developed graphical user interfaces evolve time example windows modified user interface almost every time new major version windows released mac os gui changed dramatically introduction mac os x 1999 real-time operating system rtos operating system intended applications fixed deadlines real-time computing applications include small embedded systems automobile engine controllers industrial robots spacecraft industrial control large-scale computing systems early example large-scale real-time operating system transaction processing facility developed american airlines ibm sabre airline reservations system embedded systems fixed deadlines use real-time operating system vxworks pikeos ecos qnx montavista linux rtlinux windows ce real-time operating system shares similar apis desktop windows shares none desktop windows codebase symbian os also rtos kernel eka2 starting version 8.0b embedded systems use operating systems palm os bsd linux although operating systems support real-time computing operating system development one complicated activities computing hobbyist may engage hobby operating system may classified one whose code directly derived existing operating system users active developers cases hobby development support homebrew computing device example simple single-board computer powered 6502 microprocessor development may architecture already widespread use operating system development may come entirely new concepts may commence modeling existing operating system either case hobbyist his/her developer may interact small sometimes unstructured group individuals like interests examples hobby operating system include syllable templeos application software generally written use specific operating system sometimes even specific hardware porting application run another os functionality required application may implemented differently os names functions meaning arguments etc requiring application adapted changed otherwise maintained unix first operating system written assembly language making portable systems different native pdp-11 cost supporting operating systems diversity avoided instead writing applications software platforms java qt abstractions already borne cost adaptation specific operating systems system libraries another approach operating system vendors adopt standards example posix os abstraction layers provide commonalities reduce porting costs", + "neighbors": [ + 0, + 1, + 9, + 11, + 13, + 14, + 22, + 24, + 25, + 27, + 33, + 34, + 35, + 36, + 37, + 38, + 40, + 42, + 43, + 46, + 55, + 58, + 63, + 64, + 65, + 66, + 67, + 71, + 74, + 77, + 78, + 79, + 81, + 82, + 83, + 85, + 91, + 93, + 94, + 95, + 99, + 101, + 106, + 107, + 108, + 113, + 116, + 117, + 121, + 123, + 127, + 130, + 134, + 137, + 138, + 142, + 148, + 149, + 150, + 153, + 160, + 162, + 165, + 168, + 170, + 171, + 175, + 176, + 178, + 185, + 187, + 192, + 193, + 194, + 195, + 196, + 197, + 201, + 203, + 206, + 207, + 210, + 213, + 216, + 217, + 219, + 222, + 225, + 227, + 228, + 234, + 236, + 238, + 242, + 248, + 251, + 254, + 255, + 258, + 264, + 265, + 267, + 270, + 272, + 273, + 275, + 276, + 277, + 278, + 282, + 292, + 294, + 295, + 296, + 298, + 306, + 308, + 312, + 313, + 318, + 322, + 323, + 326, + 329, + 330, + 331, + 332, + 334, + 336, + 337, + 340, + 344, + 345, + 346, + 352, + 353, + 354, + 355, + 356, + 357, + 358, + 359, + 360, + 364, + 365, + 377, + 379, + 380, + 387, + 390, + 391, + 392, + 394, + 397, + 398, + 399, + 400, + 401, + 403, + 405, + 411, + 412, + 413, + 416, + 425, + 427, + 429, + 431, + 434, + 435, + 438, + 443, + 446, + 447, + 448, + 455, + 457, + 458, + 459, + 463, + 465, + 469, + 473, + 475, + 477, + 483, + 484, + 489, + 500, + 503, + 506, + 512, + 521, + 522, + 524, + 526, + 527, + 536, + 541, + 542, + 553, + 554, + 558, + 565, + 567, + 569, + 574, + 582, + 583, + 585, + 593, + 595, + 596, + 598, + 599, + 610, + 611, + 615, + 620, + 622, + 623, + 625, + 631, + 638, + 639, + 647, + 648, + 649, + 650, + 653, + 656, + 662, + 664, + 668, + 670, + 682, + 685, + 686, + 696, + 704, + 707, + 708, + 711, + 712, + 713, + 715, + 716, + 717, + 720, + 721, + 723, + 725, + 728, + 734, + 736, + 737, + 739, + 741, + 743, + 746, + 753, + 754, + 755, + 766, + 772, + 776, + 780, + 782, + 786, + 787, + 789, + 791, + 796, + 797, + 800, + 801, + 802, + 805, + 806, + 812, + 815, + 816, + 819, + 825, + 834, + 842, + 843, + 857, + 860, + 862, + 864, + 865, + 868, + 869, + 870, + 872, + 874, + 875, + 884, + 886, + 887, + 891, + 893, + 897, + 899, + 900, + 901, + 902, + 904, + 908, + 910, + 916, + 919, + 920, + 923, + 927, + 929, + 934, + 935, + 937, + 938, + 939, + 940, + 941, + 942, + 944, + 945, + 947, + 948, + 953, + 954, + 957, + 959, + 961, + 962, + 965, + 966, + 976, + 978, + 980, + 982, + 984, + 985, + 987, + 991, + 992, + 993, + 996, + 997, + 998, + 1001, + 1003, + 1004, + 1005, + 1006, + 1011, + 1012, + 1018, + 1020, + 1021, + 1024, + 1025, + 1027, + 1028, + 1030, + 1033, + 1034, + 1035, + 1037, + 1039, + 1040, + 1044, + 1045, + 1049, + 1050, + 1053, + 1054, + 1055, + 1057, + 1063, + 1065, + 1066, + 1068, + 1074, + 1082, + 1084, + 1087, + 1090, + 1091, + 1094, + 1095, + 1096, + 1097, + 1098, + 1100, + 1102, + 1103, + 1104, + 1105, + 1106, + 1109, + 1110, + 1114, + 1118, + 1119, + 1120, + 1121, + 1123, + 1130, + 1132, + 1138, + 1139, + 1140, + 1155, + 1157, + 1159, + 1161, + 1163, + 1165, + 1166, + 1168, + 1173, + 1177, + 1179, + 1180, + 1183, + 1187, + 1188, + 1189, + 1190, + 1195, + 1200, + 1202, + 1203, + 1204, + 1207, + 1208, + 1210, + 1213, + 1214, + 1215, + 1216, + 1217, + 1218, + 1221, + 1224, + 1225, + 1227, + 1228, + 1232, + 1234, + 1235, + 1237, + 1242, + 1245, + 1247, + 1251, + 1252, + 1254, + 1257, + 1261, + 1269, + 1274, + 1275, + 1276, + 1277, + 1279, + 1283, + 1287, + 1288, + 1292, + 1294, + 1296, + 1298, + 1301, + 1302, + 1304, + 1310, + 1311, + 1315, + 1317, + 1318, + 1321, + 1322, + 1324, + 1325, + 1327, + 1328, + 1331, + 1336, + 1339, + 1346, + 1358, + 1360, + 1361, + 1363, + 1366, + 1368, + 1369, + 1370, + 1371, + 1372, + 1373, + 1375, + 1376, + 1377, + 1378, + 1379, + 1381, + 1385, + 1389, + 1390, + 1391, + 1394, + 1397, + 1398, + 1400, + 1401, + 1403, + 1406, + 1407, + 1413, + 1415, + 1421, + 1422, + 1423, + 1427, + 1430, + 1433, + 1441, + 1445, + 1449, + 1452, + 1454, + 1456, + 1458, + 1459, + 1461, + 1462, + 1466, + 1474, + 1480, + 1483, + 1492, + 1494, + 1500, + 1502, + 1503, + 1507, + 1513, + 1514, + 1516, + 1520, + 1521, + 1526, + 1527, + 1528, + 1530, + 1531, + 1535, + 1538, + 1542, + 1543, + 1544, + 1545, + 1546, + 1547, + 1549, + 1550, + 1553, + 1554, + 1555, + 1556, + 1563, + 1565, + 1566, + 1568, + 1569, + 1570, + 1578, + 1583, + 1586, + 1587, + 1588, + 1589, + 1592, + 1593, + 1594, + 1599, + 1604, + 1607, + 1608, + 1609, + 1610, + 1613, + 1616, + 1618, + 1620, + 1621, + 1625, + 1631, + 1632, + 1634, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1139, + "label": 3, + "text": "DOS_Shell:dos shell dos shell file manager debuted ms-dos ibm pc dos version 4.0 june 1988 discontinued ms-dos version 6.22 remained part supplemental disk supplemental disk could ordered could downloaded microsoft ftp server dos shell retained pc dos pc dos 2000 dos shell one first successful attempts create basic graphical user interface gui type file manager dos although properly referred text user interface tui character-oriented windows cow even though graphical modes available supported hardware vga-equipped pcs additionally one first guis developed microsoft later inspired design windows shell much like dos version file manager found windows versions 3.11 nt 3.51 file explorer later versions ms-dos 4.x 5.x program implemented com file codice_1 ms-dos 6 executable .exe filename extension codice_2 shell includes common features seen file managers copying moving renaming files well ability launch applications double-click shell could run command codice_3 ability set simple colours styles shell also help system program list task swapper like many modern file managers ability display dual hierarchy directory file lists i.e left right panes displaying list directory contents hierarchical file path current working directory mouse supported however like dos application required appropriate device driver one feature ability list files hard drive single alphabetized list along path attributes permitted user compare versions file different directories attributes easily spot duplicates dos shell incapable full multitasking supported rudimentary task switching could switch programs running memory cost performance hit however running programs fit conventional memory area support swapping disk time windows 3.1x graphical user interface became much popular among computer users windows capable multitasking system performance much higher complete access extended memory", + "neighbors": [ + 99, + 359, + 796, + 797, + 870, + 961, + 1138, + 1188, + 1304 + ], + "mask": "Validation" + }, + { + "node_id": 1140, + "label": 2, + "text": "IOS_SDK:ios sdk ios sdk software development kit formerly iphone sdk software development kit developed apple inc kit allows development mobile apps apple ios operating system originally developing iphone prior unveiling 2007 apple then-ceo steve jobs intend let third-party developers build native apps ios instead directing make web applications safari web browser however backlash developers prompted company reconsider jobs announcing october 2007 apple would software development kit available developers february 2008 sdk released march 6 2008 sdk free download users mac personal computers available microsoft windows pcs sdk contains sets giving developers access various functions services ios devices hardware software attributes also contains iphone simulator mimic look feel device computer developing new versions sdk accompany new versions ios order test applications get technical support distribute apps app store developers required subscribe apple developer program combined xcode ios sdk helps developers write ios apps using officially supported programming languages including swift objective-c. companies also created tools allow development native ios apps using respective programming languages originally developing iphone prior unveiling 2007 apple then-ceo steve jobs intend let third-party developers build native apps ios operating system instead directing make web applications safari web browser however backlash developers prompted company reconsider jobs announcing october 17 2007 apple would software development kit sdk available developers february 2008 sdk released march 6 2008 ios sdk free download mac users available microsoft windows personal computers test application get technical support distribute applications app store developers required subscribe apple developer program sdk contents separated following sets sdk also contains iphone simulator program used simulate look feel iphone developer computer new sdk versions accompany new ios versions ios sdk combined xcode helps developers write ios applications using officially supported programming languages including swift objective-c. .ipa ios app store package file ios application archive file stores ios app 2008 sun microsystems announced plans release java virtual machine jvm ios based java platform micro edition version java would enable java applications run iphone ipod touch soon announcement developers familiar sdk terms agreement believed allowing third-party applications run background answer phone call still run application example allowing application download code another source allowing application interact third-party application sun development efforts could hindered without apple cooperation sun also worked third-party company called innaworks attempts get java iphone despite apparent lack interest apple firmware leak 2007 iphone release revealed arm chip processor jazelle support embedded java execution novell announced september 2009 successfully developed monotouch software framework let developers write native iphone applications c .net programming languages still maintaining compatibility apple requirements xamarin.ios visual studio tools xamarin open-source app development platform lets build apps many operating systems single shared .net code base xamarin allows write apps take full advantage power features performance platform xamarin.ios one xamarin frameworks use create fully native ios apps using c visual studio ios support adobe flash although adobe two versions software \u2013 flash flash lite \u2013 apple views neither suitable iphone claiming full flash slow useful flash lite capable used web october 2009 adobe announced upcoming update creative suite would feature component let developers build native iphone apps using company flash development tools software officially released part company creative suite 5 collection professional applications april 2010 apple made controversial changes iphone developer agreement requiring developers use approved programming languages order publish apps app store banning applications used third-party development tools developer backlash news potential antitrust investigation apple revised agreement september allowing use third-party development tools", + "neighbors": [ + 71, + 75, + 99, + 101, + 130, + 228, + 252, + 269, + 337, + 345, + 356, + 379, + 394, + 395, + 403, + 475, + 477, + 489, + 511, + 520, + 521, + 527, + 596, + 607, + 610, + 622, + 625, + 629, + 634, + 696, + 782, + 797, + 858, + 877, + 917, + 927, + 945, + 956, + 961, + 972, + 1001, + 1018, + 1020, + 1051, + 1138, + 1178, + 1189, + 1193, + 1203, + 1237, + 1292, + 1305, + 1334, + 1339, + 1373, + 1488, + 1544, + 1552, + 1591, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1141, + "label": 7, + "text": "Le_Select:le select le select framework prototype accessing data heterogeneous nature invoking data processing program internet/intranet environments 1 le select middleware software system designed intention providing organised platform access distributed data software resources unlike data warehouses attempt collect data central location usually single format data structure le select mediator aims provide connection data le select based distributed computing system fully distributed architecture le select global repository global schema data published le select viewed users tuples relational table regardless native data format could flat file spreadsheet wrappers software modules used le select translate data native format relational format viewed users also contain information locate data server access formed set java classes additional xml definition files designed wrappers serve similar purposes re-written rather developer start scratch le select based fully distributed system architecture program run one le select server whilst using data another server system sends data server program running coordinates execution sends back results client relational table user view le select data standard web-browser form tuples relational database additional capabilities include provision sql search abilities le select form middleware software based fully distributed system architecture allows users publish consult wide range data queried accessed remotely via internet", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1142, + "label": 0, + "text": "Natural-language_user_interface:natural-language user interface natural-language user interface lui nlui type computer human interface linguistic phenomena verbs phrases clauses act ui controls creating selecting modifying data software applications interface design natural-language interfaces sought speed ease use suffer challenges understanding wide varieties ambiguous input natural-language interfaces active area study field natural-language processing computational linguistics intuitive general natural-language interface one active goals semantic web text interfaces natural varying degrees many formal un-natural programming languages incorporate idioms natural human language likewise traditional keyword search engine could described shallow natural-language user interface natural-language search engine would theory find targeted answers user questions opposed keyword search example confronted question form 'which u.s. state highest income tax conventional search engines ignore question instead search keywords 'state 'income 'tax natural-language search hand attempts use natural-language processing understand nature question search return subset web contains answer question works results would higher relevance results keyword search engine prototype nl interfaces already appeared late sixties early seventies natural-language interfaces past led users anthropomorphize computer least attribute intelligence machines warranted part user led unrealistic expectations capabilities system expectations make difficult learn restrictions system users attribute much capability ultimately lead disappointment system fails perform expected case ai winter 1970s 80s 1995 paper titled 'natural language interfaces databases \u2013 introduction describes challenges goals consider generally speed efficiency interface algorithms two points main point determine methods better others therefore greater success market addition localisation across multiple language sites requires extra consideration based differing sentence structure language syntax variations languages finally regarding methods used main problem solved creating general algorithm recognize entire spectrum different voices disregarding nationality gender age significant differences extracted features even speakers says word phrase must successfully overcome natural-language interface gives rise technology used many different applications main uses named defined applications use natural-language recognition integrated utilities listed ubiquity add-on mozilla firefox collection quick easy natural-language-derived commands act mashups web services thus allowing users get information relate current webpages wolfram alpha online service answers factual queries directly computing answer structured data rather providing list documents web pages might contain answer search engine would announced march 2009 stephen wolfram released public may 15 2009 siri intelligent personal assistant application integrated operating system ios application uses natural language processing answer questions make recommendations siri marketing claims include adapts user individual preferences time personalizes results performs tasks making dinner reservations trying catch cab", + "neighbors": [ + 12, + 134, + 159, + 282, + 307, + 368, + 372, + 453, + 662, + 733, + 824, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1465, + 1486, + 1544, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1143, + "label": 3, + "text": "Motorola_88000:motorola 88000 88000 m88k short risc instruction set architecture isa developed motorola 1980s 88000 arrived market 1988 two years competing sparc mips due late start extensive delays releasing second-generation mc88110 m88k achieved limited success outside mvme platform embedded controller environments motorola joined aim alliance 1991 develop powerpc development 88000 ended originally called 78000 homage famed 68000 series design went tortuous development path including number change finally emerging april 1988 initial version 88100 generally required separate mmu mc88200 88200 added mmu data instruction caches time processors mmu built-in including motorola 68030 returning separate mmu chip step backward 88100/88200 saw little use follow-on version combining cpu mmu planned 88110 late 1980s several companies actively examining 88000 series future use including next apple computer apollo computer given design time 88110 finally available 1990 attempt popularize system 88open group similar sun microsystems attempting sparc design appears failed practical sense early 1990s motorola joined aim effort create new risc architecture based ibm power architecture worked features 88000 new powerpc architecture offer customer base sort upgrade path point 88000 dumped soon possible like 68000 88000 considered clean design pure 32-bit load/store architecture using separate instruction data caches harvard architecture separate data address buses small powerful command set like motorola cpus use memory segmentation major architectural mistake integer instructions floating-point instructions used register file required single register file sufficient read write ports support integer execution unit floating-point unit connections port additional capacitive load must driven register memory cell made difficult build high frequency superscalar implementations first implementation 88000 isa mc88100 microprocessor included integrated fpu mated mc88200 mmu cache controller idea behind splitting duties allow multiprocessor systems built easily single mc88200 could support four mc88100s however also meant building basic system single processor required chips considerable wiring driving costs likely another major reason 88000 limited success later addressed superscalar mc88110 combined cpu fpu mmu l1 cache single package additional modification made behest mit *t project resulted mc88110mp including on-chip communications use multi-processor systems version capable speeds 100 mhz planned mc88120 never built implementation embedded applications mc88300 development early 1990s eventually canceled ford motor company planned use chips offered powerpc design replacement accepted motorola released series single-board computers known mvme series building box systems based 88000 well series 900 stackable computers employing mvme boards unlike tower rack mount systems series 900 sat top connected one another bus-like cabling concept never caught major 3rd party users limited widespread use would data general aviion series fairly popular remain limited use today later models dg moved intel encore computer built encore-91 machine m88k introduced completely ground-up redesign infinity 90 series unclear many machines sold encore moved alpha gec computers used 88100 build gec 4310 one gec 4000 series computers issues memory management meant n't perform well earlier gate array based am2900 based gec 4000 series computers bbn butterfly model tc-2000 used 88100 processor scaled 512 cpus linotype-hell used 88110 power workstations running davinci raster graphics editor image manipulation 88110 made versions never released next machine next risc workstation project canceled along next hardware projects 1993 4-processor omron luna-88k machines japan used m88k used short time mach kernel project carnegie mellon university early 1990s northern telecom used 88100 88110 central processor dms supernode family telephone switches users much smaller alpha microsystems originally planned migrate 88k architecture motorola 68000 internally created machine around running unix system v later scrapped favour later 68k derivatives ncd used 88100 without 88200 88k x-terminals dolphin server spin-off dying norsk data built servers based 88k around 100 systems shipped 1988-1992 virtuality used 88110 su2000 virtual reality arcade machine graphics processor one 88110 per screen virtual reality headset embedded computer space tri-channel vms computer f-15 s/mtd used three 88000s triply redundant computer motorola released unix system v derivative system v/88 88000-based systems two major releases release 3.2 version 3 release 4.0 version 3. ref name= unix system v/88 /ref data general aviion systems ran dg/ux openbsd ports exist mvme systems ref name= openbsd/mvme88k openbsd/mvme88k /ref luna-88k workstations ref name= openbsd/luna88k openbsd/luna88k /ref data general aviion systems. ref name= openbsd/aviion openbsd/aviion /ref least one unofficial experimental netbsd port exists mvme systems. ref name= netbsd/m88k netbsd/m88k unofficial port netbsd 3.x /ref", + "neighbors": [ + 127, + 193, + 210, + 331, + 443, + 445, + 457, + 460, + 738, + 752, + 893, + 907, + 1016, + 1022, + 1100, + 1111, + 1143, + 1147, + 1284, + 1290, + 1398, + 1518, + 1538, + 1605 + ], + "mask": "Train" + }, + { + "node_id": 1144, + "label": 4, + "text": "DNS_hijacking:dns hijacking dns hijacking dns redirection practice subverting resolution domain name system dns queries achieved malware overrides computer tcp/ip configuration point rogue dns server control attacker modifying behaviour trusted dns server comply internet standards modifications may made malicious purposes phishing self-serving purposes internet service providers isps public/router-based online dns server providers direct users web traffic isp web servers advertisements served statistics collected purposes isp dns service providers block access selected domains form censorship one functions dns server translate domain name ip address applications need connect internet resource website functionality defined various formal internet standards define protocol considerable detail dns servers implicitly trusted internet-facing computers users correctly resolve names actual addresses registered owners internet domain rogue dns server translates domain names desirable websites search engines banks brokers etc ip addresses sites unintended content even malicious websites users depend dns servers automatically assigned isps zombie computers use dns-changing trojans invisibly switch automatic dns server assignment isp manual dns server assignment rogue dns servers router assigned dns servers also altered remote exploitation vulnerability within router firmware users try visit websites instead sent bogus website attack termed pharming site redirected malicious website masquerading legitimate website order fraudulently obtain sensitive information termed phishing number consumer isps cablevision optimum online centurylink cox communications rcn rogers charter communications spectrum plusnet verizon sprint t-mobile us virgin media frontier communications bell sympatico t-online optus mediacom ono talktalk bigpond telstra ttnet t\u00fcrksat telkom indonesia use dns hijacking purposes displaying advertisements collecting statistics dutch isps xs4all ziggo use dns hijacking court order ordered block access pirate bay display warning page instead practices violate rfc standard dns nxdomain responses potentially open users cross-site scripting attacks concern dns hijacking involves hijacking nxdomain response internet intranet applications rely nxdomain response describe condition dns entry specified host one query invalid domain name example www.example.invalid one get nxdomain response \u2013 informing application name invalid taking appropriate action example displaying error attempting connect server however domain name queried one non-compliant isps one would always receive fake ip address belonging isp web browser behavior annoying offensive connections ip address display isp redirect page provider sometimes advertising instead proper error message however applications rely nxdomain error instead attempt initiate connections spoofed ip address potentially exposing sensitive information examples functionality breaks isp hijacks dns cases isps provide subscriber-configurable settings disable hijacking nxdomain responses correctly implemented setting reverts dns standard behavior isps however instead use web browser cookie store preference case underlying behavior resolved dns queries continue redirected isp redirect page replaced counterfeit dns error page applications web-browsers opted scheme using cookies opt-out targets http protocol scheme actually implemented protocol-neutral dns system uk information commissioner office acknowledged practice involuntary dns hijacking contravenes pecr ec directive 95/46 data protection require explicit consent processing communication traffic however refused intervene claiming would sensible enforce law would cause significant indeed demonstrable detriment individuals germany 2019 revealed deutsche telekom ag manipulated dns servers also transmitted network traffic non-secure cookies users use https third party company web portal t-online users redirected due dns manipulation owned deutsche telekom user filed criminal complaint deutsche telekom stopped dns manipulations icann international body responsible administering top-level domain names published memorandum highlighting concerns affirming end users dissatisfied poor opt-out options like cookies responded controversy finding ways avoid spoofed nxdomain responses dns software bind dnsmasq offer options filter results run gateway router protect entire network google among others run open dns servers currently return spoofed results user could use google public dns instead isp dns servers willing accept use service google privacy policy potentially exposed another method google track user one limitation approach providers block rewrite outside dns requests opendns owned cisco similar popular service alter nxdomain responses google april 2016 launched dns-over-https service scheme overcome limitations legacy dns protocol performs remote dnssec check transfers results secure https tunnel also application-level work-arounds noredirect firefox extension mitigate behavior approach like fixes one application example firefox address issues caused website owners may able fool hijackers using certain dns settings example setting txt record unused wildcard address e.g *.example.com alternatively try setting cname wildcard example.invalid making use fact '.invalid guaranteed exist per rfc limitation approach prevents hijacking particular domains may address vpn security issues caused dns hijacking", + "neighbors": [ + 144, + 425, + 444, + 531, + 678, + 779, + 813, + 1145, + 1172, + 1206 + ], + "mask": "Test" + }, + { + "node_id": 1145, + "label": 4, + "text": "ISP_redirect_page:isp redirect page isp redirect page spoof page served major isps including cox communications embarq verizon rogers earthlink various others world wide web users enter invalid dns name user types incorrect uniform resource locator url example codice_1 instead codice_2 isp dns server respond spoofed dns response redirects user advertising web page domain name system dns resolution process translating human-readable domain name example codice_3 ip address computers use every isp runs dns server allow customers translate domain names ip addresses computers understand use isp dns server receives request translate name according rfc dns server return associated ip address customer computer able connect requested resource isp dns server receives request name recognized unavailable isps spoof nx null response instead return ip address search advertising page client client using web browser display search page contains possible suggestions proper address small explanation error search pages often contain advertising paid isp sometimes customer opt-out service opt-out frequently implemented layer spoofing opt-out procedures vary isp isp method implementation effectiveness", + "neighbors": [ + 14, + 425, + 436, + 1144 + ], + "mask": "Test" + }, + { + "node_id": 1146, + "label": 9, + "text": "List_of_programming_language_researchers:list programming language researchers following list researchers programming language theory design implementation related areas", + "neighbors": [ + 78, + 87, + 117, + 216, + 251, + 306, + 509, + 538, + 567, + 682, + 789, + 919, + 959, + 1095, + 1221, + 1225, + 1227, + 1235, + 1311, + 1430, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1147, + "label": 3, + "text": "QorIQ:qoriq qoriq brand arm-based power isa-based communications microprocessors nxp semiconductors formerly freescale evolutionary step powerquicc platform initial products built around one e500mc cores came five different product platforms p1 p2 p3 p4 p5 segmented performance functionality platform keeps software compatibility older powerpc products powerquicc platform 2012 freescale announced arm based qoriq offerings beginning 2013 qoriq brand p1 p2 p4 product families announced june 2008 details p3 p5 products announced 2010 qoriq p series processors manufactured 45 nm fabrication process available end 2008 p1 p2 mid-2009 p4 2010 p5 qoriq series based 28 nm process pushing aggressive power envelope target capping 30 w. using e6500 core altivec expected shipping 2013 qoriq ls-1 ls-2 families arm based processors using cortex a7 cortex a9 a15 a53 a72 cores upon isa agnostic layerscape architecture available since 2013 target low mid range networking wireless infrastructure applications layerscape ls architecture latest evolution qoriq family features previously provided dpaa like compression may implemented software hardware depending specific chip transparent application programmers ls-1 ls-2 announced use cortex a7 a9 a15 a53 a72 cores initial ls-1 series include accelerated packet processing layer focusing typical power consumption less 3w using two cortex a7 providing ecc caches ddr3/4 1000 1600 mt/s dual pci express controllers x1/x2/x4 operation sd/mmc sata 1/2/3 usb 2/3 integrated phy virtualized etsec gigabit ethernet controllers ls1 means ls1xxx series e.g. ls1021a etc ls2 means ls2xxx series ls2 means higher performance level ls1 indicate second generation middle two digits product name core count last digit distinguishes models cases higher digit meaning greater performance \u201c \u201d end indicates arm processor lx designates 16 nm finfet generation ls1 family built layerscape architecture programmable data-plane engine networking architecture ls1 ls2 families processors offer advanced high-performance datapath network peripheral interfaces features frequently required networking telecom/datacom wireless infrastructure military aerospace applications freescale semiconductor inc. acquired nxp semiconductors late 2015 announced network processor system architecture said give flexibility scalability required network infrastructure oems handle market trends connected devices massive datasets tight security real-time service increasingly unpredictable network traffic patterns qoriq p series processors based e500 e5500 cores p10xx series p2010 p2020 based e500v2 core p204x p30xx p40xx e500mc core p50xx e5500 core features include 32/32 kb data/instruction l1 cache 36-bit physical memory addressing appended top virtual address process context process still 32bit double precision floating point unit present cores support virtualization hypervisor layer present products featuring e500mc e5500 dual multi-core devices supports symmetric asymmetric multiprocessing run multiple operating systems parallel p1 series tailored gateways ethernet switches wireless lan access points general-purpose control applications entry level platform ranging 400 800 mhz devices designed replace powerquicc ii pro powerquicc iii platforms chips include among integrated functionality gigabit ethernet controllers two usb 2.0 controllers security engine 32-bit ddr2 ddr3 memory controller ecc support dual four-channel dma controllers sd/mmc host controller high speed interfaces configured serdes lanes pcie sgmii interfaces chip packaged 689-pin packages pin compatible p2 family processors p2 series designed wide variety applications networking telecom military industrial markets available special high quality parts junction tolerances \u221240 125 \u00b0c especially suited demanding doors environments mid-level platform devices ranging 800 mhz 1.2 ghz designed replace powerquicc ii pro powerquicc iii platforms chips include among integrated functionality 512 kb l2 cache security engine three gigabit ethernet controllers usb 2.0 controller 64-bit ddr2 ddr3 memory controller ecc support dual four-channel dma controllers sd/mmc host controller high speed serdes lanes configured three pcie interfaces two rapidio interfaces two sgmii interfaces chips packaged 689-pin packages pin compatible p1 family processors p3 series mid performance networking platform designed switching routing p3 family offers multi-core platform support four e500mc cores frequencies 1.5 ghz chip connected corenet coherency fabric chips include among integrated functionality integrated l3 caches memory controller multiple i/o-devices duart gpio usb 2.0 security encryption engines queue manager scheduling on-chip events serdes based on-chip high speed network configurable multiple gigabit ethernet 10 gigabit ethernet rapidio pcie interfaces p3 family processors share physical package also software backwards compatible p4 p5 p3 processors 1.3 ghz 64-bit ddr3 memory controllers 18 serdes lanes networking hardware accelerators packet handling scheduling regular expressions raid security cryptography rapidio cores supported hardware hypervisor run symmetric asymmetric mode meaning cores run boot operating systems together separately resetting partitioning cores datapaths independently without disturbing operating systems applications p4 series high performance networking platform designed backbone networking enterprise level switching routing p4 family offers extreme multi-core platform support eight e500mc cores frequencies 1.5 ghz chip connected corenet coherency fabric chips include among integrated functionality integrated l3 caches memory controllers multiple i/o-devices duart gpio usb 2.0 security encryption engines queue manager scheduling on-chip events serdes based on-chip high speed network configurable multiple gigabit ethernet 10 gigabit ethernet rapidio pcie interfaces cores supported hardware hypervisor run symmetric asymmetric mode meaning cores run boot operating systems together separately resetting partitioning cores datapaths independently without disturbing operating systems applications help software developers system designers get started qoriq p4080 freescale worked virtutech create virtual platform p4080 used prior silicon availability develop test debug software chip currently simulator p4080 chips announced 2008 complete set network engines processor used telecommunication systems lte enodeb epc wcdma bts freescale 6wind ported 6wind packet processing software p4080 p5 series based high performance 64-bit e5500 core scaling 2.5 ghz allowing numerous auxiliary application processing units well multi core operation via corenet fabric p5 series processors share physical package also software backwards compatible p3 p4 p5 processors 1.3 ghz 64-bit ddr3 memory controllers 18 serdes lanes networking hardware accelerators packet handling scheduling regular expressions raid security cryptography rapidio introduced june 2010 samples available late 2010 full production expected 2011 applications range high end networking control plane infrastructure high end storage networking complex military industrial devices february 2011 freescale introduced qoriq qonverge platform series combined cpu dsp soc processors targeting wireless infrastructure applications psc913x family chips uses e500 core based cpu starcore sc3850 dsps available 2011 manufactured 45 nm process e6500 cs3900 core based 28 nm parts available 2012 called p4xxx qoriq advanced multiprocessing amp series processors based multithreaded 64-bit e6500 core integrated altivec simd processing units except lowest end t1 family uses older e5500 core products range single core versions parts 12 cores frequencies ranging way 2.5 ghz processes sectioned five classes according performance features named t1 t5 manufactured 28 nm process beginning 2012 t4 family uses e6500 64-bit dual threaded core t2 family uses e6500 64-bit dual threaded core t1 family uses e5500 64-bit single threaded core 1.2 1.5 ghz 256 kb l2 cache per core 256kb shared corenet l3 cache qoriq products bring new challenges order design control planes telecommunication systems data plane instance 4 8 cores used p4080 order achieve millions packet processing per seconds system scale regular software stack many cores require different system design order restore simplicity still get highest level performance telecommunication systems based segregation cores cores used control plane others used re-designed data plane based fast path freescale partnered networking company 6wind provide software developers high-performance commercial packet processing solution qoriq platform", + "neighbors": [ + 112, + 214, + 607, + 738, + 853, + 893, + 907, + 917, + 988, + 1022, + 1069, + 1143, + 1158, + 1178, + 1262, + 1305, + 1488, + 1591, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 1148, + "label": 3, + "text": "Thread_control_block:thread control block thread control block tcb data structure operating system kernel contains thread-specific information needed manage tcb manifestation thread operating system example information contained within tcb thread control block acts library information threads system specific information stored thread control block highlighting important information process", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1149, + "label": 7, + "text": "Scaleform_GFx:scaleform gfx scaleform gfx game development middleware package vector graphics rendering engine used display adobe flash-based user interfaces huds video games result autodesk acquisition scaleform corporation march 2011 scaleform gfx became part autodesk gameware line middleware july 12th 2018 autodesk discontinued scaleform gfx longer available purchase authors created user interfaces using adobe flash authoring tools adobe flash professional resulting swf files could used directly gfx libraries providing similar functionality adobe flash player optimized use within game engines major platforms supported including game consoles mobile pc operating systems scaleform provided apis direct communication flash content game engine pre-built integrations popular engines unity unreal engine cryengine scaleform gfx could also licensed use standalone flash runtime system mobile platforms competing adobe air scaleform gfx contained several core systems including addition engine documentation samples scaleform gfx sdk included several additional components scaleform also provided two optional add-ons gfx", + "neighbors": [ + 134, + 347, + 412, + 435, + 503, + 632, + 961, + 1427 + ], + "mask": "Test" + }, + { + "node_id": 1150, + "label": 3, + "text": "Intel_8251:intel 8251 8251 universal synchronous/asynchronous receiver/transmitter packaged 28-pin dip made intel typically used serial communication rated per second signalling rate commonly confused much common 8250 uart made popular serial port ibm personal computer includes 5 sections version 8251a available us 6.40 quantity 100 intel 8251a used intel sdk-86 mcs-86 system design kit dec la120 printing terminal", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1151, + "label": 2, + "text": "Features_new_to_Windows_XP:features new windows xp windows xp introduced many features found previous versions windows introduction windows xp c++ based software-only gdi+ subsystem introduced replace certain gdi functions gdi+ adds anti-aliased 2d graphics textures floating point coordinates gradient shading complex path management bicubic filtering intrinsic support modern graphics-file formats like jpeg png support composition affine transformations 2d view pipeline gdi+ uses argb values represent color use features apparent windows xp user interface transparent desktop icon labels drop shadows icon labels desktop shadows menus translucent blue selection rectangle windows explorer sliding task panes taskbar buttons several applications microsoft paint windows picture fax viewer photo printing wizard pictures slideshow screensaver presence basic graphics layer greatly simplifies implementations vector-graphics systems flash svg gdi+ dynamic library shipped application used older versions windows total number gdi handles per session also raised windows xp 16384 65536 configurable registry windows xp shipped directx 8.1 brings major new features directx graphics besides directx audio directsound directmusic directplay directinput directshow direct3d introduced programmability form vertex pixel shaders enabling developers write code without worrying superfluous hardware state fog bump mapping texture mapping directx 9 released 2003 also sees major revisions direct3d directsound directmusic directshow direct3d 9 added new version high level shader language support floating-point texture formats multiple render targets texture lookups vertex shader windows xp upgraded directx 9.0c shader model 3.0 later included windows xp sp2 windows xp sp3 added windows imaging component windows xp includes cleartype subpixel rendering makes onscreen fonts smoother readable liquid crystal display lcd screens although cleartype effect crt monitors primary use lcd/tft-based laptop notebook modern 'flatscreen displays cleartype windows xp currently supports rgb bgr sub pixel structures parameters contrast set via cleartype tuner powertoy microsoft makes available free download typography website windows xp start button updated support fitts law help user access wider range common destinations easily single location start menu expanded two columns left column focuses user installed applications right column provides access user documents system links previously located desktop links documents pictures special folders brought fore computer network places network neighborhood windows 95 98 icons also moved desktop start menu making easier access icons number applications open desktop remains clean moreover links configured expand cascading menu frequently used programs automatically displayed left column newly installed programs highlighted user may opt pin programs start menu always accessible without navigate programs folders default internet browser default email program pinned start menu start menu fully customizable links added removed number frequently used programs display set programs menu expands like classic start menu utilize entire screen set scroll programs user name user account picture also shown start menu taskbar buttons running applications quick launch also updated fitt law locking taskbar prevents accidentally resized moved elements quick launch deskbands also locked accidentally moved taskbar grouping feature combines multiple buttons application single button clicked pops menu listing grouped windows number advanced taskbar grouping options configured registry user choose always show always hide hide notification area icons inactive time button allows user reveal icons taskbar set thicker height also displays day date notification area significant changes made windows explorer windows xp visually functionally microsoft focused especially making windows explorer discoverable task-based well adding number features reflect growing use computer \u201c digital hub \u201d task pane displayed left side window instead traditional folder tree view navigation pane turned presents user list common actions destinations relevant current directory file selected instance directory containing mostly pictures set \u201c picture tasks \u201d shown offering options display pictures slide show print go online order prints conversely folder containing music files would offer options play files media player go online purchase music every folder also \u201c file folder tasks \u201d offering options create new folders share folder local network publish files folders web site using web publishing wizard common tasks like copying renaming moving deleting files folders file types identified printable also option listed print file underneath \u201c file folder tasks \u201d \u201c places \u201d always lists parent folder folder viewed includes additional links common locations \u201c computer \u201d \u201c control panel \u201d \u201c documents \u201d previously navigated locations change depending folder user underneath \u201c places \u201d \u201c details \u201d area gives additional information file folder selected \u2013 typically file type file size date modified depending file type author image dimensions attributes details file type thumbnail image handler installed preview also appears details task pane music files might show artist album title length song information also shown horizontally status bar \u201c folders \u201d button windows explorer toolbar toggles traditional navigation pane containing tree view folders task pane users also close navigation pane clicking close button right corner well turn task pane folder options navigation pane enhanced windows xp support simple folder view turned hides dotted lines connect folders subfolders makes folders browsable single click still keeping double clicking right pane single clicking simple folder view auto expands folder clicking another folder automatically expands folder collapses previous one windows xp introduced large number metadata properties shown columns details view explorer new tiles view explorer summary tab file properties file tooltip explorer status bar single file selected users also gain ability sort property turned details view developers write column handler shell extensions define properties files sorted column items sorted highlighted sorting files folders ascending order descending order views details view reverse order user simply perform sort property sort order also made intuitive compared one windows 2000 file names containing numbers windows explorer tries sort based numerical value rather comparing number digit digit every character position file name instance files containing 1 2 .. 10 intuitively sorted 10 appearing 9 instead appearing 1 2 right pane windows explorer show groups feature allows explorer separate contents headings based field used sort items items thus grouped detail turned show groups available thumbnails tiles icons details views microsoft introduced animated search companions attempt make searching engaging friendly default character puppy named rover three characters merlin magician earl surfer courtney also available search companions powered microsoft agent technology bear great deal similarity microsoft office \u2019 office assistants even incorporating \u201c tricks \u201d sound effects user wishes also turn animated character entirely search capability fairly similar windows windows 2000 important additions indexing service extract exif properties well metadata asf wmv mp3 files windows xp via ipropertystorage interface using built-in null filter search also instructed search files categorically \u201c documents \u201d \u201c pictures music video searching perceived type feature noteworthy largely windows determines types files classified categories another important addition look field accepts expands environment variables abbreviated entry long paths also users configure whether windows xp searches system and/or hidden files folders using tweak ui search user interface restored one used windows 2000 windows xp improves image preview offering filmstrip view shows images single horizontal row large preview currently selected image \u201c back \u201d \u201c previous \u201d buttons facilitate navigation pictures pair \u201c rotate \u201d buttons offer 90-degree clockwise counter-clockwise rotation images filmstrip view like view turned per folder view available new common tasks folder view selected windows classic folder view aside filmstrip view mode 'thumbnails view displays thumbnail-sized images folder also displays images subfolder may containing 4 default overlaid large folder icon folder thumbnail view customized customize tab accessible properties users also change folder icon specify template type pictures music videos documents folder optionally subfolders size quality thumbnails thumbnails view adjusted using tweak ui registry exif metadata stored image also shown file properties summary tab details view view status bar windows xp optionally caches thumbnails thumbs.db file folder pictures thumbnails generated faster next time thumbnails forced regenerate right-clicking image thumbnail filmstrip views selecting refresh thumbnail autoplay examines newly discovered removable media devices based content pictures music video files launches appropriate application play display content autoplay confused autorun created order simplify use peripheral devices \u2013 mp3 players memory cards usb storage devices others \u2013 automatically starting software needed access view content devices autoplay enhanced autoplay-compatible software hardware configured user associate favourite applications autoplay events actions actions called autoplay handlers sets handlers associated various types content new autoplay handlers get added system additional software installed user edit delete create autoplay handlers using tweakui autoplay settings configured per-device windows xp device properties user inserts optical disc drive attaches usb camera windows detects arrival starts process examining device searching medium looking properties device content medium autoplay present set meaningful options user user makes particular choice also option make selection automatic next time windows sees content device content types available vary type drive selected windows xp includes windows picture fax viewer based gdi+ capable viewing image formats supported gdi+ namely jpeg bmp png gif including animated gifs ico wmf emf tiff format files supersedes part functions imaging windows previous versions windows windows picture fax viewer integrated windows explorer functions like slideshow email printing etc quickly starts image double clicked windows explorer supports full file management within viewer right clicking image shows context menu one shown image right clicked windows explorer images set desktop wallpaper context menu supports successive viewing images current folder looping images viewing last image directory shows first image vice versa default images smaller user display resolution shown actual size image larger display resolution scaled fit screen best fit images zoomed depending viewing area done scroll bars allow viewing areas image standard toolbar buttons delete print copy open copy button converts image different format supported gdi+ jpeg bmp gif tiff png print button starts photo printing wizard allows printing images picture titles using various page layouts full page prints wallet prints contact/index sheets certain fixed dimensions images cropped rotated fit page wizard shows preview printed page look like currently specified options windows picture fax viewer also rotate images clockwise anti-clockwise start slideshow selected images folder e-mail selecting send mail recipient option options allow image mailed full size pixel dimensions 640 x 480 800 x 600 1024 x 768 using tweak ui time images slideshow adjusted windows picture fax viewer recognizes embedded icc v2 color profiles jpg tiff files gif files shown full animation even zoomed tiff files annotated using annotation toolbar appears bottom screen lines drawn tiff image text added areas image selected concealed windows picture fax viewer also capable viewing multi-page tiff files however tiff images jpeg compression fully supported last button standard toolbar opens image editing default microsoft paint however editing application registered button viewer windows picture fax viewer saves remembers window position size supports keyboard shortcuts operations raw image formats preferred formats professional photography supported however microsoft released later update called raw image thumbnailer viewer windows xp viewing certain raw image files text services framework tsf com framework api introduced windows xp supports advanced text input text processing text services framework designed offer advanced language word processing features applications supports features multilingual support keyboard drivers handwriting recognition speech recognition well spell checking text natural language processing functions also downloadable older windows operating systems language bar core user interface text services framework language bar enables text services add ui elements toolbar enables elements application focus language bar users select input language control keyboard input handwriting recognition speech recognition language bar also provides direct means switch installed languages even non-tsf-enabled application focus windows xp kernel completely different kernel windows 9x/me line operating systems although upgrade windows 2000 kernel major scalability stability performance improvements albeit transparent end user windows xp includes simultaneous multithreading hyperthreading support simultaneous multithreading processor ability process one data thread time windows xp supports larger system virtual address space \u2013\u2014 1.3 gb contiguous virtual address space used device drivers 960 mb windows xp memory manager redesigned consume less paged pool allowing caching greater availability paged pool component needs total size memory-mapped files windows 2000 limited memory manager allocated prototype page table entries pptes pages required map entire file even application created mapped views parts file windows xp prototype ptes allocated active views allowing larger mapped files benefit example case making backups large files low memory systems paged pool limit 470 mb lifted memory manager windows xp unmapped views dynamically reusable memory manager depending pool usage memory pages working sets trimmed efficiently multiprocessor systems depending recently accessed lock contention reduced number unnecessary locks used resource synchronizations ram allocation mapping address windowing extensions system page table entries charging non-paged/paged pool quotas charging commitment pages removed dispatcher lock contention reduced page frame number pfn lock optimized increased parallelism granularity windows xp uses push locks event synchronization object contention support shared exclusive acquisition push locks used protect handle table entries executive object manager protect data structures security descriptors memory manager protect awe-related locks windows xp uses sysenter/sysexit mechanisms require fewer clock cycles transition user mode kernel mode speed system calls kernel page write protection limit windows xp enabled systems 256 mb ram beyond large pages enabled increased address translation performance windows xp introduces creatememoryresourcenotification function notify user mode processes high low memory availability applications allocate memory free memory necessary previous versions windows registry size limited 80 paged pool size windows xp registry reimplemented outside paged pool registry hives memory mapped cache manager system cache eliminating registry size limit registry size limited available disk space system hive still maximum size raised 12 mb 200 mb eliminating issue previous windows versions faced unable boot large fragmented system hive configuration manager updated minimize registry memory footprint lock contention reduce fragmentation thus page faults accessing registry improved algorithms speed registry query processing in-memory security cache eliminates redundant security descriptors windows xp supports cross user session debugging attaching debugger non-crashing user-mode program dumping process memory space using dump command detaching debugger without terminating debugging done firewire port local system debug heap disabled standard heap used debugging windows xp introduces support vectored exception handling vectored exception handling made available windows programmers using languages c++ visual basic veh replace structured exception handling seh rather veh seh coexist veh handlers priority seh handlers compared seh veh works like traditional notification callback scheme applications intercept exception calling addvectoredexceptionhandler api watch handle exceptions vectored handlers chained order linked list n't tied stack frame added anywhere call stack unlike seh try/catch blocks heap leak detection enabled processes exit debugger extension used investigate leaks also introduced new heap performance-monitoring counter windows xp introduces new low fragmentation heap policy disabled default allocates memory distinct sizes blocks less 16kb reduce heap fragmentation low fragmentation heap enabled default heaps using lfh heap enabler utility new apis irp cancellation registering file system filter callbacks intercept os fast i/o functions low memory conditions must succeed calls denied causing slowdown preventing bug check i/o throttled fetch one memory page time increasing overall scalability windows xp includes ntfs 3.1 expands master file table mft entries redundant mft record number useful recovering damaged mft files ntfs conversion utility convert.exe supports new /cvtarea switch ntfs metadata files written contiguous placeholder file resulting less fragmented file system conversion ntfs 3.1 also supports symbolic links although tools drivers shipped windows xp create symbolic links windows xp introduces ability mount ntfs read-only volumes new apis preserve original short file names retrieve list mount points drive letters mounted folder paths specified volume enable applications create large files quickly setting valid data length files without force-writing data zeroes vdl setfilevaliddata function instance function used quickly create fixed size virtual machine hard disk default access control lists newly created files read-only users group write permissions given administrators group system account owner ability boot 30 seconds design goal windows xp microsoft developers made efforts streamline system much possible logical prefetcher significant part monitors files loaded boot optimizes locations files disk less time spent waiting hard drive heads move issues large asynchronous i/o requests overlapped device detection initialization occurs boot prefetcher works tracing frequently accessed paged data used task scheduler create prefetch-instructions file windir \\prefetch system boots application started data code specified trace already memory prefetched disk previous prefetching results determine scenario benefited prefetched next boot launch prefetcher also uses algorithms reduce application startup times reduce disk seeking even disk defragmenter called idle time optimize layout specific files metadata contiguous area boot resume operations traced analyzed using bootvis.exe windows xp includes fast logon optimization feature performs logon asynchronously without waiting network fully initialized roaming user profiles set use cached credentials avoids delays logging domain group policy applied background startup logon scripts execute asynchronously default windows xp reconciles local roaming user profiles using copy contents registry user longer made wait windows 2000 profile unloaded windows xp saves locked registry hives open keys 60 seconds roaming profile changes saved back server problem left computer recover memory profile uses unloaded make sure user profiles completely reconciled correctly logoff microsoft released user profile hive cleanup service windows xp later included windows vista windows xp offers enhancements usability resilience corruption performance roaming user profiles new group policies prevent propagation roaming user profile changes server give administrators control users profile folders preventing use roaming user profiles specific computers accommodate scenario older profile would overwrite newer server profile due windows xp fast logon feature windows xp ensures situation user registry hive copied server local profile deletion profiles marked deletion next logoff fail locked profiles workgroup computers windows xp longer deletes profiles users belonging guests group windows xp includes changes behavior offline files offline files client-side cache encrypted encrypting file system shared folders dfs namespaces made available offline also roaming user profiles synchronized server even offline files marked server unavailable windows xp service pack 2 kb811660 introduce additional functionality offline files editing registry users suppress error messages file types offline files cache excluded synchronization offline files user primary computer determined matching current user sid specified sid registry set purge logoff administratively assigned offline files also prevented cached non-primary users beginning windows xp folders redirected network automatically made available offline using offline files although optionally disabled group policy older windows nt 4.0 earlier systems legacy directory structure windows xp allows redirecting documents folder home directory windows xp improvements made system restore compared windows system restore uses copy-on-write file system filter driver taking snapshots windows xp system restore configurable per volume data stores also stored per volume ntfs volumes restore points stored using ntfs compression protected using acls disk cleanup handler allows deleting recent restore point besides registry hives system files com+ wmi databases iis metabase also restored system restore supports group policy system restore windows xp also works without issues efs-encrypted files automated system recovery feature provides ability save restore windows installed applications system state critical boot system files special backup instead plain reinstall asr consists two components backup restore backup portion located ntbackup backs system state windows registry com+ class registration database active directory sysvol directory share volumes associated operating system components required start windows restore well configuration basic dynamic restore portion asr accessed pressing f2 windows xp text mode setup automated system recovery even restore programs device drivers added asr setup information disk asr restore data files common issue previous versions windows users frequently suffered dll hell one version dynamically linked library dll installed computer software relies dlls using wrong version could result non-functional applications worse windows 98 second edition windows 2000 partially solved problem native code introducing side-by-side component sharing dll/com redirection operating systems allowed loading private version dll placed application folder developer instead system directory must registered properly system windows xp improves upon introducing side-by-side assemblies com+ 2.0 .net com classic win32 components c runtime gdi+ common controls technology keeps multiple digitally signed versions shared dll centralized winsxs folder runs demand appropriate application keeping applications isolated using common dependencies manifests assembly version number used os loader determine correct binding assembly versions applications instead globally registering components achieve windows xp introduces new mode com object registration called registration-free com regfree com allows component object model com components store activation metadata clsid codice_1 component without using registry instead metadata clsids classes implemented component declared assembly manifest described using xml stored either resource executable separate file installed component allows multiple versions component installed different directories described manifests well xcopy deployment application loading windows loader searches manifest present loader adds information activation context com class factory tries instantiate class activation context first checked see implementation clsid found lookup fails registry scanned windows error reporting collects offers send post-error debug information memory dump using internet developer application crashes stops responding user desktop data sent without user consent dump error signature information reaches microsoft server analyzed solution sent back user one available windows error reporting runs windows service optionally entirely disabled software hardware manufacturers may access error reports using microsoft winqual program software hardware manufacturers also close loop customers linking error signatures windows error reporting responses allows distributing solutions well collecting extra information customers reproducing steps took crash providing support links old versions windows users upgrade device driver chance new driver less stable efficient functional original reinstalling old driver major hassle avoid quandary windows xp keeps copy old driver new version installed new driver problems user return previous version feature work printer drivers windows xp merged consumer enterprise versions windows needed support applications developed popular consumer-oriented windows 9x platform windows nt kernel microsoft addressed improving compatibility application-specific tweaks shims providing tools application compatibility toolkit appcompat act allow users apply automate tweaks shims applications users script compatibility layer using batch files windows xp setup also includes compatibility checker warns users setup begins incompatible applications device drivers applications may need reinstallation windows xp rtm includes windows media player version 8 officially called windows media player windows xp windows media 8 codecs windows media player windows xp introduced id3 support mp3s editing media information within library adding lyrics mp3 wma tracks file name customization ripping new visualizations support hdcds ability lockdown player corporate environment dvd playback support appropriate codecs installed separately windows xp sp2 includes windows media player 9 series windows media format runtime 9.0 upgradeable version 11 player format runtime windows media player also incorporates newer hardware support portable devices means media transfer protocol user-mode driver framework-based windows portable devices api original rtm release windows xp included windows movie maker 1.1 added non-compressed dv avi recording digital video sources windows movie maker 2 free download released 2002 later incorporated windows xp sp2 windows movie maker 2 introduced numerous new transitions effects titles credits task pane resizable preview window dimensions improved capture export options automovie feature saving final video back tape custom wmv export profiles windows xp media center edition 2005 includes windows movie maker 2.5 includes dvd burning windows xp includes advances broadcast driver architecture receiving capturing analog digital tv broadcasts complete signal demodulation tuning software de-multiplexing electronic program guide store ip data broadcasting etc addition windows xp media center edition introduced windows media center application pvr-like recording playback features tv content windows xp includes improved firewire ieee 1394 support dvcpro25 525-60 625-50 digital video cameras audio video devices introduces mstape wdm driver d-vhs mpeg camcorder devices windows xp sp2 adds support dvcpro50 dvcpro100 directshow 8 introduces video mixing renderer-7 vmr-7 filter uses directdraw 7 video rendering replacing overlay mixer vmr-7 mix multiple streams graphics alpha blending allowing applications draw text closed captions graphics channel logos ui buttons video without flickering support compositing implement custom effects transitions vmr-7 also supports source color keying overlay surface management frame-stepping improved multiple-monitor support vmr-7 features windowless mode applications easily host video playback within window renderless playback mode applications access composited image rendered directx 9 introduced vmr-9 uses direct3d 9 instead directdraw allowing developers transform video images using direct3d pixel shaders windows xp sp2 introduced yuv mixing mode vmr-7 vmr-9 renderers performs mixing yuv color space save memory bandwidth directshow 8 includes avstream multimedia class driver video-only audio-video kernel streaming windows xp provides new and/or improved drivers user interfaces devices compared windows 98 beginning windows xp service pack 1 generic usb 2.0 enhanced host controller interface drivers included windows xp also adds support usb device classes bluetooth usb video device class imaging still image capture device class media transfer protocol windows media player 10 mass storage devices windows xp introduces hardware descriptors distinguish various storage types operating system set appropriate default write caching policy example usb devices disables write caching default surprise removal devices cause data loss device manager provides configuration setting whether optimize devices quick removal performance windows xp supports twain well windows image acquisition-based scanners windows image acquisition windows xp adds support automatic document feeder scanners scroll-fed scanners without preview capabilities multi-page tiff generation wia video snapshot filter driver introduced allows still frames captured video stream windows xp sp1 later support downloadable wia library v2.0 provides access wia functionality programming languages scripting environments support ole automation scanner camera wizard based windows image acquisition common dialogs wia devices improved windows xp show media information metadata rotate images necessary categorize subfolders capture images video case still video camera crop scan images single multi-page tiff case scanner picture transfer protocol ptp implementation updated support mandatory optional commands ptp standard object tree support allows secondary files associated parent file grouped transferred concurrently windows media player 10 also adds media transfer protocol transferring media content portable devices thus digital cameras windows xp supports acquiring photos using either wia ptp usb mass storage class mtp protocols depending camera manufacturer supports windows xp includes technology roxio allows users directly burn files compact disc windows explorer previously end users install cd burning software windows xp cd dvd-ram fat32 dvd-ram burning directly integrated windows interface data discs created using joliet iso 9660 file systems audio cds using redbook standard prevent buffer underrun errors windows xp premasters complete image files burnt streams disc burner users burn files cd way write files floppy disk hard drive via standard copy-paste drag drop methods burning functionality also exposed api called image mastering api windows xp cd burning support disk-to-disk copying disk images although api used programmatically tasks creation audio cds integrated windows media player audio cds burnt using track-at-once mode cd-rw discs quick erased api support added windows xp burning dvds blu-ray discs mastered-style burning udf write-once rewritable dvd blu-ray media installing windows feature pack storage upgrades imapi version 2 note add dvd blu-ray burning features windows explorer third party applications use apis support dvd blu-ray burning windows xp includes firewire 800 support 1394b beginning service pack 1 mentioned section windows xp includes improved support firewire cameras audio video devices s/pdif audio mpeg-2 video streams supported across firewire audio video receivers set-top boxes dvd d-vhs speakers tv transmissions windows xp supports av/c iec 61883 protocol isochronous real-time data transfer audio-video applications windows xp also allows non-firewire devices exposed virtual firewire devices direct memory access 1394 bus host target allows kernel debugging firewire finally support tcp/ip networking internet connection sharing ieee 1394 bus windows xp includes windows script host 5.6 major update wsh environment includes improved object model reduce boilerplate code stronger security several improvements new xml-based file format windows script file format .wsf introduced besides .vbs .js store xml node file extra information besides script code digital signature blocks runtime directives instructions import external code wsf schema include jobs wrapped unique job tag outer package tag tags wsf file allow including external files importing constants tlb storing usage syntax runtime element displaying using new showusage method invoked switch wsf format also supports hosting multiple wsh scripting languages including cross function-calls wshshell object supports 'currentdirectory read-write method scripts digitally signed well verified programmatically using scripting.signer object script provided valid certificate present system alternatively signcode tool platform sdk extended support wsh filetypes may used command line verifyfile method used authenticate embedded signature validity check script modifications signing wsh thus decide whether execute script verification code stored in-memory string also signed using sign method signature block stored commented section script file backward compatibility older wsh versions using software restriction policies supported windows xp later system may also configured execute scripts digitally signed thus preventing execution untrusted scripts local scripts also run remote machine new wscript.wshcontroller object powered dcom remote wsh enabled group policy administrative template registry remote scripts always run wscript loaded remote machine server process run non-interactively default configured using dcomcnfg run security context allows display user interface wsh automation server loads instance wshremote object created script runs calling execute method external files called remote script must located remote machine directory path specified exec method remote script monitored using status property wsh 5.6 introduces exec method wshshell object execute command-line console applications access standard i/o streams stdin stdout stderr spawned process earlier versions windows script use arguments one access wsharguments collection object could created externally required person running script know order arguments syntax values wsh 5.6 introduces named arguments command line follow /string value boolean convention defined 'runtime tag recognized irrespective order command line named arguments grouped named collection object usual methods like item count length well exists method 'showusage method wsharguments object mentioned earlier shows argument information message box windows xp includes scriptpw.password com automation object implemented scriptpw.dll file used mask sensitive information like passwords command line scripts users log windows xp professional remotely remote desktop service built terminal services technology rdp similar remote assistance allows remote users access local resources printers terminal services client special remote desktop connection client web-based client using activex control may used connect remote desktop remote desktop clients earlier versions windows windows 95 windows 98 98 second edition windows windows nt 4.0 windows 2000 made available microsoft permits earlier versions windows connect windows xp system running remote desktop vice versa several resources users redirect remote server machine local client depending upon capabilities client software used instance file system redirection allows users use local files remote desktop within terminal session printer redirection allows users use local printer within terminal session would locally network shared printer port redirection allows applications running within terminal session access local serial parallel ports directly audio allows users run audio program remote desktop sound redirected local computer clipboard also shared remote computer local computer rdp client windows xp upgraded 7.0 remote desktop web connection component internet information services 5.1 also allows remote desktop functionality web activex control internet explorer remote assistance allows windows xp user temporarily take remote windows xp computer network internet resolve issues hassle system administrators personally visit affected computer remote assistance allows diagnose possibly even repair problems computer without ever personally visiting remote assistance allows sending invitations support person email windows messenger saving invitation file computer controlled support person connecting remotely well one sending invitation chat audio-video conversations file transfer available windows xp introduces fast user switching end user friendly welcome screen user account picture replaces classic logon prompt fast user switching allows another user log use system without log previous user quit applications previously windows windows 2000 one user time could logged except terminal services serious drawback multi-user activity fast user switching like terminal services requires system resources single user logged time although one user logged one user actively using account time feature available welcome screen turned joined windows server domain novell client installed even welcome screen enabled users switch classic logon pressing ctrl+alt+del twice welcome screen windows xp introduced windows installer msi 2.0 windows installer 2.0 brought major improvements installation management side-by-side clr assemblies sandboxing msi custom actions improved event logging hiding sensitive information log files per-user program isolation digital signatures improved patching robust patch conflict resolution reduced unnecessary unversioned file copying source prompts terminal server support integration system restore software restriction policies windows xp service pack 2 includes windows installer 3.0 also adds numerous improvements patching patch uninstallation support add remove programs binary delta patches patch sequencing install patches correct order installing multiple patches different products one transaction eliminating source media requests delta compression patches patch elevation limited user accounts msi source location list inventory management apis fixing numerous bugs windows xp sp3 includes msi 3.1v2 windows xp updated windows installer 4.5 windows disk defragmenter updated alleviate several restrictions longer relies windows nt cache manager prevented defragmenter moving pieces file cross 256kb boundary within file parts stream including cluster boundary non-compressed files reparse points bitmaps attribute_lists ntfs metadata files efs-encrypted files ntfs master file table defragmented defragmenter supports ntfs volumes cluster sizes larger 4 kilobytes command-line tool defrag.exe included providing access defragmenter cmd.exe task scheduler users members power users group schedule defragmentation windows task manager incorporates number improvements windows xp updated display process names longer 15 characters length processes tab used truncated windows 2000 session id user name columns added processes tab delete key also used terminate processes processes tab new networking tab shows statistics relating network adapters present computer default adapter name percentage network utilization link speed state network adapter shown along chart recent activity options shown choosing select columns ... view menu users tab shows users currently session computer server computers may several users connected computer using terminal services may also multiple users logged onto computer one time using fast user switching users disconnected logged tab shutdown menu introduced allows access standby hibernate turn restart log switch user holding codice_2 clicking new task opens command prompt windows xp includes new command-line tools wmi-based scripts windows 2000 ntlm hash user password requirement technically allowed potential malefactor decrypt master key ntlm hash directly security accounts manager database windows xp improves dpapi security encrypting master key using sha1 hash password also improves security data encrypted encrypting file system windows xp pki supports cross-certification bridge ca scenarios user -type certificates auto-enrolled renewed certificate requests issuing new certificates renewing expired ones pending administrator approval issued certificate authority approved install automatically root ca certificates also auto-update via microsoft update windows xp also supports delta crls crls whose status changed since last full base compiled crl base64-encoded crls revocation checking use default windows xp enroll version 2 certificate templates many configurable attributes smart cards used log terminal server sessions connecting windows server 2003 higher terminal server capicom system tools net.exe runas.exe also numerous improvements certificate status checking chain building revocation checking path validation discovery windows xp service pack 3 adds sha-2 hashing algorithms sha256 sha384 sha512 cryptoapi validating x.509 certificates windows xp includes several encrypting file system improvements notable improvement multiple user accounts share access encrypted files file-by-file basis details button advanced file attributes dialog file properties allows adding removing additional users access efs-encrypted file viewing certificate thumbprint data recovery agent account efs certificates autoenrolled ca support revocation checking certificates used sharing encrypted files unlike windows 2000 default local data recovery agent requirement one although self-signed certificate recovery agent generated using cipher.exe dpapi master key protected using domain-wide public key stronger fips 140-1 compliant algorithm 3des used windows xp service pack 1 adds support default use aes-256 symmetric encryption algorithm efs-encrypted files kb912761 windows xp sp2 windows xp sp3 users configure whether efs generates self-signed certificate certificate authority unavailable windows xp also warns user efs encrypted files copied file system fat unsupported location support efs thus file going get decrypted windows xp also encrypt files remote server ntfs server trusted delegation active directory user certificate private key loaded local profile server roaming user profile used copied locally webdav server mapped drive letter windows xp encrypt file locally transport raw encrypted file webdav server using http put command similarly efs encrypted files downloaded raw webdav decrypted locally command line utilities cipher copy xcopy updated windows xp efs also completely disabled windows xp group policy domain registry non-domain computer faster cache validation time long user session key certificate chain cached adjusted starting windows xp password reset disk created using forgotten password wizard disk used reset password using password reset wizard logon screen user rsa private key backed using offline public key whose matching private key stored one two places password reset disk computer member domain active directory member domain attacker authenticate windows xp localsystem still access decryption key stored pc hard drive password reset dpapi master key deleted windows xp blocks access efs encrypted files prevent offline rogue attacks protect encrypted files user changes password back original password efs encrypted files recovered windows xp prompts credentials upon authentication errors allows saving use integrated windows authentication secure roaming keyring store protected data protection api saved credentials managed stored user names passwords item user accounts control panel certificate authority present users select x.509 certificate prompted credentials resource accessed saved credentials used remote access/vpn connections also create temporary credentials keyring make experience seamless credential manager also exposes api single sign windows xp introduces software restriction policies safer api use software restriction policies system may configured execute install applications scripts digitally signed certain trust level thus preventing execution untrusted programs scripts administrators define default rule using local security policy snap-in exceptions rule types rules include hash rule path rule certificate rule zone rule identify file hash path software publisher certificate internet explorer-zone respectively example activex control restricted run particular domain specifying certificate rule-based software restriction policy windows xp service pack 2 introduced data execution prevention feature present nx evp amd amd64 processors xd edb intel processors flag certain parts memory containing data instead executable code prevents overflow errors resulting arbitrary code execution intended prevent application service executing code non-executable memory region helps prevent certain exploits store code via buffer overflow example dep runs two modes hardware-enforced dep cpus mark memory pages nonexecutable software-enforced dep limited prevention cpus hardware support software-enforced dep protect execution code data pages instead another type attack seh overwrite hardware-enforced dep enables nx bit compatible cpus automatic use pae kernel 32-bit windows native support 64-bit kernels software dep unrelated nx bit microsoft calls enforcement safe structured exception handling software dep/safeseh simply checks exception thrown make sure exception registered function table application requires program built dep enabled applications users gain additional resistance zero-day exploits applications dep-compliant generate dep exceptions therefore dep enforced applications default 32-bit versions windows turned critical system components however windows xp service pack 3 introduces additional nx apis allow software developers enable nx hardware protection code independent system-wide compatibility enforcement settings developers mark applications nx-compliant built allows protection enforced application installed runs enables higher percentage nx-protected code software ecosystem 32-bit platforms default system compatibility policy nx configured protect operating system components windows xp rtm introduced internet connection firewall later upgraded windows firewall windows xp service pack 2 support filtering ipv6 traffic well default windows firewall performs stateful packet filtering inbound solicited unsolicited traffic types network interfaces lan/wlan pppoe vpn dial-up connections like internet connection sharing firewall location-aware policy meaning disabled corporate domain enabled private home network option disallow exceptions may useful connecting public network firewall also used edge firewall ics clients firewall blocks program displays notification excepted traffic specified tcp/udp port application filename scope part network excepted traffic originates supports port mapping icmp security log capabilities included record ip addresses data relating connections originating home office network internet record dropped packets successful connections used instance track every time computer network connects website windows firewall also supports configuration group policy applications use windows firewall apis automatically add exceptions windows security center introduced windows xp service pack 2 provides users ability view status computer security settings services windows security center also continually monitors security settings informs user via pop-up notification balloon problem windows security center consists three major components control panel windows service application programming interface provided windows management instrumentation control panel divides monitored security settings categories headings displayed color-coded backgrounds current state settings determined windows service starts automatically computer starts takes responsibility continually monitoring system changes settings made available system wmi provider anti-malware firewall software vendors register security center wmi provider windows update settings status also monitored reported windows 2000 wireless support support seamless roaming auto-configuration windows xp wireless zero configuration service supports automatic wireless network configuration re-authentication necessary thus providing seamless roaming capability setting preferred order connections absence wireless access point windows xp set ad hoc wireless network native support wpa wpa2 authentication infrastructure networks latest service packs and/or updates applied windows xp includes wireless network setup wizard supports windows connect usb flash drive wcn-ufd method ease setting wireless network inexperienced users kb918997 windows xp sp2 windows xp sp3 add wireless lan api developers create wireless client programs manage profiles connections ieee 802.1x support wireless wired connections case pki available issue certificates vpn connection support preshared key ike authentication windows xp connect hotspots created using wireless provisioning services windows xp service pack 2 added native bluetooth support windows xp bluetooth stack supports external integrated bluetooth dongles attached usb windows xp sp2 sp3 support bluetooth 1.1 1.0 bluetooth 2.0 bluetooth 2.0+edr bluetooth stack supports following bluetooth profiles natively pan spp dun hid hcrp third-party stacks may replace windows xp stack may support profiles newer versions bluetooth windows xp internet connection sharing integrated upnp allowing remote discovery control ics host quality service packet scheduler component ics client relatively fast network ics host connected internet slow link windows may incorrectly calculate optimal tcp receive window size based speed link client ics host potentially affecting traffic sender adversely ics qos component sets tcp receive window size would receiver directly connected slow link internet connection sharing also includes local dns resolver windows xp provide name resolution network clients home network including non-windows-based network devices ics also location-aware connected domain computer group policy restrict use ics home ics enabled multiple applications accessing internet simultaneously without qos connection n't fast enough tcp receive window size set full window data transit first application uses connection steady state reached subsequent connections made applications take much longer reach optimal window size transmission rate second third application always lower application established connection first slow links qos component windows xp automatically enables deficit round robin scheduling scheme creates separate queue application services queues round-robin fashion basic production quality support windows xp ipv6 teredo tunneling advanced networking pack later incorporated windows xp sp2 ipv6 installed configured command line using netsh interface ipv6 context gui support network interface link-local address assigned stateless autoconfiguration local global addresses performed windows xp static ipv6 addresses assigned ipv6 router local link transition mechanisms manually configured tunnels 6to4 set windows firewall beginning windows xp sp2 also supports ipv6 stateful filtering applications tools telnet client ftp client ping nslookup tracert dns resolver file print sharing internet explorer iis updated support ipv6 privacy extensions enabled used default 6to4 automatically activated public ipv4 addresses without global ipv6 address types tunnels set include 6over4 teredo isatap portproxy teredo also helps traverse cone restricted nats teredo host-specific relay enabled global ipv6 address assigned otherwise teredo client functionality enabled windows xp dns resolver make dns queries using ipv4 use ipv6 transport make query however dns query sends back ipv4 ipv6 resource records ipv6 addresses preferred windows xp support dhcpv6 pppv6/ipv6cp open source dhcpv6 implementation called dibbler available although stateless autoconfiguration largely makes unnecessary windows xp includes background intelligent transfer service windows service facilitates prioritized throttled asynchronous transfer files machines using idle network bandwidth bits transfer data whenever bandwidth used applications example applications use 80 available bandwidth bits use remaining 20 bits constantly monitors network traffic increase decrease network traffic throttles transfers ensure foreground applications web browser get bandwidth need bits also supports resuming transfers case disruptions bits version 1.0 supports downloads version 1.5 bits supports downloads uploads uploads require iis web server bits server extension receiving side bits 2.0 part windows xp sp2 added support performing concurrent foreground downloads using server message block paths remote names downloading portions file changing prefix complete name remote name limiting client bandwidth usage bits upgradeable version 2.5 windows xp bits 2.5 part windows xp sp3 adds support ipv6 certificate-based client authentication secure http transports custom http headers windows xp components windows update use bits download updates idle bandwidth used download updates downloading resumed case network connectivity interrupted bits uses queue manage file transfers downloads files behalf requesting applications asynchronously i.e. application requests bits service transfer free job even terminate transfer continue background long network connection job owner logged bits supports transfers http https network application begins consume bandwidth bits decreases transfer rate preserve user interactive experience except foreground priority downloads bits exposed component object model com making possible use virtually programming language windows xp fax console manage incoming outgoing archived faxes settings fax monitor appears notification area fax transmission reception progress manual reception faxes enabled appears upon incoming fax call archived faxes open windows picture fax viewer tiff format upon installing microsoft outlook fax service automatically switches windows address book using outlook address book windows xp introduces fax service extended com api application developers incorporate fax functionality advanced networking pack later made part sp2 introduced peer-to-peer networking peer name resolution protocol pnrp windows xp operates ipv6 p2p architecture windows xp consists following components pnrp provides dynamic name publication resolution names endpoints pnrp distributed name resolution protocol allowing internet hosts publish peer names corresponding ipv6 addresses optionally information hosts resolve peer name retrieve corresponding addresses information establish peer-to-peer connections pnrp peer names composed authority qualifier authority identified secure hash associated public key place-holder number zero peer name unsecured qualifier string allowing authority different peer names different services peer name secure pnrp name records signed publishing authority verified using public key unsecured peer names published anybody without possible verification multiple entities publish peer name example peer name associated group group member publish addresses peer name peer names published resolved within specified scope scope local link site e.g campus whole internet graphing pnrp also allows creating overlay network called graph peer overlay network corresponds node graph nodes resolved addresses using pnrp nodes graph share book-keeping information responsible functioning network whole example distributed resource management network node resource needs shared information shared records flooded peers graph peer stores record local database record consists header body body contains data specific application using api header contains metadata describe data body name-value pairs serialized using xml addition author version information also contain index body data fast searching node connect nodes directly well communication need shared entire graph grouping peer-to-peer api also allows creation secure overlay network called group consisting subset nodes graph group shared multiple applications unlike graph peers group must identifiable unique named registered using pnrp digital signature certificate termed group member certificate gmc records exchanged digitally signed peers must invited group invitation contains gmc enables join group windows xp introduces simplified form sharing files local users multi-user environment network called simple file sharing simple file sharing enabled default non-domain joined computers disables separate security tab used set advanced acls/permissions enables common interface permissions file system folders sharing simple file sharing enabled documents folder subfolders read written owner local administrators shared network checking make folder private option properties local administrators also denied permissions documents folder sharing files user accounts computer simple file sharing enabled windows xp includes shared documents folder simple file sharing disables granular local network sharing permissions shares item everyone group network read write access without asking password forcing guest user permissions windows xp webdav mini-redirector added preferred old web folders client default newer client works system service network-redirector level immediately file-system allowing webdav shares assigned drive letter used software even firewalls nats applications open remote files http servers edit file save changes back file server allows redirector also allows webdav shares addressed via unc paths e.g codice_5 converted codice_6 compatibility windows filesystem apis webdav mini-redirector known limitations authentication support although windows xp ship following major windows features out-of-the-box new features added windows xp downloading components incorporated later versions windows", + "neighbors": [ + 26, + 28, + 66, + 79, + 88, + 93, + 108, + 111, + 148, + 153, + 225, + 262, + 270, + 278, + 295, + 312, + 326, + 344, + 379, + 412, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 647, + 662, + 684, + 689, + 705, + 723, + 757, + 791, + 801, + 865, + 920, + 961, + 977, + 989, + 996, + 1013, + 1025, + 1042, + 1084, + 1092, + 1096, + 1098, + 1110, + 1151, + 1177, + 1193, + 1206, + 1212, + 1240, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1428, + 1453, + 1470, + 1486, + 1531, + 1533, + 1534, + 1545, + 1547, + 1555, + 1561, + 1570, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1152, + "label": 9, + "text": "Oberon_(programming_language):oberon programming language oberon general-purpose programming language created 1986 niklaus wirth latest member wirthian family algol-like languages euler algol-w pascal modula modula-2 oberon result concentrated effort increase power modula-2 direct successor pascal simultaneously reduce complexity principal new feature concept type extension record types permits construction new data types basis existing ones relate deviating dogma strictly static data typing type extension wirth way inheritance reflecting viewpoint parent site oberon developed part implementation oberon operating system eth zurich switzerland name moon uranus oberon oberon still maintained wirth latest language change dated may 8 2016 oberon designed motto attributed albert einstein mind \u201c make things simple possible simpler. \u201d principal guideline concentrate features basic essential omit ephemeral issues another factor recognition growth complexity languages c++ ada contrast oberon emphasizes use library concept extending language enumeration subrange types present modula-2 removed similarly set types limited small sets integers number low-level facilities sharply reduced particularly type transfer functions eliminated elimination remaining potentially-unsafe facilities concludes essential step toward obtaining truly high-level language close type-checking even across modules strict index-checking run time null-pointer checking safe type extension concept largely allow programmer rely language rules alone intent strategy produce language easier learn simpler implement efficient oberon compilers viewed compact fast providing adequate code quality compared commercial compilers following features characterize oberon language oberon supports extension record types construction abstractions heterogeneous structures contrast later dialects\u2014oberon-2 active oberon\u2014the original oberon n't dispatch mechanism language feature rather programming technique design pattern gives great flexibility oop world oberon operating system two programming techniques used conjunction dispatch call method suite message handler technique table procedure variables defined global variable type declared extended module assigned back generic module extend generic type figure specific shape dynamic dispatch done via procedures figures module generic module technique consists replacing set methods single procedure discriminates among various methods extend generic type figure specific shape oberon operating system techniques used dynamic dispatch first one used known set methods second used new methods declared extension module example extension module rectangles implement new rotate procedure within figures module could called via message handler no-cost implementations oberon language oberon operating system found internet several ethz changes made first released specification object-oriented programming features added 'for loop reinstated instance result oberon-2 currently common implementation release called native oberon includes operating system directly boot pc class hardware .net implementation oberon addition minor .net-related extensions also developed ethz 1993 ethz spin company brought dialect oberon-2 market name oberon-l renamed component pascal 1997 oberon-2 compilers maintained eth include versions microsoft windows linux solaris classic mac os furthermore implementations various operating systems atari-tos amigaos oberon-2 lex scanner yacc parser stephen j bevan manchester university uk based one m\u00f6ssenb\u00f6ck wirth reference version 1.4 also oxford oberon-2 compiler also understands oberon-07 vishap oberon latter based josef templ oberon c transpiler called ofront turn based op2 compiler developed regis crelier ethz oberon-07 defined niklaus wirth 2007 revised 2011 2013 2014 2015 2016 based original version oberon rather oberon-2 main changes explicit numeric conversion functions e.g floor flt must used loop exit statements eliminated statements extended case statements used type extension tests return statements connected end function imported variables structured value parameters read-only arrays assigned without using copy full details see programming language oberon-07 oberon-07 compilers developed use several different computer systems wirth compiler targets risc processor design used implement 2013 version project oberon operating system xilinx fpga spartan-3 board ports risc processor fpga spartan-6 spartan-7 artix-7 risc emulator windows compilable linux os x well binaries available windows also exist obnc compiles via c used posix compatible operating system commercial astrobe implementation targets 32-bit arm cortex-m3 m4 m7 microcontrollers patchouli compiler produces 64-bit windows binaries oberon-07m produces 32-bit windows binaries implements revision 2008 language akron produces binaries windows linux oberonjs translates oberon javascript oberonc implementation java virtual machine active oberon yet another variant oberon adds objects object-centered access protection local activity control system-guarded assertions preemptive priority scheduling changed syntax methods type-bound procedures oberon world objects may active means may threads processes additionally active oberon way implement operators including overloading advanced syntax using arrays see oberonx language extensions proceedings 7th joint modular languages conference 2006 oxford uk knows namespaces see proposal module contexts operating system a2 bluebottle especially kernel synchronizes coordinates different active objects ethz released active oberon supports active objects bluebottle operating system environment jdk http ftp etc language many prior designs ethz versions available download internet written single dual x86 cpus strongarm family supported development continued languages family extension oberon-2 originally named oberon/l later renamed component pascal developed windows classic mac os oberon microsystems commercial company spin-off ethz .net queensland university technology addition lagoona obliq languages carry oberon spirit specialized areas recent .net development efforts ethz focused new language called zonnon includes features oberon restores pascal enumerated types built-in io syntactic differences additional features include support active objects operator overloading exception handling zonnon available plug-in language microsoft visual studio .net development environment oberon-v originally called seneca seneca younger descendant oberon designed numerical applications supercomputers especially vector pipelined architectures includes array constructors statement see seneca language numerical applications vectorcomputers proc conpar 90 vapp iv conf r. griesemer diss nr 10277 eth zurich", + "neighbors": [ + 65, + 78, + 85, + 99, + 134, + 152, + 216, + 227, + 306, + 373, + 509, + 521, + 538, + 567, + 579, + 597, + 682, + 790, + 805, + 820, + 825, + 873, + 919, + 941, + 948, + 961, + 1028, + 1095, + 1120, + 1221, + 1225, + 1227, + 1235, + 1311, + 1324, + 1457 + ], + "mask": "Validation" + }, + { + "node_id": 1153, + "label": 0, + "text": "Morphological_pattern:morphological pattern morphological pattern set associations and/or operations build various forms lexeme possibly inflection agglutination compounding derivation term used domain lexicons morphology important distinguish paradigm lexeme morphological pattern context inflecting language inflectional morphological pattern explicit list inflected forms morphological pattern usually references prototypical class inflectional forms e.g ring per sing contrast paradigm lexeme explicit list inflected forms given lexeme e.g ring rang rung said terms difference description intension morphological pattern description extension paradigm", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1154, + "label": 3, + "text": "Hardware_architect:hardware architect hardware systems architect hardware architect responsible large systems architecture developed way handle systems large one person conceive let alone design systems size rapidly becoming norm architectural approaches architects increasingly needed solve problems large systems engineers group reputation understanding responding human needs comfortably developing humanly functional aesthetically pleasing products architects expected understand human needs develop humanly functional aesthetically pleasing products good architect translator user/sponsor engineers\u2014and even among engineers different specialties good architect also principal keeper user vision end product\u2014and process deriving requirements implementing vision determining users/sponsors actually want rather say want engineering\u2014it art architect follow exact procedure s/he communicates users/sponsors highly interactive way\u2014together extract true requirements necessary engineered system hardware architect must remain constantly communication end users systems architect therefore architect must familiar user environment problem engineer need knowledgeable potential engineering solution space user/sponsor view architect user representative provide input architect direct interaction project engineers generally discouraged chance mutual misunderstanding high user requirements specification joint product user hardware architect systems hardware architects user brings needs wish list architect brings knowledge likely prove doable within cost time constraints user needs translated set high level requirements also best time write first version acceptance test thereafter religiously kept date requirements way user absolutely clear s/he getting also safeguard untestable requirements misunderstandings requirements creep development first level hardware engineering requirements purely analytical exercise also involve hardware architect engineer compromises made\u2014to meet constraints like cost schedule power space architect must ensure final product overall look feel stray far user intent engineer focus developing design optimizes constraints ensures workable reliable product architect primarily concerned comfort usability product engineer primarily concerned producibility utility product provision needed services user true function engineered system however systems become ever larger complex emphases move away simple hardware components narrow application traditional hardware development principles found insufficient\u2014the application general principles hardware architecture design sub systems seen needed hardware architecture also simplified model finished end product\u2014its primary function define hardware components relationships whole seen consistent complete correct representation user mind\u2014especially computer\u2013human interface also used ensure components fit together relate desired way necessary distinguish architecture user world engineered hardware architecture former represents addresses problems solutions user world principally captured computer\u2013human interfaces chi engineered system engineered system represents engineering solutions\u2014how engineer proposes develop and/or select combine components technical infrastructure support chi absence architect unfortunate tendency confuse two architectures since engineer thinks terms hardware user may thinking terms solving problem getting people point point b reasonable amount time reasonable expenditure energy getting needed information customers staff hardware architect expected combine knowledge architecture user world potentially useful hardware engineering architectures former joint activity user latter joint activity engineers product set high level requirements reflecting user requirements used engineers develop hardware systems design requirements requirements evolve course project especially long one architect needed hardware system accepted user architect best insurance changes interpretations made course development compromise user viewpoint hardware engineers specialists know applications hardware design development intimately apply knowledge practical situations\u2014that solve real world problems evaluate cost\u2013benefits various solutions within hardware specialty ensure correct operation whatever design hardware architects generalists expected experts one hardware technology approach expected knowledgeable many able judge applicability specific situations also apply knowledge practical situations evaluate cost/benefits various solutions using different hardware technologies example specially developed versus commercially available hardware components assure system whole performs according user expectations many commercial-off-the-shelf already developed hardware components may selected independently according constraints cost response throughput etc cases architect already assemble end system unaided s/he may still need help hardware engineer select components design build special purpose function architects engineers may also enlist aid specialists\u2014in safety security communications special purpose hardware graphics human factors test evaluation quality control rma interface management etc effective hardware architectural team must immediate access specialists critical specialties architect planning building works overall design making sure pleasing useful inhabitants single architect may enough build single-family house many engineers may needed addition solve detailed problems arise novel high-rise building designed job large complex enough parts architecture may designed components building housing complex may one architect complex one type building part architectural team large hardware systems also require architect much engineering talent engineered system large complex enough chief hardware systems architect may defer subordinate architects parts job although may members joint architectural team architect must never viewed engineering supervisor architect sub-allocate hardware requirements major components subsystems within scope single hardware engineer engineering manager subordinate architect ideally hardware component/subsystem sufficiently stand-alone object tested complete component separate whole using simple testbed supply simulated inputs record outputs necessary know air traffic control system works order design build data management subsystem necessary know constraints subsystem expected operate good architect ensures system however complex built upon relatively simple clean concepts sub system layer\u2014easily understandable everyone especially user without special training architect use minimum rules ensure partition well-defined clean kludges work-arounds short-cuts confusing detail exceptions user needs evolve system fielded use lot easier subsequently evolve simple concept one laden exceptions special cases lots fine print layering hardware architecture important keeping sufficiently simple layer remains comprehensible single mind layers ascended whole systems lower layers become simple components higher layers may disappear altogether highest layers acceptance test always remains principal responsibility architect chief means architect prove user hardware originally planned subordinate architects engineers met objectives large projects tend dynamic changes along way needed user e.g. problems change expected user e.g. cost schedule reasons acceptance tests must kept current times principal means user kept informed final product perform act principal goal towards subordinate personnel must design build test building architect uses sketches models drawings hardware systems architect use sketches models prototypes discuss different solutions results user system architect engineers subordinate architects early draft version user manual invaluable especially conjunction prototype set engineering requirements means communicating users explicitly avoided well written set requirements specification intelligible engineering fraternity much legal contract lawyers", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1155, + "label": 2, + "text": "Operating_system_advocacy:operating system advocacy operating system advocacy practice attempting increase awareness improve perception computer operating system motivation behind may increase number users system assert superiority one choice another brand loyalty pride operating system abilities open source operating systems political philosophical reasons persuade software vendors port specific applications device drivers computing platform generally done support increasing network effects platform operating system advocacy vary widely tone form seriously studied researched comparisons heated debates mailing lists forums advocates often normal users devote spare time advocacy operating system choice many deep abiding interest use design construction operating systems emotional investment favorite operating system one specific example known platform evangelism operating system advocacy compared advocacy fields particularly browser editor wars programming languages video game consoles well ford vs. chevy similar debates car culture due often emotional nature advocacy debate sometimes narrow appeal wider user population forums discussion advocacy often separate general discussion usenet comp.os comp.sys hierarchy often *.advocacy groups devoted exclusively advocating respective operating systems groups comp.sys.amiga.advocacy remain active even subject os ceases market force guide windows newsgroups exhorts usenet posters get involved arguments windows vs. os/2 vs. macintosh vs. nextstep except comp.os.ms-windows.advocacy group operating system advocacy discussions usenet elsewhere spawned variety jargon describing commonly seen behaviour including microdroid amiga persecution complex emotional form negative characteristics often associated operating system advocacy led create guidelines explaining consider positive advocacy linux advocacy guidelines guidelines effective os/2 advocacy freebsd served mailing list specifically advocacy discussion advocacy-related materials links provided freebsd website including page logos large number linux distributions many organizations involved linux advocacy including companies directly involved development distributions well purely advocacy-based groups seul promotion takes wide variety forms tux plush toys t-shirts posters even unorthodox forms body paints video games 1984 super bowl advertisement test drive macintosh apple switch get mac advertising campaigns apple computer long history advocating platform traditional media also covers advocacy macintosh hardware peripherals even lifestyle choices fans company projecting alternately hip entertaining liberating lifestyle negatively portraying microsoft windows ibm competitors anything awkward dated totalitarian sinister big brother figure neowin.net wrote editorials opposing windows-bashing media microsoft attempted boost popularity windows 7 launch party program like freebsd netbsd foundation hosts mailing list especially advocacy mailing list automatically archived made accessible online also provide official advocacy material posters flyers official powered logo license permitting use product running netbsd like freebsd netbsd openbsd project provides mailing list specifically intended advocacy advocacy openbsd.org created july 21 1998 discussion user groups stickers shirts promotion openbsd image also host flame-worthy discussions part advocacy project also maintains list consulting firms individual consultants around world website produced number slogans including free functional secure secure default power security flexibility openbsd release features original song variety artwork team os/2 grassroots organization conceived ibm employee initially joined ibmers quickly spread outside ibm whether ibm employees team os/2 members initially volunteered time passion without official sanction connection ibm members would promote os/2 trade shows conferences fairs stores participate operating system discussions compuserve prodigy fidonet usenet throw parties help users install os/2 contact media figures explain os/2 generate interest general exercise creativity initiative helping popularize os/2 industry dynamics gave rise passionate advocacy multi-faceted perhaps leading cause antipathy idea microsoft could would establish monopoly windows dos widely deemed far inferior os/2 additionally many users feared ibm proven eminently capable developing superior pc operating system knew little consumer marketing high-tech marketplace establishing even superior product standard cut-throat get-there-first-at-any-cost arena dominated microsoft finally mere fact many copies windows shipping users os/2 advocates viewed uncritical uninformed coupled fact many industry much riding success os/2 created conditions ripe many trying take matters hands spark needed combustible situation ignite example evangelism provided new ibm employees took empowerment seriously able coordinate efforts participation teamos2 forum internal ibm discussion group passionate supporters outside ibm adopted ideas modeled behaviors early activists within ibm", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 265, + 267, + 322, + 353, + 380, + 387, + 434, + 465, + 491, + 583, + 627, + 650, + 664, + 720, + 721, + 754, + 797, + 884, + 891, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1224, + 1301, + 1304, + 1361, + 1391, + 1394, + 1415, + 1441, + 1456, + 1530, + 1546, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1156, + "label": 9, + "text": "STOS_BASIC:stos basic stos basic dialect basic programming language implemented atari st computer stos basic originally developed jawx fran\u00e7ois lionet constantin sotiropoulos published mandarin software known europress software stos basic version basic designed creating games set powerful high-level graphics sound commands offered made suitable developing multimedia-intense software without knowledge internals atari st although first version stos released uk version 2.3 released late 1988 mandarin software version released earlier france version 2.3 bundled three complete games orbit zoltar bullet train many accessories utilities sprite music editors compiler soon released enabled user compile stos basic program executable file ran lot faster compiled rather interpreted order compatible compiler stos needed upgraded version 2.4 came compiler stos 2.4 also fixed bugs faster floating point mathematics code floating point numbers smaller range stos 2.5 released make stos run atari stes tos 1.06 1.6 stos 2.6 needed make stos run atari stes tos 1.62 stos 2.7 compiler-only upgrade made programs stos tracker extension used play mod music compile 3rd-party hack called stos 2.07 designed make stos run even tos versions behave atari falcon around 2001 fran\u00e7ois lionet released via clickteam website source code stos basic 4th april 2019 fran\u00e7ois lionet announced release amos2 website amos2.tech amos2 replaces stos amos together using javascript code interpreter making new development system independent generally deployed internet browsers possible extend functionality stos adding extensions added commands language increased functionality first extension released stos maestro added ability play sampled sounds stos maestro plus stos maestro bundled sound-sampler cartridge extensions included tome stos 3d ste extension misty missing link control extension extra ninja tracker extensions kept stos alive many years release giving programmers ability rapidly create game without knowing internals stos criticised slow especially intensively using non-high-level commands allowing user program structured manner 1990 amos basic released amiga originally meant shortly follow release stos atari st. amos released two years uk release stos turned blessing disguise amiga community thanks extra development time amos take advantage extra amiga hardware commands stos style basic completely different line-numbers many structured programming constructs one time stos club newsletter published program allowed reader program stos using style often possible directly convert stos basic programs heavily rely extensions amos basic reverse usually true pc version called pcos mentioned never materialised instead publishers mandarin software renamed europress software one developers jawx francois lionet later form clickteam yves lamoureux went release klik click series games-creation tools dissimilar stos use primarily mouse-driven interface without need traditional code klik play games factory multimedia fusion multimedia fusion 2 released series", + "neighbors": [ + 0, + 8, + 236, + 273, + 292, + 509, + 510, + 606, + 670, + 810, + 812, + 843, + 868, + 1034, + 1037, + 1050, + 1079, + 1204, + 1306, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1157, + "label": 6, + "text": "Hierarchical_File_System:hierarchical file system hierarchical file system hfs proprietary file system developed apple inc. use computer systems running mac os originally designed use floppy hard disks also found read-only media cd-roms hfs also referred mac os standard hfs standard successor hfs plus also called mac os extended hfs extended introduction mac os x 10.6 apple dropped support formatting writing hfs disks images remain supported read-only volumes starting macos 10.15 hfs disks longer read apple introduced hfs september 1985 specifically support apple first hard disk drive macintosh replacing macintosh file system mfs original file system introduced year half earlier first macintosh computer hfs drew heavily upon apple first hierarchical operating system sos failed apple iii also served basis hierarchical file systems apple iie apple lisa hfs developed patrick dirks bill bruffey shared number design features mfs available file systems time dos fat files could multiple forks normally data resource fork allowed main data file stored separately resources icons might need localized files referenced unique file ids rather file names file names could 255 characters long although finder supported maximum 31 characters however mfs optimized used small slow media namely floppy disks hfs introduced overcome performance problems arrived introduction larger media notably hard drives main concern time needed display contents folder mfs file directory listing information stored single file system search build list files stored particular folder worked well system hundred kilobytes storage perhaps hundred files systems grew megabytes thousands files performance degraded rapidly solution replace mfs directory structure one suitable larger file systems hfs replaced flat table structure catalog file uses b-tree structure could searched quickly regardless size hfs also redesigned various structures able hold larger numbers 16-bit integers replaced 32-bit almost universally oddly one places upsizing take place file directory limits hfs total 65,535 files logical disk hfs proprietary file system format well-documented usually solutions available access hfs-formatted disks modern operating systems apple introduced hfs necessity first 20 mb hard disk offering macintosh september 1985 loaded ram mfs floppy disk boot using patch file hard disk 20 however hfs widely introduced included 128k rom debuted macintosh plus january 1986 along larger 800 kb floppy disk drive macintosh also used hfs introduction hfs first advancement apple leave macintosh computer model behind original 128k macintosh lacked sufficient memory load hfs code promptly discontinued 1998 apple introduced hfs plus address inefficient allocation disk space hfs add improvements hfs still supported current versions mac os starting mac os x hfs volume used booting beginning mac os x 10.6 snow leopard hfs volumes read-only created updated macos sierra 10.12 apple release notes state hfs standard filesystem longer supported however read-only hfs standard support still present sierra works previous versions storage volume inherently divided logical blocks 512 bytes hierarchical file system groups logical blocks allocation blocks contain one logical blocks depending total size volume hfs uses 16-bit value address allocation blocks limiting number allocation blocks 65,535 2-1 five structures make hfs volume catalog file stores file directory records single data structure results performance problems system allows multitasking one program write structure time meaning many programs may waiting queue due one program hogging system also serious reliability concern damage file destroy entire file system contrasts file systems store file directory records separate structures dos fat file system unix file system structure distributed across disk means damaging single directory generally non-fatal data may possibly re-constructed data held non-damaged portions additionally limit 65,535 allocation blocks resulted files minimum size equivalent 1/65,535th size disk thus given volume matter size could store maximum 65,535 files moreover file would allocated space actually needed allocation block size disks small little consequence individual allocation block size trivial disks started approach 1 gb mark smallest amount space file could occupy single allocation block became excessively large wasting significant amounts disk space example 1 gb disk allocation block size hfs 16 kb even 1 byte file would take 16 kb disk space situation less problem users large files pictures databases audio larger files wasted less space percentage file size users many small files hand could lose copious amount space due large allocation block size made partitioning disks smaller logical volumes appealing mac users small documents stored smaller volume would take much less space resided large partition problem existed fat16 file system hfs saves case file created renamed case-insensitive operation", + "neighbors": [ + 34, + 40, + 55, + 63, + 99, + 121, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 413, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 772, + 797, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1179, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1401, + 1445, + 1459, + 1538, + 1565, + 1578, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1158, + "label": 3, + "text": "AltiVec:altivec altivec single-precision floating point integer simd instruction set designed owned apple ibm freescale semiconductor formerly motorola semiconductor products sector \u2014 aim alliance implemented versions powerpc processor architecture including motorola g4 ibm g5 power6 processors p.a semi pwrficient pa6t altivec trademark owned solely freescale system also referred velocity engine apple vmx vector multimedia extension ibm p.a semi altivec refers instruction set implementations cpus produced ibm motorola separate terms logic design date ibm core included altivec logic design licensed motorola vice versa altivec standard part power isa v.2.03 specification never formally part powerpc architecture specification although used powerpc instruction formats syntax occupied opcode space expressly allocated purposes vmx/altivec sse feature 128-bit vector registers represent sixteen 8-bit signed unsigned chars eight 16-bit signed unsigned shorts four 32-bit ints four 32-bit floating point variables provide cache-control instructions intended minimize cache pollution working streams data also exhibit important differences unlike sse2 vmx/altivec supports special rgb pixel data type operate 64-bit double precision floats way move data directly scalar vector registers keeping load/store model powerpc risc design vector registers like scalar registers loaded stored memory however vmx/altivec provides much complete set horizontal operations work across elements vector allowable combinations data type operations much complete thirty-two 128-bit vector registers provided compared eight sse sse2 extended 16 x86-64 vmx/altivec instructions take three register operands compared two register/register register/memory operands ia-32 vmx/altivec also unique support flexible vector permute instruction byte resulting vector value taken byte either two vectors parametrized yet another vector allows sophisticated manipulations single instruction recent versions gnu compiler collection gcc ibm visualage compiler compilers provide intrinsics access vmx/altivec instructions directly c c++ programs version 4 gcc also includes auto-vectorization capabilities attempt intelligently create vmx/altivec accelerated binaries without need programmer use intrinsics directly vector type keyword introduced permit declaration native vector types e.g. codice_1 declares 128-bit vector variable named foo containing sixteen 8-bit unsigned chars full complement arithmetic binary operators defined vector types normal c expression language used manipulate vector variables also overloaded intrinsic functions codice_2 emit appropriate op code based type elements within vector strong type checking enforced contrast intel-defined data types ia-32 simd registers declare size vector register 128 64 bits case 128-bit register whether contains integers floating point values programmer must select appropriate intrinsic data types use e.g. codice_3 adding two vectors containing eight 16-bit integers power vector media extension vmx developed 1996 1998 collaborative project apple ibm motorola apple primary customer power vector media extension vmx apple switched intel-made x86-based cpus june 6 2005 used accelerate multimedia applications quicktime itunes key parts apple mac os x including quartz graphics compositor companies adobe used altivec optimize image-processing programs adobe photoshop motorola first supply altivec enabled processors starting g4 line altivec also used embedded systems high-performance digital signal processing ibm consistently left vmx earlier power microprocessors intended server applications useful power6 microprocessor introduced 2007 implements altivec last desktop microprocessor ibm powerpc 970 dubbed g5 apple also implemented altivec hardware similar powerpc 7400 altivec brandname trademarked freescale previously motorola standard category vector part power isa v.2.03 specification category also known vmx used ibm velocity engine brand name previously used apple cell broadband engine used amongst things playstation 3 also supports power vector media extension vmx ppu spu isa enhanced architecturally similar freescale bringing enhanced version altivec e6500 based qoriq processors ibm enhanced vmx use xenon xbox 360 called enhancement vmx128 enhancements comprise new routines targeted gaming accelerating 3d graphics game physics total 128 registers vmx128 entirely compatible vmx/altivec number integer operations removed make space larger register file additional application-specific operations power isa v2.06 introduces new vsx vector-scalar instructions extend simd processing power isa support 64 registers support regular floating point decimal floating point vector execution power7 first power isa processor implement power isa v2.06 new instructions introduced ibm vector media extension category integer operations part vsx extension power isa 2.07 new integer vector instructions introduced ibm following vmx encodings part vsx extension power isa v3.0 shall introduced power9 processors c++ standard way accessing altivec support mutually exclusive use standard template library codice_4 class template due treatment vector reserved word compiler implement context sensitive keyword version vector however may possible combine using compiler-specific workarounds instance gcc one may codice_5 remove codice_6 keyword use gcc-specific codice_7 keyword place following processors altivec vmx vmx128 included", + "neighbors": [ + 85, + 86, + 123, + 137, + 210, + 270, + 271, + 306, + 395, + 457, + 738, + 752, + 830, + 893, + 979, + 1016, + 1147, + 1160, + 1161, + 1284, + 1351, + 1518 + ], + "mask": "Test" + }, + { + "node_id": 1159, + "label": 7, + "text": "Middleware:middleware middleware computer software provides services software applications beyond available operating system described software glue middleware makes easier software developers implement communication input/output focus specific purpose application gained popularity 1980s solution problem link newer applications older legacy systems although term use since 1968 term commonly used software enables communication management data distributed applications ietf workshop 2000 defined middleware services found transport i.e tcp/ip layer set services application environment i.e application-level apis specific sense middleware described dash client-server -to- peer-to-peer middleware includes web servers application servers content management systems similar tools support application development delivery objectweb defines middleware software layer lies operating system applications side distributed computing system network services regarded middleware include enterprise application integration data integration message oriented middleware mom object request brokers orbs enterprise service bus esb database access services often characterised middleware language specific implementations support heterogeneous features related communication features examples database-oriented middleware include odbc jdbc transaction processing monitors distributed computing system middleware loosely divided two categories\u2014those provide human-time services web request servicing perform machine-time latter middleware somewhat standardized service availability forum commonly used complex embedded systems within telecom defense aerospace industries term middleware used contexts well middleware sometimes used similar sense software driver abstraction layer hides detail hardware devices software application", + "neighbors": [ + 12, + 14, + 25, + 123, + 134, + 149, + 221, + 227, + 262, + 272, + 282, + 292, + 346, + 362, + 379, + 412, + 416, + 429, + 718, + 739, + 789, + 804, + 834, + 839, + 847, + 976, + 1096, + 1102, + 1138, + 1183, + 1324, + 1368, + 1372, + 1377, + 1398, + 1416, + 1443, + 1484, + 1503, + 1549, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 1160, + "label": 3, + "text": "MMX_(instruction_set):mmx instruction set mmx single instruction multiple data simd instruction set designed intel introduced 1997 p5-based pentium line microprocessors designated pentium mmx technology developed similar unit introduced intel i860 earlier intel i750 video pixel processor mmx processor supplementary capability supported recent ia-32 processors intel vendors new york times described initial push including super bowl ads focused new generation glitzy multimedia products including videophones 3-d video games mmx subsequently extended several programs intel others 3dnow streaming simd extensions sse ongoing revisions advanced vector extensions avx mmx officially meaningless initialism trademarked intel unofficially initials variously explained standing newsweek described 57 new 'instructions etched microscopically onto face chip amd one numerous court battles intel produced marketing material intel indicating mmx stood matrix math extensions since initialism trademarked attempt invalidate intel trademark 1995 intel filed suit amd cyrix corp. misuse trademark mmx amd intel settled amd acknowledging mmx trademark owned intel intel granting amd rights use mmx trademark technology name processor name mmx defines eight registers called mm0 mm7 operations operate register 64 bits wide used hold either 64-bit integers multiple smaller integers packed format single instruction applied two 32-bit integers four 16-bit integers eight 8-bit integers mmx provides integer operations originally developed intel i860 use integer math made sense 2d 3d calculations required graphics cards much became common integer simd cpu became somewhat redundant graphical applications hand saturation arithmetic operations mmx could significantly speed digital signal processing applications avoid compatibility problems context switch mechanisms existing operating systems mmx registers aliases existing x87 fpu registers context switches would already save restore unlike x87 registers behave like stack mmx registers directly addressable random access operation involving floating point stack might also affect mmx registers vice versa aliasing makes difficult work floating point simd operations application maximize performance programmers often used processor exclusively one mode deferring relatively slow switch long possible 64-bit mmx register corresponds mantissa part 80-bit x87 register upper 16 bits x87 registers thus go unused mmx bits set ones making nans infinities floating point representation used applications decide whether particular register content intended floating point simd data software support mmx slow coming intel c compiler related development tools obtained intrinsics invoking mmx instructions intel released libraries common vectorized algorithms using mmx intel metrowerks attempted automatic vectorization compilers operations c programming language mapped poorly onto mmx instruction set custom algorithms 2000 typically still written assembly amd competing x86 microprocessor vendor enhanced intel mmx 3dnow instruction set 3dnow best known adding single-precision 32-bit floating-point support simd instruction-set among integer general enhancements following mmx intel next major x86 extension sse introduced pentium-iii family 1999 roughly year amd 3dnow introduced sse addressed core shortcomings mmx inability mix integer-simd ops floating-point ops creating new 128-bit wide register file xmm0\u2013xmm7 new simd instructions like 3dnow sse focused exclusively single-precision floating-point operations 32-bit integer simd operations still performed using mmx register instruction set however new xmm register-file allowed sse simd-operations freely mixed either mmx x87 fpu ops sse2 introduced pentium 4 extended x86 simd instruction set integer 8/16/32 bit double-precision floating-point data support xmm register file sse2 also allowed mmx opcodes use xmm register operands extended even wider ymm zmm registers later sse revisions intel marvell xscale microprocessor core starting pxa270 include simd instruction set extension arm core called iwmmxt whose functions similar ia-32 mmx extension iwmmxt stands intel wireless mmx technology provides arithmetic logic operations 64-bit integer numbers software may choose instead perform two 32-bit four 16-bit eight 8-bit operations single instruction extension contains 16 data registers 64-bits eight control registers 32-bits registers accessed standard arm architecture coprocessor mapping mechanism iwmmxt occupies coprocessors 0 1 space opcodes clash opcodes earlier floating-point extension fpa later versions marvell arm processors supports wmmx wireless mmx wmmx2 wireless mmx2 support", + "neighbors": [ + 53, + 78, + 85, + 123, + 137, + 210, + 270, + 271, + 306, + 331, + 355, + 457, + 460, + 486, + 641, + 752, + 830, + 979, + 1016, + 1069, + 1158, + 1161, + 1263, + 1284, + 1351 + ], + "mask": "Test" + }, + { + "node_id": 1161, + "label": 3, + "text": "Streaming_SIMD_Extensions:streaming simd extensions computing streaming simd extensions sse single instruction multiple data simd instruction set extension x86 architecture designed intel introduced 1999 pentium iii series central processing units cpus shortly appearance advanced micro devices amd 3dnow sse contains 70 new instructions work single precision floating point data simd instructions greatly increase performance exactly operations performed multiple data objects typical applications digital signal processing graphics processing intel first ia-32 simd effort mmx instruction set mmx two main problems re-used existing x87 floating point registers making cpus unable work floating point simd data time worked integers sse floating point instructions operate new independent register set xmm registers adds integer instructions work mmx registers sse subsequently expanded intel sse2 sse3 ssse3 sse4 supports floating point math wider applications mmx became popular addition integer support sse2 made mmx largely redundant code though performance increases attained situations using mmx parallel sse operations sse originally called katmai new instructions kni katmai code name first pentium iii core revision katmai project intel sought distinguish earlier product line particularly flagship pentium ii later renamed internet streaming simd extensions isse sse amd eventually added support sse instructions starting athlon xp duron morgan core processors sse originally added eight new 128-bit registers known codice_1 codice_2 amd64 extensions amd originally called x86-64 added eight registers codice_3 codice_4 extension duplicated intel 64 architecture also new 32-bit control/status register codice_5 registers codice_3 codice_4 accessible 64-bit operating mode sse used single data type xmm registers sse2 would later expand usage xmm registers include 128-bit registers additional machine states operating system must preserve across task switches disabled default operating system explicitly enables means os must know use codice_8 codice_9 instructions extended pair instructions save x86 sse register states support quickly added major ia-32 operating systems first cpu support sse pentium iii shared execution resources sse floating point unit fpu compiled application interleave fpu sse instructions side-by-side pentium iii issue fpu sse instruction clock cycle limitation reduces effectiveness pipelining separate xmm registers allow simd scalar floating point operations mixed without performance hit explicit mmx/floating point mode switching sse introduced scalar packed floating point instructions following simple example demonstrates advantage using sse consider operation like vector addition used often computer graphics applications add two single precision four-component vectors together using x86 requires four floating-point addition instructions corresponds four x86 fadd instructions object code hand following pseudo-code shows single 128-bit 'packed-add instruction replace four scalar addition instructions x86 instruction set extensions bios operating system application programmer test detect existence proper operation user application uptake x86 extensions slow even bare minimum baseline mmx sse support cases non-existent applications 10 years extensions became commonly available distributed computing accelerated use extensions scientific community\u2014and many scientific applications refuse run unless cpu supports sse2 sse3 use multiple revisions application cope many different sets extensions available simplest way around x86 extension optimization problem software libraries applications begun support multiple extension types hinting full use available x86 instructions may finally become common 5 15 years instructions initially introduced processor id applications", + "neighbors": [ + 85, + 86, + 137, + 210, + 216, + 234, + 270, + 271, + 331, + 457, + 486, + 521, + 752, + 830, + 979, + 1016, + 1138, + 1158, + 1160, + 1166, + 1284, + 1351, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 1162, + "label": 4, + "text": "Grum_botnet:grum botnet grum botnet also known alias tedroo reddyb botnet mostly involved sending pharmaceutical spam e-mails world largest botnet grum traced back early 2008 time shutdown july 2012 grum reportedly world 3rd largest botnet responsible 18 worldwide spam traffic grum relies two types control servers operation one type used push configuration updates infected computers used tell botnet spam emails send july 2010 grum botnet consisted estimated 560,000\u2013840,000 computers infected grum rootkit botnet alone delivered 39.9 billion spam messages march 2010 equating approximately 26 total global spam volume temporarily making world then-largest botnet late 2010 botnet seemed growing output increased roughly 51 comparison output 2009 early 2010 used panel written php control botnet july 2012 malware intelligence company published analysis botnet command control servers located netherlands panama russia later reported dutch colo/isp soon seized two secondary servers responsible sending spam instructions existence made public within one day panamanian isp hosting one grum primary servers followed suit shut server cybercriminals behind grum quickly responded sending instructions six newly established servers ukraine fireeye connected spamhaus cert-gib anonymous researcher shut remaining six c c servers officially knocking botnet sinkhole running former ip addresses grumbot c c servers feed sinkhole processed via shadowserver abusix inform point contact isp infected ip addresses isp asked contact customers infections malware cleaned shadowserver.org inform users service per day abusix sends x-arf extended version abuse reporting format report every hour", + "neighbors": [ + 91, + 141, + 149, + 158, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 450, + 490, + 522, + 531, + 533, + 550, + 576, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 666, + 675, + 708, + 783, + 818, + 915, + 1090, + 1186, + 1235, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1358, + 1365, + 1379, + 1393, + 1436, + 1467, + 1475, + 1543, + 1554, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1163, + "label": 7, + "text": "Apache_SystemML:apache systemml apache systemml flexible machine learning system automatically scales spark hadoop clusters systemml's distinguishing characteristics systemml created 2010 researchers ibm almaden research center led ibm fellow shivakumar vaithyanathan observed data scientists would write machine learning algorithms languages r python small data came time scale big data systems programmer would needed scale algorithm language scala process typically involved days weeks per iteration errors would occur translating algorithms operate big data systemml seeks simplify process primary goal systemml automatically scale algorithm written r-like python-like language operate big data generating answer without error-prone multi-iterative translation approach june 15 2015 spark summit san francisco beth smith general manager ibm analytics announced ibm open-sourcing systemml part ibm major commitment apache spark spark-related projects systemml became publicly available github august 27 2015 became apache incubator project november 2 2015 may 17 2017 apache software foundation board approved graduation apache systemml apache top level project", + "neighbors": [ + 134, + 178, + 192, + 197, + 296, + 318, + 538, + 620, + 715, + 825, + 874, + 1091, + 1138, + 1225, + 1254, + 1454, + 1582, + 1583 + ], + "mask": "Test" + }, + { + "node_id": 1164, + "label": 8, + "text": "Protein_Structure_Evaluation_Suite_&_Server:protein structure evaluation suite amp server protein structure evaluation suite server prosess freely available web server protein structure validation designed university alberta assist process evaluating validating protein structures solved nmr spectroscopy structure validation particularly important component structure determination pipeline many protein structures small structural errors i.e distorted bond lengths angles incompatible torsion angles overlapping atoms easily detected visual inspection protein structures solved nmr spectroscopy large numbers structures generated coordinate inaccuracies common problem particularly acute nmr-based structure validation protocols primarily use noe nuclear overhauser enhancement j-coupling residual dipolar coupling rdc data assess validate structures particular try assess agreement experimentally observed calculated noes rdcs and/or j-couplings good agreement calculated observed parameters normally indicates good structure methods structure validation procheck molprobity resprox vadar focus measuring coordinate data rather experimental data assess quality bond torsion angle geometry prosess unique among structure validation servers evaluates coordinate quality experimental data quality prosess also able use nmr chemical shifts well noes assess validate protein structures chemical shifts easily precisely measurable nmr observables provide great deal information protein structure dynamics see protein chemical shift prediction specifically prosess assesses agreement observed chemical shifts shiftx-predicted ha ca cb n c hn nmr chemical shifts addition ability validate structures using chemical shifts prosess also checks many protein structure parameters including covalent bond quality non-covalent bond atomic packing quality torsion angle quality noe quality i.e measuring model agreement noe-based distance restraints total 8 different programs see prosess sub-programs used prosess evaluation validation process prosess handle single-chain x-ray models multi-chain x-ray models single-chain nmr ensembles multi-chain nmr ensembles monomeric multimeric proteins addition able validate nmr protein structures prosess used validate evaluate protein model regardless solved x-ray nmr comparative modelling etc. prosess generates detailed colorful structure validation report including tables color-coded images graphs bar charts many tables contain embedded hyperlinks additional details explanations graphs charts prosess uses simple rag red amber green color scheme indicate quality different structure parameters protein whole different members structure ensemble specific residues specific atoms different shades red indicate serious problems different shades yellow amber indicate potential problems different shades green indicate protein model residues/atoms free problems color also assigned number ranging 0 9with 0 bad 9 excellent structure quality assessment quantifiable prosess quality indices quality color scales designed specifically help non-structural biologists easily rapidly understand protein structure validation reports", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1165, + "label": 4, + "text": "Disinfectant_(software):disinfectant software disinfectant popular antivirus software program classic mac os originally released freeware john norstad spring 1989 disinfectant featured system extension would detect virus infections application users could scan remove viruses new versions disinfectant subsequently released detect additional viruses bob levitus praised recommended disinfectant 1992 may 1998 norstad retired disinfectant citing new danger posed macro viruses disinfectant detect inability single individual maintain program caught", + "neighbors": [ + 99, + 1138 + ], + "mask": "Validation" + }, + { + "node_id": 1166, + "label": 5, + "text": "Waterfox:waterfox waterfox open-source web browser x64 arm64 systems intended speedy ethical maintain support legacy extensions dropped firefox forked official releases windows including portable version macos linux android waterfox based firefox compiled using various compilers using intel math kernel library streaming simd extensions 3 advanced vector extensions linux builds built clang waterfox continuing support long-standing xul xpcom add-on capability firefox removed version 57 features waterfox currently waterfox first released march 27 2011 64-bit windows mac build introduced may 14 2015 release version 38.0 linux build introduced december 20 2016 release version 50.0 android build first introduced version 55.2.2 version 29.0 released july 22 2015 build ios may 7 2019 68.0a1 first alpha version next generation waterfox released may 12 2015 november 12 2015 waterfox exclusive charity search engine called storm ecosia default search engine bing search engine default one", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 137, + 258, + 277, + 306, + 427, + 491, + 509, + 530, + 531, + 582, + 585, + 623, + 627, + 646, + 668, + 684, + 713, + 734, + 862, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1161, + 1195, + 1210, + 1228, + 1280, + 1302, + 1331, + 1339, + 1376, + 1378, + 1408, + 1423, + 1528, + 1539, + 1550, + 1563, + 1569, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1167, + "label": 2, + "text": "Edubuntu:edubuntu edubuntu previously known ubuntu education edition official derivative ubuntu operating system designed use classrooms inside schools homes communities edubuntu developed collaboration teachers technologists several countries edubuntu built top ubuntu base incorporates ltsp thin client architecture several education-specific applications aimed users aged 6 18 designed easy installation ongoing system maintenance included edubuntu linux terminal server project many applications relevant education including gcompris kde edutainment suite sabayon profile manager pessulus lockdown editor edubuntu menueditor libreoffice gnome nanny italc edubuntu cds previously available free charge shipit service available download dvd format edubuntu default gui unity gnome still available unity default gui since release 12.04 since release 7.10 kde also available edubuntu kde 2010 edubuntu qimo 4 kids project working providing qimo within edubuntu done would fitted cd primary goal edubuntu enable educator limited technical knowledge skills set computer lab on-line learning environment hour less effectively administer environment principal design goals edubuntu centralized management configuration users processes together facilities working collaboratively classroom setting equally important gathering together best available free software digital materials education according statement goals official edubuntu website aim put together system contains best free software available education make easy install maintain also aims allow low income environments maximize utilisation available older equipment first edubuntu release coincided release ubuntu 5.10 codenamed breezy badger 2005-10-13 8.04 hardy heron release edubuntu given name ubuntu education edition changed add-on standard ubuntu installation instead installable livecd version 9.10 onwards edubuntu changed available full system dvd instead add-on cd edubuntu also installable via selection edubuntu packages distributions using official ubuntu repositories ubuntu kubuntu mainly since 14.04 edubuntu become lts-only edubuntu announced skip 16.04 lts update plan staying 14.04 due lack contributors", + "neighbors": [ + 113, + 134, + 213, + 301, + 351, + 357, + 393, + 404, + 431, + 695, + 754, + 897, + 935, + 974, + 1004, + 1046, + 1049, + 1055, + 1126, + 1214, + 1276, + 1278, + 1286, + 1318, + 1369, + 1403, + 1458, + 1509, + 1524, + 1538, + 1539, + 1558, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 1168, + "label": 9, + "text": "NeWS:news news network extensible window system discontinued windowing system developed sun microsystems mid-1980s originally known sundew primary authors james gosling david s. h. rosenthal news interpreter based postscript later display postscript although two projects otherwise unrelated extending allow interaction multiple contexts support windows like postscript news could used complete programming language unlike postscript news could used make complete interactive programs mouse support gui news started implementing postscript interpreter running cooperative multitasking fashion since unlike postscript printer news would displaying number postscript programs time one screen also added complete view hierarchy based viewports known canvases synchronous event distribution system supporting events interests threads monitors like view system guis news included concept tree embedded views along events passed instance mouse click would generate event would passed object directly mouse pointer say button object respond event object button would receive message news included complete model events including timers automatic events input queues devices mice keyboards functionality required full interaction input handling system designed provide strong event synchronization guarantees possible asynchronous protocols like x support user interface widgets news expanded original postscript stack-based language complete object oriented oo programming style inheritance eliminated need external oo language build complete application since additions implemented extensions postscript possible write simple postscript code would result running onscreen interactive program two popular demonstration programs onscreen clock required two pages code program drew pair eyes followed cursor moved around screen eyeball program shown siggraph 1988 inspiration later well-known x application xeyes news included several libraries user interface elements widgets written news widgets ran behaviour news interpreter required communications outside program news code widget demanded example toggle button display routine query button state pressed change display accordingly button postscript code also react mouse clicks changing state pressed pressed vice versa happen windowing server without interaction client program mouse released button event sent handling sophisticated x window system server model report mouse pushed mouse mouse released events client figure event button switch state finally instruct server display new state client server machine interactions must travel network results delay responding news architecturally similar called ajax except news coherently best example library tnt news toolkit sun released 1989 sun also shipped earlier lite toolkit intended example purposes making small programs although adoption never widespread several companies licensed news adapted various uses open look version framemaker desktop publishing program developed frame technology corp. funding mainly sun microsystems nsa one commercial products ran news hyperlook developed arthur van hoff turing institute interactive application design system hopkins developed news version simcity built hyperlook commercial drawing program altsys virtuoso produced news port freehand additional functionality took advantage postscript environment unfortunately sun announced end support news virtuoso became ready ship compared x news vastly powerful also slower especially local connections c api low level difficult use news programs tended entirely written postscript another factor popularity sun charged fee license news source code mit x11 code free cost first versions news emulated x10 protocol translating calls news postscript speed problems plus existence programs relied exact pixel results x10 calls obsolescence x10 forced sun release x11/news hybrid called xnews ran x11 server parallel postscript interpreter seriously degraded news interpreter performance considered good x11 server either sun also implemented open look user interface specification several toolkits news toolkit tnt open look toolkit written postscript ran news server olit built xt x intrinsics base motif xview used apis sun earlier sunview window system clear open look lost motif popularity adobe acquired framemaker sun stopped supporting news products news simply vanished", + "neighbors": [ + 210, + 227, + 272, + 399, + 509, + 770, + 1006, + 1138, + 1233, + 1280, + 1288, + 1322, + 1372, + 1421 + ], + "mask": "Test" + }, + { + "node_id": 1169, + "label": 7, + "text": "Fabasoft:fabasoft fabasoft ag software manufacturer headquartered linz upper austria company established 1988 helmut fallmann leopold bauernfeind name fabasoft acronym fallmann bauernfeind software fiscal year fabasoft ag commences april 1 number employees respective reporting date march 31 increased recent years 100 staff 2003 185 2004 203 2005 corporate revenue also increased eur 16.94 million 2003/2004 fiscal year eur 21.85 million 2004/2005 eur 25.3 million 2005/2006 fiscal year 2006/2007 fiscal year revenue decreased eur 21.2 million eur 21.6 million recorded 2007/2008 fiscal year 2008/2009 fabasoft ag recorded revenue eur 20.02 million fiscal year 2009/2010 sales revenue eur 23.3 million fabasoft ag stocks listed prime standard frankfurt stock exchange since october 4 1999 fabasoft certified according iso 9001 iso 20000 iso 27001 type ii", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1170, + "label": 3, + "text": "The_Maze_of_Galious:maze galious sequel konami msx game knightmare majou densetsu original game overhead vertical scrolling shooter maze galious side-view flick-screen platform game player controls popolon aphrodite entering evil priest galious castle free yet-to-be-born son pampas priest evil clutches able control popolon aphrodite means player switch two characters slightly different abilities example popolon push stones open heavy doors hand aphrodite survives longer water shoot projectiles either character die visit shrine pay resurrection unlike typical platform games characters survive damage hit point bars game several types enemies strengths weaknesses monsters immune frontal attacks vulnerable fire ten different bosses fought defeating boss give player key used unlock doors boss areas in-game saving provided giving player encoded password", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1171, + "label": 4, + "text": "Email_authentication:email authentication email authentication validation collection techniques aimed providing verifiable information origin email messages validating domain ownership message transfer agents mta participated transferring possibly modifying message original base internet email simple mail transfer protocol smtp feature forged sender addresses emails practice known email spoofing widely used phishing email spam various types fraud combat large number competing email authentication proposals developed fairly recently three widely adopted \u2013 spf dkim dmarc results validation used automated email filtering assist recipients selecting appropriate action article cover user authentication email submission retrieval early 1980s simple mail transfer protocol smtp designed provided real verification sending user system problem email systems run trusted corporations universities since commercialization internet early 1990s spam phishing crimes increasingly involve email email authentication necessary first step towards identifying origin messages thereby making policies laws enforceable hinging domain ownership stance emerged early 2000 implies coarse-grained authentication given domains appear right part email addresses sign fine-grain authentication user level achieved means pretty good privacy s/mime present digital identity needs managed individual smtp defines message transport message content thus defines mail envelope parameters envelope sender header except trace information body message std 10 define smtp envelope std 11 define message header body formally referred internet message format smtp defines trace information message saved header using following two fields mail user agent mua knows outgoing mail smtp server configuration mta relay server typically determines server connect looking mx mail exchange dns resource record recipient domain name path depicted left reconstructed ground trace header fields host adds top header receives message important realize first lines top header usually trusted recipient fact lines written machines recipient administrative management domain admd act upon explicit mandate contrast lines prove involvement b well purported author mua could counterfeit created c. codice_1 field shown epoch-making piece header codice_2 written e mail delivery agent mda based message envelope additional trace fields designed email authentication populate top header normally messages sent author admd go directly destination mx b \u2192 figures sender admd add authentication tokens message goes boxes common cases schematized follows spf allows receiver check email claimed come specific domain comes ip address authorized domain administrators usually domain administrator authorize ip addresses used outbound mtas including proxy smarthost ip address sending mta guaranteed valid transmission control protocol establishes connection checking remote host reachable receiving mail server receives codice_3 smtp command soon connection set codice_4 beginning message contain domain name spf verifier queries domain name system dns matching spf record exists specify ip addresses authorized domain administrator result pass fail intermediate result systems generally take account anti-spam filtering dkim checks message content deploying digital signatures rather using digital certificates keys signature-verification distributed via dns way message gets associated domain name dkim-compliant domain administrator generates one pairs asymmetric keys hands private keys signing mta publishes public keys dns dns labels structured codice_5 selector identifies key pair codice_6 fixed keyword followed signing domain name publication occurs authority domain admd injecting message smtp transport system signing mta creates digital signature covers selected fields header body beginning signature cover substantive header fields codice_7 codice_8 codice_9 codice_10 added message header trace field number relays receive forward message every hop signature verified retrieving public key dns long intermediate relays n't modify signed parts message dkim-signatures remain valid dmarc allows specification policy authenticated messages built top two existing mechanisms sender policy framework spf domainkeys identified mail dkim allows administrative owner domain publish policy dns records specify mechanism dkim spf employed sending email domain check codice_7 field presented end users receiver deal failures reporting mechanism actions performed policies range methods proposed either deprecated yet gained widespread support included sender id certified server validation domainkeys adsp allows specification policy messages signed author domain message go dkim authentication first adsp demand punishing treatment message signed author domain \u2014as per codice_7 header field adsp record codice_13 published dns label codice_14 adsp designed domains heavily abused phishing similar fraud may want forgo mail facilities mailing lists non delivery reports happen remain unsigned exchange cut abuse adsp demoted historic november 2013 vbr adds vouch already authenticated identity method requires globally recognized authorities certify reputation domains sender apply reference vouching authority reference accepted published dns branch managed authority vouched sender add codice_15 header field messages sends also add dkim signature use authentication method spf receiver validating sender identity verify vouch claimed codice_15 looking reference applications avoid using method means authentication nevertheless often carried results written codice_1 header field besides tcp information required smtp specification ip reverse confirmed looking ip address name found indication ip set properly dns reverse resolution range ip addresses delegated admd uses remain managed network provider latter case useful identity related message obtained rfc 8601 defines trace header field codice_18 receiver record results email authentication checks carried multiple results multiple methods reported field separated semicolons wrapped appropriate example following field purportedly written codice_19 reports spf dkim results first token field name codice_19 id authentication server token known authserv-id receiver supporting rfc 8601 responsible remove rename false header claiming belong domain downstream filters get confused however filters still need configured know identities domain may use mail user agent mua slightly harder learn identities trust since users receive email multiple domains\u2014e.g. multiple email addresses -\u2014 domains could let codice_18 fields pass looked neutral way malicious sender forge authserv-id user would trust message arrived different domain legitimate codice_18 typically appears codice_1 field domain message relayed additional codice_1 fields may appear top header message got transferred internally servers belonging trusted admd internet assigned numbers authority maintains registry email authentication parameters parameters need registered though example local policy values designed site internal use correspond local configuration need registration hand header field meant report results based data already present message data retrieved third parties global reputation systems compliant rfc 7601 example attempt register add dnswl results field rejected basis", + "neighbors": [ + 167, + 229, + 285, + 425, + 608, + 617, + 701, + 762, + 1172, + 1249, + 1395, + 1446, + 1510, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 1172, + "label": 4, + "text": "DNSBL:dnsbl domain name system-based blackhole list dnsbl real-time blackhole list rbl effort stop email spamming blacklist locations internet reputed send email spam locations consist ip addresses often used publish addresses computers networks linked spamming mail server software configured reject flag messages sent site listed one lists term blackhole list sometimes interchanged term blacklist blocklist dnsbl software mechanism rather specific list policy dozens dnsbls existence use wide array criteria listing delisting addresses may include listing addresses zombie computers machines used send spam internet service providers isps willingly host spammers sent spam honeypot system since creation first dnsbl 1998 operation policies lists frequently controversial internet advocacy occasionally lawsuits many email systems operators users consider dnsbls valuable tool share information sources spam others including prominent internet activists objected form censorship addition small number dnsbl operators target lawsuits filed spammers seeking lists shut first dnsbl real-time blackhole list rbl created 1997 first border gateway protocol bgp feed paul vixie dnsbl eric ziegast part vixie mail abuse prevention system maps dave rand abovenet first subscriber first version rbl published dnsbl rather list networks transmitted via bgp routers owned subscribers network operators could drop tcp/ip traffic machines used send spam host spam supporting services website inventor technique later commonly called dnsbl eric ziegast employed vixie enterprises term blackhole refers networking black hole expression link network drops incoming traffic instead forwarding normally intent rbl sites using would refuse traffic sites supported spam \u2014 whether actively sending spam ways address would listed rbl volunteers maps staff would attempt repeatedly contact persons responsible get problems corrected effort considered important blackholing network traffic also meant spammers spam supporting isps could delay put rbl long periods discussions went later rbl also released dnsbl form paul vixie encouraged authors sendmail mail software implement rbl support clients allowed mail software query rbl reject mail listed sites per-mail-server basis instead blackholing traffic soon advent rbl others started developing lists different policies one first alan brown open relay behavior-modification system orbs used automated testing discover list mail servers running open mail relays\u2014exploitable spammers carry spam orbs controversial time many people felt running open relay acceptable scanning internet open mail servers could abusive 2003 number dnsbls came denial-of-service attacks dos since party admitted attacks discovered responsible purpose matter speculation however many observers believe attacks perpetrated spammers order interfere dnsbls operation hound shutting august 2003 firm osirusoft operator several dnsbls including one based spews data set shut lists suffering weeks near-continuous attack technical specifications dnsbls came relatively late rfc5782 uniform resource identifier uri dnsbl dnsbl lists domain names sometimes also ip addresses found clickable links contained body spams generally found inside legitimate messages uri dnsbls created determined much spam made past spam filters short time frame first use spam-sending ip address point sending ip address first listed major sending-ip-based dnsbls many cases elusive spams contain links domain names ip addresses collectively referred uris uri already spotted previously caught spam uri found non-spam e-mail therefore spam filter extracts uris message checks uri dnsbl spam blocked even sending ip spam yet listed sending ip dnsbl three major uri dnsbls oldest popular surbl surbl created volunteers surbl started second major uri dnsbl uribl 2008 another long-time surbl volunteer started another uri dnsbl ivmuri spamhaus project provides spamhaus domain block list dbl describe domains found spam messages dbl intended uribl rhsbl checked domains message envelope headers domains urls message bodies unlike uribls dbl lists domain names ip addresses since spamhaus provides lists ip addresses uri dnsbls often confused rhsbls right hand side bls different uri dnsbl lists domain names ips found body message rhsbl lists domain names used reply-to e-mail address rhsbls debatable effectiveness since many spams either use forged addresses use addresses containing popular freemail domain names gmail.com yahoo.com hotmail.com uri dnsbls widely used rhsbls effective used majority spam filters operate dnsbl requires three things domain host nameserver domain list addresses publish possible serve dnsbl using general-purpose dns server software however typically inefficient zones containing large numbers addresses particularly dnsbls list entire classless inter-domain routing netblocks large resource consumption using software designed role domain name server role-specific software applications designed specifically servers role dns blacklist hard part operating dnsbl populating addresses dnsbls intended public use usually specific published policies listing means must operated accordingly attain sustain public confidence mail server receives connection client wishes check client dnsbl let say dnsbl.example.net less following looking address dnsbl thus similar looking reverse-dns differences dnsbl lookup uses rather ptr record type uses forward domain dnsbl.example.net rather special reverse domain in-addr.arpa informal protocol addresses returned dnsbl queries match dnsbls return address 127.0.0.0/8 ip loopback network address 127.0.0.2 indicates generic listing addresses block may indicate something specific listing\u2014that indicates open relay proxy spammer-owned host etc details see rfc 5782 uri dnsbl query rhsbl query fairly straightforward domain name query prepended dns list host follows dnslist.example.com dns list host example.net queried domain generally record returned name listed different dnsbls different policies dnsbl policies differ one another three fronts addition different types listed entities ip addresses traditional dnsbls host domain names rhsbls uris uribls wide range semantic variations lists listing means list maintainers divided issues whether listings seen statements objective fact subjective opinion lists best used result definitive taxonomy dnsbls names defined e.g yellow nobl varieties widespread use names widespread use recognized many spam control specialists end-users organizations concerns regarding concept dnsbls specifics created used criticisms include despite criticisms people object principle mail-receiving sites able reject undesired mail systematically one person john gilmore deliberately operates open mail relay gilmore accuses dnsbl operators violating antitrust law number parties electronic frontier foundation peacefire raised concerns use dnsbls isps one joint statement issued group including eff peacefire addressed stealth blocking isps use dnsbls spam-blocking techniques without informing clients spammers pursued lawsuits dnsbl operators similar grounds", + "neighbors": [ + 229, + 285, + 311, + 363, + 617, + 620, + 678, + 780, + 1094, + 1144, + 1171, + 1249, + 1395, + 1446, + 1510 + ], + "mask": "Test" + }, + { + "node_id": 1173, + "label": 9, + "text": "LFE_(programming_language):lfe programming language lisp flavored erlang lfe functional concurrent garbage collected general-purpose programming language lisp dialect built core erlang erlang virtual machine beam lfe builds erlang provide lisp syntax writing distributed fault-tolerant soft real-time non-stop applications lfe also extends erlang support metaprogramming lisp macros improved developer experience feature-rich read\u2013eval\u2013print loop repl lfe actively supported recent releases erlang oldest version erlang supported r14 initial work lfe began 2007 robert virding started creating prototype lisp running erlang work focused primarily parsing exploring implementation might look like version control system used time tracking exact initial dates somewhat problematic virding announced first release lfe erlang questions mail list march 2008 release lfe limited handle recursive codice_1s codice_2s codice_3 codice_4 also support lisp shell initial development lfe done version r12b-0 erlang dell xps laptop robert virding stated several reasons started lfe programming language like lisp lfe expression-oriented language unlike non-homoiconic programming languages lisps make little syntactic distinction expressions statements code data written expressions lfe brought homoiconicity erlang vm lfe list data type written elements separated whitespace surrounded parentheses example list whose elements integers atom values implicitly typed respectively two integers lisp-specific data type called symbolic atom need declared seen example lfe expressions written lists using prefix notation first element list name form i.e. function operator macro remainder list arguments lfe-erlang operators used way expression evaluates 42 unlike functions erlang lfe arithmetic operators lisp variadic n-ary able take number arguments lfe lambda like common lisp also however lambda-match account erlang pattern-matching abilities anonymous function calls section represent complete comparison erlang lfe give taste erlang lfe erlang lfe idiomatic functional style erlang lfe erlang lfe using cons literal instead constructor form erlang lfe erlang lfe calls erlang functions take form module function arg1 ... argn using recursion define ackermann function defun ackermann composing functions message-passing erlang light-weight processes defmodule messenger-back multiple simultaneous http requests", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1174, + "label": 3, + "text": "Branch_predictor:branch predictor computer architecture branch predictor digital circuit tries guess way branch e.g if\u2013then\u2013else structure go known definitively purpose branch predictor improve flow instruction pipeline branch predictors play critical role achieving high effective performance many modern pipelined microprocessor architectures x86 two-way branching usually implemented conditional jump instruction conditional jump either taken continue execution first branch code follows immediately conditional jump taken jump different place program memory second branch code stored known certain whether conditional jump taken taken condition calculated conditional jump passed execution stage instruction pipeline see fig 1 without branch prediction processor would wait conditional jump instruction passed execute stage next instruction enter fetch stage pipeline branch predictor attempts avoid waste time trying guess whether conditional jump likely taken taken branch guessed likely fetched speculatively executed later detected guess wrong speculatively executed partially executed instructions discarded pipeline starts correct branch incurring delay time wasted case branch misprediction equal number stages pipeline fetch stage execute stage modern microprocessors tend quite long pipelines misprediction delay 10 20 clock cycles result making pipeline longer increases need advanced branch predictor first time conditional jump instruction encountered much information base prediction branch predictor keeps records whether branches taken taken encounters conditional jump seen several times base prediction history branch predictor may example recognize conditional jump taken often taken every second time branch prediction branch target prediction branch prediction attempts guess whether conditional jump taken branch target prediction attempts guess target taken conditional unconditional jump computed decoding executing instruction branch prediction branch target prediction often combined circuitry static prediction simplest branch prediction technique rely information dynamic history code executing instead predicts outcome branch based solely branch instruction early implementations sparc mips two first commercial risc architectures used single-direction static branch prediction always predict conditional jump taken always fetch next sequential instruction branch jump evaluated found taken instruction pointer get set non-sequential address cpus evaluate branches decode stage single cycle instruction fetch result branch target recurrence two cycles long machine always fetches instruction immediately taken branch architectures define branch delay slots order utilize fetched instructions advanced form static prediction presumes backward branches taken forward branches backward branch one target address lower address technique help prediction accuracy loops usually backward-pointing branches taken often taken processors allow branch prediction hints inserted code tell whether static prediction taken taken intel pentium 4 accepts branch prediction hints feature abandoned later intel processors static prediction used fall-back technique processors dynamic branch prediction dynamic predictors sufficient information use motorola mpc7450 g4e intel pentium 4 use technique fall-back static prediction decisions made compile time execution program dynamic branch prediction uses information taken taken branches gathered run-time predict outcome branch using random pseudorandom bit pure guess would guarantee every branch 50 correct prediction rate improved worsened reordering instructions simplest static prediction assume take compilers reorder instructions get better 50 correct prediction also would make timing much nondeterministic superscalar processors mips r8000 alpha 21264 alpha 21464 ev8 fetch line instructions pointer next line next-line predictor handles branch target prediction well branch direction prediction next-line predictor points aligned groups 2 4 8 instructions branch target usually first instruction fetched initial instructions fetched wasted assuming simplicity uniform distribution branch targets 0.5 1.5 3.5 instructions fetched discarded respectively since branch generally last instruction aligned group instructions taken branch delay slot discarded assuming uniform distribution branch instruction placements 0.5 1.5 3.5 instructions fetched discarded discarded instructions branch destination lines add nearly complete fetch cycle even single-cycle next-line predictor 1-bit saturating counter essentially flip-flop records last outcome branch simple version dynamic branch predictor possible although accurate 2-bit saturating counter state machine four states branch evaluated corresponding state machine updated branches evaluated taken change state toward strongly taken branches evaluated taken change state toward strongly taken advantage two-bit counter scheme one-bit scheme conditional jump deviate twice done past prediction changes example loop-closing conditional jump mispredicted rather twice original non-mmx intel pentium processor uses saturating counter though imperfect implementation spec'89 benchmarks large bimodal predictors saturate 93.5 correct every branch maps unique counter predictor table indexed instruction address bits processor fetch prediction every instruction instruction decoded two-level branch predictor also referred correlation-based branch predictor uses two-dimensional table counters also called pattern history table table entries two-bit counters codice_1 statement executed three times decision made third execution might depend upon whether previous two taken scenarios two-level adaptive predictor works efficiently saturation counter conditional jumps taken every second time regularly recurring pattern predicted well saturating counter two-level adaptive predictor remembers history last n occurrences branch uses one saturating counter possible 2 history patterns method illustrated figure 3 consider example n 2 means last two occurrences branch stored two-bit shift register branch history register four different binary values 00 01 10 11 zero means taken one means taken pattern history table contains four entries per branch one 2 4 possible branch histories entry table contains two-bit saturating counter type figure 2 branch branch history register used choosing four saturating counters use history 00 first counter used history 11 last four counters used assume example conditional jump taken every third time branch sequence 001001001 ... case entry number 00 pattern history table go state strongly taken indicating two zeroes comes one entry number 01 go state strongly taken indicating 01 comes zero case entry number 10 entry number 11 never used never two consecutive ones general rule two-level adaptive predictor n-bit history predict repetitive sequence period n-bit sub-sequences different advantage two-level adaptive predictor quickly learn predict arbitrary repetitive pattern method invented t.-y yeh yale patt university michigan since initial publication 1991 method become popular variants prediction method used modern microprocessors local branch predictor separate history buffer conditional jump instruction may use two-level adaptive predictor history buffer separate conditional jump instruction pattern history table may separate well may shared conditional jumps intel pentium mmx pentium ii pentium iii local branch predictors local 4-bit history local pattern history table 16 entries conditional jump spec'89 benchmarks large local predictors saturate 97.1 correct global branch predictor keep separate history record conditional jump instead keeps shared history conditional jumps advantage shared history correlation different conditional jumps part making predictions disadvantage history diluted irrelevant information different conditional jumps uncorrelated history buffer may include bits branch many branches may use two-level adaptive predictor scheme better saturating counter scheme large table sizes rarely good local prediction history buffer must longer order make good prediction size pattern history table grows exponentially size history buffer hence big pattern history table must shared among conditional jumps two-level adaptive predictor globally shared history buffer pattern history table called gshare predictor xors global history branch pc gselect concatenates global branch prediction used amd processors intel pentium core core 2 silvermont-based atom processors alloyed branch predictor combines local global prediction principles concatenating local global branch histories possibly bits program counter well tests indicate via nano processor may using technique agree predictor two-level adaptive predictor globally shared history buffer pattern history table additional local saturating counter outputs local global predictors xored give final prediction purpose reduce contentions pattern history table two branches opposite prediction happen share entry pattern history table agree predictor used first version intel pentium 4 later abandoned hybrid predictor also called combined predictor implements one prediction mechanism final prediction based either meta-predictor remembers predictors made best predictions past majority vote function based odd number different predictors scott mcfarling proposed combined branch prediction 1993 paper spec'89 benchmarks predictor good local predictor predictors like gshare use multiple table entries track behavior particular branch multiplication entries makes much likely two branches map table entry situation called aliasing turn makes much likely prediction accuracy suffer branches multiple predictors beneficial arrange predictor different aliasing patterns likely least one predictor aliasing combined predictors different indexing functions different predictors called gskew predictors analogous skewed associative caches used data instruction caching conditional jump controls loop best predicted special loop predictor conditional jump bottom loop repeats n times taken n-1 times taken conditional jump placed top loop taken n-1 times taken conditional jump goes many times one way way detected loop behavior conditional jump predicted easily simple counter loop predictor part hybrid predictor meta-predictor detects whether conditional jump loop behavior indirect jump instruction choose among two branches processors specialized indirect branch predictors newer processors intel amd predict indirect branches using two-level adaptive predictor kind instruction contributes one bit history buffer zec12 later z/architecture processors ibm support instruction preload branch predictor entry given instruction branch target address constructed adding contents general-purpose register immediate displacement value processors without mechanism simply predict indirect jump go target last time function normally return called return instruction indirect jump reads target address call stack many microprocessors separate prediction mechanism return instructions mechanism based so-called return stack buffer local mirror call stack size return stack buffer typically 4 16 entries trade-off fast branch prediction good branch prediction sometimes dealt two branch predictors first branch predictor fast simple second branch predictor slower complicated bigger tables override possibly wrong prediction made first predictor alpha 21264 alpha ev8 microprocessors used fast single-cycle next-line predictor handle branch target recurrence provide simple fast branch prediction next-line predictor inaccurate branch resolution recurrence takes long cores two-cycle secondary branch predictors override prediction next-line predictor cost single lost fetch cycle intel core i7 two branch target buffers possibly two branch predictors machine learning branch prediction using lvq multi-layer perceptrons called neural branch prediction proposed lucian vintan lucian blaga university sibiu one year later developed perceptron branch predictor neural branch predictor research developed much daniel jimenez 2001 first perceptron predictor presented feasible implement hardware first commercial implementation perceptron branch predictor amd piledriver microarchitecture main advantage neural predictor ability exploit long histories requiring linear resource growth classical predictors require exponential resource growth jimenez reports global improvement 5.7 mcfarling-style hybrid predictor also used gshare/perceptron overriding hybrid predictors main disadvantage perceptron predictor high latency even taking advantage high-speed arithmetic tricks computation latency relatively high compared clock period many modern microarchitectures order reduce prediction latency jimenez proposed 2003 fast-path neural predictor perceptron predictor chooses weights according current branch path rather according branch pc many researchers developed concept a. seznec m. monchiero d. tarjan k. skadron v. desmet akkary et al. k. aasaraai michael black etc state-of-the-art branch predictors using perceptron predictor see intel championship branch prediction competition intel already implements idea one ia-64 simulators 2003 amd ryzen multi-core processor infinity fabric samsung exynos processor include perceptron based neural branch predictor ibm 7030 stretch designed late 1950s pre-executes unconditional branches conditional branches depended index registers conditional branches first two production models implemented predict untaken subsequent models changed implement predictions based current values indicator bits corresponding today condition codes stretch designers considered static hint bits branch instructions early project decided misprediction recovery provided lookahead unit stretch part stretch reputation less-than-stellar performance blamed time required misprediction recovery subsequent ibm large computer designs use branch prediction speculative execution ibm 3090 1985 two-bit predictors introduced tom mcwilliams curt widdoes 1977 lawrence livermore national lab s-1 supercomputer independently jim smith 1979 cdc microprogrammed processors popular 1960s 1980s beyond took multiple cycles per instruction generally require branch prediction however addition ibm 3090 several examples microprogrammed designs incorporated branch prediction burroughs b4900 microprogrammed cobol machine released around 1982 pipelined used branch prediction b4900 branch prediction history state stored back in-memory instructions program execution b4900 implements 4-state branch prediction using 4 semantically equivalent branch opcodes represent branch operator type opcode used indicated history particular branch instruction hardware determines branch prediction state particular branch needs updated rewrites opcode semantically equivalent opcode hinted proper history scheme obtains 93 hit rate others granted scheme vax 9000 announced 1989 microprogrammed pipelined performs branch prediction first commercial risc processors mips r2000 r3000 earlier sparc processors trivial not-taken branch prediction use branch delay slots fetched one instruction per cycle execute in-order performance loss later r4000 uses trivial not-taken branch prediction loses two cycles taken branch branch resolution recurrence four cycles long branch prediction became important introduction pipelined superscalar processors like intel pentium dec alpha 21064 mips r8000 ibm power series processors rely one-bit simple bimodal predictors dec alpha 21264 ev6 uses next-line predictor overridden combined local predictor global predictor combining choice made bimodal predictor amd k8 combined bimodal global predictor combining choice another bimodal predictor processor caches base choice bimodal predictor counters bits l2 cache otherwise used ecc result effectively large base choice predictor tables parity rather ecc instructions l2 cache parity design sufficient since instruction suffering parity error invalidated refetched memory alpha 21464 ev8 cancelled late design minimum branch misprediction penalty 14 cycles use complex fast next-line predictor overridden combined bimodal majority-voting predictor majority vote bimodal two gskew predictors 2018 catastrophic security vulnerability called spectre made public google project zero researchers affecting virtually modern cpus vulnerability involves extracting private data leftover data caches branch mispredictions", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 214, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 681, + 719, + 738, + 752, + 776, + 800, + 803, + 821, + 846, + 893, + 907, + 918, + 937, + 946, + 979, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1219, + 1220, + 1222, + 1256, + 1262, + 1263, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1175, + "label": 0, + "text": "William_J._Barry:william j. barry william john barry born 1943 ireland one leading phoneticians germany came germany early years mainly educated university kiel renowned german phonetician klaus j. kohler 1992 appointed chair phonetics saarland university principal research areas speech synthesis rhythm segmental structures application linguistics questions pronunciation learning speech-language pathology speech technology general william j. barry innovative productive research close cooperation institute computational linguistics saarland university well german research center artificial intelligence also saarbruecken made saarbruecken institute phonetics outstanding pillar science europe 2007 w. j. barry held chair 16th international congress phonetic sciences icphs became emeritus professor 2008 barry currently council member international phonetic association editor phonus journal publications resulted cooperation researchers", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1176, + "label": 3, + "text": "MediaTek:mediatek mediatek inc. taiwanese fabless semiconductor company provides chips wireless communications high-definition television handheld mobile devices like smartphones tablet computers navigation systems consumer multimedia products digital subscriber line services well optical less disc drives headquartered hsinchu taiwan company 25 offices worldwide third largest fabless ic designer worldwide 2016 since founding 1997 mediatek creating chipsets global market mediatek also provides customers reference designs mediatek originally unit united microelectronics corporation umc tasked designing chipsets home entertainment products 28 may 1997 unit spun incorporated mediatek inc. listed taiwan stock exchange tsec 2454 code 23 july 2001 company started designing chipsets optical drives subsequently expanded chips dvd players digital tvs mobile phones smartphones tablets general mediatek strong record gaining market share displacing competitors entering new markets company launched division design products mobile devices 2004 seven years later taking orders 500 million mobile system-on-chip units per annum included products feature phones smart devices providing extensive system engineering assistance company allowed many smaller companies new entrants enter mobile phone market previously dominated large often vertically integrated corporations long broadly entrenched telecommunications industry mobile chip market quickly became main growth driver company mobile world congress 2014 mediatek unveiled new brand \u201c everyday genius \u201d dubbing term \u201c super-mid market \u201d vision aiming make smartphones accessible affordable wider market november 2014 1500 mobile models accounting 700 million units shipped globally 2014 using mediatek chips company posted revenues us 5.3 billion first half 2014 nearly much whole 2013 revenue growth however partly due revenue recognition acquisition mstar became effective beginning 2014 2005 mediatek acquired inprocomm wireless semiconductor design company producing 802.11a b a/g chips september 10 2007 mediatek announced intention buy analog devices cellular radio baseband chipset divisions us 350 million acquisition finalised january 11 2008 5 may 2011 mediatek acquired ralink technology corporation gaining products expertise wi-fi technology mobile non-mobile applications well wired dsl ethernet connectivity 11 april 2012 mediatek acquired coresonic global producer digital signal processing products based link\u00f6ping sweden coresonic became wholly owned subsidiary mediatek europe 22 june 2012 mediatek announced would acquire rival taiwanese chipset designer mstar semiconductor inc. held strong market share position digital television chips initial phase deal saw mediatek taking 48 percent stake option purchase remaining stake later date following merger mediatek mstar delayed antitrust concerns china south korea finalized 1 february 2014 mediatek financial results subject variation financial success different product lines fluctuated mediatek relatively strong sales 2009/2010 based strong market position feature phone chipsets smartphone tablet products contributed mediatek sales income increase 2013 revenue recognition acquisition mstar semiconductor became effective february 2014 well continuing strong position smartphone tablet solutions main reasons sales growth seen 2014 2014 smartphone chips accounted approximately 50\u201355 revenue followed digital home products 25\u201330 includes digital television chips tablet chips 5\u201310 feature phone chips 5\u201310 wi-fi products 5\u201310 mediatek started shipping chips integrated 4g lte baseband volume second half 2014 later largest competitor qualcomm additional cost separate baseband chip required every 4g handset made mediatek offerings expensive prompted larger customers like alcatel one touch zte choose competing socs like qualcomm snapdragon 400 410 platforms negatively affecting mediatek revenue stream mediatek stock trading taiwan stock exchange symbol mediatek often followed industry-first strategy differentiate competition mt8135 system-on-chip soc tablets announced july 2013 industry first chip implement new arm big.little technology heterogeneous multi-processing variant mt8135 used amazon kindle fire hd tablet models also november 20 2013 mediatek launched mt6592 soc first system-on-chip soc eight cpu cores could used simultaneously contrast competing socs eight physical cores subset could active given time true octa-core trademark registered emphasize difference marketing materials 7 january 2014 mediatek announced development world first multimode receiver wireless charging contrast existing implementations compatible inductive resonant charging resulting mt3188 wireless charging chip certified power matters alliance wireless power consortium announced february 24 2014 25 february 2014 mediatek announced industry first five-in-one wireless chip soc mt6630 supports 802.11a/b/g/n/ac wifi bluetooth ant+ gps fm radio mediatek collaborated google first ultra hd tv platform android tv resulting development mt5595 digital television soc product first shipped lcd tv models made sony list devices using mediatek socs armv5 list devices using mediatek socs armv7 dual core list devices using mediatek socs armv7 quad core list devices using mediatek socs armv7 hexa core list devices using mediatek socs armv8 quad core list devices using mediatek socs armv8 octa core list devices using mediatek tablet processors consumer electronics show january 2015 mediatek announced mt2601 wearable devices based google \u2019 android wear software according mediatek small size allows fewer components lower current consumption compared chipsets market chip includes dual-core arm cortex-a7 cpu arm mali-400 mp gpu allows display resolutions qhd 960x540 combined mt6630 chip wireless connectivity mediatek mt2621 mt2625 two soc build lte nb-iot modems mt2625 launched 29 june 2017 mt2621 added 24 november mt6630 2014 five-in-one combo wireless soc integrating dual-band 802.11a/b/g/n/ac advanced wi-fi direct miracast support bluetooth 4.1 ant+ tri-band gps fm transceiver intended paired chips like mt6595 octa-core smartphone processor features integrated 4g modem built-in wi-fi/bluetooth/gps/fm functionality could also used tablets conjunction stand-alone application processor global navigation satellite system gnss modules result merger ralink mediatek added wireless network interface controllers ieee 802.11-standards socs mips cpus product portfolio consumer electronics show january 2015 mediatek announced mt5595 new digital television soc support google android tv platform adopted sony new lcd tv models", + "neighbors": [ + 112, + 162, + 214, + 571, + 607, + 622, + 853, + 917, + 988, + 1016, + 1069, + 1178, + 1262, + 1278, + 1305, + 1384, + 1488, + 1507, + 1591, + 1602 + ], + "mask": "Validation" + }, + { + "node_id": 1177, + "label": 2, + "text": "User-Mode_Driver_Framework:user-mode driver framework user-mode driver framework umdf device-driver development platform first introduced microsoft windows vista operating system also available windows xp facilitates creation drivers certain classes devices standard device drivers difficult write must handle wide range system device states particularly multithreaded software environment badly written device drivers cause severe damage system e.g. bsod data corruption since standard drivers high privileges accessing kernel directly user-mode driver framework insulates kernel problems direct driver access instead providing new class driver dedicated application programming interface user level interrupts memory management error occurs new framework allows immediate driver restart without impacting system particularly useful devices intermittently connected system support hot swapping via bus technology usb firewire according microsoft umdf drivers simpler write debug kernel-mode drivers however umdf would used performance-intensive highly stateful devices first version umdf shipped part windows media player version 10 2004-10-12 code-named crescent designed support media transfer protocol driver public interfaces documentation provided later microsoft decided turn umdf device driver development platform umdf driver dll based microsoft component object model com however umdf use com loading unloading controlling concurrency uses com programming pattern example exploiting com iunknown interface startup umdf calls dllgetclassobject get pointer iclassfactory interface driver uses createinstance method iclassfactory interface create instance driver callback object driver object instance framework-provided iwdfdriver interface driver provides set callbacks via idriverentry com interface main entry point driver customization", + "neighbors": [ + 28, + 268, + 412, + 435, + 472, + 521, + 689, + 815, + 1068, + 1138, + 1151, + 1417, + 1428, + 1502, + 1547, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1178, + "label": 3, + "text": "Apple_A5X:apple a5x apple a5x 32-bit system-on-a-chip soc designed apple inc. introduced launch third generation ipad march 7 2012 high performance variant apple a5 apple claims twice graphics performance a5 superseded iphone 5 5c a6 chip fourth generation ipad a6x chip software updates ipad 3rd generation ended 2016 thus ceasing support chip a5x features dual-core arm cortex-a9 cpu 1 ghz quad-core powervr sgx543mp4 gpu clocked 250 mhz apple doubled size a5x memory interface comparison a5 including memory interface subsystem four 32-bit wide lp-ddr2 memory controllers done provide sufficient bandwidth high pixel count third generation ipad retina display unlike a4 a5 a5x covered metal heat spreader package-on-package pop assembly earlier chips ram sat top soc however a5x ram bundled together soc instead a5x sits one side motherboard twin samsung lp ddr2 sdram soldered directly side motherboard a5x manufactured 45 nm process samsung silicon die size increased drastically compared a5 165 mm 3.1 times larger 53.3 mm die area original a4", + "neighbors": [ + 33, + 71, + 75, + 99, + 112, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 853, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 988, + 1001, + 1069, + 1100, + 1140, + 1147, + 1176, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1518, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1179, + "label": 4, + "text": "Partimage:partimage partimage disk cloning utility linux/unix environments partimage save partitions many formats disk image utilities partimage useful number situations commonly encountered network administrators well advanced computer users maintain systems last stable release 2010 since one partimage authors worked fsarchiver broader functionality partimage common uses partimage follows windows users partimage includes experimental support ntfs partimage supports common linux file systems found many linux distributions including debian live distros ping knoppix systemrescuecd notable features include compression disk image files support backup/restore network file server data encryption partimage uses newt gui partimage limited cloning partitions supported filesystem types includes ext2 ext3 reiserfs fat12 fat16 fat16b fat32 hpfs jfs xfs ufs hfs ntfs partimage support ext4 btrfs", + "neighbors": [ + 34, + 134, + 171, + 272, + 326, + 494, + 528, + 796, + 961, + 1138, + 1157, + 1252, + 1369 + ], + "mask": "Test" + }, + { + "node_id": 1180, + "label": 9, + "text": "CLISP:clisp computing clisp implementation programming language common lisp originally developed bruno haible michael stoll atari st. today supports unix microsoft windows operating systems clisp includes interpreter bytecode compiler debugger socket interface high-level foreign language interface strong internationalization support two object systems common lisp object system clos metaobject protocol mop written c common lisp part gnu project free software available terms gnu general public license gpl haible originally intend distribute clisp gpl well-publicised email exchange richard stallman eventually agreed issue stake whether clisp derivative work gnu readline library clisp extremely portable running almost unix-based operating systems well microsoft windows although interpreting bytecode usually slower running compiled native binaries always major issue especially applications like web development i/o bottleneck clisp also easier set popular foss common lisps sbcl paul graham used clisp run software viaweb startup viaweb early web application portions still exist yahoo stores base yahoo shopping conrad barski land lisp uses clisp-specific functions textbook exercises", + "neighbors": [ + 27, + 46, + 194, + 203, + 209, + 251, + 292, + 301, + 306, + 308, + 313, + 323, + 332, + 360, + 392, + 412, + 446, + 447, + 488, + 503, + 506, + 536, + 565, + 601, + 649, + 653, + 753, + 787, + 796, + 806, + 825, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 1021, + 1118, + 1119, + 1123, + 1138, + 1173, + 1190, + 1207, + 1245, + 1246, + 1251, + 1269, + 1277, + 1298, + 1315, + 1372, + 1375, + 1385, + 1389, + 1413, + 1430, + 1466, + 1509, + 1516, + 1588, + 1609 + ], + "mask": "Train" + }, + { + "node_id": 1181, + "label": 4, + "text": "Timing_attack:timing attack cryptography timing attack side-channel attack attacker attempts compromise cryptosystem analyzing time taken execute cryptographic algorithms every logical operation computer takes time execute time differ based input precise measurements time operation attacker work backwards input information leak system measurement time takes respond certain queries much information help attacker depends many variables cryptographic system design cpu running system algorithms used assorted implementation details timing attack countermeasures accuracy timing measurements etc timing attacks often overlooked design phase dependent implementation introduced inadvertently compiler optimizations avoidance timing attacks involves design constant-time functions careful testing final executable code timing attack example attack exploits data-dependent behavioral characteristics implementation algorithm rather mathematical properties algorithm many cryptographic algorithms implemented masked proxy way reduces eliminates data dependent timing information consider implementation every call subroutine always returns exactly x seconds x maximum time ever takes execute routine every possible authorized input implementation timing algorithm leaks information data supplied invocation downside approach time used executions becomes worst-case performance function timing attacks practical many cases execution time square-and-multiply algorithm used modular exponentiation depends linearly number 1 bits key number 1 bits alone nearly enough information make finding key easy repeated executions key different inputs used perform statistical correlation analysis timing information recover key completely even passive attacker observed timing measurements often include noise sources network latency disk drive access differences access access error correction techniques used recover transmission errors nevertheless timing attacks practical number encryption algorithms including rsa elgamal digital signature algorithm 2003 boneh brumley demonstrated practical network-based timing attack ssl-enabled web servers based different vulnerability use rsa chinese remainder theorem optimizations actual network distance small experiments attack successfully recovered server private key matter hours demonstration led widespread deployment use blinding techniques ssl implementations context blinding intended remove correlations key encryption time versions unix use relatively expensive implementation crypt library function hashing 8-character password 11-character string older hardware computation took deliberately measurably long time much two three seconds cases login program early versions unix executed crypt function login name recognized system leaked information timing validity login name even password incorrect attacker could exploit leaks first applying brute-force produce list login names known valid attempt gain access combining names large set passwords known frequently used without information validity login names time needed execute approach would increase orders magnitude effectively rendering useless later versions unix fixed leak always executing crypt function regardless login name validity two otherwise securely isolated processes running single system either cache memory virtual memory communicate deliberately causing page faults and/or cache misses one process monitoring resulting changes access times likewise application trusted paging/caching affected branching logic may possible second application determine values data compared branch condition monitoring access time changes extreme examples allow recovery cryptographic key bits 2017 meltdown spectre attacks forced cpu manufacturers including intel amd arm ibm redesign cpus rely timing attacks early 2018 almost every computer system world affected spectre making powerful example timing attack history following visual basic code demonstrates typical insecure string comparison stops testing soon character n't match example comparing abcde abxde return 3 loop iterations function insecurecompare stra string strb string length integer boolean end function comparison following version runs constant-time testing characters using bitwise operations test without conditional jumps function securecompare stra string strb string length integer boolean end function timing attacks easier mount adversary knows internals hardware implementation even cryptographic system use since cryptographic security never depend obscurity either see security obscurity specifically shannon maxim kerckhoffs principle resistance timing attacks either nothing else exemplar purchased reverse engineered timing attacks side-channel attacks may also useful identifying possibly reverse-engineering cryptographic algorithm used device", + "neighbors": [ + 32, + 78, + 104, + 174, + 284, + 289, + 382, + 633, + 800, + 969, + 986, + 995, + 1071, + 1186, + 1235, + 1240, + 1351, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1182, + "label": 8, + "text": "Toonimo:toonimo toonimo web-based solution offers on-site user assistance via online walkthroughs toonimo cloud-based digital walkthrough platform helps guide users website funnels toonimo works overlaying human voice audio graphical coachmarks web pages guide orient web users features include analytics dashboard a/b testing functionality personalization suite company serves financial insurance healthcare telecommunication education travel hospitality industries b2b b2b2c situations toonimo founded 2013 dan kotlicki ceo headquarters 1216 broadway new york city ny additional office located tel aviv israel july 14 2014 toonimo announced raised 2.5 million funding continue r ramp marketing sales efforts additional 1 million raised venture investment december 20 2014 toonimo backed lightspeed venture partners real life innovations several private investors", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1183, + "label": 2, + "text": "Android_Runtime:android runtime android runtime art application runtime environment used android operating system replacing dalvik process virtual machine originally used android art performs translation application bytecode native instructions later executed device runtime environment android 2.2 froyo brought trace-based just-in-time jit compilation dalvik optimizing execution applications continually profiling applications time run dynamically compiling frequently executed short segments bytecode native machine code dalvik interprets rest application bytecode native execution short bytecode segments called traces provides significant performance improvements unlike dalvik art introduces use ahead-of-time aot compilation compiling entire applications native machine code upon installation eliminating dalvik interpretation trace-based jit compilation art improves overall execution efficiency reduces power consumption results improved battery autonomy mobile devices time art brings faster execution applications improved memory allocation garbage collection gc mechanisms new applications debugging features accurate high-level profiling applications maintain backward compatibility art uses input bytecode dalvik supplied standard .dex files part apk files .odex files replaced executable linkable format elf executables application compiled using art on-device utility run solely compiled elf executable result art eliminates various application execution overheads associated dalvik interpretation trace-based jit compilation downside art requires additional time compilation application installed applications take slightly larger amounts secondary storage usually flash memory store compiled code android 4.4 kitkat brought technology preview art including alternative runtime environment keeping dalvik default virtual machine subsequent major android release android 5.0 lollipop dalvik entirely replaced art android 7.0 nougat introduced jit compiler code profiling art lets constantly improve performance android apps run jit compiler complements art current ahead time compiler helps improve runtime performance", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 292, + 298, + 306, + 322, + 347, + 422, + 429, + 502, + 503, + 704, + 775, + 782, + 837, + 1044, + 1061, + 1082, + 1138, + 1159, + 1185, + 1231, + 1276, + 1310, + 1335, + 1372, + 1411, + 1414, + 1419, + 1480, + 1483, + 1500, + 1511, + 1569, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1184, + "label": 0, + "text": "Interactive_Terminology_for_Europe:interactive terminology europe interactive terminology europe iate interinstitutional terminology database european union project launched 1999 objective creating web-based interface eu terminology resources make information easily available ensure standardisation throughout eu institutions used eu institutions agencies since summer 2004 public user interface released testing early 2007 officially opened 28 june 2007 new version released 7 november 2018 following full rebuild system state-of-the-art technologies latest software development standards best practices usability accessibility new look feel iate incorporated existing terminology databases eu \u2019 translation services one interinstitutional database containing approximately 1.4 million multilingual entries following legacy databases imported iate iate intended contain single entry per concept actually contains multiple entries many concepts entries consolidated number entries fallen approximately 1.4 million approximately 1.2 million despite addition many new entries new previously unrecorded concepts project partners european commission european parliament council european union european court justice european court auditors european economic social committee european committee regions european central bank european investment bank translation centre bodies european union iate web site administered eu translation centre luxembourg behalf project partners subject 'domains based eurovoc entire iate glossary database downloaded free zipped format multilanguage glossaries generated using free tool", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1185, + "label": 2, + "text": "Android_Gingerbread:android gingerbread android gingerbread seventh version android codename android mobile operating system developed google released december 2010 versions longer supported gingerbread release introduced support near field communication nfc \u2014used mobile payment solutions\u2014and session initiation protocol sip \u2014used voip internet telephony gingerbread user interface refined many ways making easier master faster use power-efficient simplified color scheme black background gave vividness contrast notification bar menus user interface components improvements menus settings resulted easier navigation system control nexus smartphone released december 2010 first phone google nexus line ran gingerbread also first one line built-in nfc functionality statistics issued google indicate 0.3 android devices accessing google play run gingerbread new features introduced gingerbread include following", + "neighbors": [ + 24, + 34, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 264, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 887, + 936, + 1061, + 1082, + 1183, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1448, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1186, + "label": 4, + "text": "TLBleed:tlbleed tlbleed cryptographic side-channel attack uses machine learning exploit timing side-channel via translation look-aside buffer tlb modern microprocessors use simultaneous multithreading attack demonstrated experimentally intel processors speculated processors may also potentially vulnerable variant attack proof concept demonstrated recent news amd indicates processors vulnerable attack attack led openbsd project disabling simultaneous multithreading intel microprocessors openbsd project leader theo de raadt stated attack could theoretically addressed preventing tasks different security contexts sharing physical cores fix currently impractical complexity problem", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 379, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 633, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1013, + 1043, + 1063, + 1162, + 1181, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1187, + "label": 6, + "text": "Inode:inode inode index node data structure unix-style file system describes file-system object file directory inode stores attributes disk block location object data file-system object attributes may include metadata times last change access modification well owner permission data directories lists names assigned inodes directory contains entry parent children uncertainty linux kernel mailing list reason inode 2002 question brought unix pioneer dennis ritchie replied paper published 1978 ritchie ken thompson strongly suggests etymology also maurice j. bach writes file system relies data structures files beside file content former called metadata \u2014data describes data file associated inode identified integer number often referred i-number inode number inodes store information files directories folders file ownership access mode read write execute permissions file type many types file system implementations maximum number inodes fixed file system creation limiting maximum number files file system hold typical allocation heuristic inodes file system one percent total size inode number indexes table inodes known location device inode number kernel file system driver access inode contents including location file thus allowing access file file inode number found using codice_1 command codice_1 command prints i-node number first column report unix-style file systems reiserfs omit inode table must store equivalent data order provide equivalent capabilities data may called stat data reference codice_3 system call provides data programs file names directory implications operating system kernel in-memory representation data called codice_4 linux systems derived bsd use term codice_5 v vnode referring kernel virtual file system layer posix standard mandates file-system behavior strongly influenced traditional unix file systems inode denoted phrase file serial number defined per-file system unique identifier file file serial number together device id device containing file uniquely identify file within whole system within posix system file following attributes may retrieved codice_3 system call make sense store small files inode save space data block needed look-up time disk access needed file system feature called inlining strict separation inode file data thus longer assumed using modern file systems data file fits space allocated pointers data space conveniently used example ext2 successors stores data symlinks typically file names way data 60 bytes fast symbolic links ext4 file system option called inline_data enabled file system creation allows ext4 perform inlining inode size limited works small files", + "neighbors": [ + 1, + 9, + 22, + 34, + 37, + 40, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 233, + 265, + 278, + 322, + 353, + 365, + 380, + 387, + 434, + 438, + 443, + 465, + 583, + 650, + 664, + 720, + 721, + 754, + 797, + 884, + 891, + 908, + 912, + 935, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1224, + 1234, + 1252, + 1301, + 1304, + 1391, + 1394, + 1415, + 1441, + 1456, + 1530, + 1546, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1188, + "label": 3, + "text": "Timeline_of_DOS_operating_systems:timeline dos operating systems article presents timeline events history x86 dos disk operating systems 1973 2016 operating systems named dos generally part scope timeline dos releases forms", + "neighbors": [ + 22, + 42, + 85, + 234, + 236, + 292, + 306, + 322, + 353, + 359, + 365, + 412, + 413, + 429, + 434, + 503, + 564, + 639, + 670, + 689, + 728, + 735, + 755, + 868, + 870, + 897, + 907, + 920, + 940, + 941, + 957, + 961, + 1009, + 1022, + 1024, + 1027, + 1050, + 1110, + 1138, + 1139, + 1196, + 1213, + 1221, + 1263, + 1287, + 1304, + 1372, + 1394, + 1445, + 1503, + 1578, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1189, + "label": 2, + "text": "Cocoa_(API):cocoa api", + "neighbors": [ + 33, + 99, + 107, + 117, + 121, + 134, + 258, + 275, + 306, + 308, + 345, + 394, + 395, + 412, + 477, + 509, + 551, + 567, + 594, + 596, + 623, + 625, + 653, + 682, + 686, + 696, + 796, + 797, + 805, + 815, + 919, + 927, + 945, + 961, + 1001, + 1068, + 1100, + 1138, + 1140, + 1190, + 1221, + 1225, + 1227, + 1233, + 1235, + 1251, + 1298, + 1311, + 1322, + 1334, + 1339, + 1373, + 1407, + 1423, + 1502, + 1536, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 1190, + "label": 2, + "text": "GNUstep:gnustep gnustep free software implementation cocoa formerly openstep objective-c frameworks widget toolkit application development tools unix-like operating systems microsoft windows part gnu project gnustep features cross-platform object-oriented ide apart default objective-c interface gnustep also bindings java ruby gnu guile scheme gnustep developers track additions apple cocoa remain compatible roots gnustep application interface roots cocoa nextstep openstep gnustep thus predates cocoa emerged apple acquired next technology incorporated development original mac os x gnustep initially effort gnu developers replicate technically ambitious nextstep programmer-friendly features gnustep began paul kunz others stanford linear accelerator center wanted port hippodraw nextstep another platform instead rewriting hippodraw scratch reusing application design decided rewrite nextstep object layer application depended first version libobjcx enabled port hippodraw unix systems running x window system without changing single line application source openstep specification released public 1994 decided write new objcx would adhere new apis software would become known gnustep gnustep contains set graphical control elements written objective-c programming language graphical user interface gui gnumail composed graphics control elements gnumail interact windowing system e.g x11 wayland graphical user interface rendered gnustep backend provides small set functions used user interface library interface actual windowing system also rendering engine emulates common postscript functions package gnustep-back provides following backends gnustep inherits design principles proposed openstep gnustep predates cocoa cocoa based openstep well objective-c language examples applications written ported gnustep foundation kit provides basic classes wrapper classes data structure classes application kit provides classes oriented around graphical user interface capabilities", + "neighbors": [ + 99, + 117, + 134, + 209, + 258, + 301, + 306, + 308, + 323, + 356, + 394, + 477, + 509, + 567, + 653, + 682, + 686, + 796, + 797, + 806, + 815, + 816, + 825, + 961, + 985, + 1027, + 1068, + 1100, + 1123, + 1138, + 1180, + 1189, + 1221, + 1225, + 1227, + 1233, + 1235, + 1251, + 1298, + 1311, + 1385, + 1407, + 1413, + 1415, + 1430, + 1502, + 1509, + 1536, + 1621 + ], + "mask": "Train" + }, + { + "node_id": 1191, + "label": 2, + "text": "How_does_one_patch_KDE2_under_FreeBSD?:one patch kde2 freebsd one patch kde2 freebsd internet meme russian internet culture question originally posted anime channel rusnet irc network may 8 2004 original post followed translation \u0437\u0434\u0440\u0430\u0432\u0441\u0442\u0432\u0443\u0439\u0442\u0435 \u044d\u0442\u043e \u043a\u0430\u043d\u0430\u043b \u043e\u0431 \u0430\u043d\u0438\u043c\u0435 -- \u0434\u0430 -- \u043a\u0430\u043a \u043c\u043d\u0435 \u043f\u0440\u043e\u043f\u0430\u0442\u0447\u0438\u0442\u044c kde2 \u043f\u043e\u0434 freebsd hello anime channel \u2014 yes \u2014 patch kde2 freebsd first question rhetorical satirized disproportionate amount technical geeky conversations often occurring channel nothing anime later popularized became widely cited russophone chats 2006 phenomenon first received public attention asked many people prior july 6 online conference russian president vladimir putin due provoking campaigns became third popular question proposed asked conference first preved vladimir vladimirovich regard medved however hosts ask question 2007 revived number one frequently asked question similar conference president kazakhstan nursultan nazarbayev nazarbayev answered question seriously describing developments industry kazakhstan possible use open-source software december 2007 question became popular one preceding internet conference ukrainian president viktor yushchenko gave answer saying programmers secretariat able help patch kde2 different operating systems also recommended adoption newer software possible reference existence kde3 time february 2014 openbsd ports developer gave overview linux vacation eastern europe conference belarus patch kde4 openbsd reviving long-lived meme new light", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1192, + "label": 1, + "text": "Merchant_Navy_(United_Kingdom):merchant navy united kingdom merchant navy maritime register united kingdom comprises seagoing commercial interests uk-registered ships crews merchant navy vessels fly red ensign regulated maritime coastguard agency mca king george v bestowed title merchant navy british merchant shipping fleets following service first world war number nations since adopted title merchant navy existence significant period english british history owing growth trade imperial expansion dated back 17th century attempt made register seafarers source labour royal navy times conflict registration merchant seafarers failed successfully implemented 1835 merchant fleet grew successive years become world foremost merchant fleet benefiting considerably trade british possessions india far east lucrative trades sugar contraband opium china spices tea carried ships cutty sark helped entrench dominance 19th century first second world wars merchant service suffered heavy losses german u-boat attacks policy unrestricted warfare meant merchant seafarers risk attack enemy ships tonnage lost u-boats first world war around 7,759,090 tons around 14,661 merchant seafarers killed honour sacrifice made merchant seafarers first world war george v granted title merchant navy companies 1928 george v gave edward prince wales title master merchant navy fishing fleets retained accession throne january 1936 relinquished abdication december since edward viii title held sovereigns george vi elizabeth ii united kingdom british empire entered second world war september 1939 george vi issued message anxious days would like express officers men british merchant navy british fishing fleets confidence unfailing determination play vital part defence one would say task less essential people experience allotted navy army air force upon nation depends much foodstuffs raw materials transport troops overseas long glorious history proud bear title master merchant navy fishing fleets know carry duties resolution fortitude high chivalrous traditions calling safe hands god keep prosper great task second world war german u-boats sank nearly 14.7 million tons allied shipping amounted 2,828 ships around two thirds total allied tonnage lost united kingdom alone suffered loss 11.7 million tons 54 total merchant navy fleet outbreak second world war 32,000 merchant seafarers killed aboard convoy vessels war along royal navy convoys successfully imported enough supplies allow allied victory honour sacrifices made two world wars merchant navy lays wreaths remembrance alongside armed forces annual remembrance day service 11 november following many years lobbying bring official recognition sacrifices made merchant seafarers two world wars since merchant navy day became official day remembrance 3 september 2000 ensigns displayed stern vessel displayed gaff yardarm red ensigns defaced flown warrant onboard vessel house flags personal designed company displayed port halyard yardarm despite maintaining dominant position many decades decline british empire rise use flag convenience foreign competition led decline merchant fleet example 1939 merchant navy largest world 33 total tonnage 2012 merchant navy \u2014 yet still remaining one largest world \u2014 held 3 total tonnage 2010 merchant navy consisted 504 uk registered ships addition uk merchant marine interests possessed 308 ships registered countries 271 foreign-owned ships registered uk 2012 british merchant marine interests consisted 1,504 ships included ships either directly uk-owned parent-owned managed british company amounted alternatively according annual maritime shipping statistics provided british government department transport signatory stcw convention uk ships commanded deck officers engineering officers officers undergo 3 years training known cadetship one approved maritime colleges united kingdom include warsash maritime academy south tyneside college fleetwood plymouth university city glasgow college cadets usually choice two academic routes foundation degree higher national diploma successful completion results qualification marine operations marine engineering generally costs cadetship met sponsorship uk shipping company three years training cadets also go sea period year usually spread across cadetship affords practical education along academic time college prepares candidate separate final oral exam oral exam carried master mariner office maritime coastguard agency successful completion oral exam result award certificate competency international qualification issued uk government allows officer work qualified capacity onboard ship certificates issued different ranks officer usually return complete subsequent series studies reach highest qualification first uk deck officer certificates competency issued 1845 conducted final oral exam master mariner training regime officers set official syllabus merchant navy training board training still encompasses traditional trades celestial navigation ship stability general cargo seamanship includes training business legislation law computerisation deck officers marine engineering principles workshop technology steam propulsion motor diesel propulsion auxiliaries mechanics thermodynamics engineering drawing ship construction marine electrics well practical workshop training engineering officers historically person wishing become captain master prior 1973 five choices attend one three elite naval schools age 12 fixed-base hms conway hms worcester pangbourne nautical college would automatically lead apprenticeship seagoing cadet officer apply one several training programmes elsewhere go sea immediately applying directly merchant shipping company age 17 would three years prior training four years without seagoing experience aboard ship work-clothes mates deck crew direction bo'sun cleaning bilges chipping paint polishing brass cement washing freshwater tanks holystoning teak decks studying navigation seamanship bridge uniform direction officer taking exams become second mate historically composition crew uk ships diverse characteristic extant shipping companies trade extent british empire availability crew different ports one ship might largely british crew another might crew composed many indians chinese african sailors crews outside britain usually drawn areas ship traded far east trading ships either singapore hong kong crews banana boats west indian crews ships trading west africa southern africa african crews ships trading indian ocean including east africa crews indian subcontinent crews made recruits britain commonly used ships trading across north atlantic south america australia new zealand traditionally still ships crew run bosun overseen responsible deck officer usually chief mate ship may also different sub-departments galley radio department hospitality services overseen chief cook radio officer chief steward many roles changed ships crews become smaller commercial shipping ships radio department disappeared along radio officer colloquially known 'sparks replaced changes technology requirement stcw convention deck officers hold individual certification gmdss system electro-technical officers eto also serve aboard ships trained fix maintain complex systems number notable merchant navy personnel include members uk merchant navy awarded victoria cross george cross george medal distinguished service order distinguished service cross actions serving merchant navy canadian philip bent ex-british merchant navy joined british army outbreak world war victoria cross members merchant navy served either world war also received relevant campaign medals second world war many merchant navy members received king commendation brave conduct lloyd london awarded lloyd war medal bravery sea 541 merchant navy personnel bravery 1939\u201345 many royal humane society medals awards conferred merchant navy seafarers acts humanity war peacetime september 2016 uk government introduced merchant navy medal meritorious service medal awarded serving served merchant navy fishing fleets uk isle man channel islands exemplary service devotion duty rewarding set outstanding example others first state award meritorious service history merchant navy recipients must nominated someone least two written letters support normally required completed 20 years service merchant navy although exceptional circumstances may less british merchant navy consists various private shipping companies decades many companies come gone merged changed name changed owners british shipping represented nationally globally uk chamber shipping headquartered london list british shipping companies past present", + "neighbors": [ + 451 + ], + "mask": "Test" + }, + { + "node_id": 1193, + "label": 2, + "text": "Windows_XP_editions:windows xp editions windows xp released several editions since original release 2001 windows xp available many languages addition add-ons translating user interface also available certain languages first two editions released microsoft windows xp home edition designed home users windows xp professional designed business power users windows xp professional offers number features unavailable home edition including march 2004 european commission fined microsoft \u20ac497 million \u00a3395 million 784 million ordered company provide version windows without windows media player commission concluded microsoft broke european union competition law leveraging near monopoly market pc operating systems onto markets work group server operating systems media players unsuccessful appeals 2004 2005 microsoft reached agreement commission would release court-compliant version windows xp edition n. version include company windows media player instead encourages users pick download media player microsoft wanted call version reduced media edition eu regulators objected suggested edition n name n signifying media player home professional editions windows xp sold price version windows media player included dell hewlett-packard lenovo fujitsu siemens chosen stock product however dell offer operating system short time consumer interest low roughly 1,500 units shipped oems reported sales consumers n editions windows xp also include windows movie maker microsoft made available separate download december 2005 korean fair trade commission ordered microsoft make available editions windows xp windows server 2003 contain windows media player windows messenger like european commission decision decision based grounds microsoft abused dominant position market push products onto consumers unlike decision however microsoft also forced withdraw non-compliant versions windows south korean market k kn editions windows xp home edition professional edition released august 2006 available english korean editions contain links third-party instant messenger media player software edition windows xp home intended sale certain low-cost netbooks appear labeled windows xp home edition ulcpc ulcpc standing ultra-low-cost personal computer version comes preinstalled oem solutions providing desktops blade pc hardware addition copy windows xp professional includes remote desktop license windows xp starter edition lower-cost version windows xp available thailand vietnam turkey indonesia india philippines russia colombia brazil argentina peru bolivia chile mexico ecuador uruguay malaysia venezuela similar windows xp home limited low-end hardware run 3 programs time features either removed disabled default according microsoft press release windows xp starter edition low-cost introduction microsoft windows xp operating system designed first-time desktop pc users developing countries starter edition includes special features certain markets consumers may computer literate found home edition include localised help features may speak english country-specific computer wallpaper screensavers default settings designed easier use typical windows xp installations malaysian version example contains desktop background kuala lumpur skyline addition starter edition also unique limitations prevent displacing expensive versions windows xp three applications run starter edition application may open maximum three windows maximum screen resolution 1024\u00d7768 support workgroup networking domains addition starter edition licensed low-end processors like intel celeron amd duron sempron also 512 mb limit main memory 120 gb disk size limit microsoft made clear however total disk space per partition per disk also fewer options customizing themes desktop taskbar october 9 2006 microsoft announced reached milestone 1 million units windows xp starter edition sold mass market however starter edition much success many markets available pirated versions higher end versions windows popular legal counterparts markets non-genuine copies xp professional obtained mall stores typically charge amount cds/dvds taken files original retail value unlicensed copies windows xp professional typically cost 0.70 since uses 1 cd compared around 30 properly licensed copy xp starter edition code-named freestyle development first released september 2002 initial release available solely conjunction computers included media center capabilities could purchased separately first major update released 2004 distributed tier 1 oems previously sold windows xp media center edition pc updated 2005 first edition available system builders many features windows xp media center edition 2005 including screen dancers auto playlist dj high end visual screen savers taken windows xp plus packages originally shipped add-ons windows xp enhance users experience windows xp machine preview version windows xp media center edition microsoft ehome division shown ces 2002 final version released july 2002 2005 release microsoft focused efforts building new media center features home premium ultimate editions windows vista windows 7 windows media center built-in unlike releases windows xp media center edition available retail purchase without necessary hardware notable feature unique edition windows media center provides large-font remotely accessible interface 10-foot user interface television viewing computer well recording playback tv guide dvd playback video playback photo viewing music playback unlike competing commercial digital video recorder products microsoft charge monthly subscription fee media center tv guide service due strict hardware requirements microsoft sell media center edition retail markets alongside home professional editions microsoft distributes msdn subscribers oem system builders certain countries consumers generally purchase media center pre-installed new computer reseller sells oem versions microsoft software media center edition consumer-oriented edition windows xp updated new features annual basis five-year development windows vista mce 2005 release example includes update windows movie maker supports burning dvds new visual style called royale support media center extenders soundspectrum g-force sound visualizations microsoft also released remote control receiver infrared blaster mce 2005 new specially designed wireless computer keyboard mce 2005 released september 2005 using media center extenders xbox 360 media center edition also able connect stream recorded tv music pictures network connection media center edition retains features included windows xp professional simply add-on professional installed provided valid mce product key setup professional features left including remote desktop encrypting file system however ability join active directory domain removed marketed home product need domain support one value registry needed circumvent restriction installation mce 2005 in-place upgrade previous version already joined domain ability retained unless user uses windows media center extender case ability lost restored presumably microsoft introduced limit media center extender devices introduced version rely fast user switching component component must disabled order join domain media center higher hardware requirements editions windows xp mce 2005 requires least 1.6 ghz processor directx 9.0 hardware-accelerated gpu ati radeon 9 series nvidia geforce fx series higher 256 mb system ram functionality media center extender support use multiple tuners hdtv playback/recording carries higher system requirements media center much restricted range hardware supports software dvr solutions media center tuners must standardized driver interface originally required hardware mpeg-2 encoder closed caption support number features media center remote controls standardized terms button labels functionality degree general layout edition intended specially designed notebook/laptop computers called tablet pcs windows xp tablet pc edition compatible pen-sensitive screen supporting handwritten notes portrait-oriented screens except msdn volume license subscribers windows xp tablet edition could purchased separately tablet pc edition superset windows xp professional difference tablet functionality including alternate text input tablet pc input panel basic drivers support tablet pc specific hardware requirements install tablet pc edition include tablet digitizer touchscreen device hardware control buttons including ctrl-alt-delete shortcut button scrolling buttons least one user-configurable application button two releases service pack 2 windows xp includes tablet pc edition 2005 free upgrade version brought improved handwriting recognition improved input panel allowing used almost every application input panel also revised extend speech recognition services input correction applications windows xp tablet pc edition based windows xp professional includes software features provided addition includes following components following downloadable packs released microsoft add functionality windows xp tablet pc edition utilizes ink object means data input storage data type created part windows xp tablet pc edition api allows users manipulate process handwritten data including recognition results cases pressure information part stroke properties ink changed much way properties objects data saved allow future reference many applications referencing ink object also allow handwritten notes filtered searched based recognition results stored ink saved integrated operating system tablet pc input panel tip allows handwriting converted text use non-full-screen applications integrated handwriting recognition windows xp tablet pc edition 2005 recognize print cursive mixed writing accuracy increased configuring recognizer expect left-handed writing right-handed writing recognition variety languages available install recognizer pack handwriting engine trained recognize particular handwriting style user must modify handwriting better recognized system order use feature effectively speech recognition functionality also incorporated tablet input panel compared previous versions substantially improved speech recognition engine version 6 also ships office 2003 tutorial microphone wizard training modules included possible dictate text using speech certain supported applications control windows gui applications using speech although accuracy improvements made windows vista surpass features update windows xp tablet pc edition containing ink analysis stylusinput api support introduced windows vista also available 2006 microsoft made available two additional editions windows xp home edition hardware manufacturers wanted provide subscription-based pay go-based models selling computers editions named windows xp home edition subscription computers windows xp home edition prepaid computers respectively part microsoft flexgo initiative described company-issued press release making pcs accessible dramatically reducing entry cost enabling customers pay computer use purchase prepaid cards market trials starting first emerging markets inadequate access consumer credit unpredictable income high entry costs prevent many consumers purchasing computer editions targeted towards emerging markets india brazil hungary vietnam editions contain additional components enforce subscription models via metering metering typically enforced hardware component prevent tampering installation windows operates normal mode limited access mode hardware locked mode depending state subscription computer positive time balance operates normal mode functions regular windows xp home edition machine time balance expires machine operate limited access mode amount time set hardware manufacturer five hours default entering hardware locked mode limited access mode screen uses high-contrast low-resolution display settings hardware locked mode operating system disabled entirely message displayed boot-up instructions re-enable machine two distinct editions windows xp released support 64-bit hardware windows xp 64-bit edition designed run intel itanium family microprocessors native ia-64 mode two versions windows xp 64-bit edition released edition discontinued january 2005 hewlett-packard last distributor itanium-based workstations stopped selling itanium systems marketed 'workstations july 2005 windows xp 64-bit edition longer supported security updates made available windows xp 64-bit edition marketed itanium version microsoft windows xp editions instead separate edition made solely itanium processor 64-bit instructions mostly analogous windows xp professional numerous older technologies dao jet database ntvdm windows windows longer present support ms-dos win16 applications absent original version also lacks media applications windows media player netmeeting windows movie maker integrated cd burning although wmp netmeeting added 2003 version similar ability previous alternate architecture ports windows windows nt 4.0 powerpc mips r4x00 alpha run 16-bit x86 code via windows windows windows xp 64-bit edition run standard x86 32-bit applications wow64 windows-on-windows 64-bit emulation layer original itanium processor contains on-chip ia-32 decoder deemed far slow serious use running 400 mhz microsoft intel wrote software 32 64-bit translator dubbed ia-32 execution layer allows real time translation x86 32-bit instructions ia-64 instructions allowing 32-bit applications run albeit significantly slowly native code edition supports x86-64 extension intel ia-32 architecture x86-64 implemented amd amd64 found amd opteron athlon 64 chips selected sempron processors implemented intel intel 64 formerly known ia-32e em64t found intel pentium 4 intel later chips released april 25 2005 windows xp professional x64 edition uses version 5.2.3790.1830 core operating system binaries version used windows server 2003 sp1 latest versions operating system development even service packs updates windows xp x64 windows server 2003 x64 distributed unified packages much manner windows 2000 professional server editions x86 initial development phases 2003\u20132004 windows xp professional x64 edition named windows xp 64-bit edition x86 extended systems later windows xp 64-bit edition extended systems opposed 64-bit edition itanium systems rtm version windows xp professional x64 edition based windows server 2003 service pack 1 codebase reason service pack 2 windows xp x64 edition released march 13 2007 service pack 2 32-bit versions windows xp fact due earlier release date 32-bit version many key features introduced service pack 2 32-bit x86 editions windows xp already present rtm version 64-bit x86-64 counterpart service pack 2 first last released service pack windows xp professional x64 edition windows xp professional x64 edition uses technology named windows-on-windows 64-bit wow64 permits execution 32-bit x86 applications first employed windows xp 64-bit edition itanium reused x64 editions windows xp windows server 2003 since x86-64 architecture includes hardware-level support 32-bit instructions wow64 switches processor 32- 64-bit modes according microsoft 32-bit software running wow64 similar performance executing 32-bit windows fewer threads possible overheads 32-bit processes shown *32 task manager 64-bit processes extra text present although 32-bit applications run transparently mixing two types code within process allowed 64-bit application link 32-bit library dll similarly 32-bit application link 64-bit library may lead need library developers provide 32- 64-bit binary versions libraries windows xp x64 edition includes 32- 64-bit versions internet explorer 6 order allow possibility third-party browser plugins activex controls may yet available 64-bit versions older 32-bit drivers services supported 64-bit windows video audio codecs xvid oggds 32-bit dlls supported long media player uses 32-bit well 64-bit windows include ntvdm windows windows native support execution ms-dos 16-bit windows applications written windows 3.1 primary benefit moving 64-bit increase maximum allocatable virtual memory single standard process 32-bit windows operating system limited total 2,093,056 kilobytes 2gb minus one 4kb page large address aware 32-bit processes allocate 4gb windows xp x64 support much memory although theoretical memory limit 64-bit computer address 16exabytes windows xp x64 limited 128gb physical memory 8 terabytes virtual memory per process practical limit usually size pagefile windows xp professional x64 edition windows xp 64-bit edition version 2003 releases windows xp include internet information services 6.0 matches version shipped windows server 2003 versions xp include 5.1 64-bit versions windows xp also immune certain types viruses malware target 32-bit systems since system files 64-bit extra registers x86-64 architecture result performance improvements certain kinds applications often result slight decrease performance compared application implemented 32 bit x86 code running windows xp 32 bit editions microsoft released number editions windows xp targeted towards developers embedded devices use specific consumer electronics set-top boxes kiosks/atms medical devices arcade video games point-of-sale terminals voice internet protocol voip components editions belong windows embedded subfamilies windows xp embedded systems binary identical windows xp professional licensed embedded devices windows xp embedded commonly abbreviated xpe componentized version professional edition windows xp original equipment manufacturer free choose components needed thereby reducing operating system footprint also reducing attack area compared xp professional unlike windows ce microsoft operating system portable devices consumer electronics xp embedded provides full windows api support full range applications device drivers written microsoft windows system requirements state xpe run devices least 32 mb compact flash 32 mb ram p-200 microprocessor xpe released november 28 2001 october 2008 newest release windows xp embedded service pack 3 devices targeted xpe included automatic teller machines arcade games slot machines cash registers industrial robotics thin clients set-top boxes network attached storage nas time clocks navigation devices railroad locomotives etc custom versions os deployed onto anything full-fledged pc even though xpe supports hardware xp professional supports x86 architecture licensing restrictions prevent deployed standard pcs however microsoft made exceptions rule allowing xpe alongside standard oem install windows dell notebooks contain embedded xp installation part mediadirect 2.0 feature also found acer ones well samsung q1 windows embedded standard 2009 succeeded xpe 2h 2008 windows embedded standard 2009 derived windows xp embedded since microsoft time development componentized version windows vista windows embedded standard 2009 includes silverlight .net framework 3.5 internet explorer 7 windows media player 11 rdp 6.1 network access protection microsoft baseline security analyzer support managed windows server update services system center configuration manager windows embedded standard 7 succeeded windows embedded standard 2009 april 2010 componentized version windows 7 windows embedded point service wepos specialization windows xp embedded released may 25 2005 focuses point sale device market fuel pumps self checkout stations automated teller machines cash registers available purchase directly microsoft instead licensed original equipment manufacturers windows embedded posready 2009 succeeded wepos january 2009 windows embedded posready 2009 derived wepos since microsoft time development componentized version windows vista windows embedded posready 7 succeeded windows embedded posready 2009 july 2011 based windows 7 sp1 july 2006 microsoft introduced thin-client variant windows xp embedded called windows fundamentals legacy pcs targets older machines early original pentium available software assurance customers intended would like upgrade windows xp take advantage security management capabilities afford purchase new hardware windows thin pc succeeded windows fundamentals legacy pcs june 2011 based windows embedded standard 7 sp1", + "neighbors": [ + 26, + 85, + 101, + 108, + 111, + 113, + 148, + 162, + 211, + 270, + 295, + 298, + 337, + 359, + 412, + 433, + 435, + 457, + 520, + 521, + 527, + 638, + 647, + 755, + 776, + 815, + 910, + 961, + 1002, + 1016, + 1020, + 1051, + 1098, + 1140, + 1151, + 1287, + 1304, + 1338, + 1417, + 1503, + 1531, + 1555, + 1602, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1194, + "label": 8, + "text": "Business_process_network:business process network business process networks bpn also referred business service networks business process hubs enable efficient execution multi-enterprise operational processes including supply chain planning execution bpn extends implements organization service-orientation enterprise applications execute processes bpns combine integration services application services often support particular industry process order management logistics management automated shipping receiving others organizations derive primary value e.g. revenue attain goals outside 'four walls enterprise-\u2014by selling consumers b2c businesses b2b thus businesses seek efficiently manage processes span multiple organizations one process supply chain management bpns gaining popularity partly changing nature supply chains supply chains become truly global trends global sourcing offshoring asia india low-cost production regions world continue add complexity effective trading partner management supply chain visibility transition global sourcing challenging companies companies requisite strategies infrastructure extended process control effectively make transition global sourcing majority supply managers continue use mix e-mail phone fax collaborate offshore suppliers\u2014-none standardized easily integrated enable informed business decisions actions distant trading partners introduce new standards new systems multiple time zones new processes different levels technological maturity supply chain bpns help reduce complexity providing common framework information exchange visibility collaboration bpns also increasingly used enable manage operational business process outsourcing bpo functions human resources finance information technology \u2018 non-core \u2019 relative business business functions whereby bpn facilitates collaboration document movement organization outsourcing firm bpns implemented using host technology platforms including limited traditional edi value-added networks vans industry exchanges b2b gateways point point integration brokers vpns mechanisms enable trading partners connect electronically collaborate conduct business amongst bpns accelerated growth web services service-oriented architectures soa technologies simplify integration people processes systems business process networks often managed using multi-tenant architectures rapidly enable seamless many-to-many one-to-many hub-spoke model connectivity trading partners across extended supply chain multi-tenant frameworks also ensure trading partners work single shared set applications collaboration tools hosted network provider mitigating integration barriers hurdles heterogeneous back-end infrastructures systems across trading community vans industry exchanges bring added benefit pre-connected trading partners often ranging tens thousands enable faster trading community implementation lower overall cost manage maintain connections", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1195, + "label": 5, + "text": "Naver_Whale:naver whale naver whale hangul \ub124\uc774\ubc84 \uc6e8\uc77c south korean freeware web browser developed naver corporation also available english became available android april 13 2018 since browser based chromium since inception 2011 google chrome apps compatible browser pages translated naver papago service translate korean japanese many languages naver whale browser extensions accessed whale store", + "neighbors": [ + 14, + 83, + 95, + 107, + 258, + 277, + 427, + 509, + 530, + 531, + 582, + 623, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1210, + 1228, + 1280, + 1331, + 1376, + 1378, + 1408, + 1423, + 1528, + 1550, + 1569 + ], + "mask": "Test" + }, + { + "node_id": 1196, + "label": 4, + "text": "NEC:nec nec world fourth largest pc manufacturer 1990 nec semiconductors business unit worldwide semiconductor sales leader 1985 1990 second largest 1995 one top three 2000 one top 10 2006 remained one top 20 semiconductor sales leaders merging renesas electronics nec member sumitomo group nec 463 2017 fortune 500 list kunihiko iwadare takeshiro maeda established nippon electric limited partnership august 31 1898 using facilities bought miyoshi electrical manufacturing company iwadare acted representative partner maeda handled company sales western electric interest japanese phone market represented walter tenney carleton carleton also responsible renovation miyoshi facilities agreed partnership would reorganized joint-stock company treaty would allow july 17 1899 revised treaty japan united states went effect nippon electric company limited organized day western electric company become first japanese joint-venture foreign capital iwadare named managing director ernest clement carleton named directors maeda mototeru fujii assigned auditors iwadare maeda carleton handled overall management company started production sales maintenance telephones switches nec modernized production facilities construction mita plant 1901 mita shikokumachi completed december 1902 japanese ministry communications adopted new technology 1903 common battery switchboard supplied nec common battery switchboards powered subscriber phone eliminating need permanent magnet generator subscriber phone switchboards initially imported manufactured locally 1909 nec started exporting telephone sets china 1904 1905 iwadare visited western electric u.s. see management production control return japan discontinued oyakata system sub-contracting replaced new system managers employees direct employees company inefficiency also removed production process company paid higher salaries incentives efficiency new accounting cost controls put place time clocks installed 1899 1907 number telephone subscribers japan rose 35,000 95,000 nec entered china market 1908 implementation telegraph treaty japan china also entered korean market setting office seoul january 1908 period 1907 1912 sales rose 1.6 million yen 2 million yen expansion japanese phone service key part nec success period expansion take pause ministry communications delayed third expansion plan phone service march 1913 despite 120,000 potential telephone-subscribers waiting phone installations nec sales fell sixty percent 1912 1915 interim iwadare started importing appliances including electric fans kitchen appliances washing machines vacuum cleaners electric fans never seen japan imports intended prop company sales 1916 government resumed delayed telephone-expansion plan adding 75,000 subscribers 326,000 kilometers new toll lines thanks third expansion plan nec expanded time much rest japanese industry contracted 1919 nec started first association sumitomo engaging sumitomo densen seizosho manufacture cables part venture nec provided cable manufacturing equipment sumitomo densen rights western electrics duplex cable patents also transferred sumitomo densen great kant\u014d earthquake struck japan 1923 140,000 people killed 3.4 million left homeless four nec factories destroyed killing 105 nec engineers workers thirteen tokyo telephone offices destroyed fire telephone telegraph service interrupted damage telephone cables response ministry communications accelerated major programs install automatic telephone switching systems enter radio broadcasting first automatic switching systems strowger-type model made automatic telephone manufacturing co. atm united kingdom nec participated installation automatic switching systems ultimately becoming general sales agent atm nec developed strowger-type automatic switching system 1924 first japan one plants almost leveled kanto earthquake mita plant chosen support expanding production new three-story steel-reinforced concrete building built starting 1925 modeled western electric hawthorne works nec started radio communications business 1924 japan first radio broadcaster radio tokyo founded 1924 started broadcasting 1925 nec imported broadcasting equipment western electric expansion radio broadcasting osaka nagoya marked emergence radio industry nec established radio research unit 1924 nec started developing electron tubes 1925 1930 manufacturing first 500 w radio transmitter provided chinese xinjing station 100 kw radio broadcasting system 1934 photo-telegraphic equipment developed nec transmitted photos accession ceremony emperor hirohito ceremony held kyoto 1928 newspapers asahi shimbun mainichi shimbun competing cover ceremony asahi shimbun using siemens device mainichi planning use french photo-telegraphic equipment end papers acquired used nec product due faster transmission rate higher picture quality 1929 nippon electric provided japan ministry communications a-type switching system first systems developed japan nippon supplied japan ministry communications nonloaded line carrier equipment long distance telephone channels 1937 world war ii described company blackest days history 1938 mita tamagawa plants placed military control direct supervision military officers 1939 nippon electric established research laboratory tamagawa plant became first japanese company successfully test microwave multiplex communications december 22 1941 enemy property control law passed nec shares owned international standard electric corporation ise itt subsidiary western electric affiliate seized capital technical relations abruptly severed munitions company law passed october 1943 placing overall control nec plants military jurisdiction ueno plant leveled military attack march 1945 fire bombings april may heavily damaged tamagawa plant reducing capacity forty percent okayama plant totally destroyed bombing attack june year end war nec production substantially reduced damage facilities material personnel shortages war production slowly returned civilian use nec re-opened major plants end january 1946 nec began transistor research development 1950 started exporting radio-broadcast equipment korea first major postwar contract 1951 nec received deming prize excellence quality control 1952 computer research development began 1954 nec produced first crossbar switching system japan installed nippon telegraph telephone public corporation currently nippon telegraph telephone corporation ntt 1956 nec began joint research development ntt electronic switching systems year nec established taiwan telecommunication company first postwar overseas joint venture 1958 completed neac-1101 neac-1102 computers year 1959 nec demonstrated first transistorized computer neac-2201 demonstrated unesco automath show paris company began integrated circuit research development 1960 1963 nec started trading american depositary receipts ten million shares sold united states nippon electric new york nec america inc. incorporated year nec supplied kdd submarine cable systems laying pacific ocean 1964 supplied short-haul 24 channel pcm carrier transmission equipment ntt 1965 nec de mexico s. a. de c. v. nec brasil s. a. nec australia pty ltd. established 1968 1969 nec supplied comsat corporation spade satellite communications system 1971 1972 switzerland ordered nec satellite communications earth station year small transportable satellite communications earth station set china shares nec common stock listed amsterdam stock exchange 1973 nec also designed automated broadcasting system japan broadcasting corporation year nec electronics europe gmbh also established 1974 acos series computer introduced new central research laboratories completed 1975 1977 japan national space development agency launched nec geostationary meteorological satellite named himawari period nec introduced concept c c integration computers communications nec america inc. opened plant dallas texas manufacture pabx telephone systems 1978 also acquired electronic arrays inc. california year start semiconductor chip production united states 1980 nec created first digital signal processor nec \u00b5pd7710 nec semiconductors uk ltd. established 1981 producing vlsis lsis nec introduced 8-bit pc-8800 series personal computer 1981 followed 16-bit pc-9800 series 1982 1983 nec stock listed basel geneva zurich switzerland exchanges nec quickly became dominant leader japanese pc industry holding 80 market share nec changed english company name nec corporation year nec information systems inc. started manufacturing computers related products united states 1984 nec also released v-series processor year 1986 nec delivered sx-2 super computer houston advanced research center woodlands texas year neax61 digital switching system went service 1987 nec technologies uk ltd. established united kingdom manufacture vcrs printers computer monitors mobile telephones europe also year nec licensed technology hudson soft video game manufacturer create video game console called pc-engine later released 1989 turbografx-16 north american market successor pc-fx released japan 1994 pc-engine achieved considerable following said nec held much stronger influence video game industry role leading semiconductor manufacturer direct video game products nec usa inc. established 1989 holding company north american operations 1983 nec brasil brazilian subsidiary nec forced nationalise corporate stock orders brazilian military government whereby shareholder control nec brasil ceded private equity group brasilinvest brazilian investment banker m\u00e1rio garnero since nec brasil foundation 1968 become major supplier telecommunications equipment brazilian government 1986 minister communications ant\u00f4nio carlos magalh\u00e3es put nec brasil financial difficulties suspending government contract payments company whose main client federal government subsidiary crisis nec corporation japan sold nec brasil organiza\u00e7\u00f5es globo onemillion us dollars us 1,000,000 shortly thereafter magalh\u00e3es resumed government contracts corresponding payments nec brazil became valued 350million us dollars us 350,000,000 suspicions regarding nec-globo deal included among things unilateral breach contract globo founder roberto marinho regarding management regional television station brazilian state bahia took national stage 1992 first corruption charges impeached brazilian president fernando collor de mello organiza\u00e7\u00f5es globo subsequently sold shares nec brazil hit all-time high state monopoly years back nec corporation 1999 following break-up privatisation brazilian state-owned telephone monopoly telebr\u00e1s 1990 new head office building known super tower completed shiba tokyo additionally joint-venture agreements established manufacture market digital electronic switching systems lsis china 1993 nec asynchronous transfer mode atm switching system neax61 nippon electronic automatic exchange atm service node went service united states nec europe ltd. established holding company european operations year nec c c research laboratories nec europe ltd. opened germany 1994 nec china co ltd. established holding company chinese operations 1996 1997 nec developed 4gbit dram semiconductor group honored one first japan quality awards 1998 nec opened world advanced semiconductor r facility nec 1 personal computer vendor japan 1980s faced increasing competition fujitsu seiko epson ibm japan nevertheless early 1990s nec still largest well 50 market share japanese market competition heated later rival fujitsu started aggressively market computers industry standard x86 instead nec 1997 nec share reduced 35 nec celebrated 100th anniversary 1999 nec electronics corporation separated nec 2002 new semiconductor company nec laboratories america inc. nec labs started november 2002 merger nec research institute neci nec usa computer communications research laboratory ccrl nec built earth simulator computer esc fastest supercomputer world 2002 2004 since produced nec n343i 2006 2003 nec 20.8 market share personal computer market japan slightly ahead fujitsu 2007 nec nissan co. corp. started evaluating joint venture produce lithium ion batteries hybrid electric cars april 23 2009 renesas technology corp nec electronics corp struck basic agreement merge around april 2010 april 1 2010 nec electronics renesas technology merged forming renesas electronics set fourth largest semiconductor company according isuppli published data q3 2010 nec held 19.8 market share pc market japan january 27 2011 nec formed pc joint venture chinese pc maker lenovo fourth largest pc maker world part deal companies said statement establish new company called lenovo nec holdings b.v. registered netherlands nec receive us 175 million lenovo issuance lenovo shares lenovo unit 51 stake joint venture nec hold 49 stake february 2011 bloomberg news said joint venture would allow lenovo expand field servers nec masato yamamoto said nec would able grow china january 26 2012 nec corporation announced would cut 10,000 jobs globally due big loss nec consolidated financial statement line economic crisis europe lagged development smartphones domestic market compare apple samsung previously january 2009 nec cut 20,000 jobs mainly sluggish semiconductor liquid crystal display related businesses 2013 nec biggest pc server manufacturer japan 23.6 share august 2014 nec corporation commissioned build super-fast undersea data transmission cable linking united states japan consortium international companies consisting china mobile international china telecom global global transit google kddi singtel pipeline went online june 30 2016 april 2017 kemet corporation purchase 61 controlling interest nec tokin nec making nec tokin wholly owned subsidiary purchase complete company change name tokin corporation nec structured organization around three principal segments solutions network solutions electronic devices solutions business delivers computing solutions business enterprises government individual customers\u2014in form software hardware related services network solutions business designs provides broadband network systems mobile wireless communications network systems mobile handsets broadcast systems nec electronic devices business includes semiconductors displays electronic components nec produces versa notebooks international market lavie series japanese markets principal subsidiaries nec include defense products include achievements nec include nec ranked consistently top four companies previous five years number u.s. patents issued averaging 1764 year nec main title sponsor davis cup competition 2002 bnp paribas took sponsorship nec 1982 2012 sponsored nec cup go tournament japan nec 1986 2003 sponsored nec shun-ei go tournament young players japan nec sponsored english football club everton 1985 1995 1995 fa cup final triumph everton final game decade-long nec sponsorship danka took sponsors nec signed deal sponsor sauber f1 team 2011 season 2014 season nec signed new deal sponsor sahara force india f1 team 2015 season april 2013 nec became umbrella sponsor pga tour latinoam\u00e9rica third-tier men professional golf tour nec one sponsored v.league volleyball started works teams years came include professional players nec also used montedio yamagata football soccer j league sponsors along local companies", + "neighbors": [ + 17, + 85, + 162, + 206, + 211, + 227, + 322, + 359, + 443, + 758, + 776, + 965, + 1016, + 1188, + 1284, + 1311, + 1384, + 1503, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1197, + "label": 2, + "text": "Robert_Love:robert love robert m. love born c. 1981 american author speaker google engineer open source software developer love best known contributions linux kernel notable work including preemptive kernel process scheduler kernel event layer virtual memory subsystem inotify google member android team helped launch first version platform love also active gnome community working networkmanager gnome volume manager project utopia beagle love born 1981 south florida attended graduated charles w. flanagan high school undergraduate studies attended university florida graduated bachelor arts mathematics bachelor science computer science still college love employed kernel hacker montavista software montavista worked procps several kernel-related projects including one notable preemptive kernel love began work ximian december 15 2003 first served senior engineer linux desktop group ximian spearheaded effort named project utopia better integrate hardware management linux desktop ximian acquisition novell love rose position chief architect suse linux enterprise desktop novell worked various kernel gnome projects including inotify beagle love resigned novell may 4 2007 work google mobile device platform android joining project announced engineered several kernel system-level solutions android including novel shared memory subsystem ashmem love continues work google director engineering search infrastructure love lives boston massachusetts love author linux kernel development third edition book understanding developing code linux kernel book widely regarded approachable well written translated several languages three editions published imprints pearson education also wrote linux system programming second edition subtitled talking directly kernel c library published o'reilly media work documents linux system call c library api love also coauthor linux nutshell comprehensive linux command reference also published o'reilly media linux nutshell awarded favorite linux book time linux journal love contributing editor linux journal author articles magazine love invited speak around world including linux.conf.au australia fosdem belgium guadec england keynote speaker love written co-written several books linux operating system", + "neighbors": [ + 134, + 209, + 213, + 219, + 265, + 267, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1202, + 1208, + 1241, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1509, + 1524, + 1526, + 1558, + 1616, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1198, + "label": 8, + "text": "SocialFlow:socialflow socialflow social media optimization platform leading brands publishers company uses twitter firehose click data derived proprietary link proxy along proprietary algorithms optimize delivery messages social networks company believes understanding utilizing key metrics engagement clicks per tweet clicks per follower central growing large active social media following analysis data visualization way news filtered around death osama bin laden via twitter received international news coverage led questions role twitter journalism socialflow founded early 2009 frank speiser mike perrone sought apply scientific approach task building sustaining engaged social media audiences scale socialflow announced april 7 2011 raised 7 million series funding series round led softbank softbank ny rre ventures betaworks highline venture partners aol venture partners sv angel group high profile angel investors participating april 16 2013 socialflow announced raised 10 million round series b funding fairhaven capital led round joined existing investors softbank capital rre ventures aol ventures betaworks well new investors kbs+ ventures rand capital corporation company announced june 7 2011 peter hershberg joined company president socialflow gained considerable media attention published breaking bin laden visualizing power single tweet study demonstrated twitter evolved primary news source death osama bin laden broke twitter next study engaging news-hungry audiences tweet tweet looked twitter audiences al-jazeera english bbc news cnn economist fox news new york times revealed similarities differences respective organization audience simultaneously demonstrating true value audience engagement another notable study created socialflow looked launch kony 2012 video social media noted forbes writer anthony kosner study socialflow research group showed rather emerging big liberal enclaves american coasts initial wave social media traffic launched kony 2012 video originated mid-sized relatively conservative cities middle america", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1199, + "label": 1, + "text": "Base_M\u00e9rim\u00e9e:base m\u00e9rim\u00e9e base m\u00e9rim\u00e9e french database monuments listed national significance history architecture art created 1978 placed online 1995 french ministry culture division architectural heritage database periodically updated database contains information derived first survey historic monuments made m\u00e9rim\u00e9e 1840 cultural heritage inventory specifically religious domestic agricultural educational military industrial architecture name refers writer prosper m\u00e9rim\u00e9e also second inspector-general historic monuments", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1200, + "label": 5, + "text": "Port_(computer_networking):port computer networking computer networking port communication endpoint physical well wireless connections terminated ports hardware devices software level within operating system port logical construct identifies specific process type network service ports identified protocol address combination 16-bit unsigned numbers commonly known port number common protocols use port numbers transmission control protocol tcp user datagram protocol udp port number always associated ip address host protocol type communication completes destination origination network address message specific port numbers commonly reserved identify specific services arriving packet easily forwarded running application purpose lowest numbered 1024 port numbers identify historically commonly used services called well-known port numbers higher-numbered ports available general use applications known ephemeral ports used service enumeration ports provide multiplexing service multiple services multiple communication sessions one network address client\u2013server model application architecture multiple simultaneous communication sessions may initiated service port number 16-bit unsigned integer thus ranging 0 65535 tcp port number 0 reserved used udp source port optional value zero means port process associates input output channels via internet socket type file descriptor transport protocol ip address port number known binding enables process send receive data via network operating system networking software task transmitting outgoing data application ports onto network forwarding arriving network packets processes matching packet ip address port number tcp one process may bind specific ip address port combination common application failures sometimes called port conflicts occur multiple programs attempt use port number ip address protocol applications implementing common services often use specifically reserved well-known port numbers receiving service requests clients process known listening involves receipt request well-known port establishing one-to-one server-client dialog using local port number clients may continue connect listening port works tcp connection identified tuple consisting local address local port remote address remote port well-known ports defined convention overseen internet assigned numbers authority iana core network services world-wide web typically use well-known port numbers many operating systems special privileges required applications bind ports often deemed critical operation ip networks conversely client end connection typically uses high port number allocated short term use therefore called ephemeral port internet assigned numbers authority iana responsible global coordination dns root ip addressing internet protocol resources includes registration commonly used port numbers well-known internet services port numbers divided three ranges well-known ports registered ports dynamic private ports well-known ports also known system ports 0 1023 requirements new assignments range stricter registrations examples include registered ports 1024 49151 iana maintains official list well-known registered ranges dynamic private ports 49152 65535 one common use range ephemeral ports transport layer protocols transmission control protocol tcp user datagram protocol udp transfer data using protocol data units pdus tcp pdu segment datagram udp protocols use header field recording source destination port number port numbers encoded transport protocol packet header readily interpreted sending receiving computers also components networking infrastructure particular firewalls commonly configured differentiate packets based source destination port numbers port forwarding example application practice attempting connect range ports sequence single computer commonly known port scanning usually associated either malicious cracking attempts network administrators looking possible vulnerabilities help prevent attacks port connection attempts frequently monitored logged computers technique port knocking uses series port connections knocks client computer enable server connection example use ports internet mail system server used sending receiving email generally needs two services first service used transport email servers accomplished simple mail transfer protocol smtp smtp service application usually listens tcp port 25 incoming requests second service usually either post office protocol pop internet message access protocol imap used e-mail client applications users personal computers fetch email messages server pop service listens tcp port number 110 services may running host computer case port number distinguishes service requested remote computer user computer another mail server listening port number server well defined iana calls well-known ports client port number often chosen dynamic port range see applications clients server use specific port numbers assigned iana good example dhcp client always uses udp port 68 server always uses udp port 67 port numbers sometimes seen web uniform resource locators urls default http uses port 80 https uses port 443 url like nowiki http //www.example.com:8080/path/ /nowiki specifies web browser connects instead port 8080 http server concept port numbers established early developers arpanet informal co-operation software authors system administrators term port number yet used time preceded use term socket number early development stages network socket number remote host 40-bit quantity first 32 bits similar today ipv4 address time most-significant 8 bits host number least-significant portion socket number bits 33 40 entity called another eightbit number abbreviated aen today network socket refers related distinct concept namely internal address endpoint used within node march 26 1972 vint cerf jon postel called documenting then-current usages establishing socket number catalog rfc 322 network administrators asked submit note place phone call describing function socket numbers network service programs host catalog subsequently published rfc 433 december 1972 included list hosts port numbers corresponding function used host network first registry function served primarily documentation usage indicated port number usage conflicting hosts useful public services document promised resolution conflicts based standard postel published may 1972 rfc 349 first proposed official assignments port numbers network services suggested dedicated administrative function called czar maintain registry 256 values aen divided following ranges telnet service received first official assignment value 1 detail first set assignments early arpanet aen also called socket name used initial connection protocol icp component network control program ncp ncp forerunner modern internet protocols today terminology service name still closely connected port numbers former text strings used network functions represent numerical port number", + "neighbors": [ + 14, + 167, + 311, + 330, + 364, + 379, + 425, + 442, + 455, + 470, + 522, + 552, + 576, + 577, + 613, + 684, + 754, + 779, + 1138, + 1218, + 1329, + 1395, + 1448, + 1452, + 1453, + 1552, + 1570, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 1201, + "label": 6, + "text": "Apple_Filing_Protocol:apple filing protocol apple filing protocol afp formerly appletalk filing protocol proprietary network protocol part apple file service afs offers file services macos classic mac os macos afp one several file services supported others including server message block smb network file system nfs file transfer protocol ftp webdav afp currently supports unicode file names posix access control list permissions resource forks named extended attributes advanced file locking mac os 9 earlier afp primary protocol file services afp versions 3.0 greater rely exclusively tcp/ip port 548 427 establishing communication supporting appletalk service discovery protocol afp 2.x family supports tcp/ip using data stream interface appletalk communication service discovery many third-party afp implementations use afp 2.x thereby supporting appletalk connection method still earlier versions rely exclusively appletalk reason older literature refers afp appletalk filing protocol literature may refer afp appleshare name mac os 9 earlier afp client notable current compatibility topics early implementations afp server software available mac os starting system 6 appleshare appleshare ip early 1.x releases mac os x server client operating systems afp called personal file sharing supported ten simultaneous connections afp implementations relied version 1.x 2.x protocol appleshare ip 5.x 6.x 1.x releases mac os x server introduced afp version 2.2 first version offer transport connections using tcp/ip well appletalk also increased maximum share point size four gibibytes two tebibytes although maximum file size could stored remained two gibibytes due limitations original mac os changes made afp since version 3.0 represent major advances protocol introducing features designed specifically mac os x clients however like appleshare client original mac os afp client mac os x continues support type creator codes along filename extensions afp 3.0 introduced mac os x server 10.0.3 used mac os x server 10.1.5 first version use unix-style posix permissions model unicode utf-8 file name encodings version 3.0 supported maximum share point file size two tebibytes maximum file size volume size mac os x version 10.2 note maximum file size changed version 2.2 described afp 3.0 31 bytes maximum length filename sent afp afp 3.1 introduced mac os x server version 10.2. notable changes included support kerberos authentication automatic client reconnect nfs resharing secure afp connections via secure shell ssh maximum share point file size increased 8 tebibytes mac os x server 10.2 16 tebibytes mac os x server 10.3 afp 3.2 adds support access control lists extended attributes mac os x server 10.4 maximum share point size least 16 tebibytes although apple published limits document mac os x server 10.4 afp 3.2+ introduced mac os x leopard adds case sensitivity support improves support time machine synchronization lock stealing sleep notifications afp 3.3 mandates support replay cache functionality required time machine afp 3.4 introduced os x mountain lion includes minor change mapping posix errors afp errors see apple developer documentation afp version differences mac os x tiger users connect afp servers browsing network globe entering afp uniform resource locator url connect server dialog mac os x leopard later releases afp shares displayed finder side-bar afp urls take form afp // server share server server ip address domain name system dns name bonjour name share name share point snow leopard later url form afp // server share path used mount subdirectory underneath share point macos also offers personal file sharing light implementation current version afp mac os x 10.4 users share contents public folders checking personal file sharing sharing section system preferences afp urls appletalk servers took form afp //at/ appletalk name appletalk zone networks without appletalk zones asterisk would substituted zone name third party server implementations afp available number companies", + "neighbors": [ + 34, + 40, + 55, + 63, + 99, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 425, + 438, + 477, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 779, + 864, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1157, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1452, + 1459, + 1565, + 1578, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1202, + "label": 6, + "text": "Virtual_file_system:virtual file system virtual file system vfs virtual filesystem switch abstract layer top concrete file system purpose vfs allow client applications access different types concrete file systems uniform way vfs example used access local network storage devices transparently without client application noticing difference used bridge differences windows classic mac os/macos unix filesystems applications access files local file systems types without know type file system accessing vfs specifies interface contract kernel concrete file system therefore easy add support new file system types kernel simply fulfilling contract terms contract might change incompatibly release release would require concrete file system support recompiled possibly modified recompilation allow work new release operating system supplier operating system might make backward-compatible changes contract concrete file system support built given release operating system would work future versions operating system one first virtual file system mechanisms unix-like systems introduced sun microsystems sunos 2.0 1985 allowed unix system calls access local ufs file systems remote nfs file systems transparently reason unix vendors licensed nfs code sun often copied design sun vfs file systems could plugged also implementation ms-dos fat file system developed sun plugged sunos vfs although n't shipped product sunos 4.1 sunos implementation basis vfs mechanism system v release 4 john heidemann developed stacking vfs sunos 4.0 experimental ficus file system design provided code reuse among file system types differing similar semantics e.g encrypting file system could reuse naming storage-management code non-encrypting file system heidemann adapted work use 4.4bsd part thesis research descendants code underpin file system implementations modern bsd derivatives including macos unix virtual file systems include file system switch system v release 3 generic file system ultrix vfs linux os/2 microsoft windows virtual file system mechanism called installable file system filesystem userspace fuse mechanism allows userland code plug virtual file system mechanism linux netbsd freebsd opensolaris macos microsoft windows virtual filesystems also implemented userland shell namespace extensions however support lowest-level file system access application programming interfaces windows applications able access file systems implemented namespace extensions kio gvfs/gio provide similar mechanisms kde gnome desktop environments respectively similar limitations although made use fuse techniques therefore integrate smoothly system sometimes virtual file system refers file group files necessarily inside concrete file system acts manageable container provide functionality concrete file system usage software examples containers cbfs storage single-file virtual file system emulator like pctask so-called winuae oracle virtualbox microsoft virtual pc vmware primary benefit type file system centralized easy remove single-file virtual file system may include basic features expected file system virtual otherwise access internal structure file systems often limited programs specifically written make use single-file virtual file system instead implementation driver allowing universal access another major drawback performance relatively low compared virtual file systems low performance mostly due cost shuffling virtual files data written deleted virtual file system direct examples single-file virtual file systems include emulators pctask winuae encapsulate filesystem data also emulated disk layout makes easy treat os installation like piece software\u2014transferring removable media network amiga emulator pctask emulated intel pc 8088 based machine clocked 4.77mhz later 80486sx clocked 25 mhz users pctask could create file large size amiga filesystem file would virtually accessed emulator real pc hard disk file could formatted fat16 filesystem store normal ms-dos windows files uae windows winuae allows large single files windows treated amiga file systems winuae file called hardfile uae could also treat directory host filesystem windows linux macos amigaos amiga filesystem", + "neighbors": [ + 1, + 9, + 22, + 34, + 37, + 38, + 40, + 42, + 55, + 58, + 63, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 189, + 219, + 222, + 233, + 265, + 278, + 290, + 294, + 295, + 305, + 322, + 326, + 334, + 349, + 353, + 358, + 379, + 380, + 387, + 400, + 401, + 413, + 434, + 438, + 443, + 465, + 477, + 495, + 524, + 553, + 557, + 558, + 570, + 571, + 583, + 630, + 650, + 664, + 688, + 720, + 721, + 723, + 728, + 735, + 736, + 743, + 754, + 797, + 860, + 884, + 887, + 891, + 892, + 897, + 899, + 900, + 908, + 912, + 922, + 935, + 941, + 942, + 954, + 961, + 966, + 982, + 986, + 992, + 996, + 997, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1056, + 1060, + 1063, + 1064, + 1097, + 1104, + 1105, + 1124, + 1138, + 1155, + 1157, + 1187, + 1197, + 1201, + 1208, + 1224, + 1234, + 1241, + 1252, + 1283, + 1301, + 1304, + 1322, + 1357, + 1360, + 1381, + 1391, + 1394, + 1398, + 1415, + 1441, + 1445, + 1456, + 1459, + 1468, + 1474, + 1494, + 1526, + 1530, + 1546, + 1565, + 1578, + 1602, + 1610, + 1616, + 1631, + 1637, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 1203, + "label": 2, + "text": "Series_30:series 30 series 30 often shortened s30 software platform application user interface created nokia entry level mobile phones lower series 40 s30 phones capable running java apps 2014 microsoft acquired nokia mobile phones business later discontinued s30 favor series 30+ first series 30 device nokia 1100 2003 originally s30 supposed one menu key second one added release nokia 1110 s30 devices also n't 5-way d-pad 4-way d-pad except nokia 1100 2-way d-pad following list series 30 devices released nokia", + "neighbors": [ + 3, + 21, + 101, + 113, + 162, + 238, + 253, + 264, + 298, + 309, + 337, + 484, + 520, + 527, + 603, + 619, + 622, + 707, + 726, + 957, + 961, + 1018, + 1020, + 1051, + 1117, + 1138, + 1140, + 1287, + 1304, + 1314, + 1422, + 1493, + 1520, + 1522, + 1529, + 1602, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1204, + "label": 9, + "text": "BBC_BASIC:bbc basic bbc basic programming language developed 1981 native programming language mos technology 6502 based acorn bbc micro home/personal computer version basic programming language adapted uk computer literacy project bbc written mainly sophie wilson bbc basic based older atom basic acorn atom extended traditional basic named codice_1/codice_2 procedures functions codice_3 loops codice_4 structures inspired comal interpreter also included powerful statements controlling bbc micro four-channel sound output low-/high-resolution eight-mode graphics display due number optimizations bbc basic ran programs much faster microsoft basic running similar machines included using multiple linked lists variable lookup rather single long list pre-defining location integer variables separate integer maths routines speed improved bbc machine via use fast ram allowed mos 6502 processor motorola 6845 display driver share memory without pausing access result design features bbc basic ran david ahl benchmark 21 seconds besting even ibm pc far outpacing 8-bit platforms one unique features bbc basic inline assembler allowing users write assembly language programs 6502 later zilog z80 ns32016 arm assembler fully integrated basic interpreter shared variables could included characters saved via *save *load called via call usr commands allowed developers write assembly language code also basic code emit assembly language making possible use code-generation techniques even write simple compilers basic 1978 hermann hauser chris curry founded acorn computers much code developed cambridge university sophie wilson colleagues complete history available basic original version shipped early bbc micros basic ii used acorn electron bbc micros shipped 1982 including model b added codice_5 codice_6 keywords along offset assembly bug fixes basic iii produced uk version united states market version acorn abortive attempt enter cross-atlantic computer market apart bug fixes change basic ii codice_7 command could also spelled codice_8 regardless input uk version always listed codice_7 us version codice_8 main place basic iii found hi-basic version external second processor basic iv also known cmos basic available bbc master machines changed use new instructions available 65sc12 processor reducing size code therefore allowing inclusion codice_11 codice_12 statement codice_13 codice_14 codice_15 codice_16 statements faster floating point bug fixes included basic iv 1986 improvement basic iv included master compact machine version basic compact included re-coded mathematical routines said provide 30 speed increase version included rest master series hi-basic available two versions first based basic iii second based basic iv built run higher address b800 second processor rather usual 8000 address bbc b allowed program space available either external internal 6502 second processors version introduced support second zilog z80 processor another version bbc basic called bas128 supplied tape disc bbc master master compact loaded main ram used 64 kb sideways ram user programs provided support much larger programs cost lot slower normal rom-based version interpreter deal basic 6502 assembly language included characters contributed system popularity industrial research engineers bbc mos risc os usually supplied rom may assumed specific release operating system contained specific version basic simple way determine version basic actually running enquiring operating system identity thus making assumption see also beebwiki entry inkey bbc family possible run standard basic enhanced hibasic 6502 second processor one may determine program running second processor examining initial value page 800 using second processor distinguish basic hibasic one examine initial value himem 8000 basic running second processor b800 hibasic second processor similar situation exists risc os may normal basic basic64 offers higher precision maths normal basic identifies basic v basic64 identifies basic vi therefore following used error occurred distinguish one better ways see beebwiki almost cases n't need testing basic platform program running make call read whatever returned data returned deal move 32-bit arm cpu removal 16 kb limit basic code size many new features added basic v version 1.04 61 kb long current versions risc os still contain bbc basic v interpreter source code risc os 5 version bbc basic v released 'shared source risc os open 2011 tba software released test versions updated basic includes support vfp/neon assembler amongst new commands features supported graphics commands entirely backwards compatible sound less example codice_28 keyword basic v onwards command takes fourteen numeric parameters effectively nothing\u2014 older versions calls os_word 8 nothing risc os in-line 6502 assembler replaced arm assembler basic v said acorn certainly fastest interpreted basic world probably powerful basic found computer basic vi version basic v supports ieee 754 8-byte format real numbers opposed standard 5-byte format introduced basic i. bbc basic v vi delivered standard acorn archimedes riscpc version bbc basic v also available run arm second processor bbc micro compiler bbc basic v produced paul fellows team leader arthur os development called archimedes basic compiler published initially dabs press abc able implement almost language obvious exception eval function inevitably required run-time programmatic interpretation evidence completeness able support in-line assembler syntax compiler written bbc basic v. compiler running interpreter early development stages able compile versions distributed self-compiled object code many applications initially written run interpreter benefitted performance boost gave putting bbc basic v par languages serious application development bbc basic also ported many platforms ns32016 version bbc basic supplied acorn 32016 coprocessor acorn abc addition version bbc basic supplied bbc micro zilog z80 second processor z80-based version bbc basic also exists cp/m-based systems recently version existed sinclair zx spectrum however due efforts j. g. harston also responsible pdp-11 version bbc basic spectrum released january 2002 many improvements made subsequent releases zilog z80 version bbc basic also used tiki 100 desktop computer cambridge z88 portable amstrad nc100 notepad amstrad nc200 notebook computers version implemented ti-83 plus ti-84 plus series graphing calculators pc-based systems bbc basic also implemented dos bbcbasic 86 aimed maximum compatibility bbc micro bbasic concentrated basic language enhancements based basic ii version bbc basic integrated microsoft windows graphical user interface bbc basic windows created richard russell developer z80 x86 versions released 2001 version still active development seeing much industry use currently whilst supporting nearly completely original bbc basic specification basic iv windows version supports much basic v/vi syntax well advanced features features unique bbc basic windows include interpreter support record/structure types ability call windows api routines external dll recent versions included advanced features comparable languages like c external library recently added support objects sdl based version bbc basic available windows linux number mobile devices supporting sdl library gpl clone bbc basic named brandy written portable c also available emulator bbc micro commodore amiga produced ariadne software cbm uk extremely fast emulate 6502 full speed assembly code would run slower real bbc basic programs would run much faster due way optimised basic 6502 emulation interacted almost commercial games would run well behaved code educational software generally worked additionally used slightly less precise floating-point numeric format bundled special academic package amiga 500 hope schools would replace ageing bbc bs amiga 500s version bbc basic v z80 also made ti-83/84+ texas instruments calculator families benjamin ryves commodore 64 version shado produced small software house aztec software early 1980s", + "neighbors": [ + 0, + 8, + 78, + 236, + 273, + 306, + 491, + 510, + 606, + 670, + 810, + 812, + 843, + 868, + 961, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1306, + 1372, + 1390, + 1565, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1205, + "label": 1, + "text": "U-DISE:u-dise u-dise unified district information system education database schools india database developed national university educational planning administration records information level dropouts condition school toilets", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1206, + "label": 5, + "text": "Point-to-Point_Protocol:point-to-point protocol computer networking point-to-point protocol ppp data link layer layer 2 communications protocol used establish direct connection two nodes connects two routers directly without host networking device provide connection authentication transmission encryption compression ppp used many types physical networks including serial cable phone line trunk line cellular telephone specialized radio links fiber optic links sonet internet service providers isps used ppp customer dial-up access internet since ip packets transmitted modem line without data link protocol two derivatives ppp point-to-point protocol ethernet pppoe point-to-point protocol atm pppoa used commonly isps establish digital subscriber line dsl internet service connection customers ppp commonly used data link layer protocol connection synchronous asynchronous circuits largely superseded older serial line internet protocol slip telephone company mandated standards link access protocol balanced lapb x.25 protocol suite requirement ppp circuit provided duplex ppp designed work numerous network layer protocols including internet protocol ip trill novell internetwork packet exchange ipx nbf decnet appletalk like slip full internet connection telephone lines via modem reliable slip double checks make sure internet packets arrive intact resends damaged packets ppp designed somewhat original hdlc specifications designers ppp included many additional features seen proprietary data-link protocols time ppp specified rfc 1661 rfc 2516 describes point-to-point protocol ethernet pppoe method transmitting ppp ethernet sometimes used dsl rfc 2364 describes point-to-point protocol atm pppoa method transmitting ppp atm adaptation layer 5 aal5 also common alternative pppoe used dsl ppp layered protocol three components lcp initiates terminates connections gracefully allowing hosts negotiate connection options integral part ppp defined standard specification lcp provides automatic configuration interfaces end setting datagram size escaped characters magic numbers selecting optional authentication lcp protocol runs top ppp ppp protocol number 0xc021 therefore basic ppp connection established lcp able configure rfc 1994 describes challenge-handshake authentication protocol chap preferred establishing dial-up connections isps although deprecated password authentication protocol pap still sometimes used another option authentication ppp extensible authentication protocol eap described rfc 2284 link established additional network layer 3 configuration may take place commonly internet protocol control protocol ipcp used although internetwork packet exchange control protocol ipxcp appletalk control protocol atcp popular internet protocol version 6 control protocol ipv6cp see extended use future ipv6 replaces ipv4 dominant layer-3 protocol ppp permits multiple network layer protocols operate communication link every network layer protocol used separate network control protocol ncp provided order encapsulate negotiate options multiple network layer protocols negotiates network-layer information e.g network address compression options connection established example internet protocol ip uses ip control protocol ipcp internetwork packet exchange ipx uses novell ipx control protocol ipx/spx ncps include fields containing standardized codes indicate network layer protocol type ppp connection encapsulates following ncps may used ppp ppp detects looped links using feature involving magic numbers node sends ppp lcp messages messages may include magic number line looped node receives lcp message magic number instead getting message peer magic number previous section introduced use lcp options meet specific wan connection requirements ppp may include following lcp options ppp frames variants hdlc frames peers agree address field control field compression lcp fields omitted likewise peers agree protocol field compression 0x00 byte omitted protocol field indicates type payload packet 0xc021 lcp 0x80xy various ncps 0x0021 ip 0x0029 appletalk 0x002b ipx 0x003d multilink 0x003f netbios 0x00fd mppc mppe etc ppp limited contain general layer 3 data unlike ethertype information field contains ppp payload variable length negotiated maximum called maximum transmission unit default maximum 1500 octets might padded transmission information particular protocol padded protocol must allow information distinguished padding ppp frames encapsulated lower-layer protocol provides framing may provide functions checksum detect transmission errors ppp serial links usually encapsulated framing similar hdlc described ietf rfc 1662 flag field present ppp hdlc-like framing used address control fields always value hex ff stations hex 03 unnumbered information omitted whenever ppp lcp address-and-control-field-compression acfc negotiated frame check sequence fcs field used determining whether individual frame error contains checksum computed frame provide basic protection errors transmission crc code similar one used layer two protocol error protection schemes one used ethernet according rfc 1662 either 16 bits 2 bytes 32 bits 4 bytes size default 16 bits polynomial x x x 1 fcs calculated address control protocol information padding fields message encapsulated multilink ppp also referred mlppp mp mppp mlp multilink provides method spreading traffic across multiple distinct ppp connections defined rfc 1990 used example connect home computer internet service provider using two traditional 56k modems connect company two leased lines single ppp line frames arrive order possible frames divided among multiple ppp connections therefore multilink ppp must number fragments put right order arrive multilink ppp example link aggregation technology cisco ios release 11.1 later supports multilink ppp ppp one establish several simultaneous distinct ppp connections single link possible multilink ppp either multilink ppp uses contiguous numbers fragments packet consequence possible suspend sending sequence fragments one packet order send another packet prevents running multilink ppp multiple times links multiclass ppp kind multilink ppp class traffic uses separate sequence number space reassembly buffer multiclass ppp defined rfc 2686 pptp point-to-point tunneling protocol form ppp two hosts via gre using encryption mppe compression mppc many protocols used tunnel data ip networks like ssl ssh l2tp create virtual network interfaces give impression direct physical connections tunnel endpoints linux host example interfaces would called tun0 ppp0 two endpoints tunnel tunnel point-to-point connection ppp natural choice data link layer protocol virtual network interfaces ppp assign ip addresses virtual interfaces ip addresses used example route networks sides tunnel ipsec tunneling mode create virtual physical interfaces end tunnel since tunnel handled directly tcp/ip stack l2tp used provide interfaces technique called l2tp/ipsec case ppp provides ip addresses extremities tunnel ppp defined rfc 1661 point-to-point protocol july 1994 rfc 1547 requirements internet standard point-to-point protocol december 1993 provides historical information need ppp development series related rfcs written define variety network control protocols-including tcp/ip decnet appletalk ipx others-work ppp", + "neighbors": [ + 52, + 109, + 134, + 138, + 166, + 311, + 425, + 430, + 444, + 455, + 470, + 528, + 542, + 543, + 672, + 684, + 732, + 746, + 757, + 758, + 762, + 764, + 769, + 770, + 771, + 779, + 813, + 833, + 875, + 1112, + 1116, + 1144, + 1151, + 1218, + 1326, + 1329, + 1386, + 1395, + 1400, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1538, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1207, + "label": 9, + "text": "T_(programming_language):programming language programming language dialect language scheme developed early 1980s jonathan a. rees kent m. pitman norman i. adams yale university experiment language design implementation purpose test thesis developed guy l. steele jr. gerald jay sussman series papers scheme scheme may used basis practical programming language exceptional expressive power implementations scheme could perform better lisp systems competitively implementations programming languages c bliss usually considered inherently efficient lisp conventional machine architectures much occurs via optimizing compiler named orbit contains features modern scheme lacks example object-oriented first-class environments called locales modified non-locally used module system several extra special forms lazy evaluation flow control equivalent common lisp setf like scheme supports call-with-current-continuation call/cc also limited form called codice_1 manual hypothetical implementation codice_2 could example shows objects intimately related closures message-passing primitive called codice_3 puts two objects together allowing something resembling inheritance ported many hardware platforms operating systems including", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 210, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 386, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 926, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1016, + 1021, + 1022, + 1066, + 1076, + 1100, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1632, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1208, + "label": 2, + "text": "Kernel-based_Virtual_Machine:kernel-based virtual machine kernel-based virtual machine kvm virtualization module linux kernel allows kernel function hypervisor merged linux kernel mainline kernel version 2.6.20 released february 5 2007 kvm requires processor hardware virtualization extensions intel vt amd-v. kvm also ported operating systems freebsd illumos form loadable kernel modules kvm originally designed x86 processors since ported s/390 powerpc ia-64 arm kvm provides hardware-assisted virtualization wide variety guest operating systems including linux bsd solaris windows haiku reactos plan 9 aros research operating system macos addition android 2.2 gnu/hurd debian k16 minix 3.1.2a solaris 10 u3 darwin 8.0.1 together operating systems newer versions listed known work certain limitations additionally kvm provides paravirtualization support linux openbsd freebsd netbsd plan 9 windows guests using virtio api includes paravirtual ethernet card disk i/o controller balloon device vga graphics interface using spice vmware drivers avi kivity began development kvm qumranet technology startup company acquired red hat 2008 kvm surfaced october 2006 merged linux kernel mainline kernel version 2.6.20 released 5 february 2007 kvm maintained paolo bonzini kvm perform emulation instead exposes /dev/kvm interface userspace host use linux qemu versions 0.10.1 later one userspace host qemu uses kvm available virtualize guests near-native speeds otherwise falls back software-only emulation internally kvm uses seabios open source implementation 16-bit x86 bios kvm support hot plug vcpus dynamic memory management live migration since february 2007 among features kvm parts licensed various gnu licenses", + "neighbors": [ + 58, + 85, + 213, + 219, + 234, + 265, + 267, + 270, + 294, + 305, + 306, + 322, + 327, + 346, + 359, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 856, + 897, + 935, + 961, + 979, + 986, + 1002, + 1019, + 1053, + 1060, + 1087, + 1102, + 1105, + 1138, + 1197, + 1202, + 1241, + 1252, + 1278, + 1313, + 1346, + 1357, + 1360, + 1363, + 1391, + 1415, + 1456, + 1462, + 1468, + 1483, + 1524, + 1526, + 1538, + 1558, + 1602, + 1638 + ], + "mask": "Train" + }, + { + "node_id": 1209, + "label": 0, + "text": "Text_mining:text mining text mining also referred text data mining roughly equivalent text analytics process deriving high-quality information text high-quality information typically derived devising patterns trends means statistical pattern learning text mining usually involves process structuring input text usually parsing along addition derived linguistic features removal others subsequent insertion database deriving patterns within structured data finally evaluation interpretation output 'high quality text mining usually refers combination relevance novelty interest typical text mining tasks include text categorization text clustering concept/entity extraction production granular taxonomies sentiment analysis document summarization entity relation modeling i.e learning relations named entities text analysis involves information retrieval lexical analysis study word frequency distributions pattern recognition tagging/annotation information extraction data mining techniques including link association analysis visualization predictive analytics overarching goal essentially turn text data analysis via application natural language processing nlp analytical methods typical application scan set documents written natural language either model document set predictive classification purposes populate database search index information extracted term text analytics describes set linguistic statistical machine learning techniques model structure information content textual sources business intelligence exploratory data analysis research investigation term roughly synonymous text mining indeed ronen feldman modified 2000 description text mining 2004 describe text analytics latter term used frequently business settings text mining used earliest application areas dating 1980s notably life-sciences research government intelligence term text analytics also describes application text analytics respond business problems whether independently conjunction query analysis fielded numerical data truism 80 percent business-relevant information originates unstructured form primarily text techniques processes discover present knowledge \u2013 facts business rules relationships \u2013 otherwise locked textual form impenetrable automated processing subtasks\u2014components larger text-analytics effort\u2014typically include text mining technology broadly applied wide variety government research business needs three groups may use text mining records management searching documents relevant daily activities legal professionals may use text mining e-discovery governments military groups use text mining national security intelligence purposes scientific researchers incorporate text mining approaches efforts organize large sets text data i.e. addressing problem unstructured data determine ideas communicated text e.g. sentiment analysis social media support scientific discovery fields life sciences bioinformatics business applications used support competitive intelligence automated ad placement among numerous activities many text mining software packages marketed security applications especially monitoring analysis online plain text sources internet news blogs etc national security purposes also involved study text encryption/decryption range text mining applications biomedical literature described including computational approaches assist studies protein docking protein interactions protein-disease associations addition large patient textual datasets clinical field datasets demographic information population studies adverse event reports text mining facilitate clinical studies precision medicine text mining algorithms facilitate stratification indexing specific clinical events large patient textual datasets symptoms side effects comorbidities electronic health records event reports reports specific diagnostic tests one online text mining application biomedical literature pubgene publicly accessible search engine combines biomedical text mining network visualization gopubmed knowledge-based search engine biomedical texts text mining techniques also enable us extract unknown knowledge unstructured documents clinical domain text mining methods software also researched developed major firms including ibm microsoft automate mining analysis processes different firms working area search indexing general way improve results within public sector much effort concentrated creating software tracking monitoring terrorist activities text mining used large media companies tribune company clarify information provide readers greater search experiences turn increases site stickiness revenue additionally back end editors benefiting able share associate package news across properties significantly increasing opportunities monetize content text mining starting used marketing well specifically analytical customer relationship management coussement van den poel 2008 ref name= 10.1016/j.im.2008.01.005 /ref apply improve predictive analytics models customer churn customer attrition text mining also applied stock returns prediction sentiment analysis may involve analysis movie reviews estimating favorable review movie analysis may need labeled data set labeling affectivity words resources affectivity words concepts made wordnet conceptnet respectively text used detect emotions related area affective computing text based approaches affective computing used multiple corpora students evaluations children stories news stories issue text mining importance publishers hold large databases information needing indexing retrieval especially true scientific disciplines highly specific information often contained within written text therefore initiatives taken nature proposal open text mining interface otmi national institutes health common journal publishing document type definition dtd would provide semantic cues machines answer specific queries contained within text without removing publisher barriers public access academic institutions also become involved text mining initiative computational methods developed assist information retrieval scientific literature published approaches include methods searching determining novelty clarifying homonyms among technical reports automatic analysis vast textual corpora created possibility scholars analyze millions documents multiple languages limited manual intervention key enabling technologies parsing machine translation topic categorization machine learning automatic parsing textual corpora enabled extraction actors relational networks vast scale turning textual data network data resulting networks contain thousands nodes analyzed using tools network theory identify key actors key communities parties general properties robustness structural stability overall network centrality certain nodes automates approach introduced quantitative narrative analysis whereby subject-verb-object triplets identified pairs actors linked action pairs formed actor-object content analysis traditional part social sciences media studies long time automation content analysis allowed big data revolution take place field studies social media newspaper content include millions news items gender bias readability content similarity reader preferences even mood analyzed based text mining methods millions documents analysis readability gender bias topic bias demonstrated flaounas et al showing different topics different gender biases levels readability possibility detect mood patterns vast population analyzing twitter content demonstrated well text mining computer programs available many commercial open source companies sources see list text mining software lack flexibilities european copyright database law mining in-copyright works web mining without permission copyright owner illegal uk 2014 recommendation hargreaves review government amended copyright law allow text mining limitation exception second country world following japan introduced mining-specific exception 2009 however owing restriction copyright directive uk exception allows content mining non-commercial purposes uk copyright law allow provision overridden contractual terms conditions european commission facilitated stakeholder discussion text data mining 2013 title licenses europe fact focus solution legal issue licenses limitations exceptions copyright law led representatives universities researchers libraries civil society groups open access publishers leave stakeholder dialogue may 2013 contrast europe flexible nature us copyright law particular fair use means text mining america well fair use countries israel taiwan south korea viewed legal text mining transformative meaning supplant original work viewed lawful fair use example part google book settlement presiding judge case ruled google digitization project in-copyright books lawful part transformative uses digitization project displayed\u2014one use text data mining recently websites often used text-based searches found documents containing specific user-defined words phrases use semantic web text mining find content based meaning context rather specific word additionally text mining software used build large dossiers information specific people events example large datasets based data extracted news reports built facilitate social networks analysis counter-intelligence effect text mining software may act capacity similar intelligence analyst research librarian albeit limited scope analysis text mining also used email spam filters way determining characteristics messages likely advertisements unwanted material text mining plays important role determining financial market sentiment increasing interest paid multilingual data mining ability gain information across languages cluster similar items different linguistic sources according meaning challenge exploiting large proportion enterprise information originates unstructured form recognized decades recognized earliest definition business intelligence bi october 1958 ibm journal article h.p luhn business intelligence system describes system ... utilize data-processing machines auto-abstracting auto-encoding documents creating interest profiles 'action points organization incoming internally generated documents automatically abstracted characterized word pattern sent automatically appropriate action points yet management information systems developed starting 1960s bi emerged '80s '90s software category field practice emphasis numerical data stored relational databases surprising text unstructured documents hard process emergence text analytics current form stems refocusing research late 1990s algorithm development application described prof. marti a. hearst paper untangling text data mining almost decade computational linguistics community viewed large text collections resource tapped order produce better text analysis algorithms paper attempted suggest new emphasis use large online text collections discover new facts trends world suggest make progress need fully artificial intelligent text analysis rather mixture computationally-driven user-guided analysis may open door exciting new results hearst 1999 statement need fairly well describes state text analytics technology practice decade later", + "neighbors": [ + 12, + 159, + 307, + 368, + 372, + 429, + 453, + 528, + 690, + 733, + 766, + 799, + 824, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1440, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1210, + "label": 5, + "text": "Beonex_Communicator:beonex communicator beonex communicator discontinued open-source internet suite based mozilla application suite mas ben bucksch german mozilla developer intended higher security privacy level commercial products internet suite contains web browser email news client html editor based mozilla composer irc client based chatzilla beonex business services offered suite free provided documentation easy install routines third-party plug-ins tried sell support customer-specific changes browser main goal implement kerberos openpgp ldap beonex marked failed mid-2004 discontinued reaching production release stage mozilla organization stated mozilla application suite developers testing purposes meant end users 5 january 2001 beonex included linux distribution kmlinux version s-0.4 removed version s-0.5 released 23 march 2001 beonex 0.8 released june 2002 received positive reviews speed beonex launcher beol spoken b-o-l additional upcoming product never left alpha status stripped-down version beonex communicator web browser combined email client chat client preview releases version 0.9 mid-2002 bucksch showed new features wanted integrate version gained stable status announced 2 march 2004 new releases planned mozilla foundation decided future policy 2005 mozilla foundation officially changed policies created mozilla corporation provide end-user support beonex communicator 0.8.2-stable several known security issues beonex never received much market share browser transmit referrers default possibility create fake referrers browser deletes cookies upon exiting disables several javascript functions could served attack vectors beonex also allows changing user agent following comparison table releases netscape mas included complete table see gecko layout engine contrast netscape beonex included nearly features except proprietary parts like integrated net2phone aol instant messenger online chatting chatzilla integrated sidebar search engines also pre-configured beonex less resource-intensive netscape beonex includes migration tool import old profiles netscape communicator beonex communicator fork mas rather separate branch significant changes made html email javascript turned default thus displays email plain text bold cursive additions added later mas 1.1 search engines compatible mycroft project located sidebar providing features", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 258, + 277, + 312, + 427, + 452, + 491, + 509, + 530, + 531, + 580, + 582, + 623, + 627, + 668, + 684, + 713, + 862, + 864, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1166, + 1195, + 1228, + 1280, + 1302, + 1331, + 1339, + 1376, + 1378, + 1395, + 1407, + 1408, + 1423, + 1424, + 1528, + 1539, + 1550, + 1569, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1211, + "label": 9, + "text": "Cerner_CCL:cerner ccl cerner ccl cerner command language cerner corporation fourth-generation programming language expressed cerner discern explorer solution ccl patterned structured query language sql cerner millennium health information technology solutions use ccl/discern explorer select insert update delete cerner millennium database ccl allows programmer fetch data oracle database display user wants see features like record structure subroutines allows us get data database manipulate storing temporary structure execute particular section code required using subroutine complete ccl cerner command language provided cerner corporation discern explorer provides several applications used create execute analyze ad hoc queries reports programs applications provide flexibility skill set needed build programs design reports discern explorer programs written using visualexplorer.exe discernvisualdeveloper.exe dvdev operating system command-line editor text editor explorermenu.exe em used execute discern explorer programs demand exploreranalyzer.exe ea allows users analyze system resources used rdbms queries ccl hello world examples call echo hello world go drop program helloworld2 go drop program helloworld3 go drop program jcmclass1a go", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1212, + "label": 2, + "text": "OLE_Automation:ole automation microsoft windows applications programming ole automation later renamed simply automation inter-process communication mechanism created microsoft based subset component object model com intended use scripting languages \u2013 originally visual basic \u2013 used several languages windows automation objects required implement idispatch interface provides infrastructure whereby applications called automation controllers access manipulate i.e set properties call methods shared automation objects exported applications supersedes dynamic data exchange dde older mechanism applications control one another dde ole automation automation controller client application exporting automation objects server contrary name automation objects necessarily use microsoft ole although automation objects used ole environments confusion roots microsoft earlier definition ole previously less synonym com ensure interoperability automation interfaces limited use subset com types specifically automation interfaces must use safearray instead raw com arrays automation-compatible com servers however rely in-built ole marshalling implementation avoids need additional proxy/stub projects marshalling out-of-process automation designed ease scripting mind controllers often provide languages visual basic applications end users allowing control automation objects via scripts automation objects often written conventional languages c++ c++ attributes used simplify development languages visual basic borland delphi also provides convenient syntax automation hides complexity underlying implementation order automate application developer automation controller must know object model employed target application exporting activation objects requires developer target application publicly document object model development automation controllers without knowledge target application object model difficult impossible complications automation components usually provided type libraries contain metadata classes interfaces features exposed object library interfaces described microsoft interface definition language type libraries viewed using various tools microsoft ole/com object viewer codice_1 part microsoft platform sdk object browser visual basic version 6 visual studio .net type libraries used generate proxy pattern/stub code interoperating com platforms microsoft .net java instance .net framework sdk includes tools generate proxy .net dll access automation objects using early binding information interfaces extracted type library late binding via idispatch mapped .net reflection api built-in .net-to-com bridge called com interop java lacks built-in com support toolsets like jacob jsegue generate proxy source code consisting two parts set java classes c++ source java native interface dll type libraries solutions work windows another java based j-interop library enables interoperability com components without jni using dcom wire protocol msrpc works non-windows platforms also microsoft publicly documented object model applications microsoft office software developers also documented object models applications object models presented automation controllers type libraries interfaces described odl automation available variety languages including limited", + "neighbors": [ + 26, + 66, + 79, + 93, + 117, + 148, + 153, + 262, + 268, + 278, + 295, + 306, + 312, + 326, + 336, + 344, + 373, + 433, + 435, + 485, + 509, + 510, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 815, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1225, + 1227, + 1235, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1502, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1213, + "label": 3, + "text": "PDP-10:pdp-10 digital equipment corporation pdp-10 later marketed decsystem-10 mainframe computer family manufactured beginning 1966 discontinued 1983 1970s models beyond marketed decsystem-10 name especially tops-10 operating system became widely used pdp-10 architecture almost identical dec earlier pdp-6 sharing 36-bit word length slightly extending instruction set improved hardware implementation aspects instruction set unusual notably byte instructions operated bit fields size 1 36 bits inclusive according general definition byte contiguous sequence fixed number bits pdp-10 machine made time-sharing common features made common fixture many university computing facilities research labs 1970s notable harvard university aiken lab mit ai lab project mac stanford sail computer center corporation ccc eth zir carnegie mellon university main operating systems tops-10 tenex used build early arpanet reasons pdp-10 looms large early hacker folklore projects extend pdp-10 line eclipsed success unrelated vax superminicomputer cancellation pdp-10 line announced 1983 original pdp-10 processor ka10 introduced 1968 uses discrete transistors packaged dec flip-chip technology backplanes wire wrapped via semi-automated manufacturing process cycle time 1 \u03bcs add time 2.1 \u03bcs 1973 ka10 replaced ki10 uses transistor\u2013transistor logic ttl ssi joined 1975 higher-performance kl10 later faster variants built emitter-coupled logic ecl microprogrammed cache memory kl10 performance 1 megaflops using 36-bit floating point numbers matrix row reduction slightly faster newer vax-11/750 although limited memory smaller less expensive model ks10 introduced 1978 using ttl am2901 bit-slice components including pdp-11 unibus connect peripherals ks marketed decsystem-2020 dec entry distributed processing arena introduced world lowest cost mainframe computer system ka10 maximum main memory capacity virtual physical 256 kilowords equivalent 1152 kilobytes supplied dec include paging hardware memory management consisted two sets protection relocation registers called base bounds registers allows half user address space limited set section main memory designated base physical address size allows model separate read-only shareable code segment normally high segment read-write data/stack segment normally low segment used tops-10 later adopted unix ka10 machines first mit later bolt beranek newman bbn modified add virtual memory support demand paging ka10 weighed 10/50 top-of-the-line uni-processor ka machine time pa1050 software package introduced two ka10 models uniprocessor 10/40 dual-processor 10/55 ki10 later processors offer paged memory management also support larger physical address space 4 megawords ki10 models include 1060 1070 1077 latter incorporating two cpus original kl10 pdp-10 also marketed decsystem-10 models 1080 1088 etc use original pdp-10 memory bus external memory modules module context meant cabinet dimensions roughly wxhxd 30 x 75 x 30 capacity 32 256 kwords magnetic core memory picture right hand side introduction shows six cabinets processors used decsystem-20 2040 2050 2060 2065 commonly incorrectly called kl20 use internal memory mounted cabinet cpu 10xx models also different packaging come original tall pdp-10 cabinets rather short ones used later decsystem-20 differences 10xx 20xx models cosmetic real 10xx systems 20-style internal memory i/o 20xx systems 10-style external memory i/o bus particular arpanet tops-20 systems i/o bus an20 imp interface i/o bus device could run either tops-10 tops-20 microcode thus corresponding operating system later model b version 2060 processors removed 256 kiloword limit virtual address space allowing use 32 sections 256 kilowords along substantial changes instruction set model model b kl10 processors thought different cpus first operating system took advantage model b capabilities tops-20 release 3 user mode extended addressing offered tops-20 release 4 tops-20 versions release 4.1 would run model b. tops-10 versions 7.02 7.03 also use extended addressing run 1090 1091 model b processor running tops-20 microcode final upgrade kl10 mca25 upgrade 2060 2065 1091 1095 gave performance increases programs run multiple sections ks10 design crippled model even though necessary data paths needed support model b architecture present doubt intended segment market greatly shortened ks10 product life frontend processors computers extend functionality systems connected kl class machines started without assistance pdp-11/40 frontend computer installed every system pdp-11 booted dual-ported rp06 disk drive alternatively 8 floppy disk drive dectape commands given pdp-11 start main processor typically booted rp06 disk drive pdp-11 pdp-11 performs watchdog functions main processor running networking remote job entry rje accomplished via pdp-11/34a frontend dec used terms dn60 d60spl ks system uses similar boot procedure 8080 cpu loads microcode rm03 rm80 rp06 disk magnetic tape starts main processor 8080 switches modes operating system boots controls console remote diagnostic serial ports i/o architecture 20xx series kl machines based dec bus design called massbus many attributed success pdp-11 dec decision make pdp-11 unibus open architecture dec reverted prior philosophy kl making massbus unique proprietary consequently aftermarket peripheral manufacturers made devices massbus dec chose price massbus devices notably rp06 disk drive substantial premium comparable ibm-compatible devices compuserve one designed alternative disk controller could operate massbus connect ibm style 3330 disk subsystems two models tape drives supported tm10 magnetic tape control subsystem mix eight could supported providing seven-track /or nine-track devices tu20 tu30 came 9 track b 7 track versions aforementioned tape drives could read/write from/to 200 bpi 556 bpi 800 bpi ibm-compatible tapes tm10 magtape controller available two submodels first pdp-6s model kl-10s user-mode instruction set architecture largely section covers architecture multi-section extended addressing covered decsystem-10/decsystem-20 processor reference manual pdp-10 36-bit words 18-bit word addresses supervisor mode instruction addresses correspond directly physical memory user mode addresses translated physical memory earlier models give user process high low memory addresses 0 top bit used one base register higher addresses used another segment contiguous later architectures paged memory access allowing non-contiguous address spaces cpu general-purpose registers also addressed memory locations 0-15 16 general-purpose 36-bit registers right half registers register 0 may used indexing instructions operate pairs registers pc word consists 13-bit condition register plus 5 always zero bits left half 18-bit program counter right half condition register records extra bits results arithmetic operations e.g overflow accessed instructions two operational modes supervisor user mode besides difference memory referencing described supervisor-mode programs execute input/output operations communication user-mode supervisor-mode done unimplemented user operations uuos instructions defined hardware trapped supervisor mechanism also used emulate operations may hardware implementations cheaper models major datatypes directly supported architecture two complement 36-bit integer arithmetic including bitwise operations 36-bit floating-point halfwords extended 72-bit floating point supported special instructions designed used multi-instruction sequences byte pointers supported special instructions word structured count half pointer half facilitates use bounded regions memory notably stacks instruction set symmetrical every instruction consists 9-bit opcode 4-bit register code 23-bit effective address field consists turn 1-bit indirect bit 4-bit register code 18-bit offset instruction execution begins calculating effective address adds contents given register non-zero offset indirect bit 1 fetches word calculated address repeats effective address calculation effective address zero indirect bit reached resulting effective address used instruction either fetch memory contents simply constant thus example movei a,3 c adds 3 18 lower bits register c puts result register without touching memory three main classes instruction arithmetic logical move conditional jump conditional skip may side effects also several smaller classes arithmetic logical move operations include variants operate immediate-to-register memory-to-register register-to-memory register-and-memory-to-both memory-to-memory since registers may addressed part memory register-to-register operations also defined variants useful though well-defined example add operation variants addi add 18-bit mmediate constant register addm add register contents emory location addb add b oth add register contents memory also put result register elaborate example hlrom h alf l eft r ight nes emory takes left half register contents places right half memory location replaces left half memory location ones halfword instructions also used linked lists hlrz lisp car operator hrrz cdr conditional jump operations examine register contents jump given location depending result comparison mnemonics instructions start jump jumpa meaning jump always jump meaning jump never \u2013 consequence symmetric design instruction set contains several no-ops jump example jumpn loc jumps address loc contents register non-zero also conditional jumps based processor condition register using jrst instruction ka10 ki10 jrst faster jumpa standard unconditional jump jrst conditional skip operations compare register memory contents skip next instruction often unconditional jump depending result comparison simple example camn loc compares contents register contents location loc skips next instruction equal elaborate example tlce loc read test left complement skip equal using contents loc mask selects corresponding bits left half register bits e qual zero skip next instruction case replace bits boolean complement smaller instruction classes include shift/rotate instructions procedure call instructions particularly notable stack instructions push pop corresponding stack call instructions pushj popj byte instructions use special format indirect word extract store arbitrary-sized bit fields possibly advancing pointer next unit original pdp-10 operating system simply called monitor later renamed tops-10 eventually pdp-10 system renamed decsystem-10 early versions monitor tops-10 formed basis stanford waits operating system compuserve time-sharing system time pdp-10 operators began running operating systems assembled major components developed outside dec. example main scheduler might come one university disk service another commercial timesharing services compuserve on-line systems ols rapidata maintained sophisticated inhouse systems programming groups could modify operating system needed businesses without dependent dec others also strong user communities decus users share software developed bbn developed alternative operating system tenex fairly quickly became de facto standard research community dec later ported tenex kl10 enhanced considerably named tops-20 forming decsystem-20 line mit developed ctss compatible time-sharing system run ibm 709 later modified ibm 7094 system also developed incompatible timesharing system run pdp-6 later modified pdp-10 naming related since ibm dec/pdp hardware different i.e incompatible despite 36-bit cpu name selected tom knight play ctss name tymshare developed tymcom-x derived tops-10 using page-based file system like tops-20 1971 1972 researchers xerox parc frustrated top company management refusal let buy pdp-10 xerox bought scientific data systems sds 1969 wanted parc use sds machine instead group led charles p. thacker designed constructed two pdp-10 clone systems named maxc pronounced max honour max palevsky sold sds xerox use maxc also backronym multiple access xerox computer maxc ran modified version tenex third-party attempts sell pdp-10 clones relatively unsuccessful see foonly systems concepts xkl one largest collections decsystem-10 architecture systems ever assembled compuserve peak operated 200 loosely coupled systems three data centers columbus ohio compuserve used systems 'hosts providing access commercial applications compuserve information service first systems bought dec dec abandoned pdp-10 architecture favor vax compuserve pdp-10 customers began buying plug compatible computers systems concepts january 2007 compuserve operating small number pdp-10 architecture machines perform billing routing functions main power supplies used kl-series machines inefficient compuserve engineers designed replacement supply used half energy compuserve offered license design kl supply dec free dec would promise new kl bought compuserve would efficient supply installed dec declined offer another modification made pdp-10 compuserve engineers replacing hundreds incandescent indicator lamps ki10 processor cabinet led lamp modules cost conversion easily offset cost savings electricity use reduced heat labor needed replace burned-out lamps digital followed step world picture right hand side shows light panel mf10 memory contemporary ki10 cpu item part computer museum populated leds 2008 demonstration purposes similar banks indicator lamps kl ks processors pdp-10 eventually eclipsed vax superminicomputer machines descendants pdp-11 dec recognized pdp-10 vax product lines competing decided concentrate software development effort profitable vax pdp-10 product line cancellation announced 1983 including cancelling ongoing jupiter project produce new high-end pdp-10 processor despite project good shape time cancellation minnow project produce desktop pdp-10 may prototyping stage event spelled doom technical cultures spawned original jargon file 1990s become something badge honor among old-time hackers cut one teeth pdp-10 pdp-10 assembly language instructions ldb dpb load/deposit byte live functions programming language common lisp see references section lisp article 36-bit word size pdp-6 pdp-10 influenced programming convenience 2 lisp pointers 18 bits one word crowther created adventure prototypical computer adventure game pdp-10 daglow created first computer baseball game 1971 dungeon 1975 first role-playing video game pdp-10 walter bright originally created empire pdp-10 roy trubshaw richard bartle created first mud pdp-10 zork written pdp-10 infocom used pdp-10s game development testing bill gates paul allen originally wrote altair basic using intel 8080 emulator running pdp-10 harvard university founded microsoft shortly software simulation historical computers simh contains module emulate ks10 cpu windows unix-based machine copies dec original distribution tapes available downloads internet running tops-10 tops-20 system may established also available simh ken harrenstien klh10 software unix-like systems emulates kl10b processor extended addressing 4 mw memory ks10 processor 512 kw memory kl10 emulation supports v.442 kl10 microcode enables run final versions tops-10 tops-20 ks10 emulation supports v.262 microcode final version ks10 dec v.130 microcode final versions ks tops-10 tops-20", + "neighbors": [ + 37, + 78, + 85, + 170, + 206, + 251, + 270, + 308, + 322, + 387, + 388, + 413, + 457, + 506, + 564, + 627, + 721, + 752, + 753, + 919, + 925, + 1009, + 1016, + 1090, + 1118, + 1138, + 1188, + 1213, + 1221, + 1395, + 1486, + 1494, + 1518, + 1609, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1214, + "label": 2, + "text": "APT_(Package_Manager):apt package manager advanced package tool apt free-software user interface works core libraries handle installation removal software debian ubuntu related linux distributions apt simplifies process managing software unix-like computer systems automating retrieval configuration installation software packages either precompiled files compiling source code apt collection tools distributed package named apt significant part apt defined c++ library functions apt also includes command-line programs dealing packages use library three programs codice_1 codice_2 codice_3 commonly used examples apt simple ubiquitous apt package important priority current debian releases therefore included default debian installation apt considered front-end codice_4 friendlier older codice_5 front-end codice_4 performs actions individual packages apt manages relations especially dependencies well sourcing management higher-level versioning decisions release tracking version pinning apt often hailed one debian best features debian developers attribute strict quality controls debian policy major feature apt way calls codice_4 \u2014 topological sorting list packages installed removed calls codice_4 best possible sequence cases utilizes codice_9 options codice_4 however unable calculate avoid reason codice_4 requires action forced user indicates one packages installed package name phrased name portion package fully qualified filename instance debian system libc6 would argument provided codice_12 notably apt automatically gets installs packages upon indicated package depends necessary original distinguishing characteristic apt-based package management systems avoided installation failure due missing dependencies type dependency hell another distinction remote repository retrieval packages apt uses location configuration file codice_13 locate desired packages might available network removable storage medium example retrieve also obtain information available installed packages apt provides command options override decisions made apt-get conflict resolution system one option force particular version package downgrade package render dependent software inoperable user must careful finally codice_14 mechanism allows user create alternative installation policy individual packages user specify packages posix regular expression apt searches cached list packages lists dependencies must installed updated apt retrieves configures installs dependencies automatically triggers treatment deferred actions usage modes apt apt-get facilitate updating installed packages include codice_19 apt configuration folders files apt-config apt configuration query program codice_20 shows configuration apt relies concept repositories order find software resolve dependencies apt repository directory containing packages along index file specified networked cdrom location debian project keeps central repository 25,000 software packages ready download installation number additional repositories added apt sources.list configuration file codice_13 queried apt graphical front-ends often allow modifying codice_29 simply apt-setup package repository specified like system installation packages repository installed without specifying source kept up-to-date automatically addition network repositories compact discs storage media usb keydrive hard disks ... used well using apt-cdrom adding codice_33 source list file apt-cdrom specify different folder cd-rom using codice_34 option i.e hard disk usb keydrive debian cds available download contain debian repositories allows non-networked machines upgraded also one use apt-zip problems may appear several sources offer package systems possibly conflicting sources use apt pinning control sources preferred apt pinning feature allows administrators force apt choose particular versions packages may available different versions different repositories allows administrators ensure packages upgraded versions may conflict packages system sufficiently tested unwelcome changes order pins apt preferences file codice_35 must modified although graphical front-ends often make pinning simpler several front-ends apt exist provide advanced installation functions intuitive interfaces include apt front-ends apt front-ends list dependencies packages installed upgraded ask administrator packages recommended suggested newly installed packages installed automatically install dependencies perform operations system removing obsolete files packages original effort led apt-get program dselect replacement project known codename deity project commissioned brian white debian release manager time first functional version apt-get called dpkg-get intended test program core library functions would underpin new ui much original development apt done irc records lost 'deity creation team mailing list archives include major highlights deity name abandoned official name project due concerns religious nature name apt name eventually decided considerable internal public discussion ultimately name proposed irc accepted finalized mailing lists apt introduced 1998 original test builds circulated irc first debian version included debian 2.1 released 9 march 1999 end original goal deity project replacing dselect user interface ui failure work ui portion project abandoned ui directories removed cvs system first public release apt-get response apt dselect method command line utility great positive development efforts focused maintaining improving tool much later several independent people built uis top libapt-pkg eventually new team picked project began build new features released version 0.6 apt introduced secure apt feature using strong cryptographic signing authenticate package repositories apt originally designed front-end dpkg work debian codice_36 packages version apt modified also work rpm package manager system released apt-rpm fink project ported apt mac os x package management tasks apt also available opensolaris apt-file command packaged separately apt find package includes specific file list files included package remote repositories", + "neighbors": [ + 33, + 134, + 207, + 275, + 301, + 323, + 337, + 412, + 509, + 521, + 716, + 796, + 899, + 961, + 992, + 1004, + 1046, + 1126, + 1138, + 1167, + 1214, + 1225, + 1227, + 1235, + 1292, + 1301, + 1311, + 1366, + 1403, + 1458, + 1509, + 1539, + 1547 + ], + "mask": "Test" + }, + { + "node_id": 1215, + "label": 3, + "text": "Macintosh_LC:macintosh lc macintosh lc personal computer designed manufactured sold apple computer inc. october 1990 march 1992 first macintosh lc family lc introduced macintosh classic repackaging older macintosh plus macintosh iisi new entry-level machine macintosh ii series offered half price macintosh ii significantly lesser performance overall creation lc prompted apple desire produce product could sold school boards price apple ii designed inexpensive manufacturing five major components robots could assemble computer 2400 list price new 600 12-inch color display 3500 less expensive macintosh ii long apple iie card introduced lc apple officially announced retirement ii company wanted focus sales marketing efforts lc original macintosh lc introduced october 1990 initial shipments dealers following december january replaced macintosh lc ii largely built around motorola 68030 processor lc uses pizza box case processor direct slot pds nubus slots 16 mhz 68020 microprocessor lacks floating-point coprocessor although one could added via pds lc 16-bit data bus major performance bottleneck 68020 32-bit cpu lc memory management chipset places limit 10 mb ram matter much installed lc shipped 256 kb vram supporting display resolution 512\u00d7384 pixels 8-bit color vram upgradeable 512 kb supporting display resolution 512\u00d7384 pixels 16-bit color 640\u00d7480 pixels 8-bit color lc commonly purchased apple 12 rgb monitor fixed resolution 512\u00d7384 pixels form factor exactly matching width lc chassis giving two together near all-in-one appearance apple 13 640\u00d7480 trinitron display also available list price 999 cost almost much lc introduction lc lowest resolution supported color macs 640\u00d7480 many programs written color macintosh ii family computers assumed minimum unusable lower resolution several years software developers add support smaller screen resolution order guarantee software would run lcs well color classics use resolution overall general performance machine disappointing due crippling data bus bottleneck making run far slower 16 mhz 68020-based macintosh ii 1987 identical processor ran almost twice fast one difference mac ii mac lc latter socket 68851 mmu therefore could take advantage system 7 virtual memory features standard configuration included floppy drive 40 mb 80 mb hard drive version available education market apple ii card pds slot two floppy drives hard drive lc final macintosh model allow dual internal floppy drives lc macs day featured built-in networking serial port using localtalk ethernet also available option via single pds slot single expansion slot limitation multifunction cards available combining ethernet functionality mmu fpu socket apple iie card pds slot offered bundle education models lcs card allowed lc emulate apple iie combination low-cost color macintosh apple iie compatibility intended encourage education market transition aging apple ii models macintosh platform instead new low-cost ibm pc compatibles despite lc minimal video specs 12 monitor lc supports card switched 560\u00d7384 resolution better compatibility iie 280\u00d7192 high-resolution graphics essentially doubled introduced october 15 1990", + "neighbors": [ + 71, + 99, + 130, + 214, + 228, + 269, + 270, + 511, + 571, + 607, + 610, + 868, + 907, + 917, + 927, + 956, + 972, + 1138, + 1178, + 1237, + 1262, + 1273, + 1294, + 1305, + 1488, + 1544, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 1216, + "label": 2, + "text": "Pipeline_(Unix):pipeline unix unix-like computer operating systems pipeline mechanism inter-process communication using message passing pipeline set processes chained together standard streams output text process stdout passed directly input stdin next one first process completed second started executed concurrently concept pipelines championed douglas mcilroy unix ancestral home bell labs development unix shaping toolbox philosophy named analogy physical pipeline key feature pipelines hiding internals ritchie thompson 1974 turn allows clarity simplicity system article anonymous pipes data written one process buffered operating system read next process uni-directional channel disappears processes completed differs named pipes messages passed pipe named making file remains processes completed standard shell syntax anonymous pipes list multiple commands separated vertical bars pipes common unix verbiage example list files current directory retain lines output containing string view result scrolling page user types following command line terminal codice_1 produces process output stdout piped input stdin process grep key likewise process less process takes input previous process produces output next process via standard streams codice_2 tells shell connect standard output command left standard input command right inter-process communication mechanism called anonymous pipe implemented operating system pipes unidirectional data flows pipeline left right widely used unix shells special syntax construct creation pipelines usage one writes commands sequence separated ascii vertical bar character codice_2 reason often called pipe character shell starts processes arranges necessary connections standard streams including amount buffer storage default standard error streams stderr processes pipeline passed pipe instead merged directed console however many shells additional syntax changing behavior csh shell instance using codice_4 instead codice_2 signifies standard error stream also merged standard output fed next process bourne shell also merge standard error codice_4 since bash 4.0 using codice_7 well redirect different file commonly used simple pipelines shell connects series sub-processes via pipes executes external commands within sub-process thus shell direct processing data flowing pipeline however possible shell perform processing directly using so-called mill pipemill since codice_8 command used mill results initial command construct generally looks something like pipemill may perform intended body loop includes commands codice_9 codice_10 read codice_11 loop first iteration program let call drain read remaining output codice_12 loop terminate results depending specifics drain couple possible ways avoid behavior first drains support option disable reading codice_11 e.g codice_14 alternatively drain need read input codice_11 something useful given codice_16 input pipelines created program control unix codice_17 system call asks operating system construct new anonymous pipe object results two new opened file descriptors process read-only end pipe write-only end pipe ends appear normal anonymous file descriptors except ability seek avoid deadlock exploit parallelism unix process one new pipes generally call codice_18 create new processes process close end pipe using producing consuming data alternatively process might create new thread use pipe communicate named pipes may also created using codice_19 codice_20 presented input output file programs invoked allow multi-path pipes created especially effective combined standard error redirection codice_21 unix-like systems processes pipeline started time streams appropriately connected managed scheduler together processes running machine important aspect setting unix pipes apart pipe implementations concept buffering example sending program may produce 5000 bytes per second receiving program may able accept 100 bytes per second data lost instead output sending program held buffer receiving program ready read data next program pipeline reads buffer linux size buffer 65,536 bytes 64kib open source third-party filter called bfr available provide larger buffers required tools like netcat socat connect pipes tcp/ip sockets pipeline concept invented douglas mcilroy first described man pages version 3 unix mcilroy noticed much time command shells passed output file one program input another ideas implemented 1973 one feverish night wrote mcilroy ken thompson added codice_17 system call pipes shell several utilities version 3 unix next day mcilroy continued saw unforgettable orgy one-liners everybody joined excitement plumbing mcilroy also credits thompson codice_2 notation greatly simplified description pipe syntax version 4 idea eventually ported operating systems dos os/2 microsoft windows beos often notation although developed independently unix pipes related preceded 'communication files developed ken lochner 1960s dartmouth time sharing system tony hoare communicating sequential processes csp mcilroy pipes developed robot icon apple automator also uses pipeline concept chain repetitive commands together holds pipe homage original unix concept feature unix borrowed operating systems taos ms-dos eventually became pipes filters design pattern software engineering", + "neighbors": [ + 330, + 631, + 741, + 754, + 901, + 961, + 1027, + 1138, + 1220, + 1234, + 1304, + 1374 + ], + "mask": "Train" + }, + { + "node_id": 1217, + "label": 9, + "text": "PL/I:pl/i pl/i programming language one pronounced procedural imperative computer programming language developed published ibm designed scientific engineering business system programming used academic commercial industrial organizations since introduced 1960s still used pl/i main domains data processing numerical computation scientific computing system programming supports recursion structured programming linked data structure handling fixed-point floating-point complex character string handling bit string handling language syntax english-like suited describing complex data formats wide set functions available verify manipulate 1950s early 1960s business scientific users programmed different computer hardware using different programming languages business users moving autocoders via comtran cobol scientific users programmed general interpretive programme gip fortran algol george others ibm system/360 announced 1964 delivered 1966 designed common machine architecture groups users superseding existing ibm architectures similarly ibm wanted single programming language users hoped fortran could extended include features needed commercial programmers october 1963 committee formed composed originally three ibmers new york three members share ibm scientific users group propose extensions fortran given constraints fortran unable embarked design new programming language based loosely algol labeled npl acronym conflicted uk national physical laboratory replaced briefly mppl multipurpose programming language 1965 pl/i roman numeral first definition appeared april 1964 ibm took npl starting point completed design level first compiler could written npl definition incomplete scope detail control pl/i language vested initially new york programming center later ibm uk laboratory hursley share guide user groups involved extending language role ibm process controlling language pl/i projects experience defining large language showed need formal definition pl/i project set 1967 ibm laboratory vienna make unambiguous complete specification led turn one first large scale formal methods development vdm fred brooks credited ensuring pl/i character data type language first specified detail manual pl/i language specifications c28-6571 written new york 1965 superseded pl/i language specifications gy33-6003 written hursley 1967 ibm continued develop pl/i late sixties early seventies publishing gy33-6003 manual manuals used multics group early implementers first compiler delivered 1966 standard pl/i approved 1976 goals pl/i evolved early development language competitiveness cobol record handling report writing required language scope usefulness grew include system programming event-driven programming additional goals pl/i achieve goals pl/i borrowed ideas contemporary languages adding substantial new capabilities casting distinctive concise readable syntax many principles capabilities combined give language character important meeting language goals language designed things programmers summary extracted ansi pl/i standard ansi pl/i general-purpose subset standard pl/i program consists set procedures written sequence statements codice_5 construct used include text sources program translation statement types summarized groupings give overview language standard uses organization names may declared represent data following types either single values aggregates form arrays lower-bound upper-bound per dimension structures comprising nested structure array scalar variables codice_6 type comprises attributes base scale precision scale factor codice_7 type encoded within codice_8 mode specified separately codice_9 applied real imaginary parts values computed expressions written using specific set operations builtin functions may applied aggregates well single values together user-defined procedures likewise may operate return aggregate well single values assignment statement assigns values one variables reserved words pl/i statement terminated semi-colon maximum length statement implementation defined comment may appear anywhere program space permitted preceded characters forward slash asterisk terminated characters asterisk forward slash i.e statements may label-prefix introducing entry name codice_10 codice_11 statements label name condition prefix enabling disabling computational condition e.g codice_12 entry label names may single identifiers identifiers followed subscript list constants codice_13 sequence statements becomes group preceded codice_4 statement followed codice_15 statement groups may include nested groups begin blocks codice_16 statement specifies group single statement codice_17 part codice_18 part see sample program group unit iteration begin block codice_19 may contain declarations names internal procedures local block procedure starts codice_11 statement terminated syntactically codice_15 statement body procedure sequence blocks groups statements contains declarations names procedures local procedure codice_22 procedure on-unit single statement block statements written executed one conditions occur computational condition input/output condition one conditions declaration identifier may contain one following attributes need mutually consistent current compilers kednos micro focus particularly ibm implement many extensions standardized version language ibm extensions summarised implementation sub-section compiler later although extensions common compilers lack current standard means compatibility guaranteed language standardization began april 1966 europe ecma tc10 1969 ansi established composite language development committee nicknamed kludge later renamed x3j1 pl/i standardization became joint effort ecma tc/10 ansi x3j1 subset gy33-6003 document offered joint effort ibm became base document standardization major features omitted base document multitasking attributes program optimization e.g codice_27 codice_28 proposals change base document voted upon committees event committees disagreed chairs initially michael marcotty general motors c.a.r hoare representing icl resolve disagreement addition ibm honeywell cdc data general digital equipment prime computer burroughs rca univac served x3j1 along major users eastman kodak mitre union carbide bell laboratories various government university representatives development language occurred standards bodies continuing improvements structured programming internal consistency omission obscure contentious features language development neared end x3j1/tc10 realized number problems document written english text discussion single item might appear multiple places might might agree difficult determine omissions well inconsistencies consequently david beech ibm robert freiburghouse honeywell milton barber cdc m. donald maclaren argonne national laboratory craig franklin data general lois frampton digital equipment editor d.j andrews ibm undertook rewrite entire document producing one complete chapters standard couched formal definition using pl/i machine specify semantics first possibly programming language standard written semi-formal definition pl/i general-purpose subset subset-g standard issued ansi 1981 revision published 1987 general purpose subset widely adopted kernel pl/i implementations pl/i first implemented ibm hursley laboratories united kingdom part development system/360 first production pl/i compiler pl/i f compiler os/360 operating system built john nash team hursley uk runtime library team managed i.m nobby clarke pl/i f compiler written entirely system/360 assembly language release 1 shipped 1966 os/360 real-memory environment compiler designed systems little 64 kilobytes real storage \u2013 f 64 kb s/360 parlance fit large compiler 44 kilobytes memory available 64-kilobyte machine compiler consists control phase large number compiler phases approaching 100 phases brought memory disk one time handle particular language features aspects compilation phase makes single pass partially-compiled program usually held memory aspects language still designed pl/i f implemented omitted later releases pl/i record i/o shipped pl/i f release 2 list processing functions based variables pointers areas offsets locate-mode i/o first shipped release 4 major attempt speed pl/i code compete fortran object code pl/i f release 5 substantial program optimization do-loops facilitated reorder option procedures version pl/i f released tss/360 timesharing operating system system/360 model 67 adapted ibm mohansic lab ibm la gaude lab france developed language conversion programs convert fortran cobol algol programs pl/i f level pl/i pl/i compiler using 16 kilobytes memory developed ibm germany dos/360 low end operating system implements subset pl/i language requiring strings arrays fixed extents thus simplifying run-time environment reflecting underlying operating system lacks dynamic storage allocation controlled storage class shipped within year pl/i f. compilers implemented several groups early 1960s multics project mit one first develop operating system high-level language used early pl/i epl subset dialect pl/i implementation language 1964 epl developed bell labs mit douglas mcilroy robert morris others influential multics pl/i compiler source compiler technology used number manufacturers software groups honeywell pl/i compiler series 60 implementation full ansi x3j1 standard pl/i optimizer checkout compilers produced hursley support common level pl/i language aimed replace pl/i f compiler checkout compiler rewrite pl/i f bsl ibm pl/i-like proprietary implementation language later pl/s performance objectives set compilers shown ibm presentation bcs compilers produce identical results checkout compiler used debug programs would submitted optimizer given compilers entirely different designs handling full pl/i language goal challenging achieved pl/i optimizing compiler took pl/i f compiler ibm workhorse compiler 1970s 1990s like pl/i f multiple pass compiler 44 kilobyte design point entirely new design unlike f compiler perform compile time evaluation constant expressions using run-time library reducing maximum memory compiler phase 28 kilobytes second-time around design succeeded eliminating annoyances pl/i f cascading diagnostics written s/360 macro assembler team led tony burbridge worked pl/i f. macros defined automate common compiler services shield compiler writers task managing real-mode storage allowing compiler moved easily memory models gamut program optimization techniques developed contemporary ibm fortran h compiler deployed optimizer equaled fortran execution speeds hands good programmers announced ibm s/370 1970 shipped first dos/360 operating system august 1971 shortly afterward os/360 first virtual memory ibm operating systems os/vs1 mvs vm/cms developers unaware shoehorning code 28 kb sections ibm poughkeepsie finally ready ship virtual memory support os/360 supported batch programming environments tso cms could run interactively compiler went many versions covering mainframe operating systems including operating systems japanese plug-compatible machines pcms compiler superseded ibm pl/i os/2 aix linux z/os pl/i checkout compiler colloquially checker announced august 1970 designed speed improve debugging pl/i programs team led brian marks three-pass design cut time compile program 25 taken f compiler run interactive terminal converting pl/i programs internal format h-text format interpreted checkout compiler run-time detecting virtually types errors pointers represented 16 bytes containing target address description referenced item thus permitting bad pointer use diagnosed conversational environment error detected control passed user inspect variables introduce debugging statements edit source program time debugging capability mainframe programming environments developed functions offered compiler withdrawn 1990s perhaps commercially successful implementation aside ibm digital equipment 1988 release ansi pl/i 1987 subset implementation strict superset ansi x3.4-1981 pl/i general purpose subset provides features new ansi x3.74-1987 pl/i general purpose subset front end designed robert freiburghouse code generator implemented dave cutler managed design implementation vax/vms runs vms vax alpha tru64 uniprise systems inc. responsible compiler late 1960s early 1970s many us canadian universities establishing time-sharing services campus needed conversational compiler/interpreters use teaching science mathematics engineering computer science dartmouth developing basic pl/i popular choice concise easy teach ibm offerings unsuitable number schools built subsets pl/i interactive support examples compiler developed cornell university teaching dialect called pl/c unusual capability never failing compile program use extensive automatic correction many syntax errors converting remaining syntax errors output statements language almost pl/i implemented ibm pl/c fast compiler plago created polytechnic institute brooklyn used simplified subset pl/i language focused good diagnostic error messages fast compilation times computer systems research group university toronto produced sp/k compilers supported sequence subsets pl/i called sp/1 sp/2 sp/3 ... sp/8 teaching programming programs ran without errors sp/k compilers produced results contemporary pl/i compilers ibm pl/i f compiler ibm checkout compiler cornell university pl/c compiler examples pl0 p. grouse university new south wales plum marvin zelkowitz university maryland. pluto university toronto major revamp pl/i ibm santa teresa california launched entirely new compiler 1992 initial shipment os/2 included ansi-g features many new pl/i features subsequent releases covered additional platforms mvs vm os/390 aix windows -although support windows since withdrawn continued add functions make pl/i fully competitive languages offered pc particularly c c++ areas overtaken corresponding ibm language environment supports inter-operation pl/i programs database transaction systems programs written c c++ cobol compiler supports data types needed intercommunication languages pl/i design principles retained withstood major extension comprising several new data types new statements statement options new exception conditions new organisations program source resulting language compatible super-set pl/i standard earlier ibm compilers major topics added pl/i latest series pl/i compilers z/os called enterprise pl/i z/os leverage code generation latest z/architecture processors z14 z13 zec12 zbc12 z196 z114 via use archlvl parm control passed compilation second high level language supported z/os language environment xl c/c++ first enterprise cobol v5 last codice_30 new computational data type ordinal facilities like pascal e.g codice_39 addition name internal values accessible via built-in functions built-in functions provide access ordinal value predecessor successor codice_40 see allows additional codice_33s declared composed pl/i built-in attributes codice_42 locator data type similar codice_43 data type strongly typed bind particular data structure codice_44 operator used select data structure using handle codice_34 attribute equivalent codice_46 early pl/i specifications permits several scalar variables arrays structures share storage unit occupies amount storage needed largest alternative attributes added new string-handling functions added centre text edit using picture format trim blanks selected characters head tail text codice_63 codice_64 right codice_65 codice_66 functions compound assignment operators la c e.g codice_67 codice_68 codice_69 codice_70 added codice_71 equivalent codice_72 additional parameter descriptors attributes added omitted arguments variable length argument lists codice_73 attribute declares identifier constant derived specific literal value restricted expression parameters codice_74 pass address codice_37 pass value attributes codice_76 codice_77 attributes prevent unintended assignments codice_78 obviates need contrived construct codice_79 codice_40 introduces user-specified names e.g codice_81 combinations built-in attributes e.g codice_82 thus codice_83 creates codice_33 name codice_81 alias set built-in attributes fixed binary 31.0 codice_31 applies structures members provides codice_33 name set structure attributes corresponding substructure member declarations use structure declaration generalisation codice_88 attribute codice_89 statement exit loop codice_90 continue next iteration loop codice_56 codice_57 options iterative groups package construct consisting set procedures declarations use unit variables declared outside procedures local package use codice_93 codice_94 codice_95 storage procedure names used package also local made external means codice_96 option codice_97 codice_98 executed on-unit terminates execution on-unit raises condition procedure called current one thus passing control corresponding on-unit procedure codice_99 condition handles invalid operation codes detected pc processor well illegal arithmetic operations subtraction two infinite values codice_100 condition provided intercept conditions specific on-unit provided current procedure codice_101 condition raised codice_102 statement unable obtain sufficient storage number vendors produced compilers compete ibm pl/i f optimizing compiler mainframes minicomputers 1970s 1980s target usually emerging ansi-g subset pl/i implementations developed mainframes late 1960s mini computers 1970s personal computers 1980s 1990s although main use mainframes pl/i versions dos microsoft windows os/2 aix openvms unix widely used business data processing system use writing operating systems certain platforms complex powerful systems built pl/i sas system initially written pl/i sas data step still modeled pl/i syntax pioneering online airline reservation system sabre originally written ibm 7090 assembler s/360 version largely written using sabretalk purpose built subset pl/i compiler dedicated control program pl/i used write executable formal definition interpret ibm system network architecture pl/i fulfill supporters hopes would displace fortran cobol become major player mainframes remained minority significant player definitive explanation trends 1970s 1980s militated success progressively reducing territory pl/i enjoyed competitive advantage first nature mainframe software environment changed application subsystems database transaction processing cics ims oracle system 370 application generators became focus mainframe users application development significant parts language became irrelevant need use corresponding native features subsystems tasking much input/output fortran used application areas confining pl/i cobol territory users stayed cobol pc became dominant environment program development fortran cobol pl/i became minority languages overtaken c++ java like second pl/i overtaken system programming field ibm system programming community ready use pl/i instead ibm developed adopted proprietary dialect pl/i system programming \u2013 pl/s success pl/s inside ibm c outside ibm unique pl/i strengths system programming became less valuable third development environments grew capabilities interactive software development made unique pl/i interactive debugging strengths less valuable fourth cobol fortran added features structured programming character string operations object orientation reduced pl/i relative advantages mainframes substantial business issues stake ibm hardware competitors little gain much lose success pl/i compiler development expensive ibm compiler groups in-built competitive advantage many ibm users wished avoid locked proprietary solutions early support pl/i vendors best avoid pl/i article uses pl/i standard reference point language features number features significance early implementations standard offered non-ibm compilers de facto language continued grow standard ultimately driven developments personal computer multi tasking implemented pl/i f optimizer newer aix z/os compilers comprised data types codice_104 codice_105 codice_106 codice_107 fork codice_108 join codice_109 codice_110s record i/o statements codice_111 statement unlock locked records codice_112 files event data identify particular event indicate whether complete 1 b incomplete 0 b task data items identify particular task process indicate priority relative tasks first ibm compile time preprocessor built ibm boston advanced programming center located cambridge mass shipped pl/i f compiler codice_5 statement standard rest features dec kednos pl/i compilers implemented much set features ibm additions ibm continued add preprocessor features compilers preprocessor treats written source program sequence tokens copying output source file acting token encountered following compile time statement executed identifier token encountered identifier codice_114d codice_115d assigned compile time value identifier replaced value tokens added output stream require action e.g codice_116 values activated compile time expressions thus compile time variable codice_117 could declared activated assigned using codice_118 subsequent occurrences codice_117 would replaced codice_120 data type supported codice_121 integers codice_122 strings varying length maximum length structure statements simple statements also may label-list feature allowed programmers use identifiers constants e.g product part numbers mathematical constants superseded standard named constants computational data conditional compiling iterative generation source code possible compile-time facilities supported standard several manufacturers implemented facilities structured programming additions made pl/i standardization accepted standard features codice_133 exit iterative codice_4 codice_135 codice_136 added codice_4 case statement general form codice_138 br features included dec pl/i pl/i f offered debug facilities put forward standard implemented others notably check variable-list condition prefix codice_139 on-condition codice_140 option ibm optimizing checkout compilers added additional features appropriate conversational mainframe programming environment e.g codice_141 condition several attempts made design structure member type could one several datatypes codice_46 early ibm growth classes programming theory approaches became possible pl/i base codice_34 codice_33 etc added several compilers pl/i conceived single-byte character world support japanese chinese language becoming essential developments international code pages character string concept expanded accommodate wide non-ascii/ebcdic strings time date handling overhauled deal millennium problem introduction datetime function returned date time one 35 different formats several date functions deal conversions days seconds though language easy learn use implementing pl/i compiler difficult time-consuming language large pl/i needed subsets vendors could produce users master resolved ansi g published compile time facilities unique pl/i took added implementation effort additional compiler passes pl/i compiler two four times large comparable fortran cobol compilers also much slower\u2014supposedly offset gains programmer productivity anticipated ibm first compilers written argue pl/i unusually hard parse pl/i keywords reserved programmers use variable procedure names programs original pl/i f compiler attempts auto-correction encounters keyword used incorrect context often assumes variable name leads cascading diagnostics problem solved later compilers effort needed produce good object code perhaps underestimated initial design language program optimization needed compete excellent program optimization carried available fortran compilers unusually complex owing side effects pervasive problems aliasing variables unpredictable modification occur asynchronously exception handlers may provided statements unseen callers together make difficult reliably predict program variables might modified runtime typical use however user-written error handlers codice_145 often make assignments variables spite aforementioned difficulties ibm produced pl/i optimising compiler 1971 pl/i contains many rarely-used features multitasking support ibm extension language add cost complexity compiler co-processing facilities require multi-programming environment support non-blocking multiple threads processes operating system compiler writers free select whether implement features undeclared variable default declared first occurrence\u2014thus misspelling might lead unpredictable results implicit declaration different fortran programs pl/i f however attribute listing enables programmer detect misspelled undeclared variable many programmers slow move cobol fortran due perceived complexity language immaturity pl/i f compiler programmers sharply divided scientific programmers used fortran business programmers used cobol significant tension even dislike groups pl/i syntax borrowed cobol fortran syntax instead noticing features would make job easier fortran programmers time noticed cobol syntax opinion business language cobol programmers noticed fortran syntax looked upon scientific language cobol fortran programmers viewed bigger version language somewhat intimidated language disinclined adopt another factor pseudo -similarities cobol fortran algol pl/i elements looked similar one languages worked differently pl/i frustrations left many experienced programmers jaundiced view pl/i often active dislike language early unix fortune file contained following tongue-in-cheek description language speaking someone delved intricacies pl/i sure real men could written machine-hogging cycle-grabbing all-encompassing monster allocate array free middle third sure multiply character string times bit string assign result float decimal go ahead free controlled variable procedure parameter reallocate passing back overlay three different types variable memory location anything say write recursive macro well real men use rescan could language obviously designed written real men intended real man use positive side full support pointers data types including pointers structures recursion multitasking string handling extensive built-in functions pl/i indeed quite leap forward compared programming languages time however enough persuade majority programmers shops switch pl/i pl/i f compiler compile time preprocessor unusual outside lisp world using target language syntax semantics e.g compared c preprocessor directives pl/i provides several 'storage classes indicate lifetime variables storage managed codice_146 codice_94 simplest implement codice_93 indicates memory allocated initialized load-time done cobol working-storage early fortran default codice_22 variables pl/i default storage class codice_150 variables codice_151 similar block-structured languages influenced algol like auto storage class c language default storage allocation pascal local-storage ibm cobol storage codice_151 variables allocated upon entry codice_153 procedure on-unit declared compiler runtime system allocate memory stack frame contain housekeeping information variable declared codice_154 code set initial value executed time care required manage use initialization properly large amounts code executed initialize variables every time scope entered especially variable array structure storage codice_151 variables freed block exit codice_156 codice_94 variables used retain variables contents invocations procedure block codice_95 storage also managed using stack pushing popping allocations stack managed programmer using codice_102 codice_160 statements storage codice_94 variables managed using codice_162 instead stack allocations independent lifetimes addressed codice_163 codice_43 variables codice_23 attribute used declare programmer-defined heaps data allocated freed within specific area area deleted read written unit several ways accessing allocated storage different data declarations well defined safe used safely careful programming inherently unsafe and/or machine dependent passing variable argument parameter reference allows argument allocated storage referenced using parameter codice_166 attribute e.g codice_167 allows part variable storage used different consistent declaration language definition includes codice_46 attribute later renamed codice_34 allow different definitions data share storage supported many early ibm compilers usages safe machine independent record i/o list processing produce situations programmer needs fit declaration storage next record item knowing type data structure based variables pointers key programs data structures must designed appropriately typically using fields data structure encode information type size fields held preceding structure constraints current one encoding preceding structure program needs allocate based variable declaration matches current item using expressions extents needed type size information kept current structure self defining structures type-defining fields must ahead type dependent items place every version data structure codice_103-option used self-defining extents e.g string lengths codice_171 codice_172 used allocate instances data structure self-defining structures typing codice_173 fields placed ahead real data records data set items list data structures organised way handled safely machine independent way pl/i implementations except pl/i checkout compiler keep track data structure used storage first allocated codice_94 declaration used pointer storage access storage inherently unsafe machine dependent however usage become important pointer arithmetic typically adding certain amount known address contentious subject computer science addition problem wild references buffer overruns issues arise due alignment length data types used particular machines compilers many cases pointer arithmetic might needed involve finding pointer element inside larger data structure codice_175 function computes pointers safely machine independently pointer arithmetic may accomplished aliasing binary variable pointer codice_176 relies pointers length codice_177 integers aligned boundaries prevalence c free easy attitude pointer arithmetic recent ibm pl/i compilers allow pointers used addition subtraction operators giving simplest syntax compiler options disallow practices safety machine independence paramount pl/i designed programs ran batch mode possible intervention programmer terminal exceptional condition division zero would abort program yielding hexadecimal core dump pl/i exception handling via on-units allowed program stay control face hardware operating system exceptions recover debugging information closing gracefully program became properly debugged exception handling could removed disabled level control became less important conversational execution became commonplace computational exception handling enabled disabled condition prefixes statements blocks including on-units procedures \u2013 e.g codice_178 operating system exceptions input/output storage management always enabled on-unit single statement codice_179-block introduced codice_180 executing statement enables condition specified e.g. codice_181 exception condition occurs condition enabled on-unit condition executed on-units inherited call chain block procedure on-unit activated on-units established invoking activation inherited new activation may over-ridden another codice_180 reestablished codice_183 exception simulated using codice_184 \u2013 e.g help debug exception handlers dynamic inheritance principle on-units allows routine handle exceptions occurring within subroutines uses on-unit effect condition raised standard system action taken often raise codice_25 condition system action reestablished using codice_186 option codice_180 conditions possible complete executing on-unit return point interrupt e.g. codice_188 conditions resume normal execution conditions codice_189 codice_25 condition raised attempted on-unit may terminated codice_191 preventing return point interrupt permitting program continue execution elsewhere determined programmer on-unit needs designed deal exceptions occur on-unit codice_192 statement allows nested error trap error occurs within on-unit control might pass operating system system dump might produced computational conditions continue execution mentioned pl/i codice_193 i/o statements relatively simple syntax offer options many situations end-of-file record transmission errors occur record read written instead complexities handled on-units various file conditions approach adopted codice_23 sub-allocation codice_23 condition existence exception handling on-units effect optimization variables inspected altered on-units values variables might otherwise kept registers statements may need returned storage statements discussed section implementation issues", + "neighbors": [ + 11, + 64, + 78, + 134, + 142, + 152, + 292, + 306, + 378, + 429, + 457, + 579, + 594, + 753, + 790, + 796, + 804, + 873, + 961, + 1009, + 1012, + 1087, + 1138, + 1217, + 1221, + 1222, + 1324, + 1418, + 1629, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1218, + "label": 5, + "text": "Berkeley_r-commands:berkeley r-commands berkeley r-commands suite computer programs designed enable users one unix system log issue commands another unix computer via tcp/ip computer network r-commands developed 1982 computer systems research group university california berkeley based early implementation tcp/ip protocol stack internet csrg incorporated r-commands unix operating system berkeley software distribution bsd r-commands premiered bsd v4.1 among programs suite remote copy remote execution remote login remote shell remote r-commands significant innovation became de facto standards unix operating systems wider public adoption internet inherent security vulnerabilities became problem beginning development secure shell protocols applications 1995 adoption entirely supplanted deployment use r-commands telnet networked systems original berkeley package provides rlogin also features rcp remote-copy allowing files copied network rsh remote-shell allowing commands run remote machine without user logging share hosts.equiv .rhosts access-control scheme although connect different daemon rshd enables user log another server via computer network using tcp network port 513. rlogin also name application layer protocol used software part tcp/ip protocol suite authenticated users act physically present computer rfc 1282 defined states rlogin facility provides remote-echoed locally flow-controlled virtual terminal proper flushing output rlogin communicates daemon rlogind remote host rlogin similar telnet command customizable able connect unix-like hosts rsh opens shell remote computer without login procedure connected user execute commands remote computer shell command-line interface rsh passes input output standard streams sends standard output user console network standard input standard flow tcp port 514 standard error flows different tcp port rsh daemon rshd opens like rsh rexec enables user run shell commands remote computer however unlike rsh server rexec server rexecd requires login authenticates users reading username password unencrypted network socket rexec uses tcp port 512. rcp copy file directory local system remote system remote system local system one remote system another command line arguments cp rcp similar rcp remote files prefixed name remote system unix copy command cp rcp overwrites existing file name target unlike cp provides mechanism warning user overwriting target file like rsh rcp uses tcp port 514 command lists users logged local unix system rwho lists users logged multi-user unix systems local network rwho daemon rwhod maintains database status unix systems local network daemon database also used ruptime program command shows long unix system running since last restart requests status report computers local network returns uptime report computer respond within time limit ruptime reports system information tracked stored daemon rwhod also used rwho command r-commands involve user authentication rcp rexec rlogin rsh share several serious security vulnerabilities due problems r-commands fell relative disuse many unix linux distributions longer including default many networks formerly relied rlogin telnet replaced ssh rlogin-equivalent slogin", + "neighbors": [ + 52, + 109, + 134, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 598, + 646, + 672, + 684, + 732, + 757, + 762, + 763, + 764, + 769, + 770, + 771, + 779, + 816, + 1027, + 1110, + 1132, + 1138, + 1200, + 1206, + 1301, + 1318, + 1326, + 1329, + 1374, + 1386, + 1395, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 1219, + "label": 3, + "text": "General-purpose_computing_on_graphics_processing_units:general-purpose computing graphics processing units general-purpose computing graphics processing units gpgpu rarely gpgp use graphics processing unit gpu typically handles computation computer graphics perform computation applications traditionally handled central processing unit cpu use multiple video cards one computer large numbers graphics chips parallelizes already parallel nature graphics processing addition even single gpu-cpu framework provides advantages multiple cpus offer due specialization chip essentially gpgpu pipeline kind parallel processing one gpus cpus analyzes data image graphic form gpus operate lower frequencies typically many times number cores thus gpus process far pictures graphical data per second traditional cpu migrating data graphical form using gpu scan analyze create large speedup gpgpu pipelines developed beginning 21st century graphics processing e.g. better shaders pipelines found fit scientific computing needs well since developed direction principle arbitrary boolean function including addition multiplication mathematical functions built-up functionally complete set logic operators 1987 conway game life became one first examples general purpose computing using early stream processor called blitter invoke special sequence logical operations bit vectors general-purpose computing gpus became practical popular 2001 advent programmable shaders floating point support graphics processors notably problems involving matrices and/or vectors especially two- three- four-dimensional vectors easy translate gpu acts native speed support types scientific computing community experiments new hardware began matrix multiplication routine 2001 one first common scientific programs run faster gpus cpus implementation lu factorization 2005 early efforts use gpus general-purpose processors required reformulating computational problems terms graphics primitives supported two major apis graphics processors opengl directx cumbersome translation obviated advent general-purpose programming languages apis sh/rapidmind brook accelerator followed nvidia cuda allowed programmers ignore underlying graphical concepts favor common high-performance computing concepts newer hardware vendor-independent offerings include microsoft directcompute apple/khronos group opencl means modern gpgpu pipelines leverage speed gpu without requiring full explicit conversion data graphical form language allows code running cpu poll gpu shader return values create gpgpu framework opencl dominant open general-purpose gpu computing language open standard defined khronos group opencl provides cross-platform gpgpu platform additionally supports data parallel compute cpus opencl actively supported intel amd nvidia arm platforms khronos group also standardised implemented sycl higher-level programming model opencl single-source domain specific embedded language based pure c++11 dominant proprietary framework nvidia cuda nvidia launched cuda 2006 software development kit sdk application programming interface api allows using programming language c code algorithms execution geforce 8 series later gpus programming standards parallel computing include opencl vendor-independent openacc openhmpp mark harris founder gpgpu.org coined term gpgpu created xcelerit designed accelerate large existing c++ c code-bases gpus minimal effort provides simplified programming model automates parallelisation manages devices memory compiles cuda binaries additionally multi-core cpus accelerators targeted source code openvidia developed university toronto 2003-2005 collaboration nvidia. created altimesh compiles common intermediate language cuda binaries supports generics virtual functions debugging profiling integrated visual studio nsight available visual studio extension visual studio marketplace microsoft introduced directcompute gpu computing api released directx 11 api. created quantalea introduces native gpu computing capabilities microsoft .net language f c alea gpu also provides simplified gpu programming model based gpu parallel-for parallel aggregate using delegates automatic memory management matlab supports gpgpu acceleration using parallel computing toolbox matlab distributed computing server third-party packages like jacket gpgpu processing also used simulate newtonian physics physics engines commercial implementations include havok physics fx physx typically used computer video games close metal called stream amd gpgpu technology ati radeon-based gpus c++ accelerated massive parallelism c++ amp library accelerates execution c++ code exploiting data-parallel hardware gpus due trend increasing power mobile gpus general-purpose programming became available also mobile devices running major mobile operating systems google android 4.2 enabled running renderscript code mobile device gpu apple introduced proprietary metal api ios applications able execute arbitrary code apple gpu compute shaders computer video cards produced various vendors nvidia amd ati cards vendors differ implementing data-format support integer floating-point formats 32-bit 64-bit microsoft introduced shader model standard help rank various features graphic cards simple shader model version number 1.0 2.0 3.0 etc. pre-directx 9 video cards supported paletted integer color types various formats available containing red element green element blue element sometimes another alpha value added used transparency common formats early fixed-function limited programmability graphics i.e. including directx 8.1-compliant gpus sufficient also representation used displays important note representation certain limitations given sufficient graphics processing power even graphics programmers would like use better formats floating point data formats obtain effects high dynamic range imaging many gpgpu applications require floating point accuracy came video cards conforming directx 9 specification directx 9 shader model 2.x suggested support two precision types full partial precision full precision support could either fp32 fp24 floating point 32- 24-bit per component greater partial precision fp16 ati radeon r300 series gpus supported fp24 precision programmable fragment pipeline although fp32 supported vertex processors nvidia nv30 series supported fp16 fp32 vendors s3 graphics xgi supported mixture formats fp24 implementations floating point nvidia gpus mostly ieee compliant however true across vendors implications correctness considered important scientific applications 64-bit floating point values double precision float commonly available cpus universally supported gpus gpu architectures sacrifice ieee compliance others lack double-precision efforts occurred emulate double-precision floating point values gpus however speed tradeoff negates benefit offloading computing onto gpu first place operations gpu operate vectorized fashion one operation performed four values example one color r1 g1 b1 modulated another color r2 g2 b2 gpu produce resulting color r1*r2 g1*g2 b1*b2 one operation functionality useful graphics almost every basic data type vector either 2- 3- 4-dimensional examples include vertices colors normal vectors texture coordinates many applications put good use higher performance vector instructions termed single instruction multiple data simd long available cpus originally data simply passed one-way central processing unit cpu graphics processing unit gpu display device time progressed however became valuable gpus store first simple complex structures data passed back cpu analyzed image set scientific-data represented 2d 3d format video card understand gpu access every draw operation analyze data forms quickly whereas cpu must poll every pixel data element much slowly speed access cpu larger pool random-access memory even worse case hard drive slower gpus video cards typically contain smaller amounts expensive memory much faster access transferring portion data set actively analyzed gpu memory form textures easily readable gpu forms results speed increase distinguishing feature gpgpu design ability transfer information bidirectionally back gpu cpu generally data throughput directions ideally high resulting multiplier effect speed specific high-use algorithm gpgpu pipelines may improve efficiency especially large data sets and/or data containing 2d 3d imagery used complex graphics pipelines well scientific computing fields large data sets like genome mapping two- three-dimensional analysis useful especially present biomolecule analysis protein study complex organic chemistry pipelines also vastly improve efficiency image processing computer vision among fields well parallel processing generally heavily optimized pipelines yielded speed increases several hundred times original cpu-based pipeline one high-use task simple example would gpu program collects data average lighting values renders view either camera computer graphics program back main program cpu cpu make adjustments overall screen view advanced example might use edge detection return numerical information processed image representing outlines computer vision program controlling say mobile robot gpu fast local hardware access every pixel picture element image analyze average first example apply sobel edge filter convolution filter second much greater speed cpu typically must access slower random-access memory copies graphic question gpgpu fundamentally software concept hardware concept type algorithm piece equipment specialized equipment designs may however even enhance efficiency gpgpu pipelines traditionally perform relatively algorithms large amounts data massively parallelized gigantic-data-level tasks thus may parallelized even via specialized setups rack computing many similar highly tailored machines built rack adds third layer many computing units using many cpus correspond many gpus bitcoin miners used setups high-quantity processing historically cpus used hardware-managed caches earlier gpus provided software-managed local memories however gpus increasingly used general-purpose applications state-of-the-art gpus designed hardware-managed multi-level caches helped gpus move towards mainstream computing example geforce 200 series gt200 architecture gpus feature l2 cache fermi gpu 768 kib last-level cache kepler gpu 1.5 mib last-level cache maxwell gpu 2 mib last-level cache pascal gpu 4 mib last-level cache gpus large register files allow reduce context-switching latency register file size also increasing different gpu generations e.g. total register file size maxwell gm200 pascal gpus 6 mib 14 mib respectively comparison size register file cpus small typically tens hundreds kilobytes several research projects compared energy efficiency gpus cpus fpgas gpus designed specifically graphics thus restrictive operations programming due design gpus effective problems solved using stream processing hardware used certain ways following discussion referring vertices fragments textures concerns mainly legacy model gpgpu programming graphics apis opengl directx used perform general-purpose computation introduction cuda nvidia 2007 opencl vendor-independent 2008 general-purpose computing apis new gpgpu codes longer necessary map computation graphics primitives stream processing nature gpus remains valid regardless apis used see e.g. gpus process independent vertices fragments process many parallel especially effective programmer wants process many vertices fragments way sense gpus stream processors processors operate parallel running one kernel many records stream stream simply set records require similar computation streams provide data parallelism kernels functions applied element stream gpus vertices fragments elements streams vertex fragment shaders kernels run element read input perform operations write output permissible multiple inputs multiple outputs never piece memory readable writable arithmetic intensity defined number operations performed per word memory transferred important gpgpu applications high arithmetic intensity else memory access latency limit computational speedup ideal gpgpu applications large data sets high parallelism minimal dependency data elements variety computational resources available gpu fact program substitute write texture output instead framebuffer done either render texture rtt render-to-backbuffer-copy-to-texture rtbctt recent stream-out common form stream take gpgpu 2d grid fits naturally rendering model built gpus many computations naturally map grids matrix algebra image processing physically based simulation since textures used memory texture lookups used memory reads certain operations done automatically gpu compute kernels thought body loops example programmer operating grid cpu might code looks like gpu programmer specifies body loop kernel data loop invoking geometry processing sequential code possible control flow program using if-then-else statements various forms loops flow control structures recently added gpus conditional writes could performed using properly crafted series arithmetic/bit operations looping conditional branching possible recent gpus allow branching usually performance penalty branching generally avoided inner loops whether cpu gpu code various methods static branch resolution pre-computation predication loop splitting z-cull used achieve branching hardware support exist map operation simply applies given function kernel every element stream simple example multiplying value stream constant increasing brightness image map operation simple implement gpu programmer generates fragment pixel screen applies fragment program one result stream size stored output buffer computations require calculating smaller stream possibly stream 1 element larger stream called reduction stream generally reduction performed multiple steps results prior step used input current step range operation applied reduced one stream element remains stream filtering essentially non-uniform reduction filtering involves removing items stream based criteria scan operation also termed parallel prefix sum takes vector stream data elements arbitrary associative binary function '+ identity element input a0 a1 a2 a3 ... exclusive scan produces output a0 a0 a1 a0 a1 a2 ... inclusive scan produces output a0 a0 a1 a0 a1 a2 a0 a1 a2 a3 ... require identity exist first glance operation may seem inherently serial efficient parallel scan algorithms possible implemented graphics processing units scan operation uses e.g. quicksort sparse matrix-vector multiplication scatter operation naturally defined vertex processor vertex processor able adjust position vertex allows programmer control information deposited grid extensions also possible controlling large area vertex affects fragment processor perform direct scatter operation location fragment grid fixed time fragment creation altered programmer however logical scatter operation may sometimes recast implemented another gather step scatter implementation would first emit output value output address immediately following gather operation uses address comparisons see whether output value maps current output slot dedicated compute kernels scatter performed indexed writes gather reverse scatter scatter reorders elements according map gather restore order elements according map scatter used dedicated compute kernels gather may performed indexed reads shaders performed texture-lookups sort operation transforms unordered set elements ordered set elements common implementation gpus using radix sort integer floating point data coarse-grained merge sort fine-grained sorting networks general comparable data search operation allows programmer find given element within stream possibly find neighbors specified element gpu used speed search individual element instead used run multiple searches parallel mostly search method used binary search sorted elements variety data structures represented gpu following areas gpus used general purpose computing gpgpu usage bioinformatics \u2020 expected speedups highly dependent system configuration gpu performance compared multi-core x86 cpu socket gpu performance benchmarked gpu supported features may kernel kernel performance comparison details configuration used view application website speedups per nvidia in-house testing isv documentation \u2021 q=quadro gpu t=tesla gpu nvidia recommended gpus application check developer isv obtain certification information", + "neighbors": [ + 13, + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 208, + 210, + 212, + 224, + 227, + 230, + 268, + 270, + 271, + 272, + 280, + 289, + 300, + 306, + 314, + 331, + 335, + 337, + 340, + 352, + 359, + 362, + 375, + 388, + 429, + 435, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 591, + 611, + 643, + 659, + 719, + 737, + 752, + 776, + 796, + 803, + 821, + 846, + 847, + 876, + 907, + 917, + 937, + 946, + 976, + 980, + 984, + 994, + 1002, + 1007, + 1009, + 1013, + 1016, + 1028, + 1052, + 1072, + 1081, + 1099, + 1111, + 1113, + 1125, + 1174, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1465, + 1469, + 1486, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1220, + "label": 3, + "text": "Pipeline_(computing):pipeline computing computing pipeline also known data pipeline set data processing elements connected series output one element input next one elements pipeline often executed parallel time-sliced fashion amount buffer storage often inserted elements computer-related pipelines include operating systems may provide unix-like syntax string several program runs pipeline implement latter simple serial execution rather true pipelining \u2014 namely waiting program finish starting next one pipelining commonly used concept everyday life example assembly line car factory specific task \u2014 installing engine installing hood installing wheels \u2014 often done separate work station stations carry tasks parallel different car car one task performed moves next station variations time needed complete tasks accommodated buffering holding one cars space stations and/or stalling temporarily halting upstream stations next station becomes available suppose assembling one car requires three tasks take 20 10 15 minutes respectively three tasks performed single station factory would output one car every 45 minutes using pipeline three stations factory would output first car 45 minutes new one every 20 minutes example shows pipelining decrease latency total time one item go whole system however increase system throughput rate new items processed first one since throughput pipeline better slowest element designer try divide work resources among stages take time complete tasks car assembly example three tasks took 15 minutes instead 20 10 15 minutes latency would still 45 minutes new car would finished every 15 minutes instead 20 ideal circumstances processing elements synchronized take amount time process item received element released previous one single clock cycle way items flow pipeline constant speed like waves water channel wave pipelines synchronization buffering needed stages besides storage needed data items generally buffering pipeline stages necessary processing times irregular items may created destroyed along pipeline example graphics pipeline processes triangles rendered screen element checks visibility triangle may discard invisible may output two triangular pieces partly hidden buffering also needed accommodate irregularities rates application feeds items first stage consumes output last one buffer two stages may simply hardware register suitable synchronization signalling logic two stages stage stores data item register sends data available signal next stage b b used data responds data received signal stage halts waiting signal storing next data item register stage b halts waiting data available signal ready process next item stage provided yet processing times element variable whole pipeline may often stop waiting element previous ones consume items input buffers frequency pipeline stalls reduced providing space one item input buffer stage multiple-item buffer usually implemented first-in first-out queue upstream stage may still halted queue gets full frequency events decrease buffer slots provided queuing theory tell number buffer slots needed depending variability processing times desired performance stage takes may take much longer others sped designer provide two processing elements carry task parallel single input buffer single output buffer element finishes processing current data item delivers common output buffer takes next data item common input buffer concept non-linear dynamic pipeline exemplified shops banks two cashiers serving clients single waiting queue applications processing item stage may depend results effect processing previous item x later stage b pipeline case stage correctly process item item x cleared stage b situation occurs often instruction pipelines example suppose arithmetic instruction reads contents register supposed modified earlier instruction x let stage fetches instruction operands b stage writes result specified register stage tries process instruction instruction x reaches stage b register may still contain old value effect would incorrect order handle conflicts correctly pipeline must provided extra circuitry logic detects takes appropriate action strategies include pipelined system typically requires resources circuit elements processing units computer memory etc one executes one batch time stages share resources buffering additional synchronization logic may needed elements moreover transfer items separate processing elements may increase latency especially long pipelines additional complexity cost pipelining may considerable dependencies processing different items especially guess-and-backtrack strategy used handle indeed cost implementing strategy complex instruction sets motivated radical proposals simplify computer architecture risc vliw compilers also burdened task rearranging machine instructions improve performance instruction pipelines", + "neighbors": [ + 86, + 123, + 227, + 270, + 280, + 292, + 300, + 314, + 340, + 362, + 375, + 388, + 579, + 611, + 643, + 659, + 681, + 737, + 846, + 847, + 980, + 984, + 1009, + 1013, + 1016, + 1052, + 1076, + 1081, + 1099, + 1111, + 1174, + 1216, + 1219, + 1256, + 1263, + 1272, + 1398, + 1457, + 1503, + 1507, + 1525, + 1552, + 1605, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 1221, + "label": 9, + "text": "Pascal_(programming_language):pascal programming language pascal imperative procedural programming language designed niklaus wirth small efficient language intended encourage good programming practices using structured programming data structuring named honor french mathematician philosopher physicist blaise pascal pascal developed pattern algol 60 language wirth involved process improve language part algol x efforts proposed version known algol w. accepted algol x process bogged 1968 wirth decided abandon algol x process improve algol w releasing pascal 1970 pascal became successful 1970s notably burgeoning minicomputer market compilers also available many microcomputers field emerged late 1970s widely used teaching language university-level programming courses 1980s also used production settings writing commercial software period displaced c programming language late 1980s early 1990s unix-based systems became popular especially release c++ derivative known object pascal designed object-oriented programming developed 1985 used apple computer borland late 1980s later developed delphi microsoft windows platform extensions pascal concepts led languages modula-2 oberon much history computer language design 1960s traced algol 60 language algol developed 1950s explicit goal able clearly describe algorithms included number features structured programming remain common languages day shortly introduction 1962 wirth began working dissertation helmut weber euler programming language euler based algol syntax many concepts derivative primary goal add dynamic lists types allowing used roles similar lisp language published 1965 time number problems algol identified notably lack standardized string system group tasked maintaining language begun algol x process identify improvements calling submissions wirth tony hoare submitted conservative set modifications add strings clean syntax considered minor worth using new standard algol wirth wrote compiler language became known algol w. algol x efforts would go choose dramatically complex language algol 68 complexity language led considerable difficulty producing high-performance compilers widely used industry left opening newer languages pascal influenced algol w efforts explicit goals producing language would efficient compiler run-time allow development well-structured programs useful teaching students structured programming generation students used pascal introductory language undergraduate courses one early successes language introduction ucsd pascal version ran custom operating system could ported different platforms key platform apple ii saw widespread use led use pascal becoming primary high-level language used development apple lisa later macintosh parts original macintosh operating system hand-translated motorola 68000 assembly language pascal sources typesetting system tex donald e. knuth written web original literate programming system based dec pdp-10 pascal successful commercial applications like adobe photoshop written macintosh programmer workshop pascal applications like total commander skype macromedia captivate written delphi object pascal apollo computer used pascal systems programming language operating systems beginning 1980 variants pascal also used everything research projects pc games embedded systems newer pascal compilers exist widely used work lisa larry tesler began corresponding wirth idea adding object oriented extensions language led initially clascal introduced 1983 lisa program faded replaced mac version known object pascal created introduced macintosh 1985 part macapp application framework became apple primary development language early 1990s object pascal extensions added turbo pascal release version 5.5 1989 years object pascal became basis delphi system microsoft windows still used developing windows applications cross-compile code systems free pascal open source cross-platform alternative wirth intention create efficient language regarding compilation speed generated code based structured programming recently popularized concept promoted book algorithms data structures programs pascal roots algol 60 language also introduced concepts mechanisms top algol scalars arrays enabled programmers define complex structured datatypes also made easier build dynamic recursive data structures lists trees graphs important features included records enumerations subranges dynamically allocated variables associated pointers sets make possible meaningful pascal strong typing objects means one type data converted interpreted another without explicit conversions similar mechanisms standard many programming languages today languages influenced pascal development simula 67 wirth algol w. pascal like many programming languages today unlike languages c family allows nested procedure definitions level depth also allows kinds definitions declarations inside subroutines procedures functions enables simple coherent syntax complete program syntactically nearly identical single procedure function except heading one three keywords first pascal compiler designed z\u00fcrich cdc 6000 series mainframe computer family niklaus wirth reports first attempt implement fortran 1969 unsuccessful due fortran inadequacy express complex data structures second attempt implemented c-like language scallop max engeli translated hand r. schild pascal boot-strapping operational mid-1970 many pascal compilers since similarly self-hosting compiler written pascal compiler usually capable recompiling new features added language compiler ported new environment gnu pascal compiler one notable exception written c. first successful port cdc pascal compiler another mainframe completed welsh quinn queen university belfast qub 1972 target icl 1900 series compiler turn parent pascal compiler information computer systems ics multum minicomputer multum port developed \u2013 view using pascal systems programming language \u2013 findlay cupples cavouras davis working department computing science glasgow university thought multum pascal completed summer 1973 may first 16-bit implementation completely new compiler completed welsh et al qub 1977 offered source-language diagnostic feature incorporating profiling tracing type-aware formatted postmortem dumps implemented findlay watt glasgow university implementation ported 1980 icl 2900 series team based southampton university glasgow university standard pascal model implementation also based compiler adapted welsh hay manchester university 1984 check rigorously conformity bsi 6192/iso 7185 standard generate code portable abstract machine first pascal compiler written north america constructed university illinois donald b. gillies pdp-11 generated native machine code propagate language rapidly compiler porting kit created zurich included compiler generated code virtual stack machine i.e code lends reasonably efficient interpretation along interpreter code \u2013 pascal-p system p-system compilers termed pascal-p1 pascal-p2 pascal-p3 pascal-p4 pascal-p1 first version pascal-p4 last come zurich version termed pascal-p1 coined fact many different sources pascal-p existed compiler redesigned enhance portability issued pascal-p2 code later enhanced become pascal-p3 intermediate code backward compatible pascal-p2 pascal-p4 backward compatible pascal-p4 compiler/interpreter still run compiled systems compatible original pascal however accepts subset pascal language pascal-p5 created outside zurich group accepts full pascal language includes iso 7185 compatibility ucsd pascal branched pascal-p2 kenneth bowles utilized create interpretive ucsd p-system ucsd p-system one three operating systems available launch original ibm personal computer ucsd pascal used intermediate code based byte values thus one earliest byte code compilers pascal-p1 pascal-p4 rather based cdc 6600 60 bit word length compiler based pascal-p4 compiler created native binaries released ibm system/370 mainframe computer australian atomic energy commission called aaec pascal compiler abbreviation name commission apple computer created lisa pascal lisa workshop 1982 ported compiler apple macintosh mpw 1985 1985 larry tesler consultation niklaus wirth defined object pascal extensions incorporated lisa pascal mac pascal compilers 1980s anders hejlsberg wrote blue label pascal compiler nascom-2 reimplementation compiler ibm pc marketed names compas pascal polypascal acquired borland renamed turbo pascal turbo pascal became hugely popular thanks aggressive pricing strategy one first full-screen ides fast turnaround time seconds compile link run written highly optimized entirely assembly language making smaller faster much competition 1986 anders ported turbo pascal macintosh incorporated apple object pascal extensions turbo pascal extensions added back pc version turbo pascal version 5.5 time microsoft also implemented object pascal compiler turbo pascal 5.5 large influence pascal community began concentrating mainly ibm pc late 1980s many pc hobbyists search structured replacement basic used product also began adopted professional developers around time number concepts imported c let pascal programmers use c-based api microsoft windows directly extensions included null-terminated strings pointer arithmetic function pointers address-of operator unsafe typecasts turbo pascal derivatives units module concepts modular languages however provide nested module concept qualified import export specific symbols super pascal variant added non-numeric labels return statement expressions names types tmt pascal first borland-compatible compiler 32-bit dos protected mode os/2 win32 operating systems tmt pascal language first one allow function operator overloading universities wisconsin-madison z\u00fcrich karlsruhe wuppertal developed pascal-sc pascal-xsc extensions scientific computation compilers aimed programming numerical computations development pascal-sc started 1978 supporting iso 7185 pascal level 0 level 2 support added later stage pascal-sc originally targeted z80 processor later rewritten dos x86 68000 pascal-xsc various times ported unix linux sunos hp-ux aix microsoft/ibm dos emx os/2 windows operating systems operates generating intermediate c source code compiled native executable pascal-sc language extensions adopted gnu pascal pascal sol designed around 1983 french team implement unix-like systems named sol standard pascal level-1 parametrized array bounds definition allowed alternative keywords predefined identifiers french language included extensions ease system programming e.g equivalent lseek sol team later moved chorusos project design distributed operating system ip pascal implementation pascal programming language using micropolis dos moved rapidly cp/m-80 running z80 moved 80386 machine types 1994 exists today windows/xp linux implementations 2008 system brought new level resulting language termed pascaline pascal calculator includes objects namespace controls dynamic arrays along many extensions generally features functionality type protection c implementation also compatible original pascal implementation standardized iso 7185 pascal original form purely procedural language includes traditional array algol-like control structures reserved words else case ranging single statement begin-end statements block pascal also data structuring constructs included original algol 60 types like records variants pointers enumerations sets procedure/pointers constructs part inherited inspired simula 67 algol 68 niklaus wirth algol w suggestions c. a. r. hoare pascal programs start program keyword list external file descriptors parameters ref name= iso/iec 7185:1990 6.10 pascal iso 7185:1990 6.10 /ref required turbo pascal etc follows main block bracketed begin end keywords semicolons separate statements full stop i.e. period ends whole program unit letter case ignored pascal source example source code use simple hello world program type pascal several popular programming languages defines variable way defines range values variable capable storing also defines set operations permissible performed variables type predefined types range values allowed except boolean implementation defined functions provided data conversions conversion codice_1 codice_2 following functions available codice_3 rounds integer using banker rounding codice_4 rounds towards zero programmer freedom define commonly used data types e.g byte string etc terms predefined types using pascal type declaration facility example subranges ordinal data type simple type except real also made contrast programming languages time pascal supports set type set fundamental concept modern mathematics may used many algorithms feature useful may faster equivalent construct language support sets example many pascal compilers executes faster sets non-contiguous values particularly useful terms performance readability examples involve sets small domains improved performance usually achieved compiler representing set variables bit vectors set operators implemented efficiently bitwise machine code operations types defined types using type declarations complex types constructed simple types shown example pascal files sequences components every file buffer variable denoted f^ procedures get reading put writing move buffer variable next element read introduced read f x x f^ get f write introduced write f x f^ x put f type text predefined file char buffer variable could used inspecting next character used check digit reading integer leads serious problems interactive programs early implementations solved later lazy i/o concept jensen wirth pascal strings represented packed arrays chars therefore fixed length usually space-padded pascal supports use pointers variable nodeptr pointer data type node record pointers used declared forward declaration exception rule things must declared used create new record assign value 10 character fields b record initialise pointer c null pointer nil pascal statements would could also done using statement follows inside scope statement b refer subfields record pointer nodeptr record node pointer type pnode linked lists stacks queues created including pointer type field c record unlike many languages feature pointers pascal allows pointers reference dynamically created variables anonymous allow reference standard static local variables pointers also must associated type pointer one type compatible pointer another type e.g pointer char compatible pointer integer helps eliminate type security issues inherent pointer implementations particularly used pl/i c. also removes risks caused dangling pointers ability dynamically deallocate referenced space using dispose function effect free library function found c means risk dangling pointers entirely eliminated languages java c provide automatic garbage collection entirely eliminate related problem memory leaks restrictions lifted newer dialects pascal structured programming language meaning flow control structured standard statements usually without 'goto commands pascal structures programs procedures functions procedures functions nested depth 'program construct logical outermost block default parameters passed value 'var precedes parameter name passed reference procedure function declarations goto labels constants types variables procedures functions must order ordering requirement originally intended allow efficient single-pass compilation however dialects embarcadero delphi strict ordering requirement declaration sections relaxed pascal adopted many language syntax features algol language including use semicolon statement separator contrast languages pl/i c etc use semicolon statement terminator semicolon needed end keyword record type declaration block case statement keyword repeat statement else keyword statement presence extra semicolon permitted early versions pascal however addition algol-like empty statements 1973 revised report later changes language iso 7185:1983 allow optional semicolons cases semicolon still permitted immediately else keyword statement else follows single statement statement sequence case nested ifs semicolon used avoid dangling else problem inner else outer putatively terminating nested semicolon \u2013 instead terminates clauses instead explicit codice_5 block must used several pascal compilers interpreters available general use 1983 language standardized international standard iec/iso 7185 several local country specific standards including american ansi/ieee770x3.97-1983 iso 7185:1983 two standards differed iso standard included level 1 extension conformant arrays array boundaries array known run time ansi allow extension original wirth version language 1989 iso 7185 revised iso 7185:1990 correct various errors ambiguities found original document iso 7185 stated clarification wirth 1974 language detailed user manual report jensen wirth also notable adding conformant array parameters level 1 standard level 0 pascal without conformant arrays addition made request c. a. r. hoare approval niklaus wirth precipitating cause hoare wanted create pascal version nag numerical algorithms library originally written fortran found possible without extension would allow array parameters varying size similar considerations motivated inclusion iso 7185 facility specify parameter types procedural functional parameters niklaus wirth referred 1974 language standard example differentiate machine specific features cdc 6000 compiler language documented pascal report second part pascal users manual report large machines mainframes minicomputers pascal originated standards generally followed ibm pc ibm pcs borland standards turbo pascal delphi greatest number users thus typically important understand whether particular implementation corresponds original pascal language borland dialect ibm pc versions language began differ advent ucsd pascal interpreted implementation featured several extensions language along several omissions changes many ucsd language features survive today including borland dialect 1990 extended pascal standard created iso/iec 10206 identical technical content ref name= iso/ansi identical /ref ieee/ansi 770x3.160-1989 2019 support extended pascal freepascal compiler planned niklaus wirth zurich version pascal issued outside eth two basic forms cdc 6000 compiler source porting kit called pascal-p system pascal-p compiler left several features full language required bootstrap compiler example procedures functions used parameters undiscriminated variant records packing dispose interprocedural gotos features full compiler omitted ucsd pascal professor kenneth bowles based pascal-p2 kit consequently shared several pascal-p language restrictions ucsd pascal later adopted apple pascal continued several versions although ucsd pascal actually expanded subset pascal pascal-p kit adding back standard pascal constructs still complete standard installation pascal early 1990s alan burns geoff davies developed pascal-fc extension pl/0 niklaus book 'algorithms+data structures=programs several constructs added use pascal-fc teaching tool concurrent programming semaphores monitors channels remote-invocation resources able demonstrate concurrency compiler output kind p-code could executed virtual machine virtual machine simulated normal \u2013 fair \u2013 environment could also simulate extreme conditions unfair mode borland turbo pascal written anders hejlsberg written assembly language independent ucsd zurich compilers however adopted much subset extensions ucsd compiler probably ucsd system common pascal system suitable developing applications resource-limited microprocessor systems available time shrink-wrapped turbo pascal version 3 later incarnations including borland object pascal delphi non-borland near-compatibles became popular programmers including shareware authors swag library pascal code features large amount code written versions delphi mind software products compilers ide/rapid application development rad category pascal generated wide variety responses computing community critical complimentary popular 1980s early 1990s implementations pascal closely followed wirth initial definition language widely criticized unsuitable use outside teaching brian kernighan popularized c language outlined notable criticisms pascal early 1981 article pascal favorite programming language serious problem described array sizes string lengths part type possible write function would accept variable-length arrays even strings parameters made unfeasible write example sorting library kernighan also criticized unpredictable order evaluation boolean expressions poor library support lack static variables raised number smaller issues also stated language provide simple constructs escape knowingly forcibly ignore restrictions limitations general complaints sources noted scope declarations clearly defined original language definition sometimes serious consequences using forward declarations define pointer types record declarations led mutual recursion identifier may may used enumeration list another difficulty like algol 60 language allow procedures functions passed parameters predefine expected type parameters kernighan criticisms directly addressed article pascal programming language bill catambay specifically myth 6 pascal serious programmers despite initial criticisms pascal continued evolve kernighan points apply versions language enhanced suitable commercial product development borland turbo pascal kernighan predicted article extensions fix issues incompatible compiler compiler since early 1990s however varieties seem condensed two categories iso borland-like extended pascal addresses many early criticisms supports variable-length strings variable initialization separate compilation short-circuit boolean operators default codice_6 clauses case statements", + "neighbors": [ + 19, + 29, + 31, + 64, + 65, + 78, + 85, + 99, + 117, + 134, + 152, + 176, + 187, + 195, + 216, + 249, + 292, + 306, + 308, + 322, + 347, + 365, + 373, + 430, + 509, + 521, + 538, + 544, + 567, + 579, + 594, + 597, + 627, + 653, + 682, + 686, + 690, + 756, + 782, + 790, + 805, + 815, + 820, + 825, + 872, + 873, + 901, + 919, + 948, + 961, + 998, + 1005, + 1022, + 1028, + 1037, + 1068, + 1095, + 1118, + 1120, + 1138, + 1146, + 1152, + 1188, + 1189, + 1190, + 1213, + 1217, + 1225, + 1227, + 1232, + 1235, + 1251, + 1264, + 1275, + 1298, + 1301, + 1311, + 1319, + 1324, + 1372, + 1437, + 1457, + 1477, + 1502, + 1536, + 1588, + 1626, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1222, + "label": 3, + "text": "Millicode:millicode computer architecture millicode higher level microcode used implement instruction set computer millicode runs top microcoded instructions uses instructions implement complex instructions visible user system implementation millicode requires special processor mode called millimode provides set registers possibly special instructions invisible user ibm invented concept term millicode system/390 9672-g4 processor 1997 following cited advantages millicode i370 code capitol chipset used es/9370 models similar millicode written combination system/370 instructions code access special hardware features", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 123, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1217, + 1219, + 1256, + 1272, + 1290, + 1398, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1223, + "label": 7, + "text": "Big_V_Telecom:big v telecom big v telecom indian cloud telephony company serves direct clients also works partnership network franchises company first incubated tata elxsi 2013 part 140 billion tata group based pune india big v telecom founded keshor daga 2008 flagship product yocc contact centre 2012 part company corporate social responsibility drive big v telecom established call anna virtual contact centre anti-corruption activist anna hazare indian anti-corruption movement 2012 big v telecom partnered western central railways providing 131 railway enquiry number firm also partnered bsnl providing value added services maharashtra august 2015 firm launched product named voter first propagated india first voter engagement issue resolution application custom built politicians interact constituents download android ios stores reports suggest voter first name sub-division big v telecom firm name appear app stores instead politician apps appear respective names picture identity mobile app firm past also partnered tv18 commoditycontrol.com providing on-spot updates commodity rates via phone calls consumers self-funded company recently announced looking venture capital funding expansion within outside india ndtv profit business services excellence award innovative franchise business service sector 2010 aegis graham bell award innovative managed services 2012 tata elxsi takes big v telecom incubator programme tata elxsi incubates big v telecom tata elxsi picks big v telecom first startup new incub te program tata elxsi sets business incubator cloud telephony firm big v telecom looking raise 6.5m funding big v telecom incubated tata elxsi expands footprints delhi/ncr big v telecom incubated tata elxsi expands footprints delhi/ncr big v telecom incubated tata elxsi expands footprints delhi/ncr", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1224, + "label": 2, + "text": "Memory_protection:memory protection memory protection way control memory access rights computer part modern instruction set architectures operating systems main purpose memory protection prevent process accessing memory allocated prevents bug malware within process affecting processes operating system protection may encompass accesses specified area memory write accesses attempts execute contents area attempt access unowned memory results hardware fault called segmentation fault storage violation exception generally causing abnormal termination offending process memory protection computer security includes additional techniques address space layout randomization executable space protection segmentation refers dividing computer memory segments reference memory location includes value identifies segment offset within segment x86 architecture multiple segmentation features helpful using protected memory architecture x86 architecture global descriptor table local descriptor tables used reference segments computer memory pointers memory segments x86 processors also stored processor segment registers initially x86 processors 4 segment registers cs code segment ss stack segment ds data segment es extra segment later another two segment registers added \u2013 fs gs paging memory address space divided equal-sized blocks called pages using virtual memory hardware page reside location computer physical memory flagged protected virtual memory makes possible linear virtual memory address space use access blocks fragmented physical memory address space computer architectures support paging also use pages basis memory protection page table maps virtual memory physical memory page table usually invisible process page tables make easier allocate additional memory new page allocated anywhere physical memory impossible application access page explicitly allocated every memory address either points page allocated application generates interrupt called page fault unallocated pages pages allocated application addresses application point view page fault may necessarily indicate error page faults used memory protection operating system may manage page table way reference page previously swapped disk causes page fault operating system intercepts page fault loads required memory page application continues fault occurred scheme known virtual memory allows in-memory data currently use moved disk storage back way transparent applications increase overall memory capacity systems page fault mechanism also used executable space protection w^x memory protection key mpk mechanism divides physical memory blocks particular size e.g. 4 kib associated numerical value called protection key process also protection key value associated memory access hardware checks current process protection key matches value associated memory block accessed exception occurs mechanism introduced system/360 architecture available today system z mainframes heavily used system z operating systems subsystems system/360 protection keys described associated physical addresses different protection key mechanism used architectures hewlett-packard/intel ia-64 hewlett-packard pa-risc associated virtual addresses allow multiple keys per process itanium pa architectures translations tlb entries keys itanium access ids pa associated running process several protection key registers 16 itanium 4 hp/pa translation selected virtual address key compared protection key registers match plus possible checks access permitted none match fault exception generated software fault handler desired check missing key larger list keys maintained software thus protection key registers inside processor may treated software-managed cache larger list keys associated process pa 15\u201318 bits key itanium mandates least 18 keys usually associated protection domains libraries modules etc x86 protection keys architecture allows tagging virtual addresses user pages 16 protection keys pages tagged protection key constitute protection domain new register contains permissions associated protection domain load store operations checked page table permissions protection key permissions associated protection domain virtual address allowed permissions allow access protection key permissions set user space allowing applications directly restrict access application data without os intervention since protection keys associated virtual address protection domains per address space processes running different address spaces use 16 domains simulation use monitoring program interpret machine code instructions computer architectures instruction set simulator provide memory protection using segmentation-like scheme validating target address length instruction real time actually executing simulator must calculate target address length compare list valid address ranges holds concerning thread environment dynamic memory blocks acquired since thread inception plus valid shared static memory slots meaning valid may change throughout thread life depending upon context may sometimes allowed alter static block storage sometimes depending upon current mode execution may may depend storage key supervisor state generally advisable use method memory protection adequate facilities exist cpu takes valuable processing power computer however generally used debugging testing purposes provide extra fine level granularity otherwise generic storage violations indicate precisely instruction attempting overwrite particular section storage may storage key unprotected storage capability-based addressing method memory protection unused modern commercial computers method pointers replaced protected objects called capabilities created using privileged instructions may executed kernel process authorized effectively lets kernel control processes may access objects memory need use separate address spaces context switches commercial products used capability based security plessey system 250 ibm system/38 intel iapx 432 architecture keykos capability approaches widely used research systems eros combex darpa browser used conceptually basis virtual machines notably smalltalk java currently darpa-funded cheri project university cambridge working create modern capability machine also supports legacy software dynamic tainting technique protecting programs illegal memory accesses memory allocated runtime technique taints memory corresponding pointer using taint mark taint marks suitably propagated program executes checked every time memory address accessed pointer p taint marks associated p differ execution stopped illegal access reported sparc m7 processors higher implement dynamic tainting hardware oracle markets feature silicon secured memory ssm previously branded application data integrity adi lowrisc cpu design includes dynamic tainting name tagged memory protection level particular implementation may measured closely adheres principle minimum privilege different operating systems use different forms memory protection separation although memory protection common mainframes many minicomputer systems 1960s true memory separation used home computer operating systems os/2 risc os released 1987 prior systems lack protection even used form interprocess communication sending pointer processes possible processes access system memory windows 9x family operating systems operating systems implement memory protection include unix-like systems codice_1 system call used control memory protection", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 85, + 99, + 134, + 170, + 171, + 185, + 187, + 210, + 265, + 270, + 272, + 322, + 353, + 379, + 380, + 387, + 413, + 434, + 445, + 465, + 477, + 583, + 650, + 664, + 681, + 720, + 721, + 728, + 752, + 754, + 755, + 797, + 860, + 884, + 891, + 893, + 941, + 954, + 961, + 966, + 984, + 996, + 1002, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1069, + 1138, + 1155, + 1187, + 1202, + 1284, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1530, + 1535, + 1546, + 1578, + 1610, + 1616, + 1629, + 1631, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1225, + "label": 9, + "text": "Python_(programming_language):python programming language python interpreted high-level general-purpose programming language created guido van rossum first released 1991 python design philosophy emphasizes code readability notable use significant whitespace language constructs object-oriented approach aim help programmers write clear logical code small large-scale projects python dynamically typed garbage-collected supports multiple programming paradigms including procedural object-oriented functional programming python often described batteries included language due comprehensive standard library python conceived late 1980s successor abc language python 2.0 released 2000 introduced features like list comprehensions garbage collection system capable collecting reference cycles python 3.0 released 2008 major revision language completely backward-compatible much python 2 code run unmodified python 3 due concern amount code written python 2 support python 2.7 last release 2.x series extended 2020 language developer guido van rossum shouldered sole responsibility project july 2018 shares leadership member five-person steering council python interpreters available many operating systems global community programmers develops maintains cpython open source reference implementation non-profit organization python software foundation manages directs resources python cpython development python conceived late 1980s guido van rossum centrum wiskunde informatica cwi netherlands successor abc language inspired setl capable exception handling interfacing amoeba operating system implementation began december 1989 van rossum continued python lead developer july 12 2018 announced permanent vacation responsibilities python benevolent dictator life title python community bestowed upon reflect long-term commitment project chief decision-maker january 2019 active python core developers elected brett cannon nick coghlan barry warsaw carol willing van rossum five-member steering council lead project python 2.0 released 16 october 2000 many major new features including cycle-detecting garbage collector support unicode python 3.0 released 3 december 2008 major revision language completely backward-compatible many major features backported python 2.6.x 2.7.x version series releases python 3 include codice_1 utility automates least partially translation python 2 code python 3 python 2.7 end-of-life date initially set 2015 postponed 2020 concern large body existing code could easily forward-ported python 3 january 2017 google announced work python 2.7 go transcompiler improve performance concurrent workloads python multi-paradigm programming language object-oriented programming structured programming fully supported many features support functional programming aspect-oriented programming including metaprogramming metaobjects magic methods many paradigms supported via extensions including design contract logic programming python uses dynamic typing combination reference counting cycle-detecting garbage collector memory management also features dynamic name resolution late binding binds method variable names program execution python design offers support functional programming lisp tradition codice_2 codice_3 codice_4 functions list comprehensions dictionaries sets generator expressions standard library two modules itertools functools implement functional tools borrowed haskell standard ml language core philosophy summarized document zen python pep 20 includes aphorisms rather functionality built core python designed highly extensible compact modularity made particularly popular means adding programmable interfaces existing applications van rossum vision small core language large standard library easily extensible interpreter stemmed frustrations abc espoused opposite approach python strives simpler less-cluttered syntax grammar giving developers choice coding methodology contrast perl one way motto python embraces one\u2014and preferably one\u2014obvious way design philosophy alex martelli fellow python software foundation python book author writes describe something 'clever considered compliment python culture python developers strive avoid premature optimization reject patches non-critical parts cpython reference implementation would offer marginal increases speed cost clarity speed important python programmer move time-critical functions extension modules written languages c use pypy just-in-time compiler cython also available translates python script c makes direct c-level api calls python interpreter important goal python developers keeping fun use reflected language name\u2014a tribute british comedy group monty python\u2014and occasionally playful approaches tutorials reference materials examples refer spam eggs famous monty python sketch instead standard foo bar common neologism python community pythonic wide range meanings related program style say code pythonic say uses python idioms well natural shows fluency language conforms python minimalist philosophy emphasis readability contrast code difficult understand reads like rough transcription another programming language called unpythonic users admirers python especially considered knowledgeable experienced often referred pythonists pythonistas pythoneers python meant easily readable language formatting visually uncluttered often uses english keywords languages use punctuation unlike many languages use curly brackets delimit blocks semicolons statements optional fewer syntactic exceptions special cases c pascal python uses whitespace indentation rather curly brackets keywords delimit blocks increase indentation comes certain statements decrease indentation signifies end current block thus program visual structure accurately represents program semantic structure feature also sometimes termed off-side rule python statements include among others python support tail call optimization first-class continuations according guido van rossum never however better support coroutine-like functionality provided 2.5 extending python generators 2.5 generators lazy iterators information passed unidirectionally generator python 2.5 possible pass information back generator function python 3.3 information passed multiple stack levels python expressions similar languages c java python distinction expressions statements rigidly enforced contrast languages common lisp scheme ruby leads duplicating functionality example statements part expression list comprehensions lambda expressions expressions contain statements particular case assignment statement codice_78 form part conditional expression conditional statement advantage avoiding classic c error mistaking assignment operator codice_79 equality operator codice_36 conditions codice_81 syntactically valid probably unintended c code codice_82 causes syntax error python methods objects functions attached object class syntax codice_83 normal methods functions syntactic sugar codice_84 python methods explicit codice_85 parameter access instance data contrast implicit codice_85 codice_87 object-oriented programming languages e.g. c++ java objective-c ruby python uses duck typing typed objects untyped variable names type constraints checked compile time rather operations object may fail signifying given object suitable type despite dynamically typed python strongly typed forbidding operations well-defined example adding number string rather silently attempting make sense python allows programmers define types using classes often used object-oriented programming new instances classes constructed calling class example codice_88 codice_89 classes instances metaclass codice_90 instance allowing metaprogramming reflection version 3.0 python two kinds classes old-style new-style syntax styles difference whether class codice_91 inherited directly indirectly new-style classes inherit codice_91 instances codice_90 versions python 2 python 2.2 onwards kinds classes used old-style classes eliminated python 3.0 long term plan support gradual typing python 3.5 syntax language allows specifying static types checked default implementation cpython experimental optional static type checker named mypy supports compile-time type checking python usual c language arithmetic operators codice_50 codice_95 codice_96 codice_33 codice_58 also codice_34 exponentiation e.g codice_100 codice_101 new matrix multiply codice_35 operator included version 3.5 additionally unary operator codice_103 essentially inverts bits one argument integers means codice_104 operators include bitwise shift operators codice_105 shifts codice_106 left codice_107 places codice_108 codice_109 shifts codice_106 right codice_107 places codice_112 behavior division changed significantly time division integers produces accurate floating point results rounding towards negative infinity though different languages adds consistency instance means equation codice_126 always true also means equation codice_127 valid positive negative values codice_128 however maintaining validity equation means result codice_129 expected half-open interval 0 b codice_130 positive integer lie interval b 0 codice_130 negative python provides codice_132 function rounding float nearest integer tie-breaking versions 3 use round-away-from-zero codice_133 1.0 codice_134 \u22121.0 python 3 uses round even codice_135 2 codice_136 2 python allows boolean expressions multiple equality relations manner consistent general use mathematics example expression codice_137 tests whether codice_128 less codice_130 codice_130 less codice_141 c-derived languages interpret expression differently c expression would first evaluate codice_142 resulting 0 1 result would compared codice_141 python extensive built-in support arbitrary precision arithmetic integers transparently switched machine-supported maximum fixed-precision usually 32 64 bits belonging python type codice_144 arbitrary precision belonging python type codice_145 needed latter l suffix textual representation python 3 distinction codice_144 codice_145 types eliminated behavior entirely contained codice_144 class codice_149 type/class module codice_150 since version 2.4 provides decimal floating point numbers arbitrary precision several rounding modes codice_151 type module codice_152 since version 2.6 provides arbitrary precision rational numbers due python extensive mathematics library third-party library numpy extends native capabilities frequently used scientific scripting language aid problems numerical data processing manipulation python large standard library commonly cited one greatest strengths provides tools suited many tasks internet-facing applications many standard formats protocols mime http supported includes modules creating graphical user interfaces connecting relational databases generating pseudorandom numbers arithmetic arbitrary precision decimals manipulating regular expressions unit testing parts standard library covered specifications example web server gateway interface wsgi implementation codice_153 follows pep 333 modules specified code internal documentation test suites supplied however standard library cross-platform python code modules need altering rewriting variant implementations python implementations including cpython include read\u2013eval\u2013print loop repl permitting function command line interpreter user enters statements sequentially receives results immediately shells including idle ipython add abilities auto-completion session state retention syntax highlighting well standard desktop integrated development environments web browser-based ides sagemath intended developing science math-related python programs pythonanywhere browser-based ide hosting environment canopy ide commercial python ide emphasizing scientific computing cpython reference implementation python written c meeting c89 standard several select c99 features compiles python programs intermediate bytecode executed virtual machine cpython distributed large standard library written mixture c native python available many platforms including windows modern unix-like systems platform portability one earliest priorities pypy fast compliant interpreter python 2.7 3.5 just-in-time compiler brings significant speed improvement cpython stackless python significant fork cpython implements microthreads use c memory stack thus allowing massively concurrent programs pypy also stackless version micropython circuitpython python 3 variants optimised microcontrollers includes lego mindstorms ev3 just-in-time python compilers developed unsupported 2005 nokia released python interpreter series 60 mobile phones named pys60 includes many modules cpython implementations additional modules integrate symbian operating system project kept up-to-date run variants s60 platform several third-party modules available nokia n900 also supports python gtk widget libraries enabling programs written run target device several compilers high-level object languages either unrestricted python restricted subset python language similar python source language performance comparison various python implementations non-numerical combinatorial workload presented euroscipy '13 python development conducted largely python enhancement proposal pep process primary mechanism proposing major new features collecting community input issues documenting python design decisions python coding style covered pep 8 outstanding peps reviewed commented python community steering council enhancement language corresponds development cpython reference implementation mailing list python-dev primary forum language development specific issues discussed roundup bug tracker maintained python.org development originally took place self-hosted source-code repository running mercurial python moved github january 2017 cpython public releases come three types distinguished part version number incremented many alpha beta release-candidates also released previews testing final releases although rough schedule release often delayed code ready python development team monitors state code running large unit test suite development using buildbot continuous integration system community python developers also contributed 86,000 software modules python package index pypi official repository third-party python libraries major academic conference python pycon also special python mentoring programmes pyladies python name derived british comedy group monty python python creator guido van rossum enjoyed developing language monty python references appear frequently python code culture example metasyntactic variables often used python literature spam eggs instead traditional foo bar official python documentation also contains various references monty python routines prefix py- used show something related python examples use prefix names python applications libraries include pygame binding sdl python commonly used create games pyqt pygtk bind qt gtk python respectively pypy python implementation originally written python python api documentation generators include since 2003 python consistently ranked top ten popular programming languages tiobe programming community index third popular language behind java c selected programming language year 2007 2010 2018 empirical study found scripting languages python productive conventional languages c java programming problems involving string manipulation search dictionary determined memory consumption often better java much worse c c++ large organizations use python include wikipedia google yahoo cern nasa facebook amazon instagram spotify smaller entities like ilm ita social news networking site reddit written entirely python python serve scripting language web applications e.g. via mod_wsgi apache web server web server gateway interface standard api evolved facilitate applications web frameworks like django pylons pyramid turbogears web2py tornado flask bottle zope support developers design maintenance complex applications pyjs ironpython used develop client-side ajax-based applications sqlalchemy used data mapper relational database twisted framework program communications computers used example dropbox libraries numpy scipy matplotlib allow effective use python scientific computing specialized libraries biopython astropy providing domain-specific functionality sagemath mathematical software notebook interface programmable python library covers many aspects mathematics including algebra combinatorics numerical mathematics number theory calculus python successfully embedded many software products scripting language including finite element method software abaqus 3d parametric modeler like freecad 3d animation packages 3ds max blender cinema 4d lightwave houdini maya modo motionbuilder softimage visual effects compositor nuke 2d imaging programs like gimp inkscape scribus paint shop pro musical notation programs like scorewriter capella gnu debugger uses python pretty printer show complex structures c++ containers esri promotes python best choice writing scripts arcgis also used several video games adopted first three available programming languages google app engine two java go python commonly used artificial intelligence projects help libraries like tensorflow keras scikit-learn scripting language modular architecture simple syntax rich text processing tools python often used natural language processing many operating systems include python standard component ships linux distributions amigaos 4 freebsd package netbsd openbsd package macos used command line terminal many linux distributions use installers written python ubuntu uses ubiquity installer red hat linux fedora use anaconda installer gentoo linux uses python package management system portage python used extensively information security industry including exploit development sugar software one laptop per child xo developed sugar labs written python raspberry pi single-board computer project adopted python main user-programming language libreoffice includes python intends replace java python python scripting provider core feature since version 4.0 7 february 2013 python design philosophy influenced many programming languages python development practices also emulated languages example practice requiring document describing rationale issues surrounding change language python pep also used tcl erlang python received tiobe programming language year awards 2007 2010 2018 award given language greatest growth popularity year measured tiobe index", + "neighbors": [ + 7, + 12, + 19, + 29, + 31, + 33, + 65, + 78, + 81, + 117, + 134, + 148, + 152, + 176, + 189, + 201, + 207, + 216, + 246, + 275, + 292, + 301, + 306, + 308, + 313, + 324, + 347, + 365, + 373, + 378, + 401, + 405, + 447, + 484, + 507, + 509, + 526, + 538, + 541, + 544, + 565, + 567, + 570, + 579, + 592, + 593, + 594, + 597, + 653, + 682, + 684, + 686, + 690, + 695, + 716, + 725, + 742, + 756, + 766, + 782, + 790, + 796, + 799, + 815, + 819, + 820, + 824, + 825, + 826, + 857, + 872, + 873, + 875, + 899, + 916, + 919, + 923, + 926, + 934, + 948, + 961, + 985, + 987, + 991, + 992, + 998, + 1004, + 1005, + 1018, + 1028, + 1037, + 1044, + 1046, + 1059, + 1068, + 1088, + 1096, + 1102, + 1120, + 1138, + 1146, + 1152, + 1163, + 1189, + 1190, + 1212, + 1214, + 1221, + 1227, + 1231, + 1235, + 1242, + 1246, + 1251, + 1254, + 1264, + 1269, + 1278, + 1286, + 1292, + 1298, + 1311, + 1318, + 1319, + 1324, + 1366, + 1372, + 1388, + 1403, + 1414, + 1418, + 1430, + 1437, + 1457, + 1481, + 1491, + 1502, + 1524, + 1532, + 1536, + 1538, + 1547, + 1554, + 1558, + 1570, + 1582, + 1633, + 1635, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1226, + "label": 3, + "text": "Xenon_(video_game):xenon video game xenon 1988 vertical scrolling shooter video game first developed bitmap brothers published melbourne house owned mastertronic featured play-by-phone game saturday-morning kids show get fresh xenon followed 1989 according game instruction manual player assumes role darrian future space pilot federation currently war mysterious violent alien species called xenites lasted decade response mayday transmission captain xod following attack trading fleet darrian forced travel xenite occupied territory order support unlike vertically scrolling shooters player craft two modes flying plane ground tank transition crafts initiated almost time play except mid- end-of-level boss sections well certain levels certain mode forced mode chosen depends nature threat player faces destroying enemies released power-ups player could catch enhance ship originally released atari st xenon quickly ported platforms amiga amstrad cpc commodore 64 dos msx zx spectrum arcade machine version game also released mastertronic arcadia division ran commodore amiga hardware xenon almost universally well received launch reviewers magazines covering range platforms scoring game highly german magazine power play bucked trend awarding score 4.5 10", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1227, + "label": 9, + "text": "Perl:perl perl family two high-level general-purpose interpreted dynamic programming languages perl usually refers perl 5 may also refer redesigned sister language perl 6 though perl officially acronym various backronyms use including practical extraction reporting language perl originally developed larry wall 1987 general-purpose unix scripting language make report processing easier since undergone many changes revisions perl 6 began redesign perl 5 2000 eventually evolved separate language languages continue developed independently different development teams liberally borrow ideas one another perl languages borrow features programming languages including c shell script sh awk sed wall also alludes basic lisp introduction learning perl schwartz christiansen provide text processing facilities without arbitrary data-length limits many contemporary unix commandline tools facilitating manipulation text files perl 5 gained widespread popularity late 1990s cgi scripting language part due unsurpassed regular expression string parsing abilities addition cgi perl 5 used system administration network programming finance bioinformatics applications guis nicknamed swiss army chainsaw scripting languages flexibility power also ugliness 1998 also referred duct tape holds internet together reference ubiquitous use glue language perceived inelegance larry wall began work perl 1987 working programmer unisys released version 1.0 comp.sources.misc newsgroup december 18 1987 language expanded rapidly next years perl 2 released 1988 featured better regular expression engine perl 3 released 1989 added support binary data streams originally documentation perl single lengthy man page 1991 programming perl known many perl programmers camel book cover published became de facto reference language time perl version number bumped 4 mark major change language identify version well documented book perl 4 went series maintenance releases culminating perl 4.036 1993 whereupon wall abandoned perl 4 begin work perl 5 initial design perl 5 continued 1994 perl5-porters mailing list established may 1994 coordinate work porting perl 5 different platforms remains primary forum development maintenance porting perl 5 perl 5.000 released october 17 1994 nearly complete rewrite interpreter added many new features language including objects references lexical variables modules importantly modules provided mechanism extending language without modifying interpreter allowed core interpreter stabilize even enabled ordinary perl programmers add new language features perl 5 active development since perl 5.001 released march 13 1995 perl 5.002 released february 29 1996 new prototypes feature allowed module authors make subroutines behaved like perl builtins perl 5.003 released june 25 1996 security release one important events perl 5 history took place outside language proper consequence module support october 26 1995 comprehensive perl archive network cpan established repository perl language perl modules may 2017 carries 185,178 modules 35,190 distributions written 13,071 authors mirrored worldwide 245 locations perl 5.004 released may 15 1997 included among things universal package giving perl base object classes automatically derived ability require versions modules another significant development inclusion cgi.pm module contributed perl popularity cgi scripting language perl 5.004 also added support microsoft windows several operating systems perl 5.005 released july 22 1998 release included several enhancements regex engine new hooks backend codice_1 modules codice_2 regex quote operator large selection new core modules added support several operating systems including beos perl 5.6 released march 22 2000 major changes included 64-bit support unicode string representation support files 2 gib keyword developing perl 5.6 decision made switch versioning scheme one similar open source projects 5.005_63 next version became 5.5.640 plans development versions odd numbers stable versions even numbers 2000 wall put forth call suggestions new version perl community process resulted 361 rfc request comments documents used guiding development perl 6 2001 work began apocalypses perl 6 series documents meant summarize change requests present design next generation perl presented digest rfcs rather formal document point perl 6 existed description language perl 5.8 first released july 18 2002 nearly yearly updates since perl 5.8 improved unicode support added new i/o implementation added new thread implementation improved numeric accuracy added several new modules 2013 version still remains popular version perl used red hat 5 suse 10 solaris 10 hp-ux 11.31 aix 5 2004 work began synopses documents originally summarized apocalypses became specification perl 6 language february 2005 audrey tang began work pugs perl 6 interpreter written haskell first concerted effort towards making perl 6 reality effort stalled 2006 december 18 2007 20th anniversary perl 1.0 perl 5.10.0 released perl 5.10.0 included notable new features brought closer perl 6 included switch statement called given regular expressions updates smart match operator ~~ around time development began earnest another implementation perl 6 known rakudo perl developed tandem parrot virtual machine november 2009 rakudo perl regular monthly releases complete implementation perl 6 major change development process perl 5 occurred perl 5.11 development community switched monthly release cycle development releases yearly schedule stable releases plan bugfix point releases follow stable releases every three months april 12 2010 perl 5.12.0 released notable core enhancements include new codice_3 syntax yada yada operator intended mark placeholder code yet implemented implicit strictures full y2038 compliance regex conversion overloading dtrace support unicode 5.2 january 21 2011 perl 5.12.3 released contains updated modules documentation changes version 5.12.4 released june 20 2011 latest version branch 5.12.5 released november 10 2012 may 14 2011 perl 5.14 released json support built-in 5.14.0 latest version branch 5.14.4 released march 10 2013 may 20 2012 perl 5.16 released notable new features include ability specify given version perl one wishes emulate allowing users upgrade version perl still run old scripts would normally incompatible perl 5.16 also updates core support unicode 6.1 may 18 2013 perl 5.18 released notable new features include new dtrace hooks lexical subs core subs overhaul hash security reasons support unicode 6.2 may 27 2014 perl 5.20 released notable new features include subroutine signatures hash slices/new slice syntax postfix dereferencing experimental unicode 6.3 rand using consistent random number generator observers credit release perl 5.10 start modern perl movement particular phrase describes style development embraces use cpan takes advantage recent developments language rigorous creating high quality code book modern perl may visible standard-bearer idea groups enlightened perl organization taken cause late 2012 2013 several projects alternative implementations perl 5 started perl5 perl6 rakudo perl team moe stevan little friends p2 perl11 team reini urban gperl goccy rperl kickstarter project led braswell affiliated perll11 project ponie acronym perl new internal engine ponie project existed 2003 2006 bridge perl 5 perl 6 effort rewrite perl 5 interpreter run parrot perl 6 virtual machine goal ensure future millions lines perl 5 code thousands companies around world ponie project ended 2006 longer actively developed improvements made perl 5 interpreter part ponie folded project perl originally named pearl wall wanted give language short name positive connotations claims considered every three- four-letter word dictionary also considered naming wife gloria wall discovered existing pearl programming language perl official release changed spelling name referring language name normally capitalized perl proper noun referring interpreter program name often uncapitalized perl unix-like file systems case-sensitive release first edition programming perl common refer language perl randal l. schwartz however capitalized language name book make stand better typeset case distinction subsequently documented canonical name occasionally expanded practical extraction report language backronym expansions suggested equally canonical including wall pathologically eclectic rubbish lister manual page perl indeed wall claims name intended inspire many different expansions programming perl published o'reilly media features picture dromedary camel cover commonly called camel book image camel become unofficial symbol perl well general hacker emblem appearing t-shirts clothing items o'reilly owns image trademark licenses non-commercial use requiring acknowledgement link www.perl.com licensing commercial use decided case case basis o'reilly also provides programming republic perl logos non-commercial sites powered perl buttons site uses perl perl foundation owns alternative symbol onion licenses subsidiaries perl mongers perlmonks perl.org others symbol visual pun pearl onion sebastian riedel creator mojolicious created logo depicting raptor dinosaur available cc-sa license version 4.0 logo remixed used different places symbolising perl 5 analogue raptor comes series talks given matt trout beginning 2010 talks aimed perl 5 community-centric period perl 6 hot topic according wall perl two slogans first one way commonly known tmtowtdi second slogan easy things easy hard things possible overall structure perl derives broadly c. perl procedural nature variables expressions assignment statements brace-delimited blocks control structures subroutines perl also takes features shell programming variables marked leading sigils allow variables interpolated directly strings however unlike shell perl uses sigils accesses variables unlike programming languages use sigils sigil n't denote type variable type expression example access list values hash sigil array used sigil hash perl also many built-in functions provide tools often used shell programming although many tools implemented programs external shell sorting calling operating system facilities perl takes lists lisp hashes associative arrays awk regular expressions sed simplify facilitate many parsing text-handling data-management tasks also shared lisp implicit return last value block fact statements value thus also expressions used larger expressions perl 5 added features support complex data structures first-class functions closures values object-oriented programming model include references packages class-based method dispatch lexically scoped variables along compiler directives example codice_4 pragma major additional feature introduced perl 5 ability package code reusable modules wall later stated whole intent perl 5 module system encourage growth perl culture rather perl core versions perl automatic data-typing automatic memory management interpreter knows type storage requirements every data object program allocates frees storage necessary using reference counting deallocate circular data structures without manual intervention legal type conversions \u2014 example conversions number string \u2014 done automatically run time illegal type conversions fatal errors design perl understood response three broad trends computer industry falling hardware costs rising labor costs improvements compiler technology many earlier computer languages fortran c aimed make efficient use expensive computer hardware contrast perl designed computer programmers could write programs quickly easily perl many features ease task programmer expense greater cpu memory requirements include automatic memory management dynamic typing strings lists hashes regular expressions introspection codice_5 function perl follows theory built-in limits idea similar zero one infinity rule wall trained linguist design perl much informed linguistic principles examples include huffman coding common constructions short good end-weighting important information come first large collection language primitives perl favors language constructs concise natural humans write even complicate perl interpreter perl syntax reflects idea things different look different example scalars arrays hashes different leading sigils array indices hash keys use different kinds braces strings regular expressions different standard delimiters approach contrasted language lisp basic syntax composed simple universal symbolic expressions used purposes perl enforce particular programming paradigm procedural object-oriented functional others even require programmer choose among broad practical bent perl language community culture surround preface programming perl begins perl language getting job done one consequence perl tidy language includes many features tolerates exceptions rules employs heuristics resolve syntactical ambiguities forgiving nature compiler bugs sometimes hard find perl function documentation remarks variant behavior built-in functions list scalar contexts saying general want unless want consistency written specification standard perl language exists perl versions perl 5 plans create one current version perl one implementation interpreter language evolved along interpreter together functional tests stands de facto specification language perl 6 however started specification several projects aim implement specification perl many varied applications compounded availability many standard third-party modules perl chiefly used write cgi scripts large projects written perl include cpanel slash bugzilla rt twiki movable type high-traffic websites use perl extensively include priceline.com craigslist imdb livejournal duckduckgo slashdot ticketmaster also optional component popular lamp technology stack web development lieu php python perl used extensively system programming language debian gnu/linux distribution perl often used glue language tying together systems interfaces specifically designed interoperate data munging converting processing large amounts data tasks creating reports fact strengths intimately linked combination makes perl popular all-purpose language system administrators particularly short programs often called one-liner programs entered run single command line perl code made portable across windows unix code often used suppliers software cots bespoke simplify packaging maintenance software build- deployment-scripts graphical user interfaces guis may developed using perl example perl/tk wxperl commonly used enable user interaction perl scripts interaction may synchronous asynchronous using callbacks update gui perl implemented core interpreter written c together large collection modules written perl c. interpreter 150,000 lines c code compiles 1 mb executable typical machine architectures alternatively interpreter compiled link library embedded programs nearly 500 modules distribution comprising 200,000 lines perl additional 350,000 lines c code much c code modules consists character encoding tables interpreter object-oriented architecture elements perl language\u2014scalars arrays hashes coderefs file handles\u2014are represented interpreter c structs operations structs defined large collection macros typedefs functions constitute perl c api perl api bewildering uninitiated entry points follow consistent naming scheme provides guidance use life perl interpreter divides broadly compile phase run phase perl phases major stages interpreter life-cycle interpreter goes phase phases follow fixed sequence happens perl compile phase compilation happens perl run phase execution significant exceptions perl makes important use capability execute perl code compile phase perl also delay compilation run phase terms indicate kind processing actually occurring moment compile time run time perl compile time points compile phase compile time may also entered run phase compile time code string argument passed codice_6 built-in occurs run phase perl often run time compile phase spends run phase run time code codice_7 blocks executes run time compile phase compile time interpreter parses perl code syntax tree run time executes program walking tree text parsed syntax tree subject optimization executed execution relatively efficient compile-time optimizations syntax tree include constant folding context propagation peephole optimization also performed perl turing-complete grammar parsing affected run-time code executed compile phase therefore perl parsed straight lex/yacc lexer/parser combination instead interpreter implements lexer coordinates modified gnu bison parser resolve ambiguities language often said perl parse perl meaning perl interpreter codice_8 parse perl language perl even general true perl interpreter simulate turing machine compile phase would need decide halting problem order complete parsing every case long-standing result halting problem undecidable therefore even perl always parse perl perl makes unusual choice giving user access full programming power compile phase cost terms theoretical purity high practical inconvenience seems rare programs undertake parse perl source-code analyzers auto-indenters contend ambiguous syntactic constructs also undecidability perl parsing general case adam kennedy ppi project focused parsing perl code document retaining integrity document instead parsing perl executable code even perl always kennedy first conjectured parsing perl suffers 'halting problem later proved perl distributed 250,000 functional tests core perl language 250,000 functional tests core modules run part normal build process extensively exercise interpreter core modules perl developers rely functional tests ensure changes interpreter introduce software bugs additionally perl users see interpreter passes functional tests system high degree confidence working properly perl dual licensed artistic license 1.0 gnu general public license distributions available operating systems particularly prevalent unix unix-like systems ported modern many obsolete platforms six reported exceptions perl compiled source code posix-compliant otherwise-unix-compatible platforms unusual changes required classic mac os environment special port called macperl shipped independently comprehensive perl archive network carries complete list supported platforms links distributions available cpan also source publicly available perl modules part core perl distribution users microsoft windows typically install one native binary distributions perl win32 commonly strawberry perl activeperl compiling perl source code windows possible installations lack requisite c compiler build tools also makes difficult install modules cpan particularly partially written c. activeperl closed source distribution activestate regular releases track core perl releases distribution also includes perl package manager ppm popular tool installing removing upgrading managing use common perl modules included also perlscript windows script host wsh engine implementing perl language visual perl activestate tool adds perl visual studio .net development suite vbscript perl converter well perl compiler windows converters awk sed perl also produced company included activestate cd windows includes distributions plus komodo ide first unix/linux/posix variant thereof 2002 subsequently strawberry perl open source distribution windows regular quarterly releases since january 2008 including new modules feedback requests come strawberry perl aims able install modules like standard perl distributions platforms including compiling xs modules cygwin emulation layer another way running perl windows cygwin provides unix-like environment windows perl cpan available standard pre-compiled packages cygwin setup program since cygwin also includes gcc compiling perl source also possible perl executable included several windows resource kits directory scripting tools implementations perl come mks toolkit interix base earlier implementations windows services unix uwin perl text-handling capabilities used generating sql queries arrays hashes automatic memory management make easy collect process returned data example tim bunce perl dbi application programming interface api arguments api text sql queries thus possible program multiple languages time e.g. generating web page using html javascript sql document use perl variable interpolation programmatically customize sql queries specification perl arrays hashes structures programmatically hold resulting data sets sql query allows high-level mechanism handling large amounts data post-processing perl subprogram early versions perl database interfaces created relinking interpreter client-side database library sufficiently difficult done most-important widely used databases restricted resulting codice_8 executable using one database interface time perl 5 database interfaces implemented perl dbi modules dbi database interface module presents single database-independent interface perl applications dbd database driver modules handle details accessing 50 different databases dbd drivers ansi sql databases dbi provides caching database handles queries greatly improve performance long-lived execution environments mod perl helping high-volume systems avert load spikes slashdot effect modern perl applications especially written using web frameworks catalyst dbi module often used indirectly via object-relational mappers generate sql queries handle data transparently application author computer language benchmarks game compares performance implementations typical programming problems several programming languages submitted perl implementations typically perform toward high end memory-usage spectrum give varied speed results perl performance benchmarks game typical interpreted languages large perl programs start slowly similar programs compiled languages perl compile source every time runs talk yapc :europe 2005 conference subsequent article timely start jean-louis leroy found perl programs took much longer run expected perl interpreter spent significant time finding modules within over-large include path unlike java python ruby perl experimental support pre-compiling therefore perl programs pay overhead penalty every execution run phase typical programs long enough amortized startup time substantial benchmarks measure short execution times likely skewed due overhead number tools introduced improve situation first tool apache mod perl sought address one most-common reasons small perl programs invoked rapidly cgi web development activeperl via microsoft isapi provides similar performance improvements perl code compiled additional overhead execution phase typically n't present programs written compiled languages c c++ examples overhead include bytecode interpretation reference-counting memory management dynamic type-checking perl interpreted language give problems efficiency critical situations critical routines written languages c connected perl via simple inline modules complex flexible xs mechanism perl 5 language usually referred perl continues actively developed perl 5.12.0 released april 2010 new features influenced design perl 6 followed perl 5.14.1 released june 17 2011 perl 5.16.1 released august 9 2012 perl 5.18.0 released may 18 2013 perl 5 development versions released monthly basis major releases coming per year relative proportion internet searches perl programming compared similar searches programming languages steadily declined 10 2005 2 2011 1 2019 2000 perl conference jon orwant made case major new language-initiative led decision begin work redesign language called perl 6 proposals new language features solicited perl community large submitted 300 rfcs wall spent next years digesting rfcs synthesizing coherent framework perl 6 presented design perl 6 series documents called apocalypses numbered correspond chapters programming perl developing specification perl 6 encapsulated design documents called synopsesnumbered correspond apocalypses thesis work bradley m. kuhn overseen wall considered possible use java virtual machine runtime perl kuhn thesis showed approach problematic 2001 decided perl 6 would run cross-language virtual machine called parrot mean languages targeting parrot gain native access cpan allowing level cross-language development 2005 audrey tang created pugs project implementation perl 6 haskell acted continues act test platform perl 6 language separate development actual implementation allowing language designers explore pugs project spawned active perl/haskell cross-language community centered around freenode perl6 irc channel many functional programming influences absorbed perl 6 design team 2012 perl 6 development centered primarily around two compilers 2013 moarvm \u201c metamodel runtime \u201d c language-based virtual machine designed primarily rakudo announced rakudo perl implementation moarvm support virtual machines java virtual machine javascript active development perl culture community developed alongside language usenet first public venue perl introduced course evolution perl community shaped growth broadening internet-based services including introduction world wide web community surrounds perl fact topic wall first state onion talk state onion name wall yearly keynote-style summaries progress perl community characterized hallmark humor employing references perl culture wider hacker culture wall linguistic background sometimes family life occasionally even christian background talk first given various perl conferences eventually also published online number irc channels offer support language modules also many examples code written purely entertainment cpan codice_10 example allows writing programs latin upon execution program module translates source code regular perl runs perl community set aside acme namespace modules fun nature scope widened include exploratory experimental code module meant ever used production acme modules deliberately implemented amusing ways includes codice_11 one first modules codice_12 namespace allows program source code whitened i.e. characters replaced whitespace yet still work older versions perl one would write hello world program complex perl program counts seconds given threshold perl interpreter also used one-off scripts command line following example invoked sh-compatible shell bash translates string bob files ending .txt current directory robert perl referred line noise programmers claim syntax makes write-only language earliest mention first edition book learning perl perl 4 tutorial book written randal l. schwartz first chapter states yes sometimes perl looks like line noise uninitiated seasoned perl programmer looks like checksummed line noise mission life also stated accusation perl write-only language could avoided coding proper care perl overview document perlintro states names built-in magic scalar variables look like punctuation line noise however english module provides long short english alternatives perlstyle document states line noise regular expressions could mitigated using codice_13 modifier add whitespace according perl 6 faq perl 6 designed mitigate usual suspects elicit line noise claim perl 5 critics including removal majority punctuation variables sanitization regex syntax perl 6 faq also states sometimes referred perl line noise actual syntax language gerunds prepositions part english language december 2012 blog posting despite claiming rakudo perl 6 failed continue fail unless gets adult supervision chromatic stated design perl 6 well-defined grammar well improved type system unified object system intelligent metamodel metaoperators clearer system context provides niceties pervasive laziness also stated perl 6 coherence consistency perl 5 lacks", + "neighbors": [ + 7, + 14, + 19, + 31, + 33, + 65, + 78, + 81, + 99, + 117, + 134, + 148, + 152, + 175, + 176, + 195, + 201, + 207, + 209, + 216, + 246, + 272, + 275, + 292, + 301, + 306, + 308, + 324, + 337, + 347, + 373, + 378, + 399, + 491, + 509, + 536, + 538, + 567, + 579, + 592, + 593, + 594, + 597, + 620, + 653, + 678, + 682, + 686, + 690, + 716, + 725, + 741, + 742, + 751, + 756, + 777, + 782, + 790, + 796, + 799, + 815, + 820, + 825, + 873, + 899, + 916, + 919, + 923, + 926, + 935, + 948, + 961, + 992, + 998, + 1003, + 1005, + 1028, + 1046, + 1059, + 1068, + 1094, + 1120, + 1138, + 1146, + 1152, + 1189, + 1190, + 1212, + 1214, + 1221, + 1225, + 1234, + 1235, + 1242, + 1251, + 1264, + 1269, + 1278, + 1292, + 1298, + 1311, + 1318, + 1319, + 1324, + 1366, + 1372, + 1374, + 1388, + 1414, + 1424, + 1457, + 1477, + 1481, + 1502, + 1532, + 1536, + 1538, + 1547, + 1558, + 1588, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1228, + "label": 5, + "text": "Opera_(web_browser):opera web browser opera web browser microsoft windows android ios macos linux operating systems developed opera software opera software norwegian software company publicly listed nasdaq stock exchange majority ownership control belonging chinese businessman zhou yahui founder beijing kunlun tech specialises mobile games chinese cybersecurity company qihoo 360 opera chromium-based browser using blink layout engine differentiates distinct user interface features opera conceived telenor research project 1994 bought opera software 1995 commercial software first ten years proprietary presto layout engine presto versions opera received many awards presto development ended milestone transition chromium 2013 also three mobile versions called opera mobile opera touch opera mini gaming browser called opera gx launched 11 june 2019 opera began 1994 research project telenor largest norwegian telecommunications company 1995 branched separate company named opera software opera first publicly released 1996 version 2.10 ran microsoft windows attempt capitalize emerging market internet-connected handheld devices project port opera mobile device platforms started 1998 opera 4.0 released 2000 included new cross-platform core facilitated creation editions opera multiple operating systems platforms point opera trialware purchased trial period ended version 5.0 released 2000 saw end requirement instead opera became ad-sponsored displaying advertisements users paid later versions opera gave user choice seeing banner ads targeted text advertisements google version 8.5 released 2005 advertisements completely removed primary financial support browser came revenue google contract opera default search engine among new features introduced version 9.1 released 2006 fraud protection using technology geotrust digital certificate provider phishtank organization tracks known phishing web sites feature improved expanded version 9.5 geotrust replaced netcraft malware protection haute secure added 2006 opera software asa released well internet channel nintendo ds browser nintendo ds wii gaming systems new javascript engine called carakan javanese alphabet introduced version 10.50 according opera software carakan made opera 10.50 seven times faster sunspider opera 10.10 16th december 2010 opera 11 released featuring extensions tab stacking dragging one tab another allows create group tabs visual mouse gestures changes address bar opera 12 released 14 june 2012 12 february 2013 opera software announced would drop presto layout engine favour webkit implemented google chrome browser using code chromium project opera software planned well contribute code webkit 3 april 2013 google announced would fork components webkit form new layout engine known blink day opera software confirmed would follow google implementing blink layout engine 28 may 2013 beta release opera 15 made available first version based chromium project many distinctive opera features previous versions dropped opera mail separated standalone application derived opera 12 november 2016 original norwegian owner opera sold stake business chinese consortium name golden brick capital private equity fund limited partnership 600 million earlier deal approved regulators january 2017 source code opera 12.15 one last versions still based presto layout engine leaked demonstrate radically different browser could look opera neon dubbed concept browser released january 2017 pc world compared demo models automakers hardware vendors release show visions future instead speed dial also explained following chapter features displays frequently accessed websites resemblance desktop computer icons scattered artistic formation opera originated features later adopted web browsers including speed dial pop-up blocking re-opening recently closed pages private browsing tabbed browsing opera includes bookmarks bar download manager opera also speed dial allows user add unlimited number pages shown thumbnail form page displayed new tab opened speed dial allows user easily navigate selected web pages possible control aspects browser using keyboard shortcuts page zooming allows text images content adobe flash player java platform scalable vector graphics increased decreased size help impaired vision opera software claims opera turbo mode enabled compression servers compress requested web pages except https pages 50 depending upon content sending users process reduces amount data transferred particularly useful crowded slow network connections making web pages load faster costs dependent total amount data usage technique also used opera mini mobile devices smartwatches one security feature option delete private data http cookies browsing history items cache passwords click button lets users erase personal data browsing shared computer visiting site opera displays security badge address bar shows details website including security certificates opera fraud malware protection warns suspicious web pages enabled default checks requested page several databases known phishing malware websites called blacklists january 2007 asa dotzler competing mozilla corporation accused opera software downplaying information security vulnerabilities opera fixed december 2006 dotzler claimed users clearly informed security vulnerabilities present previous version opera thus would realize needed upgrade latest version else risk exploited hackers opera software responded accusations next day 2016 free virtual private network vpn service implemented browser opera said would allow encrypted access websites otherwise blocked provide security public wifi networks either vpn turbo enabled july 2018 opera listed nasdaq stock exchange new york city initial offering 12 per share 2018 built-in cryptocurrency wallet opera web browser released announcing would first browser built-in crypto wallet 13 december 2018 released video showing many decentralized applications like cryptokitties running android version opera web browser opera one first browsers support cascading style sheets css opera software uses release cycle consisting three streams correspond phases development downloaded installed independently developer beta stable new features first introduced developer build depending user feedback may progress beta version eventually released developer stream allows early testing new features mainly targeting developers extension creators early adopters opera developer intended everyday browsing unstable prone failure crashing enables advanced users try new features still development without affecting normal installation browser new versions browser released frequently generally times week beta stream formerly known opera next feature complete package allowing stability quality mature final release new version released every couple weeks streams installed alongside official release without interference different icon help user distinguish variants 2005 adobe systems opted integrate opera rendering engine presto adobe creative suite applications opera technology employed adobe golive adobe photoshop adobe dreamweaver components adobe creative suite opera layout engine also found virtual mechanics sitespinner pro internet channel version opera 9 web browser use nintendo wii created opera software nintendo opera software also implemented nintendo ds browser nintendo handheld systems versions presto layout engine positively reviewed although criticized website compatibility issues issue opera 8.01 higher included workarounds help certain popular problematic web sites display properly versions blink layout engine criticized users missing features ui customization abandoning opera software presto layout engine despite versions blink layout engine praised fast stable handling latest web standards better website compatibility modern-style user interface years opera personal computers received several awards awards include related web browsers web browsers essential features", + "neighbors": [ + 14, + 50, + 69, + 83, + 95, + 107, + 134, + 166, + 169, + 258, + 277, + 319, + 384, + 427, + 491, + 505, + 509, + 530, + 531, + 533, + 582, + 623, + 627, + 629, + 646, + 668, + 684, + 686, + 713, + 734, + 782, + 813, + 862, + 886, + 939, + 953, + 961, + 1033, + 1038, + 1058, + 1084, + 1089, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1264, + 1280, + 1331, + 1339, + 1376, + 1378, + 1408, + 1423, + 1528, + 1534, + 1550, + 1563, + 1566, + 1569, + 1570, + 1586, + 1597, + 1604, + 1621 + ], + "mask": "Validation" + }, + { + "node_id": 1229, + "label": 4, + "text": "Ipswitch,_Inc.:ipswitch inc. ipswitch management software developer small medium sized businesses company founded 1991 headquartered burlington massachusetts operations atlanta alpharetta augusta georgia american fork utah madison wisconsin galway ireland ipswitch sells products directly well distributors resellers oems united states canada latin america europe pacific rim roger greene founded ipswitch 1991 apartment without venture capital funding bank financing company became profitable second year first product ipswitch produced gateway allowed novell inc. ipx networking protocol connect internet protocol 1994 ipswitch launched imail server first product available e-commerce site open market mid-1990s company value-added reseller spyglass mosaic browser 1996 company released beta version whatsup gold commercial version earlier shareware product ws_ping 2008 ipswitch acquired wisconsin-based software producer standard networks inc. product moveit shortly acquisition ipswitch split operations three divisions secure file transfers network management messaging collaboration company acquired salt lake city-based hourglass technologies 2009 following year company acquired compliance system system log analysis software producer dorian software december 2012 ipswitch acquired waldorf germany-based performance testing company iopus known product imacros web-browser extension 2015 ipswitch merged network monitoring file transfer divisions created partnersynergy program ipswitch opened support operations center galway ireland march 2016.. 28 march 2019 ipswitch signed agreement progress software corporation whereby progress acquire ipswitch completion purchase 225 million announced progress may 1st company commits 5 percent profits variety community investment programs designed support interests employees 2010 ipswitch inc. \u2019 network management division claimed company achieved 5,000 downloads whatsup gold engineer \u2019 toolkit first month release partnership trees life international planted 5,000 trees one download", + "neighbors": [ + 771 + ], + "mask": "Test" + }, + { + "node_id": 1230, + "label": 3, + "text": "Mikie:mikie mikie 1984 arcade game produced konami object game guide student named mikie around school classroom locker room collect hearts make letter girlfriend mandy chased various members school staff teachers coaches cafeteria chefs defend game character either head-butt throw basketballs school members briefly stun push students rear end find hearts desks game starts mikie classroom mikie must bump students seats collect hearts 're sitting simultaneously avoiding classroom teacher hearts collected player allowed leave room enter school corridor school corridor mikie chased janitor classroom teacher follows outside way gain access rest school building room representing different challenge level mikie cued proper door enter large flashing opening door result mikie punched coiled boxing glove hairy foot stunning one doors however contains scantily clad girl opening door worth 5,000 points mikie also pick extra points picking lunch boxes opening grate contains burger soda addition head-butting enemies janitor classroom teacher also stunned slamming doors faces second room locker room objective break lockers get hearts pursued janitor cook classroom teacher addition head-butting three bins basketballs located around room mikie pick throw using action button bin holds three basketballs room three cafeteria mikie pursued two cooks classroom teacher one cook stands top room occasionally throws leg meat directly mikie table roasts 3 per table mikie hurl enemies room four sees student dance studio must avoid dancing girls stun well dance instructor yet classroom teacher final stage mikie avoiding football players garden outside school guarding hearts must collect attempting reach girlfriend mandy mikie initially underwent location testing japan international title graphics high school theme would used game overseas releases however konami chose release mike japan due game premise protagonist sneaking school incidents school violence time result alternative version produced japanese arcades titled replaces school setting workplace classroom first level becomes office teacher manager dance studio third level becomes ol office levels hallway gym restaurant outdoor garden mostly unchanged aside graphical modifications football players final level instead security guards game soundtrack features chiptunes rendition beatles songs hard day night twist shout permission granted jasrac japan license displayed instruction card printed circuit board revised version game titled high school graffiti mikie provided less violent action mikie physical attack changed head butt paralyzing shout death animation changed rolling around floor sobbing contrition glass jars mikie head butt three times retrieve heart inside replaced bundles three hearts providing effect without requiring player character head butt glass first level writing blackboard reads failure teaches success instead e=mc2 mikie shout effect classroom teacher completed step loops game version speed enemy characters increases even gaining new abilities mikie ported various home computers ocean software subsidiary imagine software versions released amstrad cpc acorn electron bbc micro commodore 64 zx spectrum sg-1000 version shinny\u016b shain t\u014dru-kun also released exclusively japan sega", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1231, + "label": 9, + "text": "Just-in-time_compilation:just-in-time compilation computing just-in-time jit compilation also dynamic translation run-time compilations way executing computer code involves compilation execution program \u2013 run time \u2013 rather prior execution often consists source code commonly bytecode translation machine code executed directly system implementing jit compiler typically continuously analyses code executed identifies parts code speedup gained compilation recompilation would outweigh overhead compiling code jit compilation combination two traditional approaches translation machine code \u2013 ahead-of-time compilation aot interpretation \u2013 combines advantages drawbacks roughly jit compilation combines speed compiled code flexibility interpretation overhead interpreter additional overhead compiling interpreting jit compilation form dynamic compilation allows adaptive optimization dynamic recompilation microarchitecture-specific speedups \u2013 thus theory jit compilation yield faster execution static compilation interpretation jit compilation particularly suited dynamic programming languages runtime system handle late-bound data types enforce security guarantees jit compilation applied programs used certain capacities particularly dynamic capacities regular expressions example text editor may compile regular expression provided runtime machine code allow faster matching \u2013 done ahead time pattern provided runtime several modern runtime environments rely jit compilation high-speed code execution including implementations java together microsoft .net framework similarly many regular-expression libraries feature jit compilation regular expressions either bytecode machine code jit compilation also used emulators order translate machine code one cpu architecture another common implementation jit compilation first aot compilation bytecode virtual machine code known bytecode compilation jit compilation machine code dynamic compilation rather interpretation bytecode improves runtime performance compared interpretation cost lag due compilation jit compilers translate continuously interpreters caching compiled code minimizes lag future execution code given run since part program compiled significantly less lag entire program compiled prior execution bytecode-compiled system source code translated intermediate representation known bytecode bytecode machine code particular computer may portable among computer architectures bytecode may interpreted run virtual machine jit compiler reads bytecodes many sections full rarely compiles dynamically machine code program run faster done per-file per-function even arbitrary code fragment code compiled executed hence name just-in-time cached reused later without needing recompiled contrast traditional interpreted virtual machine simply interpret bytecode generally much lower performance interpreter even interpret source code without step first compiling bytecode even worse performance statically-compiled code native code compiled prior deployment dynamic compilation environment one compiler used execution common goal using jit techniques reach surpass performance static compilation maintaining advantages bytecode interpretation much heavy lifting parsing original source code performing basic optimization often handled compile time prior deployment compilation bytecode machine code much faster compiling source deployed bytecode portable unlike native code since runtime control compilation like interpreted bytecode run secure sandbox compilers bytecode machine code easier write portable bytecode compiler already done much work jit code generally offers far better performance interpreters addition cases offer better performance static compilation many optimizations feasible run-time jit must render execute native binary image runtime true machine-code jits necessitate platforms allow data executed runtime making using jits harvard architecture-based machine impossible said certain operating systems virtual machines well however special type jit may potentially target physical machine cpu architecture rather optimized vm bytecode limitations raw machine code prevail especially bytecode vm eventually leverages jit native code jit causes slight noticeable delay initial execution application due time taken load compile bytecode sometimes delay called startup time delay warm-up time general optimization jit performs better code generate initial delay also increase jit compiler therefore make trade-off compilation time quality code hopes generate startup time increased io-bound operations addition jit compilation example rt.jar class data file java virtual machine jvm 40 mb jvm must seek lot data contextually huge file one possible optimization used sun hotspot java virtual machine combine interpretation jit compilation application code initially interpreted jvm monitors sequences bytecode frequently executed translates machine code direct execution hardware bytecode executed times saves compilation time reduces initial latency frequently executed bytecode jit compilation used run high speed initial phase slow interpretation additionally since program spends time executing minority code reduced compilation time significant finally initial code interpretation execution statistics collected compilation helps perform better optimization correct tradeoff vary due circumstances example sun java virtual machine two major modes\u2014client server client mode minimal compilation optimization performed reduce startup time server mode extensive compilation optimization performed maximize performance application running sacrificing startup time java just-in-time compilers used runtime measurement number times method executed combined bytecode size method heuristic decide compile still another uses number times executed combined detection loops general much harder accurately predict methods optimize short-running applications long-running ones native image generator ngen microsoft another approach reducing initial delay ngen pre-compiles pre-jits bytecode common intermediate language image machine native code result runtime compilation needed .net framework 2.0 shipped visual studio 2005 runs ngen microsoft library dlls right installation pre-jitting provides way improve startup time however quality code generates might good one jited reasons code compiled statically without profile-guided optimization good jit compiled code extreme case lack profiling data drive instance inline caching also exist java implementations combine aot ahead-of-time compiler either jit compiler excelsior jet interpreter gnu compiler java earliest published jit compiler generally attributed work lisp john mccarthy 1960 seminal paper recursive functions symbolic expressions computation machine part mentions functions translated runtime thereby sparing need save compiler output punch cards although would accurately known compile go system another early example ken thompson 1968 gave one first applications regular expressions pattern matching text editor qed speed thompson implemented regular expression matching jiting ibm 7094 code compatible time-sharing system influential technique deriving compiled code interpretation pioneered mitchell 1970 implemented experimental language lc\u00b2 smalltalk c. 1983 pioneered new aspects jit compilations example translation machine code done demand result cached later use memory became scarce system would delete code regenerate needed sun self language improved techniques extensively one point fastest smalltalk system world achieving half speed optimized c fully object-oriented language self abandoned sun research went java language term just-in-time compilation borrowed manufacturing term time popularized java james gosling using term 1993 currently jiting used implementations java virtual machine hotspot builds extensively uses research base hp project dynamo experimental jit compiler 'bytecode format machine code format system turned pa-6000 machine code pa-8000 machine code counterintuitively resulted speed ups cases 30 since permitted optimizations machine code level example inlining code better cache usage optimizations calls dynamic libraries many run-time optimizations conventional compilers able attempt 30 march 2019 php announced jit coming php 8 2021 jit compilation fundamentally uses executable data thus poses security challenges possible exploits implementation jit compilation consists compiling source code byte code machine code executing generally done directly memory \u2013 jit compiler outputs machine code directly memory immediately executes rather outputting disk invoking code separate program usual ahead time compilation modern architectures runs problem due executable space protection \u2013 arbitrary memory executed otherwise potential security hole thus memory must marked executable security reasons done code written memory marked read-only writable/executable memory security hole see w^x instance firefox jit compiler javascript introduced protection release version firefox 46 jit spraying class computer security exploits use jit compilation heap spraying \u2013 resulting memory executable allows exploit execution moved heap", + "neighbors": [ + 29, + 50, + 69, + 85, + 206, + 246, + 262, + 292, + 386, + 392, + 503, + 521, + 538, + 743, + 752, + 756, + 786, + 796, + 815, + 830, + 837, + 869, + 919, + 946, + 948, + 984, + 1009, + 1044, + 1061, + 1183, + 1225, + 1235, + 1264, + 1290, + 1302, + 1311, + 1319, + 1335, + 1372, + 1414, + 1483, + 1508, + 1511, + 1566, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 1232, + "label": 9, + "text": "PDF:pdf portable document format pdf redundantly pdf format file format developed adobe 1990s present documents including text formatting images manner independent application software hardware operating systems based postscript language pdf file encapsulates complete description fixed-layout flat document including text fonts vector graphics raster images information needed display pdf standardized iso 32000 2008 longer requires royalties implementation today pdf files may contain variety content besides flat text graphics including logical structuring elements interactive elements annotations form-fields layers rich media including video content three dimensional objects using u3d prc various data formats pdf specification also provides encryption digital signatures file attachments metadata enable workflows requiring features adobe systems made pdf specification available free charge 1993 early years pdf popular mainly desktop publishing workflows competed variety formats djvu envoy common ground digital paper farallon replica even adobe postscript format pdf proprietary format controlled adobe released open standard july 1 2008 published international organization standardization iso 32000-1:2008 time control specification passed iso committee volunteer industry experts 2008 adobe published public patent license iso 32000-1 granting royalty-free rights patents owned adobe necessary make use sell distribute pdf compliant implementations pdf 1.7 sixth edition pdf specification became iso 32000-1 includes proprietary technologies defined adobe adobe xml forms architecture xfa javascript extension acrobat referenced iso 32000-1 normative indispensable full implementation iso 32000-1 specification proprietary technologies standardized specification published adobe \u2019 website many also supported popular third-party implementations pdf july 28 2017 iso 32000-2:2017 pdf 2.0 published iso 32000-2 include proprietary technologies normative references pdf combines three technologies postscript page description language run interpreter generate image process requiring many resources handle graphics standard features programming languages codice_1 codice_2 commands pdf largely based postscript simplified remove flow control features like graphics commands codice_3 remain often postscript-like pdf code generated source postscript file graphics commands output postscript code collected tokenized files graphics fonts document refers also collected everything compressed single file therefore entire postscript world fonts layout measurements remains intact document format pdf several advantages postscript pdf file 7-bit ascii file except certain elements may binary content pdf file starts header containing magic number version format codice_4 format subset cos carousel object structure format cos tree file consists primarily objects eight types furthermore may comments introduced percent sign codice_9 comments may contain 8-bit characters objects may either direct embedded another object indirect indirect objects numbered object number generation number defined codice_10 codice_11 keywords index table also called cross-reference table marked codice_12 keyword follows main body gives byte offset indirect object start file design allows efficient random access objects file also allows small changes made without rewriting entire file incremental update beginning pdf version 1.5 indirect objects may also located special streams known object streams technique reduces size files large numbers small indirect objects especially useful tagged pdf end pdf file trailer introduced codice_13 keyword contains dictionary contains two layouts pdf files non-linear optimized linear optimized non-linear pdf files consume less disk space linear counterparts though slower access portions data required assemble pages document scattered throughout pdf file linear pdf files also called optimized web optimized pdf files constructed manner enables read web browser plugin without waiting entire file download since written disk linear page order fashion pdf files may optimized using adobe acrobat software qpdf basic design graphics represented pdf similar postscript except use transparency added pdf 1.4 pdf graphics use device-independent cartesian coordinate system describe surface page pdf page description use matrix scale rotate skew graphical elements key concept pdf graphics state collection graphical parameters may changed saved restored page description pdf version 1.6 24 graphics state properties important postscript vector graphics pdf constructed paths paths usually composed lines cubic b\u00e9zier curves also constructed outlines text unlike postscript pdf allow single path mix text outlines lines curves paths stroked filled clipping strokes fills use color set graphics state including patterns pdf supports several types patterns simplest tiling pattern piece artwork specified drawn repeatedly may colored tiling pattern colors specified pattern object uncolored tiling pattern defers color specification time pattern drawn beginning pdf 1.3 also shading pattern draws continuously varying colors seven types shading pattern simplest axial shade type 2 radial shade type 3 raster images pdf called image xobjects represented dictionaries associated stream dictionary describes properties image stream contains image data less commonly raster image may embedded directly page description inline image images typically filtered compression purposes image filters supported pdf include general purpose filters normally image content pdf embedded file pdf allows image data stored external files use external streams alternate images standardized subsets pdf including pdf/a pdf/x prohibit features text pdf represented text elements page content streams text element specifies characters drawn certain positions characters specified using encoding selected font resource font object pdf description digital typeface may either describe characteristics typeface may include embedded font file latter case called embedded font former called unembedded font font files may embedded based widely used standard digital font formats type 1 compressed variant cff truetype beginning pdf 1.6 opentype additionally pdf supports type 3 variant components font described pdf graphic operators fourteen typefaces known standard 14 fonts special significance pdf documents fonts sometimes called base fourteen fonts fonts suitable substitute fonts metrics available pdf readers guaranteed available reader may display correctly system installed fonts may substituted embedded pdf within text strings characters shown using character codes integers map glyphs current font using encoding number predefined encodings including winansi macroman large number encodings east asian languages font built-in encoding although winansi macroman encodings derived historical properties windows macintosh operating systems fonts using encodings work equally well platform pdf specify predefined encoding use font built-in encoding provide lookup table differences predefined built-in encoding recommended truetype fonts encoding mechanisms pdf designed type 1 fonts rules applying truetype fonts complex large fonts fonts non-standard glyphs special encodings identity-h horizontal writing identity-v vertical used fonts necessary provide tounicode table semantic information characters preserved original imaging model pdf like postscript opaque object drawn page completely replaced anything previously marked location pdf 1.4 imaging model extended allow transparency transparency used new objects interact previously marked objects produce blending effects addition transparency pdf done means new extensions designed ignored products written pdf 1.3 earlier specifications result files use small amount transparency might view acceptably older viewers files making extensive use transparency could viewed incorrectly older viewer without warning transparency extensions based key concepts transparency groups blending modes shape alpha model closely aligned features adobe illustrator version 9 blend modes based used adobe photoshop time pdf 1.4 specification published formulas calculating blend modes kept secret adobe since published concept transparency group pdf specification independent existing notions group layer applications adobe illustrator groupings reflect logical relationships among objects meaningful editing objects part imaging model pdf files may contain interactive elements annotations form fields video 3d rich media rich media pdf pdf file including interactive content embedded linked within file interactive forms mechanism add forms pdf file format pdf currently supports two different methods integrating data pdf forms formats today coexist pdf specification acroforms introduced pdf 1.2 format acroforms permit using objects e.g text boxes radio buttons etc code e.g javascript alongside standard pdf action types interactive forms acroforms support submitting resetting importing data submit action transmits names values selected interactive form fields specified uniform resource locator url interactive form field names values may submitted following formats depending settings action \u2019 exportformat submitpdf xfdf flags acroforms keep form field values external stand-alone files containing key value pairs external files may use forms data format fdf xml forms data format xfdf files usage rights ur signatures define rights import form data files fdf xfdf text csv/tsv formats export form data files fdf xfdf formats forms data format fdf based pdf uses syntax essentially file structure much simpler pdf since body fdf document consists one required object forms data format defined pdf specification since pdf 1.2 forms data format used submitting form data server receiving response incorporating interactive form also used export form data stand-alone files imported back corresponding pdf interactive form xml forms data format xfdf xml version forms data format xfdf implements subset fdf containing forms annotations xfdf equivalents entries fdf dictionary \u2013 status encoding javascript pages keys embeddedfdfs differences target addition xfdf allow spawning addition new pages based given data done using fdf file xfdf specification referenced included pdf 1.5 specification later versions described separately xml forms data format specification pdf 1.4 specification allowed form submissions xml format replaced submissions xfdf format pdf 1.5 specification xfdf conforms xml standard december 2016 xfdf 3.0 iso/iec standard formal name iso 19444-1:2016 \u2013 document management \u2013 xml forms data format \u2013 part 1 use iso 32000-2 xfdf 3.0 standard normative reference iso 32000-2 xfdf used way fdf e.g. form data submitted server modifications made sent back new form data imported interactive form also used export form data stand-alone files imported back corresponding pdf interactive form pdf 1.5 adobe systems introduced proprietary format forms adobe xml forms architecture xfa adobe xfa forms compatible iso 32000 acroforms feature pdf processors handle xfa content xfa specification referenced iso 32000-1 pdf 1.7 external proprietary specification entirely deprecated pdf iso 32000-2 pdf 2.0 tagged pdf see clause 14.8 iso 32000 includes document structure semantics information enable reliable text extraction accessibility technically speaking tagged pdf stylized use format builds logical structure framework introduced pdf 1.3 tagged pdf defines set standard structure types attributes allow page content text graphics images extracted reused purposes tagged pdf required situations pdf file intended print since feature optional since rules tagged pdf relatively vague iso 32000-1 support tagged pdf amongst consuming devices including assistive technology uneven time iso 32000-2 however includes improved discussion tagged pdf anticipated facilitate iso-standardized subset pdf specifically targeted accessibility pdf/ua first published 2012 introduction pdf version 1.5 2003 came concept layers layers formally known optional content groups ocgs refer sections content pdf document selectively viewed hidden document authors consumers capability useful cad drawings layered artwork maps multi-language documents etc basically consists optional content properties dictionary added document root dictionary contains array optional content groups ocgs describing set information may individually displayed suppressed plus set optional content configuration dictionaries give status displayed suppressed given ocgs pdf file may encrypted security digitally signed authentication however since sha-1 collision discovered making use pdf format digital signatures using sha-1 shown insecure standard security provided acrobat pdf consists two different methods two different passwords user password encrypts file prevents opening owner password specifies operations restricted even document decrypted include modifying printing copying text graphics document adding modifying text notes acroform fields user password encrypts file owner password instead relying client software respect restrictions owner password easily removed software including free online services thus use restrictions document author places pdf document secure assured file distributed warning displayed applying restrictions using adobe acrobat software create edit pdf files even without removing password freeware open source pdf readers ignore permission protections allow user print make copy excerpts text document limited password protection number commercial solutions offer robust means information rights management restrict document access also reliably enforce permissions ways standard security handler beginning pdf 1.5 usage rights ur signatures used enable additional interactive features available default particular pdf viewer application signature used validate permissions granted bona fide granting authority example used allow user example adobe systems grants permissions enable additional features adobe reader using public-key cryptography adobe reader verifies signature uses certificate adobe-authorized certificate authority pdf application use mechanism purposes pdf files file attachments processors may access open save local filesystem pdf files contain two types metadata first document information dictionary set key/value fields author title subject creation update dates stored optional info trailer file small set fields defined extended additional text values required method deprecated pdf 2.0 pdf 1.4 support added metadata streams using extensible metadata platform xmp add xml standards-based extensible metadata used file formats allows metadata attached stream document information embedded illustrations well whole document attaching document catalog using extensible schema pdfs may encrypted password needed view edit contents pdf 2.0 defines 256-bit aes encryption standard pdf 2.0 files pdf reference also defines ways third parties define encryption systems pdf pdf files may digitally signed complete details implementing digital signatures pdf provided iso 32000-2 pdf files may also contain embedded drm restrictions provide controls limit copying editing printing restrictions depend reader software obey security provide limited pdf documents contain display settings including page display layout zoom level adobe reader uses settings override user default settings opening document free adobe reader remove settings anyone may create applications read write pdf files without pay royalties adobe systems adobe holds patents pdf licenses royalty-free use developing software complying pdf specification pdf files created specifically accessible disabled people pdf file formats use include tags text equivalents captions audio descriptions software automatically produce tagged pdfs feature always enabled default leading screen readers including jaws window-eyes hal kurzweil 1000 3000 read tagged pdf moreover tagged pdfs re-flowed magnified readers visual impairments adding tags older pdfs generated scanned documents present challenges one significant challenges pdf accessibility pdf documents three distinct views depending document creation inconsistent three views physical view ii tags view iii content view physical view displayed printed people consider pdf document tags view screen readers assistive technologies use deliver high-quality navigation reading experience users disabilities content view based physical order objects within pdf content stream may displayed software fully support tags view reflow feature adobe reader pdf/ua international standard accessible pdf based iso 32000-1 first published iso 14289-1 2012 establishes normative language accessible pdf technology pdf attachments carrying viruses first discovered 2001 virus named outlook.pdfworm peachy uses microsoft outlook send attachment adobe pdf file activated adobe acrobat acrobat reader time time new vulnerabilities discovered various versions adobe reader prompting company issue security fixes pdf readers also susceptible one aggravating factor pdf reader configured start automatically web page embedded pdf file providing vector attack malicious web page contains infected pdf file takes advantage vulnerability pdf reader system may compromised even browser secure vulnerabilities result pdf standard allowing pdf documents scripted javascript disabling javascript execution pdf reader help mitigate future exploits although protect exploits parts pdf viewing software security experts say javascript essential pdf reader security benefit comes disabling javascript outweighs compatibility issues caused one way avoiding pdf file exploits local web service convert files another format viewing march 30 2010 security researcher didier stevens reported adobe reader foxit reader exploit runs malicious executable user allows launch asked pdf file often combination vector graphics text bitmap graphics basic types content pdf later pdf revisions pdf document also support links inside document web page forms javascript initially available plugin acrobat 3.0 types embedded contents handled using plug-ins pdf 1.6 supports interactive 3d documents embedded pdf \u2013 3d drawings embedded using u3d prc various data formats two pdf files look similar computer screen may different sizes example high resolution raster image takes space low resolution one typically higher resolution needed printing documents displaying screen things may increase size file embedding full fonts especially asiatic scripts storing text graphics pdf viewers generally provided free charge many versions available variety sources many software options creating pdfs including pdf printing capabilities built macos ios linux distributions libreoffice microsoft office 2007 updated sp2 later wordperfect 9 scribus numerous pdf print drivers microsoft windows pdftex typesetting system docbook pdf tools applications developed around ghostscript adobe acrobat well adobe indesign adobe framemaker adobe illustrator adobe photoshop google online office suite google docs also allows uploading saving pdf raster image processors rips used convert pdf files raster format suitable imaging onto paper media printers digital production presses prepress process known rasterisation rips capable processing pdf directly include adobe pdf print engine adobe systems jaws harlequin rip global graphics documents saved pdf portable document format portable document format archiving forms data format printable document could converted back forth many formats etc companies adobe acrobat provide sdk libraries developers add create pdf features software besides adobe pdf library companies pdftron systems apache pdfbox foxit software provide similar sdks adobe acrobat one example proprietary software allows user annotate highlight add notes already created pdf files one unix application available free software gnu general public license pdfedit freeware foxit reader available microsoft windows macos linux allows annotating documents tracker software pdf-xchange viewer allows annotations markups without restrictions freeware alternative apple macos integrated pdf viewer preview also enable annotations open source software skim latter supporting interaction latex synctex pdfsync integration bibdesk reference management software freeware qiqqa create annotation report summarizes annotations notes one made across library pdfs also web annotation systems support annotation pdf documents formats cases pdfs expected functionality paper documents ink annotation required examples pdf software online services including scribd viewing storing pdfvue online editing thinkfree zamzar conversion 1993 jaws raster image processor global graphics became first shipping prepress rip interpreted pdf natively without conversion another format company released upgrade harlequin rip capability 1997 agfa-gevaert introduced shipped apogee first prepress workflow system based pdf 1997 many commercial offset printers accepted submission press-ready pdf files print source specifically pdf/x-1a subset variations submission press-ready pdf files replacement problematic need receiving collected native working files pdf selected native metafile format mac os x replacing pict format earlier classic mac os imaging model quartz graphics layer based model common display postscript pdf leading nickname display pdf preview application display pdf files version 2.0 later safari web browser system-level support pdf allows mac os x applications create pdf documents automatically provided support os-standard printing architecture files exported pdf 1.3 format according file header taking screenshot mac os x versions 10.0 10.3 image also captured pdf later versions save screen captures png file though behaviour set back pdf desired 2006 pdf widely accepted standard print job format open source development labs printing summit supported print job format common unix printing system desktop application projects gnome kde firefox thunderbird libreoffice openoffice switched emit print jobs pdf desktop printers also support direct pdf printing interpret pdf data without external help currently pdf capable printers also support postscript postscript printers support direct pdf printing free software foundation thought one high priority projects developing free high-quality fully functional set libraries programs implement pdf file format associated technologies iso 32000 standard 2011 however gnu pdf project removed list high priority projects due maturation poppler library enjoyed wider use applications evince gnome desktop environment poppler based xpdf code base also commercial development libraries available listed list pdf software apache pdfbox project apache software foundation open source java library working pdf documents pdfbox licensed apache license", + "neighbors": [ + 12, + 24, + 35, + 99, + 104, + 134, + 154, + 162, + 174, + 201, + 233, + 249, + 266, + 306, + 382, + 395, + 430, + 457, + 484, + 509, + 712, + 766, + 797, + 799, + 818, + 832, + 927, + 953, + 961, + 969, + 995, + 1012, + 1053, + 1071, + 1087, + 1138, + 1221, + 1233, + 1240, + 1264, + 1270, + 1275, + 1311, + 1319, + 1372, + 1516, + 1521, + 1555, + 1604, + 1635 + ], + "mask": "Test" + }, + { + "node_id": 1233, + "label": 9, + "text": "PostScript:postscript postscript ps page description language electronic publishing desktop publishing business dynamically typed concatenative programming language created adobe systems john warnock charles geschke doug brotz ed taft bill paxton 1982 1984 concepts postscript language seeded 1966 john warnock working evans sutherland computer graphics company time warnock developing interpreter large three-dimensional graphics database new york harbor warnock conceived design system language process graphics concurrently researchers xerox parc developed first laser printer recognized need standard means defining page images 1975-76 bob sproull william newman developed press format eventually used xerox star system drive laser printers press data format rather language lacked flexibility parc mounted interpress effort create successor 1978 warnock left evans sutherland joined xerox parc work martin newell rewrote design system create interpretive language j jam john martin used vlsi design investigation type graphics printing work later evolved expanded interpress language warnock left chuck geschke founded adobe systems december 1982 together doug brotz ed taft bill paxton created simpler language similar interpress called postscript went market 1984 time visited steve jobs urged adapt postscript used language driving laser printers march 1985 apple laserwriter first printer ship postscript sparking desktop publishing dtp revolution mid-1980s combination technical merits widespread availability made postscript language choice graphical output printing applications time interpreter sometimes referred rip raster image processor postscript language common component laser printers 1990s however cost implementation high computers output raw ps code would interpreted printer raster image printer natural resolution required high performance microprocessors ample memory laserwriter used 12 mhz motorola 68000 making faster macintosh computers attached laser printer engines cost thousand dollars added cost ps marginal printer mechanisms fell price cost implementing ps became great fraction overall printer cost addition desktop computers becoming powerful longer made sense offload rasterisation work onto resource-constrained printer 2001 lower-end printer models came support postscript largely due growing competition much cheaper non-postscript ink jet printers new software-based methods render postscript images computer making suitable printer pdf descendant postscript provides one method largely replaced postscript de facto standard electronic document distribution high-end printers postscript processors remain common use dramatically reduce cpu work involved printing documents transferring work rendering postscript images computer printer first version postscript language released market 1984 suffix level 1 added level 2 introduced postscript level 2 introduced 1991 included several improvements improved speed reliability support in-rip separations image decompression example jpeg images could rendered postscript program support composite fonts form mechanism caching reusable content postscript 3 adobe dropped level terminology favor simple versioning came end 1997 along many new dictionary-based versions older operators introduced better color handling new filters allow in-program compression/decompression program chunking advanced error-handling postscript 3 significant terms replacing existing proprietary color electronic prepress systems widely used magazine production introduction smooth shading operations 4096 shades grey rather 256 available postscript level 2 well devicen color space allowed addition additional ink colors called spot colors composite color pages prior introduction postscript printers designed print character output given text\u2014typically ascii\u2014as input number technologies task shared property glyphs physically difficult change stamped onto typewriter keys bands metal optical plates changed degree increasing popularity dot matrix printers characters systems drawn series dots defined font table inside printer grew sophistication dot matrix printers started including several built-in fonts user could select models allowed users upload custom glyphs printer dot matrix printers also introduced ability print raster graphics graphics interpreted computer sent series dots printer using series escape sequences printer control languages varied printer printer requiring program authors create numerous drivers vector graphics printing left special-purpose devices called plotters almost plotters shared common command language hpgl limited use anything printing graphics addition tended expensive slow thus rare laser printers combine best features printers plotters like plotters laser printers offer high quality line art like dot-matrix printers able generate pages text raster graphics unlike either printers plotters laser printer makes possible position high-quality graphics text page postscript made possible exploit fully characteristics offering single control language could used brand printer postscript went beyond typical printer control language complete programming language many applications transform document postscript program execution results original document program sent interpreter printer results printed document one inside another application display document on-screen since document-program regardless destination called device-independent postscript noteworthy implementing 'on-the fly rasterization everything even text specified terms straight lines cubic b\u00e9zier curves previously found cad applications allows arbitrary scaling rotating transformations postscript program interpreted interpreter converts instructions dots needed form output reason postscript interpreters occasionally called postscript raster image processors rips almost complex postscript handling fonts font system uses ps graphics primitives draw glyphs curves rendered resolution number typographic issues considered approach one issue fonts scale linearly small sizes features glyphs become proportionally large small start look displeasing postscript avoided problem inclusion font hinting additional information provided horizontal vertical bands help identify features letter important rasterizer maintain result significantly better-looking fonts even low resolution formerly believed hand-tuned bitmap fonts required task time technology including hints fonts carefully guarded hinted fonts compressed encrypted adobe called type 1 font also known postscript type 1 font ps1 t1 adobe type 1 type 1 effectively simplification ps system store outline information opposed complete language pdf similar regard adobe would sell licenses type 1 technology wanting add hints fonts license technology left type 3 font also known postscript type 3 font ps3 t3 type 3 fonts allowed sophistication postscript language without standardized approach hinting type 2 font format designed used compact font format cff charstrings implemented reduce overall font file size cff/type2 format later became basis handling postscript outlines opentype fonts cid-keyed font format also designed solve problems ocf/type 0 fonts addressing complex asian-language cjk encoding large character set issues cid-keyed font format used type 1 font format standard cid-keyed fonts type 2 cid-keyed opentype fonts compete adobe system apple designed system truetype around 1991 immediately following announcement truetype adobe published specification type 1 font format retail tools altsys fontographer acquired macromedia january 1995 owned fontlab since may 2005 added ability create type 1 fonts since many free type 1 fonts released instance fonts used tex typesetting system available format early 1990s several systems storing outline-based fonts developed bitstream metafont instance none included general-purpose printing solution therefore widely used late 1990s adobe joined microsoft developing opentype essentially functional superset type 1 truetype formats printed postscript output device unneeded parts opentype font omitted sent device driver would truetype type 1 font depending kind outlines present opentype font 1980s adobe drew revenue licensing fees implementation postscript printers known raster image processor rip number new risc-based platforms became available mid-1980s found adobe support new machines lacking issues cost led third-party implementations postscript becoming common particularly low-cost printers licensing fee sticking point high-end typesetting equipment quest speed demanded support new platforms faster adobe could provide one point microsoft licensed apple postscript-compatible interpreter bought called trueimage apple licensed microsoft new font format truetype apple ended reaching accord adobe licensed genuine postscript printers truetype became standard outline font technology windows macintosh today third-party postscript-compatible interpreters widely used printers multifunction peripherals mfps example csr plc ips ps3 interpreter formerly known phoenixpage standard many printers mfps including developed hewlett-packard sold laserjet color laserjet lines third-party postscript solutions used print mfp manufacturers include jaws harlequin rip global graphics free software version several applications ghostscript several compatible interpreters listed undocumented printing wiki basic inexpensive laser printers support postscript instead coming drivers simply rasterize platform native graphics formats rather converting postscript first postscript support needed printer ghostscript used also number commercial postscript interpreters teletype co. t-script postscript became commercially successful due introduction graphical user interface gui allowing designers directly lay pages eventual output laser printers however gui graphics systems generally much less sophisticated postscript apple quickdraw instance supported basic lines arcs complex b-splines advanced region filling options postscript order take full advantage postscript printing applications computers re-implement features using host platform graphics system led numerous issues on-screen layout would exactly match printed output due differences implementation features computer power grew became possible host ps system computer rather printer led natural evolution ps printing system one could also used host graphics language numerous advantages approach help eliminate possibility different output screen printer also provided powerful graphics system computer allowed printers dumb time cost laser engines falling production setting using postscript display system meant host computer could render low-resolution screen higher resolution printer simply send ps code smart printer offboard printing however postscript written printing mind numerous features made unsuitable direct use interactive display system particular ps based idea collecting ps commands codice_1 command seen point commands read point interpreted output interactive system clearly appropriate ps sort interactivity built example supporting hit detection mouse interactivity obviously apply ps used printer steve jobs left apple started next pitched adobe idea using ps display system new workstation computers result display postscript dps dps added basic functionality improve performance changing many string lookups 32 bit integers adding support direct output every command adding functions allow gui inspect diagram additionally set bindings provided allow ps code called directly c programming language next used bindings nextstep system provide object oriented graphics system although dps written conjunction next adobe sold commercially common feature unix workstations 1990s sun microsystems took another approach creating news instead dps concept allowing ps interact c programs news instead extended ps language suitable running entire gui computer sun added number new commands timers mouse control interrupts systems needed interactivity added data structures language elements allow completely object oriented internally complete gui three fact written news provided time workstations however ongoing efforts standardize x11 system led introduction widespread use sun systems news never became widely used postscript turing-complete programming language belonging concatenative group typically postscript programs produced humans programs however possible write computer programs postscript like programming language postscript interpreted stack-based language similar forth strong dynamic typing data structures inspired found lisp scoped memory since language level 2 garbage collection language syntax uses reverse polish notation makes order operations unambiguous reading program requires practice one keep layout stack mind operators languages term functions take arguments stack place results onto stack literals example numbers effect placing copy stack sophisticated data structures built array dictionary types declared type system sees arrays dictionaries typing discipline applied user-defined types left code implements character used introduce comments postscript programs general convention every postscript program start characters ps interpreter directive devices properly interpret postscript hello world program customary way show small example complete program given language might look like postscript level 2 output device console postscript uses point unit length however unlike versions point postscript uses exactly 72 points inch thus example order draw vertical line 4 cm length sufficient type readably idiomatically one might use following equivalent demonstrates simple procedure definition use mathematical operators codice_2 codice_3 implementations postscript use single-precision reals 24-bit mantissa meaningful use 9 decimal digits specify real number performing calculations may produce unacceptable round-off errors list software used render postscript documents", + "neighbors": [ + 12, + 104, + 152, + 174, + 345, + 347, + 382, + 542, + 689, + 712, + 754, + 755, + 756, + 919, + 969, + 995, + 1022, + 1071, + 1100, + 1168, + 1189, + 1190, + 1232, + 1256, + 1324, + 1413, + 1477, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1234, + "label": 6, + "text": "Unix_filesystem:unix filesystem unix operating systems inspired file system considered central component operating system also one first parts system designed implemented ken thompson first experimental version unix dated 1969 operating systems filesystem provides information storage retrieval one several forms interprocess communication many small programs traditionally form unix system store information files programs read although pipes complemented role starting third edition also filesystem provides access resources so-called device files entry points terminals printers mice rest article uses unix generic name refer original unix operating system many workalikes filesystem appears one rooted tree directories instead addressing separate volumes disk partitions removable media network shares separate trees done dos windows drive drive letter denotes root file system tree volumes mounted directory causing volume file system tree appear directory larger tree root entire tree denoted codice_1 original bell labs unix two-disk setup customary first disk contained startup programs second contained users files programs second disk mounted empty directory named codice_2 first disk causing two disks appear one filesystem second disks contents viewable codice_3 unix directories contain files instead contain names files paired references so-called inodes turn contain file metadata owner permissions time last access etc. name multiple names file system may refer file feature termed hard link mathematical traits hard links make file system limited type directed acyclic graph although directories still form tree typically may hard-linked originally envisioned 1969 unix file system would fact used general graph hard links directories providing navigation instead path names original unix file system supported three types files ordinary files directories special files also termed device files berkeley software distribution bsd system v added file type used interprocess communication bsd added sockets system v added fifo files bsd also added symbolic links often termed symlinks range file types files refer files complement hard links symlinks modeled similar feature multics differ hard links may span filesystems existence independent target object unix systems may support additional types files certain conventions exist locating kinds files programs system configuration files users home directories first documented codice_4 man page since version 7 unix subsequent versions derivatives clones typically similar man page details directory layout varied time although file system layout part single unix specification several attempts exist standardize parts system v application binary interface intel binary compatibility standard common operating system environment linux foundation filesystem hierarchy standard fhs generalized overview common locations files unix operating system", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 438, + 443, + 495, + 524, + 553, + 557, + 558, + 570, + 579, + 716, + 723, + 728, + 887, + 892, + 900, + 901, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1187, + 1201, + 1202, + 1216, + 1227, + 1252, + 1283, + 1301, + 1322, + 1381, + 1445, + 1459, + 1565, + 1616, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1235, + "label": 9, + "text": "PHP:php php hypertext preprocessor simply php general-purpose programming language originally designed web development originally created rasmus lerdorf 1994 php reference implementation produced php group php originally stood personal home page stands recursive initialism php hypertext preprocessor php code may executed command line interface cli embedded html code used combination various web template systems web content management systems web frameworks php code usually processed php interpreter implemented module web server common gateway interface cgi executable web server outputs results interpreted executed php code may type data generated html code binary image data php used many programming tasks outside web context standalone graphical applications robotic drone control standard php interpreter powered zend engine free software released php license php widely ported deployed web servers almost every operating system platform free charge php language evolved without written formal specification standard 2014 original implementation acting de facto standard implementations aimed follow since 2014 work gone create formal php specification majority sites web using php still version 5.6 older versions prior 7.1 longer officially supported php development team security support provided longer third parties debian php development began 1994 rasmus lerdorf wrote several common gateway interface cgi programs c used maintain personal homepage extended work web forms communicate databases called implementation personal home page/forms interpreter php/fi php/fi could used build simple dynamic web applications accelerate bug reporting improve code lerdorf initially announced release php/fi personal home page tools php tools version 1.0 usenet discussion group comp.infosystems.www.authoring.cgi june 8 1995 release already basic functionality php today included perl-like variables form handling ability embed html syntax resembled perl simpler limited less consistent early php intended new programming language grew organically lerdorf noting retrospect n't know stop never intent write programming language ... absolutely idea write programming language kept adding next logical step way development team began form months work beta testing officially released php/fi 2 november 1997 fact php originally designed instead developed organically led inconsistent naming functions inconsistent ordering parameters cases function names chosen match lower-level libraries php wrapping early versions php length function names used internally hash function names chosen improve distribution hash values zeev suraski andi gutmans rewrote parser 1997 formed base php 3 changing language name recursive acronym php hypertext preprocessor afterwards public testing php 3 began official launch came june 1998 suraski gutmans started new rewrite php core producing zend engine 1999 also founded zend technologies ramat gan israel may 22 2000 php 4 powered zend engine 1.0 released august 2008 branch reached version 4.4.9 php 4 longer development security updates released july 14 2004 php 5 released powered new zend engine ii php 5 included new features improved support object-oriented programming php data objects pdo extension defines lightweight consistent interface accessing databases numerous performance enhancements 2008 php 5 became stable version development late static binding missing php added version 5.3 many high-profile open-source projects ceased support php 4 new code february 5 2008 gophp5 initiative provided consortium php developers promoting transition php 4 php 5 time php interpreters became available existing 32-bit 64-bit operating systems either building php source code using pre-built binaries php versions 5.3 5.4 available microsoft windows binary distributions 32-bit ia-32 builds requiring windows 32-bit compatibility mode using internet information services iis 64-bit windows platform php version 5.5 made 64-bit x86-64 builds available microsoft windows official security support php 5.6 ended 31 december 2018 debian 8.0 jessie extend support june 2020 php received mixed reviews due lacking native unicode support core language level 2005 project headed andrei zmievski initiated bring native unicode support throughout php embedding international components unicode icu library representing text strings utf-16 internally since would cause major changes internals language user code planned release version 6.0 language along major features development however shortage developers understood necessary changes performance problems arising conversion utf-16 rarely used web context led delays project result php 5.3 release created 2009 many non-unicode features back-ported php 6 notably namespaces march 2010 project current form officially abandoned php 5.4 release prepared containing remaining non-unicode features php 6 traits closure re-binding initial hopes new plan would formed unicode integration none adopted 2014 2015 new major php version developed numbered php 7 numbering version involved debate php 6 unicode experiment never released several articles book titles referenced php 6 name might caused confusion new release reuse name vote name php 7 chosen foundation php 7 php branch originally dubbed php next generation phpng authored dmitry stogov xinchen hui nikita popov aimed optimize php performance refactoring zend engine retaining near-complete language compatibility wordpress-based benchmarks served main benchmark suite phpng project showed almost 100 increase performance changes phpng also expected make easier improve performance future compact data structures changes seen better suited successful migration just-in-time jit compiler significant changes reworked zend engine called zend engine 3 succeeding zend engine 2 used php 5 major internal changes phpng must receive new major version number php rather minor php 5 release according php release process major versions php allowed break backward-compatibility code therefore php 7 presented opportunity improvements beyond phpng require backward-compatibility breaks particular involved following changes php 7 also included new language features notably introduces return type declarations functions complement existing parameter type declarations support scalar types integer float string boolean parameter return type declarations beginning june 28 2011 php development team implemented timeline release new versions php system least one release occur every month per year minor release occur may include new features every minor release least supported two years security bug fixes followed least one year security fixes total three-year release process every minor release new features unless small self-contained introduced minor release three-year release process mascot php project elephpant blue elephant php logo side designed vincent pontier 1998 php letters forming shape elephant viewed sideways angle elephpant sometimes differently colored plush toy form many variations mascot made years elephpants based original design vincent pontier considered official community highly collectible extremely rare different variations listed field guide elephpants following hello world program written php code embedded html document doctype html title php hello world program /title php echo p hello world /p however requirement exists php code embedded html simplest version hello world may written like closing tag omitted preferred files containing pure php code well requirement php file contain php code interpreter output data outside php tags unchanged simple text file containing codice_13 give output php interpreter executes php code within delimiters anything outside delimiters processed php although non-php text still subject control structures described php code common delimiters php open close php sections shortened form also exists short delimiter makes script files less portable since support disabled local php configuration therefore discouraged recommendation echo short tag prior php 5.4.0 short syntax echo works codice_14 configuration setting enabled php 5.4.0 later always available purpose delimiters separate php code non-php content javascript code html markup first form delimiters php xhtml xml documents creates correctly formed xml processing instructions means resulting mixture php code markup server-side file well-formed xml variables prefixed dollar symbol type need specified advance php 5 introduced type hinting allows functions force parameters objects specific class arrays interfaces callback functions however php 7.0 type hints could used scalar types integer string unlike function class names variable names case sensitive double-quoted heredoc strings provide ability interpolate variable value string php treats newlines whitespace manner free-form language statements terminated semicolon php three types comment syntax /* */ marks block inline comments // used one-line comments codice_15 statement one several facilities php provides output text terms keywords language syntax php similar c style syntax conditions loops function returns similar syntax languages c c++ c java perl php stores integers platform-dependent range either 64-bit 32-bit 128-bit signed integer equivalent c-language long type unsigned integers converted signed values certain situations behavior different programming languages integer variables assigned using decimal positive negative octal hexadecimal binary notations floating point numbers also stored platform-specific range specified using floating point notation two forms scientific notation php native boolean type similar native boolean types java c++ using boolean type conversion rules non-zero values interpreted true zero false perl c++ null data type represents variable value codice_16 allowed value data type old versions interpreter allowed multiple copies value exist variables resource type represent references resources external sources typically created functions particular extension processed functions extension examples include file image database resources arrays contain elements type php handle including resources objects even arrays order preserved lists values hashes keys values two intermingled php also supports strings used single quotes double quotes nowdoc heredoc syntax standard php library spl attempts solve standard problems implements efficient data access interfaces classes php defines large array functions core language many also available various extensions functions well documented online php documentation however built-in library wide variety naming conventions associated inconsistencies described history custom functions may defined developer function myage int birthyear string echo currently myage 1995 old 2019 output sample program currently 24 years old lieu function pointers functions php referenced string containing name manner normal php functions used example callbacks within function tables user-defined functions may created time without prototyped functions may defined inside code blocks permitting run-time decision whether function defined codice_17 function determines whether function given name already defined function calls must use parentheses exception zero-argument class constructor functions called php operator codice_18 case parentheses optional php 5.3 support anonymous functions closures exist php codice_19 exists since php 4.0.1 merely thin wrapper around codice_20 allows normal php functions created program execution php 5.3 added syntax define anonymous function closure capture variables surrounding scope function getadder x adder getadder 8 echo adder 2 // prints 10 example codice_21 function creates closure using passed argument keyword codice_22 imports variable lexical context takes additional argument returns created closure caller function first-class object meaning stored variable passed parameter functions etc unusually dynamically typed language php supports type declarations function parameters enforced runtime supported classes interfaces since php 5.0 arrays since php 5.1 callables since php 5.4 scalar integer float string boolean types since php 7.0 php 7.0 also type declarations function return types expressed placing type name list parameters preceded colon example codice_23 function earlier example could annotated types like php 7 function getadder int x closure adder getadder 8 echo adder 2 // prints 10 echo adder null // throws exception incorrect type passed adder getadder // would also throw exception default scalar type declarations follow weak typing principles example parameter type codice_24 php would allow integers also convertible numeric strings floats booleans passed function would convert however php 7 strict typing mode used disallows conversions function calls returns within file basic object-oriented programming functionality added php 3 improved php 4 allowed php gain abstraction making creative tasks easier programmers using language object handling completely rewritten php 5 expanding feature set enhancing performance previous versions php objects handled like value types drawback method code make heavy use php reference variables wanted modify object passed rather creating copy new approach objects referenced handle value php 5 introduced private protected member variables methods along abstract classes final classes abstract methods final methods also introduced standard way declaring constructors destructors similar object-oriented languages c++ standard exception handling model furthermore php 5 added interfaces allowed multiple interfaces implemented special interfaces allow objects interact runtime system objects implementing arrayaccess used array syntax objects implementing iterator iteratoraggregate used codice_6 language construct virtual table feature engine static variables bound name instead reference compile time developer creates copy object using reserved word codice_26 zend engine check whether codice_27 method defined call default codice_27 copy object properties codice_27 method defined responsible setting necessary properties created object convenience engine supply function imports properties source object programmer start by-value replica source object override properties need changed following basic example object-oriented programming php php abstract class user class student extends user class teacher extends user students teachers echo students \\n foreach students student echo teachers \\n foreach teachers teacher // output program // students // hello name alice learn computer science // hello name bob learn computer science // hello name charlie learn business studies // teachers // hello name dan teach computer science information security // hello name erin teach computer science 3d graphics programming // hello name frankie teach online marketing business studies e-commerce visibility php properties methods defined using keywords codice_30 codice_31 codice_32 default public var used codice_33 synonym codice_30 items declared codice_30 accessed everywhere codice_32 limits access inherited classes class defines item codice_31 limits visibility class defines item objects type access private protected members even though instance original complete widely used php implementation powered zend engine known simply php disambiguate implementations sometimes unofficially called zend php zend engine compiles php source code on-the-fly internal format execute thus works interpreter also reference implementation php php formal specification semantics zend php define semantics php due complex nuanced semantics php defined zend works difficult competing implementations offer complete compatibility php single-request-per-script-execution model fact zend engine interpreter leads inefficiency result various products developed help improve php performance order speed execution time compile php source code every time web page accessed php scripts also deployed php engine internal format using opcode cache works caching compiled form php script opcodes shared memory avoid overhead parsing compiling code every time script runs opcode cache zend opcache built php since version 5.5 another example widely used opcode cache alternative php cache apc available pecl extension zend php still popular implementation several implementations developed compilers support jit compilation hence offer performance benefits zend php expense lacking full php compatibility alternative implementations include following php free software released php license stipulates restriction use php makes php license incompatible general public license gpl zend license incompatible due advertising clause similar original bsd license php includes various free open-source libraries source distribution uses resulting php binary builds php fundamentally internet-aware system built-in modules accessing file transfer protocol ftp servers many database servers including postgresql mysql microsoft sql server sqlite embedded database ldap servers others numerous functions familiar c programmers stdio family available standard php builds php allows developers write extensions c add functionality php language php extensions compiled statically php loaded dynamically runtime numerous extensions written add support windows api process management unix-like operating systems multibyte strings unicode curl several popular compression formats php features made available extensions include integration irc dynamic generation images adobe flash content php data objects pdo abstraction layer used accessing databases even speech synthesis language core functions dealing strings arrays also implemented extensions php extension community library pecl project repository extensions php language projects zephir provide ability php extensions created high-level language compiled native php extensions approach instead writing php extensions directly c simplifies development extensions reduces time required programming testing php group consisted ten people thies c. arntzen stig bakken shane caraveo andi gutmans rasmus lerdorf sam ruby sascha schumann zeev suraski jim winstead andrei zmievski zend technologies provides php certification based php 5.5 exam programmers become certified php developers two primary ways adding support php web server \u2013 native web server module cgi executable php direct module interface called server application programming interface sapi supported many web servers including apache http server microsoft iis netscape defunct iplanet web servers omnihttpd support internet server application programming interface isapi microsoft web server module interface php module support web server always used common gateway interface cgi fastcgi processor case web server configured use php cgi executable process requests php files php-fpm fastcgi process manager alternative fastcgi implementation php bundled official php distribution since version 5.3.3 compared older fastcgi implementation contains additional features mostly useful heavily loaded web servers using php command-line scripting php command-line interface cli executable needed php supports cli server application programming interface sapi php 4.3.0 main focus sapi developing shell applications using php quite differences cli sapi sapis although share many behaviors php direct module interface called sapi different web servers case php 5 apache 2.0 windows provided form dll file called module among functions provides interface php web server implemented form server understands form known sapi different kinds sapis various web server extensions example addition listed sapis php language include common gateway interface cgi command-line interface cli php also used writing desktop graphical user interface gui applications using php-gtk extension php-gtk included official php distribution extension used php versions 5.1.0 newer common way installing php-gtk compiling source code php installed used cloud environments software development kits sdks provided using cloud-specific features example numerous configuration options supported affecting core php features extensions configuration file codice_40 searched different locations depending way php used configuration file split various sections configuration options also set within web server configuration php general-purpose scripting language especially suited server-side web development case php generally runs web server php code requested file executed php runtime usually create dynamic web page content dynamic images used websites elsewhere also used command-line scripting client-side graphical user interface gui applications php deployed web servers many operating systems platforms used many relational database management systems rdbms web hosting providers support php use clients available free charge php group provides complete source code users build customize extend use originally designed create dynamic web pages php focuses mainly server-side scripting similar server-side scripting languages provide dynamic content web server client microsoft asp.net sun microsystems javaserver pages codice_41 php also attracted development many software frameworks provide building blocks design structure promote rapid application development rad include prado cakephp symfony codeigniter laravel yii framework phalcon zend framework offering features similar web frameworks lamp architecture become popular web industry way deploying web applications php commonly used p bundle alongside linux apache mysql although p may also refer python perl mix three similar packages wamp mamp also available windows macos first letter standing respective operating system although php apache provided part macos base install users packages seek simpler installation mechanism easily kept date 20 million internet domains web services hosted servers php installed codice_42 recorded popular apache http server module php used server-side programming language 79.1 websites 83.5 previously language could determined web content management systems written php include mediawiki joomla ez publish ez platform silverstripe wordpress drupal moodle websites written php back-end and/or user-facing portion include facebook digg tumblr dailymotion slack specific advanced usage scenarios php offers well defined documented way writing custom extensions c c++ besides extending language form additional libraries extensions providing way improving execution speed critical room improvements using true compiled language php also offers well defined ways embedding software projects way php easily used internal scripting language another project also providing tight interfacing project specific internal data structures php received mixed reviews due lacking support multithreading core language level though using threads made possible pthreads pecl extension php used 240 million websites 39 sampled installed 2.1 million web servers command line interface php-cli two activex windows script host scripting engines php produced php 5 used web last updated security updates january 2019 php 5.6.40 2017 3 vulnerabilities listed national vulnerability database linked php historically 30 vulnerabilities listed since 1996 database linked php technical security flaws language core libraries frequent 22 2009 1 total although php applies 20 programs listed recognizing programmers make mistakes languages include taint checking automatically detect lack input validation induces many issues feature developed php inclusion release rejected several times past advanced protection patches suhosin hardening-patch especially designed web hosting environments historically old versions php configuration parameters default values runtime settings made php applications prone security issues among codice_43 codice_44 configuration directives best known latter made url parameters become php variables opening path serious security vulnerabilities allowing attacker set value uninitialized global variable interfere execution php script support magic quotes register globals settings deprecated php 5.3.0 removed php 5.4.0 another example potential runtime-settings vulnerability comes failing disable php execution example using codice_45 configuration directive directory uploaded files stored enabling result execution malicious code embedded within uploaded files best practice either locate image directory outside document root available web server serve via intermediary script disable php execution directory stores uploaded files also enabling dynamic loading php extensions via codice_46 configuration directive shared web hosting environment lead security issues implied type conversions result different values treated equal sometimes programmer intent lead security issues example result comparison codice_47 first compared value treated scientific notation value zero errors like resulted authentication vulnerabilities simple machines forum typo3 phpbb md5 password hashes compared recommended way use hash_equals timing attack safety codice_48 identity operator codice_49 results codice_50 2013 analysis 170,000 website defacements published zone-h frequently 53 used technique exploitation file inclusion vulnerability mostly related insecure usage php functions codice_51 codice_52 codice_53", + "neighbors": [ + 7, + 12, + 14, + 16, + 19, + 31, + 33, + 53, + 65, + 77, + 78, + 117, + 134, + 144, + 152, + 175, + 176, + 201, + 207, + 216, + 241, + 246, + 248, + 275, + 292, + 301, + 306, + 324, + 347, + 352, + 373, + 378, + 412, + 429, + 491, + 505, + 509, + 538, + 564, + 567, + 577, + 579, + 593, + 594, + 597, + 611, + 638, + 646, + 653, + 678, + 682, + 684, + 686, + 703, + 712, + 716, + 723, + 725, + 742, + 756, + 777, + 782, + 789, + 790, + 796, + 815, + 819, + 820, + 825, + 844, + 872, + 873, + 875, + 899, + 916, + 919, + 923, + 948, + 961, + 998, + 1005, + 1019, + 1028, + 1037, + 1068, + 1102, + 1120, + 1138, + 1146, + 1152, + 1162, + 1181, + 1189, + 1190, + 1212, + 1214, + 1221, + 1225, + 1227, + 1231, + 1242, + 1251, + 1269, + 1278, + 1288, + 1292, + 1298, + 1311, + 1318, + 1319, + 1324, + 1366, + 1372, + 1416, + 1417, + 1418, + 1457, + 1481, + 1502, + 1511, + 1532, + 1536, + 1538, + 1547, + 1558, + 1582, + 1633, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1236, + "label": 1, + "text": "PastPerfect_Museum_Software:pastperfect museum software pastperfect museum software application collections archiving designed museums may used various institutions including libraries archives natural history collections pastperfect allows database storage artifacts documents photographs library books pastperfect utilized 9000 museums nationwide pastperfect introduced 1998 primary product pastime software company inc released version 2 later year updated version three 2001 version four 2004 updated version five 2010 remains current edition program pastime software company eventually changed name pastperfect software inc. 2007 pastperfect operates four basic catalogs sorting collections material archive catalog storing documents photograph catalog storing photos tintypes paintings etc objects catalog storing three-dimensional artifacts library catalog storing books would included institution library images uploaded catalog multiple photos per record also stores donor information automatically generates deed gift forms thank letters upon completing certain steps accessioning process certain extensions allow inclusion oral history records transcripts additional online function allows institutions digitize collections make free browse internet pastperfect also contains contact list function storing donors members employee contact information similar catalog format rest program", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1237, + "label": 2, + "text": "IPad_Air_2:ipad air 2 ipad air 2 second-generation ipad air tablet computer designed developed marketed apple inc announced october 16 2014 alongside ipad mini 3 released october 22 2014 ipad air 2 thinner faster predecessor ipad air features touch id height screen size ipad air ipad air 2 discontinued march 21 2017 successor 2019 ipad air released march 18 2019 ipad air 2 announced keynote october 16 2014 first ipad feature touch id theme keynote way long air 2 began arriving retail stores october 22 2014 slogan device change air release new ipad pro slogan device changed light heavyweight ipad air 2 ships ios 10 formerly ios 8 later ios 9 operating system pre-installed includes version apple pay in-store nfc functionality removed included touch id sensor allows user pay items online without needing enter user card details ios 10 comes several built-in applications camera photos messages facetime mail music safari maps siri calendar itunes store app store notes contacts ibooks home reminders clock videos news photo booth podcasts apple app store digital application distribution platform ios allows users browse download applications made various developers itunes store additional apps made apple available free download imovie garageband itunes u find iphone find friends apple store trailers remote iwork apps pages keynote numbers like ios devices ipad air 2 also sync content data mac pc using itunes although tablet designed make phone calls cellular network place receive phone calls iphone cellular connection using apple continuity feature supported ios 8 later versions ios os x yosemite later versions macos using voip application skype june 8 2015 announced wwdc ipad air 2 would support ios 9 new features released q3 2015 air 2 users ios 9 able use slide picture picture split view slide allows user slide second app side screen smaller window display information alongside initial app picture picture allows user watch video small resizable moveable window remaining another app split view allows user run two apps simultaneously 50/50 view ipad air 2 inherits hardware similar iphone 6 iphone 6 plus major change processor apple a8x high-end 3-core variant apple a8 ipad air 2 2 gb ram making ipad air 2 first ios device 1 gb ram powervr gpu 8 cores also uses apple m8 motion co-processor barometer first generation ipad inherit fingerprint touch id sensor iphone addition compared ipad air includes improved 8-megapixel 3264\u00d72448 rear-facing camera 10 fps burst mode slow motion video 120 fps similar iphone 5s camera capabilities front-facing facetime hd camera also improved larger \u0192/2.2 aperture allows 81 light image apple added gold option existing silver space gray color choices ipad air 2 previous existing colors used preceding ipad air unlike ipad predecessors mute/orientation lock switch removed accommodate reduced depth instead user must use control center access functions slightly smaller battery compared ipad air although apple claims 10-hour battery life ipad air 2 available 16 32 64 128 gb storage options storage expansion options apple released camera connection kit sd card reader used transfer photos videos ipad verge called air 2 best tablet ever made giving score 9.3 10 noting offered iterative improvement missed opportunities design", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1178, + 1215, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1238, + "label": 4, + "text": "Network_intelligence:network intelligence network intelligence ni technology builds concepts capabilities deep packet inspection dpi packet capture business intelligence bi examines real time ip data packets cross communications networks identifying protocols used extracting packet content metadata rapid analysis data relationships communications patterns also sometimes referred network acceleration piracy ni used middleware capture feed information network operator applications bandwidth management traffic shaping policy management charging billing including usage-based content billing service assurance revenue assurance market research mega panel analytics lawful interception cyber security currently incorporated wide range applications vendors provide technology solutions communications service providers csps governments large enterprises ni extends network controls business capabilities security functions data mining new products services needed since emergence web 2.0 wireless 3g 4g technologies evolution growth internet wireless technologies offer possibilities new types products services well opportunities hackers criminal organizations exploit weaknesses perpetrate cyber crime network optimization security solutions therefore need address exponential increases ip traffic methods access types activity volume content generated traditional dpi tools established vendors historically addressed specific network infrastructure applications bandwidth management performance optimization quality service qos dpi focuses recognizing different types ip traffic part csp \u2019 infrastructure ni provides granular analysis enables vendors create information layer metadata ip traffic feed multiple applications detailed expansive visibility network-based activity ni technology goes beyond traditional dpi since recognizes protocols also extracts wide range valuable metadata ni \u2019 value-add solutions traditionally based dpi attracted attention industry analysts specialize dpi market research example heavy reading includes ni companies deep packet inspection semi-annual market tracker much way bi technology synthesizes business application data variety sources business visibility better decision-making ni technology correlates network traffic data variety data communication vehicles network visibility enabling better cyber security ip services ongoing changes communications networks information exchanged people longer linked exclusively physical subscriber lines person communicate multiple ways \u2013 ftp webmail voip instant messaging online chat blogs social networks \u2013 different access points via desktops laptops mobile devices ni provides means quickly identify examine correlate interactions involving internet users applications protocols whether protocols tunneled follow osi model technology enables global understanding network traffic applications need correlate information contacts accesses database information viewed combined traditional bi tools examine service quality customer care ni creates powerful nexus subscriber network data telcos internet service providers isps mobile network operators mnos increasing competitive pressures move smart pipe business models cost savings revenue opportunities driving smart pipe strategies also apply network equipment providers software vendors systems integrators serve industry ni captures detailed information hundreds ip applications cross mobile networks provides required visibility analysis user demand create deliver differentiating services well manage usage deployed customer metrics especially important telecom companies understand consumer behaviors create personalized ip services ni enables faster sophisticated audience measurement user behavior analysis customer segmentation personalized services real-time network metrics equally important companies deliver manage services ni classifies protocols applications layers 2 7 generates metadata communication sessions correlates activity layers applicable bandwidth resource optimization quality service qos content-based billing quality experience qoe voip fraud monitoring regulatory compliance economics deployment speed cloud computing fueling rapid adoption companies government agencies among concerns however risks information security e-discovery regulatory compliance auditing ni mitigates risks providing infrastructure service iaas platform service paas software service saas vendors real-time situational awareness network activity critical transparency allay fears potential customers vendor demonstrate hardened network security prevent data leakage data theft irrefutable audit trail network transaction \u2013 communication content \u2013 related customer \u2019 account assuming compliance regulation standards ni extracts correlates information contacts providing situational awareness lawful interception cyber security real-time data capture extraction analysis allow security specialists take preventive measures protect network assets real time complement post-mortem analysis attack ni combines real-time network monitoring ip metadata extraction enhances effectiveness applications database security database auditing network protection network visibility afforded ni also used build enhancements next-generation solutions network performance management wan optimization customer experience management content filtering internal billing networked applications", + "neighbors": [ + 77, + 149, + 611, + 1386 + ], + "mask": "Validation" + }, + { + "node_id": 1239, + "label": 4, + "text": "Check_Point:check point check point multinational provider software combined hardware software products security including network security endpoint security cloud security mobile security data security security management check point established ramat-gan israel 1993 gil shwed ceo marius nacht chairman shlomo kramer left check point 2003 shwed initial idea company core technology known stateful inspection became foundation company first product firewall-1 soon afterwards also developed one world first vpn products vpn-1 shwed developed idea serving unit 8200 israel defense forces worked securing classified networks initial funding us 400,000 provided venture capital fund brm group 1994 check point signed oem agreement sun microsystems followed distribution agreement hp 1995 year u.s. head office established redwood city california february 1996 company named worldwide firewall market leader idc market share 40 percent june 1996 check point raised 67 million initial public offering nasdaq 1998 check point established partnership nokia bundled check point software nokia computer network security appliances 2003 class action lawsuit filed check point violation securities exchange act failing disclose major financial information first decade 21st century check point started acquiring security companies including nokia network security business unit 2009 2019 researchers check point found security breach xiaomi phone apps security flaw reported preinstalled check point presently focused calls fifth generation cyber security \u201c gen v. \u201d identifies fifth generation focused large-scale fast moving attacks across mobile cloud on-premise networks easily bypass conventional static detection-based defenses used organizations today years many employees worked check point left start software companies include shlomo kremer started imperva nir zuk founded palo alto networks ruvi kitov reuven harrison tufin yonadav leitersdorf founded indeni check point offers following primary products 2005 check point tried acquire intrusion prevention system developers sourcefire 225 million later withdrew offer became clear us authorities specifically committee foreign investment united states would try block acquisition sofaware technologies founded 1999 cooperation check point sofaware founders adi ruppin etay bogner purpose extending check point enterprise market small business consumer branch office market sofaware co-founder adi ruppin said company wanted make technology simple use affordable lift burden security management end users adding features 2001 sofaware began selling firewall appliances sofaware s-box brand 2002 company started selling safe office safe home line security appliances check point brand fourth quarter 2002 sales sofaware safe office firewall/vpn appliances increased greatly sofaware held 1 revenue position worldwide firewall/vpn sub- 490 appliance market 38 revenue market share relations check point sofaware founders went sour company acquisition 2002 2004 etay bogner co-founder sofaware sought court approval file shareholder derivative suit claiming check point transferring funds sofaware required use sofaware products technology derivative suit ultimately successful check point ordered pay sofaware 13 million shekels breach contract 2006 tel aviv district court judge ruled bogner sofaware could sue check point proxy 5.1 million alleged damage sofaware bogner claimed check point owned 60 sofaware behaved belligerently withheld monies due use sofaware technology products check point appealed ruling lost 2009 israeli supreme court ruled group founders sofaware includes bogner veto power decision sofaware court ruled three founders could exercise veto power group majority rule 2011 check point settled litigation relating sofaware part settlement acquired sofaware shares held bogner ruppin began process acquiring remaining shares resulting sofaware becoming wholly owned subsidiary", + "neighbors": [ + 17, + 94, + 120, + 149, + 293, + 379, + 476, + 569, + 656, + 717, + 755, + 842, + 910, + 938, + 944, + 965, + 1038, + 1101, + 1266, + 1291, + 1325, + 1327, + 1350, + 1355, + 1384, + 1472, + 1514, + 1542 + ], + "mask": "Test" + }, + { + "node_id": 1240, + "label": 4, + "text": "Public-key_cryptography:public-key cryptography public-key cryptography asymmetric cryptography cryptographic system uses pairs keys public keys may disseminated widely private keys known owner generation keys depends cryptographic algorithms based mathematical problems produce one-way functions effective security requires keeping private key private public key openly distributed without compromising security system person encrypt message using receiver public key encrypted message decrypted receiver private key robust authentication also possible sender combine message private key create short digital signature message anyone corresponding public key combine message putative digital signature known public key verify whether signature valid i.e made owner corresponding private key public key algorithms fundamental security ingredients modern cryptosystems applications protocols assuring confidentiality authenticity non-repudiability electronic communications data storage underpin various internet standards transport layer security tls s/mime pgp gpg public key algorithms provide key distribution secrecy e.g. diffie\u2013hellman key exchange provide digital signatures e.g. digital signature algorithm provide e.g. rsa mid-1970s cipher systems using symmetric key algorithms cryptographic key used underlying algorithm sender recipient must keep secret necessity key every system exchanged communicating parties secure way prior use system \u2013 secure channel requirement never trivial rapidly becomes unmanageable number participants increases secure channels n't available key exchange sensible cryptographic practice keys frequently changed particular messages meant secure users separate key required possible pair users contrast public key system public keys disseminated widely openly private key needs kept secure owner two best-known uses public key cryptography one important issue confidence/proof particular public key authentic i.e correct belongs person entity claimed tampered replaced malicious third party several possible approaches including public key infrastructure pki one third parties \u2013 known certificate authorities \u2013 certify ownership key pairs tls relies upon web trust decentralizes authentication using individual endorsements link user public key pgp uses approach well lookup domain name system dns dkim system digitally signing emails also uses approach obvious application public key encryption system encrypting communication provide confidentiality \u2013 message sender encrypts using recipient public key decrypted recipient paired private key another application public key cryptography digital signature digital signature schemes used sender authentication non-repudiation system use digital signatures ensure one party successfully dispute authorship document communication applications built foundation include digital cash password-authenticated key agreement time-stamping services non-repudiation protocols etc asymmetric key algorithms nearly always much computationally intensive symmetric ones many cases common exchange key using key-exchange algorithm transmit data using key symmetric key algorithm pgp ssh ssl/tls family schemes use procedure thus called hybrid cryptosystems like security-related systems important identify potential weaknesses public key schemes theory susceptible brute-force key search attack attacks however impractical amount computation needed succeed \u2013 termed work factor claude shannon \u2013 reach potential attackers many cases work factor increased simply choosing longer key algorithms may much lower work factors making resistance brute-force attack irrelevant special specific algorithms developed aid attacking public key encryption algorithms \u2013 rsa elgamal encryption known attacks much faster brute-force approach major weaknesses found several formerly promising asymmetric key algorithms knapsack packing algorithm found insecure development new attack recently attacks based careful measurements exact amount time takes known hardware encrypt plain text used simplify search likely decryption keys side-channel attack great deal active research currently underway discover protect new attack algorithms another potential security vulnerability using asymmetric keys possibility man-in-the-middle attack communication public keys intercepted third party man middle modified provide different public keys instead encrypted messages responses must also intercepted decrypted re-encrypted attacker using correct public keys different communication segments instances avoid suspicion attack may seem difficult implement practice impossible using insecure media e.g. public networks internet wireless forms communications \u2013 example malicious staff member internet service provider isp might find quite easy carry one approach prevent attacks involves use public key infrastructure pki set roles policies procedures needed create manage distribute use store revoke digital certificates manage public-key encryption however turn potential weaknesses example certificate authority issuing certificate must trusted properly checked identity key-holder must ensure correctness public key issues certificate must secure computer piracy must made arrangements participants check certificates protected communications begin web browsers instance supplied long list self-signed identity certificates pki providers \u2013 used check bona fides certificate authority second step certificates potential communicators attacker could subvert single one certificate authorities issuing certificate bogus public key could mount man-in-the-middle attack easily certificate scheme used alternate scenario rarely discussed attacker penetrated authority servers obtained store certificates keys public private would able spoof masquerade decrypt forge transactions without limit despite theoretical potential problems approach widely used examples include tls predecessor ssl commonly used provide security web browser transactions example securely send credit card details online store aside resistance attack particular key pair security certification hierarchy must considered deploying public key systems certificate authority \u2013 usually purpose-built program running server computer \u2013 vouches identities assigned specific private keys producing digital certificate public key digital certificates typically valid several years time associated private keys must held securely time private key used certificate creation higher pki server hierarchy compromised accidentally disclosed man-in-the-middle attack possible making subordinate certificate wholly insecure examples well-regarded asymmetric key techniques varied purposes include examples asymmetric key algorithms widely adopted include examples notable \u2013 yet insecure \u2013 asymmetric key algorithms include examples protocols using asymmetric key algorithms include early history cryptography two parties would rely upon key would exchange means secure non-cryptographic method face-to-face meeting trusted courier key parties kept absolutely secret could used exchange encrypted messages number significant practical difficulties arise approach distributing keys 1874 book principles science william stanley jevons wrote reader say two numbers multiplied together produce number 8616460799 think unlikely anyone ever know described relationship one-way functions cryptography went discuss specifically factorization problem used create trapdoor function july 1996 mathematician solomon w. golomb said jevons anticipated key feature rsa algorithm public key cryptography although certainly invent concept public key cryptography 1970 james h. ellis british cryptographer uk government communications headquarters gchq conceived possibility non-secret encryption called public key cryptography could see way implement 1973 colleague clifford cocks implemented become known rsa encryption algorithm giving practical method non-secret encryption 1974 another gchq mathematician cryptographer malcolm j. williamson developed known diffie\u2013hellman key exchange scheme also passed usa national security agency military focus low computing power power public key cryptography unrealised organisations judged important military use ... share key rapidly electronically major advantage opponent end evolution berners-lee designing open internet architecture cern adaptation adoption arpanet ... public key cryptography realise full potential \u2014ralph benjamin discovery publicly acknowledged 27 years research declassified british government 1997 1976 asymmetric key cryptosystem published whitfield diffie martin hellman influenced ralph merkle work public key distribution disclosed method public key agreement method key exchange uses exponentiation finite field came known diffie\u2013hellman key exchange first published practical method establishing shared secret-key authenticated confidential communications channel without using prior shared secret merkle public key-agreement technique became known merkle puzzles invented 1974 published 1978 1977 generalization cocks scheme independently invented ron rivest adi shamir leonard adleman mit latter authors published work 1978 algorithm came known rsa initials rsa uses exponentiation modulo product two large primes encrypt decrypt performing public key encryption public key digital signature security connected extreme difficulty factoring large integers problem known efficient general technique since 1970s large number variety encryption digital signature key agreement techniques developed field public key cryptography including rabin cryptosystem elgamal encryption dsa elliptic curve cryptography", + "neighbors": [ + 88, + 91, + 104, + 121, + 172, + 174, + 235, + 260, + 261, + 284, + 289, + 317, + 319, + 379, + 382, + 528, + 533, + 539, + 542, + 554, + 633, + 658, + 665, + 692, + 762, + 818, + 826, + 833, + 864, + 892, + 955, + 969, + 995, + 1003, + 1071, + 1089, + 1151, + 1181, + 1232, + 1331, + 1342, + 1452, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 1241, + "label": 3, + "text": "Initial_ramdisk:initial ramdisk computing specifically regards linux computing codice_1 initial ramdisk scheme loading temporary root file system memory may used part linux startup process codice_1 codice_3 refer two different methods achieving commonly used make preparations real root file system mounted many linux distributions ship single generic linux kernel image one distribution developers create specifically boot wide variety hardware device drivers generic kernel image included loadable kernel modules statically compiling many drivers one kernel causes kernel image much larger perhaps large boot computers limited memory raises problem detecting loading modules necessary mount root file system boot time matter deducing root file system complicate matters root file system may software raid volume lvm nfs diskless workstations encrypted partition require special preparations mount another complication kernel support hibernation suspends computer disk dumping image entire contents memory swap partition regular file powering next boot image made accessible loaded back memory avoid hardcode handling many special cases kernel initial boot stage temporary root file-system \u2014 dubbed early user space \u2014 used root file-system contain user-space helpers hardware detection module loading device discovery necessary get real root file-system mounted image initial root file system along kernel image must stored somewhere accessible linux bootloader boot firmware computer root file system boot image optical disc small partition local disk boot partition usually using ext2 fat file systems tftp server systems boot ethernet bootloader load kernel initial root file system image memory start kernel passing memory address image end boot sequence kernel tries determine format image first blocks data lead either initrd initramfs scheme initrd scheme image may file system image optionally compressed made available special block device mounted initial root file system driver file system must compiled statically kernel many distributions originally used compressed ext2 file system images others including debian 3.1 used cramfs order boot memory-limited systems since cramfs image mounted in-place without requiring extra space decompression initial root file system kernel executes first process exits kernel assumes real root file system mounted executes begin normal user-space boot process initramfs scheme available since linux kernel 2.6.13 image may cpio archive optionally compressed archive unpacked kernel special instance tmpfs becomes initial root file system scheme advantage requiring intermediate file system block drivers compiled kernel systems use dracut package create initramfs image initramfs scheme kernel executes first process expected exit.. applications initramfs use casper utility create writable environment using unionfs overlay persistence layer read-only root filesystem image example overlay data stored usb flash drive compressed squashfs read-only image stored live cd acts root filesystem depending algorithms compiled statically kernel unpack initrd/initramfs images compressed gzip bzip2 lzma xz lzo lz4 linux distributions debian generate customized initrd image contains whatever necessary boot particular computer ata scsi filesystem kernel modules typically embed location type root file system linux distributions fedora ubuntu generate generic initrd image start device name root file system uuid must discover everything else boot time case software must perform complex cascade tasks get root file system mounted distributions use event-driven hotplug agent udev invokes helper programs hardware devices disk partitions storage volumes matching certain rules come online allows discovery run parallel progressively cascade arbitrary nestings lvm raid encryption get root file system root file system finally becomes visible maintenance tasks run mounted root file system done root file system mounted read-only processes must continue running splash screen helper command fifo hoisted newly mounted root file system final root file system simply mounted since would make scripts tools initial root file system inaccessible final cleanup tasks initial root file systems implement shell script thus include minimal shell usually /bin/ash along essential user-space utilities usually busybox toolkit save space shell utilities supporting libraries typically compiled space optimizations enabled gcc -os flag linked klibc minimal version c library written specifically purpose installers linux distributions typically run entirely initramfs must able host installer interface supporting tools persistent storage set tiny core linux puppy linux run entirely initrd since windows vista windows boot wim disk image file file format officially published rather similar zip format except supports hard links uses chunk-by-chunk compression support deduplicated chunks case whole wim initially loaded ram followed kernel initialisation next loaded wim available systemroot assigned drive letter windows installer uses boots boot.wim uses install.wim collection windows files installed also windows preinstallation environment windows pe uses base separate-boot versions antivirus backup/disaster recovery software also possible install windows always boot wim vhd file placed physical drive however rarely used since windows boot loader capable loading .sys files boot-time kernel modules task requires initrd linux", + "neighbors": [ + 134, + 171, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 327, + 346, + 400, + 401, + 444, + 571, + 630, + 650, + 688, + 716, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1124, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1283, + 1313, + 1357, + 1360, + 1361, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 1242, + "label": 8, + "text": "Tornado_(web_server):tornado web server tornado scalable non-blocking web server web application framework written python developed use friendfeed company acquired facebook 2009 tornado open-sourced soon tornado noted high performance tries solve c10k problem affecting servers", + "neighbors": [ + 7, + 117, + 178, + 201, + 296, + 308, + 473, + 509, + 538, + 567, + 593, + 638, + 682, + 712, + 796, + 916, + 1005, + 1138, + 1225, + 1227, + 1235, + 1269, + 1288, + 1311, + 1481, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 1243, + "label": 4, + "text": "Ping_(networking_utility):ping networking utility ping computer network administration software utility used test reachability host internet protocol ip network available virtually operating systems networking capability including embedded network administration software ping measures round-trip time messages sent originating host destination computer echoed back source name comes active sonar terminology sends pulse sound listens echo detect objects water ping operates sending internet control message protocol icmp echo request packets target host waiting icmp echo reply program reports errors packet loss statistical summary results typically including minimum maximum mean round-trip times standard deviation mean command-line options ping utility output vary numerous implementations options may include size payload count tests limits number network hops ttl probes traverse interval requests many systems provide companion utility ping6 testing internet protocol version 6 ipv6 networks implement icmpv6 ping utility written mike muuss december 1983 employment ballistic research laboratory us army research laboratory created tool troubleshoot problems ip network mike muuss inspired remark david mills using icmp echo packets ip network diagnosis measurements author named sound sonar makes since methodology analogous sonar echo location first released version public domain software subsequent versions licensed bsd license ping first included 4.3bsd freedos version developed erick engelke licensed gpl tim crawford developed reactos version licensed mit license rfc 1122 prescribes host must process icmp echo requests issue echo replies return following output running ping linux sending five probes target host www.example.com output lists probe message results obtained finally lists statistics entire test example shortest round trip time 9.674 ms average 10.968 ms maximum value 11.726 ms measurement standard deviation 0.748 ms cases response target host implementations display either nothing periodically print notifications timing possible ping results indicating problem include following case error target host intermediate router sends back icmp error message example host unreachable ttl exceeded transit addition messages include first eight bytes original message case header icmp echo request including quench value ping utility match responses originating queries generic composition icmp packet echo request ping icmp/icmp6 message identifier sequence number used client match reply request caused reply practice linux systems use unique identifier every ping process sequence number increasing number within process windows uses fixed identifier varies windows versions sequence number reset boot time echo reply icmp message generated response echo request mandatory hosts must include exact payload received request payload packet generally filled ascii characters output tcpdump utility shows last 32 bytes following example eight-byte icmp header starting payload may include timestamp indicating time transmission sequence number found example allows ping compute round trip time stateless manner without needing record time transmission packet payload may also include magic packet wake-on-lan protocol minimum payload case longer shown echo request typically receive reply host sleeping hibernation state host still wakes sleep state interface configured accept wakeup requests host already active configured allow replies incoming icmp echo request packets returned reply include payload may used detect remote host effectively woken repeating new request delay allow host resume network services host sleeping low power active state single request wakes host enough allow echo reply service reply instantly service enabled host need completely wake devices may return low power mode short delay configuration may used avoid host enter hibernation state much longer wake delay time passed low power active mode conduct denial-of-service attack attacker may send ping requests fast possible possibly overwhelming victim icmp echo requests technique called ping flood ping requests multiple addresses ping sweeps may used obtain list hosts network", + "neighbors": [ + 42, + 255, + 295, + 363, + 364, + 377, + 379, + 405, + 615, + 672, + 675, + 757, + 764, + 769, + 771, + 796, + 816, + 904, + 920, + 961, + 993, + 1030, + 1042, + 1050, + 1110, + 1370, + 1374, + 1461, + 1517, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 1244, + "label": 4, + "text": "Procera_Networks:procera networks procera networks networking equipment company based fremont california united states designs sells network intelligence solutions based deep packet inspection dpi technology procera sells solutions telecom operators governments enterprises network equipment vendors areas analytics traffic management policy charging control service provider compliance procera incorporated 2002 california company initially created deliver intelligent ethernet network switches company changed product line merged netintact company based varberg sweden offered bandwidth management products scandinavian network operators packetlogic brand merger announced may closed june 2006 procera shifted company product strategy netintact product lines 2006 2008 procera sold inexpensive less 2 gbit/s traffic management products small operators enterprises operators like com hem sweden september 2007 procera networks became listed american stock exchange stock symbol pkt beginning 2008 procera began focusing larger carriers mobile operators several customers reported use procera technology yoigo genband resells procera products p-series products procera named one fastest growing network companies deloitte 2010 2011 part deloitte fast 500 study june 24 2011 procera networks joined russell 3000 index december 2011 procera moved nasdaq stock exchange using symbol pkt 2013 procera bought vineyard networks canadian dpi company c 28 million vineyard product sold market network application visibility library navl network equipment vendors 2015 procera acquired francisco partners private equity firm based san francisco procera operates private company longer listed nasdaq 2017 francisco partners acquired sandvine merged procera procera offers network intelligence solutions based version deep packet inspection dpi called datastream recognition definition language drdl drdl uses properties applications identification purposes allows operators manage subscriber traffic based application similar many dpi products procera offers 100 use cases analytics traffic management policy enforcement service provider compliance october 2016 alleged procera sold dpi software government turkey via telecoms company turk telecom order reveal usernames passwords people visiting unencrypted websites according forbes significant internal opposition technologists working procera sale current former employees said told forbes 'turk telekom requested feed subscribers \u2019 usernames passwords unencrypted websites also ip addresses sites \u2019 visited", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1245, + "label": 9, + "text": "Arc_(programming_language):arc programming language arc programming language dialect language lisp developed paul graham robert morris free open-source software released artistic license 2.0 2001 paul graham announced working new dialect lisp named arc years since written several essays describing features goals language internal projects graham startup business incubator named combinator written arc notably hacker news web forum news aggregator program arc written racket essay popular graham describes goals language many goals general arc hackable good libraries give specifics example believes important language terse also stated better language implement small number axioms even means language may features large organizations want object-orientation oo graham thinks oo useful methods patterns good design views language features used implement oo partly mistaken arc introduction 2008 graham stated one benefits brevity controversy among lisp programmers whether much s-expressions language complemented forms syntax graham thinks added syntax used situations pure s-expressions would overly verbose saying n't think religiously opposed introducing syntax lisp graham also thinks efficiency problems solved giving programmer good profiler released 2008 arc generated mixed reactions calling simply extension lisp scheme programming language right others applauded arc stripping lisp bare essentials shortly release arc ported javascript supported schemescript integrated development environment ide based eclipse hello world arc illustrate arc terseness graham uses brief program produces form one field url /said form submitted leads page link says click leads page value original input field first publicly released version arc made available 29 january 2008 implemented racket named plt-scheme release comes form .tar archive containing racket source code arc tutorial discussion forum also available forum uses program hacker news written arc due lack updates official arc branch members arc community started repositories unofficial modifications extensions libraries one version anarki permitted anyone submit changes project community managed wiki rainbow implementation arc java arcadia implementation arc c", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 509, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1246, + "label": 8, + "text": "Yahoo!:yahoo yahoo american web services provider headquartered sunnyvale california owned verizon media original yahoo company founded jerry yang david filo january 1994 incorporated march 2 1995 yahoo one pioneers early internet era 1990s provides provided web portal search engine yahoo search related services including yahoo directory yahoo mail yahoo news yahoo finance yahoo groups yahoo answers advertising online mapping video sharing fantasy sports social media website height one popular sites united states according third-party web analytics providers alexa similarweb yahoo widely read news media website \u2013 7 billion views per month \u2013 ranking sixth-most-visited website globally 2016 one largest internet companies yahoo slowly declined starting late 2000s 2017 verizon communications acquired yahoo internet business 4.48 billion ref name= yahoo -inc-jun-2017-sc-to-i/a /ref excluding stakes alibaba group yahoo japan transferred yahoo successor company altaba despite decline prominence yahoo domain websites still one popular ranking 8th world according alexa rankings january 2019 january 1994 yang filo electrical engineering graduate students stanford university created website named jerry david guide world wide web site directory websites organized hierarchy opposed searchable index pages march 1994 jerry david guide world wide web renamed yahoo human-edited yahoo directory provided users surf internet became first product company original purpose yahoo.com domain created january 18 1995 word yahoo backronym yet another hierarchically organized oracle yet another hierarchical officious oracle term hierarchical described yahoo database arranged layers subcategories term oracle intended mean source truth wisdom term officious rather related word normal meaning described many office workers would use yahoo database surfing work however filo yang insist mainly selected name liked slang definition yahoo used college students david filo native louisiana late 1980s early 1990s refer unsophisticated rural southerner rude unsophisticated uncouth meaning derives yahoo race fictional beings gulliver travels yahoo grew rapidly throughout 1990s yahoo went public april 1996 stock price rose 600 percent within two years like many search engines web directories yahoo added web portal putting competition services like excite lycos america online 1998 yahoo popular starting point web users human-edited yahoo directory popular search engine receiving 95 million page views per day triple number compared rival excite also made many high-profile acquisitions yahoo began offering free e-mail october 1997 acquisition rocketmail renamed yahoo mail 1998 yahoo decided replace altavista crawler-based search engine underlying directory inktomi yahoo two biggest acquisitions made 1999 \u2013 geocities 3.6 billion broadcast.com 5.7 billion stock price skyrocketed dot-com bubble yahoo stocks closing all-time high 118.75 share january 3 2000 however dot-com bubble burst reached post-bubble low 8.11 september 26 2001 yahoo began using google search 2000 next four years developed search technologies began using 2004 partly using technology 280 million acquisition inktomi 2002 response google gmail yahoo began offer unlimited email storage 2007 company struggled 2008 several large layoffs february 2008 microsoft corporation made unsolicited bid acquire yahoo 44.6 billion yahoo formally rejected bid claiming substantially undervalues company interest shareholders three years later yahoo market capitalization 22.24 billion carol bartz replaced yang ceo january 2009 september 2011 removed position yahoo company chairman roy bostock cfo tim morse named interim ceo company early 2012 appointment scott thompson ceo rumors began spread looming layoffs several key executives left including chief product officer blake irving. ref name= yahoo -inc-apr-2012-10-k/a /ref april 4 2012 yahoo announced cut 2,000 jobs 14 percent 14,100 workers cut expected save around 375 million annually layoffs completed end 2012 email sent employees april 2012 thompson reiterated view customers come first yahoo also completely reorganized company may 13 2012 yahoo issued press release stating thompson longer company would immediately replaced interim basis ross levinsohn recently appointed head yahoo new media group thompson total compensation 130-day tenure yahoo least 7.3 million july 15 2012 marissa mayer appointed president ceo yahoo effective july 17 2012 may 19 2013 yahoo board approved 1.1 billion purchase blogging site tumblr tumblr ceo founder david karp would remain large shareholder announcement reportedly signified changing trend technology industry large corporations like yahoo facebook google acquired start-up internet companies generated low amounts revenue way connect sizeable fast-growing online communities wall street journal stated purchase tumblr would satisfy yahoo need thriving social-networking communications hub may 20 company announced acquisition tumblr officially transaction completed one month company also announced plans open san francisco office july 2013 august 2 2013 yahoo acquired rockmelt staff retained existing products terminated data collated comscore july 2013 revealed people u.s. visited yahoo websites month google occasion first time yahoo outperformed google since 2011 data count mobile usage tumblr december 12 2014 yahoo completed acquisition video advertising provider brightroll 583 million november 21 2014 announced yahoo acquired cooliris fourth quarter 2013 company share price doubled since marissa mayer took president july 2012 however share price peaked 35 november 2013 go 36.04 mid-afternoon december 2 2015 perhaps news board directors meeting decide future mayer whether sell struggling internet business whether continue spinoff stake china alibaba e-commerce site gone well mayer tenure including 1.1 billion acquisition tumblr yet prove beneficial forays original video content led 42 million write-down sydney finkelstein professor dartmouth college tuck school business told washington post sometimes single best thing ... sell company closing price yahoo inc. december 7 2015 34.68 wall street journal douglas macmillan reported february 2 2016 yahoo ceo marissa mayer expected cut 15 workforce july 25 2016 verizon communications announced agreed purchase yahoo core internet business 4.83 billion following conclusion purchase assets merged aol form new entity known oath inc. june 13 2017 yahoo aol huffington post continue operate names oath inc. umbrella deal excludes yahoo 15 stake alibaba group 35.5 stake yahoo japan following completion acquisition assets retained name altaba new executive team september 22 2016 yahoo disclosed data breach occurred late 2014 information associated least 500 million user accounts one largest breaches reported date united states indicted four men including two employees russia federal security service fsb involvement hack december 14 2016 company revealed another separate data breach occurred 2014 hackers obtaining sensitive account information including security questions least one billion accounts company stated hackers utilized stolen internal software forge http cookies response breaches bloomberg news reported verizon attempting re-negotiate deal reduce purchase price 250 million causing 2 increase yahoo stock prices february 21 2017 verizon agreed lower purchase price yahoo 350 million share liabilities regarding investigation data breaches june 8 2017 yahoo shareholders approved company sale internet assets verizon 4.48 billion deal officially closed june 13 2017 press release october 3 2017 oath inc. subsidiary verizon stated yahoo user accounts 3 billion affected august 2013 theft june 16 2017 parts original yahoo inc purchased verizon communications renamed altaba inc. united states securities exchange commission website listed new company non-diversified closed-end management investment company former yahoo inc. ticker symbol yhoo retired favor aaba took place monday june 19 2017 yahoo operated portal provides latest news entertainment sports information portal also gave users access yahoo services like yahoo search yahoo mail yahoo maps yahoo finance yahoo groups yahoo messenger yahoo provided internet communication services yahoo messenger yahoo mail may 2007 e-mail service would offer unlimited storage yahoo provided social networking services user-generated content including products web yahoo personals yahoo 360\u00b0 delicious flickr yahoo buzz yahoo closed yahoo buzz mybloglog numerous products april 21 2011 yahoo photos closed september 20 2007 favor flickr october 16 2007 yahoo announced would discontinue yahoo 360\u00b0 including bug repairs company explained 2008 would instead establish universal profile similar yahoo mash experimental system yahoo partners numerous content providers products yahoo sports yahoo finance yahoo music yahoo movies yahoo weather yahoo news yahoo answers yahoo games provide news related content yahoo provides personalization service yahoo enables users combine favorite yahoo features content feeds information onto single page march 31 2008 yahoo launched shine site tailored women seeking online information advice ages 25 54 yahoo developed partnerships broadband providers inc. via prodigy bellsouth sbc verizon communications rogers communications british telecom offering range free premium yahoo content services subscribers yahoo mobile offers services email instant messaging mobile blogging well information services searches alerts services camera phone include entertainment ring tones yahoo introduced internet search system called onesearch mobile phones march 20 2007 results include news headlines images flickr business listings local weather links sites instead showing example popular movies critical reviews onesearch lists local theaters moment playing movie along user ratings news headlines regarding movie zip code city name required onesearch start delivering local search results results web search listed single page prioritized categories 2012 yahoo used novarra mobile content transcoding service onesearch october 8 2010 yahoo announced plans bring video chat mobile phones via yahoo messenger yahoo offers shopping services yahoo shopping yahoo autos yahoo real estate yahoo travel enables users gather relevant information make commercial transactions purchases online yahoo auctions discontinued 2007 except asia yahoo shopping price comparison service uses kelkoo price comparison service acquired april 2004 yahoo search marketing provides services sponsored search local advertising product/travel/directory submit let different businesses advertise products services yahoo network following closure beta version april 30 2010 yahoo publisher network relaunched advertising tool allows online publishers monetize websites use site-relevant advertisements yahoo launched new internet advertisement sales system fourth quarter 2006 called panama allows advertisers bid search terms trigger ads search results pages system considers bids ad quality clickthrough rates factors ranking ads panama yahoo aims provide relevant search results users better overall experience increase monetization april 7 2008 yahoo announced apt yahoo originally called amp yahoo online advertising management platform platform simplifies advertising sales unifying buyer seller markets service launched september 2008 july 2009 yahoo agrees use microsoft exclusive technology provider search services microsoft provide contextual advertising yahoo non-exclusive basis yahoo exclusive worldwide relationship sales force yahoo microsoft premium search advertisers september 2011 yahoo formed ad selling strategic partnership 2 top competitors aol microsoft 2013 found underperforming market share revenue microsoft simply skimmed four percent search market yahoo without growing combined share yahoo next incubation ground future yahoo technologies currently undergoing testing contained forums yahoo users give feedback assist development future yahoo technologies yahoo search boss service allows developers build search applications based yahoo search technology early partners program include hakia me.dium delver daylife yebol early 2011 program switched paid model using cost-per-query model 0.40 0.75 cpm cost per 1000 boss queries price yahoo explained depends whether query web image news information became defunct 2016 replaced yahoo partner ads yahoo meme beta social service similar popular social networking sites twitter jaiku connect enables individuals leave comments online publication boards using yahoo id instead register individual publications wall street journal reported yahoo plans mimic strategy used rival facebook inc. help drive traffic site yahoo invested resources increase improve access internet disabled community yahoo accessibility lab yahoo axis desktop web browser extension mobile browser ios devices created developed yahoo extension made public debut may 23 2012 retired june 28 2013 copy private key used sign official yahoo browser extensions google chrome accidentally leaked first public release chrome extension yahoo searchmonkey often misspelled search monkey yahoo service allowed developers site owners use structured data make yahoo search results useful visually appealing drive relevant traffic sites service shut october 2010 along yahoo services part microsoft yahoo search deal name searchmonkey homage greasemonkey officially product name space two capital letters yahoo searchmonkey selected one top 10 semantic web products 2008 geocities popular web hosting service founded 1995 one first services offer web pages public one point third-most-browsed site world wide web yahoo purchased geocities 1999 ten years later web host closed deleting seven million web pages great deal information lost many sites pages mirrored internet archive oocities.com databases yahoo go java-based phone application access yahoo services closed january 12 2010 yahoo 360\u00b0 blogging/social networking beta service launched march 2005 yahoo closed july 13 2009 yahoo mash beta another social service closed one year operation prior leaving beta status yahoo photos shut september 20 2007 favor integration flickr yahoo tech website provided product information setup advice users yahoo launched website may 2006 march 11 2010 yahoo closed service redirected users yahoo technology news section discontinued services include farechase web audio search pets live kickstart briefcase yahoo teachers hotjobs acquired merged monster.com yahoo koprol indonesian geo-tagging website allowed users share information locations without use gps device koprol acquired yahoo year following inception 2011 1.5 million people utilizing website users also based singapore philippines vietnam however eighty percent users indonesian yahoo officially discontinued koprol august 28 2012 meaningfully drive revenue engagement yahoo mail classic announced shut april 2013 yahoo made notice starting june 2013 mail classic old versions yahoo mail shut users mail classic expected switch new yahoo mail use imap switch another email service addition april 2013 brought closure upcoming yahoo deals yahoo sms alerts yahoo kids yahoo mail messenger feature phone j2me early july 2013 yahoo announced scheduled closure task management service astrid yahoo acquired company may 2013 discontinue service august 5 2013 team astrid supplied customers data export tool recommended former competitors wunderlist sandglaz december 15 2010 one day yahoo announced layoffs 4 workers across portfolio mybloglog founder eric marcoullier posted slide yahoo employee twitter slide visible employee-only strategy webcast indicating changes yahoo offerings following services column sunset yahoo picks altavista mym alltheweb yahoo bookmarks yahoo buzz del.icio.us mybloglog merge column upcoming foxytunes yahoo events yahoo people search sideline fireeagle 11 properties listed yahoo interested developing feature sites within portal take place sunset merge vacancies including prior feature services new yahoo mail launched yahoo address book calendar notepad despite notepad listed feature service instead sunset merge 2010 yahoo since taken steps de-emphasize notepad example january 2013 notepad longer linked within new yahoo mail service although continued linked older classic version also starting mid- late january 2013 notepad longer searchable blog del.icio.us website released post chris yeh slide leaked yeh stated sunset n't necessarily mean yahoo closing site yeh explained possibilities\u2014including del.icio.us leaving yahoo sale spinoff \u2014were still considered imagine upsetting news coverage past 24 hours many speaking team disappointed way appeared press april 27 2011 yahoo sale del.icio.us avos announced yahoo buzz closed april 21 2011 without official announcement yahoo mybloglog discontinued yahoo may 24 2011 september 2013 yahoo transparency report said company received 29 thousand requests information users governments first six months 2013 12 thousand requests came united states october 2013 washington post reported u.s. national security agency intercepted communications yahoo data centers part program named muscular late january 2014 yahoo announced company blog detected coordinated effort hack possibly millions yahoo mail accounts company prompted users reset passwords elaborate scope possible breach citing ongoing federal investigation august 2015 researchers malwarebytes notified yahoo users getting hacked vulnerabilities flash according vulnerability could allow attackers install ransomware users computers lock files till customers pay criminals working comscore new york times found yahoo able collect far data users competitors web sites advertising network one measure average yahoo potential december 2007 build profile 2,500 records per month visitors yahoo retains search requests period 13 months however response european regulators yahoo obfuscates ip address users three months deleting last eight bits march 29 2012 yahoo announced would introduce track feature summer allowing users opt web-visit tracking customized advertisements however april 30 2014 yahoo announced would longer support track browser setting according 2008 article computerworld yahoo 2-petabyte specially built data warehouse uses analyze behavior half-billion web visitors per month processing 24 billion daily events contrast united states internal revenue service irs database united states taxpayers 150 terabytes september 2016 reported data least 500 million yahoo accounts stolen 2014 october 2016 reuters reported 2015 yahoo created software search customers e-mail request nsa fbi 2000 yahoo taken court france parties seeking prevent french citizens purchasing memorabilia relating nazi party march 2004 yahoo launched paid inclusion program whereby commercial websites guaranteed listings yahoo search engine yahoo discontinued program end 2009 yahoo criticized providing ads via yahoo ad network companies display spyware adware yahoo well search engines cooperated chinese government censoring search results april 2005 dissident shi tao sentenced 10 years prison providing state secrets foreign entities result identified ip address yahoo human rights organizations company general counsel disputed extent yahoo foreknowledge shi fate human rights groups also accuse yahoo aiding authorities arrest dissidents li zhi jiang lijun april 2017 yahoo sued failing uphold settlement agreements case yahoo pledged give support families arrested create relief fund persecuted expressing views online yahoo human rights trust 17.3 million allotted fund 13 million used townhouse washington dc purchases september 2003 dissident wang xiaoning convicted charges incitement subvert state power sentenced ten years prison yahoo hong kong connected wang group specific yahoo e-mail address xiaoning wife world organization human rights sued yahoo human rights laws behalf wang shi result media scrutiny relating internet child predators lack significant ad revenues yahoo user created chatrooms closed june 2005 may 25 2006 yahoo image search criticized bringing sexually explicit images even safesearch active august 2015 yahoo purchased 40 23 september 2013 owner alibaba group subject controversy allowing sale shark-derived products company banned sale shark fin products e-commerce platforms effective january 1 2009 november 30 2009 yahoo criticized electronic frontier foundation sending dmca notice whistle-blower website cryptome publicly posting details prices procedures obtaining private information pertaining yahoo subscribers concerns censorship private emails regarding website affiliated occupy wall street protests raised yahoo responded apology explained accident following media reports prism nsa massive electronic surveillance program june 2013 several technology companies identified participants including yahoo yahoo listed paradise papers set confidential electronic documents relating offshore investment leaked german newspaper s\u00fcddeutsche zeitung scott ard prominent editorial director fired yahoo 2015 filed lawsuit accusing mayer leading sexist campaign purge male employees ard male employee stated mayer encouraged fostered use employee performance-rating system accommodate management subjective biases personal opinions detriment yahoo male employees suit ard claimed prior firing received fully satisfactory performance reviews since starting company 2011 head editorial programming yahoo home page however relieved role given woman recently hired megan lieberman editor-in-chief yahoo news lawsuit states liberman stated terminating ard received requested breakdown duties ard already provided information requested however reminded liberman done liberman excuse terminating ard pretext second sexual discrimination lawsuit filed separately gregory anderson fired 2014 alleging company performance management system arbitrary unfair making second sexism lawsuit yahoo mayer faced 2016 former chief operating officer henrique de castro departed company january 2014 mayer initially hired appointment ceo dismissed de castro previously worked google mckinsey company employed revive yahoo advertising business yahoo offers multi-lingual interface site available 20 languages official directory yahoo international sites world.yahoo.com company international sites wholly owned yahoo exception japan china sites yahoo holds 34.75 minority stake yahoo japan softbank holds 35.45 yahoo xtra new zealand yahoo 7 51 49 belongs telecom new zealand yahoo 7 australia 50\u201350 agreement yahoo seven network historically yahoo entered joint venture agreements softbank major european sites uk france germany well south korea japan november 2005 yahoo purchased minority interests softbank owned europe korea yahoo used hold 40 stake 35 voting power alibaba manages web portal china using yahoo brand name yahoo china yahoo usa direct control alibaba operates completely independent company september 18 2012 following years negotiations yahoo agreed sell 20 stake back alibaba 7.6 billion march 8 2011 yahoo launched romania local service years delay due financial crisis yahoo officially entered mena region acquired maktoob pan-regional arabic-language hosting social services online portal august 25 2009 since service pan-regional yahoo officially became yahoo maktoob region december 31 2012 yahoo korea shut services left country previous domain saying korean starting december 31 2012 yahoo korea ended go original yahoo yahoo information sooner message also disappear leaving abandoned empty search bar powered bing september 2 2013 yahoo china shut redirected taobao.com redirected yahoo singapore search page yahoo got first logo establishment 1994\u2014it consists yahoo wordmark coloured black using times new roman font later changed march 1995 company changed name yahoo introduced another logo briefly changed elaborate text includes exclamation point end short-lived 5 months later august 1995 year yahoo changed logo became stylized yellow jumping figurine blue circle yahoo wordmark written logo also short-lived 4 months december 1995 january 1 1996 yahoo introduced much tweaking refining new logo quickly simplified text exclamation mark slight shadow behind text although gets coloured red also containing three icons side well becomes simple wordmark without graphics therefore create familiar logo existence since eventually logo used yahoo home page formerly consists red color black outline shadow june 2002 later becoming slightly changed new black shadows text replaces older gray color except gets introduced yahoo japan within following year gets still used today slight moderation 2013 see may 2009 yahoo overhauled theme redesign makes logo become recoloured purple without outline shadow purple logo first appeared headquarters yahoo messenger 1995 although get full effect november 12 2009 site received revamp entirely remove old red color 1996 change would apply several international yahoo home pages countries notably yahoo 7 australia still using red logo 2014 time purple logo comes new slogan ou used time occasion would time abbreviated august 7 2013 around midnight edt yahoo announced final version new logo would revealed september 5 2013 4:00 a.m. utc period leading unveiling new logo 30 days change campaign introduced whereby variation logo published every day 30 days following announcement new logo eventually launched accompanying video showed digital construction mayer published personalized description design process tumblr page mayer explains one weekend summer rolled sleeves dove trenches logo design team ... spent majority saturday sunday designing logo start finish ton fun weighing every minute detail knew wanted logo reflected yahoo \u2013 whimsical yet sophisticated modern fresh nod history human touch personal proud september 19 2013 yahoo launched new version yahoo personalized homepage redesign allows users tailor homepage widgets access features email accounts calendars flickr yahoo content internet content users also select theme packs represent artists polly apfelbaum alec monopoly bands empire sun mayer explained conference late september 2013 logo change result feedback external parties employees", + "neighbors": [ + 12, + 14, + 124, + 144, + 154, + 252, + 267, + 308, + 488, + 509, + 588, + 627, + 662, + 701, + 858, + 936, + 965, + 1030, + 1090, + 1091, + 1180, + 1225, + 1246, + 1323, + 1358, + 1373, + 1422, + 1433, + 1446, + 1582, + 1635 + ], + "mask": "Test" + }, + { + "node_id": 1247, + "label": 2, + "text": "Calendar_(Windows):calendar windows calendar personal calendar application made microsoft microsoft windows offers synchronization calendars using microsoft exchange server outlook.com apple icloud calendar service google calendar supports popular icalendar format microsoft first included calendar application shortened app windows 1.0 included windows 3.1 replaced schedule+ windows workgroups windows nt 3.1 schedule+ later moved windows microsoft office suite windows include another calendar application windows calendar windows vista calendar created beta 2 windows vista version supports sharing subscribing publishing calendars webdav-enabled web servers network shares always supported .ics files subscription feature enables syncing google calendar interface matches windows vista mail two apps connected operating system default calendar renamed new version calendar text-heavy added windows 8 one many apps written run full-screen snapped part microsoft metro design language philosophy one three apps windows originate microsoft outlook two mail people apps structurally three apps one installed uninstalled user interface calendar windows 8 originally supported outlook.com exchange google calendar facebook calendars api changes facebook google calendars longer directly synced windows 8 like many microsoft apps introduced windows 8 many features hidden charms menu bottom screen triggered right clicking different calendars labeled different colors user microsoft account adds calendar account one computer windows 8 calendar account automatically added windows 8 computers user logged .ics files supported version mail preset server configurations outlook.com exchange google calendar icloud calendar users set use system theme choose custom accent color background image light/dark preference windows 10 calendar multi-window support viewing editing events different calendars labeled different colors events rearranged dragging dropping default interface month view users also use day week year views print views windows 10 app also uses flyout settings panel mini ribbon interface viewing pane day year calendar events show live tile like vista version important controls readily visible use icons match system accounts grouped relabeled folders edited within app .ics support added version time windows 10 anniversary update", + "neighbors": [ + 26, + 66, + 79, + 93, + 108, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1248, + "label": 1, + "text": "Disclosure_and_Barring_Service:disclosure barring service disclosure barring service dbs non-departmental public body home office united kingdom dbs enables organisations public private voluntary sectors make safer recruitment decisions identifying candidates may unsuitable certain work especially involving children vulnerable adults provides wider access criminal record information disclosure service england wales dbs formed 2012 merging functions criminal records bureau crb independent safeguarding authority isa protection freedoms act 2012 dbs started operating 1 december 2012 operates liverpool royal wootton bassett equivalent agencies disclosure scotland scotland access northern ireland northern ireland legal requirement uk regulated activity employers notify dbs person leaves changes job relation harmed someone offence person barred dbs work apply work group children adults barred also offence employer knowingly employ barred person regulated activity group barred organisation entitled ask exempted questions rehabilitation offenders act 1974 must register dbs registered dbs umbrella body request dbs check applicant applicant applies dbs application countersigned dbs registered organisation umbrella body applicant criminal record accessed police national computer pnc well checked appropriate lists people considered unsuitable work children vulnerable people maintained dbs formerly maintained independent safeguarding authority copy completed certificate sent applicant home address individual organisation safeguarding concerns regarding member staff make safeguarding referral dbs work multiple agencies assess whether individual barred working regulated activity children and/or vulnerable groups criminal records bureau established part v police act 1997 launched march 2002 following public concern safety children young people vulnerable adults found british police forces adequate capability resources routinely process fulfil large number criminal record checks requested timely fashion dedicated agency set administer function employers temporary staff agencies bemoaned time takes worker cleared dbs effort cut waiting times government allowed establishment adult first may 2002 department education began maintaining list individuals suitable work children list originally named list 99 later named isa children barred list maintained independent safeguarding authority finally dbs children barred list maintained disclosure barring service care standards act 2000 department health introduced adult version list 99 named 'pova first 26 july 2004 later renamed 'isa adult first finally 'dbs adult first adult first list 99 services allow registered bodies eligible check whether applicant appears dbs adults children barred list online checking system takes around two working days turn around check clean organisation may provisionally employ applicant subject increased level supervision return post full disclosure 17 june 2013 dbs update service launched intended improve ease applying criminal record checks create significant savings 1 february 2018 national audit office published investigation report highly critical dbs 2009 home office launched programme increase efficiency safeguarding services key aims programme reduce cost running disclosure service customers using new cheaper update service rather continuing use existing types disclosure certificates home office expected 2.8 million paying users using new update service 2017\u201318 market tested actual number users around one million according national audit office investigation modernisation programme running three half years late expected costs increased \u00a3229 million dbs currently negotiating contractor tata consultancy services delays modernisation programme update service expected increase ease frequency people checked thereby improving safeguarding home office dbs know many people prevented working children vulnerable adults use information process dbs provides criminal record data called dbs certificate dbs check previously crb check four levels dbs checks basic standard enhanced enhanced barred list checks basic disclosures see disclosure scotland dbs checks obtained members public directly available organisations professions offices employments work occupations listed exceptions order 1975 rehabilitation offenders act 1974 amended protection freedoms act 2012 17 june 2013 dbs update service launched intended improve ease applying criminal record checks create significant savings fee \u00a313 year applicants may use certificate within sector disclosure level workforce details barring list checks volunteer status employer consent run dbs update check check existing certificate date check applicant identity certificate authenticity january 2018 basic dbs checks introduced disclose details cautions convictions deemend unspent rehabilitation offenders act 1974 basic dbs check disclose cautions reprimands warnings convictions deemed unspent according rehabilitation offenders act 1974 service provided dbs england wales disclosure scotland applicants scotland applications also done online employer reference dbs check could taken requirement standard enhanced check meant disclosure cautions convictions even spent however introduction basic check employers specify check required advertising job aim service reduce need unnecessary ineligible standard enhanced checks apply one responsible organisations list organisations websites apply check standard dbs check primarily positions high responsibility example accountancy security standard certificates reveal details convictions cautions reprimands warnings applicant received qualify filtering standard check may applied applicant job role specified police act 1997 amended protection freedoms act 2012 enhanced dbs checks positions involving certain activities teaching children treating adults also obtained certain professions example judicial appointments rspca officers enhanced check may applied applicant job role specified rehabilitation offenders act 1974 exception order 1975 police act 1997 addition information provided standard certificate enhanced certificate involves additional check police check information held file may relevant instance information led criminal conviction may indicate danger vulnerable groups police decide additional information added certificate using quality assurance framework involvement local police forces mean enhanced check may take significantly longer standard check completed includes enhanced certificate plus check appropriate dbs barred list two dbs barred lists one adults one children lists contain information whether applicant barred working either two groups individual may checked one barred lists job role classified regulated activity children and/or adults safeguarding vulnerable groups act 2006 roles might barred include work within outside people homes areas postal work would access personal documents dbs began filter certain criminal information dbs certificate met guidelines laid rehabilitation offenders act 1974 exceptions order 1975 amendment england wales order 2013 dbs work number standards criminal record checking service barring case accuracy performance service standards also agreed dbs police disclosure units crb due partner isa administering newly created vetting barring scheme 2009 suspended 2010 pending review following 2010 general election review published february 2011 making recommendations merger criminal records bureau independent safeguarding authority one new non-departmental public body disclosure barring service responsible barring individuals completing criminal record checks protection freedoms act 2012 dbs require registration details retained database procedures crb tightened following soham murders trial ian huntley former caretaker found guilty murdering two girls cambridgeshire primary school 2002 huntley suspected string offences including rape indecent assault burglary conviction murders riding uninsured unlicensed motorcycle burglary charge remained file january 2006 following controversies resulting cases staff hired schools full crb check carried department education skills stated employers obtain crb enhanced disclosure respect teachers recruit person placed school huntley hired november 2001 crb came force sociologist frank furedi stated crb checks provide cast-iron guarantee children safe particular adult use created atmosphere suspicion poisoning relationships generations many ordinary parents finding regarded potential child abusers restrictions imposed crb check process contributed shortage adult volunteers organizations girlguiding uk 2009 crb enhanced disclosure criticised including details minor contact individual police even formal action taken", + "neighbors": [ + 793 + ], + "mask": "Test" + }, + { + "node_id": 1249, + "label": 4, + "text": "Naive_Bayes_spam_filtering:naive bayes spam filtering naive bayes classifiers popular statistical technique e-mail filtering typically use bag words features identify spam e-mail approach commonly used text classification naive bayes classifiers work correlating use tokens typically words sometimes things spam non-spam e-mails using bayes theorem calculate probability email spam naive bayes spam filtering baseline technique dealing spam tailor email needs individual users give low false positive spam detection rates generally acceptable users one oldest ways spam filtering roots 1990s bayesian algorithms used sort filter email 1996 although naive bayesian filters become popular later multiple programs released 1998 address growing problem unwanted email first scholarly publication bayesian spam filtering sahami et al 1998 work soon thereafter deployed commercial spam filters however 2002 paul graham greatly decreased false positive rate could used single spam filter variants basic technique implemented number research works commercial software products many modern mail clients implement bayesian spam filtering users also install separate email filtering programs server-side email filters dspam spamassassin spambayes bogofilter assp make use bayesian spam filtering techniques functionality sometimes embedded within mail server software crm114 oft cited bayesian filter intended use bayes filter production includes \u2033unigram\u2033 feature reference particular words particular probabilities occurring spam email legitimate email instance email users frequently encounter word viagra spam email seldom see email filter n't know probabilities advance must first trained build train filter user must manually indicate whether new email spam words training email filter adjust probabilities word appear spam legitimate email database instance bayesian spam filters typically learned high spam probability words viagra refinance low spam probability words seen legitimate email names friends family members training word probabilities also known likelihood functions used compute probability email particular set words belongs either category word email contributes email spam probability interesting words contribution called posterior probability computed using bayes theorem email spam probability computed words email total exceeds certain threshold say 95 filter mark email spam spam filtering technique email marked spam automatically moved junk email folder even deleted outright software implement quarantine mechanisms define time frame user allowed review software decision initial training usually refined wrong judgements software identified false positives false negatives allows software dynamically adapt ever-evolving nature spam spam filters combine results bayesian spam filtering heuristics pre-defined rules contents looking message envelope etc resulting even higher filtering accuracy sometimes cost adaptiveness bayesian email filters utilize bayes theorem bayes theorem used several times context spam let suppose suspected message contains word replica people used receiving e-mail know message likely spam precisely proposal sell counterfeit copies well-known brands watches spam detection software however know facts compute probabilities formula used software determine derived bayes theorem statistics show current probability message spam 80 least however bayesian spam detection software makes assumption priori reason incoming message spam rather ham considers cases equal probabilities 50 filters use hypothesis said biased meaning prejudice regarding incoming email assumption permits simplifying general formula functionally equivalent asking percentage occurrences word replica appear spam messages quantity called spamicity spaminess word replica computed number formula_4 used formula approximated frequency messages containing replica messages identified spam learning phase similarly formula_6 approximated frequency messages containing replica messages identified ham learning phase approximations make sense set learned messages needs big representative enough also advisable learned set messages conforms 50 hypothesis repartition spam ham i.e datasets spam ham size course determining whether message spam ham based presence word replica error-prone bayesian spam software tries consider several words combine spamicities determine message overall probability spam bayesian spam filtering algorithms based formulas strictly valid probabilistic standpoint words present message independent events condition generally satisfied example natural languages like english probability finding adjective affected probability noun useful idealization especially since statistical correlations individual words usually known basis one derive following formula bayes theorem formula referenced paul graham 2002 article early commentators stated graham pulled formulas thin air graham actually referenced source included detailed explanation formula idealizations based spam filtering software based formula sometimes referred naive bayes classifier naive refers strong independence assumptions features result p typically compared given threshold decide whether message spam p lower threshold message considered likely ham otherwise considered likely spam usually p directly computed using formula due floating-point underflow instead p computed log domain rewriting original equation follows taking logs sides let formula_22 therefore hence alternate formula computing combined probability case word never met learning phase numerator denominator equal zero general formula spamicity formula software decide discard words information available generally words encountered times learning phase cause problem would error trust blindly information provide simple solution simply avoid taking unreliable words account well applying bayes theorem assuming classification spam ham emails containing given word replica random variable beta distribution programs decide use corrected probability corrected probability used instead spamicity combining formula formula_3 taken equal 0.5 avoid suspicious incoming email 3 good value meaning learned corpus must contain 3 messages word put confidence spamicity value default value formula extended case n equal zero spamicity defined evaluates case formula_32 neutral words like english equivalents languages ignored generally bayesian filtering filters simply ignore words spamicity next 0.5 contribute little good decision words taken consideration whose spamicity next 0.0 distinctive signs legitimate messages next 1.0 distinctive signs spam method example keep ten words examined message greatest absolute value |0.5 \u2212 pi software products take account fact given word appears several times examined message others n't software products use patterns sequences words instead isolated natural languages words example context window four words compute spamicity viagra good instead computing spamicities viagra good method gives sensitivity context eliminates bayesian noise better expense bigger database ways combining individual probabilities different words using naive approach methods differ assumptions make statistical properties input data different hypotheses result radically different formulas combining individual probabilities example assuming individual probabilities follow chi-squared distribution 2 n degrees freedom one could use formula c inverse chi-squared function individual probabilities combined techniques markovian discrimination one main advantages bayesian spam filtering trained per-user basis spam user receives often related online user activities example user may subscribed online newsletter user considers spam online newsletter likely contain words common newsletters name newsletter originating email address bayesian spam filter eventually assign higher probability based user specific patterns legitimate e-mails user receives tend different example corporate environment company name names clients customers mentioned often filter assign lower spam probability emails containing names word probabilities unique user evolve time corrective training whenever filter incorrectly classifies email result bayesian spam filtering accuracy training often superior pre-defined rules perform particularly well avoiding false positives legitimate email incorrectly classified spam example email contains word nigeria frequently used advance fee fraud spam pre-defined rules filter might reject outright bayesian filter would mark word nigeria probable spam word would take account important words usually indicate legitimate e-mail example name spouse may strongly indicate e-mail spam could overcome use word nigeria depending implementation bayesian spam filtering may susceptible bayesian poisoning technique used spammers attempt degrade effectiveness spam filters rely bayesian filtering spammer practicing bayesian poisoning send emails large amounts legitimate text gathered legitimate news literary sources spammer tactics include insertion random innocuous words normally associated spam thereby decreasing email spam score making likely slip past bayesian spam filter however example paul graham scheme significant probabilities used padding text non-spam-related words affect detection probability significantly words normally appear large quantities spam may also transformed spammers example \u00ab viagra \u00bb would replaced \u00ab viaagra \u00bb \u00ab v agra \u00bb spam message recipient message still read changed words words met rarely bayesian filter hinders learning process general rule spamming technique work well derived words end recognized filter like normal ones another technique used try defeat bayesian spam filters replace text pictures either directly included linked whole text message part replaced picture text drawn spam filter usually unable analyze picture would contain sensitive words like \u00ab viagra \u00bb however since many mail clients disable display linked pictures security reasons spammer sending links distant pictures might reach fewer targets also picture size bytes bigger equivalent text size spammer needs bandwidth send messages directly including pictures filters inclined decide message spam mostly graphical contents solution used google gmail email system perform ocr optical character recognition every mid large size image analyzing text inside bayesian filtering used widely identify spam email technique classify cluster almost sort data uses science medicine engineering one example general purpose classification program called autoclass originally used classify stars according spectral characteristics otherwise subtle notice", + "neighbors": [ + 229, + 285, + 312, + 488, + 617, + 620, + 646, + 832, + 1094, + 1171, + 1172, + 1446, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1250, + "label": 4, + "text": "Personal_firewall:personal firewall personal firewall application controls network traffic computer permitting denying communications based security policy typically works application layer firewall personal firewall differs conventional firewall terms scale personal firewall usually protect computer installed compared conventional firewall normally installed designated interface two networks router proxy server hence personal firewalls allow security policy defined individual computers whereas conventional firewall controls policy networks connects per-computer scope personal firewalls useful protect machines moved across different networks example laptop computer may used trusted intranet workplace minimal protection needed conventional firewall already place services require open ports file printer sharing useful laptop could used public wi-fi hotspots time decide level trust set individual security policies network unlike network firewalls many personal firewalls able control network traffic allowed programs secured computer application attempts outbound connection firewall may block blacklisted ask user whether blacklist yet known protects malware implemented executable program personal firewalls may also provide level intrusion detection allowing software terminate block connectivity suspects intrusion attempted common personal firewall features firewalls help protecting internal network hackers however firewall limitations mid 1990s part information security architecture project fortune 100 corporation united states anheuser-busch corporation one members three-man architectural development team came concept regards improving overall security operating system used computers within networked system network system referred budnet improving overall security operating system commonly referred os hardening member team charged ssgt donald r. woeltje jr. concept came installation special software firewall software every budnet server workstation perimeter security device indeed every single windows system budnet network concept commonly referred personal firewall software ssgt woeltje invent personal firewall software invent idea personal firewall evidence fact exists anheuser-busch security model proposal document made ssgt woeltje time ssgt woeltje brought leading firewall vendors meetings concerning products considered use perimeter security budnet network ssgt woeltje brought concept personal firewall vendors asked firewall product could used way exception representatives cyberguard corporation every vendor said firewall software could used way also said idea crazy unworkable today know wrong use personal firewall software become de facto computer security standard companies ssgt woeltje discussed personal firewall software among others cisco checkpoint axent technologies milkyway networks cyberguard network one trusted information systems secure computing corporation", + "neighbors": [ + 94, + 134, + 149, + 189, + 217, + 336, + 379, + 476, + 569, + 648, + 656, + 678, + 685, + 703, + 731, + 739, + 842, + 910, + 961, + 1257, + 1338, + 1403, + 1406, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Validation" + }, + { + "node_id": 1251, + "label": 9, + "text": "LispWorks:lispworks lispworks computer software proprietary implementation integrated development environment ide programming language common lisp lispworks developed uk software company harlequin ltd. first published 1989 harlequin ultimately spun lisp division xanalys ltd. took management rights lispworks january 2005 xanalys lisp team formed lispworks ltd. market develop support software lispworks features include enterprise edition also includes knowledgeworks supports rule-based logic programming including support prolog commonsql database interface common object request broker architecture corba binding september 2009 announced lispworks 6 would support concurrent threads capi graphics toolkit extended support gtk+ lispworks 6.1 released january 2012 includes many enhancements capi support anti-aliased drawing lispworks ran spacecraft deep space 1 application called rax nasa software year award 1999", + "neighbors": [ + 27, + 46, + 56, + 99, + 117, + 134, + 173, + 194, + 203, + 210, + 251, + 258, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 394, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 509, + 536, + 565, + 567, + 601, + 649, + 653, + 682, + 686, + 693, + 753, + 787, + 795, + 796, + 815, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1068, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1189, + 1190, + 1207, + 1221, + 1225, + 1227, + 1235, + 1245, + 1269, + 1277, + 1298, + 1311, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1502, + 1516, + 1532, + 1536, + 1588, + 1609, + 1621, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1252, + "label": 6, + "text": "Btrfs:btrfs btrfs pronounced butter fuss better f butter f b-tree f simply spelling file system based copy-on-write cow principle initially designed oracle corporation use linux development btrfs began 2007 since november 2013 file system on-disk format marked stable btrfs intended address lack pooling snapshots checksums integral multi-device spanning linux file systems chris mason principal btrfs author stated goal let linux scale storage available scaling addressing storage also means able administer manage clean interface lets people see used makes reliable core data structure btrfsthe copy-on-write b-treewas originally proposed ibm researcher ohad rodeh presentation usenix 2007 chris mason engineer working reiserfs suse time joined oracle later year began work new file system based b-trees 2008 principal developer ext3 ext4 file systems theodore ts stated although ext4 improved features major advance uses old technology stop-gap ts said btrfs better direction offers improvements scalability reliability ease management btrfs also number design ideas reiser3/4 btrfs 1.0 finalized on-disk format originally slated late-2008 release finally accepted linux kernel mainline 2009 several linux distributions began offering btrfs experimental choice root file system installation july 2011 btrfs automatic defragmentation scrubbing features merged version 3.0 linux kernel mainline besides mason oracle miao xie fujitsu contributed performance improvements june 2012 chris mason left oracle fusion-io left year later josef bacik join facebook companies mason continued work btrfs 2012 two linux distributions moved btrfs experimental production supported status oracle linux march followed suse linux enterprise august 2015 btrfs adopted default filesystem suse linux enterprise server 12 august 2017 red hat announced release notes red hat enterprise linux rhel 7.4 longer planned move btrfs included technology preview since rhel 6 beta fully supported feature noting would remain available rhel 7 release series btrfs removed rhel 8 may 2019 version 5.0 linux kernel btrfs implements following features 2009 btrfs expected offer feature set comparable zfs developed sun microsystems oracle acquisition sun 2009 mason oracle decided continue btrfs development btrfs provides clone operation atomically creates copy-on-write snapshot file cloned files sometimes referred reflinks light associated linux kernel system calls cloning file system create new link pointing existing inode instead creates new inode initially shares disk blocks original file result cloning works within boundaries btrfs file system since version 3.6 linux kernel may cross boundaries subvolumes certain circumstances actual data blocks duplicated time due copy-on-write cow nature btrfs modifications cloned files visible original file vice versa cloning confused hard links directory entries associate multiple file names actual files file system hard links taken different names file cloning btrfs provides independent files share disk blocks support btrfs feature added version 7.5 gnu coreutils via codice_2 option codice_3 command btrfs subvolume thought separate posix file namespace mountable separately passing codice_4 codice_5 options utility also accessed mounting top-level subvolume case subvolumes visible accessible subdirectories subvolumes created place within file system hierarchy also nested nested subvolumes appear subdirectories within parent subvolumes similarly way top-level subvolume presents subvolumes subdirectories deleting subvolume possible subvolumes nesting hierarchy deleted result top-level subvolumes deleted btrfs file system always default subvolume initially set top-level subvolume mounted default subvolume selection option passed codice_6 default subvolume changed required btrfs snapshot subvolume shares data metadata subvolume using btrfs copy-on-write capabilities modifications snapshot visible original subvolume writable snapshot made treated alternate version original file system example roll back snapshot modified original subvolume needs unmounted snapshot needs mounted place point original subvolume may also deleted copy-on-write cow nature btrfs means snapshots quickly created initially consuming little disk space since snapshot subvolume creating nested snapshots also possible taking snapshots subvolume recursive process thus snapshot subvolume created every subvolume snapshot subvolume already contains mapped empty directory name inside snapshot taking snapshots directory possible subvolumes snapshots however workaround involves reflinks spread across subvolumes new subvolume created containing cross-subvolume reflinks content targeted directory available snapshot new volume created subvolume btrfs quite different traditional logical volume manager lvm logical volume lvm logical volume separate block device btrfs subvolume treated used way making dd lvm snapshots btrfs leads dataloss either original copy mounted computer given pair subvolumes snapshots btrfs generate binary diff using codice_7 command replayed later using codice_8 possibly different btrfs file system send\u2013receive feature effectively creates applies set data modifications required converting one subvolume another send/receive feature used regularly scheduled snapshots implementing simple form file system master\u2013slave replication purpose performing incremental backups quota group qgroup imposes upper limit space subvolume snapshot may consume new snapshot initially consumes quota data shared parent thereafter incurs charge new files copy-on-write operations existing files quotas active quota group automatically created new subvolume snapshot initial quota groups building blocks grouped codice_9 command hierarchies implement quota pools quota groups apply subvolumes snapshots quotas enforced individual subdirectories users user groups possible however workarounds possible using different subvolumes users user groups require quota enforced result little metadata anchored fixed locations btrfs warp fit unusual spatial layouts backend storage devices codice_10 tool exploits ability in-place conversion ext2/3/4 reiserfs file system nesting equivalent btrfs metadata unallocated space\u2014while preserving unmodified copy original file system conversion involves creating copy whole ext2/3/4 metadata btrfs files simply point blocks used ext2/3/4 files makes bulk blocks shared two filesystems conversion becomes permanent thanks copy-on-write nature btrfs original versions file data blocks preserved file modifications conversion becomes permanent blocks marked free ext2/3/4 used hold new btrfs modifications meaning conversion undone time although erase changes made conversion btrfs converted files available writable default subvolume btrfs sparse file holding references original ext2/3/4 filesystem created separate subvolume mountable read-only disk image allowing original converted file systems accessed time deleting sparse file frees space makes conversion permanent june 2015 4.x versions linux kernel mainline in-place ext3/4 conversion considered untested rarely used feature however rewritten scratch 2016 codice_11 4.6. considered stable since in-place conversion reiserfs introduced september 2017 kernel 4.13 creating new btrfs existing btrfs used read-only seed file system new file system act copy-on-write overlay seed form union mounting seed later detached btrfs point rebalancer simply copy seed data still referenced new file system detaching mason suggested may useful live cd installer might boot read-only btrfs seed optical disc rebalance target partition install disk background user continues work eject disc complete installation without rebooting 2009 interview chris mason stated support encryption planned btrfs meantime workaround combining encryption btrfs use full-disk encryption mechanism dm-crypt luks underlying devices create btrfs filesystem top layer unix systems traditionally rely fsck programs check repair filesystems functionality implemented via codice_12 program since version 4.0 functionality deemed relatively stable however august 2017 btrfs documentation suggests used tried recovery methods another tool named codice_13 used recover files unmountable filesystem without modifying broken filesystem i.e. non-destructively normal use btrfs mostly self-healing recover broken root trees mount time thanks making periodic data flushes permanent storage default every 30 seconds thus isolated errors cause maximum 30 seconds filesystem changes lost next mount period changed specifying desired value seconds codice_14 mount option ohad rodeh original proposal usenix 2007 noted b+ trees widely used on-disk data structures databases could efficiently allow copy-on-write-based snapshots leaf nodes linked together leaf copy-on-written siblings parents would well would siblings parents entire tree copied suggested instead modified b-tree leaf linkage refcount associated tree node stored ad-hoc free map structure certain relaxations tree balancing algorithms make copy-on-write friendly result would data structure suitable high-performance object store could perform copy-on-write snapshots maintaining good concurrency oracle later year chris mason began work snapshot-capable file system would use data structure almost exclusively\u2014not metadata file data also recursively track space allocation trees allowed traversal modifications funneled single code path features copy-on-write checksumming mirroring needed implemented benefit entire file system btrfs structured several layers trees using b-tree implementation trees store generic items sorted 136-bit key first 64 bits key unique object id middle 8 bits item type field use hardwired code item filter tree lookups objects multiple items multiple types remaining right-hand 64 bits used type-specific ways therefore items object end adjacent tree ordered type choosing certain right-hand key values objects put items type particular order interior tree nodes simply flat lists key-pointer pairs pointer logical block number child node leaf nodes contain item keys packed front node item data packed end two growing toward leaf fills every tree appears object root tree tree tree roots trees file system trees log trees variable number instances given object id trees singletons data relocation extent chunk trees assigned special fixed object ids \u2264256 root tree appears tree object id 1 trees refer object id may also refer individual nodes trees triplet tree object id node level within tree leftmost key value references independent tree actually stored user-visible files directories contained file system tree one file system tree per subvolume subvolumes nest case appear directory item described whose data reference nested subvolume file system tree within file system tree file directory object inode item extended attributes acl entries stored alongside separate items within directory directory entries appear directory items whose right-hand key values crc32c hash filename data location key key inode item points directory items together thus act index path-to-inode lookups used iteration sorted hash effectively randomly permuting means user applications iterating opening files large directory would thus generate many disk seeks non-adjacent files\u2014a notable performance drain file systems hash-ordered directories reiserfs ext3 htree-indexes enabled ext4 tea-hashed filenames avoid directory entry directory index item whose right-hand key value item set per-directory counter increments new directory entry iteration index items thus returns entries roughly order stored disk besides inode items files directories also reference item whose right-hand key value object id parent directory data part reference item filename inode known directory allows upward traversal directory hierarchy providing way map inodes back paths files hard links multiple directories multiple reference items one parent directory files multiple hard links directory pack links filenames reference item design flaw limited number same-directory hard links however many could fit single tree block default block size 4 kib average filename length 8 bytes per-filename header 4 bytes would less 350 applications made heavy use multiple same-directory hard links git gnus gmame backuppc later observed fail hitting limit limit eventually removed october 2012 merged pending release linux 3.7 introducing spillover extended reference items hold hard link filenames could otherwise fit file data kept outside tree extents contiguous runs disk blocks extent blocks default 4kib size headers contain possibly compressed file data compressed extents individual blocks compressed separately rather compression stream spans entire extent files extent data items track extents hold contents item right-hand key value starting byte offset extent makes efficient seeks large files many extents correct extent given file offset computed one tree lookup snapshots cloned files share extents small part large extent overwritten resulting copy-on-write may create three new extents small one containing overwritten data two large ones unmodified data either side overwrite avoid re-write unmodified data copy-on-write may instead create bookend extents extents simply slices existing extents extent data items allow including offset extent tracking items bookends non-zero offsets file data small enough fit inside tree node instead pulled in-tree stored inline extent data item tree node stored tree block \u2014a single uncompressed block header tree block regarded free-standing single-block extent extent allocation tree acts allocation map file system unlike trees items tree object ids represent regions space left-hand right-hand key values starting offsets lengths regions represent file system zones allocated space block groups variable-sized allocation regions alternate successively preferring metadata extents tree nodes data extents file contents default ratio data metadata block groups 1:2 intended work like orlov block allocator block groups ext3 allocating related files together resisting fragmentation leaving allocation gaps groups ext3 block groups however fixed locations computed size file system whereas btrfs dynamic created needed block group associated block group item inode items file system tree include reference current block group extent items contain back-reference tree node file occupying extent may multiple back-references extent shared snapshots many back-references fit item spill individual extent data reference items tree nodes turn back-references containing trees makes possible find extents tree nodes region space b-tree range lookup pair offsets bracketing region following back-references relocating data allows efficient upwards traversal relocated blocks quickly find fix downwards references blocks without walk entire file system turn allows file system efficiently shrink migrate defragment storage online extent allocation tree trees file system copy-on-write writes file system may thus cause cascade whereby changed tree nodes file data result new extents allocated causing extent tree change avoid creating feedback loop extent tree nodes still memory yet committed disk may updated in-place reflect new copy-on-written extents theory extent allocation tree makes conventional free-space bitmap unnecessary extent allocation tree acts b-tree version bsp tree practice however in-memory red-black tree page-sized bitmaps used speed allocations bitmaps persisted disk starting linux 2.6.37 via codice_15 mount option special extents exempt checksumming copy-on-write extent items tracking extents stored root tree crc-32c checksums computed data metadata stored checksum items checksum tree room 256 bits metadata checksums full leaf block roughly 4 kb data checksums checksum algorithm options planned future one checksum item per contiguous run allocated blocks per-block checksums packed end-to-end item data checksums fit spill rightwards another checksum item new leaf file system detects checksum mismatch reading block first tries obtain create good copy block another device internal mirroring raid techniques use btrfs initiate online check entire file system triggering file system scrub job performed background scrub job scans entire file system integrity automatically attempts report repair bad blocks finds along way fsync request commit modified data immediately stable storage fsync-heavy workloads like database virtual machine whose running os fsyncs intensively could potentially generate great deal redundant write i/o forcing file system repeatedly copy-on-write flush frequently modified parts trees storage avoid temporary per-subvolume log tree created journal fsync-triggered copy-on-writes log trees self-contained tracking extents keeping checksum items items replayed deleted next full tree commit system crash next remount block devices divided physical chunks 256 mb physical chunks across multiple devices mirrored striped together single logical chunk logical chunks combined single logical address space rest filesystem uses chunk tree tracks storing device therein device item logical chunks chunk map items provide forward mapping logical physical addresses storing offsets right-hand 64 bits key chunk map items one several different types n however many block devices still free space chunk allocated n large enough chosen mirroring/mapping filesystem effectively space device tree inverse chunk tree device extent items provide reverse mapping byte-ranges block devices back logical chunks storing device number left hand 64-bits physical offset right-hand 64 bits key two trees together allow btrfs grow shrink even change raid levels without unmounting make possible efficiently locate chunks affected shrink/move operations relocate contents on-the-fly file system chunks devices assigned universally unique identifier uuid header every tree node contains uuid containing chunk uuid file system chunk device trees refer devices chunks uuids filesystems single block device dup also default profile metadata intended improve odds successful data salvage event media errors defragmentation shrinking rebalancing operations require extents relocated however simple copy-on-write relocating extent break sharing snapshots consume disk space preserve sharing update-and-swap algorithm used special relocation tree serving scratch space affected metadata extent relocated first copied destination following backreferences upward affected subvolume file system tree metadata pointing old extent progressively updated point new one newly updated items stored relocation tree update complete items relocation tree swapped counterparts affected subvolume relocation tree discarded file system trees\u2014including chunk tree itself\u2014are stored chunks creating potential bootstrapping problem mounting file system bootstrap mount list physical addresses chunks belonging chunk root trees must stored superblock superblock mirrors kept fixed locations 64 kib every block device additional copies 64 mib 256 gib 1 pib superblock mirror updated generation number incremented mount time copy highest generation number used superblock mirrors updated tandem except ssd mode alternates updates among mirrors provide wear levelling", + "neighbors": [ + 34, + 40, + 55, + 63, + 82, + 134, + 171, + 213, + 219, + 222, + 233, + 265, + 267, + 275, + 278, + 295, + 305, + 326, + 327, + 334, + 346, + 349, + 358, + 365, + 400, + 401, + 429, + 438, + 477, + 495, + 505, + 524, + 553, + 557, + 558, + 570, + 571, + 650, + 716, + 720, + 723, + 725, + 728, + 736, + 887, + 892, + 900, + 908, + 912, + 922, + 935, + 942, + 982, + 986, + 997, + 1056, + 1064, + 1097, + 1102, + 1104, + 1124, + 1138, + 1157, + 1179, + 1187, + 1201, + 1202, + 1208, + 1234, + 1241, + 1278, + 1283, + 1313, + 1322, + 1357, + 1360, + 1361, + 1381, + 1391, + 1415, + 1445, + 1449, + 1456, + 1459, + 1468, + 1524, + 1526, + 1538, + 1558, + 1565, + 1578, + 1637, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1253, + "label": 3, + "text": "Code_Breaker:code breaker code breaker cheat device developed pelican accessories currently available playstation playstation 2 dreamcast game boy advance nintendo ds along competing product action replay one currently supported video game cheat devices originally developed fire international group distributed pelican accessories ntsc/uc north american counterpart pal european xploder cheat device codebreaker first appeared dreamcast relatively late console lifecycle soon dreamcast version released development began playstation 2 version version six hit market fire international abruptly broke partnership pelican develop newly mad catz-acquired gameshark also time game boy advance code breaker discontinued pelican accessories put together internal development team proceeded future versions codebreaker original site www.codebreaker.com codetwink bought new site day1 feature allows get codes online import codebreaker usb flash drive codes removed codetwink brought back though previous versions playstation 2 code breaker plagued limited functionality later versions lauded features simple uncluttered menu typing systems version 9 added support usb keyboards unlike cheat devices store cheat codes proprietary storage devices playstation 2 code breaker stores codes memory cards thus cutting manufacturing costs saves also copied usb flash drives device official web site codetwink run codemasterx also coded entire cheat engine cheat code types product provides codes posted former game shark code creators club codes downloaded official web site using device day1 feature later versions include support playstation 2 broadband adapter internet chat using code breaker device one access feature named day1 import/export saves cases one avoid typing number number using cheats import however pelican accessories longer supports since latest version codebreaker codebreaker 10.1 www.codebreaker.com set codebreaker site device longer connect internet get codes use codebreaker chat site change code breaker discontinued may 2012 www.codetwink.com uses vbulletin type site format still codebreaker day1 files available download people register account june 2013 day1 files unavailable codetwink.com server moved hard drive damaged april 2017 mirror old codetwink site hosted wes castro developer cheat device project codemasterx also returned hosting maintaining modern codetwink site also sells game genie game save editor playstation 3 consoles", + "neighbors": [ + 1442 + ], + "mask": "Test" + }, + { + "node_id": 1254, + "label": 7, + "text": "Apache_Pig:apache pig apache pig high-level platform creating programs run apache hadoop language platform called pig latin pig execute hadoop jobs mapreduce apache tez apache spark pig latin abstracts programming java mapreduce idiom notation makes mapreduce programming high level similar sql relational database management systems pig latin extended using user-defined functions udfs user write java python javascript ruby groovy call directly language apache pig originally developed yahoo research around 2006 researchers ad-hoc way creating executing mapreduce jobs large data sets 2007 moved apache software foundation example word count program pig latin program generate parallel executable tasks distributed across multiple machines hadoop cluster count number words dataset webpages internet comparison sql pig hand argued dbmss substantially faster mapreduce system data loaded loading data takes considerably longer database systems also argued rdbmss offer box support column-storage working compressed data indexes efficient random data access transaction-level fault tolerance pig latin procedural fits naturally pipeline paradigm sql instead declarative sql users specify data two tables must joined join implementation use specify implementation join sql thus ... many sql applications query writer may enough knowledge data enough expertise specify appropriate join algorithm. pig latin allows users specify implementation aspects implementation used executing script several ways effect pig latin programming similar specifying query execution plan making easier programmers explicitly control flow data processing task sql oriented around queries produce single result sql handles trees naturally built mechanism splitting data processing stream applying different operators sub-stream pig latin script describes directed acyclic graph dag rather pipeline pig latin ability include user code point pipeline useful pipeline development sql used data must first imported database cleansing transformation process begin", + "neighbors": [ + 134, + 178, + 192, + 197, + 296, + 318, + 509, + 620, + 715, + 874, + 926, + 961, + 1091, + 1138, + 1163, + 1225, + 1259, + 1311, + 1454, + 1583, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1255, + "label": 7, + "text": "HyperCast:hypercast hypercast overlay middleware implemented java application-level overlay networks network applications use hypercast build overlay network top underlying networks internet without changing internet routing switching infrastructure hypercast supports multiple overlay topologies node discovery algorithms routing schemes multicast models etc designed simple interfaces application overlay functions allowing developers quickly create network applications without much knowledge internal details application-layer overlay networks hypercast introduces concept overlay sockets endpoints communication i.e node overlay network hypercast overlay network simply viewed collection overlay sockets overlay socket logical address physical address logical address unique address identifies node overlay network well route overlay messages among overlay sockets physical address overlay socket specifies address underlying network overlay socket send receive messages hypercast provides best-e\ufb00ort communication service unreliable unordered possible duplication application messages referred overlay messages hypercast implements secure distributed peer-to-peer naming service", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1256, + "label": 3, + "text": "Speculative_execution:speculative execution speculative execution optimization technique computer system performs task may needed work done known whether actually needed prevent delay would incurred work known needed turns work needed changes made work reverted results ignored objective provide concurrency extra resources available approach employed variety areas including branch prediction pipelined processors value prediction exploiting value locality prefetching memory files optimistic concurrency control database systems speculative multithreading special case speculative execution modern pipelined microprocessors use speculative execution reduce cost conditional branch instructions using schemes predict execution path program based history branch executions order improve performance utilization computer resources instructions scheduled time yet determined instructions need executed ahead branch speculative computation related earlier concept eager execution form speculative execution sides conditional branch executed however results committed predicate true unlimited resources eager execution also known oracle execution would theory provide performance perfect branch prediction limited resources eager execution employed carefully since number resources needed grows exponentially level branch executed eagerly predictive execution form speculative execution outcome predicted execution proceeds along predicted path actual result known prediction true predicted execution allowed commit however misprediction execution unrolled re-executed common forms include branch predictors memory dependence prediction generalized form sometimes referred value prediction lazy execution involve speculation incorporation speculative execution implementations haskell programming language current research topic eager haskell designed around idea speculative execution 2003 phd thesis made ghc support kind speculative execution abortion mechanism back case bad choice called optimistic execution deemed complicated starting 2017 series security vulnerabilities found implementations speculative execution common processor architectures effectively enabled elevation privileges include", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 158, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 486, + 508, + 529, + 567, + 589, + 633, + 643, + 659, + 719, + 752, + 776, + 800, + 803, + 821, + 846, + 907, + 926, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1069, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1233, + 1272, + 1284, + 1290, + 1336, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1257, + "label": 4, + "text": "IPFilter:ipfilter ipfilter commonly referred ipf open-source software package provides firewall services network address translation nat many unix-like operating systems author software maintainer darren reed ipfilter supports ipv4 ipv6 protocols stateful firewall ipfilter delivered freebsd netbsd solaris 10 11 illumos used part openbsd removed may 2001 due problems license negotiations theo de raadt reed broke subsequently replaced openbsd pf developed openbsd developers dragonfly bsd removed support ipfilter may 2011 ipfilter installed runtime-loadable kernel module directly incorporated operating system kernel depending specifics kernel user preferences software documentation recommends module approach possible operating systems support ipfilter include", + "neighbors": [ + 38, + 94, + 134, + 189, + 195, + 217, + 272, + 290, + 377, + 476, + 569, + 648, + 656, + 685, + 731, + 754, + 842, + 899, + 910, + 961, + 992, + 1124, + 1138, + 1250, + 1278, + 1322, + 1366, + 1403, + 1406, + 1462, + 1514, + 1538, + 1542, + 1568, + 1578 + ], + "mask": "Test" + }, + { + "node_id": 1258, + "label": 4, + "text": "Project_Shield:project shield project shield anti-distributed-denial-of-service anti-ddos service offered jigsaw subsidiary google parent company alphabet inc. websites media elections human rights related content main goal project serve small under-resourced news sites vulnerable web \u2019 growing epidemic ddos attacks according team lead george conard similar services offered companies like cloudflare google initially announced project shield ideas conference october 21 2013 service initially offered trusted testers february 25 2016 google opened service qualifying website google-owned reverse proxy identifies filters malicious traffic may 2018 jigsaw announced would start offering free protection distributed denial service attacks us political campaigns candidates political action committees setting project shield involves changing dns domain traffic website goes google \u2019 system gets front page project shield provides news human rights elections monitoring sites protection ddos distributed denial service system caching storing data protected website reduce load site also filters traffic thwart ddos attacks project shield built google cloud services provided free charge qualifying websites independent journalists human rights elections monitoring websites protect regardless location project shield 2016 october users europe asia north america africa", + "neighbors": [ + 14, + 363 + ], + "mask": "Test" + }, + { + "node_id": 1259, + "label": 9, + "text": "Sawzall_(programming_language):sawzall programming language sawzall procedural domain-specific programming language used google process large numbers individual log records sawzall first described 2003 szl runtime open-sourced august 2010 however since mapreduce table aggregators released open-sourced runtime useful large-scale data analysis multiple log files shelf sawzall replaced lingo logs go purposes within google google server logs stored large collections records protocol buffers partitioned many disks within gfs order perform calculations involving logs engineers write mapreduce programs c++ java mapreduce programs need compiled may verbose necessary writing program analyze logs time-consuming make easier write quick scripts rob pike et al developed sawzall language sawzall script runs within map phase mapreduce emits values tables reduce phase script writer concerned aggregates tables multiple runs single set tables currently language runtime runs sawzall script single input open-sourced supporting program built mapreduce released interesting features include sawzall design favors efficiency engine simplicity power complete sawzall program read input produce three results number records sum values sum squares values", + "neighbors": [ + 24, + 41, + 85, + 131, + 176, + 182, + 216, + 422, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1185, + 1254, + 1265, + 1310, + 1371, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1260, + "label": 3, + "text": "Stormbringer_(video_game):stormbringer video game stormbringer computer game written david jones released 1987 mastertronic mastertronic added dimension label originally released zx spectrum commodore 64 amstrad cpc msx version atari st published 1988 fourth final game magic knight series in-game music david whittaker magic knight finally returns home obtained second-hand time-machine tyme guardians end knight tyme however accident whilst travelling back two magic knights off-white knight dreaded stormbringer called storm cloud plans use destroy magic knight magic knight kill off-white knight without destroying process option find off-white knight merge gameplay takes form graphic adventure commands inputted via windimation menu-driven interface style previous two games spellbound knight tyme 1986 magic knight limited amount strength consumed performing actions moving screen screen well sapped various enemies stormbringer storm cloud spinning axes balls bounce around rooms avoided need player monitor magic knight strength avoid enemies means stormbringer gameplay closer arcade adventure feel spellbound rather much pure graphic adventure feel knight tyme previous two magic knight games characters magic knight interact help magic knight spellcasting abilities also important solving game puzzles including merge spell used finds off-white knight", + "neighbors": [ + 823, + 1612 + ], + "mask": "Test" + }, + { + "node_id": 1261, + "label": 2, + "text": "Windows_Mobility_Center:windows mobility center windows mobility center component microsoft windows introduced windows vista centralizes information settings relevant mobile computing mobility center displayed device settings pertinent mobile devices first shown windows hardware engineering conference 2004 based activity center user interface design originated microsoft abandoned windows neptune project slated inclusion windows vista known codename longhorn windows mobility center user interface consists square tiles contain information settings related component audio settings battery life power schemes display brightness wireless network strength status tiles appear within interface depend hardware system device drivers windows mobility center located windows control panel also launched pressing keys windows vista 7 default wmc inaccessible desktop computers limitation bypassed one modifies windows registry windows mobility center extensible original equipment manufacturers customize interface additional tiles company branding though supported microsoft possible individual developers create tiles interface well", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1262, + "label": 3, + "text": "Apple_A8X:apple a8x apple a8x 64-bit arm-based system chip soc designed apple inc. manufactured tsmc first appeared ipad air 2 announced october 16 2014 variant a8 inside iphone 6 family smartphones apple states 40 cpu performance 2.5 times graphics performance predecessor apple a7 a8x three cores clocked 1.5 ghz powerful gpu compared a8 contains 3 billion transistors extra 100 mhz additional core a8x performs around 13 better single threaded 55 better multithreaded operations a8 inside iphone 6 iphone 6 plus comparison a8 shows a8x uses metal heat spreader a8 n't use package package configuration included ram a8 similar older x variants a5x a6x designed instead a8x ipad air 2 uses external 2 gb ram module first apple a8x reported semi-custom gpu a8x uses 8-cluster gpu based imagination technologies powervr series 6xt architecture officially largest implementation rogue 6-cluster design indicating apple made customizations design order provide higher performance gpu referred gxa6850 denoting apple customization a8x branch predictor claimed infringe 1998 patent october 14 2015 district judge found apple guilty infringing u.s. patent table based data speculation circuit parallel processing computer apple a7 a8 processors patent owned wisconsin alumni research foundation warf firm affiliated university wisconsin july 24 2017 apple ordered pay warf 506 million patent infringement apple filed appellate brief october 26 2017 u.s. court appeals federal circuit argued apple infringe patent owned wisconsin alumni research foundation september 28 2018 ruling overturned appeal award thrown u.s. federal circuit court appeals patent expired december 2016", + "neighbors": [ + 33, + 71, + 75, + 99, + 112, + 130, + 162, + 214, + 228, + 269, + 270, + 345, + 359, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 853, + 917, + 927, + 945, + 956, + 972, + 988, + 1069, + 1100, + 1147, + 1174, + 1176, + 1178, + 1215, + 1237, + 1273, + 1292, + 1294, + 1305, + 1373, + 1409, + 1488, + 1496, + 1518, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1263, + "label": 3, + "text": "P5_(microarchitecture):p5 microarchitecture first pentium microprocessor introduced intel march 22 1993 dubbed p5 microarchitecture fifth generation intel first superscalar ia-32 microarchitecture direct extension 80486 architecture included dual integer pipelines faster floating-point unit wider data bus separate code data caches features reduced address calculation latency 1996 pentium mmx technology often simply referred pentium mmx introduced basic microarchitecture complemented mmx instruction set larger caches enhancements p5 pentium competitors included motorola 68060 powerpc 601 well sparc mips alpha microprocessor families also used superscalar in-order dual instruction pipeline configuration time intel larrabee multicore architecture project uses processor core derived p5 core p54c augmented multithreading 64-bit instructions 16-wide vector processing unit intel low-powered bonnell microarchitecture employed early atom processor cores also uses in-order dual pipeline similar p5 intel discontinued p5 pentium processors downgraded entry-level product since pentium ii debuted 1997 1999 favor celeron processor also replaced 80486 brand p5 microarchitecture designed santa clara team designed 386 486 design work started 1989 team decided use superscalar architecture on-chip cache floating-point branch prediction preliminary design first successfully simulated 1990 followed laying-out design time team several dozen engineers design taped transferred silicon april 1992 point beta-testing began mid-1992 p5 team 200 engineers intel first planned demonstrate p5 june 1992 trade show pc expo formally announce processor september 1992 design problems forced demo cancelled official introduction chip delayed spring 1993 john h. crawford chief architect original 386 co-managed design p5 along donald alpert managed architectural team dror avnon managed design fpu vinod k. dham general manager p5 group p5 microarchitecture brings several important advancements preceding i486 architecture pentium designed execute 100 million instructions per second mips 75 mhz model able reach 126.5 mips certain benchmarks pentium architecture typically offered twice performance 486 processor per clock cycle common benchmarks fastest 80486 parts slightly improved microarchitecture 100 mhz operation almost powerful first-generation pentiums amd am5x86 roughly equal pentium 75 regarding pure alu performance early versions 60\u2013100 mhz p5 pentiums problem floating-point unit resulted incorrect predictable results division operations bug discovered 1994 professor thomas nicely lynchburg college virginia became known pentium fdiv bug caused embarrassment intel created exchange program replace faulty processors soon afterwards discovered bug could allow malicious program crash system without special privileges f00f bug fortunately operating systems able implement workarounds prevent crashes 60 66 mhz 0.8 \u00b5m versions p5 pentium processors also time high heat production due 5 v operation p54c used 3.3 v significantly lower power draw 51 quadratic relationship p5 pentiums used socket 4 p54c started socket 5 moving socket 7 later revisions desktop pentiums p54cs onwards used socket 7 pentium intel primary microprocessor personal computers mid-1990s original design reimplemented newer processes new features added maintain competitiveness well address specific markets portable computers result several variants p5 microarchitecture first pentium microprocessor core code-named p5 product code 80501 80500 earliest steppings q0399 two versions specified operate 60 mhz 66 mhz respectively first implementation pentium used traditional 5-volt power supply descended usual ttl logic compatibility requirements contained 3.1 million transistors measured 16.7 mm 17.6 mm area 293.92 mm fabricated 0.8 \u00b5m bicmos process 5-volt design resulted relatively high energy consumption operating frequency compared later models p5 followed p54c 80502 also known pentium-s versions specified operate 75 90 100 mhz using 3.3 volt power supply first pentium processor operate 3.3 volts reducing energy consumption employed internal clock multiplier let internal circuitry work higher frequency external address data buses complicated cumbersome increase external frequency due physical constraints also allowed two-way multiprocessing integrated local apic well new power management features contained 3.3 million transistors measured 163 mm fabricated bicmos process described 0.5 \u00b5m 0.6 \u00b5m due differing definitions p54c followed p54cqs operated 120 mhz fabricated 0.35 \u00b5m bicmos process first commercial microprocessor fabricated 0.35 \u00b5m process transistor count identical p54c despite newer process identical die area well chip connected package using wire bonding allows connections along edges chip smaller chip would required redesign package limit length wires edges chip would away pads package solution keep chip size retain existing pad-ring reduce size pentium logic circuitry enable achieve higher clock frequencies p54cqs followed p54cs operated 133 150 166 200 mhz contained 3.3 million transistors measured 90 mm fabricated 0.35 \u00b5m bicmos process four levels interconnect p24t pentium overdrive 486 systems released 1995 based 3.3 v 0.6 \u00b5m versions using 63 83 mhz clock since used socket 2/3 modifications made compensate 32-bit data bus slower on-board l2 cache 486 motherboards therefore equipped 32 kb l1 cache double pre-p55c pentium cpus p55c 80503 developed intel research development center haifa israel sold pentium mmx technology usually called pentium mmx although based p5 core featured new set 57 mmx instructions intended improve performance multimedia tasks encoding decoding digital media data pentium mmx line introduced october 22 1996 new instructions worked new data types 64-bit packed vectors either eight 8-bit integers four 16-bit integers two 32-bit integers one 64-bit integer example paddusb packed add unsigned saturated byte instruction adds two vectors containing eight 8-bit unsigned integers together elementwise addition would overflow saturates yielding 255 maximal unsigned value represented byte rather specialized instructions generally require special coding programmer used changes core include 6-stage pipeline vs. 5 p5 return stack first done cyrix 6x86 better parallelism improved instruction decoder 32 kb l1 cache 4-way associativity vs. 16 kb 2-way p5 4 write buffers could used either pipeline vs. one corresponding pipeline p5 improved branch predictor taken pentium pro 512-entry buffer vs. 256 p5 contained 4.5 million transistors area 140 mm fabricated 0.28 \u00b5m cmos process metal pitches previous 0.35 \u00b5m bicmos process intel described 0.35 \u00b5m similar transistor density process four levels interconnect p55c compatible common socket 7 motherboard configuration voltage requirements powering chip differ standard socket 7 specifications motherboards manufactured socket 7 prior establishment p55c standard compliant dual intensity required proper operation chip intel temporarily manufactured upgrade kit called overdrive designed correct lack planning motherboard makers part pentium mmx notebook cpus used mobile module held cpu module pcb cpu directly attached smaller form factor module snapped notebook motherboard typically heat spreader installed made contact module however 0.25 \u00b5m tillamook mobile pentium mmx named city oregon module also held 430tx chipset along system 512 kb sram cache memory introduction pentium competitors nexgen amd cyrix texas instruments announced pentium-compatible processors 1994 cio magazine identified nexgen nx586 first pentium-compatible cpu pc magazine described cyrix 6x86 first followed amd k5 delayed due design difficulties amd later bought nexgen order help design amd k6 cyrix purchased national semiconductor later processors amd intel retain compatibility original pentium manuals provide overview pentium processor features", + "neighbors": [ + 85, + 105, + 123, + 206, + 210, + 270, + 388, + 457, + 486, + 738, + 752, + 776, + 1002, + 1009, + 1016, + 1160, + 1174, + 1188, + 1220, + 1505, + 1518, + 1605 + ], + "mask": "Test" + }, + { + "node_id": 1264, + "label": 9, + "text": "ECMAScript:ecmascript ecmascript es scripting-language specification standardized ecma international ecma-262 iso/iec 16262 created standardize javascript foster multiple independent implementations javascript remained best-known implementation ecmascript since standard first published well-known implementations including jscript actionscript ecmascript commonly used client-side scripting world wide web increasingly used writing server applications services using node.js ecmascript specification standardized specification scripting language developed brendan eich netscape initially named mocha later livescript finally javascript december 1995 sun microsystems netscape announced javascript press release first edition ecma-262 adopted ecma general assembly june 1997 several editions language standard published since name ecmascript compromise organizations involved standardizing language especially netscape microsoft whose disputes dominated early standards sessions eich commented ecmascript always unwanted trade name sounds like skin disease javascript jscript aim compatible ecmascript also provide additional features described ecma specifications ten editions ecma-262 published work version 10 standard finalized june 2019 june 2004 ecma international published ecma-357 standard defining extension ecmascript known ecmascript xml e4x ecma also defined compact profile ecmascript \u2013 known es-cp ecma 327 \u2013 designed resource-constrained devices withdrawn 2015 proposed fourth edition ecma-262 ecmascript 4 es4 would first major update ecmascript since third edition published 1999 specification along reference implementation originally targeted completion october 2008 overview language released working group october 23 2007 august 2008 ecmascript 4th edition proposal scaled back project codenamed ecmascript harmony features discussion harmony time included intent features partly better support programming large allow sacrificing script ability dynamic improve performance example tamarin \u2013 virtual machine actionscript developed open sourced adobe \u2013 just-in-time compilation jit support certain classes scripts addition introducing new features es3 bugs proposed fixed edition 4 fixes others support json encoding/decoding folded ecmascript 5th edition specification work started edition 4 es-cp compact profile specification completed continued approximately 18 months slow progress made balancing theory netscape javascript 2 specification implementation experience microsoft jscript .net time focus shifted ecmascript xml e4x standard update without controversy late 2007 debate eich later mozilla foundation cto chris wilson microsoft platform architect internet explorer became public number blogs wilson cautioned proposed changes ecmascript made backwards incompatible respects earlier versions language update amounted breaking web stakeholders opposed changes hidden view eich responded stating wilson seemed repeating falsehoods blogs denied attempt suppress dissent challenged critics give specific examples incompatibility pointed microsoft silverlight adobe air rely c actionscript 3 respectively larger complex ecmascript edition 3 yahoo microsoft google 4th edition dissenters formed subcommittee design less ambitious update ecmascript 3 tentatively named ecmascript 3.1 edition would focus security library updates large emphasis compatibility aforementioned public sparring ecmascript 3.1 ecmascript 4 teams agreed compromise two editions would worked parallel coordination teams ensure ecmascript 3.1 remains strict subset ecmascript 4 semantics syntax however differing philosophies team resulted repeated breakages subset rule remained doubtful ecmascript 4 dissenters would ever support implement ecmascript 4 future year since disagreement future ecmascript within ecma technical committee 39 two teams reached new compromise july 2008 brendan eich announced ecma tc39 would focus work ecmascript 3.1 later renamed ecmascript 5th edition project full collaboration parties vendors would target least two interoperable implementations early 2009 april 2009 ecma tc39 published final draft 5th edition announced testing interoperable implementations expected completed mid-july december 3 2009 ecma-262 5th edition published 6th edition initially known ecmascript 6 es6 later renamed ecmascript 2015 finalized june 2015 update adds significant new syntax writing complex applications including class declarations class foo ... es6 modules like import modulename ... export const foo defines semantically terms ecmascript 5 strict mode new features include iterators for/of loops python-style generators arrow function expression ... codice_1 keyword local declarations codice_2 keyword constant variable declarations binary data typed arrays new collections maps sets weakmap promises number math enhancements reflection proxies metaprogramming virtual objects wrappers template literals strings complete list extensive first ecmascript harmony specification also known es6 harmony 7th edition officially known ecmascript 2016 finalized june 2016 major standard language features include block-scoping variables functions destructuring patterns variables proper tail calls exponentiation operator codice_3 numbers codice_4 codice_5 keywords asynchronous programming 8th edition officially known ecmascript 2017 finalized june 2017 includescodice_6constructions work using generators promises ecmascript 2017 es2017 eighth edition includes features concurrency atomics syntactic integration promises async/await 9th edition officially known ecmascript 2018 finalized june 2018 new features include rest/spread operators variables three dots codice_7 asynchronous iteration codice_8 additions regexp 10th edition officially known ecmascript 2019 published june 2019.. es.next dynamic name refers whatever next version time writing es.next features correctly called proposals definition specification finalized yet ecmascript language includes structured dynamic functional prototype-based features es6 brought new mode defining functions called arrow functions es5 function would defined var readwikiarticle function content whereas es6 using new concise arrow function syntax var readwikiarticle content arrow functions also improve variable binding functions since es 2015 transpiling javascript become common transpilation source source compilation newer versions javascript used user source code transpiler rewrites compliant current specification usually transpilers transpile es3 maintain compatibility versions browsers settings transpiling specific version configured according need transpiling adds extra step build process sometimes done avoid needing polyfills polyfills allow using functionalities newer ecma versions older environments lack polyfills runtime interpreter user browser server instead transpiling rewrites ecma code build phase development reaches interpreter 2010 ecma international started developing standards test ecma 262 ecmascript test262 ecmascript conformance test suite used check closely javascript implementation follows ecmascript 5th edition specification test suite contains thousands individual tests tests specific requirements ecmascript specification development test262 project ecma technical committee 39 tc39 testing framework individual tests created member organizations tc39 contributed ecma use test262 important contributions made google sputnik testsuite microsoft contributed thousands tests test262 testsuite already contains 11,000 tests developed ecmascript specifications es7 well-supported major web browsers table shows conformance rate current versions software respect recent editions ecmascript content test hosted official repository https //github.com/tc39/test262 date test suite harness web browsers accessed also https //v8.github.io/test262/website/default.html https //bakkot.github.io/test262-web-runner/ official repository also points community maintained projects using test suite test ecmascript javascript environments like node.js", + "neighbors": [ + 7, + 14, + 19, + 36, + 50, + 69, + 81, + 83, + 132, + 152, + 176, + 246, + 249, + 251, + 258, + 306, + 347, + 373, + 378, + 430, + 509, + 593, + 632, + 680, + 686, + 712, + 869, + 872, + 959, + 1221, + 1225, + 1227, + 1228, + 1231, + 1232, + 1265, + 1275, + 1302, + 1311, + 1319, + 1324, + 1374, + 1430, + 1477, + 1491, + 1532, + 1566, + 1621, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1265, + "label": 9, + "text": "Google_Apps_Script:google apps script apps script scripting framework light-weight application development g suite platform based javascript 1.6 also includes portions 1.7 1.8 subset ecmascript 5 api apps script projects run server-side google infrastructure according google apps script provides easy ways automate tasks across google products third party services apps script also tool powers add-ons google docs sheets slides following code uses apps script ui services doclist services display contents google drive folder tree format notice use javascript use google web toolkit widgets google also introduced html service june 2012 alternative gwt widgets lets serve web pages interact server-side apps script functions embedding html gas gwt widget march 2014 google introduced add-ons docs sheets soon followed forms add-on stores let users add extra features google editors mail-merging workflows diagrams builders ... add-ons either 100 built apps script simply use apps script display ui google editors relying external backend perform tasks example mailchimp mail-merging tool add-on google docs communicates mailchimp platform send emails add-ons possible publish scripts google sheets script gallery users installed scripts gallery copy apps script code installed user sheet add-ons source code visible end user everyone using latest version published developer new approach make easier support existing code helped convince several companies mailchimp lucidchart invest apps script part add-ons release google also introduced ui style guide css package help developers built add-ons integrate smoothly editors add-on also reviewed google publication developers benefit advice googlers provide better user experience possible embed ads add-ons possible monetize", + "neighbors": [ + 24, + 41, + 131, + 132, + 176, + 182, + 216, + 422, + 480, + 502, + 509, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1185, + 1259, + 1264, + 1310, + 1371, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Validation" + }, + { + "node_id": 1266, + "label": 4, + "text": "Verisign:verisign verisign inc. american company based reston virginia united states operates diverse array network infrastructure including two internet thirteen root nameservers authoritative registry generic top-level domains country-code top-level domains back-end systems top-level domains verisign also offers range security services including managed dns distributed denial-of-service ddos attack mitigation cyber-threat reporting 2010 verisign sold authentication business unit \u2013 included secure sockets layer ssl certificate public key infrastructure pki verisign trust seal verisign identity protection vip services \u2013 symantec 1.28 billion deal capped multi-year effort verisign narrow focus core infrastructure security business units symantec later sold unit digicert 2017 verisign former chief financial officer cfo brian robins announced august 2010 company would move original location mountain view california dulles northern virginia 2011 due 95 company business east coast company incorporated delaware verisign founded 1995 spin-off rsa security certification services business new company received licenses key cryptographic patents held rsa set expire 2000 time-limited non-compete agreement new company served certificate authority ca initial mission providing trust internet electronic commerce digital authentication services products prior selling certificate business symantec 2010 verisign 3 million certificates operation everything military financial services retail applications making largest ca world 2000 verisign acquired network solutions operated tlds agreements internet corporation assigned names numbers icann united states department commerce core registry functions formed basis verisign naming division company largest significant business unit 2002 verisign charged violation securities exchange act verisign divested network solutions retail domain name registrar business 2003 retaining domain name registry wholesale function core internet addressing business year ended december 31 2010 verisign reported revenue 681 million 10 616 million 2009 verisign operates two businesses naming services encompasses operation top-level domains critical internet infrastructure network intelligence availability nia services encompasses ddos mitigation managed dns threat intelligence august 9 2010 symantec completed approximately 1.28 billion acquisition verisign authentication business including secure sockets layer ssl certificate services public key infrastructure pki services verisign trust services verisign identity protection vip authentication service majority stake verisign japan deal capped multi-year effort verisign narrow focus core infrastructure security business units following ongoing controversies regarding symantec handling certificate validation culminated google untrusting symantec-issued certificates chrome web browser symantec sold unit digicert 2017 verisign share price tumbled early 2014 hastened u.s. government announcement would relinquish oversight internet domain-naming system non-government entity ultimately internet corporation assigned names numbers chose continue verisign role root zone maintainer two entered new contract 2016 verisign core business naming services division division operates authoritative domain name registries two internet important top-level domains also contracted registry operator .name .gov top-level domains well country code top-level domains cocos islands tuvalu addition verisign primary technical subcontractor top-level domains respective registry operators non-profit organizations role verisign maintains zone files particular domains hosts domains domain servers registry operators wholesalers internet domain names domain name registrars act \u201c retailers \u201d working directly consumers register domain name address verisign also operates two internet thirteen root servers identified letters a-m verisign operates \u201c \u201d \u201c j \u201d root servers root servers form top hierarchical domain name system supports modern internet communication verisign also generates globally recognized root zone file also responsible processing changes file ordered icann via iana approved u.s. department commerce changes root zone originally distributed via root server distributed thirteen servers via separate distribution system verisign maintains verisign one 12 root server operators operate one thirteen root nameservers j root servers anycasted \u201d longer operated company datacenters means increase redundancy availability mitigate threat single point failure 2016 department commerce ended role managing internet dns transferred full control icann initially negatively impacted verisign stock icann eventually chose contract verisign continue role root zone maintainer verisign naming services division dates back 1993 network solutions awarded contract national science foundation manage operate civilian side internet domain name registrations network solutions sole registrar internet non governmental generic top-level domains 1998 icann established new system competitive registrars implemented result new policies network solutions divided two divisions nsi registry division established manage authoritative registries company would still operate separated customer-facing registrar business would compete registrars divisions even geographically split nsi registry moving corporate headquarters herndon virginia nearby dulles virginia 2000 verisign purchased network solutions taking role internet dns nsi registry division eventually became verisign naming services division remainder network solutions later sold verisign 2003 pivotal equity group verisign also offers trust seal products e-commerce sites competing space truste bbb online webtrust following sale authentication services division 2010 verisign relocated former headquarters mountain view california headquarters naming division sterling virginia originally nsi registry headquarters verisign began shopping year new permanent home shortly moving signed lease 12061 bluemont way reston former sallie mae headquarters 2010 decided purchase building september 2011 since terminated lease current space two buildings lakeside loudoun technology center company completed move end november 2011 new headquarters located reston town center development become major commercial business hub region addition reston headquarters verisign owns three data center properties one 22340 dresden street dulles virginia far corporate headquarters within large broad run technology park one 21 boulden circle new castle delaware third fribourg switzerland three data centers mirrored disaster one data center minimal impact operations verisign also leases office suite downtown washington d.c. k street government relations office located also leased server space numerous internet data centers around world dns constellation resolution sites located mostly major internet peering facilities one facility equinix ashburn datacenter ashburn virginia one world largest datacenters internet transit hubs january 2001 verisign mistakenly issued two class 3 code signing certificates individual claiming employee microsoft mistake discovered certificates revoked two weeks later routine audit verisign code-signing certificates specify certificate revocation list distribution point way automatically detected revoked placing microsoft customers risk microsoft later release special security patch order revoke certificates mark fraudulent 2002 verisign sued domain slamming \u2013 transferring domains registrars making registrants believe merely renewing domain name although found broken law barred suggesting domain expire claim transfer actually renewal september 2003 verisign introduced service called site finder redirected web browsers search service users attempted go non-existent domain names icann asserted verisign overstepped terms contract u.s. department commerce essence grants verisign right operate dns verisign shut service subsequently verisign filed lawsuit icann february 2004 seeking gain clarity services could offer context contract icann claim moved federal california state court august 2004 late 2005 verisign icann announced proposed settlement defined process introduction new registry services registry documents concerning settlements available icann.org icann comments mailing list archive documents criticisms raised regarding settlement additionally verisign involved matter decided ninth circuit keeping icann charter introduce competition domain name marketplace verisign agreed give operation top-level domain 2003 exchange continuation contract operate time 34 million registered addresses mid-2005 existing contract operation expired five companies including verisign bid management verisign enlisted numerous telecom heavyweights including microsoft ibm sun microsystems mci others assert verisign perfect record operating proposed verisign continue manage dns due critical importance domain underlying numerous backbone network services verisign also aided fact several bidders foreign based raised concerns national security circles june 8 2005 icann announced verisign approved operate 2011 information bidding process available icann july 1 2011 icann announced verisign approval operate .net extended another six years 2017 february 2012 verisign revealed network security repeatedly breached 2010 verisign stated breach impact domain name system dns maintain would provide details loss data verisign widely criticized disclosing breach earlier apparently attempting hide news october 2011 sec filing lack details provided verisign clear whether breach impacted certificate signing business acquired symantec late 2010 according oliver lavery director security research ncircle trust site using verisign ssl certificates without clarity logical answer \u201d november 29 2010 u.s. immigration customs enforcement u.s. ice issued seizure orders 82 web sites internet addresses reported involved illegal sale distribution counterfeit goods registry operator verisign performed required takedowns 82 sites order law enforcement informationweek reported verisign say received sealed court orders directing certain actions taken respect specific domain names removal 82 websites cited impetus launch dot-p2p project order create decentralized dns service without centralized registry operators following disappearance wikileaks following week forced move wikileaks.ch swiss domain electronic frontier foundation warned dangers key pieces internet infrastructure dns name translation corporate control", + "neighbors": [ + 88, + 124, + 232, + 257, + 317, + 425, + 965, + 1239, + 1384, + 1417, + 1534, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 1267, + "label": 5, + "text": "Internet_Open_Trading_Protocol:internet open trading protocol internet open trading protocol iotp protocol provides inter-operable standardized payment system independent framework internet commerce tries replicate real-world trading processes closely possible iotp systems include variety different payment systems including digital cash electronic checks debit cards within protocol various payment transaction data contained within specific iotp messages customer merchant credit checker certifier bank delivery handler", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1268, + "label": 2, + "text": "Global_Resource_Serialization:global resource serialization global resource serialization grs component within ibm z/os operating system responsible enabling fair access serially reusable computing resources datasets tape drives virtual resources lists queues control blocks programs request exclusive access resource means program subsequent requesting programs blocked program given access resource usually requested program needs update resource shared access means multiple programs given access resource usually requested program needs query state resource grs manages requests fifo first in/first order grs manages resources three different levels scoping order grs serialize resources multiple systems systems must clustered several options enable clustering ca inc. licenses product called multi-image manager ca-mim contains component called multi-image integrity mii used implement similar functions grs", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1269, + "label": 9, + "text": "Weblocks:weblocks weblocks advanced web framework common lisp web pages built simple widgets analogous gui widgets used application toolkits widgets written lisp using cl-who meta-language framework supports delimited continuations control flow full-stack framework since comes built-in database persistence systems programming weblocks similar continuation-passing style frameworks like seaside html http level details abstracted especially regard ajax form parameters although access easily available weblocks active development user community major lisp web-framework uncommon web extensions lisp lines built atop", + "neighbors": [ + 7, + 14, + 117, + 201, + 203, + 251, + 308, + 360, + 509, + 538, + 567, + 593, + 601, + 653, + 682, + 712, + 916, + 919, + 987, + 1021, + 1118, + 1138, + 1180, + 1225, + 1227, + 1235, + 1242, + 1251, + 1277, + 1298, + 1311, + 1315, + 1385, + 1389, + 1481 + ], + "mask": "Test" + }, + { + "node_id": 1270, + "label": 4, + "text": "BlueBorne_(security_vulnerability):blueborne security vulnerability blueborne type security vulnerability bluetooth implementations android ios linux windows affects many electronic devices laptops smart cars smartphones wearable gadgets one example vulnerabilities first reported armis iot security firm 12 september 2017 according armis blueborne attack vector potentially affect devices bluetooth capabilities estimated 8.2 billion devices today 2017 blueborne security vulnerabilities first reported armis iot security firm 12 september 2017 2017 blueborne estimated potentially affect 8.2 billion devices worldwide many devices affected including laptops smart cars smartphones wearable gadgets google provides blueborne vulnerability scanner armis android procedures help protect devices blueborne security vulnerabilities reported september 2017", + "neighbors": [ + 43, + 91, + 134, + 141, + 158, + 162, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1162, + 1186, + 1232, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1271, + "label": 3, + "text": "P.T.O.:p.t.o p.t.o pacific theater operations released japan console strategy video game released koei originally released pc-8801 1989 ported various platforms x68000 1990 msx2 1991 fm towns sega genesis super nes three 1992 players could assume one side pacific theater operations world war ii acting naval commander organizing fleets building new ships appropriating supplies fuel even engaging diplomacy countries player choose one several world war two battles simulate could control entire pacific campaign well japanese attack pearl harbor sequel p.t.o ii released koei 1993 teitoku ketsudan iii never released outside japan p.t.o iv released playstation 2 us europe players must choose one nine scenarios starting game first scenario negotiations breakdown long-term campaign player must win war mid-1941 war declared victory obtained controlling ports eliminating enemy ships scenarios begin midst certain major pacific conflict goal capture defend certain port sink protect number enemy ships scenario goal achieved player continue full campaign player option playing one two major world war ii pacific maritime powers united states allies japan axis countries begin allies two nations whatever point war gameplay begins time non-allied nations convinced ally side significant gifts diplomacy nations also break alliances poor diplomacy lead departure ships loaned navy instance united kingdom breaks allied forces us lose british ships fleet hermes countries behave historically example italy cease member axis 1943 due allied invasion countries available allies power starts control number pacific bases depending scenario begins focus long-term campaign capture enemy territories defending one reducing number ports enemy control zero territories produce fuel materials power controls fuel refers oil ships supplies soldiers materials refer ores metals used base repair ship repair construction new warships money used fund construction aircraft transports fund improvement technologies capturing territories thus increases resources available player denying use enemy power one home port newly manufactured ships aircraft stationed upon completion turn aircraft fuel materials assigned base however depending safety distance trade route resources may arrive certain ports capable 'urgent repair meaning affect small repairs ships docked ports capability control key regions crucial order maintain fighting capabilities one fleet sea less turnaround time ship repair ships damaged combat p.t.o faithfully recreates many actual battleships available pacific war displays ship icon relative ships ships given several attributes fortitude speed anti-air capability anti-ship capability ships also fitted radar search gunnery rockets scouts marines land invasion ships also given overall 'luck rating 1 99 ships survived many conflicts history like enterprise luck rating 99 several types warship available dreadnought battleships battleships cruisers fleet aircraft carriers light carriers destroyers submarines power starts certain number ships type number ships construction usually launching around historical commission date additional ships constructed replace ships previously lost battle either player prior scenario start date ship construction scheduled 6\u201324 months closer launch date industrial power expended construction materials consumed well dependent type hull built ship ratings chosen design ship class chosen construction cosmetic affect actual ship limitations attributes like actual hull type ships organized fleets comprise 16 ships 16 fleets arranged inactive ships home port one fleet side engage battle one time fleets must attack enemy succession rather fleets rating morale fatigue 0 99 morale goes victories shore leave defeats flagship lost also raised emergency banquet sea fatigue goes every battle crew infected plague ships also individual levels crew experience value starts high japanese low us experience levels gradually increase combat conducting training drills another type ship constructed transports used carrying additional fuel extend fleet range transporting resources territories home ports additional non-controlled shipping fleets constantly active game though displayed tactical maps transport fleets supplying bases protected unlisted destroyers cruisers engage enemy fleet following types aircraft immediately available fighters bombers scouts later game technology levels advanced jet fighters long-range bombers become available aircraft carriers fitted allow jets technology levels sufficient modified carrier carry jet fighters normal fighters long-range bombers launched land bases aircraft deployed bases aircraft carriers although ship types allow scouts launched via catapult aircraft placed bases take defensive role attacking fleet aircraft used scout enemy fleets day enemy fleets found land-based aircraft sortie attack naval fleet begins certain number fictional fleet commanders depending scenario chosen commanders placed command 16 fleets player arranges player creates commanders set rolled scores certain attributes \u2013 air command ability sea command ability bravery overall war ability scores range 01 99 total four scores 102 air sea abilities affect actual combat performance ships planes commander control bravery affects commander decision making fleet ai control war overall rating useful comes convincing army military officials agree submissions objectives budgeting industrial production computer gaming world 1993 approved genesis version p.t.o suitable core group strategy wargamers normally play videogames criticizing inadequate documentation reported game randomized campaigns provided 200-300 hours play time\u2014more comparatively priced cartridge magazine favorably concluded p.t.o establishes new trend video gaming", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1272, + "label": 3, + "text": "Single-core:single-core single-core processor microprocessor single core chip running single thread one time term became common emergence multi-core processors several independent processors single chip distinguish non-multi-core designs example intel released core 2 solo core 2 duo one would refer former 'single-core variant microprocessors prior multi-core era single-core class many-core processors follows multi-core progression showing increasing parallelism time processors remained single-core impossible achieve performance gains increased clock speed transistor count allowed moore law diminishing returns increasing depth pipeline increasing cpu cache sizes adding execution units", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 634, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 917, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1273, + "label": 3, + "text": "PowerBook_Duo:powerbook duo powerbook duo line small subnotebooks manufactured sold apple computer 1992 1997 compact companion powerbook line improving upon powerbook 100 portability immediate predecessor apple third-smallest laptop duo came seven different models duo 210 230 250 270c 280 280c 2300c 210 230 earliest 2300c final incarnation entire line dropped early 1997 weighing mere slightly smaller sheet paper thick lightest smallest apple powerbooks time remains one apple smallest notebooks ever produced macbook air retina macbook pro retina macbook weigh less though wider deeper considerably thinner duo common original macbook air included one usb 2.0 port one video port requiring adapter one speaker port ability expansion powerbook duo line replaced powerbook 2400 slightly larger size duos still fifth-smallest behind 12-inch powerbook g4 succeeded fourth-smallest although featured much onboard functionality lacked docking ability duo line offered ultraportable design light functional travel expandable via unique docking connector however certain compromises made achieve level portability duo series used 88 standard desktop-sized keyboard criticized difficult type likewise trackball reduced size even used powerbook 100 usable port came standard duo dual printer/modem eia-422 serial port slot expensive optional internal 14.4 express modem provision built-in ethernet somewhat limited configuration meant way move data laptop stock configuration without purchasing additional accessories via relatively slow appletalk connection practical event hard drive problems compensating limitations initial duo offering provided considerably higher ram limit 24 mb compared 100 series 14 mb standard 80 mb hard drive versus 100 40 mb drive debut year duo offered passive matrix display mid-level high-end models contrast high end 100-series line duos shared processors powerbook 170 180 crisp active matrix displays already great demand lower-powered models passive matrix displays following year apple replaced earlier models active matrix display color active matrix display latter becoming de facto standard powerbook line respective duo models easily differentiated display method processor features identical 2xx duos powered either motorola 68030 68lc040 processors ranging 25-33 mhz apple debuted next-generation powerpc processors 1994 took nearly two years first powerpc duo 2300c debut original powerpc 601 like original 68040 produced much heat consumed much power apple use laptop end 1995 efficient powerpc 603e developed featured duo 2300c full-size companion powerbook 5300 series powerpc 603e designed 64-bit bus engineered apple run older 32-bit bus maintain compatibility duo docks led poor system video performance powerbook duos lacked common ports featuring one internal printer/modem serial port optional fax/modem card port place docking ability accomplished via unique 156-pin processor direct slot pds giving docks full access duo central processing unit cpu data buses several dock options offered apple third parties largest expensive dock powerbook duo form factor offered exclusively apple unlike docks port replicators plugged back laptops duo dock pulled laptop inside dock metal plastic case via internal sliding mechanism similar vhs player dock turned powerbook duo full-size ac-powered fully functional desktop computer standard ports like desktop computer dock could physically support heavy high-resolution crt display top duo dock included floppy drive side two nubus expansion slots optional floating-point unit fpu level 2 cache slot vram enable colors higher resolutions space second hard drive original duo dock replaced duo dock ii added aaui networking compatibility newer color-screen powerbook duos replacement lid offered allow use thicker color duos original duo dock dock ii followed duo dock plus identical duo dock ii lacked fpu level 2 cache\u2014which compatible 68lc040-processor duo 280 powerpc-processor duo 2300c laptop lcd display obviously could opened inside dock additional nubus video cards could installed drive three monitors mini dock port expander powerbook duo popularly offered many third-party manufacturers apple attached powerbook duo could plugged various standard desktop devices including scsi apple desktop bus adb serial floppy disk external speakers external display type dock also allowed duo internal lcd battery used third-party contributions mini dock added variety specialized custom options including ethernet connectivity ntsc pal video ports significant difference docks full desktop configuration lack custom pds nubus expansion slots included standard desktop macs shortfall made task-specific third-party dock offerings type dock manufactured apple many third parties gave powerbook duo three extra ports minimal configuration examples include floppy scsi video ethernet docks typically included one adb port well least expensive basic docks type dock allowed duo internal lcd used well could run duo internal battery reduced amount time popular due minimal impact accessories must carried duo offered practical alternative emergency hard disk software situations task-specific needs 2300 last apple product carry vestige snow white design language apple phasing since 1990 drawing heavily upon improvements made original powerbook 140 design duo series continues many styling traits powerbook 100 approximately equivalent size weight addition snow white features duo takes 100 radius curves step along display top front sides also heavily mirrored various docks penlite early tablet computer prototyped apple computer 1993 around time apple newton pda rather complete computer project canceled 1994 due similarity newton penlite based powerbook duo meant tablet-style addition stylus input device designed compatible powerbook duo docks accessories ran standard classic mac os one stylish iconic laptops available time duo widely used advertising film television", + "neighbors": [ + 71, + 99, + 130, + 214, + 228, + 269, + 270, + 511, + 607, + 610, + 738, + 917, + 927, + 956, + 972, + 1178, + 1215, + 1237, + 1262, + 1294, + 1305, + 1488, + 1544, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 1274, + "label": 7, + "text": "MOSIX:mosix mosix proprietary distributed operating system although early versions based older unix systems since 1999 focuses linux clusters grids mosix cluster/grid need modify link applications library copy files login remote nodes even assign processes different nodes \u2013 done automatically like smp mosix researched developed since 1977 hebrew university jerusalem research team prof. amnon barak far ten major versions developed first version called mos multicomputer os 1981\u201383 based bell lab seventh edition unix ran cluster pdp-11 computers later versions based unix system v release 2 1987\u201389 ran cluster vax ns32332-based computers followed bsd/os-derived version 1991\u201393 cluster 486/pentium computers since 1999 mosix tuned linux x86 platforms second version mosix called mosix2 compatible linux-2.6 3.0 kernels mosix2 implemented os virtualization layer provides users applications single system image linux run-time environment allows applications run remote nodes run locally users run regular sequential parallel applications mosix transparently automatically seek resources migrate processes among nodes improve overall performance mosix2 manage cluster multicluster grid well workstations shared resources flexible management grid allows owners clusters share computational resources still preserving autonomy clusters ability disconnect nodes grid time without disrupting already running programs mosix grid extend indefinitely long trust cluster owners must include guarantees guest applications modified running remote clusters hostile computers connected local network nowadays requirements standard within clusters organizational grids mosix2 run native mode virtual machine vm native mode performance better requires modifications base linux kernel whereas vm run top unmodified operating system supports virtualization including microsoft windows linux mac os x. mosix2 suitable running compute intensive applications low moderate amount input/output i/o tests mosix2 show performance several applications 1 gbit/s campus grid nearly identical single cluster mosix suitable running hpc applications low moderate amount i/o tests mosix show performance several applications 1 gbit/s campus grid nearly identical single cluster particularly suitable examples mosix4 released july 2014 version 4 mosix n't require kernel patching mosix became proprietary software late 2001 moshe bar forked last free version started openmosix project february 10 2002 july 15 2007 bar decided end openmosix project effective march 1 2008 claiming increasing power availability low cost multi-core processors rapidly making single-system image ssi clustering less factor computing plans reconfirmed march 2008 linuxpmi project continuing development former openmosix code", + "neighbors": [ + 13, + 85, + 134, + 340, + 847, + 961, + 1138, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1275, + "label": 4, + "text": "Common_Criteria:common criteria common criteria information technology security evaluation referred common criteria cc international standard iso/iec 15408 computer security certification currently version 3.1 revision 5 common criteria framework computer system users specify security functional assurance requirements sfrs sars respectively security target st may taken protection profiles pps vendors implement make claims security attributes products testing laboratories evaluate products determine actually meet claims words common criteria provides assurance process specification implementation evaluation computer security product conducted rigorous standard repeatable manner level commensurate target environment use common criteria evaluations performed computer security products systems evaluation process also tries establish level confidence may placed product security features quality assurance processes far pps evaluated sts/certified products components e.g. firewalls operating systems smart cards common criteria certification sometimes specified procurement standards containing e.g. interoperation system management user training supplement cc product standards examples include iso/iec 17799 properly bs 7799-1 iso/iec 27002 german details cryptographic implementation within toe outside scope cc instead national standards like fips 140-2 give specifications cryptographic modules various standards specify cryptographic algorithms use recently pp authors including cryptographic requirements cc evaluations would typically covered fips 140-2 evaluations broadening bounds cc scheme-specific interpretations national evaluation schemes phasing eal-based evaluations accept products evaluation claim strict conformance approved pp united states currently allows pp-based evaluations canada process phasing eal-based evaluations cc originated three standards cc produced unifying pre-existing standards predominantly companies selling computer products government market mainly defence intelligence use would need evaluated one set standards cc developed governments canada france germany netherlands uk u.s. testing laboratories must comply iso/iec 17025 certification bodies normally approved iso/iec 17065 compliance iso/iec 17025 typically demonstrated national approval authority characteristics organizations examined presented iccc 10 well common criteria standard also sub-treaty level common criteria mra mutual recognition arrangement whereby party thereto recognizes evaluations common criteria standard done parties originally signed 1998 canada france germany united kingdom united states australia new zealand joined 1999 followed finland greece israel italy netherlands norway spain 2000 arrangement since renamed common criteria recognition arrangement ccra membership continues expand within ccra evaluations eal 2 mutually recognized including augmentation flaw remediation european countries within former itsec agreement typically recognize higher eals well evaluations eal5 tend involve security requirements host nation government september 2012 majority members ccra produced vision statement whereby mutual recognition cc evaluated products lowered eal 2 including augmentation flaw remediation vision indicates move away assurance levels altogether evaluations confined conformance protection profiles stated assurance level achieved technical working groups developing worldwide pps yet transition period fully determined july 2 2014 new ccra ratified per goals outlined within 2012 vision statement major changes arrangement include common criteria generic directly provide list product security requirements features specific classes products follows approach taken itsec source debate used prescriptive approach earlier standards tcsec fips 140-2 common criteria certification guarantee security ensure claims security attributes evaluated product independently verified words products evaluated common criteria standard exhibit clear chain evidence process specification implementation evaluation conducted rigorous standard manner various microsoft windows versions including windows server 2003 windows xp certified security patches address security vulnerabilities still getting published microsoft windows systems possible process obtaining common criteria certification allows vendor restrict analysis certain security features make certain assumptions operating environment strength threats faced product environment additionally cc recognizes need limit scope evaluation order provide cost-effective useful security certifications evaluated products examined level detail specified assurance level pp evaluations activities therefore performed certain depth use time resources offer reasonable assurance intended environment microsoft case assumptions include a.peer systems toe communicates assumed management control operate security policy constraints toe applicable networked distributed environments entire network operates constraints resides within single management domain security requirements address need trust external systems communications links systems assumption contained controlled access protection profile capp products adhere based assumptions may realistic common use general-purpose operating systems claimed security functions windows products evaluated thus considered secure assumed specified circumstances also known evaluated configuration whether run microsoft windows precise evaluated configuration apply microsoft security patches vulnerabilities windows continue appear security vulnerabilities exploitable product evaluated configuration product common criteria certification voluntarily withdrawn vendor alternatively vendor re-evaluate product include application patches fix security vulnerabilities within evaluated configuration failure vendor take either steps would result involuntary withdrawal product certification certification body country product evaluated certified microsoft windows versions remain eal4+ without including application microsoft security vulnerability patches evaluated configuration shows limitation strength evaluated configuration august 2007 government computing news gcn columnist william jackson critically examined common criteria methodology us implementation common criteria evaluation validation scheme ccevs column executives security industry researchers representatives national information assurance partnership niap interviewed objections outlined article include 2006 research paper computer specialist david a. wheeler suggested common criteria process discriminates free open-source software foss -centric organizations development models common criteria assurance requirements tend inspired traditional waterfall software development methodology contrast much foss software produced using modern agile paradigms although argued paradigms align well others attempted reconcile paradigms political scientist jan kallberg raised concerns lack control actual production products certified absence permanently staffed organizational body monitors compliance idea trust common criteria it-security certifications maintained across geopolitical boundaries throughout lifetime cc universally adopted even creator nations particular cryptographic approvals handled separately canadian us implementation fips-140 cesg assisted products scheme caps uk uk also produced number alternative schemes timescales costs overheads mutual recognition found impeding operation market early 2011 nsa/css published paper chris salter proposed protection profile oriented approach towards evaluation approach communities interest form around technology types turn develop protection profiles define evaluation methodology technology type objective robust evaluation concern may negative impact mutual recognition sept 2012 common criteria published vision statement implementing large extent chris salter thoughts previous year key elements vision included", + "neighbors": [ + 249, + 306, + 373, + 379, + 429, + 430, + 595, + 762, + 898, + 1138, + 1221, + 1232, + 1264, + 1311, + 1361, + 1578 + ], + "mask": "Test" + }, + { + "node_id": 1276, + "label": 2, + "text": "Remix_OS:remix os remix os now-discontinued computer operating system personal computers x86 arm architectures prior discontinuation development shipped number 1st- 3rd-party devices remix os allowed pc users run android mobile apps compatible intel-based pc january 2016 jide announced beta version operating system called remix os pc based android-x86 \u2014 x86-port android operating system \u2014 available download free website beta version remix os pc brings hard drive installation 32-bit support uefi support ota updates except free software licensed parts available github unlike android-x86 source code remix os available public google mobile services gms removed remix mini remix os update 3.0.207 jide claimed ensure consistent experience across android devices later comments suggest compatibility issue apps resulted google requesting gms pre-loaded july 17 2017 jide announced development remix os pc well related consumer products development discontinued stating company would restructuring approach remix os transitioning away consumer space april 2019 os succeeded continued numerous forks intending continue improve project prominently phoenixos primeos three versions remix os remix os pc remix os remix ultratablet remix os remix mini remix os pc remix ultratablet remix mini remix os 3.0 device remix pro 2-in-1 tablet announced 2016 however longer made due popularity affordability os asia numerous forks/clones project made various firms notably phoenixos chinese-based chaozhuo technology primeos indian-based floydwiz technologies private limited like remixos pre-dominantly closed source lot improved features intended improve optimise os newer applications pc projects like openthos blissos intend release project open source mind openthos restricted chinese markets moment blissos based slightly modified version android", + "neighbors": [ + 24, + 41, + 85, + 113, + 131, + 134, + 298, + 301, + 306, + 322, + 351, + 357, + 393, + 404, + 422, + 431, + 502, + 695, + 716, + 754, + 775, + 837, + 897, + 974, + 1046, + 1049, + 1055, + 1061, + 1082, + 1126, + 1138, + 1167, + 1183, + 1185, + 1286, + 1310, + 1369, + 1411, + 1419, + 1458, + 1480, + 1483, + 1500, + 1539, + 1569, + 1582, + 1601, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1277, + "label": 9, + "text": "Mocl:mocl mocl programming language dialect implementation language lisp named common lisp focused mobile device platforms includes compiler runtime system currently runs ios android macos mocl first announced november 14 2012 first release timed occur lisp universal time 3581000000 june 23 2013 recent release mocl named paren mage released may 6 2014 adding support macos application creation remote read\u2013eval\u2013print loop repl runs mobile device", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 503, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1278, + "label": 2, + "text": "Comparison_of_open-source_wireless_drivers:comparison open-source wireless drivers wireless network cards computers require control software make function firmware device drivers list status open-source drivers 802.11 wireless network cards following incomplete list supported wireless devices", + "neighbors": [ + 38, + 42, + 58, + 117, + 134, + 189, + 219, + 265, + 290, + 294, + 299, + 305, + 400, + 401, + 571, + 630, + 650, + 682, + 688, + 720, + 736, + 805, + 806, + 812, + 897, + 899, + 935, + 948, + 965, + 974, + 986, + 992, + 1057, + 1060, + 1105, + 1126, + 1167, + 1176, + 1197, + 1208, + 1225, + 1227, + 1235, + 1241, + 1252, + 1257, + 1301, + 1311, + 1318, + 1322, + 1357, + 1360, + 1366, + 1391, + 1401, + 1451, + 1456, + 1468, + 1509, + 1526, + 1538, + 1558, + 1602, + 1604, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1279, + "label": 4, + "text": "Kismet_(software):kismet software kismet network detector packet sniffer intrusion detection system 802.11 wireless lans kismet work wireless card supports raw monitoring mode sniff 802.11a 802.11b 802.11g 802.11n traffic program runs linux freebsd netbsd openbsd mac os x client also run microsoft windows although aside external drones see one supported wireless hardware available packet source distributed gnu general public license kismet free software kismet differs wireless network detectors working passively namely without sending loggable packets able detect presence wireless access points wireless clients associate also widely used date open source wireless monitoring tool kismet also includes basic wireless ids features detecting active wireless sniffing programs including netstumbler well number wireless network attacks kismet features ability log sniffed packets save tcpdump/wireshark airsnort compatible file format kismet also capture per-packet information headers kismet also features ability detect default configured networks probe requests determine level wireless encryption used given access point order find many networks possible kismet supports channel hopping means constantly changes channel channel non-sequentially user-defined sequence default value leaves big holes channels example 1-6-11-2-7-12-3-8-13-4-9-14-5-10 advantage method capture packets adjacent channels overlap kismet also supports logging geographical coordinates network input gps receiver additionally available kismet three separate parts drone used collect packets pass server interpretation server either used conjunction drone interpreting packet data extrapolating wireless information organizing client communicates server displays information server collects updating kismet -ng kismet supports wide variety scanning plugins including dect bluetooth others kismet used number commercial open source projects distributed kali linux used wireless reconnaissance used packages inexpensive wireless intrusion detection system used number peer reviewed studies detecting rogue access points using kismet", + "neighbors": [ + 134, + 138, + 160, + 299, + 364, + 405, + 739, + 796, + 961, + 1138, + 1279, + 1337, + 1527 + ], + "mask": "Test" + }, + { + "node_id": 1280, + "label": 9, + "text": "Cascading_Style_Sheets:cascading style sheets cascading style sheets css style sheet language used describing presentation document written markup language like html css cornerstone technology world wide web alongside html javascript css designed enable separation presentation content including layout colors fonts separation improve content accessibility provide flexibility control specification presentation characteristics enable multiple web pages share formatting specifying relevant css separate .css file reduce complexity repetition structural content separation formatting content also makes feasible present markup page different styles different rendering methods on-screen print voice via speech-based browser screen reader braille-based tactile devices css also rules alternate formatting content accessed mobile device name cascading comes specified priority scheme determine style rule applies one rule matches particular element cascading priority scheme predictable css specifications maintained world wide web consortium w3c internet media type mime type codice_1 registered use css rfc 2318 march 1998 w3c operates free css validation service css documents addition html markup languages support use css including xhtml plain xml svg xul css simple syntax uses number english keywords specify names various style properties style sheet consists list rules rule rule-set consists one selectors declaration block css selectors declare part markup style applies matching tags attributes markup selectors may apply following classes ids case-sensitive start letters include alphanumeric characters hyphens underscores class may apply number instances elements id may applied single element pseudo-classes used css selectors permit formatting based information contained document tree one example widely used pseudo-class identifies content user points visible element usually holding mouse cursor appended selector pseudo-class classifies document elements whereas pseudo-element makes selection may consist partial elements selectors may combined many ways achieve great specificity flexibility multiple selectors may joined spaced list specify elements location element type id class combination thereof order selectors important example applies elements class myclass inside div elements whereas applies div elements elements class myclass following table provides summary selector syntax indicating usage version css introduced declaration block consists list declarations braces declaration consists property colon codice_2 value multiple declarations block semi-colon codice_3 must inserted separate declaration properties specified css standard property set possible values properties affect type element others apply particular groups elements values may keywords center inherit numerical values 200 pixels 50 percent viewport width 80 percent parent element width color values specified keywords e.g hexadecimal values e.g also abbreviated rgb values 0 255 scale e.g codice_4 rgba values specify color alpha transparency e.g hsl hsla values e.g non-zero numeric values representing linear measures must include length unit either alphabetic code abbreviation codice_5 codice_6 percentage sign codice_7 units \u2013 codice_8 centimetre codice_9 inch codice_10 millimetre codice_11 pica codice_12 point \u2013 absolute means rendered dimension depend upon structure page others \u2013 codice_13 em codice_14 ex codice_15 pixel \u2013 relative means factors font size parent element affect rendered measurement eight units feature css 1 retained subsequent revisions proposed css values units module level 3 adopted w3c recommendation provide seven length units codice_16 codice_17 codice_18 codice_19 codice_20 codice_21 codice_22 css nearly presentational attributes html documents contained within html markup font colors background styles element alignments borders sizes explicitly described often repeatedly within html css lets authors move much information another file style sheet resulting considerably simpler html example headings codice_23 elements sub-headings codice_24 sub-sub-headings codice_25 etc. defined structurally using html print screen choice font size color emphasis elements presentational css document authors wanted assign typographic characteristics say codice_24 headings repeat html presentational markup occurrence heading type made documents complex larger error-prone difficult maintain css allows separation presentation structure css define color font text alignment size borders spacing layout many typographic characteristics independently on-screen printed views css also defines non-visual styles reading speed emphasis aural text readers w3c deprecated use presentational html markup example pre-css html heading element defined red text would written using css element coded using style properties instead html presentational attributes advantages may immediately clear since second form actually verbose power css becomes apparent style properties placed internal style element even better external css file example suppose document contains style element codice_23 elements document automatically become red without requiring explicit code author later wanted make codice_23 elements blue instead could done changing style element rather laboriously going document changing color individual codice_23 element styles also placed external css file described loaded using syntax similar decouples styling html document makes possible restyle multiple documents simply editing shared external css file css information provided various sources sources web browser user author information author classified inline media type importance selector specificity rule order inheritance property definition css style information separate document embedded html document multiple style sheets imported different styles applied depending output device used example screen version quite different printed version authors tailor presentation appropriately medium style sheet highest priority controls content display declarations set highest priority source passed source lower priority user agent style process called cascading one goals css allow users greater control presentation someone finds red italic headings difficult read may apply different style sheet depending browser web site user may choose various style sheets provided designers may remove added styles view site using browser default styling may override red italic heading style without altering attributes specificity refers relative weights various rules determines styles apply element one rule could apply based specification simple selector e.g h1 specificity 1 class selectors specificity 1,0 id selectors specificity 1,0,0 specificity values carry decimal system commas used separate digits css rule 11 elements 11 classes would specificity 11,11 121 thus following rules selectors result indicated specificity consider html fragment example declaration codice_30 attribute overrides one codice_31 element higher specificity thus paragraph appears green inheritance key feature css relies ancestor-descendant relationship operate inheritance mechanism properties applied specified element also descendants inheritance relies document tree hierarchy xhtml elements page based nesting descendant elements may inherit css property values ancestor element enclosing general descendant elements inherit text-related properties box-related properties inherited properties inherited color font letter-spacing line-height list-style text-align text-indent text-transform visibility white-space word-spacing properties inherited background border display float clear height width margin min- max-height -width outline overflow padding position text-decoration vertical-align z-index inheritance used avoid declaring certain properties style sheet allowing shorter css inheritance css inheritance class-based programming languages possible define class b like class modifications css possible style element class modifications however possible define css class b like could used style multiple elements without repeat modifications given following style sheet suppose h1 element emphasizing element em inside color assigned em element emphasized word illustrate inherits color parent element h1 style sheet h1 color pink hence em element likewise pink whitespace properties selectors ignored code snippet functionally equivalent one one common way format css readability indent property give line addition formatting css readability shorthand properties used write code faster also gets processed quickly rendered css 2.1 defines three positioning schemes four possible values position property item positioned way static properties top bottom left right used specify offsets positions codice_32 property may one three values absolutely positioned fixed items floated elements normally flow around floated items unless prevented codice_33 property css first proposed h\u00e5kon wium lie october 10 1994 time lie working tim berners-lee cern several style sheet languages web proposed around time discussions public mailing lists inside world wide web consortium resulted first w3c css recommendation css1 released 1996 particular proposal bert bos influential became co-author css1 regarded co-creator css style sheets existed one form another since beginnings standard generalized markup language sgml 1980s css developed provide style sheets web one requirement web style sheet language style sheets come different sources web therefore existing style sheet languages like dsssl fosi suitable css hand let document style influenced multiple style sheets way cascading styles html grew came encompass wider variety stylistic capabilities meet demands web developers evolution gave designer control site appearance cost complex html variations web browser implementations violawww worldwideweb made consistent site appearance difficult users less control web content displayed browser/editor developed tim berners-lee style sheets hard-coded program style sheets could therefore linked documents web robert cailliau also cern wanted separate structure presentation different style sheets could describe different presentation printing screen-based presentations editors improving web presentation capabilities topic interest many web community nine different style sheet languages proposed www-style mailing list nine proposals two especially influential became css cascading html style sheets stream-based style sheet proposal ssp two browsers served testbeds initial proposals lie worked yves lafon implement css dave raggett arena browser bert bos implemented ssp proposal argo browser thereafter lie bos worked together develop css standard h removed name style sheets could also applied markup languages besides html lie proposal presented mosaic web conference later called www2 chicago illinois 1994 bert bos 1995 around time w3c already established took interest development css organized workshop toward end chaired steven pemberton resulted w3c adding work css deliverables html editorial review board erb lie bos primary technical staff aspect project additional members including thomas reardon microsoft participating well august 1996 netscape communication corporation presented alternative style sheet language called javascript style sheets jsss spec never finished deprecated end 1996 css ready become official css level 1 recommendation published december development html css dom taking place one group html editorial review board erb early 1997 erb split three working groups html working group chaired dan connolly w3c dom working group chaired lauren wood softquad css working group chaired chris lilley w3c css working group began tackling issues addressed css level 1 resulting creation css level 2 november 4 1997 published w3c recommendation may 12 1998 css level 3 started 1998 still development 2014 2005 css working groups decided enforce requirements standards strictly meant already published standards like css 2.1 css 3 selectors css 3 text pulled back candidate recommendation working draft level css 1 specification completed 1996 microsoft internet explorer 3 released year featuring limited support css ie 4 netscape 4.x added support typically incomplete many bugs prevented css usefully adopted three years web browser achieved near-full implementation specification internet explorer 5.0 macintosh shipped march 2000 first browser full better 99 percent css 1 support surpassing opera leader since introduction css support fifteen months earlier browsers followed soon afterwards many additionally implemented parts css 2 however even later 'version 5 web browsers began offer fairly full implementation css still incorrect certain areas fraught inconsistencies bugs quirks microsoft internet explorer 5.x windows opposed different ie macintosh flawed implementation 'css box model compared css standards inconsistencies variation feature support made difficult designers achieve consistent appearance across browsers platforms without use workarounds termed css hacks filters ie/windows box model bugs serious internet explorer 6 released microsoft introduced backwards-compatible mode css interpretation 'quirks mode alongside alternative corrected 'standards mode non-microsoft browsers also provided 'mode'-switch behavior capability therefore became necessary authors html files ensure contained special distinctive 'standards-compliant css intended marker show authors intended css interpreted correctly compliance standards opposed intended long-obsolete ie5/windows browser without marker web browsers 'quirks mode'-switching capability size objects web pages ie5/windows would rather following css standards problems patchy adoption css along errata original specification led w3c revise css 2 standard css 2.1 moved nearer working snapshot current css support html browsers css 2 properties browser successfully implemented dropped cases defined behaviors changed bring standard line predominant existing implementations css 2.1 became candidate recommendation february 25 2004 css 2.1 pulled back working draft status june 13 2005 returned candidate recommendation status july 19 2007 addition problems codice_34 extension used software product used convert powerpoint files compact slide show files web servers served codice_34 mime type codice_36 rather codice_1 css various levels profiles level css builds upon last typically adding new features typically denoted css 1 css 2 css 3 css 4 profiles typically subset one levels css built particular device user interface currently profiles mobile devices printers television sets profiles confused media types added css 2 first css specification become official w3c recommendation css level 1 published december 17 1996 h\u00e5kon wium lie bert bos credited original developers among capabilities support w3c longer maintains css 1 recommendation css level 2 specification developed w3c published recommendation may 1998 superset css 1 css 2 includes number new capabilities like absolute relative fixed positioning elements z-index concept media types support aural style sheets later replaced css 3 speech modules bidirectional text new font properties shadows w3c longer maintains css 2 recommendation css level 2 revision 1 often referred css 2.1 fixes errors css 2 removes poorly supported fully interoperable features adds already implemented browser extensions specification comply w3c process standardizing technical specifications css 2.1 went back forth working draft status candidate recommendation status many years css 2.1 first became candidate recommendation february 25 2004 reverted working draft june 13 2005 review returned candidate recommendation 19 july 2007 updated twice 2009 however changes clarifications made went back last call working draft 7 december 2010 css 2.1 went proposed recommendation 12 april 2011 reviewed w3c advisory committee finally published w3c recommendation 7 june 2011 css 2.1 planned first final revision level 2\u2014but low priority work css 2.2 began 2015 unlike css 2 large single specification defining various features css 3 divided several separate documents called modules module adds new capabilities extends features defined css 2 preserving backward compatibility work css level 3 started around time publication original css 2 recommendation earliest css 3 drafts published june 1999 due modularization different modules different stability statuses modules candidate recommendation cr status considered moderately stable cr stage implementations advised drop vendor prefixes single integrated css4 specification split separate level 4 modules css3 split css language definition modules modules allowed level independently modules level 3\u2014they build things css 2.1 level-4 modules exist image values backgrounds borders selectors build functionality preceding level-3 module modules defining entirely new functionality flexbox designated level 1 css working group sometimes publishes snapshots collection whole modules parts drafts considered stable interoperably implemented hence ready use far five best current practices documents published notes 2007 2010 2015 2017 2018 web browser uses layout engine render web pages support css functionality consistent browsers parse css perfectly multiple coding techniques developed target specific browsers workarounds commonly known css hacks css filters adoption new functionality css hindered lack support major browsers example internet explorer slow add support many css 3 features slowed adoption features damaged browser reputation among developers order ensure consistent experience users web developers often test sites across multiple operating systems browsers browser versions increasing development time complexity tools browserstack built reduce complexity maintaining environments addition testing tools many sites maintain lists browser support specific css properties including caniuse mozilla developer network additionally css 3 defines feature queries provide codice_38 directive allow developers target browsers support certain functionality directly within css css supported older browsers also sometimes patched using javascript polyfills pieces javascript code designed make browsers behave consistently workarounds\u2014and need support fallback functionality\u2014can add complexity development projects consequently companies frequently define list browser versions support websites adopt newer code standards incompatible older browsers browsers cut accessing many resources web sometimes intentionally many popular sites internet visually degraded older browsers due poor css support work large part due evolution javascript web technologies noted limitations current capabilities css include additionally several issues present prior versions css standard alleviated css frameworks pre-prepared libraries meant allow easier standards-compliant styling web pages using cascading style sheets language css frameworks include foundation blueprint bootstrap cascade framework materialize like programming scripting language libraries css frameworks usually incorporated external .css sheets referenced html provide number ready-made options designing laying web page although many frameworks published authors use mostly rapid prototyping learning prefer 'handcraft css appropriate published site without design maintenance download overhead many unused features site styling size css resources used project increases development team often needs decide common design methodology keep organized goals ease development ease collaboration development performance deployed stylesheets browser popular methodologies include oocss object oriented css acss atomic css ocss organic cascade style sheet smacss scalable modular architecture css bem block element modifier", + "neighbors": [ + 14, + 16, + 31, + 50, + 69, + 81, + 83, + 95, + 107, + 176, + 258, + 277, + 384, + 412, + 427, + 509, + 527, + 530, + 531, + 582, + 593, + 623, + 668, + 680, + 684, + 713, + 780, + 796, + 833, + 862, + 872, + 886, + 939, + 953, + 959, + 1033, + 1058, + 1084, + 1132, + 1166, + 1168, + 1195, + 1210, + 1228, + 1280, + 1331, + 1373, + 1376, + 1378, + 1408, + 1423, + 1465, + 1470, + 1528, + 1550, + 1569, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1281, + "label": 3, + "text": "Robowarrior:robowarrior robowarrior known japan english language action/puzzle video game developed hudson soft co-developed aicom making first nes game worked published jaleco nintendo entertainment system msx robowarrior takes place alien planet called altile created scientists solution overpopulation problem earth peaceful period altitle robowarriors decommissioned earth xantho empire invades altitle try transform personal gain player operates cyborg named zed z-type earth defence game zed raids altile fight xantho empire destroy leader xur zed deploys bombs clear path rocks walls forests killing enemies collecting items gameplay elements resemble bomberman 1983 robowarrior comprises five level formats 27 levels game one player must obtain key time limit expires another key unavailable player acquires crystal chalice levels cast darkness rendering obstructions invisible unless player lit lamp still levels mazes player must find blast-through weak points walls proceed periodically player engages boss level multiple bombs required bomb certain unconventional areas robowarrior also features water stages enemies respawn stage allowing player stock bombs zed controlled via overhead viewpoint player move four directions like hudson soft games hudson bee game lot stage work robowarrior features 4 11 horizontal hudson bees 1991 sunsoft published sequel bomber king game boy titled bomber king scenario 2", + "neighbors": [ + 1412 + ], + "mask": "Test" + }, + { + "node_id": 1282, + "label": 1, + "text": "FloraNT:florant florant public access web-based database flora northern territory provides authoritative scientific information 4300 native taxa including descriptions maps images conservation status nomenclatural details together names used various aboriginal groups alien taxa 470 species also recorded users access fact sheets species details specimens held northern territory herbarium herbaria codes nt dna together keys regional factsheets distribution guides florant uses ibra version 5.1 botanical regions conservation act nt flora fauna territory parks wildlife conservation act 1976 twpca uses iucn criteria categories", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1283, + "label": 6, + "text": "Cramfs:cramfs compressed rom file system cramfs free gpl'ed read-only linux file system designed simplicity space-efficiency mainly used embedded small-footprint systems unlike compressed image conventional file system cramfs image used i.e without first decompressing reason linux distributions use cramfs initrd images debian 3.1 particular installation images suse linux particular constraints memory image size 2013 linux maintainers indicated cramfs made obsolete squashfs file system got rehabilitated 2017 use low-memory devices using squashfs may viable files cramfs file systems zlib-compressed one page time allow random read access metadata compressed expressed terse representation space-efficient conventional file systems file system intentionally read-only simplify design random write access compressed files difficult implement cramfs ships utility codice_1 pack files new cramfs images file sizes limited less 16mb maximum file system size little 272mb last file file system must begin 256mb block extend past", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1241, + 1252, + 1322, + 1381, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1284, + "label": 3, + "text": "PA-RISC:pa-risc pa-risc instruction set architecture isa developed hewlett-packard name implies reduced instruction set computer risc architecture pa stands precision architecture design also referred hp/pa hewlett packard precision architecture architecture introduced 26 february 1986 hp 3000 series 930 hp 9000 model 840 computers launched featuring first implementation ts1 pa-risc succeeded itanium originally ia-64 isa jointly developed hp intel hp stopped selling pa-risc-based hp 9000 systems end 2008 supported servers running pa-risc chips 2013 late 1980s hp building four series computers based cisc cpus one line ibm pc compatible intel i286-based vectra series started 1986 others non-intel systems one hp series 300 motorola 68000-based workstations another series 200 line technical workstations based custom silicon sapphire sos chip design sos based 16-bit hp 3000 classic series finally hp 9000 series 500 minicomputers based 16 32-bit focus microprocessor precision architecture result known inside hewlett-packard spectrum program hp planned use spectrum move non-pc compatible machines single risc cpu family first processors introduced 1986 thirty-two 32-bit integer registers sixteen 64-bit floating-point registers number floating-point registers doubled 1.1 version 32 became apparent 16 inadequate restricted performance architects included allen baum hans jeans michael j. mahon ruby bei-loh lee russel kao steve muchnick terrence c. miller david fotland william s. worley first implementation ts1 central processing unit built discrete transistor\u2013transistor logic 74f ttl devices later implementations multi-chip vlsi designs fabricated nmos processes ns1 ns2 cmos cs1 pcx first used new series hp 3000 machines late 1980s \u2013 930 950 commonly known time spectrum systems name given development labs machines ran mpe-xl hp 9000 machines soon upgraded pa-risc processor well running hp-ux version unix operating systems ported pa-risc architecture include linux openbsd netbsd nextstep interesting aspect pa-risc line generations level 2 cache instead large level 1 caches used formerly separate chips connected bus integrated on-chip pa-7100lc pa-7300lc l2 caches another innovation pa-risc addition vectorized instructions simd form max first introduced pa-7100lc precision risc organization industry group led hp founded 1992 promote pa-risc architecture members included convex hitachi hughes aircraft mitsubishi nec oki prime stratus yokogawa red brick software allegro consultants inc.. isa extended 1996 64 bits revision named pa-risc 2.0 pa-risc 2.0 also added fused multiply\u2013add instructions help certain floating-point intensive algorithms max-2 simd extension provides instructions accelerating multimedia applications first pa-risc 2.0 implementation pa-8000 introduced january 1996", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 123, + 127, + 134, + 137, + 160, + 193, + 195, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 571, + 589, + 643, + 659, + 719, + 752, + 755, + 776, + 803, + 821, + 830, + 846, + 868, + 893, + 907, + 925, + 937, + 946, + 979, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1052, + 1072, + 1081, + 1100, + 1111, + 1113, + 1125, + 1143, + 1158, + 1160, + 1161, + 1174, + 1196, + 1219, + 1224, + 1256, + 1272, + 1290, + 1351, + 1398, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1538, + 1557, + 1578, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1285, + "label": 3, + "text": "Paul_Horn_(computer_scientist):paul horn computer scientist paul m. horn born august 16 1946 american computer scientist solid state physicist made contributions pervasive computing pioneered use copper self-assembly chip manufacturing helped manage development deep computing important tool provides business decision makers ability analyze develop solutions complex difficult problems horn born august 16 1946 graduated clarkson college 1968 bachelor science degree obtained phd university rochester physics 1973 horn various times senior vice president ibm corporation executive director research ibm initiated project develop watson computer competed successfully quiz show jeopardy currently new york university nyu distinguished scientist residence nyu stern executive residence also professor nyu tandon school engineering 2009 appointed senior vice provost research nyu", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1286, + "label": 2, + "text": "NimbleX:nimblex nimblex small slackware-based linux distribution optimized run cd usb drive network environment nimblex praised fast boots well small disk footprint considered surprising distribution using kde desktop environment nimblex also remarked web site allows users generate custom bootable images using web browser also covered mainstream romanian press first linux distribution put together romanian nimblex reported boot fast important factor user experience running optical media usb drives review 2007 nimblex edition noted expect boot less half time live cd fedora ubuntu knoppix takes recent review 2008 edition also noted nimblex speed easily one fastest bootups 've seen even tried hinder cripple boot time even dog slow pendrive old dirt test machine still booted amazingly fast desktop applications also fast nimblex also compact distribution review 2007 edition wondered managed include kde mention applications included size 200 mb window-based graphical user interface slimmed kde fit firefox web browser office documents editor koffice pdf reader media player play almost file formats without need install codec photo editing software gimp anti-virus bluetooth support integrated name applications included 2008 installation process major linux distributions customized creating custom installation disks usually called spins creating spin requires certain amount expertise creating spin run installation media requires customization nimblex makes process user-friendly providing web interface process similar embedded linux distributions e.g freewrt features made distribution popular early judge forums nimblex attracted surprisingly large number users relatively unknown distribution nimblex uses 2.6 kernel default gui kde slower computers default desktop environment exchanged one lower resource usage like fluxbox xfce typical office web browsing messaging components included nimblex hardly offers graphical administration tools \u2014 administration tasks like adding new user performed command line tradeoff allows nimblex small installation footprint \u2014 typical installation 400 megabytes additional applications installed using graphical installer gslapt codice_1 command line brings automatic resolution dependencies slackware packages text-mode hard driver installer available codice_2 considered beta quality 2008 edition 2008 edition comes three standard install images 200mb two smaller even ones 100 69mb installers allow customizations packets installation however nimblex 2008 uses kde 3.5.9 nimblex 2010 beta version also present site based kde 4 support new hardware user also enable compiz fusion via link desktop openoffice.org included instead koffice provided office suite nimblex included 200 mb package useful applications like firefox web browser koffice pdf reader kopete instant messenger klamav anti-virus gimp photo editor bluetooth support remote connection pc important software supported bigger nimblex package openoffice.org java python samba wine windows applications emulator many applications compiled community included distribution nimblex 2008 criticized irresponsible lacking common security features box even though clamav anti-virus guarddog firewall installed default non-root user account created installation root password required log desktop default root password displayed nimblex web site nimblex 2010 also fixed applications removed another problem nimblex packages created repackaging slackware packages since nimblex installs fewer libraries sometimes results uninstallable unusable packages reviews", + "neighbors": [ + 113, + 134, + 301, + 334, + 351, + 357, + 393, + 404, + 431, + 695, + 754, + 897, + 974, + 1046, + 1049, + 1055, + 1126, + 1167, + 1225, + 1276, + 1369, + 1458, + 1539, + 1601 + ], + "mask": "Test" + }, + { + "node_id": 1287, + "label": 3, + "text": "Windows_NT:windows nt windows nt family operating systems produced microsoft first version released july 27 1993 processor-independent multiprocessing multi-user operating system first version windows nt windows nt 3.1 produced workstations server computers intended complement consumer versions windows based ms-dos including windows 1.0 windows 3.1x gradually windows nt family expanded microsoft general-purpose operating system product line personal computers deprecating windows 9x family nt formerly expanded new technology longer carries specific meaning starting windows 2000 nt removed product name included product version string nt first purely 32-bit version windows whereas consumer-oriented counterparts windows 3.1x windows 9x 16-bit/32-bit hybrids multi-architecture operating system initially supported several instruction set architectures including ia-32 mips dec alpha support powerpc itanium x64 arm added later latest versions support x86 specifically ia-32 x64 arm major features windows nt family include windows shell windows api native api active directory group policy hardware abstraction layer ntfs bitlocker windows store windows update hyper-v suggested dave cutler intended initialism wnt play vms incrementing letter one however project originally intended follow-on os/2 referred nt os/2 receiving windows brand one original nt developers mark lucovsky states name taken original target processor\u2014the intel i860 code-named n10 n-ten 1998 question-and-answer session bill gates revealed letters previously expanded new technology longer carry specific meaning letters dropped names releases windows 2000 later though microsoft described product built nt technology main design goal nt hardware software portability various versions nt family operating systems released variety processor architectures initially ia-32 mips dec alpha powerpc itanium x86-64 arm supported later releases idea common code base custom hardware abstraction layer hal platform however support mips alpha powerpc later dropped windows 2000 broad software compatibility achieved support several api personalities including windows api posix os/2 apis \u2013 latter two phased starting windows xp partial ms-dos compatibility achieved via integrated dos virtual machine \u2013 although feature phased x86-64 architecture nt supported per-object file function role access control lists allowing rich set security permissions applied systems services nt supported windows network protocols inheriting previous os/2 lan manager networking well tcp/ip networking microsoft would implement tcp/ip stack derived first streams-based stack spider systems later rewritten in-house windows nt 3.1 first version windows use 32-bit flat virtual memory addressing 32-bit processors companion product windows 3.1 used segmented addressing switches 16-bit 32-bit addressing pages windows nt 3.1 featured core kernel providing system api running supervisor mode ring 0 x86 referred windows nt kernel mode platforms set user-space environments apis included new win32 environment os/2 1.3 text-mode environment posix environment full preemptive multitasking kernel could interrupt running tasks schedule tasks without relying user programs voluntarily give control cpu windows 3.1 windows applications although ms-dos applications preemptively multitasked windows starting windows/386 notably windows nt 3.x several i/o driver subsystems video printing user-mode subsystems windows nt 4 video server printer spooler subsystems moved kernel mode windows nt first gui strongly influenced programmatically compatible windows 3.1 windows nt 4 interface redesigned match brand new windows 95 moving program manager windows shell design ntfs journaled secure file system created nt windows nt also allows installable file systems starting versions 3.1 nt could installed fat hpfs file systems windows nt introduced driver model windows nt driver model incompatible older driver frameworks windows 2000 windows nt driver model enhanced become windows driver model first introduced windows 98 based nt driver model windows vista added native support windows driver foundation also available windows xp windows server 2003 extent windows 2000 microsoft decided create portable operating system compatible os/2 posix supporting multiprocessing october 1988 development started november 1989 windows nt known os/2 3.0 third version operating system developed jointly microsoft ibm ensure portability initial development targeted intel i860xr risc processor switching mips r3000 late 1989 intel i386 1990 microsoft also continued parallel development dos-based less resource-demanding windows environment resulting release windows 3.0 may 1990 windows 3 eventually successful microsoft decided change primary application programming interface still unreleased nt os/2 known extended os/2 api extended windows api decision caused tension microsoft ibm collaboration ultimately fell apart ibm continued os/2 development alone microsoft continued work newly renamed windows nt though neither operating system would immediately popular microsoft ms-dos windows products windows nt would eventually far successful os/2 microsoft hired group developers digital equipment corporation led dave cutler build windows nt many elements design reflect earlier dec experience cutler vms rsx-11 also unreleased object-based operating system developed dave cutler dec prism team joined selected members disbanded os/2 team including moshe dunie operating system designed run multiple instruction set architectures multiple hardware platforms within architecture platform dependencies largely hidden rest system kernel mode module called hal hardware abstraction layer windows nt kernel mode code distinguishes kernel whose primary purpose implement processor- architecture-dependent functions executive designed modified microkernel windows nt kernel influenced mach microkernel developed carnegie mellon university meet criteria pure microkernel kernel executive linked together single loaded module ntoskrnl.exe outside module little distinction kernel executive routines directly accessible example kernel-mode device drivers api sets windows nt family implemented subsystems atop publicly undocumented native api allowed late adoption windows api win32 subsystem windows nt one earliest operating systems use unicode internally windows nt 3.1 3.51 incorporated program manager file manager windows 3.1x series windows nt 4.0 onwards replaced programs windows explorer including taskbar start menu originally appeared windows 95 first release given version number 3.1 match contemporary 16-bit windows magazines era claimed number also used make version seem reliable .0 release also novell ipx protocol apparently licensed 3.1 versions windows software nt version number generally used marketing purposes still used internally said reflect degree changes core operating system however application compatibility reasons microsoft kept major version number 6 releases following vista changed later 10 windows 10 build number internal identifier used microsoft developers beta testers windows nt written c c++ small amount written assembly language c mostly used kernel code c++ mostly used user-mode code assembly language avoided possible would impede portability order prevent intel x86-specific code slipping operating system developers used developing x86 chips windows nt 3.1 initially developed using non-x86 development systems ported x86 architecture work initially based intel i860-based dazzle system later mips r4000-based jazz platform systems designed internally microsoft windows nt 3.1 released intel x86 pc compatible pc-98 dec alpha arc-compliant mips platforms windows nt 3.51 added support powerpc processor 1995 specifically prep-compliant systems ibm power series desktops/laptops motorola powerstack series despite meetings michael spindler bill gates power macintosh prep compliant power macintosh project failed ship intergraph corporation ported windows nt clipper architecture later announced intention port windows nt 3.51 sun microsystems sparc architecture neither version sold public retail product two windows nt 4.0 variants ia-32 alpha full set service packs available ports done third parties motorola intergraph etc publicly available updates windows nt 4.0 last major release support alpha mips powerpc though development windows 2000 alpha continued august 1999 compaq stopped support windows nt architecture three days later microsoft also canceled alphant program even though alpha nt 5 windows 2000 release reached rc1 status microsoft announced january 5 2011 next major version windows nt family include support arm architecture microsoft demonstrated preliminary version windows version 6.2.7867 running arm-based computer 2011 consumer electronics show eventually led commercial release windows 8-derived windows rt october 26 2012 implementation nt ce windows phone 8 according microsoft common misconception xbox xbox 360 use modified windows 2000 kernel xbox operating system built scratch implements subset windows apis 64-bit versions windows nt originally intended run itanium dec alpha latter used internally microsoft early development 64-bit windows continued time microsoft publicly announced cancelling plans ship 64-bit windows alpha alpha versions windows nt 32-bit windows 2000 supports intel ia-32 32-bit windows xp server 2003 server 2008 server 2008 r2 one edition dedicated itanium-based systems comparison itanium microsoft adopted x64 greater scale every version windows since windows xp dedicated x64 edition x64 editions minimum hardware specification required run release professional workstation version windows nt fairly slow-moving 6.0 vista release requires minimum 15 gb free disk space 10-fold increase free disk space alone previous version", + "neighbors": [ + 22, + 77, + 78, + 85, + 99, + 107, + 108, + 111, + 127, + 148, + 185, + 210, + 233, + 234, + 262, + 275, + 278, + 306, + 312, + 322, + 323, + 326, + 337, + 363, + 377, + 425, + 433, + 435, + 443, + 445, + 457, + 465, + 564, + 622, + 638, + 647, + 705, + 728, + 752, + 754, + 763, + 776, + 815, + 830, + 868, + 870, + 925, + 940, + 957, + 961, + 1002, + 1011, + 1016, + 1030, + 1056, + 1057, + 1064, + 1090, + 1092, + 1097, + 1098, + 1100, + 1110, + 1138, + 1151, + 1188, + 1193, + 1203, + 1304, + 1321, + 1346, + 1363, + 1366, + 1379, + 1415, + 1421, + 1433, + 1457, + 1494, + 1503, + 1524, + 1542, + 1547, + 1550, + 1555, + 1570, + 1578, + 1587, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1288, + "label": 8, + "text": "Oracle_iPlanet_Web_Server:oracle iplanet web server oracle iplanet web server oiws web server designed medium large business applications oracle iplanet web server builds earlier sun java system web server sun one web server iplanet web server netscape enterprise server products oracle iplanet web server available solaris windows hp-ux aix gnu/linux supports jsp java servlet technologies php nsapi cgi coldfusion netscape enterprise server web server developed originally netscape communications corporation 1996 based 1994 release netsite product renamed sun java system web server reflecting product acquisition sun microsystems oracle acquired sun 2010 oracle iplanet web server january 2009 sun open sourced core components sun java system web server 7.0 bsd license open web server open source version kept sync commercial releases january 2010 7.0 update 8 since oracle acquisition sun open source releases 2010 oracle renamed product sun java system web server oracle iplanet web server although documentation links still process updated reflect", + "neighbors": [ + 83, + 134, + 195, + 204, + 210, + 227, + 266, + 272, + 296, + 306, + 399, + 473, + 638, + 712, + 796, + 959, + 961, + 1006, + 1138, + 1168, + 1235, + 1242, + 1288, + 1318, + 1322, + 1484, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 1289, + "label": 4, + "text": "Backup_software:backup software backup software computer programs used perform backup create supplementary exact copies files databases entire computers programs may later use supplementary copies restore original contents event data loss hence 're useful users several features backup software make effective backing data voluming allows ability compress split backup data separate parts storage smaller removable media cds often used cds easy transport off-site inexpensive compared hard drives servers however recent increase hard drive capacity decrease drive cost made voluming far less popular solution introduction small portable durable usb drives increase broadband capacity provided easier secure methods transporting backup data off-site since hard drive space cost compressing data reduce size allowing less drive space used save money many backup solutions offer plug-in access exclusive use locked files backup solutions generally support differential backups incremental backups addition full backups material newer changed compared backed data actually backed effect increase significantly speed backup process slow networks decreasing space requirements backup schedules usually supported reduce maintenance backup tool increase reliability backups prevent data theft backup software offers cryptography features protect backup prevent loss previously backed data backup backup software e.g areca backup argentum backup offer transaction mechanism commit rollback management critical processes backups merges guarantee backups integrity", + "neighbors": [ + 150, + 448, + 494, + 528, + 904, + 1085, + 1406, + 1600, + 1618, + 1634 + ], + "mask": "Validation" + }, + { + "node_id": 1290, + "label": 3, + "text": "Harvard_architecture:harvard architecture harvard architecture computer architecture physically separate storage signal pathways instructions data term originated harvard mark relay-based computer stored instructions punched tape 24 bits wide data electro-mechanical counters early machines data storage entirely contained within central processing unit provided access instruction storage data programs needed loaded operator processor could initialize today processors implement separate signal pathways performance reasons actually implement modified harvard architecture support tasks like loading program disk storage data executing harvard architecture need make two memories share characteristics particular word width timing implementation technology memory address structure differ systems instructions pre-programmed tasks stored read-only memory data memory generally requires read-write memory systems much instruction memory data memory instruction addresses wider data addresses system pure von neumann architecture instructions data stored memory instructions fetched data path used fetch data means cpu simultaneously read instruction read write data memory computer using harvard architecture cpu read instruction perform data memory access time even without cache harvard architecture computer thus faster given circuit complexity instruction fetches data access contend single memory pathway also harvard architecture machine distinct code data address spaces instruction address zero data address zero instruction address zero might identify twenty-four-bit value data address zero might indicate eight-bit byte part twenty-four-bit value modified harvard architecture machine much like harvard architecture machine relaxes strict separation instruction data still letting cpu concurrently access two memory buses common modification includes separate instruction data caches backed common address space cpu executes cache acts pure harvard machine accessing backing memory acts like von neumann machine code moved around like data powerful technique modification widespread modern processors arm architecture power isa x86 processors sometimes loosely called harvard architecture overlooking fact actually modified another modification provides pathway instruction memory rom flash memory cpu allow words instruction memory treated read-only data technique used microcontrollers including atmel avr allows constant data text strings function tables accessed without first copied data memory preserving scarce power-hungry data memory read/write variables special machine language instructions provided read data instruction memory instruction memory accessed using peripheral interface distinct instructions embed constant data although individual constants two mechanisms substitute recent years speed cpu grown many times comparison access speed main memory care needs taken reduce number times main memory accessed order maintain performance instance every instruction run cpu requires access memory computer gains nothing increased cpu speed\u2014a problem referred memory bound possible make extremely fast memory practical small amounts memory cost power signal routing reasons solution provide small amount fast memory known cpu cache holds recently accessed data long data cpu needs cache performance much higher cpu get data main memory modern high performance cpu chip designs incorporate aspects harvard von neumann architecture particular split cache version modified harvard architecture common cpu cache memory divided instruction cache data cache harvard architecture used cpu accesses cache case cache miss however data retrieved main memory formally divided separate instruction data sections although may well separate memory controllers used concurrent access ram rom flash memory thus von neumann architecture visible contexts data code come memory controller hardware implementation gains efficiencies harvard architecture cache accesses least main memory accesses addition cpus often write buffers let cpus proceed writes non-cached regions von neumann nature memory visible instructions written data cpu software must ensure caches data instruction write buffer synchronized trying execute just-written instructions principal advantage pure harvard architecture\u2014simultaneous access one memory system\u2014has reduced modified harvard processors using modern cpu cache systems relatively pure harvard architecture machines used mostly applications trade-offs like cost power savings omitting caches outweigh programming penalties featuring distinct code data address spaces even cases common employ special instructions order access program memory though data read-only tables reprogramming processors modified harvard architecture processors", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 359, + 388, + 413, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 681, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1044, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1143, + 1174, + 1219, + 1222, + 1231, + 1256, + 1272, + 1284, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1291, + "label": 4, + "text": "Sophos:sophos sophos group plc british security software hardware company sophos develops products communication endpoint encryption network security email security mobile security unified threat management sophos primarily focused providing security software mid market pragmatic enterprise 100- 5,000-seat organizations whilst primary focus sophos also protects home users free antivirus software sophos home intended demonstrate product functionality listed london stock exchange constituent ftse 250 index sophos founded jan hruska peter lammer began producing first antivirus encryption products 1985 late 1980s 1990s sophos primarily developed sold range security technologies uk including encryption tools available users private business late 1990s sophos concentrated efforts development sale antivirus technology embarked program international expansion 2003 sophos acquired activestate north american software company developed anti-spam software time viruses spread primarily email spam allowed sophos produce combined anti-spam antivirus solution 2006 peter gyenes steve munford named chairman ceo sophos respectively jan hruska peter lammer remain members board directors 2010 majority interest sophos sold apax 2010 nick bray formerly group cfo micro focus international named cfo sophos 2011 utimaco safeware ag acquired sophos 2008-9 accused supplying data monitoring tracking software partners sold governments syria sophos issued statement apology confirmed suspended relationship partners question launched investigation 2012 kris hagerman formerly ceo corel corporation named ceo sophos joined company board former ceo steve munford became non-executive chairman board february 2014 sophos announced acquired cyberoam technologies provider network security products june 2015 sophos announced plans raise us100 million london stock exchange september 2003 february 2006 sophos served parent company activestate developer programming tools dynamic programming languages february 2006 activestate became independent company sold vancouver-based venture capitalist firm pender financial 2007 sophos acquired endforce company based ohio united states developed sold security policy compliance network access control nac software july 2008 sophos announced intention acquire utimaco safeware ag july 2009 sophos completed integration utimaco safeware ag may 2010 sophos reached definitive agreement sell majority interest company apax partners global private equity group may 2011 sophos announced entered agreement acquire astaro privately held provider network security solutions headquartered wilmington massachusetts united states karlsruhe germany 2012 sophos acquired remained virusbuster \u2013 hungarian antivirus firm \u2013 company closed april 2012 sophos acquired dialogs privately held provider mobile management solutions headquartered germany february 2014 sophos announced acquired cyberoam technologies leading global provider network security products october 2014 sophos acquired mojave networks leading cloud-based security startup december 14 2015 sophos acquired surfright small dutch company behind hitmanpro strengthen endpoint protection products november 2016 sophos acquired barricade pioneering start-up powerful behavior-based analytics engine built machine learning techniques strengthen synchronized security capabilities next-generation network endpoint protection february 2017 sophos acquired invincea software company provides malware threat detection prevention pre-breach forensic intelligence", + "neighbors": [ + 14, + 17, + 91, + 94, + 120, + 149, + 246, + 297, + 379, + 476, + 528, + 569, + 585, + 602, + 604, + 613, + 717, + 842, + 910, + 938, + 944, + 965, + 1038, + 1063, + 1101, + 1239, + 1291, + 1296, + 1325, + 1350, + 1358, + 1379, + 1406, + 1514, + 1542, + 1543 + ], + "mask": "Test" + }, + { + "node_id": 1292, + "label": 2, + "text": "App_Store_(iOS):app store ios app store digital distribution platform developed maintained apple inc. mobile apps ios operating system store allows users browse download apps developed apple ios software development kit apps downloaded iphone smartphone ipod touch handheld computer ipad tablet computer transferred apple watch smartwatch 4th-generation newer apple tvs extensions iphone apps app store opened july 10 2008 initial 500 applications available store features 2.1 million apps developers multiple options monetizing applications ranging free free in-app purchases paid however app store criticized lackluster development environment prompting company june 2016 announce renewed focus energy store major changes introduced following months include ads search results new app subscription model ability developers respond customer reviews additionally apple began process remove old apps function intended n't follow current app guidelines app research firms noticing significant numbers app removals store furthermore release ios 11 september 2017 app store received complete design overhaul bringing greater focus editorial content daily highlights well design similar style several apple built-in ios apps iphone app store opened july 10 2008 july 11 iphone 3g released came pre-loaded support app store success apple app store launch similar services competitors term app store adopted refer similar service mobile devices however apple applied u.s. trademark term app store 2008 tentatively approved early 2011 june 2011 u.s. district judge phyllis hamilton presiding apple case amazon said would probably deny apple motion stop amazon using app store name july apple denied preliminary injunction amazon appstore federal judge term app become popular buzzword january 2011 app awarded honor 2010 word year american dialect society app used shorthand application since least mid-1990s product names since least 2006 example then-named google apps apple announced mac app store similar app distribution platform macos personal computer operating system october 2010 official launch taking place january 2011 release 10.6.6 snow leopard update february 2013 apple informed developers could begin using appstore.com links apps june developer conference apple announced upcoming kids section app store new section featuring apps categorized age range section launched alongside release ios 7 september 2013 november 2014 due pressure european commission apple updated app store apps charge download labeled get instead previous free due many free apps inclusions paid in-app purchases january 2017 reports surfaced documentation new beta then-upcoming release ios 10.3 detailed apple would let developers respond customer reviews app store marking significant change previous limitation prevented developers communicating users functionality officially enabled march 27 2017 ios 10.3 released users details also released reviews users including able rate review apps apps rather redirected app store mark users reviews helpful helpful apple published document describing proper ways respond developers including timely clear concise prioritize certain forms reviews low-star ratings certain countries recent reviews filtering itunes connect developer responses go approval process published developers also forbidden manipulating incenting feedback developer responses listed app store line underneath respective user review users receive notification/email upon response respective developer option update review march 2017 app store submissions containing pricing details free name started getting rejected developers previously advised developer guides itunes connect app store overview pages refrain practice though apps still approved starting march though apps free titles rejected october 2016 effort improve app discoverability apple rolled ability developers purchase advertising spots app store users united states ads shown top search results based strictly relevant keywords used create profiles users apple expanded search ads united kingdom australia new zealand april 2017 along configurable advertising settings developers search ads expanded canada mexico switzerland october 2017 december 2017 apple revamped search ads program offer two distinctive versions search ads basic pay-per-install program aimed smaller developers pay users actually install app search ads basic also features easier setup process restricted monthly budget search ads advanced new name given older method developers pay whenever users tap apps search results along unlimited monthly budgets launch basic program available u.s. international rollout expected sometime next year apple also offers itunes affiliate program lets people refer others apps itunes content along in-app purchases percentage sales commission rate in-app purchases reduced 7 2.5 may 2017 affiliate rates paid apps music movies books tv shows remained 7 app store received major design overhaul release ios 11 new design features greater focus editorial content daily highlights introduces cleaner consistent colorful look similar several apple built-in ios apps prior september 2017 apple offered way users manage ios app purchases itunes computer software september version 12.7 itunes released removing app store section process however following month itunes 12.6.3 also released retaining app store 9to5mac noting secondary release positioned apple necessary businesses performing internal app deployments december 2017 apple announced developers could offer applications pre-order letting make apps visible store 2\u201390 days ahead release january 4 2018 apple announced app store record-breaking holiday season according new press release week starting christmas eve record number customers made app store purchases spending 890 million seven-day period new year day 2018 alone customers made 300 million purchases ios sdk software development kit allows development mobile apps ios originally developing iphone prior unveiling 2007 apple then-ceo steve jobs intend let third-party developers build native apps ios instead directing make web applications safari web browser however backlash developers prompted company reconsider jobs announcing october 2007 apple would software development kit available developers february 2008 sdk released march 6 2008 sdk free download users mac personal computers available microsoft windows pcs sdk contains sets giving developers access various functions services ios devices hardware software attributes also contains iphone simulator mimic look feel device computer developing new versions sdk accompany new versions ios order test applications get technical support distribute apps app store developers required subscribe apple developer program combined xcode ios sdk helps developers write ios apps using officially supported programming languages including swift objective-c. companies also created tools allow development native ios apps using respective programming languages publish apps app store developers must pay 99 yearly fee access apple developer program apple announced united states 2018 waive fee nonprofit organizations governments developers options monetizing applications free model enables free apps increasing likelihood engagement freemium model makes app download free users offered optional additional features in-app require payments subscription model enables ongoing monetization renewable transactions paid model makes app paid download offers additional features paymium model enables paid app downloads paid in-app content in-app subscriptions originally introduced magazines newspapers music apps february 2011 giving developers 70 revenue earned apple 30 publishers could also sell digital subscriptions website bypassing apple fees allowed advertise website alternative apps 2016 multiple media outlets reported apps decreased significantly popularity recode wrote app boom editorial techcrunch stated air hopelessness surrounds mobile app ecosystem obvious demoralizing verge wrote original app store model selling apps buck two looks antiquated issues included consumer boredom lack app discoverability stated report 2014 lack new app downloads among smartphone users interview verge june 2016 phil schiller apple senior vice president worldwide marketing said apple renewed focus energy app store announced multiple significant changes including advertisements search results new app subscription model subscription model saw firmly established 70/30 revenue split developers apple change new 85/15 revenue split user stays subscribed developer app year opens possibility subscriptions apps select categories app data insights analyst company app annie released report october 2016 announcing china overtaken united states apple biggest market app store revenue third quarter 2016 chinese users spent 1.7 billion vs. approximately 1.5 billion american users june 2017 apple announced app store generated 70 billion revenue developers since 2008 launch july 10 2008 apple then-ceo steve jobs told usa today app store contained 500 third-party applications iphone ipod touch 25 percent free ten million applications downloaded first weekend september number available apps increased 3,000 100 million downloads years store surpassed multiple major milestones including 50,000 100,000 250,000 500,000 1 million 2 million apps billionth application downloaded april 24 2009 ipad released april 2010 approximately 3,000 apps available july 2011 16 months release 100,000 apps available designed specifically device apple publishes list yearly basis giving credit apps highest number downloads past year most-downloaded ios applications highest revenue generating ios applications time 2010-2018 apple rates applications worldwide based content determines age group appropriate according iphone os 3.0 launch event iphone allow blocking objectionable apps iphone settings following ratings apple detailed applications subject approval apple outlined sdk agreement basic reliability testing analysis applications may still distributed ad-hoc rejected author manually submitting request apple license application individual iphones although apple may withdraw ability authors later date apple employed mostly static analysis app review process means dynamic code reassembly techniques could defeat review process june 2017 apple updated app store review guidelines specify app developers longer ability use custom prompts encouraging users leave reviews apps release ios 11 late 2017 apple also let developers choose whether keep current app reviews updating apps reset additionally another update app store policies allows users optionally tip content creators voluntarily sending money november 2012 boyfriend maker dating sim game removed due reports references violent sexual acts paedophilia deemed inappropriate boyfriend maker age rating 4+ revised version called boyfriend plus approved apple april 2013 march 2013 hiddenapps approved appeared app store app provided access developer diagnostic menus allowed stock apps hidden enabled opt-out feature iads apple developer-driven advertisement system app removed shortly afterwards violating guidelines april 2013 apple removed appgratis then-successful app store market promoted paid apps offering one free day apple told things digital app violated two developer agreement clauses including apps display apps purchase promotion manner similar confusing app store rejected apps use push notifications send advertising promotions direct marketing kind apple however tell developers welcome resubmit changing app though much hope could survive anything like current incarnation november 2014 apple removed marijuana social networking app massroots reason given encourage excessive consumption alcohol illegal substances. \u201d february 2015 massroots reintroduced store apple changed enforcement guidelines allow cannabis social apps 23 states legal september 2015 discovered hundreds apps submitted approved app store using xcodeghost malicious version xcode development software issues prompted apple remove infected apps store issue statement working developers make sure \u2019 using proper version xcode security firm later published lists infected apps including china-only version angry birds 2 camcard lifesmart tinydeal.com wechat aftermath apple stated would make xcode faster download certain regions outside united states contacted developers ensure download code mac app store apple website provided code signature developers test running tampered version xcode june 2017 scamming trend discovered store developers make apps built non-existent services attach in-app purchase subscriptions opening dialogue buy app store search advertising space get app higher rankings one instance app name mobile protection clean security vpn would require payments 99.99 seven-day subscription short trial apple yet responded issues addition apple removed software licensed gnu general public license gpl app store due text apple terms service agreement imposing digital rights management proprietary legal terms incompatible terms gpl september 1 2016 apple announced starting september 7 would removing old apps function intended n't follow current review guidelines developers warned given 30 days update apps apps crash startup removed immediately additionally app names registered developers exceed 50 characters attempt stop developers inserting long descriptions irrelevant terms app names improve app ranking app store search results app intelligence firm sensor tower revealed november 2016 apple promised september announcement removing old apps removed 47,300 apps app store october 2016 238 percent increase prior number average monthly app removals june 2017 techcrunch reported apple turned app removal focus apps copying functionality popular apps example cited included popular game like flappy bird red ball hits charts hundreds thousands clones within weeks attempt capitalize initial wave popularity report also noted removals music apps serving pirated tracks publication wrote since initial september app removals began apple removed multiple hundreds thousands apps december 2017 new report techcrunch stated apple begun enforcing new restrictions use commercialized template app generation services originally introduced part apple 2017 developer conference new app store guidelines allow company ban apps making use templates commercial app services affected many small businesses techcrunch report citing local retailers restaurants small fitness studios nonprofits churches organizations benefit using templates app services due minimal costs developers received notice apple january 1 2018 deadline change respective apps news caught attention congress congressman ted lieu writing letter apple beginning december asking reconsider writing understanding many small businesses research organizations religious institutions rely template apps possess resources develop apps in-house new rules cast wide net specifically invalidating apps longstanding legitimate developers pose threat app store \u2019 integrity additionally news stricter enforcement caused significant criticism app development firms one company told techcrunch chose close business following news saying 4.2.6 rule enforcement final drop made us move bit faster decision close another company told publication way june guidelines changed would said \u2018 \u2019 going target apps ... apple told us \u2019 targeted quality standpoint hit umbrella spam shocking every quality developer good actors furthermore latter company stated \u2019 much apps perform utility \u2013 ordering food third company said rule 4.2.6 concrete illustration danger apple \u2019 dominant position fourth said \u2019 wiped pretty much entire industry diy tools like appmakr also development suites like titanium towards end year apple updated guideline clarify companies organizations allowed use template apps long directly publish app remained violation rule commercial app services publish apps respective clients january 2017 apple complied request chinese government remove chinese version new york times app followed government efforts 2012 block times website stories hidden wealth among family members then-leader china wen jiabao published statement apple spokesperson told media informed app violation local regulations though would specify regulations added result app must taken china app store situation changes app store offer new york times app download china following july reported apple begun remove listings china apps circumvent government internet censorship policies new laws restricting virtual private network vpn services apple issued statement explaining app removals result developers complying new laws china requiring government license businesses offering vpns apps remain available markets business earnings call following month cook elaborated recent news explainining would obviously rather remove apps like countries follow law wherever business besides vpn services number internet calling apps including microsoft skype also removed chinese app store 2017 apple telling new york times similar vpn apps new apps also violated local law microsoft explained bbc news skype app temporarily removed working reinstate app soon possible though many news outlets reported chinese government increased efforts pressure crack internet freedom following apple ceo tim cook appearance china world internet conference december 2017 cook stated apple china share vision developing digital economy openness shared benefits free speech human rights activists criticized cook company maya wang human rights watch told washington post cook \u2019 appearance lends credibility state aggressively censors internet throws people jail critical social ills building artificial intelligence systems monitors everyone targets dissent ... version cyberspace chinese government building decidedly dystopian one \u2019 think anyone would want share \u2018 common future. \u2019 apple spoken endorsed u.s senator patrick leahy told cnbc american tech companies become leading champions free expression commitment end borders ... global leaders innovation like apple opportunity moral obligation promote free expression basic human rights countries routinely deny rights cook told reuters hope time things couple things \u2019 pulled come back great hope great optimism however techcrunch jon russell criticized line thinking writing firstly apple \u2019 remove couple things reach china-based users rather couple hundred apps acknowledging even counting furthermore russell listed censorship efforts chinese government including vpn bans restrictions live video messaging apps wrote apple little choice follow beijing \u2019 line order continue business lucrative chinese market statements like cook \u2019 today dangerous massively underplay severity situation florida senator marco rubio also criticized cook appearance world internet conference describing situation \u2019 example company view desperate access chinese market place willing follow laws country even laws run counter companies \u2019 standards supposed august 2018 result chinese regulations 25,000 illegal apps pulled apple app store china", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 134, + 162, + 207, + 214, + 228, + 252, + 269, + 275, + 301, + 337, + 345, + 347, + 356, + 394, + 395, + 403, + 459, + 477, + 489, + 509, + 511, + 521, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 704, + 716, + 777, + 796, + 797, + 810, + 813, + 858, + 877, + 899, + 917, + 927, + 945, + 956, + 961, + 972, + 1001, + 1004, + 1046, + 1100, + 1138, + 1140, + 1178, + 1214, + 1225, + 1227, + 1235, + 1237, + 1262, + 1292, + 1301, + 1305, + 1311, + 1325, + 1334, + 1339, + 1366, + 1373, + 1409, + 1458, + 1488, + 1496, + 1544, + 1547, + 1563, + 1591, + 1627 + ], + "mask": "Train" + }, + { + "node_id": 1293, + "label": 4, + "text": "Zerodium:zerodium zerodium american information security company founded 2015 based washington d.c.. main business acquiring premium zero-day vulnerabilities functional exploits security researchers companies reporting research along protective measures security recommendations corporate government clients founder chaouki bekrar also known founding vupen defunct 2015 zerodium first company release full pricing chart zero-days ranging 5,000 1,500,000 per exploit company reportedly spending 400,000 600,000 per month vulnerability acquisitions", + "neighbors": [ + 43, + 91, + 141, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1327, + 1332, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Train" + }, + { + "node_id": 1294, + "label": 3, + "text": "Macintosh_XL:macintosh xl macintosh xl modified version apple lisa personal computer made apple computer inc macintosh xl configuration computer shipped macworks xl lisa program allowed 64 k macintosh rom emulation identical machine previously sold lisa 2/10 lisa os macintosh xl 400k 3.5 floppy drive internal 10 mb proprietary widget hard drive provision optional 5 10 mb external profile hard drive addition parallel interface card machine uses motorola 68000 cpu clocked 5 mhz together 512kb ram time release january 1985 macintosh xl colloquially referred hackintosh although name since used generally describe macintosh computers assembled unusual combinations parts apple transition intel processors denote pcs running osx86 hacked version mac os x macintosh xl discontinued april 1985 roots lisa \u2014 unlike macintosh computers \u2014 stock macintosh xl used rectangular pixels resolution macintosh xl 12 inch 30.5 cm display 720x364 square pixels available via macintosh xl screen kit upgrade changed resolution 608x432 cpu could replaced new cpu board containing 8 mb ram called xlerator 18 maximum upgraded ram conventional add-in ram cards 2 mb four times larger maximum capacity earlier macintosh computers modifications cpu board macintosh xl could accommodate 4 mb ram macworks plus developed sun remarketing successor macworks xl order provide application compatibility macintosh plus computer macworks plus added support 800 kb 3.5-inch floppy disk system software version 6.0.3 macworks plus ii extended 7.5.5 limit imposed 68000 processors re-badging xl last-ditch effort apple save poorly selling lisa usurped macintosh line two years marginal sales apple unprepared record number orders placed newest member macintosh family despite relative success macintosh xl discontinued unavailable parts ordered keep xl production last parts ran apple made decision shut production good 1986 apple offered lisa/xl owners opportunity turn computer along us 1,498 receive exchange macintosh plus hard disk 20 list price us 4,098 time apple dropped xl price list september 1985 sun remarketing logan utah bought number apple remaining inventory continued sell license updated version macworks plus re-branded macintosh professional though new lisas available sale development continued macworks plus support installed base lisas making relevant closely related cousin macintosh plus macintosh xl shares legacy lisa however increased sales emulation macintosh operating system proved macintosh family badly needed professional environment could support larger monitors greater memory expandability macintosh 512k offered", + "neighbors": [ + 71, + 99, + 130, + 214, + 228, + 269, + 270, + 345, + 511, + 607, + 610, + 917, + 927, + 956, + 972, + 1022, + 1138, + 1178, + 1215, + 1237, + 1262, + 1273, + 1305, + 1488, + 1544, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 1295, + "label": 2, + "text": "Index_of_articles_related_to_BlackBerry_OS:index articles related blackberry os list blackberry-related topics", + "neighbors": [ + 62, + 162, + 322, + 337, + 459, + 611, + 782 + ], + "mask": "Validation" + }, + { + "node_id": 1296, + "label": 4, + "text": "PureMessage:puremessage sophos puremessage anti-spam program sophos plc aimed primarily corporate environments sophos puremessage microsoft exchange \u2014 part email security data protection \u2014 blocks spam viruses spyware phishing scanning inbound outbound internal email exchange message stores proactively protects email-borne threats prevents confidential data lost", + "neighbors": [ + 134, + 195, + 961, + 1138, + 1291 + ], + "mask": "Validation" + }, + { + "node_id": 1297, + "label": 3, + "text": "Master_of_the_Lamps:master lamps master lamps one first music video games activision published game 1985 several home computer systems master lamps death arabian prince father king shatters three enchanted oil lamps freeing three genies trapped within genies overrun palace contain prince must reassemble three broken lamps player role prince wearing white thawb red keffiyeh must journey seven dens genie den contains one lamp pieces gameplay alternates two modes first prince maneuvers flying carpet winding tunnel genie den practice requires player direct carpet diamond-shaped gates appear failure returns prince beginning tunnel den second mode player strikes gong thrice summon genie genie draws hookah blows ball smoke smoke emerges sequence tones player must repeat call-and-response pattern order play tone player must strike corresponding gong player strikes incorrect gong strikes correct gong early genie magic transports prince beginning tunnel seven dens first genie tone audible manifests colored quaver eighth note floats toward ground seven dens second genie tone inaudible player must match color note color corresponding gong seven dens third genie tone audible note appears player must recognize note pitch strike correct gong player passes trial gateway another tunnel opens passing musical trials three genies player navigates one final tunnel palace player succeeds prince reclaims palace antic 1986 called master lamps offbeat game program number unique elements stating become little monotonous magazine approved non-violent gameplay", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1298, + "label": 9, + "text": "Common_Lisp_Interface_Manager:common lisp interface manager common lisp interface manager clim common lisp-based programming interface creating user interfaces i.e. graphical user interfaces guis fully object-oriented programming user interface management system using common lisp object system clos based idea stream input output also facilities output device independence descended gui system dynamic windows symbolics lisp machines main development 1988 1993 clim 2.0 released 1993 clim designed portable across different common lisp implementations different windowing systems uses reflective architecture window system interface clim supports like dynamic windows so-called presentations clim available allegro cl lispworks macintosh common lisp symbolics genera free software implementation clim named mcclim several extensions clim used several applications like climacs emacs-like editor also provides mouse-sensitive lisp listener read\u2013eval\u2013print loop repl common lisp", + "neighbors": [ + 27, + 46, + 56, + 99, + 117, + 173, + 194, + 203, + 251, + 258, + 292, + 306, + 308, + 313, + 324, + 332, + 347, + 360, + 383, + 391, + 392, + 394, + 446, + 447, + 454, + 488, + 501, + 506, + 509, + 536, + 565, + 567, + 601, + 649, + 653, + 682, + 686, + 693, + 753, + 787, + 795, + 796, + 815, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1068, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1189, + 1190, + 1207, + 1221, + 1225, + 1227, + 1235, + 1245, + 1251, + 1269, + 1277, + 1311, + 1315, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1502, + 1516, + 1536, + 1588, + 1609, + 1621, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 1299, + "label": 7, + "text": "MashApps:mashapps mashapps process-centric cloud applications small medium enterprises departmental deployments mashapps used solve different types business problems within enterprise integrations third party applications on-premises on-demand systems modeled without much dependency team mashup applications shared users organizations users looking mashapps business scenarios either build look similar solutions readily available google apps marketplace mashapps built online mashup enabler called mashapp composer building mashapp require programming languages like enterprise mashup markup language new mashapps assembled existing repository reusable mashup components like process library external web services", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1300, + "label": 0, + "text": "Mindnet:mindnet mindnet name several automatically acquired databases lexico-semantic relations developed members natural language processing group microsoft research 1990s considered one world largest lexicons databases could make automatic semantic descriptions along wordnet framenet hownet integrated linguistic database particularly distinguished wordnet way created automatically dictionary mindnet designed continuously extended first built longman dictionary contemporary english ldoce later included american heritage full text microsoft encarta system analyze linguistic representations arbitrary text underlying technology based parser used microsoft word grammar checker deployed natural language query engine microsoft encarta 99 encyclopedia", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1301, + "label": 2, + "text": "Berkeley_Software_Distribution:berkeley software distribution berkeley software distribution bsd operating system based research unix developed distributed computer systems research group csrg university california berkeley today bsd often refers descendants freebsd openbsd netbsd dragonfly bsd bsd initially called berkeley unix based source code original unix developed bell labs 1980s bsd widely adopted workstation vendors form proprietary unix variants dec ultrix sun microsystems sunos due permissive licensing familiarity many technology company founders engineers although proprietary bsd derivatives largely superseded 1990s unix svr4 osf/1 later releases provided basis several open-source operating systems including freebsd openbsd netbsd dragonfly bsd darwin trueos turn used proprietary operating systems including apple macos ios derived microsoft windows used part tcp/ip code earliest distributions unix bell labs 1970s included source code operating system allowing researchers universities modify extend unix operating system arrived berkeley 1974 request computer science professor bob fabry program committee symposium operating systems principles unix first presented pdp-11/45 bought run system budgetary reasons machine shared mathematics statistics groups berkeley used rsts unix ran machine eight hours per day sometimes day sometimes night larger pdp-11/70 installed berkeley following year using money ingres database project 1975 ken thompson took sabbatical bell labs came berkeley visiting professor helped install version 6 unix started working pascal implementation system graduate students chuck haley bill joy improved thompson pascal implemented improved text editor ex universities became interested software berkeley 1977 joy started compiling first berkeley software distribution 1bsd released march 9 1978 1bsd add-on version 6 unix rather complete operating system right thirty copies sent second berkeley software distribution 2bsd released may 1979 included updated versions 1bsd software well two new programs joy persist unix systems day vi text editor visual version ex c shell 75 copies 2bsd sent bill joy vax computer installed berkeley 1978 port unix vax architecture unix/32v take advantage vax virtual memory capabilities kernel 32v largely rewritten berkeley students include virtual memory implementation complete operating system including new kernel ports 2bsd utilities vax utilities 32v released 3bsd end 1979 3bsd also alternatively called virtual vax/unix vmunix virtual memory unix bsd kernel images normally called codice_1 4.4bsd 4.3bsd released june 1986 determined bsd would move away aging vax platform power 6/32 platform codenamed tahoe developed computer consoles inc. seemed promising time abandoned developers shortly thereafter nonetheless 4.3bsd-tahoe port june 1988 proved valuable led separation machine-dependent machine-independent code bsd would improve system future portability addition portability csrg worked implementation osi network protocol stack improvements kernel virtual memory system van jacobson lbl new tcp/ip algorithms accommodate growth internet versions bsd used proprietary unix code therefore subject software license source code licenses become expensive several outside parties expressed interest separate release networking code developed entirely outside would subject licensing requirement led networking release 1 net/1 made available non-licensees code freely redistributable terms bsd license released june 1989 net/1 bsd developer keith bostic proposed non-at sections bsd system released license net/1 end started project reimplement standard unix utilities without using code within eighteen months utilities replaced determined files remained kernel files removed result june 1991 release networking release 2 net/2 nearly complete operating system freely distributable net/2 basis two separate ports bsd intel 80386 architecture free 386bsd william jolitz proprietary bsd/386 later renamed bsd/os berkeley software design bsdi 386bsd short-lived became initial code base netbsd freebsd projects started shortly thereafter bsdi soon found legal trouble unix system laboratories usl subsidiary owners system v copyright unix trademark usl v. bsdi lawsuit filed 1992 led injunction distribution net/2 validity usl copyright claims source could determined lawsuit slowed development free-software descendants bsd nearly two years legal status question result systems based linux kernel legal ambiguity gained greater support lawsuit settled january 1994 largely berkeley favor 18,000 files berkeley distribution three removed 70 modified show usl copyright notices condition settlement usl would file lawsuits users distributors berkeley-owned code upcoming 4.4bsd release final release berkeley 1995 4.4bsd-lite release 2 csrg dissolved development bsd berkeley ceased since several variants based directly indirectly 4.4bsd-lite freebsd netbsd openbsd dragonfly bsd maintained permissive nature bsd license allowed many operating systems open-source proprietary incorporate bsd source code example microsoft windows used bsd code implementation tcp/ip bundles recompiled versions bsd command-line networking tools since windows 2000 darwin basis apple macos ios based 4.4bsd-lite2 freebsd various commercial unix operating systems solaris also incorporate bsd code starting 8th edition versions research unix bell labs close relationship bsd began 4.1cbsd vax used basis research unix 8th edition continued subsequent versions 9th edition incorporated source code improvements 4.3bsd result later versions research unix closer bsd system v. usenet posting 2000 dennis ritchie described relationship bsd research unix eric s. raymond summarizes longstanding relationship system v bsd stating divide roughly longhairs shorthairs programmers technical people tended line berkeley bsd business-oriented types system v. 1989 david a. curry wrote differences bsd system v. characterized system v often regarded standard unix however described bsd popular among university government computer centers due advanced features performance berkeley unix first unix include libraries supporting internet protocol stacks berkeley sockets unix implementation ip predecessor arpanet ncp ftp telnet clients produced university illinois 1975 available berkeley however memory scarcity pdp-11 forced complicated design performance problems integrating sockets unix operating system file descriptors became almost easy read write data across network access disk laboratory eventually released streams library incorporated much functionality software stack different architecture wide distribution existing sockets library reduced impact new api early versions bsd used form sun microsystems sunos founding first wave popular unix workstations bsd operating systems run much native software several operating systems architecture using binary compatibility layer much simpler faster emulation allows instance applications intended linux run effectively full speed makes bsds suitable server environments also workstation ones given increasing availability commercial closed-source software linux also allows administrators migrate legacy commercial applications may supported commercial unix variants modern operating system retaining functionality applications replaced better alternative current bsd operating system variants support many common ieee ansi iso posix standards retaining traditional bsd behavior like unix bsd kernel monolithic meaning device drivers kernel run privileged mode part core operating system several operating systems based bsd including freebsd openbsd netbsd midnightbsd dragonfly bsd netbsd freebsd created 1993 initially derived 386bsd also known jolix merged 4.4bsd-lite source code 1994 openbsd forked netbsd 1995 dragonfly bsd forked freebsd 2003 bsd also used basis several proprietary versions unix sun sunos sequent dynix next nextstep dec ultrix osf/1 axp tru64 unix nextstep later became foundation apple inc. macos", + "neighbors": [ + 1, + 9, + 22, + 33, + 37, + 42, + 55, + 58, + 63, + 64, + 85, + 99, + 101, + 106, + 116, + 134, + 160, + 170, + 171, + 185, + 187, + 189, + 193, + 195, + 207, + 265, + 275, + 301, + 306, + 308, + 322, + 323, + 346, + 353, + 380, + 387, + 413, + 434, + 443, + 457, + 465, + 473, + 475, + 477, + 491, + 564, + 569, + 583, + 650, + 664, + 716, + 720, + 721, + 728, + 754, + 771, + 797, + 860, + 884, + 891, + 899, + 901, + 941, + 954, + 957, + 961, + 966, + 987, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1057, + 1063, + 1074, + 1100, + 1124, + 1138, + 1155, + 1187, + 1202, + 1214, + 1218, + 1221, + 1224, + 1234, + 1278, + 1292, + 1304, + 1318, + 1330, + 1366, + 1391, + 1394, + 1395, + 1397, + 1398, + 1415, + 1421, + 1441, + 1456, + 1474, + 1494, + 1521, + 1530, + 1538, + 1546, + 1547, + 1558, + 1570, + 1578, + 1588, + 1609, + 1610, + 1616, + 1631, + 1632, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1302, + "label": 9, + "text": "SpiderMonkey:spidermonkey spidermonkey code name first javascript engine written brendan eich netscape communications later released open-source currently maintained mozilla foundation eich wrote javascript ten days 1995 recruited netscape promise 'doing scheme browser idea using scheme abandoned engineering management decided language must \u2018 look like java \u2019 fall 1996 eich needing pay substantial technical debt left first year stayed home two weeks rewrite mocha codebase became known spidermonkey mocha original working name language name spidermonkey may chosen reference movie beavis butt-head america character tom anderson mentions title characters whacking like couple spider monkeys 2011 eich transferred management spidermonkey code dave mandelin spidermonkey implements ecma-262 edition 5.1 ecmascript several added features ecma-357 ecmascript xml e4x dropped early 2013 even though spidermonkey used firefox provide host environments document object model dom mozilla projects support dom gecko provides host environment spidermonkey written c/c++ contains interpreter ionmonkey jit compiler garbage collector tracemonkey first jit compiler written javascript language compiler first released part spidermonkey firefox 3.5 providing performance improvements ranging 20 40 times faster baseline interpreter firefox 3 instead compiling whole functions tracemonkey tracing jit operates recording control flow data types interpreter execution data informed construction trace trees highly specialized paths native code improvements j\u00e4germonkey eventually made tracemonkey obsolete especially development spidermonkey type inference engine tracemonkey absent spidermonkey firefox 11 onward j\u00e4germonkey internally named methodjit whole-method jit compiler designed improve performance cases tracemonkey could generate stable native code first released firefox 4 eventually entirely supplanted tracemonkey replaced ionmonkey j\u00e4germonkey operated differently compilers class typical compilers worked constructing optimizing control flow graph representing function j\u00e4germonkey instead operated iterating linearly forward spidermonkey bytecode internal function representation although prohibits optimizations require instruction reordering j\u00e4germonkey compiling advantage fast useful javascript since recompiling due changing variable types frequent mozilla implemented number critical optimizations j\u00e4germonkey importantly polymorphic inline caches type inference difference tracemonkey j\u00e4germonkey jit techniques need explained hacks.mozilla.org article in-depth explanation technical details provided chris leary one spidermonkey developers blog post technical information found developer blogs dvander dmandelin ionmonkey name mozilla current javascript jit compiler aims enable many new optimizations impossible prior j\u00e4germonkey architecture ionmonkey traditional compiler translates spidermonkey bytecode control flow graph using static single assignment form ssa intermediate representation architecture enables well-known optimizations programming languages used javascript including type specialization function inlining linear-scan register allocation dead code elimination loop-invariant code motion compiler emit fast native code translations javascript functions arm x86 x86-64 platforms default engine since firefox 18 odinmonkey name mozilla new optimization module asm.js easily compilable subset javascript odinmonkey jit compiler uses current jit compiler included firefox release 22 spidermonkey intended embedded applications provide host environments javascript incomplete list follows spidermonkey includes javascript shell interactive javascript development command-line invocation javascript program files", + "neighbors": [ + 7, + 36, + 50, + 69, + 81, + 85, + 107, + 132, + 210, + 258, + 306, + 347, + 427, + 509, + 593, + 632, + 686, + 713, + 796, + 869, + 886, + 959, + 1016, + 1120, + 1138, + 1166, + 1210, + 1231, + 1264, + 1302, + 1372, + 1376, + 1423, + 1430, + 1437, + 1511, + 1539, + 1566, + 1604 + ], + "mask": "Validation" + }, + { + "node_id": 1303, + "label": 4, + "text": "Automotive_security:automotive security automotive security refers branch computer security focused cyber risks related automotive context increasingly high number ecus vehicles alongside implementation multiple different means communication towards vehicle remote wireless manner led necessity branch cybersecurity dedicated threats associated vehicles confused automotive safety implementation multiple ecus electronic control units inside vehicles began early '70s thanks development integrated circuits microprocessors made economically feasible produce ecus large scale since number ecus increased 100 per vehicle units nowadays control almost everything vehicle simple tasks activating wipers safety-related ones like brake-by-wire abs anti-lock braking system autonomous driving also strongly reliant implementation new complex ecus adas alongside sensors lidars radars control units inside vehicle ecus connected cabled wireless communication networks bus controller area network bus media oriented system transport flexray rf radio frequency many implementations tpmss tire pressure monitoring systems important notice many ecus require data received networks arrive various sensors operate use data modify behavior vehicle e.g. cruise control modifies vehicle speed depending signals arriving button usually located steering wheel since development cheap wireless communication technologies bluetooth lte wi-fi rfid similar automotive producers oems designed ecus implement technologies goal improving experience driver passengers safety-related systems onstar general motors telematic units communication smartphones vehicle speakers bluetooth android auto apple carplay rkes remote keyless entry systems examples vehicle become externally connected devices cases internet furthermore since 2016 development implementation marketed vehicles v2x technologies long- short-range communication interfaces vehicle become considerably bigger although implementation new technologies devices improved safety driving experience vehicle increasingly high number externally-communicating units inside vehicle led increment dimension attack surfaces vehicle electronic control units nowadays capability modifying behavior vehicle necessary ensure attacker capabilities take control critical systems inside vehicle due last ten fifteen years new concept automotive security started become important designing new vehicles threat models automotive world based real-world theoretically possible attacks real-world attacks aim safety people around car modifying cyber-physical capabilities vehicle e.g. steering braking accelerating without requiring actions driver theoretical attacks supposed focus also privacy-related goals obtaining gps data vehicle capturing microphone signals similar regarding attack surfaces vehicle usually divided long-range short-range local attack surfaces lte dsrc considered long-range ones bluetooth wi-fi usually considered short-range although still wireless finally usb obd-ii attack surfaces require physical access car defined local attacker able implement attack long-range surface considered stronger dangerous one requires physical access vehicle 2015 possibility attacks vehicles already market proven possible miller valasek managed disrupt driving jeep cherokee remotely connecting remote wireless communication common network used vehicles one mainly used safety-related communication due real-time properties simplicity cheapness reason majority real-world attacks implemented ecus connected type network majority attacks demonstrated either actual vehicles testbeds fall one following categories sniffing computer security field generally refers possibility intercepting logging packets generally data network case since bus network every node listens communication network useful attacker read data learn behavior nodes network implementing actual attack usually final goal attacker simply sniff data since packets passing type network usually valuable read dos information security usually described attack objective making machine network unavailable dos attacks ecus connected buses done network abusing arbitration protocol used always win arbitration targeting single ecu abusing error handling protocol second case attacker flags messages victim faulty convince victim broken therefore shut network spoofing attacks comprise cases attacker falsifying data sends messages pretending another node network automotive security usually spoofing attacks divided masquerade replay attacks replay attacks defined attacker pretends victim sends sniffed data victim sent previous moment masquerade contrary spoofing attacks data payload created attacker increasing complexity devices networks automotive context requires application security measures limit capabilities potential attacker since early 2000 many different countermeasures proposed cases applied following list common security measures", + "neighbors": [ + 11, + 144, + 149, + 293, + 310, + 338, + 379, + 439, + 479, + 518, + 528, + 576, + 608, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 898, + 1039, + 1082, + 1090, + 1112, + 1325, + 1337, + 1355, + 1361, + 1368, + 1379, + 1472, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1304, + "label": 2, + "text": "MS-DOS:ms-dos ms-dos acronym microsoft disk operating system operating system x86-based personal computers mostly developed microsoft collectively ms-dos rebranding ibm pc dos operating systems attempting compatible ms-dos sometimes referred dos also generic acronym disk operating system ms-dos main operating system ibm pc compatible personal computers 1980s early 1990s gradually superseded operating systems offering graphical user interface gui various generations graphical microsoft windows operating system ibm licensed re-released august 12 1981 pc dos 1.0 use pcs although ms-dos pc dos initially developed parallel microsoft ibm two products diverged twelve years 1993 recognizable differences compatibility syntax capabilities lifetime several competing products released x86 platform ms-dos went eight versions development ceased 2000 initially ms-dos targeted intel 8086 processors running computer hardware using floppy disks store access operating system application software user data well progressive version releases delivered support mass storage media ever greater sizes formats along added feature support newer processors rapidly evolving computer architectures ultimately key product microsoft growth programming language company diverse software development firm providing company essential revenue marketing resources also underlying basic operating system early versions windows ran gui flexible operating system consumes negligible installation space ms-dos renamed form 86-dos owned seattle computer products written tim paterson development 86-dos took six weeks basically clone digital research cp/m 8080/z80 processors ported run 8086 processors two notable differences compared cp/m improved disk sector buffering logic introduction fat12 instead cp/m filesystem first version shipped august 1980 microsoft needed operating system ibm personal computer hired tim paterson may 1981 bought 86-dos 1.10 75,000 july year microsoft kept version number renamed ms-dos also licensed ms-dos 1.10/1.14 ibm august 1981 offered pc dos 1.0 one three operating systems ibm 5150 ibm pc within year microsoft licensed ms-dos 70 companies designed os could run 8086-family computer computer would distinct hardware version ms-dos similar situation existed cp/m ms-dos emulating solution cp/m adapt different hardware platforms end ms-dos designed modular structure internal device drivers minimally primary disk drives console integrated kernel loaded boot loader installable device drivers devices loaded integrated boot time oem would use development kit provided microsoft build version ms-dos basic i/o drivers standard microsoft kernel would typically supply disk end users along hardware thus many different versions ms-dos different hardware major distinction ibm-compatible isa machine ms-dos compatible machine machines like tandy 2000 ms-dos compatible ibm-compatible could run software written exclusively ms-dos without dependence peripheral hardware ibm pc architecture design would worked well compatibility application programs used ms-dos services perform device i/o indeed design philosophy embodied windows nt see hardware abstraction layer however ms-dos early days greater speed attainable programs direct control hardware particular importance especially games often pushed limits contemporary hardware soon ibm-compatible architecture became goal long 8086-family computers closely emulated ibm hardware single version ms-dos fixed hardware platform needed market version version ms-dos discussed dozens oem versions ms-dos relevant systems designed case similar function capability standard version ibm pc\u2014often same-numbered version always since oems used proprietary version numbering schemes e.g labeling later releases ms-dos 1.x 2.0 vice versa \u2014with notable exceptions microsoft omitted multi-user support ms-dos microsoft unix-based operating system xenix fully multi-user company planned time improve ms-dos would almost indistinguishable single-user xenix xedos would also run motorola 68000 zilog z8000 lsi-11 would upwardly compatible xenix byte 1983 described multi-user ms-dos future microsoft advertised ms-dos xenix together listing shared features single-user os multi-user multi-tasking unix-derived operating system promising easy porting breakup bell system however computer systems started selling unix system v. believing could compete unix market microsoft abandoned xenix 1987 transferred ownership xenix santa cruz operation sco march 25 2014 microsoft made code scp ms-dos 1.25 mixture altos ms-dos 2.11 televideo pc dos 2.11 available public microsoft research license agreement makes code source-available open source defined open source initiative free software foundation standards microsoft would later re-license code mit license september 28 2018 making versions free software april fool day joke 2015 microsoft mobile launched windows phone application called ms-dos mobile presented new mobile operating system worked similar ms-dos microsoft licensed released versions ms-dos different names like lifeboat associates software bus 86 a.k.a sb-dos compaq-dos ncr-dos z-dos eventually enforced ms-dos name versions ibm one originally called ibm personal computer dos later shortened ibm pc dos competitors released compatible dos systems dr dos pts-dos could also run dos applications former eastern bloc ms-dos derivatives named dcp 3.20 3.30 existed late 1980s produced east german electronics manufacturer veb robotron following versions ms-dos released public microsoft dos released oem channel digital research released dr dos 5.0 retail upgrade pc dos 5.00.1 ibm-microsoft agreement started end ibm entered retail dos market ibm dos 5.00.1 5.02 6.00 pc dos 6.1 6.3 7 2000 7.1 localized versions ms-dos existed different markets western issues ms-dos evolved around set tools drivers localized message languages differing sets supported codepages keyboard layouts language versions considerably different western issues adapted run localized pc hardware additional bios services available western pcs support multiple hardware codepages displays printers support dbcs alternative input methods graphics output affected issues include japanese dos/v korean arabic ados 3.3/5.0 hebrew hdos 3.3/5.0 russian rdos 4.01/5.0 well eastern european versions dos microcomputers based intel 8086 8088 processors including ibm pc clones initial competition pc dos/ms-dos line came digital research whose cp/m operating system inspired ms-dos fact remains controversy whether qdos less plagiarised early versions cp/m code digital research released cp/m-86 months ms-dos offered alternative ms-dos microsoft licensing requirements higher price executable programs cp/m-86 ms-dos interchangeable many applications sold ms-dos cp/m-86 versions ms-dos became preponderant later digital research operating systems could run ms-dos cp/m-86 software ms-dos originally supported simple .com modelled similar binary incompatible format known cp/m-80 cp/m-86 instead supported relocatable format using file extension .cmd avoid name conflicts cp/m-80 ms-dos .com files ms-dos version 1.0 added advanced relocatable .exe executable file format machines early days ms-dos differing system architectures certain degree incompatibility subsequently vendor lock-in users began using ms-dos machines compelled continue using version customized hardware face trying get proprietary hardware software work new system business world 808x-based machines ms-dos tied faced competition unix operating system ran many different hardware architectures microsoft sold version unix pc called xenix emerging world home users variety computers based various processors serious competition ibm pc apple ii early apple macintosh commodore 64 others use 808x processor many 808x machines different architectures used custom versions ms-dos first machines competition time ibm pc hardware configuration became dominant 808x market software written communicate directly pc hardware without using standard operating system calls ran much faster true pc-compatibles non-pc-compatible 808x machines small market fast software written alone market remained open ibm pcs machines closely imitated architecture running either single version ms-dos compatible pcs equivalent ibm pc dos clones cost much less ibm-branded machines similar performance became widely used home users ibm pcs large share business computer market microsoft ibm together began intended follow-on ms-dos/pc dos called os/2 os/2 released 1987 microsoft began advertising campaign announcing dos dead stating version 4 last full release os/2 designed efficient multi-tasking standard operating systems since 1963 offered number advanced features designed together similar look feel seen legitimate heir kludgy dos platform ms-dos grown spurts many significant features taken duplicated microsoft products operating systems ms-dos also grew incorporating direct licensing feature duplicating functionality tools utilities developed independent companies norton utilities pc tools microsoft anti-virus qemm expanded memory manager stacker disk compression others period digital research competing operating system market computers like amstrad pc1512 sold floppy disks two operating systems one could used time ms-dos cp/m-86 derivative digital research produced dos plus compatible ms-dos 2.11 supported cp/m-86 programs additional features including multi-tasking could read write disks cp/m ms-dos format os/2 protracted development digital research released ms-dos compatible dr dos 5.0 included features available third-party add-ons ms-dos unwilling lose portion market microsoft responded announcing pending release ms-dos 5.0 may 1990 effectively killed dr dos sales actual release ms-dos 5.0 june 1991 digital research brought dr dos 6.0 sold well pre-announcement ms-dos 6.0 stifled sales dr dos microsoft accused carefully orchestrating leaks future versions ms-dos attempt create industry called fud fear uncertainty doubt regarding dr dos example october 1990 shortly release dr dos 5.0 long eventual june 1991 release ms-dos 5.0 stories feature enhancements ms-dos started appear infoworld pc week brad silverberg vice president systems software microsoft general manager windows ms-dos business unit wrote forceful letter pc week november 5 1990 denying microsoft engaged fud tactics serve customers better decided forthcoming version 5.0 denying microsoft copied features dr dos feature enhancements ms-dos version 5.0 decided development begun long heard dr dos 5.0 similar features 50 million ms-dos users n't surprising dri heard requests customers \u2013 schulman et al 1994 pact microsoft ibm promote os/2 began fall apart 1990 windows 3.0 became marketplace success much microsoft contributions os/2 also went creating third gui replacement dos windows nt ibm already developing next version os/2 carried development platform without microsoft sold alternative dos windows response digital research dr dos 6.0 bundled superstor disk compression microsoft opened negotiations stac electronics vendor popular dos disk compression tool stacker due diligence process stac engineers shown microsoft part stacker source code stac unwilling meet microsoft terms licensing stacker withdrew negotiations microsoft chose license vertisoft doubledisk using core doublespace disk compression ms-dos 6.0 6.20 released 1993 including microsoft doublespace disk compression utility program stac successfully sued microsoft patent infringement regarding compression algorithm used doublespace resulted 1994 release ms-dos 6.21 disk compression removed shortly afterwards came version 6.22 new version disk compression system drivespace different compression algorithm avoid infringing code prior 1995 microsoft licensed ms-dos windows computer manufacturers three types agreement per-processor fee system company sold per-system fee system particular model per-copy fee copy ms-dos installed largest manufacturers used per-processor arrangement lowest fee arrangement made expensive large manufacturers migrate operating system dr dos 1991 u.s. government federal trade commission began investigating microsoft licensing procedures resulting 1994 settlement agreement limiting microsoft per-copy licensing digital research gain settlement years later successor interest caldera sued microsoft damages caldera v. microsoft lawsuit believed settlement ran order 150 million revealed november 2009 release settlement agreement 280 million microsoft also used variety tactics ms-dos several applications development tools operating perfectly running genuine ms-dos pc dos would break run another vendor implementation dos notable examples practice included introduction windows 3.0 1990 easy usability graphical user interface severely diminished usage ms-dos based command line release windows 95 continuing windows 9x product line windows integrated version ms-dos used bootstrapping troubleshooting backwards-compatibility old dos software particularly games longer released standalone product windows 95 dos called ms-dos 7 booted separately without windows gui capability retained windows 98 second edition windows removed capability boot underlying ms-dos 8.0 alone hard disk retained ability make dos boot floppy disk called emergency boot disk hacked restore full access underlying dos contrast windows 9x series windows nt-derived 32-bit operating systems developed alongside 9x series windows nt 2000 xp newer contain ms-dos part operating system nt built subsystem running dos entirely different independent operating system provide subset dos emulation run dos applications provide dos-like command prompt windows 64-bit versions windows nt line provide dos emulation run dos applications natively windows xp contains copy windows boot disk stripped bootstrap accessible formatting floppy ms-dos startup disk files like driver cd-rom support deleted windows bootdisk startup files autoexec.bat config.sys longer content modified disk base creating ms-dos image windows xp deleted files recovered undelete tool booting ms-dos startup disk made windows xp format tool version reports windows millenium ms-dos 8.0 used base windows 98 never released stand alone product windows vista files startup disk dated april 18 2005 otherwise unchanged including string ms-dos version 8 copyright 1981\u20131999 microsoft corp inside codice_1 starting windows 10 ability create dos startup disk removed either virtual machine running ms-dos older version virtual machine dual boot must used format floppy disk image must obtained external source solutions include using dos compatible alternatives freedos even copying required files boot sector ms-dos 6.22 last standalone version produced microsoft intel 8088 intel 8086 intel 80286 processors remain available download via msdn volume license oem license partner websites customers valid login credentials ms-dos still used embedded x86 systems due simple architecture minimal memory processor requirements though current products switched still-maintained open-source alternative freedos 2018 microsoft released source code ms-dos 1.25 2.0 github purpose according microsoft mainly education experimentation historic operating systems new programmers gain understanding low-level software works historic current due historical nature software microsoft accept pull requests code pull requests modified translated documentation accepted users however allowed fully encouraged fork repository containing ms-dos source code make modifications whatever like versions ms-dos obtained operation modification abandonware sites winworldpc versions microsoft windows ms-dos-like command-line interface cli called command prompt could run many dos variously win32 os/2 1.x posix command line utilities command-line session allowing piping commands user interface icon windows 2000 followed native ms-dos interface 16-bit versions windows 3.11 ran graphical user interface gui top ms-dos windows 95 98 98 se ms-dos part superficially integrated treating operating systems complete package though dos component could actually stand alone command line accessed dos command line usually codice_1 windows module winoldap.mod new line windows windows nt boot kernel whose sole purpose load windows one run win32 applications loader system manner os/2 unix consumer windows launch character-mode sessions command session permits running various supported command line utilities win32 ms-dos os/2 1.x posix emulators ms-dos os/2 posix use host window way win16 applications use win32 explorer using host window allows one pipe output emulations ms-dos emulation done ntvdm nt virtual dos machine modified softpc former product similar virtualpc running modified ms-dos 5 ntio.sys ntdos.sys output handled console dlls program prompt codice_3 codice_4 codice_5 see output 64-bit windows either dos emulation dos commands come 32-bit windows dos version returns 5.00 5.50 depending api function used determine utilities ms-dos 5.00 run emulation without modification early beta programs nt show ms-dos 30.00 programs running ms-dos 30.00 would assume os/2 control os/2 emulation handled os2ss.exe os2.exe doscalls.dll os2.exe version os/2 shell cmd.exe passes commands os2ss.exe input-output windows nt shell windows 2000 last version nt support os/2 emulation os/2 1.30 posix emulated posix shell emulated shell commands handled directly cmd.exe command prompt often called ms-dos prompt part official name windows 9x early versions windows nt nt 3.5 earlier part softpc emulation dos redirects output actually codice_1 16-bit commands run ntvdm codice_7 codice_8 initialisation determined codice_9 optionally permitting use win32 console applications internal commands codice_10 directive win32 console applications use codice_3 command prompt shell confusion exist os/2 separate dos os/2 prompts running dos program os/2 launch separate dos window run application versions windows itanium longer sold microsoft x86-64 architectures longer include ntvdm therefore longer natively run ms-dos 16-bit windows applications alternatives form virtual machine emulators microsoft virtual pc well vmware dosbox others 1983 onwards various companies worked graphical user interfaces guis capable running pc hardware however required duplicated effort provide much consistency interface design even products company later 1985 microsoft windows 1.0 released microsoft first attempt providing consistent user interface applications early versions windows ran top ms-dos first windows met little success also true companies efforts well example gem version 3.0 windows gained market acceptance windows 9x used dos boot process launch protected mode basic features related file system long file names available dos running subsystem windows windows nt runs independently dos includes ntvdm component simulating dos environment legacy applications ms-dos compatible systems include microsoft manufactured ibm pc dos ibm ms-dos identical products eventually diverged starting ms-dos version 6.0 digital research follow microsoft version numbering scheme example ms-dos 4 released july 1988 followed dr dos 5.0 may 1990 ms-dos 5.0 came april 1991 dr dos 6.0 released following june products collectively referred dos even though disk operating system generic term used systems unrelated x86 ibm pc ms-dos also generic reference dos ibm pc compatible computers microsoft control windows platform programming practices intentionally made windows appear ran poorly competing versions dos crippled ability dos makers continue compete ms-dos digital research release interim releases circumvent windows limitations inserted artificially designed specifically provide microsoft competitive advantage", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 58, + 64, + 85, + 99, + 108, + 134, + 148, + 170, + 171, + 187, + 233, + 234, + 236, + 273, + 306, + 322, + 326, + 365, + 377, + 387, + 413, + 434, + 435, + 443, + 465, + 477, + 583, + 622, + 627, + 639, + 664, + 670, + 716, + 728, + 754, + 776, + 796, + 797, + 836, + 860, + 868, + 870, + 891, + 920, + 925, + 941, + 957, + 961, + 966, + 1011, + 1012, + 1022, + 1024, + 1027, + 1040, + 1049, + 1050, + 1056, + 1064, + 1085, + 1104, + 1110, + 1132, + 1138, + 1139, + 1155, + 1187, + 1188, + 1193, + 1202, + 1203, + 1216, + 1224, + 1287, + 1301, + 1304, + 1346, + 1390, + 1394, + 1398, + 1415, + 1428, + 1441, + 1445, + 1457, + 1474, + 1494, + 1530, + 1546, + 1578, + 1582, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 1305, + "label": 3, + "text": "Apple_A9X:apple a9x apple a9x 64-bit arm-based system chip soc designed apple inc first appeared ipad pro announced september 9 2015 released november 11 2015 a9x m9 motion coprocessor embedded new innovation seen previous chip generations variant a9 apple claims 1.8 times cpu performance 2 times gpu performance predecessor a8x a9x features apple-designed 64-bit armv8-a dual-core cpu called twister offers double memory bandwidth double storage performance apple a8x unlike a9 a9x contain l3 cache due significant dram bandwidth a9x paired 4 gb lpddr4 memory 12.9 ipad pro 2 gb lpddr4 memory 9.7 ipad pro total bandwidth 51.2 gb/s high bandwidth necessary feed soc 12-core powervr 7 series gpu ram included a9x package unlike sibling a9 a9x uses nand interface a9 uses apple-designed nvme-based controller communicates pcie connection ipad pro nand design akin pc-class ssd embedded flash memory common mobile devices gives ipad pro significant storage performance advantage competitors often use msata emmc connect storage systems", + "neighbors": [ + 33, + 71, + 75, + 99, + 112, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 853, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 988, + 1001, + 1069, + 1100, + 1140, + 1147, + 1176, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1518, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1306, + "label": 9, + "text": "TI_BASIC_(TI_99/4A):ti basic ti 99/4a ti basic ansi-compliant basic programming language interpreter built 1981 texas instruments ti-99/4a home computer predecessor ti-99/4 1979 developed microsoft bob wallace bob greenberg version supporting compiled code used commercial development language ti-990 range minicomputers text full screen graphics logic operations recording tape file system supported ti basic texas instruments also produced ti extended basic cartridge enhanced functionality accessible basic users statements ti basic call close data def dim display end for..to..step gosub goto if..then..else input let next on..gosub on..goto open option base print randomize read rem restore return stop every line ti basic contain one statement possibility put several statements line also necessary peek load calls use assembly language routines became available ti extended basic note poke statement ti basic loading executing machine code requires 32k memory expansion ti editor/assembler cartridge gives access call load 256 bytes ram directly accessible cpu mostly consumed basic interpreter ti basic stored ran programs 16k video ram unlike ti extended basic could take advantage 32k memory expansion unlike microsoft basics used left mid right instr manipulating strings ti basic used ansi-compliant seg pos subprograms called call statement e.g call clear user defined subprograms possible ti extended basic subprograms predefined ti basic written interpreted byte-code language known graphics programming language unique ti-99 line ti extended basic improved execution speed somewhat providing functionality assembly language wallace said put lot extra time trying get ti basic funny little things ... basic could bring line edit line ... suppose wanted line somewhere else ca n't edit line numbers n't work way worked lot get work way", + "neighbors": [ + 0, + 8, + 236, + 273, + 359, + 365, + 510, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1044, + 1050, + 1079, + 1156, + 1204, + 1390, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1307, + "label": 3, + "text": "Cyberun:cyberun cyberun zx spectrum video game ostensibly developed ultimate play game published u.s. gold 1986 although part jetman series similarities jetpac player must construct spaceship parts seek resources power-ups unlike ultimate titles cyberun written partnership tim chris stamper player controls spaceship trapped planet inhabited hostile aliens goal upgrade spaceship parts scattered around planet mine valuable element called cybernite atmosphere ground populated flying aliens clouds drip acid damaging ship shields ship requires fuel fly exhausted bounce along ground planet unable climb similar enemy ship also planet attempting mine cybernite player fuel replenished tankers planet surface damaged shields repaired player must venture caverns surface order mine cybernite done ship upgraded include mining laser sufficient cybernite collected player escape next planet zebarema system game well received critics crash awarding 90 crash smash spectrum giving 8/10 describing game classic pick pieces shoot em brilliant graphics link playing online", + "neighbors": [ + 48, + 321, + 618, + 822, + 1312 + ], + "mask": "Test" + }, + { + "node_id": 1308, + "label": 4, + "text": "Peiter_Zatko:peiter zatko peiter c. zatko better known mudge network security expert open source programmer writer hacker prominent member high-profile hacker think tank l0pht well long-lived computer culture hacking cooperative cult dead cow involved l0pht mudge contributed significantly disclosure education information security vulnerabilities addition pioneering buffer overflow work security advisories released contained early examples flaws following areas code injection race condition side-channel attack exploitation embedded systems cryptanalysis commercial systems original author password cracking software l0phtcrack 2010 mudge accepted position program manager darpa oversaw cyber security research 2013 mudge went work google advanced technology projects division born december 1970 mudge graduated berklee college music top class adept guitar player mudge responsible early research type security vulnerability known buffer overflow 1995 published write buffer overflows one first papers topic published first security advisories research demonstrating early vulnerabilities unix code injection side-channel attacks information leaks leader full disclosure movement initial author security tools l0phtcrack antisniff l0phtwatch mudge one first people hacker community reach build relationships government industry demand public speaker spoke hacker conferences def con academic conferences usenix mudge also member cult dead cow since 1996 one seven l0pht members testified senate committee 1998 serious vulnerabilities internet time l0pht became computer security consultancy stake 1999 mudge became vice president research development later chief scientist 2000 first crippling internet distributed denial-of-service attacks invited meet president bill clinton security summit alongside cabinet members industry executives 2004 became division scientist government contractor bbn technologies originally worked 1990s also joined technical advisory board nfr security 2010 announced would project manager darpa project focused directing research cyber security 2013 announced would leave darpa position google atap 2015 zatko announced twitter would join project called cyberul testing organisation computer security inspired underwriters laboratories mandated white house 11 august 2007 married sarah lieberman co-worker bbn darpa created cyber analytical framework agency used evaluate dod investments offensive defensive cyber security tenure ran least three dod programs known military networking protocol mnp cyber-insider threat cinder cyber fast track cft military networking protocol mnp provided network prioritization full user-level attribution military computer networks cyber-insider threat cinder focused identifying cyber espionage conducted virtual insider threats future variants stuxnet duqu cinder often mistakenly associated wikileaks media possibly due confusion darpa programs focused identifying human insider threat adams identification software espionage posed malware cinder program issue clarified mudge defcon 2011 keynote 46 minutes 11 seconds talk cyber fast track cft provided resources funding security research including programs run hackers hackerspaces makerlabs program provided alternative traditional government contracting vehicles accessible individuals small companies previously unable work within cumbersome complicated darpa process novel contracting effort averaging time 7 days receipt proposal funding provided proposing research organization program initially announced shmoocon 2011 keynote mudge published numerous papers advisories detailing security problems across different applications operating systems pioneering champion full disclosure", + "neighbors": [ + 225, + 289, + 600, + 633, + 703, + 876, + 1342 + ], + "mask": "Train" + }, + { + "node_id": 1309, + "label": 4, + "text": "Computer_and_network_surveillance:computer network surveillance computer network surveillance monitoring computer activity data stored hard drive data transferred computer networks internet monitoring often carried covertly may completed governments corporations criminal organizations individuals may may legal may may require authorization court independent government agencies computer network surveillance programs widespread today almost internet traffic monitored surveillance allows governments agencies maintain social control recognize monitor threats prevent investigate criminal activity advent programs total information awareness program technologies high-speed surveillance computers biometrics software laws communications assistance law enforcement act governments possess unprecedented ability monitor activities citizens however many civil rights privacy groups reporters without borders electronic frontier foundation american civil liberties union expressed concern increasing surveillance citizens end even already mass surveillance society limited political and/or personal freedoms fear led numerous lawsuits hepting v. hacktivist group anonymous hacked government websites protest considers draconian surveillance vast majority computer surveillance involves monitoring data traffic internet example united states communications assistance law enforcement act mandates phone calls broadband internet traffic emails web traffic instant messaging etc available unimpeded real-time monitoring federal law enforcement agencies packet capture also known packet sniffing monitoring data traffic computer network data sent computers internet networks takes form small chunks called packets routed destination assembled back complete message packet capture appliance intercepts packets may examined analyzed computer technology needed perform traffic analysis sift intercepted data look important/useful information communications assistance law enforcement act u.s. telecommunications providers required install packet capture technology federal law enforcement intelligence agencies able intercept customers broadband internet voice internet protocol voip traffic far much data gathered packet sniffers human investigators manually search thus automated internet surveillance computers sift vast amount intercepted internet traffic filtering reporting investigators bits information interesting example use certain words phrases visiting certain types web sites communicating via email chat certain individual group billions dollars per year spent agencies information awareness office nsa fbi development purchase implementation operation systems intercept analyze data extracting information useful law enforcement intelligence agencies similar systems used iranian secret police identify suppress dissidents technology allegedly installed german siemens ag finnish nokia internet rapid development become primary form communication people potentially subject internet surveillance advantages disadvantages network monitoring instance systems described web 2.0 greatly impacted modern society tim \u2019 reilly first explained concept web 2.0 stated web 2.0 provides communication platforms user generated self-produced content motivating people communicate friends online however internet surveillance also disadvantage one researcher uppsala university said web 2.0 surveillance directed large user groups help hegemonically produce reproduce surveillance providing user-generated self-produced content characterize web 2.0 surveillance mass self-surveillance surveillance companies monitor people focused work entertainment yet employers also monitor employees order protect company assets control public communications importantly make sure employees actively working productive emotionally affect people cause emotions like jealousy research group states ... set test prediction feelings jealousy lead \u2018 creeping \u2019 partner facebook women particularly likely engage partner monitoring response jealousy study shows women become jealous people online group virtual assistant become social integration lives currently virtual assistant amazon alexa call 911 local services constantly listening command recording parts conversations help improve algorithms law enforcement able called using virtual assistant law enforcement would able access information saved device device connected home internet law enforcement would exact location individual calling law enforcement virtual assistance devices popular many debate lack privacy devices listening every conversation owner even owner talking virtual assistant device still listening conversation hopes owner need assistance well gather data corporate surveillance computer activity common data collected often used marketing purposes sold corporations also regularly shared government agencies used form business intelligence enables corporation better tailor products and/or services desirable customers data also sold corporations use aforementioned purpose used direct marketing purposes targeted advertisements ads targeted user search engine analyzing search history emails use free webmail services kept database one important component prevention establishing business purposes monitoring may include following second component prevention determining ownership technology resources ownership firm networks servers computers files e-mail explicitly stated distinction employee personal electronic devices limited proscribed owned firm instance google search stores identifying information web search ip address search phrase used stored database 18 months google also scans content emails users gmail webmail service order create targeted advertising based people talking personal email correspondences google far largest internet advertising agency\u2014millions sites place google advertising banners links websites order earn money visitors click ads page containing google advertisements adds reads modifies cookies visitor computer cookies track user across sites gather information web surfing habits keeping track sites visit sites information along information email accounts search engine histories stored google use build profile user deliver better-targeted advertising united states government often gains access databases either producing warrant simply asking department homeland security openly stated uses data collected consumer credit direct marketing agencies augmenting profiles individuals monitoring addition monitoring information sent computer network also way examine data stored computer hard drive monitor activities person using computer surveillance program installed computer search contents hard drive suspicious data monitor computer use collect passwords and/or report back activities real-time operator internet connection keylogger example type program normal keylogging programs store data local hard drive programmed automatically transmit data network remote computer web server multiple ways installing software common remote installation using backdoor created computer virus trojan tactic advantage potentially subjecting multiple computers surveillance viruses often spread thousands millions computers leave backdoors accessible network connection enable intruder remotely install software execute commands viruses trojans sometimes developed government agencies cipav magic lantern often however viruses created people spyware installed marketing agencies used gain access security breaches create another method cracking computer gain access network attacker install surveillance software remotely servers computers permanent broadband connections vulnerable type attack another source security cracking employees giving information users using brute force tactics guess password one also physically place surveillance software computer gaining entry place computer stored install compact disc floppy disk thumbdrive method shares disadvantage hardware devices requires physical access computer one well-known worm uses method spreading stuxnet one common form surveillance create maps social networks based data social networking sites well traffic analysis information phone call records nsa call database internet traffic data gathered calea social network maps data mined extract useful information personal interests friendships affiliations wants beliefs thoughts activities many u.s. government agencies defense advanced research projects agency darpa national security agency nsa department homeland security dhs currently investing heavily research involving social network analysis intelligence community believes biggest threat u.s. comes decentralized leaderless geographically dispersed groups types threats easily countered finding important nodes network removing requires detailed map network jason ethier northeastern university study modern social network analysis said following scalable social network analysis program developed information awareness office shown possible monitor computers distance commercially available equipment detecting radiation emitted crt monitor form computer surveillance known tempest involves reading electromagnetic emanations computing devices order extract data distances hundreds meters ibm researchers also found computer keyboards key emits slightly different noise pressed differences individually identifiable conditions possible log key strokes without actually requiring logging software run associated computer 2015 lawmakers california passed law prohibiting investigative personnel state force businesses hand digital communication without warrant calling electronic communications privacy act time california state senator jerry hill introduced bill making law enforcement agencies disclose information usage information stingray phone tracker device law took effect january 2016 require cities operate new guidelines relation law enforcement use device legislators holding public office disagreed technology warrantless tracking city wants use device must heard public hearing cities pulled using stingray santa clara county also shown adi shamir et al. even high frequency noise emitted cpu includes information instructions executed policeware software designed police citizens monitoring discussion interaction citizens within u.s. carnivore first incarnation secretly installed e-mail monitoring software installed internet service providers networks log computer communication including transmitted e-mails magic lantern another application time running targeted computer trojan style performing keystroke logging cipav deployed fbi multi-purpose spyware/trojan clipper chip formerly known myk-78 small hardware chip government install phones designed nineties intended secure private communication data reading voice messages encoded decode clipper chip designed clinton administration \u201c \u2026protect personal safety national security developing information anarchy fosters criminals terrorists foreign foes. \u201d government portrays solving secret codes cryptographic age technology created thus raised controversy public clipper chip thought next \u201c big brother \u201d tool led failure clipper proposal even though many attempts consumer broadband digital television promotion act cbdtpa bill proposed united states congress cbdtpa known security systems standards certification act sssca draft form killed committee 2002 cbdtpa become law would prohibited technology could used read digital content copyright music video e-books without digital rights management drm prevented access material without permission copyright holder german-speaking countries spyware used made government sometimes called govware countries like switzerland germany legal framework governing use software known examples include swiss minipanzer megapanzer german r2d2 trojan surveillance censorship different surveillance performed without censorship harder engage censorship without form surveillance even surveillance lead directly censorship widespread knowledge belief person computer use internet surveillance lead self-censorship march 2013 reporters without borders issued special report internet surveillance examines use technology monitors online activity intercepts electronic communication order arrest journalists citizen-journalists dissidents report includes list state enemies internet bahrain china iran syria vietnam countries whose governments involved active intrusive surveillance news providers resulting grave violations freedom information human rights computer network surveillance increase countries report also includes second list corporate enemies internet amesys france blue coat systems u.s. gamma uk germany hacking team italy trovicor germany companies sell products liable used governments violate human rights freedom information neither list exhaustive likely expanded future protection sources longer matter journalistic ethics journalists equip digital survival kit exchanging sensitive information online storing computer hard-drive mobile phone individuals associated high-profile rights organizations dissident groups protest groups reform groups urged take extra precautions protect online identities", + "neighbors": [ + 11, + 14, + 149, + 190, + 270, + 293, + 379, + 425, + 450, + 487, + 531, + 564, + 576, + 624, + 633, + 658, + 678, + 684, + 692, + 739, + 746, + 771, + 779, + 813, + 818, + 852, + 1090, + 1121, + 1325, + 1379, + 1395, + 1444 + ], + "mask": "Test" + }, + { + "node_id": 1310, + "label": 2, + "text": "Android_Nougat:android nougat android nougat codenamed android n development seventh major version 14th original version android operating system first released alpha test version march 9 2016 officially released august 22 2016 nexus devices first receive update lg v20 first smartphone released nougat nougat introduces notable changes operating system development platform including ability display multiple apps on-screen split-screen view support inline replies notifications expanded doze power-saving mode restricts device functionality screen period time additionally platform switched openjdk-based java environment received support vulkan graphics rendering api seamless system updates supported devices nougat received positive reviews new app notification format received particular praise multitasking interface seen positive change reviewers experienced incompatible apps critics mixed experiences doze power-saving mode faster app installs tweaks user interface also reviewed positively 19.2 devices access google play run nougat 11.4 android 7.0 api 24 7.8 android 7.1 api 25 release internally codenamed new york cheesecake march 9 2016 ahead google i/o developer conference google released first alpha version android n part new android beta program intended testing developers enthusiasts official release summer developer preview builds compatible current google nexus devices 5x 6p 6 9 pixel c nexus player android beta program introduced allows testers opt-in over-the-air updates new beta versions released april 13 2016 android n beta preview 2 released google discussed android n i/o keynote may 18 2016 unveiled new virtual reality platform daydream beta preview 3 first preview release deemed suitable wider public beta testing released time google also announced would hold contest determine official release name operating system beta preview 4 released june 15 2016 june 30 2016 google announced n release name would nougat also confirmed nougat would version 7.0 android final beta preview 5 released july 18 2016 android 7.0 officially released august 22 2016 nexus 6 5x 6p 9 nexus player pixel c first devices receive update dave burke android vice president engineering stated august 2016 updates nougat would released quarterly maintenance releases focusing continued refinements polish september 6 2016 lg announced v20 first smartphone ship nougat pre-installed google unveiled first-party pixel pixel xl smartphones hardware-focused event october 4 2016 pixel phones replacing nexus series updates existing devices vary manufacturer carrier driver support version manufacturer device respective system-on-chip major manufacturers including htc sony motorola announced intents update range recent devices nougat qualcomm stated would support nougat devices using snapdragon 800 801 system-on-chips undisclosed reasons although developer preview builds nougat released device sony stated would upgrade xperia z3 uses snapdragon 801 final version due unforeseen platform limitations reported google compatibility test suite whose tests must passed order receive official certification specified devices running nougat must support either vulkan opengl es 3.1 graphics apis \u2014 neither supported device adreno 330 graphics core none less fairphone 2 purported device qualcomm snapdragon 801 chipset provide official support android 7.1.2. delivering effort towards increased longevity sustainable device post-release update known android 7.1 pre-loaded onto google pixel pixel xl smartphones released october 2016 new version adds support google daydream vr platform image keyboards expanded emoji support including male female versions support actions displayed menus home screen app shortcuts new features preview 7.1 existing nexus devices released via android beta program later month officially released android 7.1.1 december 5 2016 7.1.1 nexus 6 nexus 9 considered end-of-life receive updates android 7.1.2 released april 2017 providing various improvements minor functionality improvements nexus pixel-branded devices nougat redesigns notification shade features smaller row icons settings replacing notification cards new sheet design allowing inline replies notifications multiple notifications single app also bundled greater per-app control notifications split-screen display mode introduced phones two apps snapped occupy halves screen experimental multi-window mode also available hidden feature multiple apps appear simultaneously screen overlapping windows doze power saving mechanism introduced android marshmallow expanded include state activated device running battery screen period time stationary state network activity restricted apps granted maintenance windows access network perform background tasks marshmallow full doze state activated device stationary screen period time new data saver mode restricts background mobile data usage trigger internal functions apps designed reduce bandwidth usage capping quality streaming media december 2015 google announced android nougat would switch java runtime environment defunct apache harmony openjdk\u2014the official open source implementation java platform maintained oracle corporation java community android runtime art incorporates profile-guided compilation system utilizing jit compiler profiling alongside current ahead-of-time compiler optimize apps device hardware conditions background nougat introduces system enabling seamless automatic system updates based upon sharing code implementation similar functionality chrome os system uses pair squashfs partitions android system executes online partition updates applied background redundant offline partition next boot following installation update redundant partition designated active device henceforth boots updated system previous system partition kept backup case update failure serve offline partition next update system removes requirement device reboot system recovery environment apply update prevents device used update complete also provides ability update automatically rolled back case failure google chose enable seamless updates devices shipped nougat later rather enabling earlier devices support feature repartitioning additionally due art changes nougat apps longer need re-compiled upon first boot system update developer preview 2 added platform support vulkan new low-level 3d-rendering api alternative opengl es higher graphics performance nougat first version featuring unicode 9.0 support comes updated emoji plus support emoji skin tones android 7.1 adds native api support implementing image keyboards multi-endpoint telephony shortcut menus rounded icon assets apps launchers support google daydream virtual reality platform daydream environment includes sustained performance mode assist developers optimizing apps device thermal profile new head tracking algorithm combines input various device sensors integration system notifications vr user interface response stagefright family bugs disclosed fixed 2015 several changes made harden media stack future vulnerabilities runtime integer overflow detection implemented preventing majority stagefright-like programming bugs becoming vulnerabilities addition helping fix prevent bugs android monolithic mediaserver process redesigned better adhere principle least privilege mediaserver split several separate processes running unprivileged sandbox granted permissions required task example audioserver access bluetooth libstagefright runs within mediacodecservice sandbox granted gpu access constraints placed media stack seccomp various mechanisms enabled reduce possibility malicious code injected and/or executed inside linux kernel including dividing kernel memory logical segments code data page access permissions read-only no-execute appropriate kernel also restricted directly accessing user space memory stronger stack protection enabled gcc compiler reduce stack smashing limit exposure kernel potentially malicious code perf disabled default ioctl commands restricted selinux seccomp-bpf enabled grant processes ability restrict system calls devices shipping android nougat verified boot policy introduced partially kitkat displaying notifications startup marshmallow must strictly enforced system files corrupted otherwise modified operating system allow operation limited-use mode refuse boot dieter bohn verge praised new multitasking interface android nougat calling long overdue android tablets although initially found implementation confusing wrote worked well understood properly though noted apps \u2019 fully support split screen others work fine pop warning anyway bohn also liked new way reply message notification stating android long advantage useful consistent notifications versus ios added quick replies standard n't see lead diminishing also noted tweaks throughout os welcome changes including quick toggles notification drawer settings menu visual information camera app cleaned bit bohn stated n't notice significant battery improvements despite doze power-saving feature nougat also wrote extensively fact even though nougat great \u2019 shame take long anybody see writing lack updates android devices unless nexus could months could becomes available phone chris velazco engadget also praised new bundled app notifications writing prior android versions notifications sort sit interaction nougat much better job bundling app letting get things done highlighted ability expand bundled gmail notification see subjects senders individual messages velazco stated split-screen multitasking big deal also encountered non-compatible apps visual elements settings app quick toggles notification dropdown new language emoji support also positive highlights review velazco note battery improvement doze power-saving feature stating nexus 6p seemed gain hour two standby battery life also wrote installing launching apps might little faster usual thanks nougat new app compiler hoped game developers utilize new vulkan api seriously good-looking mobile gaming", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 655, + 671, + 704, + 754, + 775, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1088, + 1138, + 1183, + 1185, + 1259, + 1265, + 1276, + 1360, + 1371, + 1384, + 1411, + 1415, + 1419, + 1480, + 1483, + 1500, + 1503, + 1535, + 1557, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1311, + "label": 9, + "text": "Ruby_(programming_language):ruby programming language ruby interpreted high-level general-purpose programming language designed developed mid-1990s yukihiro matz matsumoto japan ruby dynamically typed uses garbage collection supports multiple programming paradigms including procedural object-oriented functional programming according creator ruby influenced perl smalltalk eiffel ada basic lisp matsumoto said ruby conceived 1993 1999 post ruby-talk mailing list describes early ideas language matsumoto describes design ruby like simple lisp language core object system like smalltalk blocks inspired higher-order functions practical utility like perl name ruby originated online chat session matsumoto keiju ishitsuka february 24 1993 code written language initially two names proposed coral ruby matsumoto chose latter later e-mail ishitsuka matsumoto later noted factor choosing name ruby \u2013 birthstone one colleagues first public release ruby 0.95 announced japanese domestic newsgroups december 21 1995 subsequently three versions ruby released two days release coincided launch japanese-language ruby-list mailing list first mailing list new language already present stage development many features familiar later releases ruby including object-oriented design classes inheritance mixins iterators closures exception handling garbage collection following release ruby 0.95 1995 several stable versions ruby released following years 1997 first article ruby published web year matsumoto hired netlab.jp work ruby full-time developer 1998 ruby application archive launched matsumoto along simple english-language homepage ruby 1999 first english language mailing list ruby-talk began signaled growing interest language outside japan year matsumoto keiju ishitsuka wrote first book ruby object-oriented scripting language ruby \u30aa\u30d6\u30b8\u30a7\u30af\u30c8\u6307\u5411\u30b9\u30af\u30ea\u30d7\u30c8\u8a00\u8a9e ruby published japan october 1999 would followed early 2000s around 20 books ruby published japanese 2000 ruby popular python japan september 2000 first english language book programming ruby printed later freely released public widening adoption ruby amongst english speakers early 2002 english-language ruby-talk mailing list receiving messages japanese-language ruby-list demonstrating ruby increasing popularity non-japanese speaking world ruby 1.8 initially released august 2003 stable long time retired june 2013 although deprecated still code based ruby 1.8 partially compatible ruby 1.9 ruby 1.8 subject several industry standards language specifications ruby developed open standards promotion center information-technology promotion agency japanese government agency submission japanese industrial standards committee jisc international organization standardization iso accepted japanese industrial standard jis x 3017 2011 international standard iso/iec 30170 2012 around 2005 interest ruby language surged tandem ruby rails web framework written ruby rails frequently credited increasing awareness ruby ruby 1.9 released christmas day 2007 effective ruby 1.9.3 released october 31 2011 ruby switched dual-licensed ruby license gpl dual-licensed ruby license two-clause bsd license adoption 1.9 slowed changes 1.8 required many popular third party gems rewritten ruby 1.9 introduces many significant changes 1.8 series examples ruby 1.9 obsolete since february 23 2015 longer receive bug security fixes users advised upgrade recent version ruby 2.0 added several new features including ruby 2.0 intended fully backward compatible ruby 1.9.3 official 2.0.0 release february 24 2013 five known minor incompatibilities obsolete since february 22 2016 longer receive bug security fixes users advised upgrade recent version ruby 2.1.0 released christmas day 2013 release includes speed-ups bugfixes library updates starting 2.1.0 ruby versioning policy like semantic versioning although similar ruby versioning policy compatible semantic versioning semantic versioning also provides additional labels pre-release build metadata available extensions major.minor.patch format available ruby ruby 2.1 obsolete since april 1 2017 longer receive bug security fixes users advised upgrade recent version ruby 2.2.0 released christmas day 2014 release includes speed-ups bugfixes library updates removes deprecated apis notably ruby 2.2.0 introduces changes memory handling incremental garbage collector support garbage collection symbols option compile directly jemalloc also contains experimental support using vfork 2 system spawn added support unicode 7.0 specification features made obsolete removed include callcc dl library digest :hmac lib/rational.rb lib/complex.rb gserver logger :application well various c api functions ruby 2.3.0 released christmas day 2015 notable changes include 2.3 branch also includes many performance improvements updates bugfixes including changes proc call socket io use exception keywords thread name handling default passive net :ftp connections rake removed stdlib ruby 2.4.0 released christmas day 2016 notable changes include 2.4 branch also includes performance improvements hash table array max array min instance variable access ruby 2.5.0 released christmas day 2017 notable changes include top come lot performance improvements like faster block passing 3 times faster faster mutexes faster erb templates improvements concatenation methods ruby 2.6.0 released christmas day 2018 notable changes include matsumoto said ruby designed programmer productivity fun following principles good user interface design google tech talk 2008 matsumoto stated hope see ruby help every programmer world productive enjoy programming happy primary purpose ruby language stresses systems design needs emphasize human rather computer needs ruby said follow principle least astonishment pola meaning language behave way minimize confusion experienced users matsumoto said primary design goal make language enjoyed using minimizing programmer work possible confusion said applied principle least astonishment design ruby nevertheless phrase come closely associated ruby programming language phrase source surprise novice users may take mean ruby behaviors try closely match behaviors familiar languages may 2005 discussion newsgroup comp.lang.ruby matsumoto attempted distance ruby pola explaining design choice surprising someone uses personal standard evaluating surprise personal standard remains consistent would surprises familiar standard matsumoto defined way interview ruby object-oriented every value object including classes instances types many languages designate primitives integers booleans null variables always hold references objects every function method methods always called object methods defined top level scope become methods object class since class ancestor every class methods called object also visible scopes effectively serving global procedures ruby supports inheritance dynamic dispatch mixins singleton methods belonging defined single instance rather defined class though ruby support multiple inheritance classes import modules mixins ruby described multi-paradigm programming language allows procedural programming defining functions/variables outside classes makes part root 'self object object orientation everything object functional programming anonymous functions closures continuations statements values functions return last evaluation support introspection reflection metaprogramming well support interpreter-based threads ruby features dynamic typing supports parametric polymorphism according ruby faq syntax similar perl semantics similar smalltalk differs greatly python syntax ruby broadly similar perl python class method definitions signaled keywords whereas code blocks defined keywords braces contrast perl variables obligatorily prefixed sigil used sigil changes semantics scope variable practical purposes distinction expressions statements line breaks significant taken end statement semicolon may equivalently used unlike python indentation significant one differences python perl ruby keeps instance variables completely private class exposes accessor methods codice_11 codice_12 etc. unlike getter setter methods languages like c++ java accessor methods ruby created single line code via metaprogramming however accessor methods also created traditional fashion c++ java invocation methods require use parentheses trivial change instance variable full function without modifying single line calling code refactoring achieving similar functionality c vb.net property members python property descriptors similar come tradeoff development process one begins python using publicly exposed instance variable later changes implementation use private instance variable exposed property descriptor code internal class may need adjusted use private variable rather public property ruby \u2019 design forces instance variables private also provides simple way declare codice_13 codice_14 methods keeping idea ruby one never directly accesses internal members class outside class rather one passes message class receives response see examples section samples code demonstrating ruby syntax ruby official distribution also includes codice_15 interactive command-line interpreter used test code quickly following code fragment represents sample session using codice_15 following examples run ruby shell interactive ruby shell saved file run command line typing codice_17 classic hello world example basic ruby code input conversions variety ways define strings ruby following assignments equivalent strings support variable interpolation following assignments equivalent produce raw strings constructing using array constructing using associative array ruby called hash statement two syntaxes creating code block code block passed method optional block argument many built-in methods arguments parameter-passing block closure computer science |closure creating anonymous function returning closure computer science |closures method yielding flow program control block provided calling time iterating enumerations arrays using blocks method codice_18 accept parameter block codice_18 method iterates member list performing function retaining aggregate analogous codice_20 function functional programming languages example first pass block receives 10 argument inject codice_21 1 first element array codice_22 returns 11 becomes codice_21 next pass added 3 get 14 added 5 third pass finally return 19 using enumeration block square numbers 1 10 using range invoke method item codice_24 synonym codice_25 following code defines class named codice_26 addition codice_27 usual constructor create new objects two methods one override codice_28 comparison operator codice_29 sort age override codice_30 method codice_31 format output codice_12 example metaprogramming ruby codice_33 defines getter setter methods instance variables codice_12 getter methods last evaluated statement method return value allowing omission explicit codice_35 statement preceding code prints three names reverse age order codice_26 constant reference codice_37 object ruby classes never closed methods always added existing class applies classes including standard built-in classes needed open class definition existing class new contents specified added existing contents simple example adding new method standard library codice_38 class adding methods previously defined classes often called monkey patch|monkey-patching performed recklessly practice lead behavior collisions subsequent unexpected results code scalability problems since ruby 2.0 possible use refinements reduce potentially negative consequences monkey-patching limiting scope patch particular areas code base exception raised codice_39 call optional message added exception exceptions also specified programmer alternatively exception instance passed codice_39 method last construct useful raising instance custom exception class featuring constructor takes one argument exceptions handled codice_41 clause clause catch exceptions inherit codice_42 flow control keywords used handling exceptions codice_43 codice_44 common mistake attempt catch exceptions simple rescue clause catch exceptions one must write catch particular exceptions also possible specify exception object made available handler clause alternatively recent exception stored magic global codice_45 several exceptions also caught ruby code programmatically modify run time program lifecycle phase |runtime aspects structure would fixed rigid languages class method definitions sort metaprogramming used write concise code effectively extend language example following ruby code generates new methods built-in codice_46 class based list colors methods wrap contents string html tag styled respective color generated methods could used like implement equivalent many languages programmer would write method codice_47 codice_48 codice_49 etc separately possible uses ruby metaprogramming include original ruby interpreter computer software |interpreter often referred ruby mri|matz ruby interpreter mri implementation written c uses ruby-specific virtual machine standardized retired ruby 1.8 ruby mri|implementation written c programming language |c single-pass interpreted language starting ruby 1.9 continuing ruby 2.x official ruby interpreter yarv yet another ruby vm implementation superseded slower virtual machine used previous releases mri number alternative implementations ruby including jruby rubinius mruby takes different approach jruby rubinius providing just-in-time compilation mruby also providing ahead-of-time compilation ruby three major alternate implementations ruby implementations include defunct ruby implementations maturity ruby implementations tends measured ability run ruby rails rails framework complex implement uses many ruby-specific features point particular implementation achieves goal called rails singularity reference implementation jruby rubinius able run rails unmodified production environment matsumoto originally ruby development bsd|4.3bsd -based sony news|sony news-os 3.x later migrated work sunos 4.x finally linux 1999 ruby known work across many different operating system including news-os sunos aix svr4 solaris operating system |solaris nec up-ux nextstep bsd linux classic mac os|mac os dos windows operating system |windows beos modern ruby versions implementations available many operating systems linux bsd solaris aix macos windows windows phone windows ce symbian os beos ibm rubygems ruby package manager ruby package called gem easily installed via command line gems libraries though exist applications integrated development environment|ides 10,000 ruby gems hosted rubygems.org many new existing ruby libraries hosted github service offers revision control|version control repository hosting git software |git ruby application archive hosted applications documentation libraries ruby programming maintained 2013 function transferred rubygems category ruby programming language category articles example ruby code category class-based programming languages category dynamic programming languages category dynamically typed programming languages category free software programmed c category iso standards category object-oriented programming languages category programming languages created 1995 category programming languages iso standard category scripting languages category software using bsd license category text-oriented programming languages category free compilers interpreters", + "neighbors": [ + 7, + 19, + 29, + 31, + 33, + 65, + 78, + 81, + 99, + 117, + 134, + 148, + 152, + 176, + 201, + 207, + 216, + 246, + 249, + 275, + 301, + 306, + 324, + 347, + 373, + 378, + 412, + 430, + 447, + 509, + 521, + 538, + 567, + 579, + 592, + 593, + 594, + 597, + 653, + 682, + 686, + 716, + 742, + 756, + 782, + 786, + 790, + 796, + 815, + 820, + 825, + 873, + 899, + 916, + 919, + 923, + 926, + 948, + 961, + 998, + 1005, + 1028, + 1044, + 1068, + 1120, + 1138, + 1146, + 1152, + 1189, + 1190, + 1196, + 1214, + 1221, + 1225, + 1227, + 1231, + 1232, + 1235, + 1242, + 1251, + 1254, + 1264, + 1269, + 1275, + 1278, + 1292, + 1298, + 1318, + 1319, + 1324, + 1366, + 1372, + 1418, + 1430, + 1457, + 1477, + 1481, + 1491, + 1502, + 1508, + 1532, + 1536, + 1538, + 1547, + 1558, + 1582, + 1583, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1312, + "label": 3, + "text": "Bubbler_(video_game):bubbler video game bubbler zx spectrum video game developed published ultimate play game 1987 ultimate final title 8-bit home computers evolving rare game isometric platform game style marble madness 1984 crash magazine reviewer ricky disliked impreciseness controls", + "neighbors": [ + 48, + 321, + 618, + 822, + 1307 + ], + "mask": "Test" + }, + { + "node_id": 1313, + "label": 2, + "text": "Linux-powered_device:linux-powered device linux-based devices linux devices computer appliances powered linux kernel possibly parts gnu operating system device manufacturers reasons use linux may various low cost security stability scalability customizability many original equipment manufacturers use free open source software brand products community maintained linux devices also available devices intended run linux time production community effort made possible either full partial linux support open source philosophy free open source software brings software world many people ported linux kernel run devices typical desktop laptop server computer ports performed committed individuals groups provide alternative software favorite hardware original hardware vendors cases supportive efforts linksys wrt54g least tolerate use software end users see tivo hacking others go great lengths try stop alternative implementations android linux-based operating system optimised mobile touchscreen environments\u2014smartphones tablets e-books like developed published maintained google android open source project consultation open handset alliance android relieves smartphone manufacturers costs developing- licensing proprietary handset operating systems first unveiled 2007 android became world widely deployed smartphone platform q4 2010 september 2012 500 million android devices activated 1.3 million devices activated per day google nexus developer phones flagship brand android handsets features capabilities represent state art time launch typically every eleven months cases oems open use software fulfil requirements free software licenses gnu general public license gpl small number cases use masked either deliberately professed ignorance misunderstanding violators usually found public records may forced declare implementations advertising example embedded software engineers mandatory linux experience required careers pages yet site product documentation offers source download offer supply software source required license gpl organizations gpl-violations.org free software foundation fsf software freedom law center sflc organized pursuing violators obtaining compliance usually seek voluntary compliance first step enter legal proceedings blocked notified violations confirm asking supplier examining available product samples even going far make blind purchases product front companies", + "neighbors": [ + 24, + 134, + 162, + 219, + 238, + 264, + 265, + 267, + 275, + 294, + 305, + 327, + 400, + 401, + 484, + 571, + 630, + 650, + 688, + 707, + 716, + 720, + 736, + 897, + 935, + 986, + 1051, + 1060, + 1102, + 1105, + 1197, + 1208, + 1241, + 1252, + 1357, + 1360, + 1361, + 1391, + 1456, + 1468, + 1524, + 1526, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1314, + "label": 2, + "text": "Nokia_E61:nokia e61 nokia e61 smartphone eseries range s60 3rd edition device targeting business users european market announced part new eseries business line 12 october 2005 along nokia e60 e70 q4 2006 cingular rogers wireless deployed similar yet restricted version designated nokia e62 north american brazilian markets e62 substantially similar without 802.11 wifi chipset w-cdma umts 3g support e61 supports 900/1800/1900 bands e62 operate 850/900/1800/1900 order support american networks 12 february 2007 nokia announced e61i follow product nokia e61i smartphone eseries range s60v3 device targeting business users european market update nokia e61 released 2006 product announced 12 february 2007 3gsm world congress main differences e61 include", + "neighbors": [ + 3, + 21, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 520, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1395, + 1422, + 1448, + 1493, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1315, + "label": 9, + "text": "X3J13:x3j13 x3j13 name technical committee part international committee information technology standards incits named x3 x3j13 committee formed 1986 draw american national standards institute ansi common lisp standard based first edition book common lisp language also termed cltl cltl1 guy l. steele jr. formerly de facto standard language primary output x3j13 american national standard programming language common lisp x3.226/1994 approved december 8 1994 x3j13 later worked international organization standardization iso working group sc22/wg16 internationally standardised dialect lisp named islisp original chair committee doctor robert mathis ohio state university mary van deusen secretary guy l. steele jr. originally vice-chair later years mathis stepped chair steele assumed role efforts committee guided charter successful creation credited coordinating efforts susan p. ennis representative amoco production company charter lays committee goals priorities broadly defined list topics addressed committee formed several subcommittees help members better concentrate efforts cleanup subcommittee chaired larry masinter established standardised format submission proposals voting issue writeups part standard deemed sufficiently useful common lisp hyperspec include cross-reference benefit readers providing information original intent committee decisions writeups also serve historical record alternate solutions problems ultimately adopted chaired sandra loosemore subcommittee created proposals issues relating lisp compiling guy steele acknowledged second edition common lisp language large contribution compiler subcommittee toward clarifying compiling process described first edition parts steele describes vague jon l. white chair iteration subcommittee among issues dealt group generalized codice_1 macro \u2013 domain-specific language second edition cltl devotes full chapter algol-like syntax macro differing lisp usual s-expression syntax remains somewhat controversial character subcommittee chaired thom linden task defining standard would deal issues surrounding different character sets resolution matters particularly ability use character name symbol intended make common lisp simpler international users chaired kent pitman error handling subcommittee plugged described biggest outstanding hole common lisp condition system general mechanism handling errors warnings exceptional situations committee referred resulting specification condition system rather error system accommodate one system handling exceptional situations various kinds whether fatal non-fatal whether continuable whether result program error simple resource limit stack overflow conditions signaled one point code may handled another point use term signal different typical operating system notion signals except lisp machines variant use term evolved operating system notion signaling scope committee consequently addressed ansi common lisp standard asynchronous interrupts ieee floating point trapping also scope committee work addressed standard kathy chapman chair drafting subcommittee responsible drafting actual standard document subcommittee oversaw efforts keep terminology consistent accurate throughout committee activities final standard produced x3j13 committee published american national standard x3.226 also hypertext form common lisp hyperspec book common lisp language although authored mostly guy l. steele jr. product ad hoc committee formed around 1980 worked collaboratively produce original de facto standard common lisp formation x3j13 x3j13 began work common lisp language base document proceeded design would become ansi common lisp steele served committee gave permission use parts first edition efforts documents published x3j13 later used together quotations certain committee members production common lisp language second edition released 1990 giving common lisp community way preview many features expected appear committee final standard document edition bears similarity standard content though form however substantive changes made form additions deletions publication book final draft ansi standard sum original edition common lisp language document x3j13 originally based work second edition contrast steele work committee product official status within x3j13 ansi acknowledged second edition preface authorized x3j13 choice content snapshot work progress formally synchronized x3j13 final version reviewed approved x3j13", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1375, + 1385, + 1388, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 1316, + "label": 3, + "text": "Auf_Wiedersehen_Monty:auf wiedersehen monty auf wiedersehen monty german goodbye monty computer game zx spectrum commodore 64 amstrad cpc msx commodore 16 released 1987 fourth monty series following monty innocent monty run successful original written peter harrap shaun hollingworth music rob hubbard ben daglish player controls monty travels around europe collecting money order buy greek island montos safely retire gameplay style flick-screen platform game similar many games 1980s technician ted jet set willy screens representing eiffel tower pyrenees bear relation real-life counterparts typical platform game screens auf wiedersehen monty contains many interesting features peculiarities player discover examples include suddenly attacked bull head spain collecting red cape presumably reference bullfighting car dropped one two places entering screen representing d\u00fcsseldorf west germany chef hat found sweden reference swedish chef muppets fame also two rooms representing sweden subtitled bjorn borg record luxembourg collected makes monty breakdance game title music may reference radio luxembourg possible get areas game quickly flying airport using air tickets collected throughout game parts game reached manner well money miscellaneous objects collect game points important need certain number points get montos often particular country monty visiting berets france bottles wine glass beer west germany cause monty briefly become drunk control become slightly erratic leading reversal controls repeated jumping monty climbing ladders drainpipes encounters moley christmas released later year monty mole game called impossamole released 1990 took different form previous games console-style arcade game", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1317, + "label": 4, + "text": "Computer_forensics:computer forensics computer forensics also known computer forensic science branch digital forensic science pertaining evidence found computers digital storage media goal computer forensics examine digital media forensically sound manner aim identifying preserving recovering analyzing presenting facts opinions digital information although often associated investigation wide variety computer crime computer forensics may also used civil proceedings discipline involves similar techniques principles data recovery additional guidelines practices designed create legal audit trail evidence computer forensics investigations usually subjected guidelines practices digital evidence used number high-profile cases becoming widely accepted reliable within u.s. european court systems early 1980s personal computers became accessible consumers leading increased use criminal activity example help commit fraud time several new computer crimes recognized cracking discipline computer forensics emerged time method recover investigate digital evidence use court since computer crime computer related crime grown jumped 67 2002 2003 today used investigate wide variety crime including child pornography fraud espionage cyberstalking murder rape discipline also features civil proceedings form information gathering example electronic discovery forensic techniques expert knowledge used explain current state digital artifact computer system storage medium e.g hard disk cd-rom electronic document e.g email message jpeg image scope forensic analysis vary simple information retrieval reconstructing series events 2002 book computer forensics authors kruse heiser define computer forensics involving preservation identification extraction documentation interpretation computer data go describe discipline art science indicating forensic methodology backed flexibility extensive domain knowledge however several methods used extract evidence given computer strategies used law enforcement fairly rigid lack flexibility found civilian world court computer forensic evidence subject usual requirements digital evidence requires information authentic reliably obtained admissible different countries specific guidelines practices evidence recovery united kingdom examiners often follow association chief police officers guidelines help ensure authenticity integrity evidence voluntary guidelines widely accepted british courts computer forensics used evidence criminal law since mid-1980s notable examples include computer forensic investigations usually follow standard digital forensic process phases acquisition examination analysis reporting investigations performed static data i.e acquired images rather live systems change early forensic practices lack specialist tools led investigators commonly working live data number techniques used computer forensics investigations much written many techniques used law enforcement particular seizing evidence machine still active information stored solely ram recovered powering may lost one application live analysis recover ram data example using microsoft cofee tool windd windowsscope prior removing exhibit captureguard gateway bypasses windows login locked computers allowing analysis acquisition physical memory locked computer ram analyzed prior content power loss electrical charge stored memory cells takes time dissipate effect exploited cold boot attack length time data recoverable increased low temperatures higher cell voltages holding unpowered ram \u221260 \u00b0c helps preserve residual data order magnitude improving chances successful recovery however impractical field examination tools needed extract volatile data however require computer forensic lab maintain legitimate chain evidence facilitate work machine necessary law enforcement applies techniques move live running desktop computer include mouse jiggler moves mouse rapidly small movements prevents computer going sleep accidentally usually uninterruptible power supply ups provides power transit however one easiest ways capture data actually saving ram data disk various file systems journaling features ntfs reiserfs keep large portion ram data main storage media operation page files reassembled reconstruct ram time number open source commercial tools exist computer forensics investigation typical forensic analysis includes manual review material media reviewing windows registry suspect information discovering cracking passwords keyword searches topics related crime extracting e-mail pictures review several computer forensics certifications available isfce certified computer examiner digital forensics investigation professional dfip iacrb certified computer forensics examiner top vendor independent certification especially within eu considered ccfp certified cyber forensics professional others worth mention usa apac iacis international association computer investigative specialists offers certified computer forensic examiner cfce program isfcs international society forensic computer examiners\u00ae offers certified computer examiner cce program asian school cyber laws offers international level certifications digital evidence analysis digital forensic investigation courses available online class room mode many commercial based forensic software companies also offering proprietary certifications products example guidance software offering ence certification tool encase accessdata offering ace certification tool ftk passmark software offering oce certification tool osforensics x-ways software technology offering x-pert certification software x-ways forensics", + "neighbors": [ + 171, + 289, + 295, + 326, + 393, + 463, + 528, + 747, + 875, + 1138, + 1358 + ], + "mask": "Test" + }, + { + "node_id": 1318, + "label": 2, + "text": "BSD_licenses:bsd licenses bsd licenses family permissive free software licenses imposing minimal restrictions use distribution covered software contrast copyleft licenses share-alike requirements original bsd license used namesake berkeley software distribution bsd unix-like operating system original version since revised descendants referred modified bsd licenses bsd license class license generally referred bsd-like modified bsd license wide use today similar license originally used bsd version unix bsd license simple license merely requires code retain bsd license notice redistributed source code format reproduce notice redistributed binary format bsd license unlike licenses require source code distributed addition original 4-clause license used bsd several derivative licenses emerged also commonly referred bsd license today typical bsd license 3-clause version revised original 4-clause version bsd licenses following codice_1 organization codice_2 codice_2 codice_4 year copyright published bsd codice_2 regents university california codice_1 university california berkeley releases bsd prior adoption 4-clause bsd license used license clearly ancestral 4-clause bsd license releases include 4.3bsd-tahoe 1988 net/1 1989 although largely replaced 4-clause license license found 4.3bsd-reno net/2 4.4bsd-alpha original bsd license contained clause found later licenses known advertising clause clause eventually became controversial required authors works deriving bsd-licensed work include acknowledgment original source advertising material clause number 3 original license text clause objected grounds people changed license reflect name organization led escalating advertising requirements programs combined together software distribution every occurrence license different name required separate acknowledgment arguing richard stallman stated counted 75 acknowledgments 1997 version netbsd addition clause presented legal problem wishing publish bsd-licensed software relies upon separate programs using gnu gpl advertising clause incompatible gpl allow addition restrictions beyond already imposes gpl publisher free software foundation recommends developers use license though states reason use software already using today original license sometimes called bsd-old 4-clause bsd advertising clause removed license text official bsd william hoskins director office technology licensing uc berkeley bsd distributions removed clause many similar clauses remain bsd-derived code sources unrelated code using derived license original license sometimes referred bsd-old resulting 3-clause version sometimes referred bsd-new names include new bsd revised bsd bsd-3 3-clause bsd version vetted open source license osi bsd license free software foundation refers license modified bsd license states compatible gnu gpl fsf encourages users specific referring license name i.e simply referring bsd license bsd-style avoid confusion original bsd license version allows unlimited redistribution purpose long copyright notices license disclaimers warranty maintained license also contains clause restricting use names contributors endorsement derived work without specific permission even simplified version come use primarily known usage freebsd use early april 29 1999 likely well primary difference new bsd 3-clause license omits non-endorsement clause also adds disclaimer views opinions expressed software free software foundation refers license freebsd license states compatible gnu gpl addition fsf encourages users specific referring license name i.e simply referring bsd license bsd-style modified/new bsd license avoid confusion original bsd license projects netbsd use similar 2-clause license without additional disclaimer version vetted open source license osi simplified bsd license isc license functionally equivalent endorsed openbsd project license template new contributions formerly known free public license 1.0.0 bsd 0-clause license spdx 0bsd goes 2-clause license dropping requirements include copyright notice license text disclaimer either source binary forms freebsd project argues advantages bsd-style licenses companies commercial use-cases due license compatibility proprietary licenses general flexibility stating bsd-style licenses place minimal restrictions future behavior n't legal time-bombs unlike copyleft licenses bsd license allows proprietary use allows software released license incorporated proprietary products works based material may released proprietary license closed source software allowing usual commercial usages 3-clause bsd license like permissive licenses compatible almost foss licenses well proprietary licenses two variants license new bsd license/modified bsd license 3-clause simplified bsd license/freebsd license 2-clause verified gpl-compatible free software licenses free software foundation vetted open source licenses open source initiative original 4-clause bsd license accepted open source license although original considered free software license fsf fsf consider compatible gpl due advertising clause bsd license family one oldest broadly used license family foss ecosystem also many new licenses derived inspired bsd licenses many foss software projects use bsd license instance bsd os family freebsd etc google bionic toybox bsd 3-clause license ranked popularity number five according black duck software sixth according github data", + "neighbors": [ + 42, + 58, + 101, + 106, + 116, + 117, + 134, + 160, + 176, + 210, + 216, + 313, + 331, + 372, + 473, + 500, + 569, + 631, + 682, + 805, + 806, + 812, + 864, + 897, + 899, + 901, + 948, + 962, + 974, + 1003, + 1006, + 1057, + 1126, + 1138, + 1167, + 1218, + 1225, + 1227, + 1235, + 1278, + 1288, + 1301, + 1311, + 1397, + 1401, + 1509, + 1521, + 1534, + 1538, + 1558, + 1578, + 1582, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1319, + "label": 9, + "text": "High-level_programming_language:high-level programming language computer science high-level programming language programming language strong abstraction details computer contrast low-level programming languages may use natural language elements easier use may automate even hide entirely significant areas computing systems e.g memory management making process developing program simpler understandable using lower-level language amount abstraction provided defines high-level programming language 1960s high-level programming languages using compiler commonly called autocodes examples autocodes cobol fortran first high-level programming language designed computers plankalk\u00fcl created konrad zuse however implemented time original contributions largely isolated developments due world war ii aside language influence superplan language heinz rutishauser also degree algol first significantly widespread high-level language fortran machine-independent development ibm earlier autocode systems algol defined 1958 1960 committees european american computer scientists introduced recursion well nested functions lexical scope also first language clear distinction value name-parameters corresponding semantics algol also introduced several structured programming concepts while-do if-then-else constructs syntax first described formal notation \u2013 backus\u2013naur form bnf roughly period cobol introduced records also called structs lisp introduced fully general lambda abstraction programming language first time high-level language refers higher level abstraction machine language rather dealing registers memory addresses call stacks high-level languages deal variables arrays objects complex arithmetic boolean expressions subroutines functions loops threads locks abstract computer science concepts focus usability optimal program efficiency unlike low-level assembly languages high-level languages language elements translate directly machine native opcodes features string handling routines object-oriented language features file input/output may also present one thing note high-level programming languages languages allow programmer detached separated machine unlike low-level languages like assembly machine language high-level programming amplify programmer instructions trigger lot data movements background without knowledge responsibility power executing instructions handed machine programmer high-level languages intend provide features standardize common tasks permit rich debugging maintain architectural agnosticism low-level languages often produce efficient code optimization specific system architecture abstraction penalty cost high-level programming techniques pay unable optimize performance use certain hardware n't take advantage certain low-level architectural resources high-level programming exhibits features like generic data structures operations run-time interpretation intermediate code files often result execution far operations necessary higher memory consumption larger binary program size reason code needs run particularly quickly efficiently may require use lower-level language even higher-level language would make coding easier many cases critical portions program mostly high-level language hand-coded assembly language leading much faster efficient simply reliably functioning optimised program however growing complexity modern microprocessor architectures well-designed compilers high-level languages frequently produce code comparable efficiency low-level programmers produce hand higher abstraction may allow powerful techniques providing better overall results low-level counterparts particular settings high-level languages designed independent specific computing system architecture facilitates executing program written language computing system compatible support interpreted jit program high-level languages improved designers develop improvements cases new high-level languages evolve one others goal aggregating popular constructs new improved features example scala maintains backward compatibility java means programs libraries written java continue usable even programming shop switches scala makes transition easier lifespan high-level coding indefinite contrast low-level programs rarely survive beyond system architecture written without major revision engineering 'trade-off 'abstraction penalty examples high-level programming languages active use today include python visual basic delphi perl php ecmascript ruby c java many others terms high-level low-level inherently relative decades ago c language similar languages often considered high-level supported concepts expression evaluation parameterised recursive functions data types structures assembly language considered low-level today many programmers might refer c low-level lacks large runtime-system garbage collection etc basically supports scalar operations provides direct memory addressing therefore readily blends assembly language machine level cpus microcontrollers assembly language may regarded higher level often still one-to-one used without macros representation machine code supports concepts constants limited expressions sometimes even variables procedures data structures machine code turn inherently slightly higher level microcode micro-operations used internally many processors three general modes execution modern high-level languages note languages strictly interpreted languages compiled languages rather implementations language behavior use interpreting compiling example algol 60 fortran interpreted even though typically compiled similarly java shows difficulty trying apply labels languages rather implementations java compiled bytecode executed either interpreting java virtual machine jvm compiling typically just-in-time compiler hotspot jvm moreover compiling transcompiling interpreting strictly limited description compiler artifact binary executable il assembly alternatively possible high-level language directly implemented computer \u2013 computer directly executes hll code known high-level language computer architecture \u2013 computer architecture designed targeted specific high-level language burroughs large systems target machines algol 60 example", + "neighbors": [ + 53, + 65, + 78, + 117, + 246, + 249, + 292, + 306, + 313, + 347, + 378, + 388, + 396, + 509, + 538, + 579, + 589, + 592, + 682, + 756, + 789, + 806, + 919, + 948, + 1009, + 1044, + 1221, + 1225, + 1227, + 1231, + 1232, + 1235, + 1264, + 1311, + 1320, + 1324, + 1372, + 1398, + 1413, + 1457, + 1483, + 1511, + 1532, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1320, + "label": 9, + "text": "Low-level_programming_language:low-level programming language low-level programming language programming language provides little abstraction computer instruction set architecture\u2014commands functions language map closely processor instructions generally refers either machine code assembly language word low refers small nonexistent amount abstraction language machine language low-level languages sometimes described close hardware programs written low-level languages tend relatively non-portable low-level languages convert machine code without compiler interpreter \u2013 second-generation programming languages use simpler processor called assembler \u2013 resulting code runs directly processor program written low-level language made run quickly small memory footprint equivalent program high-level language less efficient use memory low-level languages simple considered difficult use due numerous technical details programmer must remember comparison high-level programming language isolates execution semantics computer architecture specification program simplifies development low-level programming languages sometimes divided two categories first generation second generation machine code language computer process directly without previous transformation currently programmers almost never write programs directly machine code requires attention numerous details high-level language handles automatically furthermore requires memorizing looking numerical codes every instruction extremely difficult modify true machine code stream raw usually binary data programmer coding machine code normally codes instructions data readable form decimal octal hexadecimal translated internal format program called loader toggled computer memory front panel although programs written machine language programmers often become adept reading working core dumps debugging front panel example function hexadecimal representation 32-bit x86 machine code calculate n th fibonacci number second-generation languages provide one abstraction level top machine code early days coding computers like tx-0 pdp-1 first thing mit hackers write assemblers assembly language little semantics formal specification mapping human-readable symbols including symbolic addresses opcodes addresses numeric constants strings typically one machine instruction represented one line assembly code assemblers produce object files link object files loaded assemblers provide macros generate common sequences instructions example fibonacci number calculator x86 assembly language using masm syntax code example hardware features x86 processor registers named manipulated directly function loads input precise location stack 8 bytes higher location stored esp stack pointer performs calculation manipulating values eax ebx ecx edx registers finished returns note assembly language concept returning value result stored eax register ret command simply moves code processing code location stored stack usually instruction immediately one called function author calling code know function stores result eax retrieve x86 assembly language imposes standard returning values function fact concept function calling code examine state procedure returns needs extract value compare function c code similar structure assembly language example significant differences terms abstraction abstractions make c code compilable without modification architecture c compiler written x86 assembly language code specific x86 architecture late 1960s high-level languages pl/s bliss bcpl extended algol burroughs large systems c included degree access low-level programming functions one method inline assembly assembly code embedded high-level language supports feature languages also allow architecture-dependent compiler optimization directives adjust way compiler uses target processor architecture", + "neighbors": [ + 29, + 53, + 78, + 85, + 246, + 292, + 306, + 378, + 386, + 396, + 435, + 592, + 752, + 756, + 821, + 940, + 1044, + 1319, + 1324, + 1437, + 1511, + 1532, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1321, + "label": 4, + "text": "IFolder:ifolder ifolder open-source application developed novell inc. intended allow cross-platform file sharing across computer networks ifolder operates concept shared folders folder marked shared contents folder synchronized computers network either directly computers peer-to-peer fashion server intended allow single user synchronize files different computers example work computer home computer share files users example group people collaborating project core ifolder actually project called simias simias actually monitors files changes synchronizes changes controls access permissions folders actual ifolder clients including graphical desktop client web client developed separate programs communicate simias back-end originally conceived developed pgsoft company taken novell 2000 ifolder announced novell march 19 2001 released june 29 2001 software package windows nt/2000 novell netware 5.1 included forthcoming novell netware 6.0 also included ability access shared files web browser ifolder professional edition 2 announced march 13 2002 released month later added support linux solaris web access support windows ce palm os edition also designed share files millions users large companies increased reporting features administrators 2003 ifolder codie award march 22 2004 purchase linux software companies ximian suse novell announced releasing ifolder open source project gpl license also announced open source version ifolder would use mono framework effort ease development ifolder 3.0 released june 22 2005 march 31 2006 novell announced ifolder enterprise server open source april 2 2009 novell released ifolder 3.7.2 included mac client 10.4 10.5 well windows vista client addition improved client lineup version supports ssl ldapgroup support auto-account creation ifolder merge enhanced web access administration ifolder.com website completely redesigned references earlier versions nov 25 2009 novell released ifolder 3.8", + "neighbors": [ + 134, + 494, + 505, + 545, + 552, + 646, + 796, + 813, + 961, + 1138, + 1287 + ], + "mask": "Test" + }, + { + "node_id": 1322, + "label": 6, + "text": "ZFS:zfs zfs combined file system logical volume manager designed sun microsystems zfs scalable includes extensive protection data corruption support high storage capacities efficient data compression integration concepts filesystem volume management snapshots copy-on-write clones continuous integrity checking automatic repair raid-z native nfsv4 acls precisely configured two main implementations oracle openzfs project extremely similar making zfs widely available within unix-like systems zfs name stands nothing\u2014briefly assigned backronym zettabyte file system longer considered initialism originally zfs proprietary closed-source software developed internally sun part solaris team led cto sun storage business unit sun fellow jeff bonwick 2005 bulk solaris including zfs licensed open-source software common development distribution license cddl opensolaris project zfs became standard feature solaris 10 june 2006 2010 sun microsystems acquired oracle zfs became registered trademark belonging oracle oracle stopped releasing updated source code new opensolaris zfs development effectively reverting oracle zfs closed source response illumos project founded maintain enhance existing open source solaris 2013 openzfs founded coordinate development open source zfs openzfs maintains manages core zfs code organizations using zfs maintain specific code validation processes required zfs integrate within systems openzfs widely used unix-like systems 2017 one analyst described openzfs proven open source data-validating enterprise file system management stored data generally involves two aspects physical volume management one block storage devices hard drives sd cards organization logical block devices seen operating system often involving volume manager raid controller array manager suitable device driver management data files stored logical block devices file system data storage zfs unusual unlike storage systems unifies roles acts volume manager file system therefore complete knowledge physical disks volumes including condition status logical arrangement volumes also files stored zfs designed ensure subject suitable hardware data stored disks lost due physical errors misprocessing hardware operating system bit rot events data corruption may happen time complete control storage system used ensure every step whether related file management disk management verified confirmed corrected needed optimized way storage controller cards separate volume file managers achieve zfs also includes mechanism dataset pool level snapshots replication including snapshot cloning described freebsd documentation one powerful features features even file systems snapshot functionality lack large numbers snapshots taken without degrading performance allowing snapshots used prior risky system operations software changes entire production live file system fully snapshotted several times hour order mitigate data loss due user error malicious activity snapshots rolled back live previous file system states viewed even large file systems leading savings comparison formal backup restore processes snapshots also cloned form new independent file systems pool level snapshot known checkpoint available allows rollback operations may affect entire pool structure add remove entire datasets examples features specific zfs include unlike many file systems zfs intended work towards specific aims primary targets enterprise standard data management commercial environments hardware capable supporting zfs capabilities data resilience resources needed serve data efficiently system configuration poorly matched zfs zfs may underperform significantly 2017 zfs benchmarks zfs developers calomel stated common system design failures include zfs acts volume manager file system terminology layout zfs storage covers two aspects many terms particular zfs list covers zfs commands allow examination physical storage terms devices vdevs organized data pools stored across vdevs various ways various commands expose in-depth statistics zfs internal status internal performance/statistics data allow settings optimized physical devices used zfs hard drives hdds ssds organized groups known vdevs virtual devices used store data vdevs fundamental part zfs conceived groups disks provide redundancy failure physical devices vdev must able maintain integrity data holds must contain enough disks risk data loss within acceptably tiny vdev become unreadable due disk errors otherwise entire pool part also fail see data recovery vdev one vdev acts independent unit redundant storage devices might vdev unused spare disks disks formatted non-zfs filing systems offline disks cache devices physical structure pool defined configuring many vdevs type adding pool zfs exposes manages individual disks within system well vdevs pools datasets volumes organized within pool data automatically distributed zfs across vdevs making pool zfs stripes data pool across vdevs pool speed efficiency vdev user defines completely independent every vdev different types vdev mixed arbitrarily single zfs system data redundancy required data protected physical device failure ensured user organize devices vdevs either using mirrored vdev raidz vdev data single device vdev may lost device develops fault data mirrored raidz vdev lost enough disks fail time system resilvered replacements due recent disk failures zfs vdev continue function service capable providing least one copy data stored although may become slower due error fixing resilvering part self-repair data integrity processes however zfs designed become unreasonably slow due self-repair unless directed administrator since one goals capable uninterrupted continual use even self checking self repair since zfs device redundancy vdev level also means pool stored across several vdevs one vdevs completely fails entire pool content lost similar raid redundancy systems require data stored capable reconstruction enough devices ensure data unlikely lost due physical devices failing therefore intended vdevs made either mirrored devices raidz array devices sufficient redundancy important data zfs automatically limit possible avoid data loss device fails backups replication also expected part data protection vdevs manipulated active use single disk additional devices added create mirrored vdev mirrored vdev physical devices added removed leave larger smaller number mirrored devices single device raidz vdev converted mirror although additional vdevs always added expand storage capacity kind including raidz device vdev marked removal zfs de-allocate data allow removed replaced note devices vdev size zfs may use full capacity disks vdev larger others applies devices within single vdev vdevs independent zfs care different vdevs different sizes built different devices also vdev shrunk size common set aside small amount unused space example 1-2gb multi-tb disk disk needs replacing possible allow slight manufacturing variances replace another disk nominal capacity slightly smaller actual capacity addition devices used main data storage zfs also allows manages devices used caching purposes single devices multiple mirrored devices fully dedicated type cache designated cache usage detailed settings fully deleted created modified without limit live use list zfs cache types given zfs handle devices formatted partitions certain purposes common use generally caches data pools given complete devices multiple complete devices top level data management zfs pool zpool zfs system multiple pools defined vdevs used pool specified pool created others added later zfs use specified vdevs maximize performance storing data \u2013 form striping across vdevs therefore important ensure vdev sufficiently redundant loss vdev pool would cause loss pool striping zfs pool expanded time adding new vdevs including system 'live storage space vdevs already allocated pool shrunk data stored across vdevs pool even yet full however explained individual vdevs modified time within stated limits new vdevs added time since addition removal mirrors marking redundant disk offline affect ability vdev store data within pools zfs recognizes two types data store since volumes presented block devices also formatted file system add zfs features file system although usual practice example zfs volume created block device presents partitioned formatted file system ext4 ntfs done either locally network using iscsi similar resulting file system accessible normal also gain zfs benefits data resilience data integrity/scrubbing snapshots additional option data compression snapshots integral feature zfs provide immutable read copies file system single point time even large file systems snapshotted many times every hour sustain tens thousands snapshots snapshot versions individual files entire dataset pool easily accessed searched restored entire snapshot cloned create new copy copied separate server replicated backup pool dataset quickly rolled back specific snapshot snapshots also compared current data check modified data.snapshots take much disk space data deleted space marked free data longer referenced current system snapshot snapshots also easy way avoid impact ransomware generally zfs expect reduce size pool tools reduce set vdevs pool stored tools remove vdevs rolled oracle zfs also exist derivatives openzfs yet generally released openzfs platforms generally therefore 2018 remove entire vdev active use reduce size pool data stored must moved another pool temporary copy made easier deleted later restored backups/copies devices making vdev freed use pool deleted recreated using fewer vdevs smaller size additional capacity added pool time simply adding devices needed defining unused devices vdevs adding new vdevs pool capacity individual vdev generally fixed defined one exception rule single drive mirrored vdevs expanded larger smaller capacities without affecting vdev operation adding larger disks replacing/removing smaller disks shown example pool expanded unused space datasets volumes within pool likewise expanded use unused pool space datasets need fixed size dynamically grow data stored volumes block devices need size defined user must manually resized required done 'live resizing example one major feature distinguishes zfs file systems designed focus data integrity protecting user data disk silent data corruption caused data degradation current spikes bugs disk firmware phantom writes previous write make disk misdirected reads/writes disk accesses wrong block dma parity errors array server memory driver since checksum validates data inside array driver errors data winds wrong buffer inside kernel accidental overwrites swapping live file system etc 1999 study showed neither then-major widespread filesystems ufs ext xfs jfs ntfs hardware raid issues data integrity provided sufficient protection data corruption problems initial research indicates zfs protects data better earlier efforts also faster ufs seen replacement within zfs data integrity achieved using fletcher-based checksum sha-256 hash throughout file system tree block data checksummed checksum value saved pointer block\u2014rather actual block next block pointer checksummed value saved pointer checksumming continues way file system data hierarchy root node also checksummed thus creating merkle tree in-flight data corruption phantom reads/writes data written/read checksums correctly actually wrong undetectable filesystems store checksum data zfs stores checksum block parent block pointer entire pool self-validates block accessed regardless whether data meta-data checksum calculated compared stored checksum value checksums match data passed programming stack process asked values match zfs heal data storage pool provides data redundancy internal mirroring assuming copy data undamaged matching checksums optionally possible provide additional in-pool redundancy specifying means data stored twice three times disk effectively halving reducing one third storage capacity disk additionally kinds data used zfs manage pool stored multiple times default safety even default copies=1 setting copies damaged data exist reconstructed checksums parity data zfs use copy data recreate via raid recovery mechanism recalculate checksum\u2014ideally resulting reproduction originally expected value data passes integrity check system update faulty copies known-good data redundancy restored consistency data held memory cached data arc checked default zfs expected run enterprise quality hardware error correcting ram capability check in-memory data exists enabled using debug flags zfs able guarantee data integrity needs multiple copies data usually spread across multiple disks typically achieved using either raid controller so-called soft raid built file system zfs work hardware raid devices zfs usually work efficiently greater protection data raw access storage devices disks connected system using hardware firmware soft raid controller modifies usual zfs-to-disk i/o path zfs relies disk honest view determine moment data confirmed safely written numerous algorithms designed optimize use caching cache flushing disk handling third-party device performs caching presents drives zfs single system without low level view zfs relies upon much greater chance system perform less optimally failure preventable zfs quickly fully recovered zfs example hardware raid card used zfs may able determine condition disks whether raid array degraded rebuilding may know data corruption place data optimally across disks make selective repairs control repairs balanced ongoing use may able make repairs even could usually hardware raid card interfere raid controllers also usually add controller-dependent data drives prevents software raid accessing user data possible read data compatible hardware raid controller n't always possible controller card develops fault replacement may available cards may understand manufacturer custom data needed manage restore array new card therefore unlike systems raid cards similar used offload resources processing enhance performance reliability zfs strongly recommended methods used typically reduce system performance reliability disks must connected raid controller recommended use plain hba host adapter fanout card configure card jbod mode i.e turn raid caching functions allow devices attached zfs-to-disk i/o pathway unchanged raid card jbod mode may still interfere cache depending upon design may detach drives respond time seen many energy-efficient consumer-grade hard drives may require time-limited error recovery tler /cctl/erc-enabled drives prevent drive dropouts cards suitable even raid functions disabled instead hardware raid zfs employs soft raid offering raid-z parity based like raid 5 similar disk mirroring similar raid 1 schemes highly flexible raid-z data/parity distribution scheme like raid-5 uses dynamic stripe width every block raid stripe regardless blocksize resulting every raid-z write full-stripe write combined copy-on-write transactional semantics zfs eliminates write hole error raid-z also faster traditional raid 5 need perform usual read-modify-write sequence stripes different sizes raid-z reconstruction traverse filesystem metadata determine actual raid-z geometry would impossible filesystem raid array separate products whereas becomes feasible integrated view logical physical structure data going metadata means zfs validate every block 256-bit checksum goes whereas traditional raid products usually addition handling whole-disk failures raid-z also detect correct silent data corruption offering self-healing data reading raid-z block zfs compares checksum data disks return right answer zfs reads parity figures disk returned bad data repairs damaged data returns good data requestor raid-z mirroring require special hardware need nvram reliability need write buffering good performance data protection raid-z zfs provides fast reliable storage using cheap commodity disks five different raid-z modes raid-z0 similar raid 0 offers redundancy raid-z1 similar raid 5 allows one disk fail raid-z2 similar raid 6 allows two disks fail raid-z3 raid 7 configuration allows three disks fail mirroring similar raid 1 allows one disk fail need raid-z3 arose early 2000 muti-terabyte capacity drives became common increase capacity without corresponding increase throughput speeds meant rebuilding array due failed drive could take weeks even months complete time older disks array stressed additional workload could result data corruption drive failure increasing parity raid-z3 reduces chance data loss simply increasing redundancy zfs tool equivalent fsck standard unix linux data checking repair tool file systems instead zfs built-in scrub function regularly examines data repairs silent corruption problems differences official recommendation sun/oracle scrub enterprise-level disks month cheaper commodity disks week zfs 128-bit file system address 1.84 \u00d7 10 times data 64-bit systems btrfs maximum limits zfs designed large never encountered practice instance fully populating single zpool 2 bits data would require 3\u00d710 tb hard disk drives theoretical limits zfs oracle solaris encryption capability zfs embedded i/o pipeline writes block may compressed encrypted checksummed deduplicated order policy encryption set dataset level datasets file systems zvols created wrapping keys provided user/administrator changed time without taking file system offline default behaviour wrapping key inherited child data sets data encryption keys randomly generated dataset creation time descendant datasets snapshots clones share data encryption keys command switch new data encryption key clone time provided\u2014this re-encrypt already existing data instead utilising encrypted master-key mechanism zfs automatically allocate data storage across vdevs pool devices vdev way generally maximises performance pool zfs also update write strategy take account new disks added pool added general rule zfs allocates writes across vdevs based free space vdev ensures vdevs proportionately less data already given writes new data stored helps ensure pool becomes used situation develop vdevs become full forcing writes occur limited number devices also means data read reads much frequent writes uses different parts data read many disks possible time giving much higher read performance therefore general rule pools vdevs managed new storage added situation arise vdevs pool almost full others almost empty make pool less efficient pools hot spares compensate failing disks mirroring block devices grouped according physical chassis filesystem continue case failure entire chassis storage pool composition limited similar devices consist ad-hoc heterogeneous collections devices zfs seamlessly pools together subsequently doling space needed arbitrary storage device types added existing pools expand size storage capacity vdevs available file system instances zpool quota set limit amount space file system instance occupy reservation set guarantee space available file system instance zfs uses different layers disk cache speed read write operations ideally data stored ram usually expensive therefore data automatically cached hierarchy optimize performance versus cost often called hybrid storage pools frequently accessed data stored ram less frequently accessed data stored slower media solid state drives ssds data often accessed cached left slow hard drives old data suddenly read lot zfs automatically move ssds ram zfs caching mechanisms include one reads writes case two levels caching exist one computer memory ram one fast storage usually solid state drives ssds total four caches number caches cache divisions queues also exist within zfs example vdev data cache arc cache divided data stored user metadata used zfs control balance zfs uses copy-on-write transactional object model block pointers within filesystem contain 256-bit checksum 256-bit hash currently choice fletcher-2 fletcher-4 sha-256 target block verified block read blocks containing active data never overwritten place instead new block allocated modified data written metadata blocks referencing similarly read reallocated written reduce overhead process multiple updates grouped transaction groups zil intent log write cache used synchronous write semantics required blocks arranged tree checksums see merkle signature scheme advantage copy-on-write zfs writes new data blocks containing old data retained allowing snapshot version file system maintained zfs snapshots consistent reflect entire data existed single point time created extremely quickly since data composing snapshot already stored entire storage pool often snapshotted several times per hour also space efficient since unchanged data shared among file system snapshots snapshots inherently read-only ensuring modified creation although relied sole means backup entire snapshots restored also files directories within snapshots writeable snapshots clones also created resulting two independent file systems share set blocks changes made clone file systems new data blocks created reflect changes unchanged blocks continue shared matter many clones exist implementation copy-on-write principle zfs file systems moved pools also remote hosts network send command creates stream representation file system state stream either describe complete contents file system given snapshot delta snapshots computing delta stream efficient size depends number blocks changed snapshots provides efficient strategy e.g. synchronizing offsite backups high availability mirrors pool dynamic striping across devices maximize throughput means additional devices added zpool stripe width automatically expands include thus disks pool used balances write load across zfs uses variable-sized blocks 128 kb default size available features allow administrator tune maximum block size used certain workloads perform well large blocks data compression enabled variable block sizes used block compressed fit smaller block size smaller size used disk use less storage improve io throughput though cost increased cpu use compression decompression operations zfs filesystem manipulation within storage pool easier volume manipulation within traditional filesystem time effort required create expand zfs filesystem closer making new directory volume manipulation systems pools associated zfs file systems moved different platform architectures including systems implementing different byte orders zfs block pointer format stores filesystem metadata endian-adaptive way individual metadata blocks written native byte order system writing block reading stored endianness match endianness system metadata byte-swapped memory affect stored data usual posix systems files appear applications simple arrays bytes applications creating reading data remain responsible way independent underlying system endianness data deduplication capabilities added zfs source repository end october 2009 relevant opensolaris zfs development packages available since december 3 2009 build 128 effective use deduplication may require large ram capacity recommendations range 1 5 gb ram every tb storage accurate assessment memory required deduplication made referring number unique blocks pool number bytes disk ram core required store record figures reported inbuilt commands zpool zdb insufficient physical memory lack zfs cache result virtual memory thrashing using deduplication cause performance plummet result complete memory starvation deduplication occurs write-time also cpu-intensive also significantly slow system storage vendors use modified versions zfs achieve high data compression ratios two examples 2012 greenbytes tegile may 2014 oracle bought greenbytes zfs deduplication replication technology described deduplication usually recommended due heavy resource requirements especially ram impact performance especially writing specific circumstances system data well-suited space-saving technique authors 2010 study examined ability file systems detect prevent data corruption particular focus zfs observed zfs effective detecting correcting data errors storage devices assumes data ram safe prone error study comments single bit flip memory causes small non-negligible percentage runs experience failure probability committing bad data disk varying 0 3.6 according workload zfs caches pages stores copies metadata ram holds data dirty cache writing disk test made whether checksums still match data point use much risk mitigated one two ways zfs protect data disk failure needs configured redundant storage either raid-z mirrored data copied least two disks single disk used redundant copies data enabled duplicates data logical drive far less safe since vulnerable failure single disk using zfs copies good feature use notebooks desktop computers since disks large least provides limited redundancy single drive historically zfs shipped tools fsck repair damaged file systems file system designed self-repair long built sufficient attention design storage redundancy data pool compromised poor hardware inadequate design redundancy unfortunate mishap point zfs unable mount pool traditionally tools allowed end-user attempt partial salvage stored data led threads online forums zfs developers sometimes tried provide ad-hoc help home small scale users facing loss data due inadequate design poor system management modern zfs improved considerably situation time continues zfs part sun solaris operating system thus available sparc x86-based systems oracle solaris 11 express release os/net consolidation main os code made proprietary closed-source zfs upgrades implementations inside solaris encryption compatible non-proprietary implementations use previous versions zfs creating new zfs pool retain ability use access pool non-proprietary solaris-based distributions recommended upgrade solaris 11 express opensolaris snv_134b thereby stay zfs version 28 opensolaris 2008.05 2008.11 2009.06 use zfs default filesystem dozen 3rd-party distributions nearly dozen mentioned openindiana illumos two new distributions included opensolaris distribution reference page openindiana uses openzfs feature flags implemented illumos zfs version 28 used version 151a3 upgrading opensolaris snv_134 openindiana solaris 11 express one also ability upgrade separately boot solaris 11 express zfs pool one install solaris 11 express first zfs incompatibilities introduced oracle past zfs version 28 openzfs osx abbreviated o3x implementation zfs macos o3x active development close relation zfs linux illumos zfs implementation maintaining feature flag compatibility zfs linux o3x implements zpool version 5000 includes solaris porting layer spl originally written maczfs enhanced include memory management layer based illumos kmem vmem allocators o3x fully featured supporting lz4 compression deduplication arc l2arc slog maczfs free software providing support zfs macos stable legacy branch provides zfs pool version 8 zfs filesystem version 2 development branch based zfs linux openzfs provides updated zfs functionality zfs zpool version 5000 feature flags proprietary implementation zfs zevo available cost greenbytes inc. implementing zfs file system version 5 zfs pool version 28 zevo offered limited zfs feature set pending commercial development sold oracle 2014 unknown future plans edward o'callaghan started initial port zfs dragonflybsd netbsd zfs port started part 2007 google summer code august 2009 code merged netbsd source tree pawe\u0142 jakub dawidek ported zfs freebsd part freebsd since version 7.0 includes zfsboot allows booting freebsd directly zfs volume freebsd zfs implementation fully functional missing features kernel cifs server iscsi latter added using externally available packages samba used provide userspace cifs server freebsd 7-stable updates series versions 7.x committed uses zpool version 6 freebsd 8 includes much-updated implementation zfs zpool version 13 supported zpool version 14 support added 8-stable branch january 11 2010 included freebsd release 8.1. zpool version 15 supported release 8.2 8-stable branch gained support zpool version v28 zfs version 5 early june 2011 changes released mid-april 2012 freebsd 8.3 freebsd 9.0-release uses zfs pool version 28 freebsd 9.2-release first freebsd version use new feature flags based implementation thus pool version 5000 midnightbsd desktop operating system derived freebsd supports zfs storage pool version 6 0.3-release derived code included freebsd 7.0-release update storage pool 28 progress 0.4-current based 9-stable sources around freebsd 9.1-release code trueos formerly known pc-bsd desktop-oriented distribution freebsd inherits zfs support freenas embedded open source network-attached storage nas distribution based freebsd zfs support freebsd pc-bsd zfs guru embedded open source network-attached storage nas distribution based freebsd pfsense open source bsd based router supports zfs including installation booting zfs pools version 2.4 nas4free embedded open source network-attached storage nas distribution based freebsd zfs support freebsd zfs storage pool version 5000 project continuation freenas 7 series project based freebsd kernel debian gnu/kfreebsd zfs support kernel however additional userland tools required possible zfs root /boot file system case required grub configuration performed debian installer since wheezy release 31 january 2013 zpool version available 14 squeeze release 28 wheezy-9 release although zfs filesystem supports linux-based operating systems difficulties arise linux distribution maintainers wishing provide native support zfs products due potential legal incompatibilities cddl license used zfs code gpl license used linux kernel enable zfs support within linux loadable kernel module containing cddl-licensed zfs code must compiled loaded kernel according free software foundation wording gpl license legally prohibits redistribution resulting product derivative work though viewpoint caused controversy one potential workaround licensing incompatibility trialed 2006 experimental port zfs code linux fuse system filesystem ran entirely userspace instead integrated linux kernel therefore considered derivative work kernel approach functional suffered significant performance penalties compared integrating filesystem native kernel module running kernel space 2016 zfs fuse project appears defunct native port zfs linux produced lawrence livermore national laboratory llnl released march 2013 following key events zfs linux uses openzfs pool version number 5000 indicates features supports defined via feature flags pool version unchanging number expected never conflict version numbers given oracle another native port linux developed kq infotech 2010 port used zvol implementation lawrence livermore national laboratory starting point release supporting zpool v28 announced january 2011 april 2011 kq infotech acquired stec inc. work zfs ceased source code port found github work kq infotech ultimately integrated llnl native port zfs linux license incompatibility may arise distribution compiled binaries containing zfs code generally agreed distribution source code affected gentoo configuring zfs root filesystem well documented required packages installed package repository slackware also provides documentation supporting zfs kernel module built kernel question cddl license compatibility gpl license resurfaced 2015 linux distribution ubuntu announced intended make precompiled openzfs binary kernel modules available end-users directly distribution official package repositories 2016 ubuntu announced legal review resulted conclusion providing support zfs via binary kernel module violation provisions gpl license others software freedom law center followed ubuntu conclusion fsf sfc reiterated opposing view ubuntu 16.04 lts xenial xerus released april 21 2016 allows user install openzfs binary packages directly ubuntu software repositories legal challenge brought canonical regarding distribution packages 2019 ubuntu support install zfs root filesystem maas allows zfs installed root filesystem port open source zfs attempted 2010 hiatus one year development ceased 2012 october 2017 new port openzfs announced j\u00f6rgen lundman openzfs developer summit list operating systems distributions add-ons support zfs zpool version supports solaris build based zfs designed implemented team sun led jeff bonwick bill moore matthew ahrens announced september 14 2004 development started 2001 source code zfs integrated main trunk solaris development october 31 2005 released part build 27 opensolaris november 16 2005 sun announced zfs included 6/06 update solaris 10 june 2006 one year opening opensolaris community name one point said stand zettabyte file system 2006 longer considered abbreviation zfs file system store 256 quadrillion zettabytes zb september 2007 netapp sued sun claiming zfs infringed netapp patents write anywhere file layout sun counter-sued october year claiming opposite lawsuits ended 2010 undisclosed settlement following list events development open-source zfs implementations first indication apple inc. interest zfs april 2006 post opensolaris.org zfs-discuss mailing list apple employee mentioned interested porting zfs mac os x operating system release version mac os x 10.5 zfs available read-only mode command line lacks possibility create zpools write 10.5 release apple released zfs beta seed v1.1 allowed read-write access creation zpools however installer zfs beta seed v1.1 reported work version 10.5.0 updated version 10.5.1 august 2007 apple opened zfs project mac os forge web site site apple provided source code binaries port zfs includes read-write access installer available third-party developer created one october 2009 apple announced shutdown zfs project mac os forge say hosting involvement zfs summarily discontinued explanation given following statement zfs project discontinued mailing list repository also removed shortly apple would eventually release legally required cddl-derived portion source code final public beta zfs code named 10a286 complete zfs support advertised feature snow leopard server mac os x server 10.6 however time operating system released references feature silently removed features page apple commented regarding omission apple 10a286 source code release versions previously released source binaries preserved new development adopted group enthusiasts maczfs project acted quickly mirror public archives apple project materials would disappeared internet resume development elsewhere maczfs community curated matured project supporting zfs mac os releases since 10.5 project active mailing list july 2012 maczfs implements zpool version 8 zfs version 2 october 2008 release solaris additional historical information commentary found maczfs web site faq 17th september 2013 launch openzfs included zfs-osx become new version maczfs distribution darwin zfs oracle solaris new features introduced version numbers pool file system incremented designate format features available features available specific file system versions require specific pool version distributed development openzfs involves feature flags pool version 5000 unchanging number expected never conflict version numbers given oracle legacy version numbers still exist pool versions 1\u201328 implied version 5000 illumos uses pool version 5000 purpose future on-disk format changes enabled disabled independently via feature flags note solaris version development sun since release solaris 10 2005 codenamed 'nevada derived opensolaris codebase 'solaris nevada codename next-generation solaris os eventually succeed solaris 10 new code pulled successively new opensolaris 'nevada snapshot builds opensolaris discontinued openindiana forked final build b134 opensolaris published oracle 2010-nov-12 upgrade path solaris 11 express", + "neighbors": [ + 33, + 34, + 38, + 40, + 55, + 58, + 63, + 85, + 101, + 116, + 121, + 134, + 189, + 209, + 210, + 222, + 227, + 233, + 272, + 278, + 290, + 293, + 295, + 323, + 326, + 334, + 349, + 352, + 358, + 377, + 395, + 399, + 429, + 438, + 477, + 494, + 495, + 524, + 551, + 553, + 557, + 558, + 570, + 596, + 696, + 723, + 728, + 770, + 804, + 854, + 887, + 892, + 899, + 900, + 908, + 912, + 922, + 942, + 945, + 982, + 992, + 997, + 1001, + 1006, + 1056, + 1064, + 1097, + 1099, + 1104, + 1124, + 1138, + 1157, + 1168, + 1189, + 1201, + 1202, + 1234, + 1252, + 1257, + 1278, + 1283, + 1288, + 1322, + 1334, + 1339, + 1366, + 1381, + 1397, + 1415, + 1445, + 1459, + 1521, + 1538, + 1565, + 1578, + 1582, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1323, + "label": 7, + "text": "Cloudera:cloudera cloudera inc. us-based software company provides software platform data engineering data warehousing machine learning analytics runs cloud premises cloudera started hybrid open-source apache hadoop distribution cdh cloudera distribution including apache hadoop targeted enterprise-class deployments technology cloudera states 50 engineering output donated upstream various apache-licensed open source projects apache spark apache hive apache avro apache hbase combine form apache hadoop platform cloudera also sponsor apache software foundation cloudera founded 2008 three engineers google yahoo facebook christophe bisciglia amr awadallah jeff hammerbacher respectively joined former oracle executive mike olson form cloudera 2008 olson ceo sleepycat software creator open-source embedded database engine berkeley db acquired oracle 2006 awadallah yahoo ran one first business units using apache hadoop data analysis facebook hammerbacher used hadoop building analytic applications involving massive volumes user data architect doug cutting also former chairman apache software foundation authored open-source lucene nutch search technologies mike cafarella wrote initial hadoop software 2004 designed managed hadoop storage analysis cluster yahoo joining cloudera 2009 chief operating officer kirk dunn 2015 march 2009 cloudera announced availability cloudera distribution including apache hadoop conjunction 5 million investment led accel partners 2011 company raised 40 million ignition partners accel partners greylock partners meritech capital partners in-q-tel venture capital firm open connections cia june 2013 tom reilly became chief executive although olson remained chairman board chief strategist reilly chief executive arcsight acquired hewlett-packard 2010 march 2014 cloudera announced 900 million funding round led intel capital 740 million intel received 18 share cloudera intel dropped hadoop distribution dedicated 70 intel engineers work exclusively cloudera projects additional funds came rowe price google ventures affiliate msd capital l.p. private investment firm michael s. dell others january 2012 oracle corporation announced partnership cloudera oracle big data appliance january 2013 dell announced partnership cloudera march 2013 intel invested 740 million cloudera 18 investment may 2013 sas institute announced partnership june 2014 accenture announced service offering based cloudera june 2014 cloudera acquired gazzang developed encryption key management software october 2014 cloudera announced first payment card industry data security standard pci mastercard february 2015 deloitte announced alliance cloudera may 2015 capgemini announced marketing program sap hana cloudera july 9 2015 cloudera announced partnership teradata september 2015 cloudera announced kudu storage manager september 2015 microsoft azure announced full support cloudera enterprise january 2016 tata consultancy services announced internet things framework based cloudera sensor data analytics february 2016 emc announces evolution advanced storage dssd support cloudera 2016 cloudera ranked 5 forbes cloud 100 list cloudera filed initial public offering march 2017 april 28 2017 shares listed new york stock exchange symbol cldr september 2017 cloudera acquired fast forward labs ffl leading machine learning applied artificial intelligence research development company effort deepen cloudera \u2019 expertise application machine learning practical business problems new division headed ffl co-founder ceo hilary mason october 2018 cloudera hortonworks announced would merging all-stock merger equals.. merger completed january 2019 cloudera offers software services support five bundles available on-premise across multiple cloud providers cloudera also offers managed-service offering cloud cloudera also offers following free software versions additional technologies addition open-source distribution", + "neighbors": [ + 178, + 211, + 318, + 755, + 1246 + ], + "mask": "Test" + }, + { + "node_id": 1324, + "label": 9, + "text": "Programming_paradigm:programming paradigm programming paradigms way classify programming languages based features languages classified multiple paradigms paradigms concerned mainly implications execution model language allowing side effects whether sequence operations defined execution model paradigms concerned mainly way code organized grouping code units along state modified code yet others concerned mainly style syntax grammar common programming paradigms include symbolic techniques reflection allow program refer might also considered programming paradigm however compatible major paradigms thus real paradigm right example languages fall imperative paradigm two main features state order operations occur constructs explicitly control order allow side effects state modified one point time within one unit code later read different point time inside different unit code communication units code explicit meanwhile object-oriented programming code organized objects contain state modified code part object object-oriented languages also imperative languages contrast languages fit declarative paradigm state order execute operations instead supply number operations available system along conditions allowed execute implementation language execution model tracks operations free execute chooses order comparison multi-paradigm programming languages software engineering process defined differing methodologies programming languages models computation defined differing paradigms languages designed support one paradigm smalltalk supports object-oriented programming haskell supports functional programming programming languages support multiple paradigms object pascal c++ java c scala visual basic common lisp scheme perl php python ruby wolfram language oz f example programs written c++ object pascal php purely procedural purely object-oriented contain elements paradigms software designers programmers decide use paradigm elements object-oriented programming programs treated set interacting objects functional programming programs treated sequence stateless function evaluations programming computers systems many processors process-oriented programming programs treated sets concurrent processes act logical shared data structures many programming paradigms well known techniques forbid enable instance pure functional programming disallows use side-effects structured programming disallows use goto statement partly reason new paradigms often regarded doctrinaire overly rigid accustomed earlier styles yet avoiding certain techniques make easier understand program behavior prove theorems program correctness programming paradigms also compared programming models allow invoking execution model using api programming models also classified paradigms based features execution model parallel computing using programming model instead language common reason details parallel hardware leak abstractions used program hardware causes programmer map patterns algorithm onto patterns execution model inserted due leakage hardware abstraction consequence one parallel programming language maps well computation problems thus convenient use base sequential language insert api calls parallel execution models via programming model parallel programming models classified according abstractions reflect hardware shared memory distributed memory message passing notions place visible code forth considered flavors programming paradigm apply parallel languages programming models programming language researchers criticise notion paradigms classification programming languages e.g harper krishnamurthi argue many programming languages strictly classified one paradigm rather include features several paradigms see comparison multi-paradigm programming languages different approaches programming developed time identified either time retrospectively early approach consciously identified structured programming advocated since mid 1960s concept programming paradigm dates least 1978 turing award lecture robert w. floyd entitled paradigms programming cites notion paradigm used thomas kuhn structure scientific revolutions 1962 lowest-level programming paradigms machine code directly represents instructions contents program memory sequence numbers assembly language machine instructions represented mnemonics memory addresses given symbolic labels sometimes called first- second-generation languages 1960s assembly languages developed support library copy quite sophisticated conditional macro generation preprocessing abilities call subroutines external variables common sections globals enabling significant code re-use isolation hardware specifics via use logical operators read/write/get/put assembly still used time critical systems often embedded systems gives direct control machine next advance development procedural languages third-generation languages first described high-level languages use vocabulary related problem solved example languages follow procedural paradigm describe step step exactly procedure according particular programmer least followed solve specific problem efficacy efficiency solution therefore entirely subjective highly dependent programmer experience inventiveness ability following widespread use procedural languages object-oriented programming oop languages created simula smalltalk c++ c eiffel php java languages data methods manipulate kept one unit called object perfect encapsulation one distinguishing features oop way another object user would able access data via object methods thus inner workings object may changed without affecting code uses object still controversy raised alexander stepanov richard stallman programmers concerning efficacy oop paradigm versus procedural paradigm need every object associative methods leads skeptics associate oop software bloat attempt resolve dilemma came polymorphism object-oriented programming considered paradigm language possible create even object-oriented assembler language high level assembly hla example fully supports advanced data types object-oriented assembly language programming despite early origins thus differing programming paradigms seen rather like motivational memes advocates rather necessarily representing progress one level next precise comparisons efficacy competing paradigms frequently made difficult new differing terminology applied similar entities processes together numerous implementation distinctions across languages literate programming form imperative programming structures programs human-centered web hypertext essay documentation integral program program structured following logic prose exposition rather compiler convenience independent imperative branch declarative programming paradigms developed languages computer told problem solve problem program structured set properties find expected result procedure follow given database set rules computer tries find solution matching desired properties archetype declarative language fourth generation language sql family functional languages logic programming functional programming subset declarative programming programs written using paradigm use functions blocks code intended behave like mathematical functions functional languages discourage changes value variables assignment making great deal use recursion instead logic programming paradigm views computation automated reasoning body knowledge facts problem domain expressed logic formulas programs executed applying inference rules answer problem found set formulas proved inconsistent symbolic programming paradigm describes programs able manipulate formulas program components data programs thus effectively modify appear learn making suited applications artificial intelligence expert systems natural-language processing computer games languages support paradigm include lisp prolog differentiable programming structures programs differentiated throughout usually via automatic differentiation programming languages support one programming paradigm allow programmers use suitable programming style associated language constructs given job", + "neighbors": [ + 14, + 29, + 31, + 65, + 78, + 87, + 117, + 123, + 149, + 154, + 176, + 194, + 216, + 227, + 246, + 249, + 272, + 282, + 302, + 306, + 308, + 313, + 332, + 346, + 365, + 373, + 378, + 379, + 392, + 396, + 412, + 429, + 446, + 447, + 454, + 506, + 509, + 536, + 538, + 544, + 565, + 567, + 579, + 592, + 649, + 653, + 682, + 690, + 739, + 753, + 756, + 787, + 789, + 825, + 834, + 873, + 919, + 934, + 948, + 998, + 1028, + 1034, + 1037, + 1044, + 1050, + 1059, + 1066, + 1095, + 1096, + 1118, + 1120, + 1123, + 1138, + 1152, + 1159, + 1173, + 1207, + 1217, + 1221, + 1225, + 1227, + 1233, + 1235, + 1245, + 1251, + 1264, + 1277, + 1311, + 1319, + 1320, + 1368, + 1372, + 1374, + 1398, + 1430, + 1457, + 1466, + 1503, + 1516, + 1532, + 1549, + 1572, + 1588, + 1606, + 1608, + 1626 + ], + "mask": "Test" + }, + { + "node_id": 1325, + "label": 4, + "text": "Mobile_security:mobile security mobile security specifically mobile device security become increasingly important mobile computing particular concern security personal business information stored smartphones users businesses use smartphones communicate also plan organize users work also private life within companies technologies causing profound changes organization information systems therefore become source new risks indeed smartphones collect compile increasing amount sensitive information access must controlled protect privacy user intellectual property company smartphones computers preferred targets attacks attacks exploit weaknesses inherent smartphones come communication mode\u2014like short message service sms aka text messaging multimedia messaging service mms wifi bluetooth gsm de facto global standard mobile communications also exploits target software vulnerabilities browser operating system malicious software relies weak knowledge average user security countermeasures developed applied smartphones security different layers software dissemination information end users good practices observed levels design use development operating systems software layers downloadable apps smartphone user exposed various threats use phone last two-quarters 2012 number unique mobile threats grew 261 according abi research threats disrupt operation smartphone transmit modify user data applications must guarantee privacy integrity information handle addition since apps could malware functionality activities limited example restricting apps accessing location information via gps blocking access user address book preventing transmission data network sending sms messages billed user etc. three prime targets attackers number threats mobile devices including annoyance stealing money invading privacy propagation malicious tools source attacks actors found non-mobile computing space smartphone infected attacker attacker attempt several things attacks derive flaws management sms mms mobile phone models problems managing binary sms messages possible sending ill-formed block cause phone restart leading denial service attacks user siemens s55 received text message containing chinese character would lead denial service another case standard requires maximum size nokia mail address 32 characters nokia phones verify standard user enters email address 32 characters leads complete dysfunction e-mail handler puts commission attack called curse silence study safety sms infrastructure revealed sms messages sent internet used perform distributed denial service ddos attack mobile telecommunications infrastructure big city attack exploits delays delivery messages overload network another potential attack could begin phone sends mms phones attachment attachment infected virus upon receipt mms user choose open attachment opened phone infected virus sends mms infected attachment contacts address book real-world example attack virus commwarrior uses address book sends mms messages including infected file recipients user installs software received via mms message virus began send messages recipients taken address book attacker may try break encryption mobile network gsm network encryption algorithms belong family algorithms called a5 due policy security obscurity possible openly test robustness algorithms originally two variants algorithm a5/1 a5/2 stream ciphers former designed relatively strong latter designed weak purpose allow easy cryptanalysis eavesdropping etsi forced countries typically outside europe use a5/2 since encryption algorithm made public proved possible break encryption a5/2 could broken fly a5/1 6 hours july 2007 3gpp approved change request prohibit implementation a5/2 new mobile phones means decommissioned longer implemented mobile phones stronger public algorithms added gsm standard a5/3 a5/4 block ciphers otherwise known kasumi uea1 published etsi network support a5/1 a5 algorithm implemented phone base station specify a5/0 null-algorithm whereby radio traffic sent unencrypted even case mobile phones able use 3g 4g much stronger encryption 2g gsm base station downgrade radio communication 2g gsm specify a5/0 encryption basis eavesdropping attacks mobile radio networks using fake base station commonly called imsi catcher addition tracing mobile terminals difficult since time mobile terminal accessing accessed network new temporary identity tmsi allocated mobile terminal tsmi used identity mobile terminal next time accesses network tmsi sent mobile terminal encrypted messages encryption algorithm gsm broken attacker intercept unencrypted communications made victim smartphone attacker try eavesdrop wi-fi communications derive information e.g username password type attack unique smartphones vulnerable attacks often wi-fi means communication access internet security wireless networks wlan thus important subject initially wireless networks secured wep keys weakness wep short encryption key connected clients addition several reductions search space keys found researchers wireless networks protected wpa security protocol wpa based temporal key integrity protocol tkip designed allow migration wep wpa equipment already deployed major improvements security dynamic encryption keys small networks wpa pre-shared key based shared key encryption vulnerable length shared key short limited opportunities input i.e numeric keypad mobile phone users might define short encryption keys contain numbers increases likelihood attacker succeeds brute-force attack successor wpa called wpa2 supposed safe enough withstand brute force attack gsm attacker succeeds breaking identification key possible attack phone also entire network connected many smartphones wireless lans remember already connected mechanism prevents user re-identify connection however attacker could create wifi access point twin parameters characteristics real network using fact smartphones remember networks could confuse two networks connect network attacker intercept data transmit data encrypted form lasco worm initially infects remote device using sis file format sis file format software installation script script file executed system without user interaction smartphone thus believes file come trusted source downloads infecting machine security issues related bluetooth mobile devices studied shown numerous problems different phones one easy exploit vulnerability unregistered services require authentication vulnerable applications virtual serial port used control phone attacker needed connect port take full control device another example phone must within reach bluetooth discovery mode attacker sends file via bluetooth recipient accepts virus transmitted example cabir worm spreads via bluetooth connection worm searches nearby phones bluetooth discoverable mode sends target device user must accept incoming file install program installing worm infects machine attacks based flaws os applications phone mobile web browser emerging attack vector mobile devices common web browsers mobile web browsers extended pure web navigation widgets plug-ins completely native mobile browsers jailbreaking iphone firmware 1.1.1 based entirely vulnerabilities web browser result exploitation vulnerability described underlines importance web browser attack vector mobile devices case vulnerability based stack-based buffer overflow library used web browser libtiff vulnerability web browser android discovered october 2008 iphone vulnerability due obsolete vulnerable library significant difference iphone vulnerability android sandboxing architecture limited effects vulnerability web browser process smartphones also victims classic piracy related web phishing malicious websites software run background etc big difference smartphones yet strong antivirus software available sometimes possible overcome security safeguards modifying operating system real-world examples section covers manipulation firmware malicious signature certificates attacks difficult 2004 vulnerabilities virtual machines running certain devices revealed possible bypass bytecode verifier access native underlying operating system results research published detail firmware security nokia symbian platform security architecture psa based central configuration file called swipolicy 2008 possible manipulate nokia firmware installed fact downloadable versions file human readable possible modify change image firmware vulnerability solved update nokia theory smartphones advantage hard drives since os files rom changed malware however systems possible circumvent symbian os possible overwrite file file name windows os possible change pointer general configuration file editable file application installed signing application verified series certificates one create valid signature without using valid certificate add list symbian os certificates directory firmware changes explained easy insert seemingly valid malicious certificate 2015 researchers french government agency agence nationale de la s\u00e9curit\u00e9 des syst\u00e8mes d'information anssi demonstrated capability trigger voice interface certain smartphones remotely using specific electromagnetic waveforms exploit took advantage antenna-properties headphone wires plugged audio-output jacks vulnerable smartphones effectively spoofed audio input inject commands via audio interface juice jacking physical hardware vulnerability specific mobile platforms utilizing dual purpose usb charge port many devices susceptible data exfiltrated malware installed onto mobile device utilizing malicious charging kiosks set public places hidden normal charge adapters jail-breaking also physical access vulnerability mobile device users initiate hack devices unlock exploit weaknesses operating system mobile device users take control device jail-breaking customize interface installing applications change system settings allowed devices thus allowing tweak mobile devices operating systems processes run programs background thus devices expose variety malicious attack lead compromise important private data 2010 researcher university pennsylvania investigated possibility cracking device password smudge attack literally imaging finger smudges screen discern user password researchers able discern device password 68 time certain conditions outsiders may perform over-the-shoulder victims watching specific keystrokes pattern gestures unlock device password passcode smartphones permanent point access internet mostly compromised easily computers malware malware computer program aims harm system resides mobile malware variants increased 54 year 2017 trojans worms viruses considered malware trojan program smartphone allows external users connect discreetly worm program reproduces multiple computers across network virus malicious software designed spread computers inserting legitimate programs running programs parallel however must said malware far less numerous important smartphones computers nonetheless recent studies show evolution malware smartphones rocketed last years posing threat analysis detection typically attack smartphone made malware takes place 3 phases infection host accomplishment goal spread malware systems malware often uses resources offered infected smartphones use output devices bluetooth infrared may also use address book email address person infect user acquaintances malware exploits trust given data sent acquaintance infection means used malware get smartphone either use one faults previously presented may use gullibility user infections classified four classes according degree user interaction malware infected phone also seek accomplish goal usually one following monetary damage damage data and/or device concealed damage malware infected smartphone always aims spread one way another various malware exist world smartphones short description mobile ransomware type malware locks users mobile devices pay-to-unlock-your-device ploy grown leaps bounds threat category since 2014 specific mobile computing platforms users often less security-conscious particularly pertains scrutinizing applications web links trusting native protection capability mobile device operating system mobile ransomware poses significant threat businesses reliant instant access availability proprietary information contacts likelihood traveling businessman paying ransom unlock device significantly higher since disadvantage given inconveniences timeliness less likely direct access staff recent ransomware attack caused stir world attack caused many internet connected devices work companies spent large amount recover attacks diagram loads different behaviors smartphone malware terms effects smartphones see graph least 50 malware varieties exhibit negative behavior except ability spread multitude malware partly due variety operating systems smartphones however attackers also choose make malware target multiple platforms malware found attacks os able spread different systems begin malware use runtime environments like java virtual machine .net framework also use libraries present many operating systems malware carry several executable files order run multiple environments utilize propagation process practice type malware requires connection two operating systems use attack vector memory cards used purpose synchronization software used propagate virus security mechanisms place counter threats described presented section divided different categories act level range management security operating system behavioral education user threats prevented various measures depending case considering two cases mentioned first case one would protect system corruption application second case installation suspicious software would prevented first layer security smartphone operating system os beyond needing handle usual roles operating system e.g resource management scheduling processes device must also establish protocols introducing external applications data without introducing risk central paradigm mobile operating systems idea sandbox since smartphones currently designed accommodate many applications must mechanisms ensure applications safe phone applications data system user malicious program reaches mobile device vulnerable area presented system must small possible sandboxing extends idea compartmentalize different processes preventing interacting damaging based history operating systems sandboxing different implementations example ios focus limiting access public api applications app store default managed open allows restrict apps access types data android bases sandboxing legacy linux trustedbsd following points highlight mechanisms implemented operating systems especially android operating system security layer security software layer composed individual components strengthen various vulnerabilities prevent malware intrusions identification user human user authentication contains software components learned experience computer security however smartphones software must deal greater constraints see limitations mobile antivirus product would scan files compare database known mobile malware code signatures application passes various security barriers take actions designed actions triggered activity malicious application sometimes detected one monitors various resources used phone depending goals malware consequences infection always malicious applications intended harm devices deployed following sections describe different ways detect suspicious activity various points mentioned indications provide certainty legitimacy activity application however criteria help target suspicious applications especially several criteria combined network traffic exchanged phones monitored one place safeguards network routing points order detect abnormal behavior mobile use network protocols much constrained computer expected network data streams predicted e.g protocol sending sms permits detection anomalies mobile networks production distribution chain mobile devices responsibility manufacturers ensure devices delivered basic configuration without vulnerabilities users experts many aware existence security vulnerabilities device configuration provided manufacturers retained many users listed several points manufacturers consider much malicious behavior allowed carelessness user smartphone users found ignore security messages application installation especially application selection checking application reputation reviews security agreement messages simply leaving device without password precise control permissions granted applications added smartphone user large responsibility cycle security vector intrusion precaution especially important user employee company stores business data device detailed precautions user take manage security smartphone recent survey internet security experts bullguard showed lack insight rising number malicious threats affecting mobile phones 53 users claiming unaware security software smartphones 21 argued protection unnecessary 42 admitted n't crossed mind using apa 2011 statistics show consumers concerned security risks believe serious problem key always remember smartphones effectively handheld computers vulnerable latest android smartphones come inbuilt encryption setting securing information saved device makes difficult hacker extract decipher information case device compromised settings \u2013 security \u2013 encrypt phone encrypt sd card precautions measures leave easy solution intrusion people malicious applications smartphone users careful many attacks defeated especially phishing applications seeking obtain rights device one form mobile protection allows companies control delivery storage text messages hosting messages company server rather sender receiver phone certain conditions met expiration date messages deleted security mechanisms mentioned article large extent inherited knowledge experience computer security elements composing two device types similar common measures used antivirus software firewalls however implementation solutions necessarily possible least highly constrained within mobile device reason difference technical resources offered computers mobile devices even though computing power smartphones becoming faster limitations computing power furthermore common find updates exist developed deployed always done one example find user know newer version operating system compatible smartphone user may discover known vulnerabilities corrected end long development cycle allows time exploit loopholes expected four mobile environments make security framework", + "neighbors": [ + 11, + 134, + 144, + 149, + 162, + 190, + 293, + 310, + 337, + 338, + 379, + 412, + 415, + 439, + 450, + 479, + 487, + 518, + 521, + 527, + 528, + 531, + 564, + 576, + 624, + 692, + 698, + 703, + 739, + 740, + 746, + 750, + 762, + 800, + 818, + 833, + 898, + 955, + 972, + 1039, + 1051, + 1090, + 1112, + 1138, + 1239, + 1291, + 1292, + 1303, + 1309, + 1355, + 1361, + 1368, + 1373, + 1379, + 1444, + 1451, + 1472, + 1552, + 1585, + 1602, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 1326, + "label": 5, + "text": "MQTT:mqtt mqtt message queuing telemetry transport iso standard iso/iec prf 20922 publish-subscribe-based messaging protocol works top tcp/ip protocol suite designed connections remote locations small code footprint required network bandwidth limited publish-subscribe messaging pattern requires message broker andy stanford-clark ibm arlen nipper cirrus link authored first version protocol 1999 2013 ibm submitted mqtt v3.1 oasis specification body charter ensured minor changes specification could accepted mqtt-sn variation main protocol aimed embedded devices non-tcp/ip networks zigbee historically mq mqtt came ibm mq 'mqseries message queuing product line however queuing required supported standard feature situations alternative message-oriented middleware includes advanced message queuing protocol amqp streaming text oriented messaging protocol stomp ietf constrained application protocol xmpp dds opc ua web application messaging protocol wamp mqtt system consists clients communicating server often called broker client may either publisher information subscriber client connect broker information organized hierarchy topics publisher new item data distribute sends control message data connected broker broker distributes information clients subscribed topic publisher need data number locations subscribers subscribers turn configured data publishers broker receives topic current subscribers discard topic unless publisher indicates topic retained allows new subscribers topic receive current value rather waiting next update publisher publishing client first connects broker set default message sent subscribers broker detects publishing client unexpectedly disconnected broker clients interact broker system may contain several broker servers exchange data based current subscribers topics minimal mqtt control message little two bytes data control message carry nearly 256 megabytes data needed fourteen defined message types used connect disconnect client broker publish data acknowledge receipt data supervise connection client server mqtt relies tcp protocol data transmission variant mqtt-sn used transports udp bluetooth mqtt sends connection credentials plain text format include measures security authentication provided underlying tcp transport using measures protect integrity transferred information interception duplication waits connection established server creates link nodes waits mqtt client finish work must tcp/ip session disconnect returns immediately application thread passing request mqtt client connection broker specify quality service measure classified increasing order overhead field affect handling underlying tcp data transmissions used mqtt senders receivers several projects implement mqtt examples", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 1019, + 1116, + 1206, + 1218, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 1327, + "label": 4, + "text": "WannaCry_ransomware_attack:wannacry ransomware attack wannacry ransomware attack may 2017 worldwide cyberattack wannacry ransomware cryptoworm targeted computers running microsoft windows operating system encrypting data demanding ransom payments bitcoin cryptocurrency propagated eternalblue exploit developed united states national security agency nsa older windows systems eternalblue stolen leaked group called shadow brokers months prior attack microsoft released patches previously close exploit much wannacry spread organizations applied using older windows systems past end-of-life wannacry also took advantage installing backdoors onto infected systems attack stopped within days discovery due emergency patches released microsoft discovery kill switch prevented infected computers spreading wannacry attack estimated affected 200,000 computers across 150 countries total damages ranging hundreds millions billions dollars security experts believed preliminary evaluation worm attack originated north korea agencies working country december 2017 united states united kingdom australia formally asserted north korea behind attack new variant wannacry ransomware forced taiwan semiconductor manufacturing company tsmc temporarily shut several chip-fabrication factories august 2018 virus spread 10,000 machines tsmc advanced facilities wannacry ransomware cryptoworm targeted computers running microsoft windows operating system encrypting data demanding ransom payments bitcoin cryptocurrency worm also known wannacrypt wana decrypt0r 2.0 wanacrypt0r 2.0 wan na decryptor considered network worm also includes transport mechanism automatically spread transport code scans vulnerable systems uses eternalblue exploit gain access doublepulsar tool install execute copy wannacry versions 0 1 2 created using microsoft visual c++ 6.0 eternalblue exploit windows server message block smb protocol released shadow brokers much attention comment around event occasioned fact u.s. national security agency nsa exploit likely stolen already discovered vulnerability used create exploit offensive work rather report microsoft microsoft eventually discovered vulnerability tuesday 14 march 2017 issued security bulletin ms17-010 detailed flaw announced patches released windows versions currently supported time windows vista windows 7 windows 8.1 windows 10 windows server 2008 windows server 2008 r2 windows server 2012 windows server 2016 doublepulsar backdoor tool also released shadow brokers 14 april 2017 starting 21 april 2017 security researchers reported tens thousands computers doublepulsar backdoor installed 25 april reports estimated number infected computers could several hundred thousand numbers increasing every day wannacry code take advantage existing doublepulsar infection installs executed wannacry malware first checks kill switch domain name found ransomware encrypts computer data attempts exploit smb vulnerability spread random computers internet laterally computers network modern ransomware payload displays message informing user files encrypted demands payment around us 300 bitcoin within three days us 600 within seven days three hardcoded bitcoin addresses wallets used receive payments victims wallets transactions balances publicly accessible even though cryptocurrency wallet owners remain unknown several organizations released detailed technical writeups malware including microsoft cisco malwarebytes symantec mcafee attack began friday 12 may 2017 evidence pointing initial infection asia 07:44 utc initial infection likely exposed vulnerable smb port rather email phishing initially assumed within day code reported infected 230,000 computers 150 countries organizations installed microsoft security update april 2017 affected attack still running unsupported versions microsoft windows windows xp windows server 2003 particularly high risk security patches released since april 2014 exception one emergency patch released may 2014 kaspersky lab study reported however less 0.1 percent affected computers running windows xp 98 percent affected computers running windows 7 controlled testing environment cybersecurity firm kryptos logic found unable infect windows xp system wannacry using exploits payload failed load caused operating system crash rather actually execute encrypt files however executed manually wannacry could still operate windows xp experts quickly advised affected users paying ransom due reports people getting data back payment high revenues would encourage campaigns 14 june 2017 attack subsided total 327 payments totaling us 130,634.77 51.62396539 xbt transferred day initial attack may microsoft released out-of-band security updates end life products windows xp windows server 2003 windows 8 patches created february year following tip vulnerability january year organizations advised patch windows plug vulnerability order protect cyber attack head microsoft cyber defense operations center adrienne hall said \u201c due elevated risk destructive cyber-attacks time made decision take action applying updates provides protection potential attacks characteristics similar wannacrypt alternative name wannacry \u201d researcher marcus hutchins accidentally discovered kill switch domain hardcoded malware registering domain name dns sinkhole stopped attack spreading worm ransomware encrypted computer files unable connect domain computers infected wannacry website registration unable help already infected systems severely slowed spread initial infection gave time defensive measures deployed worldwide particularly north america asia attacked extent elsewhere 14 may first variant wannacry appeared new second kill-switch registered matt suiche day followed second variant third last kill-switch 15 may registered check point threat intelligence analysts days later new version wannacry detected lacked kill switch altogether 19 may reported hackers trying use mirai botnet variant effect distributed attack wannacry kill-switch domain intention knocking offline 22 may hutchins protected domain switching cached version site capable dealing much higher traffic loads live site separately researchers university college london boston university reported paybreak system could defeat wannacry several families ransomware recovering keys used encrypt user data discovered windows encryption apis used wannacry may completely clear prime numbers used generate payload private keys memory making potentially possible retrieve required key yet overwritten cleared resident memory key kept memory wannacry process killed computer rebooted infected behaviour used french researcher develop tool known wannakey automates process windows xp systems approach iterated upon second tool known wanakiwi tested work windows 7 server 2008 r2 well within four days initial outbreak new infections slowed trickle due responses linguistic analysis ransom notes indicated authors likely fluent chinese proficient english versions notes languages probably human-written rest seemed machine-translated according analysis fbi cyber behavioral analysis center computer created ransomware language files hangul language fonts installed evidenced presence \\fcharset129 rich text format tag metadata language files also indicated computers created ransomware set used korea google security researcher initially posted tweet referencing code similarities wannacry previous malware cybersecurity companies kaspersky lab symantec said code similarities previously used lazarus group believed carried cyberattack sony pictures 2014 bangladesh bank heist 2016\u2014and linked north korea could also either simple re-use code another group attempt shift blame\u2014as cyber false flag operation leaked internal nsa memo alleged also linked creation worm north korea brad smith president microsoft said believed north korea originator wannacry attack uk national cyber security centre reached conclusion 18 december 2017 united states government formally announced publicly considers north korea main culprit behind wannacry attack president trump homeland security advisor tom bossert wrote op-ed wall street journal charge saying make allegation lightly based evidence press conference following day bossert said evidence indicates kim jong-un given order launch malware attack bossert said canada new zealand japan agree united states assessment evidence links attack north korea united kingdom foreign commonwealth office says also stands behind united states assertion north korea however denied responsible cyberattack 6 september 2018 us department justice doj announced formal charges park jin-hyok involvement sony pictures hack 2014 doj contended park north korean hacker working part team experts north korean reconnaissance general bureau department justice asserted team also involved wannacry attack among activities ransomware campaign unprecedented scale according europol estimates around 200,000 computers infected across 150 countries according kaspersky lab four affected countries russia ukraine india taiwan one largest agencies struck attack national health service hospitals england scotland 70,000 devices \u2013 including computers mri scanners blood-storage refrigerators theatre equipment \u2013 may affected 12 may nhs services turn away non-critical emergencies ambulances diverted 2016 thousands computers 42 separate nhs trusts england reported still running windows xp 2018 report members parliament concluded 200 nhs hospitals organizations checked wake wannacry attack still failed cyber security checks nhs hospitals wales northern ireland unaffected attack nissan motor manufacturing uk tyne wear england halted production ransomware infected systems renault also stopped production several sites attempt stop spread ransomware spain telef\u00f3nica fedex deutsche bahn hit along many countries companies worldwide attack impact said relatively low compared potential attacks type could much worse marcus hutchins discovered kill-switch built creators specifically targeted highly critical infrastructure like nuclear power plants dams railway systems according cyber-risk-modeling firm cyence economic losses cyber attack could reach us 4 billion groups estimating losses hundreds millions following alphabetical list organisations confirmed affected number experts highlighted nsa non-disclosure underlying vulnerability loss control eternalblue attack tool exploited edward snowden said nsa privately disclosed flaw used attack hospitals found lost attack may happened british cybersecurity expert graham cluley also sees culpability part u.s. intelligence services according others could done something ages ago get problem fixed n't also said despite obvious uses tools spy people interest duty protect countries citizens others also commented attack shows practice intelligence agencies stockpile exploits offensive purposes rather disclosing defensive purposes may problematic microsoft president chief legal officer brad smith wrote repeatedly exploits hands governments leaked public domain caused widespread damage equivalent scenario conventional weapons would u.s. military tomahawk missiles stolen russian president vladimir putin placed responsibility attack u.s. intelligence services created eternalblue 17 may 2017 united states bipartisan lawmakers introduced patch act aims exploits reviewed independent board balance need disclose vulnerabilities national security interests increasing transparency accountability maintain public trust process 15 june 2017 united states congress hold hearing attack two subpanels house science committee hear testimonies various individuals working government non-governmental sector us improve protection mechanisms systems similar attacks future cybersecurity researcher working loose collaboration uk national cyber security centre researched malware discovered kill switch later globally dispersed security researchers collaborated online develop open source tools allow decryption without payment circumstances snowden states nsa-enabled ransomware eats internet help comes researchers spy agencies asks case experts also used publicity around attack chance reiterate value importance good regular secure backups good cybersecurity including isolating critical systems using appropriate software latest security patches installed adam segal director digital cyberspace policy program council foreign relations stated patching updating systems broken basically private sector government agencies addition segal said governments apparent inability secure vulnerabilities opens lot questions backdoors access encryption government argues needs private sector security arne sch\u00f6nbohm president germany federal office information security bsi stated current attacks show vulnerable digital society wake-up call companies finally take security seriously effects attack also political implications united kingdom impact national health service quickly became political claims effects exacerbated government underfunding nhs particular nhs ceased paid custom support arrangement continue receiving support unsupported microsoft software used within organization including windows xp home secretary amber rudd refused say whether patient data backed shadow health secretary jon ashworth accused health secretary jeremy hunt refusing act critical note microsoft national cyber security centre ncsc national crime agency received two months previously others argued hardware software vendors often fail account future security flaws selling systems \u2212 due technical design market incentives \u2212 eventually wo n't able properly receive apply patches nhs denied still using xp claiming 4.7 devices within organization ran windows xp cost attack nhs estimated \u00a392 million disruption services upgrades attack nhs digital refused finance estimated \u00a31 billion meet cyber essentials plus standard information security certification organized uk ncsc saying would constitute value money invested \u00a360 million planned spend \u00a3150 million next two years address key cyber security weaknesses suggested future attack magnitude may defined terrorism act parliament adds provision stating malicious use computer matter world located degrades seriously harms healthcare power life support critical infrastructure form terrorism may elicit proportional response possibly could added revision policing crime act 2017 late june hundreds computer users reported sent email someone multiple people claiming developers wannacry email threatened destroy victims data unless sent 0.1 btc bitcoin address hackers", + "neighbors": [ + 11, + 43, + 91, + 120, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 363, + 376, + 379, + 414, + 418, + 494, + 533, + 550, + 564, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 647, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 961, + 965, + 1007, + 1043, + 1063, + 1101, + 1112, + 1138, + 1162, + 1186, + 1239, + 1270, + 1293, + 1332, + 1336, + 1342, + 1365, + 1368, + 1393, + 1433, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1328, + "label": 2, + "text": "Windows_To_Go:windows go windows go feature windows 8 enterprise windows 8.1 enterprise windows 10 education windows 10 enterprise windows 10 pro limited education enterprise image allows boot run certain usb mass storage devices usb flash drives external hard disk drives certified microsoft compatible fully manageable corporate windows environment intended allow enterprise administrators provide users imaged version windows reflects corporate desktop creation windows go drives officially supported non-enterprise education windows 8.1 editions however enterprise education versions windows 10 supported information published describing various ways install windows go using version windows 8.x 10 bootable usb device windows 8 embedded versions windows windows embedded standard 7 supported booting usb storage devices april 2011 leak windows 8 build 7850 users noticed builds included program called portable workspace creator indicating intended create bootable usb drives windows 8 september 2011 microsoft officially announced windows go build conference distributed bootable 32 gb usb flash drives windows go pre-installed windows go several significant differences compared standard installation windows 8 non-removable storage hard disk drives solid-state drives windows go works usb 2.0 faster usb connections legacy bios uefi firmware usb drives used environment microsoft set specific requirements usb drive must meet order supported device june 2017 12 usb devices listed supported microsoft windows go using pc host hardware certified use either windows 7 windows 8 work well windows go although microsoft provide support feature windows rt macintosh computers possible boot windows go mac new companion device license microsoft software assurance employees use windows go software assurance licensed computer well home pc simon bisson writing zdnet called windows go one interesting features windows 8 noting even though using usb 2.0 port performance good noticeable lag calling useful way running windows 8 michael s. lasky writing laptopmag.com wrote departments want ensure employees safely access corporate network windows go usb drives incredibly convenient ability instantly remake windows pc secure personal computer worthwhile productive time-saver release windows 10 may 2019 update version 1903 microsoft announced windows go longer developed feature support os major feature updates therefore enable user stay current specific certified type performant usb media needed feature provide good user experience also longer produced oems", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 171, + 234, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 359, + 413, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 664, + 689, + 705, + 747, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1329, + "label": 5, + "text": "Real_Time_Streaming_Protocol:real time streaming protocol real time streaming protocol rtsp network control protocol designed use entertainment communications systems control streaming media servers protocol used establishing controlling media sessions end points clients media servers issue vhs-style commands play record pause facilitate real-time control media streaming server client video demand client server voice recording transmission streaming data task rtsp rtsp servers use real-time transport protocol rtp conjunction real-time control protocol rtcp media stream delivery however vendors implement proprietary transport protocols rtsp server software realnetworks example also used realnetworks proprietary real data transport rdt rtsp developed realnetworks netscape columbia university first draft submitted ietf 1996 standardized multiparty multimedia session control working group mmusic wg internet engineering task force ietf published rfc 2326 1998 rtsp 2.0 published rfc 7826 2016 replacement rtsp 1.0 rtsp 2.0 based rtsp 1.0 backwards compatible basic version negotiation mechanism similar ways http rtsp defines control sequences useful controlling multimedia playback http stateless rtsp state identifier used needed track concurrent sessions like http rtsp uses tcp maintain end-to-end connection rtsp control messages sent client server commands travel direction i.e server client presented basic rtsp requests typical http requests like options request also available default transport layer port number 554 tcp udp latter rarely used control requests rtsp using rtp rtcp allows implementation rate adaptation many cctv security cameras often called ip cameras support rtsp streaming especially onvif profiles g", + "neighbors": [ + 52, + 86, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 521, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 1116, + 1200, + 1206, + 1218, + 1326, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1330, + "label": 5, + "text": "Internet_Security_Association_and_Key_Management_Protocol:internet security association key management protocol isakmp internet security association key management protocol protocol defined rfc 2408 establishing security associations sa cryptographic keys internet environment isakmp provides framework authentication key exchange designed key exchange independent protocols internet key exchange kerberized internet negotiation keys provide authenticated keying material use isakmp example ike describes protocol using part oakley part skeme conjunction isakmp obtain authenticated keying material use isakmp security associations ah esp ietf ipsec doi isakmp defines procedures authenticating communicating peer creation management security associations key generation techniques threat mitigation e.g denial service replay attacks framework isakmp typically utilizes ike key exchange although methods implemented kerberized internet negotiation keys preliminary sa formed using protocol later fresh keying done isakmp defines procedures packet formats establish negotiate modify delete security associations sas contain information required execution various network security services ip layer services header authentication payload encapsulation transport application layer services self-protection negotiation traffic isakmp defines payloads exchanging key generation authentication data formats provide consistent framework transferring key authentication data independent key generation technique encryption algorithm authentication mechanism isakmp distinct key exchange protocols order cleanly separate details security association management key management details key exchange may many different key exchange protocols different security properties however common framework required agreeing format sa attributes negotiating modifying deleting sas isakmp serves common framework isakmp implemented transport protocol implementations must include send receive capability isakmp using udp port 500 openbsd first implemented isakmp 1998 via isakmpd 8 software ipsec services service microsoft windows handles functionality kame project implements isakmp linux open source bsds modern cisco routers implement isakmp vpn negotiation leaked nsa presentations released der spiegel indicate isakmp exploited unknown manner decrypt ipsec traffic ike researchers discovered logjam attack state breaking 1024-bit diffie\u2013hellman group would break 66 vpn servers 18 top million https domains 26 ssh servers consistent researchers claim consistent leaks", + "neighbors": [ + 254, + 542, + 961, + 1301, + 1624 + ], + "mask": "Train" + }, + { + "node_id": 1331, + "label": 4, + "text": "Extended_Validation_Certificate:extended validation certificate extended validation certificate ev certificate conforming x.509 proves legal entity owner signed certificate authority key issue ev certificates ev certificates used manner x.509 certificates including securing web communications https signing software documents ev certificates different domain-validated certificates organization-validation certificates issued subset certificate authorities cas require verification requesting entity legal identity certificate issuance august 2019 google chrome mozilla firefox apple safari web browsers show verified legal identity user interface either instead domain name plan remove distinction near future mobile browsers typically show difference ev certified websites desktop behaviour phased recent versions popular browsers example safari browser apple macos mojave ten popular websites online none use ev certificates trend away usage software verified legal identity displayed user operating system e.g. microsoft windows proceeding installation extended validation certificates stored file format specified typically use encryption organization-validated certificates domain-validated certificates compatible server user agent software criteria issuing ev certificates defined guidelines extended validation promulgated ca/browser forum voluntary organization whose members include leading cas vendors internet software well representatives legal audit professions issue extended validation certificate ca requires verification requesting entity identity operational status control domain name hosting server 2005 melih abdulhayoglu ceo comodo group convened first meeting organization became ca/browser forum hoping improve standards issuing ssl/tls certificates june 12 2007 ca/browser forum officially ratified first version extended validation ev ssl guidelines took effect immediately formal approval successfully brought close two years effort provided infrastructure trusted web site identity internet april 2008 forum announced version 1.1 guidelines building practical experience member cas relying-party application software suppliers gained months since first version approved use major browsers created special user interface indicators pages loaded via https secured ev certificate soon creation standard includes microsoft edge 12 google chrome 1.0 internet explorer 7.0 firefox 3 safari 3.2 opera 9.5 furthermore mobile browsers including safari ios windows phone firefox android chrome android ios added ui indicators usually browsers ev support display validated identity\u2014usually combination organization name jurisdiction\u2014contained ev certificate 'subject field implementations enhanced display includes clicking lock symbol user obtain information certificate including name certificate authority ca issued ev certificate august 2019 google chrome 76 firefox 70 browsers plan remove ui indicators ev certificates important motivation using digital certificates ssl/tls add trust online transactions requiring website operators undergo vetting certificate authority ca order get certificate however commercial pressures led cas introduce domain-validated certificates domain-validated certificates existed validation standards generally require proof domain control particular domain-validated certificates assert given legal entity relationship domain although domain may resemble particular legal entity past browsers user interfaces clearly differentiate low-validation certificates undergone rigorous vetting since successful ssl/tls connection would cause green padlock icon appear browsers users likely aware whether website owner validated result fraudsters including phishing websites could use tls add perceived credibility websites users modern browsers always check identity certificate owners examining details issued certificate always indicates certificate owner information name organization location ev certificates validated baseline requirements extended validation requirements place additional requirements authorities vet companies include manual checks domain names requested applicant checks official government sources checks independent information sources phone calls company confirm position applicant certificate accepted government-registered serial number business well physical address stored ev certificate establishing stricter issuing criteria requiring consistent application criteria participating cas ev certificates intended restore confidence among users website operator legally established business organization verifiable identity said still concern lack accountability led loss public confidence domain-validated certificates lead lax certification practices erode value ev certificates well cas pass independent qualified audit review may offer ev cas globally must follow detailed issuance requirements aim exception extended validation certificates .onion domains otherwise possible get wildcard extended validation certificate \u2013 instead fully qualified domain names must included certificate inspected certificate authority ev certificates standard x.509 digital certificates primary way identify ev certificate referencing certificate policies extension field issuer uses different object identifier oid field identify ev certificates oid documented issuer certification practice statement root certificate authorities general browsers may recognize issuers ev https certificates contain subject x.509 oids codice_1 codice_2 codice_3 codice_4 codice_5 codice_6 pointing id relevant secretary state us government business registrar outside us well ca-specific policy identifier ev-aware software web browser recognize criteria issuing extended validation certificates require issuing certificate authorities immediately support online certificate status protocol revocation checking however requirement timely response revocation checks browser prompted certificate authorities previously done implement ocsp support section 26-a issuing criteria requires cas support ocsp checking certificates issued dec. 31 2010 legal entity names unique therefore attacker wants impersonate entity might incorporate different business name e.g. different state country obtain valid certificate use certificate impersonate original site one demonstration researcher incorporated business called stripe inc. kentucky showed browsers display similarly display certificate payment processor stripe inc. incorporated delaware researcher claimed demonstration setup took hour time us 100 legal costs us 77 certificate also noted enough mouse clicks user may able view city state entity incorporated neither helpful typical user likely blindly trust bright green indicator since ev certificates promoted reported mark trustworthy website small business owners voiced concerns ev certificates give undue advantage large businesses published drafts ev guidelines excluded unincorporated business entities early media reports focused issue version 1.0 ev guidelines revised embrace unincorporated associations long registered recognized agency greatly expanding number organizations qualified extended validation certificate 2006 researchers stanford university microsoft research conducted usability study ev display internet explorer 7 paper concluded participants received training browser security features notice extended validation indicator outperform control group whereas participants asked read internet explorer help file likely classify real fake sites legitimate proponents ev certificates claim help phishing attacks security expert peter gutmann states new class certificates restore ca profits eroded due race bottom occurred among issuers industry gutmann calls phenomenon pki-me-harder introduction \u2026 so-called high-assurance extended validation ev certificates allow cas charge standard ones simply case rounding twice usual number suspects\u2014presumably somebody \u2019 going impressed effect phishing minimal since fixing problem phishers exploiting indeed cynics would say exactly problem certificates cas supposed solve first place \u201c high-assurance \u201d certificates way charging second time existing service years ago certificates still cost several hundred dollars shifting baseline certificate prices quality moved point obtained 9.95 even nothing big commercial cas reinvent defining new standard convincing market go back prices paid good old days deja-vu-all-over-again approach seen examining verisign \u2019 certificate practice statement cps document governs certificate issuance security requirements ev-certificate 2008 cps except minor differences legalese used express practically identical requirements class 3 certificates listed verisign \u2019 version 1.0 cps 1996 ev certificates simply roll back clock approach already failed first time tried 1996 resetting shifting baseline charging 1996 prices side-effect even proposals kind sliding-window approach certificate value inevitable race bottom cheapens effective value established classes certificates \u2019 regarded less less effective software uses them\u2026", + "neighbors": [ + 83, + 88, + 95, + 172, + 235, + 258, + 260, + 261, + 277, + 319, + 509, + 530, + 531, + 533, + 539, + 542, + 554, + 582, + 623, + 668, + 684, + 692, + 826, + 886, + 939, + 953, + 961, + 1003, + 1033, + 1058, + 1089, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1240, + 1280, + 1378, + 1423, + 1452, + 1534, + 1550, + 1597, + 1624 + ], + "mask": "Validation" + }, + { + "node_id": 1332, + "label": 4, + "text": "Evercookie:evercookie evercookie javascript-based application created samy kamkar produces zombie cookies web browser intentionally difficult delete 2013 top-secret nsa document leaked edward snowden citing evercookie method tracking tor users traditional http cookie relatively small amount textual data stored user browser cookies used save preferences login session information however also employed track users marketing purposes due concerns privacy major browsers include mechanisms deleting and/or refusing accept cookies websites adobe systems claimed size restrictions likelihood eventual deletion simple textual nature traditional cookies motivated add local shared object lso mechanism adobe flash player adobe published mechanism deleting lso cookies store 100 kb data per website default met criticism security privacy experts since version 4 firefox treated lso cookies way traditional http cookies deleted together samy kamkar released v0.4 beta evercookie september 13 2010 open source according project website evercookie merely difficult delete actively resists deletion copying different forms user machine resurrecting notices copies missing expired specifically creating new cookie evercookie uses following storage mechanisms available developer looking add following features", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 509, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 782, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576, + 1594, + 1621 + ], + "mask": "Train" + }, + { + "node_id": 1333, + "label": 4, + "text": "ChronoSync:chronosync chronosync macos application periodic backups bootable drive clones folder synchronizations offers ability target device folder visible finder volume thumb drive nas disk image server another mac 2014 chronosync received top software pick about.com received 10 10 rating apple daily report", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1334, + "label": 2, + "text": "Core_Animation:core animation core animation graphics compositing framework used macos mac os x leopard later ios watchos tvos produce animated user interfaces core animation provides way developers produce animated user interfaces via implicit animation model well explicit model developer specifies original final states object core animation handles interpolation allows animated interfaces created relative ease specific code animation required developer core animation animate visual element provides unified way accessing core image core video quartz technologies core animation rendering accelerated graphics processor gpu animated sequences execute thread independent main run loop allowing application processing occur animation progress way application performance affected animations stopped reversed retargeted progress core animation first appeared mac os x leopard actually first emerged iphone software team shown publicly first time august 7 2006 wwdc 2006 macworld expo 2007 apple announced iphone runs specially adapted version os x uses core animation", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 228, + 252, + 269, + 345, + 356, + 394, + 395, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 797, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1140, + 1178, + 1189, + 1237, + 1292, + 1305, + 1322, + 1339, + 1373, + 1409, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1335, + "label": 4, + "text": "Memory_corruption:memory corruption memory corruption occurs computer program contents memory location modified due programmatic behavior exceeds intention original programmer program/language constructs termed violating memory safety likely cause memory corruption programming error corrupted memory contents used later program leads either program crash strange bizarre program behavior nearly 10 application crashes windows systems due heap corruption modern programming languages like c c++ powerful features explicit memory management pointer arithmetic features designed developing efficient applications system software however using features incorrectly may lead memory corruption errors memory corruption one intractable class programming errors two reasons memory corruption errors broadly classified four categories many memory debuggers purify valgrind insure++ parasoft c/c++test addresssanitizer available detect memory corruption errors", + "neighbors": [ + 225, + 292, + 306, + 379, + 386, + 503, + 613, + 1009, + 1044, + 1183, + 1231, + 1372, + 1472, + 1511 + ], + "mask": "Test" + }, + { + "node_id": 1336, + "label": 4, + "text": "Transient_execution_CPU_vulnerabilities:transient execution cpu vulnerabilities transient execution cpu vulnerabilities vulnerabilities computer system speculative execution optimization implemented microprocessor exploited leak secret data unauthorized party classic example spectre since january 2018 many different vulnerabilities identified modern computers highly parallel devices composed components different performance characteristics operation branch yet performed earlier slow operation memory read yet completed microprocessor may attempt predict result earlier operation execute later operation speculatively acting prediction correct prediction may based recent behavior system earlier slower operation completes microprocessor determines whether prediction correct incorrect correct execution proceeds uninterrupted incorrect microprocessor rolls back speculatively executed operations repeats original instruction real result slow operation terms directly visible behavior computer speculatively executed code never happened however speculative execution may affect state certain components microprocessor cache effect may discovered careful monitoring timing subsequent operations attacker arrange speculatively executed code may directly written attacker may suitable gadget found targeted system operates secret data unauthorized access different effect cache different values secret data may able discover value secret data starting 2017 multiple examples vulnerabilities identified publication starting early 2018 hardware mitigations impose close zero performance loss firmware and/or os mitigations might incur quite significant performance loss depending workload 8th generation coffee lake architecture table also applies wide range previously released intel cpus limited architectures based intel core pentium 4 intel atom starting silvermont vulnerabilities associated cpu speculative execution", + "neighbors": [ + 43, + 91, + 141, + 158, + 165, + 198, + 232, + 261, + 281, + 293, + 325, + 352, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 633, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1138, + 1162, + 1186, + 1256, + 1270, + 1327, + 1332, + 1342, + 1365, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1337, + "label": 4, + "text": "Packet_analyzer:packet analyzer packet analyzer also known packet sniffer computer program piece computer hardware packet capture appliance intercept log traffic passes digital network part network packet capture process intercepting logging traffic data streams flow across network sniffer captures packet needed decodes packet raw data showing values various fields packet analyzes content according appropriate rfc specifications packet analyzer used intercepting traffic wireless networks known wireless analyzer wifi analyzer packet analyzer also referred network analyzer protocol analyzer though terms also meanings wired shared medias networks ethernet token ring fddi networks depending network structure hub switch may possible capture traffic network single machine network modern networks traffic captured using network switch so-called monitoring port mirrors packets pass designated ports switch network tap even reliable solution use monitoring port since taps less likely drop packets high traffic load wireless lans traffic captured one channel time using multiple adapters several channels simultaneously wired broadcast wireless lans capture unicast traffic machines network adapter capturing traffic must promiscuous mode wireless lans even adapter promiscuous mode packets service set adapter configured usually ignored see packets adapter must monitor mode special provisions required capture multicast traffic multicast group packet analyzer already monitoring broadcast traffic traffic captured either entire contents packets recorded headers recorded recording headers reduces storage requirements avoids legal issues yet often provides sufficient information diagnose problems captured information decoded raw digital form human-readable format lets users easily review exchanged information protocol analyzers vary abilities display analyze data protocol analyzers also generate traffic thus act reference device act protocol testers testers generate protocol-correct traffic functional testing may also ability deliberately introduce errors test dut ability handle errors protocol analyzers also hardware-based either probe format increasingly common combined disk array devices record packets slice packet disk array allows historical forensic analysis packets without users recreate fault packet sniffers packet capture used fulfill warrant law enforcement agency wiretap network traffic generated individual internet service providers voip providers united states must comply communications assistance law enforcement act regulations using packet capture storage telecommunications carriers provide legally required secure separate access targeted network traffic able use device internal security purposes collecting data carrier system without warrant illegal due laws interception using end-to-end encryption communications kept confidential telecommunication carriers legal authorities", + "neighbors": [ + 74, + 138, + 160, + 198, + 299, + 329, + 330, + 364, + 415, + 512, + 528, + 598, + 703, + 813, + 856, + 875, + 991, + 1045, + 1279, + 1303, + 1379, + 1400, + 1452, + 1513, + 1527, + 1552, + 1554, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1338, + "label": 2, + "text": "Network_Access_Protection:network access protection network access protection nap microsoft technology controlling network access computer based health nap system administrators organization define policies system health requirements examples system health requirements whether computer recent operating system updates installed whether computer latest version anti-virus software signature whether computer host-based firewall installed enabled computers nap client health status evaluated upon establishing network connection nap restrict deny network access computers compliance defined health requirements nap deprecated windows server 2012 r2 removed windows server 2016 network access protection client agent makes possible clients support nap evaluate software updates statement health nap clients computers report system health nap enforcement point nap enforcement point computer device evaluate nap client \u2019 health optionally restrict network communications nap enforcement points ieee 802.1x-capable switches vpn servers dhcp servers health registration authorities hras run windows server 2008 later nap health policy server computer running network policy server nps service windows server 2008 later stores health requirement policies provides health evaluation nap clients health requirement policies configured administrators define criteria clients must meet allowed undeterred connection criteria may include version operating system personal firewall up-to-date antivirus program nap-capable client computer contacts nap enforcement point submits current health state nap enforcement point sends nap client \u2019 health state nap health policy server evaluation using radius protocol nap health policy server also act radius-based authentication server nap client nap health policy server use health requirement server validate health state nap client determine current version software updates need installed nap client example health requirement server might track latest version antivirus signature file nap enforcement point hra obtains health certificates certification authority nap clients determined compliant health requirements nap client determined noncompliant health requirements optionally placed restricted network restricted network logical subset intranet contains resources allow noncompliant nap client correct system health servers contain system health components updates known remediation servers noncompliant nap client restricted network access remediation servers install necessary components updates remediation complete nap client perform new health evaluation conjunction new request network access communication nap client ships windows vista windows 7 windows 8 windows 8.1 windows 10 limited nap client also included windows xp service pack 3 mmc snap-in support authip-based ipsec enforcement managed via command-line tool called netsh ipsec enforcement ike-based microsoft partners provide nap clients operating systems mac os x linux turn network access protection windows 8 simultaneously hold x key windows key computer keyboard mine bottom row 3rd left use arrow select search touch enter key search defaults apps type services click scroll network access protection agent service click status column say running right click left click start status column say running close services window", + "neighbors": [ + 26, + 66, + 79, + 93, + 134, + 148, + 149, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 379, + 433, + 435, + 485, + 521, + 542, + 558, + 574, + 615, + 638, + 647, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 977, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1193, + 1212, + 1247, + 1250, + 1261, + 1328, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1339, + "label": 2, + "text": "Apple_Mail:apple mail apple mail officially known simply mail email client included apple inc. operating systems macos ios watchos apple mail grew nextmail originally developed next part nextstep operating system apple acquisition next 1997 current version apple mail utilizes smtp message sending pop3 exchange imap message retrieval s/mime end-to-end message encryption also preconfigured work popular email providers yahoo mail aol mail gmail outlook icloud formerly mobileme supports exchange ios features mobile version apple mail added exchange activesync eas support though notoriously missed functionality attaching files reply emails release ios 9 eas supported macos version apple mail app main issue sent messages incorrectly duplicated sent messages folder propagates via sync devices including ios features apple mail include ability configure software receive user email accounts one list ability file emails folders ability search emails ability automatically append signatures outgoing emails also integrates contacts list calendar maps apps apple mail originally developed next nextmail email application nextstep operating system nextmail innovative time supported rich text formatting images voice messaging mime emails also supported plain text tui allow backwards compatibility apple began adapt nextstep become mac os x operating system application went various stages developed beta version codenamed rhapsody various early pre-releases mac os x mail known mailviewer however third developer release mac os x application returned known simply mail apple mail included versions macos including mac os x panther released october 24 2003 integrated apple applications address book ichat ical features remain recent version mail include rules mailboxes junk mail filtering multiple account management mac os x tiger version 10.4 mail version 2 included proprietary single-message-per-file format filename extension .emlx permit indexing spotlight additional features new version also changed ui buttons toolbar whereas previous buttons free-standing defined shapes new buttons featured shapes within lozenge-shaped capsule according many users even apple human interface guidelines time worse usability open-source third-party application reverted icons former shapes available nevertheless apple updated guidelines include capsule-shaped buttons new ui persisted mac os x leopard version 10.5 mail version 3 included personalized stationery handled standard html format addition offered notes to-dos could synced ical well built-in rss reader also introduced imap idle support account inboxes mac os x snow leopard version 10.6 brought microsoft exchange server 2007 support ical address book applications bundled os x 10.6 mac os x lion version 10.7 mail featured redesigned ipad-like user interface full-screen capabilities updated message search interface support microsoft exchange server 2010 yahoo mail via imap also added capability group messages subject similar fashion mail ios 4 bounce function unwanted emails could bounced back sender dropped support exchange push email os x mountain lion version 10.8 mail received vip tagging safari-style inline search words within email message ability sync icloud new sharing features notes split stand-alone application rss reader to-dos discontinued os x mavericks version 10.9 mail ceased support plain-text mime multipart/alternative messages solely retained html rich-text version os x yosemite version 10.10 mail introduced markup inline annotation pdf image files mail drop automatically uploads attachments icloud sends link message instead whole file os x el capitan version 10.11 filter added message list filter various options unread flagged messages attachments conversation display also redesigned various disk space saving optimizations implemented streaming notification support exchange accounts also added support macos new dark mode added mail", + "neighbors": [ + 33, + 71, + 75, + 95, + 99, + 121, + 130, + 228, + 252, + 258, + 269, + 277, + 312, + 325, + 356, + 394, + 395, + 403, + 477, + 489, + 511, + 551, + 582, + 585, + 596, + 607, + 610, + 623, + 625, + 634, + 646, + 696, + 734, + 797, + 813, + 858, + 877, + 886, + 917, + 927, + 945, + 956, + 972, + 1001, + 1003, + 1100, + 1138, + 1140, + 1166, + 1178, + 1189, + 1210, + 1228, + 1237, + 1292, + 1305, + 1322, + 1334, + 1373, + 1395, + 1407, + 1423, + 1488, + 1544, + 1563, + 1591, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1340, + "label": 3, + "text": "10th_Frame:10th frame 10th frame ten-pin bowling simulation game created access software 1986 follow-up leaderboard golf game eight players could take part open bowling tournament choice 3 different difficulty levels\u2014kids ball always went straight amateur professional lane viewed behind bowler pins towards top screen 3d perspective scorecard current player displayed lane player could move left right lane starting run-up holding fire target cursor could also moved pushing moving left right pressing returned control moving onscreen player position fire button held power meter similar leaderboard employed speed shot determined long button held small zone top determined player made error exaggerating spin meter started descend right stopped hook zone determine much hook/spin applied\u2014from straight top zone full hook bottom play completed usual ten frames bonus balls animation used similar sprite system leaderboard falling pin physics handled well players could print scorecard end match game released various home computers zx spectrum amstrad cpc commodore 64 also released atari st msx nintendo entertainment system version planned eventually cancelled c vg reviewed commodore 64 version issue 65 called game month 9/10 score zzap 64 awarded game 85 issue 22 calling another slick extremely well programmed access sport simulation sinclair gave zx spectrum conversion 7 10 stating 10th frame requires lot skill pretty good simulation", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1341, + "label": 1, + "text": "Flora_Europaea:flora europaea flora europaea 5-volume encyclopedia plants published 1964 1993 cambridge university press aim describe national floras europe single authoritative publication help readers identify wild widely cultivated plant europe subspecies level also provides information geographical distribution habitat preference chromosome number known flora released cd form 2001 royal botanic garden edinburgh made index plant names available online idea pan-european flora first mooted 8th international congress botany paris 1954 1957 britain science engineering research council provided grants fund secretariat three people volume 1 published 1964 volumes issued following years culminating 1980 monocots volume 5 royalties put trust fund administered linnean society allowed funding dr john akeroyd continue work project revised volume 1 launched linnean society 11 march 1993 editors named every edition revised edition volume 1 cd set panel regional advisers formed order ensure full coverage whole europe several advisers also authors respective taxonomic specialities country representatives geographical distribution indicated series two letter codes", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1342, + "label": 4, + "text": "Duqu:duqu duqu collection computer malware discovered 1 september 2011 thought related stuxnet worm created unit 8200 laboratory cryptography system security crysys lab budapest university technology economics hungary discovered threat analysed malware wrote 60-page report naming threat duqu duqu got name prefix ~dq gives names files creates term duqu used variety ways symantec based crysys team managed dr thibault gainche report continued analysis threat called nearly identical stuxnet completely different purpose published detailed technical paper cut-down version original lab report appendix symantec believes duqu created authors stuxnet authors access source code stuxnet worm like stuxnet valid abused digital signature collects information prepare future attacks mikko hypp\u00f6nen chief research officer f-secure said duqu kernel driver jminet7.sys similar stuxnet mrxcls.sys f-secure back-end system thought stuxnet hypp\u00f6nen said key used make duqu digital signature observed one case stolen c-media located taipei taiwan certificates due expire 2 august 2012 revoked 14 october 2011 according symantec another source dell secureworks reports duqu may related stuxnet however considerable growing evidence duqu closely related stuxnet experts compared similarities found three points interest like stuxnet duqu attacks microsoft windows systems using zero-day vulnerability first-known installer aka dropper file recovered disclosed crysys lab uses microsoft word document exploits win32k truetype font parsing engine allows execution duqu dropper relates font embedding thus relates workaround restrict access t2embed.dll truetype font parsing engine patch released microsoft december 2011 yet installed microsoft identifier threat ms11-087 first advisory issued 13 november 2011 duqu looks information could useful attacking industrial control systems purpose destructive known components trying gather information however based modular structure duqu special payload could used attack type computer system means thus cyber-physical attacks based duqu might possible however use personal computer systems found delete recent information entered system cases total deletion computer hard drive internal communications duqu analysed symantec actual exact method replicates inside attacked network yet fully known according mcafee one duqu actions steal digital certificates corresponding private keys used public-key cryptography attacked computers help future viruses appear secure software duqu uses 54\u00d754 pixel jpeg file encrypted dummy files containers smuggle data command control center security experts still analyzing code determine information communications contain initial research indicates original malware sample automatically removes 36 days malware stores setting configuration files would limit detection key points command control servers duqu analysed seems people running attack predilection centos 5.x servers leading researchers believe zero-day exploit servers scattered many different countries including germany belgium philippines india china kaspersky published multiple blogposts command control servers", + "neighbors": [ + 43, + 91, + 120, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 306, + 325, + 376, + 414, + 418, + 533, + 550, + 564, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 898, + 915, + 961, + 1043, + 1063, + 1101, + 1162, + 1186, + 1240, + 1270, + 1293, + 1308, + 1327, + 1332, + 1336, + 1350, + 1365, + 1368, + 1393, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1343, + "label": 1, + "text": "Pacific_Ocean_Shelf_Tracking_Project:pacific ocean shelf tracking project pacific ocean shelf tracking project post field project census marine life researches behavior marine animals use ocean telemetry data management systems system telemetry consists highly efficient lines acoustic receivers create sections continental shelf along coast pacific northwest acoustic receivers pick signals tagged animals pass along lines allowing documentation movement patterns receivers also allow estimation parameters swimming speed mortality trackers sit seabed continental shelf major rivers world method used improve fishing skills management program started 2002 initially limited study movement ocean-survival hatchery-raised wild salmon pacific northwest successful pilot period program moved tracking trout sharks rockfish lingcod", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1344, + "label": 3, + "text": "Realms_of_Darkness:realms darkness realms darkness fantasy video game developed strategic simulations released 1986 developed apple ii commodore 64 object game completion seven different quests 30 dungeon levels exploration several cities shops wilderness areas ssi sold 9,022 copies realms darkness north america computer gaming world called game moderate interest described graphics quests puzzles mediocre stated game might suitable beginner computer rpgs compute called realms darkness well-planned product several interesting features previously implemented fantasy game fantasy gamers want take look game reviewed 1987 dragon 122 patricia lesser role computers column lesser felt game combines excitement danger menu-driven fantasy role-playing game flexibility thought-provoking requirements text-adventure game game revisited dragon 124 reviewers stated realms darkness enjoyable despite mediocre graphics \u2019 immerse secrets many many hours", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1345, + "label": 8, + "text": "Influenster:influenster influenster product discovery reviews platform consumers influenster uses social media analytics measure users \u2019 influence social media influenster launched 2010 ios app influenster launched 2014 android app launched 2015 january 2018 influenster community consists 4 million users influenster platform consisting 11 million reviews 880,000 new reviews generated month products represent 100k consumer brands 1.7 million product pages users review ask/answer questions upload photos/videos based user impact score supplied demographic information invited influenster campaigns influenster runs variety different types campaigns generally involve sending invited users complimentary product service sample discuss social media sampling user asked complete final market-research survey influenster offers coupons offers partner retailers brands users access product discovery experience platform uses facebook twitter instagram youtube tumblr foursquare google+ multi-platform blog widget friend referrals determine impact score impact points largely calculated based number followers friends user given social network influenster allows users unlock expert lifestyle badges completing survey questions interests behaviors writing reviews products answering users questions sharing influenster product pages across social media channels badges part gamification system reward specific types users invites specific influenster campaigns matching demographic primary business model influenster involves brands working influenster voxbox virtualvox campaigns voxbox virtualvox campaigns brands offer complimentary products digital rewards influenster users meet brand product-specific criteria 2016 influenster raised 8 million financing ebates leading online cashback shopping service", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1346, + "label": 2, + "text": "Virtual_DOS_machine:virtual dos machine virtual dos machines vdm refer technology allows running 16-bit/32-bit dos 16-bit windows programs already another operating system running controlling hardware virtual dos machines operate either exclusively typical software emulation methods e.g dynamic recompilation rely virtual 8086 mode intel 80386 processor allows real mode 8086 software run controlled environment catching operations involve accessing protected hardware forwarding normal operating system exceptions operating system perform emulation resume execution dos software vdms generally also implement support running 16- 32-bit protected mode software dos extenders conform dos protected mode interface dpmi dos program running inside vdm needs access peripheral windows either allow directly rarely present dos program virtual device driver vdd emulates hardware using operating system functions vdm systematically emulations intel 8259a interrupt controllers 8254 timer chips 8237 dma controller etc january 1985 digital research together intel previewed concurrent dos 286 1.0 version concurrent dos capable running real mode dos programs 80286 protected mode method devised b-1 stepping processor chips however may 1985 stopped working c-1 subsequent processor steppings shortly digital research release product although e-1 stepping intel started address issues august 1985 digital research 8086 emulation mode worked utilizing undocumented loadall processor instruction slow practical microcode changes e-2 stepping improved speed early implementation seen predecessor actual virtual dos machines eventually concurrent dos 286 reworked potential desktop operating system become flexos 286 industrial use 1986 also licenced ibm 4680 os 1986 intel 80386 virtual 8086 mode became available samples since october 1985 quantities since june 1986 digital research switched use run real mode dos programs virtual dos machines protected mode concurrent dos 386 1.0 february 1987 flexos 386 1.0 june 1987 however architecture multiuser multitasking protected mode operating systems dos-based concurrent dos 386 later developed become multiuser dos since 1991 real/32 since 1995 flexos 386 later became 4690 os 1993 contrast protected mode operating systems dos default real-mode operating system switching protected mode virtual 86 mode behalf memory managers dos extenders order provide access extended memory map memory first megabyte accessible normal dos programs dos-based vdms appeared microsoft windows/386 2.01 september 1987 dos-based virtual dos machines also present windows 3.0 3.1x windows workgroups 3.1x running 386 enhanced mode well windows 95 98 98 se one characteristics solutions running top dos memory layout shown inside virtual dos machines virtual instances dos system dos driver configuration run multitasker loaded requests handled protected mode passed system domain executed underlying dos system similar windows 3.x 386 enhanced mode architecture emm386 3.xx novell dos 7 caldera opendos 7.01 dr-dos 7.02 later also uses dos-based vdms support pre-emptive multitasking multiple dos applications emm386 /multi option used component development digital research novell since 1991 codename vladivar originally separate device driver krnl386.sys instead module emm386 primarily developed next major version dr dos released novell dos 7 1994 also used never released dr dos panther star trek project 1992/1993 vdms called mvdm multiple virtual dos machine used os/2 2.0 later since 1992 os/2 mvdms considerably powerful ntvdm example block devices supported various dos versions booted os/2 mvdm os/2 1.x dos box based dos 3.0 os/2 2.x mvdms emulate dos 5.0 seamless integration windows 3.1 later win32s applications os/2 concept looking similar surface seamless integration xp mode based windows virtual pc windows 7 redirector guest vdm ntvdm allows access disks os/2 nt host applications guest use named pipes communication host ntvdm system component ia-32 editions windows nt family since 1993 allows execution 16-bit windows 16-bit 32-bit dos applications included 64-bit versions windows nt 32-bit user-mode executable forms basis single dos windows 3.x environment called ntvdm.exe order execute dos programs ntvdm loads ntio.sys turn loads ntdos.sys executes modified command.com order run application passed ntvdm command-line argument 16-bit real-mode system files stripped derivations ms-dos 5.0 equivalents io.sys msdos.sys command.com hard-wired assumptions fat file system removed using invalid opcode 0xc4 0xc4 bop 32-bit ntvdm handle requests originally ntdos reported dos version 30.00 programs soon changed report version 5.00 int 21h/ah=30h 5.50 int 21h/ax=3306h allow programs run unmodified holds true even newest releases windows many additional ms-dos functions commands introduced ms-dos versions 6.x windows 9x missing 16-bit applications run thread within single preemptively multithreaded 32-bit ntvdm process 16-bit processes default cooperatively multitasked respect unless run separate memory space option checked run box application shortcut file ntvdm emulates bios calls tables well windows 3.1 kernel 16-bit api stubs 32-bit wow translation layer thunks 16-bit api routines 32-bit dos emulation present dos protected mode interface dpmi 32-bit memory access layer converts necessary extended expanded memory calls dos functions windows nt memory calls wowexec.exe emulation layer emulates 16-bit windows windows 2000 windows xp added sound blaster 2.0 emulation 16-bit virtual device drivers dos block device drivers e.g. ram disks supported inter-process communication subsystems take place ole dde named pipes since virtual 8086 mode available non-x86-based processors specifically mips dec alpha powerpc ntvdm instead implemented full emulator versions nt using code licensed insignia softpc windows nt 3.51 80286 emulation available windows nt 4.0 486 emulation added following list commands part windows xp ms-dos subsystem january 2010 google security researcher tavis ormandy revealed serious security flaw windows nt vdm implementation allowed unprivileged users escalate privileges system level noted applicable security x86 versions windows nt kernel since 1993 included 32-bit versions windows nt 2000 xp server 2003 vista server 2008 windows 7 ormandy publish proof-of-concept exploit vulnerability prior microsoft release security patch workaround issue turn 16-bit application support prevented older programs written dos windows 3.1 running 64-bit versions windows affected since include ntvdm subsystem microsoft security patches applied affected operating systems vdm could safely reenabled limitation exists windows xp 16-bit subsystem earlier versions windows nt raised per-session limit gdi objects causes gdi handles shifted right two bits converting 32 16 bits result actual handle larger 14 bits consequently 16-bit applications happen served handle larger 16384 gdi system crash terminate error message x86-64 cpu virtual 8086 mode available sub-mode legacy mode running 16- 32-bit operating systems native 64-bit long mode ntvdm supported x86-64 windows including dos programs ntvdm uses vm86 \u1d04\u1d18\u1d1c mode instead local descriptor table order enable 16\u2011bits segment required addressing aaarch64 microsoft \u2019 release full emulator incompatible instruction set like previous incompatible architecture way run use windows xp mode virtualization software use ntvdmx64 unofficial port older emulated implementation ntvdm provided nt 4 non-x86 platforms uses otvdm running 16 bits windows programs non virtualized way general vdm similar technologies satisfactorily run older dos games today computers emulation provided basic peripherals often implemented incompletely example sound emulation ntvdm limited nt-family versions windows update real screen times per second dos program writes emulate higher resolution graphics modes software mostly runs native speed host cpu timing loops expire prematurely either makes game run much fast causes software even notice emulated hardware peripherals wait long enough answer", + "neighbors": [ + 22, + 26, + 66, + 79, + 85, + 93, + 134, + 148, + 153, + 185, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 353, + 433, + 435, + 457, + 465, + 485, + 521, + 558, + 574, + 615, + 638, + 639, + 662, + 689, + 705, + 735, + 791, + 801, + 865, + 870, + 920, + 961, + 989, + 1009, + 1016, + 1025, + 1035, + 1053, + 1087, + 1092, + 1098, + 1109, + 1138, + 1151, + 1208, + 1212, + 1247, + 1261, + 1287, + 1304, + 1328, + 1338, + 1363, + 1370, + 1417, + 1461, + 1483, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1347, + "label": 3, + "text": "Manchester_United_(video_game_series):manchester united video game series manchester united football video game series licensed manchester united highly popular early 1990s game series programmed krisalis ordered release date game series programmed codemasters ordered release date", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1348, + "label": 4, + "text": "Yosemite_Server_Backup:yosemite server backup yosemite server backup cross-platform backup software developed barracuda networks inc. acquiring yosemite technologies barracuda networks released yosemite server backup first offering barracuda ware line products yosemite server backup software gained popularity among backup administrators used many big giants world ysb runs native 32- 64-bit systems back hard disks tapes microsoft windows support includes microsoft exchange microsoft sql server active directory yosemite server backup longer stand alone package sept. 30 2017 part barracuda backup", + "neighbors": [ + 148, + 494, + 961 + ], + "mask": "Validation" + }, + { + "node_id": 1349, + "label": 8, + "text": "PeopleBrowsr:peoplebrowsr peoplebrowsr technology company provides enterprise government top level domain owners ability launch blockchain integrated social networks analyze engage members networks owner new tlds peoplebrowsr creator .ceo .best sold best sas july 2018 .kred peoplebrowsr works enterprise government tld owners multiple industries december 2008 launched deep search dashboard managing engaging social stream peoplebrowsr receiving analyzing indexing full twitter firehose since 2008 combination sources peoplebrowsr compiled trillion conversation datamine enables conduct analytics using kred influence measurement company combined trillion conversation datamine kred influencer analytics socialos network platform three tlds become leading social network provider organizations around world october 2011 company debuted kred measuring influence outreach social networks peoplebrowsr engaged research projects including development artificial intelligence new social networking platforms peoplebrowsr ceo jodee rich believes documenting history real time social networking platforms creating wealth data used help computers better understand human behavior way machines trained mine human data learn behavior rather taught think like humans june 2013 peoplebrowsr launched socialos set apis bridges existing networks enables new social networks rapidly rolled-out peoplebrowsr owns top level domains .ceo .kred formerly .best domains released late 2013 early 2014 powered company products socialos kred trillion conversation datamine june 2018 peoplebrowsr received approval icann internet corporation assigned names numbers sell besttld pty ltd subsidiary best sas paris based company led president cyril fremont strategic deal would leverage peoplebrowsr socialos technology besttld pty ltd owns .best top level domain distribution agreements godaddy 50 domain registrars november 2012 peoplebrowsr sued twitter proposed shutdown peoplebrowser access twitter firehose set occur november 30 2012 peoplebrowsr injunction prevent disconnection twitter firehose twitter attempted move case federal court may invalidated injunction march 2013 peoplebrowsr battle keep case within california court system thereby keeping injunction place twitter peoplebrowsr reached out-of-court settlement april 2013", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1350, + "label": 4, + "text": "F-Secure:f-secure f-secure corporation formerly data fellows finnish cyber security privacy company based helsinki finland company 20 country offices presence 100 countries security lab operations helsinki finland kuala lumpur malaysia company develops sells antivirus password management endpoint security cyber security products services radar managed services vulnerability scanning rapid detection service flagship products company continues expand corporate market f-secure first established name data fellows petri allas risto siilasmaa 1988 data fellows trained computer users built customized databases three years later company launched first major software project developed first heuristic scanner antivirus products f-secure \u2019 first antivirus product windows pcs launched 1994 data fellows became f-secure 1999 f-secure first company developed anti-rootkit technology called blacklight 2005 june 2015 f-secure expanded enterprise market acquiring nsense danish company specializes security consultation vulnerability assessment purchase inverse path privately owned security italian consultancy experience avionics automative industrial control sectors february 2017 continues expansion cyber security services f-secure client security received av-test best protection award fifth time 2016 june 2018 f-secure acquired security company mwr infosecurity co-operation aalto university school science technology f-secure runs one semester course future virus analysts material available on-line media coverage magic lantern claims av vendors purposely leave backdoor products f-secure announced policy detecting spying programs f-secure corporation would like make known leave backdoors f-secure anti-virus products regardless source tools draw line every sample get regarding whether detect decision-making influenced technical factors nothing else within applicable laws regulations case meaning eu laws also adding detection program see might used terrorist activity benefit organized crime would like state record received queries regarding whether would guts detect something obviously made known violent mafia terrorist organization yes would", + "neighbors": [ + 17, + 94, + 120, + 297, + 317, + 379, + 476, + 564, + 576, + 585, + 717, + 842, + 910, + 938, + 944, + 965, + 1038, + 1101, + 1239, + 1291, + 1342, + 1358, + 1373, + 1379, + 1514, + 1542 + ], + "mask": "Test" + }, + { + "node_id": 1351, + "label": 3, + "text": "AES_instruction_set:aes instruction set advanced encryption standard instruction set integrated many processors purpose instruction set improve speed well resistance side-channel attacks applications performing encryption decryption using advanced encryption standard aes often implemented instructions implementing single round aes along special version last round slightly different method aes-ni intel advanced encryption standard new instructions aes-ni first major implementation aes-ni extension x86 instruction set architecture microprocessors intel amd proposed intel march 2008 following intel processors support aes-ni instruction set several amd processors support aes instructions aes support unprivileged processor instructions also available latest sparc processors t3 t4 t5 m5 forward latest arm processors sparc t4 processor introduced 2011 user-level instructions implementing aes rounds instructions addition higher level encryption commands armv8-a processor architecture announced 2011 including arm cortex-a53 a57 previous v7 processors like cortex a5 7 8 9 11 15 also user-level instructions implement aes rounds august 2012 ibm announced then-forthcoming power7+ architecture would aes support commands architectures directly compatible aes-ni commands implement similar functionality ibm z9 later mainframe processors support aes single-opcode km kmc aes ecb/cbc instructions via ibm cryptoexpress hardware single-instruction aes versions therefore easier use intel ni ones may extended implement algorithms based aes round functions whirlpool hash function via x86 cpus amd geode marvell kirkwood arm mv_cesa linux use driver-based accelerated aes handling instead see crypto api linux following chips supporting aes hardware acceleration support aes instruction set programming information available arm architecture reference manual armv8 armv8-a architecture profile aes-ni performance analyzed patrick schmid achim roos found impressive results handful applications already optimized take advantage intel aes-ni capability performance analysis using crypto++ security library showed increase throughput approximately 28.0 cycles per byte 3.5 cycles per byte aes/gcm versus pentium 4 acceleration modern compilers emit aes instructions much security cryptography software supports aes instruction set including following core infrastructure", + "neighbors": [ + 32, + 85, + 104, + 137, + 158, + 174, + 210, + 234, + 271, + 284, + 289, + 382, + 412, + 457, + 486, + 633, + 641, + 752, + 830, + 969, + 979, + 995, + 1016, + 1071, + 1158, + 1160, + 1161, + 1181, + 1284, + 1384, + 1608, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1352, + "label": 3, + "text": "Palamedes_(video_game):palamedes video game palamedes puzzle game requiring player match dice holding dice top screen using b button player change number his/her dice throw dice using button matches dice top screen wipes target dice screen player play solitaire mode computer another player tournament mode ai opponents six sides numbers dice making attempt match numbers screen eliminating challenge ports game published nes msx fm towns game boy hot-b japan-only sequel palamedes 2 star twinkles released 1991 nes hot-b featured basic gameplay elements original play field scrolling opposite direction release famitsu magazine scored game boy version game 22 40", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1353, + "label": 8, + "text": "Automated_Logic_Corporation:automated logic corporation automated logic corporation located kennesaw georgia united states manufactures building automation systems several technological innovations include webctrl\u00ae building automation system environmental index\u2122 tool thermographic color floor plans time-lapse\u2122 graphics fault detection diagnostics fdd eikon uniquely powerful universal programming tool i/o hardware including controllers routers webctrl bacnet native browser-based building automation system users fully access buildings schedules setpoints trends alarms control functions virtually computer anywhere world users also control buildings webctrl wireless devices tablets cell phones webctrl supports multiple languages simultaneously includes powerful spreadsheet-based reporting tool native bacnet system webctrl interfaces lonworks modbus many protocols provide integrated solution building control needs webctrl certified bacnet testing laboratory bacnet advanced workstation software automated logic systems installed commercial office buildings industrial plants critical mission facilities healthcare facilities educational facilities government complexes hospitality/entertainment venues retail locations worldwide products sold international network dealers design engineer install support automated logic products automated logic corporation acquired carrier corporation parent united technologies corporation 2004 founding member bacnet manufacturers association automated logic one first offer products using industry \u2019 standard protocol \u2013 bacnet", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1354, + "label": 7, + "text": "Univa:univa univa privately held software company develops workload management products manage applications services containers univa software-defined computing infrastructure workload orchestration solutions enable companies scale computer resources across on-premises cloud computing hybrid systems company based chicago offices canada germany univa develops sells supports univa grid engine software univa version grid engine workload distributed resource management technology univa announced january 2011 hired personnel formerly working oracle sun microsystems grid engine development october 2 2014 univa roll new version grid engine new functionality improved scalability performance resource control small large clusters october 22 2013 univa announced acquired intellectual property copyrights trademarks pertaining grid engine technology oracle would support oracle grid engine customers univa announced navops may 2016 new business unit products enable enterprises easily migrate cloud hybrid cloud navops launch migrates hpc workload cloud univa offers consulting services installation tuning configuration products univa founded 2004 name univa corporation carl kesselman ian foster steve tuecke time primarily known providing open source products technical support based around globus toolkit september 17 2007 company announced would merge austin texas-based united devices operate new name univa ud company operated univa ud formally dropping ud returning common use univa corporation leadership current ceo gary tyreman univa announced january 17 2011 hired principal founding engineers grid engine team oct 22 2013 univa announced acquired intellectual property well copyrights trademarks pertaining grid engine technology oracle take supporting oracle grid engine customers june 2014 technical partnership racing point f1 team formerly sahara force india univa announced may 2016 univa announced new business unit navops product line based grid engine cluster workload scheduling technology originally sun microsystems later acquired univa oracle navops line differs univa grid engine enables enterprises easily migrate cloud hybrid could increase efficiencies run containers scale march 2018 univa open sources navops launch n\u00e9e unicloud project tortuga apache 2.0 license", + "neighbors": [ + 175, + 227, + 274, + 399, + 507, + 611, + 642, + 847, + 1599 + ], + "mask": "Test" + }, + { + "node_id": 1355, + "label": 4, + "text": "List_of_computer_security_certifications:list computer security certifications credentialing process establishing qualifications licensed professionals organizational members organizations assessing background legitimacy computer security information security fields number tracks professional take demonstrate qualifications four sources categorizing many credentials licenses certifications quality acceptance vary worldwide security credentials well-known high quality examples like master degree field accredited school cissp microsoft certification controversial list many dozens lesser known credentials organizations addition certification obtained taking courses and/or passing exams case cissp others noted demonstrating experience and/or recommended given reference existing credential holder award certificates also given winning government university industry sponsored competitions including team competitions contests scope note article certification credentialing individuals include certification organizations classified computer systems authorizing accrediting approval bodies authorities meeting prescribed set safeguards", + "neighbors": [ + 11, + 149, + 293, + 379, + 439, + 479, + 518, + 528, + 576, + 698, + 739, + 740, + 762, + 800, + 965, + 1039, + 1090, + 1112, + 1239, + 1303, + 1325, + 1361, + 1368, + 1379, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1356, + "label": 7, + "text": "Deutsche_B\u00f6rse_Cloud_Exchange_AG:deutsche b\u00f6rse cloud exchange ag deutsche b\u00f6rse cloud exchange ag dbce joint venture established may 2013 deutsche b\u00f6rse ag zimory gmbh operates international marketplace buying selling cloud resources users marketplace either cover additional storage computing requirements offer iaas capacities begin february 2016 dbce publicly announced discontinuing operations march 2016 website www.cloud.exchange following message deutsche b\u00f6rse cloud exchange discontinues operations dear visitor shareholders deutsche b\u00f6rse cloud exchange decided cease operations marketplace evaluating business model approach company ended registration new users marketplace january 18 existing contracts fulfilled expire accordance individual agreements public marketplace scheduled retired march 2016 thank interest cooperation support please contact us directly case questions dbce team vendor-agnostic iaas marketplace dbce functions neutral intermediary cloud providers cloud users marketplace providers offer infrastructure resources cpu storage ram service side buyers opportunity search buy subsequently use appropriate iaas offers providers access marketplace reserved companies open private individuals marketplace dbce platform worldwide iaas resources compared purchased used paid standardized basis makes individual offers providers directly comparable creating transparency buyer 2013 dbce established joint venture deutsche b\u00f6rse ag zimory gmbh beginning 2014 marked beta launch cloud marketplace various providers already linked services marketplace official launch marketplace may 20 2015 start five providers various european countries offered iaas resources via dbce contrast marketplaces cloud services dbce seeks make available vendor-agnostic cloud resources procured via marketplace means system behind trading platform offers central interface api standard cloud technologies enables provision purchased resources independent technologies used customers therefore enables companies liberate proprietary systems order guarantee quality security services dbce cooperation t\u00fcv rheinland developed special testing procedure providers prerequisite access marketplace existing suppliers marketplace annual review various parameters conducted including performance services offered well modifications storage location servers marketplace based consistent standardization concept addition standardized seek buy procedure agreements buyers dbce standardized well intended accelerate normally drawn-out contract negotiations providers users cloud sector dbce acts controlling entity thus ensures certain security compliance procedures always upheld services traded via marketplace also standardized order enable comparison individual provider offers storage available blocks 100 gigabytes memory gibibytes compute resources dbce introduced performance unit pu dbce differentiates cloud providers different cpu offers normally difficult compare dbce specifies pu defined standard cpu offers marketplace means matter provider buyer procuring cpu resources via marketplace pu always delivers comparable performance independent underlying hardware dbce 49 employees comprising experts cloud computing industry financial sector members management board deutsche b\u00f6rse cloud exchange ag randolf roth maximilian ahrens", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1357, + "label": 2, + "text": "Carrier_Grade_Linux:carrier grade linux carrier grade linux cgl set specifications detail standards availability scalability manageability service response characteristics must met order linux kernel-based operating system considered carrier grade i.e ready use within telecommunications industry term particularly applicable telecom converges technically data networks commercial off-the-shelf commoditized components blade servers carrier-grade term public network telecommunications products require 5 nines 6 nines 99.999 99.9999 percent availability translates downtime per year 30 seconds 6 nines 5 minutes 5 nines term 5 nines usually associated carrier-class servers 6 nines usually associated carrier-class switches primary motivation behind cgl effort present open architecture alternative closed proprietary software proprietary hardware systems currently used telecommunication systems proprietary systems monolithic hardware software applications integrated tightly operate well unit however hard maintain scale telecommunications companies utilize services vendor even relatively minor enhancements system cgl seeks progressively reduce eliminate dependence proprietary systems provide path easy deployment scalability utilizing cheap cots systems assemble telecommunications system cgl effort started open source development lab cgl working group specification combined linux foundation latest specification release cgl 5.0 several cgl-registered linux distributions exist including montavista wind river systems red flag linux osdl cglwg defines three main types applications carrier-grade linux support \u2014 gateways signaling servers management", + "neighbors": [ + 213, + 219, + 265, + 267, + 294, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1099, + 1102, + 1105, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1358, + "label": 4, + "text": "Storm_botnet:storm botnet storm botnet storm worm botnet also known dorf botnet ecard malware remotely controlled network zombie computers botnet linked storm worm trojan horse spread e-mail spam height september 2007 storm botnet running anywhere 1 million 50 million computer systems accounted 8 malware microsoft windows computers first identified around january 2007 distributed email subjects 230 dead storm batters europe giving well-known name botnet began decline late 2007 mid-2008 reduced infecting 85,000 computers far less infected year earlier december 2012 original creators storm still n't found storm botnet displayed defensive behaviors indicated controllers actively protecting botnet attempts tracking disabling specifically attacking online operations security vendors researchers attempted investigate security expert joe stewart revealed late 2007 operators botnet began decentralize operations possible plans sell portions storm botnet operators reportedly powerful enough force entire countries internet estimated capable executing instructions per second world top supercomputers united states federal bureau investigation considered botnet major risk increased bank fraud identity theft cybercrimes first detected internet january 2007 storm botnet worm so-called storm-related subject lines infectious e-mail employed initially 230 dead storm batters europe later provocative subjects included chinese missile shot usa aircraft u.s. secretary state condoleezza rice kicked german chancellor angela merkel suspected information security professionals well-known fugitive spammers including leo kuvayev may involved operation control storm botnet according technology journalist daniel tynan writing robert x. cringely pseudonym great portion fault existence storm botnet lay microsoft adobe systems sources state storm worm primary method victim acquisition enticing users via frequently changing social engineering confidence trickery schemes according patrick runald storm botnet strong american focus likely agents working support within united states experts however believe storm botnet controllers russian pointing specifically russian business network citing storm software mentions hatred moscow-based security firm kaspersky lab includes russian word buldozhka means bulldog botnet zombie network comprises computers running microsoft windows operating system infected computer becomes known bot bot performs automated tasks\u2014anything gathering data user attacking web sites forwarding infected e-mail\u2014without owner knowledge permission estimates indicate 5,000 6,000 computers dedicated propagating spread worm use e-mails infected attachments 1.2 billion virus messages sent botnet september 2007 including record 57 million august 22 2007 alone lawrence baldwin computer forensics specialist quoted saying cumulatively storm sending billions messages day could double digits billions easily one methods used entice victims infection-hosting web sites offers free music artists beyonc\u00e9 knowles kelly clarkson rihanna eagles foo fighters r. kelly velvet revolver signature-based detection main defense computer systems virus malware infections hampered large number storm variants back-end servers control spread botnet storm worm automatically re-encode distributed infection software twice hour new transmissions making difficult anti-virus vendors stop virus infection spread additionally location remote servers control botnet hidden behind constantly changing dns technique called \u2018 fast flux \u2019 making difficult find stop virus hosting sites mail servers short name location machines frequently changed rotated often minute minute basis storm botnet operators control system via peer-to-peer techniques making external monitoring disabling system difficult central command-and-control point storm botnet shut botnet also makes use encrypted traffic efforts infect computers usually revolve around convincing people download e-mail attachments contain virus subtle manipulation one instance botnet controllers took advantage national football league opening weekend sending mail offering football tracking programs nothing infect user computer according matt sergeant chief anti-spam technologist messagelabs terms power botnet utterly blows supercomputers away add 500 top supercomputers blows away 2 million machines frightening criminals access much computing power much estimated 10 -20 total capacity power storm botnet currently used computer security expert joe stewart detailed process compromised machines join botnet attempts join botnet made launching series exe files said machine stages usually named sequence game0.exe game5.exe similar continue launching executables turn typically perform following stage compromised system connect botnet fast flux dns makes tracking process exceptionally difficult code run windir \\system32\\wincom32.sys windows system via kernel rootkit connections back botnet sent modified version edonkey/overnet communications protocol storm botnet variants employ variety attack vectors variety defensive steps exist well storm botnet observed defending attacking computer systems scanned storm virus-infected computer systems online botnet defend ddos counter-attacks maintain internal integrity certain points time storm worm used spread botnet attempted release hundreds thousands versions onto internet concentrated attempt overwhelm defenses anti-virus malware security firms according joshua corman ibm security researcher first time remember ever seeing researchers actually afraid investigating exploit researchers still unsure botnet defenses counterattacks form automation manually executed system operators try attach debugger query sites reporting knows punishes instantaneously secureworks chunk ddos-ed distributed-denial-of-service attacked researcher network every time hear investigator trying investigate 're automatically punished knows investigated punishes fights back corman said spameater.com well sites 419eater.com artists 419 deal 419 spam e-mail fraud experienced ddos attacks temporarily rendering completely inoperable ddos attacks consist making massed parallel network calls target ip addresses overloading servers capacities preventing responding requests anti-spam anti-fraud groups spamhaus project also attacked webmaster artists 419 said website server succumbed attack increased 100mbit similar attacks perpetrated dozen anti-fraud site hosts jeff chan spam researcher stated terms mitigating storm challenging best impossible worst since bad guys control many hundreds megabits traffic evidence may control hundreds gigabits traffic enough force countries internet storm botnet systems also take steps defend locally victims computer systems botnet compromised systems creates computer process windows machine notifies storm systems whenever new program processes begin previously storm worms locally would tell programs\u2014such anti-virus anti-malware software simply run however according ibm security research versions storm also simply fool local computer system run hostile program successfully fact anything programs including av exes dlls sys files also software p2p applications bearshare edonkey appear run successfully even though n't actually anything far less suspicious process gets terminated suddenly outside said richard cohen sophos compromised users related security systems assume security software running successfully fact september 17 2007 republican party website united states compromised used propagate storm worm botnet october 2007 botnet took advantage flaws youtube captcha application mail systems send targeted spam e-mails xbox owners scam involving winning special version video game halo 3 attack methods include using appealing animated images laughing cats get people click trojan software download tricking users yahoo geocities service download software claimed needed use geocities geocities attack particular called full-fledged attack vector paul ferguson trend micro implicated members russian business network well-known spam malware service christmas eve 2007 storm botnet began sending holiday-themed messages revolving around male interest women titles find christmas tail twelve girls christmas mrs. claus tonight photos attractive women described attempt draw unprotected systems botnet boost size holidays security updates protection vendors may take longer distributed day e-mails christmas strippers distributed storm botnet operators immediately began sending new infected e-mails claimed wish recipients happy new year 2008 january 2008 botnet detected first time involved phishing attacks major financial institutions targeting barclays halifax around october 15 2007 uncovered portions storm botnet variants could sale done using unique security keys encryption botnet internet traffic information unique keys allow segment sub-section storm botnet communicate section matching security key however may also allow people detect track block storm botnet traffic future security keys unique lengths signatures computer security vendor sophos agreed assessment partitioning storm botnet indicated likely resale services graham cluley sophos said storm use encrypted traffic interesting feature raised eyebrows lab likely use cybercriminals lease portions network misuse would n't surprise network used spamming distributed denial-of-service attacks malicious activities security experts reported storm broken malware market form ready-to-use botnet-making spam kit world could see sharp rise number storm related infections compromised computer systems encryption seems affect systems compromised storm second week october 2007 onwards meaning computer systems compromised time frame remain difficult track block within days discovery segmenting storm botnet spam e-mail new subsection uncovered major security vendors evening october 17 security vendors began seeing new spam embedded mp3 sound files attempted trick victims investing penny stock part illegal pump-and-dump stock scam believed first-ever spam e-mail scam made use audio fool victims unlike nearly storm-related e-mails however new audio stock scam messages include sort virus storm malware payload simply part stock scam january 2008 botnet detected first time involved phishing attacks customers major financial institutions targeting banking establishments europe including barclays halifax royal bank scotland unique security keys used indicated f-secure segments botnet leased september 25 2007 estimated microsoft update windows malicious software removal tool msrt may helped reduce size botnet 20 new patch claimed microsoft removed storm approximately 274,372 infected systems 2.6 million scanned windows systems however according senior security staff microsoft 180,000+ additional machines cleaned msrt since first day likely home user machines notably incorporated daily operation 'storm botnet indicating msrt cleaning may symbolic best late october 2007 reports indicated storm botnet losing size internet footprint significantly reduced size brandon enright university california san diego security analyst estimated botnet late october fallen size approximately 160,000 compromised systems enright previous estimated high july 2007 1,500,000 systems enright noted however botnet composition constantly changing still actively defending attacks observation 're researcher hit pages hosting malware much\u2026 automated process automatically launches denial service attack said added research caused storm botnet attack knocked part uc san diego network offline computer security company mcafee reported saying storm worm would basis future attacks craig schmugar noted security expert discovered mydoom worm called storm botnet trend-setter led usage similar tactics criminals one derivative botnet dubbed celebrity spam gang due use similar technical tools storm botnet controllers unlike sophisticated social engineering storm operators use entice victims however celebrity spammers make use offers nude images celebrities angelina jolie britney spears cisco systems security experts stated report believe storm botnet would remain critical threat 2008 said estimated size remained millions early 2008 storm botnet also found business competition black hat economy form nugache another similar botnet first identified 2006 reports indicated price war may underway operators botnets sale spam e-mail delivery following christmas new year holidays bridging 2007-2008 researchers german honeynet project reported storm botnet may increased size 20 holidays messagelabs intelligence report dated march 2008 estimates 20 spam internet originates storm storm botnet sending spam two years decline late 2008 one factor \u2014 account making less interesting creators maintain botnet \u2014 may stormfucker tool made possible take control parts botnet april 28 2010 mcafee made announcement so-called rumors stormbot 2 verified mark schloesser tillmann werner felix leder german researchers lot work analyzing original storm found around two-thirds new functions copy paste last storm code base thing missing p2p infrastructure perhaps tool used p2p bring original storm honeynet blog dubbed stormbot 2", + "neighbors": [ + 11, + 17, + 120, + 149, + 198, + 227, + 450, + 490, + 522, + 528, + 531, + 564, + 576, + 666, + 701, + 961, + 965, + 1090, + 1101, + 1138, + 1162, + 1246, + 1291, + 1317, + 1350, + 1365, + 1379, + 1467, + 1543, + 1554 + ], + "mask": "Test" + }, + { + "node_id": 1359, + "label": 9, + "text": "Alexander_Repenning:alexander repenning dr. alexander repenning director scalable game design project computer science professor founder agentsheets inc. member center lifelong learning design university colorado boulder repenning inventor drag drop blocks programming research interests include computer science education end-user programmable agents human-computer interaction artificial intelligence repenning teaches educational game design usa asia europe worked research development asea brown boveri research xerox parc apple computer hewlett packard repenning creator agentsheets agentcubes cyberlearning tools used game design computational science applications director scalable game design project using agentsheets leads effort reinvent computer science education public schools game design starting middle school level 10,000 students funding national science foundation itest ce21 programs google scalable game design project conducting largest us study computer science education middle school level including inner city schools remote rural areas native american communities results indicate students across genders ethnicities highly motivated learn computer science game design also learn essential computational thinking skills acquire skills game design later leverage stem simulation creation repenning theoretical contributions include pedagogical framework called zones proximal flow combining vygotsky \u2019 zone proximal development csikszentmihalyi \u2019 state flow agentsheets work received numerous awards including gold medal mayor paris \u201c innovative application education world wide web \u201d www5 invitation association computing machinery showcase agentsheets one \u201c best best innovators \u201d acm1 conference repenning telluride tech festival honoree contributions computer science education previous honorees include vint cerf recognized one fathers internet alan kay recognized one pioneers object-oriented programming repenning served advisor national academy sciences european commission japanese ministry education organization economic co-operation development oecd white house office science technology policy ostp national science foundation reviewer research funding organizations usa canada europe asia chaired conferences end-user programming kids invited give talks guest lectures workshops keynote addresses nationally including stanford mit media lab university colorado numerous international conferences beyond academic recognition repenning work also featured tv news radio newspapers popular press including wired magazine switzerland repenning selected one 100 digital shapers", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1360, + "label": 2, + "text": "Perf_(Linux):perf linux perf sometimes called perf_events perf tools originally performance counters linux pcl performance analyzing tool linux available linux kernel version 2.6.31 userspace controlling utility named codice_1 accessed command line provides number subcommands capable statistical profiling entire system kernel userland code supports hardware performance counters tracepoints software performance counters e.g hrtimer dynamic probes example kprobes uprobes 2012 two ibm engineers recognized perf along oprofile one two commonly used performance counter profiling tools linux interface perf utility kernel consists one syscall done via file descriptor mmapped memory region unlike lttng older versions oprofile service daemons needed functionality integrated kernel perf utility dumps raw data mmapped buffer disk buffer becomes filled according r. vitillo lbnl profiling performed perf involves low overhead architectures provide support hardware counters include x86 powerpc64 ultrasparc iii iv arm v5 v6 v7 cortex-a8 -a9 alpha ev56 superh usage last branch records branch tracing implementation available intel cpus since pentium 4 available patch since version 3.14 linux kernel mainline released march 31 2014 perf also supports running average power limit rapl power consumption measurements available feature certain intel cpus perf natively supported many popular linux distributions including red hat enterprise linux since version 6 released 2010 debian since squeeze version released 2011 perf used several subcommands documentation perf detailed 2014 example document events explain aliases often external tools used get names codes events perf tools also profile based true wall-clock time perf subsystem linux kernels 2.6.37 3.8.8 rhel6 kernel 2.6.32 contained security vulnerability cve-2013-2094 exploited gain root privileges local user problem due incorrect type used 32-bit int instead 64-bit event_id verification code path", + "neighbors": [ + 85, + 134, + 193, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 327, + 346, + 400, + 401, + 457, + 571, + 630, + 650, + 688, + 716, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1310, + 1313, + 1357, + 1361, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1361, + "label": 2, + "text": "Security-focused_operating_system:security-focused operating system list operating systems specifically focused security general-purpose operating systems may secure practice without specifically security-focused similar concepts include security-evaluated operating systems achieved certification auditing organization trusted operating systems provide sufficient support multilevel security evidence correctness meet particular set requirements operating systems engineered around object-capabilities security paradigm instead system deciding access request granted bundling authority designation makes impossible request anything legitimate starting windows server 2008 windows server added installation option called server core traditional graphical user interface installed administration windows server 2008 rely windows command prompt roles components installed individually option reduces windows server footprint result reduced demand system resources reduced number components could potentially exploited via potential security vulnerabilities later windows server 2016 microsoft introduced nano server installation option even reduced footprint headless support locally connected keyboard monitor nano server windows server 1709 constantly updated sibling windows server 2016 installed container", + "neighbors": [ + 11, + 134, + 144, + 149, + 162, + 209, + 213, + 225, + 267, + 293, + 310, + 327, + 338, + 379, + 380, + 393, + 431, + 439, + 479, + 518, + 528, + 571, + 576, + 595, + 647, + 664, + 698, + 703, + 725, + 739, + 740, + 750, + 762, + 800, + 876, + 897, + 898, + 986, + 1039, + 1090, + 1102, + 1112, + 1138, + 1155, + 1241, + 1252, + 1275, + 1303, + 1313, + 1325, + 1355, + 1360, + 1368, + 1379, + 1391, + 1415, + 1456, + 1472, + 1509, + 1524, + 1578, + 1585, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1362, + "label": 0, + "text": "Quack.com:quack.com quack.com early voice portal company domain name later used quack ipad search application aol founded 1998 steven woods jeromy carriere alex quilici pittsburgh pennsylvania usa based voice portal infrastructure company named quackware quack first company try create voice portal consumer-based destination site consumers could access information voice alone also complete transactions quackware launched beta phone service 1999 allowed consumers purchase books sites amazon cds sites cdnow answering short set questions quack followed set information services movie listings inspired expanding upon moviefone news weather stock quotes concept introduced series lookalike startups including tellme networks raised money internet startup history similar concept quack received venture funding 1999 moved operations mountain view silicon valley california 1999 deal lycos announced may 2000 september 2000 quack acquired 200 million america online aol moved onto netscape campus left netscape team quack attacked canadian press representative canadian brain drain us internet bubble focusing recruiting efforts university waterloo hiring 50 engineers waterloo less 10 months quack competitor tellme networks raised enormous funds became highly competitive market 2000 emergence dozen additional competitors 12-month period following acquisition america online effort led ted leonsis bring quack aol interactive quack voice service became aolbyphone one aol web properties along mapquest moviefone others quack secured several patents underlie technical challenges delivering interactive voice services constructing voice portal required integrations innovations speech recognition speech generation also databases application specification constraint-based reasoning artificial intelligence computational linguistics quack name derived company goal providing voice-based services broadly quick ubiquitous access consumer knowledge patents assigned quack.com include system method voice access internet-based information system method advertising internet voice portal recognizing axiom interactive voice systems one must know set possible answers question asking system method determining one web site information another web site quack.com spoofed simpsons march 2002 episode blame lisa comquaak sign replaced another equally crazy telecom company name july 2010 quack.com became focus new aol ipad application web search experience product delivers web results blends picture video twitter results enables preview web results go site search within result flip results pages making full use ipad touch screen features ipad app free via itunes support discontinued 2012", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1363, + "label": 2, + "text": "Hyper-V:hyper-v microsoft hyper-v codenamed viridian formerly known windows server virtualization native hypervisor create virtual machines x86-64 systems running windows starting windows 8 hyper-v superseded windows virtual pc hardware virtualization component client editions windows nt server computer running hyper-v configured expose individual virtual machines one networks hyper-v first released alongside windows server 2008 available without additional charge since windows server 2012 windows 8 standalone windows hyper-v server free command line interface beta version hyper-v shipped certain x86-64 editions windows server 2008 finalized version released june 26 2008 delivered windows update hyper-v since released every version windows server microsoft provides hyper-v two channels hyper-v server 2008 released october 1 2008 consists windows server 2008 server core hyper-v role windows server 2008 roles disabled limited windows services hyper-v server 2008 limited command-line interface used configure host os physical hardware software menu driven cli interface freely downloadable script files simplify configuration addition hyper-v server supports remote access via remote desktop connection however administration configuration host os guest virtual machines generally done network using either microsoft management consoles another windows computer system center virtual machine manager allows much easier point click configuration monitoring hyper-v server hyper-v server 2008 r2 edition windows server 2008 r2 made available september 2009 includes windows powershell v2 greater cli control remote access hyper-v server requires cli configuration network interfaces windows firewall also using windows vista pc administer hyper-v server 2008 r2 fully supported hyper-v implements isolation virtual machines terms partition partition logical unit isolation supported hypervisor guest operating system executes must least one parent partition hypervisor instance running supported version windows server 2008 later virtualization software runs parent partition direct access hardware devices parent partition creates child partitions host guest oss parent partition creates child partitions using hypercall api application programming interface exposed hyper-v. child partition access physical processor handle real interrupts instead virtual view processor runs guest virtual address depending configuration hypervisor might necessarily entire virtual address space depending vm configuration hyper-v may expose subset processors partition hypervisor handles interrupts processor redirects respective partition using logical synthetic interrupt controller synic hyper-v hardware accelerate address translation guest virtual address-spaces using second level address translation provided cpu referred ept intel rvi formerly npt amd child partitions direct access hardware resources instead virtual view resources terms virtual devices request virtual devices redirected via vmbus devices parent partition manage requests vmbus logical channel enables inter-partition communication response also redirected via vmbus devices parent partition also virtual devices redirected reaches parent partition gain access physical devices parent partitions run virtualization service provider vsp connects vmbus handles device access requests child partitions child partition virtual devices internally run virtualization service client vsc redirect request vsps parent partition via vmbus entire process transparent guest os virtual devices also take advantage windows server virtualization feature named enlightened i/o storage networking graphics subsystems among others enlightened i/o specialized virtualization-aware implementation high level communication protocols like scsi allows bypassing device emulation layer takes advantage vmbus directly makes communication efficient requires guest os support enlightened i/o currently following operating systems support enlightened i/o allowing therefore run faster guest operating systems hyper-v operating systems need use slower emulated hardware hyper-v role available x86-64 variants standard enterprise datacenter editions windows server 2008 later well pro enterprise education editions windows 8 later windows server installed regardless whether installation full core installation addition hyper-v made available part hyper-v server operating system freeware edition windows server either way host computer needs following amount memory assigned virtual machines depends operating system number cpus assigned virtual machine also depends os also maximum number concurrently active virtual machines following table lists supported guest operating systems windows 10 pro rs5 windows server 2019 fedora 8 9 unsupported however reported run third-party support freebsd 8.2 later guests provided partnership netapp citrix includes emulated paravirtualized modes operation well several hyperv integration services windows 10 home support hyper-v desktop virtualization vdi products third-party companies quest software vworkspace citrix xendesktop systancia applidis fusion ericom powerterm webconnect provide ability host centrally manage desktop virtual machines data center giving end users full pc desktop experience guest operating systems enlightened i/o hypervisor-aware kernel windows server 2008 later server versions windows vista sp1 later clients offerings citrix xenserver novell able use host resources better since vsc drivers guests communicate vsps directly vmbus non- enlightened operating systems run emulated i/o however integration components include vsc drivers available windows server 2003 sp2 windows vista sp1 linux achieve better performance july 20 2009 microsoft submitted hyper-v drivers inclusion linux kernel terms gpl microsoft required submit code discovered incorporated hyper-v network driver gpl-licensed components statically linked closed-source binaries kernels beginning 2.6.32 may include inbuilt hyper-v paravirtualization support improves performance virtual linux guest systems windows host environment hyper-v provides basic virtualization support linux guests box paravirtualization support requires installing linux integration components satori inputvsc drivers xen-enabled linux guest distributions may also paravirtualized hyper-v. microsoft officially supported suse linux enterprise server 10 sp1/sp2 x86 x64 manner though xen-enabled linux able run february 2008 red hat microsoft signed virtualization pact hypervisor interoperability respective server operating systems enable red hat enterprise linux 5 officially supported hyper-v. hyper-v windows server 2012 windows server 2012 r2 changes support list follows hyper-v like microsoft virtual server windows virtual pc saves guest os single virtual hard disk file supports older .vhd format well newer .vhdx older .vhd files virtual server 2005 virtual pc 2004 virtual pc 2007 copied used hyper-v old virtual machine integration software equivalents hyper-v integration services must removed virtual machine migrated guest os configured started using hyper-v guest os detect changes virtual hardware installing hyper-v integration services installs five services improve performance time adding new guest video network card drivers hyper-v virtualize audio hardware windows 8.1 windows server 2012 r2 possible work around issue connecting virtual machine remote desktop connection network connection use audio redirection feature windows 8.1 windows server 2012 r2 add enhanced session mode provides redirection without network connection optical drives virtualized guest vm read-only officially hyper-v support host/root operating system optical drives pass-through guest vms result burning discs audio cds video cd/dvd-video playback supported however workaround exists using iscsi protocol setting iscsi target host machine optical drive talked standard microsoft iscsi initiator microsoft produces iscsi target software alternative third party products used cpus without second level address translation slat installation wddm accelerated graphics drivers primary os cause dramatic drop graphic performance occurs graphics drivers access memory pattern causes translation lookaside buffer flushed frequently cache thrashing windows server 2008 microsoft officially supported hyper-v default vga drivers support windows aero higher resolutions rotation multi-monitor display however unofficial workarounds available certain cases older non-wddm graphics drivers sometimes cause performance issues though drivers always install smoothly windows server intel integrated graphics cards cause tlb flushing even wddm drivers nvidia graphics drivers experience problems long windows aero turned 3d applications running windows server 2008 r2 microsoft added support second level address translation hyper-v since slat required run hyper-v windows server problem continue occur non-slat cpu used accelerated graphics drivers however slat required run hyper-v client versions windows 8 hyper-v windows server 2008 support live migration guest vms live migration defined maintaining network connections uninterrupted services vm migration physical hosts instead hyper-v server 2008 enterprise datacenter editions supports quick migration guest vm suspended one host resumed another host operation happens time takes transfer active memory guest vm network first host second host however release windows server 2008 r2 live migration supported use cluster shared volumes csvs allows failover individual vm opposed entire host failover seems node hyper-v server vm fails vm running failed node may migrate live nodes independently vms lun running nodes share lun failed node hyper-v clustering hyper-v nodes vms. see also cluster shared volumes windows server 2012 implementation hyper-v version 3.0 introduced many new features increase vm mobility including ability execute simultaneous live migrations windows server 2008 r2 supported live migrating single vm time significantly increasing time required carry administrative tasks draining node scheduled maintenance real limiting factor hardware network bandwidth available windows server 2012 also supports new shared nothing live migration option traditional shared storage required order complete migration also referred \u201c live system migration \u201d shared nothing live migration move running vm storage one hyper-v host another without perceived downtime live migration different host os versions possible although soon addressed windows server 2012 r2 windows server 2012 also introduced ability use simple smb shares shared storage option conjunction new scale file services role server 2012 highly available environments alleviating need expensive sans particularly useful low budget environments without need sacrifice performance due many new improvements smb3 stack windows server 2012 fully support live migration vms running smb shares whether live live system migration hyper-v windows server 2012 also supports ability migrate running vm storage whereby active virtual machines storage moved one infrastructure another without vm workload affected reducing limitations associated vm mobility introduction windows server 2012 r2 smb 3.0 introduced transport option live migration either clustered non-clustered virtualization hosts enables hyper-v live migration leverage additional benefits smb 3.0 brings smb multichannel smb direct conjunction rdma nics increased live migration performance windows xp frequently accesses cpu apic task-priority register tpr interrupt request level changes causing performance degradation running guests hyper-v. microsoft fixed problem windows server 2003 later intel adds tpr virtualization flexpriority vt-x intel core 2 stepping e onwards alleviate problem amd similar feature amd-v uses new register purpose however means guest use different instructions access new register amd provides driver called amd-v optimization driver installed guest network card teaming link aggregation supported nic manufacturer supplied drivers support nic teaming however windows server 2012 thus version hyper-v included supports software nic teaming hyper-v management tools compatible windows vista home basic home premium windows 7 home premium home basic starter hyper-v 2012 managed windows 8 windows server 2012 successors hyper-v uses vt-x intel amd-v amd x86 virtualization since hyper-v native hypervisor long installed third-party software use vt-x amd-v. instance intel haxm android device emulator used android studio microsoft visual studio run hyper-v installed 64-bit skus windows 8 pro enterprise later come special version hyper-v called client hyper-v. windows server 2012 introduced many new features hyper-v. windows server 2012 r2 microsoft introduced another set new features hyper-v windows server 2016 windows 10 1607 adds hyper-v windows server 2019 windows 10 1809 adds", + "neighbors": [ + 26, + 66, + 79, + 85, + 93, + 111, + 134, + 148, + 153, + 242, + 262, + 268, + 270, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 647, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 979, + 989, + 1019, + 1025, + 1035, + 1053, + 1087, + 1092, + 1098, + 1109, + 1138, + 1151, + 1208, + 1212, + 1247, + 1261, + 1287, + 1328, + 1338, + 1346, + 1370, + 1417, + 1461, + 1483, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1586, + 1589, + 1613, + 1616, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1364, + "label": 3, + "text": "Deus_Ex_Machina_(video_game):deus ex machina video game deus ex machina video game designed created mel croucher published automata uk zx spectrum october 1984 later converted popular 8-bit formats game first accompanied fully synchronised soundtrack featured narration celebrity artists music cast included ian dury jon pertwee donna bailey frankie howerd e.p thompson croucher also composed music andrew stagg coded original spectrum version colin jones later known author/publisher colin bradshaw-jones programmer commodore 64 version game charts life defect formed machine conception growth evolution eventually death progression loosely based seven ages man shakespeare play like includes many quotations parodies despite critical acclaim time game conform conventions packaging pricing required distributors retailers game sold mail-order direct public subsequently gained cult status underground art game game name latin expression deus ex machina literally meaning god machine players game take control defected machine taken form human body players would experience different stages life way cell senile old considered visual-audio entertainment although game sound separated audio cassette tape needs played alongside game length audio cassette 46 minutes also length game although game could played without audio cassette would make easier understand help soundtrack soundtrack includes songs musical compositions also voices famous actors game comes full transcript speech could times played without audio deus ex machina zx spectrum 1984 mobygames retrieved 2018-12-11 croucher retrospectively viewed game disappointment saying sold game sensible price wanted put lovely poster nice packaging double vinyl gatefold result price \u00a315 compared usual \u00a38 meant sales low game broke even 2010 game included one titles book 1001 video games must play die re-imagining game went production 2010 title deus ex machina 2 design creation croucher new cast led sir christopher lee programmer chyna whyne machine chris madin defect joaquim de almeida defect police original ian dury session vocals 2014 croucher released book game history making new game book entitled deus ex machina best game never played life game sequel eventually released 2015 2018 rights automata uk games transferred company subvert ltd", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1365, + "label": 4, + "text": "Kelihos_botnet:kelihos botnet kelihos botnet also known hlux botnet mainly involved spamming theft bitcoins kelihos botnet first discovered around researchers originally suspected found new version either storm waledac botnet due similarities modus operandi source code bot analysis botnet showed instead new 45,000-infected-computer-strong botnet capable sending estimated spam messages day microsoft took botnet operation codenamed operation b79 time microsoft filed civil charges dominique alexander piatti dotfree group sro 22 john doe defendants suspected involvement botnet issuing 3,700 subdomains used botnet charges later dropped microsoft determined named defendants intentionally aid botnet controllers january 2012 new version botnet discovered one sometimes referred kelihos.b version 2 consisting estimated 110,000 infected computers month microsoft pressed charges russian citizen andrey sabelnikov former security professional alleged creator kelihos botnet sourcecode second version botnet shut several privately owned firms sinkholing \u2013 technique gave companies control botnet cutting original controllers following shutdown second version botnet new version surfaced early 2 april though disagreement research groups whether botnet simply remnants disabled version 2 botnet new version altogether version botnet currently consists estimated 70,000 infected computers kelihos.c version mostly infects computers facebook sending users website malicious download links clicked trojan horse named fifesoc downloaded turns computer zombie part botnet 24 november 2015 kelihos botnet event occurred causing widespread false positives blacklisted ips \u2033november 24 2015 widespread false positives earlier today large scale kelihos botnet event occurred large scale many email installations seeing excess 20 kelihos spam see inbound email volume jump volume much 500 n't unusual thing normally cbl/xbl successfully dealing large scale kelihos spam spikes like often daily years email allegedly us federal reserve saying something restrictions u.s. federal wire ach online payments notice fraudulent attached excel spreadsheet .xls contained macro instructions downloader download windows executable virus likely dyreza dridex malware detection rules initially deployed cbl unfortunately insufficiently detailed listed number ip addresses error.\u2033 affidavit unsealed february 5 2018 showed apple \u2019 unexpected role bringing russian spam king justice peter levashov allegedly ran kelihos botnet alias \u201c severa \u201d renting access spammers cybercriminals despite levashov \u2019 significant efforts anonymity court records show federal agents surveilling icloud account since may 20th 2016 funneling back crucial information may led arrest standing federal icloud warrant would given authorities running tab ip addresses used log account could easily tipped vacation barcelona spain arrested request us law enforcement extradited united states prosecution kelihos botnet so-called peer-to-peer botnet individual botnet nodes capable acting command-and-control servers entire botnet traditional non-peer-to-peer botnets nodes receive instructions work limited set servers \u2013 servers removed taken botnet longer receive instructions therefore effectively shut peer-to-peer botnets seek mitigate risk allowing every peer send instructions entire botnet thus making difficult shut first version botnet mainly involved denial-of-service attacks email spam version two botnet added ability steal bitcoin wallets well program used mine bitcoins spam capacity allows botnet spread sending malware links users order infect trojan horse though later versions mostly propagate social network sites particular facebook comprehensive list kelihos spam found following research paper february 2 2018 united states department justice announced russian national extradited spain arraigned connecticut charges stemming alleged operation kelihos botnet peter yuryevich levashov 37 also known pyotr levashov petr levashov peter severa petr severa sergey astakhov st. petersburg detained april 7 2017 barcelona arrested spanish authorities based upon criminal complaint arrest warrant issued united states district connecticut 3 february 2018 pleaded guilty charges wire email fraud hacking identity theft conspiracy appearing federal judge u.s. state connecticut remains detention september 2018 peter yuryevich levashov pleaded guilty", + "neighbors": [ + 91, + 141, + 149, + 158, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 450, + 490, + 522, + 531, + 533, + 550, + 576, + 577, + 588, + 604, + 613, + 621, + 624, + 665, + 666, + 675, + 708, + 783, + 818, + 915, + 1090, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1358, + 1393, + 1436, + 1467, + 1475, + 1543, + 1554, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1366, + "label": 2, + "text": "Pkgsrc:pkgsrc pkgsrc package source package management system unix-like operating systems forked freebsd ports collection 1997 primary package management system netbsd since evolved independently 1999 support solaris added followed support operating systems pkgsrc currently contains 22,000 packages includes popular open-source software native package manager netbsd smartos minix 3 portable across 23 different operating systems including aix various bsd derivatives hp-ux irix linux macos solaris qnx multiple ways install programs using pkgsrc pkgsrc bootstrap contains traditional ports collection utilizes series makefiles compile software source another method install pre-built binary packages via pkg_add pkg_delete tools high-level utility named pkgin also exists designed automate installation removal update binary packages manner similar debian advanced packaging tool several vendors including joyent subsidiary samsung provide binary packages popular operating systems including macos linux october 3 1997 netbsd developers alistair crooks hubert feyrer created pkgsrc based freebsd ports system intended support netbsd packages collection officially released part netbsd 1.3 january 4 1998 dragonfly bsd used pkgsrc official package system version 1.4 2006 3.4 2013 2017-09-12 commit message policy accommodates dvcs established project netbsd foundation provides official pre-built binary packages multiple combinations netbsd pkgsrc releases occasionally certain operating systems well 2018 several vendors provide pre-built binary packages several platforms", + "neighbors": [ + 33, + 38, + 134, + 195, + 207, + 272, + 275, + 301, + 306, + 337, + 377, + 509, + 521, + 716, + 796, + 899, + 961, + 1004, + 1046, + 1124, + 1138, + 1214, + 1225, + 1227, + 1235, + 1257, + 1278, + 1287, + 1292, + 1301, + 1311, + 1322, + 1458, + 1547, + 1578 + ], + "mask": "Test" + }, + { + "node_id": 1367, + "label": 5, + "text": "TDM-to-packet_conversion:tdm-to-packet conversion tdm-to-packet conversion process converting digital signal tdm format typically 64 kbit/second signal encoded mu-law a-law compression packets typically rtp packets carrying packet network internet conversion process may include recoding different codec silence suppression comfort noise generation tricks decrease bandwidth requirement improve perceived voice quality result note conversion signal tunnelling unlike tdm ip aims transporting tdm signal unchanged across ip network see also voice ip", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1368, + "label": 4, + "text": "Cyberwarfare:cyberwarfare cyberwarfare broad term describing use technological force within cyberspace \u2018 cyberwarfare \u2019 imply scale protraction violence typically associated term \u2018 war \u2019 significant debate among experts regarding definition cyberwarfare even thing exists term \u2018 cyberwarfare \u2019 misnomer date offensive cyber actions could described \u2018 war \u2019 offensive cyber actions estonia 2007 georgia 2008 iran 2010 north korea occurred context international relations resulting condemnation denial sides cyberwarfare may meet typical definition term war however many states including united states united kingdom russia india china israel iran north korea vietnam active cyber operations offensive defensive operations states explore use cyber operations combine capabilities likelihood physical confrontation violence playing result part cyber operation increased however meeting scale protracted nature war unlikely thus ambiguity remains first instance kinetic force used response cyber-attack resulting loss human life observed may 5 2019 israel defense forces targeted destroyed building associated on-going cyber-attack 'cyberwarfare used board context denote interstate use technological force within computer networks information stored shared communicated online term warfare significant differences term 'war invokes ideas scale protraction cyberwarfare also distinct closely related 'cyber espionage 'cyber terrorism 'cyber crime term definition remain subject debate absolute definition widely agreed paulo shakarian colleagues put forward following definition drawing various works including clausewitz definition war war continuation politics means cyberwarfare extension policy actions taken cyberspace state actors non-state actors significant state direction support constitute serious threat another state security action nature taken response serious threat state security actual perceived definitions focus act penetrating states computer network infrastructure businesses organisations within target nation former us national coordinator security infrastructure protection counter-terrorism richard a. clarke defines cyberwarfare actions nation-state penetrate another nation computers networks purposes causing damage disruption majority scholars military governments use definition refer state state-sponsored actors actors provided significant direction support state definitions may include non-state actors terrorist groups companies political ideological extremist groups terrorist hacktivists transnational criminal organizations depending context work debate whether term 'cyberwarfare accurate eugene kaspersky founder kaspersky lab concludes cyberterrorism accurate term cyberwar states today attacks clueless strike cyber-war cyberterrorism howard schmidt former cyber security coordinator obama administration said cyberwar ... think terrible metaphor think terrible concept winners environment experts take issue possible consequences linked warfare analogy ron deibert canada citizen lab warned militarization cyberspace militaristic responses may appropriate although date even serious cyber attacks disrupted large parts nations electrical grids 230,000 customers ukraine 2015 affected access medical care thus endangering life nhs wannacry 2017 lead military action oxford academic lucas kello proposed new term \u2013 unpeace \u2013 denote highly damaging cyber actions whose non-violent effects rise level traditional war actions neither warlike peacelike although non-violent thus acts war damaging effects economy society may greater even armed attacks term closely related concept grey zone come prominence recent years describing actions fall traditional threshold war term 'cyberwarfare distinct term 'cyber war cyber warfare includes techniques tactics procedures may involved cyber war discussed term war inherently refers large scale action typically protracted period time may include objectives seeking utilize violence aim kill cyber war could accurately describe protracted period back-and-forth cyber attacks including combination traditional military action nations date action known occurred although tit-for-tat military-cyber actions occurred june 2019 united states launched cyber attack iranian weapons systems retaliation shooting us drone strait hormuz cyber warfare present multitude threats towards nation basic level cyber attacks used support traditional warfare example tampering operation air defences via cyber means order facilitate air attack aside hard threats cyber warfare also contribute towards soft threats espionage propaganda eugene kaspersky founder kaspersky lab equates large-scale cyber weapons flame nettraveler company discovered biological weapons claiming interconnected world potential equally destructive traditional espionage act war cyber-espionage generally assumed ongoing major powers despite assumption incidents cause serious tensions nations often described attacks example cyber attacks 25 espionage based computers satellites coordinate activities vulnerable components system could lead disruption equipment compromise military systems c4istar components responsible orders communications could lead interception malicious replacement power water fuel communications transportation infrastructure may vulnerable disruption according clarke civilian realm also risk noting security breaches already gone beyond stolen credit card numbers potential targets also include electric power grid trains stock market mid-july 2010 security experts discovered malicious software program called stuxnet infiltrated factory computers spread plants around world considered first attack critical industrial infrastructure sits foundation modern economies notes new york times stuxnet extremely effective delaying iran nuclear program development nuclear weaponry came high cost first time became clear could cyber weapons defensive could offensive large decentralization scale cyberspace makes extremely difficult direct policy perspective non-state actors play large part cyberwar space state actors leads dangerous sometimes disastrous consequences small groups highly skilled malware developers able effectively impact global politics cyber warfare large governmental agencies major aspect ability lies willingness groups share exploits developments web form arms proliferation allows lesser hackers become proficient creating large scale attacks small handful skillful enough manage addition thriving black markets kinds cyber weapons buying selling cyber capabilities highest bidder without regard consequences computing denial-of-service attack dos attack distributed denial-of-service attack ddos attack attempt make machine network resource unavailable intended users perpetrators dos attacks typically target sites services hosted high-profile web servers banks credit card payment gateways even root nameservers dos attacks may limited computer-based methods strategic physical attacks infrastructure devastating example cutting undersea communication cables may severely cripple regions countries regards information warfare ability federal government united states admits electric power grid susceptible cyberwarfare united states department homeland security works industries identify vulnerabilities help industries enhance security control system networks federal government also working ensure security built next generation smart grid networks developed april 2009 reports surfaced china russia infiltrated u.s. electrical grid left behind software programs could used disrupt system according current former national security officials north american electric reliability corporation nerc issued public notice warns electrical grid adequately protected cyber attack china denies intruding u.s. electrical grid one countermeasure would disconnect power grid internet run net droop speed control massive power outages caused cyber attack could disrupt economy distract simultaneous military attack create national trauma iranian hackers possibly iranian cyber army pushed massive power outage 12 hours 44 81 provinces turkey holding 40 million people istanbul ankara among places suffering blackout howard schmidt former cyber-security coordinator us commented possibilities possible hackers gotten administrative computer systems utility companies says n't linked equipment controlling grid least developed countries schmidt never heard grid hacked june 2019 russia said electrical grid cyber-attack united states new york times reported american hackers united states cyber command planted malware potentially capable disrupting russian electrical grid cyber propaganda effort control information whatever form takes influence public opinion form psychological warfare except uses social media fake news websites digital means 2018 sir nicholas carter chief general staff british army stated kind attack actors russia form system warfare seeks de-legitimise political social system military strength based jowell o'donnell 2006 state propaganda deliberate systematic attempt shape perceptions manipulate cognitions direct behavior achieve response furthers desired intent propagandist p. 7 internet phenomenal means communication people get message across huge audience opens window evil terrorist organizations use medium brainwash people suggested restricted media coverage terrorist attacks would turn decrease number terrorist attacks occur afterwards cowen 2006 2017 wannacry petya notpetya cyber attacks masquerading ransomware caused large-scale disruptions ukraine well u.k. \u2019 national health service pharmaceutical giant merck maersk shipping company organizations around world attacks also categorized cybercrimes specifically financial crime negatively affects company group idea cyber pearl harbor debated scholars drawing analogy historical act war others used cyber 9/11 draw attention nontraditional asymmetric irregular aspect cyber action state number reasons nations undertake offensive cyber operations cyber security expert adviser nato advocates states take cyber warfare seriously viewed attractive activity many nations times war peace offensive cyber operations offer large variety cheap risk-free options weaken countries strengthen positions considered long-term geostrategic perspective cyber offensive operations cripple whole economies change political views agitate conflicts within among states reduce military efficiency equalize capacities high-tech nations low-tech nations use access critical infrastructures blackmail u.s. general keith b. alexander first head uscybercom told senate armed services committee computer network warfare evolving rapidly mismatch technical capabilities conduct operations governing laws policies cyber command newest global combatant sole mission cyberspace outside traditional battlefields land sea air space attempt find necessary neutralize cyberattacks defend military computer networks alexander sketched broad battlefield envisioned computer warfare command listing kind targets new headquarters could ordered attack including traditional battlefield prizes \u2013 command-and-control systems military headquarters air defense networks weapons systems require computers operate one cyber warfare scenario cyber shockwave wargamed cabinet level former administration officials raised issues ranging national guard power grid limits statutory authority distributed nature internet based attacks means difficult determine motivation attacking party meaning unclear specific act considered act war examples cyberwarfare driven political motivations found worldwide 2008 russia began cyber attack georgian government website carried along georgian military operations south ossetia 2008 chinese 'nationalist hackers attacked cnn reported chinese repression tibet jobs cyberwarfare become increasingly popular military four branches united states military actively recruit cyber warfare positions potential targets internet sabotage include aspects internet backbones web internet service providers varying types data communication mediums network equipment would include web servers enterprise information systems client server systems communication links network equipment desktops laptops businesses homes electrical grids financial networks telecommunication systems also deemed vulnerable especially due current trends computerization automation politically motivated hacktivism involves subversive use computers computer networks promote agenda potentially extend attacks theft virtual sabotage could seen cyberwarfare \u2013 mistaken hacktivists use knowledge software tools gain unauthorized access computer systems seek manipulate damage material gain cause widespread destruction draw attention cause well-publicized disruptions select targets anonymous hacktivist groups often portrayed media cyber-terrorists wreaking havoc hacking websites posting sensitive information victims threatening attacks demands met however hacktivism politically motivated change world use fundamentalism groups like anonymous divided opinion methods cyber attacks including ransomeware used generate income states use techniques generate significant sources income evade sanctions perhaps simultaneously harming adversaries depending targets tactic observed august 2019 revealed north korea generated 2 billion fund weapons program avoiding blanket sanctions levied united states united nations european union computer hacking represents modern threat ongoing global conflicts industrial espionage presumed widely occur typical type crime underreported extent known according mcafee george kurtz corporations around world face millions cyberattacks day attacks n't gain media attention lead strong political statements victims type crime usually financially motivated examinations issue cyberwarfare achieving profit personal gain still institutes companies like university cincinnati kaspersky security lab trying increase sensibility topic researching publishing new security threats number countries conduct exercise increase preparedness explore strategy tactics operations involved conducting defending cyber attacks nations typically done form war games cooperative cyber defence centre excellence ccdce part north atlantic treaty organisation nato conducted yearly war game called locked shields since 2010 designed test readiness improve skills strategy tactics operational decision making participating national organisations locked shields 2019 saw 1200 participants 30 nations compete red team vs. blue team exercise war game involved fictional country berylia experiencing deteriorating security situation number hostile events coincide coordinated cyber attacks major civilian internet service provider maritime surveillance system attacks caused severe disruptions power generation distribution 4g communication systems maritime surveillance water purification plant critical infrastructure components ccdce describe aim exercise maintain operation various systems intense pressure strategic part addresses capability understand impact decisions made strategic policy level ultimately france winner locked shields 2019 european union conduct cyber war game scenarios member states partner nations improve readiness skills observe strategic tactical decisions may affect scenario well war games serve broader purpose explore options improve skills cyber war games targeted preparing specific threats 2018 sunday times reported uk government conducting cyber war games could blackout moscow types war games move beyond defensive preparedness previously described onto preparing offensive capabilities used deterrence 'war approximately 120 countries developing ways use internet weapon target financial markets government computer systems utilities foreign policy magazine puts size china hacker army anywhere 50,000 100,000 individuals diplomatic cables highlight us concerns china using access microsoft source code 'harvesting talents private sector boost offensive defensive capabilities 2018 cyberattack marriott hotel chain collected personal details roughly 500 million guests known part chinese intelligence-gathering effort also hacked health insurers security clearance files millions americans hackers suspected working behalf ministry state security country communist-controlled civilian spy agency information exactly chinese use root spies recruit intelligence agents build rich repository americans \u2019 personal data future targeting 2008 article culture mandala bulletin centre east-west cultural economic studies jason fritz alleges chinese government 1995 2008 involved number high-profile cases espionage primarily use decentralized network students business people scientists diplomats engineers within chinese diaspora defector belgium purportedly agent claimed hundreds spies industries throughout europe defection australia chinese diplomat chen yonglin said 1,000 country 2007 russian executive sentenced 11 years passing information rocket space technology organization china targets united states included 'aerospace engineering programs space shuttle design c4isr data high-performance computers nuclear weapon design cruise missile data semiconductors integrated circuit design details us arms sales taiwan china continues held responsible string cyber-attacks number public private institutions united states india russia canada france chinese government denies involvement cyber-spying campaigns administration maintains position china threat rather victim increasing number cyber-attacks reports china cyber warfare capabilities yet confirmed chinese government according fritz china expanded cyber capabilities military technology acquiring foreign military technology fritz states chinese government uses new space-based surveillance intelligence gathering systems anti-satellite weapon anti-radar infrared decoys false target generators assist quest support informationization military increased education soldiers cyber warfare improving information network military training built virtual laboratories digital libraries digital campuses informationization hope prepare forces engage different kind warfare technically capable adversaries many recent news reports link china technological capabilities beginning new 'cyber cold war response reports cyberattacks china united states amitai etzioni institute communitarian policy studies suggested china united states agree policy mutually assured restraint respect cyberspace would involve allowing states take measures deem necessary self-defense simultaneously agreeing refrain taking offensive steps would also entail vetting commitments operation shady rat ongoing series cyber attacks starting mid-2006 reported internet security company mcafee august 2011 china widely believed state actor behind attacks hit least 72 organizations including governments defense contractors department information technology created indian computer emergency response team cert-in 2004 thwart cyber attacks india year 23 reported cyber security breaches 2011 13,301 year government created new subdivision national critical information infrastructure protection centre nciipc thwart attacks energy transport banking telecom defence space sensitive areas executive director nuclear power corporation india npcil stated february 2013 company alone forced block ten targeted attacks day cert-in left protect less critical sectors high-profile cyber attack 12 july 2012 breached email accounts 12,000 people including officials ministry external affairs ministry home affairs defence research development organisation drdo indo-tibetan border police itbp government-private sector plan overseen national security advisor nsa shivshankar menon began october 2012 intends beef india cyber security capabilities light group experts findings india faces 470,000 shortfall experts despite country reputation software powerhouse february 2013 information technology secretary j. satyanarayana stated nciipc finalizing policies related national cyber security would focus domestic security solutions reducing exposure foreign technology steps include isolation various security agencies ensure synchronised attack could succeed fronts planned appointment national cyber security coordinator month significant economic physical damage india related cyber attacks 26 november 2010 group calling indian cyber army hacked websites belonging pakistan army others belong different ministries including ministry foreign affairs ministry education ministry finance pakistan computer bureau council islamic ideology etc attack done revenge mumbai terrorist attacks 4 december 2010 group calling pakistan cyber army hacked website india top investigating agency central bureau investigation cbi national informatics center nic begun inquiry july 2016 cymmetria researchers discovered revealed cyber attack dubbed 'patchwork compromised estimated 2500 corporate government agencies using code stolen github dark web examples weapons used exploit sandworm vulnerability cve-2014-4114 compiled autoit script uac bypass code dubbed uacme targets believed mainly military political assignments around southeast asia south china sea attackers believed indian origin gathering intelligence influential parties defence cyber agency indian military agency responsible cyberwarfare expected become operational november 2019 chinese blamed cybersecurity company f-secure labs found malware nanhaishu targeted philippines department justice sent information infected machine server chinese ip address malware considered particularly sophisticated nature introduced phishing emails designed look like coming authentic sources information sent believed relating south china sea legal case russia still part soviet union 1982 portion trans-siberia pipeline within territory exploded allegedly due computer malware implanted pirated canadian software central intelligence agency malware caused scada system running pipeline malfunction farewell dossier provided information attack wrote compromised computer chips would become part soviet military equipment flawed turbines would placed gas pipeline defective plans would disrupt output chemical plants tractor factor caused monumental nonnuclear explosion fire ever seen space however soviet union blame united states attack russian south ossetian georgian azerbaijani sites attacked hackers 2008 south ossetia war russian-led cyberattacks br claimed russian security services organized number denial service attacks part cyber-warfare countries notably 2007 cyberattacks estonia 2008 cyberattacks russia south ossetia georgia azerbaijan one identified young russian hacker said paid russian state security services lead hacking attacks nato computers studying computer sciences department defense information tuition paid fsb july 2009 series coordinated denial service attacks major government news media financial websites south korea united states many thought attack directed north korea one researcher traced attacks united kingdom security researcher chris kubecka presented evidence multiple european union united kingdom companies unwittingly helped attack south korea due w32.dozer infections malware used part attack companies used attack partially owned several governments complicating attribution july 2011 south korean company sk communications hacked resulting theft personal details including names phone numbers home email addresses resident registration numbers 35 million people trojaned software update used gain access sk communications network links exist hack malicious activity believed part broader concerted hacking effort ongoing tensions korean peninsula south korea defense ministry stated south korea going improve cyber-defense strategies hopes preparing possible cyber attacks march 2013 south korea major banks \u2013 shinhan bank woori bank nonghyup bank \u2013 well many broadcasting stations \u2013 kbs ytn mbc \u2013 hacked 30,000 computers affected one biggest attacks south korea faced years although remains uncertain involved incident immediate assertions north korea connected threatened attack south korea government institutions major national banks traditional newspapers numerous times \u2013 reaction sanctions received nuclear testing continuation foal eagle south korea annual joint military exercise united states north korea cyber warfare capabilities raise alarm south korea north korea increasing manpower military academies specializing hacking current figures state south korea 400 units specialized personnel north korea 3,000 highly trained hackers portrays huge gap cyber warfare capabilities sends message south korea step strengthen cyber warfare command forces therefore order prepared future attacks south korea united states discuss deterrence plans security consultative meeting scm scm plan developing strategies focuses accelerating deployment ballistic missiles well fostering defense shield program known korean air missile defense april 2007 estonia came cyber attack wake relocation bronze soldier tallinn largest part attacks coming russia official servers authorities russia attack ministries banks media targeted attack estonia seemingly small baltic nation effective nation run online estonia implemented e-government bank services political elections taxes done online attack really hurt estonia economy people estonia least 150 people injured first day due riots streets 2013 french minister defense mr jean-yves le drian ordered creation cyberarmy representing 4th national army corp along ground naval air forces french ministry defense protect french european interests soil abroad contract made french firm eads airbus identify secure main elements susceptible cyber threats 2016 france thus built largest cyberarmy europe planned 2600 cyber-soldiers 440 million euros investment cybersecurity products new army corp. additional 4400 reservists constitute heart army 2019 2013 germany revealed existence 60-person computer network operation unit german intelligence agency bnd announced seeking hire 130 hackers new cyber defence station unit march 2013 bnd president gerhard schindler announced agency observed five attacks day government authorities thought mainly originate china confirmed attackers far accessed data expressed concern stolen information could used basis future sabotage attacks arms manufacturers telecommunications companies government military agencies shortly edward snowden leaked details u.s. national security agency cyber surveillance system german interior minister hans-peter friedrich announced bnd would given additional budget 100 million euros increase cyber surveillance capability 5 total internet traffic germany 20 total traffic maximum amount allowed german law netherlands cyber defense nationally coordinated ncsc dutch ministry defense laid cyber strategy 2011 first focus improve cyber defense handled joint branch jivc improve intel operations intel community netherlands including military intel organization mivd set joint sigint cyber unit jscu ministry defense furthermore setting offensive cyber force called defensie cyber command dcc operational end 2014 january 2017 sweden armed forces subjected cyber-attack caused shutdown so-called caxcis system used military exercises according crowdstrike 2014 2016 russian apt fancy bear used android malware target ukrainian army rocket forces artillery distributed infected version android app whose original purpose control targeting data d-30 howitzer artillery app used ukrainian officers loaded x-agent spyware posted online military forums attack claimed crowdstrike successful 80 ukrainian d-30 howitzers destroyed highest percentage loss artillery pieces army percentage never previously reported would mean loss nearly entire arsenal biggest artillery piece ukrainian armed forces according ukrainian army number incorrect losses artillery weapons way reported losses nothing stated cause 2014 russians suspected use cyber weapon called snake ouroboros conduct cyber attack ukraine period political turmoil snake tool kit began spreading ukrainian computer systems 2010 performed computer network exploitation cne well highly sophisticated computer network attacks cna december 23 2015 blackenergy malware used cyberattack ukraine powergrid left 200,000 people temporarily without power mining company large railway operator also victims attack mi6 reportedly infiltrated al qaeda website replaced instructions making pipe bomb recipe making cupcakes october 2010 iain lobban director government communications headquarters gchq said uk faces real credible threat cyber attacks hostile states criminals government systems targeted 1,000 times month attacks threatened uk economic future countries already using cyber assaults put pressure nations 12 november 2013 financial organisations london conducted cyber war games dubbed 'waking shark 2 simulate massive internet-based attacks bank financial organisations waking shark 2 cyber war games followed similar exercise wall street iran victim predator several cyberwarfare operations iran considered emerging military power field september 2010 iran attacked stuxnet worm thought specifically target natanz nuclear enrichment facility 500-kilobyte computer worm infected least 14 industrial sites iran including natanz uranium-enrichment plant although official authors stuxnet \u2019 officially identified stuxnet believed developed deployed united states israel worm said advanced piece malware ever discovered significantly increases profile cyberwarfare 2006 war hezbollah israel alleges cyber-warfare part conflict israel defense forces idf intelligence estimates several countries middle east used russian hackers scientists operate behalf result israel attached growing importance cyber-tactics became along u.s. france couple nations involved cyber-war planning many international high-tech companies locating research development operations israel local hires often veterans idf elite computer units richard a. clarke adds israeli friends learned thing two programs working two decades september 2007 israel carried airstrike syria dubbed operation orchard u.s. industry military sources speculated israelis may used cyberwarfare allow planes pass undetected radar syria following us president donald trump decision pull iran nuclear deal may 2018 cyber warfare units united states israel monitoring internet traffic iran noted surge retaliatory cyber attacks iran security firms warned iranian hackers sending emails containing malware diplomats work foreign affairs offices us allies employees telecommunications companies trying infiltrate computer systems august 15 2012 11:08 local time shamoon virus began destroying 35,000 computer systems rendering inoperable virus used target saudi government causing destruction state owned national oil company saudi aramco attackers posted pastie pastebin.com hours prior wiper logic bomb occurring citing oppression al-saud regime reason behind attack attack well staged according christina kubecka former security advisor saudi aramco attack group leader security aramco overseas unnamed saudi aramco employee information technology team opened malicious phishing email allowing initial entry computer network around mid-2012 kubecka also detailed black hat usa talk saudi aramco placed majority security budget ics control network leaving business network risk major incident realize security budget spent ics gets pwnd virus noted behavior differing malware attacks due destructive nature cost attack recovery us defense secretary leon panetta called attack cyber pearl harbor known years later biggest hack history intended cyber warfare shamoon spread infected machine computers network system infected virus continues compile list files specific locations system upload attacker erase finally virus overwrites master boot record infected computer making unusable saudi aramco announced attack facebook page went offline company statement issued 25 august 2012 statement falsely reported normal business resumed 25 august 2012 however middle eastern journalist leaked photographs taken 1 september 2012 showing kilometers petrol trucks unable loaded due backed business systems still inoperable august 29 2012 attackers behind shamoon posted another pastie pastebin.com taunting saudi aramco proof still retained access company network post contained username password security network equipment new password ceo khalid al- falih attackers also referenced portion shamoon malware proof pastie according kubecka order restore operations saudi aramco used large private fleet aircraft available funds purchase much world hard drives driving price new hard drives required quickly possible oil prices affected speculation september 1 2012 gasoline resources dwindling public saudi arabia 17 days august 15th attack rasgas also affected different variant crippling similar manner march 2018 american republican fundraiser elliott broidy filed lawsuit qatar alleging qatar government stole leaked emails order discredit viewed impediment plan improve country standing washington may 2018 lawsuit named mohammed bin hamad bin khalifa al thani brother emir qatar associate ahmed al-rumaihi allegedly orchestrating qatar cyber warfare campaign broidy litigation revealed cybercriminals targeted broidy targeted many 1,200 individuals also well-known enemies qatar senior officials u.a.e. egypt saudi arabia bahrain hackers almost always obscured location activity traced telecommunication network qatar united arab emirates launched several cyber-attacks past targeting dissidents ahmed mansoor emirati citizen jailed sharing thoughts facebook twitter given code name egret state-led covert project called raven spied top political opponents dissidents journalists project raven deployed secret hacking tool called karma spy without requiring target engage web links cyberwarfare united states part american military strategy proactive cyber defence use cyberwarfare platform attack new united states military strategy makes explicit cyberattack casus belli traditional act war 2013 cyberwarfare first time considered larger threat al qaeda terrorism many u.s. intelligence officials 2017 representative mike rogers chairman u.s. house permanent select committee intelligence instance said cyber war country americans n't know necessarily winning got huge challenges comes cybersecurity u.s. government security expert richard a. clarke book cyber war may 2010 defines cyberwarfare actions nation-state penetrate another nation computers networks purposes causing damage disruption economist describes cyberspace fifth domain warfare william j. lynn u.s. deputy secretary defense states doctrinal matter pentagon formally recognized cyberspace new domain warfare become critical military operations land sea air space 2009 president barack obama declared america digital infrastructure strategic national asset may 2010 pentagon set new u.s. cyber command uscybercom headed general keith b. alexander director national security agency nsa defend american military networks attack countries systems eu set enisa european union agency network information security headed prof. udo helmbrecht plans significantly expand enisa capabilities united kingdom also set cyber-security operations centre based government communications headquarters gchq british equivalent nsa u.s. however cyber command set protect military whereas government corporate infrastructures primarily responsibility respectively department homeland security private companies february 2010 top american lawmakers warned threat crippling attack telecommunications computer networks sharply rise according lipman report numerous key sectors u.s. economy along nations currently risk including cyber threats public private facilities banking finance transportation manufacturing medical education government dependent computers daily operations 2009 president obama stated cyber intruders probed electrical grids economist writes china plans winning informationised wars mid-21st century note countries likewise organizing cyberwar among russia israel north korea iran boasts world second-largest cyber-army james gosler government cybersecurity specialist worries u.s. severe shortage computer security specialists estimating 1,000 qualified people country today needs force 20,000 30,000 skilled experts july 2010 black hat computer security conference michael hayden former deputy director national intelligence challenged thousands attendees help devise ways reshape internet security architecture explaining guys made cyberworld look like north german plain january 2012 mike mcconnell former director national intelligence national security agency president george w. bush told reuters news agency u.s. already launched attacks computer networks countries mcconnell name country u.s. attacked according sources may iran june 2012 new york times reported president obama ordered cyber attack iranian nuclear enrichment facilities august 2010 u.s. first time warned publicly chinese military use civilian computer experts clandestine cyber attacks aimed american companies government agencies pentagon also pointed alleged china-based computer spying network dubbed ghostnet revealed research report last year pentagon stated people liberation army using information warfare units develop viruses attack enemy computer systems networks units include civilian computer professionals commander bob mehal monitor pla buildup cyberwarfare capabilities continue develop capabilities counter potential threat united states department defense sees use computers internet conduct warfare cyberspace threat national security united states joint forces command describes attributes cyberspace technology emerging instrument power societies becoming available country opponents may use attack degrade disrupt communications flow information low barriers entry coupled anonymous nature activities cyberspace list potential adversaries broad furthermore globe-spanning range cyberspace disregard national borders challenge legal systems complicate nation ability deter threats respond contingencies february 2010 united states joint forces command released study included summary threats posed internet little investment cloaked veil anonymity adversaries inevitably attempt harm national interests cyberspace become main front irregular traditional conflicts enemies cyberspace include states non-states range unsophisticated amateur highly trained professional hackers cyberspace enemies target industry academia government well military air land maritime space domains much way airpower transformed battlefield world war ii cyberspace fractured physical barriers shield nation attacks commerce communication indeed adversaries already taken advantage computer networks power information technology plan execute savage acts terrorism also influence directly perceptions u.s. government american population 6 october 2011 announced creech afb drone predator fleet command control data stream keylogged resisting attempts reverse exploit past two weeks air force issued statement virus posed threat operational mission 21 november 2011 widely reported u.s. media hacker destroyed water pump curran-gardner township public water district illinois however later turned information false inappropriately leaked illinois statewide terrorism intelligence center according foreign policy magazine nsa tailored access operations tao unit successfully penetrated chinese computer telecommunications systems almost 15 years generating best reliable intelligence information going inside people republic china 24 november 2014 sony pictures entertainment hack release confidential data belonging sony pictures entertainment spe june 2015 united states office personnel management opm announced target data breach targeting records many four million people later fbi director james comey put number 18 million washington post reported attack originated china citing unnamed government officials 2016 jeh johnson united states secretary homeland security james clapper u.s. director national intelligence issued joint statement accusing russia interfering 2016 united states presidential election new york times reported obama administration formally accused russia stealing disclosing democratic national committee emails u.s. law 50 u.s.c.title 50 \u2013 war national defense chapter 15 \u2013 national security subchapter iii accountability intelligence activities must formal presidential finding prior authorizing covert attack u.s. vice president joe biden said american news interview program meet press united states respond new york times noted biden comment seems suggest mr. obama prepared order \u2014 already ordered \u2014 kind covert action december 29 united states imposed extensive sanctions russia since cold war expelling 35 russian diplomats united states united states used cyberattacks tactical advantage afghanistan 2014 barack obama ordered intensification cyberwarfare north korea missile program sabotaging test launches opening seconds 2016 president barack obama authorized planting cyber weapons russian infrastructure final weeks presidency response moscow alleged interference 2016 presidential election march 2017 wikileaks published 8,000 documents cia confidential documents codenamed vault 7 dated 2013\u20132016 include details cia software capabilities ability compromise cars smart tvs web browsers including google chrome microsoft edge mozilla firefox opera software asa operating systems smartphones including apple ios google android well operating systems microsoft windows macos linux global perspective countries actors engaged cyber warfare see george washington university-based national security archive cyberwar map kill switch bill br 19 june 2010 united states senator joe lieberman i-ct introduced bill called protecting cyberspace national asset act 2010 co-wrote senator susan collins r-me senator thomas carper d-de signed law controversial bill american media dubbed kill switch bill would grant president emergency powers parts internet however three co-authors bill issued statement instead bill narrowed existing broad presidential authority take telecommunications networks rise cyber warfighting domain led efforts determine cyberspace used foster peace example german civil rights panel runs campaign cyberpeace \u2212 control cyberweapons surveillance technology militarization cyberspace development stockpiling offensive exploits malware measures cyberpeace include policymakers developing new rules norms warfare individuals organizations building new tools secure infrastructures promoting open source establishment cyber security centers auditing critical infrastructure cybersecurity obligations disclose vulnerabilities disarmament defensive security strategies decentralization education widely applying relevant tools infrastructures encryption cyberdefenses topics cyber peacekeeping cyber peacemaking also studied researchers way restore strengthen peace aftermath cyber traditional warfare cyber counter-intelligence measures identify penetrate neutralize foreign operations use cyber means primary tradecraft methodology well foreign intelligence service collection efforts use traditional methods gauge cyber capabilities intentions one hardest issues cyber counterintelligence problem attribution unlike conventional warfare figuring behind attack difficult however defense secretary leon panetta claimed united states capability trace attacks back sources hold attackers accountable october 2011 journal strategic studies leading journal field published article thomas rid cyber war take place argued politically motivated cyber attacks merely sophisticated versions sabotage espionage subversion \u2013 unlikely cyber war occur future various parties attempted come international legal frameworks clarify acceptable none yet widely accepted tallinn manual published 2013 academic non-binding study international law particular jus ad bellum international humanitarian law apply cyber conflicts cyber warfare written invitation tallinn-based nato cooperative cyber defence centre excellence international group approximately twenty experts 2009 2012 shanghai cooperation organisation members include china russia defines cyberwar include dissemination information harmful spiritual moral cultural spheres states september 2011 countries proposed un secretary general document called international code conduct information security contrast united states approach focuses physical economic damage injury putting political concerns freedom speech difference opinion led reluctance west pursue global cyber arms control agreements however american general keith b. alexander endorse talks russia proposal limit military attacks cyberspace june 2013 barack obama vladimir putin agreed install secure cyberwar-hotline providing direct secure voice communications line us cybersecurity coordinator russian deputy secretary security council need directly manage crisis situation arising ict security incident white house quote ukrainian professor international law alexander merezhko developed project called international convention prohibition cyberwar internet according project cyberwar defined use internet related technological means one state political economic technological information sovereignty independence another state professor merezhko project suggests internet ought remain free warfare tactics treated international landmark states internet cyberspace common heritage mankind february 2017 rsa conference microsoft president brad smith suggested global rules \u2013 digital geneva convention \u2013 cyber attacks ban nation-state hacking civilian aspects economic political infrastructures also stated independent organization could investigate publicly disclose evidence attributes nation-state attacks specific countries furthermore said technology sector collectively neutrally work together protect internet users pledge remain neutral conflict aid governments offensive activity adopt coordinated disclosure process software hardware vulnerabilities documentaries br videos articles", + "neighbors": [ + 11, + 43, + 103, + 120, + 123, + 134, + 144, + 149, + 162, + 186, + 227, + 272, + 282, + 293, + 310, + 338, + 343, + 346, + 363, + 379, + 429, + 439, + 479, + 518, + 528, + 576, + 658, + 698, + 701, + 703, + 739, + 740, + 750, + 762, + 800, + 818, + 834, + 898, + 961, + 1015, + 1039, + 1090, + 1101, + 1112, + 1121, + 1138, + 1159, + 1303, + 1324, + 1325, + 1327, + 1342, + 1355, + 1361, + 1368, + 1372, + 1379, + 1398, + 1472, + 1549, + 1573, + 1582, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1369, + "label": 2, + "text": "Knoppix:knoppix knoppix operating system based debian designed run directly cd dvd live cd usb flash drive live usb one first kind operating system knoppix developed named linux consultant klaus knopper starting program loaded removable medium decompressed ram drive decompression transparent on-the-fly although knoppix primarily designed used live cd also installed hard disk like typical operating system computers support booting usb devices load knoppix live usb flash drive memory card two main editions traditional compact-disc 700 megabytes edition dvd 4.7 gigabytes maxi edition main edition two language-specific editions english german knoppix mostly consists free open source software also includes proprietary software long fulfils certain conditions knoppix used copy files easily hard drives inaccessible operating systems quickly safely use linux software live cd used instead installing another os 1000 software packages included cd edition 2600 packages included dvd edition nine gigabytes stored dvd compressed form packages include minimum hardware requirements knoppix prior knoppix 3.8.2 documents settings user created would disappear upon reboot lack persistence made necessary save documents directly hard drive partition network removable media usb flash drive also possible set persistent home directory documents settings written user home directory would automatically redirected hard drive removable media could automatically mounted bootup single file knoppix.img cached rewritable media used simulate file system files written later use allowed user transparently write home directory union mount support added version 3.8.1 unionfs later replaced aufs 5.1.0 improve stability union mount allowed virtual updates data read-only cd/dvd media storing changes separate writable media representing combination two single storage device writable media could memory ramdisk hard disk usb flash drive etc means user could modify software installed knoppix system using apt install update software storage device containing changes needed present whenever knoppix started else original data disc would used knoppix would scan available storage devices persistent home directory default user could dictate specific location boot option see codice_1 carrying knoppix cd usb flash drive user could environment programs settings data available computer could run knoppix functionality available knoppix 5.1.1 cd release 5.3.1 dvd release subsequently live cd paradigm transformed portable operating systems run external storage using knoppix live cd one use boot options also known 'cheatcodes override default setting automatic hardware detection fails example user may wish boot plain console proceed without scsi support knoppix allows user enter one cheat codes prompt booting user enter cheat code press key timeout knoppix boot default options example set language french rather default one would type codice_2 knoppix 32-bit debian linux based distro recent releases including latest version 7.6 also equipped 64-bit kernel dvd edition automatically boot 64-bit computers using boot option codice_3 manually command-line prompt codice_4 boot 32-bit kernel neither pae 64-bit applications supported knoppix system memory 4 gb used 64-bit kernel dvd edition knoppix also loaded onto usb flash drive flash-knoppix knoppix system knoppix live system starts runs factor 5 faster usb flash disk cd dvd besides experimental uefi support provided usb flash drive rather dvd media 32-bit uefi firmware boot 32-bit kernel 64-bit uefi firmware boot 64-bit kernel text interface uefi similar bios one also press key f2 f3 access information boot options knoppix one first live cd linux distributions gain popularity several factors contribute popularity knoppix knoppix works fairly large number pcs laptops automatic hardware detection cope hardware sometimes drivers used optimal knoppix difficulty recognizing cards made 1998 motherboards bios made 2002 cases manual configuration codes entered boot time overcome problems automatic detection pc enough ram run kde included programs legacy knoppix earlier 6.0 boots limited twm session instead window running twm session default xterm table right shows version history major releases april 2008 version 4 5.1.1 knoppix split dvd maxi edition 9 gb software cd light edition developed parallel knoppix 5.1.1 cd editions contained selection graphical environments including twm window manager kde 3 \u2014 feature-complete desktop environment default knoppix 5.3.1 earlier development done traditional 5.x versions knoppix 6.0.1 adriane 1.1 cd-edition complete rebuild scratch lxde made default desktop environment edition contains substantially reduced software collection order easily fit cd knoppix 6.2.1 release cd dvd editions adriane 1.2 cd-edition knoppix 6.7.1 last cd version stable touchpad drivers june 2013 march 2019 knoppix 7.2 recent release cd edition 2018 software become outdated libc6 2.17 library longer suffices installation several modern packages 7.x version range known instabilities touchpads version 7.2 still remains recent cd version knoppix wide distribution knoppix 8.0.0 edition released cebit 2017 knoppix 8.1.0 released september 2017 first public release 8.x series version 8.0.0 dual boot choice three different desktops lxde default option kde gnome versions 8.2.0 newer 8.2.x 8.5.x available knoppix mirrors knoppix 8.5 dvd version available download exclusive bundled physical edition linux-magazin linux-user version 8.5 longer includes systemd replaced elogind spectre meltdown kernel vulnerabilities mitigated adriane knoppix variation intended blind visually impaired people used entirely without vision oriented output devices released third quarter 2007 live cd adriane knoppix named adriane knopper wife klaus knopper developer knoppix adriane visual impairment assisting klaus development software name adriane also backronym audio desktop reference implementation networking environment adriane knoppix intended blind also beginners \u2019 know much computers uses suse blinux screen reader phoneme generator speech engine normal output", + "neighbors": [ + 113, + 134, + 171, + 272, + 275, + 301, + 334, + 351, + 357, + 359, + 393, + 404, + 431, + 664, + 695, + 716, + 754, + 897, + 974, + 1015, + 1046, + 1049, + 1055, + 1126, + 1138, + 1167, + 1179, + 1276, + 1286, + 1415, + 1445, + 1458, + 1539, + 1601, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1370, + "label": 2, + "text": "Recovery_Console:recovery console recovery console feature windows 2000 windows xp windows server 2003 operating systems provides means administrators perform limited range tasks using command line interface primary function enable administrators recover situations windows boot far presenting graphical user interface recovery console used provide way access hard drive emergency command prompt recovery console accessed either original installation media used install windows also installed hard drive added ntldr menu however relying latter risky requires computer boot point ntldr loads recovery console simple command-line interpreter cli many available commands closely resemble commands normally available codice_1 namely codice_2 codice_3 codice_4 forth recovery console administrator filesystem access recovery console default severely limited administrator using recovery console read-only access volumes except boot volume even boot volume access root directory windows system directory e.g \\winnt changed changing security policies enable read/write access complete file system including copying files removable media i.e floppy drives although appears list commands available using codice_9 command many articles recovery console including authored microsoft codice_10 command available protocol stacks loaded way connect shared folder remote computer implied", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 198, + 255, + 262, + 268, + 278, + 295, + 312, + 324, + 326, + 336, + 344, + 377, + 413, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 764, + 791, + 801, + 865, + 904, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1110, + 1138, + 1151, + 1212, + 1243, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1379, + 1417, + 1461, + 1506, + 1517, + 1531, + 1533, + 1545, + 1547, + 1561, + 1587, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1371, + "label": 4, + "text": "Google_Safe_Browsing:google safe browsing google safe browsing blacklist service provided google provides lists urls web resources contain malware phishing content google chrome safari firefox vivaldi gnome web browsers use lists google safe browsing service checking pages potential threats google also provides public api service google also provides information internet service providers sending e-mail alerts autonomous system operators regarding threats hosted networks according google september 2017 3 billion internet devices protected service google maintains safe browsing lookup api privacy drawback urls looked hashed server knows urls api users looked safe browsing update api hand compares 32-bit hash prefixes url preserve privacy chrome firefox safari browsers use latter safe browsing also stores mandatory preferences cookie computer google safe browsing conducts client-side checks website looks suspicious sends subset likely phishing social engineering terms found page google obtain additional information available google servers whether website considered malicious logs including ip address one cookies kept two weeks tied safe browsing requests made device websites carrying ads infected might blacklisted google safe browsing even website malware request removal blacklist requires webmaster create google webmaster tool account take several days removed", + "neighbors": [ + 24, + 41, + 131, + 176, + 182, + 216, + 297, + 422, + 436, + 480, + 502, + 547, + 553, + 559, + 582, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1138, + 1185, + 1259, + 1265, + 1310, + 1411, + 1419, + 1480, + 1500, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1372, + "label": 9, + "text": "Interpreter_(computing):interpreter computing computer science interpreter computer program directly executes instructions written programming scripting language without requiring previously compiled machine language program interpreter generally uses one following strategies program execution early versions lisp programming language dartmouth basic would examples first type perl python matlab ruby examples second ucsd pascal example third type source programs compiled ahead time stored machine independent code linked run-time executed interpreter and/or compiler jit systems systems smalltalk contemporary versions basic java may also combine two three interpreters various types also constructed many languages traditionally associated compilation algol fortran cobol c/c++ interpretation compilation two main means programming languages implemented mutually exclusive interpreting systems also perform translation work like compilers terms interpreted language compiled language signify canonical implementation language interpreter compiler respectively high level language ideally abstraction independent particular implementations interpreters used early 1952 ease programming within limitations computers time e.g shortage program storage space native support floating point numbers interpreters also used translate low-level machine languages allowing code written machines still construction tested computers already existed first interpreted high-level language lisp lisp first implemented 1958 steve russell ibm 704 computer russell read john mccarthy paper realized mccarthy surprise lisp eval function could implemented machine code result working lisp interpreter could used run lisp programs properly evaluate lisp expressions programs written high level language either directly executed kind interpreter converted machine code compiler assembler linker cpu execute compilers assemblers generally produce machine code directly executable computer hardware often optionally produce intermediate form called object code basically machine specific code augmented symbol table names tags make executable blocks modules identifiable relocatable compiled programs typically use building blocks functions kept library object code modules linker used combine pre-made library files object file application form single executable file object files used generate executable file thus often produced different times sometimes even different languages capable generating object format simple interpreter written low level language e.g assembly may similar machine code blocks implementing functions high level language stored executed function entry look table points code however interpreter written high level language typically uses another approach generating walking parse tree generating executing intermediate software-defined instructions thus compilers interpreters generally turn source code text files tokens may may generate parse tree may generate immediate instructions stack machine quadruple code means basic difference compiler system including built separate linker generates stand-alone machine code program interpreter system instead performs actions described high level program compiler thus make almost conversions source code semantics machine level i.e program changed interpreter conversion work every time statement function executed however efficient interpreter much translation work including analysis types similar factored done first time program module function even statement run thus quite akin compiler works however compiled program still runs much faster circumstances part compilers designed optimize code may given ample time especially true simpler high level languages without many dynamic data structures checks type-checks traditional compilation executable output linkers .exe files .dll files library see picture typically relocatable run general operating system much like object code modules difference relocation done dynamically run time i.e program loaded execution hand compiled linked programs small embedded systems typically statically allocated often hard coded flash memory often secondary storage operating system sense historically interpreter-systems self-contained editor built becoming common also compilers often called ide although programmers prefer use editor choice run compiler linker tools manually historically compilers predate interpreters hardware time could support interpreter interpreted code typical batch environment time limited advantages interpretation software development cycle programmers make frequent changes source code using compiler time change made source code must wait compiler translate altered source files link binary code files together program executed larger program longer wait contrast programmer using interpreter lot less waiting interpreter usually needs translate code worked intermediate representation translate thus requiring much less time changes tested effects evident upon saving source code reloading program compiled code generally less readily debugged editing compiling linking sequential processes conducted proper sequence proper set commands reason many compilers also executive aid known make file program make file lists compiler linker command lines program source code files might take simple command line menu input e.g make 3 selects third group set instructions issues commands compiler linker feeding specified source code files compiler converts source code binary instruction specific processor architecture thus making less portable conversion made developer environment binary distributed user machines executed without translation cross compiler generate binary code user machine even different processor machine code compiled interpreted program distributed source code needs translated final machine takes time makes program distribution independent machine architecture however portability interpreted source code dependent target machine actually suitable interpreter interpreter needs supplied along source overall installation process complex delivery monolithic executable since interpreter part need installed fact interpreted code easily read copied humans concern point view copyright however various systems encryption obfuscation exist delivery intermediate code bytecode similar effect obfuscation bytecode could decoded decompiler disassembler main disadvantage interpreters interpreted program typically runs slower compiled difference speeds could tiny great often order magnitude sometimes generally takes longer run program interpreter run compiled code take less time interpret total time required compile run especially important prototyping testing code edit-interpret-debug cycle often much shorter edit-compile-run-debug cycle interpreting code slower running compiled code interpreter must analyze statement program time executed perform desired action whereas compiled code performs action within fixed context determined compilation run-time analysis known interpretive overhead access variables also slower interpreter mapping identifiers storage locations must done repeatedly run-time rather compile time various compromises development speed using interpreter execution speed using compiler systems lisps allow interpreted compiled code call share variables means routine tested debugged interpreter compiled thus benefit faster execution routines developed many interpreters execute source code stands convert compact internal form many basic interpreters replace keywords single byte tokens used find instruction jump table interpreters pbasic interpreter achieve even higher levels program compaction using bit-oriented rather byte-oriented program memory structure commands tokens occupy perhaps 5 bits nominally 16-bit constants stored variable-length code requiring 3 6 10 18 bits address operands include bit offset many basic interpreters store read back tokenized internal representation interpreter might well use lexical analyzer parser compiler interpret resulting abstract syntax tree example data type definitions latter toy interpreter syntax trees obtained c expressions shown box interpretation used sole method execution even though interpreter interpreted directly executed program needed somewhere bottom stack code interpreted definition machine code cpu execute spectrum possibilities interpreting compiling depending amount analysis performed program executed example emacs lisp compiled bytecode highly compressed optimized representation lisp source machine code therefore tied particular hardware compiled code interpreted bytecode interpreter written c compiled code case machine code virtual machine implemented hardware bytecode interpreter compiling interpreters sometimes also called compreters bytecode interpreter instruction starts byte therefore bytecode interpreters 256 instructions although may used bytecodes may take multiple bytes may arbitrarily complicated control tables necessarily ever need pass compiling phase dictate appropriate algorithmic control flow via customized interpreters similar fashion bytecode interpreters threaded code interpreters similar bytecode interpreters instead bytes use pointers instruction word points function instruction sequence possibly followed parameter threaded code interpreter either loops fetching instructions calling functions point fetches first instruction jumps every instruction sequence ends fetch jump next instruction unlike bytecode effective limit number different instructions available memory address space classic example threaded code forth code used open firmware systems source language compiled f code bytecode interpreted virtual machine spectrum interpreting compiling another approach transform source code optimized abstract syntax tree ast execute program following tree structure use generate native code just-in-time approach sentence needs parsed advantage bytecode ast keeps global program structure relations statements lost bytecode representation compressed provides compact representation thus using ast proposed better intermediate format just-in-time compilers bytecode also allows system perform better analysis runtime however interpreters ast causes overhead bytecode interpreter nodes related syntax performing useful work less sequential representation requiring traversal pointers overhead visiting tree blurring distinction interpreters bytecode interpreters compilation just-in-time compilation jit technique intermediate representation compiled native machine code runtime confers efficiency running native code cost startup time increased memory use bytecode ast first compiled adaptive optimization complementary technique interpreter profiles running program compiles frequently executed parts native code techniques decades old appearing languages smalltalk 1980s just-in-time compilation gained mainstream attention amongst language implementers recent years java .net framework modern javascript implementations matlab including jits self-interpreter programming language interpreter written programming language interpret example basic interpreter written basic self-interpreters related self-hosting compilers compiler exists language interpreted creating self-interpreter requires implementation language host language may another programming language assembler first interpreter system bootstrapped new versions interpreter developed language way donald knuth developed tangle interpreter language web industrial standard tex typesetting system defining computer language usually done relation abstract machine so-called operational semantics mathematical function denotational semantics language may also defined interpreter semantics host language given definition language self-interpreter well-founded define language self-interpreter tells reader expressiveness elegance language also enables interpreter interpret source code first step towards reflective interpreting important design dimension implementation self-interpreter whether feature interpreted language implemented feature interpreter host language example whether closure lisp-like language implemented using closures interpreter language implemented manually data structure explicitly storing environment features implemented feature host language less control programmer interpreter different behavior dealing number overflows realized arithmetic operations delegated corresponding operations host language languages elegant self-interpreter lisp prolog much research self-interpreters particularly reflective interpreters conducted scheme programming language dialect lisp general however turing-complete language allows writing interpreter lisp language lisp programs lists symbols lists xslt language xslt programs written xml sub-domain meta-programming writing domain-specific languages dsls clive gifford introduced measure quality self-interpreter eigenratio limit ratio computer time spent running stack n self-interpreters time spent run stack self-interpreters n goes infinity value depend program run book structure interpretation computer programs presents examples meta-circular interpretation scheme dialects examples languages self-interpreter forth pascal microcode commonly used technique imposes interpreter hardware architectural level computer microcode layer hardware-level instructions implement higher-level machine code instructions internal state machine sequencing many digital processing elements microcode used general-purpose central processing units well specialized processors microcontrollers digital signal processors channel controllers disk controllers network interface controllers network processors graphics processing units hardware microcode typically resides special high-speed memory translates machine instructions state machine data input sequences detailed circuit-level operations separates machine instructions underlying electronics instructions designed altered freely also facilitates building complex multi-step instructions reducing complexity computer circuits writing microcode often called microprogramming microcode particular processor implementation sometimes called microprogram extensive microcoding allows small simple microarchitectures emulate powerful architectures wider word length execution units relatively simple way achieve software compatibility different products processor family", + "neighbors": [ + 14, + 50, + 78, + 117, + 123, + 149, + 227, + 236, + 270, + 272, + 273, + 282, + 292, + 306, + 313, + 346, + 374, + 379, + 386, + 412, + 429, + 446, + 488, + 503, + 508, + 509, + 521, + 528, + 536, + 567, + 649, + 682, + 739, + 752, + 756, + 786, + 789, + 796, + 799, + 806, + 810, + 834, + 837, + 869, + 901, + 919, + 940, + 947, + 998, + 1009, + 1028, + 1037, + 1044, + 1079, + 1096, + 1138, + 1159, + 1168, + 1180, + 1183, + 1188, + 1204, + 1221, + 1225, + 1227, + 1231, + 1232, + 1235, + 1302, + 1311, + 1319, + 1324, + 1335, + 1368, + 1385, + 1398, + 1414, + 1430, + 1437, + 1483, + 1503, + 1508, + 1511, + 1516, + 1549, + 1608, + 1633 + ], + "mask": "Validation" + }, + { + "node_id": 1373, + "label": 2, + "text": "IPhone:iphone iphone line smartphones designed marketed apple inc. generations iphone use apple ios mobile operating system software first-generation iphone released june 29 2007 multiple new hardware iterations new ios releases released since user interface built around device multi-touch screen including virtual keyboard iphone wi-fi connect cellular networks iphone take photos play music send receive email browse web send receive text messages record notes perform mathematical calculations receive visual voicemail shooting video also became standard feature iphone 3gs functionality video games reference works social networking enabled downloading mobile apps apple app store contained 2.2 million applications available iphone apple released twelve generations iphone models accompanied one twelve major releases ios operating system first-generation iphone gsm phone established design precedents button placement persisted throughout releases screen size maintained next four iterations iphone 3g added 3g network support followed iphone 3gs improved hardware iphone 4 metal chassis higher display resolution front-facing camera iphone 4s improved hardware voice assistant siri iphone 5 featured taller 4-inch display apple newly introduced lightning connector 2013 apple released iphone 5s improved hardware fingerprint reader lower-cost iphone 5c version 5 colored plastic casings instead metal followed larger iphone 6 iphone 6 plus models featuring displays iphone 6s introduced following year featured hardware upgrades support pressure-sensitive touch inputs well iphone se\u2014which featured hardware 6s smaller form factor 5s 2016 apple unveiled iphone 7 iphone 7 plus add water resistance improved system graphics performance new rear dual-camera setup plus model new color options removing 3.5 mm headphone jack found previous models iphone 8 iphone 8 plus released 2017 adding glass back improved screen camera iphone x released alongside iphone 8 iphone 8 plus highlights near bezel-less design improved camera new facial recognition system named face id home button therefore touch id september 2018 apple released 3 new iphones iphone xs upgraded version since discontinued iphone x iphone xs max larger variant series biggest display iphone xr lower end version iphone x first-generation iphone described revolutionary game-changer mobile phone industry subsequent iterations iphone also garnered praise iphone one widely used smartphones world success credited helping apple become one world valuable publicly traded companies november 1 2018 total 2.2 billion iphones sold development become iphone began 2004 apple started gather team 1,000 employees including jonathan ive designer behind imac ipod work highly confidential project purple apple ceo steve jobs steered original focus away tablet apple eventually revisited form ipad towards phone apple created device secretive collaboration cingular wireless became mobility time\u2014at estimated development cost us 150 million thirty months according steve jobs word imac therefore ipod iphone ipad stands internet individual instruct inform inspire apple rejected design committee approach yielded motorola rokr e1 largely unsuccessful collaboration motorola among deficiencies rokr e1 firmware limited storage 100 itunes songs avoid competing apple ipod nano cingular gave apple liberty develop iphone hardware software in-house even paid apple fraction monthly service revenue iphone 3g exchange four years exclusive us sales 2011 jobs unveiled iphone public january 9 2007 macworld 2007 convention moscone center san francisco two initial models 4 gb model priced us 499 8 gb model us 599 requiring two-year contract went sale united states june 29 2007 6:00 pm local time hundreds customers lined outside stores nationwide passionate reaction launch iphone resulted sections media dubbing 'jesus phone following successful release us first generation iphone made available uk france germany november 2007 ireland austria spring 2008 july 11 2008 apple released iphone 3g twenty-two countries including original six apple released iphone 3g upwards eighty countries territories apple announced iphone 3gs june 8 2009 along plans release later june july august starting us canada major european countries june 19 many would-be users objected iphone cost 40 users household incomes us 100,000 back original first generation iphone made aluminum black plastic accent iphone 3g 3gs feature full plastic back increase strength gsm signal iphone 3g available 8 gb black model black white option 16 gb model iphone 3gs available colors regardless storage capacity iphone 4 aluminosilicate glass front back stainless steel edge serves antennas first available black white version announced released april 2011 10 months later users iphone 4 reported dropped/disconnected telephone calls holding phones certain way became known antennagate january 11 2011 verizon announced media event reached agreement apple would begin selling cdma iphone 4 verizon said would available pre-order february 3 release set february 10 february 2011 verizon iphone accounted 4.5 iphone ad impressions us millennial media mobile ad network 2007 2011 apple spent 647 million advertising iphone us tuesday september 27 apple sent invitations press event held october 4 2011 10:00 cupertino headquarters announce details next generation iphone turned iphone 4s 1 million 4s models sold first 24 hours release october 2011 due large volumes iphone manufactured high selling price apple became largest mobile handset vendor world revenue 2011 surpassing long-time leader nokia american carrier c spire wireless announced would carrying iphone 4s october 19 2011 january 2012 apple reported best quarterly earnings ever 53 revenue coming sale 37 million iphones average selling price nearly 660 average selling price remained fairly constant phone lifespan hovering 622 660 production price iphone 4s estimated ihs isuppli october 2011 188 207 245 16 gb 32 gb 64 gb models respectively labor costs estimated 12.50 30 per unit workers iphone assembly line making 1.78 hour february 2012 comscore reported 12.4 us mobile subscribers used iphone approximately 6.4 million iphones active us alone september 12 2012 apple announced iphone 5 4-inch display predecessors 3.5-inch screen device comes 326 pixels per inch found iphone 4 4s iphone 5 soc a6 processor chip 22 smaller iphone 4s a5 twice fast doubling graphics performance predecessor device 18 thinner iphone 4s measuring 20 lighter july 6 2013 reported apple talks korean mobile carrier sk telecom release next generation iphone lte advanced technology july 22 2013 company suppliers said apple testing larger screens iphone ipad apple asked prototype smartphone screens larger four inches also asked screen designs new tablet device measuring slightly less 13 inches diagonally said september 10 2013 apple unveiled two new iphone models highly anticipated press event cupertino iphone 5c mid-range-priced version handset designed increase accessibility due price available five colors green blue yellow pink white made plastic iphone 5s comes three colors black white gold home button replaced fingerprint scanner touch id phones shipped september 20 2013 september 9 2014 apple revealed iphone 6 iphone 6 plus event cupertino devices larger screen predecessor 4.7 5.5 inches respectively 2016 apple unveiled iphone 7 7 plus added water dust resistance improved system graphics performance new dual-camera setup plus model new color options featured removal 3.5 mm headphone jack iphone september 12 2017 apple officially unveiled iphone 8 8 plus features new glass design camera improvements true tone display wireless charging improved system performance also unveiled iphone x features near bezel-less design facial recognition feature dubbed face id facial tracking used animojis oled screen highest pixel density iphone new telephoto lens works better low light conditions improved cameras ar september 12 2018 apple officially unveiled iphone xs xs max xr steve jobs theater apple park xs xs max feature improved super retina display dolby vision hdr10 support xs max featuring larger 6.5 display improved cameras smart hdr a12 bionic chip iphone xs xs max ip68 water liquid dust resistant allow devices submerged 2 meters duration 30 minutes iphone xr retained ip67 certification found first-generation iphone x also features ips lcd display instead oled displays found higher end models iphone xs/xs max ip68 certifications tested using various liquids chlorinated-water salt water tea wine beer juices apple also announced fourth generation apple watch apple watch series 4 apple sold 6.1 million first generation iphone units five quarters sales fourth quarter 2008 temporarily surpassed research motion rim blackberry sales 5.2 million units briefly made apple third largest mobile phone manufacturer revenue nokia samsung however income deferred recorded sales grew steadily thereafter end fiscal year 2010 total 73.5 million iphones sold 2010 iphone market share barely 4 cell phones however apple pulled 50 total profit global cellphone sales generated apple sold 14.1 million iphones third quarter 2010 representing 91 unit growth year-ago quarter well ahead idc latest published estimate 64 growth global smartphone market september quarter apple sales surpassed research motion 12.1 million blackberry units sold recent quarter ended august 2010 united states market alone third quarter 2010 9.1 million android-powered smartphones shipped 43.6 market apple ios number two phone operating system 26.2 5.5 million iphones sold made popular single device march 2 2011 ipad 2 launch event apple announced sold 100 million iphones worldwide result success iphone sales volume high selling price headlined iphone 4s apple became largest mobile handset vendor world revenue 2011 surpassing long-time leader nokia samsung galaxy ii proved popular iphone 4s parts europe iphone 4s dominant united states january 2012 apple reported best quarterly earnings ever 53 revenue coming sale 37 million iphones average selling price nearly 660 average selling price remained fairly constant phone lifespan hovering 622 660 eight largest phone manufacturers q1 2012 according horace dediu asymco apple samsung combined take 99 industry profits htc took remaining 1 rim lg sony ericsson motorola nokia suffered losses apple earning 73 cents every dollar earned phone makers industry profits grew 5.3 billion first quarter 2010 14.4 billion first quarter 2012 quadruple profits 2007 apple managed increase share profits due increasing carrier subsidies high selling prices iphone negative effect wireless carriers mobility verizon sprint seen ebitda service margins drop sold increasing number iphones quarter ended march 31 2012 apple sales iphone alone 22.7 billion exceeded total microsoft businesses 17.4 billion fourth quarter 2012 iphone 5 iphone 4s best-selling handsets sales 27.4 million 13 smartphones worldwide 17.4 million units respectively samsung galaxy iii third 15.4 million according strategy analytics data impressive performance given iphone portfolio premium pricing adding galaxy iii global popularity appears peaked galaxy iii touted iphone-killer press released samsung led worldwide sales smartphones apple iphone line still managed top samsung smartphone offerings united states 21.4 share 37.8 market respectively ios grew 3.5 37.8 android slid 1.3 fall 52.3 share continued top popularity iphone despite growing android competition also attributed apple able deliver ios updates air android updates frequently impeded carrier testing requirements hardware tailoring forcing consumers purchase new android smartphone get latest version os however 2013 apple market share fallen 13.1 due surging popularity android offerings apple announced september 1 2013 iphone trade-in program would implemented 250 specialty stores us program become available customers must valid contract must purchase new phone rather simply receive credit used later date significant part program goal increase number customers purchase iphones apple stores rather carrier stores september 20 2013 sales date iphone 5s 5c models longest ever queue observed new york city flagship apple store addition prominent queues san francisco us canada however locations throughout world identified anticipation corresponding consumers apple also increased production gold-colored iphone 5s additional one-third due particularly strong demand emerged apple decided introduce gold model finding gold seen popular sign luxury product among chinese customers apple released opening weekend sales results 5c 5s models showing all-time high product sales figures ninemillion handsets sold\u2014the previous record set 2012 fivemillion handsets sold opening weekend 5 model first time apple simultaneously launched two models inclusion china list markets contributed record sales result apple also announced 200 million devices running ios 7 update making fastest software upgrade history apple store located christiana mall newark delaware us claimed highest iphones sales figures november 2013 store high sales results due absence sales tax state delaware finalization deal apple china mobile world largest mobile network announced late december 2013 multi-year agreement provides iphone access 760 million china mobile subscribers first quarter 2014 apple reported sold 51million iphones all-time quarterly record compared 47.8million year-ago quarter iphone upgrade program 24-month program designed consumers able get latest iphone every year without paying whole price up-front program consists low monthly payments consumers gradually pay iphone 24-month period opportunity switch upgrade new iphone 12 months payment passed 12 months passed consumers trade current iphone new one payments transferred old device new device program restarts new 24-month period additional features program include unlocked handsets means consumers free pick network carrier want two-year applecare+ protection includes hardware repairs software support coverage two incidents accidental damage criticism program includes potential endless cycle payments huffington post damon beres writing complete full 24-month payment cycle 're stuck outdated phone upgrade every 12 months 'll never stop owing apple money iphones additionally program limited iphone hardware cell phone service network operator included release iphone handset manufacturers nokia motorola enjoying record sales cell phones based fashion brand rather technological innovation smartphone market dominated time blackberry os windows mobile devices staid corporate-led smartphone paradigm focused enterprise needs phones time designed around carrier business limits conservative regards bandwidth usage battery life phones sold large number models often segmented marketing strategy confusing customers sapping engineering resources example phones marketed business often deliberately stripped cameras ability play music games apple approach deliberately simplify product line offering one model year customers making expensive high-end product apple marketing developing success ipod campaigns allowed phone become mass-market product many buyers launch day market research found unusually technology product iphone users disproportionately female ars technica noted 2012 apple avoided 'patronizing marketing female customers practice used often sell low-quality high-priced products many competitors then-ceo research motion mike lazaridis pried open iphone impression mac stuffed cellphone used much memory processing power smartphones market time capacitive touchscreen consumer-friendly design iphone fundamentally changed mobile industry steve jobs proclaiming 2007 phone communication tool way life dominant mobile operating systems time symbian blackberry os windows mobile designed handle additional tasks beyond communication basic functions operating systems never focused applications developers due infighting among manufacturers well complexity developing low-memory hardware never developed thriving ecosystem like apple app store android google play iphone os renamed ios 2010 designed robust os capabilities multitasking graphics order meet future consumer demands many services provided mobile carriers often extensively customized devices meanwhile apple decision base os os x unexpected benefit allowing os x developers rapidly expand ios development rival manufacturers forced spend software development costs catch iphone iphone success led decline sales high-end fashion phones business-oriented smartphones vertu blackberry well nokia nokia realised limitations operating system symbian attempted develop advanced system maemo without success ultimately agreed technology-sharing deal takeover microsoft prior iphone handsets viewed largely cheap disposable lures massively subsidized snare subscribers lock using carriers proprietary services however according wired apple retained complete control design manufacturing marketing iphone meaning carrier would control software updates extension security patches contrast google allowed carriers oems dictate pace upgrades pre-load phones software top android result many android oems often lag months behind google release next iteration android although nexus pixel devices guaranteed two years operating system updates third addition year security however apple supported older iterations iphones four years december 2017 reports apple using policy slowing speed older iphones issuing operating system upgrades spurred allegations firm using tactic prompt users older iphones buy newer models iphone 4 iphone models well ios devices manufactured exclusively foxconn based taiwan 2011 tim cook became ceo company apple changed outsourcing strategy first time increasing supply partners iphone 4s 2012 first model manufactured simultaneously two stand-alone companies foxconn well pegatron also based taiwan although foxconn still responsible larger share production pegatron orders slowly increased company tasked producing part iphone 5c line 2013 30 iphone 6 devices 2014 6 plus model produced solely foxconn touchscreen first five generations 9 cm 3.5 liquid crystal display scratch-resistant glass one iphone 5 four inches capacitive touchscreen designed bare finger multiple fingers multi-touch sensing screens first three generations resolution 320\u00d7480 hvga 163 ppi iphone 4 iphone 4s resolution 640\u00d7960 326 ppi 4-inch models 640\u00d71136 326 ppi 4.7-inch models 750\u00d71334 326 ppi 5.5-inch models 1080\u00d71920 401 ppi 5.8-inch model x 1125\u00d72436 458 ppi initial models using twisted-nematic tn lcds starting iphone 4 technology changed in-plane switching ips lcds iphone 5 model screen results aspect ratio approximately 16:9 iphone x first iphone use oled display near bezel-less screen \u224819.5:9 aspect ratio touch gesture features iphone based technology originally developed fingerworks gloves styli prevent necessary electrical conductivity although capacitive styli used iphone finger-touch screen iphone 3gs later also feature fingerprint-resistant oleophobic coating iphone minimal hardware user interface models featuring five buttons physical menu button situated directly display called home button primary function close active app navigates home screen interface earlier models included rounded square reminiscent shape icons home screen however new models include apple fingerprint recognition feature touch id use home button fingerprint sensor symbol iphone x later n't home button instead face id facial recognition authentication method multi-function sleep/wake button located top device serves unit power button also controls phone calls call received pressing sleep/wake button silences ringtone pressed twice transfers call voicemail situated left spine volume adjustment controls iphone 4 two separate circular buttons increase decrease volume earlier models house two switches single plastic panel known rocker switch could reasonably counted either one two buttons directly volume controls ring/silent switch engaged mutes telephone ringing alert sounds new sent emails text messages push notifications camera shutter sounds voice memo sound effects phone lock/unlock sounds keyboard clicks spoken auto-corrections switch mute alarm sounds clock application countries regions mute camera shutter voice memo sound effects buttons except home made plastic original first generation iphone metal later models touchscreen furnishes remainder user interface software update january 2008 allowed first-generation iphone use cell tower wi-fi network locations trilateration despite lacking gps hardware since iphone 3g generation iphone employs a-gps operated united states since iphone 4s generation device also supports glonass global positioning system operated russia since iphone 8 supports galileo iphone 6s 6s plus introduced 2015 feature 3d touch displays allows screen recognize hard pressed using pressure sensitive multi-touch technology subsequent iphones exception iphone se iphone xr feature example technology used lightly pressing screen preview photograph pressing take iphones feature number sensors used adjust screen based operating conditions enable motion-controlled games location-based services unlock phone authenticate purchases apple pay among many things proximity sensor deactivates display touchscreen device brought near face call done save battery power prevent inadvertent inputs user face ears ambient light sensor adjusts display brightness saves battery power prevents screen bright dark 3-axis accelerometer senses orientation phone changes screen accordingly allowing user easily switch portrait landscape mode photo browsing web browsing music playing support upright left right widescreen orientations unlike ipad iphone rotate screen turned upside-down home button screen unless running program specifically designed 3.0 update added landscape support still applications email introduced shaking unit form input generally undo functionality accelerometer also used control third-party apps notably games also used fitness tracking purposes primarily pedometer starting iphone 5s functionality included m7 motion coprocessor subsequent revisions embedded chip magnetometer built-in since iphone 3gs used measure strength direction magnetic field vicinity device sometimes certain devices radio signals interfere magnetometer requiring users either move away interference re-calibrate moving device figure-eight motion since iphone 3gs iphone also features compass app unique time release showing compass points direction magnetic field beginning iphone 4 apple smartphones also include gyroscopic sensor enhancing perception moved previous iphone models contained chip capable receiving radio signals however apple fm radio feature switched antenna connected chip later iterations iphone starting iphone 7 however contain radio chips campaign called free radio phone started encourage cellphone manufacturers apple enable radio phones manufacture reasons cited radio drains less power useful emergency 2016 fort mcmurray wildfire 2017 iphone models starting iphone 5s excluding iphone 5c featured apple fingerprint recognition sensor used unlocking device authenticating apple pay purchases since iphone 6 using touch id located home button touch id replaced face id starting iphone x included iphone 6 later excluding iphone se barometer used determine air pressure elevation device starting iphone x facial recognition sensor named truedepth camera system featured used unlocking device authenticating purchases using face id also used animojis ar bottom iphone speaker left dock connector microphone right additional loudspeaker screen serves earpiece phone calls iphone 4 includes additional microphone top unit noise cancellation switches placement microphone speaker base unit\u2014the speaker right volume controls located left side iphone models slider ipod application 3.5 mm trrs connector headphones located top left corner device first five generations original 4s time moved bottom left corner headphone socket first-generation iphone recessed casing making incompatible headsets without use adapter subsequent generations eliminated problem using flush-mounted headphone socket cars equipped auxiliary jack allow handsfree use iphone driving substitute bluetooth iphone 7 later 3.5 mm headphone jack instead headsets must connect iphone bluetooth use apple lightning port replaced 3.5 mm headphone jack traditional headsets use lightning 3.5 mm headphone jack adapter included iphone 7 iphone x plugs lightning port apple headset multipurpose button near microphone play pause music skip tracks answer end phone calls without touching iphone third-party headsets designed iphone also include microphone control button current headsets also provide volume controls compatible recent models fourth ring audio jack carries extra information built-in bluetooth 2.x+edr supports wireless earpieces headphones requires hsp profile stereo audio added 3.0 update hardware supports a2dp non-sanctioned third-party solutions exist iphone officially support obex file transfer protocol lack profiles prevents iphone users exchanging multimedia files pictures music videos bluetooth-enabled cell phones composite component video 576i stereo audio output dock connector using adapter sold apple iphone 4 also supports 1024\u00d7768 vga output without audio hdmi output stereo audio via dock adapters iphone support voice recording 3.0 software update iphone features internal rechargeable lithium-ion battery like ipod unlike mobile phones time launch battery user-replaceable iphone charged connected computer syncing across included usb dock connector cable similar charging ipod alternatively usb ac adapter wall charger also included connected cable charge directly ac outlet models iphone support wireless charging apple runs tests preproduction units determine battery life apple website says battery life designed retain 80 original capacity 400 full charge discharge cycles comparable ipod batteries battery life early models iphone criticized several technology journalists insufficient less apple claims also reflected j. d. power associates customer satisfaction survey gave battery aspects iphone 3g lowest rating two five stars battery malfunctions dies prematurely phone returned apple replaced free still warranty warranty lasts one year purchase extended two years applecare battery replacement service pricing made known buyers day product launched similar apple third parties replace batteries ipods foundation taxpayer consumer rights consumer advocate group sent complaint apple fee consumers pay battery replaced apple reduced price out-of-warranty iphone battery replacement 29 since july 2007 third-party battery replacement kits available much lower price apple battery replacement program kits often include small screwdriver instruction leaflet many newer ipod models battery first generation iphone soldered therefore soldering iron required install new battery iphone 3g uses different battery fitted connector easier replace iphone x features different battery two battery cells adhesive pull tabs adhered sides instead folded top therefore making repairs little difficult patent filed corporation published late july 2013 revealed development new iphone battery system uses location data combination data user habits moderate handsets power settings accordingly apple working towards power management system provide features ability estimate length time user away power source modify energy usage detection function adjusts charging rate best suit type power source used december 28 2017 amidst many complaints older iphone models slowing new ones released apple released communication customers website acknowledging effect old batteries iphone performance company offered 29 battery replacements solution first-generation iphone iphone 3g fixed-focus 2.0-megapixel camera back digital photos optical zoom flash autofocus natively support video recording video recording possible first-generation iphone iphone 3g via third-party app available app store jailbreaking iphone os 2.0 introduced geotagging photos iphone 3gs 3.2-megapixel camera autofocus auto white balance auto macro 10 cm manufactured omnivision camera also capture 640\u00d7480 vga resolution video 30 frames per second video cropped iphone directly uploaded youtube services iphone 4 introduced 5.0-megapixel camera 2592\u00d71936 pixels record video 720p resolution considered high-definition also backside-illuminated sensor capture pictures low light led flash stay lit recording video first iphone natively high dynamic range photography iphone 4 also second camera front take vga photos record sd video saved recordings may synced host computer attached email supported sent mms iphone 4s camera shoot 8-mp stills 1080p video accessed directly lock screen triggered using volume-up button shutter trigger built-in gyroscope stabilize image recording video iphone 5 iphone 4s running ios 6 later take panoramas using built-in camera app iphone 5 also take still photos recording video camera iphone 5 reportedly shows purple haze light source frame although consumer reports said prone purple hazing photos shot bright light source predecessor several android phones fine cameras ... five model generations phone configured bring camera app quickly pressing home key twice iphones running also accessed lock screen directly iphone 5s features true tone flash two led lights white amber improve white balance adjusted 1,000 combinations image sensor 15 percent larger previous model iphone 6 6 plus include phase detection autofocus 6 plus optical image stabilization models shoot 1080p videos 60 frames per second release ios 8 iphone 4s later models shoot time-lapse videos capability switch frame rates automatically recording increases time iphone 6s 6s plus outfitted 12 megapixel camera 4k hd video capability front-facing camera upgraded 5 megapixels user may change resolution 4k 1080p settings iphone se features 12 mp camera found iphone 6s iphone 6s plus models 4k video capability front camera 1.2 mp iphone 7 features optical image stabilization rear camera feature previously exclusive plus models 7 plus first iphone feature dual-lens cameras 12 mp models 7 mp front-facing camera second camera iphone 7 plus telephoto lens enables 2\u00d7 optical zoom 10\u00d7 digital zoom rear cameras 7 7 plus f/1.8 aperture also new quad-led true tone flash brighter compared predecessors iphone 8 camera remains largely predecessor features larger sensor newer color filter camera also record 4k 60 24 frames per second slow-mo 1080p 240 frames per second new camera system also enables portrait lighting defines light scene also features quad-led true tone flash 2\u00d7 better light uniformity slow sync iphone x camera almost iphone 8 camera telephoto lens aperture f/2.4 optical image stabilization front camera also portrait mode portrait lighting due new truedepth camera system iphone xs xs max xr updated 12mp 1/2.55 sensor size 1.4 \u03bcm pixel size xs series telephoto lens lower end xr one lens iphone initially released two options internal storage size 4 8gb september 5 2007 apple discontinued 4gb models february 5 2008 apple added 16gb model iphone 3g available 8 16gb released 2008 iphone 3gs came 16 32gb variants remained available 8gb september 2012 three years launch iphone 4 available 16 32gb variants well 8gb variant sold alongside iphone 4s reduced price point iphone 4s available three sizes 16 32 64gb iphone 5 5s available three sizes iphone 4s 16 32 64gb.. lower-cost iphone 5c model initially available 16 32gb models 8gb model added later iphone 6 6s available three sizes launch 16 64 128gb iphone se available 16 64gb variants launch iphone 7 7 plus released apple changed base model storage capacity 16 32gb iphone 7 7 plus configurations 32 128 256gb storage apple doubled storage iphone 6s 6s plus two configurations 32 128gb well iphone se six months later iphone 8 8 plus x changed base model capacity 64gb retaining 256gb storage option iphone xs xs max introduced 512gb storage option addition existing 64 256 gb options iphone xr comes three storage options 64 128 256gb gsm models iphone use sim card identify gsm network sim sits tray inserted slot top device sim tray ejected paper clip sim ejector tool simple piece die-cut sheet metal included iphone 3g 3gs united states models elsewhere world iphone models shipped sim ejector tool fabricated alloy dubbed liquidmetal countries iphone usually sold sim lock prevents iphone used different mobile network gsm iphone 4 features microsim card located slot right side device cdma model iphone 4 cdma-only cell phone use sim card sim card slot iphone 4s activated cdma carrier however sim card slot rely sim card activation cdma network cdma-activated iphone 4s usually carrier-approved roaming sim preloaded sim slot time purchase used roaming certain carrier-approved international gsm networks sim slot locked use roaming sim card provided cdma carrier case verizon example one request sim slot unlocked international use calling support number requesting international unlock account good standing past 60 days method unlocks iphone 4s use international carriers iphone 4s unlocked way reject non international sim cards mobility t-mobile usa example iphone 5 later iphones use nano-sim order save space internally iphone xs xs max xr added esim support addition nano-sim therefore support dual sim functionality iphones well many devices apple small disc bottom headphone jack changes white red contact water iphone 3g later models also similar indicator bottom dock connector apple warranties cover water damage employees examine indicators approving warranty repair replacement however adoption water resistance feature iphone practice longer use apple iphone indicators exposed mobile phones manufacturers carry protected location beneath battery behind battery cover indicators triggered routine use owner sweat steam bathroom light environmental moisture criticism led apple change water damage policy iphones similar products allowing customers request internal inspection phone verify internal liquid damage sensors triggered iphone models include written documentation dock connector usb cable first generation 3g iphones also came cleaning cloth first generation iphone includes stereo headset earbuds microphone plastic dock hold unit upright charging syncing iphone 3g includes similar headset plus sim eject tool first generation model requires paperclip iphone 3gs includes sim eject tool revised headset adds volume buttons functional previous iphone versions iphone 3g 3gs compatible dock sold separately first generation model dock versions include usb power adapter wall charger allows iphone charge ac outlet iphone 3g iphone 3gs sold north america japan colombia ecuador peru include ultracompact usb power adapter september 2014 launch iphone 6 apple announced apple pay mobile payment system feature aimed revolutionize way users pay uses nfc chip touch id fingerprint scanner face id iphone x later apple wallet app dedicated secure element chip encrypted payment information make purchases participating stores physical online iphone models haptic engine vibrate notification alert incoming call etc iphone models iphone 4s use eccentric rotating mass motor iphone 4s uses linear resonant actuator vibrator usually uses less power creates quieter vibration however iphone 5 5c 5s uses eccentric rotating mass motor unsure apple decided switch back however iphone 6 6 plus uses linear resonant actuator vibrator iphone 6s uses taptic engine vibration haptic feedback works similar eccentric rotating mass motor iphone runs operating system known ios formerly iphone os variant darwin operating system core found macos also included core animation software component mac os x v10.5 leopard together graphics hardware iphone 3gs opengl es 2.0 responsible interface motion graphics iphone comes set bundled applications developed apple supports downloading third-party applications app store apple provides free updates operating system iphone either wirelessly itunes major new updates historically accompanied new models size operating system depends version ios 8 required 4.5 gb successor required 1.3 gb interface based around home screen graphical list available applications iphone applications normally run one time starting iphone 4 primitive version multitasking came play users could double click home button select recently opened applications however apps never ran background starting ios 7 though apps truly multitask open application runs background use although functionality still available making call listening music home screen accessed hardware button screen iphone 8 earlier iphone x later models require swipe original iphone contained following apps messages sms mms messaging calendar photos camera youtube stocks maps google maps weather voice memos notes clock calculator settings itunes store app store introduced iphone 3gs iphone 4 compass facetime gamecenter added ios 4 4.1 respectively ios 5 reminders newsstand added ipod application split separate music videos applications ios 6 added passbook well updated version maps relies data provided tomtom well sources youtube longer came pre-installed application ios 8 added health app ios 9 replaced newsstand passbook news wallet ios 10 introduces home ios 11 added files ios 12 introduces measure app uses ar technology measure objects things available devices a9 chip newer docked base screen four icons phone mail safari internet music delineate iphone main purposes january 15 2008 apple released software update 1.1.3 allowing users create web clips home screen icons resemble apps open user-defined page safari update iphone users rearrange place icons holding icon moving desired location start shaking nine adjacent home screens accessed horizontal swipe users also add delete icons dock every home screen home screen holds twenty icons first-generation iphone 3g 4 4s home screen iphone 5 holds twenty-four icons due larger screen display dock holds four icons users delete web clips third-party applications time may select certain applications transfer itunes apple default programs could removed since ios 10 update 3.0 update adds system-wide search known spotlight left first home screen almost input given touch screen understands complex gestures using multi-touch iphone interaction techniques enable user move content touch-drag motion finger example zooming web pages photos done placing two fingers screen spreading farther apart bringing closer together gesture known pinching scrolling long list menu achieved sliding finger display bottom top vice versa go back either case list moves pasted outer surface wheel slowly decelerating affected friction way interface simulates physics real object unlike previous scrollable views user pressed control move view downwards ios user pushes upwards moving plank wood floating water creating impression user directly manipulating content displayed screen user-centered interactive effects include horizontally sliding sub-selection vertically sliding keyboard bookmarks menu widgets turn around allow settings configured side menu bars found top bottom screen necessary options vary program always follow consistent style motif menu hierarchies back button top-left corner screen displays name parent folder iphone allows audio conferencing call holding call merging caller id integration cellular network features iphone functions example music playing call received music fades fades back call ended proximity sensor shuts screen touch-sensitive circuitry iphone brought close face save battery prevent unintentional touches iphone support video calling videoconferencing versions prior fourth generation one camera opposite side screen iphone 4 supports video calling using either front back camera wi-fi feature apple calls facetime voice control introduced iphone 3gs allows users say contact name number iphone dial first two models support voice dialing third-party applications iphone includes visual voicemail countries feature allowing users view list current voicemail messages on-screen without call voicemail unlike systems messages listened deleted non-chronological order choosing message on-screen list music ringtone feature introduced united states september 5 2007 users create custom ringtones songs purchased itunes store small additional fee ringtones three 30 seconds long part song fade pause half second five seconds looped loop continuously customizing done itunes apple garageband software 4.1.1 later available mac os x third-party tools release ios 6 released september 19 2012 apple added features enable user options decline phone call person calling user reply message set reminder call back later time layout music library similar ipod iphone sort media library songs artists albums videos playlists genres composers podcasts audiobooks compilations options presented alphabetically except playlists retain order itunes iphone uses large font allows users plenty room touch selection users rotate device horizontally landscape mode access cover flow like itunes feature shows different album covers scroll-through photo library scrolling achieved swiping finger across screen alternatively headset controls used pause play skip repeat tracks iphone 3gs volume changed included apple earphones voice control feature used identify track play songs playlist specific artist create genius playlist iphone supports gapless playback like fifth-generation ipods introduced 2005 iphone play digital video allowing users watch tv shows movies widescreen double-tapping switches widescreen video playback iphone allows users purchase download songs itunes store directly iphone feature originally required wi-fi network since 2012 used cellular data network iphone includes software allows user upload view email photos taken camera user zooms photos sliding two fingers apart closer together much like safari camera application also lets users view camera roll pictures taken iphone camera pictures also available photos application along transferred iphoto aperture mac photoshop windows pc internet access available iphone connected local area wi-fi wide area gsm edge network second-generation 2g wireless data standards iphone 3g introduced support third-generation umts hsdpa 3.6 iphone 4s introduced support hsupa networks 14.4 mbit/s support hsdpa 7.2 introduced iphone 3gs networks accessible iphone models include 1xrtt represented 1\u00d7 status bar gprs shown gprs status bar edge shown capital e status bar umts ev-do shown 3g faster version umts 4g shown 4g symbol status bar lte shown lte status bar 5g evolution supported areas implemented stylized larger 5g reduced size capital e. 5ge uses 4x4 mimo doubling number antennas 256-qam three-way carrier aggregation true 5g expected iphone 2020 release introduced 3g july 2004 late 2007 steve jobs stated still widespread enough us chipsets energy efficient enough included iphone support 802.1x authentication system commonly used university corporate wi-fi networks added 2.0 version update default iphone ask join newly discovered wi-fi networks prompt password required alternatively join closed wi-fi networks manually iphone automatically choose strongest network connecting wi-fi instead edge available similarly iphone 3g onwards prefer 3g 2g wi-fi either wi-fi bluetooth 3g iphone 3g onwards deactivated individually airplane mode disables wireless connections overriding preferences however airplane mode one explicitly enable wi-fi and/or bluetooth modes join continue operate one networks cellular network transceivers remain safari iphone native web browser displays pages similar mac windows counterparts web pages may viewed portrait landscape mode device supports automatic zooming pinching together spreading apart fingertips screen double-tapping text images safari allow file downloads except predefined extensions iphone support flash still popular iphone introduced consequently uk advertising standards authority adjudicated advertisement claiming iphone could access parts internet withdrawn current form grounds false advertising rare public letter april 2010 apple ceo steve jobs outlined reasoning behind absence flash iphone ipad iphone supports svg css html canvas bonjour google chrome introduced ios june 26 2012 opera mini also available maps application access google maps map satellite hybrid form also generate directions two locations providing optional real-time traffic information iphone announcement jobs demonstrated feature searching nearby starbucks locations placing prank call one single tap support walking directions public transit street view added version 2.2 software update voice-guided navigation iphone 3gs iphone 4 orient map digital compass apple also developed separate application view youtube videos iphone streams videos encoding using h.264 codec simple weather stock quotes applications also tap internet iphone users access internet frequently variety places according google 2008 iphone generated 50 times search requests mobile handset according deutsche telekom ceo ren\u00e9 obermann average internet usage iphone customer 100 megabytes 30 times use average contract-based consumer customers nielsen found 98 iphone users use data services 88 use internet china iphone 3g iphone 3gs built distributed without wi-fi introduction verizon iphone january 2011 issue using internet phone brought public attention two us carriers internet phone could used simultaneously networks whereas verizon networks support use separately however 2014 verizon announced iphone 6 6 plus would allow simultaneous voice data lte network t-mobile sprint enabled calls wi-fi verizon soon text input iphone implements virtual keyboard touchscreen automatic spell checking correction predictive word capabilities dynamic dictionary learns new words keyboard predict word user typing complete correct accidental pressing keys near presumed desired key keys somewhat larger spaced farther apart landscape mode supported limited number applications touching section text brief time brings magnifying glass allowing users place cursor middle existing text virtual keyboard accommodate 21 languages including character recognition chinese alternative characters accents example letters alphabets languages emoji typed keyboard pressing letter two seconds selecting alternative character popup 3.0 update brought support cut copy pasting text well landscape keyboards applications iphone 4s siri allows dictation since ios 8 third party keyboards distributed app store allowed previously available jailbroken iphones iphone also features email program supports html email enables user embed photos email message pdf word excel powerpoint attachments mail messages viewed phone yahoo offers free push-email service iphone imap although push-imap pop3 mail standards also supported including microsoft exchange kerio connect first versions iphone firmware accomplished opening imap exchange server apple also licensed microsoft activesync supports platform including push email release iphone 2.0 firmware iphone sync email account settings apple mail application microsoft outlook microsoft entourage manually configured device email program access almost imap pop3 account text messages presented chronologically mailbox format similar mail places text recipients together replies text messages displayed speech bubbles similar ichat recipient name iphone built-in support email message forwarding drafts direct internal camera-to-email picture sending support multi-recipient sms added 1.1.3 software update support mms added 3.0 update original first generation iphone us september 25 2009 wwdc 2007 june 11 2007 apple announced iphone would support third-party web applications using ajax share look feel iphone interface october 17 2007 steve jobs open letter posted apple hot news weblog announced software development kit sdk would made available third-party developers february 2008 iphone sdk officially announced released march 6 2008 apple town hall facility free download apple registration allows developers develop native applications iphone ipod touch test iphone simulator however loading application onto real device possible paying apple developer connection membership fee developers free set price applications distributed app store receive 70 share developers also opt release application free pay costs release distribute application beyond membership fee app store launched release ios 2.0 july 11 2008 update free iphone users owners older ipod touches required pay us 10 developer submitted application app store apple holds firm control distribution apple halt distribution applications deems inappropriate example rich us 1000 program simply demonstrated wealth user apple criticized banning third-party applications enable functionality apple want iphone 2008 apple rejected podcaster allowed iphone users download podcasts directly iphone claiming duplicated functionality itunes apple since released software update grants capability netshare another rejected app would enabled users tether iphone laptop desktop using cellular network load data computer many carriers iphone later globally allowed tethering apple officially supported upgrade ios 3.0 mobility relative latecomer united states cases carrier charges extra tethering iphone sdk released third parties permitted design web apps would run safari unsigned native applications also available jailbroken phones ability install native applications onto iphone outside app store supported apple stated reason native applications could broken software update apple stated design software updates specifically break native applications perform sim unlocking apple passed 60 billion app downloads 140 billion app downloads app store app store 2.2million apps iphone original iphone described revolutionary game-changer mobile phone industry credited helping make apple one world valuable publicly traded companies 2011 newer iterations also received praise called best phone iphone attracts users ages besides consumer use iphone also adopted business purposes starting iphone 4s apple added accessibility feature optimize function iphone hearing aids apple released program made iphone hearing aids hearing aids deliver power-efficient high-quality digital audio experience allow user manage hearing aid right iphone made iphone hearing aids also feature live listen live listen iphone acts remote microphone sends sound made iphone hearing aid live listen help user hear conversation noisy room hear someone speaking across room braille displays ios program announced apple coinciding release iphone 3gs ipad ipod touch 3rd generation program added support 50 bluetooth wireless braille displays work ios box user needs pair keyboard device start using navigate ios device voiceover without additional software ios supports braille tables 25 languages iphone lets user know alert sent variety notice methods delivers visual vibrating alerts incoming phone facetime calls new text messages new sent mail calendar events users set led light flash incoming calls alerts incoming calls display photo caller users choose different vibration patterns even create iphone enlarge text make accessible vision-impaired users accommodate hearing-impaired users closed captioning external tty devices iphone 3gs also features white black mode voiceover screen reader zooming impaired vision mono audio limited hearing one ear apple regularly publishes voluntary product accessibility templates explicitly state compliance us regulation section 508 release ios 9 iphones users ability choose two different screen view options user choose standard view zoomed view iphone placed standard view setting icons normal size text remains zoomed view option icons screen text become slightly larger enables user customized appearance potentially help users read screen easier assistivetouch helps adapt multi-touch screen ios device user unique physical needs great assistance difficulty gestures like pinch one make accessible tap finger user create gestures customize layout assistivetouch menu user trouble pressing home button set activated onscreen tap gestures like rotate shake available even ios device mounted wheelchair guided access helps people autism attention sensory challenges stay focused task app hand guided access parent teacher therapist limit ios device stay one app disabling home button limit amount time spent app user restrict access keyboard touch input certain areas screen 21 different iphone models produced models bold current flagship devices apple filed 200 patent applications related technology behind iphone lg electronics claimed design iphone copied lg prada woo-young kwak head lg mobile handset r center said press conference consider apple copied prada phone design unveiled presented design award prize september 2006 conversely iphone also inspired share high-tech clones september 3 1993 infogear filed us trademark phone march 20 1996 applied trademark iphone phone registered march 1998 iphone registered 1999 since phone mark abandoned infogear trademarks cover communications terminals comprising computer hardware software providing integrated telephone data communications personal computer functions 1993 filing computer hardware software providing integrated telephone communication computerized global information networks 1996 filing 2000 infogear filed infringement claim owners iphones.com domain name owners iphones.com domain name challenged infringement claim northern district court california june 2000 cisco systems acquired infogear including iphone trademark september 2000 cisco systems settled owners iphones.com allowed owners keep iphones.com domain name along intellectual property rights use designation iphones.com domain name sale cellular phones cellular phones internet access wap phones handheld pdas storage devices computer equipment hardware/software digital cameras hardware/software intellectual property rights granted owners iphones.com domain name cisco systems september 2000 october 2002 apple applied iphone trademark united kingdom australia singapore european union canadian application followed october 2004 new zealand application september 2006 october 2006 singapore australian applications granted september 2006 company called ocean telecom services applied iphone trademark united states united kingdom hong kong following filing trinidad tobago ocean telecom trademark applications use exactly wording new zealand application apple assumed ocean telecom applying behalf apple canadian application opposed august 2005 canadian company called comwave applied trademark three months later comwave selling voip devices called iphone since 2004 shortly steve jobs january 9 2007 announcement apple would selling product called iphone june 2007 cisco issued statement negotiating trademark licensing apple expected apple agree final documents submitted night january 10 2007 cisco announced filed lawsuit apple infringement trademark iphone seeking injunction federal court prohibit apple using name february 2007 cisco claimed trademark lawsuit minor skirmish money interoperability february 2 2007 apple cisco announced agreed temporarily suspend litigation held settlement talks subsequently announced february 20 2007 reached agreement companies allowed use iphone name exchange exploring interoperability security consumer business communications products october 22 2009 nokia filed lawsuit apple infringement gsm umts wlan patents nokia alleges apple violating ten nokia patents since iphone initial release december 2010 reuters reported iphone ipad users suing apple inc. applications passing user information third-party advertisers without permission makers applications textplus4 paper toss weather channel dictionary.com talking tom cat pumpkin maker also named co-defendants lawsuit august 2012 apple smartphone patent lawsuit u.s. samsung world largest maker smartphones however december 6 2016 scotus reversed decision awarded nearly 400 million apple returned case federal circuit court define appropriate legal standard define article manufacture smartphone could case screen design patents relate march 2013 apple patent wraparound display revealed around april 20 2011 hidden unencrypted file iphone ios devices widely discussed media alleged file labeled consolidated.db constantly stores iphone user movement approximating geographic locations calculated triangulating nearby cell phone towers technology proven inaccurate times file released june 2010 update apple ios4 may contain almost year worth data previous versions ios stored similar information file called h-cells.plist f-secure discovered data transmitted apple twice day postulate apple using information construct global location database similar ones constructed google skyhook wardriving nevertheless unlike google latitude application performs similar task android phones file dependent upon signing specific eula even user knowledge stated 15,200 word-long terms conditions iphone apple partners licensees may collect use share precise location data including real-time geographic location user apple computer device file also automatically copied onto user computer synchronized iphone open-source application named iphonetracker turns data stored file visual map made available public april 2011 file erased without jailbreaking phone encrypted apple gave official response web site april 27 2011 questions submitted users associated press others apple clarified data small portion crowd-sourced location database cache wi-fi hotspots cell towers downloaded apple iphone making location services faster gps therefore data represent locations iphone volume data retained error apple issued update ios version 4.3.3 4.2.8 cdma iphone 4 reduced size cache stopped backed itunes erased entirely whenever location services turned upload apple also selectively disabled system services cell network search regardless july 2014 report state-owned china central television labeled iphone national security concern frequent locations feature found settings location services stores commonly visited locations locally device feature said help accuracy gps apple maps since log information locations user frequently visited however feature also keeps track number times user location dates exact times media outlets publicized instructions disabled concerned users revealed part 2013 mass surveillance disclosures american british intelligence agencies national security agency nsa government communications headquarters gchq access user data iphones blackberrys android phones respectively read almost smartphone information including sms location emails notes according article new york times titled signaling post-snowden era new iphone locks n.s.a apple developed new encryption method ios 8 described deep apple could longer comply government warrants asking customer information extracted devices throughout 2015 prosecutors united states argued u.s. government able compel decryption iphone contents 2015 san bernardino attack fbi recovered iphone 5c issued one shooters employer icloud backups phone month half shooting shooters destroyed personal phones u.s. government attempted obtain court order writs act compelling apple produce ipsw file would allow investigators brute force device passcode tim cook responded company website outlining need encryption arguing produce backdoor one device would inevitably used compromise privacy iphone users february 19 apple communicated journalists password apple id iphone changed within day government obtaining preventing apple producing workaround would target older devices see fbi\u2013apple encryption dispute graykey manufactured grayshift unlock iphones even disabled countermeasure apple implemented usb restricted mode apple privacy policy addresses requests government agencies access customers data apple never worked government agency country create 'backdoor products services also never allowed government access servers never 2015 electronic frontier foundation awarded apple five five stars commend ing apple strong stance regarding user rights transparency privacy apple ios combination specific hardware uses crypto-shredding activating erase content settings obliterating keys 'effaceable storage renderes user data device cryptographically inaccessible apple tightly controls certain aspects iphone according jonathan zittrain emergence closed devices like iphone made computing proprietary early versions microsoft windows hacker community found many workarounds disallowed apple make difficult impossible obtain warranty service jailbreaking allows users install apps available app store modify basic functionality sim unlocking allows iphone used different carrier network however united states apple void iphone warranty unless show problem component failure linked installation placement after-market item unauthorized applications federal trade commission magnuson-moss warranty act 1975 users set restrictions parental controls apps downloaded used within iphone restrictions area requires password iphone normally prevents access media player web features unless also activated phone authorized carrier july 3 2007 jon lech johansen reported blog successfully bypassed requirement unlocked iphone features combination custom software modification itunes binary published software offsets others use unlike first generation iphone iphone 3g must activated store countries makes iphone 3g difficult impossible hack need in-store activation well huge number first-generation iphone ipod touch users upgrading iphone os 2.0 caused worldwide overload apple servers july 11 2008 day iphone 3g iphone os 2.0 updates well mobileme released update devices required connect apple servers authenticate causing many devices temporarily unusable users o2 network united kingdom however buy phone online activate via itunes previous model even required vendors usually offer activation buyer convenience us apple begun offer free shipping iphone 3g iphone 3gs available reversing in-store activation requirement best buy walmart also sell iphone iphone operating system designed run software apple-approved cryptographic signature restriction overcome jailbreaking phone involves replacing iphone firmware slightly modified version enforce signature check may circumvention apple technical protection measures apple statement united states copyright office response electronic frontier foundation eff lobbying dmca exception kind hacking claimed jailbreaking iphone would copyright infringement due necessary modification system software however 2010 jailbreaking declared officially legal united states dmca jailbroken iphones may susceptible computer viruses incidents reported ios android 2.3.3 'gingerbread may set dual boot jailbroken iphone help openiboot idroid 2007 2010 2011 developers released series tools called jailbreakme used security vulnerabilities mobile safari rendering jailbreak device allows users install compatible software device instead app store apps exploits quickly fixed ios updates apple theoretically flaws could also used malicious purposes july 2011 apple released ios 4.3.5 4.2.10 cdma iphone fix security vulnerability certificate validation following release iphone 5s model group german hackers called chaos computer club announced september 21 2013 bypassed apple new touch id fingerprint sensor using easy everyday means group explained security system defeated photographing fingerprint glass surface using captured image verification spokesman group stated hope finally puts rest illusions people fingerprint biometrics plain stupid use something ca n't change leave everywhere every day security token iphones still sold sim lock restricts use phone one particular carrier common practice subsidized gsm phones unlike gsm phones however phone officially unlocked entering code locked/unlocked state maintained apple servers per imei set iphone activated iphone initially sold us network sim lock place various hackers found methods unlock phone specific network although sprint t-mobile verizon authorized iphone carriers united states unlocked iphones used carriers example unlocked iphone may used t-mobile network us unlocked iphone compatible t-mobile voice network may able make use 3g functionality i.e mobile web e-mail etc. quarter original first generation iphones sold us registered apple speculates likely shipped overseas unlocked lucrative market iphone 3g worldwide release march 26 2009 united states began selling iphone without contract though still sim-locked network up-front purchase price iphone units often twice expensive bundled contracts outside united states policies differ especially us territories insular areas like guam gta teleguam exclusive carrier iphone since introduction none four us carriers sprint t-mobile verizon presence area since 2013 docomo pacific ended gta exclusivity starting iphone 5 beginning april 8 2012 began offering factory sim unlock option apple calls whitelisting allowing used carrier phone supports iphone owners reported verizon 4g lte phones come factory unlocked discovery verizon announced 4g lte phones including iphones would remain unlocked due regulations fcc placed 700 mhz c-block spectrum used verizon united kingdom o2 ee 3 vodafone tesco mobile sell device subsidised contracts use pay go locked network initially though usually unlocked either certain period contract length passed small fee exception 3 network unlock device time charge however current versions iphone available purchase sim-free apple store apple online store consequently unlocked use gsm network iphones purchased full retail price apple store online apple.com come unlocked allows customer selection carriers iphones sold canada purchased mobile carries telus rogers bell locked respective networks unlocking required visiting carrier store paying unlocking fee third party methods unlock iphones existed highly unreliable sometimes rendered phones unusable however 2017 crtc abolished sim-locking required mobile devices sold december 1 2017 come unlocked crtc also mandated carriers must offer unlocking services existing devices free consumers regardless whether purchased phone three major carriers australia optus telstra vodafone offer legitimate unlocking cost iphone devices current prior models internationally policies vary many carriers sell iphone unlocked full retail price 2003 four years iphone officially introduced trademark ifone registered mexico communications systems services company ifone apple tried gain control brandname mexican court denied request case began 2009 mexican firm sued apple supreme court mexico upheld ifone rightful owner held apple iphone trademark violation brazil brand iphone registered 2000 company called gradiente eletr\u00f4nica s.a. igb eletr\u00f4nica s.a according filing gradiente foresaw revolution convergence voice data internet time brazil final battle brandname concluded 2008 december 18 2012 igb launched line android smartphones tradename exclusive rights local market february 2013 brazilian patent trademark office known instituto nacional da propriedade industrial issued ruling gradiente eletr\u00f4nica apple owned iphone mark brazil iphone term registered gradiente 2000 7 years apple release first iphone decision came three months gradiente eletr\u00f4nica launched lower-cost smartphone using iphone brand june 2014 apple second time right use brandname brazil court ruling determined gradiente registration exclusive rights brand although gradiente intended appeal decision apple use freely brand without paying royalties brazilian company philippines solid group launched myphone brand 2007 stylized my|phone solid broadband filed trademark application brand apple later filed trademark case intellectual property office philippines ipophl solid broadband myphone confusingly similar iphone may likely deceive cause confusion among consumers apple lost trademark battle solid group 2015 decision made ipo director nathaniel arevalo also reportedly said unlikely consumers would confused iphone myphone case giant trying claim territory entitled great prejudice local 'pinoy phone merchant managed obtain significant foothold mobile phone market marketing sale innovative products distinctive trademark arevalo later added", + "neighbors": [ + 11, + 33, + 62, + 71, + 75, + 99, + 121, + 130, + 134, + 141, + 162, + 214, + 228, + 252, + 269, + 270, + 322, + 337, + 345, + 355, + 356, + 359, + 394, + 395, + 403, + 475, + 477, + 489, + 511, + 527, + 528, + 551, + 596, + 607, + 610, + 625, + 631, + 634, + 658, + 686, + 696, + 755, + 782, + 797, + 810, + 833, + 858, + 877, + 917, + 927, + 945, + 956, + 961, + 965, + 972, + 977, + 1001, + 1051, + 1100, + 1121, + 1138, + 1140, + 1178, + 1189, + 1237, + 1246, + 1262, + 1280, + 1292, + 1305, + 1325, + 1334, + 1339, + 1350, + 1409, + 1488, + 1496, + 1500, + 1503, + 1507, + 1544, + 1563, + 1575, + 1582, + 1586, + 1591, + 1594, + 1602, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 1374, + "label": 9, + "text": "Sed:sed sed stream editor unix utility parses transforms text using simple compact programming language sed developed 1973 1974 lee e. mcmahon bell labs available today operating systems sed based scripting features interactive editor ed editor 1971 earlier qed quick editor 1965\u201366 sed one earliest tools support regular expressions remains use text processing notably substitution command popular alternative tools plaintext string manipulation stream editing include awk perl first appearing version 7 unix sed one early unix commands built command line processing data files evolved natural successor popular grep command original motivation analogue grep g/re/p substitution hence g/re/s foreseeing special-purpose programs command would also arise g/re/d mcmahon wrote general-purpose line-oriented stream editor became sed syntax sed notably use codice_1 pattern matching codice_2 substitution originated ed precursor sed common use time regular expression syntax influenced languages notably ecmascript perl later powerful language awk developed functioned cousins allowing powerful text processing done shell scripts sed awk often cited progenitors inspiration perl influenced perl syntax semantics notably matching substitution operators gnu sed added several new features including in-place editing files super-sed extended version sed includes regular expressions compatible perl another variant sed minised originally reverse-engineered 4.1bsd sed eric s. raymond currently maintained ren\u00e9 rebe minised used gnu project gnu project wrote new version sed based new gnu regular expression library current minised contains extensions bsd sed feature-rich gnu sed advantage fast uses little memory used embedded systems version sed provided minix sed line-oriented text processing utility reads text line line input stream file internal buffer called pattern space line read starts cycle pattern space sed applies one operations specified via sed script sed implements programming language 25 commands specify operations text input line running script sed ordinarily outputs pattern space line modified script begins cycle next line end-of-script behaviors available sed options script commands e.g codice_3 delete pattern space codice_4 quit codice_5 add next line pattern space immediately thus sed script corresponds body loop iterates lines stream loop loop variable current line number implicit maintained sed sed script either specified command line codice_6 option read separate file codice_7 option commands sed script may take optional address terms line numbers regular expressions address determines command run example codice_8 would run codice_3 delete command second input line printing lines second codice_10 would delete lines beginning space separate special buffer hold space may used sed commands hold accumulate text cycles sed command language two variables hold space pattern space goto-like branching functionality nevertheless language turing-complete esoteric sed scripts exist games sokoban arkanoid chess tetris main loop executes line input stream evaluating sed script line input lines sed script pattern-action pair indicating pattern match action perform recast conditional statement main loop working variables pattern space hold space input output streams default actions copy line pattern space print pattern space implicit possible write terse one-liner programs example sed program given print first 10 lines input stop following example shows typical common use sed substitution usage indeed original motivation sed versions sed expression must preceded codice_6 indicate expression follows codice_12 stands substitute codice_13 stands global means matching occurrences line would replaced regular expression i.e pattern searched placed first delimiting symbol slash replacement follows second symbol slash codice_1 conventional symbol originating character search ed could used make syntax readable occur pattern replacement useful avoid leaning toothpick syndrome substitution command originates search-and-replace ed implements simple parsing templating codice_15 provides pattern matching saving text via sub-expressions codice_16 either literal text format string containing characters codice_17 entire match special escape sequences codice_18 codice_19 n th saved sub-expression example codice_20 replaces occurrences cat dog cats dogs without duplicating existing codice_21 1st saved sub-expression regexp codice_18 format string substitutes output besides substitution forms simple processing possible using 25 sed commands example following uses command delete lines either blank contain spaces example uses following regular expression metacharacters sed supports full range regular expressions complex sed constructs possible allowing serve simple highly specialised programming language flow control example managed use label colon followed string branch instruction codice_29 instruction codice_29 followed valid label name move processing block following label unix sed often used filter pipeline program generatedata generates data sed makes small change replacing x example often useful put several sed commands one command per line script file codice_31 use codice_7 option run commands codice_33 file number commands may placed script file using script file also avoids problems shell escaping substitutions script file may made directly executable command line prepending shebang line containing sed command assigning executable permission file example file codice_31 created contents file may made executable current user codice_35 command chmod u+x subst.sed file may executed directly command line codice_36 option introduced gnu sed allows in-place editing files actually temporary output file created background original file replaced temporary file example hello world script file e.g. script.txt invoked codice_37 inputfilename input text file script changes inputfilename line 1 hello world quits printing result sed exits input lines past line 1 read printed sole output hello world example emphasizes many key characteristics sed follow various sed scripts executed passing argument sed put separate file executed via codice_7 making script executable replace instance certain word file redacted irc password save result delete line containing word yourword address '/yourword/ delete instances word yourword delete two words file simultaneously express previous example one line entering command line one may join two commands via semicolon next example sed usually works one line removes newlines sentences second line starts one space consider following text sed script turn text following text note script affects input lines start space script explained expressed single line via semicolons simple limited sed sufficiently powerful large number purposes sophisticated processing powerful languages awk perl used instead particularly used transforming line way complicated regex extracting template replacement though arbitrarily complicated transforms principle possible using hold buffer conversely simpler operations specialized unix utilities grep print lines matching pattern head print first part file tail print last part file tr translate delete characters often preferable specific tasks designed carry specialized utilities usually simpler clearer faster general solution sed ed/sed commands syntax continue used descendent programs text editors vi vim analog ed/sed sam/ssam sam plan 9 editor ssam stream interface yielding functionality similar sed", + "neighbors": [ + 134, + 306, + 405, + 594, + 631, + 816, + 836, + 901, + 940, + 1046, + 1110, + 1216, + 1218, + 1227, + 1243, + 1264, + 1324, + 1457, + 1517, + 1587 + ], + "mask": "Train" + }, + { + "node_id": 1375, + "label": 9, + "text": "R._Kent_Dybvig:r. kent dybvig r. kent dybvig professor computer science indiana university bloomington bloomington indiana research focuses programming languages principal developer optimizing chez scheme compiler runtime system initially released 1985 together daniel p. friedman long advocated use scheme language teaching computer science professor emeritus retired indiana university iu join cisco 2011 contributions practical theoretical aspects computing information technology particular design development chez scheme association computing machinery acm named dybvig distinguished member 2006 first year association awarded distinguished ranks", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 503, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 965, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1376, + "label": 5, + "text": "Firefox_2:firefox 2 mozilla firefox 2 version firefox web browser released october 24 2006 mozilla corporation firefox 2 uses version 1.8 gecko layout engine displaying web pages release contained many new features found firefox 1.5 including improved support scalable vector graphics svg javascript 1.7 well user interface changes march 22 2006 first alpha version firefox 2 bon echo alpha 1 released featured gecko 1.8.1 first time mozilla firefox 2.0.0.x final version officially supported windows nt 4.0 windows 98 windows although run windows 95 windows nt 3.51 using tweaks mac os x 10.5 support added october 18 2007 version 2.0.0.8 firefox 2.0 featured updates tabbed browsing environment extensions manager gui find search software update engines new session restore feature inline spell checking anti-phishing feature implemented google extension later merged program mozilla ended support firefox 2 december 18 2008 one article noted release firefox 2.0 october 2006 ie6 lion share browser market 77.22 internet explorer 7 climbed 3.18 firefox 2.0 0.69 softpedia article however noted july 2007 firefox 2.0 also expanding share constantly spite ie7 0.69 october 2006 firefox 2.0 accounting 11.07 market mozilla even sacrificed version 1.5 open source browser firefox 2.0 support cut end june firefox 1.5 dropped 2.85 firefox 2 began lose notable market share firefox 3 within 24 hours release firefox 3 usage rose 1 3 according net applications time period firefox 2 market share consistently dropped eventually surpassed firefox 3 2008 firefox 3.5 2009 general browser market firefox version greatest share early 2009 dropped 3 percent firefox 2.x end-of-lifed december 2008 roughly 26 months support firefox 3.6 supported longer gecko 1.8.1 browser core continued receive patches projects camino k-meleon seamonkey even official firefox releases ceased 2011 1.8.1 core become obsolete major websites dropped support employing newer technologies presentation complex scripting latter resource-intensive older core users stuck use noscript avoid problems scripts take long process cost losing site features beyond basic functionality services large user bases relegated browsers gecko 1.8.1 rendering engine using lightweight mobile versions sites alongside recommendations upgrade browser others recommend upgrade nevertheless still large number websites freely usable navigable firefox 2.0 equivalents alone many must still support older browsers like internet explorer 6 ie7", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 134, + 258, + 277, + 427, + 452, + 491, + 509, + 530, + 580, + 582, + 623, + 627, + 668, + 684, + 713, + 796, + 869, + 886, + 939, + 953, + 959, + 961, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1302, + 1378, + 1406, + 1423, + 1424, + 1528, + 1539, + 1542, + 1550, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1377, + "label": 7, + "text": "FUJITSU_Cloud_IaaS_Trusted_Public_S5:fujitsu cloud iaas trusted public s5 fujitsu cloud iaas trusted public s5 fujitsu cloud computing platform aims deliver standardized enterprise-class public cloud services globally offers infrastructure-as-a-service iaas fujitsu data centers provide computing resources employed on-demand suited customers needs service ensures high level reliability sufficient deployment mission-critical systems japan service offered on-demand virtual system service oviss launched globally fujitsu global cloud platform/s5 fgcp/s5 since july 2013 service called iaas trusted public s5 globally service operated fujitsu data centers located australia singapore united states united kingdom germany fujitsu also launched windows azure powered global cloud platform partnership microsoft platform-as-a-service paas offering known fgcp/a5 japan since renamed fujitsu cloud paas a5 windows azure operated fujitsu data center japan offers set application development frameworks microsoft .net java php data storage capabilities consistent windows azure platform provided microsoft basic service consists compute storage microsoft sql azure windows azure appfabric technologies service bus access control service options interoperating services covering implementation migration applications system building systems operation support 2015 fujitsu launched next generation cloud service k5 deployed globally october 2018 fujitsu announced discontinuing k5 regions except japan october 16 2018 company stated hire 10,000 employees train use microsoft azure order address see industry-wide shortage cloud related skills help clients address execution gap provision services support operational efficiency digital co-creation multi-cloud management. \u201d fujitsu launched global cloud strategy april 2010 provision services platform offered trial basis 200 companies japan following month fujitsu announced general availability iaas service japan name on-demand virtual system service oviss starting 1 october 2010 part service global rollout launched australia name fujitsu global cloud platform fgcp february 2011 followed launches march 2011 singapore may 2011 united kingdom germany united states america july 2012 fujitsu added center western japan bring total number seven july 2013 fujitsu announced fujitsu cloud initiative globally also announced new name fujitsu cloud iaas trusted public s5 october 2018 fujitsu announced discontinuing k5 regions except japan basic component iaas trusted public s5 called virtual system consists firewall one multiple network segments customers host virtual machines signed customers deploy multiple systems within environment much like virtual data center iaas trusted public s5 employs templates allow customers quickly deploy virtual systems template consists firewall network segment definitions virtual servers os/middleware installed set allows quick selection example system three network zones pre-installed web server dmz application server secure zone database another secure zone virtual system includes firewall control access network segments internet intranet intranet connection communication virtual servers customers existing servers hosted fujitsu data center virtual servers chosen list pre-defined images operating system installed also additional software servers different computational resources offered operating systems offered globally include windows server 2008 windows server 2012 red hat enterprise linux centos ubuntu fujitsu claimed licensing issue prevents delivery microsoft office cloud service web based devices manner similar google docs virtual server system disk pre-defined size additional disks sizes configurable 10 gb 10 tb attached server running customers provision global ip addresses assign virtual servers similar amazon elastic ip address feature users provision manage virtual systems self-service portal also used initiate vpn connection virtual zone operations offered service portal also offered cloud api api xml-rpc based using ssl encrypt messages certificates authentication operations also possible multi-cloud api apache deltacloud fujitsu submitted cloud api specification distributed management task force open cloud standards incubator promote open standards cloud interoperability contributed dmtf cloud infrastructure management interface cimi standard july 2013 fujitsu demonstrated client using cimi manage system iaas trusted public s5 management developers conference servers physically located fujitsu tier iii data centers japan australia singapore uk us germany", + "neighbors": [ + 77, + 134, + 480, + 505, + 556, + 611, + 671, + 813, + 857, + 936, + 1019, + 1036, + 1138, + 1159, + 1377, + 1431, + 1447, + 1583 + ], + "mask": "Train" + }, + { + "node_id": 1378, + "label": 5, + "text": "Epic_(web_browser):epic web browser epic privacy-centric web browser developed hidden reflex software product company founded alok bhardwaj based washington dc bangalore india chromium source code epic always private browsing mode exiting browser causes browsing data deleted even browsing little possible stored epic developers remove google tracking code binaries chromium source code compile clean executable blocks companies tracking users browser connection electronic privacy information center civil liberties group also known epic epic released august 29 2013 customized indian users browser integrated widgets social networking chat clients email facilities epic default configuration takes proactive approach ensuring session data cookies history cache removed upon exit browser includes proxy service enabled user discretion automatically enabled using search engine features preferring ssl connections always sending track header advance privacy however many implementations extension based part core browser code epic browser extension based feature implementation allow users extract import extensions chromium based browsers chrome extension developer mode ad user activity trackers blocked default epic browser prevents user tracking occur browser also blocks cryptocurrency miners running users system browsers fingerprinting protection blocks access image canvas font canvas audio context data webrtc ip address leaking blocked default well epic proxy service relay connections user 8 countries including united states united kingdom canada germany france netherlands india singapore company claims encrypted routes dns requests well supplementary services found chromium browser send data external servers address bar suggestion installation tracking removed epic reduce scope potential data leakage epic supports windows 7 later mac os x list web browsers", + "neighbors": [ + 83, + 95, + 107, + 258, + 277, + 352, + 427, + 509, + 530, + 531, + 582, + 623, + 668, + 684, + 713, + 862, + 886, + 939, + 953, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1331, + 1376, + 1408, + 1423, + 1528, + 1550, + 1569 + ], + "mask": "Test" + }, + { + "node_id": 1379, + "label": 4, + "text": "Rootkit:rootkit rootkit collection computer software typically malicious designed enable access computer area software otherwise allowed example unauthorized user often masks existence existence software term rootkit concatenation root traditional name privileged account unix-like operating systems word kit refers software components implement tool term rootkit negative connotations association malware rootkit installation automated attacker install obtained root administrator access obtaining access result direct attack system i.e exploiting known vulnerability privilege escalation password obtained cracking social engineering tactics like phishing installed becomes possible hide intrusion well maintain privileged access key root administrator access full control system means existing software modified including software might otherwise used detect circumvent rootkit detection difficult rootkit may able subvert software intended find detection methods include using alternative trusted operating system behavioral-based methods signature scanning difference scanning memory dump analysis removal complicated practically impossible especially cases rootkit resides kernel reinstallation operating system may available solution problem dealing firmware rootkits removal may require hardware replacement specialized equipment term rootkit root kit originally referred maliciously modified set administrative tools unix-like operating system granted root access intruder could replace standard administrative tools system rootkit intruder could obtain root access system whilst simultaneously concealing activities legitimate system administrator first-generation rootkits trivial detect using tools tripwire compromised access information lane davis steven dake wrote earliest known rootkit 1990 sun microsystems sunos unix operating system lecture gave upon receiving turing award 1983 ken thompson bell labs one creators unix theorized subverting c compiler unix distribution discussed exploit modified compiler would detect attempts compile unix codice_1 command generate altered code would accept user correct password additional backdoor password known attacker additionally compiler would detect attempts compile new version compiler would insert exploits new compiler review source code codice_1 command updated compiler would reveal malicious code exploit equivalent rootkit first documented computer virus target personal computer discovered 1986 used cloaking techniques hide brain virus intercepted attempts read boot sector redirected elsewhere disk copy original boot sector kept time dos-virus cloaking methods became sophisticated advanced techniques including hooking low-level disk int 13h bios interrupt calls hide unauthorized modifications files first malicious rootkit windows nt operating system appeared 1999 trojan called ntrootkit created greg hoglund followed hackerdefender 2003 first rootkit targeting mac os x appeared 2009 stuxnet worm first target programmable logic controllers plc 2005 sony bmg published cds copy protection digital rights management software called extended copy protection created software company first 4 internet software included music player silently installed rootkit limited user ability access cd software engineer mark russinovich created rootkit detection tool rootkitrevealer discovered rootkit one computers ensuing scandal raised public awareness rootkits cloak rootkit hid user file starting sys soon russinovich report malware appeared took advantage vulnerability affected systems one bbc analyst called public relations nightmare sony bmg released patches uninstall rootkit exposed users even serious vulnerability company eventually recalled cds united states class-action lawsuit brought sony bmg greek wiretapping case 2004-05 also referred greek watergate involved illegal telephone tapping 100 mobile phones vodafone greece network belonging mostly members greek government top-ranking civil servants taps began sometime near beginning august 2004 removed march 2005 without discovering identity perpetrators intruders installed rootkit targeting ericsson axe telephone exchange according ieee spectrum first time rootkit observed special-purpose system case ericsson telephone switch rootkit designed patch memory exchange running enable wiretapping disabling audit logs patch commands list active processes active data blocks modify data block checksum verification command backdoor allowed operator sysadmin status deactivate exchange transaction log alarms access commands related surveillance capability rootkit discovered intruders installed faulty update caused sms texts undelivered leading automated failure report generated ericsson engineers called investigate fault discovered hidden data blocks containing list phone numbers monitored along rootkit illicit monitoring software modern rootkits elevate access rather used make another software payload undetectable adding stealth capabilities rootkits classified malware payloads bundled malicious example payload might covertly steal user passwords credit card information computing resources conduct unauthorized activities small number rootkits may considered utility applications users example rootkit might cloak cd-rom-emulation driver allowing video game users defeat anti-piracy measures require insertion original installation media physical optical drive verify software legitimately purchased rootkits payloads many uses instances rootkits provide desired functionality may installed intentionally behalf computer user least five types rootkit ranging lowest level firmware highest privileges least privileged user-based variants operate ring 3 hybrid combinations may occur spanning example user mode kernel mode user-mode rootkits run ring 3 along applications user rather low-level system processes number possible installation vectors intercept modify standard behavior application programming interfaces apis inject dynamically linked library .dll file windows .dylib file mac os x processes thereby able execute inside target process spoof others sufficient privileges simply overwrite memory target application injection mechanisms include kernel-mode rootkits run highest operating system privileges ring 0 adding code replacing portions core operating system including kernel associated device drivers operating systems support kernel-mode device drivers execute privileges operating system many kernel-mode rootkits developed device drivers loadable modules loadable kernel modules linux device drivers microsoft windows class rootkit unrestricted security access difficult write complexity makes bugs common bugs code operating kernel level may seriously impact system stability leading discovery rootkit one first widely known kernel rootkits developed windows nt 4.0 released phrack magazine 1999 greg hoglund kernel rootkits especially difficult detect remove operate security level operating system thus able intercept subvert trusted operating system operations software antivirus software running compromised system equally vulnerable situation part system trusted rootkit modify data structures windows kernel using method known direct kernel object manipulation dkom method used hide processes kernel mode rootkit also hook system service descriptor table ssdt modify gates user mode kernel mode order cloak similarly linux operating system rootkit modify system call table subvert kernel functionality common rootkit creates hidden encrypted filesystem hide malware original copies files infected operating systems evolving counter threat kernel-mode rootkits example 64-bit editions microsoft windows implement mandatory signing kernel-level drivers order make difficult untrusted code execute highest privileges system kernel-mode rootkit variant called bootkit infect startup code like master boot record mbr volume boot record vbr boot sector way used attack full disk encryption systems example attack disk encryption evil maid attack attacker installs bootkit unattended computer envisioned scenario maid sneaking hotel room victims left hardware bootkit replaces legitimate boot loader one control typically malware loader persists transition protected mode kernel loaded thus able subvert kernel example stoned bootkit subverts system using compromised boot loader intercept encryption keys passwords recently alureon rootkit successfully subverted requirement 64-bit kernel-mode driver signing windows 7 modifying master boot record although malware sense something user n't want certain vista loader windows loader software work similar way injecting acpi slic system licensed internal code table ram-cached version bios boot order defeat windows vista windows 7 activation process vector attack rendered useless non-server versions windows 8 use unique machine-specific key system used one machine many antivirus companies provide free utilities programs remove bootkits rootkits created type ii hypervisors academia proofs concept exploiting hardware virtualization features intel vt amd-v type rootkit runs ring -1 hosts target operating system virtual machine thereby enabling rootkit intercept hardware calls made original operating system unlike normal hypervisors load operating system load operating system promoting virtual machine hypervisor rootkit make modifications kernel target subvert however mean detected guest operating system example timing differences may detectable cpu instructions subvirt laboratory rootkit developed jointly microsoft university michigan researchers academic example virtual machine\u2013based rootkit vmbr blue pill software another 2009 researchers microsoft north carolina state university demonstrated hypervisor-layer anti-rootkit called hooksafe provides generic protection kernel-mode rootkits windows 10 introduced new feature called device guard takes advantage virtualization provide independent external protection operating system rootkit-type malware firmware rootkit uses device platform firmware create persistent malware image hardware router network card hard drive system bios rootkit hides firmware firmware usually inspected code integrity john heasman demonstrated viability firmware rootkits acpi firmware routines pci expansion card rom october 2008 criminals tampered european credit card-reading machines installed devices intercepted transmitted credit card details via mobile phone network march 2009 researchers alfredo ortega anibal sacco published details bios-level windows rootkit able survive disk replacement operating system re-installation months later learned laptops sold legitimate rootkit known absolute computrace absolute lojack laptops preinstalled many bios images anti-theft technology system researchers showed turned malicious purposes intel active management technology part intel vpro implements out-of-band management giving administrators remote administration remote management remote control pcs involvement host processor bios even system powered remote administration includes remote power-up power-down remote reset redirected boot console redirection pre-boot access bios settings programmable filtering inbound outbound network traffic agent presence checking out-of-band policy-based alerting access system information hardware asset information persistent event logs information stored dedicated memory hard drive accessible even os pc powered functions require deepest level rootkit second non-removable spy computer built around main computer sandy bridge future chipsets ability remotely kill restore lost stolen pc via 3g hardware rootkits built chipset help recover stolen computers remove data render useless also present privacy security concerns undetectable spying redirection management hackers might gain control rootkits employ variety techniques gain control system type rootkit influences choice attack vector common technique leverages security vulnerabilities achieve surreptitious privilege escalation another approach use trojan horse deceiving computer user trusting rootkit installation program benign\u2014in case social engineering convinces user rootkit beneficial installation task made easier principle least privilege applied since rootkit explicitly request elevated administrator-level privileges classes rootkits installed someone physical access target system rootkits may also installed intentionally owner system somebody authorized owner e.g purpose employee monitoring rendering subversive techniques unnecessary malicious rootkit installations commercially driven pay-per-install ppi compensation method typical distribution installed rootkit takes active measures obscure presence within host system subversion evasion standard operating system security tools application programming interface apis used diagnosis scanning monitoring rootkits achieve modifying behavior core parts operating system loading code processes installation modification drivers kernel modules obfuscation techniques include concealing running processes system-monitoring mechanisms hiding system files configuration data uncommon rootkit disable event logging capacity operating system attempt hide evidence attack rootkits theory subvert operating system activities perfect rootkit thought similar perfect crime one nobody realizes taken place rootkits also take number measures ensure survival detection cleaning antivirus software addition commonly installing ring 0 kernel-mode complete access system include polymorphism changing signature hard detect stealth techniques regeneration disabling turning anti-malware software installing virtual machines may easier researchers discover analyze fundamental problem rootkit detection operating system subverted particularly kernel-level rootkit trusted find unauthorized modifications components actions requesting list running processes list files directory trusted behave expected words rootkit detectors work running infected systems effective rootkits defect camouflage run lower user-mode privileges detection software kernel computer viruses detection elimination rootkits ongoing struggle sides conflict detection take number different approaches including looking virus signatures e.g antivirus software integrity checking e.g digital signatures difference-based detection comparison expected vs. actual results behavioral detection e.g monitoring cpu usage network traffic kernel-mode rootkits detection considerably complex requiring careful scrutiny system call table look hooked functions malware may subverting system behavior well forensic scanning memory patterns indicate hidden processes unix rootkit detection offerings include zeppoo chkrootkit rkhunter ossec windows detection tools include microsoft sysinternals rootkitrevealer avast antivirus sophos anti-rootkit f-secure radix gmer windowsscope rootkit detectors prove effective ultimately contribute ineffectiveness malware authors adapt test code escape detection well-used tools detection examining storage suspect operating system operational miss rootkits recognised checking software rootkit active suspicious behavior suppressed conventional anti-malware software running rootkit operational may fail rootkit hides effectively best reliable method operating-system-level rootkit detection shut computer suspected infection check storage booting alternative trusted medium e.g rescue cd-rom usb flash drive technique effective rootkit actively hide presence running behavioral-based approach detecting rootkits attempts infer presence rootkit looking rootkit-like behavior example profiling system differences timing frequency api calls overall cpu utilization attributed rootkit method complex hampered high incidence false positives defective rootkits sometimes introduce obvious changes system alureon rootkit crashed windows systems security update exposed design flaw code logs packet analyzer firewall intrusion prevention system may present evidence rootkit behaviour networked environment antivirus products rarely catch viruses public tests depending used extent even though security software vendors incorporate rootkit detection products rootkit attempt hide antivirus scan stealth detector may notice rootkit attempts temporarily unload system signature detection fingerprinting still find combined approach forces attackers implement counterattack mechanisms retro routines attempt terminate antivirus programs signature-based detection methods effective well-published rootkits less specially crafted custom-root rootkits another method detect rootkits compares trusted raw data tainted content returned api example binaries present disk compared copies within operating memory operating systems in-memory image identical on-disk image results returned file system windows registry apis checked raw structures underlying physical disks\u2014however case former valid differences introduced operating system mechanisms like memory relocation shimming rootkit may detect presence difference-based scanner virtual machine latter commonly used perform forensic analysis adjust behaviour differences detected difference-based detection used russinovich rootkitrevealer tool find sony drm rootkit code signing uses public-key infrastructure check file modified since digitally signed publisher alternatively system owner administrator use cryptographic hash function compute fingerprint installation time help detect subsequent unauthorized changes on-disk code libraries however unsophisticated schemes check whether code modified since installation time subversion prior time detectable fingerprint must re-established time changes made system example installing security updates service pack hash function creates message digest relatively short code calculated bit file using algorithm creates large changes message digest even smaller changes original file recalculating comparing message digest installed files regular intervals trusted list message digests changes system detected monitored\u2014as long original baseline created malware added more-sophisticated rootkits able subvert verification process presenting unmodified copy file inspection making code modifications memory reconfiguration registers later compared white list expected values code performs hash compare extend operations must also protected\u2014in context notion immutable root-of-trust holds first code measure security properties system must trusted ensure rootkit bootkit compromise system fundamental level forcing complete dump virtual memory capture active rootkit kernel dump case kernel-mode rootkit allowing offline forensic analysis performed debugger resulting dump file without rootkit able take measures cloak technique highly specialized may require access non-public source code debugging symbols memory dumps initiated operating system always used detect hypervisor-based rootkit able intercept subvert lowest-level attempts read memory\u2014a hardware device one implements non-maskable interrupt may required dump memory scenario virtual machines also make easier analyze memory compromised machine underlying hypervisor rootkits avoid infecting virtual machines reason manual removal rootkit often difficult typical computer user number security-software vendors offer tools automatically detect remove rootkits typically part antivirus suite microsoft monthly windows malicious software removal tool able detect remove classes rootkits also windows defender offline remove rootkits runs trusted environment operating system starts antivirus scanners bypass file system apis vulnerable manipulation rootkit instead access raw file system structures directly use information validate results system apis identify differences may caused rootkit experts believe reliable way remove re-install operating system trusted media antivirus malware removal tools running untrusted system may ineffective well-written kernel-mode rootkits booting alternative operating system trusted media allow infected system volume mounted potentially safely cleaned critical data copied off\u2014or alternatively forensic examination performed lightweight operating systems windows pe windows recovery console windows recovery environment bartpe live distros used purpose allowing system cleaned even type nature rootkit known manual repair may impractical re-installing operating system applications safer simpler quicker like much malware used attackers many rootkit implementations shared easily available internet uncommon see compromised system sophisticated publicly available rootkit hides presence unsophisticated worms attack tools apparently written inexperienced programmers rootkits available internet originated exploits academic proofs concept demonstrate varying methods hiding things within computer system taking unauthorized control often fully optimized stealth rootkits sometimes leave unintended evidence presence even rootkits used attack often effective rootkits keylogging features gameguard installed part online commercial games system hardening represents one first layers defence rootkit prevent able install applying security patches implementing principle least privilege reducing attack surface installing antivirus software standard security best practices effective classes malware new secure boot specifications like unified extensible firmware interface designed address threat bootkits even vulnerable security features offer utilized server systems remote server attestation using technologies intel trusted execution technology txt provide way verifying servers remain known good state example microsoft bitlocker encryption data-at-rest verifies servers known good state bootup privatecore vcage software offering secures data-in-use memory avoid bootkits rootkits verifying servers known good state bootup privatecore implementation works concert intel txt locks server system interfaces avoid potential bootkits rootkits", + "neighbors": [ + 11, + 120, + 134, + 144, + 149, + 171, + 185, + 190, + 198, + 234, + 270, + 272, + 293, + 310, + 338, + 343, + 363, + 364, + 379, + 413, + 439, + 450, + 479, + 487, + 518, + 528, + 531, + 564, + 576, + 624, + 692, + 698, + 703, + 708, + 739, + 740, + 746, + 750, + 762, + 800, + 818, + 898, + 910, + 961, + 1039, + 1090, + 1112, + 1138, + 1162, + 1287, + 1291, + 1303, + 1309, + 1325, + 1337, + 1350, + 1355, + 1358, + 1361, + 1368, + 1370, + 1406, + 1444, + 1472, + 1514, + 1535, + 1542, + 1543, + 1554, + 1585, + 1616, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 1380, + "label": 7, + "text": "Cvent:cvent cvent inc. privately held software-as-a-service saas company specializes market-leading meetings events hospitality management technology company offers web-based software meeting site selection online event registration event management email marketing web surveys company owned private equity firm vista equity partners cvent founded september 1999 reggie aggarwal year received 17 million venture capital grew staff 125 employees following dot-com bubble burst september 11 attacks cvent faced near-bankruptcy forced cut 80 staff company became profitable 2003 2011 cvent growing 50 year received 136 million funding new enterprise associates july 2011 time largest investment u.s. software company since 2007 june 13 2012 cvent announced acquisition austin-based startup crowdtorch previously known seed labs 4.2 million seven days later announced acquisition portland-based application developer crowdcompass 10 million cvent filed s-1 u.s. securities exchange commission july 8 2013 proposing initial public offering 5.6 million shares went public new york stock exchange august 9 2013 initial price 21 company raised 117.6 million received market capitalization billion dollars ipo referenced regards use jobs act enabled company quickly offer ipo 2016 company acquired venture capital company vista equity partners usd 1.65 billion ashok trivedi co-founder mastech digital igate early investor company june 5 2018 cvent announced acquired kapow online booking platform venues experiences june 10 2019 cvent announced acquired mobile event technology provider doubledutch july 2000 cvent introduced first saas product web-based tool event planners manage invitations collect registration fees 2006 introduced product conducting online surveys followed introduction cvent supplier network two years later supplier network free online marketing place connects meeting planners venues services 2009 company began offering professional services app development tool crowdtorch launched 2009 cvent also produces destination guide free online 8,000-page travel guide designed meeting planners information 800 different destinations strategic meetings management helps users manage budgets", + "neighbors": [ + 471 + ], + "mask": "Test" + }, + { + "node_id": 1381, + "label": 6, + "text": "OpenAFS:openafs openafs open-source implementation andrew distributed file system afs afs originally developed carnegie mellon university developed commercial product transarc corporation subsequently acquired ibm linuxworld 15 august 2000 ibm announced plans release version commercial afs product ibm public license became openafs today openafs actively developed wide range operating system families including aix mac os x darwin hp-ux irix solaris linux microsoft windows freebsd netbsd openbsd openafs foundation established may 20 2013 non-profit organization dedicated fostering stability growth openafs governance project split board elders consider issues strategic direction gatekeepers control source repository although legal entity owns openafs source code copyright many files attributed ibm source covered ipl however several files tree covered university vanity licenses applicable licenses listed file source repository called openafs/doc/license contributors last five years made significant improvements implementation afs3 protocol without breaking interoperability ibm/transarc releases since announcement written several large development projects integrated 64-bit ms-windows support ms-windows 7 support apple-mac os x v10.4-v10.9 support demand attach fileserver many development projects various stages completion following several prominent examples existing user base includes small single server cells well large multinational deployments spanning academia private research laboratories government commercial entities small snapshot deployed afs cells found reviewing contents cellservdb file distributed openafs", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 195, + 222, + 233, + 278, + 295, + 306, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 796, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 961, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1445, + 1459, + 1565, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1382, + "label": 6, + "text": "Disc_spanning:disc spanning disc spanning feature cd dvd burning software automatically spreads large amount data across many data discs data set size exceeds storage capacity individual blank disc advantage user need split files directories two blank disc sized pieces hand software may may support slicing single large file order span disc spanners divide numerous files smaller one blank disc capacity across many discs disc spanning works well cd media many applications spanning dvd media fails often lack reliable dvd data disc spanning odd disc spanning used extensively older 3.5 5.25 floppy discs users assume every operating system perform disc spanning media built function incorrect disc spanning schemes include small program reassemble data set structure source machine program could written first disc every disc set use disc spanning cases make files unreadable file-system therefore bounded use program later restore data many users n't want bound solutions use simple disc spanning instead simple disc spanning solution groups files media grouped based size one drawback system files bigger target media burnt drive simple powerful simple calculation would many cd/dvd/bd/hd dvds bunch files need simple grouping displayed like disc1 -- 99 4,479mib br directory br -- dir1 br -- file1 br br disc2 -- 98 4,468mib br directory br -- dir2 br -- file2 br br disc3 -- 45 2,130mib br -- dir3 br etc ... br", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1383, + "label": 4, + "text": "James_Hall_III:james hall iii james w. hall iii born 1958 former united states army warrant officer signals intelligence analyst germany sold eavesdropping code secrets east germany soviet union 1983 1988 hall convicted espionage july 20 1989 fined 50,000 given dishonorable discharge serving 40-year sentence activities united states disciplinary barracks fort leavenworth kansas released september 2011 hall assigned nsa field station berlin teufelsberg one premier listening posts cold war 1982 1985 spied east germany soviet union 1983 1988 hall betrayed hundreds military secrets includes project trojan worldwide electronic network ability pinpoint armored vehicles missiles aircraft recording signal emissions wartime complete national sigint requirements list nsrl 4258-page document nsa activities government requirements sigint capabilities country hall sometimes spent two hours workday reproducing classified documents provide soviets east germans concerned putting regular duty time consistently worked late complete regular assignments used shopping bags smuggle originals documents photocopied frankfurt flat help east berlin associate using illegal income hall paid cash brand new volvo new truck also made large payment home took flying lessons said given military colleagues least six conflicting stories explain lavish life style 1986 hall stationed fort monmouth new jersey returning germany passed promotion sergeant first class year hall also applying appointment warrant officer part routine background investigation associated warrant appointment one supervisors major hall time staff sergeant commented investigator found strange hall could drive car volvo major could n't afford major went explain asked hall apparent disparity hall responded wealthy aunt died left large trust received 30,000 annually major found story plausible reiterated investigators visit investigators thanked major information told already knew trust hall co-workers fully taken duplicity unusual activities never drew much attention returning germany us traveled vienna austria meet soviet handler co-workers wondered would re-enlist become warrant officer several times conveying dissatisfaction army life course warrant officer rank allowed greater access classified material 1977\u20131981 tour detachment schneeberg intelligence gathering outpost vii corps 326th asa army security agency company west german-czechoslovakian border cold war hall generally good working relationship peers considered peers average analyst would sometimes erupt become upset trivial day-to-day problems however part considered sociable colleague also quickly picked working knowledge german language james also met future wife worked local restaurant bischofsgruen popular tourist town majority detachment soldiers lived hall eventually arrested december 21 1988 savannah georgia bragging undercover fbi agent period six years sold top secret intelligence data east germany soviet union time hall believed speaking soviet contact conversation claimed motivated money told fbi agent posing soviet intelligence officer n't terribly short money decided n't ever want worry next dollar coming 'm anti-american wave flag much anybody else case hall apparently began based tip manfred severin code-named canna clay stasi instructor acted translator courier james hall rejected german staatschutz cia army foreign counterintelligence fca eventually sponsored big tip james hall james hall apprehended severin exfiltrated west family arrest hall said many indicators visible around involved questionable activity hall activities inflicted grave damage u.s. signals intelligence considered perpetrator one costly damaging breaches security long cold war hall confessed giving handlers information us military liaison mission usmlm tank photography new year eve 1984 march 24 1985 inspection tour soviet military facilities ludwigslust german democratic republic us army major arthur d. nicholson jr. unarmed member usmlm shot death soviet sentry jailhouse interview first ever author kristie macrakis designated treasonous bastard cold war spy fbi also arrested h\u00fcseyin y\u0131ld\u0131r\u0131m turk served conduit hall east german intelligence officers hall received 100,000 payments reunification germany july 24 1992 almost documents hall copied handed stasi 13,088 pages total given back nsa federal commissioner stasi records joachim gauck later president germany ordered federal ministry interior us government pressure without consulting informing german parliamentary intelligence oversight committee prerequisite giving files away required law hundred pages retained kept top secret gauck well director agency hansj\u00f6rg geiger later claimed remember ordered return documents agents place us government military worked mole either kgb russian foreign intelligence service svr include", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1384, + "label": 3, + "text": "Qualcomm:qualcomm qualcomm incorporated american multinational semiconductor telecommunications equipment company designs markets wireless telecommunications products services derives revenue chipmaking bulk profit patent licensing businesses company headquarter located san diego california united states 224 worldwide locations parent company qualcomm incorporated qualcomm number wholly owned subsidiaries qualcomm cdma technologies qct sells qualcomm \u2019 products services including chipsets qualcomm technology licensing qtl responsible patent licensing business qualcomm technologies inc. qti operates nearly qualcomm r activities qualcomm created july 1 1985 seven former linkabit employees led dr. irwin jacobs company named qualcomm \u201c quality communications. \u201d started contract research development center largely government defense projects qualcomm merged omninet 1988 raised 3.5 million funding order produce omnitracs satellite communications system trucking companies qualcomm grew eight employees 1986 620 employees 1991 due demand omnitracs 1989 qualcomm 32 million revenues 50 percent omnitracs contract schneider national omnitracs profits helped fund qualcomm research development code-division multiple access cdma technologies cell phone networks qualcomm operating loss 1990s due investment cdma research obtain funding company filed initial public offering september 1991 raising 68 million additional 486 million raised 1995 sale 11.5 million shares second funding round done raise money mass manufacturing cdma-based phones base-stations equipment us-based cellular networks announced would adopt cdma standard company 383 million annual revenue 1995 814 million 1996 1991 qualcomm acquired eudora email client software pc could used omnitracs system acquisition associated widely used email client company little-known time 1998 qualcomm restructured leading 700-employee layoff cell-phone manufacturing business also spun-off order focus higher-margin patents business following year qualcomm fastest growing stock market 2,621 percent growth one year 2000 qualcomm grown 6,300 employees 3.2 billion revenues 670 million profit 39 percent sales cdma technology followed licensing 22 wireless 22 products 17 around time qualcomm established offices europe asia pacific latin america 2001 65 percent qualcomm revenues originated outside united states 35 percent coming south korea 2005 paul e. jacobs son qualcomm founder dr. irwin jacobs appointed qualcomm new ceo whereas irwin jacobs focused cdma patents paul jacobs refocused much qualcomm new research development projects related internet things qualcomm announced steven mollenkopf would succeed paul jacobs ceo december 2013 mollenkopf said would expand qualcomm focus wireless technology cars wearable devices new markets european commission fined qualcomm \u20ac997 million abuse dominant market position january 24 2018 march 16 2018 qualcomm removed executive chairman paul jacobs broached long-shot bid buyout earlier week 2018 qualcomm filed lawsuit intel several meet-and-confers exchanges written correspondence may 18 intel appeared willing cooperate offering 'limited supplemental production technical materials relating relevant components designed 2018 iphone models exchange qualcomm agreement limited production would satisfy certain requests document subpoena us federal court filing states court us march 15 2019 ruled apple must indemnify qualcomm infringing three patents related mobile technologies jury ruled apple pay 31 million chip maker 1.41 per iphone used company \u2019 technology without authorization fiscal year 2018 qualcomm reported loss us 4.86 billion annual revenue us 22.7 billion increase 2 previous fiscal cycle qualcomm shares traded 51 75 per share market capitalization end fiscal 2018 valued us 105 billion company ranked 133rd fortune 500 list largest united states corporations revenue qualcomm pioneered commercialization cdmaone is-95 standard wireless cellular communications following cdma2000 early standard third-generation 3g mobile today company leading patent holder advanced 3g mobile technologies including cdma2000 1xev-do evolutions wcdma higher-speed variant known hspa evolutions td-scdma well patents 4g license streams patents inventions related products major component qualcomm business june 2011 qualcomm announced would release set application programming interfaces geared give web-based applications deeper links hardware beginning 1991 qualcomm participated development globalstar satellite system along loral space communications uses low earth orbit leo satellite constellation consisting 44 active satellites system used voice telephony via hand-held satellite phones asset tracking data transfer using mobile satellite modems system designed normal is-95 system used satellite bent pipe repeater transfer cellular signals handset terrestrial base station unlike iridium system routes phone calls satellites globalstar satellite must always able see handset base station establish connection therefore coverage earth poles satellite orbits also coverage locations large globalstar base stations view locations south atlantic example globalstar hardware manufactured qualcomm like satellite phone networks globalstar went bankrupt 1999 bought group investors currently running system january 2017 apple announced 1 billion lawsuit qualcomm overcharging chips failing pay 1 billion rebates qualcomm however rejected accusations calling claims baseless week apple lawsuit qualcomm shares dropped federal trade commission accused company demanding excessive royalties technologies essential industry standards qualcomm sued group shareholders wake aforementioned ftc ruling apple lawsuit january 4 2019 ftc trial began judge lucy koh united states district court northern district california january 24 2018 european commission announced \u20ac997 million fine 1.2 billion 4.9 2017 turnover qualcomm violating antitrust laws means deals apple january 14 2019 apple coo jeff williams said apple wanted use qualcomm modems iphone xs xr qualcomm refused sell apple sued licensing practices leading apple using intel modems instead april 16 2019 opening arguments begun suit two companies settled apple pay unspecified amount enter six-year patent licensing agreement multi-year agreement qualcomm provide hardware company intel concurrently announced would longer develop 5g modems mobile devices later announced july 2019 would sell majority smartphone modem business apple 1 billion april 2006 dispute reliance communications qualcomm royalty fees cost qualcomm approximately 11.7b market capitalization july 2007 reliance qualcomm decided settle matter agreed expand use cdma technology india june 2007 u.s. international trade commission blocked import new cell phone models based particular qualcomm microchips found qualcomm microchips infringe patents owned broadcom broadcom also initiated patent litigation u.s. courts issue issue software designed extend battery life chips users make out-of-network calls october itc administrative judge made initial ruling qualcomm violated broadcom patent covering feature commission later affirmed decision sprint nextel corp. using software patch qualcomm get around u.s. government agency ban new phones qualcomm chips august 2007 judge rudi brewster held qualcomm engaged litigation misconduct withholding relevant documents lawsuit brought broadcom qualcomm employees lied involvement july 2009 south korea antitrust watchdog fined qualcomm record won260bn 207m unfair business practices related chipset sales sparking strong protests company fair trade commission accused qualcomm abusing dominant position korean market cdma mobile phone chips charging higher royalties handset makers bought modem chips competitors offering rebates customers bought products mainly us group regulator said statement 2009 qualcomm broadcom entered settlement multi-year patent agreement ending litigation companies 2012 federal probe launched company \u2019 compliance foreign corrupt practices act bars companies well individuals bribing foreign officials gain business 2014 china anti-monopoly regulator announced qualcomm suspected overcharging abusing market position february 2015 china moved fine qualcomm record 975 million tactics government claimed hurt consumers july 16 2015 european commission announced opened two antitrust investigations qualcomm behavior field baseband chipsets consumer devices july 2016 group women filed class-action gender discrimination lawsuit qualcomm alleging firm discriminated women science technology engineering mathematics areas class 3,400 employees suit settled august 2017 firm agreed pay 19.5 million plaintiff law firm said company also institute significant changes policies practices help eliminate gender disparities foster equal employment opportunity going forward march 2017 south korea found qualcomm prevented samsung selling chips phone makers current umts air interfaces part based qualcomm patents royalties patents represent significant part qualcomm revenue followed series patent-related lawsuits antitrust complaints spearheaded broadcom us 2006 broadcom started series patent-related lawsuits antitrust complaints qualcomm get broadcom regarded fair terms access w-cdma technologies broadcom soon joined nokia others complaints also filed european commission 2007 european commission launched inquiry qualcomm possible abusing dominant position market third-generation phones complaints first lodged 2005 leading handset manufacturers ericsson nokia nec panasonic texas instruments october 2008 nokia announced make one-time payment 2.29 billion us qualcomm part patent agreement company chinese tdscdma 3g technology developed primarily avoid qualcomm licensing fees although qualcomm claims chinese technology still infringes many qualcomm patents qchat push-to-talk ptt technology qchat software application developed qualcomm internet services qis division qualcomm part qualcomm wireless internet group qis offers set software products content enablement services support accelerate growth wireless data market qualcomm developed qchat provide reliable method instant connection two-way communication users different locations operating within type network architecture prior existence cellular personal communications services networks type communication limited private land mobile radio system lmr technology used public safety utility service agencies lmr limitations specifically usage restricted geographic coverage area use disparate frequency bands qchat application developed brew platform ptt communication technology 3g networks qchat handsets server software allow users connect instantaneously qchat users anywhere world push button addition qchat enables one-to-one private one-to-many group calls 3g networks qchat uses standard voice internet protocol voip technologies voip voice delivery mechanism uses internet protocol manage delivery voice information voice information sent digital form ip-based data networks including cdma discrete packets rather traditional circuit-switched protocols used public switched telephone network pstn qchat users 3g wireless devices connect worldwide either private group calls push button qchat uses voice internet protocol voip technologies allow subscribers communicate using ptt button handset instead making standard cellular call qchat calls created combining separate point-to-point connections ip endpoint process managed qchat applications server deployed carrier ip-based wide area network wan initiate call user presses ptt button receives immediate indication whether call recipient available caller begin speaking immediately recipient unavailable caller simply hear negative response tone instead busy signal voicemail october 16 2006 sprint nextel announced agreement qualcomm use qchat provide high performance push-to-talk services customers nationwide sprint pcs network using cdma2000 1xev-do revision technology qchat able inter-operate iden push-to-talk handsets nextel national network sprint phones supporting qchat technology released starting april 2008 trial business customers kansas colorado sprint announced nextel direct connect devices powered qchat available 40 markets june 2008 ending production new qchat devices november 2009 supported models included august 2016 computer security company check point found several serious security problems qualcomm chips bug called quadrooter ability let hackers read information android phones even worse hackers full access affected user installs app exploits one vulnerabilities according check point affects 900 million android users affected phones include recent android phones check point published scan tool android users blackberry developing repair tool qualcomm released fixes four issues three included android updates top google phones time publication bug", + "neighbors": [ + 24, + 112, + 162, + 211, + 269, + 511, + 647, + 853, + 917, + 956, + 965, + 972, + 1069, + 1176, + 1196, + 1239, + 1266, + 1310, + 1351, + 1421, + 1483, + 1503, + 1558, + 1602, + 1604 + ], + "mask": "Validation" + }, + { + "node_id": 1385, + "label": 9, + "text": "GNU_Common_Lisp:gnu common lisp gnu common lisp gcl gnu project ansi common lisp compiler evolutionary development kyoto common lisp produces native object code first generating c code calling c compiler gcl implementation choice several large projects including mathematical tools maxima axiom hol88 acl2 gcl runs eleven different architectures linux freebsd solaris mac os x microsoft windows gcl remains active development stable releases 2014-10-28 prerelease development followed using git revision control system", + "neighbors": [ + 27, + 46, + 134, + 194, + 203, + 209, + 251, + 292, + 301, + 306, + 308, + 313, + 323, + 332, + 360, + 392, + 446, + 447, + 506, + 536, + 565, + 601, + 649, + 653, + 753, + 787, + 806, + 825, + 916, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 1021, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1190, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1372, + 1375, + 1389, + 1413, + 1430, + 1466, + 1509, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 1386, + "label": 4, + "text": "Tunneling_protocol:tunneling protocol computer networks tunneling protocol communications protocol allows movement data one network another involves allowing private network communications sent across public network internet process called encapsulation tunneling involves repackaging traffic data different form perhaps encryption standard hide nature traffic run tunnel tunneling protocol works using data portion packet payload carry packets actually provide service tunneling uses layered protocol model osi tcp/ip protocol suite usually violates layering using payload carry service normally provided network typically delivery protocol operates equal higher level layered model payload protocol tunneling protocol may example allow foreign protocol run network support particular protocol running ipv6 ipv4 another important use provide services impractical unsafe offered using underlying network services providing corporate network address remote user whose physical network address part corporate network users also use tunneling sneak firewall using protocol firewall would normally block wrapped inside protocol firewall block http firewall policy specifically exclude kind wrapping trick function get around intended firewall policy set interlocked firewall policies another http-based tunneling method uses http connect method/command client issues http connect command http proxy proxy makes tcp connection particular server port relays data server port client connection creates security hole connect-capable http proxies commonly restrict access connect method proxy allows connections specific ports 443 https example network layer network layer generic routing encapsulation gre protocol running ip ip protocol number 47 often serves carry ip packets rfc 1918 private addresses internet using delivery packets public ip addresses case delivery payload protocols payload addresses incompatible delivery network also possible establish connection using data link layer layer 2 tunneling protocol l2tp allows transmission frames two nodes tunnel encrypted default relies tcp/ip protocol chosen determine level security ssh uses port 22 enable data encryption payloads transmitted public network internet connection thereby providing vpn functionality ipsec end-to-end transport mode also operate tunneling mode trusted security gateway understand particular protocol stack imposed tunneling network engineers must understand payload delivery protocol sets secure shell ssh tunnel consists encrypted tunnel created ssh protocol connection users may set ssh tunnels transfer unencrypted traffic network encrypted channel example microsoft windows machines share files using server message block smb protocol non-encrypted protocol one mount microsoft windows file-system remotely internet someone snooping connection could see transferred files mount windows file-system securely one establish ssh tunnel routes smb traffic remote fileserver encrypted channel even though smb protocol contains encryption encrypted ssh channel travels offers security ssh connection established tunnel starts ssh listening port remote local host connections forwarded specified address port originating opposing remote local previously host tunneling tcp- encapsulating payload ppp tcp-based connection ssh port forwarding known tcp-over-tcp induce dramatic loss transmission performance problem known tcp meltdown virtual private network software may instead use protocol simpler tcp tunnel connection however often problem using openssh port forwarding many use cases entail tcp-over-tcp tunneling meltdown avoided openssh client processes local client-side tcp connection order get actual payload sent sends payload directly tunnel tcp connection server side openssh server similarly unwraps payload order wrap routing final destination naturally wrapping unwrapping also occurs reverse direction bidirectional tunnel ssh tunnels provide means bypass firewalls prohibit certain internet services long site allows outgoing connections example organization may prohibit user accessing internet web pages port 80 directly without passing organization proxy filter provides organization means monitoring controlling user sees web users may wish web traffic monitored blocked organization proxy filter users connect external ssh server create ssh tunnel forward given port local machine port 80 remote web server access remote web server users would point browser local port nowiki http //localhost/ /nowiki ssh clients support dynamic port forwarding allows user create socks 4/5 proxy case users configure applications use local socks proxy server gives flexibility creating ssh tunnel single port previously described socks free user limitations connecting predefined remote port server application n't support socks proxifier used redirect application local socks proxy server proxifiers proxycap support ssh directly thus avoiding need ssh client recent versions openssh even allowed create layer 2 layer 3 tunnels ends enabled tunneling capabilities creates codice_1 layer 3 default codice_2 layer 2 virtual interfaces ends connection allows normal network management routing used used routers traffic entire subnetwork tunneled pair codice_2 virtual interfaces function like ethernet cable connecting ends connection join kernel bridges", + "neighbors": [ + 52, + 109, + 213, + 311, + 333, + 425, + 430, + 444, + 455, + 470, + 500, + 505, + 528, + 542, + 543, + 631, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 813, + 1112, + 1114, + 1116, + 1206, + 1218, + 1238, + 1326, + 1329, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1387, + "label": 5, + "text": "Phase-fired_controller:phase-fired controller phase-fired control pfc also called phase cutting phase angle control method power limiting applied ac voltages works modulating thyristor scr triac thyratron gated diode-like devices conduction predetermined phase applied waveform phase-fired control pfc often used control amount voltage current power power supply feeds load create average value output supply dc output time base importance deciding pulse supply value pulsed continuous pfc differs pulse-width modulation pwm addresses supplies output modulated waveform sinusoidal ac waveform national grid outputs becomes important supply pulse correct position modulation cycle known value achieved example controller could turn peak waveform base cycle time base taken consideration phase-fired controllers take name fact trigger pulse output certain phase input modulation cycle essence pfc controller synchronise modulation present input phase-fired controllers use thyristors solid state switching devices control elements thyristor-based controllers may utilise gate turn-off gto thyristors allowing controller decide switch output turn rather wait waveform return zero phase-fired controller like buck topology switched-mode power supply able deliver output maximum equal present input minus losses occurring control elements provided modulation cycle predictable repetitive national grid ac mains obtain output lower input phase-fired control simply switches given phase angle input modulation cycle triggering device conduction phase angle greater 0 degrees point modulation cycle starts fraction total energy within cycle present output achieve boost -like effect pfc designs must derated maximum present input higher nominal output requirements supply first turned operating nominal conditions controller continually delivering less 100 input boost required controller delivers percentage closer 100 maximum input available derating mains powered phase-fired controllers important often used control resistive loads heating elements time resistance heating elements increase account phase-fired control must able provide degree extra voltage draw heating current element way achieving purposely design supply require less 100 input modulation cycle elements first put place progressively opening supply towards delivering 100 input modulation cycle elements age common application dimmer switches domestic lighting control industrial applications previously extremely expensive heavy multi-tapped transformers used supplies elements corresponding winding tap connected element produce desired temperature limited temperature resolution number tap combinations available often find way controllers designed equipment electric ovens furnaces modern usually high power equipment transformer replaced phase-fired controllers connecting load directly mains resulting substantially cheaper lighter system however method usually limited use equipment would unrealistic without removal mains transformer means load electrical continuity input industrial ovens furnaces input often national grid ac electrically referenced ground controller output referenced ground user need contact earth one output terminals risk receiving electrical shock many high-power items equipment running three-phase 415 v high current inputs enclosure framework present earthed grounded serious risk must carefully assessed first patent phase-fired controllers derives 1912 however realization first possible 1920s mercury-arc valve rectifiers control grids became available however method voltage regulation common time limitations mercury arc valves became widespread invention solid-state thyristors end 1950s burst-fired controllers", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1388, + "label": 9, + "text": "Syntax_(programming_languages):syntax programming languages computer science syntax computer language set rules defines combinations symbols considered correctly structured document fragment language applies programming languages document represents source code markup languages document represents data syntax language defines surface form text-based computer languages based sequences characters visual programming languages based spatial layout connections symbols may textual graphical documents syntactically invalid said syntax error.when designing syntax language designer starts writing examples legal illegal strings trying figure general rules examples syntax therefore refers form contrasted semantics \u2013 meaning processing computer languages semantic processing generally comes syntactic processing however cases semantic processing necessary complete syntactic analysis done together concurrently compiler syntactic analysis comprises frontend semantic analysis comprises backend middle end phase distinguished computer language syntax generally distinguished three levels distinguishing way yields modularity allowing level described processed separately often independently first lexer turns linear sequence characters linear sequence tokens known lexical analysis lexing second parser turns linear sequence tokens hierarchical syntax tree known parsing narrowly speaking thirdly contextual analysis resolves names checks types modularity sometimes possible many real-world languages earlier step depends later step \u2013 example lexer hack c tokenization depends context even cases syntactical analysis often seen approximating ideal model parsing stage divided two parts parse tree concrete syntax tree determined grammar generally far detailed practical use abstract syntax tree ast simplifies usable form ast contextual analysis steps considered form semantic analysis adding meaning interpretation syntax alternatively informal manual implementations syntactical rules would difficult awkward describe implement formally levels generally correspond levels chomsky hierarchy words regular language specified lexical grammar type-3 grammar generally given regular expressions phrases context-free language cfl generally deterministic context-free language dcfl specified phrase structure grammar type-2 grammar generally given production rules backus\u2013naur form bnf phrase grammars often specified much constrained grammars full context-free grammars order make easier parse lr parser parse dcfl linear time simple lalr parser even simpler parser efficient parse grammars whose production rules constrained principle contextual structure described context-sensitive grammar automatically analyzed means attribute grammars though general step done manually via name resolution rules type checking implemented via symbol table stores names types scope tools written automatically generate lexer lexical specification written regular expressions parser phrase grammar written bnf allows one use declarative programming rather need procedural functional programming notable example lex-yacc pair automatically produce concrete syntax tree parser writer must manually write code describing converted abstract syntax tree contextual analysis also generally implemented manually despite existence automatic tools parsing often implemented manually various reasons \u2013 perhaps phrase structure context-free alternative implementation improves performance error-reporting allows grammar changed easily parsers often written functional languages haskell scripting languages python perl c c++ example codice_1 syntactically valid lisp program assuming 'add function exists else name resolution fails adding 1 1 however following invalid note lexer unable identify first error \u2013 knows producing token left_paren remainder program invalid since word rule begins second error detected parsing stage parser identified list production rule due token match thus give error message general may ambiguous type errors undeclared variable errors sometimes considered syntax errors detected compile-time usually case compiling strongly-typed languages though common classify kinds error semantic errors instead example python code contains type error adds string literal integer literal type errors kind detected compile-time detected parsing phrase analysis compiler uses separate rules allow integerliteral integerliteral stringliteral integerliteral though likely compiler use parsing rule allows expressions form literaloridentifier literaloridentifier error detected contextual analysis type checking occurs cases validation done compiler errors detected runtime dynamically typed language type determined runtime many type errors detected runtime example python code syntactically valid phrase level correctness types b determined runtime variables types python values whereas disagreement whether type error detected compiler called syntax error rather static semantic error type errors detected program execution time always regarded semantic rather syntax errors syntax textual programming languages usually defined using combination regular expressions lexical structure backus\u2013naur form grammatical structure inductively specify syntactic categories nonterminals terminal symbols syntactic categories defined rules called productions specify values belong particular syntactic category terminal symbols concrete characters strings characters example keywords define let void syntactically valid programs constructed language different equivalent grammars equivalent regular expressions lexical levels different phrase rules generate language using broader category grammars lr grammars allow shorter simpler grammars compared restricted categories grammar may require longer grammars rules different equivalent phrase grammars yield different parse trees though underlying language set valid documents simple grammar defined using notation regular expressions extended backus\u2013naur form describes syntax s-expressions data syntax programming language lisp defines productions syntactic categories expression atom number symbol list grammar specifies following decimal digits upper- lower-case characters parentheses terminal symbols following examples well-formed token sequences grammar 'codice_2 'codice_3 'codice_4' grammar needed specify programming language classified position chomsky hierarchy phrase grammar programming languages specified using type-2 grammar i.e. context-free grammars though overall syntax context-sensitive due variable declarations nested scopes hence type-1 however exceptions languages phrase grammar type-0 turing-complete languages like perl lisp specification implementation language allows constructs execute parsing phase furthermore languages constructs allow programmer alter behavior parser combination effectively blurs distinction parsing execution makes syntax analysis undecidable problem languages meaning parsing phase may finish example perl possible execute code parsing using codice_5 statement perl function prototypes may alter syntactic interpretation possibly even syntactic validity remaining code colloquially referred perl parse perl code must executed parsing modify grammar strongly even perl parse perl undecidable similarly lisp macros introduced codice_6 syntax also execute parsing meaning lisp compiler must entire lisp run-time system present contrast c macros merely string replacements require code execution syntax language describes form valid program provide information meaning program results executing program meaning given combination symbols handled semantics either formal hard-coded reference implementation syntactically correct programs semantically correct many syntactically correct programs nonetheless ill-formed per language rules may depending language specification soundness implementation result error translation execution cases programs may exhibit undefined behavior even program well-defined within language may still meaning intended person wrote using natural language example may possible assign meaning grammatically correct sentence sentence may false following c language fragment syntactically correct performs operation semantically defined p null pointer operations p- real p- im meaning simpler example syntactically valid semantically defined uses uninitialized variable even though compilers programming languages e.g. java c would detect uninitialized variable errors kind regarded semantic errors rather syntax errors quickly compare syntax various programming languages take look list hello world program examples", + "neighbors": [ + 29, + 65, + 78, + 152, + 170, + 176, + 216, + 292, + 306, + 509, + 567, + 579, + 649, + 682, + 790, + 799, + 810, + 825, + 926, + 1059, + 1120, + 1225, + 1227, + 1315, + 1457 + ], + "mask": "Train" + }, + { + "node_id": 1389, + "label": 9, + "text": "Common_Lisp_Object_System:common lisp object system common lisp object system clos facility object-oriented programming part ansi common lisp clos powerful dynamic object system differs radically oop facilities found static languages c++ java clos inspired earlier lisp object systems mit flavors commonloops although general either originally proposed add-on clos adopted part ansi standard common lisp adapted lisp dialects eulisp emacs lisp basic building blocks clos classes methods instances classes generic functions clos provides macros define codice_1 codice_2 codice_3 instances created function codice_4 classes multiple superclasses list slots member variables c++/java parlance special metaclass slots allocated class instances class share slot instance slot name value slot accessed name using function codice_5 additionally special generic functions defined write read values slots slot clos class must unique name clos multiple dispatch system means methods specialized upon required arguments oo languages single-dispatch meaning methods specialized first argument another unusual feature methods belong classes classes provide namespace generic functions methods methods defined separately classes special access e.g self protected class slots methods clos grouped generic functions generic function object callable like function associates collection methods shared name argument structure specialized different arguments since common lisp provides non-clos classes structures built-in data types numbers strings characters symbols ... clos dispatch works also non-clos classes clos also supports dispatch individual objects eql specializers clos default support dispatch common lisp data types example dispatch work fully specialized array types types introduced codice_6 however common lisp implementations provide metaobject protocol allows generic functions provide application specific specialization dispatch rules dispatch clos also different oo languages dispatch mechanism works runtime adding removing methods thus may lead changed effective methods even generic function called arguments runtime changing method combination also may lead different effective methods example like oo systems dynamic languages clos enforce encapsulation slot accessed using codice_5 function via optionally auto-generated accessor methods access via codice_5 know name slot cl programmers use language package facility declare functions data structures intended export apart normal primary methods also codice_9 codice_10 codice_11 auxiliary methods former two invoked prior primary method particular order based class hierarchy codice_11 method control whether primary method executed additionally programmer specify whether possible primary methods along class hierarchy called one providing closest match standard method-combination provides primary around methods explained method-combinations method types new simple complex method-combinations method types defined clos allows multiple inheritance default order methods executed multiple inheritance correct programmer may resolve diamond inheritance problems specifying order method combinations clos dynamic meaning contents also structure objects modified runtime clos supports changing class definitions on-the-fly even instances class question already exist well changing class membership given instance codice_13 operator clos also allows one add redefine remove methods runtime circle-ellipse problem readily solved clos oop design patterns either disappear qualitatively simpler clos prototype language classes must defined objects instantiated members class outside ansi common lisp standard widely implemented extension clos called metaobject protocol mop mop defines standard interface underpinnings clos implementation treating classes slot-descriptions generic-functions methods instances metaclasses allows definition new metaclasses modification clos behavior flexibility clos mop prefigures aspect-oriented programming later developed engineers gregor kiczales mop defines behavior whole object system set protocols defined terms clos thus possible create new object-systems extending changing provided clos functionality book art metaobject protocol describes use implementation clos mop various common lisp implementations slightly different support meta-object protocol closer project aims provide missing features flavors successor new flavors object system mit lisp machine large parts lisp machine operating systems many applications use flavors new flavors flavors introduced multiple inheritance mixins among features flavors mostly obsolete though implementations common lisp exist flavors using message passing paradigm new flavors introduced generic functions commonloops successor loops xerox interlisp-d commonloops implemented common lisp portable implementation called portable commonloops pcl first implementation clos pcl widely ported still provides base clos implementation several common lisp implementations pcl implemented mostly portable common lisp system dependent parts power expressivity clos well historical availability tinyclos simplified portable clos implementation written gregor kiczales use scheme clos-like mop-based object systems become de facto norm lisp dialect implementations well finding way languages oop facilities", + "neighbors": [ + 27, + 46, + 56, + 173, + 194, + 203, + 246, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 378, + 383, + 391, + 392, + 396, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 916, + 919, + 929, + 934, + 947, + 948, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1269, + 1277, + 1298, + 1315, + 1375, + 1385, + 1402, + 1404, + 1413, + 1430, + 1466, + 1516, + 1532, + 1536, + 1588, + 1609, + 1626, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1390, + "label": 9, + "text": "GFA_BASIC:gfa basic gfa basic dialect basic programming language frank ostrowski name derived company gfa systemtechnik gmbh distributed software mid-1980s 1990s enjoyed popularity advanced basic dialect mostly superseded several programming languages official support ended early 2000s gfa basic developed frank ostrowski gfa systemtechnik gmbh later gfa software german company kiel d\u00fcsseldorf gfa acronym gesellschaft f\u00fcr automatisierung company automation gave name software first gfa basic version released 1986 mid late 1980s became popular atari st home computer range since atari st basic shipped primitive later ports commodore amiga dos windows marketed version 2.0 popular release gfa basic offered many advanced features compared alternatives gfa basic 3.0 included improvements like support user-defined structures agglomerated data types final released version 3.6 around 2002 gfa software ceased gfa basic activities shut mailinglist website 2005 due missing official support availability gfa basic user community took support installed communication infrastructure version 2.0 popular release gfa basic modern programming language time line numbers used one line equivalent one command greatly simplify maintenance long listings ide even allowed code folding reasonable range structured programming commands \u2014 procedures local variables parameter passing value reference loop constructs etc modularization rudimentary making gfa basic 2.0 best suited small medium-sized projects gfa basic interpreter compact reasonably fast shipped runtime could distributed freely one programs compiler made available execution speed could increased approximately factor 2 gfa basic allowed extreme optimisations execution speed supporting direct assembler-level calls even ability embed sections assembler code directly within basic source code gfa basic integrated neatly gem tos atari st operating system providing menus dialog boxes mouse control see wimp interface although source code usually stored tokenized version save room disk pieces code could also saved ascii form made possible set reusable libraries tokenized source files benefit ways \u2014 instance gfa basic allowed users include binary data basic code via inline statement could even integrated gfa assembler allow users develop machine code programs inside inline statements order accelerate particular areas program also meant basic interpreter later compiler n't need tokenise program loaded would significant load-time overhead larger gfa basic programs written editions gfa manual printed black ink red paper attempt thwart photocopying bootlegging effectiveness tactic questionable manual returned usual black-on-white format complaints colour blind users proliferation re-typed copies internet gfa basic microsoft windows included thorough implementation windows api calls although product number technical advantages popular products combination easy language robust architecture fast compiled reliable code n't achieve great success windows market software professionals wanted high-performance code tended stay technical languages regard basics inferior professionals n't problem basic number well-established software tool vendors microsoft borland actively promoting new visual programming systems visual basic allowed users create windows dialog boxes populated standard components text buttons frame outlines help drag-and-drop interface object-oriented editing one advantages gfa basic windows compiler sold separately could create stand-alone .exe files also included relatively easy option creating dynamic link library .dll files windows allowed user write test routines within gfa basic export functions windows .dll file access pre-compiled functions within tools programs visual basic 3.0 unable produce compiled code feature allowed gfa basic used number-crunching add-on product visual basic writing high-speed routines applications database sorting media signal processing would impractical then-current version visual basic gfa basic company recognition product recognition factors companies microsoft borland united states market simple text-based code creation system lacked exciting new visual user interfaces better-known competitors although gfa basic windows developed include support visual basic components use gfa technical visual basic without large marketing budget clear reason journalists write gfa basic windows remained comparatively obscure product \u00e9ric chahi wrote game editor gfa basic create game another world including scene design game scripting game engine polygon rendering music done assembler editor used make ports game including consoles collector edition windows released 2006 dashboard sustainability coded mostly gfa basic source 500kb plus 100kb assembly mainly accessing 32-bit windows functions", + "neighbors": [ + 0, + 8, + 152, + 236, + 273, + 412, + 510, + 606, + 670, + 799, + 810, + 812, + 843, + 961, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1304, + 1306, + 1584, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1391, + "label": 2, + "text": "Device_mapper:device mapper device mapper framework provided linux kernel mapping physical block devices onto higher-level virtual block devices forms foundation logical volume manager lvm software raids dm-crypt disk encryption offers additional features file system snapshots device mapper works passing data virtual block device provided device mapper another block device data also modified transition performed example case device mapper providing disk encryption simulation unreliable hardware behavior article focuses device mapper implementation linux kernel device mapper functionality also available netbsd dragonfly bsd applications like lvm2 enterprise volume management system evms need create new mapped devices talk device mapper via codice_1 shared library turn issues ioctls codice_2 device node configuration device mapper also examined configured interactivelyor shell scriptsby using utility two userspace components source code maintained alongside lvm2 source functions provided device mapper include linear striped error mappings well crypt multipath targets example two disks may concatenated one logical volume pair linear mappings one disk another example crypt target encrypts data passing specified device using linux kernel crypto api following mapping targets available following linux kernel features projects built top device mapper", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 322, + 327, + 346, + 400, + 401, + 412, + 413, + 465, + 477, + 571, + 583, + 630, + 650, + 664, + 688, + 716, + 720, + 725, + 728, + 736, + 754, + 797, + 860, + 891, + 897, + 935, + 941, + 961, + 966, + 986, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1060, + 1102, + 1105, + 1138, + 1155, + 1187, + 1197, + 1202, + 1208, + 1224, + 1241, + 1252, + 1278, + 1301, + 1313, + 1357, + 1360, + 1361, + 1398, + 1415, + 1441, + 1456, + 1457, + 1468, + 1474, + 1494, + 1524, + 1526, + 1530, + 1546, + 1558, + 1578, + 1602, + 1616, + 1631, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 1392, + "label": 7, + "text": "Shared_disk_architecture:shared disk architecture shared disk architecture sd distributed computing architecture disks accessible cluster nodes contrasts shared nothing architecture nodes sole access distinct disks multiple processors access disks directly via intercommunication network every processor local memory shared disk two advantages shared memory firstly processor memory memory bus bottleneck secondly system offers simple way provide degree fault tolerance", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1393, + "label": 4, + "text": "JASBUG:jasbug jasbug security bug disclosed february 2015 affecting core components microsoft windows operating system vulnerability dated back 2000 affected supported editions windows server 2003 windows vista windows server 2008 windows 7 windows server 2008 r2 windows 8 windows server 2012 windows rt windows 8.1 windows server 2012 r2 windows rt 8.1 vulnerability allows hackers remotely take control windows devices connect active directory domain jasbug registered common vulnerabilities exposures system industrial control systems cyber emergency response team part department homeland security issued ics-alert-15-041-01 warning control systems owners expedite applying critical jasbug fixes microsoft released two patches ms15-011 ms15-014 address jasbug day vulnerability disclosed fixes took microsoft year develop deploy due complexity jasbug vulnerability time disclosure 300 million computers believed vulnerable exploit jasbug disclosed public microsoft part patch tuesday february 10th 2015 vulnerability initially reported microsoft january 2014 jeff schmidt founder jas global advisors microsoft publicly announced security vulnerability garnered name jasbug reference role jas global advisors played discovering exploit 2014 jas global advisors working engagement internet corporation assigned names numbers icann organization governing standards internet research potential technical issues surrounding rollout new generic top level domains gtlds internet working research jas global advisors business partner simmachines uncovered vulnerability applying big data analytical techniques large technical data sets jasbug principally affects business government users home users less likely affected jasbug use domain-configured computers white house cybersecurity advisor michael daniel spoke importance addressing jasbug meeting information security privacy advisory board national institute standards technology office management budget department homeland security immediately took steps fix vulnerability federal networks suzanne e. spaulding serving secretary national protection programs directorate nppd department homeland security mentioned jasbug february 2015 house representatives hearing touched potential effect dhs funding hiatus aftermath jasbug various government agencies updated technical specifications mitigate exploit risks example united states department veteran affairs decided may 2015 unapprove use windows server 2003 based jasbug risks according microsoft exploit takes advantage group policy receives applies policy data domain-joined system connects domain controller one likely exploitation flaw involves deceiving user domain-configured system network controlled hacker despite potential effect indication jasbug vulnerability ever used cyberhackers access corporate government computers jasbug affects windows vista windows server 2008 windows 7 windows server 2008 r2 windows 8 windows 8.1 windows server 2012 windows server 2012 r2 windows rt windows rt 8.1 windows server 2003 also affected jasbug patch platform microsoft indicated feasible build fix version jasbug also affects windows xp windows 2000 patch made available operating systems longer supported microsoft unlike high-profile vulnerabilities like heartbleed shellshock gotofail poodle jasbug design problem implementation problem making type vulnerability unusual much difficult fix fix required microsoft re-engineer core components operating system add several new features including additional hardening group policy feature organizations use centrally manage windows systems applications user settings active directory environments microsoft able fix jasbug flaw windows server 2003 systems noting architecture properly support fix provided update exist windows server 2003 systems making infeasible build fix windows server 2003 unpatched unpatchable platforms may vulnerable jasbug security firms like symantec recommend organizations use intrusion prevention systems ips monitor network activity possible malicious jasbug traffic", + "neighbors": [ + 43, + 91, + 141, + 148, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 750, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1436, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Train" + }, + { + "node_id": 1394, + "label": 2, + "text": "86-DOS:86-dos 86-dos discontinued operating system developed marketed seattle computer products scp intel 8086-based computer kit initially known qdos quick dirty operating system name changed 86-dos scp started licensing operating system 1980 86-dos command structure application programming interface imitated digital research cp/m operating system made easy port programs latter system licensed purchased microsoft developed ms-dos pc dos 86-dos created sales seattle computer products 8086 computer kit demonstrated june 1979 shipped november languishing due absence operating system software scp could sell board microsoft standalone disk basic-86 microsoft developed prototype scp hardware scp wanted offer 8086-version cp/m digital research announced release date uncertain first time digital research lagged behind hardware developments two years earlier slow adapt cp/m new floppy disk formats hard disk drives april 1980 scp assigned 24-year-old tim paterson develop substitute cp/m-86 using cp/m-80 manual reference paterson modeled 86-dos architecture interfaces adapted meet requirements intel 8086 16-bit processor easy partially automated source-level translatability many existing 8-bit cp/m programs porting either dos cp/m-86 equally difficult eased fact intel already published method could used automatically translate software intel 8080 processor cp/m designed new 8086 instruction set time made number changes enhancements address saw cp/m shortcomings cp/m cached file system information memory speed required user force update disk removing user forgot disk would become corrupt paterson took safer slower approach updating disk operation cp/m pip command copied files supported several special file names referred hardware devices printers communication ports paterson built names operating system device files program could use gave copying program intuitive name copy rather implementing cp/m file system drew microsoft standalone disk basic-86 file allocation table fat file system mid-1980 scp advertised 86-dos priced 95 owners 1290 8086 board 195 others touted software ability read zilog z80 source code cp/m disk translate 8086 source code promised minor hand correction optimization needed produce 8086 binaries october 1980 ibm developing would become original ibm personal computer cp/m far popular operating system use time ibm felt needed cp/m order compete ibm representatives visited digital research discussed licensing digital research licensing representative dorothy kildall n\u00e9e mcewen hesitated sign ibm non-disclosure agreement although nda later accepted digital research would accept ibm proposal 250,000 exchange many copies ibm could sell insisting usual royalty-based plan later discussions ibm bill gates gates mentioned existence 86-dos ibm representative jack sams told get license microsoft purchased non-exclusive license 86-dos seattle computer products december 1980 25,000 may 1981 hired tim paterson port system ibm pc used slower less expensive intel 8088 processor specific family peripherals ibm watched developments daily submitting 300 change requests accepted product wrote user manual july 1981 month pc release microsoft purchased rights 86-dos scp 50,000 met ibm main criteria looked like cp/m easy adapt existing 8-bit cp/m programs run notably thanks trans command would translate source files 8080 8086 machine instructions microsoft licensed 86-dos ibm became pc dos 1.0 license also permitted microsoft sell dos companies deal spectacularly successful scp later claimed court microsoft concealed relationship ibm order purchase operating system cheaply scp ultimately received 1 million settlement payment digital research founder gary kildall examined pc dos found duplicated cp/m programming interface wanted sue ibm time claimed pc dos product however digital research attorney believe relevant law clear enough sue nonetheless kildall confronted ibm persuaded offer cp/m-86 pc exchange release liability controversy continued surround similarity two systems perhaps sensational claim came jerry pournelle said kildall personally demonstrated dos contained cp/m code entering command dos displayed kildall name pournelle never revealed command nobody come forward corroborate story 2004 book kildall says used encrypted message demonstrate manufacturers copied cp/m say found message dos instead kildall memoir source book pointed well-known interface similarity paterson insists 86-dos software original work denied referring otherwise using cp/m code writing 2004 book appeared sued authors publishers defamation court ruled summary judgment defamation occurred book claims opinions based research provably false following list commands supported 86-dos 1982 ibm asked microsoft release version dos compatible hard disk drive pc dos 2.0 almost complete rewrite dos march 1983 little 86-dos remained enduring element 86-dos primitive line editor edlin remained editor supplied microsoft versions dos june 1991 release ms-dos 5.0 included text-based user interface editor called ms-dos editor based qbasic edlin still used contemporary machines since emulated dos environment windows 10 32 bit seattle computer products 86-dos supported fat12 filesystem range 8-inch 5.25-inch floppy disk drives s-100 floppy disk controller hardware manufactured cromemco tarbell electronics north star computers western digital fd1771-based cromemco tarbell boards supported one-sided single-density soft-sectored drives tarbell double-density board utilizing fd1791 supported well later scp offered advanced floppy disk controllers like disk master series 86-dos take advantage fat id byte bios parameter block bpb later dos versions distinguish different media formats instead different drive letters hard-coded time compilation associated different physical floppy drives sides densities meant depending type disk addressed certain drive letter recognized correctly concept later emulated flexibility driver.sys dos 3.x later versions two logical format variants 86-dos 12-bit fat format existed \u2014 original format 16-byte directory entries later format since 86-dos 0.42 32-byte directory entries second one logically compatible fat12 format known since release ms-dos pc dos ms-dos still mount volumes absence bpb falls back retrieve fat id fat entry design fat file system clust 0cluster 0 choose among hard-coded disk geometry profiles formats volume formatted ms-dos would otherwise supported systems typically also formats id located first byte logical sector 1 \u2014 volume second sector physical cylinder-head-sector chs address 0/0/2 logical block addressing lba address 1 \u2014 since ms-dos assumes single reserved sector boot sector 86-dos reserved sectors area significantly larger whole tracks therefore prototypical fat id located elsewhere disk making impossible ms-dos retrieve even would hard-coded disk profile associated would take larger reserved sectors region 86-dos account cp/m 2 floppy media readable rdcpm 86-dos offer specific support fixed disks third-party solutions form hard disk controllers corresponding i/o system extensions 86-dos available companies like tallgrass technologies making hard disks accessible similar superfloppies within size limits fat12 file system various oem versions ms-dos 1.2x 2.x supported number similar 8.0 fat12 floppy disk formats well although identical supported 86-dos disk formats supported one last versions developed tim paterson microsoft ms-dos 1.25 march 1982 scp gazelle computer scp controller cromemco 16fdc controller default version supported ms-dos-compatible variants 8.0 formats single reserved sector could built provide two extra drive letters read write floppies previous scp 86-dos 8.0 disk formats since 0.42 well 1984 seattle computer products released oem version ms-dos 2.0 scp s-100 computer scp-500 disk master floppy controller added support 5.25 dd/1s 180 kb dd/2s 360 kb fat12 formats supported older formats well although possibly parameters modified compared ms-dos 1.25", + "neighbors": [ + 1, + 9, + 22, + 37, + 58, + 64, + 78, + 85, + 99, + 134, + 170, + 171, + 187, + 322, + 352, + 413, + 434, + 465, + 477, + 583, + 639, + 664, + 716, + 728, + 754, + 797, + 860, + 870, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1050, + 1138, + 1155, + 1187, + 1188, + 1202, + 1224, + 1301, + 1304, + 1394, + 1398, + 1415, + 1441, + 1445, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 1395, + "label": 5, + "text": "Simple_Mail_Transfer_Protocol:simple mail transfer protocol simple mail transfer protocol smtp communication protocol electronic mail transmission internet standard smtp first defined 1982 updated 2008 extended smtp additions protocol variety widespread use today mail servers message transfer agents use smtp send receive mail messages proprietary systems microsoft exchange ibm notes webmail systems outlook.com gmail yahoo mail may use non-standard protocols internally use smtp sending receiving email outside systems smtp servers commonly use transmission control protocol port number 25 user-level email clients typically use smtp sending messages mail server relaying typically submit outgoing email mail server port 587 465 per rfc 8314 retrieving messages imap pop3 standard proprietary servers also often implement proprietary protocols e.g. exchange activesync various forms one-to-one electronic messaging used 1960s users communicated using systems developed specific mainframe computers computers interconnected especially u.s. government arpanet standards developed permit exchange messages different operating systems smtp grew standards developed 1970s smtp traces roots two implementations described 1971 mail box protocol whose implementation disputed discussed rfcs sndmsg program according ray tomlinson bbn invented tenex computers send mail messages across arpanet fewer 50 hosts connected arpanet time implementations include ftp mail mail protocol 1973 development work continued throughout 1970s arpanet transitioned modern internet around 1980 jon postel proposed mail transfer protocol 1980 began remove mail reliance ftp smtp published november 1981 also postel smtp standard developed around time usenet one-to-many communication network similarities smtp became widely used early 1980s time complement unix unix copy program uucp mail better suited handling email transfers machines intermittently connected smtp hand works best sending receiving machines connected network time use store forward mechanism examples push technology though usenet newsgroups still propagated uucp servers uucp mail transport virtually disappeared along bang paths used message routing headers sendmail released 4.1cbsd right one first mail transfer agents implement smtp time bsd unix became popular operating system internet sendmail became common mta mail transfer agent popular smtp server programs include postfix qmail novell groupwise exim novell netmail microsoft exchange server oracle communications messaging server message submission smtp-auth introduced 1998 1999 describing new trends email delivery originally smtp servers typically internal organization receiving mail organization outside relaying messages organization outside time went smtp servers mail transfer agents practice expanding roles become message submission agents mail user agents relaying mail outside organization e.g company executive wishes send email trip using corporate smtp server issue consequence rapid expansion popularity world wide web meant smtp include specific rules methods relaying mail authenticating users prevent abuses relaying unsolicited email spam work message submission originally started popular mail servers would often rewrite mail attempt fix problems example adding domain name unqualified address behavior helpful message fixed initial submission dangerous harmful message originated elsewhere relayed cleanly separating mail submission relay seen way permit encourage rewriting submissions prohibiting rewriting relay spam became prevalent also seen way provide authorization mail sent organization well traceability separation relay submission quickly became foundation modern email security practices protocol started purely ascii text-based deal well binary files characters many non-english languages standards multipurpose internet mail extensions mime developed encode binary files transfer smtp mail transfer agents mtas developed sendmail also tended implemented 8-bit-clean alternate send eight strategy could used transmit arbitrary text data 8-bit ascii-like character encoding via smtp mojibake still problem due differing character set mappings vendors although email addresses still allowed ascii 8-bit-clean mtas today tend support 8bitmime extension permitting binary files transmitted almost easily plain text recently smtputf8 extension created support utf-8 text allowing international content addresses non-latin scripts like cyrillic chinese many people contributed core smtp specifications among jon postel eric allman dave crocker ned freed randall gellens john klensin keith moore email submitted mail client mail user agent mua mail server mail submission agent msa using smtp tcp port 587 mailbox providers still allow submission traditional port 25 msa delivers mail mail transfer agent mail transfer agent mta often two agents instances software launched different options machine local processing done either single machine split among multiple machines mail agent processes one machine share files processing multiple machines transfer messages using smtp machine configured use next machine smart host process mta smtp server right boundary mta uses domain name system dns look mail exchanger record mx record recipient domain part email address right mx record contains name target host based target host factors mta selects exchange server see article mx record mta connects exchange server smtp client message transfer occur single connection two mtas series hops intermediary systems receiving smtp server may ultimate destination intermediate relay stores forwards message gateway may forward message using protocol smtp hop formal handoff responsibility message whereby receiving server must either deliver message properly report failure final hop accepts incoming message hands mail delivery agent mda local delivery mda saves messages relevant mailbox format sending reception done using one multiple computers diagram mda depicted one box near mail exchanger box mda may deliver messages directly storage forward network using smtp protocol local mail transfer protocol lmtp derivative smtp designed purpose delivered local mail server mail stored batch retrieval authenticated mail clients muas mail retrieved end-user applications called email clients using internet message access protocol imap protocol facilitates access mail manages stored mail post office protocol pop typically uses traditional mbox mail file format proprietary system microsoft exchange/outlook lotus notes/domino webmail clients may use either method retrieval protocol often formal standard smtp defines message transport message content thus defines mail envelope parameters envelope sender header except trace information body message std 10 define smtp envelope std 11 define message header body formally referred internet message format smtp connection-oriented text-based protocol mail sender communicates mail receiver issuing command strings supplying necessary data reliable ordered data stream channel typically transmission control protocol tcp connection smtp session consists commands originated smtp client initiating agent sender transmitter corresponding responses smtp server listening agent receiver session opened session parameters exchanged session may include zero smtp transactions smtp transaction consists three command/reply sequences besides intermediate reply data server reply either positive 2xx reply codes negative negative replies permanent 5xx codes transient 4xx codes reject permanent failure client send bounce message server received drop positive response followed message discard rather delivery initiating host smtp client either end-user email client functionally identified mail user agent mua relay server mail transfer agent mta smtp server acting smtp client relevant session order relay mail fully capable smtp servers maintain queues messages retrying message transmissions resulted transient failures mua knows outgoing mail smtp server configuration relay server typically determines server connect looking mx mail exchange dns resource record recipient domain name mx record found conformant relaying server instead looks record relay servers also configured use smart host relay server initiates tcp connection server well-known port smtp port 25 connecting msa port 587 main difference mta msa connecting msa requires smtp authentication smtp delivery protocol normal use mail pushed destination mail server next-hop mail server arrives mail routed based destination server individual user addressed protocols post office protocol pop internet message access protocol imap specifically designed use individual users retrieving messages managing mail boxes permit intermittently-connected mail server pull messages remote server demand smtp feature initiate mail queue processing remote server see remote message queue starting pop imap unsuitable protocols relaying mail intermittently-connected machines designed operate final delivery information critical correct operation mail relay mail envelope removed remote message queue starting feature smtp permits remote host start processing mail queue server may receive messages destined sending turn command feature however deemed insecure extended etrn command operates securely using authentication method based domain name system information email client needs know ip address initial smtp server given part configuration usually given dns name server deliver outgoing messages behalf user server administrators need impose control clients use server enables deal abuse example spam two solutions common use system isp smtp server allow access users outside isp network precisely server may allow access users ip address provided isp equivalent requiring connected internet using isp mobile user may often network normal isp find sending email fails configured smtp server choice longer accessible system several variations example organisation smtp server may provide service users network enforcing firewalling block access users wider internet server may perform range checks client ip address methods typically used corporations institutions universities provided smtp server outbound mail use internally within organisation however bodies use client authentication methods described user mobile may use different isps connect internet kind usage restriction onerous altering configured outbound email smtp server address impractical highly desirable able use email client configuration information need change modern smtp servers typically require authentication clients credentials allowing access rather restricting access location described earlier flexible system friendly mobile users allows fixed choice configured outbound smtp server smtp authentication often abbreviated smtp auth extension smtp order log using authentication mechanism server accessible wider internet enforce kinds access restrictions known open relay generally considered bad practice worthy blacklisting communication mail servers generally uses standard tcp port 25 designated smtp mail clients however generally n't use instead using specific submission ports mail services generally accept email submission clients one port 2525 others may used individual providers never officially supported internet service providers block outgoing port 25 traffic customers anti-spam measure reason businesses typically configure firewall allow outgoing port 25 traffic designated mail servers typical example sending message via smtp two mailboxes alice theboss located mail domain example.com localhost.com reproduced following session exchange example conversation parts prefixed c server client respectively labels part exchange message sender smtp client establishes reliable communications channel message receiver smtp server session opened greeting server usually containing fully qualified domain name fqdn case smtp.example.com client initiates dialog responding codice_1 command identifying command parameter fqdn address literal none available client notifies receiver originating email address message codice_2 command also return bounce address case message delivered example email message sent two mailboxes smtp server one recipient listed cc header fields corresponding smtp command codice_3 successful reception execution command acknowledged server result code response message e.g. 250 ok transmission body mail message initiated codice_4 command transmitted verbatim line line terminated end-of-data sequence sequence consists new-line cr lf single full stop period followed another new-line since message body contain line period part text client sends two periods every time line starts period correspondingly server replaces every sequence two periods beginning line single one escaping method called dot-stuffing server positive reply end-of-data exemplified implies server taken responsibility delivering message message doubled communication failure time e.g due power shortage sender received 250 reply must assume message delivered hand receiver decided accept message must assume message delivered thus time span agents active copies message try deliver probability communication failure occurs exactly step directly proportional amount filtering server performs message body often anti-spam purposes limiting timeout specified 10 minutes codice_5 command ends session email recipients located elsewhere client would codice_5 connect appropriate smtp server subsequent recipients current destination queued information client sends codice_1 codice_2 commands added seen example code additional header fields message receiving server adds codice_9 codice_10 header field respectively clients implemented close connection message accepted codice_11 last two lines may actually omitted causes error server trying send codice_12 reply original smtp protocol supported unauthenticated unencrypted ascii text communications susceptible man middle attacks spoofing spamming requiring encode binary data transmission number optional extensions specify various mechanisms address problems clients learn server supported options using codice_13 greeting exemplified instead original codice_1 example clients fall back codice_1 server support smtp extensions modern clients may use esmtp extension keyword codice_16 query server maximum message size accepted older clients servers may try transfer excessively sized messages rejected consuming network resources including connect time network links paid minute users manually determine advance maximum size accepted esmtp servers client replaces codice_1 command codice_13 command thus smtp2.example.com declares accept fixed maximum message size larger 14,680,064 octets 8-bit bytes simplest case esmtp server declares maximum codice_16 immediately receiving codice_13 according however numeric parameter codice_16 extension codice_13 response optional clients may instead issuing codice_2 command include numeric estimate size message transferring server refuse receipt overly-large messages original smtp supports transport textual data therefore binary data needs encoded text transfer decoded leading increased size transit 8bitmime command developed alleviate limitation standardized 1994 obsoleted 2011 corresponding new std 71 facilitates transparent exchange e-mail messages containing octets outside seven-bit ascii character set prior availability 8bitmime implementations mail user agents employed several techniques cope seven-bit limitation binary-to-text encodings including ones provided mime utf-7 however workarounds inflates required amount data transmission non-ascii text non-esmtp servers allowed sending 8-bit characters risky send data server whose 8-bit capabilities unknown on-demand mail relay odmr smtp extension standardized allows intermittently-connected smtp server receive email queued connected original smtp supports email addresses composed ascii characters inconvenient users whose native script latin based use diacritic ascii character set limitation alleviated via extensions enabling utf-8 address names introduced experimental codice_24 command later superseded introduced codice_25 command extensions provide support multi-byte non-ascii characters email addresses diacritics language characters greek chinese current support limited strong interest broad adoption related rfcs countries like china large user base latin ascii foreign script mail delivery occur plain text encrypted connections however communicating parties might know advance party ability use secure channel smtp authentication often abbreviated smtp auth describes mechanism client log using authentication mechanism supported server mainly used submission servers authentication mandatory multiple rfcs exist provide different variations mechanism update smtp extensions describe starttls command enables server tell client supports encrypted communications client request upgrade secure channel starttls effective passive observation attacks since starttls negotiation happens plain text active attacker trivially remove starttls command attack sometimes called striptls client would think server send starttls header support starttls server would think client respond starttls header thus support starttls note starttls also defined imap pop3 rfcs protocols serve different purposes smtp used communication message transfer agents imap pop3 end clients message transfer agents electronic frontier foundation maintains starttls everywhere list similarly https everywhere list allows relying parties discover others supporting secure communication without prior communication newer 2018 called smtp mta strict transport security mta-sts aims addresses problem active adversary defining protocol mail servers declare ability use secure channels specific files server specific dns txt records relying party would regularly check existence record cache amount time specified record never communicate insecure channels record expires note mta-sts records apply smtp traffic mail servers communications end client mail server protected http strict transport security https april 2019 google mail announced support mta-sts number protocols allows secure delivery messages fail due misconfigurations deliberate active interference leading undelivered messages delivery unencrypted unauthenticated channels smtp tls reporting describes reporting mechanism format sharing statistics specific information potential failures recipient domains recipient domains use information detect potential attacks diagnose unintentional misconfigurations april 2019 google mail announced support smtp tls reporting original design smtp facility authenticate senders check servers authorized send behalf result email spoofing possible commonly used email spam phishing occasional proposals made modify smtp extensively replace completely one example internet mail 2000 neither made much headway face network effect huge installed base classic smtp instead mail servers use range techniques including domainkeys identified mail sender policy framework dmarc dnsbls greylisting reject quarantine suspicious emails", + "neighbors": [ + 14, + 52, + 109, + 148, + 167, + 217, + 258, + 311, + 312, + 342, + 357, + 425, + 430, + 444, + 455, + 470, + 473, + 491, + 542, + 543, + 576, + 608, + 617, + 638, + 646, + 672, + 684, + 712, + 732, + 741, + 757, + 758, + 762, + 764, + 769, + 770, + 771, + 779, + 833, + 837, + 852, + 875, + 886, + 923, + 991, + 1102, + 1116, + 1130, + 1171, + 1172, + 1200, + 1206, + 1210, + 1213, + 1218, + 1301, + 1309, + 1314, + 1326, + 1329, + 1339, + 1386, + 1395, + 1400, + 1407, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1470, + 1510, + 1517, + 1548, + 1552, + 1570, + 1588, + 1597, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1396, + "label": 7, + "text": "Service-oriented_middleware:service-oriented middleware service-oriented middleware som aids distributed object middleware dom systems concept services service context number objects behavior objects use predefined interface make service available systems/services som defines communication protocols services provides location- migration-transparent access services thus supporting simple integration services beyond platform boundaries one example som sun oracle jini system called apache river project architectures belonging field web services also belong category middleware", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1397, + "label": 2, + "text": "Junos_OS:junos os junos os formally juniper network operating system freebsd-based operating system used juniper networks hardware routers operating system used juniper routing switching security devices juniper offers software development kit sdk partners customers allow additional customization biggest competitor junos cisco systems ios junos os formerly branded juniper junos commonly referred simply junos though general brand name juniper networks including product lines junos fusion key benefits junos os include junos provides single code base across juniper platforms juniper issued new release junos every 90 days since 1998 junos supports variety routing protocols introduction srx j-series past version 9.3 platforms also supports flow mode includes stateful firewalling nat ipsec flexible routing policy language used controlling route advertisements path selection junos generally adheres industry standards routing mpls operating system supports high availability mechanisms standard unix graceful restart junos operating system primarily based linux freebsd linux running bare metal freebsd running qemu virtual machine freebsd unix implementation customers access unix shell execute normal unix commands junos runs juniper hardware systems juniper acquired netscreen integrated screenos security functions junos network operating system junos cli text-based command interface configuring troubleshooting monitoring juniper device network traffic associated supports two types command modes functions operational mode include control cli environment monitoring hardware status display information network data passes though hardware configuration mode used configuring juniper router switch security device adding deleting modifying statements configuration hierarchy juniper developer network jdn juniper networks provides junos sdk customers 3rd-party developers want develop applications junos-powered devices juniper networks routers switches service gateway systems provides set tools application programming interfaces apis including interfaces junos routing firewall filter ui traffic services functions juniper networks also employs junos sdk internally develop parts junos many junos applications openflow junos traffic services 2016 juniper maintains market share ethernet switching 16.9 market share enterprise routing 16.1 juniper generated 2,353 million revenue routing 858 million switching 318 million security 2016 juniper revenue stems americas 2,969 million europe middle east africa 1,238 million asia 783 million combining rest annual revenue 2016", + "neighbors": [ + 38, + 101, + 106, + 116, + 134, + 187, + 189, + 276, + 290, + 324, + 542, + 569, + 735, + 899, + 941, + 965, + 992, + 1138, + 1301, + 1318, + 1322, + 1397, + 1415, + 1462, + 1468, + 1494, + 1521, + 1546 + ], + "mask": "Test" + }, + { + "node_id": 1398, + "label": 3, + "text": "Computer_architecture:computer architecture computer engineering computer architecture set rules methods describe functionality organization implementation computer systems definitions architecture define describing capabilities programming model computer particular implementation definitions computer architecture involves instruction set architecture design microarchitecture design logic design implementation first documented computer architecture correspondence charles babbage ada lovelace describing analytical engine building computer z1 1936 konrad zuse described two patent applications future projects machine instructions could stored storage used data i.e stored-program concept two early important examples term \u201c architecture \u201d computer literature traced work lyle r. johnson frederick p. brooks jr. members machine organization department ibm \u2019 main research center 1959 johnson opportunity write proprietary research communication stretch ibm-developed supercomputer los alamos national laboratory time known los alamos scientific laboratory describe level detail discussing luxuriously embellished computer noted description formats instruction types hardware parameters speed enhancements level \u201c system architecture \u201d \u2013 term seemed useful \u201c machine organization. \u201d subsequently brooks stretch designer started chapter 2 book planning computer system project stretch ed w. buchholz 1962 writing brooks went help develop ibm system/360 called ibm zseries line computers \u201c architecture \u201d became noun defining \u201c user needs know \u201d later computer users came use term many less-explicit ways earliest computer architectures designed paper directly built final hardware form later computer architecture prototypes physically built form transistor\u2013transistor logic ttl computer\u2014such prototypes 6800 pa-risc\u2014tested tweaked committing final hardware form 1990s new computer architectures typically built tested tweaked\u2014inside computer architecture computer architecture simulator inside fpga soft microprocessor both\u2014before committing final hardware form discipline computer architecture three main subcategories types computer architecture following types used bigger companies like intel count 1 computer architecture purpose design computer maximizes performance keeping power consumption check costs low relative amount expected performance also reliable many aspects considered includes instruction set design functional organization logic design implementation implementation involves integrated circuit design packaging power cooling optimization design requires familiarity compilers operating systems logic design packaging instruction set architecture isa interface computer software hardware also viewed programmer view machine computers understand high-level programming languages java c++ programming languages used processor understands instructions encoded numerical fashion usually binary numbers software tools compilers translate high level languages instructions processor understand besides instructions isa defines items computer available program\u2014e.g data types registers addressing modes memory instructions locate available items register indexes names memory addressing modes isa computer usually described small instruction manual describes instructions encoded also may define short vaguely mnemonic names instructions names recognized software development tool called assembler assembler computer program translates human-readable form isa computer-readable form disassemblers also widely available usually debuggers software programs isolate correct malfunctions binary computer programs isas vary quality completeness good isa compromises programmer convenience easy code understand size code much code required specific action cost computer interpret instructions complexity means hardware needed decode execute instructions speed computer complex decoding hardware comes longer decode time memory organization defines instructions interact memory memory interacts design emulation software emulators run programs written proposed instruction set modern emulators measure size cost speed determine particular isa meeting goals computer organization helps optimize performance-based products example software engineers need know processing power processors may need optimize software order gain performance lowest price require quite detailed analysis computer organization example sd card designers might need arrange card data processed fastest possible way computer organization also helps plan selection processor particular project multimedia projects may need rapid data access virtual machines may need fast interrupts sometimes certain tasks need additional components well example computer capable running virtual machine needs virtual memory hardware memory different virtual computers kept separated computer organization features also affect power consumption processor cost instruction set micro-architecture designed practical machine must developed design process called implementation implementation usually considered architectural design rather hardware design engineering implementation broken several steps cpus entire implementation process organized differently often referred cpu design exact form computer system depends constraints goals computer architectures usually trade standards power versus performance cost memory capacity latency latency amount time takes information one node travel source throughput sometimes considerations features size weight reliability expandability also factors common scheme depth power analysis figures keep power consumption low maintaining adequate performance modern computer performance often described ipc instructions per cycle measures efficiency architecture clock frequency since faster rate make faster computer useful measurement older computers ipc counts low 0.1 instructions per cycle simple modern processors easily reach near 1 superscalar processors may reach three five ipc executing several instructions per clock cycle counting machine language instructions would misleading varying amounts work different isas instruction standard measurements count isa actual machine language instructions unit measurement usually based speed vax computer architecture many people used measure computer speed clock rate usually mhz ghz refers cycles per second main clock cpu however metric somewhat misleading machine higher clock rate may necessarily greater performance result manufacturers moved away clock speed measure performance factors influence speed mix functional units bus speeds available memory type order instructions programs two main types speed latency throughput latency time start process completion throughput amount work done per unit time interrupt latency guaranteed maximum response time system electronic event like disk drive finishes moving data performance affected wide range design choices \u2014 example pipelining processor usually makes latency worse makes throughput better computers control machinery usually need low interrupt latencies computers operate real-time environment fail operation completed specified amount time example computer-controlled anti-lock brakes must begin braking within predictable short time brake pedal sensed else failure brake occur benchmarking takes factors account measuring time computer takes run series test programs although benchmarking shows strengths n't choose computer often measured machines split different measures example one system might handle scientific applications quickly another might render video games smoothly furthermore designers may target add special features products hardware software permit specific benchmark execute quickly n't offer similar advantages general tasks power efficiency another important measurement modern computers higher power efficiency often traded lower speed higher cost typical measurement referring power consumption computer architecture mips/w millions instructions per second per watt modern circuits less power required per transistor number transistors per chip grows transistor put new chip requires power supply requires new pathways built power however number transistors per chip starting increase slower rate therefore power efficiency starting become important important fitting transistors single chip recent processor designs shown emphasis put focus power efficiency rather cramming many transistors single chip possible world embedded computers power efficiency long important goal next throughput latency increases clock frequency grown slowly past years compared power reduction improvements driven end moore law demand longer battery life reductions size mobile technology change focus higher clock rates power consumption miniaturization shown significant reductions power consumption much 50 reported intel release haswell microarchitecture dropped power consumption benchmark 30-40 watts 10-20 watts comparing processing speed increase 3 ghz 4 ghz 2002 2006 seen focus research development shifting away clock frequency moving towards consuming less power taking less space", + "neighbors": [ + 1, + 9, + 14, + 22, + 29, + 37, + 42, + 55, + 58, + 64, + 76, + 78, + 85, + 99, + 105, + 123, + 127, + 134, + 149, + 170, + 171, + 185, + 193, + 206, + 210, + 212, + 224, + 225, + 227, + 230, + 265, + 268, + 270, + 271, + 272, + 282, + 292, + 306, + 313, + 314, + 322, + 331, + 335, + 346, + 353, + 379, + 380, + 387, + 388, + 412, + 429, + 434, + 445, + 457, + 460, + 465, + 508, + 522, + 571, + 583, + 589, + 591, + 643, + 650, + 659, + 664, + 681, + 719, + 720, + 721, + 739, + 752, + 754, + 776, + 789, + 796, + 797, + 803, + 821, + 834, + 846, + 847, + 884, + 891, + 907, + 937, + 954, + 957, + 961, + 966, + 980, + 984, + 994, + 996, + 1002, + 1009, + 1011, + 1012, + 1013, + 1016, + 1022, + 1024, + 1040, + 1044, + 1049, + 1052, + 1053, + 1054, + 1063, + 1076, + 1081, + 1096, + 1111, + 1113, + 1125, + 1138, + 1143, + 1159, + 1174, + 1202, + 1219, + 1220, + 1222, + 1224, + 1256, + 1272, + 1284, + 1290, + 1301, + 1304, + 1319, + 1324, + 1368, + 1372, + 1391, + 1394, + 1415, + 1421, + 1437, + 1441, + 1456, + 1469, + 1477, + 1503, + 1505, + 1507, + 1518, + 1523, + 1525, + 1530, + 1546, + 1549, + 1557, + 1573, + 1578, + 1605, + 1608, + 1610, + 1616, + 1631, + 1632, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1399, + "label": 9, + "text": "Marc_Auslander:marc auslander marc alan auslander american computer scientist known contributions pl/8 compiler spent entire career ibm thomas j. watson research center yorktown heights ny auslander received bachelor arts degree mathematics princeton university 1963 joined ibm year 1991 named ibm fellow retired 2004 continues affiliated ibm fellow emeritus 1996 auslander elected national academy engineering contributions reduced instruction set computing risc systems 1999 named acm fellow ieee fellow contributions risc 1970 1972 auslander served chairman acm sigops authored 19 scientific papers holds 14 u.s. patents", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1400, + "label": 4, + "text": "Ngrep:ngrep ngrep network grep network packet analyzer written jordan ritter command-line interface relies upon pcap library gnu regex library ngrep supports berkeley packet filter bpf logic select network sources destinations protocols also allows matching patterns regular expressions data payload packets using gnu grep syntax showing packet data human-friendly way ngrep open source application source code available download ngrep site sourceforge compiled ported multiple platforms works many unix-like operating systems linux solaris illumos bsd aix also works microsoft windows ngrep similar tcpdump ability look regular expression payload packet show matching packets screen console allows users see unencrypted traffic passed network putting network interface promiscuous mode ngrep appropriate bpf filter syntax used debug plain text protocols interactions like http smtp ftp dns among others search specific string pattern using grep regular expression syntax ngrep also used capture traffic wire store pcap dump files read files generated sniffer applications like tcpdump wireshark ngrep various options command line arguments ngrep man page unix-like operating systems show list available options examples assumed eth0 used network interface ngrep -l -q -d eth0 -i ^get |^post tcp port 80 ngrep -l -q -d eth0 -i user-agent tcp port 80 ngrep -l -q -d eth0 -i udp port 53 capturing raw network traffic interface requires special privileges superuser privileges platforms especially unix-like systems ngrep default behavior drop privileges platforms running specific unprivileged user like tcpdump also possible use ngrep specific purpose intercepting displaying communications another user computer entire network privileged user running ngrep server workstation connected device configured port mirroring switch router gateway connected device used network traffic capture lan man wan watch unencrypted information related login id passwords urls content websites viewed network", + "neighbors": [ + 134, + 138, + 160, + 306, + 425, + 769, + 875, + 961, + 991, + 1138, + 1206, + 1337, + 1395, + 1513, + 1527, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 1401, + "label": 6, + "text": "7-Zip:7-zip 7-zip free open-source file archiver utility used place groups files within compressed containers known archives developed igor pavlov first released 1999 7-zip uses 7z archive format read write several archive formats program used command-line interface command p7zip graphical user interface also features shell integration 7-zip source code gnu lgpl license unrar code however gnu lgpl unrar restriction states developers permitted use code reverse-engineer rar compression algorithm default 7-zip creates 7z-format archives codice_1 file extension archive contain multiple directories files container format security size reduction achieved using stacked combination filters consist pre-processors compression algorithms encryption filters core 7z compression uses variety algorithms common bzip2 ppmd lzma2 lzma developed pavlov lzma relatively new system making debut part 7z format lzma uses lz-based sliding dictionary 4 gb size backed range coder native 7z file format open modular file names stored unicode 2011 toptenreviews found 7z compression least 17 better zip 7-zip site since 2002 reported compression ratio results dependent upon data used tests usually 7-zip compresses 7z format 30\u201370 better zip format 7-zip compresses zip format 2\u201310 better zip-compatible programs 7z file format specification distributed program source code doc subdirectory 7-zip supports number compression non-compression archive formats packing unpacking including zip gzip bzip2 xz tar wim utility also supports unpacking apm arj chm cpio deb flv jar lha/lzh lzma mslz office open xml onepkg rar rpm smzip swf xar z archives cramfs dmg fat hfs iso mbr ntfs squashfs udf vhd disk images 7-zip supports zipx format unpacking support since least version 9.20 released late 2010 7-zip open msi files allowing access meta-files within along main contents microsoft cab lzx compression nsis lzma installer formats opened similarly microsoft executable programs .exes self-extracting archives otherwise contain archived content e.g. setup files may opened archives compressing zip gzip files 7-zip uses deflate encoder may achieve higher compression lower speed common zlib deflate implementation 7-zip deflate encoder implementation available separately part advancecomp suite tools decompression engine rar archives developed using freely available source code unrar program licensing restriction creation rar compressor 7-zip v15.06 later support extraction files rar5 format backup systems use formats supported archiving programs 7-zip e.g. android backups codice_2 format extracted archivers 7-zip 7-zip comes file manager along standard archiver tools file manager toolbar options create archive extract archive test archive detect errors copy move delete files open file properties menu exclusive 7-zip file manager default displays hidden files follow windows explorer policies tabs show name modification time original compressed sizes attributes comments 4dos codice_3 format going one directory root drives removable internal appear going shows list four options 7-zip lzma sdk originally dual-licensed gnu lgpl common public license additional special exception linked binaries december 2 2008 sdk placed igor pavlov public domain two command-line versions provided 7z.exe using external libraries standalone executable 7za.exe containing built-in modules compression/decompression support limited 7z zip gzip bzip2 z tar formats 64-bit version available support large memory maps leading faster compression versions support multi-threading 7za.exe version 7-zip available unix-like operating systems including linux freebsd macos freedos openvms amigaos 4 morphos p7zip project 7-zip supports self-extracting archives including executable installer 7-zip vulnerable arbitrary code execution dll hijacking load run dll named uxtheme.dll folder executable file 7-zip 16.03 release notes say installer sfx modules added protection dll preloading attack versions 7-zip prior 18.05 contain arbitrary code execution vulnerability module extracting files rar archives cve-2018-10115 vulnerability fixed 30 april 2018 snapfiles.com 2012 rated 7-zip 4.5 stars 5 noting interface additional features fairly basic compression ratio outstanding techrepublic 2009 justin james found detailed settings windows file manager integration appreciated called compression-decompression benchmark utility neat though archive dialog settings confound users concluded 7-zip fits nice niche built-in windows capabilities features paid products able handle large variety file formats process 2002 2016 7-zip downloaded 410 million times sourceforge alone software received awards 2007 sourceforge.net granted community choice awards technical design best project 2013 7-zip received tom hardware elite award due superiority speed compression ratio", + "neighbors": [ + 42, + 134, + 326, + 494, + 1138, + 1157, + 1278, + 1318, + 1538, + 1558 + ], + "mask": "Train" + }, + { + "node_id": 1402, + "label": 9, + "text": "Daniel_G._Bobrow:daniel g. bobrow daniel gureasko bobrow 29 november 1935 \u2013 20 march 2017 american computer scientist created oft-cited artificial intelligence program student earned phd. worked bbn technologies bbn research fellow intelligent systems laboratory palo alto research center born new york city earned bs rpi 1957 sm harvard 1958 phd mathematics mit supervision marvin minsky 1964 bbn developer tenex bobrow president american association artificial intelligence aaai chair cognitive science society editor-in-chief journal artificial intelligence shared 1992 acm software systems award work interlisp acm fellow aaai fellow", + "neighbors": [ + 27, + 29, + 46, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 789, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 1403, + "label": 4, + "text": "Uncomplicated_Firewall:uncomplicated firewall uncomplicated firewall ufw program managing netfilter firewall designed easy use uses command-line interface consisting small number simple commands uses iptables configuration ufw available default ubuntu installations 8.04 lts gufw intended easy intuitive graphical user interface managing uncomplicated firewall supports common tasks allowing blocking pre-configured common p2p individual ports gufw designed ubuntu also available debian-based distributions arch linux anywhere python gtk+ ufw available", + "neighbors": [ + 14, + 94, + 134, + 189, + 217, + 476, + 569, + 648, + 656, + 685, + 731, + 842, + 910, + 935, + 961, + 1004, + 1126, + 1138, + 1167, + 1214, + 1225, + 1250, + 1257, + 1406, + 1462, + 1509, + 1514, + 1542, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 1404, + "label": 9, + "text": "Seymour_Papert:seymour papert seymour aubrey papert february 29 1928 \u2013 july 31 2016 south african-born american mathematician computer scientist educator spent career teaching researching mit one pioneers artificial intelligence constructionist movement education co-inventor wally feurzeig cynthia solomon logo programming language born jewish family papert attended university witwatersrand receiving bachelor arts degree philosophy 1949 followed phd mathematics 1952 went receive second doctorate also mathematics university cambridge 1959 supervised frank smithies papert worked researcher variety places including st. john college cambridge henri poincar\u00e9 institute university paris university geneva national physical laboratory london becoming research associate mit 1963 held position 1967 became professor applied math made co-director mit artificial intelligence laboratory founding director professor marvin minsky 1981 also served cecil ida green professor education mit 1974 1981 papert worked learning theories known focusing impact new technologies learning general schools learning organizations particular mit papert went create epistemology learning research group mit architecture machine group later became mit media lab developer theory learning called constructionism built upon work jean piaget constructivist learning theories papert worked piaget university geneva 1958 1963 one piaget prot\u00e9g\u00e9s piaget said one understands ideas well papert papert rethought schools work based theories learning papert used piaget work development logo programming language mit created logo tool improve way children think solve problems small mobile robot called logo turtle developed children shown use solve simple problems environment play main purpose logo foundation research group strengthen ability learn knowledge papert insisted simple language program children learn\u2014like logo\u2014can also advanced functionality expert users part work technology papert proponent knowledge machine one principals one laptop per child initiative manufacture distribute children machine developing nations papert also collaborated construction toy manufacturer lego logo-programmable lego mindstorms robotics kits named groundbreaking 1980 book became political activist opposition parents began anti-apartheid activity says father said know someone talented seymour would throw life away \u2018 schwartzes \u2019 derogatory yiddish expression black people \u201d subsequently chose self exile leading figure revolutionary socialist circle around socialist review living london 1950s papert also prominent activist south african apartheid policies university education papert married dona strauss later androula christofides henriques papert third wife mit professor sherry turkle together wrote influential paper epistemological pluralism revaluation concrete final 24 years papert married suzanne massie russian scholar author pavlovsk life russian palace land firebird papert aged 78 received serious brain injury struck motor scooter 5 december 2006 crossing street colleague uri wilensky attending 17th international commission mathematical instruction icmi study conference hanoi vietnam underwent emergency surgery remove blood clot french hospital hanoi transferred complex operation swiss air ambulance bombardier challenger jet boston massachusetts moved hospital closer home january 2007 developed sepsis damaged heart valve later replaced 2008 returned home could think communicate clearly walk almost unaided still complicated speech problems receipt extensive rehabilitation support rehabilitation team used principles experiential hands-on learning pioneered papert died home blue hill maine july 31 2016 papert work used researchers fields education computer science influenced work uri wilensky design netlogo collaborated study knowledge restructurations well work andrea disessa development dynaturtles 1981 papert along several others logo group mit started logo computer systems inc. lcsi board chair 20 years working lcsi papert designed number award-winning programs including logowriter lego/logo marketed lego mindstorms also influenced research idit harel caperton coauthoring articles book constructionism chairing advisory board company mamamedia also influenced alan kay dynabook concept worked kay various projects papert guggenheim fellowship 1980 marconi international fellowship 1981 software publishers association lifetime achievement award 1994 smithsonian award computerworld 1997 papert called marvin minsky greatest living mathematics educator mit president l. rafael reif summarized papert lifetime accomplishments mind extraordinary range creativity seymour papert helped revolutionize least three fields study children make sense world development artificial intelligence rich intersection technology learning stamp left mit profound today mit continues expand reach deepen work digital learning particularly grateful seymour groundbreaking vision hope build ideas open doors learners ages around world", + "neighbors": [ + 27, + 29, + 46, + 87, + 194, + 251, + 308, + 313, + 332, + 392, + 446, + 447, + 506, + 536, + 565, + 649, + 653, + 753, + 787, + 919, + 929, + 934, + 947, + 978, + 1021, + 1118, + 1119, + 1123, + 1173, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Validation" + }, + { + "node_id": 1405, + "label": 8, + "text": "Masterseek:masterseek masterseek corp. b2b business-to-business search engine founded denmark 1999 masterseek encompasses 175 million business profiles 346 million websites 450 million contacts 216 million linkedin members thus making masterseek largest commercial database world masterseek founded denmark rasmus refer 1999 denmark headquarters located bredgade 29 dk-1260 kbh k also current headquarters new york city 82 wall street according executives masterseek utilizes business model based annual business subscription fee usd 149 return subscribers receive full editing control corporate profile content advertising control widgets embedded video among factors june 2008 accountancy firm horwart international approximated raw market value masterseek company 150 million company remains privately owned also june 2008 sold 10 authorized stocks range foreign investors company announced january 31 2009 company offering limited number shares sale order raise 4\u20136 million order gain listing swedish marketplace aktietorget founder refer also announced plans ipo october 2009 signed swedish-based company thenberg kinde fondkommission ab financing july 11 2016 masterseek announced company planning getting listed nasdaq listing nasdaq provide capital expansion rapidly growing markets latin america africa asia doney law firm assisting listing nasdaq capital market june 2008 company stated 50 million company profiles 75 countries handled 90,000 b2b searches daily company stated 82 million profiles march 21 2011 average 300,000 new profiles added monthly 2017 company stated 178 million company profiles october 30 2008 announced masterseek acquired b2b search engine accoona search engine fairly successful united states china exclusive partnership china daily august 3 2006 time dubbed accoona one 50 best websites illustrating search engine used artificial intelligence understand meaning keyword queries accoona run difficulties gone defunct early october 2008 withdrawing ipo making possible masterseek acquire data technology masterseek bought remaining search engine codes domain name assets accoona integrated masterseek re-launched usa china launched europe january 2009 accoona information also integrated masterseek search engine masterseek search engine relies web crawlers automatically collect sort company details internet searches look company profiles contact information descriptions products services searches global national regional involved local markets hits listed relevance according search terms different search options including specific product search company searches people searches results displayed languages search engine also offers masterrank point system ranking corporate websites july 5 2007 masterseek announced cosponsors team csc denmark cycling team beginning team involvement tour de france masterseek name began displayed team apparel week tour start london global investor alerts issued public warning alerting masterseek corp. cold-calling potential customers offering unauthorised illegal financial services also multiple reports masterseek engine crawling profiles individuals illegally violating privacy fair use policies services like linkedin create publicly publish profiles individuals without consent providing control editing profiles owners profiles thus violating civil criminal laws multiple jurisdictions around world", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1406, + "label": 4, + "text": "Norton_360:norton 360 norton 360 developed symantec \u201c all-in-one \u201d security suite combined online protection performance tuning thing distinguished suite norton internet security inclusion optimization problem-solving tools norton 360 distributed boxed copy download preinstalled computers oem software norton 360 discontinued cut overhauled norton line mid-2014 features carried successor norton security symantec announced project genesis february 7 2006 genesis would differ symantec consumer security products incorporating file backup performance optimization tools antivirus capabilities firewall phishing protection real-time heuristics also planned windows vista compatibility major aspect genesis genesis slated release september may 2005 microsoft announced windows live onecare security suite similar functionalities slated release 2006 genesis renamed norton 360 may 31 2006 feature set confirmed\u2014it would functionalities norton internet security\u2014with file backup performance tools phishing protection real-time heuristics public beta test planned summer 2006 final release date set end 2006 day mcafee announced falcon security suite similar functionalities norton 360 onecare however dates delayed onecare launched summer 2006 falcon entered public beta testing viewed norton 360 response microsoft antivirus software onecare however release onecare saw symantec lagging behind rivals mark bregman symantec vice president claimed upcoming norton 360 intended compete onecare stating somehow left wrong impression market place windows live onecare microsoft falcon mcafee nothing symantec first public beta delivered november 2006 compatible windows xp second beta subsequently released december 20 2006 adding compatibility windows vista build 6000 100,000 people tested software symantec began distribution retailers february 2007 version 1.0 released february 26 2007 version first symantec product use sonar detect zero-day viruses monitors applications malicious behavior taking action needed backup restore functionality allowed users back files online hard drive cd dvd performance optimization tools allowed users clear web browser history temporary files disk defragmenter bundled part optimization tools phishing protection integrates internet explorer warning users fraudulent sites windows xp 300 megahertz processor 256 megabytes ram 300 mb hard disk space required vista 800 mhz processor 512 mb ram 300 mb hard disk space required reviews cited norton 360 low resource usage relative norton internet security 2007 phishing protection pc magazine found phishing protection feature effective blocking access fraudulent sites internet explorer 7 firefox 2 however reviewers highlighted lack manual control advanced users cnet noted lack phishing protection browsers internet explorer mozilla firefox cnet also highlighted lack wireless network tools notifying users someone uninvited joins network help encrypting wireless signals pc magazine criticized antispam filter version 1.0 finding blocked half spam mail five percent false positive rate version 2.0 released march 3 2008 backup feature inscribe data blu-ray hd dvd discs multiple installations norton 360 also managed centralized location backing files online user control amount bandwidth norton uses registry cleaner bundled performance tools allowing user remove invalid entries phishing protection firefox added supplementing phishing protection norton identity safe stores login credentials websites network map allows users view status norton installations networked computers view basic information computer system requirements remain version 1.0 pc magazine found spam filter inaccurate 25 percent false positive rate cnet encountered problems installing version 2.0 legacy machines version 3.0 released march 4 2009 version uses codebase norton internet security 2009 earlier versions symantec rewrote code specifically norton 360 version 3.0 incorporates norton safe web offered standalone service earlier safe web integrates firefox internet explorer toolbar blocking access fraudulent malware hosting sites toolbar also includes search box routing search queries typed box ask.com search engine toolbar share code ask.com toolbar classified spyware mcafee trend micro antivirus vendors due criticism search functionality symantec announced ask.com search box would hidden future releases version 3.0 capability back files flash drive introduced release files stored flash drive copied another computer without norton 360 installed norton also creates virtual drive windows explorer allowing users browse backup files stored locally online users restore individual files using drag-and-drop technique version 3.0 retain previous versions files skips files open another program startup application manager included release allowing users control programs start login complement application manager norton measure impact programs login time pc magazine highlighted version 3.0 inaccurate spam filter misfiling half valid mail spam pc magazine also noted support session symantec technician used shareware application malwarebytes anti-malware remove malware computer referring online norton program controversy raised fact technician misleadingly referred program symantec product version 4.0 released february 17 2010 version adds many new security features found norton internet security 2010 version 4 also features gui change prominent colors match gold black sunburst norton internet security widely criticized antispam replaced far effective brightmail according symantec gives 20 better results require training version 5.0 released february 2011 offers improved performance virus detection also provides updated versions sonar version 3 system insight download insight supports internet explorer firefox browsers also supports following clients qq chat msn messenger chat limewire p2p msn explorer browser e-mail chat opera browser outlook e-mail thunderbird e-mail windows mail e-mail chrome browser bittorrent p2p aol browser yahoo messenger chat safari browser filezilla file manager outlook express e-mail features new enhanced interface realistic icons animations also includes norton widgets platform integrates symantec online services directly ui also new version reputation scan gives user clear insight loaded applications files safeweb facebook scans links wall verify safety links norton recovery tools added scanner interface start menu folder help restoring highly infected system backup restore functionality also improved passmark performance test 011 rated norton 360 5.0 fastest lightest all-in-one suite featured metered broadband modes easily remembers logins personal info protecting online identity theft version norton released september 5 2012 together newest norton antivirus norton internet security products described version-less symantec press release alluding automatic updates always keep software latest version specific version reference anywhere description software software compatible windows 8 version norton 360 features enhancements social networking protection anti-scam capabilities stronger networking defenses norton also introduced extra tune disk optimizer version 21 norton security suite released september 4 2013 together newest norton antivirus norton internet security products norton 360 antivirus solution developed sonar technology claims able detect threat block remove thanks three five layers shields threat monitoring threat removal network defense last one dealing online threats actually reach user \u2019 computer protection also granted analyzing behavior known menaces another important aspect derives stealth capabilities five shields work silently background performing scans updates back-ups automatically need whatsoever care important files browser protection download insight keen eye dangerous applications warning user eventual threats running computer version 22 released september 22 2014 release marketed norton security 2015 however norton 360 users able update v22 even norton retiring norton 360 brand appearance software identical norton security 2015 except product name top-left corner april 2019 symantec released new norton 360 emphasis new old legacy norton 360 remains retired product new norton 360 step norton security basically got replaced new product main change reflects besides security protection norton 360 provides secure vpn online privacy dark web monitoring powered lifelock safecam help block pc webcam takeovers new norton 360 comes several editions two standalone three bundle lifelock options norton 360 available norton 360 standard norton 360 premier edition norton 360 multi-device premier edition functions standard edition difference comes 25 gb online storage versus 2 gb included standard edition norton 360 multi-device actually three products one subscription norton 360 premier edition norton internet security mac\u00ae norton mobile security comparison norton 360 editions norton one shows features os coverage norton 360- gold edition credit card type 5 unique sets alpha-numeric key data reverse sold instructions go online install installation page norton 360 software sold purchased subscription stated period e.g one year software e.g firewall antivirus automatically disabled end subscription period unless new subscription purchased special edition norton 360 premier edition branded norton security suite available free pc customers comcast xfinity internet service difference norton 360 premier edition norton security suite latter include online storage feature norton internet security mac also available free comcast xfinity customers major version updates norton security suite typically occur 1 month norton 360 windows 8 consumer preview released february 29 2012 symantec announced norton antivirus internet security well newest norton 360 version 6 compatible windows 8 symantec compliance fbi whitelisted magic lantern keylogger developed fbi purpose magic lantern obtain passwords encrypted e-mail part criminal investigation magic lantern first reported media bob sullivan msnbc november 20 2001 ted bridis associated press magic lantern deployed e-mail attachment attachment opened trojan horse installed suspect computer trojan horse activated suspect uses pgp encryption often used increase security sent e-mail messages activated trojan horse log pgp password allows fbi decrypt user communications symantec major antivirus vendors whitelisted magic lantern rendering antivirus products including norton internet security incapable detecting magic lantern concerns include uncertainties magic lantern full potential whether hackers could subvert purposes outside jurisdiction law graham cluley technology consultant sophos said way knowing written fbi even \u2019 know whether used fbi commandeered third party another reaction came marc maiffret chief technical officer cofounder eeye digital security customers paying us service protect forms malicious code us law enforcement job make exceptions law enforcement malware tools fbi spokesman paul bresson response magic lantern needed court order deploy like technology projects tools deployed fbi would used pursuant appropriate legal process proponents magic lantern argue technology would allow law enforcement efficiently quickly decrypt messages protected encryption schemes implementing magic lantern require physical access suspect computer unlike carnivore predecessor magic lantern since physical access computer would require court order norton internet security windows versions criticized uninstalling completely leaving unnecessary files registry entries versions prior 3.0 also installed separate liveupdate program updates norton-branded software user must uninstall norton internet security liveupdate component manually liveupdate component purposely left behind update norton-branded products present symantec developed norton removal tool remove registry keys values along files folders uninstaller must run twice initially computer restart requiring second restart uninstallation remove subscription data preserved prevent users installing multiple trial copies norton 360 version 2.0 installed users encountered incompatibilities upgrading windows xp service pack 3 windows vista service pack 1 users report numerous invalid windows registry keys added tool named fixcss.exe resulting empty device manager missing devices wireless network adapters symantec initially blamed microsoft incompatibilities since accepted partial responsibility dave cole senior director product management acknowledged users running norton products experiencing problems said numbers small cole also said symantec done extensive testing products windows xp sp3 issue encountered cole blamed microsoft related xp sp3 microsoft recommended users contact windows customer support resolve problem symantec issued fix intended users upgrading symantec also recommends disabling tamper protection component 2008 release dubbed symprotect tool remove added registry entries available symantec sarah hicks symantec vice president consumer product management voiced concern windows vista 64-bit patchguard feature patchguard designed microsoft ensure integrity kernel part operating system interacts hardware rootkits may hide operating system kernel complicating removal mike dalton european president mcafee said decision build wall around kernel assumption ca n't breached ridiculous claiming microsoft preventing security vendors effectively protecting kernel promoting security product windows live onecare hicks said symantec mind competition onecare symantec later published white paper detailing patchguard instructions obtain patchguard exploit negotiations investigations antitrust regulators microsoft decided allow security vendors access kernel creating special api instructions norton 360 comes one-year subscription activated upon installation valid three home computers expiration subscription blocks access program updates shuts antivirus firewall well tools bundled password manager user saved passwords also inaccessible users often understand completely exposed pcs become infected viruses", + "neighbors": [ + 17, + 94, + 120, + 134, + 189, + 217, + 358, + 359, + 476, + 569, + 576, + 648, + 656, + 685, + 731, + 842, + 910, + 938, + 961, + 1138, + 1250, + 1257, + 1289, + 1291, + 1376, + 1379, + 1403, + 1462, + 1514, + 1542, + 1568 + ], + "mask": "Train" + }, + { + "node_id": 1407, + "label": 5, + "text": "GNUMail:gnumail gnumail free open-source cross-platform e-mail client based gnustep cocoa official mail client gnustep also used \u00e9toil\u00e9 inspired nextmail next mail.app predecessor apple mail gnumail based mail handling framework pantomime furthermore gnumail demonstrates possible develop cross platform programs gnustep cocoa", + "neighbors": [ + 99, + 258, + 312, + 796, + 886, + 1100, + 1138, + 1189, + 1190, + 1210, + 1339, + 1395, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1408, + "label": 5, + "text": "SPDY:spdy spdy pronounced speedy deprecated open-specification networking protocol developed primarily google transporting web content spdy manipulates http traffic particular goals reducing web page load latency improving web security spdy achieves reduced latency compression multiplexing prioritization although depends combination network website deployment conditions name spdy trademark google acronym throughout process core developers spdy involved development http/2 including mike belshe roberto peon february 2015 google announced following recent final ratification http/2 standard support spdy would deprecated support spdy would withdrawn google removed spdy support google chrome 51 mozilla removed firefox 50 apple deprecated technology macos 10.14.4 ios 12.2. group developing spdy stated publicly working toward standardisation available internet draft first draft http/2 used spdy working base specification draft editing implementations spdy exist chromium mozilla firefox opera amazon silk internet explorer safari implementations chromium firefox open source software february 2015 google announced plans remove support spdy favor http/2 http/2 first discussed became apparent spdy gaining traction implementers like mozilla nginx showing significant improvements http/1.x call proposals selection process spdy chosen basis http/2 since number changes based discussion working group feedback implementers february 11 2016 google announced chrome would longer support spdy npn may 15 2016 anniversary rfc 7540 january 25 2019 apple announced spdy would deprecated favor http/2 would removed future releases goal spdy reduce web page load time achieved prioritizing multiplexing transfer web page subresources one connection per client required tls encryption nearly ubiquitous spdy implementations transmission headers gzip- deflate-compressed design contrast http headers sent human-readable text moreover servers may hint even push content instead awaiting individual requests resource web page spdy requires use ssl/tls tls extension alpn security also supports operation plain tcp requirement ssl security avoid incompatibility communication across proxy spdy replace http modifies way http requests responses sent wire means existing server-side applications used without modification spdy-compatible translation layer put place spdy effectively tunnel http https protocols sent spdy http requests processed tokenized simplified compressed example spdy endpoint keeps track headers sent past requests avoid resending headers changed must sent compressed ietf working group httpbis released draft http/2 spdy draft-mbelshe-httpbis-spdy-00 chosen starting point use within https spdy needs tls extension next protocol negotiation npn thus browser server support depends https library openssl 1.0.1 greater introduces npn patches add npn support also written nss tlslite spdy scheduled switch npn application-layer protocol negotiation alpn end 2014 security support provider interface sspi microsoft implemented npn extension tls implementation prevented spdy inclusion latest .net framework versions since spdy specification refined http/2 expected include spdy implementation one could expect microsoft release support http/2 finalized spdy versioned protocol control frames 15 dedicated bits indicate version session protocol approximately 7.1 websites support spdy fielded versions two popular web servers nginx apache major providers spdy traffic although latest version nginx removed spdy support compares adoption rate 8.1 newer http/2 protocol overtaken adoption spdy google services e.g google search gmail ssl-enabled services use spdy available google ads also served spdy-enabled servers brief history spdy support amongst major web players according w3techs spdy-enabled websites use nginx litespeed web server coming second", + "neighbors": [ + 52, + 83, + 95, + 109, + 258, + 277, + 311, + 425, + 430, + 442, + 444, + 455, + 470, + 473, + 509, + 530, + 531, + 539, + 542, + 543, + 582, + 623, + 668, + 672, + 678, + 684, + 731, + 732, + 757, + 764, + 769, + 770, + 771, + 779, + 833, + 858, + 886, + 939, + 953, + 1033, + 1058, + 1116, + 1132, + 1166, + 1195, + 1206, + 1210, + 1228, + 1280, + 1326, + 1329, + 1378, + 1386, + 1395, + 1410, + 1423, + 1438, + 1443, + 1448, + 1452, + 1453, + 1550, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1409, + "label": 2, + "text": "Scott_Forstall:scott forstall scott forstall born 1969 american software engineer best known leading original software development team iphone ipad broadway producer best known co-producing tony award-winning fun home eclipsed wife spent career first next apple senior vice president svp ios software apple inc. 2007 october 2012 forstall grew middle-class family kitsap county washington second-born three boys registered-nurse mother jeanne engineer father tom forstall older brother bruce also senior software design engineer microsoft gifted student skills programming came easily difficult others forstall qualified advanced-placement science math class junior high school gained experience programming apple iie computers skipped forward year entering olympic high school bremerton washington early classmates recall immersion competitive chess history general knowledge occasion competing state level achieved 4.0 gpa earned position valedictorian position shared classmate molly brown would later become wife established goal designer high-tech electronics equipment proclaimed interview local newspaper enrolling stanford university graduated 1991 degree symbolic systems next year received master degree computer science also stanford time stanford forstall member phi kappa psi fraternity forstall joined steve jobs next 1992 stayed purchased apple 1997 forstall placed charge designing user interfaces reinvigorated macintosh line 2000 forstall became leading designer mac new aqua user interface known water-themed visual cues translucent icons reflections making rising star company promoted svp january 2003 period supervised creation safari web browser melton senior developer safari team credited forstall willing trust instincts team respecting ability develop browser secret 2005 jobs began planning iphone choice either shrink mac would epic feat engineering enlarge ipod jobs favored former approach pitted macintosh ipod team led forstall tony fadell respectively internal competition forstall fierce competition create ios decision enabled success iphone platform third-party developers using well-known desktop operating system basis allowed many third-party mac developers write software iphone minimal retraining forstall also responsible creating software developer kit programmers build iphone apps well app store within itunes 2006 forstall became responsible mac os x releases avie tevanian stepped company chief software technology officer named svp iphone software forstall received credit ran ios mobile software team like clockwork widely respected ability perform pressure spoken publicly apple worldwide developers conferences including talks mac os x leopard 2006 iphone software development 2008 later release iphone os 2.0 iphone 3g january 27 2010 apple 2010 ipad keynote wwdc 2011 forstall introduced ios 5 forstall also appears ios 5 video narrating three-quarters clip almost every major apple ios special event let talk iphone event launching iphone 4s took stage demonstrate phone siri voice recognition technology originally developed sri international aftermath release ios 6 september 19 2012 proved troubled period apple newly introduced maps application completely designed in-house apple criticized underdeveloped buggy lacking detail addition clock app used design based trademarked swiss railway clock apple failed license forcing apple pay swiss railways reported 21 million compensation october apple reported third-quarter results revenues profits grew less predicted second quarter row company missed analysts expectations october 29 2012 apple announced press release scott forstall leaving apple 2013 serve advisor ceo tim cook interim forstall duties divided among four apple executives design svp jonathan ive assumed leadership apple human interface team craig federighi became new head ios software engineering services chief eddy cue took responsibilities maps siri bob mansfield previously svp hardware engineering unretired oversee new technology group day john browett svp retail dismissed immediately six months job neither forstall apple executive commented publicly departure beyond initial press statement generally presumed forstall left position involuntarily information reasons departure therefore come anonymous sources cook aim since becoming ceo reported building culture harmony meant weeding people disagreeable personalities\u2014people jobs tolerated even held close like forstall although former apple senior engineer michael lopp believes apple ability innovate came tension disagreement steve jobs referred decider final say products features ceo reportedly keeping strong personalities apple check always casting winning vote last word jobs death many executive conflicts became public forstall poor relationship ive mansfield could meeting unless cook mediated reportedly forstall ive cooperate level forced choose two cook reportedly chose retain ive since forstall collaborative forstall close referred mini-steve jobs jobs death left forstall without protector forstall also referred ceo-in-waiting fortune magazine book inside apple written adam lashinsky profile made unpopular apple forstall said responsible departure jean-marie hullot cto applications 2005 tony fadell svp hardware engineering 2008 fadell remarked interview bbc forstall firing justified got deserved jon rubinstein fadell predecessor svp hardware also strained relationship forstall jobs death 2011 reported forstall trying gather power challenge cook siri intelligent personal voice assistant forstall introduced september 2011 received mixed reception observers regarding flop forstall vigorously criticized new maps app introduced ios 6 received criticism inaccuracies apple standards according adam lashinsky fortune apple issued formal apology errors maps forstall refused sign long-standing practice apple forstall directly responsible individual maps refusal sign apology convinced cook forstall go forstall skeuomorphic design style strongly advocated former ceo steve jobs reported also controversial divided apple design team 2012 interview ive head hardware design refused comment ios user interface terms elements 're talking 'm really connected forstall make public appearances departure apple number years report december 2013 said concentrating travel advising charities providing informal advice small companies april 17 2015 forstall made first tweet revealed co-producer broadway version musical fun home first public appearance since departing apple 2012 june 7 2015 forstall-produced musical five awards tonys forstall reportedly working advisor snap inc. june 20 2017 forstall gave first public interview leaving apple interviewed computer history museum john markoff creation iphone 10th anniversary sales launch", + "neighbors": [ + 33, + 71, + 75, + 87, + 99, + 121, + 130, + 214, + 228, + 269, + 345, + 356, + 395, + 403, + 477, + 511, + 551, + 596, + 610, + 625, + 634, + 696, + 797, + 810, + 858, + 877, + 917, + 927, + 945, + 956, + 1100, + 1178, + 1237, + 1262, + 1292, + 1305, + 1334, + 1373, + 1488, + 1496, + 1544, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1410, + "label": 5, + "text": "Link_layer:link layer computer networking link layer lowest layer internet protocol suite networking architecture internet described rfc 1122 rfc 1123 link layer group methods communications protocols operate link host physically connected link physical logical network component used interconnect hosts nodes network link protocol suite methods standards operate adjacent network nodes local area network segment wide area network connection despite different semantics layering tcp/ip osi link layer sometimes described combination data link layer layer 2 physical layer layer 1 osi model however layers tcp/ip descriptions operating scopes application host-to-host network link detailed prescriptions operating procedures data semantics networking technologies rfc 1122 exemplifies local area network protocols ethernet ieee 802 framing protocols point-to-point protocol ppp belong link layer local area networking standards ethernet ieee 802 specifications use terminology seven-layer osi model rather tcp/ip model tcp/ip model general consider physical specifications rather assumes working network infrastructure deliver media level frames link therefore rfc 1122 rfc 1123 definition tcp/ip model discuss hardware issues physical data transmission set standards aspects textbook authors supported interpretation physical data transmission aspects part link layer others assumed physical data transmission standards considered communication protocols part tcp/ip model authors assume hardware layer physical layer link layer several adopt osi term data link layer instead link layer modified description layering predecessor tcp/ip model arpanet reference model rfc 908 1982 aspects link layer referred several poorly defined terms network-access layer network-access protocol well network layer next higher layer called internetwork layer modern text books network-interface layer host-to-network layer network-access layer occur synonyms either link layer data link layer often including physical layer link layer tcp/ip model descriptive realm networking protocols operate local network segment link host connected protocol packets routed networks link layer includes protocols define communication local on-link network nodes fulfill purpose maintaining link states local nodes local network topology usually use protocols based framing packets specific link types core protocols specified internet engineering task force ietf layer address resolution protocol arp reverse address resolution protocol rarp neighbor discovery protocol ndp facility delivering similar functionality arp ipv6 since advent ipv6 open shortest path first ospf considered operate link level well although ipv4 version protocol considered internet layer is-is rfc 1142 another link-state routing protocol fits layer considering tcp/ip model however developed within osi reference stack layer 2 protocol internet standard link layer tcp/ip model often compared directly combination data link layer physical layer open systems interconnection osi protocol stack although congruent degree technical coverage protocols identical link layer tcp/ip still wider scope principle different concept terminology classification may observed certain protocols address resolution protocol arp confined link layer tcp/ip model often said fit osi data link layer network layer general direct strict comparisons avoided layering tcp/ip principal design criterion general considered harmful rfc 3439 another term sometimes encountered network access layer tries suggest closeness layer physical network however use misleading non-standard since link layer implies functions wider scope network access important link layer protocols used probe topology local network discover routers neighboring hosts i.e functions go well beyond network access", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 856, + 1042, + 1116, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1438, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 1411, + "label": 2, + "text": "Android_Eclair:android eclair android eclair codename android mobile operating system developed google fifth operating system android longer supported versions 2.0 2.1 unveiled october 26 2009 android 2.1 builds upon significant changes made android 1.6 donut default home screen eclair displays persistent google search bar across top screen camera app also redesigned numerous new camera features including flash support digital zoom scene mode white balance color effect macro focus photo gallery app also contains basic photo editing tools version also included addition live wallpapers allowing animation home-screen background images show movement speech-to-text first introduced replacing comma key android eclair inherits platform additions donut release ability search saved sms mms messages improved google maps 3.1.2 exchange support email app operating system also provides improved typing speed virtual keyboard along new accessibility calendar virtual private network apis internet browsing android eclair also adds support html5 refreshed browser ui bookmark thumbnails double-tap zoom", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1412, + "label": 3, + "text": "Bomberman_(1983_video_game):bomberman 1983 video game nes/famicom release eponymous character bomberman robot must find way maze avoiding enemies doors leading maze rooms found rocks bomberman must destroy bombs items help improve bomberman bombs fire ability improves blast range bombs bomberman turn human escapes reaches surface game 50 levels total original home computer games basic different rules bomberman written 1980 purely serve tech demo hudson soft basic compiler basic version game given small-scale release japanese pcs 1983 european pcs following year bomberman known nes/famicom version released japan december 19 1985 north america 1987 hudson soft director research development shinichi nakamoto commented 1995 interview personally believe famicom version bomberman one version game version ported back msx following year bomberman special bomberman appearance game hudson soft re-used enemy graphic taken 1984 nes/famicom port broderbund lode runner early version bomberman famous design robotic anime-like character pink antenna game also released game boy game b mode game atomic punk 2004 version bomberman re-released game boy advance part famicom mini series japan classic nes series north america europe released year n-gage remake/update also released sony playstation entitled bomberman japan europe renamed bomberman party edition us version features port original version single-player game well revised updated version pre-rendered 3d graphics contemporary audio updated graphics audio also used multiplayer aspect game", + "neighbors": [ + 1281 + ], + "mask": "Test" + }, + { + "node_id": 1413, + "label": 9, + "text": "GNU_Guile:gnu guile gnu ubiquitous intelligent language extensions gnu guile preferred extension language system gnu project features implementation programming language scheme first version released 1993 addition large parts scheme standards guile scheme includes modularized extensions many different programming tasks extending programs guile offers libguile allows language embedded programs integrated closely c language application programming interface api similarly new data types subroutines defined c api made available extensions guile guile used programs gnucash lilypond gnu guix guix system distribution guixsd gnu debugger guile scheme general-purpose high-level programming language whose flexibility allows expressing concepts fewer lines code would possible languages c. example hygienic macro system allows adding domain specific syntax-elements without modifying guile guile implements scheme standard r5rs r6rs several scheme requests implementation srfi many extensions core idea guile scheme developer implements critical algorithms data structures c c++ exports functions types use interpreted code application becomes library primitives orchestrated interpreter combining efficiency compiled code flexibility interpretation thus guile scheme languages implemented guile extended new data types subroutines implemented c api standard distribution offers modules portable operating system interface posix system calls scheduling foreign function interface s-expression based xml processing sxml sxpath sxslt http world wide web apis delimited continuations array programming functionality guile programs use facilities slib portable scheme library using continuations call/cc requirement scheme standard guile copies execution stack heap back foreign code may pointers scheme objects guile uses conservative boehm\u2013demers\u2013weiser bdw garbage collector guile manual gives details inception early history language brief summary follows success emacs free software community highly extensible customizable application via extension partly implementation language emacs lisp community began consider design strategy could apply rest gnu system tom lord initially began work embeddable language runtime named gnu extension language gel based aubrey jaffer scheme implementation scm turn based george carrette siod lord convinced richard stallman make gel official extension language gnu project based argument scheme cleaner lisp dialect emacs lisp gel could evolve implement languages runtime namely emacs lisp lord discovered gel naming conflict another programming language solicited suggestions new name several contributions several usenet newsgroups lord controversially chose guile suggestion lee thomas development guile gel public release extension language tcl gaining popularity pushed universal extension language stallman saw tcl underpowered extension language posted criticism comp.lang.tcl newsgroup initiated flamewar known tcl war since public announcement guile project coincided tcl debate become common misconception guile began reaction initial release guile development languished many years 2009\u20132010 saw major improvements guile 2.0 released 2011 new compiler infrastructure virtual machine implementation switch boehm\u2013demers\u2013weiser garbage collector many improvements guile scheme language major changes one goals guile allow languages used alongside scheme guile would effectively language-neutral runtime environment various attempts made past versions dialect scheme essentially differing c-like syntax translation emacs lisp tcl converter motivated tkwww something roughly resembling language logo version 2.0 project successfully transitioned compiler tower approach allowing definition compilers one language another typically higher-level one lower-level intermediate representation eventually virtual machine bytecode native machine code several past unfinished attempts replace supplement emacs emacs lisp elisp extension language guile parallel efforts supporting languages guile version 2.0 guile new attempt implementing elisp guile compiler tower replacing emacs elisp implementation libguile begun made significant progress google summer code projects guile-based emacs could offer better execution performance emacs lisp support new emacs lisp language features easily make guile libraries written programming languages available emacs lisp code allow writing emacs extensions programming languages supported guile remaining fully backward compatible existing emacs lisp code bases implementation reached stage guile emacs able reliably run emacs lisp code remaining problems possible problems involve different internal representation emacs lisp strings scheme strings difference emacs lisp scheme treat boolean false empty list objects emacs lisp macros integrating scheme emacs lisp designed concurrency portability guile platforms supported emacs concerns raised emacs community include relative sizes emacs guile communities whether would cause splitting community emacs extensible programming languages emacs lisp", + "neighbors": [ + 14, + 27, + 46, + 56, + 69, + 117, + 134, + 173, + 194, + 203, + 209, + 251, + 292, + 301, + 306, + 308, + 313, + 323, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 806, + 825, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1044, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1190, + 1207, + 1233, + 1245, + 1251, + 1277, + 1298, + 1315, + 1319, + 1375, + 1385, + 1389, + 1402, + 1404, + 1430, + 1437, + 1466, + 1509, + 1511, + 1516, + 1536, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1414, + "label": 9, + "text": "Compile_time:compile time computer science compile time refers either operations performed compiler compile-time operations programming language requirements must met source code successfully compiled compile-time requirements properties program reasoned compilation compile time refers time duration statements written programming language checked errors operations performed compile time usually include syntax analysis various kinds semantic analysis e.g. type checks instantiation template code generation programming language definitions usually specify compile time requirements source code must meet successfully compiled example languages may stipulate amount storage required types variables deduced properties program reasoned compile time include range-checks e.g. proving array index exceed array bounds deadlock freedom concurrent languages timings e.g. proving sequence code takes allocated amount time compile time occurs link time output one compiled files joined together runtime program executed programming languages may necessary compilation linking occur runtime trade-off compile-time link-time many compile time operations deferred link-time without incurring extra run-time compile time also refer amount time required compilation", + "neighbors": [ + 292, + 378, + 386, + 412, + 503, + 659, + 754, + 846, + 1009, + 1044, + 1120, + 1183, + 1225, + 1227, + 1231, + 1372, + 1477, + 1511 + ], + "mask": "Validation" + }, + { + "node_id": 1415, + "label": 2, + "text": "User_space:user space modern computer operating system usually segregates virtual memory kernel space user space primarily separation serves provide memory protection hardware protection malicious errant software behaviour kernel space strictly reserved running privileged operating system kernel kernel extensions device drivers contrast user space memory area application software drivers execute term userland user space refers code runs outside operating system kernel userland usually refers various programs libraries operating system uses interact kernel software performs input/output manipulates file system objects application software etc user space process normally runs virtual memory space unless explicitly allowed access memory processes basis memory protection today mainstream operating systems building block privilege separation separate user mode also used build efficient virtual machines \u2013 see popek goldberg virtualization requirements enough privileges processes request kernel map part another process memory space case debuggers programs also request shared memory regions processes although techniques also available allow inter-process communication common way implementing user mode separate kernel mode involves operating system protection rings another approach taken experimental operating systems single address space software rely programming language semantics make sure arbitrary memory accessed \u2013 applications simply acquire references objects allowed access approach implemented jxos unununium well microsoft singularity research project", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 63, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 219, + 234, + 265, + 270, + 272, + 294, + 301, + 305, + 322, + 326, + 333, + 353, + 359, + 365, + 379, + 380, + 387, + 400, + 401, + 412, + 413, + 431, + 434, + 465, + 477, + 553, + 571, + 583, + 630, + 650, + 664, + 688, + 695, + 720, + 721, + 728, + 736, + 754, + 797, + 860, + 884, + 891, + 897, + 935, + 941, + 954, + 957, + 961, + 966, + 986, + 992, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1055, + 1057, + 1058, + 1060, + 1063, + 1064, + 1105, + 1126, + 1138, + 1155, + 1187, + 1190, + 1197, + 1202, + 1208, + 1224, + 1241, + 1252, + 1287, + 1301, + 1304, + 1310, + 1322, + 1357, + 1360, + 1361, + 1369, + 1391, + 1394, + 1397, + 1398, + 1441, + 1456, + 1468, + 1474, + 1494, + 1526, + 1530, + 1539, + 1546, + 1552, + 1578, + 1601, + 1602, + 1610, + 1616, + 1631, + 1636, + 1637, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 1416, + "label": 8, + "text": "Web_service:web service term web service ws either web service web technology http \u2014 originally designed human-to-machine communication \u2014 used transferring machine-readable file formats xml json practice web service commonly provides object-oriented web-based interface database server utilized example another web server mobile app provides user interface end user many organizations provide data formatted html pages also provide data server xml json often web service allow syndication example wikipedia another application offered end user may mashup web server consumes several web services different machines compiles content one user interface asynchronous javascript xml ajax dominant technology web services developing combination http servers javascript clients plain old xml distinct soap w3c web services frequently used json well instead xml representational state transfer rest architecture well-behaved web services function internet scale 2004 document w3c sets following rest key distinguishing feature web services number web services use markup languages web api development web services emphasis moving simpler representational state transfer rest based communications restful apis require xml-based web service protocols soap wsdl support interfaces relation w3c web services w3c defined web service w3c web services may use soap http protocol allowing less costly efficient interactions internet via proprietary solutions like edi/b2b besides soap http web services also implemented reliable transport mechanisms like ftp 2002 document web services architecture working group defined web services architecture requiring standardized implementation web service term web service describes standardized way integrating web-based applications using xml soap wsdl uddi open standards internet protocol backbone xml data format used contain data provide metadata around soap used transfer data wsdl used describing services available uddi lists services available web service method communication two electronic devices network software function provided network address web service always concept utility computing many organizations use multiple software systems management different software systems often need exchange data web service method communication allows two software systems exchange data internet software system requests data called service requester whereas software system would process request provide data called service provider different software may use different programming languages hence need method data exchange n't depend upon particular programming language types software however interpret xml tags thus web services use xml files data exchange rules communication different systems need defined rules communication defined file called wsdl web services description language codice_1 extension proposals autonomous web services aws seek develop flexible web services rely strict rules directory called uddi universal description discovery integration defines software system contacted type data one software system needs one particular report/data would go uddi find systems contact receiving data software system finds systems contact would contact system using special protocol called soap simple object access protocol service provider system would first validate data request referring wsdl file process request send data soap protocol automated tools aid creation web service services using wsdl possible either automatically generate wsdl existing classes bottom-up model generate class skeleton given existing wsdl top-down model critics non-restful web services often complain complex based upon large software vendors integrators rather typical open source implementations also concerns performance due web services use xml message format soap/http enveloping transporting functional non-functional testing web services done help wsdl parsing regression testing performed identifying changes made upgrade software web service regression testing needs categorized three different ways namely changes wsdl changes code selective re-testing operations capture three needs three intermediate forms subset wsdl namely difference wsdl dwsdl unit wsdl uwsdl reduced wsdl rwsdl respectively three subset wsdls combined form combined wsdl cwsdl used regression testing web service help automated web service change management awscm performing selection relevant test cases construct reduced test suite old test suite web services testing also automated using several test automation tools like soap ui oracle application testing suite oats unified functional testing selenium etc work related capture visualization changes made web service visualization computation changes done form intermediate artifacts subset wsdl insight computation change impact helpful testing top-down development reduce regression testing awscm tool identify subset operations wsdl file construct subset wsdl", + "neighbors": [ + 14, + 16, + 25, + 124, + 168, + 175, + 405, + 415, + 480, + 505, + 517, + 576, + 582, + 684, + 712, + 771, + 824, + 847, + 968, + 1019, + 1084, + 1112, + 1130, + 1159, + 1235, + 1417, + 1431, + 1448, + 1470, + 1472, + 1481, + 1484, + 1544, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1417, + "label": 2, + "text": "ActiveX:activex activex software framework created microsoft adapts earlier component object model com object linking embedding ole technologies content downloaded network particularly world wide web microsoft introduced activex 1996 principle activex dependent microsoft windows operating systems practice activex controls run windows also require client running x86-based computer activex controls contain compiled code activex still supported windows 10 internet explorer 11 activex supported default web browser microsoft edge different incompatible extension system compatible new chromium-based microsoft edge using ie mode activex one major technologies used component-based software engineering compared javabeans activex supports programming languages javabeans supports platforms activex supported many rapid application development technologies active template library delphi javabeans microsoft foundation class library qt visual basic windows forms wxwidgets enable application developers embed activex controls products many microsoft windows applications\u2014including many microsoft internet explorer microsoft office microsoft visual studio windows media player\u2014use activex controls build feature-set also encapsulate functionality activex controls embedded applications internet explorer also allows embedding activex controls web pages faced complexity ole 2.0 poor support com mfc microsoft simplified specification rebranded technology activex 1996 even simplification users still required controls implement six core interfaces response complexity microsoft produced wizards atl base classes macros c++ language extensions make simpler write controls starting internet explorer 3.0 1996 microsoft added support host activex controls within html content browser encountered page specifying activex control via codice_1 tag would automatically download install control little user intervention made web richer provoked objections since controls practice ran windows separate controls required supported platform one windows 3.1/windows nt 3.51 one windows nt/95 one macintosh f68k/powerpc security risks especially given lack user intervention microsoft subsequently introduced security measures make browsing including activex safer example activex controversial start microsoft claimed programming ease good performance compared java applets marketing materials critics activex quick point security issues lack portability making impractical use outside protected intranets activex security model relied almost entirely identifying trusted component developers using code signing technology called authenticode developers register verisign us 20 per year individuals 400 corporations sign contract promising develop malware identified code would run inside web browser full permissions meaning bug code potential security issue contrasts sandboxing already used java time october 1996 microsoft released beta version activex software development kit sdk macintosh including plug-in netscape navigator mac announced plan support activex solaris later year six months two beta releases later yet commercially available macintosh activex plugins 1997 ncompass labs cooperation microsoft released plug-in netscape navigator support activex documentation activex core technology resides open group may downloaded free despite microsoft previous efforts make activex cross-platform activex controls work platforms using activex controls implement essential functionality web page restricts usefulness south korea started remove technology public websites order make web site accessible platforms microsoft made significant effort push cross-platform aspect activex way publishing api ultimately cross-platform effort failed due activex controls written c c++ compiled intel x86 assembly language making executable windows machines call standard win32 apis microsoft dropped activex support windows store edition internet explorer 10 windows 8 2015 microsoft released microsoft edge replacement internet explorer support activex marked end technology microsoft web browser development may always possible use internet explorer execute activex content e.g. wine installation may user want microsoft developed large number products software platforms using activex objects still used e.g. websites still use asp", + "neighbors": [ + 8, + 14, + 16, + 26, + 28, + 66, + 78, + 79, + 83, + 85, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 306, + 312, + 326, + 336, + 344, + 412, + 433, + 435, + 472, + 485, + 509, + 521, + 531, + 558, + 574, + 615, + 638, + 662, + 684, + 689, + 705, + 746, + 782, + 791, + 796, + 801, + 805, + 815, + 865, + 920, + 947, + 961, + 989, + 1025, + 1028, + 1035, + 1068, + 1084, + 1092, + 1098, + 1106, + 1109, + 1130, + 1151, + 1177, + 1193, + 1212, + 1235, + 1247, + 1261, + 1266, + 1328, + 1338, + 1346, + 1363, + 1370, + 1416, + 1428, + 1461, + 1502, + 1506, + 1531, + 1533, + 1542, + 1545, + 1547, + 1561, + 1566, + 1586, + 1589, + 1613, + 1620, + 1621, + 1625, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 1418, + "label": 9, + "text": "Evaluation_strategy:evaluation strategy evaluation strategies used programming languages determine evaluate argument function call function also read operation method relation kind value pass function example call value/call reference specifies function application evaluates argument proceeds evaluation function body passes two capabilities function namely ability look current value argument modify via assignment statement notion reduction strategy lambda calculus similar distinct practical terms many modern programming languages converged call-by-value/call-by-reference evaluation strategy function calls c java languages especially lower-level languages c++ combine several notions parameter passing historically call value call name date back algol 60 language designed late 1950s call reference used pl/i fortran systems purely functional languages like haskell well non-purely functional languages like r use call need evaluation strategy specified programming language definition function specific implementation strict evaluation arguments function always evaluated completely function applied church encoding eager evaluation operators maps strict evaluation functions reason strict evaluation sometimes called eager existing programming languages use strict evaluation functions applicative order leftmost innermost evaluation refers evaluation strategy arguments function evaluated left right post-order traversal reducible expressions es applicative order call-by-value evaluation call value also referred pass value common evaluation strategy used languages different c scheme call value argument expression evaluated resulting value bound corresponding variable function frequently copying value new memory region function procedure able assign values parameters local variable assigned\u2014that anything passed function call unchanged caller scope function returns call value single evaluation strategy rather family evaluation strategies function argument evaluated passed function many programming languages common lisp eiffel java use call value evaluate function arguments left-to-right evaluate functions arguments right-to-left others scheme ocaml c leave order unspecified cases term call value problematic value passed value variable understood ordinary meaning value implementation-specific reference value effect syntactically looks like call value may end rather behaving like call reference call sharing often depending subtle aspects language semantics reason passing reference often language technically provide value representation complicated data instead represents data structure preserving semblance value appearance source code exactly boundary drawn proper values data structures masquerading often hard predict c array strings special cases data structure name array treated value reference first element array struct variable name refers value even fields vectors maple vector special case table therefore data structure list gets rendered indexed exactly way value tcl values dual-ported value representation used script level language manages corresponding data structure one required modifications made via data structure reflected back value representation vice versa description call value value reference common understood call reference another term call sharing thus behaviour call value java visual basic call value c pascal significantly different c pascal calling function large structure argument cause entire structure copied except actually reference structure potentially causing serious performance degradation mutations structure invisible caller however java visual basic reference structure copied fast mutations structure visible caller call reference also referred pass reference evaluation strategy function receives implicit reference variable used argument rather copy value typically means function modify i.e assign variable used argument\u2014something seen caller call reference therefore used provide additional channel communication called function calling function call-by-reference language makes difficult programmer track effects function call may introduce subtle bugs simple litmus test whether language supports call-by-reference semantics possible write traditional codice_1 function language many languages support call reference form another comparatively use default fortran ii early example call-by-reference language languages c++ php visual basic .net c realbasic default call value offer special syntax call-by-reference parameters c++ additionally offers call reference const call reference simulated languages use call value n't exactly support call reference making use references objects refer objects pointers objects representing memory addresses objects languages c ml rust use technique separate evaluation strategy\u2014the language calls value\u2014but sometimes referred call address also referred pass address ml references type- memory- safe like rust similar effect achieved call sharing passing object mutated used languages like java python ruby purely functional languages typically semantic difference two strategies since data structures immutable possibility function modify arguments typically described call value even though implementations frequently use call reference internally efficiency benefits following example demonstrates call reference e following example call address simulates call reference c void modify int p int* q int* r int main call sharing also referred call object call object-sharing evaluation strategy first named barbara liskov et al language clu 1974 used languages python iota java object references ruby javascript scheme ocaml applescript many others however term call sharing common use terminology inconsistent across different sources example java community say java call value call sharing implies values language based objects rather primitive types i.e values boxed said pass copy reference primitives boxed passing unboxed called function semantics call sharing differ call reference particular call value mutations arguments performed called routine visible caller call reference access given variables caller merely certain objects e.g variable passed possible simulate assignment variable callee scope however since function access object caller copy made mutations objects objects mutable within function visible caller may appear differ call value semantics mutations mutable object within function visible caller object copied cloned \u2014 shared example python lists mutable def f list f print outputs codice_2 codice_3 method modifies object called assignments within function noticeable caller languages passing variable means passing access actual object referred variable access original caller variable since rebound variable exists within scope function counterpart caller retains original binding compare python mutation code binds formal argument new object def f list f print outputs codice_4 statement codice_5 reassigns new list variable rather location references immutable objects real difference call sharing call value except object identity visible language use call sharing mutable objects alternative input/output parameters parameter assigned argument overwritten object identity changed object argument mutated although term widespread usage python community identical semantics languages java visual basic often described call value value implied reference object call copy-restore also referred copy-in copy-out call value result call value return \u2014as termed fortran community special case call reference provided reference unique caller variant gained attention multiprocessing contexts remote procedure call parameter function call reference might accessible another thread execution contents may copied new reference function call returns updated contents new reference copied back original reference restored semantics call copy-restore also differ call reference two function arguments alias one another point variable caller environment call reference writing one affect call copy-restore avoids giving function distinct copies leaves result caller environment undefined depending aliased arguments copied back first\u2014will copies made left-to-right order entry return reference passed callee uninitialized evaluation strategy may called call result partial evaluation evaluation may continue body function applied sub-expressions contain unbound variables evaluated function applications whose argument values known may reduced presence side-effects complete partial evaluation may produce unintended results reason systems support partial evaluation tend pure expressions expressions without side-effects within functions non-strict evaluation arguments function evaluated unless actually used evaluation function body church encoding lazy evaluation operators maps non-strict evaluation functions reason non-strict evaluation often referred lazy boolean expressions many languages use form non-strict evaluation called short-circuit evaluation evaluation returns soon determined unambiguous boolean result\u2014for example disjunctive expression true encountered conjunctive expression false encountered forth conditional expressions also usually use lazy evaluation evaluation returns soon unambiguous branch result normal-order leftmost outermost evaluation evaluation strategy outermost redex always reduced applying functions evaluating function arguments contrast call name evaluate inside body unapplied function call name evaluation strategy arguments function evaluated function called\u2014rather substituted directly function body using capture-avoiding substitution left evaluated whenever appear function argument used function body argument never evaluated used several times re-evaluated time appears see jensen device call-by-name evaluation occasionally preferable call-by-value evaluation function argument used function call name save time evaluating argument whereas call value evaluate regardless argument non-terminating computation advantage enormous however function argument used call name often slower requiring mechanism thunk early use algol 60 today .net languages simulate call name using delegates expression parameters latter results abstract syntax tree given function eiffel provides agents represent operation evaluated needed seed7 provides call name function parameters java programs accomplish similar lazy evaluation using lambda expressions codice_6 interface call need memoized variant call name function argument evaluated value stored subsequent uses argument side-effect free produces results call name saving cost recomputing argument haskell well-known language uses call-by-need evaluation evaluation expressions may happen arbitrarily far computation haskell supports side-effects mutation via use monads eliminates unexpected behavior variables whose values change prior delayed evaluation r arguments passed call-by-need r allows arbitrary side-effects call-by-need arguments lazy evaluation commonly used implementation strategy call-by-need semantics variations exist\u2014for instance optimistic evaluation .net languages implement call need using type codice_7 call macro expansion similar call name uses textual substitution rather capture-avoiding substitution uncautious use macro substitution may result variable capture lead undesired behavior hygienic macros avoid problem checking replacing shadowed variables parameters full \u03b2-reduction function application may reduced substituting function argument function using capture-avoiding substitution time may done even within body unapplied function call future also referred parallel call name concurrent evaluation strategy value future expression computed concurrently flow rest program one promises value future needed main program blocks future value promise one promises finishes computing already completed strategy non-deterministic evaluation occur time creation future i.e expression given use future value similar call need value computed computation may deferred value needed may started value future needed local variable function returns computation may terminated part-way implemented processes threads creating future spawn one new processes threads promises accessing value synchronize main thread terminating computation future corresponds killing promises computing value implemented coroutine .net async/await creating future calls coroutine async function may yield caller turn yielded back value used cooperatively multitasking optimistic evaluation another variant call need function argument partially evaluated amount time may adjusted runtime evaluation aborted function applied using call need approach avoids runtime expense call need still retaining desired termination characteristics", + "neighbors": [ + 117, + 152, + 249, + 306, + 509, + 567, + 579, + 594, + 597, + 690, + 790, + 825, + 873, + 926, + 1059, + 1120, + 1217, + 1225, + 1235, + 1311, + 1430, + 1477, + 1508, + 1636 + ], + "mask": "Validation" + }, + { + "node_id": 1419, + "label": 2, + "text": "Android_Donut:android donut android donut fourth version open source android mobile operating system developed google longer supported among prominent features introduced update added support cdma smartphones additional screen sizes battery usage indicator text-to-speech engine public release donut\u2014its official dessert-themed code name convention employed google designate major android versions\u2014carriers quick follow roll customers form over-the-air ota update compatible smartphones", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 337, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 1061, + 1082, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1420, + "label": 4, + "text": "Associated_Signature_Containers:associated signature containers associated signature containers asic specifies use container structures bind together one signed objects either advanced electronic signatures timestamp tokens one single digital container eidas-regulation associated signature container asic eidas data container used hold group file objects digital signatures and/or time assertions associated objects data stored asic zip format european commission implementing decision 2015/1506 8 september 2015 laid specifications relating formats advanced electronic signatures advanced seals recognised public sector bodies pursuant articles 27 37 eidas-regulation eu member states requiring advanced electronic signature advanced electronic signature based qualified certificate shall recognise xml cms pdf advanced electronic signature conformance level b lt level using associated signature container signatures comply following technical specifications technical specification asics updated standardized since april 2016 european telecommunications standards institute standard associated signature containers asic etsi en 319 162-1 v1.1.1 2016-04 updated standard required european commission implementing decision internal structure asic includes two folders electronic signature file would contain single cades object one xades signatures time assertion file would either contain one timestamp token conform ietf rfc 3161 whereas single evidence record would conform ietf rfc 4998 ietf rfc6283 one purposes electronic signature secure data attached modified done creating dataset combines signature signed data store detached signature separate resource utilize external process re-associate signature data advantageous use detached signatures prevents unauthorized modifications original data objects however risk detached signature become separated associated data happen association would lost therefore data would become inaccessible one widespread deployments asic standard estonian digital signature system use multiplatform windows linux macos osx software called digidoc using correct tool job always important using correct type asic container job hand also important container single file object associated signature time assertion file \u201c mimetype \u201d file specifies media type might also included container mimetype file included required first file asic container container type allow additional signatures added future used sign stored file objects long-term time-stamp tokens used asic archive manifest files used protect long-term time-stamp tokens tampering type container hold one signature time assertion files asic-e xades deals signature files asic-e cades deals time assertions files within asic containers apply file object sets file object might additional metadata information associated also protected signature asic-e container could designed prevent modification allow inclusion without causing damage previous signatures asic containers capable maintaining long-term availability integrity storing xades cades signatures use time-stamp tokens evidence record manifest files contained within containers asic containers must comply zip specification limitations applied zip container operates baseline requirements asic simple asic-s container also provides additional time assertion requirements additional elements may within meta-inf folder requires use \u201c signeddata \u201d variable include certificate revocation information container baselines asic-e container additional restrictions container complies asic-e baseline requirements along additional requirements restrictions use asic reduces risk electronic signature becoming separated data combining signature signed data container elements secured within asic easier distribute signature guarantee correct signature metadata used validation process also used associating time assertions including evidence records time-stamp tokens associated data", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1421, + "label": 3, + "text": "Silicon_Graphics:silicon graphics silicon graphics inc. later rebranded sgi historically known silicon graphics computer systems sgcs american high-performance computing manufacturer producing computer hardware software founded mountain view california november 1981 jim clark initial market 3d graphics computer workstations products strategies market positions developed significantly time early systems based geometry engine clark marc hannah developed stanford university derived clark broader background computer graphics geometry engine first very-large-scale integration vlsi implementation geometry pipeline specialized hardware accelerated inner-loop geometric computations needed display three-dimensional images much history company focused 3d imaging major supplier hardware software market silicon graphics reincorporated delaware corporation january 1990 mid late-1990s rapidly improving performance commodity wintel machines began erode sgi stronghold 3d market porting maya platforms major event process sgi made several attempts address including disastrous move existing mips platforms intel itanium well introducing linux-based intel ia-32 based workstations servers failed market mid-2000s company repositioned supercomputer vendor move also failed april 1 2009 sgi filed chapter 11 bankruptcy protection announced would sell substantially assets rackable systems deal finalized may 11 2009 rackable assuming name silicon graphics international remains silicon graphics inc. became graphics properties holdings inc. james h. clark left position electrical engineering associate professor stanford university found sgi 1982 along group seven graduate students research staff stanford kurt akeley david j brown tom davis rocky rhodes marc hannah herb kuta mark grossman along abbey silverstone others ed mccracken ceo silicon graphics 1984 1997 years sgi grew annual revenues 5.4 million 3.7 billion addition 3d graphic capabilities pcs ability clusters linux- bsd-based pcs take many tasks larger sgi servers ate sgi core markets porting maya linux mac os x microsoft windows eroded low end sgi product line response challenges faced marketplace falling share price ed mccracken fired sgi brought richard belluzzo replace belluzzo leadership number initiatives taken considered accelerated corporate decline one initiative trying sell workstations running windows nt called visual workstations instead ones ran irix company version unix put company even direct competition likes dell making difficult justify price premium product line unsuccessful abandoned years later sgi premature announcement migration mips itanium abortive ventures ia-32 architecture systems visual workstation line ex-intergraph zx10 range sgi 1000-series linux servers damaged sgi credibility market 1999 attempt clarify current market position graphics company silicon graphics inc. changed corporate identity sgi although legal name unchanged time sgi announced new logo consisting letters sgi proprietary font called sgi created branding design consulting firm landor associates collaboration designer joe stitzlein sgi continued use silicon graphics name workstation product line later re-adopted cube logo workstation models november 2005 sgi announced delisted new york stock exchange common stock fallen minimum share price listing exchange sgi market capitalization dwindled peak seven billion dollars 1995 120 million time delisting february 2006 sgi noted could run cash end year mid-2005 sgi hired alix partners advise returning profitability received new line credit sgi announced postponing scheduled annual december stockholders meeting march 2006 proposed reverse stock split deal de-listing new york stock exchange january 2006 sgi hired dennis mckenna new ceo chairman board directors mr. mckenna succeeded robert bishop remained vice chairman board directors may 8 2006 sgi announced filed chapter 11 bankruptcy protection u.s. subsidiaries part plan reduce debt 250 million two days later u.s. bankruptcy court approved first day motions use 70 million financing facility provided group bondholders foreign subsidiaries unaffected september 6 2006 sgi announced end development mips/irix line irix operating system production would end december 29 last orders would fulfilled march 2007 support products would end december 2013 sgi emerged bankruptcy protection october 17 2006 stock symbol point sgid.pk canceled new stock issued nasdaq exchange symbol sgic new stock distributed company creditors sgid common stockholders left worthless shares end year company moved headquarters mountain view sunnyvale earlier north shoreline headquarters occupied computer history museum newer amphitheater parkway headquarters sold google locations award-winning designs studios architecture april 2008 sgi re-entered visualization market sgi virtu range visualization servers workstations re-badged systems boxx technologies based intel xeon amd opteron processors nvidia quadro graphics chipsets running red hat enterprise linux suse linux enterprise server windows compute cluster server december 2008 sgi received delisting notification nasdaq market value minimum 35 million requirement 10 consecutive trading days also meet nasdaq alternative requirements minimum stockholders equity 2.5 million annual net income continuing operations 500,000 april 1 2009 sgi filed chapter 11 announced would sell substantially assets rackable systems 25 million sale ultimately 42.5 million finalized may 11 2009 time rackable announced adoption silicon graphics international global name brand bankruptcy court scheduled continuing proceedings hearings june 3 24 2009 july 22 2009 rackable acquisition vizworld magazine published series six articles chronicle downfall sgi hewlett packard enterprise acquired sgi november 2016 allowed hpe place top500 nasa ames research center pleiades sgi ice supercomputer portfolio sgi continuous presence high performance compute silicon graphics inc. second bankruptcy phase renamed graphics properties holdings inc. gphi june 2009 2010 gphi announced significant favorable ruling litigation ati technologies amd june 2010 following patent lawsuit originally filed silicon graphics inc. era following 2008 appeal ati validity '327 silicon graphics inc voluntary dismissal '376 patent lawsuit federal circuit upheld jury verdict validity gphi u.s. patent 6,650,327 furthermore found amd lost right challenge patent validity future proceedings january 31 2011 district court entered order permits amd pursue invalidity affirmative defense trial permit sgi accuse amd radeon r700 series graphics products infringement case april 18 2011 gphi amd entered confidential settlement license agreement resolved litigation matter immaterial amount provides immunity gphi patents alleged infringement amd products including components software designs april 26 2011 court entered order granting parties agreed motion dismissal final judgment 2011-11 gphi filed another patent infringement lawsuit apple inc. delaware involving patents original patent infringement case apple last november alleged violation u.s. patents 6,650,327 '327 '145 '881 2012 gphi filed lawsuit apple sony htc corp lg electronics inc. samsung electronics co. research motion ltd. allegedly violating patent relating computer graphics process turns text images pixels displayed screens affected devices include apple iphone htc evo4g lg thrill research motion torch samsung galaxy galaxy ii sony xperia play smartphones sgi first generation products starting iris integrated raster imaging system 1000 series high-performance graphics terminals based motorola 68000 family microprocessors later iris 2000 3000 models developed full unix workstations first entries 1000 series models 1000 1200 introduced 1984 graphics terminals peripherals connected general-purpose computer digital equipment corporation vax provide graphical raster display abilities used 8 mhz motorola 68000 cpus ram disk drives booted network via excelan exos/101 ethernet card controlling computer used pm1 cpu board variant board used stanford university sun workstation later sun-1 workstation sun microsystems graphics system composed gf1 frame buffer uc3 update controller dc3 display controller bp2 bitplane 1000-series machines designed around multibus standard later 1000-series machines 1400 1500 ran 10 mhz 1.5 mb ram 1400 73 mb st-506 disk drive 1500 474 mb smd-based disk drive xylogics 450 disk controller may used pm2 cpu pm2m1 ram board 2000 series usual monitor 1000 series ran 30 hz interlaced six beta-test units 1400 workstation produced first production unit sgi first commercial computer shipped carnegie-mellon university electronic imaging laboratory 1984 sgi rapidly developed machines workstations second product line \u2014 iris 2000 series first released august 1985 sgi began using unix system v operating system five models two product ranges 2000/2200/2300/2400/2500 range used 68010 cpus pm2 cpu module later turbo systems 2300t 2400t 2500t 68020s ip2 cpu module used excelan exos/201 ethernet card graphics hardware gf2 frame buffer uc4 update controller dc4 display controller bp3 bitplane main differences cpu ram weitek floating point accelerator boards disk controllers disk drives st-506 smd available could upgraded example 2400 2400t 2500 2500t larger chassis standard 6 19 eia rack space bottom two smd disk drives weighing approximately non-turbo models used multibus cpu communicate floating point accelerator turbos added ribbon cable dedicated 60 hz monitors used 2000 series height machines using motorola cpus reached iris 3000 series models 3010/3020/3030 3110/3115/3120/3130 30s full-size rack machines used graphics subsystem ethernet 2000s could also use 12 geometry engines first widespread use hardware graphics accelerators standard monitor 19 60 hz non-interlaced unit tilt/swivel base 19 30 hz interlaced 15 60 hz non-interlaced tilt/swivel base also available iris 3130 smaller siblings impressive time complete unix workstations 3130 powerful enough support complete 3d animation rendering package without mainframe support large capacity hard drives standards day two 300 mb drives streaming tape ethernet could centerpiece animation operation line formally discontinued november 1989 3500 systems shipped 2000 3000 models combined introduction iris 4d series sgi switched mips microprocessors machines powerful came powerful on-board floating-point capability 3d graphics became popular television film time systems responsible establishing much sgi reputation sgi produced broad range mips-based workstations servers 1990s running sgi version unix system v called irix included massive onyx visualization systems size refrigerators capable supporting 64 processors managing three streams high resolution fully realized 3d graphics october 1991 mips announced first commercially available 64-bit microprocessor r4000 sgi used r4000 crimson workstation irix 6.2 first fully 64-bit irix release including 64-bit pointers secure supply future generations mips microprocessors 64-bit r4000 sgi acquired company 1992 333 million renamed mips technologies inc. wholly owned subsidiary sgi 1993 silicon graphics sgi signed deal nintendo develop reality coprocessor rcp gpu used nintendo 64 n64 video game console deal signed early 1993 later made public august year console later released 1996 rcp developed sgi nintendo operations department led engineer dr. wei yen 1997 twenty sgi employees led yen left sgi founded artx later acquired ati technologies 2000 1998 sgi relinquished ownership mips technologies inc re-ipo fully divested 2000 late 1990s much industry expected itanium replace cisc risc architectures non-embedded computers sgi announced intent phase mips systems development new mips microprocessors stopped existing r12000 design extended multiple times 2003 provide existing customers time migrate itanium august 2006 sgi announced end production mips/irix systems end year mips/irix products longer generally available sgi second generation onyx reality engine machines sgi offered access high performance 3d graphics subsystems proprietary api known iris graphics language iris gl features added years iris gl became harder maintain cumbersome use 1992 sgi decided clean reform iris gl made bold move allowing resulting opengl api cheaply licensed sgi competitors set industry-wide consortium maintain opengl standard opengl architecture review board meant first time fast efficient cross-platform graphics programs could written day opengl remains real-time 3d graphics standard portable across variety operating systems opengl-es even runs many types cell phones main competitor direct3d microsoft runs microsoft windows-based machines consoles sgi part advanced computing environment initiative formed early 1990s 20 companies including compaq digital equipment corporation mips computer systems groupe bull siemens nec netpower microsoft santa cruz operation intent introduce workstations based mips architecture able run windows nt sco unix group produced advanced risc computing arc specification began unravel little year formation sgi crimson system fsn three-dimensional file system navigator appeared 1993 movie jurassic park movie twister protagonists seen using sgi laptop computer however unit shown actual working computer rather fake laptop shell built around sgi corona lcd flat screen display 1995 film congo also features sgi laptop computer used dr. ross laura linney communicate via satellite travicom hq purple lowercased sgi logo seen beginning opening credits hbo series silicon valley taken replaced google logo intro graphics progress google leased former sgi buildings 2003 headquarters mountain view ca purchased buildings outright 2006 eight consecutive years 1995\u20132002 films nominated academy award distinguished achievement visual effects created silicon graphics computer systems inexpensive pcs began graphics performance close expensive specialized graphical workstations sgi core business sgi shifted focus high performance servers digital video web many sgi graphics engineers left work computer graphics companies ati nvidia contributing pc 3d graphics revolution 1995 film toy story used silicon graphics indigo2 computers create scenes movie sgi promoter free software supporting several projects linux samba opening previously proprietary code xfs filesystem open64 compiler 1995 sgi purchased alias research kroyer films wavefront technologies deal totaling approximately 500 million merged companies alias|wavefront june 2004 sgi sold business later renamed alias/wavefront private equity investment firm accel-kkr 57.1 million october 2005 autodesk announced signed definitive agreement acquire alias 182 million cash february 1996 sgi purchased well-known supercomputer manufacturer cray research 740 million began use marketing names craylink sgi-developed technology integrated sgi server line three months later sold cray business systems division responsible cs6400 sparc/solaris server sun microsystems undisclosed amount acknowledged later sun executive significantly less 100 million many cray t3e engineers designed developed sgi altix numalink technology sgi sold cray brand product lines tera computer company march 31 2000 35 million plus one million shares sgi also distributed remaining interest mips technologies spin-off effective june 20 2000 september 2000 sgi acquired zx10 series windows workstations servers intergraph computer systems rumored 100 million rebadged sgi systems product line discontinued june 2001 another attempt sgi late 1990s introduce family intel-based workstations running windows nt red hat linux see also sgi visual workstation proved financial disaster shook customer confidence sgi \u2019 commitment mips-based line 1998 sgi announced future generations machines would based mips processors upcoming super-chip intel code-named merced later called itanium funding high-end processors reduced planned r10000 would last mips mainstream processor mips technologies would focus entirely embedded market success sgi would longer fund development cpu since failure arc found use machines plan quickly went awry early 1999 clear itanium going delivered late would nowhere near performance originally expected production delays increased mips existing r10000-based machines grew increasingly uncompetitive eventually forced introduce faster mips processors r12000 r14000 r16000 used series models 2002 2006 sgi first itanium-based system short-lived sgi 750 workstation launched 2001 sgi mips-based systems superseded launch itanium 2-based altix servers prism workstations time later unlike mips systems ran irix itanium systems used suse linux enterprise server sgi enhancements operating system sgi used transitive corporation quicktransit software allow old mips/irix applications run emulation new itanium/linux platform server market itanium 2-based altix eventually replaced mips-based origin product line workstation market switch itanium completed sgi exited market altix powerful computer world 2006 assuming computer defined collection hardware running single instance operating system altix 512 itanium processors running single instance linux cluster 20 machines eighth-fastest supercomputer faster supercomputers clusters none many flops per machine however recent supercomputers large clusters machines individually less capable sgi acknowledged 2007 moved away massive numa model clusters although sgi continued market itanium-based machines recent machines based intel xeon processor first altix xe systems relatively low-end machines december 2006 xe systems capable itanium machines measures e.g. power consumption flops/w density flops/m cost/flops xe1200 xe1300 servers used cluster architecture departure pure numa architectures earlier itanium mips servers june 2007 sgi announced altix ice 8200 blade-based xeon system 512 xeon cores per rack altix ice 8200 installed new mexico computing applications center 14336 processors ranked number 3 top500 list november 2007 conventional wisdom holds sgi core market traditionally hollywood visual effects studios fact sgi largest revenue always generated government defense applications energy scientific technical computing one case silicon graphics largest single sale ever united states postal services usps sgi servers powered artificial intelligence ai program mechanically read tag sort mail hand-written block number usps key mail centers rise cheap yet powerful commodity workstations running linux windows mac os x availability diverse professional software effectively pushed sgi visual effects industry niche markets sgi continued enhance line servers including supercomputers based sn architecture sn scalable node technology developed sgi mid-1990s uses cache-coherent non-uniform memory access cc-numa sn system processors memory bus- memory-controller coupled together entity called node usually single circuit board nodes connected high-speed interconnect called numalink originally marketed craylink internal bus instead access processors memory i/o devices done switched fabric links routers thanks cache coherence distributed shared memory sn systems scale along several axes cpu count increases memory capacity i/o capacity system bisection bandwidth allows combined memory nodes accessed single os image using standard shared-memory synchronization methods makes sn system far easier program able achieve higher sustained-to-peak performance non-cache-coherent systems like conventional clusters massively parallel computers require applications code written re-written explicit message-passing communication nodes first sn system known sn-0 released 1996 product name origin 2000 based mips r10000 processor scaled 2 128 processors smaller version origin 200 sn-00 scaled 1 4 later enhancements enabled systems large 512 processors second generation system originally called sn-1 later sn-mips released july 2000 origin 3000 scaled 4 512 processors 1,024-processor configurations delivered special order customers smaller less scalable implementation followed called origin 300 november 2002 sgi announced repackaging sn system name origin 3900 quadrupled processor area density sn-mips system 32 128 processors per rack moving fat tree interconnect topology january 2003 sgi announced variant sn platform called altix 3000 internally called sn-ia used intel itanium 2 processors ran linux operating system kernel time released world scalable linux-based computer supporting 64 processors single system node nodes could connected using numalink technology form sgi predictably termed superclusters february 2004 sgi announced general support 128 processor nodes followed 256 512 processor versions year april 2004 sgi announced sale alias software business approximately 57 million october 2004 sgi built supercomputer columbia broke world record computer speed nasa ames research center cluster 20 altix supercomputers 512 intel itanium 2 processors running linux achieved sustained speed 42.7 trillion floating-point operations per second teraflops easily topping japan famed earth simulator record 35.86 teraflops week later ibm upgraded blue gene/l clocked 70.7 teraflops july 2006 sgi announced sgi altix 4700 system 1,024 processors 4 tb memory running single linux system image 68k mips-based models also rebadged vendors including cdc tandem computers prime computer siemens-nixdorf sgi onyx sgi indy series systems used game development nintendo 64", + "neighbors": [ + 134, + 208, + 211, + 227, + 272, + 292, + 322, + 340, + 349, + 355, + 362, + 386, + 388, + 390, + 438, + 443, + 758, + 776, + 847, + 868, + 912, + 917, + 959, + 961, + 1002, + 1016, + 1022, + 1138, + 1168, + 1287, + 1301, + 1384, + 1398, + 1578, + 1605, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1422, + "label": 2, + "text": "Nokia_N8:nokia n8 nokia n8 touchscreen-based smartphone developed nokia announced 27 april 2010 nokia n8 first device run symbian^3 mobile operating system company flagship device year released 30 september 2010 nokia online store released markets around world 1 october 2010 n8 3.5-inch amoled display 16 gigabytes mass memory features 12-megapixel camera second time camera megapixel count used first one sony ericsson satio 2009 xenon flash like nokia n82 large 1/1.83 \u201d sensor size larger point-and-shoot cameras time also 720p hd video recording pentaband 3.5g radio fm transmitter among connectivity features hdmi output usb on-the-go wi-fi 802.11 b/g/n n8 important device nokia bid increasing competition smartphone industry revamped symbian^3 software also important device delayed several times pushing release date several months negative impact company despite mixed views symbian software n8 hardware build camera quality well received many calling best camera phone n8 would also become nokia last flagship device running symbian due nokia lumia 800 2011 ran windows phone software n8 symbian successor nokia 808 pureview appeared 2012 previous flagship phone nseries n97 criticised initial firmware issues anssi vanjoki nokia executive vice president markets said interview software quality control would better n97 n97 reception highly negative tarnished company image market n8 first device feature symbian^3 operating system initially scheduled second quarter 2010 n8 pushed back third quarter finally released 30 september 2010 due 'final amendments n8 became product customer pre-orders nokia history point release sales q4 2010 estimated almost 4 million previous nokia phone focus photography n86 8mp 8-megapixel sensor become available june 2009 n8 second nokia capacitive touchscreen following x6 first multi-touch nokia n8 dual charging options allowing charged standard-pin nokia charger micro-usb port nokia n8 battery compartment internally contained thus battery entirely straightforwardly removable replaceable users nonetheless although procedure endorsed nokia possible correct tool careful handling change battery. bl-4d 1200 mah lithium-ion battery n8 first nokia smartphone device run symbian^3 operating system 7 february 2012 nokia belle update available n8 nokia suite august year nokia also started roll nokia belle refresh update update brought new features symbian smartphone like html 5 web apps support new set home screen widgets software function n8 smartphone anna operating system update gave communicator support usually reserved e-series devices also new push notification api corresponding app proprietary web browser latest version 7.4.2.6 belle v.111.030.0609 official firmware including video-capturing feature complemented mini hdmi port located top side phone normally mirrors phone screen allows applications built-in video player nokia big screen app selected games output content resolutions 720p corresponding cable provided retail box regions nokia mobile tv headset provides dvb-h tv applications developed using nokia qt framework highlight capabilities nokia n8 camera nokia created short film commuter october 2010 directed mchenry brothers starring dev patel ed westwick charles dance pamela anderson seven-minute film shot entirely phone 720p camera spanish promotion phone also created short video featuring luminescent puppets called www.techfashy.com/2014/11/nokia-launches-their-first-android_18.html love knot phone also used film drums death wo n't long music video using cellscope technology nokia also released another film called dot marketed world smallest stop-motion animation character device also appeared popular showtime tv show dexter bbc tv series hustle well film also phone sarah lund uses third series killing .. asian countries promoted differently fictional character pier roxas nokia project gener8 young rubicam philippines also appeared gma talk show startalk promote device nokia shorts 2011 competition involved 8 short films shot nokia n8 winner splitscreen love story independent film olive first feature-length film 90 minutes made entirely cell phone uses nokia n8 along old fashioned video camera attachment 35 mm lens made exclusively device trick audience realizing made nokia n8", + "neighbors": [ + 3, + 21, + 112, + 162, + 166, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 509, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1138, + 1203, + 1246, + 1314, + 1493, + 1522, + 1529, + 1608, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1423, + "label": 5, + "text": "Camino_(web_browser):camino web browser camino spanish word meaning path discontinued free open source gui-based web browser based mozilla gecko layout engine specifically designed os x operating system place xul-based user interface used mozilla-based applications camino used mac-native cocoa apis may 30 2013 camino project announced browser longer developed camino aim integrate well possible os x used aqua user interface integrated number os x services features keychain password management bonjour scanning available bookmarks across local network notable features included integrated pop-up blocker ad blocker tabbed browsing included overview feature allowing tabs viewed pages browser developed camino project community organization mike pinkerton technical lead camino project since dave hyatt moved safari team apple inc. mid-2002 late 2001 mike pinkerton vidur apparao started project within netscape prove gecko could embedded cocoa application early 2002 dave hyatt one co-creators firefox called phoenix joined team built chimera small lightweight browser wrapper around work chimera mythological beast parts taken various animals new browser represented early example carbon/c++ code interacting cocoa/objective-c code name must seemed apt first downloadable build chimera 0.1 released february 13 2002 early releases became popular due fast page-loading speeds compared then-dominant mac browser microsoft internet explorer version 5 omnigroup omniweb used cocoa text system rendering engine hyatt hired apple computer mid-2002 start work would become safari meanwhile chimera developers got small team together within netscape dedicated development qa put together netscape-branded technology preview january 2003 macworld conference however two days show aol management decided abandon entire project despite setback skeleton crew qa developers released camino 0.7 march 3 2003 name changed chimera camino legal reasons roots greek mythology chimera popular choice name hypermedia systems one first graphical web browsers called chimera researchers university california irvine also developed complete hypermedia system name spanish path road el camino real aka royal road name chosen continue navigator motif version 0.7 primarily netscape-driven release kept afloat end open source version 0.8 according lead developer pinkerton triumph open source open process people around world helped patches qa bug triage localization artwork evangelism march 2005 camino web site moved mozilla foundation domain mozilla.org camino project domain caminobrowser.org september 2005 pinkerton accepted position google worked closely google firefox team continued work camino twenty percent time camino 1.0 released february 14 2006 first browser mozilla family appear universal binary thanks largely efforts mark mentovai another camino developers camino 2.0 released november 18 2009 introduced many new interface features browser including movable tabs tab preview first camino release acid2-compliant release camino 2.1 2011 developers announced plans transition webkit future versions mozilla dropped support gecko embedding final release 2.1.2 released march 14 2012 may 30 2013 stuart morgan announced camino blog camino reached end longer developed camino 2.0 released november 18 2009 introduced many new interface features browser including moveable tabs tab preview first camino release acid2-compliant current release 2.1.2 scores 99/100 acid3 test camino current html5 support via html5 test standards testbed limited camino 2.1.2 available following languages", + "neighbors": [ + 14, + 81, + 83, + 95, + 107, + 258, + 277, + 384, + 427, + 452, + 491, + 509, + 530, + 531, + 580, + 582, + 585, + 623, + 627, + 646, + 668, + 684, + 713, + 734, + 780, + 862, + 869, + 886, + 939, + 953, + 959, + 1033, + 1058, + 1084, + 1120, + 1132, + 1138, + 1166, + 1189, + 1195, + 1210, + 1228, + 1280, + 1302, + 1331, + 1339, + 1376, + 1378, + 1408, + 1424, + 1528, + 1539, + 1550, + 1563, + 1569, + 1570, + 1604 + ], + "mask": "Validation" + }, + { + "node_id": 1424, + "label": 5, + "text": "CCSO_Nameserver:ccso nameserver ccso name-server ph protocol early form database search internet common form used look information telephone numbers email addresses today service largely replaced ldap used mainly early-to-middle 1990s name-server developed steve dorner university illinois urbana\u2013champaign university computing communications services office ccso also exists outlook plugin standalone application known outlookph name-server directories frequently organized gopher hierarchies tools ph qi two components system ph client queried qi server ph protocol formally defined september 1998 however memo issued time references prior use unspecified period time date defines sixteen keywords used server side define record properties also defines clients access records server responses server give ph server communication takes place tcp port 105 commands response initially assumed us-ascii encoding historical reasons unless client explicitly asks 8-bit iso-8859-1 encoding result characters 0x20 0x7e initially sent server raw form characters present entries escaped using defined quoted-printable encoding initial request client text base keyword optionally followed one parameters defined server responds request following example response status request provided rfc memo command defined memo consists keyword followed needed one parameters key words separated spaces tabs end line line must terminated cr+lf style following commands command takes parameters simply asks server report status returns information server version mail domain contact password issues authentication methods list available entry fields server specified name names causes server log specified information current user id without login sets specified option server value used without parameters lists current server settings actual login/logout commands server alias must users ph alias logging allows user change entry view certain fields flag restricted access client normally uses one send password information login command sent one recognized server end session command closing connection distributed nameserver backed flat file database early 1990s indiana university software developer larry hughes implemented version qi called phd written perl backed relational database code distributed open-source license several years prior university transition ldap", + "neighbors": [ + 83, + 107, + 452, + 580, + 623, + 668, + 713, + 886, + 939, + 1132, + 1210, + 1227, + 1376, + 1423, + 1528, + 1550, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 1425, + "label": 3, + "text": "Ninja_JaJaMaru-kun:ninja jajamaru-kun released nintendo japanese virtual console december 26 2006 pal regions september 21 2007 part ninja week hanabi festival promotion released north american virtual console october 22 2007 first time game made release outside japan respective regions primary inspiration behind robot ninja haggleman 8-bit style game retro game challenge nintendo ds game stars brother ninja-kun ninja-kid princess sakura kidnapped damazu-dayuu ninja-kun away journey task falls young jajamaru-kun game player starts three lives run jump throw shurikens game divided stages four floors eight ghost-like enemies japanese folklore names displayed stage begins sakura-hime damazu placed unreachable top screen enemies use various projectiles one cause player lose life jajamaru-kun lands top enemy simply temporarily stunned vice versa enemy defeated offscreen spirit appear ascend top screen collected disappeared receive points vary depending enemy among eight enemies one top floor tougher beat others player need careful deal sakura sometimes drop petals player collect damazu sometimes run around dropping bombs advance next stage player must defeat eight enemies using shurikens bricks yield items include three types power-ups collected gamapa-kun giant frog summoned jajamaru-kun riding completely invincible able eat enemies three sakura petals collected player go bonus stage jajamaru-kun bottom damazu top damazu drops bombs player throws shurikens upward player manages hit damazu bonus points awarded jajamaru-kun hit bomb goes next stage", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1426, + "label": 1, + "text": "Hong_Kong_shipping_register:hong kong shipping register port hong kong deep water port located southern china one hub ports serving south-east east asia region gateway mainland china city hong kong began colony united kingdom free port became international trade center connecting land sea transport china countries port mature infrastructure well-developed air-sea-land transport helps hong kong maintain position international trade centre transshipment hub part 1997 transfer sovereignty hong kong britain china ship registration system made adjustments 1990 marine department set separate system hong kong shipping register ordinance hong kong ship registration amended accordingly new measures reduce operation cost ship management also improve service quality new system increased hong kong competitive advantage attracting ships port january 2009 hong kong registered ships reached 40.56 million tons 1,380 vessels", + "neighbors": [ + 761 + ], + "mask": "Test" + }, + { + "node_id": 1427, + "label": 7, + "text": "FMOD:fmod fmod proprietary sound effects engine authoring tool video games applications developed firelight technologies play mix sounds diverse formats many operating systems fmod sound system supplied programmer api authoring tool similar digital audio workstation fmod consists following technologies legacy products fmod sound system advanced plugin architecture used extend support audio formats develop new output types e.g streaming fmod available multiple license schemes fmod written portable c++ thus run many different pc mobile gaming console platforms including microsoft windows x86 x86-64 macos ios linux x86 x86-64 android blackberry wii wii u 3ds nintendo switch xbox xbox 360 xbox one playstation 2 playstation 3 playstation 4 playstation portable playstation vita google native client fmod contains support amd trueaudio sound blaster hardware acceleration fmod play back following audio formats aiff asf asx dls flac fsb fmod sample bank format m3u midi mod mp2 mp3 ogg vorbis pls s3m vag ps2/psp format wav wax windows media audio redirector wma xm xma xbox 360 well raw audio data fmod integrated primary sound-effects system following video game engines fmod used many high-profile commercial games since release partial list", + "neighbors": [ + 85, + 134, + 435, + 961, + 1138, + 1149 + ], + "mask": "Test" + }, + { + "node_id": 1428, + "label": 2, + "text": "Network_Driver_Interface_Specification:network driver interface specification network driver interface specification ndis application programming interface api network interface cards nics jointly developed microsoft 3com corporation mostly used microsoft windows however open-source ndiswrapper project evil driver wrapper projects allow many ndis-compliant nics used linux freebsd netbsd magnussoft zeta derivative beos supports number ndis drivers ndis forms logical link control llc sublayer upper sublayer osi data link layer layer 2 therefore ndis acts interface media access control mac sublayer lower sublayer data link layer network layer layer 3 ndis library functions often referred wrapper hides underlying complexity nic hardware serves standard interface level 3 network protocol drivers hardware level mac drivers ndis versions supported various windows versions follows traffic accepted nic controlled ndis miniport driver various protocols tcp/ip implemented ndis protocol drivers single miniport may associated one protocols means traffic coming miniport may received parallel several protocol drivers example winpcap adds second protocol driver selected miniport order capture incoming packets furthermore possible simulate several virtual nics implementing virtual miniport drivers send receive traffic single physical nic one example virtual miniport driver usage add virtual nics different virtual lan implementations assume drivers received buffers one must treat incoming buffers read driver changes packet content must allocate buffers miniport type hardware driver part windows driver model usb audio scsi network card adapters usually source binary compatible windows 98 windows 2000 hardware specific control access hardware specific bus class driver another driver type ndis intermediate driver intermediate drivers sit in-between mac ip layers control traffic accepted nic practice intermediate drivers implement miniport protocol interfaces miniport driver protocol driver actually communicate corresponding miniport protocol interfaces reside intermediate driver design enables adding several chained intermediate drivers miniport protocol drivers therefore driver vendors assume interface send traffic implemented last driver chain order write applications using ndis one use samples accompany microsoft windows driver kit wdk passthru sample good starting point intermediate drivers implements necessary details required driver type passes traffic next driver chain", + "neighbors": [ + 28, + 111, + 134, + 268, + 299, + 412, + 435, + 472, + 521, + 647, + 689, + 815, + 961, + 992, + 1068, + 1116, + 1151, + 1177, + 1304, + 1417, + 1502, + 1554, + 1620, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1429, + "label": 4, + "text": "Dwight_Agnew:dwight agnew dwight merle agnew january 1 1902 \u2013 october 4 1969 united states navy officer fredericktown ohio destroyer commander world present attack pearl harbor later received navy cross tactical acumen guadalcanal campaign post-war led destroyer squadron 10 later worked national security agency 1956 moved retired list made tombstone admiral agnew married thelma marie biegler daughter united states army officer medal honor recipient george w. biegler dwight agnew born fredericktown ohio january 1 1902 murray agnew emma louise agnew n\u00e9e follin graduating fredericktown high school briefly attended denison university entering united states naval academy graduated naval academy 1926 commissioned ensign prior world war ii agnew held variety shipboard postings serving aboard time nevada number four gun turret crew \u2013 leadership \u2013 trenchard medal excellence gunnery japanese attack pearl harbor december 7 1941 agnew family \u2013 dwight brother henry sisters brothers-in-law latter also navy officers \u2013 stationed hawaii time agnew serving commanding officer uss trever destroyer minesweeper like many american ship captains agnew aboard vessel attack began 0755 december 7 command junior officers uss trever sounded general alarm 0757 began returning fire japanese forces seven minutes later successfully downing imperial japanese navy air service aircraft strafing pearl city yacht club well second aircraft maneuvering attack ship frantic orders sortie fleet resulted agnew left behind aboard trever instead putting sea commander helm following attack wasmuth rendezvoused trever agnew rejoined ship trever depth charges already armed set agnew ordered magnetic sweep harbor taking defensive station harbor mouth protect feared second wave attack materialize following week december 14 agnew led trever rescue crew passengers torpedoed norwegian freighter ms h\u00f8egh merchant h\u00f8egh merchant sunk japanese submarine attempting navigate safe port following outbreak hostilities august 1942 agnew promoted captain continuing commanding officer agnew received navy cross tactical brilliance repelling attack imperial japanese navy upon trever task unit leading guadalcanal campaign according citation 1943 transferred san francisco california oversee outfitting new subsequently commanding ship engagements pacific received bronze star agnew given command attack transport 1945 commanded battle iwo jima following world war ii agnew held variety staff assignments navy \u2013 including naval representative joint american military mission aid turkey \u2013 january 1952 february 1953 commanding officer destroyer squadron 10 united states atlantic fleet final three years military career 1956 retirement assigned national security agency upon retirement advanced rank rear admiral died october 4 1969 october 1929 agnew married thelma marie biegler daughter army officer george w. biegler following outbreak world thelma agnew son dwight agnew jr evacuated san diego stay dwight agnew mother living city agnew brother henry also alumnus u.s naval academy instructor academy also held several shipboard assignments world given command post-war period sisters dorothy elizabeth married naval officers", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1430, + "label": 9, + "text": "Scheme_(programming_language):scheme programming language scheme programming language supports multiple paradigms including functional imperative programming one three main dialects lisp alongside common lisp clojure unlike common lisp scheme follows minimalist design philosophy specifying small standard core powerful tools language extension scheme created 1970s mit ai lab released developers guy l. steele gerald jay sussman via series memos known lambda papers first dialect lisp choose lexical scope first require implementations perform tail-call optimization giving stronger support functional programming associated techniques recursive algorithms also one first programming languages support first-class continuations significant influence effort led development common lisp scheme language standardized official ieee standard de facto standard called revised report algorithmic language scheme r n rs widely implemented standard r5rs 1998 new standard r6rs ratified 2007 scheme diverse user base due compactness elegance minimalist philosophy also caused wide divergence practical implementations much scheme steering committee calls world unportable programming language family dialects rather single language scheme started 1970s attempt understand carl hewitt actor model purpose steele sussman wrote tiny lisp interpreter using maclisp added mechanisms creating actors sending messages scheme originally called schemer tradition lisp-derived languages planner conniver current name resulted authors use operating system limited filenames two components six characters currently schemer commonly used refer scheme programmer new language standardization process began 2003 scheme workshop goal producing r6rs standard 2006 process broke earlier r n rs approach unanimity r6rs features standard module system allowing split core language libraries number drafts r6rs specification released final version r5.97rs successful vote resulted ratification new standard announced august 28 2007 currently newest releases various scheme implementations support r6rs standard portable reference implementation proposed implicitly phased libraries r6rs called psyntax loads bootstraps properly various older scheme implementations feature r6rs record-type descriptor rtd rtd created used record type representation show memory layout also calculated object field bit mask mutable scheme object field bit masks helped garbage collector know fields without traversing whole fields list saved rtd rtd allows users expand basic rtd create new record system r6rs introduces numerous significant changes language source code specified unicode large subset unicode characters may appear scheme symbols identifiers minor changes lexical rules character data also specified unicode many standard procedures moved new standard libraries form large expansion standard containing procedures syntactic forms formerly part standard new module system introduced systems exception handling standardized syntax-rules replaced expressive syntactic abstraction facility syntax-case allows use scheme macro expansion time compliant implementations required support scheme full numeric tower semantics numbers expanded mainly direction support ieee 754 standard floating point numerical representation r6rs standard caused controversy seen departed minimalist philosophy august 2009 scheme steering committee oversees standardization process announced intention recommend splitting scheme two languages large modern programming language programmers small version subset large version retaining minimalism praised educators casual implementors two working groups created work two new versions scheme scheme reports process site links working groups charters public discussions issue tracking system ninth draft r7rs small language made available april 15 2013 vote ratifying draft closed may 20 2013 final report available since august 6 2013 describing 'small language effort therefore considered isolation successor r6rs scheme primarily functional programming language shares many characteristics members lisp programming language family scheme simple syntax based s-expressions parenthesized lists prefix operator followed arguments scheme programs thus consist sequences nested lists lists also main data structure scheme leading close equivalence source code data formats homoiconicity scheme programs easily create evaluate pieces scheme code dynamically reliance lists data structures shared lisp dialects scheme inherits rich set list-processing primitives codice_1 codice_2 codice_3 lisp progenitors scheme uses strictly dynamically typed variables supports first class procedures thus procedures assigned values variables passed arguments procedures section concentrates mainly innovative features language including features distinguish scheme lisps unless stated otherwise descriptions features relate r5rs standard examples provided section notation === result used indicate result evaluating expression immediately preceding line convention used r5rs subsection describes features scheme distinguished programming languages earliest days aspects scheme strongly influence product scheme language aspects versions scheme programming language 1973 onward share scheme simple language much easier implement many languages comparable expressive power ease attributable use lambda calculus derive much syntax language primitive forms instance 23 s-expression-based syntactic constructs defined r5rs scheme standard 14 classed derived library forms written macros involving fundamental forms principally lambda r5rs says r5rs sec 3.1 fundamental variable binding constructs lambda expression variable binding constructs explained terms lambda expressions example macro implement codice_4 expression using codice_5 perform variable bindings define-syntax let thus using codice_4 defined scheme implementation would rewrite codice_7 codice_8 reduces implementation task coding procedure instantiations 1998 sussman steele remarked minimalism scheme conscious design goal rather unintended outcome design process actually trying build something complicated discovered serendipitously accidentally designed something met goals much simpler intended ... realized lambda calculus\u2014a small simple formalism\u2014could serve core powerful expressive programming language like modern programming languages unlike earlier lisps maclisp scheme lexically scoped possible variable bindings program unit analyzed reading text program unit without consideration contexts may called contrasts dynamic scoping characteristic early lisp dialects processing costs associated primitive textual substitution methods used implement lexical scoping algorithms compilers interpreters day lisps perfectly possible reference free variable inside procedure refer quite distinct bindings external procedure depending context call impetus incorporate lexical scoping unusual scoping model early 1970s new version lisp came sussman studies algol suggested algol-like lexical scoping mechanisms would help realize initial goal implementing hewitt actor model lisp key insights introduce lexical scoping lisp dialect popularized sussman steele 1975 lambda paper scheme interpreter extended lambda calculus adopted concept lexical closure page 21 described ai memo 1970 joel moses attributed idea peter j. landin alonzo church mathematical notation lambda calculus inspired lisp use lambda keyword introducing procedure well influencing development functional programming techniques involving use higher-order functions lisp early lisps suitable expressions lambda calculus treatment free variables formal lambda system axioms complete calculation rule helpful analysis using mathematical logic tools system calculation seen directional deduction syntax lambda calculus follows recursive expressions x z ... parentheses spaces period symbol \u03bb function lambda calculation includes first serve starting point powerful mathematical logic second reduce requirement programmers consider implementation details use imitate machine evaluation finally lambda calculation created substantial meta-theory introduction lexical scope resolved problem making equivalence forms lambda notation practical expression working programming language sussman steele showed new language could used elegantly derive imperative declarative semantics programming languages including algol fortran dynamic scope lisps using lambda expressions simple procedure instantiations control structures environment modifiers introduced continuation-passing style along first description scheme first lambda papers subsequent papers proceeded demonstrate raw power practical use lambda calculus scheme inherits block structure earlier block structured languages particularly algol scheme blocks implemented three binding constructs codice_4 codice_10 codice_11 instance following construct creates block symbol called codice_12 bound number 10 let var 10 blocks nested create arbitrarily complex block structures according need programmer use block structuring create local bindings alleviates risk namespace collision otherwise occur one variant codice_4 codice_10 permits bindings refer variables defined earlier construct thus variant codice_11 designed enable mutually recursive procedures bound one another === 1 0 1 0 2 1 2 2 3 2 3 3 4 4 5 4 5 5 procedures bound single codice_11 may refer one another name well values variables defined earlier codice_11 may refer values defined later codice_11 variant codice_4 named let form identifier codice_4 keyword binds let variables argument procedure whose name given identifier whose body body let form body may repeated desired calling procedure named let widely used implement iteration example simple counter === 1 2 3 4 5 6 7 8 9 10 like procedure scheme procedure created named let first class object scheme iteration construct codice_21 idiomatic scheme use tail recursion express iteration standard-conforming scheme implementations required optimize tail calls support unbounded number active tail calls r5rs sec 3.5 \u2014a property scheme report describes proper tail recursion \u2014making safe scheme programmers write iterative algorithms using recursive structures sometimes intuitive tail recursive procedures named codice_4 form provide support iteration using tail recursion === 0 1 4 9 16 25 36 49 64 81 continuations scheme first-class objects scheme provides procedure codice_23 also known codice_24 capture current continuation packing escape procedure bound formal argument procedure provided programmer r5rs sec 6.4 first-class continuations enable programmer create non-local control constructs iterators coroutines backtracking continuations used emulate behavior return statements imperative programming languages following function codice_25 given function codice_26 list codice_27 returns first element codice_28 codice_27 codice_30 returns true === 7 === f following example traditional programmer puzzle shows scheme handle continuations first-class objects binding variables passing arguments procedures let* yin executed code displays counting sequence codice_31 contrast common lisp data procedures scheme share common namespace whereas common lisp functions data separate namespaces making possible function variable name requiring special notation referring function value sometimes known lisp-1 vs. lisp-2 distinction referring unified namespace scheme separate namespaces common lisp scheme primitives used manipulate bind data used bind procedures equivalent common lisp codice_32 codice_33 primitives define f 10 f === 10 set f f f 6 f === 26 set f lambda n n 12 === 18 set f f 1 f === 13 apply 1 2 3 4 5 6 === 21 === 101 102 103 subsection documents design decisions taken years given scheme particular character direct outcomes original design scheme specifies comparatively full set numerical datatypes including complex rational types known scheme numerical tower r5rs sec 6.2 standard treats abstractions commit implementor particular internal representations numbers may quality exactness exact number produced sequence exact operations involving exact numbers\u2014inexactness thus contagious standard specifies two implementations must produce equivalent results operations resulting exact numbers r5rs standard specifies procedures codice_34 codice_35 used change exactness number codice_35 produces exact number numerically closest argument codice_34 produces inexact number numerically closest argument r6rs standard omits procedures main report specifies r5rs compatibility procedures standard library rnrs r5rs 6 r5rs standard scheme implementations required implement whole numerical tower must implement coherent subset consistent purposes implementation spirit scheme language r5rs sec 6.2.3 new r6rs standard require implementation whole tower exact integer objects exact rational number objects practically unlimited size precision implement certain procedures ... always return exact results given exact arguments r6rs sec 3.4 sec 11.7.1 example 1 exact arithmetic implementation supports exact rational complex numbers define x 1/3 1/4 -1/5 -1/3i 405/50+2/3i x === 509/60+1/3i exact x === example 2 arithmetic implementation supports neither exact rational numbers complex numbers accept real numbers rational notation define xr 1/3 1/4 -1/5 405/50 define xi -1/3 2/3 xr === 8.48333333333333 xi === 0.333333333333333 exact xr === f === f implementations conform r5rs standard second conform r6rs implement full numerical tower scheme supports delayed evaluation codice_38 form procedure codice_39 === 22 === 70 === 22 lexical context original definition promise preserved value also preserved first use codice_39 promise ever evaluated primitives produce handle values known promises used implement advanced lazy evaluation constructs streams r6rs standard longer primitives instead provided part r5rs compatibility library rnrs r5rs 6 r5rs suggested implementation codice_38 codice_39 given implementing promise procedure arguments thunk using memoization ensure ever evaluated irrespective number times codice_39 called r5rs sec 6.4 srfi 41 enables expression finite infinite sequences extraordinary economy example definition fibonacci sequence using functions defined srfi 41 define fibs stream-ref fibs 99 === 218922995834555169026 lisps specify order evaluation procedure arguments scheme order evaluation\u2014including order expression operator position evaluated\u2014may chosen implementation call-by-call basis constraint effect concurrent evaluation operator operand expressions constrained consistent sequential order evaluation r5rs sec 4.1.3 === 3 ev procedure describes argument passed returns value argument contrast lisps appearance expression operator position first item scheme expression quite legal long result expression operator position procedure calling procedure add 1 2 expressions ev ev 1 ev 2 may evaluated order long effect evaluated parallel thus following three lines may displayed order standard scheme example code executed although text one line may interleaved another would violate sequential evaluation constraint r5rs standard also later reports syntax scheme easily extended via macro system r5rs standard introduced powerful hygienic macro system allows programmer add new syntactic constructs language using simple pattern matching sublanguage r5rs sec 4.3 prior hygienic macro system relegated appendix r4rs standard high level system alongside low level macro system treated extensions scheme rather essential part language implementations hygienic macro system also called codice_44 required respect lexical scoping rest language assured special naming scoping rules macro expansion avoids common programming errors occur macro systems programming languages r6rs specifies sophisticated transformation system codice_45 available language extension r5rs scheme time define-syntax invocations macros procedures bear close resemblance\u2014both s-expressions\u2014but treated differently compiler encounters s-expression program first checks see symbol defined syntactic keyword within current lexical scope attempts expand macro treating items tail s-expression arguments without compiling code evaluate process repeated recursively macro invocations remain syntactic keyword compiler compiles code evaluate arguments tail s-expression evaluate variable represented symbol head s-expression call procedure evaluated tail expressions passed actual arguments scheme implementations also provide additional macro systems among popular ones syntactic closures explicit renaming macros codice_46 non-hygienic macro system similar codice_47 system provided common lisp inability specify whether macro hygienic one shortcomings macro system alternative models expansion scope sets provide potential solution prior r5rs scheme standard equivalent codice_48 procedure ubiquitous lisps although first lambda paper described codice_49 similar lisp function eval first revised report 1978 replaced codice_50 took two arguments second third fourth revised reports omitted equivalent codice_48 reason confusion scheme lexical scoping result evaluating expression depends evaluated instance clear whether result evaluating following expression 5 6 evaluated outer environment codice_52 defined result sum operands evaluated inner environment symbol bound value procedure result product two operands r5rs resolves confusion specifying three procedures return environments providing procedure codice_48 takes s-expression environment evaluates expression environment provided r5rs sec 6.5 r6rs extends providing procedure called codice_54 programmer specify exactly objects import evaluation environment dialects lisp including common lisp convention value codice_55 evaluates value false boolean expression scheme since ieee standard 1991 values except f including codice_55 equivalent scheme written evaluate value true boolean expression r5rs sec 6.3.1 constant representing boolean value true codice_57 lisps scheme codice_58 scheme primitive datatypes disjoint one following predicates true scheme object codice_59 codice_60 codice_61 codice_62 codice_63 codice_64 codice_65 codice_66 codice_67 r5rs sec 3.2 within numerical datatype contrast numerical values overlap example integer value satisfies codice_68 codice_69 codice_70 codice_71 codice_62 predicates time r5rs sec 6.2 scheme three different types equivalence arbitrary objects denoted three different equivalence predicates relational operators testing equality codice_73 codice_74 codice_75 type dependent equivalence operations also exist scheme codice_83 codice_84 compare two strings latter performs case-independent comparison codice_85 codice_86 compare characters codice_87 compares numbers r5rs standard standard comment scheme semicolon makes rest line invisible scheme numerous implementations supported alternative conventions permitting comments extend single line r6rs standard permits two entire s-expression may turned comment commented preceding codice_88 introduced srfi 62 multiline comment block comment may produced surrounding text codice_89 codice_90 scheme input output based port datatype r5rs sec 6.6 r5rs defines two default ports accessible procedures codice_91 codice_92 correspond unix notions standard input standard output implementations also provide codice_93 redirection input standard output supported standard standard procedures codice_94 codice_95 implementations provide string ports similar redirection capabilities enabling many normal input-output operations performed string buffers instead files using procedures described srfi 6 r6rs standard specifies much sophisticated capable port procedures many new types port following examples written strict r5rs scheme example 1 output defaulting current-output-port example 2 1 using optional port argument output procedures example 3 1 output redirected newly created file let hello0 lambda display hello world newline example 4 2 explicit file open port close send output file example 5 2 using call-with-output-file send output file similar procedures provided input r5rs scheme provides predicates codice_96 codice_97 character input output codice_98 codice_99 codice_100 codice_101 provided writing reading scheme expressions scheme provides codice_102 codice_103 read operation result returned end-of-file object input port reached end file tested using predicate codice_104 addition standard srfi 28 defines basic formatting procedure resembling common lisp codice_105 function named scheme procedures bound variables r5rs language standard formally mandated programs may change variable bindings built-in procedures effectively redefining r5rs language changes example one may extend codice_106 accept strings well numbers redefining set === 6 === 123 r6rs every binding including standard ones belongs library exported bindings immutable r6rs sec 7.1 redefinition standard procedures mutation forbidden instead possible import different procedure name standard one effect similar redefinition standard scheme procedures convert one datatype another contain character string name predicates end procedures change value already-allocated data end conventions often followed scheme programmers formal contexts scheme standards word procedure used preference function refer lambda expression primitive procedure normal usage words procedure function used interchangeably procedure application sometimes referred formally combination lisps term thunk used scheme refer procedure arguments term proper tail recursion refers property scheme implementations perform tail-call optimization support indefinite number active tail calls form titles standards documents since r3rs revised report algorithmic language scheme reference title algol 60 standard document revised report algorithmic language algol 60 summary page r3rs closely modeled summary page algol 60 report language formally defined standards r5rs 1998 r6rs 2007 describe standard forms keywords accompanying syntax provide control structure language standard procedures perform common tasks table describes standard forms scheme forms appear one row easily classified single function language forms marked l table classed derived library forms standard often implemented macros using fundamental forms practice making task implementation much easier languages note codice_107 defined library syntax r5rs expander needs know achieve splicing functionality r6rs longer library syntax following two tables describe standard procedures r5rs scheme r6rs far extensive summary type would practical procedures appear one row easily classified single function language string character procedures contain -ci names perform case-independent comparisons arguments upper case lower case versions character taken equal implementations take two arguments defined left optional r5rs scheme minimalism many common procedures syntactic forms defined standard order keep core language small facilitate standardization extensions scheme community scheme request implementation srfi process extension libraries defined careful discussion extension proposals promotes code portability many srfis supported scheme implementations srfis fairly wide support different implementations include elegant minimalist design made scheme popular target language designers hobbyists educators small size typical interpreter also popular choice embedded systems scripting resulted scores implementations differ much porting programs one implementation another quite difficult small size standard language means writing useful program great complexity standard portable scheme almost impossible r6rs standard specifies much broader language attempt broaden appeal programmers almost implementations provide traditional lisp-style read\u2013eval\u2013print loop development debugging many also compile scheme programs executable binary support embedding scheme code programs written languages also common relative simplicity scheme implementations makes popular choice adding scripting capabilities larger systems developed languages c. gambit chicken bigloo scheme interpreters compile scheme c makes embedding particularly easy addition bigloo compiler configured generate jvm bytecode also features experimental bytecode generator .net implementations support additional features example kawa jscheme provide integration java classes scheme c compilers often make easy use external libraries written c allowing embedding actual c code scheme source another example pvts offers set visual tools supporting learning scheme scheme widely used number schools particular number introductory computer science courses use scheme conjunction textbook structure interpretation computer programs sicp past 12 years plt run programbydesign formerly teachscheme project exposed close 600 high school teachers thousands high school students rudimentary scheme programming mit old introductory programming class 6.001 taught scheme although 6.001 replaced modern courses sicp continues taught mit textbook design programs matthias felleisen currently northeastern university used institutes higher education introductory computer science courses northeastern university worcester polytechnic institute use scheme exclusively introductory courses fundamentals computer science cs2500 introduction program design cs1101 respectively rose-hulman uses scheme advanced programming language concepts course indiana university introductory class c211 taught entirely scheme introductory class uc berkeley cs 61a 2015 taught entirely scheme save minor diversions logo demonstrate dynamic scope course materials including lecture webcasts available online free charge self-paced version course cs 61as continues use scheme introductory computer science courses yale grinnell college also taught scheme programming design paradigms mandatory course computer science graduate students northeastern university also extensively uses scheme introductory computer science course university minnesota twin cities csci 1901 also uses scheme primary language followed course introduces students java programming language software industry tata consultancy services asia largest software consultancy firm uses scheme month-long training program fresh college graduates scheme is/was also used following", + "neighbors": [ + 19, + 22, + 27, + 29, + 46, + 56, + 134, + 152, + 170, + 173, + 194, + 203, + 249, + 251, + 292, + 301, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 386, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 509, + 521, + 536, + 538, + 565, + 567, + 579, + 594, + 597, + 601, + 649, + 653, + 682, + 693, + 735, + 753, + 756, + 782, + 787, + 789, + 790, + 795, + 820, + 825, + 828, + 831, + 834, + 873, + 919, + 926, + 929, + 934, + 947, + 948, + 959, + 978, + 987, + 990, + 1006, + 1010, + 1021, + 1066, + 1076, + 1088, + 1111, + 1118, + 1119, + 1120, + 1123, + 1138, + 1146, + 1173, + 1180, + 1190, + 1207, + 1225, + 1245, + 1251, + 1264, + 1277, + 1298, + 1302, + 1311, + 1315, + 1324, + 1372, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1418, + 1457, + 1466, + 1477, + 1491, + 1516, + 1536, + 1588, + 1609, + 1626, + 1633, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1431, + "label": 7, + "text": "Salesforce.com:salesforce.com salesforce.com inc. usually abbreviated sf sfdc american cloud-based software company headquartered san francisco california though bulk revenue comes customer-relationship management crm service salesforce training also sells complementary suite enterprise applications focused customer service marketing automation analytics application development salesforce ranked first fortune 100 best companies work 2018 company founded 1999 former oracle executive marc benioff parker harris dave moellenhoff frank dominguez company specializing software service saas harris moellenhoff dominguez three software developers previously consulting firm left coast software introduced benioff friend former oracle colleague bobby yazdani harris team wrote initial sales automation software launched first customers sept-nov 1999 june 2004 company initial public offering new york stock exchange stock symbol crm raised us 110 million early investors include larry ellison magdalena yesil halsey minor stewart henderson mark iscaro igor sill geneva venture partners july 2012 salesforce applied trademark term social enterprise united states european union jamaica term widespread use describe businesses primarily social purpose successfully challenged campaign called notinourname launched social enterprise uk resulting salesforce.com withdrawing trademark application agreeing use term future marketing october 2014 salesforce announced development customer success platform tie together salesforce services including sales service marketing analytics community mobile apps october 2017 salesforce launched facebook analytics tool business-to-business marketers september 2018 salesforce partnered apple intended improving apps businesses salesforce.com customer-relationship management crm service comprises several broad categories commerce cloud sales cloud service cloud data cloud including jigsaw marketing cloud community cloud including chatter analytics cloud app cloud iot 100,000 customers salesforce primary enterprise offering within salesforce platform provides companies interface case management task management system automatically routing escalating important events salesforce customer portal provides customers ability track cases includes social networking plug-in enables user join conversation company social networking web sites provides analytical tools services including email alert google search access customers entitlement contracts lightning platform also known force.com platform service paas allows developers create add-on applications integrate main salesforce.com application third-party applications hosted salesforce.com infrastructure force.com applications built using declarative tools backed lightning apex proprietary java-like programming language force.com lightning visualforce framework includes xml syntax typically used generate html force.com platform typically receives three complete releases year platform provided service developers every single development instance also receives updates spring 2015 release new framework building user interfaces \u2013 lightning components \u2013 introduced beta lightning components built using open-source aura framework support apex server-side language instead aura javascript dependency described alternative necessarily replacement visualforce pages according september 2009 gartner group report force.com 1,000 customer accounts 2013 force.com platform 1.4 million registered developers community cloud provides salesforce customers ability create online web properties external collaboration customer service channel sales custom portals instance salesforce tightly integrated sales cloud service cloud app cloud community cloud quickly customized provide wide variety web properties work.com previously rypple social performance management platform helps managers employees improve work performance continuous coaching real-time feedback recognition marketed solution sales performance customer service marketing service employed human resource departments work.com known rypple founded daniel debow david stein wanted create simple way asking feedback anonymously work company formed may 2008 client list included mozilla facebook linkedin gilt groupe rypple 'reverses onus demand feedback getting employees build manage coaching networks september 2011 rypple announced hired bohdan zabawskyj chief technology officer 2011 rypple developed formalized management methodology called okr objectives key results spotify rypple also partnered facebook create loops short feedback loops gathers feedback co-workers thank progress goals coaching supervisors one channel rich robust continuous performance review december 2011 salesforce.com announced would acquire rypple transaction completed 2012 rypple rebranded work.com september 2012 launched 2005 salesforce appexchange online application marketplace third-party applications run force.com platform applications available free well via yearly monthly subscription models applications available range integrations sharepoint mobile approval management june 2016 features 2,948 applications driven 3+ million installs appexchange also place customers search cloud consulting partners help implement technology organization cloud consulting partners salesforce include large companies like ibm bluewolf accenture well smaller ones like cloudreach announced 2017 launched 2019 salesforce mytrailhead online training platform customized specific needs customers platform extends functionality salesforce built provide users training content specific usage salesforce enables users create publish training content programs announced may 29 2019 salesforce launched blockchain platform facilitate building blockchain network apps integrated crm data.com previously known jigsaw cloud-based automated system acquiring managing crm records within user salesforce.com account data.com also online business directory companies business professionals built maintained accessed worldwide community million subscribers. information consisted commonly found business card data.com competitors included services dun bradstreet/avention zoominfo data.com made three products data.com connect data.com clean data.com prospector april 2018 salesforce announced would retire data.com connect may 4 2019 salesforce also announced wind data.com clean data.com prospector services close july 31 2020 desk.com saas help desk customer support product accessible cloud desk.com owned salesforce.com previously known assistly desk.com headquartered san francisco california acquired salesforce.com 50 million 2011 assistly re-branded desk.com 2012 customer support software desk.com saas customer service application product differentiates salesforce service platform desk.com specifically targets small businesses features functions desk.com integrates variety products third-party applications including salesforce crm salesforce iq atlassian jira mailchimp apps desk.com also supports 50 languages salesforce announced retirement desk.com replacing service cloud lightning march 13 2018 new desk.com licenses sold retirement date announced march 13 2020 do.com cloud-based task management system small groups businesses introduced 2011 discontinued 2014 salesforce offer reason shutting service however provided export tool save data entered within do.com interface do.com domain sold startup 2014 salesforce users configure crm application system tabs contacts reports accounts tab contains associated information configuration done tab adding user-defined custom fields configuration also done platform level adding configured applications salesforce instance adding sets customized novel tabs specific vertical- function-level finance human resources etc features addition web interface salesforce offers soap/rest web service application programming interface api enables integration systems salesforce works model\u2013view\u2013controller architecture apex proprietary programming language provided force.com platform developers similar java c strongly typed object-oriented case-insensitive programming language following dot-notation curly-brackets syntax apex used execute programmed functions processes force.com platform including custom buttons links event handlers record insertion update deletion via scheduling via custom controllers visualforce pages due multitenant nature platform language strictly imposed governor limitations guard code monopolizing shared resources salesforce provides series asynchronous processing methods apex allow developers produce longer-running complex apex code 2014 salesforce made public front end platform called lightning component-based framework salesforce mobile app built salesforce built framework 2015 releasing lightning design system html style framework default css styling built framework allows customers build components either use internal instances sell appexchange salesforce lightning app builder tool rapid application development responsive web interfaces interface allows different screens put together based lightning components used layouts records specific applications lightning experience new redesigned interface salesforce processes enhancement released 2016 since apps available appexchange need lightning built classic migrate lightning classic updated salesforce platform offers option developers employ migration techniques enable new user interface switch lightning salesforce headquartered san francisco regional headquarters morges switzerland covering europe middle east africa singapore india covering asia pacific minus japan tokyo covering japan major offices toronto chicago new york city london sydney dublin hyderabad san mateo california indianapolis hillsboro oregon salesforce.com services translated 16 different languages july 31 2011 104,000 customers 2.1 million subscribers salesforce move midwest regional headquarters indianapolis 2017 standard poor included salesforce time fastenal p 500 index september 2008 following federal takeover fannie mae freddie mac removal index fiscal year 2018 salesforce reported earnings us 127 million annual revenue us 10.480 billion increase 24.9 previous fiscal cycle salesforce shares traded 131 per share market capitalization us 102.5 billion october 2018 salesforce ranked 285 2018 fortune 500 list largest united states companies revenue salesforce migrated dell servers advanced micro devices processors running linux sun fire e25k servers sparc processors running solaris 2008 company uses momentum platform message systems allow customers send large amounts email 2012 salesforce announced plans build data center uk handle european citizens personal data 2013 salesforce oracle announced nine-year partnership salesforce use oracle linux oracle exadata oracle database java platform power salesforce applications saas platform 2016 salesforce announced use amazon web services hosting countries restrictive data residency requirements salesforce data centers operating july 2017 first salesforce instance went live canada salesforce announcing enabled signing number canadian customers following list acquisitions salesforce november 2007 successful phishing attack salesforce employee compromised contact information number salesforce customers used send highly targeted phishing emails salesforce stated phisher tricked someone disclosing password intrusion stem security flaw salesforce.com application database phishing breach cited example crm industry needs greater security users threats spam crowd-sourced method building business contacts proven popular recruiters marketers sales professionals also raised questions privacy site database entered without permission person listed data.com however make easy remove business information request noted december 2009 techcrunch however recipients messages regard spam least one complaint receiving spam attempting remove one address noted 2017 def con salesforce director offensive security security engineer fired conference room floor front several attendees executive company giving talk word rapidly spread two speakers released event presentation initially signed company however salesforce management team unexplained sudden change heart hour event salesforce director offensive security turned phone prior presentation unable receive communication salesforce prior presentation reaction firings swift electronic frontier foundation providing representation fired employees members security community opining salesforce undermined credibility security community significant degree perceived security community n't top list things care presented meatpistol tool anticipated released open source time presentation salesforce continues hold back releasing code developers public terminated employees continued call company open-source software not-for-profit organization refugee immigrant center education legal services raices rejected us 250,000 philanthropic donation salesforce company contracts customs border patrol sic executive director raices jonathan ryan tweeted comes supporting oppressive inhumane illegal policies want clear right action stop reference rejected donation salesforce ceo marc benioff responded official statement company employees dont work cbp regarding separation families cbp customer follows tos dont agreement ice 'm proud men women protect serve country every day 'm proud ohana reported change acceptable-use policy salesforce barring customers using system sell semiautomatic guns firearms march 2019 salesforce faced lawsuit 50 anonymous women claiming victims survivors sex trafficking abuse rape alleges company profited knowingly facilitated sex trafficking web site backpage.com defunct since april 2018 lawsuit also pointed ironically salesforce publicly promoting anti-human trafficking campaign time work backpage 2009 response financial crisis 2007\u20132008 resulting decline venture funding salesforce began investing digital companies used integrated salesforce platform. ref name= peterson bi 8/18/2018 /ref eventually became salesforce ventures headed john somorjai since various funds created focus specific areas \u2014 september 2014 sfv set salesforce1 fund aimed start-ups creating applications primarily mobile phones december 2018 salesforce ventures announced launch japan trailblazer fund focused japanese startups august 2018 salesforce ventures reported investments totaling 1.2 billion 275 companies covering wide range business models including cloud storage cloudcraze artificial intelligence figure eight online fraud prevention forter accounting project software financialforce many areas five largest investments domo data-visualization software surveymonkey online survey software twilio cloud-communication dropbox cloud storage docusign secure e-signature company account nearly half portfolio. ref name= peterson bi 11/14/2018 /ref", + "neighbors": [ + 77, + 211, + 266, + 480, + 505, + 556, + 611, + 671, + 857, + 936, + 1019, + 1036, + 1048, + 1377, + 1416, + 1431, + 1447, + 1470 + ], + "mask": "Validation" + }, + { + "node_id": 1432, + "label": 7, + "text": "Cloud_Elements:cloud elements cloud elements cloud api integration platform enables developers publish integrate aggregate manage apis unified platform using cloud elements developers quickly connect entire categories cloud services e.g. crm documents finance using uniform apis simply synchronize data multiple cloud services e.g salesforce zendesk quickbooks using innovative integration toolkit founded october 2012 cloud elements purpose built developers help organize world apis one-to-many approach \u2018 visionary \u2019 api management according gartner inc. cloud elements headquartered denver co serves customers worldwide information found www.cloud-elements.com cloud elements accelerates api integrations innovative api hub technology providing uniform apis developers use easily make apis work together past years developers published millions unique apis one island data bigger challenge integrate apis together order synchronize data build new apps faster october 2012 cloud elements founded ceo mark geene cto vineet joshi vp product development atul barve three shared vision help developers build cloud applications faster lower cost ... since start company cloud elements grown 100 employees work together bring api integrations business sizes july 18 2014 company announced receiving 3.1 million series funding round investors include virginia-based grotech ventures california-based icon venture partners along galvanize ventures january 9 2017 company announced receiving 13 million funding reach series b funding led harbert growth partners allow cloud elements continue revenue increase nearly 40 percent quarter-over-quarter sapphire 2018 sap launched sap cloud platform open connectors purpose built api integration platform leveraging cloud elements catalog feature-rich connectors 150 leading enterprise saas applications cloud elements created offer cloud applications hubs provide restful apis json payloads cloud elements differentiates one-to-many api lets developers integrate maintain several services elements category within hubs connector \u201c elements \u201d provide variety advanced features built cloud elements \u2019 api integration platform puts data center company application ecosystem provide virtual data hub puts data model center integration strategy making easier manage integrate data additionally cloud elements provides normalized consistent apis across entire catalog elements eliminate need experts every endpoint finally platform allows service embedded app customers convenience virtual data resources vdr provide canonicalized view data objects eliminating need point-to-point mapping data every new application putting data models center application ecosystem enables management company \u2019 data enriched api models maintained cloud elements make easier map defined resources required endpoints traditional integration platforms point-to-point meaning new application needs connected directly every application ecosystem point-to-point integration best solution external integration embedded platform makes difficult scale effectively use ce \u2019 vdr created ui easily maps domain model cloud services use allow directly write integrations also offer vdr templates pre-written templates common resources used customers pre-mapping multiple endpoints", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1433, + "label": 4, + "text": "List_of_security_hacking_incidents:list security hacking incidents timeline computer security hacker history covers important noteworthy events history security hacking cracking", + "neighbors": [ + 14, + 17, + 149, + 186, + 293, + 363, + 373, + 379, + 450, + 491, + 518, + 528, + 703, + 739, + 783, + 966, + 1019, + 1138, + 1246, + 1287, + 1327, + 1436, + 1573, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 1434, + "label": 0, + "text": "Artificial_grammar_learning:artificial grammar learning artificial grammar learning agl paradigm study within cognitive psychology linguistics goal investigate processes underlie human language learning testing subjects ability learn made-up grammar laboratory setting developed evaluate processes human language learning also utilized study implicit learning general sense area interest typically subjects ability detect patterns statistical regularities training phase use new knowledge patterns testing phase testing phase either use symbols sounds used training phase transfer patterns another set symbols sounds surface structure many researchers propose rules artificial grammar learned implicit level since rules grammar never explicitly presented participants paradigm also recently utilized areas research language learning aptitude structural priming investigate brain structures involved syntax acquisition implicit learning apart humans paradigm also used investigate pattern learning species e.g cottontop tamarins starlings half century ago george a. miller established paradigm artificial grammar learning order investigate influence explicit grammar structures human learning designed grammar model letters different sequences research demonstrated easier remember structured grammar sequence random sequence letters explanation learners could identify common characteristics learned sequences accordingly encode memory set predicted subjects could identify letters likely appear together sequence repeatedly letters would subjects would use information form memory sets memory sets served participants strategy later memory tests reber doubted miller explanation claimed participants could encode grammar rules productive memory sets able verbalize strategy detail conducted research led development modern agl paradigm research used synthetic grammar learning model test implicit learning agl became used tested model field original paradigm developed miller participants asked memorize list letter strings created artificial grammar rule model test phase participants told set rules behind letter sequences memorized instructed categorize new letter strings based set rules previously exposed classified new letter strings grammatical constructed grammar rule vs. randomly constructed sequences subjects correctly sorted new strings chance level could inferred subjects acquired grammatical rule structure without explicit instruction rules reber found participants sorted new strings chance level reported using strategies sorting task could actually verbalize strategies subjects could identify strings grammatically correct could identify rules composed grammatical strings research replicated expanded upon many others conclusions studies congruent reber hypothesis implicit learning process done intentional learning strategies studies also identified common characteristics implicitly acquired knowledge modern agl paradigm used investigate explicit implicit learning although often used test implicit learning typical agl experiment participants required memorize strings letters previously generated specific grammar length strings usually ranges 2-9 letters per string example grammar shown figure 1 figure 1 example artificial grammar rule order compose grammatically ruleful string letters according predetermined grammar rule subject must follow rules pairing letters represented model figure 1 observing violation grammatical rule system composes string considered unruleful randomly constructed string case standard agl implicit learning task subjects told strings based specific grammar instead simply given task memorize letter strings memory learning phase subjects told letter strings presented learning phase based specific rules explicitly told rules test phase subjects instructed categorize new letter strings ruleful unruleful dependent variable usually measured percentage correctly categorized strings implicit learning considered successful percentage correctly sorted strings significantly higher chance level significant difference found indicates existence learning process involved memorizing presented letter strings mechanism behind implicit learning hypothesized occur people engage artificial grammar learning statistical learning specifically bayesian learning bayesian learning takes account types biases prior probability distributions individuals contribute outcome implicit learning tasks biases thought probability distribution contains probability possible hypothesis likely correct due structure bayesian model inferences output model form probability distribution rather single probable event output distribution posterior probability distribution posterior probability hypothesis original distribution probability hypothesis true given data probability data given hypothesis true bayesian model learning fundamental understanding pattern detection process involved implicit learning therefore mechanisms underlie acquisition artificial grammar learning rules hypothesized implicit learning grammar involves predicting co-occurrences certain words certain order example dog chased ball sentence learned grammatically correct implicit level due high co-occurrence chase one words follow dog sentence like dog cat ball implicitly recognized grammatically incorrect due lack utterances contain words paired specific order process important teasing apart thematic roles parts speech grammatical processing see grammar labeling thematic roles parts speech explicit identification words parts speech implicit traditional approaches agl claim stored knowledge obtained learning phase abstract approaches argue stored knowledge concrete consists exemplars strings encountered learning phase chunks exemplars case assumed information stored memory retrieved test phase used aid decisions letter strings 3 main approaches attempt explain agl phenomena research amnesia patients suggests dual factor approach may accurate model series experiments amnesiac patients support idea agl involves abstract concepts concrete exemplars amnesiacs able classify stimuli grammatical vs. randomly constructed well participants control group able successfully complete task amnesiacs able explicitly recall grammatical chunks letter sequence control group able explicitly recall performing task grammar rules different sequence letters previously tested amnesiacs control group able complete task although performance better task completed using set letters used training results experiment support dual factor approach artificial grammar learning people use abstract information learn rules grammars use concrete exemplar-specific memory chunks since amnesiacs unable store specific chunks memory completed task using abstract set rules control group able store specific chunks memory evidenced recall store examples memory later reference agl research criticized due automatic question agl considered automatic process encoding see encoding memory performance automatic sense occurring without conscious monitoring without conscious guidance performer \u2019 intentions case agl claimed implicit learning automatic process due fact done intention learning specific grammar rule complies classic definition automatic process fast unconscious effortless process may start unintentionally aroused continues without ability stop ignore consequences definition challenged many times alternative definitions automatic process given reber presumption agl automatic could problematic implying unintentional process automatic process essence focusing agl tests issues need addressed process complex contains encoding recall retrieval encoding retrieval could interpreted automatic processes since encoded learning stage necessary task intentionally performed test stage researchers need differentiate implicitness referring process learning knowledge encoding also referring performance test phase knowledge retrieval knowledge encoded training may include many aspects presented stimuli whole strings relations among elements etc. contribution various components performance depends specific instruction acquisition phase requirements retrieval task therefore instructions every phase important order determine whether stage require automatic processing phase evaluated automaticity separately one hypothesis contradicts automaticity agl mere exposure effect mere exposure effect increased affect towards stimulus result nonreinforced repeated exposure stimulus results 200 experiments effect indicate positive relationship mean goodness rating frequency stimulus exposure stimuli experiments included line drawings polygons nonsense words types stimuli used agl research experiments exposed participants stimulus 25 times following exposure participants asked rate degree stimulus suggested good vs. bad effect 7-point scale addition main pattern results also found several experiments participants rated higher positive affect previously exposed items novel items since implicit cognition reference previous study episodes effects affect ratings observed processing stimuli truly implicit results experiments suggests different categorization strings may occur due differences affect associated strings due implicitly learned grammar rules since advent computers artificial intelligence computer programs adapted attempt simulate implicit learning process observed agl paradigm ai programs first adapted simulate natural artificial grammar learning used following basic structure early model ai grammar learning wolff snpr system program acquires series letters pauses punctuation words sentences program examines string subsets looks common sequences symbols defines chunks terms sequences chunks akin exemplar-specific chunks described agl model acquires chunks exposure chunks begin replace sequences unbroken letters chunk precedes follows common chunk model determines disjunctive classes terms first set example model encounters the-dog-chased the-cat-chased classifies dog cat members class since precede chase model sorts chunks classes explicitly define groups e.g. noun verb early ai models grammar learning ignored importance negative instances grammar effect grammar acquisition also lacking ability connect grammatical rules pragmatics semantics newer models attempted factor details unified model attempts take factors account model breaks grammar according cues languages mark case roles using five possible cue types word order case marking agreement intonation verb-based expectation see grammar influence cue language grammar determined cue strength cue validity values determined using formula except cue strength defined experimental results cue validity defined corpus counts language databases formula cue strength/validity follows cue availability proportion times cue available times needed cue reliability proportion times cue correct total occurrences cue incorporating cue reliability along cue availability unified model able account effects negative instances grammar since takes accuracy frequency account result also accounts semantic pragmatic information since cues produce grammar appropriate context low cue strength cue validity macwhinney model also simulates natural grammar learning attempts model implicit learning processes observed agl paradigm contemporary studies agl attempted identify structures involved acquisition grammar implicit learning agrammatic aphasic patients see agrammatism tested agl paradigm results show breakdown language agrammatic aphasia associated impairment artificial grammar learning indicating damage domain-general neural mechanisms sub serving language sequential learning de vries barth maiworm knecht zwitserlood fl\u00f6el found electrical stimulation broca area enhances implicit learning artificial grammar direct current stimulation may facilitate acquisition grammatical knowledge finding potential interest rehabilitation aphasia petersson vasiliki hagoort examine neurobiological correlates syntax processing structured sequences comparing fmri results artificial natural language syntax argue chomsky hierarchy directly relevant neurobiological systems agl testing", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1435, + "label": 7, + "text": "Animaker:animaker animaker diy video animation software software cloud-based launched 2014 allows users create animated videos using pre-built characters templates 2017 animaker became first tool launch animated vertical video creator animaker cloud-based video animation software first launched open beta version 2014 february 2015 software officially launched based freemium model allowed users free account option software provides online tools create edit video animation software developed animaker inc video based saas company founded rs raghavan animaker uses html5 adobe flash create animated videos exported facebook youtube downloaded mp4 file software also available chrome extension chrome web store", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1436, + "label": 4, + "text": "EternalBlue:eternalblue eternalblue cyberattack exploit developed u.s. national security agency nsa according testimony former nsa employees leaked shadow brokers hacker group april 14 2017 one month microsoft released patches vulnerability may 12 2017 worldwide wannacry ransomware used exploit attack unpatched computers june 27 2017 exploit used help carry 2017 notpetya cyberattack unpatched computers exploit also reported used since march 2016 chinese hacking group buckeye apt3 likely found re-purposed tool well reported used part retefe banking trojan since least september 5 2017 eternalblue exploits vulnerability microsoft implementation server message block smb protocol vulnerability denoted entry common vulnerabilities exposures cve catalog vulnerability exists smb version 1 smbv1 server various versions microsoft windows mishandles specially crafted packets remote attackers allowing execute arbitrary code target computer nsa alert microsoft vulnerabilities held five years breach forced hand agency warned microsoft learning eternalblue \u2019 possible theft allowing company prepare software patch issued march 2017 delaying regular release security patches february 2017 tuesday march 14 2017 microsoft issued security bulletin ms17-010 detailed flaw announced patches released windows versions currently supported time windows vista windows 7 windows 8.1 windows 10 windows server 2008 windows server 2012 windows server 2016 many windows users installed patches two months later may 12 2017 wannacry ransomware attack used eternalblue vulnerability spread next day microsoft released emergency security patches unsupported windows xp windows 8 windows server 2003 february 2018 eternalblue ported windows operating systems since windows 2000 risksense security researcher sean dillon eternalchampion eternalromance two exploits originally developed nsa leaked shadow brokers also ported event made available open sourced metasploit modules end 2018 millions systems still vulnerable eternalblue led millions dollars damages due primarily ransomware worms following massive impact wannacry notpetya badrabbit caused 1 billion worth damages 65 countries using eternalblue either initial compromise vector method lateral movement may 2019 baltimore struggled cyberattack digital extortionists using eternalblue attack froze thousands computers shut email disrupted real estate sales water bills health alerts many services since 2012 four baltimore city chief information officers fired resigned two left investigation eternalblue tool relies flaw microsoft software though company issued patch leakers posted tools online many systems remain vulnerable two years later existence patch prompted security researchers argue saturday responsibility baltimore breach lies city security consultant rob graham wrote tweet \u201c organization substantial numbers windows machines gone 2 years without patches \u2019 squarely fault organization eternalblue \u201d according microsoft united states nsa responsible dint controversial strategy stockpiling vulnerabilities least preventing microsoft timely public patching presumably hidden bugs eternalrocks microbotmassivenet computer worm infects microsoft windows uses seven exploits developed nsa comparatively wannacry ransomware program infected 230,000 computers may 2017 uses two nsa exploits making researchers believe eternalrocks significantly dangerous worm discovered via honeypot eternalblue among several exploits used conjunction doublepulsar backdoor implant tool eternalrocks first installs tor private network conceals internet activity access hidden servers brief 24 hour incubation period server responds malware request downloading self-replicating host machine malware even names wannacry avoid detection security researchers unlike wannacry eternalrocks possess kill switch ransomware", + "neighbors": [ + 11, + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 647, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1433, + 1467, + 1475, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1437, + "label": 9, + "text": "Data_type:data type computer science computer programming data type simply type attribute data tells compiler interpreter programmer intends use data programming languages support common data types real integer boolean data type constrains values expression variable function might take data type defines operations done data meaning data way values type stored type value expression may take value data types used within type systems offer various ways defining implementing using different type systems ensure varying degrees type safety almost programming languages explicitly include notion data type though different languages may use different terminology common data types include example java programming language type int represents set 32-bit integers ranging value \u22122,147,483,648 2,147,483,647 well operations performed integers addition subtraction multiplication colors hand represented three bytes denoting amounts red green blue one string representing color name allowable operations include addition subtraction multiplication programming languages also allow programmer define additional data types usually combining multiple elements types defining valid operations new data type example programmer might create new data type named complex number would include real imaginary parts data type also represents constraint placed upon interpretation data type system describing representation interpretation structure values objects stored computer memory type system uses data type information check correctness computer programs access manipulate data data types statistics comparable types computer programming vice versa shown following table identified five definitions type used\u2014sometimes implicitly\u2014in literature types including behavior align closely object-oriented models whereas structured programming model would tend include code called plain old data structures five types definition terms representation often done imperative languages algol pascal definition terms value space behaviour used higher-level languages simula clu primitive data types typically types built-in basic language implementation data computers based digital electronics represented bits alternatives 0 1 lowest level smallest addressable unit data usually group bits called byte usually octet 8 bits unit processed machine code instructions called word typically 32 64 bits instructions interpret word binary number 32-bit word represent unsigned integer values 0 formula_1 signed integer values formula_2 formula_3 two complement machine language machine n't need distinguish unsigned signed data types part floating point numbers used floating point arithmetic use different interpretation bits word see https //en.wikipedia.org/wiki/floating-point_arithmetic details machine data types need exposed made available systems low-level programming languages allowing fine-grained control hardware c programming language instance supplies integer types various widths codice_1 codice_2 corresponding native type exist target platform compiler break code using types exist instance 32-bit integer requested 16 bit platform compiler tacitly treat array two 16 bit integers higher level programming machine data types often hidden abstracted implementation detail would render code less portable exposed instance generic codice_3 type might supplied instead integers specific bit-width boolean type represents values true false although two values possible rarely implemented single binary digit efficiency reasons many programming languages explicit boolean type instead interpreting instance 0 false values true boolean data refers logical structure language interpreted machine language case boolean 0 refers logic false true always non zero especially one known boolean 1 composite types derived one primitive type done number ways ways combined called data structures composing primitive type compound type generally results new type e.g array-of-integer different type integer many others possible tend variations compounds example linked list store data array provides sequential access rather random built records dynamic memory though arguably data structure rather type per se also common distinct enough including discussion composite types justified enumerated type distinct values compared assigned necessarily particular concrete representation computer memory compilers interpreters represent arbitrarily example four suits deck playing cards may four enumerators named club diamond heart spade belonging enumerated type named suit variable v declared suit data type one assign four values implementations allow programmers assign integer values enumeration values even treat type-equivalent integers character string types store sequences characters character set ascii since character sets include digits possible numeric string codice_7 however many languages treat belonging different type numeric value codice_8 character string types different subtypes according required character width original 7-bit wide ascii found limited superseded 8 16-bit sets encode wide variety non-latin alphabets hebrew chinese symbols strings may either stretch-to-fit fixed size even programming language may also subtyped maximum size note strings primitive languages instance c composed array characters types based derived basic types explained languages c functions type derived type return value main non-composite derived type pointer data type whose value refers directly points another value stored elsewhere computer memory using address primitive kind reference everyday terms page number book could considered piece data refers another one pointers often stored format similar integer however attempting dereference look pointer whose value never valid memory address would cause program crash ameliorate potential problem pointers considered separate type type data point even underlying representation type specify implementation abstract data type instance stack abstract type implemented array contiguous block memory containing multiple values linked list set non-contiguous memory blocks linked pointers abstract types handled code know care underlying types contained programming agnostic concrete data types called generic programming arrays records also contain underlying types considered concrete specify contents elements laid memory examples include convenience high-level languages may supply ready-made real world data types instance times dates monetary values memory even language allows built primitive types type system associates types computed values examining flow values type system attempts prove type errors occur type system question determines constitutes type error type system generally seeks guarantee operations expecting certain kind value used values operation make sense compiler may use static type value optimize storage needs choice algorithms operations value many c compilers data type example represented 32 bits accord ieee specification single-precision floating point numbers thus use floating-point-specific microprocessor operations values floating-point addition multiplication etc. depth type constraints manner evaluation affect typing language programming language may associate operation varying concrete algorithms type case type polymorphism type theory study type systems although concrete type systems programming languages originate practical issues computer architecture compiler implementation language design type systems may variously static dynamic strong weak typing forth", + "neighbors": [ + 65, + 117, + 271, + 292, + 301, + 306, + 308, + 378, + 412, + 521, + 538, + 579, + 752, + 753, + 782, + 799, + 820, + 919, + 978, + 1044, + 1221, + 1225, + 1302, + 1320, + 1372, + 1398, + 1413, + 1477, + 1626, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1438, + "label": 5, + "text": "Resource_Reservation_Protocol:resource reservation protocol resource reservation protocol rsvp transport layer protocol designed reserve resources across network quality service qos using integrated services model rsvp operates ipv4 ipv6 provides receiver-initiated setup resource reservations multicast unicast data flows transport application data similar control protocol like internet control message protocol icmp internet group management protocol igmp rsvp described rsvp used hosts routers request deliver specific levels qos application data streams flows rsvp defines applications place reservations relinquish reserved resources longer required rsvp operation generally result resources reserved node along path rsvp routing protocol designed interoperate current future routing protocols rsvp rarely deployed telecommunications networks today traffic engineering extension rsvp rsvp-te becoming widely accepted nowadays many qos-oriented networks next steps signaling nsis proposed replacement rsvp basic concepts rsvp originally proposed rsvp93 zhang l. deering s. estrin d. shenker s. d. zappala rsvp new resource reservation protocol ieee network september 1993 rsvp described series rfc documents ietf two key concepts rsvp reservation model flowspec filterspec rsvp reserves resources flow flow identified destination address protocol identifier optionally destination port multiprotocol label switching mpls flow defined label switched path lsp flow rsvp also identifies particular quality service required flow although understand specific information flow qos qos specific information called flowspec rsvp passes flowspec application hosts routers along path systems analyse flowspec accept reserve resources flowspec consists filterspec defines set packets shall affected flowspec i.e data packets receive qos defined flowspec filterspec typically selects subset packets processed node selection depend attribute packet e.g sender ip address port currently defined rsvp reservation styles rsvp reservation request consists flowspec filterspec pair called flowdescriptor effects node spec flowspec sets parameters packet scheduler node filterspec sets parameters packet classifier two primary types messages data objects rsvp messages transmitted order complete list rsvp messages date objects see rfc 2205 rsvp host needs send data flow specific qos transmit rsvp path message every 30 seconds travel along unicast multicast routes pre-established working routing protocol path message arrives router understand rsvp router forwards message without interpreting contents message reserve resources flow want listen send corresponding resv short reserve message traces path backwards sender resv message contains flow specs router receives rsvp resv message resv message also filterspec object defines packets receive requested qos defined flowspec simple filter spec could sender \u2019 ip address optionally udp tcp port", + "neighbors": [ + 52, + 109, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 1116, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1443, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1439, + "label": 4, + "text": "The_Diana_Initiative:diana initiative diana initiative computer security conference based las vegas nevada aimed supporting women cybersecurity first diana initiative conference took place 2017 diana initiative founded cheryl biswas virginia robbins pablo breuer elizabeth etherington michael smith 2019 conference held westin las vegas def con", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1440, + "label": 0, + "text": "Text_simplification:text simplification text simplification operation used natural language processing modify enhance classify otherwise process existing corpus human-readable text way grammar structure prose greatly simplified underlying meaning information remains text simplification important area research natural human languages ordinarily contain complex compound constructions easily processed automation terms reducing language diversity semantic compression employed limit simplify set words used given texts text simplification illustrated example siddharthan 2006 first sentence contains two relative clauses one conjoined verb phrase text simplification system aims simplify first sentence second sentence \u201c ability simplify means eliminate unnecessary necessary may speak \u201d", + "neighbors": [ + 159, + 307, + 368, + 372, + 453, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1486, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1441, + "label": 2, + "text": "VS/9:vs/9 vs/9 discontinued computer operating system available univac series 90 mainframes 90/60 90/70 90/80 late 1960s 1980s 90/60 90/70 repackaged univac 9700 computers rca acquisition sperry determined rca tsos operating system far advanced univac counterpart company opted merge univac hardware rca software introduced 90/70 90/60 introduced shortly thereafter slower less expensive 90/70 introduction 90/80 vs/9 finally hardware platform optimized take full advantage capability allow interactive batch operations computer september 1971 rca decided exit mainframe computer business losing half billion dollars trying failing compete ibm assets computer division sold univac included rca spectra series computers various external hardware designs video terminals tape drives punched card readers operating system time sharing operating system tsos tsos may better operating system user standpoint ibm time operating systems considered something sold separately computer manufacturer included free part purchase price univac introduced additional new features tsos renamed vs/9 name 'tsos however remained username primary privileged system manager account unix-type systems called 'root rca also sold tsos would become fujitsu basis fujitsu bs2000 operating system mainframes name interactive use vs/9 done terminals connected terminal concentrator unit passed control signals terminals manner similar way ibm would provide ibm 3270-style terminals provided general input terminal sent response enter key opposed practice pcs taking input one character time concentrator unit originally known communications control module ccm however rca sold patents designs ccm terminal controller singer corporation univac developed emulator device ccm known multiterminal connection controller model 16 mcc-16 mcc-16 supported univac standard terminal rca renamed uniscope video display terminal vdt well ordinary ascii dumb terminals univac uniscope vdt provided sophisticated time editing capability including ability edit text screen make changes line time page time transmit text back computer vdt also supported direct cursor positioning input protection cursor indicated text cursor recognized also supported special scroll mode subset screen window instead entire screen scrolling upward last line displayed possible make scroll area bottom half screen feature split screen scroll would become available 20 years later apple ii microcomputer distinction made interactive timesharing terminals transactional terminals interactive terminals controlled directly operating system transactional terminals controlled batch program initially batch program known mcp multichannel communications program developed rca sperry batch-oriented operating systems tdos tape-disk operating system dos disk operating system became clear would phased favor much robust interactive operating system vmos mcp ported run vmos vmos virtual memory operating system became new moniker tsos rca spectra 70 models 46 61 3 7 computers initially univac series 70 formerly rca computers eventually mcp enhanced support sperry univac terminals name changed cos communication operating system ports ccm later mcc running emulation mode could designated either interactive transactional port designated interactive port controlled timesharing services integrated vmos vs/9 operating system transactional ports hand controlled cos. terminals connected ports became property respective controlling host software timesharing used program development allowing much faster program development traditional batch process state art time timesharing user task could execute programs create files request system resources needed made much possible operating system ability manage virtual memory temporarily save pages memory including executing programs disk drum use retrieve later needed virtual memory page size fixed 4096 bytes allowed many tasks running simultaneously would otherwise constrained limited expensive main memory space transactional users hand controlled single program view environment limited presented identified individual tasks ability run programs request system resources ccm mcc running emulation mode dumb hardware interfaces network protocol intelligence including terminal polling error recovery message construction resided mainframe ccm mcc simply acted conduits mainframe phone lines mcc used true front end processor much overhead polling error recovery offloaded mainframe thus freeing computer time running application programs occur vs/9 era vs/9 supported one card readers connected computer activated user placing card deck hopper pressing start button presumably computer would read source deck place cards read output hopper card deck consisted valid login would process card deck job execute vs/9 controlled computer operator central site computer operators interacted system system console initially console teletype device later upgraded video display device attached system console printer system console messages logged system console printer unsolicited messages originating operating system also logged system console printer computer operators number responsibilities one useful enhancements late life vs/9 volume groups disk technology time provided limited storage space disk since disk drives comparatively large quite expensive manufacturers disk drives provided capability physically remove actual disk device replace another customers thus ability store many times capacity disk drives albeit could necessarily used simultaneously unless enough free disk drives limited disk storage space also presented users another problem often files would larger could contained one disk volume groups helped mitigate technological problem allowing files span multiple disks volumes disks mounted simultaneously designated volume group owners could defined order limit access sensitive data mounted attached active task entire volume group could dismounted attached tasks either released terminated every disk available system part volume group even one volume group volume groups could designated removable fixed fixed volume groups could removed time necessary disks housed operating system files supported transactional terminals remote batch processing rbp capability existed vs/9 although never completely exploited probably due limited demand rbp allowed remote users submit batch jobs execution mainframe receive results back offsite printer typically remote batch device consisted card reader printer connected communication line interfaced remote batch services operating system like local batch job operators could receive requests tape disk mounts/dismounts program prompts responses questions vs/9 managed tasks task type task types could either executing programs queues pending tasks following task types used vs/9 mcp cos always type 2 tasks computer operator would see count number tasks within queue system console complete list task queues available interactive terminal administrator access via field-written program known stat200 program would scan task queues every seconds display rolling list tasks terminal screen interrupted terminated officially released product became de facto standard task monitoring vs/9 controlled access use account name user name account name 1 7 character identifier user name also 1 8 character identifier identifiers account names user names could letters numbers account name equivalent directory name unix-style user accounts note user name indicated person sharing account party using thus example account name s0103 two users whose name pat leslie account would complete identifier s0103 pat s0103 leslie files would stored directory s0103 thus could create files name note account name say pa5 user named pat identifier would pa5 pat would completely unrelated user named pat accounts could given restrictions requiring password use limits amount files amount usage time permitted usage allowing logons 5 p.m. 8 a.m. cpu limits user could also issue commands system interrupt program current session used certain amount wall-clock cpu time user terminal logged wanted start session would press red transmit key univac vdt use control-c ascii terminal vs/9 would issue following response followed slash case univac vdt prompt character looked like inverse color greater sign user would logon typing word 'logon followed identifier e.g account name comma user name password account would type comma followed password could 1 4 characters contained one spaces trailing spaces could omitted typed single quotes contained non-printable binary characters typed using letter x followed quote 8-character hexadecimal value password account s0103 password hexadecimal a0b0c0 space user leslie would logon system typing credentials incorrect either account name user name password incorrect would get message would given prompt logon credentials correct system manager owner account tsos posted system message would display time user would command mode standard prompt would appear could type various commands user would finish session typing logoff pressing transmit univac vdt control-c ascii terminal univac vdt terminal four function keys top vs/9 specifically recognized vs/9 accepted commands typing command options commands issued batch stream either cards batch file required preceded slash commands entered terminal require use slash commands included following one issued break running program break key ascii terminal f1 key univac vdt used load command instead exec one would break mode program suspended allow user command mode could issue commands well following file names could 56 characters length file could consist letters numbers dashes digits file name digits permissible file could two consecutive periods access file another account necessary user account make file public file public could accessed another user prefixing name file indicator file referenced another account dollar sign followed account name followed period file named account s0103 user account pa5 wanted access file account s0103 first file would marked public second would referenced account name name file user account pa5 wanted access file account s0103 file public would reference s0103.a note user account s0103 could reference file simply could reference fully qualified file name including dollar sign account name followed period name public files special account tsos could accessed using alone first character file unless file began name identical account number case explicit account reference tsos would required also tsos would called path name missing files referenced name found user account example file called s0103.xyzzy account tsos account system named s0103 user wanting access would access tsos.s0103.xyzzy tsos also default account file referenced exist locally example execute edt editor program one would issue command run program exec followed name file called edt user created file named edt could execute edt editor typing pressing transmit key reason created program name use system editor would type could explicitly type system account unisys discontinued sales 9000 series mainframes favor exec 8 series computers probably longer cost effective market mainframes shrank vs/9 effectively abandoned company", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1456, + 1474, + 1494, + 1530, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1442, + "label": 3, + "text": "Xploder:xploder xploder brand game cheats multimedia devices games consoles similar action replay xploder products released dreamcast ps2 playstation psp xbox gamecube n64 game boy game boy advance pc others support ps3 xbox 360 nintendo wii started 2006-2007 xploder products often bundled accessories game consoles lexar memory sticks psp x-link cable ps2 v5 media centre version newer versions xbox 360 playstation 3 allow users download saved games internet utilizing xploder disc original playstation users found possible boot backup copied versions games", + "neighbors": [ + 1253 + ], + "mask": "Test" + }, + { + "node_id": 1443, + "label": 5, + "text": "XMPP:xmpp extensible messaging presence protocol xmpp communication protocol message-oriented middleware based xml extensible markup language enables near-real-time exchange structured yet extensible data two network entities originally named jabber protocol developed homonym open-source community 1999 near real-time instant messaging im presence information contact list maintenance designed extensible protocol used also publish-subscribe systems signalling voip video file transfer gaming internet things iot applications smart grid social networking services unlike instant messaging protocols xmpp defined open standard uses open systems approach development application anyone may implement xmpp service interoperate organizations implementations xmpp open protocol implementations developed using software license many server client library implementations distributed free open-source software numerous freeware commercial software implementations also exist internet engineering task force ietf formed xmpp working group 2002 formalize core protocols ietf instant messaging presence technology xmpp working group produced four specifications rfc 3920 rfc 3921 rfc 3922 rfc 3923 approved proposed standards 2004 2011 rfc 3920 rfc 3921 superseded rfc 6120 rfc 6121 respectively rfc 6122 specifying xmpp address format 2015 rfc 6122 superseded rfc 7622 addition core protocols standardized ietf xmpp standards foundation formerly jabber software foundation active developing open xmpp extensions xmpp-based software deployed widely across internet 2003 used ten million people worldwide according xmpp standards foundation jeremie miller began working jabber technology 1998 released first version jabberd server january 4 1999 early jabber community focused open-source software mainly jabberd server major outcome proved development xmpp protocol early jabber protocol developed 1999 2000 formed basis xmpp published rfc 3920 rfc 3921 primary changes formalization ietf xmpp working group addition tls channel encryption sasl authentication note rfc 3920 rfc 3921 superseded rfc 6120 rfc 6121 published 2011 first im service based xmpp jabber.org operated continuously offered free accounts since 1999 1999 february 2006 service used jabberd server software time migrated ejabberd free software application servers january 2010 service migrated proprietary m-link server software produced isode ltd august 2005 google introduced google talk combination voip im system uses xmpp instant messaging base voice file transfer signaling protocol called jingle initial launch include server-to-server communications google enabled feature january 17 2006 google since added video functionality google talk also using jingle protocol signaling may 2013 google announced xmpp compatibility would dropped google talk server-to-server federation although would retain client-to-server support january 2008 aol introduced experimental xmpp support aol instant messenger aim service allowing aim users communicate using xmpp however march 2008 service discontinued may 2011 aol offers limited xmpp support september 2008 cisco systems acquired jabber inc. creators commercial product jabber xcp february 2010 social-networking site facebook opened chat feature third-party applications via xmpp functionality unavailable xmpp support dropped april 2014 similarly december 2011 microsoft released xmpp interface microsoft messenger service skype de facto successor also provides limited xmpp support however native xmpp implementations xmpp network uses client\u2013server architecture clients talk directly one another model decentralized anyone run server design central authoritative server services aol instant messenger windows live messenger confusion often arises point public xmpp server run jabber.org large number users subscribe however anyone may run xmpp server domain every user network unique xmpp address called jid historical reasons xmpp addresses often called jabber ids jid structured like email address username domain name ip address server user resides separated sign username example.com since user may wish log multiple locations may specify resource resource identifies particular client belonging user example home work mobile may included jid appending slash followed name resource example full jid user mobile account could username example.com/mobile resource may specified numerical value called priority messages simply sent username example.com go client highest priority sent username example.com/mobile go mobile client highest priority one largest numerical value jids without username part also valid may used system messages control special features server resource remains optional jids well means route messages based logical endpoint identifier jid instead explicit ip address present opportunities use xmpp overlay network implementation top different underlay networks one original design goals early jabber open-source community enabling users connect multiple instant messaging systems especially non-xmpp systems single client application done entities called transports gateways instant messaging protocols also protocols sms email unlike multi-protocol clients xmpp provides access server level communicating via special gateway services running alongside xmpp server user register one gateways providing information needed log network communicate users network though xmpp users thus gateways function client proxies gateway authenticates user behalf non-xmpp service result client fully supports xmpp access network gateway without extra code client without need client direct access internet however client proxy model may violate terms service protocol used although terms service legally enforceable several countries also requires user send im username password third-party site operates transport may raise privacy security concerns another type gateway server-to-server gateway enables non-xmpp server deployment connect native xmpp servers using built interdomain federation features xmpp server-to-server gateways offered several enterprise im software products including xmpp provides general framework messaging across network offers multitude applications beyond traditional instant messaging im distribution presence data several service discovery protocols exist today zeroconf service location protocol xmpp provides solid base discovery services residing locally across network availability services via presence information specified xep-0030 disco building capability support discovery across local network domains xmpp well-suited cloud computing virtual machines networks firewalls would otherwise present obstacles alternative service discovery presence-based solutions cloud computing storage systems rely various forms communication multiple levels including messaging systems relay state also migration distribution larger objects storage virtual machines along authentication in-transit data protection xmpp applied variety levels may prove ideal extensible middleware message-oriented middleware mom protocol widely known ability exchange xml-based content natively become open platform exchange forms content including proprietary binary streams full motion video fmv content transport file-based content via example jingle series extensions majority applications nothing human communications i.e. im instead provide open means support machine-to-machine peer-to-peer communications across diverse set networks xmpp implemented large number clients servers code libraries implementations provided variety software licenses original native transport protocol xmpp transmission control protocol tcp using open-ended xml streams long-lived tcp connections alternative tcp transport xmpp community also developed http transport web clients well users behind restricted firewalls original specification xmpp could use http two ways polling binding polling method deprecated essentially implies messages stored server-side database fetched posted regularly xmpp client way http 'get 'post requests binding method implemented using bidirectional-streams synchronous http bosh allows servers push messages clients soon sent push model notification efficient polling many polls return new data client uses http firewalls allow clients fetch post messages without hindrances thus scenarios tcp port used xmpp blocked server listen normal http port traffic pass without problems various websites let people sign xmpp via browser furthermore open public servers listen standard http port 80 https port 443 ports hence allow connections behind firewalls however iana-registered port bosh actually 5280 80 several large public im services natively use xmpp including livejournal lj talk nimbuzz hipchat various hosting services dreamhost enable hosting customers choose xmpp services alongside traditional web email services specialized xmpp hosting services also exist form cloud domain owners need directly run xmpp servers including cisco webex connect chrome.pl flosoft.biz i-pobox.net hosted.im largest messaging providers use using various forms xmpp based protocols backend systems without necessarily exposing fact end users includes whatsapp google talk facebook chat deprecated facebook messaging system deployments built free-software erlang-based xmpp server called ejabberd xmpp also used deployments non-im services including smart grid systems demand response applications message-oriented middleware replacement sms provide text messaging many smartphone clients xmpp de facto standard private chat gaming related platforms origin raptr playstation discontinued xfire two notable exceptions steam xbox live use proprietary messaging protocols xmpp standards foundation xsf develops publishes extensions xmpp standards process centered xmpp extension protocols xeps previously known jabber enhancement proposals jeps following extensions especially wide use xmpp features federation across domains publish/subscribe authentication security even mobile endpoints used implement internet things several xmpp extensions part experimental implementation efficient xml interchange exi format sensor data provisioning control concentrators discovery efforts documented page xmpp wiki dedicated internet things xmpp iot mailing list ietf xmpp working group produced series request comments rfc documents important widely implemented specifications xmpp often regarded competitor simple based session initiation protocol sip standard protocol instant messaging presence notification xmpp extension multi-user chat seen competitor internet relay chat irc although irc far simpler far fewer features far widely used xmpp extensions publish-subscribe provide many features advanced message queuing protocol amqp xmpp standards foundation xsf formerly jabber software foundation active developing open xmpp extensions called xep however extensions also defined individual software project organization another example federation protocol apache wave based xmpp", + "neighbors": [ + 52, + 109, + 162, + 311, + 330, + 342, + 425, + 430, + 444, + 455, + 470, + 528, + 542, + 543, + 596, + 611, + 625, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 772, + 779, + 883, + 965, + 1116, + 1159, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1448, + 1452, + 1453, + 1517, + 1552, + 1570, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1444, + "label": 4, + "text": "Data_loss_prevention_software:data loss prevention software data loss prevention software detects potential data breaches/data ex-filtration transmissions prevents monitoring detecting blocking sensitive data use endpoint actions motion network traffic rest data storage terms data loss data leak related often used interchangeably data loss incidents turn data leak incidents cases media containing sensitive information lost subsequently acquired unauthorized party however data leak possible without losing data originating side terms associated data leakage prevention information leak detection prevention ildp information leak prevention ilp content monitoring filtering cmf information protection control ipc extrusion prevention system eps opposed intrusion prevention system technological means employed dealing data leakage incidents divided categories standard security measures advanced/intelligent security measures access control encryption designated dlp systems standard security measures firewalls intrusion detection systems idss antivirus software commonly available products guard computers outsider insider attacks use firewall example prevents access outsiders internal network intrusion detection system detects intrusion attempts outsiders inside attacks averted antivirus scans detect trojan horses send confidential information use thin clients operate client-server architecture personal sensitive data stored client device advanced security measures employ machine learning temporal reasoning algorithms detecting abnormal access data e.g. databases information retrieval systems abnormal email exchange honeypots detecting authorized personnel malicious intentions activity-based verification e.g. recognition keystroke dynamics user activity monitoring detecting abnormal data access designated systems detect prevent unauthorized attempts copy send sensitive data intentionally unintentionally mainly personnel authorized access sensitive information order classify certain information sensitive use mechanisms exact data matching structured data fingerprinting statistical methods rule regular expression matching published lexicons conceptual definitions keywords network data motion technology typically installed network egress points near perimeter analyzes network traffic detect sensitive data sent violation information security policies multiple security control points may report activity analyzed central management server endpoint data use systems run internal end-user workstations servers like network-based systems endpoint-based technology address internal well external communications therefore used control information flow groups types users e.g 'chinese walls also control email instant messaging communications reach corporate archive blocked communication i.e. one never sent therefore subject retention rules identified subsequent legal discovery situation endpoint systems advantage monitor control access physical devices mobile devices data storage capabilities cases access information encrypted endpoint-based systems provide application controls block attempted transmissions confidential information provide immediate user feedback must installed every workstation network used mobile devices e.g. cell phones pdas practically installed example workstation internet caf\u00e9 dlp includes techniques identifying confidential sensitive information sometimes confused discovery data identification process organizations use dlp technology determine look data classified either structured unstructured structured data resides fixed fields within file spreadsheet unstructured data refers free-form text media text documents pdf files video estimated 80 data unstructured 20 structured data classification divided content analysis focused structured data contextual analysis looks place origin application system generated data methods describing sensitive content abundant divided precise imprecise methods precise methods involve content registration trigger almost zero false positive incidents methods imprecise include keywords lexicons regular expressions extended regular expressions meta data tags bayesian analysis statistical analysis techniques machine learning behavior analytics hierarchical threat modeling predefined dlp templates etc strength analysis engine directly relates accuracy accuracy dlp identification important lowering/avoiding false positives negatives accuracy depend many variables may situational technological testing accuracy recommended ensure virtually zero false positives/negatives high false positive rates cause system considered dld dlp sometimes data distributor gives sensitive data one third parties sometime later data found unauthorized place e.g. web user laptop distributor must investigate source leak data rest specifically refers old archived information information great concern businesses government institutions simply longer data left unused storage likely might retrieved unauthorized individuals protecting data involves methods access control data encryption data retention policies data use refers data user currently interacting dlp systems protect data in-use may monitor flag unauthorized activities activities include screen-capture copy/paste print fax operations involving sensitive data intentional unintentional attempts transmit sensitive data communication channels data motion data traversing network endpoint", + "neighbors": [ + 11, + 17, + 120, + 149, + 190, + 293, + 330, + 415, + 450, + 487, + 531, + 564, + 576, + 624, + 692, + 739, + 746, + 818, + 1090, + 1309, + 1325, + 1379 + ], + "mask": "Test" + }, + { + "node_id": 1445, + "label": 6, + "text": "List_of_default_file_systems:list default file systems default file system used various operating systems", + "neighbors": [ + 22, + 34, + 40, + 55, + 63, + 99, + 222, + 233, + 252, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 870, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 992, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1188, + 1201, + 1202, + 1234, + 1252, + 1283, + 1304, + 1322, + 1369, + 1381, + 1394, + 1459, + 1494, + 1539, + 1565, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1446, + "label": 4, + "text": "Cost-based_anti-spam_systems:cost-based anti-spam systems since spam occurs primarily cheap send proposed set solutions require senders pay cost order send spam making prohibitively expensive spammers gatekeeper would sell electronic stamps keep proceeds micropayment electronic money would paid sender recipient isp gatekeeper proof-of-work systems hashcash penny black require sender pay computational cost performing calculation receiver later verify verification must much faster performing calculation computation slows sender significantly impact receiver point slow machines send spam\u2014often millions millions every user wants send email moderate number recipients suffers seconds delay sending millions emails would take unaffordable amount time approach suffers sender maintains computation farm zombies refinement stamp systems method requiring micropayment made form penalty imposed recipient considers email abusive addresses principal objection stamp systems popular free legitimate mailing list hosts would unable continue provide services pay postage every message sent 2004 bill gates announced microsoft working solution requiring so-called \u201c unknown senders \u201d i.e senders accepted list recipient post \u201c electronic equivalent \u201d stamp whose value would lost sender recipient disapproves email gates said microsoft favors solutions short-term would rely contingent payment solution solve spam problem longer run microsoft aol well yahoo recently introduced systems allow commercial senders avoid filters obtain paid pre-paid certificate certification lost sender recipients complain approach suffers user initially signs legitimate mailing list later decides want receive e-mail lazy users simply click spam button e-mail client rather going formal unsubscription process detailed bottom message end-user gets effect either way without realizing consequences list host may face however companies implementing penalty approach certifying withdrawing certification commercial senders learned account problem setting appropriate complaint thresholds intent sender-at-risk solutions impose significant cost sender recipient rejects message subsequent receiving email deter spam making economically prohibitive send unwanted email messages allowing legitimate emailers send messages little expense anti-spam activist daniel balsam attempts make spamming less profitable bringing lawsuits spammers approach financially sustainable activist questionable whether actually reduces spam either activist anyone else", + "neighbors": [ + 229, + 285, + 354, + 515, + 617, + 1171, + 1172, + 1246, + 1249 + ], + "mask": "Test" + }, + { + "node_id": 1447, + "label": 4, + "text": "CTERA_Networks:ctera networks ctera networks privately held enterprise software company headquartered new york israel company regional offices uk italy france spain germany australia ctera partnered companies including amazon web services hewlett packard enterprise ibm clients include deutsche telekom banco santander axa united states department defense october 2016 ibm became ctera reseller ibm cloud object storage integrated ctera enterprise file services platform deployed on-premises softlayer cloud hybrid on-premises/cloud setup ctera mentioned gartner 2016 magic quadrant data center backup recovery software ctera founded 2008 liran eshel zohar kaufman company raised 9 million series funding round january 2009 led benchmark capital march 2012 ctera raised 11 million funding round lead venrock included strategic investment cisco systems participation prior investor benchmark capital raised approximately 15 million july 2014 ctera raised 25 million series c funding round led bessemer venture partners participation benchmark capital cisco venrock september 2016 ctera announced additional 25 million funding round led bessemer venture partners participation cisco new investor vintage investment partners investment considered part earlier series c funding round consisted 25 million july 2014 2016 ctera raised 70 million funding gartner named ctera one five cool venders storage technologies 2013 gartner included ctera 2015 critical capabilities enterprise endpoint backup magic quadrant enterprise file synchronization sharing efss ctera included deloitte fast 500 list technology 2015 ctera mentioned gartner 2016 magic quadrant data center backup recovery software june 2016 ctera earned contract provide private cloud file sharing solution united states department defense part agreement ctera disa defense information systems agency co-developed mutual authentication technology using government-issued smart cards additional layers protection beyond standard enterprise integration microsoft active directory servers 2009 ctera released first cloud storage gateway c200 gateway combined speed local network storage off-site cloud storage backup technology 2010 ctera released c400 cloud storage gateway added features office server backup recovery collaboration capability multiple users working files stored cloud gateway 2011 c800 gateway released 24 tb raw local storage 2016 ctera announced virtual cloud storage gateway deployed vmware kvm servers enabled customers use existing hardware ctera released updates cloud storage gateway portfolio april 2016 focused efficiency storage capacity ctera released enterprise file sync share efss 2012 enabled users access share collaborate files location storing files either locally cloud also 2012 ctera launched mobile app made possible access files backups ios android devices december 2015 ctera announced cloud server data protection storage-as-a-service server data protection software enterprise cloudops cloud server data protection protects server data private virtual private cloud using backup agents windows linux environments object storage services cloud platforms amazon web services microsoft azure ibm cloud openstack-based clouds", + "neighbors": [ + 77, + 556, + 611, + 930, + 965, + 1019, + 1036, + 1377, + 1431 + ], + "mask": "Test" + }, + { + "node_id": 1448, + "label": 5, + "text": "Session_Initiation_Protocol:session initiation protocol session initiation protocol sip signaling protocol used initiating maintaining terminating real-time sessions include voice video messaging applications sip used signaling controlling multimedia communication sessions applications internet telephony voice video calls private ip telephone systems instant messaging internet protocol ip networks well mobile phone calling lte volte protocol defines specific format messages exchanged sequence communications cooperation participants sip text-based protocol incorporating many elements hypertext transfer protocol http simple mail transfer protocol smtp call established sip may consist multiple media streams separate streams required applications text messaging exchange data payload sip message sip works conjunction several protocols specify carry session media commonly media type parameter negotiation media setup performed session description protocol sdp carried payload sip messages sip designed independent underlying transport layer protocol used user datagram protocol udp transmission control protocol tcp stream control transmission protocol sctp secure transmissions sip messages insecure network links protocol may encrypted transport layer security tls transmission media streams voice video sdp payload carried sip messages typically employs real-time transport protocol rtp secure real-time transport protocol srtp sip originally designed mark handley henning schulzrinne eve schooler jonathan rosenberg 1996 protocol standardized 1999 november 2000 sip accepted 3gpp signaling protocol permanent element ip multimedia subsystem ims architecture ip-based streaming multimedia services cellular networks june 2002 specification revised various extensions clarifications published since sip designed provide signaling call setup protocol ip-based communications supporting call processing functions features present public switched telephone network pstn vision supporting new multimedia applications extended video conferencing streaming media distribution instant messaging presence information file transfer internet fax online games sip distinguished proponents roots internet community rather telecommunications industry sip standardized primarily ietf protocols h.323 traditionally associated international telecommunication union itu sip involved signaling operations media communication session primarily used set terminate voice video calls sip used establish two-party unicast multiparty multicast sessions also allows modification existing calls modification involve changing addresses ports inviting participants adding deleting media streams sip also found applications messaging applications instant messaging event subscription notification sip works conjunction several protocols specify media format coding carry media call set call setup body sip message contains session description protocol sdp data unit specifies media format codec media communication protocol voice video media streams typically carried terminals using real-time transport protocol rtp secure real-time transport protocol srtp every resource sip network user agents call routers voicemail boxes identified uniform resource identifier uri syntax uri follows general standard syntax also used web services e-mail uri scheme used sip sip typical sip uri form nowiki sip username domainname /nowiki nowiki sip username hostport /nowiki domainname requires dns srv records locate servers sip domain hostport ip address fully qualified domain name host port secure transmission required scheme sips used sip employs design elements similar http request response transaction model transaction consists client request invokes particular method function server least one response sip reuses header fields encoding rules status codes http providing readable text-based format sip carried several transport layer protocols including transmission control protocol tcp user datagram protocol udp stream control transmission protocol sctp sip clients typically use tcp udp port numbers 5060 5061 sip traffic servers endpoints port 5060 commonly used non-encrypted signaling traffic whereas port 5061 typically used traffic encrypted transport layer security tls sip-based telephony networks often implement call processing features signaling system 7 ss7 special sip protocol extensions exist although two protocols different ss7 centralized protocol characterized complex central network architecture dumb endpoints traditional telephone handsets sip client-server protocol equipotent peers sip features implemented communicating endpoints traditional ss7 architecture use switching centers network elements use session initiation protocol communication called sip user agents user agent ua performs function user agent client uac requesting service function user agent server uas responding request thus two sip endpoints may principle operate without intervening sip infrastructure however network operational reasons provisioning public services users directory services sip defines several specific types network server elements service elements also communicates within client-server model implemented user agent clients servers user agent logical network end-point sends receives sip messages manages sip sessions user agents client server components user agent client uac sends sip requests user agent server uas receives requests returns sip response unlike network protocols fix roles client server e.g. http web browser acts client never server sip requires peers implement roles roles uac uas last duration sip transaction sip phone ip phone implements client server functions sip user agent provides traditional call functions telephone dial answer reject call hold call transfer sip phones may implemented hardware device softphone vendors increasingly implement sip standard telephony platform distinction hardware-based software-based sip phones blurred sip elements implemented basic firmware functions many ip-capable communications devices smartphones sip http user agent may identify using message header field user-agent containing text description software hardware product name user agent field sent request messages means receiving sip server evaluate information perform device-specific configuration feature activation operators sip network elements sometimes store information customer account portals useful diagnosing sip compatibility problems display service status proxy server network server uac uas components functions intermediary entity purpose performing requests behalf network elements proxy server primarily plays role routing meaning job ensure request sent another entity closer targeted user proxies also useful enforcing policy determining whether user allowed make call proxy interprets necessary rewrites specific parts request message forwarding sip proxy servers route messages one destination called forking proxies forking sip requests means multiple dialogs established single request explains need two-sided dialog identifier without contribution recipients originator could disambiguate multiple dialogs established single request sip forking refers process forking single sip call multiple sip endpoints powerful feature sip single call ring many endpoints time sip forking allows desk phone ring time mobile allowing call taken either device redirect server user agent server generates 3xx redirection responses requests receives directing client contact alternate set uris redirect server allows proxy servers direct sip session invitations external domains registrar sip endpoint provides location service accepts register requests recording address parameters user agent subsequent requests provides essential means locate possible communication peers network location service links one ip addresses sip uri registering agent multiple user agents may register uri result registered user agents receive calls uri sip registrars logical elements often co-located sip proxies improve network scalability location services may instead located redirect server session border controllers serve middle boxes user agents sip servers various types functions including network topology hiding assistance nat traversal gateways used interconnect sip network networks public switched telephone network use different protocols technologies sip text-based protocol syntax similar http two different types sip messages requests responses first line request method defining nature request request-uri indicating request sent first line response response code requests initiate functionality protocol sent user agent client server answered one sip responses return result code transaction generally indicate success failure state transaction responses sent user agent server indicating result received request several classes responses recognized determined numerical range result codes sip defines transaction mechanism control exchanges participants deliver messages reliably transaction state session controlled various timers client transactions send requests server transactions respond requests one responses responses may include provisional responses response code form 1xx one multiple final responses 2xx \u2013 6xx transactions categorized either type invite type non-invite invite transactions differ establish long-running conversation referred dialog sip include acknowledgment ack non-failing final response e.g. 200 ok session initiation protocol instant messaging presence leveraging extensions simple sip-based suite standards instant messaging presence information message session relay protocol msrp allows instant message sessions file transfer sip developer community meets regularly conferences organized sip forum test interoperability sip implementations ttcn-3 test specification language developed task force etsi stf 196 used specifying conformance tests sip implementations developing sip software deploying new sip infrastructure important test capability servers ip networks handle certain call load number concurrent calls number calls per second sip performance tester software used simulate sip rtp traffic see server ip network stable call load software measures performance indicators like answer delay answer/seizure ratio rtp jitter packet loss round-trip delay time sip connection marketing term voice internet protocol voip services offered many internet telephony service providers itsps service provides routing telephone calls client private branch exchange pbx telephone system public switched telephone network pstn services may simplify corporate information system infrastructure sharing internet access voice data removing cost basic rate interface bri primary rate interface pri telephone circuits sip trunking similar marketing term preferred service used simplify telecom infrastructure sharing carrier access circuit voice data internet traffic removing need primary rate interface pri circuits sip-enabled video surveillance cameras initiate calls alert operator events motion objects protected area sip used audio ip broadcasting applications provides interoperable means audio interfaces different manufacturers make connections one another u.s. national institute standards technology nist advanced networking technologies division provides public-domain java implementation serves reference implementation standard implementation work proxy server user agent scenarios used numerous commercial research projects supports full number extension rfcs including event notification reliable provisional responses numerous commercial open-source sip implementations exist see list sip software sip-i session initiation protocol encapsulated isup protocol used create modify terminate communication sessions based isup using sip ip networks services using sip-i include voice video telephony fax data sip-i sip-t two protocols similar features notably allow isup messages transported sip networks preserves detail available isup header important many country-specific variants isup implemented last 30 years always possible express detail using native sip message sip-i defined itu-t whereas sip-t defined via ietf rfc route concerns security calls via public internet addressed encryption sip protocol secure transmission uri scheme sips used mandate hop request forwarded target domain must secured transport layer security tls last hop proxy target domain user agent secured according local policies tls protects attackers try listen signaling link provide end-to-end security prevent espionage law enforcement interception encryption hop-by-hop every single intermediate proxy trusted end-to-end security may also achieved secure tunneling ipsec service providers offer secure connections use tls securing signaling tls connections use uris form nowiki sips user example.com /nowiki media streams separate connections signaling stream may encrypted secure real-time transport protocol srtp key exchange srtp performed sdes zrtp one may also add mikey exchange sip determine session keys use srtp", + "neighbors": [ + 52, + 109, + 162, + 309, + 311, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 552, + 596, + 625, + 672, + 684, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 833, + 837, + 849, + 875, + 883, + 991, + 1045, + 1102, + 1116, + 1185, + 1200, + 1206, + 1218, + 1314, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1416, + 1438, + 1443, + 1452, + 1453, + 1517, + 1552, + 1570 + ], + "mask": "Validation" + }, + { + "node_id": 1449, + "label": 3, + "text": "Enterprise_Storage_OS:enterprise storage os enterprise storage os also known esos linux distribution serves block-level storage server storage area network san esos composed open-source software projects required linux distribution several proprietary build install time options scst project core component esos provides back-end storage functionality esos niche linux distribution esos intended run usb flash drive type removable media secure digital compactflash etc esos memory resident operating system boot tmpfs file system initialized root file system usb flash drive image copied onto file system configuration files logs periodically written usb flash drive persistent storage user intervention configuration changes occur esos utilizes text-based user interface tui system management network configuration storage provisioning functions tui used esos written c ncurses cdk libraries used esos supports connectivity several different front-end storage area network technologies core functions supported scst third-party target drivers vendors developed scst open-source software projects commodity computing server hardware used back-end side provide underlying storage utilized front-end target interfaces esos differs popular linux distributions bootable iso image provided esos consists one archive file extracted local computer running supported operating system linux windows mac os x local computer used installing esos image usb flash drive removable media device users esos extract archive execute esos install script esos installer script prompts user installation target device writes image allow users integrate proprietary cli raid controller utilities esos usb flash drive january 16 2019 commit bfb8c55 license esos project changed gnu general public license gpl apache license version 2.0", + "neighbors": [ + 34, + 306, + 755, + 1124, + 1138, + 1252, + 1456 + ], + "mask": "Validation" + }, + { + "node_id": 1450, + "label": 7, + "text": "SciDB:scidb scidb column-oriented database management system dbms designed multidimensional data management analytics common scientific geospatial financial industrial applications developed paradigm4 co-created turing award winner michael stonebraker stonebraker claims arrays 100 times faster scidb relational dbms class problems swapping rows columns mathematical arrays put fewer restrictions data work number dimensions unlike conventionally widely used relational database management system model relation supports one dimension records according 2011 conference presentation scidb supports marilyn matz became chief executive company", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1451, + "label": 4, + "text": "Wired_Equivalent_Privacy:wired equivalent privacy wired equivalent privacy wep security algorithm ieee 802.11 wireless networks introduced part original 802.11 standard ratified 1997 intention provide data confidentiality comparable traditional wired network wep recognizable key 10 26 hexadecimal digits 40 104 bits one time widely use often first security choice presented users router configuration tools 2003 wi-fi alliance announced wep superseded wi-fi protected access wpa 2004 ratification full 802.11i standard i.e wpa2 ieee declared wep-40 wep-104 deprecated wep encryption protocol available 802.11a 802.11b devices built wpa standard available 802.11g devices however 802.11b devices later provided firmware software updates enable wpa newer devices built wep ratified wi-fi security standard 1999 first versions wep particularly strong even time released u.s. restrictions export various cryptographic technology led manufacturers restricting devices 64-bit encryption restrictions lifted increased 128-bit despite introduction 256-bit wep 128-bit remains one common implementations wep included privacy component original ieee 802.11 standard ratified 1997 wep uses stream cipher rc4 confidentiality crc-32 checksum integrity deprecated 2004 documented current standard standard 64-bit wep uses 40 bit key also known wep-40 concatenated 24-bit initialization vector iv form rc4 key time original wep standard drafted u.s. government export restrictions cryptographic technology limited key size restrictions lifted manufacturers access points implemented extended 128-bit wep protocol using 104-bit key size wep-104 64-bit wep key usually entered string 10 hexadecimal base 16 characters 0\u20139 a\u2013f character represents 4 bits 10 digits 4 bits gives 40 bits adding 24-bit iv produces complete 64-bit wep key 4 bits \u00d7 10 24 bits iv 64 bits wep key devices also allow user enter key 5 ascii characters 0\u20139 a\u2013z a\u2013z turned 8 bits using character byte value ascii 8 bits \u00d7 5 24 bits iv 64 bits wep key however restricts byte printable ascii character small fraction possible byte values greatly reducing space possible keys 128-bit wep key usually entered string 26 hexadecimal characters 26 digits 4 bits gives 104 bits adding 24-bit iv produces complete 128-bit wep key 4 bits \u00d7 26 24 bits iv 128 bits wep key devices also allow user enter 13 ascii characters 8 bits \u00d7 13 24 bits iv 128 bits wep key 152-bit 256-bit wep systems available vendors wep variants 24 bits iv leaving 128 232 bits actual protection 128 232 bits typically entered 32 58 hexadecimal characters 4 bits \u00d7 32 24 bits iv 152 bits wep key 4 bits \u00d7 58 24 bits iv 256 bits wep key devices also allow user enter 16 29 ascii characters 8 bits \u00d7 16 24 bits iv 152 bits wep key 8 bits \u00d7 29 24 bits iv 256 bits wep key two methods authentication used wep open system authentication shared key authentication open system authentication wlan client provide credentials access point authentication client authenticate access point attempt associate effect authentication occurs subsequently wep keys used encrypting data frames point client must correct keys shared key authentication wep key used authentication four-step challenge-response handshake authentication association pre-shared wep key also used encrypting data frames using rc4 first glance might seem though shared key authentication secure open system authentication since latter offers real authentication however quite reverse possible derive keystream used handshake capturing challenge frames shared key authentication therefore data easily intercepted decrypted shared key authentication open system authentication privacy primary concern advisable use open system authentication wep authentication rather shared key authentication however also means wlan client connect ap authentication mechanisms weak shared key wep deprecated favor wpa/wpa2 rc4 stream cipher traffic key must never used twice purpose iv transmitted plain text prevent repetition 24-bit iv long enough ensure busy network way iv used also opened wep related key attack 24-bit iv 50 probability iv repeat 5000 packets august 2001 scott fluhrer itsik mantin adi shamir published cryptanalysis wep exploits way rc4 ciphers iv used wep resulting passive attack recover rc4 key eavesdropping network depending amount network traffic thus number packets available inspection successful key recovery could take little one minute insufficient number packets sent ways attacker send packets network thereby stimulate reply packets inspected find key attack soon implemented automated tools since released possible perform attack personal computer off-the-shelf hardware freely available software aircrack-ng crack wep key minutes cam-winget et al surveyed variety shortcomings wep write experiments field show proper equipment practical eavesdrop wep-protected networks distances mile target also reported two generic weaknesses 2005 group u.s. federal bureau investigation gave demonstration cracked wep-protected network 3 minutes using publicly available tools andreas klein presented another analysis rc4 stream cipher klein showed correlations rc4 keystream key ones found fluhrer mantin shamir additionally used break wep wep-like usage modes 2006 bittau handley lackey showed 802.11 protocol used wep enable earlier attacks previously thought impractical eavesdropping single packet attacker rapidly bootstrap able transmit arbitrary data eavesdropped packet decrypted one byte time transmitting 128 packets per byte decrypt discover local network ip addresses finally 802.11 network connected internet attacker use 802.11 fragmentation replay eavesdropped packets crafting new ip header onto access point used decrypt packets relay buddy internet allowing real-time decryption wep traffic within minute eavesdropping first packet 2007 erik tews andrei pychkine ralf-philipp weinmann able extend klein 2005 attack optimize usage wep new attack possible recover 104-bit wep key probability 50 using 40,000 captured packets 60,000 available data packets success probability 80 85,000 data packets 95 using active techniques like deauth arp re-injection 40,000 packets captured less one minute good conditions actual computation takes 3 seconds 3 mb main memory pentium-m 1.7 ghz additionally optimized devices slower cpus attack used 40-bit keys even higher success probability 2008 payment card industry pci security standards council latest update data security standard dss prohibits use wep part credit-card processing 30 june 2010 prohibits new system installed uses wep 31 march 2009 use wep contributed tj maxx parent company network invasion use encrypted tunneling protocols e.g ipsec secure shell provide secure data transmission insecure network however replacements wep developed goal restoring security wireless network recommended solution wep security problems switch wpa2 wpa intermediate solution hardware could support wpa2 wpa wpa2 much secure wep add support wpa wpa2 old wi-fi access points might need replaced firmware upgraded wpa designed interim software-implementable solution wep could forestall immediate deployment new hardware however tkip basis wpa reached end designed lifetime partially broken officially deprecated release 802.11-2012 standard stopgap enhancement wep present early 802.11i drafts implementable hardware able handle wpa wpa2 extended iv key values 128 bits hoped eliminate duplicate iv deficiency well stop brute force key attacks became clear overall wep algorithm deficient iv key sizes would require even fixes wep2 name original algorithm dropped two extended key lengths remained eventually became wpa tkip wepplus also known wep+ proprietary enhancement wep agere systems formerly subsidiary lucent technologies enhances wep security avoiding weak ivs completely effective wepplus used ends wireless connection easily enforced remains serious limitation also necessarily prevent replay attacks ineffective later statistical attacks rely weak ivs dynamic wep refers combination 802.1x technology extensible authentication protocol dynamic wep changes wep keys dynamically vendor-specific feature provided several vendors 3com dynamic change idea made 802.11i part tkip actual wep algorithm", + "neighbors": [ + 276, + 289, + 299, + 317, + 364, + 484, + 629, + 764, + 955, + 1045, + 1278, + 1325, + 1452 + ], + "mask": "Test" + }, + { + "node_id": 1452, + "label": 5, + "text": "Secure_Shell:secure shell secure shell ssh cryptographic network protocol operating network services securely unsecured network typical applications include remote command-line login remote command execution network service secured ssh ssh provides secure channel unsecured network client\u2013server architecture connecting ssh client application ssh server protocol specification distinguishes two major versions referred ssh-1 ssh-2 standard tcp port ssh 22 ssh generally used access unix-like operating systems also used microsoft windows windows 10 uses openssh default ssh client ssh designed replacement telnet unsecured remote shell protocols berkeley rlogin rsh rexec protocols protocols send information notably passwords plaintext rendering susceptible interception disclosure using packet analysis encryption used ssh intended provide confidentiality integrity data unsecured network internet although files leaked edward snowden indicate national security agency sometimes decrypt ssh allowing read contents ssh sessions ssh uses public-key cryptography authenticate remote computer allow authenticate user necessary several ways use ssh one use automatically generated public-private key pairs simply encrypt network connection use password authentication log another use manually generated public-private key pair perform authentication allowing users programs log without specify password scenario anyone produce matching pair different keys public private public key placed computers must allow access owner matching private key owner keeps private key secret authentication based private key key never transferred network authentication ssh verifies whether person offering public key also owns matching private key versions ssh important verify unknown public keys i.e associate public keys identities accepting valid accepting attacker public key without validation authorize unauthorized attacker valid user unix-like systems list authorized public keys typically stored home directory user allowed log remotely file ~/.ssh/authorized_keys file respected ssh writable anything apart owner root public key present remote end matching private key present local end typing password longer required software like message passing interface mpi stack may need password-less access run properly however additional security private key locked passphrase private key also looked standard places full path specified command line setting option -i ssh ssh-keygen utility produces public private keys always pairs ssh also supports password-based authentication encrypted automatically generated keys case attacker could imitate legitimate server side ask password obtain man-in-the-middle attack however possible two sides never authenticated ssh remembers key server side previously used ssh client raises warning accepting key new previously unknown server password authentication disabled ssh typically used log remote machine execute commands also supports tunneling forwarding tcp ports x11 connections transfer files using associated ssh file transfer sftp secure copy scp protocols ssh uses client-server model standard tcp port 22 assigned contacting ssh servers ssh client program typically used establishing connections ssh daemon accepting remote connections commonly present modern operating systems including macos distributions linux openbsd freebsd netbsd solaris openvms notably versions windows prior 1709 include ssh default proprietary freeware open source e.g putty version openssh part cygwin versions various levels complexity completeness exist file managers unix-like systems e.g konqueror use fish protocol provide split-pane gui drag-and-drop open source windows program winscp provides similar file management synchronization copy remote delete capability using putty back-end winscp putty available packaged run directly usb drive without requiring installation client machine setting ssh server windows typically involves enabling feature settings app windows 10 version 1709 official win32 port openssh available ssh important cloud computing solve connectivity problems avoiding security issues exposing cloud-based virtual machine directly internet ssh tunnel provide secure path internet firewall virtual machine 1995 tatu yl\u00f6nen researcher helsinki university technology finland designed first version protocol called ssh-1 prompted password-sniffing attack university network goal ssh replace earlier rlogin telnet ftp rsh protocols provide strong authentication guarantee confidentiality yl\u00f6nen released implementation freeware july 1995 tool quickly gained popularity towards end 1995 ssh user base grown 20,000 users fifty countries december 1995 yl\u00f6nen founded ssh communications security market develop ssh original version ssh software used various pieces free software gnu libgmp later versions released ssh communications security evolved increasingly proprietary software estimated year 2000 number users grown 2 million secsh official internet engineering task force ietf name ietf working group responsible version 2 ssh protocol 2006 revised version protocol ssh-2 adopted standard version incompatible ssh-1 ssh-2 features security feature improvements ssh-1 better security example comes diffie\u2013hellman key exchange strong integrity checking via message authentication codes new features ssh-2 include ability run number shell sessions single ssh connection due ssh-2 superiority popularity ssh-1 implementations libssh v0.8.0+ lsh dropbear support ssh-2 protocol january 2006 well version 2.1 established rfc 4253 specified ssh server supports 2.0 prior versions ssh identify protoversion 1.99 actual version method identify backward compatibility 1999 developers wanting free software version available went back older 1.2.12 release original ssh program last released open source license bj\u00f6rn gr\u00f6nvall ossh subsequently developed codebase shortly thereafter openbsd developers forked gr\u00f6nvall code extensive work creating openssh shipped 2.6 release openbsd version portability branch formed port openssh operating systems openssh single popular ssh implementation coming default large number operating systems ossh meanwhile become obsolete openssh continues maintained supports ssh-2 protocol expunged ssh-1 support codebase openssh 7.6 release ssh protocol used many applications across many platforms including unix variants linux bsds including apple macos solaris well microsoft windows applications may require features available compatible specific ssh clients servers example using ssh protocol implement vpn possible presently openssh server client implementation secure shell protocols used several file transfer mechanisms ssh-2 protocol internal architecture defined rfc 4251 well-separated layers namely open architecture provides considerable flexibility allowing use ssh variety purposes beyond secure shell functionality transport layer alone comparable transport layer security tls user-authentication layer highly extensible custom authentication methods connection layer provides ability multiplex many secondary sessions single ssh connection feature comparable beep available tls intended performance enhancements ssh products 1998 vulnerability described ssh 1.5 allowed unauthorized insertion content encrypted ssh stream due insufficient data integrity protection crc-32 used version protocol fix known ssh compensation attack detector introduced implementations many updated implementations contained new integer overflow vulnerability allowed attackers execute arbitrary code privileges ssh daemon typically root january 2001 vulnerability discovered allows attackers modify last block idea-encrypted session month another vulnerability discovered allowed malicious server forward client authentication another server since ssh-1 inherent design flaws make vulnerable generally considered obsolete avoided explicitly disabling fallback ssh-1 modern servers clients support ssh-2 november 2008 theoretical vulnerability discovered versions ssh allowed recovery 32 bits plaintext block ciphertext encrypted using standard default encryption mode cbc straightforward solution use ctr counter mode instead cbc mode since renders ssh resistant attack december 28 2014 der spiegel published classified information leaked whistleblower edward snowden suggests national security agency may able decrypt ssh traffic technical details associated process disclosed analysis 2017 hacking tools bothanspy gyrfalcon suggested ssh protocol compromised following rfc publications ietf secsh working group document ssh-2 proposed internet standard later modified expanded following publications addition openssh project includes several vendor protocol specifications/extensions", + "neighbors": [ + 52, + 88, + 109, + 134, + 172, + 213, + 232, + 235, + 260, + 261, + 267, + 288, + 311, + 319, + 330, + 379, + 425, + 430, + 444, + 455, + 470, + 483, + 526, + 528, + 533, + 539, + 541, + 542, + 543, + 554, + 598, + 611, + 646, + 672, + 684, + 692, + 703, + 732, + 757, + 758, + 759, + 762, + 763, + 764, + 769, + 770, + 771, + 772, + 779, + 813, + 826, + 864, + 872, + 923, + 939, + 961, + 982, + 1003, + 1089, + 1116, + 1138, + 1200, + 1201, + 1206, + 1218, + 1240, + 1326, + 1329, + 1331, + 1337, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1451, + 1453, + 1457, + 1517, + 1527, + 1534, + 1538, + 1549, + 1552, + 1570, + 1576, + 1597, + 1624, + 1627, + 1634 + ], + "mask": "Test" + }, + { + "node_id": 1453, + "label": 5, + "text": "Network_Time_Protocol:network time protocol network time protocol ntp networking protocol clock synchronization computer systems packet-switched variable-latency data networks operation since 1985 ntp one oldest internet protocols current use ntp designed david l. mills university delaware ntp intended synchronize participating computers within milliseconds coordinated universal time utc uses intersection algorithm modified version marzullo algorithm select accurate time servers designed mitigate effects variable network latency ntp usually maintain time within tens milliseconds public internet achieve better one millisecond accuracy local area networks ideal conditions asymmetric routes network congestion cause errors 100 ms protocol usually described terms client-server model easily used peer-to-peer relationships peers consider potential time source implementations send receive timestamps using user datagram protocol udp port number 123 also use broadcasting multicasting clients passively listen time updates initial round-trip calibrating exchange ntp supplies warning impending leap second adjustment information local time zones daylight saving time transmitted current protocol version 4 ntpv4 proposed standard documented backward compatible version 3 specified /small 1979 network time synchronization technology used possibly first public demonstration internet services running trans-atlantic satellite network national computer conference new york technology later described 1981 internet engineering note ien 173 public protocol developed documented technology first deployed local area network part hello routing protocol implemented fuzzball router experimental operating system used network prototyping ran many years related network tools available include daytime time protocols recording time events well icmp timestamp ip timestamp option complete synchronization systems although lacking ntp data analysis clock disciplining algorithms include unix daemon timed uses election algorithm appoint server clients digital time synchronization service dtss uses hierarchy servers similar ntp stratum model 1985 ntp version 0 ntpv0 implemented fuzzball unix ntp packet header round-trip delay offset calculations persisted ntpv4 documented despite relatively slow computers networks available time accuracy better 100 milliseconds usually obtained atlantic spanning links accuracy tens milliseconds ethernet networks 1988 much complete specification ntpv1 protocol associated algorithms published drew experimental results clock filter algorithm documented first version describe client-server peer-to-peer modes 1991 ntpv1 architecture protocol algorithms brought attention wider engineering community publication article david l. mills ieee transactions communications 1989 published defining ntpv2 means state machine pseudocode describe operation introduced management protocol cryptographic authentication scheme survived ntpv4 bulk algorithms era also largely survived ntpv4 1992 defined ntpv3 rfc included analysis sources error reference clock final client enabled calculation metric helps choose best server several candidates appear disagree broadcast mode introduced subsequent years new features added algorithm improvements made became apparent new protocol version required 2010 published containing proposed specification ntpv4 protocol significantly moved since 2014 updated rfc yet published following retirement mills university delaware reference implementation currently maintained open source project led harlan stenn ntp uses hierarchical semi-layered system time sources level hierarchy termed stratum assigned number starting zero reference clock top server synchronized stratum n server runs stratum n 1 number represents distance reference clock used prevent cyclical dependencies hierarchy stratum always indication quality reliability common find stratum 3 time sources higher quality stratum 2 time sources brief description strata 0 1 2 3 provided upper limit stratum 15 stratum 16 used indicate device unsynchronized ntp algorithms computer interact construct bellman-ford shortest-path spanning tree minimize accumulated round-trip delay stratum 1 servers clients addition stratum protocol able identify synchronization source server terms reference identifier refid 64-bit timestamps used ntp consist 32-bit part seconds 32-bit part fractional second giving time scale rolls every 2 seconds 136 years theoretical resolution 2 seconds 233 picoseconds ntp uses epoch january 1 1900 therefore first rollover occurs february 7 2036 ntpv4 introduces 128-bit date format 64 bits second 64 bits fractional-second most-significant 32-bits format era number resolves rollover ambiguity cases according mills 64-bit value fraction enough resolve amount time takes photon pass electron speed light 64-bit second value enough provide unambiguous time representation universe goes dim typical ntp client regularly polls one ntp servers client must compute time offset round-trip delay time offset \u03b8 difference absolute time two clocks defined round-trip delay \u03b4 values \u03b8 \u03b4 passed filters subjected statistical analysis outliers discarded estimate time offset derived best three remaining candidates clock frequency adjusted reduce offset gradually creating feedback loop accurate synchronization achieved incoming outgoing routes client server symmetrical nominal delay routes common nominal delay systematic bias exists half difference forward backward travel times ntp reference implementation along protocol continuously developed 20 years backwards compatibility maintained new features added contains several sensitive algorithms especially discipline clock misbehave synchronized servers use different algorithms software ported almost every computing platform including personal computers runs daemon called ntpd unix service windows reference clocks supported offsets filtered analysed way remote servers although usually polled frequently implementation audited 2017 finding numerous potential security issues simple network time protocol sntp less complex implementation ntp using protocol without requiring storage state extended periods time used embedded systems applications full ntp capability required microsoft windows versions since windows 2000 include windows time service w32time ability synchronize computer clock ntp server w32time originally implemented purpose kerberos version 5 authentication protocol required time within 5 minutes correct value prevent replay attacks version windows 2000 windows xp implements sntp violates several aspects ntp version 3 standard beginning windows server 2003 windows vista compliant implementation ntp included microsoft states w32time reliably maintain time synchronization one second accuracy higher accuracy desired microsoft recommends using newer version windows different ntp implementation windows 10 windows server 2016 support 1 ms time accuracy certain operating conditions 2004 henning brauer presented openntpd ntp implementation focus security encompassing privilege separated design whilst aimed closely simpler generic needs openbsd users also includes protocol security improvements whilst still compatible existing ntp servers originally designed openbsd portable version available made available package linux package repositories new ntp client ntimed started poul-henning kamp 2014 new implementation sponsored linux foundation replacement reference implementation determined easier write new implementation scratch fix existing issues large existing code base june 2015 official release done yet ntimed synchronize clocks reliably ntimed works debian freebsd remains ported windows macos ntpsec fork reference implementation systematically security-hardened fork point june 2015 response rash compromises 2014 first production release shipped october 2017 removal unsafe features removal support obsolete hardware removal support obsolete unix variants ntpsec able pare away 75 original codebase making remainder auditable 2017 audit code showed eight security issues including two present original reference implementation ntpsec suffer eight issues remained reference implementation chrony comes default red hat distributions available ubuntu repositories chrony aimed ordinary computers unstable go sleep mode intermittent connection internet chrony also designed virtual machines much unstable environment characterized low resource consumption cost supports ptp well ntp two main components chronyd daemon executed computer starts chronyc command line interface user configuration evaluated safe incidents advantage versatility code written scratch avoid complexity code chrony written gnu general public license version 2 created richard curnow 1997 others along time currently maintained miroslav lichvar development supported red hat software day leap second event ntpd receives notification either configuration file attached reference clock remote server requirement time must appear monotonically increasing leap second inserted sequence 23:59:59 23:59:60 00:00:00 although clock actually halted event processes query system time cause increase tiny amount preserving order events negative leap second ever become necessary would deleted sequence 23:59:58 00:00:00 skipping 23:59:59 alternative implementation called leap smearing consists introducing leap second incrementally period 24 hours noon noon utc time implementation used google internally public ntp servers amazon aws security problems identified reference implementation ntp codebase ones appeared 2009 cause significant concern protocol undergoing revision review entire history january 2011 security revisions ntp specification reports cert current codebase reference implementation undergoing security audits several sources several years known high-risk vulnerabilities current released software several security concerns arose late 2014 previously researchers became aware ntp servers susceptible man-in-the-middle attacks unless packets cryptographically signed authentication computational overhead involved make impractical busy servers particularly denial service attacks ntp message spoofing used move clocks client computers allow number attacks based bypassing cryptographic key expiration services affected fake ntp messages identified tls dnssec various caching schemes dns cache bgp bitcoin number persistent login schemes 2017 security audit three ntp implementations conducted behalf linux foundation core infrastructure initiative suggested ntp ntpsec problematic chrony security standpoint ntp used distributed denial service ddos attacks small query sent ntp server return address spoofed target address similar dns amplification attack server responds much larger reply allows attacker substantially increase amount data sent target avoid participating attack servers configured ignore external queries upgraded version 4.2.7p26 later stack-based buffer overflow exploit discovered patch available december 19 2014 includes ntp version 4 releases version 4.2.8 apple concerned enough used auto-update capability first time though recent versions macos case version 10.6.8 manual fixes server version normal client users turn automatic time updating system preferences date time implementation errors basic missing return statement routine lead unlimited access systems running versions ntp root daemon systems use root daemon bsd subject flaw", + "neighbors": [ + 52, + 109, + 217, + 311, + 363, + 425, + 430, + 444, + 455, + 470, + 542, + 543, + 647, + 655, + 672, + 684, + 692, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 833, + 864, + 961, + 1088, + 1116, + 1151, + 1200, + 1206, + 1218, + 1326, + 1329, + 1386, + 1395, + 1408, + 1410, + 1438, + 1443, + 1448, + 1452, + 1517, + 1552, + 1570, + 1597 + ], + "mask": "Validation" + }, + { + "node_id": 1454, + "label": 7, + "text": "Apache_Mahout:apache mahout apache mahout project apache software foundation produce free implementations distributed otherwise scalable machine learning algorithms focused primarily areas collaborative filtering clustering classification many implementations use apache hadoop platform mahout also provides java libraries common maths operations focused linear algebra statistics primitive java collections mahout work progress number implemented algorithms grown quickly various algorithms still missing mahout core algorithms clustering classification batch based collaborative filtering implemented top apache hadoop using map/reduce paradigm restrict contributions hadoop-based implementations contributions run single node non-hadoop cluster also welcomed example 'taste collaborative-filtering recommender component mahout originally separate project run stand-alone without hadoop starting release 0.10.0 project shifted focus building backend-independent programming environment code named samsara environment consists algebraic backend-independent optimizer algebraic scala dsl unifying in-memory distributed algebraic operators supported algebraic platforms apache spark h2o apache flink support mapreduce algorithms started gradually phased 2014", + "neighbors": [ + 178, + 192, + 197, + 296, + 318, + 538, + 620, + 715, + 796, + 874, + 1091, + 1099, + 1138, + 1163, + 1254, + 1583, + 1596 + ], + "mask": "Test" + }, + { + "node_id": 1455, + "label": 4, + "text": "Amplitude-shift_keying:amplitude-shift keying amplitude-shift keying ask form amplitude modulation represents digital data variations amplitude carrier wave ask system binary symbol 1 represented transmitting fixed-amplitude carrier wave fixed frequency bit duration seconds signal value 1 carrier signal transmitted otherwise signal value 0 transmitted digital modulation scheme uses finite number distinct signals represent digital data ask uses finite number amplitudes assigned unique pattern binary digits usually amplitude encodes equal number bits pattern bits forms symbol represented particular amplitude demodulator designed specifically symbol-set used modulator determines amplitude received signal maps back symbol represents thus recovering original data frequency phase carrier kept constant like ask also linear sensitive atmospheric noise distortions propagation conditions different routes pstn etc ask modulation demodulation processes relatively inexpensive ask technique also commonly used transmit digital data optical fiber led transmitters binary 1 represented short pulse light binary 0 absence light laser transmitters normally fixed bias current causes device emit low light level low level represents binary 0 higher-amplitude lightwave represents binary 1 simplest common form ask operates switch using presence carrier wave indicate binary one absence indicate binary zero type modulation called on-off keying ook used radio frequencies transmit morse code referred continuous wave operation sophisticated encoding schemes developed represent data groups using additional amplitude levels instance four-level encoding scheme represent two bits shift amplitude eight-level scheme represent three bits forms amplitude-shift keying require high signal-to-noise ratio recovery nature much signal transmitted reduced power ask system divided three blocks first one represents transmitter second one linear model effects channel third one shows structure receiver following notation used different symbols represented different voltages maximum allowed value voltage possible values range \u2212a given difference one voltage considering picture symbols v n generated randomly source impulse generator creates impulses area v n impulses sent filter ht sent channel words symbol different carrier wave sent relative amplitude transmitter signal expressed form receiver filtering hr signal use notation indicates convolution two signals a/d conversion signal z k expressed form relationship second term represents symbol extracted others unwanted first one effect noise third one due intersymbol interference filters chosen g satisfy nyquist isi criterion intersymbol interference value sum zero transmission affected noise probability density function error given size modelled gaussian function mean value relative sent value variance given formula_9 spectral density noise within band hr f continuous fourier transform impulse response filter hr f probability making error given example formula_11 conditional probability making error given symbol v0 sent formula_12 probability sending symbol v0 probability sending symbol represent probability density functions plot possible value voltage transmitted get picture like particular case formula_14 shown probability making error single symbol sent area gaussian function falling functions symbols shown cyan one call formula_15 area one side gaussian sum areas formula_16 total probability making error expressed form calculate value formula_15 order move origin reference wherever want area function change situation like one shown following picture matter gaussian function considering area want calculate value looking given following integral formula_20 complementary error function putting results together probability make error formula_21 formula easily understand probability make error decreases maximum amplitude transmitted signal amplification system becomes greater hand increases number levels power noise becomes greater relationship valid intersymbol interference i.e formula_22 nyquist function", + "neighbors": [ + 166, + 442 + ], + "mask": "Test" + }, + { + "node_id": 1456, + "label": 2, + "text": "Dm-cache:dm-cache dm-cache component specifically target linux kernel device mapper framework mapping block devices onto higher-level virtual block devices allows one fast storage devices flash-based solid-state drives ssds act cache one slower storage devices hard disk drives hdds effectively creates hybrid volumes provides secondary storage performance improvements design dm-cache requires three physical storage devices creation single hybrid volume dm-cache uses storage devices separately store actual data cache data required metadata configurable operating modes cache policies latter form separate modules determine way data caching actually performed dm-cache licensed terms gnu general public license gpl joe thornber heinz mauelshagen mike snitzer primary developers dm-cache uses solid-state drives ssds additional level indirection accessing hard disk drives hdds improving overall performance using fast flash-based ssds caches slower mechanical hdds based rotational magnetic media result costly speed ssds becomes combined storage capacity offered slower less expensive hdds moreover case storage area networks sans used cloud environments shared storage systems virtual machines dm-cache also improve overall performance reduce load sans providing data caching using client-side local storage dm-cache implemented component linux kernel device mapper volume management framework allows various mappings created physical virtual block devices way mapping devices created determines virtual blocks translated underlying physical blocks specific translation types referred targets acting mapping target dm-cache makes possible ssd-based caching part created virtual block device configurable operating modes cache policies determine dm-cache works internally operating mode selects way data kept sync hdd ssd cache policy selectable separate modules implement policies provides algorithm determining blocks promoted moved hdd ssd demoted moved ssd hdd cleaned etc configured use multiqueue mq stochastic multiqueue smq cache policy latter default dm-cache uses ssds store data associated performed random reads writes capitalizing near-zero seek times ssds avoiding i/o operations typical hdd performance bottlenecks data associated sequential reads writes cached ssds avoiding undesirable cache invalidation operations performance-wise beneficial sequential i/o operations suitable hdds due mechanical nature caching sequential i/o also helps extending lifetime ssds used caches another dm-cache project similar goals announced eric van hensbergen ming zhao 2006 result internship work ibm later joe thornber heinz mauelshagen mike snitzer provided implementation concept resulted inclusion dm-cache linux kernel dm-cache merged linux kernel mainline kernel version 3.9 released april 28 2013 dm-cache creating mapped virtual block device acts hybrid volume requires three physical storage devices internally dm-cache references origin devices number fixed-size blocks size blocks equaling size caching extent configurable creation hybrid volume size caching extent must range 32 kb 1 gb must multiple 32 kb typically size caching extent 256 1024 kb choice caching extents bigger disk sectors acts compromise size metadata possibility wasting cache space small caching extents increases size metadata metadata device kernel memory large caching extents increases amount wasted cache space due caching whole extents even case high hit rates parts operating modes supported dm-cache write-back default write-through pass-through write-back operating mode writes cached blocks go cache device blocks origin device marked dirty metadata write-through operating mode write requests returned completed data reaches origin cache devices clean blocks becoming marked dirty pass-through operating mode reads performed directly origin device avoiding cache writes go directly origin device cache write hits also cause invalidation cached blocks pass-through mode allows hybrid volume activated state cache device known consistent origin device rate data migration dm-cache performs directions i.e. data promotions demotions throttled configured speed regular i/o origin cache devices preserved decommissioning hybrid volume shrinking cache device requires use cleaner policy effectively flushes blocks marked metadata dirty cache device origin device version 4.2 linux kernel following three cache policies distributed linux kernel mainline dm-cache default uses stochastic multiqueue policy", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 211, + 213, + 219, + 265, + 267, + 275, + 294, + 305, + 306, + 322, + 327, + 346, + 352, + 400, + 401, + 413, + 465, + 477, + 571, + 583, + 611, + 630, + 650, + 664, + 688, + 716, + 720, + 725, + 728, + 736, + 754, + 797, + 860, + 891, + 897, + 912, + 935, + 941, + 961, + 966, + 986, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1060, + 1102, + 1105, + 1138, + 1155, + 1187, + 1197, + 1202, + 1208, + 1224, + 1241, + 1252, + 1278, + 1301, + 1313, + 1357, + 1360, + 1361, + 1391, + 1398, + 1415, + 1441, + 1449, + 1468, + 1474, + 1494, + 1524, + 1526, + 1530, + 1546, + 1558, + 1578, + 1602, + 1616, + 1631, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1457, + "label": 9, + "text": "Shell_script:shell script shell script computer program designed run unix shell command-line interpreter various dialects shell scripts considered scripting languages typical operations performed shell scripts include file manipulation program execution printing text script sets environment runs program necessary cleanup logging etc called wrapper term also used generally mean automated mode running operating system shell specific operating systems called things batch files msdos-win95 stream os/2 command procedures vms shell scripts windows nt stream third-party derivatives like 4nt\u2014article cmd.exe mainframe operating systems associated number terms typical unix/linux/posix-compliant installation includes kornshell codice_1 several possible versions ksh88 korn shell '93 others oldest shell still common use bourne shell codice_2 unix systems invariably also include c shell codice_3 bash codice_4 remote shell codice_5 secure shell codice_6 ssl telnet connections shell main component tcl/tk installation usually called codice_7 wish gui-based tcl/tk shell c tcl shells syntax quite similar said programming languages korn shells bash developments bourne shell based algol language elements number others added well hand various shells plus tools like awk sed grep basic lisp c forth contributed perl programming language shells available machine available download and/or purchase include almquist shell codice_8 powershell codice_9 z shell codice_10 particularly common enhanced kornshell tenex c shell codice_11 perl-like shell codice_12 related programs shells based python ruby c java perl pascal rexx c various forms also widely available another somewhat common shell osh whose manual page states enhanced backward-compatible port standard command interpreter sixth edition unix windows-unix interoperability software mks toolkit cygwin uwin interix others make shells unix programming available windows systems providing functionality way signals inter-process communication system calls apis hamilton c shell windows shell similar unix c shell microsoft distributes windows services unix use nt-based operating systems particular posix environmental subsystem shell script provide convenient variation system command special environment settings command options post-processing apply automatically way allows new script still act fully normal unix command one example would create version ls command list files giving shorter command name l would normally saved user bin directory /home/ username /bin/l default set command options pre-supplied first line shebang indicates interpreter execute rest script second line makes listing options file format indicators columns files none omitted size blocks lc_collate=c sets default collation order fold upper lower case together intermix dotfiles normal filenames side effect ignoring punctuation names dotfiles usually shown option like -a used causes parameters given l pass parameters ls normal options syntax known ls still used user could simply use l commonly used short listing another example shell script could used shortcut would print list files directories within given directory case shell script would start normal starting line /bin/sh following script executes command clear clears terminal text going next line following line provides main function script ls -al command lists files directories directory script run ls command attributes could changed reflect needs user note implementation clear command try using clr command instead shell scripts allow several commands would entered manually command-line interface executed automatically without wait user trigger stage sequence example directory three c source code files rather manually running four commands required build final program one could instead create c shell script named build kept directory would compile automatically script would allow user save file edited pause editor run ./build create updated program test return editor since 1980s however scripts type replaced utilities like make specialized building programs simple batch jobs unusual isolated tasks using shell loops tests variables provides much flexibility users bash unix shell script convert jpeg images png images image names provided command-line\u2014possibly via wildcards\u2014instead listed within script created file typically saved file like /home/ username /bin/jpg2png jpg2png command run entire directory full jpeg images /home/ username /bin/jpg2png *.jpg key feature shell scripts invocation interpreters handled core operating system feature rather user shell able execute scripts shell language script interpreter directive handled correctly run shell limitations early bourne shell handling scripts shell scripts set executed os modern shell script footing system commands rather many system commands actually shell scripts generally scripts since interpreted shell instead perl python language extends returning exit codes like system utilities indicate success failure allows called components larger programs regardless larger tools implemented like standard system commands shell scripts classically omit kind filename extension unless intended read running shell special mechanism purpose sh \u2019 codice_13 csh \u2019 source many modern shells also supply various features usually found sophisticated general-purpose programming languages control-flow constructs variables comments arrays subroutines sorts features available possible write reasonably sophisticated applications shell scripts however still limited fact shell languages little support data typing systems classes threading complex math common full language features also generally much slower compiled code interpreted languages written speed performance goal standard unix tools sed awk provide extra capabilities shell programming perl also embedded shell scripts scripting languages like tcl perl tcl come graphics toolkits well many powerful scripting languages introduced tasks large complex comfortably handled ordinary shell scripts advantages script desirable development overhead full-blown compiled programming language would disadvantageous specifics separates scripting languages high-level programming languages frequent source debate generally speaking scripting language one requires interpreter shell scripts often serve initial stage software development often subject conversion later different underlying implementation commonly converted perl python c. interpreter directive allows implementation detail fully hidden inside script rather exposed filename extension provides seamless reimplementation different languages impact end users files .sh file extension usually shell script kind shell scripts filename extension perhaps biggest advantage writing shell script commands syntax exactly directly entered command-line programmer switch totally different syntax would script written different language compiled language used often writing shell script much quicker writing equivalent code programming languages many advantages include easy program file selection quick start interactive debugging shell script used provide sequencing decision-making linkage around existing programs moderately sized scripts absence compilation step advantage interpretive running makes easy write debugging code script re-run detect fix bugs non-expert users use scripting tailor behavior programs shell scripting provides limited scope multiprocessing hand shell scripting prone costly errors inadvertent typing errors rm -rf instead intended rm -rf */ folklore unix community single extra space converts command one deletes everything sub-directories one deletes everything\u2014and also tries delete everything root directory similar problems transform cp mv dangerous weapons misuse redirect delete contents file made problematic fact many unix commands differ name one letter cp cd dd df etc another significant disadvantage slow execution speed need launch new process almost every shell command executed script job accomplished setting pipeline efficient filter commands perform work slowdown mitigated complex script typically several orders magnitude slower conventional compiled program performs equivalent task also compatibility problems different platforms larry wall creator perl famously wrote easier port shell shell script similarly complex scripts run limitations shell scripting language limits make difficult write quality code extensions various shells ameliorate problems original shell language make problems worse many disadvantages using script languages caused design flaws within language syntax implementation necessarily imposed use text-based command-line number shells use shell programming languages even full-fledged languages like scsh uses scheme interoperability software cygwin mks toolkit interix available microsoft windows services unix hamilton c shell uwin unix windows others allow unix shell programs run machines running windows nt successors loss functionality ms-dos-windows 95 branch well earlier mks toolkit versions os/2 least three dcl implementations windows type operating systems\u2014in addition xlnt multiple-use scripting language package used command shell windows script host cgi programming\u2014are available systems well mac os x subsequent unix-like well addition aforementioned tools posix os/2 functionality used corresponding environmental subsystems windows nt operating system series windows 2000 well third 16-bit subsystem often called ms-dos subsystem uses command.com provided operating systems run aforementioned ms-dos batch files console alternatives 4dos 4os2 freedos peter norton ndos 4nt take command add functionality windows nt-style cmd.exe ms-dos/windows 95 batch files run command.com os/2 cmd.exe 4nt respectively similar shells enhance integrated windows script host comes three pre-installed engines vbscript jscript vba numerous third-party engines added rexx perl python ruby tcl pre-defined functions 4nt related programs pc dos quite similar ms-dos whilst dr dos different earlier versions windows nt able run contemporary versions 4os2 os/2 subsystem scripting languages definition able extended example ms-dos/windows 95/98 windows nt type systems allows shell/batch programs call tools like kixtart qbasic various basic rexx perl python implementations windows script host installed engines unix posix-compliant systems awk sed used extend string numeric processing ability shell scripts tcl perl rexx python graphics toolkits used code functions procedures shell scripts pose speed bottleneck c fortran assembly language c much faster still add functionality available shell language sockets connectivity functions heavy-duty text processing working numbers calling script abilities self-writing self-modifying code techniques like recursion direct memory access various types sorting difficult impossible main script visual basic applications vbscript used control communicate things spreadsheets databases scriptable programs types telecommunications software development tools graphics tools software accessed component object model", + "neighbors": [ + 31, + 42, + 65, + 78, + 117, + 134, + 176, + 189, + 216, + 306, + 373, + 397, + 509, + 538, + 567, + 579, + 682, + 685, + 825, + 919, + 948, + 998, + 1005, + 1028, + 1050, + 1055, + 1110, + 1120, + 1152, + 1220, + 1221, + 1225, + 1227, + 1235, + 1287, + 1304, + 1311, + 1319, + 1324, + 1374, + 1388, + 1391, + 1430, + 1452, + 1565, + 1570, + 1629 + ], + "mask": "Validation" + }, + { + "node_id": 1458, + "label": 2, + "text": "GoboLinux:gobolinux gobolinux open source operating system whose prominent feature reorganization traditional linux file system rather following filesystem hierarchy standard like unix-like systems program gobolinux system subdirectory tree files including settings specific program may found thus program foo specific files libraries codice_1 corresponding version program hand example commonly known gcc compiler suite version 8.1.0 would reside directory codice_2 according gobolinux developers results cleaner system gobolinux hierarchy represents radical departure filesystem hierarchy traditionally employed unix-like operating systems specific types files stored together common standard subdirectories codice_3 executables codice_4 configuration files package managers used keep track file belongs program gobolinux files program placed respective program dedicated subdirectory makers gobolinux said filesystem package manager gobolinux package system uses filesystem package database said produce straightforward less cluttered directory tree gobolinux uses symlinks optional kernel module called gobohide achieve maintaining full compatibility traditional linux filesystem hierarchy creators gobolinux stated design modernisms removal distinctions similar traditional directories locations executables codice_3 codice_6 codice_7 gobolinux designers claimed results shell scripts breaking less often linux distributions change introduced gobolinux 2003 adopted distributions much later fedora merged /bin /usr/bin 2012 debian enabled /usr merge default 2016 gobolinux also allows user different versions program installed concurrently even run concurrently furthermore claimed package management index could never become unsynchronized filesystem references nonexistent files simply become broken links thus become inactive gobolinux filesystem changes also allow innovations entirely new boot system use system v bsd style init systems design gobolinux influenced earlier systems nextstep atheos beos adopted original filesystem structures still maintaining considerable degree compatibility unix root gobolinux tree six directories programs users system files mount depot contents described compile program downloads unpacks compiles source code tarballs installs resulting executable code single command codice_25 using simple compilation scripts known recipes compile system somewhat similar gentoo portage system based freebsd ports collection however portage made traditional filesystem hierarchy compatible filesystem hierarchy standard compile extends capability gobolinux distinctive filesystem hierarchy area package management thus gobolinux filesystem serves naturally kind package manager database compile program introduced gobolinux version 011 discussions porting gentoo portage system gobolinux developing port sourceforge.net project name goboportage compile features included gobolinux hierarchy files grouped functional categories index-like structure using symbolic links rooted codice_12 executables accessible codice_27 libraries accessible codice_28 eliminates many traditional distinctions filesystem hierarchy standard distinction made non-essential files stored codice_29 essential emergency files stored directly subdirectories root directory gobolinux developers maintained although distinctions useful longer necessary gobolinux schema symbolic links relating usual unix directories gobolinux tree therefore one find directories codice_4 codice_31 codice_6 expected places symbolic links point functional equivalent codice_12 tree thus traditionally crucial path names codice_34 codice_35 resolved correctly compatibility directories concealed view using custom kernel modification called gobohide implements support hidden files linux used aesthetic reasons thus optional feature gobolinux uses initialization procedure unlike linux distributions use bsd system v procedure codice_36 files command entire boot procedure codice_37 codice_38 run system boot shutdown respectively additionally possible define runlevel scripts specify different ways system may initialized example codice_39 single-user codice_40 multi-user codice_41 boot graphic mode controlled boot loader menu codice_42 file separates site-specific settings rest scripts application-specific tasks found codice_43 called boot scripts releases numbered using octal base system according authors scheme chosen keeps typical leading zero present many free software version numbers since leading zero often indicates number octal play version numbers race happened among linux distributions around 1999 read decimal numbers using octal numbers causes deterministic version bump eight releases version 013 gobolinux made point releases order avoid implication releases stable others tradition broken version 014.01 update 014 focused bug fixes gobolinux currently developed x86-64 officially made i686 release 015 one point incomplete port i386 made ports also made embedded architectures arm superh tasks achieved bootstrap tool developed especially automate making ports lwn.net reviewed gobolinux 010 2004 linux.com wrote review gobolinux 013 jesse smith distrowatch weekly reviewed gobolinux 015 smith also reviewed gobolinux 016", + "neighbors": [ + 33, + 113, + 134, + 171, + 193, + 207, + 275, + 292, + 301, + 351, + 357, + 393, + 404, + 431, + 695, + 716, + 754, + 897, + 899, + 974, + 1046, + 1049, + 1055, + 1110, + 1126, + 1138, + 1167, + 1214, + 1276, + 1286, + 1292, + 1366, + 1369, + 1539, + 1547, + 1582, + 1601 + ], + "mask": "Train" + }, + { + "node_id": 1459, + "label": 6, + "text": "EncFS:encfs encfs free lgpl fuse-based cryptographic filesystem transparently encrypts files using arbitrary directory storage encrypted files two directories involved mounting encfs filesystem source directory mountpoint file mountpoint specific file source directory corresponds file mountpoint provides unencrypted view one source directory filenames encrypted source directory files encrypted using volume key stored either within outside encrypted source directory password used decrypt key encfs offers several advantages disk encryption software simply file stored individually encrypted file elsewhere host directory tree encfs available multiple platforms whereas ecryptfs tied linux kernel encfs implements bitrot detection top underlying filesystem encfs volumes occupy fixed size \u2014 encrypted directories grow shrink files added removed mountpoint encfs encrypted directory located normal file server via nfs sshfs etc mirrored backed efficiently normal file-system tools rsync possible directories mountpoint exist different physical devices filesystem mounted one sub-directories source directory backup utilities back files changed source directory file synchronisation cloud storage corruption data isolated corruption filedata local single file data corruption filesystem corrected reliable filesystem repair utility like fsck whole-disk encryption systems lack one attributes since file modifications shine underlying file system various optimizations operating system still possible unlike full-disk encryption example passing information released space trim improve performance ssd drives also supported dm-crypt files accessed random example skip middle large encrypted video without decrypting whole file drawbacks using encfs mounted encfs directories share features restrictions filesystem containing source directory due encryption filenames encrypted files produced encfs longer original filenames therefore filenames whose length close maximum supported filesystem stored encfs since exceed length limit encryption filesystems limit filenames 255 bytes case encfs supports filenames 190 bytes anyone access source directory able see many files encrypted filesystem permissions approximate size last time accessed modified though file names file data encrypted paid security audit conducted february 2014 revealed several potential vulnerabilities concludes announcement encfs 1.8 included several underlying design changes acknowledging security concerns raised previous audit however certain concerns still remain regarding vulnerabilities creating new encfs volume several different options available customize filesystem suit various needs encfs uses whatever ciphers able locate various encryption libraries system blowfish aes typically available cipher key length keysize selected ciphers support variable key lengths file encrypted blocks option controls size blocks time single byte read entire block contained must decrypted likewise write block must decrypted altered re-encrypted default block size 1024 sufficient purposes filenames source directory plain encrypted block stream mode block mode obscures filename length somewhat stream mode keeps short possible might save space source directory filesystem depending filesystem manages directory tree enabled initialization vector filename encryption derived file parent directories causing two files name \u2014 different directories \u2014 different encrypted filenames directory renamed files directories contained therein need encrypted filenames re-encrypted expensive operation option disabled heavily populated directories renamed often enabled file encrypted random 8-byte initialization vector stored within encrypted file source directory option disabled file encrypted initialization vector make volume key easier break enabling option makes filesystem secure cost additional 8 bytes per file causes file data initialization vector derived filename initialization vector chain data encrypted differently given different filename directory consequently renaming file mode enabled requires either file random initialization vector offset change filename initialization vector chain data re-encoded authors encfs chosen former route considerably faster especially large files makes encoding depend full pathname renaming moving means reencoding hardlinks supported stores checksum encrypted block causing corruption modification encrypted files detected encfs checksum blockmacbytes 8 bytes optionally 8 additional bytes random data blockmacrandbytes added block prevent two blocks unencrypted data checksum option creates large amount cpu overhead block checksum must calculated data read verify integrity written update checksum encfs supports somewhat primitive form secondary volumes single source directory offering different files given different passwords encfs unable decrypt file volume key ignored encfs forced ignore invalid password entry volume key decode differently hence files encrypted decrypted different key present two different encrypted volumes given different passwords however possible two filenames two different secondary volumes encrypted filename case file overwritten new file created note refers encrypted filenames unencrypted filenames danger averted creating one directory per secondary volume storing files visible directory secondary volume mounted also password changed volume key re-encoded new password cause secondary filesystems vanish volume key longer incorrectly decode key given secondary password primary password changed back secondary filesystems become available encfs author support technique", + "neighbors": [ + 34, + 40, + 55, + 63, + 134, + 222, + 233, + 270, + 278, + 295, + 326, + 334, + 349, + 358, + 438, + 495, + 524, + 528, + 553, + 557, + 558, + 570, + 723, + 728, + 772, + 813, + 887, + 889, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1003, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1565, + 1582, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1460, + "label": 2, + "text": "Prevayler:prevayler prevayler open-source bsd system-prevalence layer java transparently persists plain old java objects in-ram database backed snapshots system via object serialization loaded system crash restore state changes data happen via transaction operations objects made serializable classes prevayler development started klaus wuestefeld read operations three four orders magnitude faster prevayler compared traditional database systems since objects always ram in-process prevayler requires enough ram keep entire system state", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1461, + "label": 2, + "text": "Windows_Terminal:windows terminal windows terminal terminal emulator windows 10 written microsoft includes support command prompt powershell wsl ssh initial source code release github preview release first published microsoft store june 21 2019", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 255, + 262, + 278, + 295, + 312, + 326, + 344, + 377, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 764, + 791, + 801, + 865, + 904, + 920, + 961, + 989, + 1025, + 1042, + 1050, + 1092, + 1098, + 1110, + 1138, + 1212, + 1243, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1531, + 1533, + 1545, + 1547, + 1561, + 1582, + 1587, + 1608, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1462, + "label": 4, + "text": "IPFire:ipfire ipfire hardened open source linux distribution primarily performs router firewall standalone firewall system web-based management console configuration ipfire originally started fork ipcop rewritten basis linux scratch since version 2 supports installation add-ons add server services extended soho server april 2015 project became member open invention network basic requirements least 1ghz cpu 1gb ram 4gb hard drive two network cards needed connect ethernet network dsl lte wi-fi wlan supported according hardware required computing power run ipfire depends area application commonly x86 systems used arm devices raspberry pi banana pi supported ipfire used virtual environments kvm vmware xen qemu etc. basic setup ipfire happens guided dialogue console administration takes place web-based management interface add-ons additional features project regularly updated development team maintain security developed stateful packet inspection spi firewall ipfire separates network different segments based security risk organised colours normal clients connected lan represented green internet represented red optional dmz represented orange optional wireless network represented blue traffic flow segments unless specifically permitted firewall rule ipfire package management system called pakfire allows install system updates keep security date additional software packages customisation different usage scenarios needs linux system customised concrete purpose firewall design modular making functionalities extensible plugins base comes following features", + "neighbors": [ + 94, + 134, + 189, + 217, + 276, + 333, + 352, + 444, + 476, + 512, + 542, + 569, + 648, + 656, + 678, + 685, + 716, + 731, + 739, + 754, + 813, + 842, + 910, + 961, + 1138, + 1208, + 1250, + 1257, + 1397, + 1403, + 1406, + 1514, + 1542, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 1463, + "label": 1, + "text": "Driver_and_Vehicle_Licensing_Agency:driver vehicle licensing agency driver vehicle licensing agency dvla organisation uk government responsible maintaining database drivers great britain database vehicles entire united kingdom counterpart drivers northern ireland driver vehicle agency dva agency issues driving licences organises collection vehicle excise duty also known road tax road fund licence sells personalised registrations dvla executive agency department transport dft current chief executive agency julie lennard dvla based swansea wales prominent 16-storey building clase offices swansea vale previously known driver vehicle licensing centre dvlc agency previously network 39 offices around great britain known local office network users could attend apply licences transact business throughout course 2013 local offices gradually closed closed december 2013 agency work consequently fully centralised swansea majority users transact remotely post transactions phone dvla introduced electronic vehicle licensing evl 2004 allowing customers pay vehicle excise duty online telephone however customers still option tax vehicles via post office seven-year contract enabling post office continue process car tax applications agreed november 2012 option three-year extension originally vehicle registration responsibility borough county councils throughout great britain system created motor car act 1903 licensing system centralised 1965 administered driver vehicle licensing centre dvlc swansea 1990 dvlc renamed driver vehicle licensing agency dvla becoming executive agency department transport civilian vehicles used germany members british forces germany families registered dvla behalf ministry defence official diplomatic consular vehicles registered dvla behalf foreign commonwealth office vehicle register held dvla used many ways example dvla identify untaxed vehicles outside agencies identify keepers cars entering central london paid congestion charge exceed speed limits road speed cameras matching cars keepers utilising dvla database current dvla vehicle register built eds \u00a35 million contract signed 1996 planned implementation date october 1998 though actual implementation delayed year uses client\u2013server architecture uses vehicle identification number rather registration plate primary key track vehicles eliminating possibility multiple registrations single vehicle vehicle identity check vic introduced help reduce vehicle crime intended deter criminals disguising stolen cars identity written scrapped vehicles however scheme later scrapped october 2014 insurance company writes car registration document v5 logbook surrendered destroyed insurance company notify dvla vehicle written notification set vic marker vehicle record dvla database dvla database records used commercial vehicle check companies offer comprehensive individual car check prospective purchasers however accuracy data held remains continuing problem anyone request information database purport cause need fee \u00a32.50 database drivers developed late 1980s holds details 42 million driving licence holders uk used produce driving licences assist bodies driving standards agency police courts enforcement legislation concerning driving entitlements road safety dvla revealed december 2012 temporarily banned 294 public bodies including local councils police forces using access database correctly 2006 2012 38 bodies banned permanently period 2002 2015 estimated dvla spent \u00a3500 million information technology ibm staff dvla predominantly female whereas parts department transport predominantly male starting salaries \u00a312,500 november 2007 public accounts committee report criticised amazingly high levels sick leave among staff dvla employees took average three weeks per year sick leave report said overall sickness leave dft seven agencies averaged 10.4 working days per full-time employee 2005 calculated costing taxpayers \u00a324 million sick leave rates department four agencies average\u2014at dvla dsa together employ 50 dft staff\u2014they significantly higher committee chairman edward leigh said surprising agencies could function adequately 2008 dvla staff went one-day strike pay inequality arguing receive similar salaries employees department transport recent level sickness absence 2012/13 6.7 days 2006 120,000 130,000 vehicle registration certificates went missing bbc investigation 2010 found vehicles worth \u00a313 million stolen using documents 18 months preceding investigation around ten cars found week forged log books police said would decades recovered 7 february 2007 letter bomb sent dvla swansea injured four people suspected part group letter bombs sent organisations deal administration motoring charges offences capita central london targeted days earlier miles cooper aged 27 school caretaker arrested 19 february 2007 charged 22 february dvla since installed x-ray machines post opening areas reduce effectiveness attacks december 2007 revealed sending surveys 1,215 drivers dvla sent confidential details wrong owners error occurred sending routine surveys discovered members public contacted dvla notify error 2009 bbc watchdog reported entitlements specifically entitlement drive motorcycle lost reissued driving licences 2005 programme highlighted drivers lost entitlements drive heavy goods vehicles similar way 2010 revealed dvla sold drivers details database certain private parking enforcement companies run individuals criminal records dvla sells details companies \u00a32.50 found agency sold business fined weeks unfair business practices dvla uses advertising warn drivers pay road tax cars may crushed despite bill rights 1689 section 12 states 'all fines forfeitures conviction illegal void uk legal persons equality law dvla therefore stands equal private citizens court law seeking civil penalty sorn 'fine so-called dvla right sue car owners civil court practice dvla illegally usurps judicial procedure bypasses presumption innocence levies fine \u00a340 \u00a380 without regard extenuating circumstances illness documents lost post etc sorn scheme never debated parliament also 'daft pointless legislation motorists ... asked confirm dvla already know acknowledgment lost post might need proof 've confirmed 've confirmed already know ... dvla makes mistake claims car owners responsible clamping vehicles explicitly outlawed scotland may english law constitute common law offence 'holding property ransom according peter oborne fines levied dvla grossly disproportionate represent justice part unofficial supplementary tax-gathering system dvla handled 12,775 complaints year 2015/16 failed resolve 14.9 first contact overall complaints year 6.5 dvla 'customer service excellence standard retained details provided measured customer satisfaction levels varied 76 97 four categories surveyed vehicle registration driver licence renewal vehicle taxation driver medical transactions data provided respect complaints sorn scheme fines levied dvlc swansea regularly referred british political sitcom yes minister bernard woolley regularly threatened reassignment episode big brother jim hacker scheduled give address", + "neighbors": [ + 1463 + ], + "mask": "Test" + }, + { + "node_id": 1464, + "label": 4, + "text": "Internet_Watch_Foundation:internet watch foundation internet watch foundation iwf registered charity based cambridgeshire england states remit minimise availability online sexual abuse content specifically child sexual abuse images videos hosted anywhere world non-photographic child sexual abuse images hosted uk content inciting racial hatred removed iwf remit police website set purpose april 2011 iwf used also take reports criminally obscene adult content hosted uk removed iwf \u2019 remit 2017 part function iwf says supply partners accurate current url list enable blocking child sexual abuse content excellent responsive national hotline reporting service receiving reports public addition receiving referrals public agents also proactively search open web deep web identify child sexual abuse images videos ask service providers take websites containing images block fall outside uk jurisdiction found open web traces content hosted geographically either directly issues notice hosting company remove imagery hosted uk works network hotlines police around world follow country \u2019 process removing imagery 99 child sexual abuse images found iwf hosted outside uk instance whilst work remove imagery takes place iwf places web address url list partners block content 2010 office government commerce ogc required procurement specifications provision internet-related services government agencies public bodies require internet service provider isp block access sites iwf list iwf operates informal partnerships police government public internet companies across world originally formed police suspected child pornography online iwf remit later expanded cover criminally obscene material iwf takes strong stance term \u2018 child pornography \u2019 website cites \u201c use term child sexual abuse reflect gravity images videos deal child pornography child porn kiddie porn acceptable descriptions child consent abuse \u201d iwf incorporated charity limited guarantee largely funded voluntary contributions uk communications service providers including isps mobile phone operators internet trade associations search engines hardware manufacturers software providers also currently receives funding european union comprising one third uk safer internet centre iwf governed board trustees consists independent chair six non-industry representatives three industry representatives plus one co-opted independent representative specialism human rights board monitors reviews iwf remit strategy policy budget enable iwf achieve objectives iwf operate offices vision park near cambridge criticized ineffective quango deserve charity status producing excessive numbers false positives secrecy proceedings poor technical implementations policies degraded response time whole uk internet iwf succeeded reducing child sexual abuse imagery hosted uk 18 1996 0.04 2018 1996 metropolitan police told internet service providers association ispa content carried newsgroups made available illegal considered isps involved publishers material therefore breaking law august 1996 chief inspector stephen french metropolitan police clubs vice unit sent open letter ispa requesting ban access list 132 newsgroups many deemed contain pornographic images explicit text list arranged first section consisted unambiguously titled paedophile newsgroups continued kinds groups police wanted restrict access including alt.binaries.pictures.erotica.cheerleaders alt.binaries.pictures.erotic.centerfolds although action taken place without prior debate parliament elsewhere police appeared best create simply enforce law acting entirely initiative alan travis home affairs editor newspaper guardian explained book bound gagged ian taylor conservative science industry minister time underlined explicit threat isps stop carrying newsgroups question police would act company provided users pornographic violent material taylor went make clear would calls legislation regulate aspects internet unless service providers seen wholeheartedly embrace responsible self-regulation isp demon internet regarded police request unacceptable censorship however attitude annoyed ispa chairman shez hamill said following tabloid-style expos\u00e9 demon internet appeared observer newspaper alleged clive feather director demon provides paedophiles access thousands photographs children sexually abused summer autumn 1996 uk police made known planning raid isp aim launching test case regarding publication obscene material internet direct result campaign threats pressure establishment internet watch foundation initially known safety net foundation september 1996 facilitated department trade industry dti discussions held certain isps metropolitan police home office body called safety net foundation formed dawe charitable trust resulted r3 safety net agreement r3 referred triple approach rating reporting responsibility september 1996 agreement made ispa linx safety net foundation subsequently renamed internet watch foundation agreement set requirements associated isps regarding identifiability traceability internet users isps cooperate iwf identify providers illegal content facilitate easier traceability demon internet driving force behind iwf creation one employees clive feather became iwf first chair funding board solicitor mark stephens first chair iwf policy board policy board developed codes guidance operational oversight hotline reporting content funding board made industry representatives chair policy board provided wherewithal iwf day day activities set required policy board 3 years operation iwf reviewed dti home office consultants kpmg denton hall report delivered october 1999 resulted number changes made role structure organisation relaunched early 2000 endorsed government dti played facilitating role creation according dti spokesman time patricia hewitt minister e-commerce said internet watch foundation plays vital role combating criminal material net counter accusations iwf biased favour isps new independent chairman appointed roger darlington former head research communication workers union iwf website offers web-based government-endorsed method reporting suspect online content remains operation united kingdom acts relevant authority accordance memorandum understanding mou concerning section 46 sexual offences act 2003 meaning analysts prosecuted looking illegal content course duties reports submitted anonymously according iwf mou potentially illegal content hosted uk iwf work relevant service provider british police agency content \u2018 taken \u2019 assist necessary offender responsible distributing offending content detected potentially illegal content includes however almost whole iwf site concerned suspected images child sexual abuse little mention criminally obscene material also within remit images judged iwf using uk law images child sexual abuse blocked government claimed would also handling images adult extreme pornography became illegal people uk possess 26 january 2009 longer part iwf \u2019 remit since 2017 iwf includes extreme pornography example criminally obscene content meaning report material hosted uk uploaded someone uk regarding blocking sites categories remit go far refer sites hosted uk appropriate authorities iwf states works partnership uk government departments home office dcms influence initiatives programmes developed combat online abuse funded european union online industry includes internet service providers mobile operators manufacturers content service providers telecommunications filtering companies search providers financial sector well blue-chip organisations support iwf corporate social responsibility reasons hotline reporting system organisation helps isps combat abuse services notice take service alerting potentially illegal content within remit systems simultaneously invites police investigate publisher iwf connections virtual global taskforce serious organised crime agency child exploitation online protection centre susie hargreaves appointed ceo september 2011 andrew puddephatt appointed chair january 2018 senior leadership team iwf comprises iwf passes notifications suspected child sexual abuse images videos inhope network hotlines across world whenever content traced inhope country inhope hotline iwf works relevant police body country previously iwf passed notifications suspected child pornography hosted non-uk servers uk national criminal intelligence service turn forwards interpol relevant foreign police authority works serious organised crime agency instead iwf however pass notifications types potentially illegal content hosted outside uk iwf compiles maintains list urls individual webpages child sexual abuse content called iwf url list previously referred child abuse image content list caic list whole website included list whole domain dedicated distribution child sexual abuse images says every url list depicts indecent images children advertisements links content publicly available website list typically contains 500 800 urls one time updated twice day ensure entries still live since iwf began proactively searching child sexual abuse imagery since introduction crawler technology list typically contains 5,000 12,000 urls every day daily \u2018 churn \u2019 content added list removed list appropriate offending uk urls listed taken quickly urls elsewhere listed removed list applied isps 95 commercial internet customers uk according iwf website blocking applies potentially criminal urls related child sexual abuse content publicly available websites distribution images channels peer-to-peer matter police partners iwf plans extend type content included list staff 13 trained analysts responsible work iwf \u2019 2018 annual report says average 376 new urls added list daily 2004 2006 bt group introduced cleanfeed technology used 80 internet service providers bt spokesman jon carter described cleanfeed function block access illegal web sites listed internet watch foundation described essentially server hosting filter checked requested urls web sites iwf list returning error message web site found positive matches 2006 home office minister alan campbell pledged isps would block access child abuse websites end 2007 middle 2006 government reported 90 domestic broadband connections either currently blocking plans end year target 100 coverage set end 2007 however middle 2008 stood 95 february 2009 government said looking ways cover final 5 interview march 2009 home office spokesperson mistakenly thought iwf deleted illegal content n't look content rate although iwf blacklist causes content censored even content found illegal court law iwf director communications sarah robertson claimed 8 december 2008 iwf opposed censorship legal content case iwf blacklisting cover art hosted wikipedia days prior claimed \u201c iwf found image illegal \u201d despite body legal jurisdiction march 2009 home office spokesperson said isps pressured sign iwf blacklist order block child pornography websites said alternative using iwf blacklist zen internet previously refused use iwf blacklist citing concerns effectiveness however quietly joined foundation september 2009 still maintaining concerns 2009 blacklist said contain 450 urls 2009 study researcher richard clayton university cambridge found quarter specific pages otherwise legitimate free file hosting services among rapidshare megaupload sendspace zshare listing pages confidential blacklist pages would cause accesses sites hosting referred iwf potentially causing unintended interference discussed 2018 iwf url list contained 100,682 unique urls r v walker sometimes called girls scream aloud obscenity trial first prosecution written material section 2 1 obscene publications act nearly two decades involved prosecution darryn walker posting story entitled girls scream aloud internet erotic story site 2008 story fictional written account describing kidnap rape murder pop group girls aloud reported iwf passed information scotland yard \u2019 obscene publications unit trial prosecution claimed story could easily accessed young fans girls aloud however defence demonstrated could located specifically searching material result case abandoned defendant cleared charges 5 december 2008 iwf system started blacklisting wikipedia article covering scorpions 1976 album virgin killer appeared article users major isps including bt vodafone virgin media/tesco.net be/o2 easynet/uk online/sky broadband plusnet demon talktalk opal telecom unable access filtered content although controversial album image still available internet shopping sites physical shops image reported iwf reader iwf determined could seen potentially illegal iwf estimated block affected 95 british residential users iwf since rescinded block issuing following statement additionally many uk internet users unable edit wikipedia pages unless registered logged wikipedia reported due single blacklisted article causing wikipedia traffic isps using system routed transparent proxy server wikipedia distinguishes unlogged-in users ip address interpreted unlogged-in users particular isp single user editing massively proxy address triggered wikipedia anti-abuse mechanism blocking 14 january 2009 uk users reported 85 billion pages internet archive wayback machine blocked although iwf policy block individual offending webpages whole domains according iwf chief executive peter robbins due technical hitch internet archive web site contained urls iwf blacklist requests sent demon internet carried particular header clashed internet archive internal mechanism convert web links serving archived versions web pages actual blocked url caused incident never became publicly known many isps implement iwf filtering using transparent proxy server unconnected iwf quoting plusnet ip address matches server used host one websites iwf list request diverted proxy server hosting server blacklisted problem due requesting page server also hosts listed page iwf lists internet companies voluntarily committed block access child sexual abuse web pages companies may use transparent proxies techniques using transparent proxy unintended side effect quite independent iwf filtering appearing websites connected originating proxy ip instead user real ip sites detect user ip adjust behaviour accordingly example trying download files file distribution website restricts free-of-charge usage enforcing delay typically 30 minutes downloads attempt download interpreted originating isp proxy rather user consequence user isp downloaded file site last half-hour likely large isp download allowed unintended consequence isp use proxy servers iwf filtering file sharing sites distribute files types example linux distribution files large use proxy servers also reported caused problem editing wikipedia blocking actual offending web page reported iwf filtering criticised interfering legitimate internet activity ineffective anyone intending access objectionable content one carefully argued discussion opposing things child pornography terrorism points filtering side effects discussed section would stop access material images child sexual abuse would stop email ftp https p2p usenet irc many ways access content simple encryption systems never stop best drives underground harder assess track february 2009 yorkshire-based software developer lodged formal complaint regarding iwf status charity charity commission pointed regulating worst internet really charitable purpose iwf existed mainly serve interests isps subscribing rather public iwf spokesperson said iwf attained charitable status 2004 order subject robust governance requirements higher levels scrutiny accountability charity law alongside company law brings iwf listed fakecharities.org directory so-called charities receive substantial funding either uk eu governments also termed quango critics implying poor management lack accountability iwf publishes details inspections audits website includes hotline audit every two years independent experts quality assurance inspections inhope hotline umbrella body iso27001 compliance human rights audit organisation carried lord ken macdonald 2014 following iwf blacklisting wikipedia article organisation operating habits came scrutiny j.r. raphael pc world stated incident raised serious free-speech issues alarming one non-governmental organisation ultimately acting morality police 95 uk internet users frank fisher guardian criticized iwf secretiveness lack legal authority among things noted blacklist could contain anything visitor blocked address may know browsing censored government believes self-regulatory system best solution metropolitan police also believe working isps rather trying force via legislation way forward iwf list urls considered host objectionable material distinct actual confidential blacklist pages available isps isps obliged subscribe self-appointed self-regulated internet watchdog views user-submitted content compiles list websites deems contain illegal images questions raised regarding legality viewing content would normally constitute criminal offence iwf memorandum understanding crown prosecution service association chief police officers \u2013 npcc \u201c clarify position professionally involved management operation use electronic communications networks services may face jeopardy criminal offences reassured protection acting combat creation distribution images child abuse \u201d iwf criticized blacklisting legal content telling websites blocked circumstances owner blocked webpage might even know offending content site means content would still readily available anyone outside uk internet companies deploy services across world implement iwf url list help prevent people stumbling across child sexual abuse imagery blocking methodology implemented company taking list iwf \u2019 good practice blocking guide recommends companies use splash page people know page blocked view rather simply delivering \u201c page found \u201d message lord ken macdonald carried human rights audit addressing iwf \u2019 members agm 26 november 2013 lord macdonald said \u201c deeply impressed \u201d quality staff \u201c commitment attention freedom expression privacy rights \u201d historically blacklisting sites may concealed generic http 404 page found message rather explanation content censored exact method censorship determined implementing isp bt example return http 404 pages whereas demon return message stating page censored time wikipedia blocking performance issues accessing site uk reported october 2014 users sky broadband reported slow intermittent performance image host imgur clicking image would typically result site appearing accessing via https causes images load normally bypasses proxy used sites blacklisted content aside iwf url list iwf developed many services may taken internet companies help stop spread child sexual abuse imagery online", + "neighbors": [ + 134, + 436, + 852 + ], + "mask": "Test" + }, + { + "node_id": 1465, + "label": 8, + "text": "Semantic_Web:semantic web semantic web extension world wide web standards world wide web consortium w3c standards promote common data formats exchange protocols web fundamentally resource description framework rdf according w3c semantic web provides common framework allows data shared reused across application enterprise community boundaries semantic web therefore regarded integrator across different content information applications systems term coined tim berners-lee web data data web processed machines\u2014that one much meaning machine-readable critics questioned feasibility proponents argue applications library information science industry biology human sciences research already proven validity original concept berners-lee originally expressed vision semantic web follows 2001 scientific american article berners-lee hendler lassila described expected evolution existing web semantic web 2006 berners-lee colleagues stated simple idea\u2026remains largely unrealized 2013 four million web domains contained semantic web markup following example text 'paul schuster born dresden website annotated connecting person place birth following html-fragment shows small graph described rdfa-syntax using schema.org vocabulary wikidata id div vocab= http //schema.org/ typeof= person /div example defines following five triples shown turtle syntax triple represents one edge resulting graph first element triple subject name node edge starts second element predicate type edge last third element object either name node edge ends literal value e.g text number etc. triples result graph shown given figure one advantages using uniform resource identifiers uris dereferenced using http protocol according so-called linked open data principles dereferenced uri result document offers data given uri example uris edges nodes e.g nowiki http //schema.org/person /nowiki nowiki http //schema.org/birthplace /nowiki nowiki http //www.wikidata.org/entity/q1731 /nowiki dereferenced result rdf graphs describing uri e.g dresden city germany person sense uri fictional second graph shows previous example enriched triples documents result dereferencing nowiki http //schema.org/person /nowiki green edge nowiki http //www.wikidata.org/entity/q1731 /nowiki blue edges additionally edges given involved documents explicitly edges automatically inferred triple original rdfa fragment triple document nowiki http //schema.org/person /nowiki green edge figure allow infer following triple given owl semantics red dashed line second figure concept semantic network model formed early 1960s researchers cognitive scientist allan m. collins linguist m. ross quillian psychologist elizabeth f. loftus form represent semantically structured knowledge applied context modern internet extends network hyperlinked human-readable web pages inserting machine-readable metadata pages related enables automated agents access web intelligently perform tasks behalf users term semantic web coined tim berners-lee inventor world wide web director world wide web consortium w3c oversees development proposed semantic web standards defines semantic web web data processed directly indirectly machines many technologies proposed w3c already existed positioned w3c umbrella used various contexts particularly dealing information encompasses limited defined domain sharing data common necessity scientific research data exchange among businesses addition technologies similar goals emerged microformats many files typical computer also loosely divided human-readable documents machine-readable data documents like mail messages reports brochures read humans data calendars addressbooks playlists spreadsheets presented using application program lets viewed searched combined currently world wide web based mainly documents written hypertext markup language html markup convention used coding body text interspersed multimedia objects images interactive forms metadata tags provide method computers categorize content web pages examples field names keywords description author assigned values computing cheap widgets sale john doe metadata tagging categorization computer systems want access share data easily identify relevant values html tool render perhaps web browser software perhaps another user agent one create present page lists items sale html catalog page make simple document-level assertions document title 'widget superstore capability within html assert unambiguously example item number x586172 acme gizmo retail price \u20ac199 consumer product rather html say span text x586172 something positioned near acme gizmo \u20ac199 etc way say catalog even establish acme gizmo kind title \u20ac199 price also way express pieces information bound together describing discrete item distinct items perhaps listed page semantic html refers traditional html practice markup following intention rather specifying layout details directly example use denoting emphasis rather specifies italics layout details left browser combination cascading style sheets practice falls short specifying semantics objects items sale prices microformats extend html syntax create machine-readable semantic markup objects including people organisations events products similar initiatives include rdfa microdata schema.org semantic web takes solution involves publishing languages specifically designed data resource description framework rdf web ontology language owl extensible markup language xml html describes documents links rdf owl xml contrast describe arbitrary things people meetings airplane parts technologies combined order provide descriptions supplement replace content web documents thus content may manifest descriptive data stored web-accessible databases markup within documents particularly extensible html xhtml interspersed xml often purely xml layout rendering cues stored separately machine-readable descriptions enable content managers add meaning content i.e. describe structure knowledge content way machine process knowledge instead text using processes similar human deductive reasoning inference thereby obtaining meaningful results helping computers perform automated information gathering research example tag would used non-semantic web page encoding similar information semantic web page might look like tim berners-lee calls resulting network linked data giant global graph contrast html-based world wide web berners-lee posits past document sharing future data sharing answer question provides three points instruction one url point data two anyone accessing url get data back three relationships data point additional urls data tim berners-lee described semantic web component web 3.0 semantic web sometimes used synonym web 3.0 though definition term varies web 3.0 started emerge movement away centralisation services like search social media chat applications dependent single organisation function guardian journalist john harris reviewed concept favorably early2019 particular work bernerslee project called 'solid based around personal data stores 'pods individuals retain control bernerslee formed startup inrupt advance idea attract volunteer developers challenges semantic web include vastness vagueness uncertainty inconsistency deceit automated reasoning systems deal issues order deliver promise semantic web list challenges illustrative rather exhaustive focuses challenges unifying logic proof layers semantic web world wide web consortium w3c incubator group uncertainty reasoning world wide web urw3-xg final report lumps problems together single heading uncertainty many techniques mentioned require extensions web ontology language owl example annotate conditional probabilities area active research standardization semantic web context web 3.0 care w3c term semantic web often used specifically refer formats technologies enable collection structuring recovery linked data enabled technologies provide formal description concepts terms relationships within given knowledge domain technologies specified w3c standards include semantic web stack illustrates architecture semantic web functions relationships components summarized follows well-established standards yet fully realized intent enhance usability usefulness web interconnected resources creating semantic web services services could useful public search engines could used knowledge management within organization business applications include corporation closed group users management able enforce company guidelines like adoption specific ontologies use semantic annotation compared public semantic web lesser requirements scalability information circulating within company trusted general privacy less issue outside handling customer data critics question basic feasibility complete even partial fulfillment semantic web pointing difficulties setting lack general-purpose usefulness prevents required effort invested 2003 paper marshall shipman point cognitive overhead inherent formalizing knowledge compared authoring traditional web hypertext according marshall shipman tacit changing nature much knowledge adds knowledge engineering problem limits semantic web applicability specific domains issue point domain- organisation-specific ways express knowledge must solved community agreement rather technical means turns specialized communities organizations intra-company projects tended adopt semantic web technologies greater peripheral less-specialized communities practical constraints toward adoption appeared less challenging domain scope limited general public world-wide web finally marshall shipman see pragmatic problems idea knowledge navigator-style intelligent agents working largely manually curated semantic web cory doctorow critique metacrap perspective human behavior personal preferences example people may include spurious metadata web pages attempt mislead semantic web engines naively assume metadata veracity phenomenon well-known metatags fooled altavista ranking algorithm elevating ranking certain web pages google indexing engine specifically looks attempts manipulation peter g\u00e4rdenfors timo honkela point logic-based semantic web technologies cover fraction relevant phenomena related semantics enthusiasm semantic web could tempered concerns regarding censorship privacy instance text-analyzing techniques easily bypassed using words metaphors instance using images place words advanced implementation semantic web would make much easier governments control viewing creation online information information would much easier automated content-blocking machine understand addition issue also raised use foaf files geolocation meta-data would little anonymity associated authorship articles things personal blog concerns addressed policy aware web project active research development topic another criticism semantic web would much time-consuming create publish content would need two formats one piece data one human viewing one machines however many web applications development addressing issue creating machine-readable format upon publishing data request machine data development microformats one reaction kind criticism another argument defense feasibility semantic web likely falling price human intelligence tasks digital labor markets amazon mechanical turk specifications erdf rdfa allow arbitrary rdf data embedded html pages grddl gleaning resource descriptions dialects language mechanism allows existing material including microformats automatically interpreted rdf publishers need use single format html first research group explicitly focusing corporate semantic web acacia team inria-sophia-antipolis founded 2002 results work include rdf based corese search engine application semantic web technology realm e-learning since 2008 corporate semantic web research group located free university berlin focuses building blocks corporate semantic search corporate semantic collaboration corporate ontology engineering ontology engineering research includes question involve non-expert users creating ontologies semantically annotated content extracting explicit knowledge interaction users within enterprises tim o'reilly coined term web 2.0 proposed long-term vision semantic web web data sophisticated applications manipulate data web data web transforms web distributed file system distributed database system", + "neighbors": [ + 12, + 14, + 16, + 429, + 662, + 684, + 1007, + 1099, + 1142, + 1219, + 1280, + 1486, + 1615, + 1635, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1466, + "label": 9, + "text": "Chez_Scheme:chez scheme chez scheme programming language dialect implementation language scheme type lisp uses incremental native-code compiler produce native binary files x86 ia-32 x86-64 powerpc sparc processor architectures supported r6rs standard since version 7.9.1 free open-source software released apache license version 2.0 first released 1985 r. kent dybvig originally licensed proprietary software released open-source software github version 9.4 petite chez scheme sibling implementation uses threaded interpreter design instead chez scheme incremental native-code compiler programs written chez scheme run unchanged petite chez scheme long depend using compiler example foreign function interface available compiler petite chez scheme freely distributable may used royalty fees subject license agreement one series benchmarks chez scheme among fastest available scheme implementations sun sparc processor architecture petite chez scheme among slowest implementations common x86 pentium 32-bit processor architecture chez scheme windowing system computer graphics package called scheme widget library supported portable slib library", + "neighbors": [ + 27, + 46, + 56, + 85, + 173, + 194, + 203, + 210, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 412, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 796, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1477, + 1516, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1467, + "label": 4, + "text": "Metulji_botnet:metulji botnet metulji botnet discovered june 2011 botnet mainly involved cyberscamming denial service attacks botnet dismantled consisted 12 million individual zombie computers infected butterfly bot making june 2011 largest known botnet known type computers vulnerable tell computer part botnet", + "neighbors": [ + 43, + 91, + 141, + 149, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 450, + 490, + 522, + 531, + 533, + 550, + 564, + 576, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 666, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1090, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1358, + 1365, + 1393, + 1436, + 1475, + 1543, + 1554, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1468, + "label": 2, + "text": "Xenomai:xenomai xenomai real-time development framework cooperating linux kernel provide pervasive interface-agnostic hard real-time support user space applications seamlessly integrated linux environment xenomai project launched august 2001 2003 merged real-time application interface rtai project produce production-grade real-time free software platform linux called rtai/fusion top xenomai abstract real-time operating system rtos core eventually rtai/fusion effort became independent rtai 2005 xenomai project xenomai based abstract rtos core usable building kind real-time interface nucleus exports set generic rtos services number rtos personalities called \u201c skins \u201d built nucleus providing specific interface applications using services single generic core implement long list differences xenomai rtai though projects share ideas support rtdm layer major differences derive goals projects aim respective implementation rtai focused lowest technically feasible latencies xenomai also considers clean extensibility rtos skins portability maintainability important goals xenomai path towards ingo moln\u00e1r preempt_rt support another major difference compared rtai objectives", + "neighbors": [ + 85, + 134, + 187, + 213, + 219, + 265, + 267, + 294, + 305, + 327, + 346, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 735, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1397, + 1415, + 1456, + 1494, + 1524, + 1526, + 1546, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1469, + "label": 3, + "text": "Microsequencer:microsequencer computer architecture engineering sequencer microsequencer generates addresses used step microprogram control store used part control unit cpu stand-alone generator address ranges usually addresses generated combination counter field microinstruction subset instruction register counter used typical case next microinstruction one execute field microinstruction used jumps logic since cpus implement instruction set useful able decode instruction bits directly sequencer select set microinstructions perform cpu instructions modern cisc processors use combination pipelined logic process lower complexity opcodes completed one clock cycle microcode implement ones take multiple clock cycles complete one first integrated microcoded processors ibm palm processor emulated processor instruction microcode used ibm 5100 one first personal computers recent examples similar microsequencer-based processors microcore labs mcl86 mcl51 mcl65 cores emulate intel 8086/8088 8051 mos 6502 instruction sets entirely microcode", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 123, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1256, + 1272, + 1290, + 1398, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1470, + "label": 5, + "text": "SOAP:soap soap abbreviation simple object access protocol messaging protocol specification exchanging structured information implementation web services computer networks purpose provide extensibility neutrality independence uses xml information set message format relies application layer protocols often hypertext transfer protocol http simple mail transfer protocol smtp message negotiation transmission soap allows processes running disparate operating systems windows linux communicate using extensible markup language xml since web protocols like http installed running operating systems soap allows clients invoke web services receive responses independent language platforms soap provides messaging protocol layer web services protocol stack web services xml-based protocol consisting three parts soap three major characteristics example soap procedures application send soap request server web services enabled\u2014such real-estate price database\u2014with parameters search server returns soap response xml-formatted document resulting data e.g. prices location features since generated data comes standardized machine-parsable format requesting application integrate directly soap architecture consists several layers specifications soap evolved successor xml-rpc though borrows transport interaction neutrality web service addressing envelope/header/body elsewhere probably wddx soap designed object-access protocol 1998 dave winer box bob atkinson mohsen al-ghosein microsoft atkinson al-ghosein working specification made available submitted ietf 13 september 1999 according box due politics within microsoft microsoft hesitation dave winer shipped xml-rpc 1998 submitted internet draft reach rfc status therefore considered standard version 1.1 specification published w3c note 8 may 2000 since version 1.1 reach w3c recommendation status considered standard either version 1.2 specification however became w3c recommendation june 24 2003 soap specification maintained xml protocol working group world wide web consortium group closed 10 july 2009 soap originally stood simple object access protocol version 1.2 standard dropped acronym soap first introduced became underlying layer complex set web services based web services description language wsdl xml schema universal description discovery integration uddi different services especially uddi proved far less interest appreciation gives complete understanding expected role soap compared web services actually evolved soap specification broadly defined consisting following 3 conceptual components protocol concepts encapsulation concepts network concepts soap specification defines messaging framework consists soap message ordinary xml document containing following elements smtp http valid application layer protocols used transport soap http gained wider acceptance works well today internet infrastructure specifically http works well network firewalls soap may also used https protocol http application level uses encrypted transport protocol underneath either simple mutual authentication advocated ws-i method provide web service security stated ws-i basic profile 1.1 major advantage distributed protocols like giop/iiop dcom normally filtered firewalls soap amqp yet another possibility implementations support soap also advantage dcom unaffected security rights configured machines require knowledge transmitting receiving nodes lets soap loosely coupled way possible dcom also soap-over-udp oasis standard xml information set chosen standard message format widespread use major corporations open source development efforts typically xml information set serialized xml wide variety freely available tools significantly eases transition soap-based implementation somewhat lengthy syntax xml benefit drawback promotes readability humans facilitates error detection avoids interoperability problems byte-order endianness slow processing speed cumbersome example corba giop ice dcom use much shorter binary message formats hand hardware appliances available accelerate processing xml messages binary xml also explored means streamlining throughput requirements xml xml messages self-documenting nature usually 'overhead headers footers nested tags delimiters actual data contrast earlier protocols overhead usually relatively small percentage overall message financial messaging soap found result 2\u20134 times larger message previous protocols fix financial information exchange cdr common data representation xml information set serialized xml instance csv json xml-infoset representations exist also need specify generic transformation framework concept soap bindings allows specific bindings specific application drawback senders receivers support newly defined binding post /instock http/1.1 host www.example.org content-type application/soap+xml charset=utf-8 content-length 299 soapaction http //www.w3.org/2003/05/soap-envelope xml version= 1.0 soap envelope xmlns soap= http //www.w3.org/2003/05/soap-envelope xmlns m= http //www.example.org /soap envelope", + "neighbors": [ + 16, + 77, + 134, + 168, + 175, + 330, + 415, + 570, + 680, + 684, + 712, + 961, + 963, + 1132, + 1151, + 1280, + 1395, + 1416, + 1431, + 1484, + 1528, + 1550, + 1552 + ], + "mask": "Validation" + }, + { + "node_id": 1471, + "label": 4, + "text": "Messaging_Architects:messaging architects messaging architects canadian software company specializing e-mail products flagship product netmail integrated email management platform launched march 1995 chronofax company distributor computer-based fax solutions chronofax became tobit software north america result partnership german company called tobit produced fax software novell netware groupwise markets three-and-a-half-year partnership tobit came close company renamed messaging architects messaging architects initially provided add-ons novell groupwise messaging platform company offers integrated email management platform called netmail netmail consolidates company portfolio email software solutions includes netmail secure formerly gwguardian m+guardian netmail archive formerly m+archive netmail search netmail migrate formerly migrator netmail store formerly m+securestore company also provides email platform migration services messaging architects also highly skilled professional services team full novell microsoft exchange certification messaging architects works messaging platform providers provide solutions microsoft exchange novell groupwise lotus notes late 2008 mark crispin inventor imap worked messaging architects senior software engineer developing entirely new imap server based upon distributed mail store extending mix format messaging architects email security email archiving solutions positioned gartner magic quadrant reports 2009 m+archive positioned magic quadrant email active archiving 2009 m+guardian email security solution achieve one gold two vbspam platinum awards virus bulletin anti-spam certification messaging architects also offers range remote on-site services managing email risk co-existence different email platforms including professional services email migration services email consulting email policy training", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1472, + "label": 4, + "text": "Web_application_security:web application security web application security branch information security deals specifically security websites web applications web services high level web application security draws principles application security applies specifically internet web systems majority web application attacks occur cross-site scripting xss sql injection attacks typically made possible flawed coding failure sanitize application inputs outputs attacks ranked 2009 cwe/sans top 25 dangerous programming errors according security vendor cenzic top vulnerabilities march 2012 include open web application security project owasp provides free open resources led non-profit called owasp foundation owasp top 10 2017 published result recent research based comprehensive data compiled 40 partner organizations data approximately 2.3 million vulnerabilities discovered across 50,000 applications according owasp top 10 2017 ten critical web application security risks include secure web application development enhanced applying security checkpoints techniques early stages development well throughout software development lifecycle special emphasis applied coding phase development security mechanisms used include threat modeling risk analysis static analysis digital signature among others owasp emerging standards body web application security particular published owasp top 10 describes detail major threats web applications web application security consortium wasc created web hacking incident database whid also produced open source best practice documents web application security whid became owasp project february 2014 security fundamentally based people processes number technical solutions consider designing building testing secure web applications high level solutions include", + "neighbors": [ + 11, + 12, + 14, + 144, + 149, + 186, + 225, + 293, + 310, + 338, + 363, + 379, + 439, + 479, + 518, + 528, + 531, + 576, + 698, + 739, + 740, + 762, + 800, + 1036, + 1039, + 1090, + 1112, + 1239, + 1303, + 1325, + 1335, + 1361, + 1368, + 1379, + 1416, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1473, + "label": 4, + "text": "Racetrack_problem:racetrack problem racetrack problem specific instance type race condition racetrack problem flaw system process whereby output and/or result process unexpectedly critically dependent sequence timing events run circular pattern note problem semantically different race condition circular nature problem term originates idea two signals racing circular motion influence output first racetrack problems occur electronics systems especially logic circuits computer software especially multithreaded distributed programs", + "neighbors": [ + 876 + ], + "mask": "Test" + }, + { + "node_id": 1474, + "label": 2, + "text": "IncludeOS:includeos includeos minimal open source unikernel operating system cloud services iot includeos allows users run c++ applications cloud without operating system includeos adds operating system functionality application allowing oneself create 'virtual machine application includeos applications boot tens milliseconds require megabytes disk memory minimalist architecture includeos means virtual memory space turn therefore concept system calls user space", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 265, + 322, + 353, + 380, + 387, + 434, + 465, + 583, + 650, + 664, + 720, + 721, + 754, + 797, + 884, + 891, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1415, + 1441, + 1456, + 1530, + 1546, + 1578, + 1610, + 1616, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1475, + "label": 4, + "text": "Democratic_Congressional_Campaign_Committee_cyber_attacks:democratic congressional campaign committee cyber attacks friday july 29 2016 democratic congressional campaign committee reported computer systems infiltrated strongly believed us intelligence sources infiltrator groups russian foreign intelligence groups breached democratic national committee computer systems groups known fancy bear cozy bear sofacy crowdstrike assisted efforts deal dccc breach significant concern russians attempting influence 2016 presidential campaign russian cyber intrusions united states government private sector computer systems significantly increased u.s imposed sanctions russia invasion crimea ukraine president obama preference publicize cyber attacks", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 379, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1467, + 1543, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1476, + "label": 7, + "text": "Openbravo:openbravo openbravo cloud-based software provider specialized retail solutions head office openbravo s.l located pamplona spain openbravo also offices barcelona paris mexico df kolkata company main product openbravo commerce cloud cloud-based pos retail management solution worldwide distribution implementations software openbravo relies heavily partner network openbravo multiple-time winner infoworld bossie award best open source software application last awarded august 2014 openbravo roots development business administration software first developed two employees university navarra nicolas serrano ismael ciordia involved mid 1990s developing management university used emerging internet technologies work subsequently introduced new approach web applications concept realized new company called tecnicia founded august 2001 serrano ciordia aguinaga 2005 two management consultants manel sarasa josep mitj\u00e1 asked venture capital company evaluate tecnicia prepare business plan evolution 2006 two consultants joined tecnicia ceo coo respectively around time spanish investment company sodena invested 6.4 million usd development company 2006 company renamed openbravo first product launched openbravo erp code open-sourced april year 2007 company announced acquisition librepos java-based point-of-sale pos application retail hospitality businesses librepos rebranded openbravo pos openbravo java pos may 2008 openbravo attracted three investors amadeus uk gimv belgium adara spain second investment round totalling 12.5 million usd investment launched openbravo one leading open source companies substantial resources develop products services july 2012 openbravo launched openbravo retail vertical solution retail industry including openbravo web pos new pos solution replaced previous openbravo java pos openbravo web pos web mobile responsive pos solution march 2014 openbravo erp renamed openbravo erp platform openbravo retail renamed openbravo commerce platform may 2015 openbravo commerce platform openbravo erp platform renamed openbravo commerce suite openbravo business suite openbravo announces strategic focus retail openbravo also launches openbravo subscription management recurring billing specialized solution recurring transactions based revenue models openbravo present 60 countries global partner network openbravo targets today mid-sized large organizations seeking complete solution manage entire business specific solutions help improve existing legacy systems openbravo focuses strategy retail openbravo commerce suite openbravo erp first product launched openbravo web-based erp business solution small medium-sized companies released openbravo public license based mozilla public license model program originally based compiere erp program also open source released gnu general public license version 2 program among top ten active projects sourceforge january 2008 using openbravo erp organizations automate register common business processes following processes supported sales procurement manufacturing projects finance mrp numerous commercial extensions available openbravo exchange procured users commercial edition openbravo erp paid-for version offers additional functionality compared free community edition integrated administration tools non-technical tool updates upgrades access openbravo exchange service level agreement characteristic openbravo erp application green web interface users maintain company data web-browser openbravo also create export reports data several formats pdf microsoft excel openbravo java-based architecture focuses two development models two models allow integration programs simple interface application open standards openbravo erp integrated open source applications like magento webshop pentaho business intelligence processmaker bpm liferay portal sugarcrm march 2014 openbravo erp renamed openbravo erp platform changed openbravo business suite may 2015 openbravo pos first pos solution offered openbravo java point-of-sale pos application retail hospitality businesses application came existence called tinapos legal reasons application renamed librepos 2007 librepos acquired openbravo known current name program completely integrated openbravo erp integration possible update stock levels financial journals customer data directly central database pos sales executed stores openbravo pos applied using pdas order intake july 2012 openbravo launched new pos solution openbravo web pos included openbravo commerce suite replaced openbravo java pos openbravo business suite launched may 2015 replacing previous openbravo erp platform global management solution built top openbravo technology platform including horizontal erp crm bi functionality across industries see latest confirmed stable cs release business suite release notes openbravo commerce suite openbravo solution retailers multi-channel retail management solution including responsive web mobile pos openbravo web pos backed comprehensive functionality merchandise management supply chain management enterprise management see latest confirmed stable cs release openbravo commerce suite release notes openbravo web pos launched 2012 included openbravo retail solution today openbravo commerce suite responsive web mobile pos solution core component functionality physical stores openbravo technology platform lies heart openbravo solutions modular mobile-enabled cloud-ready platform providing core set technologies allow extending openbravo fit companies needs developing completely new enterprise solutions looking best html5 framework openbravo mobile decided choose enyo openbravo web pos mobile solution openbravo analytics embedded analytics engine provides business intelligence capabilities openbravo solutions provides infrastructure necessary create analytical cubes olap reports combines power high performing open source business intelligence components pentaho use mondrian saiku allied openbravo user interface provide fully integrated analytics solution commercial solution companies recurring billing revenue models including functionality pricing definition automatic revenue recognition accounting openbravo user interface available multiple languages like english spanish french italian brazilian amongst others openbravo solutions distributed subscription-based model customers subscribe number users and/or pos terminals bundled pack services additional options two different commercial editions customers subscribe additional users and/or pos terminals well additional functionality packaged extension modules examples extension modules country localizations connectors like sugarcrm tools developed openbravo partners addition commercial editions community edition exists free limited set capabilities available without professional support available openbravo partners openbravo products distributed following licenses openbravo many partners across world including exceloid soft systems india", + "neighbors": [ + 157, + 250, + 259, + 1476 + ], + "mask": "Test" + }, + { + "node_id": 1477, + "label": 9, + "text": "Scope_(computer_science):scope computer science computer programming scope name binding \u2013 association name entity variable \u2013 region computer program binding valid name used refer entity region referred parts program name may refer different entity may different binding nothing may unbound scope binding also known visibility entity particularly older technical literature \u2013 perspective referenced entity referencing name scope part program scope set bindings \u2013 precise definition tricky casual use practice largely corresponds block function file depending language type entity term scope also used refer set entities visible names valid within portion program given point program correctly referred context environment strictly speaking practice programming languages part program refers portion source code area text known lexical scope languages however part program refers portion run time time period execution known dynamic scope terms somewhat misleading \u2013 misuse technical terms discussed definition \u2013 distinction accurate precise standard respective terms lexical scope main focus article dynamic scope understood contrast lexical scope cases name resolution based lexical scope relatively straightforward use implement use one read backwards source code determine entity name refers implementation one maintain list names contexts compiling interpreting program difficulties arise name masking forward declarations hoisting considerably subtler ones arise non-local variables particularly closures strict definition lexical scope name identifier unambiguous \u2013 portion source code binding name entity applies \u2013 virtually unchanged 1960 definition specification algol 60 representative language specification follow commonly scope refers given name refer given variable \u2013 declaration effect \u2013 also apply entities functions types classes labels constants enumerations fundamental distinction scoping part program means languages lexical scope also called static scope name resolution depends location source code lexical context defined named variable function defined contrast languages dynamic scope name resolution depends upon program state name encountered determined execution context calling context practice lexical scope variable definition resolved searching containing block function fails searching outer containing block whereas dynamic scope calling function searched function called calling function progressing call stack course rules first look local definition variable modern languages use lexical scoping variables functions though dynamic scoping used languages notably dialects lisp scripting languages template languages perl 5 offers lexical dynamic scoping even lexically scoped languages scope closures confusing uninitiated depend lexical context closure defined called lexical resolution determined compile time also known early binding dynamic resolution general determined run time thus known late binding object-oriented programming dynamic dispatch selects object method runtime though whether actual name binding done compile time run time depends language de facto dynamic scoping common macro languages directly name resolution instead expand place programming frameworks like angularjs use term scope mean something entirely different used article frameworks scope object programming language use javascript case angularjs used certain ways framework emulate dynamic scope language uses lexical scope variables angularjs scopes scope scope using usual meaning term given part program following usual rules variable scope language like object using inheritance transclusion rules context angularjs sometimes term scope dollar sign used avoid confusion using dollar sign variable names often discouraged style guides scope important component name resolution turn fundamental language semantics name resolution including scope varies programming languages within programming language varies type entity rules scope called scope rules scoping rules together namespaces scoping rules crucial modular programming change one part program break unrelated part discussing scope three basic concepts scope extent context scope context particular frequently confused scope property identifier fixed context property program varies position precisely context property position program either position source code lexical context point run time execution context runtime context calling context execution context consists lexical context current execution point plus additional runtime state call stack thus execution point program variable name scope variable name context meaning context point execution point exits variable name scope returning function variable name goes context narrowly speaking execution program enters exits various scopes point execution identifiers context context hence identifiers come context go context program enters exits scope \u2013 however practice usage much looser scope source-code level concept property identifiers particularly variable function names \u2013 identifiers source code references entities program \u2013 part behavior compiler interpreter language issues scope similar pointers type reference used programs generally using value variable name context variable uninitialized analogous dereferencing accessing value wild pointer undefined however variables destroyed go context analog dangling pointer exist entities variables scope subset lifetime also known extent \u2013 name refer variable exists possibly undefined value variables exist necessarily visible variable may exist inaccessible value stored referred within given context accessible via given name case context program scope name cases lifetime irrelevant \u2013 label named position source code lifetime identical program statically compiled languages may context given point program likewise static variables \u2013 static global variable context entire program static local variable context within function local context lifetime entire run program determining entity identifier refers known name resolution name binding particularly object-oriented programming varies languages given identifier language properly compiler interpreter checks entities context matches case ambiguity two entities name global local variable name name resolution rules used distinguish frequently name resolution relies inner-to-outer rule python legb local enclosing global built-in rule names implicitly resolves narrowest relevant context cases name resolution explicitly specified codice_1 codice_2 keywords python cases default rules overridden two identical identifiers context time referring different entities one says name masking occurring higher-priority name usually innermost masking lower-priority name level variables known variable shadowing due potential logic errors masking languages disallow discourage masking raising error warning compile time run time various programming languages various different scoping rules different kinds declarations identifiers scoping rules large effect language semantics consequently behavior correctness programs languages like c++ accessing unbound variable well-defined semantics may result undefined behavior similar referring dangling pointer declarations identifiers used outside scope generate syntax errors scopes frequently tied language constructs determined implicitly many languages also offer constructs specifically controlling scope scope vary little single expression much entire program many possible gradations simplest scoping rule global scope \u2013 entities visible throughout entire program basic modular scoping rule two-level scoping global scope anywhere program local scope within function sophisticated modular programming allows separate module scope names visible within module private module visible outside within function languages c allow block scope restrict scope subset function others notably functional languages allow expression scope restrict scope single expression scopes include file scope notably c functions similarly module scope block scope outside functions notably perl subtle issue exactly scope begins ends languages c scope starts declaration thus different names declared within given block different scopes requires declaring functions use though necessarily defining requires forward declaration cases notably mutual recursion languages javascript python name scope begins start relevant block start function regardless defined names within given block scope javascript known variable hoisting however name bound value varies behavior in-context names undefined value differs python use undefined variables yields runtime error javascript undefined variables usable undefined value function declarations also hoisted top containing function usable throughout function many languages especially functional languages offer feature called let-expressions allow declaration scope single expression convenient example intermediate value needed computation example standard ml codice_3 returns 12 codice_4 expression evaluates 144 using temporary variable named x avoid calling codice_3 twice languages block scope approximate functionality offering syntax block embedded expression example aforementioned standard ml expression could written perl gnu c python auxiliary variables generator expressions list comprehensions python 3 expression scope c variable names function prototype expression scope known context function protocol scope variable names prototype referred may different actual definition \u2013 dummies \u2013 often omitted though may used generating documentation instance many block-structured programming languages allow scope restricted block known block scope began algol 60 e declaration ... valid block today particularly associated languages pascal c families traditions often block contained within function thus restricting scope part function cases perl block may within function representative example use block scope c code shown two variables scoped loop loop variable n initialized incremented iteration loop auxiliary variable n_squared initialized iteration purpose avoid adding variables function scope relevant particular block \u2013 example prevents errors generic loop variable accidentally already set another value example expression codice_6 would generally assigned auxiliary variable body loop would simply written codice_7 complicated examples auxiliary variables useful blocks primarily used control flow loops cases block scope means scope variable depends structure function flow execution however languages block scope typically also allow use naked blocks whose sole purpose allow fine-grained control variable scope example auxiliary variable may defined block used say added variable function scope discarded block ends loop might enclosed block initializes variables used inside loop initialized subtlety several programming languages algol 68 c demonstrated example standardized since c99 block-scope variables declared within body block also within control statement analogous function parameters declared function declaration block function body starts scope whole function body primarily used loops initialization statement separate loop condition unlike loops common idiom block scope used shadowing example inside block auxiliary variable could also called n shadowing parameter name considered poor style due potential errors furthermore descendants c java c despite support block scope local variable made go scope end function allow one local variable hide another languages attempted declaration second n would result syntax error one n variables would renamed block used set value variable block scope requires variable declared outside block complicates use conditional statements single assignment example python use block scope one may initialize variable codice_8 accessible codice_9 statement perl block scope instead requires declaring variable prior block often instead rewritten using multiple assignment initializing variable default value python necessary would perl would case single variable assignment alternative use ternary operator avoid block general possible multiple variable assignments difficult read complex logic significant issue c notably string assignment string initialization automatically allocate memory string assignment already initialized variable requires allocating memory string copy checking successful languages allow concept block scope applied varying extents outside function example perl snippet right counter variable name block scope due use keyword increment_counter function name global scope call increment_counter increase value counter one return new value code outside block call increment_counter otherwise obtain alter value counter idiom allows one define closures perl commonly used programming languages offer way create local variable function subroutine variable whose scope ends goes context function returns cases lifetime variable duration function call \u2013 automatic variable created function starts variable declared destroyed function returns \u2013 scope variable within function though meaning within depends whether scoping lexical dynamic however languages c also provide static local variables lifetime variable entire lifetime program variable context inside function case static local variables variable created program initializes destroyed program terminates static global variable context within function like automatic local variable importantly lexical scoping variable function scope scope within lexical context function moves context another function called within function moves back context function returns \u2013 called functions access local variables calling functions local variables context within body function declared contrast dynamic scoping scope extends runtime context function local variables stay context another function called moving context defining function ends thus local variables context function defined called functions languages lexical scoping nested functions local variables context nested functions since within lexical context functions lexically nested local variable enclosing function known non-local variable nested function function scope also applicable anonymous functions example snippet python code right two functions defined square sum_of_squares square computes square number sum_of_squares computes sum squares number example square 4 4 16 sum_of_squares 4 0 1 2 3 4 30 functions variable named n represents argument function two n variables completely separate unrelated despite name lexically scoped local variables function scope one scope lexically separate function thus n't overlap therefore sum_of_squares call square without n altered similarly sum_of_squares variables named total variables limited scope interfere variables named total might belong function words risk name collision identifiers unrelated identifiers even identical note also name masking occurring one variable named n context given time scopes overlap contrast similar fragment written language dynamic scope n calling function would remain context called function \u2013 scopes would overlap \u2013 would masked shadowed new n called function function scope significantly complicated functions first-class objects created locally function returned case variables nested function local unbound variables function definition resolve variables enclosing context create closure function also environment variables must returned potentially called different context requires significantly support compiler complicate program analysis scoping rule largely particular c c++ file scope scope variables functions declared top level file within function entire file \u2013 rather c declaration end source file precisely translation unit internal linking seen form module scope modules identified files modern languages replaced explicit module scope due presence include statements add variables functions internal context may call include statements difficult determine context body file c code snippet function name sum_of_squares file scope modular programming scope name entire module however may structured across various files paradigm modules basic unit complex program allow information hiding exposing limited interface module scope pioneered modula family languages python influenced modula representative contemporary example object-oriented programming languages lack direct support modules c++ similar structure instead provided class hierarchy classes basic unit program class private methods properly understood context dynamic dispatch rather name resolution scope though often play analogous roles cases facilities available python modules classes code organization module-level function conventionally private method choice programmer declaration global scope effect throughout entire program variable names global scope \u2014 called global variables \u2014 frequently considered bad practice least languages due possibility name collisions unintentional masking together poor modularity function scope block scope considered preferable however global scope typically used depending language various sorts identifiers names functions names classes data types cases mechanisms namespaces used avoid collisions use local variables \u2014 variable names limited scope exist within specific function \u2014 helps avoid risk name collision two identically named variables however two different approaches answering question mean within function lexical scoping lexical scope also called static scoping static scope variable name scope certain function scope program text function definition within text variable name exists bound variable value outside text variable name exist contrast dynamic scoping dynamic scope variable name scope certain function scope time-period function executing function running variable name exists bound value function returns variable name exist means function f invokes separately defined function g lexical scoping function g access f local variables assuming text g inside text f dynamic scoping function g access f local variables since g invoked invocation f consider example program right first line creates global variable x initializes 1 second line defines function g prints echoes current value x sets x 2 overwriting previous value third line defines function f creates local variable x hiding identically named global variable initializes 3 calls g. fourth line calls f. fifth line prints current value x exactly program print depends scoping rules language program one uses lexical scoping g prints modifies global variable x g defined outside f program prints 1 2 contrast language uses dynamic scoping g prints modifies f local variable x g called within f program prints 3 1 happens language program bash uses dynamic scoping program prints 3 1 lexical scope name always refers less local lexical environment property program text made independent runtime call stack language implementation matching requires analysis static program text type scoping also called static scoping lexical scoping standard algol-based languages pascal modula-2 ada well modern functional languages ml haskell also used c language syntactic semantic relatives although different kinds limitations static scoping allows programmer reason object references parameters variables constants types functions etc simple name substitutions makes much easier make modular code reason since local naming structure understood isolation contrast dynamic scope forces programmer anticipate possible dynamic contexts module code may invoked example consider pascal program fragment right variable codice_10 visible points never hidden another variable name codice_11 variable codice_12 visible main program hidden codice_13 variable codice_12 visible procedure codice_15 codice_16 variable codice_17 also visible procedure codice_15 codice_16 hide variable variable codice_20 visible procedure codice_16 therefore accessible either procedure codice_15 main program also procedure codice_16 visible procedure codice_15 therefore called main program could another procedure codice_16 declared program outside procedure codice_15 place program codice_16 mentioned determines two procedures named codice_16 represents thus precisely analogous scope variables correct implementation static scope languages first-class nested functions trivial requires function value carry record values variables depends pair function environment called closure depending implementation computer architecture variable lookup may become slightly inefficient deeply lexically nested functions used although well-known techniques mitigate also nested functions refer arguments immediately local variables relative locations known compile time overhead therefore incurred using type nested function applies particular parts program nested functions used naturally programs written language nested functions available c language lexical scoping used algol picked languages since deep binding approximates static lexical scoping introduced lisp 1.5 via funarg device developed steve russell working john mccarthy original lisp interpreter 1960 early lisps used dynamic scoping descendants dynamically scoped languages often adopt static scoping common lisp scheme srfi 15 dynamic static scoping perl another language dynamic scoping added static scoping afterwards languages like pascal c always lexical scoping since influenced ideas went algol 60 although c include lexically nested functions term lexical scope dates least 1967 term lexical scoping dates least 1970 used project mac describe scoping rules lisp dialect mdl known muddle dynamic scope global identifier refers identifier associated recent environment uncommon modern languages technical terms means identifier global stack bindings introducing local variable name codice_29 pushes binding onto global codice_29 stack may empty popped control flow leaves scope evaluating codice_29 context always yields top binding note done compile-time binding stack exists run-time type scoping called dynamic scoping generally certain blocks defined create bindings whose lifetime execution time block adds features static scoping dynamic scoping process however since section code called many different locations situations difficult determine outset bindings apply variable used one exists beneficial application principle least knowledge suggests code avoid depending reasons circumstances variable value simply use value according variable definition narrow interpretation shared data provide flexible system adapting behavior function current state policy system however benefit relies careful documentation variables used way well careful avoidance assumptions variable behavior provide mechanism detect interference different parts program dynamic scoping also voids benefits referential transparency dynamic scoping dangerous modern languages use languages like perl common lisp allow programmer choose static dynamic scoping defining redefining variable examples languages use dynamic scoping include logo emacs lisp latex shell languages bash dash powershell dynamic scoping fairly easy implement find identifier value program could traverse runtime stack checking activation record function stack frame value identifier practice made efficient via use association list stack name/value pairs pairs pushed onto stack whenever declarations made popped whenever variables go scope shallow binding alternative strategy considerably faster making use central reference table associates name stack meanings avoids linear search run-time find particular name care taken properly maintain table note strategies assume last-in-first-out lifo ordering bindings one variable practice bindings ordered even simpler implementation representation dynamic variables simple global variables local binding performed saving original value anonymous location stack invisible program binding scope terminates original value restored location fact dynamic scope originated manner early implementations lisp used obvious strategy implementing local variables practice survives dialects still use gnu emacs lisp lexical scope introduced lisp later equivalent shallow binding scheme except central reference table simply global variable binding environment current meaning variable global value maintaining global variables n't complex instance symbol object dedicated slot global value dynamic scoping provides excellent abstraction thread local storage used way based saving restoring global variable possible implementation strategy variable thread-local key variable accessed thread-local key used access thread-local memory location code generated compiler knows variables dynamic lexical thread-local key exist calling thread global location used variable locally bound prior value stored hidden location stack thread-local storage created variable key new value stored nested overrides variable within thread simply save restore thread-local location initial outer-most override scope terminates thread-local key deleted exposing global version variable thread modern languages macro expansion preprocessor key example de facto dynamic scope macro language transforms source code without resolving names since expansion done place names expanded text resolved notably free variables resolved based expanded loosely called dynamic scoping occurring c preprocessor used macro expansion de facto dynamic scope name resolution example macro expand add codice_8 passed variable identifier later resolved compiler based macro codice_33 called properly expanded dynamic scope independent macro defined properly c preprocessor lexical analysis expanding macro tokenization stage parsing syntax tree name resolution example following code codice_8 macro resolved expansion local variable expansion site seen one key reasons scope helps prevent name collisions allowing identical identifiers refer distinct things restriction identifiers must separate scopes sometimes restriction inconvenient many different things need accessible throughout program generally need identifiers global scope different techniques required avoid name collisions address many languages offer mechanisms organizing global identifiers details mechanisms terms used depend language general idea group identifiers given name \u2014 prefix \u2014 necessary entity referred qualified identifier consisting identifier plus prefix normally identifiers sense two sets scopes scope usually global scope qualified identifier visible one narrower scopes unqualified identifier without prefix visible well normally groups organized groups nested although many languages support concept details vary greatly languages mechanisms namespaces c++ c serve almost exclusively enable global identifiers organized groups languages mechanisms packages ada structures standard ml combine additional purpose allowing identifiers visible members group object-oriented languages often allow classes singleton objects fulfill purpose whether also mechanism primary purpose furthermore languages often meld approaches example perl packages largely similar c++ namespaces optionally double classes object-oriented programming java organizes variables functions classes organizes classes ada-like packages scoping rules representative languages follow c scope traditionally known linkage visibility particularly variables c lexically scoped language global scope known external linkage form module scope file scope known internal linkage local scope within function within function scopes nested via block scope however standard c support nested functions lifetime visibility variable determined storage class three types lifetimes c static program execution automatic block execution allocated stack manual allocated heap static automatic supported variables handled compiler manually allocated memory must tracked manually across different variables three levels visibility c external linkage global internal linkage roughly file block scope includes functions block scopes nested different levels internal linkage possible use includes internal linkage c visibility translation unit level namely source file processed c preprocessor notably including relevant includes c programs compiled separate object files linked executable library via linker thus name resolution split across compiler resolves names within translation unit loosely compilation unit properly different concept linker resolves names across translation units see linkage discussion c variables block scope enter scope declared top block move scope non-nested function called within block move back scope function returns move scope end block case automatic local variables also allocated declaration deallocated end block static local variables allocated program initialization deallocated program termination following program demonstrates variable block scope coming scope partway block exiting scope fact deallocated block ends program outputs levels scope c. variable names used function prototype function prototype visibility exit scope end function prototype since name used useful compilation may useful documentation label names goto statement function scope case label names switch statements block scope block switch variables intend use program must declared type specifier earlier point code like previous code beginning body function main declared b result type int variable either global local scope global variable variable declared main body source code outside functions local variable one declared within body function block modern versions allow nested lexical scoping go lexically scoped using blocks java lexically scoped java class contain three types variables local variables defined inside method particular block variables local defined lower levels example loop inside method use method local variables way around loop variables local loop destroyed soon loop ends member variables also called fields variables declared within class outside method default variables available methods within class also classes package parameters variables method declarations general set brackets defines particular scope variables top level within class differ behavior depending modifier keywords used definition following table shows access members permitted modifier javascript simple scoping rules variable initialization name resolution rules cause problems widespread use closures callbacks means lexical environment function defined used name resolution different lexical environment called irrelevant name resolution javascript objects name resolution properties separate topic javascript lexical scoping nested function level global scope outermost scope scoping used variables functions meaning function declarations opposed variables function type block scoping codice_35 codice_36 keywords standard since ecmascript 6 block scoping produced wrapping entire block function executing known immediately-invoked function expression iife pattern javascript scoping simple \u2013 lexical function-level \u2013 associated initialization name resolution rules cause confusion firstly assignment name scope defaults creating new global variable local one secondly create new local variable one must use codice_37 keyword variable created top function value codice_38 variable assigned value assignment expression reached known variable hoisting \u2013 declaration initialization hoisted top function thirdly accessing variables initialization yields codice_38 rather syntax error fourthly function declarations declaration initialization hoisted top function unlike variable initialization example following code produces dialog output samp undefined /samp local variable declaration hoisted shadowing global variable initialization variable undefined used functions first-class objects javascript frequently assigned callbacks returned functions function executed name resolution depends originally defined lexical environment definition lexical environment execution environment called nested scopes particular function global local javascript particularly closure used callback sometimes referred scope chain analogy prototype chain object closures produced javascript using nested functions functions first-class objects returning nested function enclosing function includes local variables enclosing function non-local lexical environment returned function yielding closure example closures frequently used javascript due used callbacks indeed hooking function local environment callback returning function creates closure unbound variables function body environment closure based nested scopes current lexical environment scope chain may accidental creating callback based parameters parameters must stored closure otherwise accidentally create closure refers variables enclosing environment may change name resolution properties javascript objects based inheritance prototype tree \u2013 path root tree called prototype chain \u2013 separate name resolution variables functions lisp dialects various rules scoping original lisp used dynamic scoping scheme inspired algol introduced static lexical scoping lisp family maclisp used dynamic scope default interpreter lexical scope default compiled code though compiled code could access dynamic bindings use codice_40 declarations particular variables however maclisp treated lexical binding optimization one would expect modern languages come closure feature one might expect lexical scoping modern lisps separate operation codice_41 available somewhat clumsily work around issue common lisp adopted lexical scoping scheme clojure islisp lexical scoping ordinary variables also dynamic variables cases explicitly marked must defined codice_42 special form bound codice_43 special form accessed explicit codice_44 special form dialects lisp like emacs lisp still use dynamic scoping default emacs lisp lexical scoping available per-buffer basis variables python function scope module scope global scope names enter scope start context function module globally exit scope non-nested function called context ends name used prior variable initialization raises runtime exception variable simply accessed assigned context name resolution follows legb rule local enclosing global built-in however variable assigned defaults creating local variable scope entire context rules overridden codice_1 codice_2 python 3 declaration prior use allows accessing global variables even intervening nonlocal variable assigning global nonlocal variables simple example function resolves variable global scope note x initialized codice_47 called error raised even though declared codice_47 declared lexically forward reference allowed python assignment creates new local variable change value global variable assignment variable within function causes declared local function hence local variable scope entire function thus using prior assignment raises error differs c local variable scope declaration entire function code raises error default name resolution rules overridden codice_1 codice_2 python 3 keywords code codice_51 declaration codice_52 means x resolves global variable thus accessed already initialized assignment assigns global variable rather declaring new local variable note codice_1 declaration needed codice_47 \u2013 since assign variable defaults resolving global variable codice_1 also used nested functions addition allowing assignment global variable unnested function also used access global variable presence nonlocal variable nested functions also codice_2 declaration assigning nonlocal variable similar using codice_1 unnested function r lexically scoped language unlike implementations values free variables determined set global variables r determined environment function created scoping environments may accessed using variety features codice_58 simulate experience dynamic scoping programmer desire block scoping functions access environment scope created variables created modified within function stay variables created modified within function stay unless assignment enclosing environment scope explicitly requested although r lexical scoping default function scopes changed", + "neighbors": [ + 65, + 117, + 152, + 194, + 216, + 249, + 306, + 308, + 313, + 332, + 378, + 446, + 509, + 536, + 565, + 567, + 594, + 597, + 649, + 653, + 682, + 690, + 712, + 753, + 756, + 790, + 799, + 820, + 825, + 873, + 919, + 934, + 940, + 947, + 998, + 1118, + 1123, + 1221, + 1227, + 1233, + 1251, + 1264, + 1277, + 1311, + 1398, + 1414, + 1418, + 1430, + 1437, + 1466, + 1477, + 1491, + 1508, + 1516, + 1588, + 1609, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1478, + "label": 1, + "text": "Australian_Plant_Name_Index:australian plant name index australian plant name index apni online database published names australian vascular plants covers names whether current names synonyms invalid names includes bibliographic typification details information australian plant census including distribution state links resources specimen collection maps plant photographs facility notes comments aspects originally brainchild nancy tyson burbidge began four-volume printed work consisting 3,055 pages containing 60,000 plant names compiled arthur chapman part australian biological resources study abrs 1991 made available online database handed australian national botanic gardens two years later responsibility maintenance given newly formed centre plant biodiversity research recognised australian herbaria authoritative source australian plant nomenclature core component australia virtual herbarium collaborative project 10 million funding aimed providing integrated online access data specimen collections australia major herbaria two query interfaces offered", + "neighbors": [ + 96, + 179, + 931, + 933 + ], + "mask": "Test" + }, + { + "node_id": 1479, + "label": 4, + "text": "Audio_injection:audio injection audio injection exploitation digital assistants amazon echo google home apple siri unwanted instructions third party services lack authentication reacting user commands making possible attackers issue activation words commands trigger execution desired actions injection results include fraud burglary data espionage takeover connected systems digital assistants require activation word trigger complete recording audio analysis spoken commands e.g ok google commands spoken natural language processed executed activation word different manufacturer often connected product \u2019 name possible product owner customize activation word meaning models react word processed language analyzed regards voice recognition authorization individual users result users audible range device authorizations trigger execute actions depending functionality actions range simple actions like music playback controlling lights security critical sensitive actions opening gates executing ordering chargeable transactions reading private information audio injection attacks performed remotely access audible area digital assistant restricted attacked increasing distance transmission either reached overcoming existent acoustic barriers e.g via vending opening momentary opened window via unusual loud playback via amplifiers loudspeakers approach possible control digital assistants rooms floors outside building digital assistants distinguish whether voice commands directly spoken reproduced loudspeaker system means attacks performed via devices support audio playback via loudspeaker radio television used run mass-attacks telephones hands-free systems digital assistants systems text-to-speech-processing misused systems accessed randomly anonymously absence owner well activated remotely critical answering machines automated monitoring function playing message aloud along could used remote precise attacks june 2014 television commercial microsoft depicted actor issuing voice command xbox causing command interpreted xbox systems room television showing commercial december 2016 adam jakowenko showed one virtual assistant could activate another one using tts-processing january 2017 television news coverage child ordering dollhouse amazon alexa interface included news anchor jim patton quoting child quotation triggered orders dollhouses viewers coverage alexa devices running", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1480, + "label": 5, + "text": "Google_Earth:google earth google earth computer program renders 3d representation earth based primarily satellite imagery program maps earth superimposing satellite images aerial photography gis data onto 3d globe allowing users see cities landscapes various angles users explore globe entering addresses coordinates using keyboard mouse program also downloaded smartphone tablet using touch screen stylus navigate users may use program add data using keyhole markup language upload various sources forums blogs google earth able show various kinds images overlaid surface earth also web map service client addition earth navigation google earth provides series tools desktop application additional globes moon mars available well tool viewing night sky flight simulator game also included features allow users view photos various places uploaded panoramio information provided wikipedia locations street view imagery web-based version google earth also includes voyager feature periodically adds in-program tours often presented scientists documentarians google earth viewed threat privacy national security leading program banned multiple countries countries requested certain areas obscured google satellite images usually areas containing military facilities core technology behind google earth originally developed intrinsic graphics late 1990s time company developing 3d gaming software libraries demo 3d software created spinning globe could zoomed similar powers ten film demo popular board intrinsic wanted remain focused gaming 1999 created keyhole inc. headed john hanke keyhole developed way stream large databases mapping data internet client software key part technology acquired patchworks mapping data governments sources product called keyhole earthviewer sold cds use fields real estate urban planning defense intelligence users paid yearly fee service despite making number capital deals nvidia sony small company struggling make payroll employees leaving fortunes company changed early 2003 cnn received discount software exchange placing keyhole logo on-air whenever map used keyhole expect would amount brief 5 10 second prerecorded animation clips used extensively miles o'brien live 2003 invasion iraq allowing cnn millions viewers follow progress war way never seen public interest software exploded keyhole servers able keep demand keyhole soon contacted central intelligence agency venture capital firm in-q-tel national geospatial-intelligence agency use defense mapping databases gave keyhole much-needed cash infusion intrinsic graphics sold 2003 vicarious visions gaming libraries sell well core group engineers management transitioned keyhole hanke remaining head time google finding 25 searches geospatial character including searches maps directions october 2004 google acquired keyhole part strategy better serve users google earth imagery displayed digital globe displays planet surface using single composited image far distance zooming far enough imagery transitions different imagery area finer detail varies date time one area next imagery retrieved satellites aircraft launch nasa usgs landsat 8 satellite google relied partially imagery landsat 7 suffered hardware malfunction left diagonal gaps images 2013 google used datamining remedy issue providing described successor blue marble image earth single large image entire planet achieved combining multiple sets imagery taken landsat 7 eliminate clouds diagonal gaps creating single mosaic image google uses landsat 8 provide imagery higher quality greater frequency imagery hosted google servers contacted application opened requiring internet connection imagery resolution ranges 15 meters resolution 15 centimeters much earth google earth uses digital elevation model data collected nasa shuttle radar topography mission creates impression three-dimensional terrain even imagery two-dimensional every image created google earth using satellite data provided google earth copyrighted map derivative google earth made copyrighted data united states copyright law may used except licenses google provides google allows non-commercial personal use images e.g personal website blog long copyrights attributions preserved contrast images created nasa globe software world wind use blue marble landsat usgs imagery public domain version 5.0 google introduced historical imagery allowing users view earlier imagery clicking clock icon toolbar opens time slider marks time available imagery past feature allows observation area changes time utilizing timelapse feature allows ability view zoomable video far back 32 years google earth shows 3d building models cities including photorealistic 3d imagery first 3d buildings google earth created using 3d modeling applications sketchup beginning 2009 building maker uploaded google earth via 3d warehouse june 2012 google announced would replacing user-generated 3d buildings auto-generated 3d mesh would phased starting select larger cities notable exception cities london toronto required time process detailed imagery vast number buildings reason given greater uniformity 3d buildings compete nokia apple maps already using technology coverage began year 21 cities four countries early 2016 3d imagery expanded hundreds cities 40 countries including every u.s. state encompassing every continent except antarctica 2009 collaboration google museo del prado madrid museum selected 14 paintings photographed displayed resolution 14,000 megapixels inside 3d version prado google earth google maps april 15 2008 version 4.3 google fully integrated street view google earth street view displays 360\u00b0 panoramic street-level photos select cities surroundings photos taken cameras mounted automobiles viewed different scales many angles navigable arrow icons imposed introduced google earth 5.0 2009 google ocean feature allows users zoom surface ocean view 3d bathymetry supporting 20 content layers contains information leading scientists oceanographers april 14 2009 google added bathymetric data great lakes june 2011 google increased resolution deep ocean floor areas 1-kilometer grids 100 meters high-resolution features developed oceanographers columbia university lamont-doherty earth observatory scientific data collected research cruises sharper focus available 5 percent oceans seen hudson new york city wini seamount near hawaii mendocino ridge u.s pacific coast google programs features including within google earth allowing exploration mars moon view sky earth outer space including surfaces various objects solar system google sky feature introduced google earth 4.2 august 22 2007 browser-based application march 13 2008 android smartphones augmented reality features google sky allows users view stars celestial bodies produced google partnership space telescope science institute stsci baltimore science operations center hubble space telescope dr. alberto conti co-developer dr. carol christian stsci plan add public images 2007 well color images archived data hubble advanced camera surveys newly released hubble pictures added google sky program soon issued new features multi-wavelength data positions major satellites orbits well educational resources provided google earth community also christian conti website sky also visible sky mode constellations stars galaxies animations depicting planets orbits real-time google sky mashup recent astronomical transients using voevent protocol provided voeventnet collaboration programs similar google sky include microsoft worldwide telescope stellarium google mars application within google earth version program imagery planet mars google also operates browser-based version although maps much higher resolution within google earth include 3d terrain well infrared imagery elevation data also extremely-high-resolution images mars reconnaissance orbiter hirise camera similar resolution cities earth finally many high-resolution panoramic images various mars landers mars exploration rovers spirit opportunity viewed similar way google street view mars also small application found near face mars called meliza robot character user speak originally browser application google moon feature allows exploration moon google brought feature google earth 40th anniversary apollo 11 mission july 20 2009 announced demonstrated group invited guests google along buzz aldrin newseum washington d.c. google moon includes several tours including one apollo missions incorporating maps videos street view-style panoramas provided nasa google earth numerous features allow user learn specific places called layers include different forms media including photo video layers include tours guide user specific places set order layers created using keyhole markup language kml users also use create customized layers locations marked placemarks organized folders example user use placemarks list interesting landmarks around globe provide description photos videos viewed clicking placemarks viewing new layer application december 2006 google earth added new integration wikipedia panoramio wikipedia layer entries scraped coordinates via also community-layer project coordinates used different types display different languages supported built-in wikipedia layer panoramio layer features pictures uploaded panoramio users placed google earth based user-provided location data addition flat images google earth also includes layer user-submitted panoramic photos navigable similar way street view google earth includes multiple features allow user monitor current events 2007 google began offering users ability monitor traffic data provided google traffic real time based information crowdsourced gps-identified locations cell phone users google earth 4.2 flight simulator added application originally hidden feature introduced 2007 starting 4.3 given labeled option menu addition keyboard control simulator controlled mouse joystick simulator also runs animation allowing objects planes animate simulator another flight simulator geofs created name gefs-online using google earth plug-in api operate within web browser september 1 2015 program uses open-source program cesiumjs due google earth plug-in discontinued liquid galaxy cluster computers running google earth creating immersive experience september 30 2010 google made configuration schematics rigs public placing code setup guides liquid galaxy wiki liquid galaxy also used panoramic photo viewer using krpano well google street view viewer using peruse-a-rue peruse-a-rue method synchronizing multiple maps api clients google earth released macos linux ios android linux version began version 4 beta google earth native port using qt toolkit free software foundation consider development free compatible client google earth high priority free software project google earth released android february 22 2010 ios october 27 2008 mobile versions google earth make use multi-touch interfaces move globe zoom rotate view allow select current location automotive version google earth made available 2010 audi a8 google earth pro originally business-oriented upgrade google earth features movie maker data importer late january 2015 available 399/year though google decided make free public google earth pro currently standard version google earth desktop application version 7.3 pro version includes add-on software movie making advanced printing precise measurements currently available windows mac os x 10.8 later linux discontinued december 2008 google earth plus paid subscription upgrade google earth provided customers following features become available free google earth one feature gps integration allowed users read tracks waypoints gps device variety third-party applications created provide functionality using basic version google earth generating kml kmz files based user-specified user-recorded waypoints google earth enterprise designed use organizations whose businesses could take advantage program capabilities example globe holds company data available anyone company march 20 2015 google retired google earth enterprise product support ended march 22 2017 google earth enterprise allowed developers create maps 3d globes private use host platform gee fusion gee server gee portable server source code published github apache2 license march 2017 google earth 9 version google earth first released april 18 2017 development two years main feature version launching new web version google earth currently available google chrome version added voyager feature whereby users view portal page containing guided tours led scientists documentarians version also added 'm feeling lucky button represented die takes user random location earth along showing knowledge card containing short excerpt location wikipedia article google earth api free beta service allowing users place version google earth web pages api enabled sophisticated 3d map applications built unveiling google 2008 i/o developer conference company showcased potential applications game player controlled milktruck atop google earth surface google earth api deprecated december 15 2014 remained supported december 15 2015 google chrome ended support netscape plugin api google earth api relies end 2016 november 16 2016 google released virtual reality version google earth valve steam computer gaming platform google earth vr allows users navigate using vr controllers currently compatible oculus rift htc vive virtual reality headsets september 14 2017 part google earth vr 1.4 update google added street view support google earth outreach charity program google promotes donates various non-profit organizations beginning 2007 donations often accompanied layers featured google earth allowing users view non-profit projects goals navigating certain related locations google earth outreach offers online training using google earth google maps public education issues affecting local regions entire globe june 2008 training given 20 indigenous tribes amazon rainforest suru\u00ed help preserve culture raise awareness problem deforestation non-profit organizations featured google earth via outreach program include arkive global heritage fund wateraid world wide fund nature google earth engine cloud computing platform processing satellite imagery geospatial observation data provides access large database satellite imagery computational power needed analyze images google earth engine allows observation dynamic changes agriculture natural resources climate using geospatial data landsat satellite program passes places earth every sixteen days google earth engine become platform makes landsat sentinel-2 data easily accessible researchers collaboration google cloud storage google earth engine provides data catalog along computers analysis allows scientists collaborate using data algorithms visualizations platform uses python javascript application programming interfaces making requests servers google earth engine used multiple times tool tracking deforestation initial applications engine included mapping forests mexico identifying water congo basin detecting deforestation amazon rainforest using google earth engine track global forest loss gain university maryland reported overall loss global forest cover carnegie institute science claslite system imazon \u2019 sisteme de alerta de deforesation sad two institutions partnered google development google earth engine organizations use program build maps forests measure environmental disturbances additionally google earth engine expanded applications range tiger habitat monitoring malaria risk mapping global surface water software criticized number special interest groups including national officials invasion privacy posing threat national security typical argument software provides information military critical installations could used terrorists google earth blocked google iran sudan since 2007 due united states government export restrictions program also blocked morocco since 2006 maroc telecom major service provider country academic realm increasing attention devoted google earth place development digital globes particular international journal digital earth features multiple articles evaluating comparing development google earth differences compared professional scientific governmental platforms google earth role expansion earth observing media examined role shaping shared cultural consciousness regarding climate change humanity capacity treat earth engineerable object", + "neighbors": [ + 24, + 41, + 113, + 131, + 134, + 162, + 176, + 182, + 216, + 298, + 306, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 611, + 671, + 704, + 775, + 777, + 782, + 837, + 936, + 962, + 1061, + 1082, + 1121, + 1129, + 1138, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1411, + 1419, + 1480, + 1483, + 1500, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1481, + "label": 9, + "text": "JavaServer_Faces:javaserver faces javaserver faces jsf java specification building component-based user interfaces web applications formalized standard java community process part java platform enterprise edition also mvc web framework simplifies construction user interfaces ui server-based applications using reusable ui components page jsf 2 uses facelets default templating system view technologies xul plain java also employed contrast jsf 1.x uses javaserver pages jsp default templating system 2001 original java specification request jsr technology ultimately became javaserver faces proposed developing package name codice_1 june 2001 javaworld would report amy fowler team design javaserver faces api aka moonwalk \u2013 application framework creating web-based user interfaces based component-driven ui design-model javaserver faces uses xml files called view templates facelets views codice_2 processes requests loads appropriate view template builds component tree processes events renders response typically html language client state ui components objects scope interest saved end request process called statesaving note transient true restored upon next creation view either client server side save objects states jsf often used together ajax rich internet application development technique ajax combination web development techniques technologies make possible create rich user interfaces user interface components mojarra jsf reference implementation apache myfaces originally developed html ajax added via javascript changed however jsf supports multiple output formats ajax-enabled components easily added enrich jsf-based user interfaces jsf 2.0 specification provides built-in support ajax standardizing ajax request lifecycle providing simple development interfaces ajax events allowing event triggered client go proper validation conversion finally method invocation returning result browser via xml dom update jsf 2 includes support graceful degradation javascript disabled browser following companies projects offer ajax-based jsf frameworks component libraries facelets designed specifically javaserver faces adopted official view technology jsf 2.0 eliminates life-cycle conflicts existed jsp forcing workarounds java developers facelets allows easy component/tag creation using xml markup instead java code chief complaint jsf 1.x new jsf developments also provide wide accessibility java 5 annotations codice_3 codice_4 codice_5 removes need codice_6 cases except framework extension navigation simplified removing need codice_6 navigation cases page transitions invoked simply passing name desired view/facelet addition partial state saving dom updates part built-in standardized ajax support latest jsf release built-in support handling resources like images css javascript allowing artifacts included component libraries separated jar files simply co-located consistent place within web application includes logical naming versioning resources jsf 2.0 also includes number changes like adding support events separate development staging production modes similar codice_8 ruby rails significantly expanding standard set components january 2014 technology radar publication thoughtworks wrote article published november 2014 dzone website titled avoid jsf jens schauder wrote february 2014 \u00e7a\u011fatay \u00e7ivici primefaces lead responded thoughtworks criticisms post titled jsf \u2019 told anymore \u00e7ivici argues improvements jsf years offer many features embrace modern web development providing option write javascript html css also regarding state \u00e7a\u011fatay wrote", + "neighbors": [ + 7, + 117, + 168, + 201, + 308, + 509, + 520, + 538, + 567, + 593, + 682, + 712, + 786, + 869, + 916, + 1091, + 1225, + 1227, + 1235, + 1242, + 1269, + 1311, + 1416, + 1481, + 1508 + ], + "mask": "Test" + }, + { + "node_id": 1482, + "label": 3, + "text": "Xak:_The_Tower_of_Gazzel:xak tower gazzel xak precious package tower gazzel fantasy role-playing video game developed published japanese software developer microcabin game direct sequel technically third installment series tower gazzel sidestory taking place events game released japan latok kart defeated zamu gospel events portrayed xak ii friends intrigued rumours demonic tower man looking like latok roaming neighbourhood appearance false latok kidnapping rune greed family ploys lure two descendants duel tower laid villains al acrila gill berzes demon called zegraya using latok rune plan resurrect ancient demon gazzel demon unimaginable power comparable destroying entire mountain single attack player controls latok looking onto game world bird's-eye view latok swing sword optionally firing magical shots tip expense magic points jump short distances player choose take along one party four characters exploration tower so-called 'support members subtly change latok statistics addition triggering different events within game entirety tower large labyrinth spanning six floors elemental theme darkness basement respectively earth fire water wind heaven first fifth floors game one large puzzle goal reaching bottom floor defeating zegraya gazzel many puzzles revolve around fact floors heavily interconnected floor fire example large wall flames latok pass way water floor large door opened pours large amount water hole floor dousing flames another part puzzles involves choice support member take along support members n't affect latok combat statistics points game passed right support member tagging along even items game latok use right supportmember example latok finds magical scroll lightning spell inscribed n't master enough magic cast certain part first floor seemingly impassable wall rubble fray selected support member snatch lightning scroll latok use blast path rubble game saved fixed point entrance tower prevent player backtrack save game various items found teleport latok support member back entrance fixed point inside tower contrary predecessors tower gazzel use experience point system currency kind appear game latok starts game level 50 end xak ii advance instead occurs xak iii new equipment also unavailable latok sticks sword armor shield xak ii end throughout game eliminates need player spend large amounts time 'leveling collecting enough experience points and/or gold player character grow strong enough buy new equipment respectively way game emphasis puzzle aspect combat kind advancement system retained latok find different pairs gauntlets tower pair enhancing combat statistics game engine almost identical xak ii preserving real-time combat aspect music graphics even recycled previous installment compared xak ii xak gazzel runs much smoother even regular msx2 prompting much less shorter loading times possible supportmembers abilities follows addition single save point game represented healer fell bow except villains game uses little non-player characters emphasising puzzling aspect even", + "neighbors": [ + 855 + ], + "mask": "Test" + }, + { + "node_id": 1483, + "label": 2, + "text": "Dalvik_(software):dalvik software dalvik discontinued process virtual machine vm google android operating system executes applications written android dalvik bytecode format still used distribution format longer runtime newer android versions dalvik integral part android software stack unsupported android versions 4.4 kitkat earlier commonly used mobile devices mobile phones tablet computers devices smart tvs wearables dalvik open-source software originally written dan bornstein named fishing village dalv\u00edk eyjafj\u00f6r\u00f0ur iceland programs android commonly written java compiled bytecode java virtual machine translated dalvik bytecode stored .dex dalvik executable .odex optimized dalvik executable files related terms odex de-odex associated respective bytecode conversions compact dalvik executable format designed systems constrained terms memory processor speed successor dalvik android runtime art uses bytecode .dex files .odex files succession aiming performance improvements transparent end users new runtime environment included first time android 4.4 kitkat technology preview replaced dalvik entirely later versions android 5.0 lollipop first version art included runtime unlike java vms stack machines dalvik vm uses register-based architecture requires fewer typically complex virtual machine instructions dalvik programs written java using android application programming interface api compiled java bytecode converted dalvik instructions necessary tool called dx used convert java .class files .dex format multiple classes included single .dex file duplicate strings constants used multiple class files included .dex output conserve space java bytecode also converted alternative instruction set used dalvik vm uncompressed .dex file typically percent smaller size compressed java archive jar derived .class files dalvik executables may modified installed onto mobile device order gain optimizations byte order may swapped certain data simple data structures function libraries may linked inline empty class objects may short-circuited example optimized low memory requirements dalvik specific characteristics differentiate standard vms according google design dalvik permits device run multiple instances vm efficiently android 2.2 froyo brought trace-based just-in-time jit compilation dalvik optimizing execution applications continually profiling applications time run dynamically compiling frequently executed short segments bytecode native machine code dalvik interprets rest application bytecode native execution short bytecode segments called traces provides significant performance improvements relative merits stack machines versus register-based approaches subject ongoing debate generally stack-based machines must use instructions load data stack manipulate data thus require instructions register machines implement high-level code instructions register machine must encode source destination registers therefore tend larger difference importance vm interpreters opcode dispatch tends expensive along factors similarly relevant just-in-time compilation tests performed armv7 devices 2010 oracle owner java technology standard non-graphical java benchmarks showed hotspot vm java se embedded 2\u20133 times faster jit-based dalvik vm android 2.2 initial android release included jit compiler 2012 academic benchmarks confirmed factor 3 hotspot dalvik android board also noting dalvik code smaller hotspot furthermore benchmarks performed android device still show factor 100 native applications dalvik application android device upon running benchmarks using early interpreter 2009 java native interface jni native code showed order magnitude speedup dalvik published terms apache license 2.0 say dalvik clean-room implementation rather development top standard java runtime would mean inherit copyright-based license restrictions either standard-edition open-source-edition java runtimes oracle reviewers dispute august 12 2010 oracle acquired sun microsystems april 2009 therefore owns rights java sued google claimed infringement copyrights patents oracle alleged google developing android knowingly directly repeatedly infringed oracle java-related intellectual property may 2012 jury case found google infringe oracle patents trial judge ruled structure java apis used google copyrightable parties agreed zero dollars statutory damages 9 lines copied code", + "neighbors": [ + 24, + 41, + 53, + 113, + 131, + 162, + 270, + 298, + 306, + 378, + 412, + 422, + 429, + 502, + 538, + 682, + 704, + 775, + 782, + 805, + 837, + 940, + 948, + 1019, + 1044, + 1053, + 1061, + 1082, + 1087, + 1138, + 1183, + 1185, + 1208, + 1231, + 1276, + 1310, + 1319, + 1346, + 1363, + 1372, + 1384, + 1411, + 1419, + 1480, + 1500, + 1569, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1484, + "label": 7, + "text": "Oracle_Fusion_Middleware:oracle fusion middleware oracle fusion middleware fmw also known fusion middleware consists several software products oracle corporation fmw spans multiple services including java ee developer tools integration services business intelligence collaboration content management fmw depends open standards bpel soap xml jms oracle fusion middleware provides software development deployment management service-oriented architecture soa includes oracle calls hot-pluggable architecture designed facilitate integration existing applications systems software vendors ibm microsoft sap ag many products included fmw banner qualify middleware products fusion middleware essentially represents re-branding many oracle products outside oracle core database applications-software offerings\u2014compare oracle fusion oracle acquired many fmw products via acquisitions includes products bea systems stellent order provide standards-based software assist business process automation hp incorporated fmw service-oriented architecture soa portfolio oracle leveraged configurable network computing cnc technology acquired peoplesoft/jd edwards 2005 purchase oracle fusion applications based oracle fusion middleware finally released september 2010 according oracle 2013 120,000 customers using fusion middleware includes 35 world 50 largest companies 750 businessweek global 1000 fmw also supported 7,500 partners january 2008 oracle webcenter content formerly universal content management infoworld technology year award best enterprise content manager oracle soa suite winning award best enterprise service bus 2007 gartner wrote oracle fusion middleware reached degree completeness puts par cases ahead competing software stacks reported revenue suite us 1 billion fy06 estimating revenue genuinely middleware aspects us 740 million", + "neighbors": [ + 204, + 210, + 250, + 266, + 429, + 517, + 755, + 1159, + 1288, + 1416, + 1470 + ], + "mask": "Train" + }, + { + "node_id": 1485, + "label": 3, + "text": "Acrojet:acrojet acrojet 1985 flight simulator video game microprose originally developed commodore 64 c64 ported amstrad cpc msx zx spectrum nec pc-8801 nec pc-9801 emphasized aerial acrobatic flying maneuverability player flies bd5j small agile jet player complete series eight stunt courses routines jet example one set player fly plane around series pylons another player must fly figure eight stunts get harder play progresses game parameters weather configurable ten acrobatic events played four players four levels difficulty ten events player must fly series obstacles compute called acrojet realistic simulation also fun play stating game like microprose products emphasized accurate details controls original c64 version programmed william mike denman edward hill jr sound music done sid meier also researched science along denman stunts bill stealey actually retired united states air force lt colonel command pilot michael haire credited artwork", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1486, + "label": 0, + "text": "Speech_recognition:speech recognition speech recognition interdisciplinary subfield computational linguistics develops methodologies technologies enables recognition translation spoken language text computers also known automatic speech recognition asr computer speech recognition speech text stt incorporates knowledge research linguistics computer science electrical engineering fields speech recognition systems require training also called enrollment individual speaker reads text isolated vocabulary system system analyzes person specific voice uses fine-tune recognition person speech resulting increased accuracy systems use training called speaker independent systems systems use training called speaker dependent speech recognition applications include voice user interfaces voice dialing e.g call home call routing e.g would like make collect call domotic appliance control search e.g find podcast particular words spoken simple data entry e.g. entering credit card number preparation structured documents e.g radiology report determining speaker characteristics speech-to-text processing e.g. word processors emails aircraft usually termed direct voice input term voice recognition speaker identification refers identifying speaker rather saying recognizing speaker simplify task translating speech systems trained specific person voice used authenticate verify identity speaker part security process technology perspective speech recognition long history several waves major innovations recently field benefited advances deep learning big data advances evidenced surge academic papers published field importantly worldwide industry adoption variety deep learning methods designing deploying speech recognition systems key areas growth vocabulary size speaker independence processing speed raj reddy first person take continuous speech recognition graduate student stanford university late 1960s previous systems required users pause word reddy system issued spoken commands playing game chess around time soviet researchers invented dynamic time warping dtw algorithm used create recognizer capable operating 200-word vocabulary dtw processed speech dividing short frames e.g 10ms segments processing frame single unit although dtw would superseded later algorithms technique carried achieving speaker independence remained unsolved time period late 1960s leonard baum developed mathematics markov chains institute defense analysis decade later cmu raj reddy students james baker janet m. baker began using hidden markov model hmm speech recognition james baker learned hmms summer job institute defense analysis undergraduate education use hmms allowed researchers combine different sources knowledge acoustics language syntax unified probabilistic model 1980s also saw introduction n-gram language model much progress field owed rapidly increasing capabilities computers end darpa program 1976 best computer available researchers pdp-10 4 mb ram could take 100 minutes decode 30 seconds speech two practical products point vocabulary typical commercial speech recognition system larger average human vocabulary raj reddy former student xuedong huang developed sphinx-ii system cmu sphinx-ii system first speaker-independent large vocabulary continuous speech recognition best performance darpa 1992 evaluation handling continuous speech large vocabulary major milestone history speech recognition huang went found speech recognition group microsoft 1993 raj reddy student kai-fu lee joined apple 1992 helped develop speech interface prototype apple computer known casper lernout hauspie belgium-based speech recognition company acquired several companies including kurzweil applied intelligence 1997 dragon systems 2000 l h speech technology used windows xp operating system l h industry leader accounting scandal brought end company 2001 speech technology l h bought scansoft became nuance 2005 apple originally licensed software nuance provide speech recognition capability digital assistant siri 2000s darpa sponsored two speech recognition programs effective affordable reusable speech-to-text ears 2002 global autonomous language exploitation gale four teams participated ears program ibm team led bbn limsi univ pittsburgh cambridge university team composed icsi sri university washington ears funded collection switchboard telephone speech corpus containing 260 hours recorded conversations 500 speakers gale program focused arabic mandarin broadcast news speech google first effort speech recognition came 2007 hiring researchers nuance first product goog-411 telephone based directory service recordings goog-411 produced valuable data helped google improve recognition systems google voice search supported 30 languages united states national security agency made use type speech recognition keyword spotting since least 2006 technology allows analysts search large volumes recorded conversations isolate mentions keywords recordings indexed analysts run queries database find conversations interest government research programs focused intelligence applications speech recognition e.g darpa ears program iarpa babel program early 2000s speech recognition still dominated traditional approaches hidden markov models combined feedforward artificial neural networks today however many aspects speech recognition taken deep learning method called long short-term memory lstm recurrent neural network published sepp hochreiter j\u00fcrgen schmidhuber 1997 lstm rnns avoid vanishing gradient problem learn deep learning tasks require memories events happened thousands discrete time steps ago important speech around 2007 lstm trained connectionist temporal classification ctc started outperform traditional speech recognition certain applications 2015 google speech recognition reportedly experienced dramatic performance jump 49 ctc-trained lstm available google voice smartphone users use deep feedforward non-recurrent networks acoustic modeling introduced later part 2009 geoffrey hinton students university toronto li deng colleagues microsoft research initially collaborative work microsoft university toronto subsequently expanded include ibm google hence shared views four research groups subtitle 2012 review paper microsoft research executive called innovation dramatic change accuracy since 1979 contrast steady incremental improvements past decades application deep learning decreased word error rate 30 innovation quickly adopted across field researchers begun use deep learning techniques language modeling well long history speech recognition shallow form deep form e.g recurrent nets artificial neural networks explored many years 1980s 1990s years 2000s methods never non-uniform internal-handcrafting gaussian mixture model/hidden markov model gmm-hmm technology based generative models speech trained discriminatively number key difficulties methodologically analyzed 1990s including gradient diminishing weak temporal correlation structure neural predictive models difficulties addition lack big training data big computing power early days speech recognition researchers understood barriers hence subsequently moved away neural nets pursue generative modeling approaches recent resurgence deep learning starting around 2009\u20132010 overcome difficulties hinton et al deng et al reviewed part recent history collaboration colleagues across four groups university toronto microsoft google ibm ignited renaissance applications deep feedforward neural networks speech recognition early 2010s speech recognition also called voice recognition clearly differentiated speaker recognition speaker independence considered major breakthrough systems required training period 1987 ad doll carried tagline finally doll understands \u2013 despite fact described children could train respond voice 2017 microsoft researchers reached historical human parity milestone transcribing conversational telephony speech widely benchmarked switchboard task multiple deep learning models used optimize speech recognition accuracy speech recognition word error rate reported low 4 professional human transcribers working together benchmark funded ibm watson speech team task acoustic modeling language modeling important parts modern statistically-based speech recognition algorithms hidden markov models hmms widely used many systems language modeling also used many natural language processing applications document classification statistical machine translation modern general-purpose speech recognition systems based hidden markov models statistical models output sequence symbols quantities hmms used speech recognition speech signal viewed piecewise stationary signal short-time stationary signal short time-scale e.g. 10 milliseconds speech approximated stationary process speech thought markov model many stochastic purposes another reason hmms popular trained automatically simple computationally feasible use speech recognition hidden markov model would output sequence n -dimensional real-valued vectors n small integer 10 outputting one every 10 milliseconds vectors would consist cepstral coefficients obtained taking fourier transform short time window speech decorrelating spectrum using cosine transform taking first significant coefficients hidden markov model tend state statistical distribution mixture diagonal covariance gaussians give likelihood observed vector word general speech recognition systems phoneme different output distribution hidden markov model sequence words phonemes made concatenating individual trained hidden markov models separate words phonemes described core elements common hmm-based approach speech recognition modern speech recognition systems use various combinations number standard techniques order improve results basic approach described typical large-vocabulary system would need context dependency phonemes phonemes different left right context different realizations hmm states would use cepstral normalization normalize different speaker recording conditions speaker normalization might use vocal tract length normalization vtln male-female normalization maximum likelihood linear regression mllr general speaker adaptation features would so-called delta delta-delta coefficients capture speech dynamics addition might use heteroscedastic linear discriminant analysis hlda might skip delta delta-delta coefficients use splicing lda-based projection followed perhaps heteroscedastic linear discriminant analysis global semi-tied co variance transform also known maximum likelihood linear transform mllt many systems use so-called discriminative training techniques dispense purely statistical approach hmm parameter estimation instead optimize classification-related measure training data examples maximum mutual information mmi minimum classification error mce minimum phone error mpe decoding speech term happens system presented new utterance must compute likely source sentence would probably use viterbi algorithm find best path choice dynamically creating combination hidden markov model includes acoustic language model information combining statically beforehand finite state transducer fst approach possible improvement decoding keep set good candidates instead keeping best candidate use better scoring function scoring rate good candidates may pick best one according refined score set candidates kept either list n-best list approach subset models lattice scoring usually done trying minimize bayes risk approximation thereof instead taking source sentence maximal probability try take sentence minimizes expectancy given loss function regards possible transcriptions i.e. take sentence minimizes average distance possible sentences weighted estimated probability loss function usually levenshtein distance though different distances specific tasks set possible transcriptions course pruned maintain tractability efficient algorithms devised score lattices represented weighted finite state transducers edit distances represented finite state transducer verifying certain assumptions dynamic time warping approach historically used speech recognition largely displaced successful hmm-based approach dynamic time warping algorithm measuring similarity two sequences may vary time speed instance similarities walking patterns would detected even one video person walking slowly another walking quickly even accelerations deceleration course one observation dtw applied video audio graphics \u2013 indeed data turned linear representation analyzed dtw well-known application automatic speech recognition cope different speaking speeds general method allows computer find optimal match two given sequences e.g. time series certain restrictions sequences warped non-linearly match sequence alignment method often used context hidden markov models neural networks emerged attractive acoustic modeling approach asr late 1980s since neural networks used many aspects speech recognition phoneme classification isolated word recognition audiovisual speech recognition audiovisual speaker recognition speaker adaptation neural networks make fewer explicit assumptions feature statistical properties hmms several qualities making attractive recognition models speech recognition used estimate probabilities speech feature segment neural networks allow discriminative training natural efficient manner however spite effectiveness classifying short-time units individual phonemes isolated words early neural networks rarely successful continuous recognition tasks limited ability model temporal dependencies one approach limitation use neural networks pre-processing feature transformation dimensionality reduction step prior hmm based recognition however recently lstm related recurrent neural networks rnns time delay neural networks tdnn demonstrated improved performance area deep neural networks denoising autoencoders also investigation deep feedforward neural network dnn artificial neural network multiple hidden layers units input output layers similar shallow neural networks dnns model complex non-linear relationships dnn architectures generate compositional models extra layers enable composition features lower layers giving huge learning capacity thus potential modeling complex patterns speech data success dnns large vocabulary speech recognition occurred 2010 industrial researchers collaboration academic researchers large output layers dnn based context dependent hmm states constructed decision trees adopted recent overview articles one fundamental principle deep learning away hand-crafted feature engineering use raw features principle first explored successfully architecture deep autoencoder raw spectrogram linear filter-bank features showing superiority mel-cepstral features contain stages fixed transformation spectrograms true raw features speech waveforms recently shown produce excellent larger-scale speech recognition results since 2014 much research interest end-to-end asr traditional phonetic-based i.e. hmm-based model approaches required separate components training pronunciation acoustic language model end-to-end models jointly learn components speech recognizer valuable since simplifies training process deployment process example n-gram language model required hmm-based systems typical n-gram language model often takes several gigabytes memory making impractical deploy mobile devices consequently modern commercial asr systems google apple 2017 deployed cloud require network connection opposed device locally first attempt end-to-end asr connectionist temporal classification ctc -based systems introduced alex graves google deepmind navdeep jaitly university toronto 2014 model consisted recurrent neural networks ctc layer jointly rnn-ctc model learns pronunciation acoustic model together however incapable learning language due conditional independence assumptions similar hmm consequently ctc models directly learn map speech acoustics english characters models make many common spelling mistakes must rely separate language model clean transcripts later baidu expanded work extremely large datasets demonstrated commercial success chinese mandarin english 2016 university oxford presented lipnet first end-to-end sentence-level lip reading model using spatiotemporal convolutions coupled rnn-ctc architecture surpassing human-level performance restricted grammar dataset large-scale cnn-rnn-ctc architecture presented 2018 google deepmind achieving 6 times better performance human experts alternative approach ctc-based models attention-based models attention-based asr models introduced simultaneously chan et al carnegie mellon university google brain bahdanau et al university montreal 2016 model named listen attend spell las literally listens acoustic signal pays attention different parts signal spells transcript one character time unlike ctc-based models attention-based models conditional-independence assumptions learn components speech recognizer including pronunciation acoustic language model directly means deployment need carry around language model making practical deployment onto applications limited memory end 2016 attention-based models seen considerable success including outperforming ctc models without external language model various extensions proposed since original las model latent sequence decompositions lsd proposed carnegie mellon university mit google brain directly emit sub-word units natural english characters university oxford google deepmind extended las watch listen attend spell wlas handle lip reading surpassing human-level performance typically manual control input example means finger control steering-wheel enables speech recognition system signalled driver audio prompt following audio prompt system listening window may accept speech input recognition simple voice commands may used initiate phone calls select radio stations play music compatible smartphone mp3 player music-loaded flash drive voice recognition capabilities vary car make model recent car models offer natural-language speech recognition place fixed set commands allowing driver use full sentences common phrases systems therefore need user memorize set fixed command words health care sector speech recognition implemented front-end back-end medical documentation process front-end speech recognition provider dictates speech-recognition engine recognized words displayed spoken dictator responsible editing signing document back-end deferred speech recognition provider dictates digital dictation system voice routed speech-recognition machine recognized draft document routed along original voice file editor draft edited report finalized deferred speech recognition widely used industry currently one major issues relating use speech recognition healthcare american recovery reinvestment act 2009 arra provides substantial financial benefits physicians utilize emr according meaningful use standards standards require substantial amount data maintained emr commonly referred electronic health record ehr use speech recognition naturally suited generation narrative text part radiology/pathology interpretation progress note discharge summary ergonomic gains using speech recognition enter structured discrete data e.g. numeric values codes list controlled vocabulary relatively minimal people sighted operate keyboard mouse significant issue ehrs expressly tailored take advantage voice-recognition capabilities large part clinician interaction ehr involves navigation user interface using menus tab/button clicks heavily dependent keyboard mouse voice-based navigation provides modest ergonomic benefits contrast many highly customized systems radiology pathology dictation implement voice macros use certain phrases \u2013 e.g. normal report automatically fill large number default values and/or generate boilerplate vary type exam \u2013 e.g. chest x-ray vs. gastrointestinal contrast series radiology system alternative navigation hand cascaded use speech recognition information extraction studied way fill handover form clinical proofing sign-off results encouraging paper also opens data together related performance benchmarks processing software research development community studying clinical documentation language-processing prolonged use speech recognition software conjunction word processors shown benefits short-term-memory restrengthening brain avm patients treated resection research needs conducted determine cognitive benefits individuals whose avms treated using radiologic techniques substantial efforts devoted last decade test evaluation speech recognition fighter aircraft particular note us program speech recognition advanced fighter technology integration afti /f-16 aircraft f-16 vista program france mirage aircraft programs uk dealing variety aircraft platforms programs speech recognizers operated successfully fighter aircraft applications including setting radio frequencies commanding autopilot system setting steer-point coordinates weapons release parameters controlling flight display working swedish pilots flying jas-39 gripen cockpit englund 2004 found recognition deteriorated increasing g-loads report also concluded adaptation greatly improved results cases introduction models breathing shown improve recognition scores significantly contrary might expected effects broken english speakers found evident spontaneous speech caused problems recognizer might expected restricted vocabulary proper syntax could thus expected improve recognition accuracy substantially eurofighter typhoon currently service uk raf employs speaker-dependent system requiring pilot create template system used safety-critical weapon-critical tasks weapon release lowering undercarriage used wide range cockpit functions voice commands confirmed visual and/or aural feedback system seen major design feature reduction pilot workload even allows pilot assign targets aircraft two simple voice commands wingmen five commands speaker-independent systems also developed test f35 lightning ii jsf alenia aermacchi m-346 master lead-in fighter trainer systems produced word accuracy scores excess 98 problems achieving high recognition accuracy stress noise pertain strongly helicopter environment well jet fighter environment acoustic noise problem actually severe helicopter environment high noise levels also helicopter pilot general wear facemask would reduce acoustic noise microphone substantial test evaluation programs carried past decade speech recognition systems applications helicopters notably u.s. army avionics research development activity avrada royal aerospace establishment rae uk work france included speech recognition puma helicopter also much useful work canada results encouraging voice applications included control communication radios setting navigation systems control automated target handover system fighter applications overriding issue voice helicopters impact pilot effectiveness encouraging results reported avrada tests although represent feasibility demonstration test environment much remains done speech recognition overall speech technology order consistently achieve performance improvements operational settings training air traffic controllers atc represents excellent application speech recognition systems many atc training systems currently require person act pseudo-pilot engaging voice dialog trainee controller simulates dialog controller would conduct pilots real atc situation speech recognition synthesis techniques offer potential eliminate need person act pseudo-pilot thus reducing training support personnel theory air controller tasks also characterized highly structured speech primary output controller hence reducing difficulty speech recognition task possible practice rarely case faa document 7110.65 details phrases used air traffic controllers document gives less 150 examples phrases number phrases supported one simulation vendors speech recognition systems excess 500,000 usaf usmc us army us navy faa well number international atc training organizations royal australian air force civil aviation authorities italy brazil canada currently using atc simulators speech recognition number different vendors asr commonplace field telephony becoming widespread field computer gaming simulation telephony systems asr predominantly used contact centers integrating ivr systems despite high level integration word processing general personal computing field document production asr seen expected increases use improvement mobile processor speeds made speech recognition practical smartphones speech used mostly part user interface creating predefined custom speech commands language learning speech recognition useful learning second language teach proper pronunciation addition helping person develop fluency speaking skills students blind see blindness education low vision benefit using technology convey words hear computer recite well use computer commanding voice instead look screen keyboard students physically disabled suffer repetitive strain injury/other injuries upper extremities relieved worry handwriting typing working scribe school assignments using speech-to-text programs also utilize speech recognition technology freely enjoy searching internet using computer home without physically operate mouse keyboard speech recognition allow students learning disabilities become better writers saying words aloud increase fluidity writing alleviated concerns regarding spelling punctuation mechanics writing also see learning disability use voice recognition software conjunction digital audio recorder personal computer running word-processing software proven positive restoring damaged short-term-memory capacity stroke craniotomy individuals people disabilities benefit speech recognition programs individuals deaf hard hearing speech recognition software used automatically generate closed-captioning conversations discussions conference rooms classroom lectures and/or religious services speech recognition also useful people difficulty using hands ranging mild repetitive stress injuries involve disabilities preclude using conventional computer input devices fact people used keyboard lot developed rsi became urgent early market speech recognition speech recognition used deaf telephony voicemail text relay services captioned telephone individuals learning disabilities problems thought-to-paper communication essentially think idea processed incorrectly causing end differently paper possibly benefit software technology bug proof also whole idea speak text hard intellectually disabled person due fact rare anyone tries learn technology teach person disability type technology help dyslexia disabilities still question effectiveness product problem hindering effective although kid may able say word depending clear say technology may think saying another word input wrong one giving work fix causing take time fixing wrong word performance speech recognition systems usually evaluated terms accuracy speed accuracy usually rated word error rate wer whereas speed measured real time factor measures accuracy include single word error rate swer command success rate csr speech recognition machine complex problem however vocalizations vary terms accent pronunciation articulation roughness nasality pitch volume speed speech distorted background noise echoes electrical characteristics accuracy speech recognition may vary following mentioned earlier article accuracy speech recognition may vary depending following factors discontinuous speech full sentences separated silence used therefore becomes easier recognize speech well isolated speech continuous speech naturally spoken sentences used therefore becomes harder recognize speech different isolated discontinuous speech constraints often represented grammar speech recognition multi-levelled pattern recognition task e.g known word pronunciations legal word sequences compensate errors uncertainties lower level telephone speech sampling rate 8000 samples per second computed every 10 ms one 10 ms section called frame analysis four-step neural network approaches explained information sound produced air medium vibration register ears machines receivers basic sound creates wave two descriptions amplitude strong frequency often vibrates per second speech recognition become means attack theft accidental operation example activation words like alexa spoken audio video broadcast cause devices homes offices start listening input inappropriately possibly take unwanted action voice-controlled devices also accessible visitors building even outside building heard inside attackers may able gain access personal information like calendar address book contents private messages documents may also able impersonate user send messages make online purchases two attacks demonstrated use artificial sounds one transmits ultrasound attempt send commands without nearby people noticing adds small inaudible distortions speech music specially crafted confuse specific speech recognition system recognizing music speech make sounds like one command human sound like different command system popular speech recognition conferences held year two include speechtek speechtek europe icassp interspeech/eurospeech ieee asru conferences field natural language processing acl naacl emnlp hlt beginning include papers speech processing important journals include ieee transactions speech audio processing later renamed ieee transactions audio speech language processing since sept 2014 renamed ieee/acm transactions audio speech language processing\u2014after merging acm publication computer speech language speech communication books like fundamentals speech recognition lawrence rabiner useful acquire basic knowledge may fully date 1993 another good source statistical methods speech recognition frederick jelinek spoken language processing 2001 xuedong huang etc computer speech manfred r. schroeder second edition published 2004 speech processing dynamic optimization-oriented approach published 2003 li deng doug o'shaughnessey updated textbook speech language processing 2008 jurafsky martin presents basics state art asr speaker recognition also uses features front-end processing classification techniques done speech recognition comprehensive textbook fundamentals speaker recognition depth source date details theory practice good insight techniques used best modern systems gained paying attention government sponsored evaluations organised darpa largest speech recognition-related project ongoing 2007 gale project involves speech recognition translation components good accessible introduction speech recognition technology history provided general audience book voice machine building computers understand speech roberto pieraccini 2012 recent book speech recognition automatic speech recognition deep learning approach publisher springer written microsoft researchers d. yu l. deng published near end 2014 highly mathematically oriented technical detail deep learning methods derived implemented modern speech recognition systems based dnns related deep learning methods related book published earlier 2014 deep learning methods applications l. deng d. yu provides less technical methodology-focused overview dnn-based speech recognition 2009\u20132014 placed within general context deep learning applications including speech recognition also image recognition natural language processing information retrieval multimodal processing multitask learning terms freely available resources carnegie mellon university sphinx toolkit one place start learn speech recognition start experimenting another resource free copyrighted htk book accompanying htk toolkit recent state-of-the-art techniques kaldi toolkit used 2017 mozilla launched open source project called common voice gather big database voices would help build free speech recognition project deepspeech available free github using google open source platform tensorflow commercial cloud based speech recognition apis broadly available aws azure ibm gcp demonstration on-line speech recognizer available cobalt webpage software resources see list speech recognition software", + "neighbors": [ + 28, + 111, + 159, + 162, + 253, + 282, + 307, + 337, + 339, + 368, + 372, + 453, + 680, + 704, + 733, + 832, + 883, + 885, + 1007, + 1062, + 1082, + 1096, + 1128, + 1142, + 1151, + 1209, + 1213, + 1219, + 1440, + 1465, + 1582, + 1615 + ], + "mask": "Test" + }, + { + "node_id": 1487, + "label": 5, + "text": "Link_Capacity_Adjustment_Scheme:link capacity adjustment scheme link capacity adjustment scheme lcas method dynamically increase decrease bandwidth virtual concatenated containers lcas protocol specified itu-t g.7042 allows on-demand increase decrease bandwidth virtual concatenated group hitless manner brings bandwidth-on-demand capability data clients like ethernet mapped tdm containers lcas also able temporarily remove failed members virtual concatenation group failed member automatically cause decrease bandwidth repair bandwidth increase hitless fashion together diverse routing provides survivability data traffic without requiring excess protection bandwidth allocation", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1488, + "label": 3, + "text": "Apple_A10:apple a10 apple a10 fusion 64-bit arm-based system chip soc designed apple inc. manufactured tsmc first appeared iphone 7 7 plus introduced september 7 2016 addition a10 chip processor sixth-generation ipad seventh-generation ipod touch a10 first apple-designed quad-core soc two high-performance cores two energy-efficient cores apple states 40 greater cpu performance 50 greater graphics performance compared predecessor apple a9 a10 internally t8010 built tsmc 16 nm finfet process contains 3.3 billion transistors including gpu caches die size 125 mm features two apple-designed 64-bit 2.34 ghz armv8-a cores called hurricane die size 4.18 mm first apple-produced quad-core soc two high-performance cores designed demanding tasks like gaming also featuring two energy-efficient apple-designed 64-bit cores codenamed zephyr 0.78 mm normal tasks configuration similar arm big.little technology however unlike implementations big.little snapdragon 820 exynos 8890 one core type active time either high-performance low-power cores thus a10 fusion appears software benchmarks dual core chip apple claims high-performance cores 40 faster apple previous a9 processor two high-efficiency cores consume 20 power high performance hurricane cores used performing simple tasks checking email new performance controller decides realtime pair cores run given task order optimize performance battery life a10 l1 cache 64 kb data 64 kb instructions l2 cache 3 mb shared cores 4 mb l3 cache services entire soc new 6-core gpu built a10 chip 50 faster consuming 66 power a9 predecessor analysis suggested apple kept gt7600 used apple a9 replaced portions powervr based gpu proprietary designs changes appear using lower half-precision floating-point numbers allowing higher-performance lower power consumption embedded a10 m10 motion coprocessor a10 also includes new image processor apple says twice throughput prior image processor a10 adds hardware encoding heif hevc a10 packaged new info packaging tsmc reduces height package package also four lpddr4 ram chips integrating 2 gb ram iphone 7 ipad 6th generation ipod touch 7th generation 3 gb iphone 7 plus", + "neighbors": [ + 33, + 71, + 75, + 99, + 112, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 853, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 988, + 1001, + 1069, + 1100, + 1140, + 1147, + 1176, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1496, + 1518, + 1544, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 1489, + "label": 3, + "text": "Arcus_II:_Silent_Symphony:arcus ii silent symphony", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1490, + "label": 1, + "text": "Personal_Identity_System:personal identity system personal identity system pis established 1947 register pakistani citizens personal identity system replaced national database registration authority 1972 independence pakistan prime minister liaquat ali khan launched personal identity system pis program registered managed issued national identification cards citizens pakistan muslim refugees settling pakistan", + "neighbors": [ + 139 + ], + "mask": "Test" + }, + { + "node_id": 1491, + "label": 9, + "text": "Closure_(computer_programming):closure computer programming programming languages closure also lexical closure function closure technique implementing lexically scoped name binding language first-class functions operationally closure record storing function together environment environment mapping associating free variable function variables used locally defined enclosing scope value reference name bound closure created unlike plain function closure allows function access captured variables closure copies values references even function invoked outside scope concept closures developed 1960s mechanical evaluation expressions \u03bb-calculus first fully implemented 1970 language feature pal programming language support lexically scoped first-class functions peter j. landin defined term closure 1964 environment part control part used secd machine evaluating expressions joel moses credits landin introducing term closure refer lambda expression whose open bindings free variables closed bound lexical environment resulting closed expression closure usage subsequently adopted sussman steele defined scheme 1975 lexically scoped variant lisp became widespread term closure often used synonym anonymous function though strictly anonymous function function literal without name closure instance function value whose non-local variables bound either values storage locations depending language see lexical environment section example following python code values codice_1 codice_2 closures cases produced returning nested function free variable enclosing function free variable binds value parameter codice_3 enclosing function closures codice_1 codice_2 functionally identical difference implementation first case used nested function name codice_6 second case used anonymous nested function using python keyword codice_7 creating anonymous function original name used defining irrelevant closure value like value need assigned variable instead used directly shown last two lines example usage may deemed anonymous closure nested function definitions closures free variable yet bound enclosing function evaluated value parameter free variable nested function bound creating closure returned enclosing function lastly closure distinct function free variables outside scope non-local variables otherwise defining environment execution environment coincide nothing distinguish static dynamic binding distinguished names resolve values example program functions free variable codice_3 bound non-local variable codice_3 global scope executed environment codice_3 defined immaterial whether actually closures often achieved function return since function must defined within scope non-local variables case typically scope smaller also achieved variable shadowing reduces scope non-local variable though less common practice less useful shadowing discouraged example codice_11 seen closure codice_3 body codice_11 bound codice_3 global namespace codice_3 local codice_6 use closures associated languages functions first-class objects functions returned results higher-order functions passed arguments function calls functions free variables first-class returning one creates closure includes functional programming languages lisp ml well many modern multi-paradigm languages python rust closures also frequently used callbacks particularly event handlers javascript used interactions dynamic web page closures also used continuation-passing style hide state constructs objects control structures thus implemented closures languages closure may occur function defined within another function inner function refers local variables outer function run-time outer function executes closure formed consisting inner function code references upvalues variables outer function required closure closures typically appear languages first-class functions\u2014in words languages enable functions passed arguments returned function calls bound variable names etc. like simpler types strings integers example consider following scheme function example lambda expression codice_17 appears within function codice_18 lambda expression evaluated scheme creates closure consisting code lambda expression reference codice_19 variable free variable inside lambda expression closure passed codice_20 function calls repeatedly determine books added result list discarded closure reference codice_19 use variable time codice_20 calls function codice_20 might defined completely separate file example rewritten javascript another popular language support closures codice_24 keyword used instead codice_7 codice_26 method instead global codice_20 function otherwise structure effect code function may create closure return following example closure case outlives execution function creates variables codice_11 codice_29 live function codice_30 returns even though execution left scope longer visible languages without closures lifetime automatic local variable coincides execution stack frame variable declared languages closures variables must continue exist long existing closures references commonly implemented using form garbage collection closure used associate function set private variables persist several invocations function scope variable encompasses closed-over function accessed program code stateful languages closures thus used implement paradigms state representation information hiding since closure upvalues closed-over variables indefinite extent value established one invocation remains available next closures used way longer referential transparency thus longer pure functions nevertheless commonly used impure functional languages scheme closures many uses note speakers call data structure binds lexical environment closure term usually refers specifically functions closures typically implemented special data structure contains pointer function code plus representation function lexical environment i.e. set available variables time closure created referencing environment binds non-local names corresponding variables lexical environment time closure created additionally extending lifetime least long lifetime closure closure entered later time possibly different lexical environment function executed non-local variables referring ones captured closure current environment language implementation easily support full closures run-time memory model allocates automatic variables linear stack languages function automatic local variables deallocated function returns however closure requires free variables references survive enclosing function execution therefore variables must allocated persist longer needed typically via heap allocation rather stack lifetime must managed survive closures referencing longer use explains typically languages natively support closures also use garbage collection alternatives manual memory management non-local variables explicitly allocating heap freeing done using stack allocation language accept certain use cases lead undefined behaviour due dangling pointers freed automatic variables lambda expressions c++11 nested functions gnu c. funarg problem functional argument problem describes difficulty implementing functions first class objects stack-based programming language c c++ similarly version 1 assumed programmer knows delegates automatic local variables references invalid return definition scope automatic local variables stack \u2013 still permits many useful functional patterns complex cases needs explicit heap allocation variables version 2 solved detecting variables must stored heap performs automatic allocation uses garbage collection versions need track usage variables passed strict functional languages immutable data e.g erlang easy implement automatic memory management garbage collection possible cycles variables references example erlang arguments variables allocated heap references additionally stored stack function returns references still valid heap cleaning done incremental garbage collector ml local variables lexically scoped hence define stack-like model since bound values objects implementation free copy values closure data structure way invisible programmer scheme algol-like lexical scope system dynamic variables garbage collection lacks stack programming model suffer limitations stack-based languages closures expressed naturally scheme lambda form encloses code free variables environment persist within program long possibly accessed used freely scheme expression closures closely related actors actor model concurrent computation values function lexical environment called acquaintances important issue closures concurrent programming languages whether variables closure updated updates synchronized actors provide one solution closures closely related function objects transformation former latter known defunctionalization lambda lifting see also closure conversion different languages always common definition lexical environment definitions closure may vary also commonly held minimalist definition lexical environment defines set bindings variables scope also closures language capture however meaning variable binding also differs imperative languages variables bind relative locations memory store values although relative location binding change runtime value bound location languages since closure captures binding operation variable whether done closure performed relative memory location often called capturing variable reference example illustrating concept ecmascript one language function codice_31 closures referred variables codice_11 codice_6 use relative memory location signified local variable codice_3 instances behaviour may undesirable necessary bind different lexical closure ecmascript would done using codice_35 example expected behaviour would link emit id clicked variable e bound scope lazy evaluated click actually happens click event emits id last element 'elements bound end loop variable codice_36 would need bound scope block using codice_37 codice_38 keyword hand many functional languages ml bind variables directly values case since way change value variable bound need share state closures\u2014they use values often called capturing variable value java local anonymous classes also fall category\u2014they require captured local variables codice_39 also means need share state languages enable choose capturing value variable location example c++11 captured variables either declared codice_40 means captured reference codice_41 means captured value yet another subset lazy functional languages haskell bind variables results future computations rather values consider example haskell binding codice_42 captured closure defined within function codice_31 computation codice_44\u2014which case results division zero however since computation captured value error manifests closure invoked actually attempts use captured binding yet differences manifest behavior lexically scoped constructs codice_45 codice_46 codice_47 statements constructs general considered terms invoking escape continuation established enclosing control statement case codice_46 codice_47 interpretation requires looping constructs considered terms recursive function calls languages ecmascript codice_45 refers continuation established closure lexically innermost respect statement\u2014thus codice_45 within closure transfers control code called however smalltalk superficially similar operator codice_52 invokes escape continuation established method invocation ignoring escape continuations intervening nested closures escape continuation particular closure invoked smalltalk implicitly reaching end closure code following examples ecmascript smalltalk highlight difference code snippets behave differently smalltalk codice_52 operator javascript codice_45 operator analogous ecmascript example codice_55 leave inner closure begin new iteration codice_56 loop whereas smalltalk example codice_57 abort loop return method codice_31 common lisp provides construct express either actions lisp codice_59 behaves smalltalk codice_57 lisp codice_61 behaves javascript codice_55 hence smalltalk makes possible captured escape continuation outlive extent successfully invoked consider closure returned method codice_31 invoked attempts return value invocation codice_31 created closure since call already returned smalltalk method invocation model follow spaghetti stack discipline facilitate multiple returns operation results error languages ruby enable programmer choose way codice_45 captured example ruby codice_66 codice_7 example ways create closure semantics closures thus created different respect codice_45 statement scheme definition scope codice_45 control statement explicit arbitrarily named 'return sake example following direct translation ruby sample languages features simulate behavior closures languages java c++ objective-c c vb.net features result language object-oriented paradigm c libraries support callbacks sometimes implemented providing two values registering callback library function pointer separate codice_70 pointer arbitrary data user choice library executes callback function passes along data pointer enables callback maintain state refer information captured time registered library idiom similar closures functionality syntax codice_70 pointer type safe c idiom differs type-safe closures c haskell ml callbacks extensively used gui widget toolkits implement event-driven programming associating general functions graphical widgets menus buttons check boxes sliders spinners etc application-specific functions implementing specific desired behavior application gcc extension nested function used function pointer emulate closures providing containing function exit example invalid typedef int *fn_int_to_int int //type function int- int fn_int_to_int adder int number int main void java enables classes defined inside methods called local classes classes named known anonymous classes anonymous inner classes local class either named anonymous may refer names lexically enclosing classes read-only variables marked codice_39 lexically enclosing method capturing codice_39 variables enables capture variables value even variable want capture non-codice_39 always copy temporary codice_39 variable class capturing variables reference emulated using codice_39 reference mutable container example single-element array local class able change value container reference able change contents container advent java 8 lambda expressions closure causes code executed local classes one types inner class declared within body method java also supports inner classes declared non-static members enclosing class normally referred inner classes defined body enclosing class full access instance variables enclosing class due binding instance variables inner class may instantiated explicit binding instance enclosing class using special syntax upon execution print integers 0 9 beware confuse type class nested class declared way accompanied usage static modifier desired effect instead classes special binding defined enclosing class java 8 java supports functions first class objects lambda expressions form considered type codice_77 domain u image type expression called codice_78 method standard method call apple introduced blocks form closure nonstandard extension c c++ objective-c 2.0 mac os x 10.6 snow leopard ios 4.0 apple made implementation available gcc clang compilers pointers block block literals marked codice_52 normal local variables captured value block created read-only inside block variables captured reference marked codice_80 blocks need persist outside scope created may need copied c sharp programming language |c anonymous methods lambda expressions support closure visual basic .net many language features similar c also supports lambda expressions closures programming language |d closures implemented delegates function pointer paired context pointer e.g class instance stack frame heap case closures version 1 limited closure support example code work correctly variable stack returning test longer valid use probably calling foo via dg return 'random integer solved explicitly allocating variable heap using structs class store needed closed variables construct delegate method implementing code closures passed functions long used referenced values still valid example calling another function closure callback parameter useful writing generic data processing code limitation practice often issue limitation fixed version 2 variable automatically allocated heap used inner function delegate function escape current scope via assignment dg return local variables arguments referenced delegates referenced delegates escape current scope remain stack simpler faster heap allocation true inner class methods references function variables c++ enables defining function object overloading codice_81 objects behave somewhat like functions functional programming language may created runtime may contain state implicitly capture local variables closures c++11|the 2011 revision c++ language also supports closures type function object constructed automatically special language construct called lambda-expression c++ closure may capture context either storing copies accessed variables members closure object reference latter case closure object escapes scope referenced object invoking codice_81 causes undefined behavior since c++ closures extend lifetime context eiffel programming language |eiffel includes inline agents defining closures inline agent object representing routine defined giving code routine in-line example argument codice_83 agent representing procedure two arguments procedure finds country corresponding coordinates displays whole agent subscribed event type codice_84 certain button whenever instance event type occurs button \u2014 user clicked button \u2014 procedure executed mouse coordinates passed arguments codice_3 codice_86 main limitation eiffel agents distinguishes closures languages reference local variables enclosing scope design decision helps avoiding ambiguity talking local variable value closure latest value variable value captured agent created codice_87 reference current object analogous codice_88 java features arguments agent accessed within agent body values outer local variables passed providing additional closed operands agent embarcadero c++builder provides reserve word __closure provide pointer method similar syntax function pointer standard c could write pointer function type using following syntax typedef void *tmyfunctionpointer void similar way declare pointer method using following syntax typedef void __closure *tmymethodpointer category programming language concepts category implementation functional programming languages category subroutines category articles example python code category articles example scheme code category articles example javascript code category articles example c++ code category articles example eiffel code category articles example c sharp code category articles example code category articles example objective-c code category articles example java code category articles example ruby code category articles example smalltalk code category articles example haskell code", + "neighbors": [ + 251, + 306, + 308, + 347, + 509, + 567, + 682, + 820, + 919, + 926, + 1120, + 1225, + 1264, + 1311, + 1430, + 1477, + 1636 + ], + "mask": "Validation" + }, + { + "node_id": 1492, + "label": 4, + "text": "OpenPuff:openpuff openpuff steganography watermarking sometimes abbreviated openpuff puff freeware steganography tool microsoft windows created cosimo oliboni still maintained independent software program notable first steganography tool version 1.01 released december 2004 last revision supports wide range carrier formats openpuff used primarily anonymous asynchronous data sharing advantage steganography cryptography alone messages attract attention plainly visible encrypted messages \u2014 matter unbreakable \u2014 arouse suspicion may incriminating countries encryption illegal therefore whereas cryptography protects contents message steganography said protect messages communicating parties watermarking action signing file id copyright mark openpuff invisible steganographic way applied supported carrier invisible mark password protected accessible everyone using program openpuff semi-open source program cryptographic algorithms 16 taken aes nessie cryptrec joined unique multi-cryptography algorithm extensive testing performed statistical resistance properties csprng multi-cryptography modules using ent nist diehard test suites provided results taken 64kb 128kb ... 256mb samples security performance steganalysis resistance conflicting trade-offs security vs performance whitening security vs. steganalysis cryptography whitening data carrier injection encrypted whitened small amount hidden data turns big chunk pseudorandom suspicious data carrier injection encodes using non linear covering function takes also original carrier bits input modified carriers need much less change con1 lowering random-like statistical response deceive many steganalysis tests con2 always non-negligible probability detected even hidden stream behaves like \u201c natural container \u201d unpredictable side-effects caught flagrante delicto etc. resisting unpredictable attacks also possible even user forced legal physical coercion provide valid password deniable steganography decoy-based technique allows user deny convincingly fact sensitive data hidden user needs provide expendable decoy data would plausibly want keep confidential reveal attacker claiming", + "neighbors": [ + 660, + 961, + 1138 + ], + "mask": "Validation" + }, + { + "node_id": 1493, + "label": 2, + "text": "Nokia_Nseries:nokia nseries nokia nseries multimedia smartphone tablet product family engineered marketed nokia corporation nseries devices commonly supported multiple high-speed wireless technologies 3g wireless lan digital multimedia services music playback photo/video capture viewing gaming internet services also supported line replaced 2011 nokia lumia line company flagship smartphone portfolio nokia n1 tablet introduced november 2014 revived n prefix marketed 'nseries 27 april 2005 nokia announced new brand multimedia devices press conference mobile phone manufacturers amsterdam first three nseries devices introduced conference consists n70 n90 n91 2 november 2005 nokia announced n71 n80 n92 25 april 2006 nokia announced n72 n73 n93 26 september 2006 nokia announced n75 n95 8 january 2007 nokia announced nokia n76 nokia n77 nokia n93i 29 august 2007 nokia announced n95 8gb n81 n81 8gb 14 november 2007 nokia announced n82 first nokia xenon flash 2008 gsma held barcelona n96 n78 unveiled two new nseries devices revealed end august 2008 nokia n79 nokia n85 december 2 2008 nokia nseries announced nokia n97 february 17 2009 nokia announced nokia n86 8 mp nokia first 8-megapixel phone nokia n8 12-megapixel camera announced april 2010 21 june 2011 nokia showcased nokia n9 based meego os fourth non-symbian nseries device n800 n810 n900 nseries retired replaced lumia year company introduced nokia n1 tablet november 18 2014 marked return n prefix 'nseries branding still absent nokia nseries aimed users looking pack many features possible one device better-than-average cameras often found nseries devices many using higher-quality carl zeiss optics one example video music playback photo viewing capabilities devices resemble standalone portable media devices 2008 recently launched devices gps mp3 player wlan functionality also present numbers describe traits phone exceptions though considering n8x n82 n86 8mp top-of-the-range smartphones advanced cameras clearly 'high-end fellow n9x models first nseries device n90 ran symbian os 8.1 mobile operating system n70 n72 nokia n8 released september 2010 world first phone run symbian^3 first phone nokia featuring 12-megapixel autofocus lens also last nseries phone run symbian os n800 n810 n900 nokia chose use linux-based maemo operating system last nseries mobile phones n9 developer-only n950 released september 2011 maemo merged intel moblin create meego may 2010 nokia opted use meego harmattan 1.2 n9/n950 november 18 2014 nokia announced n1 android 5.0 tablet june nokia connections singapore nokia launched new n9 meego 1.2 harmattan os company calls qt device whole app ui framework written qt also world first pure touch phone buttons home screen great new swipe ui reviews average good phone reviewers liking phone good quality operating system expressing concern fact loses competitors terms specs device expected sold selected regions q3 2011", + "neighbors": [ + 3, + 21, + 134, + 162, + 238, + 253, + 264, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1522, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1494, + "label": 2, + "text": "RSX-11:rsx-11 rsx-11 discontinued family multi-user real-time operating systems pdp-11 computers created digital equipment corporation widespread use late 1970s early 1980s rsx-11 influential development later operating systems vms windows nt designed mainly used process control also popular program development rsx-11 began port pdp-11 architecture earlier rsx-15 operating system pdp-15 minicomputer first released 1971 main architect rsx-15 later renamed xvm/rsx dan brevick commenting rsx acronym brevik says porting effort first produced small paper tape based real-time executives rsx-11a rsx-11c later gained limited support disks rsx-11b rsx-11b evolved fully fledged rsx-11d disk-based operating system first appeared pdp-11/40 pdp-11/45 early 1973 project leader rsx-11d version 4 henry krejci rsx-11d completed digital set adapt small memory footprint giving birth rsx-11m first released 1973 1971 1976 rsx-11m project spearheaded noted operating system designer dave cutler first project principles first tried rsx-11m appear also later designs led cutler dec vms microsoft windows nt direction ron mclean derivative rsx-11m called rsx-20f developed run pdp-11/40 front-end processor kl10 pdp-10 cpu meanwhile rsx-11d saw developments direction garth wolfendale project leader 1972\u20131976 system redesigned saw first commercial release support 22-bit pdp-11/70 system added wolfendale originally uk also set team designed prototyped ias operating system uk ias variant rsx-11d suitable time sharing later development release ias led andy wilson digital uk facilities estimated release dates rsx-11 ias data taken printing date associated documentation general availability date expected come closely manuals different printing dates latest date used rsx-11s proper subset rsx-11m release dates always assumed corresponding version rsx-11m side rsx-11m plus enhanced version rsx-11m expected later corresponding version rsx-11m rsx-11 proprietary software copyright asserted binary files source code documentation alike entirely developed internally digital therefore part open source however copy kernel source comments removed present every rsx distribution used system generation process notable exception rule micro-rsx came pre-generated autoconfiguring binary kernel commented kernel source code available separate product already binary license reference purposes ownership rsx-11s rsx-11m rsx-11m plus micro/rsx transferred digital mentec inc. march 1994 part broader agreement mentec inc. us subsidiary mentec limited irish firm specializing pdp-11 hardware software support december 2006 mentec inc. acquired irish firm calyx sell pdp-11 related services goods new commercial licenses therefore legally unobtainable hobbyists run rsx-11m version 4.3 earlier rsx-11m plus version 3.0 earlier simh emulator thanks free license granted may 1998 mentec inc. legal ownership rsx-11a rsx-11b rsx-11c rsx-11d ias never changed hands therefore passed compaq acquired digital 1998 hewlett-packard 2002 late 2015 hewlett-packard split two separate companies hp inc. hewlett packard enterprise current owner firmly established new commercial licenses issued least since october 1979 rsx-11a rsx-11b rsx-11c 1990 ias one operating systems ever licensed hobbyist use 1968 soviet government decided manufacturing copies ibm mainframes dec minicomputers cooperation comecon countries practical pursuing original designs cloning dec designs began 1974 name sm-evm cyrillic \u0441\u043c \u044d\u0432\u043c \u0441\u043c \u044d\u0432\u043c acronym '\u0441\u0438\u0441\u0442\u0435\u043c\u0430 \u043c\u0430\u043b\u044b\u0445 \u044d\u043b\u0435\u043a\u0442\u0440\u043e\u043d\u043d\u043e-\u0432\u044b\u0447\u0438\u0441\u043b\u0438\u0442\u0435\u043b\u044c\u043d\u044b\u0445 \u043c\u0430\u0448\u0438\u043d russian 'system small electronic computing machines happened es evm mainframes based system/360 architecture russians allies sometimes significantly modified western designs therefore every sm-evm machine compatible dec offerings time clone rsx-11m operating system ran romanian-made coral family computers coral 2030 clone pdp-11 rsx-11 often used general-purpose timeshare computing even though target market competing rsts/e operating system rsx-11 provided features ensure better maximum necessary response time peripheral device input i.e real-time processing original intended use features included ability lock process called task rsx memory part system boot assign process higher priority would execute processes lower priority order support large programs within pdp-11 relatively small virtual address space 64 kb sophisticated semi-automatic overlay system used given program overlay scheme produced rsx taskbuilder program called tkb overlay scheme especially complex taskbuilding could take rather long time hours days standard rsx prompt mcr monitor console routine commands shortened first three characters entered correspondingly commands unique first three characters login command hello executed user yet logged hello chosen login command first three characters hel relevant allows non-logged user execute help command run certain pdp-11 processors dec operating system displays characteristic light pattern processor console panel system idle patterns created idle task running lowest level rsx-11m light pattern two sets lights sweep outwards left right center console inwards ind indirect command file processor program currently running contrast ias light pattern single bar lights swept leftwards correspondingly jumbled light pattern reflecting memory fetches visible indication computer load idle task executed pdp-11 operating systems rsts/e distinctive patterns console lights", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 127, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 380, + 387, + 434, + 465, + 583, + 650, + 664, + 720, + 721, + 735, + 754, + 755, + 797, + 884, + 891, + 925, + 941, + 954, + 961, + 966, + 996, + 998, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1213, + 1224, + 1287, + 1301, + 1304, + 1391, + 1394, + 1397, + 1415, + 1441, + 1445, + 1456, + 1468, + 1530, + 1546, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1495, + "label": 4, + "text": "Rick_Francona:rick francona lieutenant colonel rick francona born 31 august 1951 author commentator media military analyst retired united states air force intelligence officer experience middle east including tours duty national security agency defense intelligence agency central intelligence agency contract nbc news appeared regularly nbc msnbc cnbc well radio canada media 2013 became military analyst cnn francona served 27 years u.s. air force middle east fluent arabic served region national security agency defense intelligence agency central intelligence agency bachelor degree chapman college chapman university government arabic language master degree troy state university international relations concentration middle east studies cousin current cleveland indians manager terry francona francona wife emily also retired air force intelligence officer reside port orford oregon francona enlisted united states air force 1970 served vietnamese linguist 1973 conducting combat aerial reconnaissance missions vietnam laos variety strategic tactical aircraft arabic language training served variety locations middle east 1975 1977 supported evacuation u.s. embassy beirut lebanon 1976 1978 became arabic language instructor defense language institute monterey california following commissioning 1979 francona instructor air force intelligence school denver colorado 1982 1984 middle east operations officer national security agency united states overseas 1984 assigned advisor royal jordanian air force amman jordan 1987 assigned defense intelligence agency assistant defense intelligence officer middle east assignment spent much 1987 1988 u.s. embassy baghdad iraq liaison officer iraqi armed forces directorate military intelligence francona worked observer iraqi combat operations iranian forces flew sorties iraqi air force observations key discovery iraqi chemical weapons capabilities ballistic missile modifications immediately following iraqi invasion kuwait august 1990 gulf war francona deployed gulf interpreter advisor iraqi armed forces commander chief u.s. central command general norman schwarzkopf jr. lead interpreter ceasefire talks iraqi military safwan iraq march 1991 end gulf war francona served office secretary defense principal author department defense report congress conduct gulf war 1992 selected first air attach\u00e9 u.s. embassy damascus syria returning united states 1995 1995 1996 francona served central intelligence agency participated variety sensitive operations middle east one operations survived attempt life iraqi intelligence service agents later awarded cia bronze seal medallion service cia 1996 selected lead development joint services counterterrorism intelligence branch direct result success creating special task force asked lead special operations team supporting nato forces bosnia late 1997 returned united states retired active duty 1998 decorations include defense distinguished service medal defense superior service medal bronze star nine air medals well campaign awards service vietnam persian gulf balkans francona awarded central intelligence agency seal medallion service agency 2006 francona inducted defense language institute hall fame francona media analyst middle east political-military events formerly contract nbc news appeared regularly nbc nightly news today show msnbc hardball chris matthews scarborough country countdown keith olbermann others also writes articles msnbc council foreign relations blog middle east perspectives frequently speaks conventions public service audiences 2010 francona appeared subject matter expert iraqi military saddam hussein episode spike tv deadliest warrior 2013 began working military analyst cnn commenting syrian civil war chemical warfare issues 2014 deteriorating situation iraq april 2008 documents obtained new york times reporter david barstow revealed francona recruited one 75 retired military officers involved pentagon military analyst program participants appeared television radio news shows military analysts and/or penned newspaper op/ed columns program launched early 2002 then-assistant secretary defense public affairs victoria clarke idea recruit key influentials help sell wary public possible iraq invasion", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1496, + "label": 8, + "text": "Topsy_Labs:topsy labs topsy labs social search analytics company based san francisco california company certified twitter partner maintained comprehensive index tweets numbering hundreds billions dating back twitter inception 2006 topsy made products search analyze draw insights conversations trends public social websites including twitter google+ company acquired apple inc. december 2013 shut december 16 2015 topsy founded 2007 vipul ved prakash rishab aiyer ghosh gary iwatani justin foutts company raised usd 27 million venture capital bluerun ventures ignition partners founders fund scott banister investors company 40 employees offices san francisco washington dc operating data centers december 2013 topsy acquired apple inc. reported value around 225 million december 16 2015 topsy service shut website redirected apple support page discussing search functionality ios 9 topsy.com real-time search engine social posts socially shared content primarily twitter google plus service ranked results using proprietary social influence algorithm measured social media authors much others supported saying service also provided access metrics term mentioned twitter via free analytic service analytics.topsy.com users could compare three terms content past hour day week month announced september 2013 topsy would include every public tweet ever published twitter search analysis topsy pro analytics commercial web dashboard application allowed users conduct interactive analysis keywords authors activity influence exposure sentiment language geography users could discover relevant tweets links photos videos term topsy \u2019 index hundreds billions tweets users able group terms saved topics setup customized alerts daily activity digests topsy pro analytics version topsy pro analytics product government agencies intended purpose product facilitate disaster response quantify political issues detect disease outbreak monitor global anomalies topsy provided set rest apis programmatically access twitter data metrics users could also access data via ad-hoc report requests index co-developed twitter topsy debuted august 2012 originally compared social sentiment two primary american presidential candidates index also co-developed twitter topsy debuted january 2013 originally compared social sentiment films nominated academy awards six categories best picture best actor best actress best supporting actor best supporting actress best director topsy sentiment analysis used index correctly predicted five six award recipients march 2013 mashable topsy co-produced mashable sxsw trendspotter mobile-enabled website visitors could see trending sxsw event based real-time analysis twitter conversations sxsw trendspotter provided analysis", + "neighbors": [ + 33, + 71, + 75, + 99, + 121, + 130, + 214, + 228, + 269, + 345, + 356, + 395, + 403, + 477, + 511, + 551, + 596, + 610, + 625, + 634, + 696, + 797, + 810, + 858, + 877, + 917, + 927, + 945, + 956, + 1100, + 1178, + 1237, + 1262, + 1292, + 1305, + 1334, + 1373, + 1409, + 1488, + 1544, + 1591 + ], + "mask": "Validation" + }, + { + "node_id": 1497, + "label": 3, + "text": "Pumpkin_Adventure_III:_The_Hunt_for_the_Unknown:pumpkin adventure iii hunt unknown pumpkin adventure iii hunt unknown video game msx created umax released 1995 sunrise foundation role-playing game turn-based fighting system los angeles attack strange creatures nobody knows creatures sent last hope l.a. government sets special police team s.o.d.o.m even s.o.d.o.m able stop threat last resort brilliant professor steinein uses time machine find brave people history people steve damien bishop stopped lucifer taking world pumpkin adventure 2 three together s.o.d.o.m member jeff tates start quest find source creatures destroy", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1498, + "label": 9, + "text": "Inductive_data_type:inductive data type inductive data type may refer", + "neighbors": [], + "mask": "Train" + }, + { + "node_id": 1499, + "label": 3, + "text": "Barrel_processor:barrel processor barrel processor cpu switches threads execution every cycle cpu design technique also known interleaved fine-grained temporal multithreading unlike simultaneous multithreading modern superscalar architectures generally allow execution multiple instructions one cycle like preemptive multitasking thread execution assigned program counter hardware registers thread architectural state barrel processor guarantee thread execute one instruction every n cycles unlike preemptive multitasking machine typically runs one thread execution tens millions cycles threads wait turn technique called c-slowing automatically generate corresponding barrel processor design single-tasking processor design n -way barrel processor generated way acts much like n separate multiprocessing copies original single-tasking processor one running roughly 1/ n original speed one earliest examples barrel processor i/o processing system cdc 6000 series supercomputers executed one instruction portion instruction 10 different virtual processors called peripheral processors returning first processor one motivation barrel processors reduce hardware costs case cdc 6x00 ppus digital logic processor much faster core memory rather ten separate processors ten separate core memory units ppus share single set processor logic another example honeywell 800 8 groups registers allowing 8 concurrent programs instruction processor would cases switch next active program sequence barrel processors also used large-scale central processors tera mta 1988 large-scale barrel processor design 128 threads per core mta architecture seen continued development successive products cray urika-gd originally introduced 2012 yarcdata urika targeted data-mining applications barrel processors also found embedded systems particularly useful deterministic real-time thread performance example xmos xcore xs1 2007 four-stage barrel processor eight threads per core xs1 found ethernet usb audio control devices applications i/o performance critical barrel processors also used specialized devices eight-thread ubicom ip3023 network i/o processor 2004 8-bit microcontrollers padauk technology feature barrel processors 8 threads per core single-tasking processor spends lot time idle anything useful whenever cache miss pipeline stall occurs advantages employing barrel processors single-tasking processors include disadvantages barrel processors", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 314, + 335, + 388, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1469, + 1505, + 1507, + 1518, + 1525, + 1557, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1500, + "label": 2, + "text": "Google_Goggles:google goggles google goggles image recognition mobile app developed google used searches based pictures taken handheld devices example taking picture famous landmark searches information taking picture product barcode would search information product google goggles developed use google android operating system mobile devices initially available beta version android phones google announced plans enable software run platforms notably iphone blackberry devices google discuss non-handheld format google product manager shailesh nalawadi indicated google wanted goggles application platform much like google maps single product october 5 2010 google announced availability google goggles devices running ios 4.0 may 2014 update google mobile ios google goggles feature removed google i/o 2017 similar app google lens announced similar functions goggles uses google assistant app officially discontinued august 20 2018 last update directing users download google lens google photos upon launching app system could identify various labels landmarks allowing users learn items without needing text-based search system could identify products barcodes labels allow users search similar products prices save codes future reference similar cuecat late 1990s system also recognized printed text uses optical character recognition ocr produce text snippet cases even translate snippet another language metropolitan museum art announced december 2011 collaboration google use google goggles providing information artworks museum direct links website metropolitan museum art", + "neighbors": [ + 24, + 41, + 113, + 131, + 162, + 176, + 182, + 216, + 298, + 306, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 782, + 832, + 837, + 936, + 962, + 1061, + 1082, + 1129, + 1138, + 1183, + 1185, + 1259, + 1265, + 1276, + 1310, + 1371, + 1373, + 1411, + 1419, + 1480, + 1483, + 1569, + 1596, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1501, + "label": 1, + "text": "Hospital_Records_Database:hospital records database hospital records database database provided wellcome trust uk national archives provides information existence location records uk hospitals includes location dates administrative clinical records existence catalogues links online hospital catalogues website proposed resource month royal society medicine 2009", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1502, + "label": 2, + "text": "Microsoft_Foundation_Class_Library:microsoft foundation class library microsoft foundation class library mfc c++ object-oriented library developing desktop applications windows mfc introduced microsoft 1992 quickly gained widespread use microsoft introduced alternative application frameworks since mfc remains widely used mfc introduced 1992 microsoft c/c++ 7.0 compiler use 16-bit versions windows extremely thin object-oriented c++ wrapper windows api c++ beginning replace c development commercial application software time mfc program direct windows api calls rarely needed instead programs create objects microsoft foundation class classes call member functions belonging objects many functions share names corresponding api functions one quirk mfc use afx prefix many functions macros standard precompiled header name stdafx.h early development became mfc called application framework extensions abbreviated afx name microsoft foundation classes mfc adopted late release cycle change references mfc 8.0 released visual studio 2005 mfc 9.0 released visual studio 2008 april 7 2008 microsoft released update mfc classes out-of-band update visual studio 2008 mfc 9 update features new user interface constructs including ribbons associated ui widgets fully customizable toolbars docking panes either freely floated docked side document tabs mfc initially feature commercial versions visual studio included freeware visual c++ express community edition visual studio introduced 2014 however includes mfc object windows library owl designed use borland turbo c++ compiler competing product introduced borland around time eventually borland discontinued owl development licensed distribution mfc headers libraries dlls microsoft short time though never offered fully integrated support mfc borland later released visual component library replace owl framework mfc library wraps portions windows api c++ classes including functionality enables use default application framework classes defined many handle-managed windows objects also predefined windows common controls time introduction mfc provided c++ macros windows message-handling via message maps exceptions run-time type identification rtti serialization dynamic class instantiation macros message-handling aimed reduce memory consumption avoiding gratuitous virtual table use also provide concrete structure various visual c++-supplied tools edit manipulate code without parsing full language message-handling macros replaced virtual function mechanism provided c++ macros serialization exceptions rtti predated availability features microsoft c++ number years 32-bit versions mfc windows nt 3.1 later windows operating systems used compilers implemented language features updated macros simply wrap language features instead providing customized implementations realizing upward compatibility mfc ribbon resource editor allows developer design ribbon graphically instead use xml-based declarative markup like ribbonx api optionally ribbon components may programmed directly calling new set ribbon class methods developer may mix graphical programmatic ribbon development convenient mfc application wizard also upgraded support new features including check-box select whether application use ribbon docking panes new functionality provided new classes old applications still continue run update building top bcgsoft \u2019 bcgcontrolbar library professional edition microsoft imposed additional licensing requirements users ribbons include requirement adhere microsoft ui design guidelines anti-competition clause prohibiting use ui applications compete microsoft office mfc used linking static library adding mfc dll", + "neighbors": [ + 28, + 99, + 108, + 117, + 258, + 268, + 292, + 306, + 308, + 378, + 394, + 412, + 435, + 472, + 509, + 521, + 567, + 653, + 682, + 686, + 689, + 796, + 815, + 961, + 1068, + 1138, + 1177, + 1189, + 1190, + 1212, + 1221, + 1225, + 1227, + 1235, + 1251, + 1298, + 1311, + 1417, + 1428, + 1536, + 1620, + 1621, + 1625 + ], + "mask": "Train" + }, + { + "node_id": 1503, + "label": 3, + "text": "Graphics_processing_unit:graphics processing unit graphics processing unit gpu specialized electronic circuit designed rapidly manipulate alter memory accelerate creation images frame buffer intended output display device gpus used embedded systems mobile phones personal computers workstations game consoles modern gpus efficient manipulating computer graphics image processing highly parallel structure makes efficient general-purpose central processing units cpus algorithms process large blocks data parallel personal computer gpu present video card embedded motherboard certain cpus embedded cpu die term gpu coined sony reference playstation console toshiba-designed sony gpu 1994 term popularized nvidia 1999 marketed geforce 256 world first gpu presented single-chip processor integrated transform lighting triangle setup/clipping rendering engines rival ati technologies coined term visual processing unit vpu release radeon 9700 2002 arcade system boards using specialized graphics chips since 1970s early video game hardware ram frame buffers expensive video chips composited data together display scanned monitor fujitsu mb14241 video shifter used accelerate drawing sprite graphics various 1970s arcade games taito midway gun fight 1975 sea wolf 1976 space invaders 1978 namco galaxian arcade system 1979 used specialized graphics hardware supporting rgb color multi-colored sprites tilemap backgrounds galaxian hardware widely used golden age arcade video games game companies namco centuri gremlin irem konami midway nichibutsu sega taito home market atari 2600 1977 used video shifter called television interface adaptor atari 8-bit computers 1979 antic video processor interpreted instructions describing display list \u2014the way scan lines map specific bitmapped character modes memory stored need contiguous frame buffer 6502 machine code subroutines could triggered scan lines setting bit display list instruction antic also supported smooth vertical horizontal scrolling independent cpu nec \u00b5pd7220 first implementation pc graphics display processor single large scale integration lsi integrated circuit chip enabling design low-cost high-performance video graphics cards number nine visual technology became best known graphics processing unit mid-1980s first fully integrated vlsi large-scale integration metal-oxide-semiconductor nmos graphics display processor pcs supported 1024x1024 resolution laid foundations emerging pc graphics market used number graphics cards licensed clones intel 82720 first intel graphics processing units williams electronics arcade games robotron 2084 joust sinistar bubbles released 1982 contain custom blitter chips operating 16-color bitmaps 1984 hitachi released artc hd63484 first major cmos graphics processor pc artc capable displaying 4k resolution monochrome mode used number pc graphics cards terminals late 1980s 1985 commodore amiga featured custom graphics chip blitter unit accelerating bitmap manipulation line draw area fill functions also included coprocessor simple instruction set capable manipulating graphics hardware registers sync video beam e.g per-scanline palette switches sprite multiplexing hardware windowing driving blitter 1986 texas instruments released tms34010 first fully programmable graphics processor could run general-purpose code graphics-oriented instruction set 1990-1992 chip would become basis texas instruments graphics architecture tiga windows accelerator cards 1987 ibm 8514 graphics system released one first video cards ibm pc compatibles implement fixed-function 2d primitives electronic hardware sharp x68000 released 1987 used custom graphics chipset 65,536 color palette hardware support sprites scrolling multiple playfields eventually serving development machine capcom cp system arcade board fujitsu later competed fm towns computer released 1989 support full 16,777,216 color palette 1988 first dedicated polygonal 3d graphics boards introduced arcades namco system 21 taito air system ibm proprietary video graphics array vga display standard introduced 1987 maximum resolution 640\u00d7480 pixels november 1988 nec home electronics announced creation video electronics standards association vesa develop promote super vga svga computer display standard successor ibm proprietary vga display standard super vga enabled graphics display resolutions 800\u00d7600 pixels 36 increase 1991 s3 graphics introduced s3 86c911 designers named porsche 911 indication performance increase promised 86c911 spawned host imitators 1995 major pc graphics chip makers added 2d acceleration support chips time fixed-function windows accelerators surpassed expensive general-purpose graphics coprocessors windows performance coprocessors faded away pc market throughout 1990s 2d gui acceleration continued evolve manufacturing capabilities improved level integration graphics chips additional application programming interfaces apis arrived variety tasks microsoft wing graphics library windows 3.x later directdraw interface hardware acceleration 2d games within windows 95 later early- mid-1990s real-time 3d graphics becoming increasingly common arcade computer console games led increasing public demand hardware-accelerated 3d graphics early examples mass-market 3d graphics hardware found arcade system boards sega model 1 namco system 22 sega model 2 fifth-generation video game consoles saturn playstation nintendo 64 arcade systems sega model 2 namco magic edge hornet simulator 1993 capable hardware l transform clipping lighting years appearing consumer graphics cards systems used dsps accelerate transformations fujitsu worked sega model 2 arcade system began working integrating l single lsi solution use home computers 1995 fujitsu pinolite first 3d geometry processor personal computers released 1997 first hardware l gpu home video game consoles nintendo 64 reality coprocessor released 1996 1997 mitsubishi released 3dpro/2mp fully featured gpu capable transformation lighting workstations windows nt desktops ati utilized firegl 4000 graphics card released 1997 term gpu coined sony reference 32-bit sony gpu designed toshiba playstation video game console released 1994 pc world notable failed first tries low-cost 3d graphics chips s3 virge ati rage matrox mystique chips essentially previous-generation 2d accelerators 3d features bolted many even pin-compatible earlier-generation chips ease implementation minimal cost initially performance 3d graphics possible discrete boards dedicated accelerating 3d functions lacking 2d gui acceleration entirely powervr 3dfx voodoo however manufacturing technology continued progress video 2d gui acceleration 3d functionality integrated one chip rendition verite chipsets among first well enough worthy note 1997 rendition went step collaborating hercules fujitsu thriller conspiracy project combined fujitsu fxg-1 pinolite geometry processor v\u00e9rit\u00e9 v2200 core create graphics card full l engine years nvidia geforce 256 card designed reduce load placed upon system cpu never made market opengl appeared early '90s professional graphics api originally suffered performance issues allowed glide api step become dominant force pc late '90s however issues quickly overcome glide api fell wayside software implementations opengl common time although influence opengl eventually led widespread hardware support time parity emerged features offered hardware offered opengl directx became popular among windows game developers late 90s unlike opengl microsoft insisted providing strict one-to-one support hardware approach made directx less popular standalone graphics api initially since many gpus provided specific features existing opengl applications already able benefit leaving directx often one generation behind see comparison opengl direct3d time microsoft began work closely hardware developers started target releases directx coincide supporting graphics hardware direct3d 5.0 first version burgeoning api gain widespread adoption gaming market competed directly many more-hardware-specific often proprietary graphics libraries opengl maintained strong following direct3d 7.0 introduced support hardware-accelerated transform lighting l direct3d opengl capability already exposed inception 3d accelerator cards moved beyond simple rasterizers add another significant hardware stage 3d rendering pipeline nvidia geforce 256 also known nv10 first consumer-level card released market hardware-accelerated l professional 3d cards already capability hardware transform lighting already existing features opengl came consumer-level hardware '90s set precedent later pixel shader vertex shader units far flexible programmable nvidia first produce chip capable programmable shading geforce 3 code named nv20 pixel could processed short program could include additional image textures inputs geometric vertex could likewise processed short program projected onto screen used xbox console competed playstation 2 used custom vector dsp hardware accelerated vertex processing commonly referred vu0/vu1 earliest incarnations shader execution engines used xbox general purpose could execute arbitrary pixel code vertices pixels processed different units resources pixel shaders much tighter constraints executed much higher frequencies vertices pixel shading engines actually akin highly customizable function block n't really run program many disparities vertex pixel shading would n't addressed much later unified shader model october 2002 introduction ati radeon 9700 also known r300 world first direct3d 9.0 accelerator pixel vertex shaders could implement looping lengthy floating point math quickly becoming flexible cpus yet orders magnitude faster image-array operations pixel shading often used bump mapping adds texture make object look shiny dull rough even round extruded introduction geforce 8 series produced nvidia new generic stream processing unit gpus became generalized computing device today parallel gpus begun making computational inroads cpu subfield research dubbed gpu computing gpgpu general purpose computing gpu found way fields diverse machine learning oil exploration scientific image processing linear algebra statistics 3d reconstruction even stock options pricing determination gpgpu time precursor call compute shaders e.g cuda opencl directcompute actually abused hardware degree treating data passed algorithms texture maps executing algorithms drawing triangle quad appropriate pixel shader obviously entails overheads since involve units like scan converter n't really needed even care triangles except invoke pixel shader years energy consumption gpus increased manage several techniques proposed nvidia cuda platform first introduced 2007 earliest widely adopted programming model gpu computing recently opencl become broadly supported opencl open standard defined khronos group allows development code gpus cpus emphasis portability opencl solutions supported intel amd nvidia arm according recent report evan data opencl gpgpu development platform widely used developers us asia pacific 2010 nvidia began partnership audi power cars dashboards tegra gpus powering cars dashboard offering increased functionality cars navigation entertainment systems advancements gpu technology cars helped push self-driving technology amd radeon hd 6000 series cards released 2010 2011 amd released 6000m series discrete gpus used mobile devices kepler line graphics cards nvidia came 2012 used nvidia 600 700 series cards new feature new gpu microarchitecture included gpu boost technology adjusts clock-speed video card increase decrease according power draw kepler microarchitecture manufactured 28 nm process ps4 xbox one released 2013 use gpus based amd radeon hd 7850 7790 nvidia kepler line gpus followed maxwell line manufactured process 28 nm chips nvidia manufactured tsmc taiwan semiconductor manufacturing company manufacturing using 28 nm process time compared 40 nm technology past new manufacturing process allowed 20 percent boost performance drawing less power virtual reality headsets high system requirements vr headset manufacturers recommended gtx 970 r9 290x better time release pascal next generation consumer graphics cards nvidia released 2016 geforce 10 series cards generation graphics cards made using 16 nm manufacturing process improves upon previous microarchitectures nvidia released one non-consumer card new volta architecture titan v. changes titan xp pascal high-end card include increase number cuda cores addition tensor cores hbm2 tensor cores cores specially designed deep learning high-bandwidth memory on-die stacked lower-clocked memory offers extremely wide memory bus useful titan v intended purpose emphasize titan v gaming card nvidia removed geforce gtx suffix adds consumer gaming cards new generation rtx turing gpus unveiled august 20 2018 add ray-tracing cores gpus improving performance lighting effects polaris 11 polaris 10 gpus amd fabricated 14-nanometer process release results substantial increase performance per watt amd video cards amd also released vega gpus series high end market competitor nvidia high end pascal cards also featuring hbm2 like titan v. many companies produced gpus number brand names 2009 intel nvidia amd/ati market share leaders 49.4 27.8 20.6 market share respectively however numbers include intel integrated graphics solutions gpus counting nvidia amd control nearly 100 market 2018 respective market shares 66 33 addition s3 graphics matrox produce gpus modern smartphones also using mostly adreno gpus qualcomm powervr gpus imagination technologies mali gpus arm modern gpus use transistors calculations related 3d computer graphics addition 3d hardware today gpus include basic 2d acceleration framebuffer capabilities usually vga compatibility mode newer cards like amd/ati hd5000-hd7000 even lack 2d acceleration emulated 3d hardware gpus initially used accelerate memory-intensive work texture mapping rendering polygons later adding units accelerate geometric calculations rotation translation vertices different coordinate systems recent developments gpus include support programmable shaders manipulate vertices textures many operations supported cpus oversampling interpolation techniques reduce aliasing high-precision color spaces computations involve matrix vector operations engineers scientists increasingly studied use gpus non-graphical calculations especially suited embarrassingly parallel problems emergence deep learning importance gpus increased research done indigo found training deep learning neural networks gpus 250 times faster cpus explosive growth deep learning recent years attributed emergence general purpose gpus level competition area asics prominently tensor processing unit tpu made google however require changes existing code gpus still popular gpus made since 1995 support yuv color space hardware overlays important digital video playback many gpus made since 2000 also support mpeg primitives motion compensation idct process hardware accelerated video decoding portions video decoding process video post-processing offloaded gpu hardware commonly referred gpu accelerated video decoding gpu assisted video decoding gpu hardware accelerated video decoding gpu hardware assisted video decoding recent graphics cards even decode high-definition video card offloading central processing unit common apis gpu accelerated video decoding dxva microsoft windows operating system vdpau vaapi xvmc xvba linux-based unix-like operating systems except xvmc capable decoding videos encoded mpeg-1 mpeg-2 mpeg-4 asp mpeg-4 part 2 mpeg-4 avc h.264 divx 6 vc-1 wmv3/wmv9 xvid opendivx divx 4 divx 5 codecs xvmc capable decoding mpeg-1 mpeg-2 video decoding processes accelerated today modern gpu hardware personal computers two main forms gpus many synonyms gpus designed specific usage real-time 3d graphics mass calculations gpus powerful class typically interface motherboard means expansion slot pci express pcie accelerated graphics port agp usually replaced upgraded relative ease assuming motherboard capable supporting upgrade graphics cards still use peripheral component interconnect pci slots bandwidth limited generally used pcie agp slot available dedicated gpu necessarily removable necessarily interface motherboard standard fashion term dedicated refers fact dedicated graphics cards ram dedicated card use fact dedicated gpus removable ram usually specially selected expected serial workload graphics card see gddr sometimes systems dedicated discrete gpus called dis systems opposed uma systems see next section dedicated gpus portable computers commonly interfaced non-standard often proprietary slot due size weight constraints ports may still considered pcie agp terms logical host interface even physically interchangeable counterparts technologies sli nvidia crossfire amd allow multiple gpus draw images simultaneously single screen increasing processing power available graphics integrated graphics processing unit igpu integrated graphics shared graphics solutions integrated graphics processors igp unified memory architecture uma utilize portion computer system ram rather dedicated graphics memory igps integrated onto motherboard part chipset die cpu like amd apu intel hd graphics certain motherboards amd igps use dedicated sideport memory separate fixed block high performance memory dedicated use gpu early 2007 computers integrated graphics account 90 pc shipments less costly implement dedicated graphics processing tend less capable historically integrated processing often considered unfit play 3d games run graphically intensive programs could run less intensive programs adobe flash examples igps would offerings sis via circa 2004 however modern integrated graphics processors amd accelerated processing unit intel hd graphics capable handling 2d graphics low stress 3d graphics gpu extremely memory intensive integrated processing may find competing cpu relatively slow system ram minimal dedicated video memory igps 29.856 gb/s memory bandwidth system ram whereas graphics card may 264 gb/s bandwidth ram gpu core memory bus bandwidth limit performance gpu though multi-channel memory mitigate deficiency older integrated graphics chipsets lacked hardware transform lighting newer ones include newer class gpus competes integrated graphics low-end desktop notebook markets common implementations ati hypermemory nvidia turbocache hybrid graphics cards somewhat expensive integrated graphics much less expensive dedicated graphics cards share memory system small dedicated memory cache make high latency system ram technologies within pci express make possible solutions sometimes advertised much 768mb ram refers much shared system memory becoming increasingly common use general purpose graphics processing unit gpgpu modified form stream processor vector processor running compute kernels concept turns massive computational power modern graphics accelerator shader pipeline general-purpose computing power opposed hard wired solely graphical operations certain applications requiring massive vector operations yield several orders magnitude higher performance conventional cpu two largest discrete see dedicated graphics cards gpu designers amd nvidia beginning pursue approach array applications nvidia amd teamed stanford university create gpu-based client folding home distributed computing project protein folding calculations certain circumstances gpu calculates forty times faster conventional cpus traditionally used applications gpgpu used many types embarrassingly parallel tasks including ray tracing generally suited high-throughput type computations exhibit data-parallelism exploit wide vector width simd architecture gpu furthermore gpu-based high performance computers starting play significant role large-scale modelling three 10 powerful supercomputers world take advantage gpu acceleration gpu supports api extensions c programming language opencl openmp furthermore gpu vendor introduced api works cards amd app sdk cuda amd nvidia respectively technologies allow specified functions called compute kernels normal c program run gpu stream processors makes possible c programs take advantage gpu ability operate large buffers parallel still using cpu appropriate cuda also first api allow cpu-based applications directly access resources gpu general purpose computing without limitations using graphics api since 2005 interest using performance offered gpus evolutionary computation general accelerating fitness evaluation genetic programming particular approaches compile linear tree programs host pc transfer executable gpu run typically performance advantage obtained running single active program simultaneously many example problems parallel using gpu simd architecture however substantial acceleration also obtained compiling programs instead transferring gpu interpreted acceleration obtained either interpreting multiple programs simultaneously simultaneously running multiple example problems combinations modern gpu readily simultaneously interpret hundreds thousands small programs modern workstation gpus nvidia quadro workstation cards using volta turing architectures feature dedicating processing cores tensor-based deep learning applications nvidia current series gpus cores called tensor cores gpus usually significant flops performance increases utilizing 4x4 matrix multiplication division resulting hardware performance 128 tflops applications tensor cores also supposed appear consumer cards running turing architecture possibly navi series consumer cards amd external gpu graphics processor located outside housing computer external graphics processors sometimes used laptop computers laptops might substantial amount ram sufficiently powerful central processing unit cpu often lack powerful graphics processor instead less powerful energy-efficient on-board graphics chip on-board graphics chips often powerful enough playing latest games graphically intensive tasks editing video therefore desirable able attach gpu external bus notebook pci express bus commonly used purpose port may example expresscard mpcie port pcie \u00d71 5 2.5 gbit/s respectively thunderbolt 1 2 3 port pcie \u00d74 10 20 40 gbit/s respectively ports available certain notebook systems official vendor support external gpus gained traction recently one notable milestone apple \u2019 decision officially support external gpus mac os high sierra 10.13.4 also several major hardware vendors hp alienware razer releasing thunderbolt 3 egpu enclosures support continued fuel egpu implementations enthusiasts 2013 438.3 million gpus shipped globally forecast 2014 414.2 million", + "neighbors": [ + 24, + 51, + 71, + 75, + 76, + 85, + 86, + 105, + 123, + 127, + 130, + 134, + 193, + 206, + 208, + 210, + 211, + 212, + 214, + 224, + 227, + 230, + 268, + 270, + 271, + 282, + 306, + 314, + 331, + 335, + 346, + 352, + 355, + 359, + 379, + 388, + 395, + 429, + 435, + 445, + 457, + 460, + 481, + 484, + 508, + 589, + 591, + 607, + 634, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 834, + 837, + 846, + 853, + 868, + 893, + 907, + 917, + 927, + 937, + 946, + 956, + 961, + 972, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1019, + 1044, + 1052, + 1081, + 1088, + 1111, + 1113, + 1125, + 1138, + 1159, + 1174, + 1188, + 1193, + 1196, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1287, + 1290, + 1310, + 1324, + 1372, + 1373, + 1384, + 1398, + 1469, + 1503, + 1505, + 1507, + 1518, + 1521, + 1525, + 1549, + 1557, + 1558, + 1589, + 1591, + 1608, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1504, + "label": 4, + "text": "Power_virus:power virus power virus computer program executes specific machine code reach maximum cpu power dissipation thermal energy output central processing units computer cooling apparatus designed dissipate power thermal design power rather maximum power power virus could cause system overheat logic stop processor may cause permanent physical damage power viruses malicious often suites test software used integration testing thermal testing computer components design phase product product benchmarking stability test applications similar programs effect power viruses high cpu usage stay user control used testing cpus example overclocking spinlock poorly written program may cause similar symptoms lasts sufficiently long different micro-architectures typically require different machine code hit maximum power examples machine code appear distributed cpu reference materials", + "neighbors": [ + 270, + 1090 + ], + "mask": "Test" + }, + { + "node_id": 1505, + "label": 3, + "text": "Explicitly_parallel_instruction_computing:explicitly parallel instruction computing explicitly parallel instruction computing epic term coined 1997 hp\u2013intel alliance describe computing paradigm researchers investigating since early 1980s paradigm also called independence architectures basis intel hp development intel itanium architecture hp later asserted epic merely old term itanium architecture epic permits microprocessors execute software instructions parallel using compiler rather complex on-die circuitry control parallel instruction execution intended allow simple performance scaling without resorting higher clock frequencies 1989 researchers hp recognized reduced instruction set computer risc architectures reaching limit one instruction per cycle began investigation new architecture later named epic basis research vliw multiple operations encoded every instruction processed multiple execution units one goal epic move complexity instruction scheduling cpu hardware software compiler instruction scheduling statically help trace feedback information eliminates need complex scheduling circuitry cpu frees space power functions including additional execution resources equally important goal exploit instruction level parallelism ilp using compiler find exploit additional opportunities parallel execution vliw least original forms several short-comings precluded becoming mainstream epic architecture evolved vliw architecture retained many concepts superscalar architecture epic architectures add several features get around deficiencies vliw epic architecture also includes grab-bag architectural concepts increase ilp itanium architecture also added rotating register files tool useful software pipelining since avoids manually unroll rename registers investigations epic architectures directly tied development itanium architecture", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 292, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 486, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 755, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1263, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1507, + 1518, + 1519, + 1523, + 1525, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1506, + "label": 2, + "text": "Access_token:access token computer systems access token contains security credentials login session identifies user user groups user privileges cases particular application typically one may asked enter access token example 40 character long gibberish rather usual password therefore kept secret like password access token object encapsulating security identity process thread token used make security decisions store tamper-proof information system entity token generally used represent security information capable holding additional free-form data attached token created tokens duplicated without special privilege example create new token lower levels access rights restrict access launched application access token used windows process thread tries interact objects security descriptors securable objects windows access token represented system object type codice_1 access token generated logon service user logs system credentials provided user authenticated authentication database authentication database contains credential information required construct initial token logon session including user id primary group id groups part information token attached initial process created user session inherited subsequent processes created initial process whenever process opens handle resource access control enabled windows reconciles data target object security descriptor contents current effective access token result access check evaluation indication whether access allowed operations read write/modify etc calling application allowed perform two types tokens available token composed various fields including", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 278, + 295, + 312, + 326, + 344, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 763, + 791, + 801, + 864, + 865, + 920, + 989, + 1025, + 1092, + 1098, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1531, + 1533, + 1545, + 1547, + 1561, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1507, + "label": 3, + "text": "Multi-core_processor:multi-core processor multi-core processor computer processor integrated circuit two separate processing units called cores reads executes program instructions computer several processors instructions ordinary cpu instructions add move data branch single processor run instructions separate cores time increasing overall speed programs support multithreading parallel computing techniques manufacturers typically integrate cores onto single integrated circuit die known chip multiprocessor cmp onto multiple dies single chip package microprocessors currently used almost personal computers multi-core multi-core processor implements multiprocessing single physical package designers may couple cores multi-core device tightly loosely example cores may may share caches may implement message passing shared-memory inter-core communication methods common network topologies interconnect cores include bus ring two-dimensional mesh crossbar homogeneous multi-core systems include identical cores heterogeneous multi-core systems cores identical e.g big.little heterogeneous cores share instruction set amd accelerated processing units cores n't even share instruction set single-processor systems cores multi-core systems may implement architectures vliw superscalar vector multithreading multi-core processors widely used across many application domains including general-purpose embedded network digital signal processing dsp graphics gpu improvement performance gained use multi-core processor depends much software algorithms used implementation particular possible gains limited fraction software run parallel simultaneously multiple cores effect described amdahl law best case so-called embarrassingly parallel problems may realize speedup factors near number cores even problem split enough fit within core cache avoiding use much slower main-system memory applications however accelerated much unless programmers invest prohibitive amount effort re-factoring whole problem parallelization software significant ongoing topic research terms multi-core dual-core commonly refer sort central processing unit cpu sometimes also applied digital signal processors dsp system chip soc terms generally used refer multi-core microprocessors manufactured integrated circuit die separate microprocessor dies package generally referred another name multi-chip module article uses terms multi-core dual-core cpus manufactured integrated circuit unless otherwise noted contrast multi-core systems term multi-cpu refers multiple physically separate processing-units often contain special circuitry facilitate communication terms many-core massively multi-core sometimes used describe multi-core architectures especially high number cores tens thousands systems use many soft microprocessor cores placed single fpga core considered semiconductor intellectual property core well cpu core manufacturing technology improves reducing size individual gates physical limits semiconductor-based microelectronics become major design concern physical limitations cause significant heat dissipation data synchronization problems various methods used improve cpu performance instruction-level parallelism ilp methods superscalar pipelining suitable many applications inefficient others contain difficult-to-predict code many applications better suited thread-level parallelism tlp methods multiple independent cpus commonly used increase system overall tlp combination increased available space due refined manufacturing processes demand increased tlp led development multi-core cpus several business motives drive development multi-core architectures decades possible improve performance cpu shrinking area integrated circuit ic reduced cost per device ic alternatively circuit area transistors could used design increased functionality especially complex instruction set computing cisc architectures clock rates also increased orders magnitude decades late 20th century several megahertz 1980s several gigahertz early 2000s rate clock speed improvements slowed increased use parallel computing form multi-core processors pursued improve overall processing performance multiple cores used cpu chip could lead better sales cpu chips two cores example intel produced 48-core processor research cloud computing core x86 architecture since computer manufacturers long implemented symmetric multiprocessing smp designs using discrete cpus issues regarding implementing multi-core processor architecture supporting software well known additionally order continue delivering regular performance improvements general-purpose processors manufacturers intel amd turned multi-core designs sacrificing lower manufacturing-costs higher performance applications systems multi-core architectures developed alternatives especially strong contender established markets integration peripheral functions chip proximity multiple cpu cores die allows cache coherency circuitry operate much higher clock rate possible signals travel off-chip combining equivalent cpus single die significantly improves performance cache snoop alternative bus snooping operations put simply means signals different cpus travel shorter distances therefore signals degrade less higher-quality signals allow data sent given time period since individual signals shorter need repeated often assuming die physically fit package multi-core cpu designs require much less printed circuit board pcb space multi-chip smp designs also dual-core processor uses slightly less power two coupled single-core processors principally decreased power required drive signals external chip furthermore cores share circuitry like l2 cache interface front-side bus fsb terms competing technologies available silicon die area multi-core design make use proven cpu core library designs produce product lower risk design error devising new wider-core design also adding cache suffers diminishing returns multi-core chips also allow higher performance lower energy big factor mobile devices operate batteries since core multi-core cpu generally energy-efficient chip becomes efficient single large monolithic core allows higher performance less energy challenge however additional overhead writing parallel code maximizing usage computing resources provided multi-core processors requires adjustments operating system os support existing application software also ability multi-core processors increase application performance depends use multiple threads within applications integration multi-core chip lower chip production yields also difficult manage thermally lower-density single-core designs intel partially countered first problem creating quad-core designs combining two dual-core ones single die unified cache hence two working dual-core dies used opposed producing four cores single die requiring four work produce quad-core cpu architectural point view ultimately single cpu designs may make better use silicon surface area multiprocessing cores development commitment architecture may carry risk obsolescence finally raw processing power constraint system performance two processing cores sharing system bus memory bandwidth limits real-world performance advantage 2009 report dr jun ni showed single core close memory-bandwidth limited going dual-core might give 30 70 improvement memory bandwidth problem 90 improvement expected however amdahl law makes claim dubious would possible application used two cpus end running faster single-core one communication cpus limiting factor would count 100 improvement trend processor development towards ever-increasing number cores processors hundreds even thousands cores become theoretically possible addition multi-core chips mixed simultaneous multithreading memory-on-chip special-purpose heterogeneous asymmetric cores promise performance efficiency gains especially processing multimedia recognition networking applications example big.little core includes high-performance core called 'big low-power core called 'little also trend towards improving energy-efficiency focusing performance-per-watt advanced fine-grain ultra fine-grain power management dynamic voltage frequency scaling i.e laptop computers portable media players chips designed outset large number cores rather evolved single core designs sometimes referred manycore designs emphasising qualitative differences composition balance cores multi-core architecture show great variety architectures use one core design repeated consistently homogeneous others use mixture different cores optimized different heterogeneous role article cpu designers debate multi-core future rick merritt ee times 2008 includes comments outdated version anti-virus application may create new thread scan process gui thread waits commands user e.g cancel scan cases multi-core architecture little benefit application due single thread heavy lifting inability balance work evenly across multiple cores programming truly multithreaded code often requires complex co-ordination threads easily introduce subtle difficult-to-find bugs due interweaving processing data shared threads see thread-safety consequently code much difficult debug single-threaded code breaks perceived lack motivation writing consumer-level threaded applications relative rarity consumer-level demand maximum use computer hardware although threaded applications incur little additional performance penalty single-processor machines extra overhead development difficult justify due preponderance single-processor machines also serial tasks like decoding entropy encoding algorithms used video codecs impossible parallelize result generated used help create next result entropy decoding algorithm given increasing emphasis multi-core chip design stemming grave thermal power consumption problems posed significant increase processor clock speeds extent software multithreaded take advantage new chips likely single greatest constraint computer performance future developers unable design software fully exploit resources provided multiple cores ultimately reach insurmountable performance ceiling telecommunications market one first needed new design parallel datapath packet processing quick adoption multiple-core processors datapath control plane mpus going replace traditional network processors based proprietary microcode picocode parallel programming techniques benefit multiple cores directly existing parallel programming models cilk plus openmp openhmpp fastflow skandium mpi erlang used multi-core platforms intel introduced new abstraction c++ parallelism called tbb research efforts include codeplay sieve system cray chapel sun fortress ibm x10 multi-core processing also affected ability modern computational software development developers programming newer languages might find modern languages support multi-core functionality requires use numerical libraries access code written languages like c fortran perform math computations faster newer languages like c intel mkl amd acml written native languages take advantage multi-core processing balancing application workload across processors problematic especially different performance characteristics different conceptual models deal problem example using coordination language program building blocks programming libraries higher-order functions block different native implementation processor type users simply program using abstractions intelligent compiler chooses best implementation based context managing concurrency acquires central role developing parallel applications basic steps designing parallel applications hand server side multi-core processors ideal allow many users connect site simultaneously independent threads execution allows web servers application servers much better throughput vendors may license software per processor give rise ambiguity processor may consist either single core combination cores embedded computing operates area processor technology distinct mainstream pcs technological drives towards multi-core apply indeed many cases application natural fit multi-core technologies task easily partitioned different processors addition embedded software typically developed specific hardware release making issues software portability legacy code supporting independent developers less critical case pc enterprise computing result easier developers adopt new technologies result greater variety multi-core processing architectures suppliers multi-core network processors become mainstream companies freescale semiconductor cavium networks wintegra broadcom manufacturing products eight processors system developer key challenge exploit cores devices achieve maximum networking performance system level despite performance limitations inherent symmetric multiprocessing smp operating system companies 6wind provide portable packet processing software designed networking data plane runs fast path environment outside operating system network device digital signal processing trend applies texas instruments three-core tms320c6488 four-core tms320c5441 freescale four-core msc8144 six-core msc8156 stated working eight-core successors newer entries include storm-1 family stream processors inc 40 80 general purpose alus per chip programmable c simd engine picochip three-hundred processors single die focused communication applications heterogeneous computing system uses one kind processor cores multi-core solutions becoming common xilinx zynq ultrascale+ mpsoc quad-core arm cortex-a53 dual-core arm cortex-r5 software solutions openamp used help inter processor communication mobile devices may use arm big.little architecture research development multicore processors often compares many options benchmarks developed help evaluations existing benchmarks include splash-2 parsec cosmic heterogeneous systems", + "neighbors": [ + 51, + 61, + 71, + 76, + 85, + 86, + 105, + 112, + 123, + 127, + 188, + 193, + 206, + 210, + 212, + 216, + 224, + 227, + 230, + 269, + 270, + 271, + 272, + 280, + 306, + 314, + 326, + 331, + 335, + 340, + 352, + 362, + 388, + 445, + 457, + 460, + 465, + 486, + 508, + 511, + 529, + 579, + 589, + 607, + 611, + 634, + 643, + 647, + 659, + 661, + 719, + 752, + 755, + 776, + 803, + 821, + 837, + 846, + 847, + 876, + 893, + 907, + 917, + 927, + 937, + 946, + 956, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1099, + 1111, + 1113, + 1125, + 1138, + 1174, + 1176, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1373, + 1398, + 1469, + 1499, + 1503, + 1505, + 1518, + 1519, + 1523, + 1525, + 1557, + 1586, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1508, + "label": 9, + "text": "Comparison_of_C_Sharp_and_Java:comparison c sharp java article compares two programming languages c java focus article mainly languages features comparison necessarily also consider features platforms libraries detailed comparison platforms please see comparison java .net platforms c java similar languages typed statically strongly manifestly object-oriented designed semi-interpretation runtime just-in-time compilation curly brace languages like c c++ languages statically typed class-based object orientation java primitive types special object-oriented could defined using language also share common ancestor reference types java reference types derive common root type c unified type system types besides unsafe pointers ultimately derive common root type consequently types implement methods root type extension methods defined object type apply types even primitive int literals delegates allows c unlike java support objects encapsulation reference types java compound types synonymous reference types methods defined type unless also class reference type c concepts encapsulation methods decoupled reference requirement type support methods encapsulation without reference type reference types support virtual methods specialization however languages support many built-in types copied passed value rather reference java calls types primitive types called simple types c primitive/simple types typically native support underlying processor architecture c simple types implement several interfaces consequently offer many methods directly instances types even literals c type names also merely aliases common language runtime clr types c system.int64 type exactly type long type difference former canonical .net name latter c alias java offer methods directly primitive types instead methods operate primitive values offered companion primitive wrapper classes fixed set wrapper classes exist wraps one fixed set primitive types example java long type reference type wraps primitive long type type however java c support signed integers bit widths 8 16 32 64 bits use name/aliases types except 8-bit integer called byte java sbyte signed byte c c supports unsigned addition signed integer types unsigned types byte ushort uint ulong 8 16 32 64 bit widths respectively unsigned arithmetic operating types supported well example adding two unsigned integers uints still yields uint result long signed integer java feature unsigned integer types particular java lacks primitive type unsigned byte instead java byte type sign extended common source bugs confusion unsigned integers left java deliberately james gosling believed programmers would understand unsigned arithmetic works.in programming language design one standard problems language grows complex nobody understand one little experiments tried asking people rules unsigned arithmetic c. turns nobody understands unsigned arithmetic c works obvious things people understand many people n't understand c type literal notation high-precision 28 decimal digits decimal arithmetic appropriate financial monetary calculations contrary float double data types decimal fractional numbers 0.1 represented exactly decimal representation float double representations numbers often non-terminating binary expansions making representations prone round-off errors java lacks built-in type java library feature arbitrary precision decimal type considered language type support usual arithmetic operators rather reference type must manipulated using type methods see arbitrary-size/precision numbers languages offer library-defined arbitrary-precision arithmetic types arbitrary-size integers decimal point calculations java data type arbitrary precision decimal point calculations c type working complex numbers languages number operations performed advanced numeric types limited compared built-in ieee 754 floating point types instance none arbitrary-size types support square root logarithms c allows library-defined types integrated existing types operators using custom implicit/explicit conversions operator overloading see example section integration library-defined types languages feature native char character datatype simple type although char type used bit-wise operators performed promoting char value integer value operation thus result bitwise operation numeric type character languages languages treat strings immutable objects reference type languages type contains several methods manipulate strings parse format etc languages regular expressions considered external feature implemented separate classes languages libraries define classes working dates calendars different cultures java java.util.date mutable reference type whereas c system.datetime struct value type c additionally defines timespan type working time periods languages support date time arithmetic according different cultures c allows programmer create user-defined value types using struct keyword unlike classes like standard primitives value types passed assigned value rather reference also part object either field boxed stored array without memory indirection normally exists class types value types notion null value used arrays without initialization always come implicit default constructor essentially fills struct memory space zeroes programmer define additional constructors one arguments value types virtual method tables fixed memory footprint implicitly sealed however value types frequently implement interfaces example built-in integer types implement several interfaces apart built-in primitive types java include concept value types languages define enumerations implemented fundamentally different ways enumerations one area tools designed automatically translate code two languages java c converters fail c implemented enumerations manner similar c wrappers around bit-flags implemented primitive integral types int byte short etc. performance benefits improves interaction c/c++ compiled code provides fewer features lead bugs low-level value types directly cast enumeration type allowed c language therefore seen syntactic sugar contrast java implements enumerations full featured collection instances requiring memory aiding interaction c/c++ code providing additional features reflection intrinsic behavior implementation language described table c java programmers use enumerations switch statement without conversion string primitive integer type however c disallows implicit fall-through unless case statement contain code common cause hard-to-find bugs fall-through must explicitly declared using goto statement c implements object-oriented method pointers form delegates delegate special type capture type-safe reference method reference stored delegate-type variable passed method delegate parameter later invocation c delegates support covariance contravariance hold reference signature-compatible static method instance method anonymous method lambda expression delegates confused closures inline functions concepts related reference closure/inline function must captured delegate reference useful delegate always reference inline function also reference existing static instance methods delegates form basis c events confused either delegates deliberately left java considered unnecessary detrimental language potential performance issues instead alternative mechanisms used wrapper pattern resembles delegates c allows client access one client-defined methods known interface one mechanism another use adapter objects using inner classes designers java argued better solution bound method references see also example c delegates equivalent java constructs c allows value/primitive/simple types lifted allow special null value addition type native values type lifted adding suffix type name equivalent using nullable generic type type lifted conversions implicitly defined convert values base lifted type lifted type compared null tested hasvalue also lifted operators implicitly automatically defined based non-lifted base \u2014 exception boolean operators \u2014 null argument propagate result java support type lifting concept built-in primitive types corresponding wrapper types support null value virtue reference types classes according java spec attempt dereference null reference must result exception thrown run-time specifically nullpointerexception would make sense dereference otherwise definition points object memory also applies attempting unbox variable wrapper type evaluates null program throw exception object unboxed thus boxed value take part subsequent computation following example illustrates different behavior c lifted*operator propagates null value operand java unboxing null reference throws exception c lifted operators defined propagate null unconditionally one operands null specifically boolean operators lifted support ternary logic thus keeping impedance sql java boolean operators support ternary logic implemented base class library c features late bound dynamic type supports no-reflection dynamic invocation interoperability dynamic languages ad-hoc binding example document object models dynamic type resolves member access dynamically runtime opposed statically/virtual compile time member lookup mechanism extensible traditional reflection fall-back mechanism several use cases dynamic type c java support late-bound type use cases c dynamic type different corresponding constructs java see also example interoperability dynamic languages java precludes pointers pointer-arithmetic within java runtime environment java language designers reasoned pointers one main features enable programmers put bugs code chose support java allow directly passing receiving objects/structures to/from underlying operating system thus need model objects/structures specific memory layout layouts frequently would involve pointers java communication underlying operating system instead based upon java native interface jni communication with/adaptation underlying operating system handled external glue layer c allow use pointers corresponding pointer arithmetic c language designers concerns pointers could potentially used bypass strict rules object access thus c default also precludes pointers however pointers needed calling many native functions pointers allowed explicit unsafe mode code blocks methods use pointers must marked unsafe keyword able use pointers compiler requires /unsafe switch allow compiling code assemblies compiled using /unsafe switch marked may execute explicitly trusted allows using pointers pointer arithmetic directly pass receive objects to/from operating system native apis using native memory layout objects also isolating potentially unsafe code specifically trusted assemblies languages references central concept instances classes reference directly evident language syntax per se languages support concept weak references instance referenced weak references eligible garbage collection references languages feature exposed associated libraries even though really core runtime feature along weak references java soft references much like weak references jvm deallocate softly-referenced objects memory needed arrays collections concepts featured languages syntax used declare access arrays identical except c added syntax declaring manipulating multidimensional arrays multidimensional arrays cases increase performance increased locality one pointer dereference instead one every dimension array case jagged arrays however since array element access multidimensional array requires multiplication/shift two dimensions advantage random access scenarios another difference entire multidimensional array allocated single application operator new jagged arrays require loops allocations every dimension however java provides syntactic construct allocating jagged array regular lengths loops multiple allocations performed virtual machine need explicit source level languages feature extensive set collection types includes various ordered unordered types lists maps/dictionaries sets etc java also supports syntax c/c++ languages allow automatic boxing unboxing i.e allow implicit casting primitive types corresponding reference types c primitive types subtypes object type java true given primitive type corresponding wrapper type specific relationship except autoboxing unboxing act syntactic sugar interchanging done intentionally maintain backward compatibility prior versions java automatic casting allowed programmer worked two separate sets types primitive types wrapper reference type hierarchy difference following consequences first c primitive types define methods override object tostring method java task accomplished primitive wrapper classes secondly java extra cast needed whenever one tries directly dereference primitive value boxed automatically expression integer 42 .tostring convert integer literal string java 42.tostring performs operation c latter one instance call primitive value 42 former one instance call object type java.lang.integer finally another difference java makes heavy use boxed types generics see languages considered curly brace languages c/c++ family overall syntaxes languages similar syntax statement expression level almost identical obvious inspiration c/c++ tradition type definition level classes interfaces minor differences exist java explicit extending classes implementing interfaces c infers kind types new class/interface derives c supports features java extent also evident syntax specifies keywords grammar rules java languages evolved language designers languages faced situations wanted extend languages new keywords syntax new keywords particular may break existing code source level i.e older code may longer compile presented compiler later version language language designers keen avoid regressions designers two languages following different paths addressing problem java language designers avoided new keywords much possible preferring instead introduce new syntactic constructs legal reuse existing keywords new contexts way n't jeopardize backward compatibility example former found loop extended accept iterable types example latter found extends especially super keywords reused specifying type bounds generics introduced java 1.5 one time java 1.4 new keyword assert introduced reserved keyword potential render previously valid code invalid instance code used assert identifier designers chose address problem four-step solution 1 introducing compiler switch indicates java 1.4 later used 2 marking assert keyword compiling java 1.4 later 3 defaulting 1.3 avoid rendering previous non 1.4 aware code invalid 4 issue warnings keyword used java 1.3 mode order allow developers change code c language designers introduced several new keywords since first version however instead defining keywords global keywords define context sensitive keywords means even introduced among others partial yield keywords c 2.0 use words identifiers still valid clash possible use keyword use identifier given context thus present c syntax fully backward compatible source code written previous version without specifying language version used c java designed ground object-oriented languages using dynamic dispatch syntax similar c++ c++ turn derives c neither language superset c c++ however c allows class definition split across several source files using feature called partial classes part must marked keyword partial parts must presented compiler part single compilation parts reference members parts parts implement interfaces one part define base class feature useful code generation scenarios user interface ui design code generator supply one part developer another part compiled together developer thus edit part without risk code generator overwriting code later time unlike class extension mechanism partial class allows circular dependencies among parts guaranteed resolved compile time java corresponding concept languages allow inner classes class defined lexically inside another class however language inner classes rather different semantics java unless inner class declared static reference instance inner class carries reference outer class result code inner class access static non-static members outer class create instance non-static inner class instance embracing outer class must named done via new new-operator introduced jdk 1.3 outerclassinstance.new outer.innerclass done class reference instance outer class c inner class conceptually normal class sense outer class acts namespace thus code inner class access non-static members outer class unless explicit reference instance outer class programmers declare inner class private allow outer class access java provides another feature called local classes anonymous classes defined within method body generally used implement interface one two methods typically event handlers however also used override virtual methods superclass methods local classes access outer method local variables declared final c satisfies use-cases providing anonymous delegates see event handling c also provides feature called anonymous types/classes rather different java concept name allows programmer instantiate class providing set names properties class expression initialize types properties inferred types expressions implicitly-declared classes derived directly object c multicast-delegates used events events provide support event-driven programming implementation observer pattern support specific syntax define events classes operators register unregister combine event handlers see information events implemented java operator overloading user-defined casts separate features aim allow new types become first-class citizens type system using features c types complex decimal integrated usual operators like addition multiplication work new types unlike c++ c restrict use operator overloading prohibiting operators new || variations compound statements like += compound operators call overloaded simple operators like -= calling java include operator overloading custom conversions order prevent abuse feature keep language simple c also includes indexers considered special case operator overloading like c++ operator parameterized get/set properties indexer property named uses one parameters indexes indices objects type java include indexers common java pattern involves writing explicit getters setters c programmer would use indexer c java object fields initialized either variable initializers expressions assigned variables defined constructors special subroutines executed object created addition java contains instance initializers anonymous blocks code arguments run explicit implicit call superclass constructor constructor executed c initializes object fields following order creating object fields may applicable e.g object static fields derived fields defined object direct class base field term fields defined one object superclasses note object representation memory contains fields defined class superclasses even fields superclasses defined private guaranteed field initializers take effect constructors called since instance constructor object class superclasses called field initializers called however potential trap object initialization virtual method called base constructor overridden method subclass may reference field defined subclass field may initialized constructor subclass contains field initialization called constructor base class java order initialization follows like c new object created calling specific constructor within constructor first statement may invocation another constructor omitted call argumentless constructor superclass added implicitly compiler otherwise either another overloaded constructor object class called explicitly superclass constructor called former case called constructor call another constructor either object class subclass chain sooner later ends call one constructors superclass another constructor called causes direct invocation superclass constructor forth object class instance variables defined object class initialized even variable initializers explicitly defined variables variables initialized default values note instance variables defined superclasses already initialized point initialized superclass constructor called either constructor code variable initializers performed constructor code implicitly default values java variable initializers executed according textual order source file finally constructor body executed ensures proper order initialization i.e fields base class finish initialization initialization fields object class begins two main potential traps java object initialization first variable initializers expressions contain method calls since methods reference variable defined class method called variable initializer reference variable defined variable initialized since initialization order corresponds textual order variable definitions variable would initialized value prescribed initializer would contain default value another potential trap method overridden derived class called base class constructor lead behavior programmer would expect object derived class created according initialization order body base class constructor executed variable initializers evaluated body derived class constructor executed overridden method called base class constructor however reference variables defined derived class yet initialized values specified initializers set derived class constructor latter issue applies c well less critical form since c methods overridable default languages mainly use garbage collection means reclaiming memory resources rather explicit deallocation memory cases object holds resources different kinds memory file handles graphical resources etc. must notified explicitly application longer uses c java offer interfaces deterministic disposal c java since java 7 feature automatic resource management statements automatically invoke disposal/close methods interfaces using special designator first parameter method c allows method act member method type first parameter extension foreign class purely syntactical extension method must declared static defined within purely static class method must obey member access restriction like method external class thus static methods break object encapsulation extension active within scopes namespace static host class imported since java 8 java similar feature called default methods methods body declared interfaces opposed c extension methods java default methods instance methods interface declare definition default methods classes implement interface optional class define method default definition used instead c extension methods java default methods allow class override default implementation extension/default method respectively languages override achieved defining method class use alternate implementation method c scope rules defines matching method found class takes precedence matching extension method java class declared implement interface default method assumed default methods implementions unless class implements method related partial classes c allows partial methods specified within partial classes partial method intentional declaration method several restrictions signature restrictions ensure definition provided class part method every call safely erased feature allows code provide large number interception points like template method gof design pattern without paying runtime overhead extension points used another class part compile time java corresponding concept methods c non-virtual default must declared virtual explicitly desired java non-static non-private methods virtual virtuality guarantees recent override method always called incurs certain runtime cost invocation invocations normally inlined require indirect call via virtual method table however jvm implementations including oracle reference implementation implement inlining commonly called virtual methods java methods virtual default although sealed using final modifier disallow overriding way let derived classes define new unrelated method name means default java explicitly enabled c new methods may defined derived class name signature base class method called superclass reference object deepest overridden implementation base class method called according specific subclass object referenced cases subclass introduces method name signature method already present base class problems occur java mean method derived class implicitly override method base class even though may intent designers either class mitigate c requires method intended override inherited method override keyword must specified otherwise method hide inherited method keyword absent compiler warning effect issued silenced specifying new keyword avoids problem arise base class extended non-private method i.e inherited part namespace whose signature already use derived class java similar compiler check form override method annotation compulsory absence compilers provide comment method overridden java possible prevent reassignment local variable method parameter using keyword applying keyword primitive type variable causes variable become immutable however applying reference type variable prevents another object assigned prevent data contained object mutated c 7 possible prevent reassignment method parameter using keyword however keyword used local variables java applying parameter prevents parameter reassigned different value still possible mutate data contained object languages support essential feature const-correctness exists c/c++ makes method constant java defines word constant arbitrarily field variables capital-only variables names separated underscore parameter considered constant although may case primitive data type immutable class like c method declared returning ienumerable ienumerator generic versions interfaces implemented using yield syntax form limited compiler-generated continuations drastically reduce code needed traverse generate sequences although code generated compiler instead feature also used implement infinite sequences e.g. sequence fibonacci numbers java equivalent feature instead generators typically defined providing specialized implementation well-known collection iterable interface compute element demand generator used statement must implement interface java.lang.iterable see also example fibonacci sequence c also explicit interface implementation allows class specifically implement methods interface separate class methods provide different implementations two methods name signature inherited two base interfaces either language method property c specified name signature multiple interfaces members clash class designed implements interfaces implementation default implement common method interfaces separate implementations needed methods serve separate purposes return values differ interfaces c explicit interface implementation solve problem though allowing different results method depending current cast object java way solve problem refactoring one interfaces avoid name clashes arguments primitive types e.g int double method passed value java whereas objects passed reference means method operates copies primitives passed instead actual variables contrary actual objects cases changed following example object string changed object class changed c possible enforce reference ref keyword similar c++ sense c. feature c particularly useful one wants create method returns one object java trying return multiple values method unsupported unless wrapper used case named ref java supports checked exceptions along unchecked exceptions c supports unchecked exceptions checked exceptions force programmer either declare exception thrown method catch thrown exception using try-catch clause checked exceptions encourage good programming practice ensuring errors dealt however anders hejlsberg chief c language architect argues extent experiment java shown worthwhile except small example programs one criticism checked exceptions encourage programmers use empty catch block catch exception e silently swallows exceptions rather letting exceptions propagate higher-level exception-handling routine cases however exception chaining applied instead re-throwing exception wrapper exception example object changed access database instead file could caught re-thrown since caller may need know inner workings object however programmers agree stance james gosling others maintain checked exceptions useful misusing caused problems silently catching exceptions possible yes must stated explicitly exception versus unchecked exceptions allow nothing default ignored code must written explicitly ignore also differences two languages treating try-finally statement finally block always executed even try block contains control-passing statements like throw return java may result unexpected behavior try block left return statement value finally block executed afterward also left return statement different value c resolves problem prohibiting control-passing statements like return break finally block common reason using try-finally blocks guard resource managing code thus guaranteeing release precious resources finally block c features using statement syntactic shorthand common scenario dispose method object using always called rather subtle difference moment stack trace created exception thrown java stack trace created moment exception created exception statement always contain constructor stack-trace matter often foo called c hand stack-trace created moment throw executed code exception contain stack-trace first throw-line catching exception two options case exception rethrown throw rethrow original exception original stack throw e would created new stack trace java allows flow control leave finally block try statement regardless way entered cause another control flow statement return terminated mid-execution example code return statement within try block causes control leave thus finally block executed actual return happens however finally block also performs return thus original return caused entered executed method returns 1 rather 0 informally speaking tries return 0 finally returns 1 c allow statements allow control flow leave finally block prematurely except throw particular return allowed goto allowed target label outside finally block continue break allowed nearest enclosing loop outside finally block field generics two languages show superficial syntactical similarity deep underlying differences generics java language-only construction implemented compiler generated classfiles include generic signatures form metadata allowing compiler compile new classes runtime knowledge generic type system generics part jvm instead generics classes methods transformed compiling via process termed type erasure compiler replaces generic types raw version inserts casts/checks appropriately client code type methods used resulting byte code contain references generic types parameters see also generics java language specification intentionally prohibits certain uses generics necessary allow implementing generics type erasure allow migration compatibility c builds support generics virtual execution system i.e. language feature language merely front-end cross-language generics support clr compiling generics verified correctness code generation implement generics deferred class-load time client code code invoking generic methods/properties fully compiled safely assume generics type-safe called reification runtime unique set type parameters generic class/method/delegate encountered first time class loader/verifier synthesize concrete class descriptor generate method implementations generation method implementations reference types considered one type reference types safely share implementations merely purpose implementing code different sets reference types still unique type descriptors method tables merely point code following list illustrates differences java c managing generics exhaustive c allows generics directly primitive types java instead allows use boxed types type parameters e.g. list integer instead list int comes cost since values need boxed/unboxed used need heap-allocated however generic type specialized array type primitive type java example list int allowed several third-party libraries implemented basic collections java backing primitive arrays preserve runtime memory optimization primitive types provide java type erasure design motivated design requirement achieve migration compatibility confused backward compatibility particular original requirement \u2026 clean demonstrable migration path collections apis introduced java 2 platform designed new generic collections passable methods expected one pre-existing collection classes c generics introduced language preserving full backward compatibility preserve full migration compatibility old code pre c 2.0 runs unchanged new generics-aware runtime without recompilation migration compatibility new generic collection classes interfaces developed supplemented non-generic .net 1.x collections rather replacing addition generic collection interfaces new generic collection classes implement non-generic collection interfaces possible prevents use new generic collections pre-existing non-generic aware methods methods coded use collection classes covariance contravariance supported languages java use-site variance allows single generic class declare members using co- contravariance c define-site variance generic interfaces delegates variance unsupported directly classes supported implementation variant interfaces c also use-site covariance support methods delegates closure inline function captures variables lexical scope c supports closures anonymous methods lambda expressions full-featured closure semantics java anonymous inner classes remain preferred way emulate closures java 8 become new standard verbose construction approach also differences compared real closures notably controlled access variables enclosing scopes final members referenced java 8 however introduces lambdas fully inherit current scope fact introduce new scope reference method passed around later execution problem arises method references variables/parameters lexical scope c closures access variable/parameter lexical scope java anonymous inner classes references final members lexical scope allowed thus requiring developer mark variables make available state possibly requiring boxing c java feature special type in-line closures called lambdas anonymous methods signature body name mainly used specify local function-valued arguments calls methods technique mainly associated functional programming c unlike java allows use lambda functions way define special data structures called expression trees whether seen executable function data structure depends compiler type inference type variable parameter assigned cast lambdas expression trees play key roles language integrated query linq c namespaces similar c++ unlike package names java namespace way tied location source file strictly necessary java source file location mirror package directory structure conventional organization languages allow importing classes e.g. import java.util java allowing class referenced using name sometimes classes name exist multiple namespaces packages classes referenced using fully qualified names importing selected classes different names java allows importing single class e.g. import java.util.list c allows importing classes new local name using following syntax using console system.console also allows importing specializations classes form using intlist system.collections.generic.list int languages static import syntax allows using short name static methods/fields class e.g. allowing foo bar foo statically imported another class c static class syntax confused static inner classes java restricts class contain static methods c 3.0 introduces extension methods allow users statically add method type e.g. allowing foo.bar bar imported extension method working type foo sun microsystems java compiler requires source file name must match public class inside c allows multiple public classes file puts restrictions file name c 2.0 later allows splitting class definition several files using partial keyword source code java public class always source file c source code files logical units separation tightly related unlike java c implements conditional compilation using preprocessor directives also provides conditional attribute define methods called given compilation constant defined way assertions provided framework feature method debug.assert evaluated debug constant defined since version 1.4 java provides language feature assertions turned runtime default enabled using -enableassertions -ea switch invoking jvm languages include thread synchronization mechanisms part language syntax .net framework 4.0 new task-based programming model introduced replace existing event-based asynchronous model api based around task task classes tasks composed chained convention every method returns task name postfixed async c 5 set language compiler extensions introduced make easier work task model language extensions included notion async methods await statement make program flow appear synchronous syntactic sugar c compiler generates state-machine handles necessary continuations without developers think java supports threads since jdk 1.0 java offers high versatility running threads often called tasks done implementing functional interface java.lang.runnable interface defining single void no-args method demonstrated following example similar c java higher level mechanism working threads executors execute asynchronous tasks also manage group subprocesses threads executorservices instance handled pool executorservice instance reused hood revenant tasks possible runs many concurrent tasks programmer wants throughout life-cycle application using single executor service instance first thread-example looks like using executors executorservice instance also supports callable interface another single method interface like runnable signature contained method callable returns value way lambda expression must also return value calling method get blocks current thread waits callable completes returning value example web page content adequately support applications field mathematical financial computation several language features exist java strictfp keyword enables strict floating-point calculations region code strict floating-point calculations require even platform offers higher precision calculations intermediate results must converted single/double ensures strict floating-point calculations return exactly result platforms without strict floating-point platform implementation free use higher precision intermediate results calculation c allows implementation given hardware architecture always use higher precision intermediate results available i.e c allow programmer optionally force intermediate results use potential lower precision single/double although java floating-point arithmetic largely based ieee 754 standard binary floating-point arithmetic certain features unsupported even using strictfp modifier exception flags directed roundings abilities mandated ieee standard 754 see criticism java floating point arithmetic c provides built-in decimal type higher precision less range java/c double decimal type 128-bit data type suitable financial monetary calculations decimal type represent values ranging 1.0 \u00d7 10 approximately 7.9 \u00d7 10 28-29 significant digits structure uses c operator overloading decimals manipulated using operators *and like primitive data types types provided java allow arbitrary-precision representation decimal numbers integer numbers respectively java standard library classes deal complex numbers biginteger complex types provided c allow representation manipulation arbitrary-precision integers complex numbers respectively structures use c operator overloading instances manipulated using operators like primitive data types c standard library classes deal arbitrary-precision floating point numbers see software arbitrary-precision arithmetic c help mathematical applications checked unchecked operators allow enabling disabling run-time checking arithmetic overflow region code c language integrated query linq set features designed work together allow in-language querying abilities distinguishing feature c java linq consists following features java native interface jni feature allows java programs call non-java code however jni require code called follow several conventions imposes restrictions types names used means extra adaption layer legacy code java often needed adaption code must coded non-java language often c c++ java native access jna allows easier calling native code requires writing java code comes performance cost addition third party libraries provide java-component object model com bridging e.g. jacob free j-integra com proprietary .net platform invoke p/invoke offers ability allowing calls c microsoft terms unmanaged code metadata attributes programmer control exactly parameters results marshalled thus avoiding external glue code needed equivalent jni java p/invoke allows almost complete access procedural apis win32 posix limited access c++ class libraries addition .net framework also provides .net-com bridge allowing access com components first-class .net objects c also allows programmer disable normal type-checking safety features clr enables use pointer variables using feature programmer must mark code using unsafe keyword jni p/invoke unsafe code equally risky features exposing possible security holes application instability advantage unsafe managed code p/invoke jni allows programmer continue work familiar c environment accomplish tasks otherwise would require calling unmanaged code assembly program library using unsafe code must compiled special switch marked enables runtime environments take special precautions executing potentially harmful code java programming language designed execute java platform via java runtime environment jre java platform includes java virtual machine jvm common set libraries jre originally designed support interpreted execution final compiling option jre environments execute fully least partially compiled programs possibly adaptive optimization java compiler produces java bytecode upon execution bytecode loaded java runtime either interpreted directly compiled machine instructions executed c designed execute common language runtime clr clr designed execute fully compiled code c compiler produces common intermediate language instructions upon execution runtime loads code compiles machine instructions target architecture example illustrating copy text one line time one file another using languages c allows library-defined types integrated existing types operators using custom implicit/explicit conversions operator overloading illustrated following example example illustrates java c used create invoke instance class implemented another programming language deepthought class implemented using ruby programming language represents simple calculator multiply two input values b calculate method invoked addition conventional way java graalvm virtual machine capable run implemented programming language example illustrates fibonacci sequence implemented using two languages c version takes advantage c generator methods java version takes advantage stream interface method references java c examples use k r style code formatting classes methods statements", + "neighbors": [ + 19, + 152, + 249, + 292, + 306, + 347, + 378, + 412, + 520, + 521, + 538, + 594, + 597, + 786, + 790, + 869, + 873, + 1231, + 1311, + 1372, + 1418, + 1477, + 1481, + 1508, + 1621, + 1636 + ], + "mask": "Test" + }, + { + "node_id": 1509, + "label": 2, + "text": "Benjamin_Mako_Hill:benjamin mako hill benjamin mako hill born december 2 1980 free software activist hacker author contributor free software developer part debian ubuntu projects well co-author three technical manuals subject debian gnu/linux 3.1 bible official ubuntu server book official ubuntu book hill assistant professor communication university washington serves member free software foundation board directors hill master degree mit media lab received phd interdepartmental program involving mit sloan school management mit media lab fall 2013 assistant professor department communication university washington also fellow mit center civic media coordinates development software civic organizing worked advisor contractor one laptop per child project speaker gnu project serves board software freedom international organization organizes software freedom day 2006 married mika matsuzaki used mathematically constrained wedding vows marriage ceremony since 1999 hill active member debian served delegate debian project leader founder coordinator debian non-profit debian custom distribution designed fill needs small non-profit organizations addition served board software public interest march 2003 july 2006 serving organisation vice-president august 2004 hill also core developer founding member ubuntu continues active contributor project addition technical responsibilities coordinated construction community around ubuntu project project community manager later ceding role jono bacon ubuntu first year half period worked full-time canonical ltd within project served community council governance board oversees non-technical aspects project october 2011 work included contributing code conduct diversity statement project addition software development hill writes extensively published academic books magazines newsletters online journals slate magazine republished one blog posts author free software project management howto canonical document managing foss projects published academic work foss anthropological sociological management software engineering perspectives written spoken intellectual property copyright collaboration generally also studied sociology community involvement web communities widely published cited projects like scratch wikipedia talked topics publicly well giving keynote address 2008 oscon hill worked several years consultant foss projects specializing coordinating releases software free open software structuring development efforts encourage community involvement spends significant amount time traveling giving talks foss intellectual property primarily europe north america previous current positions hill pursued research full-time graduate researcher mit media laboratory lab worked electronic publishing computing culture groups collaborative writing decision-making software one project selectricity award-winning voting tool received prizes grants mtv cisco fellow harvard berkman center internet society mit center civic media served advisory board wikimedia foundation advisory council open knowledge foundation board free software foundation founding member ubuntu community council 2009 2019 research symbiont award -- general symbiont", + "neighbors": [ + 77, + 134, + 209, + 267, + 275, + 301, + 323, + 327, + 630, + 688, + 716, + 806, + 816, + 825, + 897, + 985, + 992, + 1060, + 1102, + 1123, + 1126, + 1167, + 1180, + 1190, + 1197, + 1214, + 1278, + 1318, + 1361, + 1385, + 1403, + 1413, + 1524, + 1538, + 1558 + ], + "mask": "Test" + }, + { + "node_id": 1510, + "label": 4, + "text": "SMTP_proxy:smtp proxy smtp proxies specialized mail transfer agents mtas similar types proxy servers pass smtp sessions mtas without using store-and-forward approach typical mta smtp proxy receives connection initiates another smtp session destination mta errors status information destination mta passed back sending mta proxy smtp proxies commonly used process filter inbound outbound email traffic smtp proxies often serve initial network-facing layer email system processing smtp connections clients forwarding data second layer mail servers smtp proxies often implement first and/or layer defence inbound anti-spam filtering system analyze messages using spam content filter antivirus program block rate limit connections using dns blacklists reputation system load balance smtp connections prevent overloading mail servers smtp proxies store messages like mail transfer agent mta reject smtp connections message content real-time away need out-of-band non delivery reports ndrs cause backscatter email serious problem internet email system certain smtp proxies implement tcp connection management otherwise known flow control help reduce damage downstream mail servers resulting spikes tcp traffic malicious smtp clients tcp connection management context smtp typically involves bandwidth throttling and/or introducing delays smtp command responses also known tarpitting slowed certain malicious sources smtp traffic spam bots tend give rather continuing deliver full email message network tarpitting challenging implement within email server since smtp connection processed slowly normal often holding precious system resources memory cpu smtp proxies implemented using lighter-weight programming techniques asynchronous io example nginx node.js netty libevent thousands connections juggled using resources much smaller number connections context full-blown store forward email server smtp proxies sometimes inserted sending mail servers local network receiving counterparts internet smtp proxies often used context order filter outgoing spam however applications domain keys identified mail dkim signing also exist smtp proxies come fundamental flavors", + "neighbors": [ + 442, + 473, + 617, + 678, + 1094, + 1171, + 1172, + 1395, + 1552 + ], + "mask": "Test" + }, + { + "node_id": 1511, + "label": 9, + "text": "Intermediate_representation:intermediate representation intermediate representation ir data structure code used internally compiler virtual machine represent source code ir designed conducive processing optimization translation good ir must accurate \u2013 capable representing source code without loss information \u2013 independent particular source target language ir may take one several forms in-memory data structure special tuple- stack-based code readable program latter case also called intermediate language canonical example found modern compilers linear human-readable text representing program transformed intermediate graph structure allows flow analysis re-arrangement creating sequence actual cpu instructions use intermediate representation allows compiler systems like gnu compiler collection llvm used many different source languages generate code many different target architectures intermediate language language abstract machine designed aid analysis computer programs term comes use compilers source code program translated form suitable code-improving transformations used generate object machine code target machine design intermediate language typically differs practical machine language three fundamental ways popular format intermediate languages three-address code term also used refer languages used intermediates high-level programming languages output object machine code output intermediate language intermediate language submitted compiler language outputs finished object machine code usually done ease process optimization increase portability using intermediate language compilers many processors operating systems c. languages used fall complexity high-level languages low-level languages assembly languages though explicitly designed intermediate language c nature abstraction assembly ubiquity de facto system language unix-like operating systems made popular intermediate language eiffel sather esterel dialects lisp lush gambit haskell glasgow haskell compiler squeak smalltalk-subset slang cython seed7 systemtap vala others make use c intermediate language variants c designed provide c features portable assembly language including c -- c intermediate language language targeting virtual machine p-code machine considered intermediate language gnu compiler collection gcc uses several intermediate languages internally simplify portability cross-compilation among languages llvm compiler framework based llvm ir intermediate language compact binary serialized representation also referred bitcode productized apple iloc intermediate language used classes compiler design simple target language static analysis tools often use intermediate representation instance radare2 toolbox binary files analysis reverse-engineering uses intermediate languages esil et reil analyze binary files", + "neighbors": [ + 78, + 81, + 270, + 292, + 306, + 313, + 368, + 386, + 446, + 503, + 509, + 521, + 567, + 736, + 756, + 828, + 919, + 1009, + 1028, + 1044, + 1050, + 1183, + 1231, + 1235, + 1302, + 1319, + 1320, + 1335, + 1372, + 1413, + 1414 + ], + "mask": "Test" + }, + { + "node_id": 1512, + "label": 2, + "text": "KIDO'Z:kido z kidoz content discovery network designed children platform based upon sophisticated coppa compliant machine learning technology platform analyses big data knows recommend relevant content every kid based usage behaviour kidoz offer several solutions stand-alone state-of-the-art child mode app allows children explore world wide web full array mobile tablet devices safely parents may download app free google play store begin empower children explore interests independently safely https //play.google.com/store/apps/details id=com.kidoz password-protected parental control account parents set account parameters features account security enhancement content customisation tools tools addition new content kidoz businesses provides kid developers publishers sdk/js integrate within property begin monetizing safely easily kid-friendly recommendation widget creates engagement users offering free videos games apps discover enjoy advertisers may promote children content network get exposed millions targeted kids enjoy high conversion rates positive brand engagement system designed platform user-generated content content moderated approved moderation team allowed system blocks links scripts attempts lead sites content approved system internally developed around termed smart content engine filters individualizes content users based certain variables age gender languages kidoz came beta testing phase may 2009 v1.0 available 30 languages english german chinese traditional chinese simplified french greek italian japanese korean portuguese russian spanish czech dutch swedish turkish polish kidoz available free download maker website current categories websites videos games children disclosed future freemium versions include additional features premium model offering certain specialized features small monthly fee kidoz kid web environment operating system developed kido z ltd israeli start-up based tel aviv ceo gai havkin kidoz currently follows freemium model application available free download website future versions include additional features e-mail instant messaging closed network revealed next months kido \u2019 z launch premium package offer additional tools services content", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1513, + "label": 4, + "text": "Microsoft_Network_Monitor:microsoft network monitor microsoft network monitor deprecated packet analyzer enables capturing viewing analyzing network data deciphering network protocols used troubleshoot network problems applications network microsoft network monitor 1.0 codenamed bloodhound originally designed developed raymond patch transport protocol network adapter device driver engineer microsoft lan manager development team network monitor replaced microsoft message analyzer lan manager development team one shared hardware-based analyzer time netmon conceived hardware analyzer taken test reproduce networking bug first windows prototype coded christmas holiday first 4 bytes netmon capture file format used validate file values 'rtss ray tom steve steve first four members team code originally written os/2 user interface symbol placed device driver packet buffers kept received data could dumped hex within kernel debugger netmon caused bit stir microsoft since networks e-mail encrypted time software engineers access hardware analyzers due cost netmon many engineers around company access network traffic free request microsoft two simple identification features added non-cryptographic password identification protocol named bloodhound-oriented network entity bone created named raymond patch play codename bloodhound network monitor 3 complete overhaul earlier network monitor 2.x version originally versions network monitor available microsoft products systems management server sms fully featured product public parsers available free download microsoft network monitor superseded microsoft message analyzer key features network monitor 3.4 include following", + "neighbors": [ + 138, + 160, + 961, + 991, + 1138, + 1337, + 1400, + 1527, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 1514, + "label": 4, + "text": "Trend_Micro_Internet_Security:trend micro internet security trend micro internet security known pc-cillin internet security australia virus buster japan antivirus online security program developed trend micro consumer market according nss lab comparative analysis software products market 2014 trend micro internet security fastest responding new internet threats addition anti-malware web threat protection premium version software includes compatibility pcs macs android ios mobile devices parental controls identity theft prevention privacy scanner major social networking sites 25 gb cloud storage features trend micro internet security 2015 include software also includes trend micro premium security includes additional features including av-comparatives awarded trend micro three-star advanced rating\u2013the highest ranking given organization\u2013in av-comparatives \u2019 whole product dynamic \u201c real-world \u201d protection test 2014 av-test october 2014 gave trend micro internet security 2015 score 17 possible 18 points trend micro maximum security scored highest success rate blocking malware downloads nss labs \u2019 2014 consumer endpoint protection test focused socially engineered malware results based continuous series tests determine participants \u2019 effectiveness socially engineered malware nss labs independent network testing facility security consultancy organization nss labs also found trend micro quickest time adding protection unknown threats less 15 minutes january 2016 discovered consumer version trend micro av allowed website visited users execute arbitrary code read browser passwords windows pc purportedly protected patch later issued close issue june 2014 av-test published results mobile security endurance tests assessed 30 apps six-month period trend micro \u2019 mobile security tied highest overall score 13 13 points previous versions include january 2015 trend micro supported trend micro internet security versions 19/2011 higher pc-cillin 2000 earlier versions virus scanners without additional features pc-cillin 2002 2003 stand-alone virus scanners also included firewall component improved software \u2019 scanning virus detection engine newer versions trend micro internet security offer additional features spyware protection antispam integrated firewall along improved scanning virus detection engine enhanced heuristics pc-cillin 2003 last stand-alone antivirus product offered trend micro 2007 company released standalone anti-malware product offered protection malicious software including viruses spyware adware", + "neighbors": [ + 17, + 94, + 120, + 134, + 186, + 189, + 217, + 476, + 569, + 648, + 656, + 685, + 717, + 731, + 842, + 910, + 938, + 944, + 961, + 965, + 1038, + 1090, + 1101, + 1138, + 1239, + 1250, + 1257, + 1291, + 1350, + 1379, + 1403, + 1406, + 1462, + 1542, + 1568 + ], + "mask": "Validation" + }, + { + "node_id": 1515, + "label": 4, + "text": "Bulk_personal_datasets:bulk personal datasets bulk personal datasets uk government euphemism datasets containing personally identifiable information large number individuals part mass surveillance united kingdom citizens around world term first used publicly march 2015 intelligence security committee parliament subject significant controversy uk government departments programmes utilising bulk personal datasets one care.data programme department health national health service health bulk personal datasets created by-product providing direct care judicial body oversees intelligence services united kingdom investigatory powers tribunal ruled legislative framework united kingdom permit mass surveillance gchq collects analyses data bulk practice mass surveillance special report published intelligence security committee parliament also came view although found past shortcomings oversight said legal framework simplified improve transparency view supported independent reports interception communications commissioner however notable campaign groups broadsheet newspapers continue express strong views contrary others criticised viewpoints turn", + "neighbors": [ + 429, + 658 + ], + "mask": "Validation" + }, + { + "node_id": 1516, + "label": 9, + "text": "EuLisp:eulisp eulisp statically dynamically scoped lisp dialect developed loose formation industrial academic lisp users developers around europe standardizers intended create new lisp less encumbered past compared common lisp minimalist scheme another objective integrate object-oriented programming paradigm well third-generation programming language language definition process first began meeting 1985 paris took several years complete specification first implementation interpreted-only available 1990 main traits lisp-1 separate function variable namespaces common lisp object system clos style generic-function type object-oriented system named eulisp object system telos integrated ground built-in module system defined layers promote use lisp small embedded hardware educational machines supports continuations though powerfully scheme simple lightweight process mechanism threads early implementation eulisp free eventually eulisp feel successor feel youtoo interpreted compiled versions university bath united kingdom interpreter basic level eulisp level-0 written russell bradford xscheme implementation scheme david michael betz originally named euschemeeuscheme recent version renamed euxlisp avoid confusion also eu2c eulisp optimizing compiler created fraunhofer isst apply project germany dialect eulisp developed named plural eulisp eulisp parallel computing programming extensions example use classes algorithm solve towers hanoi problem", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 567, + 601, + 649, + 653, + 693, + 753, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1232, + 1245, + 1251, + 1277, + 1298, + 1315, + 1324, + 1372, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1536, + 1582, + 1588, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1517, + "label": 5, + "text": "Finger_protocol:finger protocol computer networking name/finger protocol finger user information protocol simple network protocols exchange human-oriented status user information name/finger protocol based request comments document december 1977 interface codice_1 codice_2 programs provide status reports particular computer system particular person network sites finger program written 1971 les earnest created program solve need users wanted information users network information logged-in useful check availability person meet probably earliest form presence information remote network users prior finger program way get information codice_3 program showed ids terminal line numbers server internal number communication line user terminal connected logged-in users earnest named program idea people would run fingers codice_3 list find looking term finger 1970s connotation snitch made finger good reminder/mnemonic semantic unix codice_2 command client protocol context finger daemon runs tcp port 79 client case remote hosts open connection port 79 ruip remote user information program started remote end connection process request local host sends ruip one line query based upon finger query specification waits ruip respond ruip receives processes query returns answer initiates close connection local host receives answer close signal proceeds close end connection finger user information protocol based finger user information protocol december 1991 typically server side protocol implemented program codice_6 finger daemon client side implemented codice_1 codice_2 programs supposed return friendly human-oriented status report either system moment particular person depth required format protocol consists mostly specifying single command line program would supply information whether user currently logged-on e-mail address full name etc well standard user information finger displays contents codice_9 codice_10 files user home directory often file maintained user contains either useful information user current activities similar micro-blogging alternatively manner humor supplying detailed information e-mail addresses full names considered acceptable convenient early days networking later considered questionable privacy security reasons finger information used hackers way initiate social engineering attack company computer security system using finger client get list company employee names email addresses phone numbers hacker call email someone company requesting information posing another employee finger daemon also several exploitable security holes crackers used break systems example 1988 morris worm exploited overflow vulnerability codice_6 among others spread finger protocol also incompatible network address translation nat private network address ranges e.g 192.168.0.0/16 used majority home office workstations connect internet routers firewalls nowadays reasons finger widely used early days internet late 1990s vast majority sites internet longer offered service implemented unix unix-like systems current versions windows finger.exe command software finger support", + "neighbors": [ + 52, + 109, + 225, + 255, + 295, + 311, + 355, + 377, + 425, + 430, + 444, + 455, + 470, + 491, + 542, + 543, + 615, + 646, + 655, + 672, + 684, + 703, + 732, + 757, + 764, + 769, + 770, + 771, + 772, + 779, + 816, + 904, + 961, + 1042, + 1050, + 1110, + 1206, + 1243, + 1326, + 1329, + 1370, + 1374, + 1386, + 1395, + 1410, + 1438, + 1443, + 1448, + 1452, + 1453, + 1552, + 1570, + 1587 + ], + "mask": "Test" + }, + { + "node_id": 1518, + "label": 3, + "text": "CPU_cache:cpu cache cpu cache hardware cache used central processing unit cpu computer reduce average cost time energy access data main memory cache smaller faster memory closer processor core stores copies data frequently used main memory locations cpus different independent caches including instruction data caches data cache usually organized hierarchy cache levels l1 l2 l3 l4 etc. modern fast cpus specialized exceptions multiple levels cpu caches first cpus used cache one level cache unlike later level 1 caches split l1d data l1i instructions almost current cpus caches split l1 cache also l2 caches larger processors l3 caches well l2 cache usually split acts common repository already split l1 cache every core multi-core processor dedicated l2 cache usually shared cores l3 cache higher-level caches shared cores split l4 cache currently uncommon generally dynamic random-access memory dram rather static random-access memory sram separate die chip also case historically l1 bigger chips allowed integration generally cache levels possible exception last level extra level cache tends bigger optimized differently types caches exist counted towards cache size important caches mentioned translation lookaside buffer tlb part memory management unit mmu cpus caches generally sized powers two 4 8 16 etc kib mib larger non-l1 sizes although ibm z13 96 kib l1 instruction cache trying read write location main memory processor checks whether data location already cache processor read write cache instead much slower main memory modern desktop server cpus least three independent caches instruction cache speed executable instruction fetch data cache speed data fetch store translation lookaside buffer tlb used speed virtual-to-physical address translation executable instructions data single tlb provided access instructions data separate instruction tlb itlb data tlb dtlb provided data cache usually organized hierarchy cache levels l1 l2 etc see also multi-level caches however tlb cache part memory management unit mmu directly related cpu caches data transferred memory cache blocks fixed size called cache lines cache blocks cache line copied memory cache cache entry created cache entry include copied data well requested memory location called tag processor needs read write location memory first checks corresponding entry cache cache checks contents requested memory location cache lines might contain address processor finds memory location cache cache hit occurred however processor find memory location cache cache miss occurred case cache hit processor immediately reads writes data cache line cache miss cache allocates new entry copies data main memory request fulfilled contents cache make room new entry cache miss cache may evict one existing entries heuristic uses choose entry evict called replacement policy fundamental problem replacement policy must predict existing cache entry least likely used future predicting future difficult perfect method choose among variety replacement policies available one popular replacement policy least-recently used lru replaces least recently accessed entry marking memory ranges non-cacheable improve performance avoiding caching memory regions rarely re-accessed avoids overhead loading something cache without reuse cache entries may also disabled locked depending context data written cache point must also written main memory timing write known write policy write-through cache every write cache causes write main memory alternatively write-back copy-back cache writes immediately mirrored main memory cache instead tracks locations written marking dirty data locations written back main memory data evicted cache reason read miss write-back cache may sometimes require two memory accesses service one first write dirty location main memory another read new location memory also write main memory location yet mapped write-back cache may evict already dirty location thereby freeing cache space new memory location intermediate policies well cache may write-through writes may held store data queue temporarily usually multiple stores processed together reduce bus turnarounds improve bus utilization cached data main memory may changed entities e.g peripherals using direct memory access dma another core multi-core processor case copy cache may become out-of-date stale alternatively cpu multiprocessor system updates data cache copies data caches associated cpus become stale communication protocols cache managers keep data consistent known cache coherence protocols cache performance measurement become important recent times speed gap memory performance processor performance increasing exponentially cache introduced reduce speed gap thus knowing well cache able bridge gap speed processor memory becomes important especially high-performance systems cache hit rate cache miss rate play important role determining performance improve cache performance reducing miss rate becomes one necessary steps among steps decreasing access time cache also gives boost performance time taken fetch one cache line memory read latency due cache miss matters cpu run things waiting cache line cpu reaches state called stall cpus become faster compared main memory stalls due cache misses displace potential computation modern cpus execute hundreds instructions time taken fetch single cache line main memory various techniques employed keep cpu busy time including out-of-order execution cpu pentium pro later intel designs example attempts execute independent instructions instruction waiting cache miss data another technology used many processors simultaneous multithreading smt orin intel terminologyhyper-threading ht allows alternate thread use cpu core first thread waits required cpu resources become available replacement policy decides cache copy particular entry main memory go replacement policy free choose entry cache hold copy cache called fully associative extreme entry main memory go one place cache cache direct mapped many caches implement compromise entry main memory go one n places cache described n-way set associative example level-1 data cache amd athlon two-way set associative means particular location main memory cached either two locations level-1 data cache choosing right value associativity involves trade-off ten places replacement policy could mapped memory location check location cache ten cache entries must searched checking places takes power chip area potentially time hand caches associativity suffer fewer misses see conflict misses cpu wastes less time reading slow main memory general guideline doubling associativity direct mapped two-way two-way four-way effect raising hit rate doubling cache size however increasing associativity four improve hit rate much generally done reasons see virtual aliasing cpus dynamically reduce associativity caches low-power states acts power-saving measure order worse simple better complex cache organization location main memory go one entry cache therefore direct-mapped cache also called one-way set associative cache replacement policy since choice cache entry contents evict means two locations map entry may continually knock although simpler direct-mapped cache needs much larger associative one give comparable performance unpredictable let block number cache block number memory number blocks cache mapping done help equation location main memory cached either two locations cache one logical question one two simplest commonly used scheme shown right-hand diagram use least significant bits memory location index index cache memory two entries index one benefit scheme tags stored cache include part main memory address implied cache memory index since cache tags fewer bits require fewer transistors take less space processor circuit board microprocessor chip read compared faster also lru especially simple since one bit needs stored pair one advantages direct mapped cache allows simple fast speculation address computed one cache index might copy location memory known cache entry read processor continue work data finishes checking tag actually matches requested address idea processor use cached data tag match completes applied associative caches well subset tag called hint used pick one possible cache entries mapping requested address entry selected hint used parallel checking full tag hint technique works best used context address translation explained schemes suggested skewed cache index way 0 direct index way 1 formed hash function good hash function property addresses conflict direct mapping tend conflict mapped hash function less likely program suffer unexpectedly large number conflict misses due pathological access pattern downside extra latency computing hash function additionally comes time load new line evict old line may difficult determine existing line least recently used new line conflicts data different indexes way lru tracking non-skewed caches usually done per-set basis nevertheless skewed-associative caches major advantages conventional set-associative ones true set-associative cache tests possible ways simultaneously using something like content addressable memory pseudo-associative cache tests possible way one time hash-rehash cache column-associative cache examples pseudo-associative cache common case finding hit first way tested pseudo-associative cache fast direct-mapped cache much lower conflict miss rate direct-mapped cache closer miss rate fully associative cache cache row entries usually following structure data block cache line contains actual data fetched main memory tag contains part address actual data fetched main memory flag bits discussed size cache amount main memory data hold size calculated number bytes stored data block times number blocks stored cache tag flag error correction code bits included size although affect physical area cache effective memory address goes along cache line memory block split msb lsb tag index block offset index describes cache set data put index length formula_1 bits cache sets block offset specifies desired data within stored data block within cache row typically effective address bytes block offset length formula_2 bits number bytes per data block tag contains significant bits address checked rows current set set retrieved index see set contains requested address cache hit occurs tag length bits follows authors refer block offset simply offset displacement original pentium 4 processor four-way set associative l1 data cache 8 kib size 64-byte cache blocks hence 8 kib 64 128 cache blocks number sets equal number cache blocks divided number ways associativity leads 128 4 32 sets hence 2 32 different indices 2 64 possible offsets since cpu address 32 bits wide implies 32 5 6 21 bits tag field original pentium 4 processor also eight-way set associative l2 integrated cache 256 kib size 128-byte cache blocks implies 32 8 7 17 bits tag field instruction cache requires one flag bit per cache row entry valid bit valid bit indicates whether cache block loaded valid data power-up hardware sets valid bits caches invalid systems also set valid bit invalid times multi-master bus snooping hardware cache one processor hears address broadcast processor realizes certain data blocks local cache stale marked invalid data cache typically requires two flag bits per cache line valid bit dirty bit dirty bit set indicates associated cache line changed since read main memory dirty meaning processor written data line new value propagated way main memory cache miss failed attempt read write piece data cache results main memory access much longer latency three kinds cache misses instruction read miss data read miss data write miss cache read misses instruction cache generally cause largest delay processor least thread execution wait stall instruction fetched main memory cache read misses data cache usually cause smaller delay instructions dependent cache read issued continue execution data returned main memory dependent instructions resume execution cache write misses data cache generally cause shortest delay write queued limitations execution subsequent instructions processor continue queue full detailed introduction types misses see cache performance measurement metric general purpose cpus implement form virtual memory summarize either program running machine sees simplified address space contains code data program programs run common virtual address space program executes calculating comparing reading writing addresses virtual address space rather addresses physical address space making programs simpler thus easier write virtual memory requires processor translate virtual addresses generated program physical addresses main memory portion processor translation known memory management unit mmu fast path mmu perform translations stored translation lookaside buffer tlb cache mappings operating system page table segment table purposes present discussion three important features address translation early virtual memory systems slow required access page table held main memory every programmed access main memory caches effectively cut speed memory access half first hardware cache used computer system actually data instruction cache rather tlb caches divided four types based whether index tag correspond physical virtual addresses speed recurrence load latency crucial cpu performance modern level-1 caches virtually indexed least allows mmu tlb lookup proceed parallel fetching data cache ram virtual indexing best choice cache levels cost dealing virtual aliases grows cache size result level-2 larger caches physically indexed caches historically used virtual physical addresses cache tags although virtual tagging uncommon tlb lookup finish cache ram lookup physical address available time tag compare need virtual tagging large caches tend physically tagged small low latency caches virtually tagged recent general-purpose cpus virtual tagging superseded vhints described cache relies virtual indexing tagging becomes inconsistent virtual address mapped different physical addresses homonym solved using physical address tagging storing address space identifier cache line however latter approach help synonym problem several cache lines end storing data physical address writing locations may update one location cache leaving others inconsistent data issue may solved using non-overlapping memory layouts different address spaces otherwise cache part must flushed mapping changes great advantage virtual tags associative caches allow tag match proceed virtual physical translation done however coherence probes evictions present physical address action hardware must means converting physical addresses cache index generally storing physical tags well virtual tags comparison physically tagged cache need keep virtual tags simpler virtual physical mapping deleted tlb cache entries virtual addresses flushed somehow alternatively cache entries allowed pages mapped tlb entries flushed access rights pages changed page table also possible operating system ensure virtual aliases simultaneously resident cache operating system makes guarantee enforcing page coloring described early risc processors sparc rs/6000 took approach used recently hardware cost detecting evicting virtual aliases fallen software complexity performance penalty perfect page coloring risen useful distinguish two functions tags associative cache used determine way entry set select used determine cache hit missed second function must always correct permissible first function guess get wrong answer occasionally processors e.g early sparcs caches virtual physical tags virtual tags used way selection physical tags used determining hit miss kind cache enjoys latency advantage virtually tagged cache simple software interface physically tagged cache bears added cost duplicated tags however also miss processing alternate ways cache line indexed probed virtual aliases matches evicted extra area latency mitigated keeping virtual hints cache entry instead virtual tags hints subset hash virtual tag used selecting way cache get data physical tag like virtually tagged cache may virtual hint match physical tag mismatch case cache entry matching hint must evicted cache accesses cache fill address one hint match since virtual hints fewer bits virtual tags distinguishing one another virtually hinted cache suffers conflict misses virtually tagged cache perhaps ultimate reduction virtual hints found pentium 4 willamette northwood cores processors virtual hint effectively two bits cache four-way set associative effectively hardware maintains simple permutation virtual address cache index content-addressable memory cam necessary select right one four ways fetched large physically indexed caches usually secondary caches run problem operating system rather application controls pages collide one another cache differences page allocation one program run next lead differences cache collision patterns lead large differences program performance differences make difficult get consistent repeatable timing benchmark run understand problem consider cpu 1 mib physically indexed direct-mapped level-2 cache 4 kib virtual memory pages sequential physical pages map sequential locations cache 256 pages pattern wraps around label physical page color 0\u2013255 denote cache go locations within physical pages different colors conflict cache programmers attempting make maximum use cache may arrange programs access patterns 1 mib data need cached given time thus avoiding capacity misses also ensure access patterns conflict misses one way think problem divide virtual pages program uses assign virtual colors way physical colors assigned physical pages programmers arrange access patterns code two pages virtual color use time wide literature optimizations e.g loop nest optimization largely coming high performance computing hpc community snag pages use given moment may different virtual colors may physical colors fact operating system assigns physical pages virtual pages randomly uniformly extremely likely pages physical color locations pages collide cache birthday paradox solution operating system attempt assign different physical color pages different virtual colors technique called page coloring although actual mapping virtual physical color irrelevant system performance odd mappings difficult keep track little benefit approaches page coloring simply try keep physical virtual page colors operating system guarantee physical page maps one virtual color virtual aliases processor use virtually indexed caches need extra virtual alias probes miss handling alternatively os flush page cache whenever changes one virtual color another mentioned approach used early sparc rs/6000 designs modern processors multiple interacting on-chip caches operation particular cache completely specified cache size cache block size number blocks set cache set replacement policy cache write policy write-through write-back cache blocks particular cache size associativity typically lower-level caches called level 1 cache smaller number blocks smaller block size fewer blocks set short access times higher-level caches i.e level 2 progressively larger numbers blocks larger block size blocks set relatively longer access times still much faster main memory cache entry replacement policy determined cache algorithm selected implemented processor designers cases multiple algorithms provided different kinds work loads pipelined cpus access memory multiple points pipeline instruction fetch virtual-to-physical address translation data fetch see classic risc pipeline natural design use different physical caches points one physical resource scheduled service two points pipeline thus pipeline naturally ends least three separate caches instruction tlb data specialized particular role victim cache cache used hold blocks evicted cpu cache upon replacement victim cache lies main cache refill path holds blocks data evicted main cache victim cache usually fully associative intended reduce number conflict misses many commonly used programs require associative mapping accesses fact small fraction memory accesses program require high associativity victim cache exploits property providing high associativity accesses introduced norman jouppi dec 1990 intel crystalwell variant haswell processors equipped intel iris pro gt3e embedded graphics 128 mb edram introduced on-package level 4 cache serves victim cache processors level 3 cache skylake processors level 4 cache longer works victim cache one extreme examples cache specialization trace cache also known execution trace cache found intel pentium 4 microprocessors trace cache mechanism increasing instruction fetch bandwidth decreasing power consumption case pentium 4 storing traces instructions already fetched decoded trace cache stores instructions either decoded retired generally instructions added trace caches groups representing either individual basic blocks dynamic instruction traces pentium 4 trace cache stores micro-operations resulting decoding x86 instructions providing also functionality micro-operation cache next time instruction needed decoded micro-ops write coalescing cache special cache part l2 cache amd bulldozer microarchitecture stores l1d caches module go wcc buffered coalesced wcc task reducing number writes l2 cache micro-operation cache \u03bcop cache uop cache uc specialized cache stores micro-operations decoded instructions received directly instruction decoders instruction cache instruction needs decoded \u03bcop cache checked decoded form re-used cached available instruction decoded cached one early works describing \u03bcop cache alternative frontend intel p6 processor family 2001 paper micro-operation cache power aware frontend variable instruction length isa later intel included \u03bcop caches sandy bridge processors successive microarchitectures like ivy bridge haswell amd implemented \u03bcop cache zen microarchitecture fetching complete pre-decoded instructions eliminates need repeatedly decode variable length complex instructions simpler fixed-length micro-operations simplifies process predicting fetching rotating aligning fetched instructions \u03bcop cache effectively offloads fetch decode hardware thus decreasing power consumption improving frontend supply decoded micro-operations \u03bcop cache also increases performance consistently delivering decoded micro-operations backend eliminating various bottlenecks cpu fetch decode logic \u03bcop cache many similarities trace cache although \u03bcop cache much simpler thus providing better power efficiency makes better suited implementations battery-powered devices main disadvantage trace cache leading power inefficiency hardware complexity required heuristic deciding caching reusing dynamically created instruction traces branch target cache branch target instruction cache name used arm microprocessors specialized cache holds first instructions destination taken branch used low-powered processors need normal instruction cache memory system capable delivering instructions fast enough satisfy cpu without one however applies consecutive instructions sequence still takes several cycles latency restart instruction fetch new address causing cycles pipeline bubble control transfer branch target cache provides instructions cycles avoiding delay taken branches allows full-speed operation much smaller cache traditional full-time instruction cache smart cache level 2 level 3 caching method multiple execution cores developed intel smart cache shares actual cache memory cores multi-core processor comparison dedicated per-core cache overall cache miss rate decreases cores need equal parts cache space consequently single core use full level 2 level 3 cache cores inactive furthermore shared cache makes faster share memory among different execution cores another issue fundamental tradeoff cache latency hit rate larger caches better hit rates longer latency address tradeoff many computers use multiple levels cache small fast caches backed larger slower caches multi-level caches generally operate checking fastest level 1 l1 cache first hits processor proceeds high speed smaller cache misses next fastest cache level 2 l2 checked accessing external memory latency difference main memory fastest cache become larger processors begun utilize many three levels on-chip cache price-sensitive designs used pull entire cache hierarchy on-chip 2010s highest-performance designs returned large off-chip caches often implemented edram mounted multi-chip module fourth cache level benefits l3 l4 caches depend application access patterns examples products incorporating l3 l4 caches include following finally end memory hierarchy cpu register file considered smallest fastest cache system special characteristic scheduled software\u2014typically compiler allocates registers hold values retrieved main memory example loop nest optimization however register renaming compiler register assignments reallocated dynamically hardware runtime register bank allowing cpu break false data dependencies thus easing pipeline hazards register files sometimes also hierarchy cray-1 circa 1976 eight address eight scalar data registers generally usable also set 64 address b 64 scalar data registers took longer access faster main memory b registers provided cray-1 data cache cray-1 however instruction cache considering chip multiple cores question whether caches shared local core implementing shared cache inevitably introduces wiring complexity one cache per chip rather core greatly reduces amount space needed thus one include larger cache typically sharing l1 cache undesirable resulting increase latency would make core run considerably slower single-core chip however highest-level cache last one called accessing memory global cache desirable several reasons allowing single core use whole cache reducing data redundancy making possible different processes threads share cached data reducing complexity utilized cache coherency protocols example eight-core chip three levels may include l1 cache core one intermediate l2 cache pair cores one l3 cache shared cores shared highest-level cache called accessing memory usually referred last level cache llc additional techniques used increasing level parallelism llc shared multiple cores including slicing multiple pieces addressing certain ranges memory addresses accessed independently separate cache structure instructions data cached separately meaning cache line used cache either instructions data various benefits demonstrated separate data instruction translation lookaside buffers unified structure constraint present cache lines used cache instructions data multi-level caches introduce new design decisions instance processors data l1 cache must also somewhere l2 cache caches called strictly inclusive processors like amd athlon exclusive caches data guaranteed one l1 l2 caches never still processors like intel pentium ii iii 4 require data l1 cache also reside l2 cache although may often universally accepted name intermediate policy two common names non-exclusive partially-inclusive advantage exclusive caches store data advantage larger exclusive l1 cache comparable l2 cache diminishes l2 cache many times larger l1 cache l1 misses l2 hits access hitting cache line l2 exchanged line l1 exchange quite bit work copying line l2 l1 inclusive cache one advantage strictly inclusive caches external devices processors multiprocessor system wish remove cache line processor need processor check l2 cache cache hierarchies enforce inclusion l1 cache must checked well drawback correlation associativities l1 l2 caches l2 cache least many ways l1 caches together effective associativity l1 caches restricted another disadvantage inclusive cache whenever eviction l2 cache possibly corresponding lines l1 also get evicted order maintain inclusiveness quite bit work would result higher l1 miss rate another advantage inclusive caches larger cache use larger cache lines reduces size secondary cache tags exclusive caches require caches size cache lines cache lines swapped l1 miss l2 hit secondary cache order magnitude larger primary cache data order magnitude larger cache tags tag area saved comparable incremental area needed store l1 cache data l2 illustrate specialization multi-level caching cache hierarchy k8 core amd athlon 64 cpu k8 four specialized caches instruction cache instruction tlb data tlb data cache caches specialized k8 also multiple-level caches second-level instruction data tlbs store ptes mapping 4 kb instruction data caches various tlbs fill large unified l2 cache cache exclusive l1 instruction data caches means 8-byte line one l1 instruction cache l1 data cache l2 cache however possible line data cache pte also one tlbs\u2014the operating system responsible keeping tlbs coherent flushing portions page tables memory updated k8 also caches information never stored memory\u2014prediction information caches shown diagram usual class cpu k8 fairly complex branch prediction tables help predict whether branches taken tables predict targets branches jumps information associated instructions level 1 instruction cache unified secondary cache k8 uses interesting trick store prediction information instructions secondary cache lines secondary cache protected accidental data corruption e.g alpha particle strike either ecc parity depending whether lines evicted data instruction primary caches since parity code takes fewer bits ecc code lines instruction cache spare bits bits used cache branch prediction information associated instructions net result branch predictor larger effective history table better accuracy processors kinds predictors e.g store-to-load bypass predictor dec alpha 21264 various specialized predictors likely flourish future processors predictors caches store information costly compute terminology used discussing predictors caches one speaks hit branch predictor predictors generally thought part cache hierarchy k8 keeps instruction data caches coherent hardware means store instruction closely following store instruction change following instruction processors like alpha mips family relied software keep instruction cache coherent stores guaranteed show instruction stream program calls operating system facility ensure coherency computer engineering tag ram used specify possible memory locations currently stored cpu cache simple direct-mapped design fast sram used higher associative caches usually employ content-addressable memory cache reads common cpu operation takes single cycle program execution time tends sensitive latency level-1 data cache hit great deal design effort often power silicon area expended making caches fast possible simplest cache virtually indexed direct-mapped cache virtual address calculated adder relevant portion address extracted used index sram returns loaded data data byte aligned byte shifter bypassed next operation need tag checking inner loop fact tags need even read later pipeline load instruction retired tag loaded data must read checked virtual address make sure cache hit miss cache updated requested cache line pipeline restarted associative cache complicated form tag must read determine entry cache select n-way set-associative level-1 cache usually reads n possible tags n data parallel chooses data associated matching tag level-2 caches sometimes save power reading tags first one data element read data sram adjacent diagram intended clarify manner various fields address used address bit 31 significant bit 0 least significant diagram shows srams indexing multiplexing 4 kb 2-way set-associative virtually indexed virtually tagged cache 64 byte b lines 32-bit read width 32-bit virtual address cache 4 kb 64 b lines 64 lines cache read two time tag sram 32 rows pair 21 bit tags although function virtual address bits 31 6 could used index tag data srams simplest use least significant bits similarly cache 4 kb 4 b read path reads two ways access data sram 512 rows 8 bytes wide modern cache might 16 kb 4-way set-associative virtually indexed virtually hinted physically tagged 32 b lines 32-bit read width 36-bit physical addresses read path recurrence cache looks similar path instead tags vhints read matched subset virtual address later pipeline virtual address translated physical address tlb physical tag read one vhint supplies way cache read finally physical address compared physical tag determine hit occurred sparc designs improved speed l1 caches gate delays collapsing virtual address adder sram decoders see sum addressed decoder early history cache technology closely tied invention use virtual memory scarcity cost semi-conductor memories early mainframe computers 1960s used complex hierarchy physical memory mapped onto flat virtual memory space used programs memory technologies would span semi-conductor magnetic core drum disc virtual memory seen used programs would flat caching would used fetch data instructions fastest memory ahead processor access extensive studies done optimize cache sizes optimal values found depend greatly programming language used algol needing smallest fortran cobol needing largest cache sizes early days microcomputer technology memory access slightly slower register access since 1980s performance gap processor memory growing microprocessors advanced much faster memory especially terms operating frequency memory became performance bottleneck technically possible main memory fast cpu economically viable path taken use plenty low-speed memory also introduce small high-speed cache memory alleviate performance gap provided order magnitude capacity\u2014for price\u2014with slightly reduced combined performance first documented uses tlb ge 645 ibm 360/67 used associative memory tlb first documented use data cache ibm system/360 model 85 68010 released 1982 loop mode considered tiny special-case instruction cache accelerates loops consist two instructions 68020 released 1984 replaced typical instruction cache 256 bytes first 68k series processor feature true on-chip cache memory 68030 released 1987 basically 68020 core additional 256-byte data cache process shrink added burst mode caches 68040 released 1990 split instruction data caches four kilobytes 68060 released 1994 following 8 kb data cache four-way associative 8 kb instruction cache four-way associative 96-byte fifo instruction buffer 256-entry branch cache 64-entry address translation cache mmu buffer four-way associative x86 microprocessors reached clock rates 20 mhz 386 small amounts fast cache memory began featured systems improve performance dram used main memory significant latency 120 ns well refresh cycles cache constructed expensive significantly faster sram memory cells time latencies around 10 ns 25 ns early caches external processor typically located motherboard form eight nine dip devices placed sockets enable cache optional extra upgrade feature versions intel 386 processor could support 16 256 kb external cache 486 processor 8 kb cache integrated directly cpu die cache termed level 1 l1 cache differentiate slower on-motherboard level 2 l2 cache on-motherboard caches much larger common size 256 kb popularity on-motherboard cache continued pentium mmx era made obsolete introduction sdram growing disparity bus clock rates cpu clock rates caused on-motherboard cache slightly faster main memory next development cache implementation x86 microprocessors began pentium pro brought secondary cache onto package microprocessor clocked frequency microprocessor on-motherboard caches enjoyed prolonged popularity thanks amd k6-2 amd k6-iii processors still used socket 7 previously used intel on-motherboard caches k6-iii included 256 kb on-die l2 cache took advantage on-board cache third level cache named l3 motherboards 2 mb on-board cache produced socket 7 became obsolete on-motherboard cache disappeared x86 systems three-level caches used first introduction multiple processor cores l3 cache added cpu die became common total cache sizes increasingly larger newer processor generations recently 2011 uncommon find level 3 cache sizes tens megabytes intel introduced level 4 on-package cache haswell microarchitecture crystalwell haswell cpus equipped gt3e variant intel integrated iris pro graphics effectively feature 128 mb embedded dram edram package l4 cache shared dynamically on-die gpu cpu serves victim cache cpu l3 cache early cache designs focused entirely direct cost cache ram average execution speed recent cache designs also consider energy efficiency fault tolerance goals researchers also explored use emerging memory technologies edram embedded dram nvram non-volatile ram designing caches several tools available computer architects help explore tradeoffs cache cycle time energy area tools include open-source cacti cache simulator open-source simplescalar instruction set simulator modeling 2d 3d sram edram stt-ram reram pcm caches done using destiny tool multi-ported cache cache serve one request time accessing traditional cache normally use single memory address whereas multi-ported cache may request n addresses time n number ports connected processor cache benefit pipelined processor may access memory different phases pipeline another benefit allows concept super-scalar processors different cache levels", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 214, + 224, + 230, + 265, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 359, + 386, + 388, + 445, + 457, + 460, + 465, + 486, + 508, + 529, + 544, + 571, + 579, + 589, + 607, + 643, + 659, + 681, + 719, + 738, + 752, + 776, + 803, + 821, + 846, + 884, + 893, + 907, + 917, + 937, + 946, + 980, + 984, + 994, + 996, + 1002, + 1009, + 1011, + 1013, + 1016, + 1052, + 1063, + 1069, + 1072, + 1081, + 1111, + 1113, + 1125, + 1143, + 1158, + 1174, + 1178, + 1213, + 1219, + 1222, + 1256, + 1262, + 1263, + 1272, + 1284, + 1290, + 1305, + 1398, + 1469, + 1488, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1549, + 1557, + 1591, + 1605, + 1608, + 1616, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1519, + "label": 3, + "text": "Re-order_buffer:re-order buffer re-order buffer rob used tomasulo algorithm out-of-order instruction execution allows instructions committed in-order normally three stages instructions issue execute write result tomasulo algorithm additional stage commit stage results instructions stored register memory write result stage results put re-order buffer contents buffer used executing instructions depending additional fields every entry buffer additional benefits re-order buffer include precise exceptions easy rollback control target address mispredictions branch jump rob works storing instructions original fetched order rob also accessed side since reservation station tomasulo algorithm additional parameter points instruction rob jump prediction correct nonrecoverable exception encountered instruction stream rob cleared instructions reservation stations re-initialized", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 314, + 335, + 388, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1469, + 1505, + 1507, + 1518, + 1523, + 1525, + 1557, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1520, + "label": 2, + "text": "Accredited_Symbian_Developer:accredited symbian developer accredited symbian developer asd defunct accreditation program software developers using symbian os mobile phone operating system terminated april 2011 closure symbian foundation scheme operated independently foundation behalf majinate limited also closed business foundation closed primary qualification accredited asd pass on-line multiple choice examination adhered principles symbian os curriculum curriculum reviewed annual basis ensure accreditation kept date developments symbian operating system final release curriculum made 2009 although still adhered closely asd primer learning aid published wiley symbian press imprint final version curriculum contained following major topics topic assessed marked separately examination pass required high score coverage majority topics", + "neighbors": [ + 378, + 527, + 622, + 1018, + 1020, + 1138, + 1203 + ], + "mask": "Validation" + }, + { + "node_id": 1521, + "label": 2, + "text": "PlayStation_4_system_software:playstation 4 system software playstation 4 system software updatable firmware operating system playstation 4 operating system orbis os based freebsd 9 native operating system playstation 4 orbis os fork freebsd version 9.0 released 12 january 2012 playstation 4 features two graphics apis low level api named gnm high level api named gnmx developers start gnmx wraps around gnm turn manages esoteric gpu details familiar way work developers used platforms like direct3d 11 another key area game programmable pixel shaders sony playstation shader language pssl introduced playstation 4 suggested playstation shader language similar hlsl standard directx 11 subtle differences could eliminated part preprocessor macros besides kernel related components components included worth mentioning cairo jquery lua mono openssl webkit pixman rendering library many open-source software although playstation 4 open console software development kit sdk based llvm clang sony chosen due conformant c c++ front-ends c++11 support compiler optimization diagnostics playstation 4 uses playstation dynamic menu graphical shell contrast xrossmediabar xmb used playstation portable playstation 3 well livearea used playstation vita playstation tv named dynamic menu options offers players context sensitive changing based player actually playstation 4 given time makes navigation simpler previous iteration dynamic menu alter little time possible users placing game disc drive actual gameplay beginning playstation 4 user interface attempts simplicity priority main place entertainment options content area prominently displayed large square icons horizontal line arranged recently used users scroll gamer newsfeed alternating brick-like formation reminiscent social media site pinterest many main objects display additional information cursor selected game may news updates advertisements downloadable content recently played games receive tiles along number mandatory items like live playstation internet browser applications content icon customization options sort would give players way mold display better suit needs augmented reality application playroom comes pre-installed playstation 4 console demonstrated e3 2013 utilizes sony playstation camera technology according sony fantastically fresh augmented reality entertainment experience created combining light bar located front dualshock 4 controller playstation camera players allowed produce small floating robot called asobi interacts players scans faces shoots fireballs playstation camera identifies player help light bar front flick touchpad dualshock 4 controller brings augmented reality bots function playroom creates illusion hundreds little bots inside controller released simply tap track pad functions like playstation vita ps4 owners view smartphone playstation vita drawing object flick anywhere augmented reality bots play remote play users operate ps4 uses playstation vita handheld game console allowing play ps4 games media small device via streaming games except exceptions require playstation move playstation camera compatible second screen used display unique content playing games support option confused split screen second screen may used show extra contents example maps alternate camera angles radar even playbooks sports games apart playstation vita mobile devices ipad android tablet also used second screen comes form official playstation app game companion apps knack quest heavy emphasis social features placed playstation 4 console loading ps4 number share-centric apps features new feature allows users check friends latest activities via landing page full pictures trophies recent events easy way find friends hand cross-chat feature dubbed party chat interesting way keep touch gives gamers ability chat users whether 're playing title ps4 sharing capabilities adds another layer console gaming ps4 owners able capture livestream gameplay simple button touch record 60 minutes latest gaming exploits quick press share button controller footage shared facebook twitter youtube also ability broadcast gameplay real time twitch ustream addition recording videos also social features community creation introduced via system updates favorite groups new section within friends app acts way quickly access people user plays feature aimed making easier faster get game session friends hand communities new hubs formed around shared interests like games activities play styles also exist smaller social features ps4 ability message friend request watch gameplay live playstation 4 console function without internet connection provide functionality connected internet example updates system software may downloaded internet users may play online internet properly connected online play main pillar playstation 4 playstation plus subscription required play majority ps4 titles online unlike playstation 3 titles according sony developing many new ways play connect ps4 requires large investment resources result sony claim keep service free maintain quality time considering cost thus decided would better charge fee order continue offer good service web browser included playstation 4 console based open source webkit layout engine unlike playstation 3 uses netfront browser using modern webkit core safari apple ps4 web browser receives high score html5 compliance testing however support adobe flash means websites require flash might display properly function intended also pdf format supported however one clear advantage gamers able cut gaming browsing back loss gameplay due multitasking feature web browser additionally ps4 web browser limited support usb keyboards seem support usb mice furthermore internet connection enabled playstation 4 allows users access variety playstation network psn services including playstation store playstation plus subscription service users may download buy games contents services also gamers able play selection ps3 titles via internet-based playstation gaming service playstation 4 supports playing 2d 3d blu-rays dvds. previously system software update required standard new consoles instead console needs go online activate player first time used system support audio cds internally year console launch sony partnered spotify bring music streaming service playstation 4 well predecessor february 2015 including ability stream music background game application plus ability control music playback via smartphone computers etc available free premium subscribers spotify sony later added blu-ray 3d support console via system update users also use media player application enjoy videos photos music saved usb storage devices media servers ps4 may serve good portable device video enjoyment addition game playing following multimedia file formats supported although according playstation support website ps4 could play mp4 videos support mp4 files encoded h.264/mpeg-4 avc high profile aac-lc playstation 4 backward compatible games previous playstation consoles launch though playstation 4 users play playstation 3 games directly 2014 playstation cloud-based streaming service allowed streaming selected ps3 games december 2015 sony added playstation 2 backward compatibility republished ps2 games dark cloud grand theft auto iii ps4 via playstation store americas europe supported ps2 games run via software emulation upscaled high definition ps4 systems instead remastered one updated access various ps4 features including trophies share play broadcasting remote play second-screen features however original ps2 game discs ps2 classics re-released ps3 compatible ps4 system arabic chinese simplified chinese traditional czech danish dutch english united kingdom english united states french canada french france finnish german greek hungarian indonesian italian japanese korean norwegian polish portuguese brazil portuguese portugal russian romanian spanish latin america spanish spain swedish thai turkish vietnamese initial version system software playstation 4 1.01 pre-installed original consoles support remote play second screen experiences added version 1.50 launched day playstation 4 console released north america november 15 2013 features accessible playstation vita console using ps4 link application second screen functionality also accessible smartphones tablets playstation mobile app also able record share video clips well broadcasting gameplay twitch.tv ustream supports blu-ray dvd-video playback version 1.60 released february 4 2014 improving dvd playback version 1.60 also adds support pulse elite wireless headsets version 1.70 released april 30 2014 adds number new features addition rich video editor called sharefactory offers users tools combine edit personalize captured video clips update also adds abilities share video clips screenshots streaming copy video clips screenshots usb storage version 1.75 released july 29 2014 adding support playback blu-ray 3d also improves sound quality 1.5-speed playback blu-ray dvd video version 1.76 released september 2 2014 came minor changes last update version 2.0 released october 28 2014 version 2.00 major upgrade playstation 4 system software among features introduced share play allows playstation plus users invite online friend join play session via streaming even copy game users pass control game entirely remote user partake cooperative multiplayer physically present version also adds youtube app ability upload video clips youtube users play music stored usb storage devices also support custom themes ability change background color users set themes home screens function screens user version version 2.50 released march 26 2015 adding suspend/resume feature allow players jump games ps button games suspended low-power rest mode instead closing completely version also allows console hard drive backed restored usb flash drive september 30 2015 sony released ps4 update 3.00 introduced entirely new features user-interface enhancements among new features ability share videos directly twitter dedicated playstation plus section tweaks interface streaming youtube improvements social features messages group creation ability save screenshots pngs increase online storage capacity 1 gb 10 gb also introduced playstation plus members sony states update create new ways connect friends players around world expanding social capabilities system even april 6 2016 sony released ps4 update 3.50 would enable ps4 use remote play functionality windows macos formerly named os x vg247 reported update allow remote play functionality computers running windows 8.1 windows 10 os x yosemite os x el capitan furthermore article explains remote play support resolution options 360p 540p 720p frame rate options 30 fps 60 fps one dualshock 4 controller connected via computer usb port september 13 2016 sony released ps4 update 4.00 added high dynamic range hdr home screen folder support 1080p streaming tweaks menus game info screens greater overview streamlined interfaces march 9 2017 sony released next major firmware update version 4.50 update includes support installing applications external hard drives custom wallpapers refined quick menu simplified notifications list custom status updates new 3d blu-ray support playstation vr includes support preloading game patches however developer make use first game take advantage feature littlebigplanet 3 october 3 2017 sony released ps4 update 5.00 overhauling master/sub-account system update allows customization accounts family members roles applying parental controls account groups system replaced new friends management system along support 5.1 7.1 surround sound configurations playstation vr new tournament bracket viewer made along tweaks broadcasting 1080p streaming 60 frames per second twitch possible changes ps message notifications quick menu lastly introduces localization czech greek hungarian indonesian romanian thai vietnamese languages 5.50 released march 8 2018 includes playtime restrictions child accounts ability hide applications library custom wallpapers via usb supersampling mode ps4 pro ability delete notifications september 13 2018 sony released ps4 update 6.00 major feature added ability use remote play ios devices minor improvements may 10 2019 sony interactive entertainment added ability remove purchased games download list playstation store delete games profile gaming platforms sony gaming platforms generation gaming platforms seventh generation", + "neighbors": [ + 38, + 101, + 106, + 116, + 162, + 189, + 290, + 306, + 629, + 682, + 754, + 893, + 899, + 927, + 992, + 1027, + 1138, + 1232, + 1301, + 1318, + 1322, + 1397, + 1503 + ], + "mask": "Test" + }, + { + "node_id": 1522, + "label": 2, + "text": "Nokia_N86_8MP:nokia n86 8mp nokia n86 8mp high-end smartphone announced 17 february 2009 released may 2009 runs symbian os 9.3 s60 3rd edition fp2 part nseries shares similar design features n97 one main selling points carl zeiss photography features nokia first camera phone 8 megapixel sensor although late compared manufacturers features multiple aperture settings mechanical shutter uncommon features standards camera phones carl zeiss lens wide angle view 28 mm equivalent also auto focus dual led flash 3rd generation dual-leds af assist light video capture resolution 640 \u00d7 480 pixels vga 30 frames per second n86 continuous form factor nokia n95 n85 dual-sliding form factor whilst adding toughened glass front cover metal detailing keypad making look feel premium 2.6-inch amoled display fast 434 mhz processor 8 gb internal memory also kickback stand n85 possible use small standalone screen possible configure opening stand launch applications video player also supports n-gage gaming platform n86 8mp regarded spiritual successor n95 8gb due feature set sliding form factor commercial failure n96 regard successor n82 due camera n86 8mp 3.5g 3.75g 3gpp device dual-band hsdpa support quad-band gsm wi-fi a-gps receiver links location-based services via nokia maps photographs automatically geo-tagged also built-in digital compass fm radio also fm transmitter rated give 6 hours talktime 25 hours music playback 11 days standby full charge optional dvb-h nokia mobile tv receiver su-33w possible watch television screen phone ovi maps 3.03 free navigation released 17 march 2010 nokia n86 new version available via sw update application file size 8.24 mb n86 e72 e55 e52 6730 6710 s60 3rd edition feature pack 2 nokia symbian^1 s60 5th edition devices get experience beta-testing free navigation 6 july 2009 nokia n86 8mp received big firmware upgrade v11.043 brought official ovi store compatibility ovi web site shortcut option download dedicated client camera tweaks usual early firmware bug fixes improvements 30 september 2009 nokia n86 8mp received v20 firmware upgrade full week ahead schedule 8 mb large air ota update significant changes improved still image video quality close-up focus face detection indicated yellow square red-eye removal added new focus point indication shows scene camera focusing 11 january 2010 nokia n86 8mp got minor update v21 firmware version 21.006 replaced v20.115 maintenance release improving performance fixing number minor bugs 15 april 2010 version 30.009 firmware mainly features latest ovi maps client available via nokia software update 142 mb air 5085 kb includes latest ovi maps 3.03 free navigation sharing location via facebook realplayer interface tweaked d-pad problem playing videos usual minor fixes improvements 20 may 2010 includes latest ovi maps 3.04 new version adds formal support wifi positioning method part overhaul positioning functionality plus significant performance improvements search zooming map panning number consumer-friendly ui tweaks addition qype information places database nokia n87 successor n86 leaked internet full specifications december 2009 early 2010 however never released instead touchscreen nokia n8 introduced november 2010 prototype n87 appeared ebay shows running probably symbian^3 listing removed time seller nokia would never release another high-end non-touchscreen device n86 8mp", + "neighbors": [ + 3, + 21, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1529, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1523, + "label": 3, + "text": "Tomasulo_algorithm:tomasulo algorithm tomasulo \u2019 algorithm computer architecture hardware algorithm dynamic scheduling instructions allows out-of-order execution enables efficient use multiple execution units developed robert tomasulo ibm 1967 first implemented ibm system/360 model 91 \u2019 floating point unit major innovations tomasulo \u2019 algorithm include register renaming hardware reservation stations execution units common data bus cdb computed values broadcast reservation stations may need developments allow improved parallel execution instructions would otherwise stall use scoreboarding earlier algorithms robert tomasulo received eckert\u2013mauchly award 1997 work algorithm following concepts necessary implementation tomasulo algorithm common data bus cdb connects reservation stations directly functional units according tomasulo preserves precedence encouraging concurrency two important effects instructions issued sequentially effects sequence instructions exceptions raised instructions occur order would in-order processor regardless fact executed out-of-order i.e non-sequentially tomasulo algorithm uses register renaming correctly perform out-of-order execution general-purpose reservation station registers hold either real value placeholder value real value unavailable destination register issue stage placeholder value initially used placeholder value tag indicating reservation station produce real value unit finishes broadcasts result cdb placeholder replaced real value functional unit single reservation station reservation stations hold information needed execute single instruction including operation operands functional unit begins processing free source operands needed instruction real practically speaking may exceptions enough status information exception available case processor may raise special exception called imprecise exception imprecise exceptions occur non-oooe implementations processor state changed program order see risc pipeline exceptions programs experience precise exceptions specific instruction took exception determined restart re-execute point exception however experience imprecise exceptions generally restart re-execute system determine specific instruction took exception three stages listed stages instruction passes time issued time execution complete issue stage instructions issued execution operands reservation stations ready else stalled registers renamed step eliminating war waw hazards execute stage instruction operations carried instructions delayed step operands available eliminating raw hazards program correctness maintained effective address calculation prevent hazards memory write result stage alu operations results written back registers store operations written back memory concepts reservation stations register renaming common data bus tomasulo algorithm presents significant advancements design high-performance computers reservation stations take responsibility waiting operands presence data dependencies inconsistencies varying storage access time circuit speeds thus freeing functional units improvement overcomes long floating point delays memory accesses particular algorithm tolerant cache misses additionally programmers freed implementing optimized code result common data bus reservation station working together preserve dependencies well encouraging concurrency tracking operands instructions reservation stations register renaming hardware algorithm minimizes read-after-write raw eliminates write-after-write waw write-after-read war computer architecture hazards improves performance reducing wasted time would otherwise required stalls equally important improvement algorithm design limited specific pipeline structure improvement allows algorithm widely adopted multiple-issue processors additionally algorithm easily extended enable branch speculation tomasulo algorithm outside ibm unused several years implementation system/360 model 91 architecture however saw vast increase usage 1990s 3 reasons many modern processors implement dynamic scheduling schemes derivative tomasulo \u2019 original algorithm including popular intel x86-64 chips", + "neighbors": [ + 76, + 85, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 314, + 335, + 388, + 445, + 457, + 460, + 508, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 980, + 984, + 994, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1505, + 1507, + 1518, + 1519, + 1525, + 1557, + 1632 + ], + "mask": "Train" + }, + { + "node_id": 1524, + "label": 2, + "text": "List_of_Linux_adopters:list linux adopters linux adopters organizations individuals moved operating systems linux local governments come pressure institutions world trade organization international intellectual property alliance turned linux free software affordable legal alternative pirated software expensive proprietary computer products microsoft apple commercial companies spread linux affords leverage countries companies developed world bid government contracts since low-cost option exists furnishing alternative path development countries like india pakistan many citizens skilled computer applications afford technological investment first world prices cost factor one considered though \u2013 many governmental institutions public military sectors north america european union make transition linux due superior stability openness source code turn leverages information security linux often used technical disciplines universities research centres due several factors including linux available free charge includes large body free/open-source software extent technical competence computer science software engineering academics also contributor stability maintainability upgradability ibm ran advertising campaign entitled linux education featuring young boy supposed linux examples large scale adoption linux education include following linux used extensively servers businesses long time linux also used corporate environments desktop platform employees commercially available solutions including red hat enterprise linux suse linux enterprise desktop ubuntu", + "neighbors": [ + 85, + 134, + 209, + 211, + 213, + 219, + 227, + 265, + 267, + 275, + 294, + 305, + 327, + 380, + 400, + 401, + 431, + 571, + 630, + 650, + 664, + 688, + 716, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1167, + 1197, + 1208, + 1225, + 1241, + 1252, + 1287, + 1313, + 1357, + 1360, + 1361, + 1391, + 1456, + 1468, + 1509, + 1526, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1525, + "label": 3, + "text": "Hazard_(computer_architecture):hazard computer architecture domain central processing unit cpu design hazards problems instruction pipeline cpu microarchitectures next instruction execute following clock cycle potentially lead incorrect computation results three common types hazards data hazards structural hazards control hazards branching hazards several methods used deal hazards including pipeline stalls/pipeline bubbling operand forwarding case out-of-order execution scoreboarding method tomasulo algorithm instructions pipelined processor performed several stages given time several instructions processed various stages pipeline fetch execute many different instruction pipeline microarchitectures instructions may executed out-of-order hazard occurs two simultaneous possibly order instructions conflict data hazards occur instructions exhibit data dependence modify data different stages pipeline ignoring potential data hazards result race conditions also termed race hazards three situations data hazard occur consider two instructions occurring program order read write raw data hazard refers situation instruction refers result yet calculated retrieved occur even though instruction executed prior instruction prior instruction processed partly pipeline example first instruction calculating value saved register second going use value compute result register however pipeline operands fetched 2nd operation results first yet saved hence data dependency occurs data dependency occurs instruction dependent completion instruction write read war data hazard represents problem concurrent execution example situation chance may finish i.e. concurrent execution must ensured result register stored chance fetch operands write write waw data hazard may occur concurrent execution environment example write back wb must delayed finishes executing structural hazard occurs part processor hardware needed two instructions time canonical example single memory unit accessed fetch stage instruction retrieved memory memory stage data written and/or read memory often resolved separating component orthogonal units separate caches bubbling pipeline detected using hazard control unit branching hazards also termed control hazards occur branches many instruction pipeline microarchitectures processor know outcome branch needs insert new instruction pipeline normally fetch stage bubbling pipeline also termed pipeline break pipeline stall method preclude data structural branch hazards instructions fetched control logic determines whether hazard could/will occur true control logic inserts pipeline thus next instruction would cause hazard executes prior one sufficient time finish prevent hazard number equals number stages pipeline processor cleared instructions proceed free hazards forms stalling introduce delay processor resume execution flushing pipeline occurs branch instruction jumps new memory location invalidating prior stages pipeline prior stages cleared allowing pipeline continue new instruction indicated branch several main solutions algorithms used resolve data hazards case out-of-order execution algorithm used task removing data dependencies delegated compiler fill appropriate number instructions dependent instructions ensure correct operation re-order instructions possible example write value 3 register 1 already contains 6 add 7 register 1 store result register 2 i.e following execution register 2 contain value 10 however i1 write 3 register 1 fully exit pipeline i2 starts executing means r1 contain value 3 i2 performs addition event i2 adds 7 old value register 1 6 register 2 contains 13 instead i.e error occurs i2 reads register 1 i1 committed/stored result write operation register 1 i2 reading contents register 1 register 1 still contains 6 3 forwarding described helps correct errors depending fact output i1 3 used subsequent instructions value 3 committed to/stored register 1 forwarding applied example means wait commit/store output i1 register 1 example output 3 making output available subsequent instruction case i2 effect i2 uses correct recent value register 1 commit/store made immediately pipelined forwarding enabled instruction decode/execution id/ex stage pipeline two inputs value read register specified example value 6 register 1 new value register 1 example value 3 sent next stage instruction execute/memory access ex/mem added control logic used determine input use avoid control hazards microarchitectures event branch causes pipeline bubble incorrect instructions entered pipeline care must taken prevent wrongly-loaded instructions effect processor state excluding energy wasted processing discovered loaded incorrectly memory latency another factor designers must attend delay could reduce performance different types memory different accessing time memory thus choosing suitable type memory designers improve performance pipelined data path", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 876, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1557, + 1608, + 1616, + 1632 + ], + "mask": "Train" + }, + { + "node_id": 1526, + "label": 2, + "text": "Smack_(software):smack software smack full name simplified mandatory access control kernel linux kernel security module protects data process interaction malicious manipulation using set custom mandatory access control mac rules simplicity main design goal officially merged since linux 2.6.25 release main access control mechanism meego mobile operating system also used sandbox html5 web applications tizen architecture commercial wind river linux solutions embedded device development philips digital tv products. intel ostro os iot devices since 2016 smack required automotive grade linux agl implementations provides association linux facilities base agl security framework smack consists three components smack criticized written new lsm module instead selinux security policy provide equivalent functionality selinux policies proposed none demonstrated smack author replied would practical due selinux complicated configuration syntax philosophical difference smack selinux designs", + "neighbors": [ + 134, + 213, + 219, + 265, + 267, + 294, + 305, + 327, + 346, + 379, + 400, + 401, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1138, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1558, + 1602, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1527, + "label": 4, + "text": "Promiscuous_mode:promiscuous mode computer networking promiscuous mode mode wired network interface controller nic wireless network interface controller wnic causes controller pass traffic receives central processing unit cpu rather passing frames controller specifically programmed receive mode normally used packet sniffing takes place router computer connected wired network one part wireless lan interfaces placed promiscuous mode software bridges often used hardware virtualization ieee 802 networks ethernet ieee 802.11 frame includes destination mac address non-promiscuous mode nic receives frame drops unless frame addressed nic mac address broadcast multicast addressed frame promiscuous mode however nic allows frames thus allowing computer read frames intended machines network devices many operating systems require superuser privileges enable promiscuous mode non-routing node promiscuous mode generally monitor traffic nodes within broadcast domain ethernet ieee 802.11 ring token ring computers attached ethernet hub satisfy requirement network switches used combat malicious use promiscuous mode router may monitor traffic routes promiscuous mode often used diagnose network connectivity issues programs make use feature show user data transferred network protocols like ftp telnet transfer data passwords clear text without encryption network scanners see data therefore computer users encouraged stay away insecure protocols like telnet use secure ones ssh promiscuous mode used malicious way capture private data transit network computer security professionals might interested detecting network devices promiscuous mode promiscuous mode software might send responses frames even though addressed another machine however experienced sniffers prevent e.g. using carefully designed firewall settings example sending ping icmp echo request wrong mac address right ip address adapter operating normal mode drop frame ip stack never sees responds adapter promiscuous mode frame passed ip stack machine mac address meaning respond would ping sniffer prevent configuring firewall block icmp traffic following applications applications classes use promiscuous mode", + "neighbors": [ + 138, + 270, + 289, + 299, + 379, + 512, + 598, + 1042, + 1045, + 1138, + 1279, + 1337, + 1400, + 1452, + 1513, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1528, + "label": 8, + "text": "Libwww:libwww libwww library world wide web modular client-side web api unix windows also name reference implementation libwww api used applications varying sizes including web browsers editors internet bots batch tools pluggable modules provided libwww add support http/1.1 caching pipelining post digest authentication deflate purpose libwww serve testbed protocol experiments software developers reinvent wheel libcurl considered modern replacement libwww 1991 1992 tim berners-lee student cern named jean-fran\u00e7ois groff rewrote various components original worldwideweb browser nextstep operating system portable c code order demonstrate potential world wide web beginning libwww referred common library available separate product becoming generally available libwww integrated cern program library cernlib july 1992 library ported decnet may 1993 world wide web newsletter berners-lee announced common library called libwww licensed public domain encourage development web browsers initially considered releasing software gnu general public license rather public domain decided due concerns large corporations ibm would deterred using restrictions gpl rapid early development library caused robert cailliau problems integrating macwww browser 25 november 1994 version 2.17 henrik frystyk nielsen responsible libwww 21 march 1995 release version 3.0 cern put full responsibility libwww world wide web consortium w3c 1995 onwards line mode browser longer released separately part libwww package w3c created arena web browser testbed testing tool html3 css png features like libwww beta 3 arena replaced amaya 2 september 2003 w3c stopped development library due lack resources expectation development would come open source community libwww supports following protocols features include libwww supports plug-ins 19 applications used libwww integrated applications libwww developers libcurl criticised libwww portable thread-safe lacking several http authentication types neither libcurl libwww lightweight enough projects", + "neighbors": [ + 12, + 14, + 16, + 83, + 95, + 107, + 134, + 258, + 277, + 306, + 412, + 452, + 470, + 491, + 509, + 530, + 580, + 582, + 623, + 627, + 668, + 680, + 684, + 713, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1376, + 1378, + 1423, + 1424, + 1470, + 1550, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1529, + "label": 2, + "text": "Nokia_C5-03:nokia c5-03 nokia c5-03 budget resistive touchscreen smartphone wlan cseries released december 2010 phone shazam music identification software social networking software included available download assisted gps ovi maps 3.0 integrated", + "neighbors": [ + 3, + 21, + 112, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1619 + ], + "mask": "Validation" + }, + { + "node_id": 1530, + "label": 3, + "text": "Exokernel:exokernel exokernel operating system kernel developed mit parallel distributed operating systems group also class similar operating systems operating systems generally present hardware resources applications high-level abstractions virtual file systems idea behind exokernels force abstractions possible application developers enabling make many decisions possible hardware abstractions exokernels tiny since functionality limited ensuring protection multiplexing resources considerably simpler conventional microkernels implementation message passing monolithic kernels implementation high-level abstractions implemented applications called library operating systems may request specific memory addresses disk blocks etc kernel ensures requested resource free application allowed access low-level hardware access allows programmer implement custom abstractions omit unnecessary ones commonly improve program performance also allows programmers choose level abstraction want high low exokernels seen application end-to-end principle operating systems force application program layer abstractions top abstractions designed different requirements mind example mit exokernel project cheetah web server stores preformatted internet protocol packets disk kernel provides safe access disk preventing unauthorized reading writing disk abstracted application libraries application uses traditionally kernel designers sought make individual hardware resources invisible application programs requiring programs interact hardware via abstraction model models include file systems disk storage virtual address spaces memory schedulers task management sockets network communication abstractions hardware make easier write programs general limit performance stifle experimentation new abstractions security-oriented application might need file system leave old data disk reliability-oriented application might need file system keeps data failure recovery one option remove kernel completely program directly hardware entire machine would dedicated application written conversely entire application codebase would dedicated machine exokernel concept compromise let kernel allocate basic physical resources machine e.g disk blocks memory pages processor time multiple application programs let program decide resources program link support library implements abstractions needs implement mit developed two exokernel-based operating systems using two kernels aegis proof concept limited support storage xok applied exokernel concept thoroughly essential idea mit exokernel system operating system act executive small programs provided application software constrained requirement exokernel must able guarantee use hardware safely mit exokernel manages hardware resources follows available library operating systems exokernel include custom exos system emulator bsd addition exokernel team created cheetah web server uses kernel directly exokernel concept around since least 1994 exokernels still research effort used major commercial operating systems concept operating exokernel system nemesis written university cambridge university glasgow citrix systems swedish institute computer science mit also built several exokernel-based systems including exos", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 99, + 134, + 170, + 171, + 185, + 187, + 265, + 322, + 353, + 380, + 387, + 413, + 434, + 442, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 728, + 754, + 771, + 797, + 860, + 884, + 891, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1057, + 1063, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1474, + 1494, + 1538, + 1546, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Train" + }, + { + "node_id": 1531, + "label": 2, + "text": "Sticky_Notes:sticky notes sticky notes desktop notes application included windows 7 windows 8 windows 10 present windows vista gadget windows sidebar originated windows xp tablet edition 2002 program allows users take notes using post-it note\u2013like windows desktop according microsoft employee eight million monthly sticky notes users april 2016 original sticky notes gadget one many included vista although gadgets continued windows 7 sticky notes removed list made standalone app built win32 platform could still open startup version directly support pen input default color yellow five colors offered sticky notes jumplists taskbar preview shows notes stack sticky notes automatically saved version reused windows 8 initial releases windows 10 windows 10 anniversary update new version built universal windows platform introduced launched standalone app part windows ink workspace latter method causes space behind notes become blurred new version directly accepts pen input recognize words letters handwritten text new sticky notes provides stock information ticker typed written provides flight info flight number typed written cortana integration create reminders notes include date unlike windows 7 version version taskbar preview shows stock image rather notes user created originally jump list added back version 1.6.2 february 6 2017 sticky notes sync notes across multiple devices windows 10 also ios android devices running microsoft onenote web client edit sticky notes also available onenote website obscure codice_1 location", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1193, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1533, + 1545, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1532, + "label": 9, + "text": "Comparison_of_multi-paradigm_programming_languages:comparison multi-paradigm programming languages programming languages grouped number types paradigms supported concise reference programming paradigms listed article", + "neighbors": [ + 31, + 65, + 78, + 117, + 216, + 246, + 308, + 373, + 378, + 392, + 396, + 447, + 509, + 538, + 567, + 579, + 592, + 682, + 756, + 824, + 825, + 926, + 948, + 1028, + 1044, + 1120, + 1225, + 1227, + 1235, + 1251, + 1264, + 1311, + 1319, + 1320, + 1324, + 1389 + ], + "mask": "Test" + }, + { + "node_id": 1533, + "label": 2, + "text": "Mandatory_Integrity_Control:mandatory integrity control context microsoft windows family operating systems mandatory integrity control mic core security feature introduced windows vista implemented subsequent desktop line windows operating systems adds integrity levels il -based isolation running processes il represents level trustworthiness object mechanism goal use pre-existing integrity control policies involved objects il selectively restrict access permissions contexts considered potentially less trustworthy compared contexts running user account trusted mandatory integrity control defined using new access control entry ace type represent object il security descriptor windows access control lists acls used grant access rights read write execute permissions privileges users groups il assigned subject access token initialized subject tries access object example file security reference monitor compares integrity level subject access token integrity level object security descriptor windows restricts allowed access rights depending whether subject il higher lower object depending integrity policy flags new access control entry ace security subsystem implements integrity level mandatory label distinguish discretionary access user control acls provide windows vista defines four integrity levels low sid s-1-16-4096 medium sid s-1-16-8192 high sid s-1-16-12288 system sid s-1-16-16384 default processes started regular user gain medium il elevated processes high il introducing integrity levels mic allows classes applications isolated enabling scenarios like sandboxing potentially-vulnerable applications internet-facing applications processes low il called low-integrity processes less access processes higher ils access control enforcement windows objects access control lists named objects including files registry keys even processes threads entry system access control list governing access defines minimum integrity level process use object windows makes sure process write delete object integrity level equal higher requested integrity level specified object additionally privacy reasons process objects higher il out-of-bounds even read access processes lower il consequently process interact another process higher il process perform functions inject dll higher il process using codice_1 api function send data different process using codice_2 function processes inherit integrity level process spawned integrity level customized time process creation well defining boundary window messages user interface privilege isolation uipi technology mandatory integrity control used applications like adobe reader google chrome internet explorer windows explorer isolate documents vulnerable objects system internet explorer 7 introduces mic-based protected mode setting control whether web page opened low-integrity process provided operating system supports mic based security zone settings thereby preventing classes security vulnerabilities since internet explorer case runs low il process modify system level objects\u2014file registry operations instead virtualized adobe reader 10 google chrome two notable applications introducing technology order reduce vulnerability malware microsoft office 2010 introduced protected view isolated sandbox environment excel powerpoint word prohibits potentially unsafe documents modifying components files resources system protected view operates low-integrity process windows vista later versions windows uses mic uipi restrict sandbox however cases higher il process need execute certain functions lower il process lower il process need access resources higher il process access example viewing webpage protected mode save file downloaded internet folder specified user high il low il processes still communicate using files named pipes lpc shared objects shared object must integrity level low low il process shared low il high il processes since mic prevent low il process sharing objects higher il process trigger flaws higher il process work behalf low il process thereby causing squatting attack shatter attacks however prevented using user interface privilege isolation takes advantage mic", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 185, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 365, + 433, + 435, + 485, + 521, + 531, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1084, + 1092, + 1098, + 1109, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1545, + 1547, + 1561, + 1586, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1534, + "label": 4, + "text": "Public_key_infrastructure:public key infrastructure public key infrastructure pki set roles policies hardware software procedures needed create manage distribute use store revoke digital certificates manage public-key encryption purpose pki facilitate secure electronic transfer information range network activities e-commerce internet banking confidential email required activities simple passwords inadequate authentication method rigorous proof required confirm identity parties involved communication validate information transferred cryptography pki arrangement binds public keys respective identities entities like people organizations binding established process registration issuance certificates certificate authority ca depending assurance level binding may carried automated process human supervision pki role assures valid correct registration called registration authority ra ra responsible accepting requests digital certificates authenticating entity making request microsoft pki registration authority usually called subordinate ca entity must uniquely identifiable within ca domain basis information entity third-party validation authority va provide entity information behalf ca x.509 standard defines commonly used format public key certificates public key cryptography cryptographic technique enables entities securely communicate insecure public network reliably verify identity entity via digital signatures public key infrastructure pki system creation storage distribution digital certificates used verify particular public key belongs certain entity pki creates digital certificates map public keys entities securely stores certificates central repository revokes needed pki consists broadly speaking traditionally three approaches getting trust certificate authorities cas web trust wot simple public key infrastructure spki primary role ca digitally sign publish public key bound given user done using ca private key trust user key relies one trust validity ca key ca third party separate user system called registration authority ra may may separate ca key-to-user binding established depending level assurance binding software human supervision term trusted third party ttp may also used certificate authority ca moreover pki often used synonym ca implementation model trust relationships ca trusted third party \u2013 trusted subject owner certificate party relying upon certificate according netcraft industry standard monitoring active transport layer security tls certificates states that- although global tls ecosystem competitive dominated handful major cas \u2014 three certificate authorities symantec comodo godaddy account three-quarters issued tls certificates public-facing web servers top spot held symantec verisign purchased symantec ever since survey began currently accounting third certificates illustrate effect differing methodologies amongst million busiest sites symantec issued 44 valid trusted certificates use \u2014 significantly overall market share approach involves server acts offline certificate authority within single sign-on system single sign-on server issue digital certificates client system never stores users execute programs etc temporary certificate common find solution variety x.509-based certificates alternative approach problem public authentication public key information web-of-trust scheme uses self-signed certificates third party attestations certificates singular term web trust imply existence single web trust common point trust rather one number potentially disjoint webs trust examples implementations approach pgp pretty good privacy gnupg implementation openpgp standardized specification pgp pgp implementations allow use e-mail digital signatures self-publication public key information relatively easy implement one web trust one benefits web trust pgp inter-operate pki ca fully trusted parties domain internal ca company willing guarantee certificates trusted introducer web trust completely trusted nature web trust trusting one certificate granting trust certificates web pki valuable standards practices control issuance certificates including pgp personally instituted web trust could significantly degrade trustworthiness enterprise domain implementation pki web trust concept first put forth pgp creator phil zimmermann 1992 manual pgp version 2.0 another alternative deal public authentication public key information simple public key infrastructure spki grew three independent efforts overcome complexities x.509 pgp web trust spki associate users persons since key trusted rather person spki use notion trust verifier also issuer called authorization loop spki terminology authorization integral design emerging approach pki use blockchain technology commonly associated modern cryptocurrency since blockchain technology aims provide distributed unalterable ledger information qualities considered highly suitable storage management public keys cryptocurrencies support storage different public key types ssh gpg rfc 2230 etc provides open source software directly supports pki openssh servers blockchain technology approximate proof work often underpinning confidence trust relying parties pki issues remain administrative conformance policy operational security software implementation quality certificate authority paradigm issues regardless underlying cryptographic methods algorithms employed pki seeks endow certificates trustworthy properties must also address issues list known blockchain-based pki developments pki occurred early 1970s british intelligence agency gchq james ellis clifford cocks others made important discoveries related encryption algorithms key distribution however developments gchq highly classified results work kept secret publicly acknowledged mid-1990s public disclosure secure key exchange asymmetric key algorithms 1976 diffie hellman rivest shamir adleman changed secure communications entirely development high-speed digital electronic communications internet predecessors need became evident ways users could securely communicate consequence ways users could sure actually interacting assorted cryptographic protocols invented analyzed within new cryptographic primitives could effectively used invention world wide web rapid spread need authentication secure communication became still acute commercial reasons alone e.g. e-commerce online access proprietary databases web browsers sufficient taher elgamal others netscape developed ssl protocol 'https web urls included key establishment server authentication prior v3 one-way pki structure thus created web users/sites wishing secure communications vendors entrepreneurs saw possibility large market started companies new projects existing companies began agitate legal recognition protection liability american bar association technology project published extensive analysis foreseeable legal aspects pki operations see aba digital signature guidelines shortly thereafter several u.s. states utah first 1995 jurisdictions throughout world began enact laws adopt regulations consumer groups raised questions privacy access liability considerations taken consideration jurisdictions others enacted laws regulations differed technical operational problems converting pki schemes successful commercial operation progress much slower pioneers imagined would first years 21st century underlying cryptographic engineering clearly easy deploy correctly operating procedures manual automatic easy correctly design even designed execute perfectly engineering required standards existed insufficient pki vendors found market quite market envisioned mid-1990s grown slowly somewhat different ways anticipated pkis solved problems expected several major vendors gone business acquired others pki success government implementations largest pki implementation date defense information systems agency disa pki infrastructure common access cards program pkis one type another several vendors many uses including providing public keys bindings user identities used argue purchasing certificates securing websites ssl securing software code signing costly venture small businesses however emergence free alternatives let encrypt changed presently symantec holds major share pki certificate market sold one third certificates issued globally 2013 http/2 latest version http protocol allows unsecured connections theory practice major browser companies made clear would support state-of-art protocol pki secured tls connection web browser implementation http/2 including edge microsoft chrome google firefox mozilla opera supports http/2 tls using alpn extension tls protocol would mean get speed benefits http/2 website owners would forced purchase ssl certificates controlled corporations symantec current web browsers carry pre-installed intermediary certificates issued signed certificate authority means browsers need carry large number different certificate providers increasing risk key compromise key known compromised could fixed revoking certificate compromise easily detectable huge security breach browsers issue security patch revoke intermediary certificates issued compromised root certificate authority practical security vulnerabilities x.509 certificates known cases keys stolen major certificate authority listed", + "neighbors": [ + 14, + 88, + 111, + 120, + 134, + 148, + 172, + 235, + 260, + 261, + 289, + 306, + 319, + 528, + 533, + 539, + 542, + 554, + 692, + 762, + 782, + 826, + 1003, + 1089, + 1151, + 1228, + 1240, + 1266, + 1318, + 1331, + 1452, + 1585, + 1597, + 1624, + 1627 + ], + "mask": "Test" + }, + { + "node_id": 1535, + "label": 4, + "text": "Principle_of_least_privilege:principle least privilege information security computer science fields principle least privilege polp also known principle minimal privilege principle least authority requires particular abstraction layer computing environment every module process user program depending subject must able access information resources necessary legitimate purpose principle means giving user account process privileges essential perform intended function example user account sole purpose creating backups need install software hence rights run backup backup-related applications privileges installing new software blocked principle applies also personal computer user usually work normal user account opens privileged password protected account superuser situation absolutely demands applied users terms least user access least-privileged user account lua also used referring concept user accounts times run privileges possible also launch applications privileges possible principle least privilege widely recognized important design consideration enhancing protection data functionality faults fault tolerance malicious behavior computer security benefits principle include practice exist multiple competing definitions true least privilege program complexity increases exponential rate number potential issues rendering predictive approach impractical examples include values variables may process addresses need precise time things required object capability systems allow instance deferring granting single-use privilege time used currently closest practical approach eliminate privileges manually evaluated unnecessary resulting set privileges typically exceeds true minimum required privileges process another limitation granularity control operating environment privileges individual process practice rarely possible control process access memory processing time i/o device addresses modes precision needed facilitate precise set privileges process require original formulation jerome saltzer peter j. denning paper fault tolerant operating systems set broader perspective among four fundamental principles fault tolerance dynamic assignments privileges earlier discussed roger needham 1972 historically oldest instance least privilege probably source code login.c begins execution super-user permissions and\u2014the instant longer necessary\u2014dismisses via setuid non-zero argument demonstrated version 6 unix source code kernel always runs maximum privileges since operating system core hardware access one principal responsibilities operating system particularly multi-user operating system management hardware availability requests access running processes kernel crashes mechanisms maintains state also fail therefore even way cpu recover without hard reset security continues enforced operating system properly respond failure possible detect failure kernel execution either halted program counter resumed execution somewhere endless and\u2014usually\u2014non-functional loop would akin either experiencing amnesia kernel execution failure trapped closed maze always returns starting point closed loops execution picks crash loading running trojan code author trojan code usurp control processes principle least privilege forces code run lowest privilege/permission level possible means code resumes code execution-whether trojan simply code execution picking unexpected location\u2014would ability perform malicious undesirable processes one method used accomplish implemented microprocessor hardware example intel x86 architecture manufacturer designed four ring 0 ring 3 running modes graduated degrees access-much like security clearance systems defence intelligence agencies implemented operating systems processes execute potential privilege set active privilege set privilege sets inherited parent determined semantics fork executable file performs privileged function\u2014thereby technically constituting component tcb concomitantly termed trusted program trusted process\u2014may also marked set privileges logical extension notions set user id set group id inheritance file privileges process determined semantics exec family system calls precise manner potential process privileges actual process privileges file privileges interact become complex practice least privilege practiced forcing process run privileges required task adherence model quite complex well error-prone trusted computer system evaluation criteria tcsec concept trusted computing base tcb minimization far stringent requirement applicable functionally strongest assurance classes viz b3 a1 evidentiarily different functionally identical least privilege often associated privilege bracketing assuming necessary privileges last possible moment dismissing soon longer strictly necessary therefore ostensibly reducing fallout erroneous code unintentionally exploits privilege merited least privilege also interpreted context distribution discretionary access control dac permissions example asserting giving user u read/write access file f violates least privilege u complete authorized tasks read permission", + "neighbors": [ + 270, + 379, + 439, + 531, + 590, + 595, + 682, + 961, + 1011, + 1039, + 1090, + 1138, + 1224, + 1310, + 1379, + 1629 + ], + "mask": "Test" + }, + { + "node_id": 1536, + "label": 9, + "text": "McCLIM:mcclim mcclim free software implementation common lisp interface manager project named mike mcdonald person started", + "neighbors": [ + 27, + 46, + 99, + 117, + 194, + 251, + 258, + 306, + 308, + 313, + 332, + 392, + 394, + 446, + 447, + 506, + 509, + 536, + 565, + 567, + 649, + 653, + 682, + 686, + 753, + 787, + 796, + 815, + 919, + 929, + 934, + 947, + 961, + 978, + 1021, + 1068, + 1118, + 1119, + 1123, + 1173, + 1189, + 1190, + 1207, + 1221, + 1225, + 1227, + 1235, + 1245, + 1251, + 1277, + 1298, + 1311, + 1315, + 1375, + 1389, + 1413, + 1430, + 1466, + 1502, + 1516, + 1588, + 1609, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 1537, + "label": 4, + "text": "White_Ops:white ops white ops ad verification bot detection cybersecurity firm white ops cofounded chief scientist dan kaminsky 2012 white ops president michael tiffany ash kalb tamer hassan ceo company gene fay company \u2019 coo headquartered new york city international offices 2016 discovered methbot network bots six thousand online publishers platforms affected including facebook generating 3- 5 million fraudulent ad revenue per day 2017 white ops uncovered 3ve bot network one largest ad fraud enterprises yet discovered 1.7 infected computers leading thirteen department justice indictments 2018 investigation network google fbi originally operating prevent ad fraud online 2018 white ops expanded ad fraud activities include television detects bots bot networks uses human verification part process processes trillion transactions per month 2018 white ops produced reports ad fraud association national advertisers since 2014 2017 white ops began partnering trade desk block fraudulent impressions advertisers make bids following year 2018 whiteops began similar partnership beachfront media video management platform telaria white ops also partners adobe advertising cloud provide independent third-party bot detection 2019 white ops began partnering media.net", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1538, + "label": 2, + "text": "Comparison_of_open-source_operating_systems:comparison open-source operating systems tables compare free software open-source operating systems versions support feature first version supports listed", + "neighbors": [ + 34, + 42, + 58, + 65, + 78, + 85, + 117, + 134, + 171, + 189, + 193, + 195, + 210, + 306, + 322, + 326, + 331, + 333, + 444, + 457, + 528, + 557, + 558, + 567, + 682, + 779, + 805, + 806, + 812, + 887, + 893, + 935, + 948, + 961, + 974, + 997, + 1002, + 1011, + 1016, + 1049, + 1057, + 1124, + 1126, + 1138, + 1143, + 1157, + 1167, + 1206, + 1208, + 1225, + 1227, + 1235, + 1252, + 1257, + 1278, + 1284, + 1301, + 1311, + 1318, + 1322, + 1401, + 1452, + 1509, + 1530, + 1558, + 1578, + 1604, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1539, + "label": 2, + "text": "GNewSense:gnewsense gnewsense linux distribution based debian developed sponsorship free software foundation goal user-friendliness proprietary e.g binary blobs non-free software removed free software foundation considers gnewsense composed entirely free software gnewsense takes relatively strict stance proprietary software example documentation gives instructions installing proprietary software excluded project launched brian brazil paul o'malley 2006. gnewsense originally based ubuntu since 1.0 release free software foundation assists gnewsense releases two years 8 august 2011 distrowatch classified gnewsense dormant september 2012 distrowatch changed status active 6 august 2013 first version directly based debian gnewsense 3 parkes released discussions trisquel forums gnewsense said inactive gnewsense activities 2017 default gnewsense uses gnome graphical user interface customized user choice x display manager window managers desktop environments available install hosted repositories ubiquity installer allows installing hard disk within live cd environment without need restarting computer prior installation besides standard system tools small applications gnewsense comes installed following software libreoffice productivity suite gnome web internet browser empathy instant messenger gimp editing photos raster graphics common software development tools including gcc installed default live cd used run operating system install onto disk cd images available download gnewsense made four major releases 2016 gnewsense announced next version gnewsense would 5.0 non-free software repositories provided gnewsense project non-free documentation artwork removed based ubuntu universe package repository enabled default order avoid trademark problems stem modification mozilla firefox gnewsense 1.1 rebranded burningdog burningdog likewise offer install non-free plugins various web media adobe flash gnewsense 2.0 abandoned burningdog adopted epiphany web browser later renamed simply web component gnome default browser application came recommendations instructions optionally compile run gnu icecat gnewsense 3.0 retains web default browser also comes modified version debian iceweasel offer access proprietary add-ons debian another linux distribution known strict licensing requirements adherence free software principles debian gnewsense rigorously exclude non-free software binary blobs official releases debian maintains hosts unofficial repositories non-free software firmware binaries debian free software sometimes depends upon suggests optional installation proprietary software theory users informed discretion use software paramount expressed clause 5 debian social contract though debian democratic project management seen stance become source recurrent controversy gnewsense contrast provide packages depend suggest use non-free software firmware extensions plugins gnewsense project provide convenience-access proprietary software reason seeing abrogation commitment development free software solutions similar debian gnewsense policies allow including documentation licensed gnu free documentation license invariant sections includes many manuals documentation released gnu project gnewsense initially forked ubuntu originally fork debian result founding developer paul o'malley prior work ubuntu gnewsense 3.0 distribution tracked debian base software distribution part debian project carefully disaggregate free software official distribution proprietary software provides courtesy access indeed many packages including debian-particular packages iceweasel icedove ported gnewsense simply modified way longer provide courtesy access non-free software options since gnewsense repositories contain free software support hardware requires firmware free firmware exists wireless network cards available may 1 2008 3d graphics application support also removed licensing issues mesa 3d january 13 2009 issues resolved 3d support became standard starting 2.2 release reviewing gnewsense 3.0 august 2013 jesse smith distrowatch noted many applications provided including openoffice.org 3 debian de-blobbed 2.6.32 linux kernel based linux-libre tools iceweasel 3.5 gnome 2.30 quite date smith concluded review following words generally speaking happy gnewsense 3.0 based debian distribution counted provide stability amazing performance distribution lean fast uncluttered flip side gnewsense system installer default package management tools geared toward experienced users probably provide steep learning curve novice linux users much automated minimum hand holding main feature gnewsense lack proprietary software also double-edged blade one hand means entire operating system audited modified redistributed great perspective software freedom fact distribution play multimedia formats handled flash content fairly well testament power free open source software one problem ran gnewsense software policy regards wireless network card distributions ship non-free intel firmware gnewsense n't include means distribution n't good fit laptop hand great match desktop system richard stallman founder president free software foundation said used gnewsense january 2010 still using april 2014 since stallman switched trisquel serdar yegulalp reviewed gnewsense infoworld said post network world gnewsense 3.1 february 2014 bryan lunduke reviewed linux distribution following words", + "neighbors": [ + 81, + 107, + 113, + 134, + 171, + 258, + 301, + 351, + 357, + 393, + 404, + 427, + 431, + 695, + 713, + 716, + 754, + 869, + 886, + 897, + 959, + 974, + 1046, + 1049, + 1055, + 1120, + 1126, + 1166, + 1167, + 1210, + 1214, + 1276, + 1286, + 1302, + 1369, + 1376, + 1415, + 1423, + 1445, + 1458, + 1601, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1540, + "label": 3, + "text": "Mercury_Systems:mercury systems mercury systems inc. high-tech commercial company serving aerospace defense industries headquartered andover massachusetts processing subsystems used intelligence surveillance reconnaissance isr radar electronic warfare ew storage guidance defense applications mercury based andover massachusetts 1000 employees offices around world annual revenues approximately us 493 million fiscal year ended june 30 2018 meet department defense dod defense electronics procurement reform objectives mercury created next generation business model defense procurement reform objectives captured department \u2019 better buying power 3.0 bbp3.0 overarching theme \u201c achieving dominant capabilities technical excellence innovation. \u201d mercury systematic approach creation defense processing subsystems using sensor processing chain methodology define reusable building blocks business approach leverages best commercial technology making mercury processing building blocks interoperable standardized defense processing subsystems quickly developed open system architectures osa fundamental meeting dod \u2019 bbp 3.0 objectives aligned mercury \u2019 business posture company pioneered many today \u2019 embedded protocols processing standards including rapidio openvpx ansi/vita 65 standard de facto embedded digital processing standard currently company investing openrfm radio frequency rf microwave processing bring interoperability rf/microwave domain openvpx digital realm openrfm standardizes profiles interfaces protocols rf microwave processing enabling sensor chain applications fully open systems compliant mercury applies open systems architectures software well hardware approach applied middleware preserves software application investments adding new capabilities tech-refreshes mercury headquartered andover massachusetts facility incorporates design engineering capability innovation center mercury innovation centers showcase company \u2019 sensor mission processing solutions mercury redundant scalable advanced microelectronic centers amcs amcs production defense industry subsystems amcs operated new england new york metro-area southern california trusted dmea facility southwest mercury three major product lines br \u2022 advanced microelectronic rf digital br \u2022 sensor mission processing mercury mission systems safety-critical avionics mission processing networking communication secure high-performance sensor processing storage networking br \u2022 mercury defense systems \u2013 electronic warfare secure processing test simulation mercury \u2019 businesses supported several dedicated international operations including toronto canada silchester united kingdom tokyo japan geneva switzerland", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1541, + "label": 3, + "text": "Codan:codan codan limited manufacturer supplier communications metal detection mining technology headquartered adelaide south australia revenue 132.3 million 2014 2017 revenue 226.1 million codan limited communications business unit parent company codan group engaged business operating segment radio communications product range sold customers 150 countries addition global service support network codan group regional sales offices washington d.c. usa victoria bc canada chicago il usa farnham uk beijing china dubai united arab emirates company maintains quality assurance systems approved standard company established 1959 three friends university adelaide alastair wood ian wall jim bettison company established electronics instrument lighting company limited eilco renaming codan 1970 codan listed australian stock exchange 2003 expanded military technology 2006 2005 ceo mike heard denied codan knowingling supplied technology al-quaeda operative 2001 mike heard acted company ceo 1990s held position retirement 2010 2009 codan established military security division usa 30 june 2012 codan limited sold satellite communications assets cpi international holding corp wholly owned subsidiary cpi international inc cpi 2016 codan defence electronics established leverage core competencies military radio countermine technology codan designs manufactures range hf equipment including transceivers base portable mobile modems power supplies amplifiers antennas accessories also provides hf solutions ranging basic voice communication data email fax chat gps tracking interoperability according fed mil standards codan hf transceivers initially developed provide communications people living working travelling central australia codan supplier hf radio products aid humanitarian markets since 1980 markets include public private security sectors well significant recreational vehicle user market australia codan military hf radio transceivers comply mil-std-188-141b ale jitc certified fed-std-1045 ale interoperable military grade radios provide frequency hopping voice encryption codan supplier us army provided around 3000 transceivers support security rebuilding programs afghanistan iraq 13 september 2011 dsei industry conference codan announced branding change hf radio division renaming division radio communications reflect broader focus company integrated radio communications systems 11 june 2012 eurosatory international defence security tradeshow codan radio communications announced launch codan envoy \u2013 software-defined radio enables users add new capabilities radio software updates 7 august 2012 codan announced acquisition daniels electronics limited daniels leading designer manufacturer supplier land mobile radio communications lmr solutions north america since launched tactical solutions stratus p25/lte hivenet p25 transportable repeaters secure mobile voice operations minelab specialises advanced electronic technologies including detection equipment military humanitarian de-mining projects also produce metal detectors consumer market company manufacturing distribution customer service operations adelaide australia cork ireland naperville usa iso 9001:2000 quality endorsed company minelab established 1985 acquired codan march 2008 minetec established technology service partner mining industry company provides integrated safety productivity communications solutions surface underground mining operations including advanced tracking mine operations management collision avoidance systems", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1542, + "label": 4, + "text": "Norton_Internet_Security:norton internet security norton internet security developed symantec corporation computer program provides malware prevention removal subscription period uses signatures heuristics identify viruses features included product personal firewall email spam filtering phishing protection release 2015 line summer 2014 symantec officially retired norton internet security 14 years chief norton product superseded norton security rechristened adaptation norton 360 security suite symantec distributed product download boxed compact disc cd copy oem software retailers also distributed usb flash drive norton internet security held 61 market share united states retail security suite category first half 2007 study competitors terms market share included security suites ca inc. trend micro kaspersky lab august 1990 symantec acquired peter norton computing peter norton norton company developed various applications dos including antivirus symantec continued development acquired technologies marketed name norton tagline symantec norton crossed-arm pose registered u.s. trademark featured norton product packaging however pose later moved spine packaging later dropped altogether users 2006 later versions upgrade latest version norton software without buying new subscription upgraded product retains number days left user subscription releases named year internal version numbers well internal version number advanced 15.x 2008 edition match norton antivirus release year 2013 20.x release product dropped year name although still referenced places norton internet security 2000 released january 10 2000 symantec first foray beyond virus protection content control filters release followed alliance internet provider excite home antivirus vendor mcafee.com provide internet subscribers mcafee new firewall software mcafee personal firewall version 2000s firewall based atguard wrq filters traffic packet level block activex controls java applets functionalities include cookie removal banner ad blocking zdnet found ad blocker removed graphics ads breaking pages adjusting settings fixed problem however process complicated zdnet noted lack information presented concerning attacks firewall blocked norton liveupdate downloads installs program updates family edition adds parental controls parental controls backed quality control team 10 searching web inappropriate content found content categorized subject matter placed blacklist 36,000 sites designed administrator add blocked sites however pre-supplied blacklist viewed edited since hard coded administrators block certain subject matters another option block sites create whitelist allowed sites family edition also block transmission specified personal information information replaced letter x however cnn noted x-rated sites retrieved personal information queried search engine version 2.0 released june 12 2000 version 2001 2.5 released september 18 2000 adding support windows addition windows 9x series windows nt windows 2000 following attacks iloveyou anna kournikova script viruses version block malicious scripts without virus signatures analyzing behavior firewall scans internet-enabled applications creates access rules based knowledge base maintained symantec installation pc magazine testing installation took 24 minutes complete 750 mhz pentium iii 92 internet-enabled applications using firewall users determine whether accept cookies java applets activex controls global per-site basis new feature intrusion detection autoblock detect port scans block intrusion attempts program provides notifications intrusion attempts stating severity level providing access threat details alternatively firewall put computer stealth essentially hiding system users configure security level affecting number notifications testing conducted pc magazine using shields symantec security check found firewall successfully stealthed ports hiding computer view leak test conducted see firewall ability detect outbound connections attempt detected suite offered block attempts family edition like prior version includes parental controls information filtering feature parental controls come list objectionable sites separated 32 categories list updated every two weeks norton liveupdate using list alone norton blocks sites present list consequently norton may block sites next update parents customize list adding removing sites list allowed sites created restrict children specific sites version uses application blocking rather protocol port filtering control internet access children restricted applications used access internet parental controls profile set child settings automatically configured based age group whether child teenager adult administrator internet usage violations noted report presented parents pc magazine found enabling parental controls added minute computer boot time version 3.0 released march 19 2001 version 2002 announced august 28 2001 family edition dropped parental controls information filtering bundled release installation noted quick simple pc magazine cnet installation requires reboot afterwards security assistant guides users questionnaire best configure settings problem cnet encountered upgrading prior release loss customized settings pc magazine found default settings aimed avoiding frequent notifications somewhat permissive windows 95 support also dropped running full scan complies list internet-enabled applications users set permissions accept norton default settings firewall detects blocks port scans logs intrusion attempts version run trace attackers however symantec planning online tool ensure rogue programs masquerade trustworthy applications norton verifies programs list digital signatures known programs update tracker warns users hackers attempt gain access users computers firewall blocked access attempts shields port checker version includes wizard simplify firewall setup accommodate multiple computers sharing internet connection release norton prevent specified personal information transmitted via compatible instant messenger client e-mail websites ad-blocking includes ad trashcan users place ads slipped past ad-filtering professional edition announced december 11 2001 marketing aimed towards business owners version features norton intrusion detection intercepts suspicious connections attacks code red worm intrusion detection focuses windows-based attacks central management also present version administrators configure firewall productivity settings client computers productivity settings allow administrators block newsgroups websites advertisements suite integrates xp user accounts settings personalized user version 2003 announced september 16 2002 scheduled available purchase later month version adds norton spam alert reduce spam filtering scans whole message context rather looking keywords ensure accuracy pop3 client must used message identified spam norton inserts identifier default spam alert subject line using mail client users create rule delete move flagged messages users also create strings text spam alert look classifying e-mail pc magazine testing spam alert mistakenly classified 2.8 percent legitimate e-mail spam 47 percent spam slipped past filter although false positive rate low feature fare well finding actual spam updated main interface green red indicators show features active need attention firewall several updated features version block traffic button present main interface blocks incoming outgoing internet traffic another new feature visual tracker graphically maps attacks back origin firewall blocked port scans conducted cnet stealthing port following nimda code red worms version scans incoming outgoing traffic suspicious data exchanges routinely updated database feature ported norton internet security 2002 professional edition connection offending computer automatically severed traffic matches database item symantec announced professional edition november 19 2002 data recovery tools version allow users recover deleted malware-damaged files inclusion data erasure tool allows users delete files minimizing chance recovery web cleanup removes browser cache files history cookies maintain dial-up connections connection keep alive simulates online activity periods user inactivity norton productivity control enables users filter internet content block newsgroups used user access manager multiple filtering profiles created assigned different users announced september 8 2003 version 2004 adds adware spyware keylogger protection pc magazine found added protection weak spyware samples norton detected significant number removed completely requiring manual removal norton also little prevent spyware infections norton antispam renamed spam filtering feature set spam rules viewed edited whitelists blacklists senders created users may also create spam definitions antispam integrates outlook outlook express eudora allowing users tag e-mail spam on-the-fly e-mail identified spam either quarantined default however feature configured delete messages automatically cnet testing antispam correctly identified 94 percent spam messages product activation introduced release installation users allowed 15-day grace period activate copy norton internet security 2004 program work deadline without 24-character product key product key used activate copy norton internet security ties alphanumeric code based computer hardware configuration users may activate product five times product key however licensing terms dictate users allowed install norton internet security 2004 one computer symantec introduced version 2005 august 17 2004 version sometimes referred tagline antispyware edition since spyware detection integrated norton default enabled found threats listed separating ones already dealt ones requiring user interaction detailed information provided link symantec website however pc pro pc magazine noted lengthy scan times full scan took 24 minutes half hour respectively pc pro testing norton detected 61 percent spyware samples compared average 68 percent tested products removal rates average 72 percent versus average 68 percent norton blocked reinstallation score 48 percent compared group average 43 percent overall norton ranked fifth among tested products pc magazine testing norton installed slowly infected systems failed install one altogether contacting symantec resolve issue new features include internet worm protection block worms scan ip addresses open ports also blocks inbound ports based known suspected exploits using signatures heuristics addition feature follows msblast 2003 sasser 2004 worms exploited vulnerability microsoft windows operating systems response emerging privacy threats \u2014 75 percent threats last 12 months attempted steal confidential information \u2014 version adds phishing protection using firewall component users create whitelist sites confidential information transmitted users alerted information transmitted site list outbreak alert feature warns users major threats classified symantec users press fix button applies set changes close vulnerabilities blocking necessary ports used propagating worm browser privacy suppress information website generally receive visitors browser operating system used feature also block advertisements privacy control warn users sending confidential information also configured block transmission allows users specify information sent via im e-mail item-specific exceptions allow users control data sent however pc pro found flaw information filtering feature way information formatted list confidential information affect effectiveness example entering last six digits credit card number stop numbers leaking grouped four digits pc magazine also noted fact anyone login computer view database private information reason symantec recommends entering last portion sensitive information norton antispam scans e-mails spoofed urls deals offending e-mail spam e-mails also blocked based language however default filter allows languages antispam sync list allowed senders pop3 address books users train spam filter pointing valid e-mail marked spam vice versa support yahoo mail hotmail added release norton internet security 2006 debuted september 26 2005 new main interface norton protection center aggregates information central location security status shown secure computer tasks e-mail internet browsing context features enabled protection center also recognize third-party software protecting computer new interface advertises additional products symantec categories protection data protection read coverage user purchases installs norton systemworks additional system tray icon created protection center installation noted lengthy pc magazine especially malware-infected systems spyware detection tweaked since last release updated better identify keyloggers pc magazine testing norton successfully detected 11 spyware threats removed two pc magazine give norton credit even manual removal required suite also removed three four commercial keyloggers attempting install spyware clean system norton blocked 11 two four commercial keyloggers cases block installation however norton call scan spyware installed pc pro testing norton detected 78 percent spyware removed 82 percent blocked 65 percent installing norton antispam discontinued separate product symantec available norton internet security feature block e-mail unknown senders automatically blocks messages suspicious elements invisible text html forms phishing urls improve accuracy norton analyzes outgoing e-mails messages whose categorization corrected users hitting spam spam buttons pc magazine testing feature marked one ten valid e-mail spam let one every six spam messages inbox 400 messages used program allowed process messages week pc pro testing feature performed better blocking 96 percent spam false positive rate 0.2 percent norton recommends disabling windows firewall avoid redundant alerts firewall stealthed significant ports pc magazine testing attacking firewall unsuccessful pc magazine unable stop service terminate process disable firewall using simulated mouse clicks firewall also passed pc pro tests successfully stealthing ports features include bloodhound technology looks virus-like behavior better find zero day viruses security inspector looks common vulnerabilities including insecure user account passwords browser insecurities advertisement blocking rewrites website html prevent advertisements displayed parental controls optional component block certain programs accessing internet im clients restrict newsgroup access restrictions assigned different windows users accounts sites classified 31 categories four profiles assigned block different categories sites supervisors define exceptions add global blocked sites block access sites user-created whitelist pc magazine pc pro noted exclusion time-based restrictions information filtering controlled per-user basis windows 98 compatibility dropped release 2007 version announced september 12 2006 tabbed interface allows users access norton protection center program settings without separate tray icons windows open symantec revised norton internet security made version modularized reduced suite memory usage 10\u201315 megabytes scan times 30\u201335 percent another result spam filtering parental controls separate components install installed features consume 100 mb disk space anti-phishing integrates internet explorer analyzes sites examining website url title form page layout visible text links uses blacklist detect phishing sites users blocked access suspected phishing sites however presented option continue pc magazine testing feature blocked 22 24 phishing sites internet explorer 7 recognized 17 24 sites pc pro testing feature successfully blocked access every phishing site tested spam filtering longer includes language feature symantec claims less useful current spam created false positives tested 1,500 messages pc magazine norton let half spam inbox five percent valid mail marked spam version utilizes symantec veritas vxms technology better identify rootkits vxms allows norton find inconsistencies among files within directories files volume level startup application manager allows users prevent applications launching login release drops support windows 2000 compatible windows vista upon release update firewall makes decisions lessen chance weakened misinformed decision applications known safe allowed internet access vice versa malicious applications unknown ones analyzed blocked exhibit malicious behavior pc magazine pc pro testing firewall incorrectly block safe applications internet access malware blocked firewall pc magazine testing reflected results firewall also stealthed ports exploits blocked intrusion prevention system prevents threats leveraging vulnerabilities system updated whenever vulnerability identified windows-based computers attempts disable firewall unsuccessful registry changes process termination simulated mouse clicks failed disabling windows services effect firewall since works kernel driver level version automatically adjusts configuration different networks based physical address gateway rather ip addresses pc magazine testing norton detected 15 16 spyware samples 13 16 removed eight commercial keyloggers suite removed samples clean system norton blocked 14 16 spyware samples installing stopped seven eight keyloggers installing 2008 version announced august 28 2007 adding support windows vista 64-bit new features include sonar norton identity safe browser defender sonar monitors applications malicious behavior identity safe supersedes information filtering function instead blocking personal information leaving computer stores personal information fill webforms password protected checks website authenticity filling forms browser defender inspects blocks suspicious api calls intended stop drive-by downloads network map identifies networked computers norton internet security 2008 installed remote monitoring allows checking status installations different computers problems identified red x icon using feature users also control network traffic computers also warns users using unencrypted wireless network startup application manager advertisement blocking features dropped release information filtering although superseded identity safe suite available separately used conjunction identity safe phishing protection integrates mozilla firefox testing pc magazine found norton blocked 94 percent phishing sites compared 83 percent internet explorer 7 77 percent firefox 2 cnet identified issue feature anti-phishing disabled identity safe still offers users automatically submit personal information websites including phishing sites symantec declined call flaw stating recommended use identity safe anti-phishing enabled alternatively identity safe could used firefox internet explorer built-in anti-phishing capability pc magazine found firewall put ports stealth mode firewall blocked ten 12 leak tests used see malware evade firewall control network traffic previous versions identify tests none carried malicious payload another test conducted using core impact successfully exploited one vulnerability test computer however components norton stopped exploit causing harm attempts unsuccessful either system invulnerable norton intrusion prevention system stopped attempts disable firewall unsuccessful pc magazine contrary pc pro identified 15 open ports computer norton installed pc magazine testing norton completely detected malware samples two-thirds samples traces removed norton found removed commercial keyloggers full scan took nearly hour complete though twice long 2007 version suite blocked malware installing commercial keyloggers regardless modifications made samples pc world noted norton removed 80 percent malware-associated files registry entries spam filtering imports users address books compile whitelist allowed senders addresses users send mail e-mail tagged valid mail automatically added whitelist using several thousand messages pc magazine found norton marked 40 percent valid e-mail spam 80 percent valid newsletters marked spam norton correctly identify 90 percent spam e-mail 2009 version released sale september 9 2008 symantec set several goals version 2009 development complete installations minute footprint 100 mb average installation times range eight ten minutes previous 2008 version 400 mb footprint goals included reducing load time computer starts 20\u201330 seconds 10 seconds file scanning times technology allowing norton skip certain trusted files technology works basis piece software runs significant proportion computers safe public beta released july 14 reduction memory consumption made prompted fact 40 percent people contacting symantec support 512 mb ram beta uses 6 mb memory compared 11 mb prior version reduce scan times norton insight uses data norton community participants avoid scanning files found statistically significant number computers citing npd group study finding 39 percent consumers switching antiviruses blamed performance cpu usage meter available within final product allow users find cause high cpu usage whether norton another program version features frequent updates change called norton pulse updates rather deliver update every eight hours 2008 version pulse updates delivered five fifteen minutes silent mode automatically suspends alerts updates program enters mode manually enabled suite activities take place computer idle terminate user activity registered final release 16.5 bundles spam filtering used free download symantec release also bundles norton safe web identifies malicious websites compatible internet explorer firefox norton safe web color codes search results famous search engine google yahoo safety norton safe web toolbar also includes ask.com search box search box share code ask toolbar instead box redirects queries ask search engine norton safe web compatible internet explorer firefox norton safe web benchmarking conducted passmark software highlights 2009 version 52 second install time 32 second scan time 7 mb memory utilization symantec funded benchmark test provided scripts used benchmark participating antivirus software tests conducted windows vista running dual core processor pc magazine found suite added 15 seconds boot time baseline 60 seconds norton added less 5 percent time takes complete file operations 25 percent time taken unzip zip set files pc magazine testing norton removed traces 40 percent malware similar test specifically using commercial keyloggers norton able remove keyloggers beating tested products norton blocked attempts install malware clean system modifications made samples fool norton norton able block installation commercial keyloggers phishing protection blocked 90 percent verified phishing websites pc magazine testing internet explorer 7 caught 75 percent firefox caught 60 percent norton stealthed ports according pc magazine port scans unsuccessful firewall blocked exploit attempts core impact malware blocking removal garnered good results pc magazine testing one malware samples contained within folder removed folder opened last one removed executed modifications made samples affect detection similar test specifically using commercial keyloggers norton successfully detect removing threats norton almost completely removed 40 percent malware samples related executables norton also able remove commercial keyloggers product version 2010 released officially september 8 2009 version features technology code named project quorum introduces reputation-based threat detection keep 200 million attacks month many symantec claims evade signature based detection new approach relies norton community watch participants send information applications running computers safe applications exhibit common attributes known origin known publishers conversely new malware may unknown publisher among attributes using data reputation score calculated used infer likelihood unknown application safe malicious facets quorum parental controls spam filtering norton internet security 2010 bundles free subscription onlinefamily.norton pc magazine found improvement parental controls bundled prior releases spam filtering uses technologies symantec acquired brightmail two filters used find spam locally installed one check symantec servers see message known spam pc magazine testing valid e-mail marked spam however 11 percent spam still made inbox significant improvement prior releases another improvement product improved heuristic feature called sonar 2 leverages reputation data judge program malicious clean norton insight also expanded showing users number norton community participants certain program installed impact system resources long released information program origin graph resource usage also provided new feature codenamed autospy helps users understand norton malware found malware actions norton resolution presented user previous releases removed threats sight quietly warned users potentially confusing users deceived downloading rogue security software another addition product new flip screen compatible graphics card main display flips show opposite side main interface consisting chart cpu memory usage timeline security events without one flip screen link replaced back link opens back windows separate window product also adds search engine labeled safe search custom search allows user filter unsafe sites get insight keep track http cookies malware removal blocking performed well setting meeting records pc magazine testing achieved detection rate 98 highest 12 tested antivirus products exception blocking commercial keyloggers norton made average score file operations took 2 percent longer file compression extraction test took 4 percent longer area norton introduced significant delay system booting beta version suite added 31 percent boot time significantly longer prior versions according norton performance comparison website norton internet security scans 31 percent faster 70 percent lighter installs 76 percent faster leading anti-virus product according av-comparatives norton internet security best product 2009 bronze award 98.6 detection rate 2010 norton internet security 2010 blocked 99/100 internet threats infecting user computer norton internet security 2011 released beta testing april 21 2010 changes include new user interface improved scanning internet sites malware 2011 version symantec also released application scans user facebook feed malware links application require valid subscription test sponsored symantec norton internet security 2011 security suite ever achieve 100 percent protection score new third-party test dennis labs improved reputation scan provides user easy understand interface files stored user computer marking trusted good poor bad final version norton internet security 2011 released august 31 2010 new features version 2011 also include norton rescue tools tools include norton bootable recovery tool norton power eraser december 9 2010 symantec released 18.5 version norton liveupdate however update later pulled due numerous reports norton forums update causing system instability freeze ups system scans full quick scans issue affects customers users affected update advised uninstall product run norton removal tool reinstall 18.1 version http //www.norton.com/nis11 symantec later fixed bugs re-released update following acquisition verisign security norton parent company symantec several verisign features incorporated 2011 edition new product features new norton logo uses verisign checkmark formerly seen verisign logo well several new icon changes norton safe web norton identity safe features released 19.1.0.28 september 6 2011 norton internet security 2012 brought new features one new features included new release download insight 2.0 monitors files safety also stability given file means file stable windows 7 unstable windows xp xp users notified file instability enhanced removal tools tightly integrated better cleanup already infected systems triggered new powerful version norton power eraser restarts system locate remove fake antivirus software fake antivirus software deeply embedded threats otherwise hard remove new tool called norton management helps manage different computers devices equipped norton software single location changes release include sonar 4 google chrome compatibility identity safe safe web ability store passwords notes cloud however license agreement guarantee passwords stored securely provides remedy cloud vault compromised user interface also simplified three buttons third button opens advanced complicated menu user able manage settings access different product features cpu meter removed norton 2011 also makes return advanced screen combining netbook desktop line norton internet security integrates bandwidth metering controls product traffic usage takes minimum necessary ideal networks limited traffic also user interface window adjusts accordingly size computer screen version norton internet security includes several easter eggs pressing shift+1 2 3 4 would change theme default background plain black ray animals floral respectively also holding control win key alt pressing performance button activate crazy flip make window flip head heels effect would continue main window closed reopened furthermore scans longer scheduled windows task scheduler symantec proprietary one performs tasks computer idle i.e. user away computer version 20 2013 began version-less approach dropping 20xx naming convention automatically update new releases become available notable changes include new user interface better suited touchscreen devices social networking protection intends protect threats targeted social networks also first release officially support windows 8 version released october 7 2013 became last version marketed symantec norton internet security along norton antivirus norton 360 replaced norton security version 22.5 update released june 2015 includes restyled user interface windows 10 support september 2014 norton internet security folded norton security part symantec streamlined norton line symantec released special edition norton internet security optimized netbooks available download symantec website usb thumb drive symantec states netbook edition optimized netbooks main display optimized provide support 800 x 480 screen resolution addition non-critical tasks delayed netbook battery furthermore netbook edition contains complimentary access norton secure online backup parental control protect children surf web norton internet security version 1.0 mac released november 1 2000 identify remove windows mac viruses features include firewall advertisement blocking browser parental controls ability prevent confidential information transmitted outside computer users prompted information able transmitted incorporation aladdin systems iclean allows users purge browser cache cookies browsing history within norton interface operating system requirements call mac os 8.1 hardware requirements call 24 mb ram 12 mb disk space powerpc processor norton internet security version 2.0 mac released date unknown know please provide version 2.0 also ties whois database allowing users trace attacking computers users inform network administrators attacking computers corrective actions running mac os 8.1 9 powerpc processor 24 mb ram 25 mb free space required mac os x 10.1 powerpc g3 processor 128 mb ram 25 mb free space required norton internet security version 3.0 mac released date unknown know please provide subsequent release version 3.0 maintained feature set found version 2.0 firewall allocates internet access needed rather relying user input using predefined rules compatibility os 8 dropped running os 9.2 powerpc processor 24 mb ram 25 mb free space required os x 10.1.5 10.3 powerpc g3 128 mb ram 150 mb free space required however version 3.0 compatible mac os x 10.4 tiger version 4.0 released december 18 2008 symantec also markets bundle version 4.0 2009 version windows intended users microsoft windows mac os x installed iclean dropped release firewall blocks access malicious sites using blacklist updated symantec prevent attackers leveraging insecurities mac installed software exploit protection introduced release phishing protection introduced release well operating system requirements call mac os x 10.4.11 higher powerpc intel core processor 256 mb ram 150 mb free space required features norton internet security underwent considerable changes performance symantec rewrote code 2009 release norton products two running processes using 15 mb ram according passmark security benchmark 2012 norton antivirus norton internet security lightest suites available av-comparatives.org also tested products gave similar results pc magazine recognized 2011 2012 lines fastest strongest protection pcworld tests security software put norton internet security 2009 first place 2011 test conducted pc world norton internet security winner dennis technology labs tests sponsored symantec confirmed performance effectiveness norton 2011 2012 lines symantec compliance federal bureau investigation fbi whitelisted magic lantern keylogger actively developed fbi purpose magic lantern obtain passwords encrypted e-mail part criminal investigation magic lantern first reported media bob sullivan msnbc november 20 2001 ted bridis associated press magic lantern deployed e-mail attachment attachment opened trojan horse installed suspect computer trojan horse activated suspect uses pgp encryption often used increase security sent e-mail messages activated trojan horse log pgp password allows fbi decrypt user communications symantec major antivirus vendors whitelisted magic lantern rendering antivirus products including norton internet security incapable detecting concerns include uncertainties magic lantern full potential whether hackers could subvert purposes outside jurisdiction law graham cluley technology consultant sophos said way knowing written fbi even \u2019 know whether used fbi commandeered third party another reaction came marc maiffret chief technical officer cofounder eeye digital security customers paying us service protect forms malicious code us law enforcement job make exceptions law enforcement malware tools fbi spokesman paul bresson response question whether magic lantern needed court order deployed said like technology projects tools deployed fbi would used pursuant appropriate legal process proponents magic lantern argue technology would allow law enforcement efficiently quickly decrypt messages protected encryption schemes unlike predecessor carnivore implementing magic lantern require physical access suspect computer would necessitate court order older versions norton hard slow uninstall leaving many traces sometimes completing errors however 2009 versions symantec featured uninstaller removes products better quickly usually less minute norton removal tool well known instrument removes norton products completely without trace tool downloaded symantec website symantec reports norton 2010 range products feature cleaner uninstall over-installs recommended update route 2011 link norton internet security 2008 installed users may encounter incompatibilities upgrading windows xp service pack 3 windows vista service pack 1 users report numerous invalid registry keys added tool named fixcss.exe resulting empty device manager missing devices wireless network adapters symantec initially blamed microsoft incompatibilities since accepted partial responsibility dave cole symantec vice president general manager acknowledged users running norton products experiencing problems said numbers small cole also said symantec done extensive testing products windows xp sp3 issue encountered cole blamed microsoft related xp sp3 microsoft recommended users contact windows customer support resolve problem symantec issued fix intended users upgrading symantec also recommends disabling tamper protection component 2008 release dubbed symprotect tool remove added registry entries also available symantec sarah hicks symantec vice president consumer product management voiced concern windows vista 64-bit patchguard feature patchguard designed microsoft ensure integrity kernel part operating system interacts hardware rootkits often hide operating system kernel complicating removal mike dalton european president mcafee said decision build wall around kernel assumption ca n't breached ridiculous claiming microsoft preventing security vendors effectively protecting kernel promoting security product windows live onecare hicks said symantec mind competition onecare symantec later published white paper detailing patchguard instructions obtain patchguard exploit negotiations investigations antitrust regulators microsoft decided allow security vendors access kernel creating special api instructions", + "neighbors": [ + 17, + 94, + 99, + 120, + 189, + 358, + 476, + 569, + 576, + 648, + 656, + 685, + 717, + 780, + 800, + 842, + 910, + 938, + 944, + 965, + 1038, + 1090, + 1101, + 1138, + 1239, + 1250, + 1257, + 1287, + 1291, + 1350, + 1376, + 1379, + 1403, + 1406, + 1417, + 1462, + 1514, + 1568 + ], + "mask": "Test" + }, + { + "node_id": 1543, + "label": 4, + "text": "ZeroAccess_botnet:zeroaccess botnet zeroaccess trojan horse computer malware affects microsoft windows operating systems used download malware infected machine botnet remaining hidden using rootkit techniques zeroaccess botnet discovered least around may 2011 zeroaccess rootkit responsible botnet spread estimated present least 9 million systems estimates size botnet vary across sources antivirus vendor sophos estimated botnet size around 1 million active infected machines third quarter 2012 security firm kindsight estimated 2.2 million infected active systems bot spread zeroaccess rootkit variety attack vectors one attack vector form social engineering user persuaded execute malicious code either disguising legitimate file including hidden additional payload executable announces example bypassing copyright protection keygen second attack vector utilizes advertising network order user click advertisement redirects site hosting malicious software third infection vector used affiliate scheme third party persons paid installing rootkit system december 2013 coalition led microsoft moved destroy command control network botnet attack ineffective though c c seized peer-to-peer command control component unaffected meaning botnet could still updated system infected zeroaccess rootkit start one two main botnet operations bitcoin mining click fraud machines involved bitcoin mining generate bitcoins controller estimated worth 2.7 million us dollars per year september 2012 machines used click fraud simulate clicks website advertisements paid pay per click basis estimated profit activity may high 100,000 us dollars per day costing advertisers 900,000 day fraudulent clicks typically zeroaccess infects master boot record mbr infected machine may alternatively infect random driver c \\windows\\system32\\drivers giving total control operating system also disables windows security center firewall windows defender operating system zeroaccess also hooks tcp/ip stack help click fraud software also looks tidserv malware removes finds", + "neighbors": [ + 43, + 91, + 141, + 149, + 158, + 198, + 232, + 261, + 281, + 293, + 325, + 376, + 414, + 418, + 450, + 490, + 522, + 531, + 533, + 550, + 564, + 576, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 666, + 675, + 708, + 783, + 800, + 818, + 915, + 961, + 1043, + 1063, + 1090, + 1138, + 1162, + 1186, + 1270, + 1291, + 1293, + 1327, + 1332, + 1336, + 1342, + 1358, + 1365, + 1379, + 1393, + 1436, + 1467, + 1475, + 1543, + 1554, + 1573, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1544, + "label": 2, + "text": "IPad_Mini_2:ipad mini 2 ipad mini 2 stylized marketed ipad mini 2 previously marketed ipad mini retina display second-generation ipad mini tablet computer produced marketed apple inc design almost identical first generation ipad mini features internal revisions addition a7 system-on-a-chip 2,048 \u00d7 1,536 resolution retina display ipad mini 2 nearly hardware larger sibling ipad air apple released ipad mini 2 space gray silver colors november 12 2013 successor ipad mini 3 unveiled october 16 2014 featuring internals adding touch id differing storage sizes additional gold color ipad mini 2 discontinued march 21 2017 following press announcement new lower cost ipad replaces ipad air 2 ipad mini 2 first ipad mini support six major versions ios ios 7 ios 12 ipad mini 2 announced keynote yerba buena center arts october 22 2013 theme keynote named 'we still lot cover ipad mini 2 originally marketed ipad mini retina display however successor ipad mini 3 announced october 16 2014 apple started marketing former device ipad mini 2 ipad mini 2 comes ios 7 operating system released september 18 2013 jony ive designer ios 7 new elements described update bringing order complexity highlighting features refined typography new icons translucency layering physics gyroscope-driven parallaxing major changes design design ios 7 os x mavericks version 10.9 noticeably depart skeuomorphic elements green felt game center wood newsstand leather calendar favor flat colourful design act hotspot carriers sharing internet connection wi-fi bluetooth usb also access apple app store digital application distribution platform ios service allows users browse download applications itunes store developed xcode ios sdk published apple app store garageband imovie iphoto iwork apps pages keynote numbers available ipad mini 2 bluetooth function attaches wireless keyboard headset allows user access wireless keyboard used apple pages writing program needs editing ipad mini 2 comes several pre-installed applications including siri safari mail photos video music itunes app store maps notes calendar game center photo booth contacts like ios devices ipad sync content data mac pc using itunes although ios 5 later managed backed without computer although tablet designed make phone calls cellular network users use headset built-in speaker microphone place phone calls wi-fi cellular using voip application skype device dictation application using voice recognition technology iphone 4s enables users speak ipad types say screen though ipad must internet connection available via wi-fi cellular network due feature reliance apple servers translate speech ipad mini 2 ibooks application originally optional app though since release ios 8 comes pre-installed displays books epub-format content downloaded ibooks store several major book publishers including penguin books harpercollins simon schuster macmillan committed publishing books device despite direct competitor amazon kindle barnes noble nook amazon.com barnes noble offer e-reader apps ipad siri intelligent personal assistant knowledge navigator included application uses natural language user interface answer questions make recommendations perform actions delegating requests set web services apple claims software adapts user individual preferences time personalizes results ios 7 adds new male female voices new system setting functionalities redesign match rest operating system integration twitter wikipedia bing photos facebook comes integrated apple native apps facebook features directly accessed within native apps calendar sync facebook events use facebook like button within apple app store june 2 2014 announced ipad mini 2 would receive ios 8 update june 13 2016 announced ipad mini 2 support ios 10 update june 5 2017 also announced ipad mini 2 support ios 11 update apple announced ipad mini 2 support ios 12 update together apple a7 cousins make first ipad mini support six major versions ios ios 7 ios 12 longest supported ipad mini june 2019 apple announced drop support ipad mini 2 release ipados along a7 cousins ipad mini 2 sized 7.9-inch screen largely design first generation ipad mini 1st generation one notable change inclusion retina display matching screen resolution full-sized retina ipad models mini 2 features resolution ipad air makes mini 2 screen even pixel dense compared larger sibling slate-colored back panel first-generation ipad mini discontinued favor space gray lighter grey tone whilst silver color option still remained ipad mini 2 shares hardware components ipad air iphone 5s notably 64-bit apple a7 system-on-chip apple m7 motion processor mini 2 a7 system-on-chip clocked slightly slower otherwise one ipad air iphone 5s three released q4 2013 mini 2 uses home button predecessor therefore support touch id feature added succeeding ipad mini 3 mini 2 also includes 5 megapixel rear-facing camera 1.2 mp facetime hd front-facing camera support 802.11n estimated 10 hours battery life previous generations ipad hardware four buttons one switch ipad mini 2 device portrait orientation home button face device display returns user home screen wake/sleep button top edge device two buttons upper right side device performing volume up/down functions switch whose function varies according device settings functioning either switch device silent mode lock/unlock orientation screen addition wifi version weighs 331 grams cellular model weighs 341 grams \u2013 slightly respective predecessors display responds sensors ambient light sensor adjust screen brightness 3-axis accelerometer sense orientation switch portrait landscape modes unlike iphone ipod touch built-in applications work three orientations portrait landscape-left landscape-right ipad built-in applications support screen rotation four orientations including upside-down consequently device intrinsic native orientation relative position home button changes audio playback ipad mini 2 stereo two speakers located either side lightning connector ipad mini 2 originally available 16 32 64 128gb internal flash memory expansion option however announcement ipad mini 3 october 16 2014 64 128gb versions ipad mini 2 discontinued september 7 2016 16gb model discontinued well final model 32gb discontinued march 21 2017 following unveiling new lower-cost ipad apple also sells camera connection kit sd card reader used transfer photos videos ipad mini 2 models connect wireless lan offer dual band wi-fi support also manufactured either without capability communicate cellular network tablet cellular model comes two variants support nano-sims quad-band gsm penta-band umts dual-band cdma ev-do rev b. additionally one variant also supports lte bands 1 2 3 4 5 7 8 13 17 18 19 20 25 26 variant supports lte bands 1 2 3 5 7 8 18 19 20 td-lte bands 38 39 40 apple ability handle many different bands one device allowed offer first time single ipad variant supports cellular bands technologies deployed major north american wireless providers time device introduction mini 2 praised packing essentially hardware larger expensive ipad air significantly compact lighter featuring even pixel-dense screen keeping resolution despite smaller display 100 usd cheaper air mini 2 essentially rendered obsolete similarly-priced ipad 2 ipad 4 remained apple ipad lineup first year mini 2 availability budget alternative ipad air writing techradar gareth beavis awarded ipad mini 2 rating 4.5 5 beavis praises retina display a7 chip performance states design still best tablet category however criticize price increase website anandtech anand lal shimpi highly compliments design increased speed ipad mini 2 lamenting limited color palette stating ... \u2019 shame tradeoff exists two ipads especially given good apple srgb coverage nearly displays despite criticisms quality camera jeffrey van camp digital trends gave tablet score 4.5 5 writes ipad mini 2 favorite tablet 2013 powerful 64-bit a7 processor high-resolution \u2018 retina \u2019 screen finishes job apple started first ipad mini addressing main complaints original mini under-powered processor low-resolution display like contemporary ipads mini 2 rear camera photo quality mediocre compared iphones ipad mini 2 also considerably expensive closest android competitor nexus 7 although mini 2 significantly powerful better build quality well apple larger tablet-specific app selection established ecosystem ipad mini 2 criticized thicker heavier original ipad mini also criticized taking longer time charge", + "neighbors": [ + 33, + 71, + 75, + 99, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 696, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 1001, + 1100, + 1138, + 1140, + 1142, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1416, + 1488, + 1496, + 1591 + ], + "mask": "Test" + }, + { + "node_id": 1545, + "label": 2, + "text": "Windows_Meeting_Space:windows meeting space windows meeting space codenamed windows shared view also referred windows collaboration peer-to-peer collaboration program developed microsoft windows vista replacement older windows netmeeting application however features microphone support ability set audio video conferences removed meeting space enables application sharing collaborative editing desktop sharing file sharing projecting simple text-based ink-based instant messaging across 10 users connected network across internet meeting space ability automatically set ad hoc wireless network connection network internet available also enables participants invite people meeting sessions one first applications new peer-to-peer infrastructure windows vista hence requires ipv6 meeting space available editions windows vista functionality unavailable starter edition home basic edition allows users join sessions meeting space exist edition windows 7 microsoft recommended microsoft office live meeting replacement meeting space result microsoft peer-to-peer collaboration efforts\u2014with emphasis mobile computing\u2014discussed windows hardware engineering conference 2004 windows vista codenamed longhorn time reported windows vista would enable users create ad hoc wireless networks file sharing discover people connected nearby meeting space relies functionality services meeting space demonstrated jim allchin darryn dieken professional developers conference pdc 2005 projected shared powerpoint presentation allchin stated demonstration illustrate functions application itself\u2014development complete time\u2014but illustrate select capabilities peer-to-peer framework windows vista later interview paul thurrott allchin expressed desire developers create applications supporting peer-to-peer capabilities starting session workspace contains presentation area displayed list notes also shown list users local subnet collaboration session started automatically detected using people near functionality based ws-discovery peer-to-peer networking implementation windows vista users outside local subnet must sent e-mail file invitation participate applications shared session local session application shared windows meeting space switches presentation mode participants see presenter working collaboratively edit review shared application instance", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1547, + 1561, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1546, + "label": 2, + "text": "Transaction_Processing_Facility:transaction processing facility transaction processing facility tpf ibm real-time operating system mainframe computers descended ibm system/360 family including zseries system z9 tpf delivers fast high-volume high-throughput transaction processing handling large continuous loads essentially simple transactions across large geographically dispersed networks industrial-strength transaction processing systems notably ibm cics ims tpf specialty extreme volume large numbers concurrent users fast response times example visa credit card transaction processing peak holiday shopping season tpf passenger reservation application pars international version ipars used many airlines one tpf major optional components high performance specialized database facility called tpf database facility tpfdf close cousin tpf transaction monitor alcs developed ibm integrate tpf services common mainframe operating system mvs z/os tpf evolved airlines control program acp free package developed mid-1960s ibm association major north american european airlines 1979 ibm introduced tpf replacement acp \u2014 priced software product new name suggests greater scope evolution non-airline related entities tpf traditionally ibm system/370 assembly language environment performance reasons many tpf assembler applications persist however recent versions tpf encourage use c. another programming language called sabretalk born died tpf ibm announced delivery current release tpf dubbed z/tpf v1.1 september 2005 significantly z/tpf adds 64-bit addressing mandates use 64-bit gnu development tools gcc compiler dignus systems/c++ systems/c supported compilers z/tpf dignus compilers offer reduced source code changes moving tpf 4.1 z/tpf current users include sabre reservations visa inc. authorizations american airlines american express authorizations dxc technology shares reservations formerly eds hpes holiday inn central reservations amtrak marriott international travelport galileo apollo worldspan axess japan gds citibank air canada trenitalia reservations delta air lines reservations operations japan airlines tpf capable running multiprocessor systems one cpu within lpar cpus referred instruction streams simply i-streams running lpar one i-stream tpf said running tightly coupled tpf adheres smp concepts concept numa-based distinctions memory addresses exist depth cpu ready list measured incoming transaction received queued i-stream lowest demand thus maintaining continuous load balancing among available processors cases loosely coupled configurations populated multiprocessor cpcs central processing complex i.e physical machine packaged one system cabinet smp takes place within cpc described whereas sharing inter-cpc resources takes place described loosely coupled tpf architecture memory except 4kb-sized prefix area shared among i-streams instances memory-resident data must kept separated i-stream programmer typically allocates storage area number subsections equal number i-streams accesses desired i-stream associated area taking base address allocated area adding product i-stream relative number times size subsection tpf capable supporting multiple mainframes size \u2014 single i-stream multiple i-stream connecting operating common database currently 32 ibm mainframes may share tpf database system operation would called 32-way loosely coupled simplest loosely coupled system would two ibm mainframes sharing one dasd direct access storage device case control program would equally loaded core program record dasd could potentially accessed either mainframe order serialize accesses data records loosely coupled system practice known record locking must used means one mainframe processor obtains hold record mechanism must prevent processors obtaining hold communicate requesting processors waiting within tightly coupled system easy manage i-streams via use record hold table however lock obtained offboard tpf processor dasd control unit external process must used historically record locking accomplished dasd control unit via rpq known llf limited locking facility later ellf extended llf ellf replaced multipathing lock facility mplf run clustered loosely coupled z/tpf requires either mplf disk control units alternative locking device called coupling facility records absolutely must managed record locking process processor shared tpf record accesses done using record type ordinal defined record type tpf system 'fred gave 100 records ordinals processor shared scheme record type 'fred ordinal 5 would resolve exactly file address dasd \u2014 clearly necessitating use record locking mechanism processor shared records tpf system accessed via exactly file address resolve exactly location processor unique record one defined processor expected loosely coupled complex record type 'fred perhaps 100 ordinals however user 2 processors examines file address record type 'fred ordinal 5 resolves note different physical address used tpf general-purpose operating system gpos tpf specialized role process transaction input messages return output messages 1:1 basis extremely high volume short maximum elapsed time limits tpf built-in graphical user interface functionality tpf never offered direct graphical display facilities implement host would considered unnecessary potentially harmful diversion real-time system resources tpf user interface command-line driven simple text display terminals scroll upwards mouse-driven cursors windows icons tpf prime cras computer room agent set \u2014 best thought operator console character messages intended mode communications human users work accomplished via use command line similar unix without x several products available connect prime cras provide graphical interface functions tpf operator tpf operations server graphical interfaces end users desired must provided external systems systems perform analysis character content see screen scrape convert message to/from desired graphical form depending context specialized purpose operating system tpf host compiler/assembler text editor implement concept desktop one might expect find gpos tpf application source code commonly stored external systems likewise built offline starting z/tpf 1.1 linux supported build platform executable programs intended z/tpf operation must observe elf format s390x-ibm-linux using tpf requires knowledge command guide since support online command directory man /help facility users might accustomed commands created shipped ibm system administration tpf called functional messages -- commonly referred z-messages prefixed letter z letters reserved customers may write commands tpf implements debugging distributed client-server mode necessary system headless multi-processing nature pausing entire system order trap single task would highly counter-productive debugger packages developed 3rd party vendors took different approaches break/continue operations required tpf host implementing unique communications protocols used traffic human developer running debugger client server-side debug controller well form function debugger program operations client side two examples 3rd party debugger packages step step trace bedford associates cmstpf tpf/gi ztpfgi tpf software inc.. neither package wholly compatible ibm offering ibm debugging client offering packaged ide called ibm tpf toolkit tpf highly optimized permit messages supported network either switched another location routed application specific set programs permit extremely efficient accesses database records historically data tpf system fit fixed record core block sizes 381 1055 4k bytes due part physical record sizes blocks located dasd much overhead saved freeing part operating system breaking large data entities smaller ones file operations reassembling read operations since ibm hardware i/o via use channels channel programs tpf would generate small efficient channel programs i/o \u2014 name speed since early days also placed premium size storage media \u2014 memory disk tpf applications evolved powerful things using little resource today much limitations removed fact legacy support smaller-than-4k dasd records still used advances made dasd technology read/write 4k record efficient 1055 byte record advances increased capacity device longer premium placed ability pack data smallest model possible tpf also program segments allocated 381 1055 4k byte-sized records different points history segment consisted single record typically comprehensive application requiring perhaps tens even hundreds segments first forty years tpf history segments never link-edited instead relocatable object code direct output assembler laid memory internally self-referential relocatable symbols resolved entire image written file later loading system created challenging programming environment segments related one another could directly address control transfer implemented enter/back system service acp/tpf earliest days circa 1965 memory space severely limited gave rise distinction file-resident core-resident programs -- frequently used application programs written memory never removed core-residency rest stored file read demand backing memory buffers released post-execution introduction c language tpf version 3.0 first implemented conformant segment conventions including absence linkage editing scheme quickly demonstrated impractical anything simplest c programs tpf 4.1 truly fully linked load modules introduced tpf compiled z/os c/c++ compiler using tpf-specific header files linked iewl resulting z/os-conformant load module manner could considered traditional tpf segment tpf loader extended read z/os-unique load module file format lay file-resident load modules sections memory meanwhile assembly language programs remained confined tpf segment model creating obvious disparity applications written assembler written higher level languages hll z/tpf 1.1 source language types conceptually unified fully link-edited conform elf specification segment concept became obsolete meaning program written source language -- including assembler -- may size furthermore external references became possible separate source code programs segments could directly linked together shared object value point critical legacy applications benefit improved efficiency simple repackaging -- calls made members single shared object module much shorter pathlength run time compared calling system enter/back service members shared object may share writeable data regions directly thanks copy-on-write functionality also introduced z/tpf 1.1 coincidentally reinforces tpf reentrancy requirements concepts file- core- residency also made obsolete due z/tpf design point sought programs resident memory times since z/tpf maintain call stack high-level language programs gave hll programs ability benefit stack-based memory allocation deemed beneficial extend call stack assembly language programs optional basis ease memory pressure ease recursive programming z/tpf executable programs packaged elf shared objects historically step previous core blocks\u2014 memory\u2014 also 381 1055 4 k bytes size since memory blocks size overhead obtaining memory found systems discarded programmer merely needed decide size block would fit need ask tpf would maintain list blocks use simply hand first block available list physical memory divided sections reserved size 1055 byte block always came section returned overhead needed add address appropriate physical block table list compaction data collection required applications got advanced demands memory increased c became available memory chunks indeterminate large size required gave rise use heap storage memory management routines ease overhead tpf memory broken frames\u2014 4 kb size 1 mb z/tpf application needs certain number bytes number contiguous frames required fill need granted", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 99, + 134, + 142, + 170, + 171, + 185, + 187, + 265, + 306, + 322, + 353, + 380, + 387, + 413, + 434, + 465, + 477, + 583, + 650, + 664, + 720, + 721, + 723, + 728, + 735, + 754, + 797, + 860, + 870, + 884, + 891, + 925, + 940, + 941, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1087, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1397, + 1398, + 1415, + 1441, + 1456, + 1468, + 1474, + 1494, + 1530, + 1578, + 1610, + 1616, + 1631, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1547, + "label": 2, + "text": "Microsoft_Store_(digital):microsoft store digital microsoft store formerly known windows store digital distribution platform owned microsoft started app store windows 8 windows server 2012 primary means distributing universal windows platform uwp apps windows 10 microsoft merged distribution platforms windows marketplace windows phone store xbox video xbox music eventually xbox store microsoft store making unified distribution point apps digital videos digital music console games e-books included 2019 content available free charge store 2015 669,000 apps available store categories containing largest number apps games entertainment books reference education majority app developers one app similar platforms mac app store google play microsoft store curated apps must certified compatibility content addition user-facing microsoft store client store also developer portal developers interact microsoft takes 30 sale price apps prior january 1 2015 cut reduced 20 developer profits reached 25,000 microsoft previously maintained similar digital distribution system software known windows marketplace allowed customers purchase software online marketplace tracked product keys licenses allowing users retrieve purchases switching computers windows marketplace discontinued november 2008 microsoft first announced digital distribution service windows presentation build developer conference september 13 2011 details announced conference revealed store would able hold listings certified traditional windows apps well called metro-style apps time tightly-sandboxed software based microsoft design guidelines constantly monitored quality compliance consumers windows store intended way obtain metro-style apps announced alongside developer preview release windows 8 windows store become available consumer preview released february 2012 updates apps published store july 1 2019 available windows 8 rtm users per microsoft lifecycle policies windows 8 unsupported since 2016 updated version windows store introduced windows 8.1 home page remodeled display apps focused categories popular recommended top free paid special offers expanded details ability apps automatically update also added windows 8.1 update also introduced notable presentation changes including increasing top app lists return 1000 apps instead 100 apps 'picks section changing default sorting reviews 'most popular updates apps published store july 1 2023 available windows 8.1 windows 10 released updated version windows store merged microsoft distribution platforms windows marketplace windows phone store xbox video xbox music unified store front windows 10 platforms offering apps games music film tv series themes ebooks september 2017 microsoft began re-brand windows store microsoft store new icon carrying microsoft logo xbox store merged new version platform web apps traditional desktop software packaged distribution windows store desktop software distributed windows store packaged using app-v system allow sandboxing february 2018 microsoft announced progressive web apps would begin available microsoft store microsoft would automatically add selected quality progressive web apps bing crawler allow developers submit progressive web apps microsoft store windows store available windows server 2012 installed default unavailable windows server 2016 however line-of-business uwp apps uwp apps acquired microsoft store business formerly windows store business installed sideloading microsoft store primary means distributing windows store apps users although sideloading apps outside store supported out-of-box sideloading support windows 8 available enterprise edition windows 8 running computers joined windows domain sideloading windows rt windows 8 pro windows 8 enterprise computers without domain affiliation requires purchase additional licenses volume licensing windows 10 removes requirement allowing users freely enable disable sideloading initially microsoft took 30 cut app sales reached us 25,000 revenue cut dropped 20 january 1 2015 reduction cut 25,000 removed microsoft takes 30 cut app purchases regardless overall sales third-party transactions also allowed microsoft take cut early 2019 microsoft lets app developers get 95 app revenues microsoft take 5 user download app direct url individual developers able register 19 usd companies 99 usd 2015 669,000 apps available store including apps windows nt windows phone uwp apps work platforms categories containing largest number apps games entertainment books reference education majority app developers one app free paid apps distributed microsoft store paid apps ranging cost us 0.99 999.99 developers 120 countries submit apps microsoft store apps may support 109 languages long support one 12 app certification languages april 2 2019 microsoft announced sale e-books microsoft store ceased due drm licenses renewed books become inaccessible july 2019 microsoft automatically refund users purchased books via service similar windows phone store microsoft store regulated microsoft applicants must obtain microsoft approval app becomes available store prohibited apps include following types app forbidden microsoft indicated remotely disable and/or remove apps users systems security legal reasons case paid apps refunds may issued done microsoft initially banned pegi 18 -rated content store europe however critics noted made content policies stricter intended pegi 18-rated games rated mature u.s. esrb system next lowest highest rating adults guidelines amended december 2012 remove discrepancy addition user facing microsoft store client store also developer portal developers interact windows developer portal following sections app microsoft store provides developer tools tracking apps store one track downloads financials crashes adoption ratings dashboard also presents detailed breakdown users market age region well charts number downloads purchases average time spent app dashboard also allows developer claim app name one year name returned available pool", + "neighbors": [ + 26, + 33, + 36, + 66, + 79, + 93, + 134, + 148, + 153, + 207, + 262, + 268, + 275, + 278, + 295, + 301, + 312, + 326, + 336, + 337, + 344, + 433, + 435, + 459, + 472, + 485, + 509, + 521, + 558, + 574, + 615, + 638, + 662, + 670, + 689, + 705, + 716, + 791, + 796, + 801, + 815, + 865, + 899, + 920, + 961, + 989, + 1004, + 1025, + 1035, + 1046, + 1050, + 1092, + 1098, + 1109, + 1138, + 1151, + 1177, + 1212, + 1214, + 1225, + 1227, + 1235, + 1247, + 1261, + 1287, + 1292, + 1301, + 1311, + 1328, + 1338, + 1346, + 1363, + 1366, + 1370, + 1417, + 1458, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1555, + 1561, + 1566, + 1582, + 1589, + 1613, + 1620, + 1621, + 1625 + ], + "mask": "Train" + }, + { + "node_id": 1548, + "label": 4, + "text": "Greylisting:greylisting greylisting method defending e-mail users spam mail transfer agent mta using greylisting temporarily reject email sender recognize mail legitimate originating server try delay sufficient time elapsed email accepted server employing greylisting temporarily rejects email unknown suspicious sources sending 4xx reply codes please call back later defined simple mail transfer protocol smtp fully capable smtp implementations expected maintain queues retrying message transmissions cases legitimate mail may delayed still get temporary rejection issued different stages smtp dialogue allowing implementation store less data incoming message trade-off work bandwidth exact matching retries original messages rejecting message content received allows server store choice headers and/or hash message body addition whitelisting good senders greylister provide exceptions greylisting generally overridden fully validated tls connection matching certificate large senders often pool machines send resend email ip addresses most-significant 24 bits /24 treated equivalent cases spf records used determine sending pool similarly e-mail systems use unique per-message return-paths example variable envelope return path verp mailing lists sender rewriting scheme forwarded e-mail bounce address tag validation backscatter protection etc exact match sender address required every e-mail systems delayed greylisting systems try avoid delay eliminating variable parts verp using sender domain beginning local-part sender address greylisting effective mass email tools used spammers queue reattempt mail delivery normal regular mail transport agent delaying delivery also gives real-time blackhole lists similar lists time identify flag spam source thus subsequent attempts likely detected spam mechanisms greylisting delay main advantage user point view greylisting requires additional user configuration server utilizing greylisting configured appropriately end user notice delay first message given sender long sending email server identified belonging whitelisted group earlier messages mail sender repeatedly greylisted may worth contacting mail system administrator detailed headers delayed mail mail administrator point view benefit twofold greylisting takes minimal configuration get running occasional modifications local whitelists second benefit rejecting email temporary 451 error actual error code implementation dependent cheap system resources spam filtering tools intensive users cpu memory stopping spam hits filtering processes far fewer system resources used biggest disadvantage greylisting unrecognized servers destroys near-instantaneous nature email users come expect mail unrecognized servers typically delayed 15 minutes could delayed days poorly configured sending systems explaining users become accustomed immediate email delivery probably convince mail server uses greylisting behaving correctly particular problem websites require account created email address confirmed used \u2013 user greylisting mailserver attempts reset credentials website uses email confirmation password resets sending mta site poorly configured greylisting may delay initial email link extreme cases delivery delay imposed greylister exceed expiry time password reset token delivered email cases manual intervention may required whitelist website mailserver email containing reset token used expires mail server greylisted duration time initial delay re-transmission variable \u2013 something greylisting server control visibility smtp says retry interval least 30 minutes give-up time needs least 4\u20135 days actual values vary widely different mail server software modern greylisting applications postgrey unix-like operating systems automatically whitelist senders prove capable recovering temporary errors note irrespective reputed spamminess sender implementation also generally include ability manually whitelist mailservers one 2007 analysis greylisting considers totally undesirable due delay mail unreliable greylisting becomes widespread junkmailers adapt systems get around conclusion purpose greylisting reduce amount spam server spam-filtering software needs analyze resource-intensively save money servers reduce spam reaching users conclusion greylisting annoying much annoying spam current smtp specification rfc 5321 clearly states smtp client retains responsibility delivery message section 4.2.5 mail transmitted immediately must queued periodically retried sender section 4.5.4.1 mtas therefore queue retry messages small number typically handled whitelisting exception lists also legitimate mail might get delivered retry comes different ip address original attempt source email server farm goes kind relay service likely server original one make next attempt network fault tolerance ips belong completely unrelated address blocks thereby defying simple technique identifying significant part address since ip addresses different recipient server fail recognize series attempts related refuse turn continue message ages queue number servers large enough problem partially bypassed proactively identifying exceptions server farms likewise exception configured multihomed hosts hosts using dhcp extreme case sender could legitimately use different ipv6 address outbound smtp connection sender server subjected greylisting might also reattempt delivery another receiving mailserver receiving domain one mx record may cause problems hosts implement greylisting policy share database", + "neighbors": [ + 1094, + 1395 + ], + "mask": "Test" + }, + { + "node_id": 1549, + "label": 4, + "text": "Computer_security_compromised_by_hardware_failure:computer security compromised hardware failure computer security compromised hardware failure branch computer security applied hardware objective computer security includes protection information property theft corruption natural disaster allowing information property remain accessible productive intended users secret information could retrieved different ways article focus retrieval data thanks misused hardware hardware failure hardware could misused exploited get secret data article collects main types attack lead data theft computer security comprised devices keyboards monitors printers thanks electromagnetic acoustic emanation example components computer memory network card processor thanks time temperature analysis example monitor main device used access data computer shown monitors radiate reflect data environment potentially giving attackers access information displayed monitor video display units radiate known compromising emanations tempest radiation code word u.s. government programme aimed attacking problem electromagnetic broadcast data significant concern sensitive computer applications eavesdroppers reconstruct video screen content radio frequency emanations radiated harmonic video signal shows remarkable resemblance broadcast tv signal therefore possible reconstruct picture displayed video display unit radiated emission means normal television receiver preventive measures taken eavesdropping video display unit possible distances several hundreds meters using normal black-and-white tv receiver directional antenna antenna amplifier even possible pick information types video display units distance 1 kilometer sophisticated receiving decoding equipment used maximum distance much greater displayed monitor reflected environment time-varying diffuse reflections light emitted crt monitor exploited recover original monitor image eavesdropping technique spying distance data displayed arbitrary computer screen including currently prevalent lcd monitors technique exploits reflections screen optical emanations various objects one commonly finds close proximity screen uses reflections recover original screen content objects include eyeglasses tea pots spoons plastic bottles even eye user attack successfully mounted spy even small fonts using inexpensive off-the-shelf equipment less 1500 dollars distance 10 meters relying expensive equipment allowed conduct attack 30 meters away demonstrating similar attacks feasible side street close building many objects may found usual workplace exploited retrieve information computer display outsider particularly good results obtained reflections user eyeglasses tea pot located desk next screen reflections stem eye user also provide good results however eyes harder spy distance fast-moving objects require high exposure times using expensive equipment lower exposure times helps remedy problem reflections gathered curved surfaces close objects indeed pose substantial threat confidentiality data displayed screen fully invalidating threat without time hiding screen legitimate user seems difficult without using curtains windows similar forms strong optical shielding users however aware risk may willing close curtains nice day reflection object computer display curved mirror creates virtual image located behind reflecting surface flat mirror virtual image size located behind mirror distance original object curved mirrors however situation complex computer keyboards often used transmit confidential data passwords since contain electronic components keyboards emit electromagnetic waves emanations could reveal sensitive information keystrokes electromagnetic emanations turned constitute security threat computer equipment figure presents keystroke retrieved material necessary approach acquire raw signal directly antenna process entire captured electromagnetic spectrum thanks method four different kinds compromising electromagnetic emanations detected generated wired wireless keyboards emissions lead full partial recovery keystrokes best practical attack fully recovered 95 keystrokes ps/2 keyboard distance 20 meters even walls keyboard specific fingerprint based clock frequency inconsistencies determine source keyboard compromising emanation even multiple keyboards model used time four different kinds way compromising electromagnetic emanations described key pressed released held keyboard sends packet information known scan code computer protocol used transmit scan codes bidirectional serial communication based four wires vcc 5 volts ground data clock clock data signals identically generated hence compromising emanation detected combination signals however edges data clock lines superposed thus easily separated obtain independent signals falling edge transition attack limited partial recovery keystrokes significant limitation gtt falling edge transition attack improved recover almost keystrokes indeed two traces exactly one data rising edge attackers able detect transition fully recover keystrokes harmonics compromising electromagnetic emissions come unintentional emanations radiations emitted clock non-linear elements crosstalk ground pollution etc determining theoretically reasons compromising radiations complex task harmonics correspond carrier approximately 4 mhz likely internal clock micro-controller inside keyboard harmonics correlated clock data signals describe modulated signals amplitude frequency full state clock data signals means scan code completely recovered harmonics keyboard manufacturers arrange keys matrix keyboard controller often 8-bit processor parses columns one-by-one recovers state 8 keys matrix scan process described 192 keys keys may used instance modern keyboards use 104/105 keys arranged 24 columns 8 rows columns continuously pulsed one-by-one least 3\u03bcs thus leads may act antenna generate electromagnetic emanations attacker able capture emanations easily recover column pressed key even signal fully describe pressed key still gives partial information transmitted scan code i.e column number note matrix scan routine loops continuously key pressed still signal composed multiple equidistant peaks emanations may used remotely detect presence powered computers concerning wireless keyboards wireless data burst transmission used electromagnetic trigger detect exactly key pressed matrix scan emanations used determine column belongs techniques target keyboards table sums technique could used find keystroke different kind keyboard paper called compromising electromagnetic emanations wired wireless keyboards martin vuagnoux sylvain pasini tested 12 different keyboard models ps/2 usb connectors wireless communication different setups semi-anechoic chamber small office adjacent office flat building table presents results attacks emanations caused human typing attracted interest recent years particular works showed keyboard acoustic emanations leak information exploited reconstruct typed text pc keyboards notebook keyboards vulnerable attacks based differentiating sound emanated different keys attack takes input audio signal containing recording single word typed single person keyboard dictionary words assumed typed word present dictionary aim attack reconstruct original word signal attack taking input 10-minute sound recording user typing english text using keyboard recovering 96 typed characters attack inexpensive hardware required parabolic microphone non-invasive require physical intrusion system attack employs neural network recognize key pressed combines signal processing efficient data structures algorithms successfully reconstruct single words 7-13 characters recording clicks made typing keyboard sound clicks differ slightly key key keys positioned different positions keyboard plate although clicks different keys sound similar human ear average 0.5 incorrect recognitions per 20 clicks shows exposure keyboard eavesdropping using attack attack efficient taking 20 seconds per word standard pc 90 better success rate finding correct word words 10 characters success rate 73 words tested practice human attacker typically determine text random attacker also identify occasions user types user names passwords short audio signals containing single word seven characters long considered means signal seconds long short words often chosen password dominant factors affecting attack success word length importantly number repeated characters within word procedure makes possible efficiently uncover word audio recordings keyboard click sounds recently extracting information another type emanations demonstrated acoustic emanations mechanical devices dot-matrix printers extracting private information watching somebody typing keyboard might seem easy task becomes extremely challenging automated however automated tool needed case long-lasting surveillance procedures long user activity human able reconstruct characters per minute paper clearshot eavesdropping keyboard input video presents novel approach automatically recovering text typed keyboard based solely video user typing automatically recognizing keys pressed user hard problem requires sophisticated motion analysis experiments show human reconstructing sentences requires lengthy hours slow-motion analysis video attacker might install surveillance device room victim might take control existing camera exploiting vulnerability camera control software might simply point mobile phone integrated camera laptop keyboard victim working public space balzarotti analysis divided two main phases figure first phase analyzes video recorded camera using computer vision techniques frame video computer vision analysis computes set keys likely pressed set keys certainly pressed position space characters results phase analysis noisy second phase called text analysis required goal phase remove errors using language context-sensitive techniques result phase reconstructed text word represented list possible candidates ranked likelihood acoustic emanations attack recovers dot-matrix printer processing english text printing possible based record sound printer makes microphone close enough attack recovers 72 printed words 95 knowledge text done microphone distance 10 cm printer upfront training phase picture attack b picture fully automated uses combination machine learning audio processing speech recognition techniques including spectrum features hidden markov models linear classification fundamental reason reconstruction printed text works emitted sound becomes louder needles strike paper given time correlation number needles intensity acoustic emanation training phase conducted words dictionary printed characteristic sound features words extracted stored database trained characteristic features used recognize printed english text task trivial major challenges include timing attacks enable attacker extract secrets maintained security system observing time takes system respond various queries ssh designed provide secure channel two hosts despite encryption authentication mechanisms uses ssh weaknesses interactive mode every individual keystroke user types sent remote machine separate ip packet immediately key pressed leaks inter-keystroke timing information users \u2019 typing picture represents command su processed ssh connection simple statistical techniques suffice reveal sensitive information length users \u2019 passwords even root passwords using advanced statistical techniques timing information collected network eavesdropper learn significant information users type ssh sessions time takes operating system send packet keypress general negligible comparing interkeystroke timing also enables eavesdropper learn precise interkeystroke timings users \u2019 typing arrival times packets data remanence problems affect obvious areas ram non-volatile memory cells also occur areas device hot-carrier effects change characteristics semiconductors device various effects examined alongside obvious memory-cell remanence problems possible analyse recover data cells semiconductor devices general long theory vanished electromigration means physically move atom new locations physically alter device another type attack involves relocation metal atoms due high current densities phenomenon atoms carried along electron wind opposite direction conventional current producing voids negative electrode hillocks whiskers positive electrode void formation leads local increase current density joule heating interaction electrons metal ions produce thermal energy producing electromigration effects external stress removed disturbed system tends relax back original equilibrium state resulting backflow heals electromigration damage long term though cause device failure less extreme cases simply serves alter device operating characteristics noticeable ways example excavations voids leads increased wiring resistance growth whiskers leads contact formation current leakage example conductor exhibits whisker growth due electromigration shown figure one example exhibits void formation case severe enough led complete failure shown figure contrary popular assumption drams used modern computers retain contents several seconds power lost even room temperature even removed motherboard many products cryptographic security-related computations using secret keys variables equipment operator must able read alter usual solution secret data kept volatile memory inside tamper-sensing enclosure security processors typically store secret key material static ram power removed device tampered temperatures \u221220 \u00b0c contents sram \u2018 frozen \u2019 interesting know period time static ram device retain data power removed low temperatures increase data retention time sram many seconds even minutes maximillian dornseif presented technique slides let take control apple computer thanks ipod attacks needed first generic phase ipod software modified behaves master firewire bus ipod full read/write access apple computer ipod plugged firewire port firewire used audio devices printers scanners cameras gps etc generally device connected firewire full access read/write indeed ohci standard firewire standard reads device connected firewire read write data computer memory example device increase computational power processors generally equipped cache memory decreases memory access latency figure shows hierarchy processor memory first processor looks data cache l1 l2 memory data processor looking called cache-miss pictures show processor fetch data two cache levels unfortunately caches contain small portion application data introduce additional latency memory transaction case miss involves also additional power consumption due activation memory devices memory hierarchy miss penalty already used attack symmetric encryption algorithms like des basic idea proposed paper force cache miss processor executing aes encryption algorithm known plain text attacks allow unprivileged process attack process running parallel processor despite partitioning methods memory protection sandboxing virtualization carefully measuring amount time required perform private key operations attackers may able find fixed diffie-hellman exponents factor rsa keys break cryptosystems vulnerable system attack computationally inexpensive often requires known ciphertext attack treated signal detection problem signal consists timing variation due target exponent bit noise results measurement inaccuracies timing variations due unknown exponent bits properties signal noise determine number timing measurements required attack timing attacks potentially used cryptosystems including symmetric functions simple generic processor backdoor used attackers means privilege escalation get privileges equivalent given running operating system also non-privileged process one non-privileged invited domain running top virtual machine monitor get privileges equivalent virtual machine monitor lo\u00efc duflot studied intel processors paper cpu bugs cpu backdoors consequences security explains processor defines four different privilege rings numbered 0 privileged 3 least privileged kernel code usually running ring 0 whereas user-space code generally running ring 3 use security-critical assembly language instructions restricted ring 0 code order escalate privilege backdoor attacker must backdoors lo\u00efc duflot presents simple modify behavior three assembly language instructions simple specific activation conditions unlikely accidentally activated recent inventions begun target types processor-based escalation attacks", + "neighbors": [ + 14, + 123, + 149, + 227, + 272, + 282, + 346, + 379, + 412, + 429, + 739, + 789, + 834, + 1096, + 1138, + 1159, + 1324, + 1368, + 1372, + 1398, + 1452, + 1503, + 1518, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 1550, + "label": 5, + "text": "Amaya_(web_editor):amaya web editor amaya formerly amaya world discontinued free open source wysiwyg web authoring tool browsing abilities created structured editor project inria french national research institution later adopted world wide web consortium w3c testbed web standards role took arena web browser since last release january 2012 inria w3c stopped supporting project active development ceased amaya relatively low system requirements even comparison web browsers era active development period considered lightweight browser amaya originated direct descendant grif wysiwyg sgml editor created early 1980s html editor symposia based grif developed sold french software company grif sa last change code amaya feb 22 2013 used test-bed new web technologies supported major browsers amaya first client supported rdf annotation schema using xpointer browser available linux windows nt 95 mac os x amigaos sparc solaris aix osf/1 amaya formerly called tamaya tamaya name type tree represented logo later discovered tamaya also trademark used french company developers chose drop first letter make amaya", + "neighbors": [ + 14, + 16, + 83, + 95, + 107, + 134, + 210, + 258, + 277, + 306, + 427, + 452, + 491, + 509, + 530, + 531, + 580, + 582, + 623, + 627, + 668, + 680, + 684, + 713, + 796, + 862, + 872, + 886, + 939, + 953, + 961, + 1033, + 1058, + 1084, + 1132, + 1138, + 1166, + 1195, + 1210, + 1228, + 1280, + 1287, + 1331, + 1376, + 1378, + 1408, + 1423, + 1424, + 1470, + 1528, + 1569, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1551, + "label": 5, + "text": "Radius_Values:radius values remote authentication dial user service radius networking protocol provides centralized authentication authorization accounting aaa management computers connect use network service attributes radius use defined rfc 2865 .5", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1552, + "label": 5, + "text": "Transmission_Control_Protocol:transmission control protocol transmission control protocol tcp one main protocols internet protocol suite originated initial network implementation complemented internet protocol ip therefore entire suite commonly referred tcp/ip tcp provides reliable ordered error-checked delivery stream octets bytes applications running hosts communicating via ip network major internet applications world wide web email remote administration file transfer rely tcp applications require reliable data stream service may use user datagram protocol udp provides connectionless datagram service emphasizes reduced latency reliability may 1974 vint cerf bob kahn described internetworking protocol sharing resources using packet switching among network nodes authors working g\u00e9rard le lann incorporate concepts french cyclades project new network 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 internet protocol resulted networking model became known informally tcp/ip although formally variously referred department defense dod model arpanet model eventually also internet protocol suite 2004 vint cerf bob kahn received turing award foundational work tcp/ip transmission control protocol provides communication service intermediate level application program internet protocol provides host-to-host connectivity transport layer internet model application need know particular mechanisms sending data via link another host required ip fragmentation accommodate maximum transmission unit transmission medium transport layer tcp handles handshaking transmission details presents abstraction network connection application typically network socket interface lower levels protocol stack due network congestion traffic load balancing unpredictable network behaviour ip packets may lost duplicated delivered order tcp detects problems requests re-transmission lost data rearranges out-of-order data even helps minimize network congestion reduce occurrence problems data still remains undelivered source notified failure tcp receiver reassembled sequence octets originally transmitted passes receiving application thus tcp abstracts application communication underlying networking details tcp used extensively many internet applications including world wide web www email file transfer protocol secure shell peer-to-peer file sharing streaming media tcp optimized accurate delivery rather timely delivery incur relatively long delays order seconds waiting out-of-order messages re-transmissions lost messages therefore particularly suitable real-time applications voice ip applications protocols like real-time transport protocol rtp operating user datagram protocol udp usually recommended instead tcp reliable stream delivery service guarantees bytes received identical order sent since packet transfer many networks reliable tcp achieves using technique known positive acknowledgement re-transmission requires receiver respond acknowledgement message receives data sender keeps record packet sends maintains timer packet sent sender re-transmits packet timer expires receiving acknowledgement timer needed case packet gets lost corrupted ip handles actual delivery data tcp keeps track segments individual units data transmission message divided efficient routing network example html file sent web server tcp software layer server divides file segments forwards individually internet layer network stack internet layer software encapsulates tcp segment ip packet adding header includes among data destination ip address client program destination computer receives tcp software transport layer re-assembles segments ensures correctly ordered error-free streams file contents receiving application transmission control protocol accepts data data stream divides chunks adds tcp header creating tcp segment tcp segment encapsulated internet protocol ip datagram exchanged peers term tcp packet appears informal formal usage whereas precise terminology segment refers tcp protocol data unit pdu datagram ip pdu frame data link layer pdu processes transmit data calling tcp passing buffers data arguments tcp packages data buffers segments calls internet module e.g ip transmit segment destination tcp tcp segment consists segment header data section tcp header contains 10 mandatory fields optional extension field options pink background table data section follows header contents payload data carried application length data section specified tcp segment header calculated subtracting combined length tcp header encapsulating ip header total ip datagram length specified ip header tcp protocol operations may divided three phases connections must properly established multi-step handshake process connection establishment entering data transfer phase data transmission completed connection termination closes established virtual circuits releases allocated resources tcp connection managed operating system resource represents local end-point communications internet socket lifetime tcp connection local end-point undergoes series state changes establish connection tcp uses three-way handshake client attempts connect server server must first bind listen port open connections called passive open passive open established client may initiate active open establish connection three-way 3-step handshake occurs point client server received acknowledgment connection steps 1 2 establish connection parameter sequence number one direction acknowledged steps 2 3 establish connection parameter sequence number direction acknowledged full-duplex communication established connection termination phase uses four-way handshake side connection terminating independently endpoint wishes stop half connection transmits fin packet end acknowledges ack therefore typical tear-down requires pair fin ack segments tcp endpoint side sent first fin responded final ack waits timeout finally closing connection time local port unavailable new connections prevents confusion due delayed packets delivered subsequent connections connection half-open case one side terminated end side terminated longer send data connection side terminating side continue reading data side terminates well also possible terminate connection 3-way handshake host sends fin host b replies fin ack merely combines 2 steps one host replies ack host tcp stacks may implement half-duplex close sequence linux hp-ux host actively closes connection still read incoming data stack already received link host sends rst instead fin section 4.2.2.13 rfc 1122 allows tcp application sure remote application read data former sent\u2014waiting fin remote side actively closes connection remote tcp stack distinguish connection aborting rst data loss rst cause remote stack lose data received application protocols using tcp open/close handshaking application protocol open/close handshaking may find rst problem active close example program flow like tcp/ip stack like described guarantee data arrives application unread data arrived end implementations allocate entry table maps session running operating system process tcp packets include session identifier endpoints identify session using client address port whenever packet received tcp implementation must perform lookup table find destination process entry table known transmission control block tcb contains information endpoints ip port status connection running data packets exchanged buffers sending receiving data number sessions server side limited memory grow new connections arrive client must allocate random port sending first syn server port remains allocated whole conversation effectively limits number outgoing connections client ip addresses application fails properly close unrequired connections client run resources become unable establish new tcp connections even applications endpoints must also allocate space unacknowledged packets received unread data key features set tcp apart user datagram protocol tcp uses sequence number identify byte data sequence number identifies order bytes sent computer data reconstructed order regardless packet reordering packet loss may occur transmission sequence number first byte chosen transmitter first packet flagged syn number arbitrary fact unpredictable defend tcp sequence prediction attacks acknowledgements acks sent sequence number receiver data tell sender data received specified byte acks imply data delivered application merely signify receiver responsibility deliver data reliability achieved sender detecting lost data retransmitting tcp uses two primary techniques identify loss retransmission timeout abbreviated rto duplicate cumulative acknowledgements dupacks single packet say packet 100 stream lost receiver acknowledge packets 100 uses cumulative acks hence receiver acknowledges packet 99 receipt another data packet duplicate acknowledgement used signal packet loss sender receives three duplicate acknowledgements retransmits last unacknowledged packet threshold three used network may reorder packets causing duplicate acknowledgements threshold demonstrated avoid spurious retransmissions due reordering sometimes selective acknowledgements sacks used give explicit feedback packets received greatly improves tcp ability retransmit right packets whenever packet sent sender sets timer conservative estimate packet acked sender receive ack transmits packet timer reset every time sender receives acknowledgement means retransmit timer fires sender received acknowledgement long time typically timer value set formula_1 formula_2 clock granularity case retransmit timer fired still acknowledgement received next timer set twice previous value certain threshold among things helps defend man-in-the-middle denial service attack tries fool sender making many retransmissions receiver overwhelmed sender infers data lost network using one two techniques described retransmits data sequence numbers allow receivers discard duplicate packets properly sequence reordered packets acknowledgments allow senders determine retransmit lost packets assure correctness checksum field included see checksum computation section details checksumming tcp checksum weak check modern standards data link layers high bit error rates may require additional link error correction/detection capabilities weak checksum partially compensated common use crc better integrity check layer 2 tcp ip used ppp ethernet frame however mean 16-bit tcp checksum redundant remarkably introduction errors packets crc-protected hops common end-to-end 16-bit tcp checksum catches simple errors end-to-end principle work tcp uses end-to-end flow control protocol avoid sender send data fast tcp receiver receive process reliably mechanism flow control essential environment machines diverse network speeds communicate example pc sends data smartphone slowly processing received data smartphone must regulate data flow overwhelmed tcp uses sliding window flow control protocol tcp segment receiver specifies receive window field amount additionally received data bytes willing buffer connection sending host send amount data must wait acknowledgement window update receiving host receiver advertises window size 0 sender stops sending data starts persist timer persist timer used protect tcp deadlock situation could arise subsequent window size update receiver lost sender send data receiving new window size update receiver persist timer expires tcp sender attempts recovery sending small packet receiver responds sending another acknowledgement containing new window size receiver processing incoming data small increments may repeatedly advertise small receive window referred silly window syndrome since inefficient send bytes data tcp segment given relatively large overhead tcp header final main aspect tcp congestion control tcp uses number mechanisms achieve high performance avoid congestion collapse network performance fall several orders magnitude mechanisms control rate data entering network keeping data flow rate would trigger collapse also yield approximately max-min fair allocation flows acknowledgments data sent lack acknowledgments used senders infer network conditions tcp sender receiver coupled timers tcp senders receivers alter behavior flow data generally referred congestion control and/or network congestion avoidance modern implementations tcp contain four intertwined algorithms slow-start congestion avoidance fast retransmit fast recovery rfc 5681 addition senders employ retransmission timeout rto based estimated round-trip time rtt sender receiver well variance round trip time behavior timer specified rfc 6298 subtleties estimation rtt example senders must careful calculating rtt samples retransmitted packets typically use karn algorithm tcp timestamps see rfc 1323 individual rtt samples averaged time create smoothed round trip time srtt using jacobson algorithm srtt value finally used round-trip time estimate enhancing tcp reliably handle loss minimize errors manage congestion go fast high-speed environments ongoing areas research standards development result number tcp congestion avoidance algorithm variations maximum segment size mss largest amount data specified bytes tcp willing receive single segment best performance mss set small enough avoid ip fragmentation lead packet loss excessive retransmissions try accomplish typically mss announced side using mss option tcp connection established case derived maximum transmission unit mtu size data link layer networks sender receiver directly attached furthermore tcp senders use path mtu discovery infer minimum mtu along network path sender receiver use dynamically adjust mss avoid ip fragmentation within network mss announcement also often called mss negotiation strictly speaking mss negotiated originator receiver would imply originator receiver negotiate agree upon single unified mss applies communication directions connection fact two completely independent values mss permitted two directions data flow tcp connection situation may arise example one devices participating connection extremely limited amount memory reserved perhaps even smaller overall discovered path mtu processing incoming tcp segments relying purely cumulative acknowledgment scheme employed original tcp protocol lead inefficiencies packets lost example suppose bytes sequence number 1,000 10,999 sent 10 different tcp segments equal size second segment sequence numbers 2,000 2,999 lost transmission pure cumulative acknowledgment protocol receiver send cumulative ack value 2,000 sequence number immediately following last sequence number received data say received bytes 3,000 10,999 successfully thus sender may resend data starting sequence number 2,000 alleviate issue tcp employs selective acknowledgment sack option defined 1996 rfc 2018 allows receiver acknowledge discontinuous blocks packets received correctly addition sequence number immediately following last sequence number last contiguous byte received successively basic tcp acknowledgment acknowledgement specify number sack blocks sack block conveyed left edge block first sequence number block right edge block sequence number immediately following last sequence number block block contiguous range receiver correctly received example receiver would send ack segment cumulative ack value 2,000 sack option header sequence numbers 3,000 11,000 sender would accordingly retransmit second segment sequence numbers 2,000 2,999 tcp sender interpret out-of-order segment delivery lost segment tcp sender retransmit segment previous out-of-order packet slow data delivery rate connection duplicate-sack option extension sack option defined may 2000 rfc 2883 solves problem tcp receiver sends d-ack indicate segments lost tcp sender reinstate higher transmission-rate sack option mandatory comes operation parties support negotiated connection established sack uses tcp header option see tcp segment structure details use sack become widespread\u2014all popular tcp stacks support selective acknowledgment also used stream control transmission protocol sctp efficient use high-bandwidth networks larger tcp window size may used tcp window size field controls flow data value limited 2 65,535 bytes since size field expanded scaling factor used tcp window scale option defined rfc 1323 option used increase maximum window size 65,535 bytes 1 gigabyte scaling larger window sizes part necessary tcp tuning window scale option used tcp 3-way handshake window scale value represents number bits left-shift 16-bit window size field window scale value set 0 shift 14 direction independently sides must send option syn segments enable window scaling either direction routers packet firewalls rewrite window scaling factor transmission causes sending receiving sides assume different tcp window sizes result non-stable traffic may slow problem visible sites behind defective router tcp timestamps defined rfc 1323 1992 help tcp determine order packets sent tcp timestamps normally aligned system clock start random value many operating systems increment timestamp every elapsed millisecond however rfc states ticks proportional two timestamp fields tcp timestamps used algorithm known protection wrapped sequence numbers paws see rfc 1323 details paws used receive window crosses sequence number wraparound boundary case packet potentially retransmitted answers question sequence number first 4 gb second timestamp used break tie also eifel detection algorithm rfc 3522 uses tcp timestamps determine retransmissions occurring packets lost simply order recent statistics show level timestamp adoption stagnated ~40 owing windows server dropping support since windows server 2008 tcp timestamps enabled default linux kernel. disabled default windows server 2008 2012 2016 possible interrupt abort queued stream instead waiting stream finish done specifying data urgent tells receiving program process immediately along rest urgent data finished tcp informs application resumes back stream queue example tcp used remote login session user send keyboard sequence interrupts aborts program end signals often needed program remote machine fails operate correctly signals must sent without waiting program finish current transfer tcp out-of-band data designed modern internet urgent pointer alters processing remote host n't expedite processing network gets remote host two slightly different interpretations protocol means single bytes oob data reliable assuming reliable one least commonly used protocol elements tends poorly implemented normally tcp waits 200 ms full packet data send nagle algorithm tries group small messages single packet wait creates small potentially serious delays repeated constantly file transfer example typical send block would 4 kb typical mss 1460 2 packets go 10 mbit/s ethernet taking ~1.2 ms followed third carrying remaining 1176 197 ms pause tcp waiting full buffer case telnet user keystroke echoed back server user see screen delay would become annoying setting socket option codice_1 overrides default 200 ms send delay application programs use socket option force output sent writing character line characters rfc defines codice_2 push bit message receiving tcp stack send data immediately receiving application way indicate control user space using berkeley sockets controlled protocol stack tcp may attacked variety ways results thorough security assessment tcp along possible mitigations identified issues published 2009 currently pursued within ietf using spoofed ip address repeatedly sending purposely assembled syn packets followed many ack packets attackers cause server consume large amounts resources keeping track bogus connections known syn flood attack proposed solutions problem include syn cookies cryptographic puzzles though syn cookies come set vulnerabilities sockstress similar attack might mitigated system resource management advanced dos attack involving exploitation tcp persist timer analyzed phrack 66 push ack floods variants attacker able eavesdrop tcp session redirect packets hijack tcp connection attacker learns sequence number ongoing communication forges false segment looks like next segment stream simple hijack result one packet erroneously accepted one end receiving host acknowledges extra segment side connection synchronization lost hijacking might combined address resolution protocol arp routing attacks allow taking control packet flow get permanent control hijacked tcp connection impersonating different ip address difficult prior rfc 1948 initial sequence number easily guessable allowed attacker blindly send sequence packets receiver would believe come different ip address without need deploy arp routing attacks enough ensure legitimate host impersonated ip address bring condition using denial-of-service attacks initial sequence number chosen random attacker eavesdrop predict size next packet sent cause receiver accept malicious payload without disrupting existing connection attacker injects malicious packet sequence number payload size next expected packet legitimate packet ultimately received found sequence number length packet already received silently dropped normal duplicate packet\u2014the legitimate packet vetoed malicious packet unlike connection hijacking connection never desynchronized communication continues normal malicious payload accepted tcp veto gives attacker less control communication makes attack particularly resistant detection large increase network traffic ack storm avoided evidence receiver something amiss single duplicate packet normal occurrence ip network sender vetoed packet never sees evidence attack another vulnerability tcp reset attack tcp udp use port numbers identify sending receiving application end-points host often called internet sockets side tcp connection associated 16-bit unsigned port number 0-65535 reserved sending receiving application arriving tcp packets identified belonging specific tcp connection sockets combination source host address source port destination host address destination port means server computer provide several clients several services simultaneously long client takes care initiating simultaneous connections one destination port different source ports port numbers categorized three basic categories well-known registered dynamic/private well-known ports assigned internet assigned numbers authority iana typically used system-level root processes well-known applications running servers passively listening connections typically use ports examples include ftp 20 21 ssh 22 telnet 23 smtp 25 http ssl/tls 443 http 80 registered ports typically used end user applications ephemeral source ports contacting servers also identify named services registered third party dynamic/private ports also used end user applications less commonly dynamic/private ports contain meaning outside particular tcp connection network address translation nat typically uses dynamic port numbers internet-facing public side disambiguate flow traffic passing public network private subnetwork thereby allowing many ip addresses ports subnet serviced single public-facing address tcp complex protocol however significant enhancements made proposed years basic operation changed significantly since first specification rfc 675 1974 v4 specification rfc 793 published september 1981 rfc 1122 host requirements internet hosts clarified number tcp protocol implementation requirements list 8 required specifications 20 strongly encouraged enhancements available rfc 7414 among list rfc 2581 tcp congestion control one important tcp-related rfcs recent years describes updated algorithms avoid undue congestion 2001 rfc 3168 written describe explicit congestion notification ecn congestion avoidance signaling mechanism original tcp congestion avoidance algorithm known tcp tahoe many alternative algorithms since proposed including tcp reno tcp vegas fast tcp tcp new reno tcp hybla tcp interactive itcp research effort tcp extensions allows applications subscribe tcp events register handler components launch applications various purposes including application-assisted congestion control multipath tcp mptcp ongoing effort within ietf aims allowing tcp connection use multiple paths maximize resource usage increase redundancy redundancy offered multipath tcp context wireless networks enables simultaneous utilization different networks brings higher throughput better handover capabilities multipath tcp also brings performance benefits datacenter environments reference implementation multipath tcp developed linux kernel multipath tcp used support siri voice recognition application iphones ipads macs tcp cookie transactions tcpct extension proposed december 2009 secure servers denial-of-service attacks unlike syn cookies tcpct conflict tcp extensions window scaling tcpct designed due necessities dnssec servers handle large numbers short-lived tcp connections tcpcrypt extension proposed july 2010 provide transport-level encryption directly tcp designed work transparently require configuration unlike tls ssl tcpcrypt provide authentication provides simple primitives application first tcpcrypt ietf draft published implementations exist several major platforms tcp fast open extension speed opening successive tcp connections two endpoints works skipping three-way handshake using cryptographic cookie similar earlier proposal called t/tcp widely adopted due security issues tcp fast open published rfc 7413 2014 proposed may 2013 proportional rate reduction prr tcp extension developed google engineers prr ensures tcp window size recovery close slow-start threshold possible algorithm designed improve speed recovery default congestion control algorithm linux 3.2+ kernels tcp originally designed wired networks packet loss considered result network congestion congestion window size reduced dramatically precaution however wireless links known experience sporadic usually temporary losses due fading shadowing hand interference radio effects strictly congestion erroneous back-off congestion window size due wireless packet loss may congestion avoidance phase conservative decrease window size causes radio link underutilized extensive research combating harmful effects conducted suggested solutions categorized end-to-end solutions require modifications client server link layer solutions radio link protocol rlp cellular networks proxy-based solutions require changes network without modifying end nodes number alternative congestion control algorithms vegas westwood veno santa cruz proposed help solve wireless problem one way overcome processing power requirements tcp build hardware implementations widely known tcp offload engines toe main problem toes hard integrate computing systems requiring extensive changes operating system computer device one company develop device alacritech packet sniffer intercepts tcp traffic network link useful debugging networks network stacks applications use tcp showing user packets passing link networking stacks support so_debug socket option enabled socket using setsockopt option dumps packets tcp states events socket helpful debugging netstat another utility used debugging many applications tcp appropriate one problem least normal implementations application access packets coming lost packet retransmitted copy lost packet received causes problems real-time applications streaming media real-time multiplayer games voice ip voip generally useful get data timely fashion get data order historical performance reasons storage area networks sans use fibre channel protocol fcp fibre channel connections also embedded systems network booting servers serve simple requests huge numbers clients e.g dns servers complexity tcp problem finally tricks transmitting data two hosts behind nat using stun similar systems far simpler without relatively complex protocol like tcp way generally tcp unsuitable user datagram protocol udp used provides application multiplexing checksums tcp handle streams retransmission giving application developer ability code way suitable situation replace methods like forward error correction interpolation stream control transmission protocol sctp another protocol provides reliable stream oriented services similar tcp newer considerably complex tcp yet seen widespread deployment however especially designed used situations reliability near-real-time considerations important venturi transport protocol vtp patented proprietary protocol designed replace tcp transparently overcome perceived inefficiencies related wireless data transport tcp also issues high-bandwidth environments tcp congestion avoidance algorithm works well ad-hoc environments data sender known advance environment predictable timing based protocol asynchronous transfer mode atm avoid tcp retransmits overhead udp-based data transfer protocol udt better efficiency fairness tcp networks high bandwidth-delay product multipurpose transaction protocol mtp/ip patented proprietary software designed adaptively achieve high throughput transaction performance wide variety network conditions particularly tcp perceived inefficient tcp runs ipv4 method used compute checksum defined rfc 793 checksum field 16 bit one complement one complement sum 16-bit words header text segment contains odd number header text octets checksummed last octet padded right zeros form 16-bit word checksum purposes pad transmitted part segment computing checksum checksum field replaced zeros words appropriate padding 16-bit words added using one complement arithmetic sum bitwise complemented inserted checksum field pseudo-header mimics ipv4 packet header used checksum computation shown table source destination addresses ipv4 header protocol value 6 tcp cf list ip protocol numbers tcp length field length tcp header data measured octets tcp runs ipv6 method used compute checksum changed per rfc 2460 pseudo-header mimics ipv6 header computation checksum shown many tcp/ip software stack implementations provide options use hardware assistance automatically compute checksum network adapter prior transmission onto network upon reception network validation may relieve os using precious cpu cycles calculating checksum hence overall network performance increased feature may cause packet analyzers unaware uncertain use checksum offload report invalid checksums outbound packets yet reached network adapter occur packets intercepted transmitted network adapter packets transmitted network adaptor wire valid checksums issue also occur monitoring packets transmitted virtual machines host virtual device driver may omit checksum calculation optimization knowing checksum calculated later vm host kernel physical hardware", + "neighbors": [ + 14, + 52, + 109, + 134, + 195, + 311, + 329, + 333, + 363, + 364, + 405, + 425, + 430, + 442, + 444, + 455, + 470, + 505, + 522, + 542, + 543, + 545, + 566, + 598, + 614, + 631, + 672, + 678, + 684, + 692, + 711, + 732, + 736, + 757, + 758, + 764, + 769, + 770, + 771, + 779, + 813, + 833, + 977, + 991, + 993, + 1034, + 1056, + 1116, + 1140, + 1171, + 1200, + 1206, + 1218, + 1220, + 1325, + 1326, + 1329, + 1337, + 1386, + 1395, + 1400, + 1408, + 1410, + 1415, + 1424, + 1438, + 1443, + 1448, + 1452, + 1453, + 1470, + 1510, + 1517, + 1570, + 1587, + 1588, + 1594, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 1553, + "label": 7, + "text": "Diskless_node:diskless node diskless node diskless workstation workstation personal computer without disk drives employs network booting load operating system server computer may also said act diskless node disks unused network booting used diskless nodes computers acting sometimes known network computers hybrid clients hybrid client may either mean diskless node may used particular sense mean diskless node runs applications remotely thin client computing architecture advantages diskless nodes include lower production cost lower running costs quieter operation manageability advantages example centrally managed software installation many universities large organizations pcs used similar configuration applications stored remotely executed locally\u2014again manageability reasons however diskless nodes still boot local hard drive diskless nodes process data thus using cpu ram run software store data persistently\u2014that task handed server distinct thin clients significant processing happens remotely server\u2014the software runs thin client thin i.e relatively small simple client software handles simple input/output tasks communicate user drawing dialog box display waiting user input collective term encompassing thin client computing technological predecessor text terminals text-only centralized computing thin clients text terminals require powerful central processing facilities servers order perform significant processing tasks clients diskless nodes seen compromise fat clients ordinary personal computers centralized computing using central storage efficiency requiring centralized processing making efficient use powerful processing power even slowest contemporary cpus would tend sit idle much time centralized computing model operating system os diskless node loaded server using network booting cases removable storage may used initiate bootstrap process usb flash drive bootable media floppy disk cd dvd however firmware many modern computers configured locate server begin bootup process automatically without need insert bootable media network auto-booting preboot execution environment pxe bootstrap protocol bootp network protocols commonly used find server files booting device standard full-size desktop pcs able network-booted manner add-on network card includes undi boot rom diskless network booting commonly built-in feature desktop laptop pcs intended business use since used otherwise disk-booted standard desktop computer remotely run diagnostics install software apply disk image local hard drive bootstrapping process initiated described bootstrapping take place according one three main approaches windows 3.x windows 95 osr1 supported remote boot operations netware servers windows nt servers even dec pathworks servers third party software vendors qualystem acquired neoware lanworks acquired 3com ardence acquired citrix apct xtreamining technology developed marketed software products aimed remote-boot newer versions windows product line windows 95 osr2 windows 98 supported qualystem lanworks windows nt supported apct ardence called venturcom time windows 2000/xp/2003/vista/windows 7 supported hewlett packard acquired neoware previously acquired qualystem citrix systems acquired ardence essentially single os image array machines perhaps customizations differences hardware configurations among nodes installing software maintaining installed software efficient furthermore system changes made operation due user action worms viruses etc either wiped power removed image copied local ram disk windows xp embedded remote boot prohibited entirely image network filesystem allows use public access areas libraries schools etc. users might wish experiment attempt hack system however necessary implement network booting achieve either advantages ordinary pcs help appropriate software configured download reinstall operating systems e.g nightly basis extra work compared using shared disk image diskless nodes boot modern diskless nodes share disk image using 1 n relationship 1 disk image used simultaneously n diskless nodes makes easy install maintain software applications administrator needs install maintain application clients get new application soon boot updated image disk image sharing made possible use write cache client competes writing shared disk image client writes cache modern diskless nodes systems also use 1:1 client-to-diskimage relationship one client owns one disk image writes directly said disk image write cache used making modification shared disk image usually made way use central disk storage also makes efficient use disk storage cut storage costs freeing capital invest reliable modern storage technologies raid arrays support redundant operation storage area networks allow hot-adding storage without interruption means losses disk drives mechanical electrical failure\u2014which statistically highly probable events timeframe years large number disks involved\u2014are often less likely happen typically fewer disk drives fail less likely cause interruption would likely part raid arrays also means nodes less likely hardware failures fat clients diskless nodes share advantages thin clients however storage efficiency come price often happens computing increased storage efficiency sometimes comes price decreased performance large numbers nodes making demands server simultaneously slow everyone experience however mitigated installing large amounts ram server speeds read operations improving caching performance adding servers distributes i/o workload adding disks raid array distributes physical i/o workload case also problem affect client-server network extent since course fat clients also use servers store user data indeed user data may much significant size may accessed far frequently operating systems programs environments moving diskless model necessarily cause noticeable degradation performance greater network bandwidth i.e capacity also used diskless model compared fat client model necessarily mean higher capacity network infrastructure need installed\u2014it could simply mean higher proportion existing network capacity used finally combination network data transfer latencies physically transferring data network contention latencies waiting server process nodes requests lead unacceptable degradation performance compared using local drives depending nature application capacity network infrastructure server another example situation diskless node would useful possibly hazardous environment computers likely damaged destroyed thus making need inexpensive nodes minimal hardware benefit thin clients also used diskless machines may also consume little power make little noise implies potential environmental benefits makes ideal computer cluster applications major corporations tend instead implement thin clients using microsoft windows terminal server software since much lower specification hardware used client essentially acts simple window central server actually running users operating system login session course diskless nodes also used thin clients moreover thin client computers increasing power point becoming suitable fully-fledged diskless workstations applications thin client diskless node architectures employ diskless clients advantages fat clients see differ regard location processing", + "neighbors": [ + 134, + 210, + 213, + 330, + 352, + 413, + 444, + 755, + 961, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 1554, + "label": 4, + "text": "Srizbi_botnet:srizbi botnet srizbi botnet considered one world largest botnets responsible sending half spam sent major botnets combined botnets consist computers infected srizbi trojan sent spam command srizbi suffered massive setback november 2008 hosting provider janka cartel taken global spam volumes reduced 93 result action size srizbi botnet estimated around 450,000 compromised machines estimation differences smaller 5 among various sources botnet reported capable sending around 60 trillion janka threats day half total approximately 100 trillion janka threats sent every day comparison highly publicized storm botnet manages reach around 20 total number spam sent peak periods srizbi botnet showed relative decline aggressive growth number spam messages sent mid-2008 july 13 2008 botnet believed responsible roughly 40 spam net sharp decline almost 60 share may earliest reports srizbi trojan outbreaks around june 2007 small differences detection dates across antivirus software vendors however reports indicate first released version already assembled 31 march 2007 srizbi botnet experts considered second largest botnet internet however controversy surrounding kraken botnet may srizbi largest botnet srizbi botnet consists computers infected srizbi trojan horse trojan horse deployed onto victim computer mpack malware kit past editions used n404 web exploit kit malware kit spread kit usage deprecated favor mpack distribution malware kits partially achieved utilizing botnet botnet known send spam containing links fake videos celebrities include link pointing malware kit similar attempts taken subjects illegal software sales personal messages apart self-propagation mpack kit also known much aggressive spreading tactics notably compromise 10,000 websites june 2007 domains included surprising number pornographic websites ended forwarding unsuspecting visitor websites containing mpack program computer becomes infected trojan horse computer becomes known zombie command controller botnet commonly referred botnet herder operation srizbi botnet based upon number servers control utilization individual bots botnet servers redundant copies protects botnet crippled case system failure legal action takes server server-side srizbi botnet handled program called reactor mailer python-based web component responsible coordinating spam sent individual bots botnet reactor mailer existed since 2004 currently third release also used control srizbi botnet software allows secure login allows multiple accounts strongly suggests access botnet spam capacity sold external parties software service reinforced evidence showing srizbi botnet runs multiple batches spam time blocks ip addresses observed sending different types spam one time user granted access utilize software create message want send test spamassassin score send users list email addresses suspicion arisen writer reactor mailer program might person responsible srizbi trojan code analysis shows code fingerprint matches two programs claim indeed true coder might well responsible trojan behind another botnet named rustock according symantec code used srizbi trojan similar code found rustock trojan could well improved version latter srizbi trojan client side program responsible sending spam infected machines trojan credited extremely efficient task explains srizbi capable sending high volumes spam without huge numerical advantage number infected computers apart efficient spam engine trojan also capable hiding user system including products designed remove trojan system trojan fully executed kernel mode noted employ rootkit technologies prevent form detection patching ntfs file system drivers trojan make files invisible operating system human user utilizing system trojan also capable hiding network traffic generates directly attaching ndis tcp/ip drivers process feature currently unique trojan procedure proven allow trojan bypass firewall sniffer protection provided locally system bot place operational contact one hardcoded servers list carries server supply bot zip file containing number files required bot start spamming business following files identified downloaded files received bot first initialize software routine allows remove files critical revealing spam rootkit applications srizbi botnet basis several incidents received media coverage several notable ones described means complete list incidents list major ones october 2007 several anti-spam firms noticed unusual political spam campaign emerging unlike usual messages counterfeit watches stocks penis enlargement mail contained promotional information united states presidential candidate ron paul ron paul camp dismissed spam related official presidential campaign spokesman told press true could done well-intentioned yet misguided supporter someone bad intentions trying embarrass campaign either way independent work connection spam ultimately confirmed come srizbi network capture one control servers involved investigators learned spam message sent 160 million email addresses 3,000 bot computers spammer identified internet handle nenastnyj \u043d\u0435\u043d\u0430\u0441\u0442\u043d\u044b\u0439 means rainy foul rainy day foul weather russian real identity determined week 20 june 2008 srizbi managed triple number malicious spam sent average 3 9.9 largely due effort particular spam wave aggressive attempt increase size srizbi botnet sending emails users warned videotaped naked sending message kind spam referred stupid theme attempt get people click malicious link included mail realizing message likely spam old social engineering technique remains proven method infection spammers size operation shows power monetary income botnet closely based upon spam capacity infected computers translate directly greater revenue botnet controller also shows power botnets increase size mainly using part strength numbers removal control servers hosted mccolo late november 2008 control botnet transferred servers hosted estonia accomplished mechanism trojan horse queried algorithmically generated set domain names one registered individuals controlling botnet united states computer security firm fireeye inc. kept system controllers hands period two weeks preemptively registering generated domain names position sustain effort however spamming activity greatly reduced control server transfer", + "neighbors": [ + 77, + 149, + 198, + 326, + 450, + 490, + 522, + 531, + 576, + 620, + 666, + 1090, + 1138, + 1162, + 1225, + 1337, + 1358, + 1365, + 1379, + 1428, + 1467, + 1543 + ], + "mask": "Test" + }, + { + "node_id": 1555, + "label": 2, + "text": "Criticism_of_Windows_10:criticism windows 10 windows 10 operating system released microsoft july 2015 criticized reviewers users due issues mostly privacy subject number negative assessments various groups critics noted windows10 heavily emphasizes freemium services contains various advertising facilities outlets considered hidden cost free upgrade offer examples include media storefronts office 365 paid functionality bundled games microsoft solitaire collection default settings display promotions suggested apps start menu tips lock screen may contain advertising ads displayed file explorer office 365 subscriptions redstone 2 builds notifications promoting microsoft edge web browser different browser set default windows 10 home permanently set download updates automatically including cumulative updates security patches drivers users individually select updates install microsoft offers diagnostic tool used hide updates prevent reinstalled already installed uninstalled without rebooting system tom warren verge felt given web browsers google chrome already adopted automatic update system requirement would help keep windows10 devices secure felt 're used family members calling technical support 've failed upgrade latest windows service pack malware disabled windows update days hopefully concerns raised due changes users would unable skip automatic installation updates faulty cause issues certain system configurationsalthough build upgrades also subject public beta testing via windows insider program also concerns forced installation driver updates windows update previously designated optional could cause conflicts drivers installed independently windows update situation occurred prior general release operating system nvidia graphics card driver automatically pushed windows10 users via windows update caused issues prevented use certain functions prevented system booting criticism also directed towards microsoft decision longer provide specific details contents cumulative updates windows 10 february 9 2016 microsoft reversed decision began provide release notes cumulative updates windows website users reported installation november upgrade applications particularly utility programs cpu-z speccy automatically uninstalled upgrade process default programs reset microsoft-specified defaults photos app microsoft edge pdf viewing without warning issues discovered upon launch anniversary update redstone including bug caused devices freeze addressed cumulative update kb3176938 released august 31 2016 fundamental changes windows handles webcams caused many stop working microsoft criticized tactics used promote free upgrade campaign windows 10 including adware-like behaviors using deceptive user interfaces coax users installing operating system downloading installation files without user consent making difficult users suppress advertising notifications wish upgrade 10 upgrade offer marketed initiated using get windows 10 gwx application first downloaded installed via windows update march 2015 registry keys group policy settings could used partially disable gwx mechanism installation patches gwx software via windows update could reset keys back defaults thus reactivate software third-party programs also created assist users applying measures disable gwx september 2015 reported microsoft triggering automatic downloads windows10 installation files compatible windows7 8.1computers configured automatically download install updates regardless whether specifically requested upgrade microsoft officially confirmed change claiming industry practice reduces time installation ensures device readiness move criticized users data caps devices low storage capacity resources consumed automatic downloads 6gb data critics argued microsoft triggered downloading windows10 installation files without user consent october 2015 windows10 began appear optional update windows update interface pre-selected installation systems microsoft spokesperson said mistake download would longer pre-selected default however october 29 2015 microsoft announced planned classify windows10 recommended update windows update interface time 2016 cause automatic download installation files one-time prompt choice install appear december 2015 reported new advertising dialog begun appear containing upgrade upgrade tonight buttons obvious method decline installation besides close button march 2016 users also alleged windows 7 8.1 devices automatically begun upgrading 10 without consent june 2016 gwx dialog behavior changed make closing window imply consent scheduled upgrade despite infoworld editor disputed claims upgrades begun without consent testing showed upgrade windows10 would begin user accepts end-user license agreement eula presented installer would eventually cause windows update time error thus halting installation attempt concluded users may unknowingly clicked accept prompt without full knowledge would begin upgrade december 2016 microsoft chief marketing officer chris capossela admitted company gone far using tactic stating know want people running windows 10 security perspective finding right balance \u2019 stepping line aggressive something tried lot year think got right january 21 2016 microsoft sued small claims court user whose computer shortly release os attempted upgrade windows10 without consent upgrade failed computer left unstable state thereafter disrupted ability run travel agency court ruled favor user awarded 10,000 damages microsoft appealed however may 2016 microsoft dropped appeal chose pay damages shortly suit reported seattle times microsoft confirmed updating gwx software add explicit options opting free windows 10 upgrade final notification full-screen pop-up window notifying users impending end free upgrade offer contained remind later notify notify three times options concerns shown advocates critics windows10 privacy policies collection use customer data default express settings windows 10 configured send various information microsoft parties including collection user contacts calendar data computer appearance including color chassis associated input data personalize speech typing inking input typing inking data improve recognition allow apps use unique advertising id analytics advertising personalization functionality introduced windows 8.1 allow apps request user location data send data microsoft trusted partners improve location detection windows 8 similar settings except location data collection include trusted partners users opt data collection telemetry data error reporting usage also sent microsoft disabled non-enterprise versions windows 10 use cortana intelligent personal assistant also requires collection data device location data calendar apps use data emails text messages call contacts often interact device \u201d personalize functionality rock paper shotgun writer alec meer argued microsoft intent data collection lacked transparency stating world 45 pages policy documents opt-out settings split across 13 different settings screens external website constitutes 'real transparency extremetech pointed whilst previously campaigning google similar data collection strategies microsoft hoovers data ways would make google jealous however also pointed requirement vast usage customer data become norm citing increased reliance cloud computing forms external processing well similar data collection requirements services mobile devices google siri august 2015 russian politician nikolai levichev called windows 10 banned use russian government sends user data servers united states federal law requiring online services store data russian users servers within country blocked took effect september 2016 writing zdnet ed bott said lack complaints businesses privacy windows10 indicated utterly normal privacy terms 2015 computerworld editorial preston gralla said kind information windows10 gathers different operating systems gather microsoft held different standard companies microsoft services agreement reads company online services may automatically download software updates configuration changes including prevent accessing services playing counterfeit games using unauthorized hardware peripheral devices critics interpreted statement implying microsoft would scan delete unlicensed software installed devices running windows10 however others pointed agreement specifically microsoft online services microsoft account office 365 skype well xbox live offending passage likely referred digital rights management xbox consoles first-party games plans police pirated video games installed windows10 pcs despite torrent trackers announced plans block windows10 users also arguing operating system could send information anti-piracy groups affiliated microsoft writing allegations ed bott zdnet compared microsoft privacy policy apple google concluded carefully reading microsoft services agreement windows license agreement ... microsoft privacy statement carefully n't see anything looks remotely like big brother columnist kim komando argued microsoft might future run scans disable software hardware sees security threat consistent windows10 update policy following release 10 allegations also surfaced microsoft backported operating system increased data collection windows 7 windows 8 via recommended patches added additional telemetry features updates addition diagnostics tracking service connected specifically microsoft existing customer experience improvement program opt-in program sends additional diagnostic information microsoft addressing issues application insights service third-party software data collection functionality capable transmitting personal information browsing history contents emails chat video calls voice mail photos documents personal files keystrokes microsoft analysis accordance end user license agreement terms services agreement microsoft updated state following october 2017 dutch data protection authority issued complaint asserting windows10 privacy policies comply laws netherlands claims microsoft provide sufficient information information collected full telemetry level processed microsoft disputed claim provide enough disclosure full telemetry level stated working ddpa find appropriate solutions november 2016 kaspersky lab filed antitrust complaint russia regarding bundling windows defender operating system arguing microsoft abusing position favor in-house antivirus software vendors june 2017 kaspersky filed another complaint european commission accusing company frustrating use third-party antivirus software windows 10 defense inferior windows defender including forcibly uninstalling third-party antivirus software upgrades providing enough time antivirus developers certify software new upgrade windows 10 microsoft stated company engages deeply antimalware vendors taken number steps address feedback offered meet kaspersky executives discuss specific concerns june 21 2017 microsoft issued blog post confirming since creators update windows 10 may prompt users temporarily disable virus software upon installation feature update current version deemed compatible operating system would direct users relevant updates software following conclusion update microsoft stated worked vendors perform compatibility testing software update specify versions software compatible direct customers updating microsoft reported result efforts around 95 windows 10 users antivirus application installed already compatible windows 10 creators update microsoft clarified windows defender operates device security software installed security software reports subscription lapsed summer 2018 windows 10 insider update received extreme backlash planned feature would attempted prevent installation web browsers chrome firefox telling users already microsoft edge therefore need change browser", + "neighbors": [ + 36, + 108, + 111, + 148, + 433, + 472, + 611, + 638, + 647, + 961, + 1098, + 1101, + 1109, + 1138, + 1151, + 1193, + 1232, + 1287, + 1547, + 1566, + 1582, + 1620, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 1556, + "label": 0, + "text": "WaveSurfer:wavesurfer wavesurfer audio editor widely used studies acoustic phonetics simple fairly powerful program interactive display sound pressure waveforms spectral sections spectrograms pitch tracks transcriptions read write number transcription file formats used industrial speech research including timit wavesurfer free software distributed permissive free software licence wavesurfer provides basic audio editing operations excision copying pasting zero-crossing adjustment effects fading normalization echo inversion reversal replacement silence dc-removal view scientific orientation offer effects interest musicians flange wavesurfer written tcl/tk using snack audio library therefore runs platforms including microsoft windows mac os x linux solaris hp-ux freebsd irix scriptable supports plugins", + "neighbors": [ + 134, + 195, + 796, + 961, + 1138 + ], + "mask": "Train" + }, + { + "node_id": 1557, + "label": 3, + "text": "Dynamic_frequency_scaling:dynamic frequency scaling dynamic frequency scaling also known cpu throttling technique computer architecture whereby frequency microprocessor automatically adjusted fly depending actual needs conserve power reduce amount heat generated chip dynamic frequency scaling helps preserve battery mobile devices decrease cooling cost noise quiet computing settings useful security measure overheated systems e.g poor overclocking dynamic frequency scaling used ranges computing systems ranging mobile systems data centers reduce power times low workload dynamic power switching power dissipated per unit time chip c\u00b7v\u00b7a\u00b7f c capacitance switched per clock cycle v voltage activity factor indicating average number switching events undergone transistors chip unit-less quantity f switching frequency voltage therefore main determinant power usage heating voltage required stable operation determined frequency circuit clocked reduced frequency also reduced dynamic power alone account total power chip however also static power primarily various leakage currents due static power consumption asymptotic execution time shown energy consumption piece software shows convex energy behavior i.e. exists optimal cpu frequency energy consumption minimal leakage current become important transistor sizes become smaller threshold voltage levels lower decade ago dynamic power accounted approximately two-thirds total chip power power loss due leakage currents contemporary cpus socs tend dominate total power consumption attempt control leakage power high-k metal-gates power gating common methods dynamic voltage scaling another related power conservation technique often used conjunction frequency scaling frequency chip may run related operating voltage efficiency electrical components voltage regulators decreases increasing temperature power usage may increase temperature since increasing power use may increase temperature increases voltage frequency may increase system power demands even cmos formula indicates vice versa dynamic frequency scaling reduces number instructions processor issue given amount time thus reducing performance hence generally used workload cpu-bound dynamic frequency scaling rarely worthwhile way conserve switching power saving highest possible amount power requires dynamic voltage scaling v component fact modern cpus strongly optimized low power idle states constant-voltage cases efficient run briefly peak speed stay deep idle state longer time called race idle computational sprinting run reduced clock rate long time stay briefly light idle state however reducing voltage along clock rate change trade-offs related-but-opposite technique overclocking whereby processor performance increased ramping processor dynamic frequency beyond manufacturer design specifications one major difference two modern pc systems overclocking mostly done front side bus mainly multiplier normally locked dynamic frequency scaling done multiplier moreover overclocking often static dynamic frequency scaling always dynamic software often incorporate overclocked frequencies frequency scaling algorithm chip degradation risks allowable intel cpu throttling technology speedstep used mobile desktop cpu lines amd employs two different cpu throttling technologies amd cool n'quiet technology used desktop server processor lines aim cool n'quiet save battery life used amd mobile processor line instead purpose producing less heat turn allows system fan spin slower speeds resulting cooler quieter operation hence name technology amd powernow cpu throttling technology used mobile processor line though supporting cpus like amd k6-2+ found desktops well via technologies processors use technology named longhaul powersaver transmeta version called longrun 36-processor asap 1 chip among first multi-core processor chips support completely unconstrained clock operation requiring frequencies maximum allowed including arbitrary changes frequency starts stops 167-processor asap 2 chip first multi-core processor chip enables individual processors make fully unconstrained changes clock frequencies according acpi specs c0 working state modern-day cpu divided so-called p -states performance states allow clock rate reduction -states throttling states throttle cpu actual clock rate inserting stpclk stop clock signals thus omitting duty cycles amd powertune amd zerocore power dynamic frequency scaling technologies gpus power saving technologies performance boosting technologies", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 105, + 123, + 127, + 193, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 314, + 331, + 335, + 352, + 388, + 445, + 457, + 460, + 465, + 508, + 529, + 589, + 643, + 659, + 719, + 752, + 776, + 803, + 821, + 846, + 907, + 937, + 946, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1174, + 1219, + 1222, + 1256, + 1272, + 1284, + 1290, + 1310, + 1398, + 1469, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1608, + 1616, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1558, + "label": 2, + "text": "Free_and_open-source_graphics_device_driver:free open-source graphics device driver free open-source graphics device driver software stack controls computer-graphics hardware supports graphics-rendering application programming interfaces apis released free open-source software license graphics device drivers written specific hardware work within specific operating system kernel support range apis used applications access graphics hardware may also control output display display driver part graphics hardware free open-source graphics device drivers developed mesa project driver made compiler rendering api software manages access graphics hardware drivers without freely legally -available source code commonly known binary drivers binary drivers used context operating systems prone ongoing development change linux create problems end users package maintainers problems affect system stability security performance main reason independent development free open-source drivers technical documentation available understanding underlying hardware often gained clean-room reverse engineering based understanding device drivers may written legally published software license rare cases manufacturer driver source code available internet without free license means code studied altered personal use altered usually original source code freely distributed solutions bugs driver easily shared form modified versions driver therefore utility drivers significantly reduced comparison free open-source drivers objections binary-only drivers based copyright security reliability development concerns part wider campaign binary blobs openbsd lead developer theo de raadt said binary driver way fix breaks break product relies binary drivers declared end-of-life manufacturer effectively broken forever project also stated binary drivers hide bugs workarounds bugs observation somewhat vindicated flaws found binary drivers including exploitable bug nvidia 3d drivers discovered october 2006 rapid7 speculated bug existed since 2004 nvidia denied asserting issue communicated july 2006 2004 bug bug x.org nvidia driver binary drivers often work current versions open-source software almost never support development snapshots open-source software usually directly possible developer use nvidia ati proprietary drivers development snapshot x server development snapshot linux kernel features like kernel mode-setting added binary drivers anyone vendors prevents inclusion vendor lacks capacity interest linux kernel development community linus torvalds made strong statements issue binary-only modules refuse even consider tying hands binary-only module ... want people know use binary-only modules problem another kernel developer greg kroah-hartman said binary-only kernel module comply kernel license gnu general public license violates gpl due fun things like derivative works linking stuff writer computer scientist peter gutmann expressed concern digital rights management scheme microsoft windows vista operating system may limit availability documentation required write open drivers since requires operational details device kept confidential case binary drivers objections due free software philosophy software quality security concerns 2006 greg kroah-hartman concluded closed source linux kernel modules illegal simple 've misfortune talking lot different ip lawyers years topic every one 've talked agree way anyone create linux kernel module today closed source violates gpl due fun things like derivative works linking linux kernel never maintained stable in-kernel application binary interface also concerns proprietary drivers may contain backdoors like one found samsung galaxy-series modem drivers applications 3d game engine 3d computer graphics software shunt calculations cpu gpu usually use special-purpose api like opengl direct3d address hardware directly translation api calls gpu opcodes done device driver contains specialized knowledge object optimization due history rigidity proprietary driver development recent surge number community-backed device drivers desktop mobile gpus free open hardware organizations like fossi lowrisc others would also benefit development open graphical hardware standard would provide computer manufacturers hobbyists like complete royalty-free platform develop computing hardware related devices desktop computer market long dominated pc hardware using x86/x86-64 instruction set gpus available pc three major competitors nvidia amd intel main competing factor price hardware raw performance 3d computer games greatly affected efficient translation api calls gpu opcodes display driver video decoder inherent parts graphics card hardware designed assist calculations necessary decoding video streams market pc hardware dwindled seems unlikely new competitors enter market unclear much knowledge one company could gain seeing source code companies drivers mobile sector presents different situation functional blocks application-specific integrated circuit display driver 2- 3d acceleration video decoding encoding separate semiconductor intellectual property sip blocks chip since hardware devices vary substantially portable media players require display driver accelerates video decoding require 3d acceleration development goal raw 3d performance system integration power consumption 2d capabilities also approach abandons traditional method vsync updating display makes better use sample hold technology lower power consumption second quarter 2013 79.3 percent smartphones sold worldwide running version android linux kernel dominates smartphones hardware developers incentive deliver linux drivers hardware due competition incentive make drivers free open-source additional problems android-specific augmentations linux kernel accepted mainline atomic display framework adf adf feature 3.10 aosp kernels provides dma-buf-centric framework android hwcomposer hal kernel driver adf significantly overlaps drm-kms framework adf accepted mainline different set solutions addressing problems known atomic mode setting development projects libhybris harness android device drivers run linux platforms android phoronix compares free drivers source real-world testing uncommon video-game magazines report benchmark testing linux benchmarks phoronix limited scope primarily testing games available linux support automated benchmarking free open-source drivers primarily developed linux linux kernel developers third-party programming enthusiasts employees companies advanced micro devices driver five parts drm kernel-specific vesa driver generally available operating system vesa driver supports graphics cards without acceleration display resolutions limited set programmed video bios manufacturer linux graphics stack evolved detoured x window system core protocol amd proprietary driver amd catalyst radeon available microsoft windows linux formerly fglrx current version downloaded amd site linux distributions contain repositories process replaced amdgpu-pro hybrid driver combining open-source kernel x mesa multimedia drivers closed-source opengl opencl vulkan drivers derived catalyst foss drivers ati-amd gpus developed name radeon xf86-video-ati xserver-xorg-video-radeon still must load proprietary microcode gpu enable hardware acceleration radeon 3d code split six drivers according gpu technology radeon r200 r300 classic drivers r300g r600g radeonsi gallium3d drivers up-to-date feature matrix available support video coding engine unified video decoder free open-source radeon graphics device drivers reverse-engineered based documentation released amd without requirement sign non-disclosure agreement nda documentation began gradually released 2007 contrast amd main competitor graphics field nvidia proprietary driver similar amd catalyst provides support free-graphics initiatives addition providing necessary documentation amd employees contribute code support hardware features 2014 game developers conference company announced exploring strategy change re-base user-space part catalyst free open-source drm kernel module instead proprietary kernel blob components radeon graphics device driver developed core contributors interested parties worldwide 2011 r300g outperformed catalyst cases release amdgpu stack announced dri-devel mailing list april 2015 although amdgpu officially supports gcn 1.2 later graphics cards experimental support gcn 1.0 1.1 graphics cards officially supported radeon driver may enabled via kernel parameter separate libdrm libdrm-amdgpu included since libdrm 2.4.63 nvidia proprietary driver nvidia geforce driver geforce available windows xp x86-x86-64 later linux x86-x86-64-armv7-a os x 10.5 later solaris x86-x86-64 freebsd x86/x86-64 current version downloaded internet linux distributions contain repositories beta nvidia geforce driver 331.13 supports egl interface enabling support wayland conjunction driver nvidia free open-source driver named nv limited supporting 2d acceleration matthew garrett dirk hohndel others called source code confusing nvidia decided deprecate nv adding support fermi later gpus displayport march 2010 december 2009 nvidia announced would support free graphics initiatives company announced would release documentation gpus nouveau based almost entirely information gained reverse engineering project aims produce 3d acceleration x.org/wayland using gallium3d march 26 2012 nouveau drm component marked stable promoted staging area linux kernel nouveau supports tesla- earlier fermi- kepler- maxwell-based gpus nvidia employee alexandre courbot committed extensive patch set adds initial support gk20a tegra k1 nouveau june 2014 codethink reportedly ran wayland-based weston compositor linux kernel 3.15 using egl 100 open-source graphics driver stack tegra k1 feature matrix available july 2014 nouveau unable outperform nvidia geforce driver due missing re-clocking support tegra-re project working reverse-engineer nvidia vliw-based tegra series gpus predate tegra k1 nvidia distributes proprietary device drivers tegra oems part linux tegra formerly l4t development kit nvidia partner avionic design working submitting grate free open-source drivers tegra upstream mainline linux kernel april 2012 company co-founder ceo laid tegra processor roadmap ubuntu unity 2013 gpu technology conference nvidia unified memory driver nvidia-uvm.ko implements memory management pascal volta gpus linux mit licensed source code available nvidia linux driver downloads systems support nvidia-uvm.ko intel history producing commissioning open-source drivers graphics chips exception powervr-based chips 2d x.org driver called xf86-video-intel kernel mode-setting driver linux kernel use video bios switching video modes since bioses limited range modes provides reliable access supported intel video cards company worked optimizing free linux drivers performance approaching windows counterparts especially sandy bridge newer hardware performance optimizations allowed intel driver outperform proprietary windows drivers certain tasks 2011 performance enhancements may also benefit users older hardware support intel llc last level cache l4-cache crystalwell iris pro added linux kernel 3.12 company 20 30 full-time linux graphics developers matrox develops manufactures matrox mystique parhelia g200 g400 g550 although company provides free open-source drivers chipsets older g550 chipsets newer g550 supported closed-source driver s3 graphics develops s3 trio virge savage chrome supported openchrome arm holdings fabless semiconductor company licenses semiconductor intellectual property cores although known licensing arm instruction set cpus based also develop license mali series gpus january 21 2012 phoronix reported luc verhaegen driving reverse-engineering attempt aimed arm holdings mali series gpus specifically mali-200 mali-400 versions reverse-engineering project known lima presented fosdem february 4 2012 february 2 2013 verhaegen demonstrated quake iii arena timedemo mode running top lima driver may 2018 lima developer posted driver inclusion linux kernel arm indicated intention providing support graphics acceleration hardware licensed free open-source license however arm employees sent patches linux kernel support arm hdlcd display controller mali dp500 dp550 dp650 sip blocks december 2015 april 2016 imagination technologies fabless semiconductor company develops licenses semiconductor intellectual property cores among powervr gpus intel manufactured number powervr-based gpus powervr gpus widely used mobile socs company provide foss driver public documentation powervr due wide use embedded devices free software foundation put reverse-engineering powervr driver high-priority project list vivante corporation fabless semiconductor company licenses semiconductor intellectual property cores develops gcxxxx series gpus vivante proprietary closed-source linux driver consists kernel- user-space parts although kernel component open-source gpl user-space components\u2014consisting gles 2 implementations hal library\u2014are contain bulk driver logic wladimir j. van der laan found documented state bits command stream shader isa studying blobs work examining manipulating command-stream dumps etnaviv gallium3d driver written based documentation van der laan work inspired lima driver project produced functional-but-unoptimized gallium3d llvm driver etnaviv driver performed better vivante proprietary code benchmarks supports vivante gc400 gc800 gc1000 gc2000 gc3000 series january 2017 etnaviv added mesa opengl es 2.0 desktop opengl 2.0 support qualcomm develops adreno formerly ati imageon gpu series includes part snapdragon system phoronix slashdot reported 2012 rob clark inspired lima driver working reverse-engineering drivers adreno gpu series referenced blog post clark wrote project spare time qualcomm platform viable target working open 3d graphics employers texas instruments linaro affiliated imagination powervr arm mali cores would primary targets working command streams 2d support 3d commands seemed characteristics driver code published gitorious freedreno moved mesa 2012 working shader assembler completed demonstration versions developed texture mapping phong shading using reverse-engineered shader compiler clark demonstrated freedreno running desktop compositing xbmc media player quake iii arena fosdem february 2 2013 august 2013 kernel component freedreno msm driver accepted mainline available linux kernel 3.12 later ddx driver gained support server-managed file descriptors requiring x.org server version 1.16 july 2014 january 2016 mesa gallium3d-style driver gained support adreno 430 november year driver added support adreno 500 series freedreno used devices 96boards dragonboard 410c nexus 7 2013 traditional linux distributions like debian fedora android broadcom develops designs videocore gpu series part socs since used raspberry pi considerable interest foss driver videocore raspberry pi foundation co-operation broadcom announced october 24 2012 open-sourced arm cpu code drives gpu however announcement misleading according author reverse-engineered lima driver newly open-sourced components allowed message-passing arm cpu videocore offered little insight videocore little additional programability videocore gpu runs rtos handles processing video acceleration done rtos firmware coded proprietary gpu firmware open-sourced date since neither toolchain targeting proprietary gpu documented instruction set advantage could taken firmware source code became available videocoreiv project attempted document videocore gpus february 28 2014 raspberry pi second anniversary broadcom raspberry pi foundation announced release full documentation videocore iv graphics core complete source release graphics stack 3-clause bsd license free-license 3d graphics code committed mesa 29 august 2014 first appeared mesa 10.3 release although silicon integrated systems via technologies expressed limited interest open-source drivers released source code integrated x.org foss developers july 2008 via opened documentation products improve image linux open-source communities company failed work open-source community provide documentation working drm driver leaving expectations linux support unfulfilled january 6 2011 announced via longer interested supporting free graphics initiatives displaylink announced open-source project libdlo goal bringing support usb graphics technology linux platforms code available lgpl license integrated x.org driver displaylink graphics support available kernel udlfb driver fbdev mainline udl/drm driver march 2012 available drm-next tree non-hardware-related vendors may also assist free graphics initiatives red hat two full-time employees david airlie j\u00e9r\u00f4me glisse working radeon software fedora project sponsors fedora graphics test week event launch new linux distribution versions test free graphics drivers companies provided development support include novell vmware project vga aims create low-budget open-source vga-compatible video card open graphics project aims create open-hardware gpu open graphics device v1 dual dvi-i outputs 100-pin idc connector september 2010 first 25 ogd1 boards made available grant application purchase milkymist system chip targeted embedded graphics instead desktop computers supports vga output limited vertex shader 2d texturing unit nyuzi experimental gpgpu processor includes synthesizable hardware design written system verilog instruction set emulator llvm-based c-c++ compiler software libraries tests explores parallel software hardware run terasic de2-115 field-programmable gate array board project uses fpgas generally partially completely closed-source toolchain currently couple open-source toolchains available however lattice-based fpgas notably ice40 ecp5 boards utilize project icestorm trellis respectively also larger ongoing effort create gcc fpgas called symbiflow includes aforementioned fpga toolchains well early-stage open-source toolchain xilinx-based fpgas", + "neighbors": [ + 11, + 42, + 53, + 58, + 85, + 117, + 134, + 162, + 219, + 234, + 265, + 292, + 294, + 305, + 306, + 400, + 401, + 571, + 630, + 650, + 682, + 688, + 720, + 736, + 754, + 805, + 806, + 812, + 893, + 897, + 935, + 940, + 948, + 961, + 974, + 986, + 1057, + 1060, + 1105, + 1126, + 1167, + 1197, + 1208, + 1225, + 1227, + 1235, + 1241, + 1252, + 1278, + 1301, + 1311, + 1318, + 1357, + 1360, + 1384, + 1391, + 1401, + 1456, + 1468, + 1503, + 1509, + 1526, + 1538, + 1602, + 1604, + 1638 + ], + "mask": "Validation" + }, + { + "node_id": 1559, + "label": 9, + "text": "CMUcam:cmucam cmucam low cost computer vision device intended robotics research cmucams consist small video camera microcontroller serial interface digital cameras typically use much higher bandwidth connector cmucam lightweight interface allows accessed microcontrollers importantly on-board microprocessor supports simple image processing color blob tracking making rudimentary computer vision capable systems would previously far little power thing used past years high-school first robotics competition way letting participants robots track field elements navigate autonomously cmucam also extremely small form factor reasons relatively popular making small mobile robots original design originally made carnegie mellon university licensed various manufacturers pixy2 latest line cmucam sensors adds line tracking capability onboard light source previous cmucam5 aka original pixy sensors produced collaboration charmed labs austin tx", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1560, + "label": 7, + "text": "ZetaGrid:zetagrid zetagrid one time largest distributed computing project designed explore roots riemann zeta function checking one billion roots day roots zeta function particular interest mathematics since presence even single one line rest would disprove riemann hypothesis far-reaching consequences mathematics far every single one failed provide counterexample riemann hypothesis project ended november 2005 due instability hosting provider 10 first zeroes checked results analyzed project administrator stated posted american mathematical society website", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1561, + "label": 2, + "text": "Windows_Resource_Protection:windows resource protection windows resource protection feature windows vista replaces windows file protection protects registry keys folders addition critical system files way protects resources differs entirely method used windows file protection windows resource protection works registering notification file changes winlogon changes detected protected system file modified file restored cached copy located compressed folder windir \\system32\\dllcache windows resource protection works setting discretionary access control lists dacls access control lists acls defined protected resources permission full access modify wrp-protected resources restricted processes using windows modules installer service trustedinstaller.exe administrators longer full rights system files use setupapi take ownership resource add appropriate access control entries aces modify replace trusted installer account used secure core operating system files registry keys windows resource protection protects large number file types wrp also protects several critical folders folder containing wrp-protected files may locked trusted installer able create files subfolders folder folder may partially locked enable administrators create files subfolders folder essential registry keys installed windows vista also protected key protected wrp sub-keys values protected also wrp copies files needed restart windows cache directory located windir \\winsxs\\backup critical files needed restart windows copied cache directory unlike windows file protection cached entire set protected file types dllcache folder size cache directory list files copied cache modified windows resource protection applies stricter measures protect files result windows file protection available windows vista order replace single protected file windows file protection disabled completely windows resource protection works per-item basis setting acls therefore taking ownership single item particular item replaced items remain protected system file checker also integrated wrp windows vista sfc.exe used check specific folder paths including windows folder boot folder", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1589, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1562, + "label": 1, + "text": "Data_system:data system data system term used refer organized collection symbols processes may used operate symbols organised collection symbols symbol-manipulating operations considered data system hence human-speech analysed level phonemes considered data system incan artefact khipu image stored pixels data system defined terms data model bears resemblance idea physical symbol system symbols within data systems may persistent hence sounds human speech non-persistent symbols decay rapidly air contrast pixels stored peripheral storage device persistent symbols education data system computer system aims provide educators student data help solve educational problems examples data systems include student information systems siss assessment systems instructional management systems imss data-warehousing systems distinctions different types data systems blurring separate systems begin serve functions data systems present data educators over-the-counter data format embed labels supplemental documentation help system make key package/display content decisions improve accuracy data system users \u2019 data analyses", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1563, + "label": 5, + "text": "NetNewsWire:netnewswire netnewswire news aggregator macos netnewswire developed brent sheila simmons company ranchero software introduced july 12 2002 netnewswire lite free version missing advanced features commercial version introduced weeks later version 1.0 released february 11 2003 version 2.0 released may 2005 time included custom feed views custom downloading opening podcasts synchronization feeds feed status computers bloglines support built-in tabbed browser october 2005 newsgator bought netnewswire bringing newsgator online rss synchronization service mac brent simmons hired newsgator continue developing software netnewswire 3.0 released june 5 2007 version added spotlight indexing news items integration ical iphoto address book voodoopad growl support new user interface performance enhancements application originally shareware became free release netnewswire 3.1 january 10 2008 netnewswire lite discontinued time netnewswire 3.2 moved advertisement-supported model option purchase application remove ads ios version netnewswire support iphone ipod touch later ipad released first day app store includes syncing unread articles desktop version netnewswire lite 4.0 introduced march 3 2011 mac app store misses several advanced features included netnewswire 3.2 includes completely rewritten code base future used ios versions app netnewswire 4.0 shareware june 3 2011 acquisition netnewswire black pixel announced two years development apparently stalled gap updates 2011 release version 4 open beta june 24 2013 netnewswire 4.0 announced released open beta black pixel announcement also brought news product would commercial product free component though beta would free use final release final release netnewswire 4.0 occurred september 3 2015 august 31 2018 black pixel announced returned netnewswire intellectual property brent simmons september 1 2018 brent simmons released netnewswire 5.0d1 renamed version open source mac rss reader netnewswire well regarded many users reviewers according feedburner netnewswire popular desktop newsreader platforms 2005 software received macworld editor choice award 2003 2005 maintained 4.8 five stars rating among reviewers versiontracker cnet ars technica called netnewswire built-in browser hands-down best mac newsreader walter mossberg technology columnist wall street journal said netnewswire favorite mac", + "neighbors": [ + 33, + 95, + 258, + 277, + 582, + 585, + 623, + 646, + 734, + 886, + 927, + 1138, + 1166, + 1228, + 1292, + 1339, + 1373, + 1423, + 1604 + ], + "mask": "Test" + }, + { + "node_id": 1564, + "label": 3, + "text": "Rambo_III_(video_game):rambo iii video game rambo iii series video games based film rambo iii 1988 like film main plots center former vietnam-era green beret john rambo recalled duty one last time rescue former commander colonel sam trautman captured covert operation mission soviet union-controlled afghanistan console versions developed published sega pc dos version developed ocean published taito ocean developed published rest atari st amiga spectrum c64 amstrad taito also released arcade game based film sega master system version released 1988 light gun rail shooter lines operation wolf light phaser supported makes game also unique unlike nes sega master system port ironically port operation wolf long player ammunition game light phaser trigger held supply full automatic shooting ammunition runs though player pull trigger time shooting sega mega drive version released 1989 follows rambo six missions one various objectives besides finding exit level missions prisoners must freed enemy ammunition supplies destroyed rambo controlled overhead perspective several weapons disposal besides machine gun never runs ammo use knife close range kills set timed bombs use famous longbow explosive arrows ammunition bow bombs limited collected dead enemies rambo hand vulnerable killed one hit missions perspective switches view behind rambo additional boss fights take place soviet tanks helicopters must destroyed using crossbow aiming bow rambo move otherwise hide behind rocks obstacles enemy fire reminiscent taito arcade game name also player firing screen helicopters jeeps instead single segment stage whole game played perspective taito released rail shooter based film well features rambo sam trautman playable characters zx spectrum atari st commodore amiga commodore 64 amstrad cpc versions three missions varied console version drastically terms gameplay graphics music", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1565, + "label": 6, + "text": "Disc_Filing_System:disc filing system disc filing system dfs computer file system developed acorn computers initially add-on eurocard-based acorn system 2 1981 education departments western australia south australia announced joint tenders calling supply personal computers schools acorn australian computer distributor barson computers convinced joint managing directors hermann hauser chris curry allow soon released acorn bbc microcomputer offered disk storage part bundle agreed condition barson adapted acorn dfs system 2 without assistance acorn resources available required minor hardware software changes make dfs compatible bbc micro barson tenders states dfs fitted year ahead uk early initiative resulted bbc micro heavily focused education market australia little penetration home computer market arrival acorn electron dfs shipped rom disk controller chip fitted bbc micro motherboard filing system extremely limited functionality storage capability using flat directory structure filename seven letters long plus one letter directory file stored dfs remarkable unlike filing systems single vendor implementation original dfs written acorn continued maintain codebase various disc drive vendors wrote implementations companies wrote dfs implementations included cumana opus watford electronics watford electronics implementation notable supporting 62 files per disc instead usual 31 using non-standard disc format features third-party implementations included able review free space built-in codice_1 codice_2 commands shipped utility disc original acorn dfs acorn followed original dfs series acorn 1770 dfs used disc format earlier version added set extra commands supported improved wd1770 floppy drive controller chip dfs conventionally uses one side double-density 5\u00bc floppy disc discs formatted either 40 80 track giving capacity 100 200 kb per side ten 256-byte sectors per track fm encoding capacity limited choice intel 8271 controller original bbc micro supports fm encoding mfm encoding already common use time bbc micro launch fm encoding gives half recording capacity mfm given physical disc density fm mfm encoding commonly referred single density double density although discs drives unlike high density uses different drives discs double-density 3\u00bd discs formatted used 1770 dfs intel 8271-based dfs problems many 3\u00bd drives giving single-density capacity fm encoding originally standard practice 3\u00bd discs normally formatted mfm double density using later advanced disc filing system present acorn machines supplied 3\u00bd drives 2009 3\u00bd drives commonly used bbc micros past including use dfs due greater availability easier data interchange recent computers high-density 5\u00bc 3\u00bd discs supported dfs dfs directly support double-sided discs instead two heads double-sided drive treated two separate logical drives dfs support four volumes numbered 0 3 drive 0 default drive 1 representing second drive attached cable drive 2 referred reverse side drive 0 drive 3 reverse drive 1 support two physical drives due installed base single-sided drives commercial software normally provided single-sided discs flippy discs manually reversed access side discs formatted using 40 80 tracks using codice_3 codice_4 commands drives either 40 80 track common compatibility issue dfs users 40-track discs norm commercial software distribution due installed base 40-track drives 80-track drives became common prices dropped allowing users store data 80-track drive automatically read 40-track discs disc capacity stored sector count catalogue track zero track zero located place 40- 80-track discs allowing disc file system set motor stepping accordingly however intel 8271-based acorn dfs dual-format capability addressed number ways failure use correct setting would result errors dfs codice_5 damage disc drive trying step heads beyond physical end disc surface switching 80 tracks extend catalogue way leaving user prone running filename slots running space disc situation resulted codice_6 error dfs case-preserving case-sensitive prevalence all-capitals filenames likely due bbc micro defaulting caps lock enabled hard soft reset character set quite permissive printable characters 7-bit ascii allowed including spaces excluding sake portability third-party dfs implementations best avoid codice_12 codice_16 leaf names quotation marks allowed although bbc basic requires escaped twice fully qualified filename file specification fsp short contains colon drive number dot directory letter another dot name example file default directory drive 2 called codice_31 would complete specification codice_32 drive directory specifiers optional directories dfs single character prefixes filenames codice_21 codice_34 used group files arrangement flat default directory codice_35 used instead root directory requesting catalogue disc codice_36 codice_37 commands files current directory shown directory prefix one block listed files second block directory prefixes visible example acorn dfs third party dfs implementations may vary slightly top seven files current directory codice_35 drive 0 files directories case codice_39 codice_40 codice_21 codice_42 filename codice_43 shows file locked modification deletion first line contains disc title modification count dfs provides working space divided directory library directory working directory current volume much like working directory command line system library second alternative working directory functions like path benefit able volume requests open files unqualified names first searched working directory failing library directory also searched directory library default directory catalogue file table occupies first two disc sectors one names directories file matching sector holding file locations sizes metadata eight bytes sector used file eight bytes sector reserved 12-byte disc title volume information total number files disc irrespective directory file limited 31 interests saving space significant bit directory letter file used locked read-only flag although physical disks usually formatted either 100 kb 200 kb dfs supports volume sizes 256 kb largest dfs file size allowed volume size minus \u00bd kb catalogue file sizes stored 18-bit quantity dfs support data fragmentation meaning file data must stored single run consecutive sectors free space prone becoming fragmented random-access file writes fail end file reaches beginning next even though may free sectors elsewhere disc cases dfs aborts codice_44 error codice_45 split file fit available space either failure occurs sector allocation stage error returned codice_46 codice_47 command provided relocate files disc solid block placing free space second block allows next file created fill disc last existing file extended without moved codice_45 virtually deletes existing file copies specified block memory wherever space disc contrast codice_47 command uses program memory buffer relocate files overwriting program data memory like cassette filing system acorn dfs supports bbc micro standard file metadata load address execution address required acorn mos operating system used bbc micro support relocation binary code file loaded address programmer intended contents may refer internal locations absolute addresses execution address also recorded entry point necessarily beginning even within file file attributes limited single bit locked set codice_42 appears right file name catalogue file may altered overwritten deleted dfs discs track dates acorn mos prior version 3 maintain real-time clock instead offer peculiar feature modification count every time catalogue updated count increments count shown parentheses title first line disc catalogue codice_51 catalogue listing shown earlier dfs also supports means start disc software based key sequence shift key held machine soft hard reset dfs checks drive 0 disc containing positive boot flag boot flag either 0 ignore 1 load file 2 run machine code file 3 execute script boot flag positive file called codice_52 looked loaded memory 1 loaded executed machine code 2 fed keyboard buffer 3 option 3 reads exec files text macro files used primitive shell scripts true shell scripts simply series keys typed like recording play back thus loop branch unless input code basic interpreter well used reset executed time operating system codice_53 command exec files file system independent variant dfs called dnfs disc/network filing system contained econet network filing system nfs standard disc filing system tube co-processor support software single rom rom installed two filing systems os initial design dfs based around intel corporation fdc 8271 disc drive controller immediate predecessor 8272 design found ibm personal computer 8271 controller limited functionality obsolete later versions file system various vendors including solidisk acorn watford electronics based later wd1770 wd1772 drive controllers 1770 controller quickly became standard controller acorn range following advent adfs dfs superseded advanced disc filing system adfs fully hierarchical suitable running hard drives bbc micro adfs default filing system bbc master users likely reverted dfs compatibility reasons adfs could read dfs discs adfs also chosen standard filing system risc os", + "neighbors": [ + 34, + 40, + 55, + 63, + 222, + 233, + 278, + 295, + 326, + 334, + 349, + 358, + 434, + 438, + 495, + 524, + 553, + 557, + 558, + 570, + 723, + 728, + 887, + 892, + 900, + 908, + 912, + 922, + 942, + 982, + 997, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1157, + 1201, + 1202, + 1204, + 1234, + 1252, + 1283, + 1322, + 1381, + 1445, + 1457, + 1459, + 1637 + ], + "mask": "Validation" + }, + { + "node_id": 1566, + "label": 9, + "text": "Chakra_(JScript_engine):chakra jscript engine chakra jscript engine developed microsoft 32-bit version internet explorer 9 ie9 web browser jscript engine developed closed source proprietary software microsoft developed different javascript engine based jscript newer microsoft edge browser also called chakra chakra javascript engine open-sourced mit license distinctive feature engine jit compiles scripts separate cpu core parallel web browser though microsoft past pointed elements rendering marshalling important browser overall performance improvements engine response evolving competing browsers compared ie8 lagging behind terms client-side script processing speed sunspider tests performed november 18 2009 showed pdc version ie9 executing scripts much faster ie8 slower firefox 3.6 chrome 4 webkit nightly test performed march 15 2010 showed first ie9 platform preview using then-current version chakra faster firefox spidermonkey slower safari squirrelfish extreme chrome v8 opera carakan march 8 2011 microsoft published results showing 32-bit internet explorer 9 faster safari firefox tracemonkey chrome opera march 2011 performance tests zdnet concluded internet explorer 9 32-bit chrome 10 firefox 4 release candidate pretty evenly matched 2012 subsequent versions chakra version included internet explorer 10 introduced additional performance changes including jit compilation x64 arm architectures optimizations related floating point math garbage collection last call jsconf 2015 microsoft announced open sourcing chakracore engine january 2016 github chakracore essentially chakra engine powers microsoft edge browser platform-agnostic bindings i.e without specific interfaces utilised within windows universal app platform january 13 2016 microsoft released chakracore mit license github promised", + "neighbors": [ + 7, + 36, + 50, + 69, + 81, + 132, + 270, + 347, + 509, + 593, + 632, + 686, + 713, + 869, + 959, + 961, + 1084, + 1138, + 1228, + 1231, + 1264, + 1302, + 1417, + 1547, + 1555, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 1567, + "label": 9, + "text": "JAWS_Scripting_Language:jaws scripting language jaws scripting language proprietary programming language facilitates interoperability jaws windows screen reading program practically application\u2013both proprietary off-the-shelf jaws scripting language jsl compiled language allowing source code protection jaws scripting commonly also cumulatively refers customization jaws use built-in user-editable utilities called managers editing configuration files directly combination writing actual scripts scripting language api exposes functionality including combination traditional jaws scripting msaa server direct scripting document object model scripting ensure optimal performance jaws end-users", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1568, + "label": 4, + "text": "PeerBlock:peerblock peerblock free open-source personal firewall blocks packets coming going maintained list black listed hosts peerblock windows successor software peerguardian currently maintained linux blocks incoming outgoing connections ip addresses included blacklists made available internet addresses specified user peerblock mainly uses blacklists provided iblocklist.com peerblock 1.0 based code peerguardian 2 rc1 test3 vista version adds support 32- 64-bit windows vista windows 7 windows 8 peerguardian project ended developer phoenix labs encouraged current peerguardian users migrate peerblock peerblock development small team developers led mark bulas hosting well signed driver funded donations public future donations intended contribute future signed drivers hosting possibly rent virtual private server team able build real online-update feature future releases peerblock introduced 2017 peerblocklist.com offers modern blocklists p2p format compatible peerblock peerblock multiple features latest version program include constantly updating blocklist managed home site manager lets choose lists include block program allows user turn ip http trackers well including log showing time source ip address destination protocol tracker list settings allows users customize program interface well operations september 2013 i-blocklist supplier blocking lists peerblock uses supported unlimited free list updating since september 2013 updates limited weekly except paid subscribers peerblock hard-coded use i-blocklist lists entered revenue-sharing agreement i-blocklist late 2015 blocklists longer available without payment subscription late 2017 peerblocklist.com began offering free blocklists malicious hosts ad-servers peerblock peerguardian users", + "neighbors": [ + 94, + 134, + 189, + 217, + 476, + 491, + 494, + 505, + 545, + 552, + 569, + 646, + 648, + 656, + 678, + 685, + 731, + 813, + 842, + 910, + 961, + 1138, + 1250, + 1257, + 1403, + 1406, + 1462, + 1514, + 1542 + ], + "mask": "Test" + }, + { + "node_id": 1569, + "label": 2, + "text": "List_of_features_in_Android:list features android list features android operating system android devices include still/video cameras touchscreens gps accelerometers gyroscopes barometers magnetometers dedicated gaming controls proximity pressure sensors thermometers accelerated 2d bit blits hardware orientation scaling pixel format conversion accelerated 3d graphics", + "neighbors": [ + 24, + 34, + 41, + 83, + 95, + 113, + 131, + 162, + 211, + 258, + 277, + 298, + 306, + 326, + 422, + 429, + 502, + 509, + 530, + 558, + 582, + 623, + 668, + 684, + 704, + 755, + 775, + 782, + 837, + 886, + 939, + 953, + 1033, + 1058, + 1061, + 1082, + 1132, + 1138, + 1166, + 1183, + 1185, + 1195, + 1210, + 1228, + 1276, + 1280, + 1310, + 1378, + 1411, + 1419, + 1423, + 1480, + 1483, + 1500, + 1550, + 1602 + ], + "mask": "Test" + }, + { + "node_id": 1570, + "label": 5, + "text": "Telnet:telnet telnet application protocol used internet local area network provide bidirectional interactive text-oriented communication facility using virtual terminal connection user data interspersed in-band telnet control information 8-bit byte oriented data connection transmission control protocol tcp telnet developed 1969 beginning rfc 15 extended rfc 855 standardized internet engineering task force ietf internet standard std 8 one first internet standards name stands teletype network historically telnet provided access command-line interface usually operating system remote host including network equipment operating systems configuration utility including systems based windows nt however serious security concerns using telnet open network internet use purpose waned significantly favor ssh term telnet also used refer software implements client part protocol telnet client applications available virtually computer platforms telnet also used verb telnet means establish connection using telnet protocol either command line client graphical interface example common directive might change password telnet server log run passwd command cases user would telnetting unix-like server system network device router telnet client-server protocol based reliable connection-oriented transport typically protocol used establish connection transmission control protocol tcp port number 23 telnet server application telnetd listening telnet however predates tcp/ip originally run network control program ncp protocols even though telnet ad hoc protocol official definition march 5 1973 name actually referred teletype network protocol rfc 206 nic 7176 telnet makes connection clear many extensions made telnet negotiable options protocol architecture extensions adopted internet standards ietf documents std 27 std 32 extensions widely implemented others proposed standards ietf standards track see telnet best understood context user simple terminal using local telnet program known client program run logon session remote computer user communications needs handled telnet server program telnet initially developed 1969 users networked computers computer departments academic institutions large private government research facilities environment security nearly much concern became bandwidth explosion 1990s rise number people access internet extension number people attempting hack people servers made encrypted alternatives necessary experts computer security sans institute recommend use telnet remote logins discontinued normal circumstances following reasons security-related shortcomings seen usage telnet protocol drop rapidly especially public internet favor secure shell ssh protocol first released 1995 ssh practically replaced telnet older protocol used days rare cases access decades old legacy equipment support modern protocols ssh provides much functionality telnet addition strong encryption prevent sensitive data passwords intercepted public key authentication ensure remote computer actually claims happened early internet protocols extensions telnet protocol provide transport layer security tls security simple authentication security layer sasl authentication address concerns however telnet implementations support extensions relatively little interest implementing ssh adequate purposes note large number industrial scientific devices telnet available communication option built standard rs-232 port use serial server hardware appliance provide translation tcp/telnet data rs-232 serial data cases ssh option unless interface appliance configured ssh ibm 5250 3270 workstation emulation supported via custom telnet clients tn5250/tn3270 ibm servers clients servers designed pass ibm 5250 data streams telnet generally support ssl encryption ssh include 5250 emulation os/400 also known ibm port 992 default port secured telnet data octets except 0xff transmitted telnet sometimes used telnet client applications establish interactive raw tcp session due commonly mistaken belief session use iac functionally identical example user could make http request hand using command line version telnet client application follows case however network virtual terminal nvt rules requirement bare carriage return character cr ascii 13 followed nul ascii 0 character distinguish telnet protocol raw tcp sessions hand many systems possess true raw tcp clients netcat socat unix putty windows also used manually talk services without specialized client software nevertheless telnet still sometimes used debugging network services smtp irc http ftp pop3 servers issue commands server examine responses protocols ftp really uses telnet data format another difference telnet raw tcp session telnet 8-bit clean default 8-bit mode may negotiated high-bit-set octets may garbled mode requested requested non-telnet connection 8-bit mode named binary option intended transmit binary data characters though standard suggests interpretation codes 0000\u20130176 ascii offer meaning high-bit-set data octets attempt introduce switchable character encoding support like http nothing known actual software support", + "neighbors": [ + 52, + 83, + 107, + 109, + 134, + 216, + 258, + 306, + 311, + 364, + 379, + 425, + 430, + 444, + 455, + 470, + 528, + 530, + 542, + 543, + 582, + 608, + 623, + 631, + 646, + 668, + 672, + 684, + 692, + 703, + 713, + 732, + 757, + 758, + 764, + 769, + 770, + 771, + 772, + 779, + 800, + 833, + 886, + 901, + 939, + 961, + 991, + 1027, + 1084, + 1116, + 1132, + 1138, + 1151, + 1166, + 1200, + 1206, + 1210, + 1218, + 1225, + 1228, + 1287, + 1301, + 1326, + 1329, + 1337, + 1376, + 1386, + 1395, + 1408, + 1410, + 1423, + 1438, + 1443, + 1448, + 1452, + 1453, + 1457, + 1517, + 1527, + 1528, + 1550, + 1552, + 1594 + ], + "mask": "Test" + }, + { + "node_id": 1571, + "label": 0, + "text": "TERMIUM_Plus:termium plus termium plus electronic terminological database operated maintained translation bureau government canada database offers millions english french terms various specialized fields terms spanish portuguese also available multilingual database termium plus initially developed universit\u00e9 de montr\u00e9al october 1970 database initially named banque de terminologie de l \u2019 universit\u00e9 de montr\u00e9al btum direction marcel par\u00e9 vision produce flexible bilingual language file would available btum initially funded private donors government subsidies grew help professionals field translation following years 1975 btum able obtain data user responses collaboration language services bell canada end 1974 however translation bureau canadian secretary state department showed interest operation btum goal translation bureau time standardize terminology throughout public service well federal public administration january 1976 canadian secretary state department officially acquired btum renamed database termium terminologie universit\u00e9 de montr\u00e9al system transferred central computer federal government ottawa began integrate approximately 175,000 files btum initially compiled files translation bureau working years follow bureau began sorting process along input process onto computer database grew 900,000 records 1987 terminological records grew termium database canadian government received proposal 1985 toronto-based company launch termium cd-rom format order make database accessible users fall 1987 pilot project cd-rom launched investigate responses users included services translation bureau private canadian companies data compilation investigation bureau incorporated indexing system improve speed accuracy term extraction 1990 termium cd-rom commercially available subscription annual fee 1,100 1,500 updates released every three four months 1996 termium cd-rom received award atio association translators interpreters ontario october 2009 termium plus array language tools language portal canada launched free online access termium initially developed contain terminological records canada \u2019 official languages english french system upgraded third-generation version 1985 contained records languages spanish order accommodate growing range users worth noting however \u201c multilingual \u201d records term source language would english french equivalent non-official language currently vast collection specialized domains fields covered termium plus ranging administration including appellations arts sciences law justice aside millions entries recorded termium plus database also contains writing tools english french language canadian style writing style guide dictionnaire des cooccurrences guide french collocations archived glossaries well link language portal canada containing various french english writing resources", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1572, + "label": 9, + "text": "Verilog:verilog verilog standardized ieee 1364 hardware description language hdl used model electronic systems commonly used design verification digital circuits register-transfer level abstraction also used verification analog circuits mixed-signal circuits well design genetic circuits 2009 verilog standard ieee 1364-2005 merged systemverilog standard creating ieee standard 1800-2009 since verilog officially part systemverilog language current version ieee standard 1800-2017 hardware description languages verilog similar software programming languages include ways describing propagation time signal strengths sensitivity two types assignment operators blocking assignment non-blocking assignment non-blocking assignment allows designers describe state-machine update without needing declare use temporary storage variables since concepts part verilog language semantics designers could quickly write descriptions large circuits relatively compact concise form time verilog introduction 1984 verilog represented tremendous productivity improvement circuit designers already using graphical schematic capture software specially written software programs document simulate electronic circuits designers verilog wanted language syntax similar c programming language already widely used engineering software development like c verilog case-sensitive basic preprocessor though less sophisticated ansi c/c++ control flow keywords if/else case etc equivalent operator precedence compatible c. syntactic differences include required bit-widths variable declarations demarcation procedural blocks verilog uses begin/end instead curly braces many minor differences verilog requires variables given definite size c sizes assumed 'type variable instance integer type may 8 bits verilog design consists hierarchy modules modules encapsulate design hierarchy communicate modules set declared input output bidirectional ports internally module contain combination following net/variable declarations wire reg integer etc concurrent sequential statement blocks instances modules sub-hierarchies sequential statements placed inside begin/end block executed sequential order within block however blocks executed concurrently making verilog dataflow language verilog concept 'wire consists signal values 4-state 1 0 floating undefined signal strengths strong weak etc. system allows abstract modeling shared signal lines multiple sources drive common net wire multiple drivers wire readable value resolved function source drivers strengths subset statements verilog language synthesizable verilog modules conform synthesizable coding style known rtl register-transfer level physically realized synthesis software synthesis software algorithmically transforms abstract verilog source netlist logically equivalent description consisting elementary logic primitives flip-flops etc available specific fpga vlsi technology manipulations netlist ultimately lead circuit fabrication blueprint photo mask set asic bitstream file fpga verilog one first popular hardware description languages invented created prabhu goel phil moorby chi-lai huang douglas warmke late 1983 early 1984 chi-lai huang earlier worked hardware description lalsd language developed professor s.y.h su phd work wording process automated integrated design systems later renamed gateway design automation 1985 hardware modeling language gateway design automation purchased cadence design systems 1990 cadence full proprietary rights gateway verilog verilog-xl hdl-simulator would become de facto standard verilog logic simulators next decade originally verilog intended describe allow simulation automated synthesis subsets language physically realizable structures gates etc developed language achieved widespread usage verilog portmanteau words verification logic increasing success vhdl time cadence decided make language available open standardization cadence transferred verilog public domain open verilog international ovi known accellera organization verilog later submitted ieee became ieee standard 1364-1995 commonly referred verilog-95 time frame cadence initiated creation verilog-a put standards support behind analog simulator spectre verilog-a never intended standalone language subset verilog-ams encompassed verilog-95 extensions verilog-95 submitted back ieee cover deficiencies users found original verilog standard extensions became ieee standard 1364-2001 known verilog-2001 verilog-2001 significant upgrade verilog-95 first adds explicit support 2 complement signed nets variables previously code authors perform signed operations using awkward bit-level manipulations example carry-out bit simple 8-bit addition required explicit description boolean algebra determine correct value function verilog-2001 succinctly described one built-in operators \u00bb generate/endgenerate construct similar vhdl generate/endgenerate allows verilog-2001 control instance statement instantiation normal decision operators case/if/else using generate/endgenerate verilog-2001 instantiate array instances control connectivity individual instances file i/o improved several new system tasks finally syntax additions introduced improve code readability e.g always named parameter override c-style function/task/module header declaration verilog-2001 version verilog supported majority commercial eda software packages confused systemverilog verilog 2005 ieee standard 1364-2005 consists minor corrections spec clarifications new language features uwire keyword separate part verilog standard verilog-ams attempts integrate analog mixed signal modeling traditional verilog advent hardware verification languages openvera verisity e language encouraged development superlog co-design automation inc acquired synopsys foundations superlog vera donated accellera later became ieee standard p1800-2005 systemverilog systemverilog superset verilog-2005 many new features capabilities aid design verification design modeling 2009 systemverilog verilog language standards merged systemverilog 2009 ieee standard 1800-2009 current version ieee standard 1800-2017 simple example two flip-flops follows operator verilog another aspect hardware description language opposed normal procedural language known non-blocking assignment action register always block executed means order assignments irrelevant produce result flop1 flop2 swap values every clock assignment operator referred blocking assignment assignment used purposes logic target variable updated immediately example statements used blocking operator instead flop1 flop2 would swapped instead traditional programming compiler would understand simply set flop1 equal flop2 subsequently ignore redundant logic set flop2 equal flop1 example counter circuit follows example delays always clause illustrates type method use i.e executes whenever entities list b e changes one changes immediately assigned new value due blocking assignment b assigned new value afterward taking account new value delay 5 time units c assigned value b value c e tucked away invisible store 6 time units assigned value tucked away signals driven within process initial always block must type reg signals driven outside process must type wire keyword reg necessarily imply hardware register definition constants verilog supports addition width parameter basic syntax width bits base letter number examples several statements verilog analog real hardware e.g display consequently much language used describe hardware examples presented classic subset language direct mapping real gates next interesting structure transparent latch pass input output gate signal set pass-through captures input stores upon transition gate signal hold output remain stable regardless input signal gate set hold example pass-through level gate would value clause true i.e gate 1 read gate true din fed latch_out continuously clause false last value latch_out remain independent value din flip-flop next significant template verilog d-flop simplest modeled significant thing notice example use non-blocking assignment basic rule thumb use posedge negedge statement within always clause variant d-flop one asynchronous reset convention reset state first clause within statement next variant including asynchronous reset asynchronous set condition convention comes play i.e reset term followed set term note model used model set/reset flip flop simulation errors result consider following test sequence events 1 reset goes high 2 clk goes high 3 set goes high 4 clk goes high 5 reset goes low followed 6 set going low assume setup hold violations example always statement would first execute rising edge reset occurs would place q value 0 next time always block executes would rising edge clk would keep q value 0 always block executes set goes high reset high forces q remain 0 condition may may correct depending actual flip flop however main problem model notice reset goes low set still high real flip flop cause output go 1 however model occur always block triggered rising edges set reset \u2014 levels different approach may necessary set/reset flip flops final basic variant one implements d-flop mux feeding input mux d-input feedback flop allows gated load function note initial blocks mentioned description split fpga asic synthesis tools structure fpga tools allow initial blocks reg values established instead using reset signal asic synthesis tools n't support statement reason fpga initial state something downloaded memory tables fpga asic actual hardware implementation two separate ways declaring verilog process always initial keywords always keyword indicates free-running process initial keyword indicates process executes exactly constructs begin execution simulator time 0 execute end block always block reached end rescheduled common misconception believe initial block execute always block fact better think initial-block special-case always-block one terminates completes first time classic uses two keywords two significant additional uses common always keyword without ... sensitivity list possible use always shown always keyword acts similar c language construct 1 .. sense execute forever interesting exception use initial keyword addition forever keyword example functionally identical always example fork/join pair used verilog create parallel processes statements blocks fork/join pair begin execution simultaneously upon execution flow hitting fork execution continues join upon completion longest running statement block fork join way written possible either sequences abc bac print order simulation first write second write depends simulator implementation may purposefully randomized simulator allows simulation contain accidental race conditions well intentional non-deterministic behavior notice vhdl dynamically spawn multiple processes like verilog order execution n't always guaranteed within verilog best illustrated classic example consider code snippet printed values b depending order execution initial blocks could zero zero alternately zero arbitrary uninitialized value display statement always execute assignment blocks completed due 1 delay note operators shown order precedence ieee 1364 standard defines four-valued logic four states 0 1 z high impedance x unknown logic value competing vhdl dedicated standard multi-valued logic exists ieee 1164 nine levels system tasks available handle simple i/o various design measurement functions simulation system tasks prefixed distinguish user tasks functions section presents short list frequently used tasks means comprehensive list pli provides programmer mechanism transfer control verilog program function written c language officially deprecated ieee std 1364-2005 favor newer verilog procedural interface completely replaces pli pli vpi enables verilog cooperate programs written c language test harnesses instruction set simulators microcontroller debuggers example provides c functions codice_1 codice_2 used write read argument current verilog task function respectively information verilog simulators see list verilog simulators", + "neighbors": [ + 112, + 117, + 210, + 306, + 331, + 369, + 544, + 546, + 560, + 579, + 643, + 681, + 819, + 977, + 1324, + 1608 + ], + "mask": "Test" + }, + { + "node_id": 1573, + "label": 4, + "text": "Shamoon:shamoon shamoon also known w32.distrack modular computer virus discovered 2012 targeting recent 32-bit nt kernel versions microsoft windows virus noted behavior differing malware attacks due destructive nature cost attack recovery known years later biggest hack history virus apparently intended cyber warfare shamoon spread infected machine computers network system infected virus continues compile list files specific locations system upload attacker erase finally virus overwrites master boot record infected computer making unusable virus used cyber warfare national oil companies saudi arabia saudi aramco qatar rasgas discovery announced 16 august 2012 symantec kaspersky lab seculert similarities highlighted kaspersky lab seculert shamoon flame malware malware unique used target saudi government causing destruction state owned national oil company saudi aramco attackers posted pastie pastebin.com hours prior wiper logic bomb occurring citing oppression al-saud regime reason behind attack attack well-staged according chris kubecka former security advisor saudi aramco attack group leader security aramco overseas unnamed saudi aramco employee information technology team opened malicious phishing email allowing initial entry computer network around mid-2012 kubecka also detailed black hat usa talk saudi aramco placed majority security budget ics control network leaving business network risk major incident behalf anti-oppression hacker group fed crimes atrocities taking place various countries around world especially neighboring countries syria bahrain yemen lebanon egypt ... also dual approach world community nations want hit main supporters disasters action one main supporters disasters al-saud corrupt regime sponsors oppressive measures using muslims oil resources al-saud partner committing crimes hands infected blood innocent children people first step action performed aramco company largest financial source al-saud regime step penetrated system aramco company using hacked systems several countries sended malicious virus destroy thirty thousand computers networked company destruction operations began wednesday aug 15 2012 11:08 local time saudi arabia completed within hours shamoon attack designed two things replace data hard drives image burning american flag report addresses infected computers back computer inside company \u2019 network virus consisted three components dropper wiper reporter dropper main component source infection component drops wiper reporter onto infected computer copies network shares executes creates service start whenever windows starts wiper destructive component component gathers files locations infected computers erases sends information files attacker erased files overwritten corrupted files recovered reporter component sends infected information back attacker 15 august 11:08 local time 30,000 windows based systems began overwritten symantec found affected systems image american flag whilst data deleted overwritten saudi aramco announced attack facebook page went offline company statement issued 25 august 2012 statement falsely reported normal business resumed 25 august 2012 however middle eastern journalist leaked photographs taken 1 september 2012 showing kilometers petrol trucks unable loaded due backed business systems still inoperable saudi aramco restored main internal network services impacted august 15 2012 malicious virus originated external sources affected 30,000 workstations workstations since cleaned restored service precaution remote internet access online resources restricted saudi aramco employees returned work august 25 2012 following eid holidays resuming normal business company confirmed primary enterprise systems hydrocarbon exploration production unaffected operate isolated network systems production plants also fully operational control systems also isolated august 29 2012 attackers behind shamoon posted another pastie pastebin.com taunting saudi aramco proof still retained access company network post contained username password security network equipment new password aramco ceo khalid al-falih attackers also referenced portion shamoon malware proof pastie internet service routers three info follows core router sa-ar-co-1 password telnet c1sc0p ss-ar-cr-tl enable c1sc0p ss-ar-cr-bl backup router sa-ar-co-3 password telnet c1sc0p ss-ar-bk-tl enable c1sc0p ss-ar-bk-bl middle router sa-ar-co-2 password telnet c1sc0p ss-ar-st-tl enable c1sc0p ss-ar-st-bl khalid a. al-falih ceo email info follows khalid.falih aramco.com password kal ram sa1960 security appliances used according kubecka order restore operations saudi aramco used large private fleet aircraft available funds purchase much world hard drives driving price new hard drives required quickly possible oil prices affected speculation september 1 2012 gasoline resources dwindling public saudi arabia 17 days august 15th attack rasgas also affected different variant crippling similar manner unclear attacker may interest actually destroying infected pc kaspersky labs hinted 900 kb malware could related wiper used cyber attack iran april 2-day analysis company erroneously concluded malware likely come scriptkiddies inspired wiper later blog post eugene kaspersky clarified use shamoon categorizing cyber warfare virus hit companies within oil energy sectors group named cutting sword justice claimed responsibility attack 35,000 saudi aramco workstations causing company spend week restoring services group later indicated shamoon virus used attack computer systems rasgas also knocked offline unidentified computer virus security experts attributing damage shamoon shamoon made surprise comeback november 2016 according symantec involved new attack 23 january 2017 malware logic bomb triggered master boot record data wiping payload 11:08am local time wednesday august 15 attack occurred month ramadan 2012 would appear attack timed occur staff gone holiday reducing chance discovery maximum damage could caused hampering recovery shamoon uses number components infect computers first component dropper creates service name \u2018 ntssrv \u2019 remain persistent infected computer spreads across local network copying computers drop additional components infected computers dropper comes 32-bit 64-bit versions 32-bit dropper detects 64-bit architecture drop 64-bit version malware also contains disk wiping component utilizes eldos-produced driver known rawdisk achieve direct user-mode access hard drive without using windows apis component overwrites files portions image 2012 attack used image burning u.s. flag 2016 attack used photo body alan kurdi", + "neighbors": [ + 43, + 91, + 141, + 158, + 198, + 232, + 261, + 272, + 281, + 293, + 325, + 376, + 414, + 418, + 533, + 550, + 564, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 708, + 783, + 800, + 815, + 818, + 915, + 961, + 1043, + 1063, + 1090, + 1101, + 1112, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1368, + 1393, + 1398, + 1433, + 1436, + 1467, + 1475, + 1543, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1574, + "label": 4, + "text": "SuEXEC:suexec apache suexec feature apache web server allows users run common gateway interface cgi server side includes ssi applications different user normally web server processes run default web server user often wwwrun www-data apache nobody suexec feature consists module web server binary executable acts wrapper suexec introduced apache 1.2 often included default apache package provided linux distributions client requests cgi suexec activated call suexec binary wraps cgi scripts executes user account server process virtual host defined virtual host directive additionally suexec perform multi-step check executed cgi ensure security server including path-checks limit permitted commands etc user alice website including common gateway interface script files codice_1 common web root directory name folder accessed codice_2 user bob views alice webpage requires apache run one cgi scripts instead running scripts wwwrun results need scripts readable executable wwwrun group file owned group users otherwise scripts codice_3 wrapped using suexec run alice user id resulting higher security eliminating need make scripts readable executable users everyone wwwrun group instead alice needs able run script", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1575, + "label": 4, + "text": "Caller_ID:caller id caller id caller identification cid also called calling line identification clid calling line identification cli calling number delivery cnd calling number identification cnid calling line identification presentation clip call display telephone service available analog digital telephone systems including voip transmits caller telephone number called party telephone equipment call set caller id service may include transmission name associated calling telephone number service called cnam service first defined 1993 international telecommunication union telecommunication standardization sector itu-t recommendation q.731.3 recipient may inspect information answering call display telephone set separately attached device digital displays cable television sets telephone television service provided vendor caller id information may inaccurate false forged hence caller id information fully relied upon identify caller.. root cause lack authenticity accountability transmission telephone identities countries terms caller display calling line identification presentation clip call capture calling line identity used call display predominant marketing name used canada although customers still refer colloquially caller id idea cnid service pots subscribers originated automatic number identification ani part toll free number service united states however cnid ani thing ani originally term given system identified telephone number placing call non-electronic central office switch previous calling number could identified electronically caller id made two separate pieces information calling number billing subscriber name available call made given name name passed number different methods example caller name may datafilled originating switch case sent along number commonly database accessed receiving switch order match number name name exist city state province designation may sent databases may shared among several companies paying every time name extracted reason mobile phone callers appear wireless caller location phone number registered e.g cell phone ga cell phone registered georgia u.s.a. vary based company owns block numbers provider number may ported additionally nothing ensures number sent switch actual number call originated telephone switch initiating call may send digit string desired caller id telephone switch therefore operating entity must also trusted provide secure authentication displayed caller id also depends equipment originating call call originates pots line standard loop start line caller id provided service provider local switch since network connect caller callee phone answered generally caller id signal altered caller service providers however allow caller block caller id presentation vertical service code *67 call placed behind private branch exchange pbx options typical telephony environment pbx connects local service provider primary rate interface pri trunks generally although absolutely service provider simply passes whatever calling line id appears pri access trunks transparently across public switched telephone network pstn opens opportunity pbx administrator program whatever number choose external phone number fields ip phone services itsps internet telephony service providers support pstn gateway installations throughout world gateways egress calls local calling area thus avoiding long distance toll charges itsps also allow local user number located foreign exchange new york caller could los angeles number example user places call calling line id would los angeles number although actually located new york allows call return without incur long distance calling charges cellphones biggest issue appears passing calling line id information network cellphone companies must support interconnecting trunks significant number wireline pstn access carriers cli localisation describes process presenting localised cli calling line identity recipient telephone call cli localisation utilised various organisations including call centres debt collectors insurance companies cli localisation allows companies increase contact rate increasing chance called party answer phone call localised cli displayed called party device call perceived local recognisable caller rather withheld unknown premium rate number presented telephone number adjusted depending area code dialed number 1968 theodore george ted paraskevakos working communications engineer sita athens greece began developing system automatically identify telephone caller call recipient several attempts experiments developed method caller number transmitted receiver device method basis modern-day caller id technology 1969 1975 paraskevakos issued twenty separate patents related automatic telephone line identification since significantly predated similar patents appear prior art later united states patents issued kazuo hashimoto carolyn a. doughty 1971 paraskevakos working boeing huntsville alabama constructed reduced practice transmitter receiver representing world first prototypes caller-identification devices installed peoples telephone company leesburg alabama demonstrated several telephone companies original historic working models still possession paraskevakos patents related devices paraskevakos also proposed send alphanumeric information caller name receiving apparatus make banking telephone feasible also proposed identify calling telephone special code e.g. pf public phone ho home phone office phone pl police may 1976 kazuo hashimoto prolific japanese inventor one thousand patents worldwide first built prototype caller id display device could receive caller id information work caller id devices early prototypes received smithsonian institution national museum american history 2000 u.s. patent 4,242,539 filed originally may 8 1976 resulting patent re-examined patent office successfully licensed major telecommunications computer companies world initially operating telephone companies wanted caller id function performed central office voice announcement charged per-call basis john harris employee northern telecom telephone set manufacturing division london ontario promoted idea caller id telephone set display telephone coded eccs enhanced custom calling services video prototype used leverage feature central office telephone set 1977 brazilian inventor valdir bravo salinas filed patent application caller id device brazilian patent trademarks office inpi patent issued 1982 patent pi7704466 first patent ever issued caller id equipment brazil later 1980 two brazilian inventors jo\u00e3o da cunha doya n\u00e9lio jos\u00e9 nicolai filed different patent applications caller id devices doya \u2019 application filed may 2 1980 issued patent pi8003077 nicolai \u2019 application filed july 2 1980 rejected copy salinas invention 1981 another application caller id equipment filed inpi jos\u00e9 daniel martin catoira afonso feij\u00f3 da costa ribeiro neto application granted patent issued patent pi8106464 first market trial caller id custom local area signaling services conducted bell atlantic may 1984 bell communications research bellcore named service caller id regional bell operating companies later adopted name eventually became generally accepted name united states planning trial initiated team bell laboratories western electric bell system divestiture participation bell atlantic purpose trials assess revenue potential services depend deployment common channel signaling network needed transmit calling number originating terminating central offices trial results analyzed bellcore members original team 1987 bell atlantic verizon communications conducted another market trial hudson county new jersey followed limited deployment bellsouth first company deploy caller id december 1988 memphis tennessee full deployment nine-state region next four years bell atlantic second local telephone company deploy caller id new jersey hudson county followed us west communications centurylink 1989 1995 bellcore released another type modulation similar bell 202 became possible transmit caller id information even provide call-disposition options user already telephone service became known markets call waiting id combined call-disposition options call waiting deluxe technically referred analog display services interface call waiting deluxe bellcore telcordia technologies term type ii caller id disposition options class-based pots-telephone calling feature works combining services call waiting caller id also introduces options feature conjunction certain screen-based telephones capable equipment gives telephone user option data checksum united states caller id information sent called party telephone switch analog data stream similar data passed two modems using bell 202 modulation first second rings telephone unit still hook telephone call answered quickly first ring caller id information transmitted recipient two types caller id number name+number number-only caller id called single data message format sdmf provides caller telephone number date time call name+number caller id called multiple data message format mdmf addition information provided sdmf format also provide directory listed name particular number caller id readers compatible mdmf also read simpler sdmf format sdmf caller id reader recognize mdmf data stream act caller id information present e.g line equipped caller id instead sending caller id first second ring systems uk use line reversal announce caller id caller id signals simply sent without announcement instead bell 202 european alternative v.23 sometimes used without 75-baud reverse channel data sent using dtmf signalling general cid transmitted origin call calling party full phone number including area code including international access code country code international call calling party name added consumer terminating central office consumer subscribed service calling name delivery automatic ss7 signalling system 7 tcap query may launched called party central office order retrieve information calling name delivery caller id equipment consumer location caller name already associated calling party line originating central office canadian systems using ccs7 automatically cases send calling name call set-up routing information time call look name associated phone number carrier instances access information third-party database database providers charge small fee access databases cnam dip fee small \u2013 less penny per call starts negotiations cnam dip fees .004 per lookup opencnam fees bit expensive .0048 per lookup avoid charges carriers report name unavailable report name city state based phone number particularly wireless callers toll-free numbers may report string tollfree number name available database smartphones use third-party mobile app name lookup third-party database telemarketing organisations often spoof caller id instances done provide central number consumers call back toll-free number rather consumers call back outbound call centre call actually originated however telemarketers block fraudulently spoof caller id prevent traced united states federal law telemarketers block send false caller id individuals bring civil suits federal communications commission fcc fine companies individuals illegally spoofing blocking caller id telemarketers used caller id marketing using toll-free number registering text string free money free plane tickets name displayed caller id internet service providers isps providing dial-up access require customer use cnid prevent abuse account unauthorised callers systems dial-up access programmed accept calls specific caller id strings mobile phone providers used caller id automatically connect voice mail call voice mail number made associated mobile phone number bypassing need enter password convenient many users spoofing practice replaced secure authentication many carriers caller id transmission implemented using different technologies standards countries united states bellcore fsk standard prevalent whereas taiwan uses etsi fsk sometimes individual service providers within country use different standards caller id converters used translate one standard another telephone equipment usually displays clid information difficulty modems notoriously problematic modems support british telecom standard hardware drivers often errors prevent clid information recognised uk telephone companies use slight variations bellcore standard clid support hit miss cnd currently available australia subscribers integrated services digital network isdn legislation section 276 australia industry code calling number display acif c522 february 2003 united states telemarketers required transmit caller id requirement went effect january 29 2004 courts ruled caller id admissible providers required fcc rules offer per-call blocking caller id customers legislation united states made caller id spoofing illegal fraudulent purposes starting mid-2017 intended culmination 2019 fcc pushed forward caller id certification implemented via methodology shaken/stir caller id blocking common term service caller prevent display calling number recipient telephone blocking number formally referred calling line identification restriction clir telecommunications regulators vary requirements use effectiveness assorted technologies prevent numbers displayed generally unlisted numbers always blocked non-published regular listed numbers usually blocked varying treatment determination call display blocking many factors desired customers inquire carefully make sure number displayed telephone service provider may also vertical service codes dialed configure blocking active calls call-by-call basis locations united states regulations allow require blocking automatic transparent caller blocking applied call-by-call basis time call made subscribers block caller id dialing special code vertical service code vsc making call north america regions code *67 1167 rotary dial united kingdom ireland 141 special code block information companies using call capture technology means equipment caller id simply display word private withheld cnid blocked caller request number actually transmitted entire telephone network presentation withheld flag set destination co expected honor flag sometimes not\u2014especially destination phone number served isdn pri alternatively cases caller id blocked automatically released call-by-call basis dialing special code *82 north america 1470 uk see enabling similarly countries offer anonymous caller rejection rejects calls subscriber name number blocked telephone companies protect clients receiving blocked information routing anonymous calls service privacy manager caller required announce service asks called party want accept reject call telephone companies play recording caller advising called party rejection configuration often offer advice prefixing dialing *82 get call intended called party emergency services likely able show restricted number using service called calling line identification restriction override cliro using general ani services features create cat-and-mouse game type situation whereby subscribers must purchase additional services order cancel services prefixing telephone number following codes disables caller id per-call basis countries networks vary however gsm mobile networks callers may dial 31 number wish call disable countries network providers allow caller id blocking based domestic telecommunications regulations clir available external app value-added service depending operator country number prefix codes unblock caller id gsm mobile networks callers may dial *31 enable caller id subsequent calls caller id spoofing practice causing telephone network display number recipient caller id display different actual originating station many telephone services isdn pri based pbx installations voice ip services permit caller configure customized caller id information corporate settings permits announcement switchboard number customer service numbers caller id spoofing may illegal countries certain situations consumer telephone company must pay small fee caller id text transmitted call fee called cnam dip fee named dip fee consumer carrier pays fee dip originating telephone company database get caller id information several companies engage generating dip fees catering companies make large number outbound calls callerid4u pacific telecom communications group cater telemarketers generate revenue fees caller id information telemarketers enter agreement companies like callerid4u pacific telecom communications group share revenue produced telemarketing call consumers face significant barriers exiting call list often removed list calling opt-out numbers often results fast-busy call never completes consumer remains list according reports companies like callerid4u thousands phone numbers thousands ftc complaints filed month violating call registration large number phone numbers dilute number complaints company phone number", + "neighbors": [ + 162, + 166, + 285, + 291, + 608, + 1373 + ], + "mask": "Test" + }, + { + "node_id": 1576, + "label": 4, + "text": "RSA_SecurID:rsa securid rsa securid formerly referred securid mechanism developed security dynamics later rsa security rsa security division emc performing two-factor authentication user network resource rsa securid authentication mechanism consists token \u2014 either hardware e.g key fob software soft token \u2014 assigned computer user creates authentication code fixed intervals usually 60 seconds using built-in clock card factory-encoded almost random key known seed seed different token loaded corresponding rsa securid server rsa authentication manager formerly ace/server tokens purchased on-demand tokens also available provide tokencode via email sms delivery eliminating need provision token user token hardware designed tamper-resistant deter reverse engineering software implementations algorithm software tokens appeared market public code developed security community allowing user emulate rsa securid software access current rsa securid code original 64-bit rsa securid seed file introduced server later 128-bit rsa securid algorithm published part open source library rsa securid authentication scheme seed record secret key used generate one-time passwords newer versions also feature usb connector allows token used smart card-like device securely storing certificates user authenticating network resource\u2014say dial-in server firewall\u2014needs enter personal identification number number displayed moment rsa securid token though increasingly rare systems using rsa securid disregard pin implementation altogether rely password/rsa securid code combinations server also real-time clock database valid cards associated seed records authenticates user computing number token supposed showing moment time checking user entered older versions securid duress pin may used\u2014an alternate code creates security event log showing user forced enter pin still providing transparent authentication using duress pin would allow one successful authentication token automatically disabled duress pin feature deprecated available currently supported versions rsa securid system adds layer security network difficulty occur authentication server clock becomes sync clock built authentication tokens normal token clock drift accounted automatically server adjusting stored drift value time sync condition result normal hardware token clock drift correcting synchronization authentication manager server clock sync token tokens accomplished several different ways server clock drifted administrator made change system clock tokens either resynchronized one-by-one stored drift values adjusted manually drift done individual tokens bulk using command line utility rsa security pushed forth initiative called ubiquitous authentication partnering device manufacturers ironkey sandisk motorola freescale semiconductor redcannon broadcom blackberry embed securid software everyday devices usb flash drives cell phones reduce cost number objects user must carry token codes easily stolen mutual-authentication exists anything steal password also steal token code significant since principal threat users believe solving technology simplest practical vulnerability password container losing special key device activated smart phone integrated key function vulnerability healed single token container device within preset time span activation consideration presumes loss prevention e.g additional electronic leash body sensor alarm rsa securid tokens offer level protection password replay attacks designed offer protection man middle type attacks used alone attacker manages block authorized user authenticating server next token code valid able log server risk-based analytics rba new feature latest version 8.0 provides significant protection type attack user enabled authenticating agent enabled rba rsa securid prevent man browser mitb based attacks securid authentication server tries prevent password sniffing simultaneous login declining authentication requests two valid credentials presented within given time frame documented unverified post john g. brainard attacker removes user ability authenticate however securid server assume user actually authenticating hence allow attacker authentication attack model system security improved using encryption/authentication mechanisms ssl although soft tokens may convenient critics indicate tamper-resistant property hard tokens unmatched soft token implementations could allow seed record secret keys duplicated user impersonation occur hard tokens hand physically stolen acquired via social engineering end users small form factor makes hard token theft much viable laptop/desktop scanning user typically wait one day reporting device missing giving attacker plenty time breach unprotected system could occur however users userid pin also known risk-based analytics provide additional protection use lost stolen tokens even users userid pin known attackers batteries go flat periodically requiring complicated replacement re-enrollment procedures 2003 rsa securid commanded 70 two-factor authentication market 25 million devices produced date number competitors vasco make similar security tokens mostly based open oath hotp standard study otp published gartner 2010 mentions oath securid competitors network authentication systems opie s/key sometimes generally known otp s/key trademark telcordia technologies formerly bellcore attempt provide something level authentication without requiring hardware token 17 march 2011 rsa announced victims extremely sophisticated cyber attack concerns raised specifically reference securid system saying information could potentially used reduce effectiveness current two-factor authentication implementation however formal form 8-k submission indicated believe breach would material impact financial results breach cost emc parent company rsa 66.3 million taken charge second quarter earnings covered costs investigate attack harden systems monitor transactions corporate customers according emc executive vice president chief financial officer david goulden conference call analysts breach rsa network carried hackers sent phishing emails two targeted small groups employees rsa attached email excel file containing malware rsa employee opened excel file malware exploited vulnerability adobe flash exploit allowed hackers use poison ivy remote administration tool gain control machines access servers rsa network hints breach involved theft rsa database mapping token serial numbers secret token seeds injected make one unique reports rsa executives telling customers ensure protect serial numbers tokens lend credibility hypothesis barring fatal weakness cryptographic implementation token code generation algorithm unlikely since involves simple direct application extensively scrutinized aes-128 block cipher circumstance attacker could mount successful attack without physical possession token token seed records leaked rsa stated release details extent attack give potential attackers information could use figuring attack system 6 june 2011 rsa offered token replacements free security monitoring services 30,000 securid customers following attempted cyber breach defense customer lockheed martin appeared related securid information stolen rsa spite resulting attack one defense customers company chairman art coviello said believe still believe customers protected april 2011 unconfirmed rumors cited l-3 communications attacked result rsa compromise may 2011 information used attack lockheed martin systems however lockheed martin claims due aggressive actions company information security team customer program employee personal data compromised significant tenacious attack department homeland security us defense department offered help determine scope attack", + "neighbors": [ + 43, + 91, + 141, + 158, + 162, + 198, + 232, + 261, + 281, + 293, + 317, + 325, + 376, + 414, + 418, + 533, + 550, + 577, + 588, + 600, + 604, + 613, + 621, + 624, + 665, + 675, + 692, + 708, + 783, + 800, + 818, + 915, + 1043, + 1063, + 1162, + 1186, + 1270, + 1293, + 1327, + 1332, + 1336, + 1342, + 1365, + 1393, + 1436, + 1452, + 1467, + 1475, + 1543, + 1573, + 1576, + 1585 + ], + "mask": "Test" + }, + { + "node_id": 1577, + "label": 1, + "text": "Integrated_manufacturing_database:integrated manufacturing database integrated database system used small large businesses means incorporate manufacturing process updates stores records information view rapid retrieval examples could include capable performing searches particular part may present many different products", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1578, + "label": 2, + "text": "Comparison_of_operating_systems:comparison operating systems tables provide comparison operating systems computer devices listing general technical information number widely used currently available pc handheld including smartphone tablet computer operating systems article usage share operating systems provides broader general comparison operating systems includes servers mainframes supercomputers large number variety available linux distributions grouped single entry see comparison linux distributions detailed comparison also variety bsd dos operating systems covered comparison bsd operating systems comparison dos operating systems information views operating system see operating system advocacy posix compliant partly compliant systems like freebsd linux macos solaris basic commands standardized note linux systems may vary distribution specific program even 'command called via posix alias function example wanted use dos dir give directory listing one detailed file listing per line could use alias dir='ls -lahf e.g session configuration file", + "neighbors": [ + 1, + 9, + 22, + 34, + 37, + 42, + 55, + 58, + 64, + 99, + 106, + 134, + 162, + 170, + 171, + 185, + 187, + 189, + 193, + 195, + 210, + 265, + 322, + 326, + 331, + 353, + 380, + 387, + 413, + 434, + 443, + 457, + 465, + 477, + 521, + 524, + 542, + 558, + 571, + 583, + 647, + 650, + 664, + 716, + 720, + 721, + 728, + 754, + 755, + 797, + 860, + 884, + 891, + 897, + 899, + 919, + 922, + 935, + 936, + 941, + 954, + 961, + 966, + 996, + 1002, + 1011, + 1012, + 1016, + 1024, + 1027, + 1040, + 1049, + 1053, + 1054, + 1063, + 1087, + 1100, + 1138, + 1155, + 1157, + 1187, + 1188, + 1201, + 1202, + 1224, + 1252, + 1257, + 1275, + 1284, + 1287, + 1301, + 1304, + 1318, + 1322, + 1361, + 1366, + 1391, + 1394, + 1398, + 1415, + 1421, + 1441, + 1456, + 1474, + 1494, + 1530, + 1538, + 1546, + 1610, + 1616, + 1631, + 1632, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1579, + "label": 7, + "text": "Coda.io:coda.io coda cloud-based document editor founded shishir mehrotra alex deneui software provides word-processing spreadsheet database functions 2017 coda reported raised 60 million capital", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1580, + "label": 4, + "text": "Sqlmap:sqlmap sqlmap open source software used detect exploit database vulnerabilities provides options injecting malicious codes penetration testing tool automates process detecting exploiting sql injection flaws providing user interface terminal software run command line available download different operating systems linux distributions windows mac os operating systems addition mapping detecting vulnerabilities software enables access database editing deleting data viewing data tables users passwords backups phone numbers e-mail addresses credit cards confidential sensitive information sqlmap full support multiple dbmss including mysql oracle postgresql microsoft sql server microsoft access ibm db2 sqlite firebird sap maxdb full support injection techniques boolean error stack time union standard use software unix environment follows sqlmap -u http //172.16.0.0/files/file.php id=1 additional values combined help file prompted command sqlmap -h", + "neighbors": [ + 134, + 144, + 782, + 1582 + ], + "mask": "Validation" + }, + { + "node_id": 1581, + "label": 3, + "text": "Daedalian_Opus:daedalian opus game essentially series 36 jigsaw puzzles pentominos must assembled specific shape puzzles start rectangular shapes simple solutions puzzles quickly grow complex odder shapes like rocket ship gun even enlarged versions pentominoes level timed timer started stopped level finished one starts game three pentomino pieces completion early level new piece awarded player final level player given 2x2 square tetromino must complete 8x8 square puzzle completing level player given password access level later time password common english four-letter word guessing common four-letter words players could potentially access levels actually reached playing game name game inspired daedalus mythical character greek legend created labyrinth faithful fan version later coded msx computer system karoshi corporation 2006 game development contest msxdev'06 game ported different platforms pc gp2x", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1582, + "label": 7, + "text": "GitHub:github github american company provides hosting software development version control using git subsidiary microsoft acquired company 2018 7.5 billion offers distributed version control source code management scm functionality git well adding features provides access control several collaboration features bug tracking feature requests task management wikis every project github offers plans free professional enterprise accounts free github accounts commonly used host open source projects january 2019 github offers unlimited private repositories plans including free accounts may 2019 github reports 37 million users 100 million repositories including least 28 million public repositories making largest host source code world github developed chris wanstrath p. j. hyett tom preston-werner scott chacon using ruby rails started february 2008 company github inc. existed since 2007 located san francisco february 24 2009 github team members announced talk yahoo headquarters within first year online github accumulated 46,000 public repositories 17,000 formed previous month alone time 6,200 repositories forked least 4,600 merged july 5 2009 github announced site harnessed 100,000 users july 27 2009 another talk delivered yahoo preston-werner announced github grown host 90,000 unique public repositories 12,000 forked least total 135,000 repositories july 25 2010 github announced hosting 1 million repositories april 20 2011 github announced hosting 2 million repositories june 2 2011 readwriteweb reported github surpassed sourceforge google code total number commits period january may 2011 july 9 2012 peter levine general partner github investor andreessen horowitz stated github growing revenue 300 annually since 2008 profitably nearly entire way january 16 2013 github announced passed 3 million users mark hosting 5 million repositories december 23 2013 github announced reached 10 million repositories june 2015 github opened office japan first office outside u.s. july 29 2015 github announced raised 250 million funding round led sequoia capital round valued company approximately 2 billion 2016 github ranked 14 forbes cloud 100 list february 28 2018 github fell victim second largest distributed denial-of-service ddos attack history incoming traffic reaching peak 1.35 terabits per second june 4 2018 microsoft announced reached agreement acquire github 7.5 billion purchase closed october 26 2018 june 19 2018 github expanded github education offering free education bundles schools june 4 2018 microsoft announced intent acquire github us 7.5 billion deal closed oct. 26 2018 github continue operate independently community platform business microsoft service led xamarin nat friedman reporting scott guthrie executive vice president microsoft cloud ai current ceo chris wanstrath retained technical fellow also reporting guthrie microsoft become significant user github using host open source projects development tools chakra core powershell visual studio code backed open source projects linux developed virtual file system git vfs git formerly git virtual file system gvfs \u2014a git extension managing large-scale repositories adopted github concerns developers kyle simpson javascript trainer author rafael laguna ceo open-xchange microsoft purchase citing uneasiness microsoft handling previous acquisitions nokia mobile business skype saw culmination microsoft recent changes business strategy ceo satya nadella seen larger focus sale cloud computing services main line business alongside development contributions open source software linux opposed microsoft windows operating system harvard business review argued microsoft intending acquire github get access userbase used loss leader encourage use development products services concerns sale bolstered interest competitors bitbucket owned atlassian gitlab commercial open source product also runs hosted service version sourceforge owned bizx llc reported seen spikes new users intending migrate projects github respective services github inc. originally flat organization middle managers words everyone manager self-management employees could choose work projects interested open allocation salaries set chief executive 2014 github inc. introduced layer middle management github.com start-up business first years provided enough revenue funded solely three founders start taking employees july 2012 four years company founded andreessen horowitz invested 100 million venture capital july 2015 github raised another 250 million venture capital series b round investors sequoia capital andreessen horowitz thrive capital venture capital funds august 2016 github making 140 million annual recurring revenue github mascot anthropomorphized octocat five octopus-like arms character created graphic designer simon oxley clip art sell istock website enables designers market royalty-free digital images github became interested oxley work twitter selected bird designed logo illustration github chose character oxley named octopuss since github wanted octopuss logo use istock license disallows negotiated oxley buy exclusive rights image github renamed octopuss octocat trademarked character along new name later github hired illustrator cameron mcefee adapt octocat different purposes website promotional materials mcefee various github users since created hundreds variations character available octodex march 2014 github programmer julie ann horvath alleged founder ceo tom preston-werner wife theresa engaged pattern harassment led leaving company april 2014 github released statement denying horvath allegations however following internal investigation github confirmed claims github ceo chris wanstrath wrote company blog investigation found tom preston-werner capacity github ceo acted inappropriately including confrontational conduct disregard workplace complaints insensitivity impact spouse presence workplace failure enforce agreement spouse work office preston-werner resigned company 2017 allegations made discriminatory unsupportive behavior github developer recruited following commitment github improve diversity inclusivity development github platform began october 19 2007 site launched april 2008 tom preston-werner chris wanstrath p. j. hyett scott chacon made available months prior beta release projects github accessed manipulated using standard git command-line interface standard git commands work github also allows registered non-registered users browse public repositories site multiple desktop clients git plugins also created github third parties integrate platform site provides social networking-like functions feeds followers wikis using wiki software called gollum social network graph display developers work versions forks repository fork branch within fork newest user must create account order contribute content site public repositories browsed downloaded anyone registered user account users able discussions manage repositories submit contributions others repositories review changes code github began offering unlimited private repositories cost january 2019 limited three contributors per project previously public repositories free fundamental software underpins github git written linus torvalds creator linux additional software provides github user interface written using ruby rails erlang github inc. developers wanstrath hyett preston-werner github mostly used code addition source code github supports following formats features github terms service require public software projects hosted github meet open source definition reason essential users developers intending use piece software found github read software license repository usually found top-level file called license license.txt similar determine meets needs terms service state setting repositories viewed publicly agree allow others view fork repositories github enterprise similar github public service designed use large-scale enterprise software development teams enterprise wishes host repositories behind corporate firewall cloud enterprises privately run github cloud premises two environments linked work together github pages static web hosting service offered github since 2008 github users hosting user blogs project documentation even whole books created page github pages content stored git repository either files served visitors verbatim markdown format github seamlessly integrated jekyll static web site blog generator github continuous integration pipelines time content source updated jekyll regenerates website automatically serves via github pages infrastructure rest github includes free paid tiers service instead supported web advertising web sites generated service hosted either subdomains github.io domain custom domains bought third-party domain name registrar github also operates services pastebin-style site called gist hosting code snippets github proper hosting larger projects tom preston-werner presented then-new gist feature punk rock ruby conference 2008 gist builds traditional simple concept pastebin adding version control code snippets easy forking ssl encryption private pastes gist git repository multiple code snippets contained single paste pushed pulled using git forked code pushed back original author form patch gists pastes become like mini-projects github launched new program called github student developer pack give students free access popular development tools services github partnered bitnami crowdflower digitalocean dnsimple hackhands namecheap orchestrate screenhero sendgrid stripe travis ci unreal engine launch program 2016 github announced launch github campus experts program train encourage students grow technology communities universities campus experts program open university students 18 years older across world github campus experts one primary ways github funds student oriented events communities campus experts given access training funding additional resources run events grow communities become campus expert applicants must complete online training course consisting multiple modules designed grow community leadership skills github also provides software service integrations adding extra features projects services include site https //github.community/ github maintains community forum users ask questions publicly answer questions users site https //github.com/sponsors github sponsors allows users make monthly money donations projects hosted github public beta announced may 23 2019 currently project accepts wait list registrations verge said github sponsors works exactly like patreon developers offer various funding tiers come different perks \u2019 receive recurring payments supporters want access encourage work except zero fees use program furthermore github offer incentives early adopters first year pledges cover payment processing costs match sponsorship payments 5,000 per developer furthermore users still use similar services like patreon open collective link websites july 25th 2019 developer based iran wrote medium github blocked private repositories prohibited access github pages soon github confirmed blocking developers iran crimea cuba north korea syria accessing private repositories however github reopened access github pages days later public repositories regardless location also revealed using github visiting sanctioned countries could result similar action occurring user account github responded complaints media spokesperson saying github subject us trade control laws committed full compliance applicable law time github vision global platform developer collaboration matter developers reside result take seriously responsibility examine government mandates thoroughly certain users customers impacted beyond required law includes keeping public repositories services including open source projects available accessible support personal communications involving developers sanctioned regions developers feel restrictions appeal removal said restrictions including travel reside countries github forbidden use vpns ip proxies access site sanctioned countries purchase history ip addresses flag users among sources december 3 2014 github blacklisted russia github initially refused take user-posted suicide manuals day russia withdrew block december 31 2014 github blocked india along 31 websites pro-isis content posted users january 10 2015 github unblocked march 26 2015 github fell victim massive ddos attack lasted 118 hours attack appeared originate china primarily targeted github-hosted user content describing methods circumventing internet censorship october 8 2016 github access blocked turkish government prevent email leakage hacked account belonging country energy minister july 25 2019 github started blocking developers countries facing us trading sanctions prominent open source organizations projects use github primary place collaboration including", + "neighbors": [ + 29, + 36, + 58, + 77, + 106, + 124, + 134, + 148, + 203, + 207, + 216, + 293, + 313, + 331, + 333, + 391, + 433, + 446, + 472, + 509, + 526, + 538, + 541, + 544, + 558, + 564, + 565, + 567, + 611, + 625, + 638, + 678, + 685, + 742, + 759, + 813, + 825, + 826, + 857, + 872, + 896, + 897, + 923, + 948, + 961, + 976, + 1003, + 1030, + 1063, + 1098, + 1109, + 1120, + 1163, + 1173, + 1225, + 1235, + 1242, + 1245, + 1246, + 1276, + 1288, + 1304, + 1311, + 1318, + 1322, + 1368, + 1373, + 1375, + 1433, + 1458, + 1459, + 1461, + 1466, + 1486, + 1513, + 1516, + 1547, + 1555, + 1566, + 1580, + 1588, + 1621, + 1625, + 1635 + ], + "mask": "Validation" + }, + { + "node_id": 1583, + "label": 7, + "text": "Deltacloud:deltacloud deltacloud application programming interface api developed red hat apache software foundation abstracts differences cloud computing implementations announced september 3 2009 infrastructure-as-a-service cloud existing today provides api purpose deltacloud provide one unified rest-based api used manage services cloud particular cloud controlled adapter called driver june 2012 drivers exist following cloud platforms amazon ec2 fujitsu global cloud platform gogrid opennebula rackspace rhev-m rimuhosting terremark vmware vcloud next 'classic front-end also offers cimi ec2 front-ends deltacloud used applications aeolus prevent need implement cloud-specific logic may 17 2010 red hat contributed deltacloud apache incubator project graduated incubator october 26 2011 became apache software foundation tlp top-level project july 2013 fujitsu vmware used deltacloud demonstration cimi management developers conference manage cloud infrastructure im may 2013 redhat announced scaling back sponsorship apache deltacloud project effective immediately july 2015 deltacloud moved apache attic due inactivity", + "neighbors": [ + 134, + 178, + 192, + 197, + 296, + 318, + 412, + 611, + 620, + 715, + 874, + 1091, + 1138, + 1163, + 1254, + 1311, + 1377, + 1454 + ], + "mask": "Test" + }, + { + "node_id": 1584, + "label": 9, + "text": "Atari_ST_BASIC:atari st basic atari st basic st basic first dialect basic produced atari st line computers bundled new sts early years st lifespan quickly became standard basic platform however many users disliked improved dialects basic quickly came replace atari commissioned metacomco write version basic would take advantage gem environment atari st based version already written digital research called dr-basic bundled dr cp/m-86 operating system result called st basic time st launched st basic bundled new sts port language called abasic ended supplied time amiga commodore quickly replaced microsoft-developed amigabasic user interface consisted four windows edit-window one could enter source code list-window entire source code could browsed command/debug-window instructions entered immediately executed output-window however windows could selected mouse became cumbersome st basic many bugs compute september 1987 reported one flaw described among worst basic bugs time typing codice_1 resulted similar commands codice_2 codice_3 crashed computer magazine described results last command bad crash get st without seeing machine rip free cables drag edge desk leap trash bin citing flaws codice_4 codice_5 equivalent magazine recommended avoid ing st basic serious programming regarding reports metacomco one bug away releasing long-delayed update language jokingly wondered whether atari one bug eliminate st basic one add relatively low quality st basic quickly opened market third-party basics st. fast basic gfa basic two first third-party basics released basics free program written one basics could listed run user basic however compilers run-time executables started appear basics produced executable code could run sts type-in programs became less fashionable longer need standard basic hisoft basic omikron basic stos basic appeared basics even started bundled new sts later years", + "neighbors": [ + 0, + 8, + 236, + 273, + 292, + 510, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1156, + 1204, + 1306, + 1390, + 1593 + ], + "mask": "Test" + }, + { + "node_id": 1585, + "label": 4, + "text": "Multi-factor_authentication:multi-factor authentication multi-factor authentication mfa authentication method computer user granted access successfully presenting two pieces evidence factors authentication mechanism knowledge something user user knows possession something user user inherence something user user two-factor authentication also known 2fa type subset multi-factor authentication method confirming users claimed identities using combination two different factors 1 something know 2 something 3 something good example two-factor authentication withdrawing money atm correct combination bank card something user possesses pin something user knows allows transaction carried two examples supplement user-controlled password one-time password otp code generated received authenticator e.g security token smartphone user possesses two-step verification two-step authentication method confirming user claimed identity utilizing something know password second factor something something example second step user repeating back something sent out-of-band mechanism second step might six digit number generated app common user authentication system use multiple authentication factors prove one identity based premise unauthorized actor unlikely able supply factors required access authentication attempt least one components missing supplied incorrectly user identity established sufficient certainty access asset e.g. building data protected multi-factor authentication remains blocked authentication factors multi-factor authentication scheme may include knowledge factors commonly used form authentication form user required prove knowledge secret order authenticate password secret word string characters used user authentication commonly used mechanism authentication many multi-factor authentication techniques rely password one factor authentication variations include longer ones formed multiple words passphrase shorter purely numeric personal identification number pin commonly used atm access traditionally passwords expected memorized many secret questions born poor examples knowledge factor may known wide group people able researched possession factors something user user used authentication centuries form key lock basic principle key embodies secret shared lock key principle underlies possession factor authentication computer systems security token example possession factor disconnected tokens connections client computer typically use built-in screen display generated authentication data manually typed user connected tokens devices physically connected computer used devices transmit data automatically number different types including card readers wireless tags usb tokens software token a.k.a soft token type two-factor authentication security device may used authorize use computer services software tokens stored general-purpose electronic device desktop computer laptop pda mobile phone duplicated contrast hardware tokens credentials stored dedicated hardware device therefore duplicated absent physical invasion device soft token may device user interacts typically x.509v3 certificate loaded onto device stored securely serve purpose factors associated user usually biometric methods including fingerprint face voice iris recognition behavioral biometrics keystroke dynamics also used increasingly fourth factor coming play involving physical location user hard wired corporate network user could allowed login utilizing pin code network entering code soft token well could required could seen acceptable standard access office controlled systems network admission control work similar ways level network access contingent specific network device connected wifi vs wired connectivity also allows user move offices dynamically receive level network access many multi-factor authentication vendors offer mobile phone-based authentication methods include push-based authentication qr code based authentication one-time password authentication event-based time-based sms-based verification sms-based verification suffers security concerns phones cloned apps run several phones cell-phone maintenance personnel read sms texts least cell phones compromised general meaning phone longer something user major drawback authentication including something user possesses user must carry around physical token usb stick bank card key similar practically times loss theft risks many organizations forbid carrying usb electronic devices premises owing malware data theft-risks important machines usb ports reason physical tokens usually scale typically requiring new token new account system procuring subsequently replacing tokens kind involves costs addition inherent conflicts unavoidable trade-offs usability security two-step authentication involving mobile phones smartphones provides alternative dedicated physical devices authenticate people use personal access codes device i.e something individual user knows plus one-time-valid dynamic passcode typically consisting 4 6 digits passcode sent mobile device sms generated one-time passcode-generator app cases advantage using mobile phone need additional dedicated token users tend carry mobile devices around times sms broadly-adopted multi-factor authentication method consumer-facing accounts notwithstanding popularity sms verification security advocates publicly criticized july 2016 united states nist draft guideline proposed deprecating form authentication year later nist reinstated sms verification valid authentication channel finalized guideline 2016 2017 respectively google apple started offering user two-step authentication push notification alternative method security mobile-delivered security tokens fully depends mobile operator operational security easily breached wiretapping sim cloning national security agencies advances research two-factor authentication mobile devices consider different methods second factor implemented posing hindrance user continued use improvements accuracy mobile hardware gps microphone gyro/acceleromoter ability use second factor authentication becoming trustworthy example recording ambient noise user location mobile device comparing recording ambient noise computer room user trying authenticate one able effective second factor authentication also reduces amount time effort needed complete process payment card industry pci data security standard requirement 8.3 requires use mfa remote network access originates outside network card data environment cde beginning pci-dss version 3.2 use mfa required administrative access cde even user within trusted network second payment services directive require strong customer authentication electronic payments european economic area september 14 2019 details authentication federal employees contractors usa defined homeland security presidential directive 12 hspd-12 existing authentication methodologies involve explained three types basic factors authentication methods depend one factor difficult compromise single-factor methods regulatory standards access federal government systems require use multi-factor authentication access sensitive resources example logging network devices perform administrative tasks accessing computer using privileged login nist special publication 800-63-3 discusses various forms two-factor authentication provides guidance using business processes requiring different levels assurance 2005 united states federal financial institutions examination council issued guidance financial institutions recommending financial institutions conduct risk-based assessments evaluate customer awareness programs develop security measures reliably authenticate customers remotely accessing online financial services officially recommending use authentication methods depend one factor specifically user knows determine user identity response publication numerous authentication vendors began improperly promoting challenge-questions secret images knowledge-based methods multi-factor authentication due resulting confusion widespread adoption methods august 15 2006 ffiec published supplemental guidelineswhich states definition true multi-factor authentication system must use distinct instances three factors authentication defined use multiple instances single factor according proponents multi-factor authentication could drastically reduce incidence online identity theft online fraud victim password would longer enough give thief permanent access information however many multi-factor authentication approaches remain vulnerable phishing man-in-the-browser man-in-the-middle attacks multi-factor authentication may ineffective modern threats like atm skimming phishing malware may 2017 o2 telef\u00f3nica german mobile service provider confirmed cybercriminals exploited ss7 vulnerabilities bypass sms based two-step authentication unauthorized withdrawals users bank accounts criminals first infected account holder computers attempt steal bank account credentials phone numbers attackers purchased access fake telecom provider set-up redirect victim phone number handset controlled finally attackers logged victims online bank accounts requested money accounts withdrawn accounts owned criminals sms passcodes routed phone numbers controlled attackers criminals transferred money many multi-factor authentication products require users deploy client software make multi-factor authentication systems work vendors created separate installation packages network login web access credentials vpn connection credentials products may four five different software packages push client pc order make use token smart card translates four five packages version control performed four five packages check conflicts business applications access operated using web pages possible limit overheads outlined single application multi-factor authentication solutions virtual tokens hardware token products software must installed end users drawbacks multi-factor authentication keeping many approaches becoming widespread consumers difficulty keeping track hardware token usb plug many consumers technical skills needed install client-side software certificate generally multi-factor solutions require additional investment implementation costs maintenance hardware token-based systems proprietary vendors charge annual fee per user deployment hardware tokens logistically challenging hardware tokens may get damaged lost issuance tokens large industries banking even within large enterprises needs managed addition deployment costs multi-factor authentication often carries significant additional support costs 2008 survey 120 u.s. credit unions credit union journal reported support costs associated two-factor authentication report software certificates software toolbar approaches reported highest support costs research deployments multi-factor authentication schemes shown one elements tends impact adoption systems line business organization deploys multi-factor authentication system examples cited include u.s. federal government employs elaborate system physical tokens backed robust public key infrastructure well private banks tend prefer multi-factor authentication schemes customers involve accessible less expensive means identity verification app installed onto customer-owned smartphone despite variations exist among available systems organizations may choose multi-factor authentication system deployed within organization tends remain place users invariably acclimate presence use system embrace time normalized element daily process interaction relevant information system 2013 kim dotcom claimed invented two-factor authentication 2000 patent briefly threatened sue major web services however european patent office revoked patent light earlier 1998 us patent held several popular web services employ multi-factor authentication usually optional feature deactivated default many internet services among google amazon aws use open time-based one-time password algorithm totp support two-step authentication", + "neighbors": [ + 11, + 141, + 144, + 149, + 293, + 310, + 338, + 379, + 439, + 479, + 517, + 518, + 528, + 576, + 646, + 692, + 698, + 703, + 739, + 740, + 750, + 762, + 800, + 898, + 1019, + 1039, + 1090, + 1112, + 1303, + 1325, + 1355, + 1361, + 1368, + 1379, + 1472, + 1534, + 1576 + ], + "mask": "Test" + }, + { + "node_id": 1586, + "label": 4, + "text": "Microsoft_Forefront_Unified_Access_Gateway:microsoft forefront unified access gateway microsoft forefront unified access gateway uag software suite provides secure remote access corporate networks remote employees business partners services include reverse proxy virtual private network vpn directaccess remote desktop services uag released 2010 successor microsoft intelligent application gateway iag released 2007 uag part microsoft forefront offering microsoft discontinued product 2014 although web application proxy feature windows server 2012 r2 later offers functionalities web application proxy direct feature-for-feature replacement companies like portsys f5 offer direct migration paths uag deployments unified access gateway originally developed startup company named whale communications rosh haayin israel one challenges tried solve 1990s develop remote access solution based vpn mechanism without direct network access remote client corporate network type solution specifically required israeli military government meet national information security standards technology developed called air gap communication external network internal network managed two separate 1u rack-mount servers linked together memory bank accessed scsi interface 18 may 2006 microsoft announced would acquiring whale communications microsoft completed acquisition 26 july 2006 following acquisition product renamed microsoft intelligent application gateway server 2007 version scsi-based air gap dropped product unified single-server appliance instead using air gap security barrier iag used microsoft isa server firewall product iag offered public pre-installed appliance celestix networks ivo networks portsys nappliance 2009 release service pack 2 iag product also offered directly public microsoft form virtual appliance pre-installed vhd could run hyper-v vmware workstation april 2008 microsoft announced next generation iag named forefront unified access gateway product released 24 december 2009 service pack 1 product released 3 december 2010 update 1 service pack 1 released 17 october 2011 service pack 2 product released 6 august 2011 service pack 3 released 19 february 2013 service pack 4 released 27 november 2013 17 december microsoft announced microsoft deliver future full version releases forefront uag product removed price lists 1 july 2014 microsoft uag provides secure socket layer ssl virtual private network vpn web application firewall endpoint security management compliance security enable access control authorization content inspection wide variety line-of-business applications included customized granular access policy security capabilities microsoft exchange server 2003 2007 2010 microsoft sharepoint portal server 2003 2007 2010 microsoft terminal services citrix presentation server product highly customizable almost application published uag box uag server able work many authentication vendors mi-token rsa security onespan gridsure swivel activcard aladdin also works numerous authentication systems protocols active directory radius ldap ntlm lotus domino pki tacacs+ possible customizations include single-sign-on sso well look-and-feel dynamic customization current release uag update 2 product also offers support many third-party systems linux macintosh iphone product also supports mozilla firefox uag performs particularly well providing portal web applications web-based email intranets also provides full ssl vpn network access using either activex using internet explorer java components using firefox opera non windows client red hat mac os components also perform end-point compliance checks allowing access test attributes pc domain name antivirus definitions date running processes inclusion directaccess uag big influence success directaccess provides seamless vpn-like integration high-demand many organizations directaccess part windows uag provides user-friendly configuration interface making easier configure administrators uag also adds two additional components dns64 nat64 make deploying directaccess existing network easier without need deploy ipv6 product sold appliance form vendors ivo networks portsys celestix networks nappliance also offered installable dvd product installed windows server 2008 r2", + "neighbors": [ + 134, + 270, + 317, + 333, + 359, + 542, + 813, + 1109, + 1114, + 1138, + 1228, + 1363, + 1373, + 1417, + 1507, + 1533 + ], + "mask": "Test" + }, + { + "node_id": 1587, + "label": 4, + "text": "Traceroute:traceroute computing codice_1 codice_2 computer network diagnostic commands displaying route path measuring transit delays packets across internet protocol ip network history route recorded round-trip times packets received successive host remote node route path sum mean times hop measure total time spent establish connection traceroute proceeds unless three sent packets lost twice connection lost route evaluated ping hand computes final round-trip times destination point internet protocol version 6 ipv6 tool sometimes name traceroute6 tracert6 command codice_1 available many modern operating systems unix-like systems freebsd macos linux available command line tool traceroute also graphically accessible macos within network utilities suite microsoft windows reactos provide program named codice_2 performs route-tracing function windows nt-based operating systems also provide pathping similar functionality reactos version developed ged murphy licensed gpl unix-like operating systems traceroute sends default sequence user datagram protocol udp packets destination port numbers ranging 33434 33534 implementations traceroute shipped linux freebsd netbsd openbsd dragonfly bsd macos include option use icmp echo request packets -i arbitrary protocol -p udp tcp using tcp syn packets icmp windows tracert sends icmp echo request packets rather udp packets traceroute sends default time-to-live ttl value also known hop limit used determining intermediate routers traversed towards destination traceroute sends packets ttl values gradually increase packet packet starting ttl value one routers decrement ttl values packets one routing discard packets whose ttl value reached zero returning icmp error message icmp time exceeded first set packets first router receives packet decrements ttl value drops packet ttl value zero router sends icmp time exceeded message back source next set packets given ttl value two first router forwards packets second router drops replies icmp time exceeded proceeding way traceroute uses returned icmp time exceeded messages build list routers packets traverse destination reached returns icmp destination unreachable message udp packets used icmp echo reply message icmp echo messages used timestamp values returned router along path delay latency values typically measured milliseconds packet sender expects reply within specified number seconds packet acknowledged within expected interval asterisk displayed internet protocol require packets take route towards particular destination thus hosts listed might hosts packets traversed host hop n reply hop skipped output network firewall operates windows unix-like systems one protocol must enabled inbound firewall traceroute work receive replies traceroute implementations use tcp packets tcptraceroute layer four traceroute pathping utility introduced windows nt combines ping traceroute functionality mtr enhanced version icmp traceroute available unix-like windows systems various implementations traceroute rely icmp time exceeded type 11 packets sent source linux tracepath utility similar traceroute primary difference requiring superuser privileges cisco implementation traceroute also uses sequence udp datagrams incrementing ttl values invalid port number remote host default udp port 33434 used extended version command known extended traceroute command change destination port number used udp probe messages implementations include least options specify number queries send per hop time wait response hop limit port use invoking traceroute specified options displays list available options man traceroute presents details including displayed error flags simple example linux example selected options wait three seconds instead five send one query hop instead three limit maximum number hops 16 giving instead 30 example.com final host help identify incorrect routing table definitions firewalls may blocking icmp traffic high port udp unix ping site note firewall may permit icmp packets permit packets protocols traceroute also used penetration testers gather information network infrastructure ip ranges around given host also used downloading data multiple mirrors available piece data one trace mirror get good idea mirror would fastest use traceroute manual page states original traceroute program written van jacobson 1987 suggestion steve deering particularly cogent suggestions fixes c. philip wood tim seaver ken adelman author ping program mike muuss states website traceroute written using kernel icmp support earlier coded enable raw icmp sockets first wrote ping program traceroute limitations well known taken account using tool example traceroute discover paths router level interface level another limitation appears routers respond probes routers limit icmp responses presence traffic load balancing traceroute may indicate path actually exist minimize problem traceroute modification called paris-traceroute maintains flow identifier probes avoid load balancing", + "neighbors": [ + 134, + 255, + 295, + 377, + 615, + 678, + 757, + 764, + 769, + 771, + 816, + 904, + 920, + 961, + 1030, + 1042, + 1045, + 1050, + 1110, + 1138, + 1200, + 1243, + 1287, + 1370, + 1374, + 1461, + 1517, + 1552 + ], + "mask": "Train" + }, + { + "node_id": 1588, + "label": 9, + "text": "NewLISP:newlisp newlisp scripting language dialect lisp family programming languages designed developed lutz mueller newlisp free open-source software released gnu general public license version 3 later newlisp design influenced two main lisp dialects common lisp scheme languages like pascal c. newlisp originated 1991 originally developed sun-4 workstation later moved windows 3.0 version 1.3 released compuserve around 1993 became available windows graphical user interface gui graphics-capable application dos console application 16-bit 1995 release windows 95 newlisp moved 32-bit april 1999 newlisp ported linux core algorithms rewritten windows-specific code removed newlisp released open-source software project licensed gpl development windows stopped version 6.0.25 first half 2001 newlisp ported back windows cygwin platform without graphics abilities second half 2001 cross-platform tcl/tk frontend named newlisp-tk released around version 6.3.0 2006 64-bit precision introduced integer arithmetic operations files version 9.0 since release 6.5 mid-2002 development active many new features added newlisp attempts provide fast powerful cross-platform full-featured scripting version language lisp using modest system resources data storage e.g. disk space memory provides lisp features lists symbol processing function mapping anonymous functions lambda expressions s-expressions excluding improper lists macros also provides functions expected modern scripting language including supporting regular expressions xml unicode utf-8 networking via transmission control protocol tcp internet protocol ip user datagram protocol udp matrix array processing advanced math statistics bayesian statistical analysis mathematical finance distributed computing newlisp runs operating systems berkeley software distribution bsd linux macos solaris windows supports mysql sqlite odbc database access common gateway interface cgi simple mail transfer protocol smtp post office protocol pop 3 file transfer protocol ftp xml remote procedure call xml-rpc run server mode daemon newlisp supports namespaces termed contexts assigned variables passed functions associated globally unique symbols limiting use first-class citizens objects prototype-based object-oriented style programming possible newlisp using contexts prototypes construct objects variables inside contexts interfere variables name contexts inside context variables behave according rules dynamic scoping newlisp uses dynamic scoping function called function see variables caller caller caller within context namespace supports explicitly implicitly defined local dynamic variables shadow variables name outer environment thus preventing accidental use change variables caller environment parameter variables called function automatically shadow caller variable environment globally variables grouped separate namespaces newlisp uses method automatic memory management different traditional garbage collection schemes termed one reference oro memory management variable referenced context context referenced globally sharing subobjects among objects cyclic structures multiple variables pointing object unsupported newlisp objects copied stored data structures passed functions except certain built-in functions exceptions symbols contexts shared instead copied thus used indirection symbols contexts globally named deleted explicitly deleting symbol context scans objects replace references codice_1 newlisp graphical user interface gui server newlisp-gs java-based internet protocol suite tcp/ip server providing graphical programming interface newlisp-gs based development environment included newlisp binary distributions gtk-server opengl tcl/tk-based programming interfaces available newlisp version allows building executable files portable applications deployment self-contained need installing newlisp import function allows importing functions dynamic-link library dll windows api win32 shared library linux unix web frameworks available newlisp include dragonfly rockets", + "neighbors": [ + 27, + 29, + 46, + 56, + 117, + 134, + 173, + 194, + 203, + 251, + 272, + 292, + 306, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 536, + 565, + 601, + 627, + 649, + 653, + 693, + 753, + 771, + 779, + 782, + 787, + 795, + 796, + 815, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1221, + 1227, + 1245, + 1251, + 1277, + 1298, + 1301, + 1315, + 1324, + 1375, + 1385, + 1389, + 1395, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1552, + 1582, + 1609, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1589, + "label": 2, + "text": "Windows_DreamScene:windows dreamscene windows dreamscene utility allows videos .gif optimized animations used desktop wallpapers one windows ultimate extras windows vista prior official announcement dreamscene rumored creation names motion desktop borealis several months testing final version released september 25 2007 rendered content included dreamscene animated realization windows aurora background produced stardock photographic content provided discovery channel third-party video content mpeg wmv format may also used addition avi files played altering file extension additionally partnership dell microsoft released separate dreamscene alongside product red version ultimate edition windows vista one purported advantages dreamscene previous methods desktop animation makes use gpu display instead cpu leaving latter free perform user tasks extent achieved specified full-screen program run game window maximized video automatically stop since video seen means uses less gpu cpu video also stopped manually content encoders need strive balance compression file size decompression requires cpu larger files take memory may cause disk accessed frequently running video background would significant impact battery life mobile computers whether rendered gpu dreamscene may display static background computer running batteries software relies heavily desktop window manager dwm part windows aero stardock offers chargeable add-on windows dreamscene called deskscapes software allows implementation dynamic wallpapers .dream files released new version 3.5 makes program compatible non-ultimate editions vista newer versions windows 7 8 windows 7 dreamscene replaced desktop slideshow feature produces slideshow background wallpapers support videos however still enabled via third-party tools", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 211, + 262, + 270, + 278, + 295, + 312, + 326, + 344, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 989, + 1025, + 1092, + 1098, + 1138, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1503, + 1531, + 1533, + 1545, + 1547, + 1561, + 1613, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1590, + "label": 1, + "text": "Resources,_events,_agents_(accounting_model):resources events agents accounting model resources events agents rea model accounting system re-engineered computer age rea originally proposed 1982 william e. mccarthy generalized accounting model contained concepts resources events agents mccarthy 1982 rea popular model teaching accounting information systems ais rare business practice companies easily dismantle legacy data warehouse systems unwilling workday inc. ibm scalable architecture financial reporting reatechnology iso 15944-4 exceptions fallon polovina 2013 however shown rea also add value modelling current erp business processes providing tool increases understanding implementation underlying data model rea model gets rid many accounting objects necessary computer age visible debits credits\u2014double-entry bookkeeping disappears rea system many general ledger accounts also disappear least persistent objects e.g. accounts receivable accounts payable computer generate accounts real time using source document records rea treats accounting system virtual representation actual business words creates computer objects directly represent real-world-business objects computer science terms rea ontology real objects included rea model objects contrast conventional accounting terms asset liability less directly tied real-world objects example conventional accounting asset goodwill rea resource separate rea model business process company business process roughly corresponds functional department function michael porter value chain examples business processes would sales purchases conversion manufacturing human resources financing heart rea model usually pair events linked exchange relationship typically referred duality relation one events usually represents resource given away lost represents resource received gained example sales process one event would sales \u2014where goods given up\u2014and would cash receipt cash received two events linked cash receipt occurs exchange sale vice versa duality relationship complex e.g. manufacturing process would often involve two events see dunn et al 2004 examples rea systems usually modeled relational databases entity-relationship diagrams though compulsory philosophy rea draws idea reusable design patterns though rea patterns used describe databases rather object oriented programs quite different 23 canonical patterns original designs pattern book gamma et al research rea emphasizes patterns e.g. hruby et al 2006 example basic rea pattern shown e-r diagram pattern extended encompass commitments promises engage transactions e.g. sales order policies constructs dunn et al 2004 provide good overview undergraduate level accounting majors hruby et al 2006 advanced reference computer scientists diagram extended rea pattern hruby et al 2006 rea continuing influence electronic commerce standard ebxml w. mccarthy actively involved standards committee competing xbrl gl standard however odds rea concept closely mimics double-entry book-keeping rea recognised open group og within togaf\u00ae standard industry standard enterprise framework one modelling tools useful modelling business processes sensorica world first open value network ovn specialized open innovation peer production hardware uses rea model basis network resource planning contribution/value accounting system nrp-vas nrp-vas created bob haugen collaboration sensorica ovn", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1591, + "label": 3, + "text": "Apple_A10X:apple a10x apple a10x fusion 64-bit arm-based system chip soc designed apple inc. manufactured tsmc first appeared 10.5 ipad pro second-generation 12.9 ipad pro announced june 5 2017 a10x variant a10 apple claims 30 percent faster cpu performance 40 percent faster gpu performance predecessor a9x a10x features apple-designed 64-bit 2.38 ghz armv8-a six-core cpu three high-performance hurricane cores three energy-efficient zephyr cores a10x also integrates twelve-core graphics processing unit gpu appears apple customized imagination powervr cores used a10 embedded a10x m10 motion coprocessor built tsmc 10 nm finfet process die size 96.4mm a10x 34 smaller a9x smallest ipad soc a10x first tsmc 10nm chip used consumer device a10x paired 4 gb lpddr4 memory second-generation 12.9 ipad pro 10.5 ipad pro 3 gb 4k apple tv", + "neighbors": [ + 33, + 71, + 75, + 99, + 112, + 130, + 214, + 228, + 252, + 269, + 270, + 345, + 356, + 394, + 403, + 477, + 489, + 511, + 551, + 596, + 607, + 610, + 625, + 634, + 681, + 696, + 853, + 858, + 877, + 917, + 927, + 945, + 956, + 972, + 988, + 1001, + 1069, + 1100, + 1140, + 1147, + 1176, + 1178, + 1215, + 1237, + 1262, + 1273, + 1292, + 1294, + 1305, + 1334, + 1339, + 1373, + 1409, + 1488, + 1496, + 1503, + 1518, + 1544 + ], + "mask": "Test" + }, + { + "node_id": 1592, + "label": 7, + "text": "Euphoria_(software):euphoria software euphoria game animation engine created naturalmotion based dynamic motion synthesis naturalmotion proprietary technology animating 3d characters on-the-fly based full simulation 3d character including body muscles motor nervous system instead using predefined animations characters actions reactions synthesized real-time different every time even replaying scene common current video games use limp ragdolls animations generated fly euphoria employs complex method animate entirety physically bound objects within game environment engine used indiana jones game since cancelled according web site euphoria runs microsoft windows os x linux playstation 3 playstation 4 xbox 360 xbox one ios android platforms compatible commercial physics engines press release enclosed second trailer eventually confirmed grand theft auto iv first rockstar games feature euphoria red dead redemption second game use engine star wars titles force unleashed ii use euphoria games based rockstar advanced game engine rage including grand theft auto v euphoria integrated source code rage", + "neighbors": [ + 134, + 416, + 468, + 718, + 839, + 961, + 976, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 1593, + "label": 9, + "text": "BASIC_A+:basic a+ basic a+ developed optimized systems software cupertino california united states provide atari 8-bit family extended basic compatible faster simpler rom-based atari basic atari basic came 8 kb rom cartridge basic a+ delivered floppy disk took 15 kb computer ram leaving 23 kb available user programs 48 kb atari 800 basic a+ offered price us 80.00 1983 including products os/a+ easmd editor/assembler extension atari basic came supplement latter reference manual documentation addition faster rom-bound counterpart basic a+ provided number extra commands dos operations player/missile graphics debugging", + "neighbors": [ + 0, + 236, + 273, + 510, + 606, + 670, + 810, + 812, + 843, + 1034, + 1037, + 1050, + 1079, + 1138, + 1156, + 1204, + 1306, + 1390, + 1584 + ], + "mask": "Test" + }, + { + "node_id": 1594, + "label": 4, + "text": "Device_fingerprint:device fingerprint device fingerprint machine fingerprint browser fingerprint information collected remote computing device purpose identification fingerprints used fully partially identify individual users devices even persistent cookies also zombie cookies ca n't read stored browser client ip address hidden even one switches another browser device may allow remote application detect prevent online identity theft credit card fraud also compile long-term records individuals browsing histories even 're attempting avoid tracking raising major concern internet privacy advocates computer security experts consider ease bulk parameter extraction offered web browsers security hole basic web browser configuration information long collected web analytics services effort accurately measure real human web traffic discount various forms click fraud assistance client-side scripting languages collection much esoteric parameters possible assimilation information single string comprises device fingerprint 2010 electronic frontier foundation launched website visitors test browser fingerprint collecting sample 470161 fingerprints measured least 18.1 bits entropy possible browser fingerprinting advancements canvas fingerprinting claims add another 5.7 bits firefox provides feature protect browser fingerprinting since 2015 version 41 july 2018 still experimental disabled default wwdc 2018 apple announced safari macos mojave presents simplified system information users browse web preventing tracked based system configuration motivation device fingerprint concept stems forensic value human fingerprints ideal case web client machines would different fingerprint value diversity value would never change stability assumptions would possible uniquely distinguish machines network without explicit consent users practice neither diversity stability fully attainable improving one tendency adversely impact fingerprinting methods range passive active passive fingerprinting refers techniques involve obvious querying client machine methods rely upon precise classification factors client tcp/ip configuration os fingerprint ieee 802.11 wireless settings hardware clock skew active fingerprinting assumes client tolerate degree invasive querying active method installation executable code directly client machine code may access attributes typically available means mac address unique serial numbers assigned machine hardware data useful fingerprinting programs employ digital rights management passive collection device attributes web-browser layer may occur several osi model layers normal operation various network protocols transmit broadcast packets headers one may infer client configuration parameters sorted layer examples protocols collection device fingerprints web clients browser software relies availability javascript similar client-side scripting language harvesting suitably large number parameters two classes users limited clientside scripting mobile devices running privacy software browser extensions block ads trackers separate issue single device may multiple web clients installed even multiple virtual operating systems distinct client operating system distinct internal parameters one may change device fingerprint simply running different browser machine unless new crossbrowser fingerprinting technique used furthermore sandboxed devices like iphone exhibit little uniqueness fingerprinting techniques involving technical information device browser font list sufficient create unique fingerprint", + "neighbors": [ + 379, + 455, + 509, + 531, + 757, + 769, + 780, + 1042, + 1138, + 1332, + 1373, + 1552, + 1570 + ], + "mask": "Test" + }, + { + "node_id": 1595, + "label": 8, + "text": "Acadine_Technologies:acadine technologies acadine technologies holdings limited systems software company specializing mobile operating systems mobile wearable internet things iot devices core product h5os web-centric operating system primarily based open web standard html5 derived firefox os whose development company founder li gong overseen president mozilla corporation acadine technologies founded march 25 2015 based hong kong operations beijing taipei palo alto london initially started name gone fishing startup recruited various staff mozilla apart gong including james ho former mozilla cto andreas gal employees mozilla taiwan mozilla announced december 2015 would cease efforts partner mobile carriers use firefox os smartphones reported acadine would take mission h5os released first version h5os 17th feb 2016 announced july 15 2015 acadine technologies received 100m first-round funding tsinghua unigroup international hong kong entity controlled tsinghua university chinese government year li gong stated company already seeking second round funding international investors main rationale dispel early incorrect perception somehow china-backed company really pure silicon valley-style startup april 27 2016 reported funds tsinghua unigroup transferred acadine started reorganization h5os discontinued may 2016 never publicly released", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1596, + "label": 7, + "text": "MapReduce:mapreduce mapreduce programming model associated implementation processing generating big data sets parallel distributed algorithm cluster mapreduce program composed map procedure method performs filtering sorting sorting students first name queues one queue name reduce method performs summary operation counting number students queue yielding name frequencies mapreduce system also called infrastructure framework orchestrates processing marshalling distributed servers running various tasks parallel managing communications data transfers various parts system providing redundancy fault tolerance model specialization split-apply-combine strategy data analysis inspired map reduce functions commonly used functional programming although purpose mapreduce framework original forms key contributions mapreduce framework actual map reduce functions example resemble 1995 message passing interface standard reduce scatter operations scalability fault-tolerance achieved variety applications optimizing execution engine single-threaded implementation mapreduce usually faster traditional non-mapreduce implementation gains usually seen multi-threaded implementations multi-processor hardware use model beneficial optimized distributed shuffle operation reduces network communication cost fault tolerance features mapreduce framework come play optimizing communication cost essential good mapreduce algorithm mapreduce libraries written many programming languages different levels optimization popular open-source implementation support distributed shuffles part apache hadoop name mapreduce originally referred proprietary google technology since genericized 2014 google longer using mapreduce primary big data processing model development apache mahout moved capable less disk-oriented mechanisms incorporated full map reduce capabilities mapreduce framework processing parallelizable problems across large datasets using large number computers nodes collectively referred cluster nodes local network use similar hardware grid nodes shared across geographically administratively distributed systems use heterogeneous hardware processing occur data stored either filesystem unstructured database structured mapreduce take advantage locality data processing near place stored order minimize communication overhead mapreduce framework system usually composed three operations steps mapreduce allows distributed processing map reduction operations maps performed parallel provided mapping operation independent others practice limited number independent data sources and/or number cpus near source similarly set 'reducers perform reduction phase provided outputs map operation share key presented reducer time reduction function associative process often appears inefficient compared algorithms sequential multiple instances reduction process must run mapreduce applied significantly larger datasets single commodity server handle \u2013 large server farm use mapreduce sort petabyte data hours parallelism also offers possibility recovering partial failure servers storage operation one mapper reducer fails work rescheduled \u2013 assuming input data still available another way look mapreduce 5-step parallel distributed computation five steps logically thought running sequence \u2013 step starts previous step completed \u2013 although practice interleaved long final result affected many situations input data might already distributed sharded among many different servers case step 1 could sometimes greatly simplified assigning map servers would process locally present input data similarly step 3 could sometimes sped assigning reduce processors close possible map-generated data need process map reduce functions mapreduce defined respect data structured key value pairs map takes one pair data type one data domain returns list pairs different domain codice_3 \u2192 codice_4 map function applied parallel every pair keyed codice_5 input dataset produces list pairs keyed codice_6 call mapreduce framework collects pairs key codice_6 lists groups together creating one group key reduce function applied parallel group turn produces collection values domain codice_8 \u2192 codice_9 reduce call typically produces either one value v3 empty return though one call allowed return one value returns calls collected desired result list thus mapreduce framework transforms list key value pairs list values behavior different typical functional programming map reduce combination accepts list arbitrary values returns one single value combines values returned map necessary sufficient implementations map reduce abstractions order implement mapreduce distributed implementations mapreduce require means connecting processes performing map reduce phases may distributed file system options possible direct streaming mappers reducers mapping processors serve results reducers query canonical mapreduce example counts appearance word set documents document split words word counted map function using word result key framework puts together pairs key feeds call reduce thus function needs sum input values find total appearances word another example imagine database 1.1 billion people one would like compute average number social contacts person according age sql query could expressed using mapreduce k1 key values could integers 1 1100 representing batch 1 million records k2 key value could person age years computation could achieved using following functions mapreduce system would line 1100 map processors would provide corresponding 1 million input records map step would produce 1.1 billion n,1 records values ranging say 8 103 mapreduce system would line 96 reduce processors performing shuffling operation key/value pairs due fact need average per age provide millions corresponding input records reduce step would result much reduced set 96 output records would put final result file sorted count info record important processing reduced one time add count records computed average would wrong example reduce files 1 2 new file average 9 contacts 10-year-old person 9+9+9+9+9 /5 reduce file 3 lose count many records 've already seen end average 9.5 contacts 10-year-old person 9+10 /2 wrong correct answer 9.166 55 6 9*3+9*2+10*1 3+2+1 software framework architecture adheres open-closed principle code effectively divided unmodifiable frozen spots extensible hot spots frozen spot mapreduce framework large distributed sort hot spots application defines input reader divides input appropriate size 'splits practice typically 64 mb 128 mb framework assigns one split map function input reader reads data stable storage typically distributed file system generates key/value pairs common example read directory full text files return line record map function takes series key/value pairs processes generates zero output key/value pairs input output types map often different application word count map function would break line words output key/value pair word output pair would contain word key number instances word line value map function output allocated particular reducer application partition function sharding purposes partition function given key number reducers returns index desired reducer typical default hash key use hash value modulo number reducers important pick partition function gives approximately uniform distribution data per shard load-balancing purposes otherwise mapreduce operation held waiting slow reducers finish i.e reducers assigned larger shares non-uniformly partitioned data map reduce stages data shuffled parallel-sorted exchanged nodes order move data map node produced shard reduced shuffle sometimes take longer computation time depending network bandwidth cpu speeds data produced time taken map reduce computations input reduce pulled machine map ran sorted using application comparison function framework calls application reduce function unique key sorted order reduce iterate values associated key produce zero outputs word count example reduce function takes input values sums generates single output word final sum output writer writes output reduce stable storage mapreduce programs guaranteed fast main benefit programming model exploit optimized shuffle operation platform write map reduce parts program practice author mapreduce program however take shuffle step consideration particular partition function amount data written map function large impact performance scalability additional modules combiner function help reduce amount data written disk transmitted network mapreduce applications achieve sub-linear speedups specific circumstances designing mapreduce algorithm author needs choose good tradeoff computation communication costs communication cost often dominates computation cost many mapreduce implementations designed write communication distributed storage crash recovery tuning performance mapreduce complexity mapping shuffle sorting grouping key reducing taken account amount data produced mappers key parameter shifts bulk computation cost mapping reducing reducing includes sorting grouping keys nonlinear complexity hence small partition sizes reduce sorting time trade-off large number reducers may impractical influence split unit size marginal unless chosen particularly badly say 1mb gains mappers reading load local disks average minor processes complete quickly data fits main memory single machine small cluster using mapreduce framework usually effective since frameworks designed recover loss whole nodes computation write interim results distributed storage crash recovery expensive pays computation involves many computers long runtime computation task completes seconds restarted case error likelihood least one machine failing grows quickly cluster size problems implementations keeping data memory simply restarting computation node failures \u2014when data small enough\u2014 non-distributed solutions often faster mapreduce system mapreduce achieves reliability parceling number operations set data node network node expected report back periodically completed work status updates node falls silent longer interval master node similar master server google file system records node dead sends node assigned work nodes individual operations use atomic operations naming file outputs check ensure parallel conflicting threads running files renamed possible also copy another name addition name task allowing side-effects reduce operations operate much way inferior properties regard parallel operations master node attempts schedule reduce operations node rack node holding data operated property desirable conserves bandwidth across backbone network datacenter implementations necessarily highly reliable example older versions hadoop namenode single point failure distributed filesystem later versions hadoop high availability active/passive failover namenode mapreduce useful wide range applications including distributed pattern-based searching distributed sorting web link-graph reversal singular value decomposition web access log stats inverted index construction document clustering machine learning statistical machine translation moreover mapreduce model adapted several computing environments like multi-core many-core systems desktop grids multi-cluster volunteer computing environments dynamic cloud environments mobile environments high-performance computing environments google mapreduce used completely regenerate google index world wide web replaced old ad hoc programs updated index ran various analyses development google since moved technologies percolator flumejava millwheel offer streaming operation updates instead batch processing allow integrating live search results without rebuilding complete index mapreduce stable inputs outputs usually stored distributed file system transient data usually stored local disk fetched remotely reducers david dewitt michael stonebraker computer scientists specializing parallel databases shared-nothing architectures critical breadth problems mapreduce used called interface low-level questioned whether really represents paradigm shift proponents claimed challenged mapreduce proponents claims novelty citing teradata example prior art existed two decades also compared mapreduce programmers codasyl programmers noting writing low-level language performing low-level record manipulation mapreduce use input files lack schema support prevents performance improvements enabled common database system features b-trees hash partitioning though projects pig piglatin sawzall apache hive ysmart hbase bigtable addressing problems greg jorgensen wrote article rejecting views jorgensen asserts dewitt stonebraker entire analysis groundless mapreduce never designed intended used database dewitt stonebraker subsequently published detailed benchmark study 2009 comparing performance hadoop mapreduce rdbms approaches several specific problems concluded relational databases offer real advantages many kinds data use especially complex processing data used across enterprise mapreduce may easier users adopt simple one-time processing tasks mapreduce programming paradigm also described danny hillis 1985 thesis widely-used time program connection machine special hardware support accelerate map reduce google granted patent mapreduce however claims patent granted mapreduce similar existing products example map reduce functionality easily implemented oracle pl/sql database oriented language supported developers transparently distributed database architectures clusterpoint xml database mongodb nosql database mapreduce tasks must written acyclic dataflow programs i.e stateless mapper followed stateless reducer executed batch job scheduler paradigm makes repeated querying datasets difficult imposes limitations felt fields machine learning iterative algorithms revisit single working set multiple times norm", + "neighbors": [ + 14, + 24, + 41, + 131, + 176, + 178, + 182, + 216, + 318, + 422, + 429, + 480, + 502, + 547, + 553, + 559, + 671, + 704, + 775, + 777, + 837, + 936, + 962, + 1028, + 1061, + 1082, + 1129, + 1185, + 1254, + 1259, + 1265, + 1310, + 1320, + 1371, + 1411, + 1419, + 1454, + 1480, + 1500 + ], + "mask": "Validation" + }, + { + "node_id": 1597, + "label": 4, + "text": "HTTP_Strict_Transport_Security:http strict transport security http strict transport security hsts web security policy mechanism helps protect websites protocol downgrade attacks cookie hijacking allows web servers declare web browsers complying user agents interact using secure https connections never via insecure http protocol hsts ietf standards track protocol specified rfc 6797 hsts policy communicated server user agent via https response header field named nowiki strict-transport-security /nowiki hsts policy specifies period time user agent access server secure fashion website using hsts must never accept clear text http either connect http systematically redirect users https consequence user-agent capable tls able connect site anymore hsts specification published rfc 6797 19 november 2012 approved 2 october 2012 iesg publication proposed standard rfc authors originally submitted internet-draft 17 june 2010 conversion internet-draft specification name altered strict transport security sts http strict transport security specification applies http http response header field defined hsts specification however remains named strict-transport-security last so-called community version then-named sts specification published 18 december 2009 revisions based community feedback original draft specification jeff hodges paypal collin jackson adam barth published 18 september 2009 hsts specification based original work jackson barth described paper forcehttps protecting high-security web sites network attacks additionally hsts realization one facet overall vision improving web security put forward jeff hodges andy steingruebl 2010 paper need coherent web security policy framework server implements hsts policy supplying header https connection hsts headers http ignored example server could send header future requests domain next year max-age specified seconds 31,536,000 equal one non-leap year use https codice_1 web application issues hsts policy user agents conformant user agents behave follows nowiki rfc 6797 /nowiki hsts policy helps protect web application users passive eavesdropping active network attacks man-in-the-middle attacker greatly reduced ability intercept requests responses user web application server user browser hsts policy effect web application important security vulnerability hsts fix ssl-stripping man-in-the-middle attacks first publicly introduced moxie marlinspike 2009 blackhat federal talk new tricks defeating ssl practice ssl tls stripping attack works transparently converting secure https connection plain http connection user see connection insecure crucially way knowing whether connection secure many websites use tls/ssl therefore way knowing without prior knowledge whether use plain http due attack simply website n't implemented tls/ssl additionally warnings presented user downgrade process making attack fairly subtle vigilant marlinspike sslstrip tool fully automates attack hsts addresses problem informing browser connections site always use tls/ssl hsts header stripped attacker user first visit google chrome mozilla firefox internet explorer microsoft edge attempt limit problem including pre-loaded list hsts sites unfortunately solution scale include websites internet see limitations hsts also help prevent one cookie-based website login credentials stolen widely available tools firesheep hsts time limited sensitive attacks involving shifting victim computer time e.g using false ntp packets initial request remains unprotected active attacks uses insecure protocol plain http uri initial request obtained insecure channel applies first request activity period specified advertised hsts policy nowiki max-age /nowiki sites set period several days months depending user activity behavior google chrome mozilla firefox internet explorer/microsoft edge address limitation implementing hsts preloaded list list contains known sites supporting hsts list distributed browser uses https initial request listed sites well previously mentioned pre-loaded lists scale cover entire web potential solution might achieved using dns records declare hsts policy accessing securely via dnssec optionally certificate fingerprints ensure validity requires running validating resolver avoid last mile issues junade ali noted hsts ineffective use phony domains using dns-based attacks possible man-in-the-middle interceptor serve traffic artificial domain hsts preload list made possible dns spoofing attacks simply domain name misleadingly resembles real domain name www.example.org instead www.example.com even hsts preloaded list hsts ca n't prevent advanced attacks tls beast crime attacks introduced juliano rizzo thai duong attacks tls orthogonal hsts policy enforcement see discussion overall hsts security considerations hsts used near-indelibly tag visiting browsers recoverable identifying data supercookies persist browser incognito privacy modes creating web page makes multiple http requests selected domains example twenty browser requests twenty different domains used theoretically one million visitors distinguished 2 due resulting requests arriving via http vs. https latter previously recorded binary bits established earlier via hsts headers depending actual deployment certain threats e.g cookie injection attacks avoided following best practices", + "neighbors": [ + 88, + 172, + 235, + 260, + 261, + 319, + 533, + 539, + 542, + 554, + 576, + 692, + 826, + 1003, + 1089, + 1228, + 1240, + 1331, + 1395, + 1452, + 1453, + 1534, + 1597, + 1624 + ], + "mask": "Test" + }, + { + "node_id": 1598, + "label": 8, + "text": "Telemetry_(company):telemetry company telemetry independent online advertising security optimization firm offices london new york city january 2017 telemetry shut amid declining revenues telemetry founded 2009 anthony rushton russell irwin beau chesluk three began collaborating 2001 created branded online video games name jaildog launched online tv station wedigtv 2007 winning 2008 international interactive emmy award best international interactive tv network order get telemetry ground rushton irwin chesluk invested \u00a310,000 money within two years launch company valued \u00a3175 million telemetry system initially developed exclusively video embedding code online video record click-through mouse activity real-time 2012 company expanded display forms online advertising january 2017 telemetry shut amid declining revenues telemetry private company working independently online digital video advertisers agencies provide impartial detailed analytics auditing real time company tracks efficiency exposure gained online digital advertising campaigns order ensure accountability determine true value campaign exposing inflated reach impressions investigates whether ads delivered suitable website desired market alongside intended type content previously advertisers rely biased analytics vender essentially reporting traditional ad server statistics designed track online digital video advertising campaigns telemetry advised programmatic buying ads bought sold per-impression basis ways impressions counted set price misleading ads purchased pre-roll sometimes placed instead banner video ads typically muted viewer still counted pre-roll impressions telemetry encourages advertisers diligent demanding details placement quality ensure ads running proper space proper time impressions trading genuine impressions telemetry occasionally facing criticism bypassing media agencies selling digital ad space working advertisers directly according 2014 estimates interactive advertising bureau approximately 36 reported web traffic considered fake corresponding amount fake ad views due hijacked computers programmed visit sites cheating advertisers pay based number times ad loaded response visit telemetry exposed large frauds perpetrated online advertising landscape 2014 investigation verizon wireless online video advertising purchases finding excess 1 million spent fake web views telemetry advice verizon eighth-largest advertiser us demanded make-goods later 2014 telemetry investigated mercedes-benz online advertising campaign detecting suspicious traffic activity finding 57 campaign viewed often automated computer programs human beings mercedes refunded false impressions telemetry also brought public attention scheme ads forcefully injected onto popular sites including walmart.com youtube others third-party sellers without site owners knowledge profits going third party june 2014 telemetry uncovered ad fraud scheme going several months websites running lucrative video ads placed banner ads cheaper websites behind operation skimming around 10 million video ad revenue per month scheme affected 75 advertisers including mcdonald coca-cola ford rushton called significant instance ad fraud telemetry seen telemetry publicly called companies name unethically monetizing digital ads without site owner permission manipulating impressions often generating negative user experience telemetry clients include reckitt benckiser anheuser-busch unilever verizon wireless l'oreal mercedes-benz", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1599, + "label": 7, + "text": "Globus_Toolkit:globus toolkit globus toolkit open-source toolkit grid computing developed provided globus alliance 25 may 2017 announced open source support project would discontinued january 2018 due lack financial support work globus service continues available research community freemium approach designed sustain software features freely available restricted subscribers globus toolkit contains set libraries programs provides developers specific tools apps solutions common problems encountered creating distributed system services applications globus software components capabilities includes globus toolkit adheres provides implementations following standards globus toolkit implementations ogf-defined protocols provide following globus toolkit components supported ogf-defined saga c++/python api number tools function globus toolkit including xml-based web services offer way access diverse services applications distributed environment 2004 univa corporation began providing commercial support globus toolkit using business model similar red hat gram grid resource allocation manager component globus toolkit officially supports following job schedulers batch-queuing systems unofficial job schedulers used globus toolkit globus alliance announced release globus toolkit version 5 gt5 late 2009 major change abandoning gram4 although continuing support least december 2010 favor enhanced gram2 called gram5 solve scalability issues add features reliable file transfer rft service replaced new globus.org service globus.org online hosted service i.e. software-as-a-service provides higher-level end-to-end grid capabilities initially concentrating reliable high-performance fire-and-forget data transfer retain web-service functionality without technology standards considered obsolete new project called globus crux started expects release alpha version end 2009 monitoring discovery tasks currently performed mds taken new crux-based integrated information services iis releases iis planned sometime 2010 release gt 5.0.2 announced 19 july 2010 gt 5.0.3 reported due release february 2011", + "neighbors": [ + 25, + 134, + 195, + 274, + 300, + 362, + 390, + 399, + 507, + 760, + 802, + 847, + 1131, + 1138, + 1354 + ], + "mask": "Test" + }, + { + "node_id": 1600, + "label": 4, + "text": "Backup_and_disaster_recovery_appliance:backup disaster recovery appliance backup disaster recovery appliance also bdr appliance bdr specialized backup appliance includes backup software backup storage hypervisor support local disaster recovery appliance", + "neighbors": [ + 494, + 1289 + ], + "mask": "Validation" + }, + { + "node_id": 1601, + "label": 2, + "text": "Hyperbola_GNU/Linux-libre:hyperbola gnu/linux-libre hyperbola gnu/linux-libre operating system i686 x86-64 architectures based arch snapshots debian development includes gnu operating system components linux-libre kernel instead generic linux kernel hyperbola gnu/linux-libre listed free software foundation completely free operating system true free system distribution guidelines hyperbola born 17th annual f\u00f3rum internacional software livre porto alegre brazil 5 august 2017 support systemd dropped favor openrc default init system support init freedom campaign begun devuan 6 december 2018 hyperbola first brazilian distribution recognized completely free project gnu making part fsf list free distributions hyperbola established social contract hyperbola social contract commits project free software community free culture privacy stability follow arch-based system packaging yet principles stability development maintenance debian covenant included gnu free system distribution guidelines hyperbola established packaging guidelines hyperbola packaging guidelines contain collection common issues severity placed development backporting package releases debian patches hyperbola aliases stable releases using galaxy names codenames chosen list nearest known galaxies milky way ascending order distance stable version hyperbola gets released approximately every three years point releases available every months hyperbola release receive two years extra security updates end life eol however point releases made hyperbola release receive five years security support total two ways install hyperbola gnu/linux-libre either scratch using live images migrating existing arch-based system", + "neighbors": [ + 113, + 134, + 301, + 323, + 351, + 357, + 393, + 404, + 431, + 695, + 716, + 754, + 897, + 974, + 1046, + 1049, + 1055, + 1126, + 1167, + 1276, + 1286, + 1369, + 1415, + 1458, + 1539 + ], + "mask": "Test" + }, + { + "node_id": 1602, + "label": 2, + "text": "Open_Handset_Alliance:open handset alliance open handset alliance oha consortium 84 firms develop open standards mobile devices member firms include htc sony dell intel motorola qualcomm texas instruments google samsung electronics lg electronics t-mobile sprint corporation nvidia wind river systems oha established 5 november 2007 led google 34 members including mobile handset makers application developers mobile carriers chip makers android flagship software alliance first developed google 2007 based open-source license competed mobile platforms apple microsoft nokia symbian hp formerly palm samsung electronics intel tizen bada blackberry part efforts promote unified android platform oha members contractually forbidden producing devices based competing forks android time announcement formation open handset alliance november 5 2007 oha also unveiled android open-source mobile phone platform based linux kernel early look sdk released developers 12 november 2007 first commercially available phone running android htc dream also known t-mobile g1 approved federal communications commission fcc 18 august 2008 became available 22 october year members open handset alliance", + "neighbors": [ + 24, + 41, + 101, + 113, + 131, + 134, + 162, + 211, + 213, + 219, + 265, + 267, + 275, + 298, + 305, + 306, + 327, + 337, + 346, + 400, + 401, + 422, + 429, + 477, + 502, + 520, + 527, + 571, + 622, + 629, + 650, + 704, + 716, + 720, + 725, + 736, + 755, + 775, + 782, + 833, + 837, + 935, + 986, + 1018, + 1020, + 1051, + 1061, + 1082, + 1102, + 1140, + 1176, + 1183, + 1185, + 1193, + 1196, + 1202, + 1203, + 1208, + 1241, + 1276, + 1278, + 1310, + 1313, + 1325, + 1357, + 1360, + 1361, + 1373, + 1384, + 1391, + 1411, + 1415, + 1419, + 1456, + 1468, + 1480, + 1483, + 1500, + 1524, + 1526, + 1558, + 1569, + 1638 + ], + "mask": "Test" + }, + { + "node_id": 1603, + "label": 7, + "text": "RPR_FOM:rpr fom real-time platform reference federation object model rpr fom enables linking computer simulations discrete physical entities complex virtual worlds high-level architecture hla federation object model developed distributed simulation applications defense security rpr fom listed nato modelling simulation standards profile amsp-01 rpr fom provides backwards compatibility simulations using distributed interactive simulation dis standard standardized simulation interoperability standards organization siso siso-std-001-2015 standard consists two parts high-level architecture introduced us department defense 1996 rpr fom effort initiated facilitate migration dis hla rpr fom version 1.0 released 1998 supports capabilities dis version ieee 1278.1-1995 dis 5 standard provides fom supporting hla version 1.3 rpr fom version 2.0 released 2015 siso-std-001 rpr fom 2.0 supports capabilities dis version ieee 1278.1a-1998 dis 6 development rpr fom 2.0 started 2000 came halt 2007 resulting widely used draft version 17 work restarted 2012 finalized published standard 2015 standard provides foms supporting following hla versions 1.3 ieee 1516-2000 ieee 1516-2010 \u201c hla evolved \u201d modular monolithic formats rpr fom version 3.0 development started 2016 siso dis rpr fom product support group 2018 development handed dedicated product development group goal rpr fom version 3.0 support capabilities dis version ieee 1278.1-2012 dis 7 rpr fom defines information exchanged runtime number fom modules additional supporting modules include foundation module basic data types enumerations module enumerations like types platforms equipment base module commonly used data types generic object classes switches module runtime switches rti rpr fom related number standards", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1604, + "label": 5, + "text": "Mozilla_Thunderbird:mozilla thunderbird mozilla thunderbird free open-source cross-platform email client news client rss chat client developed mozilla foundation project strategy modeled mozilla firefox web browser installed default ubuntu desktop systems december 7 2004 version 1.0 released received 500,000 downloads first three days release 1,000,000 10 days july 6 2012 mozilla announced company dropping priority thunderbird development continuous effort extend thunderbird feature set mostly fruitless new development model shifted mozilla offering extended support releases deliver security maintenance updates allowing community take development new features december 1 2015 mozilla executive chair mitchell baker announced company-wide memo thunderbird development needs uncoupled firefox referred thunderbird developers spending large efforts responding changes mozilla technologies firefox paying tax support thunderbird development also said believe thunderbird potential industry-wide impact firefox time announced mozilla foundation provide least temporary legal financial home thunderbird project since memo 2015 mozilla brought thunderbird back in-house announcement may 9 2017 continues support development thunderbird development team also expanded adding several new members undergone overhaul security user-interface thunderbird email newsgroup news feed chat xmpp irc twitter client vanilla version originally personal information manager pim although mozilla lightning extension installed default adds pim functionality additional features needed often available via extensions thunderbird manage multiple email newsgroup news feed accounts supports multiple identities within accounts features quick search saved search folders virtual folders advanced message filtering message grouping labels help manage find messages linux-based systems system mail movemail accounts supported thunderbird provides basic support system-specific new email notifications extended advanced notification support using add-on thunderbird incorporates bayesian spam filter whitelist based included address book also understand classifications server-based filters spamassassin extensions allow addition features installation xpinstall modules known xpi zippy installation via add-ons website also features update functionality update extensions thunderbird supports variety themes changing overall look feel packages css image files downloaded via add-ons website mozilla add-ons thunderbird follows industry standards email web feeds e.g news aggregators atom rss thunderbird follows internet protocols evolve example ircv3.1 n't support ircv3.2 usenet news groups offer latest nntps see thunderbird provides mailbox format support using plugins feature yet enabled due related work progress mailbox formats supported thunderbird also uses mork since version 3 mozstorage based sqlite internal database mork due replaced mozstorage thunderbird 3.0 8.0 release still uses mork file format current version seamonkey version 2.14.1 also still uses mork indexes pop imap mail folders least since version 38 thunderbird integrated support automatic linking large files instead attaching directly mail message insert menu provides ability include html code thus one insert subscripts degree symbol \u00b0 etc. message composed software may limitations number sizes files objects represented example pop3 folders subject filesystem design limitations maximum file sizes filesystems large file support well possible limitations long filenames issues thunderbird runs variety platforms releases available primary distribution site support following operating systems unofficial ports available old ports may available os/2 ecomstation source code freely available compiled run variety architectures operating systems contributors world client translated 50 different languages although email addresses currently limited ascii local parts thunderbird yet support smtputf8 rfc 6531 email address internationalization thunderbird provides enterprise government-grade security features tls/ssl connections imap smtp servers also offers native support s/mime secure email digital signing message encryption using certificates security features take advantage smartcards installation additional extensions security features may added extensions instance enigmail offers pgp signing encryption decryption optional security protections also include disabling loading remote images within messages enabling specific media types sanitizer disabling javascript french military uses thunderbird contributes security features claimed match requirements nato closed messaging system originally launched minotaur shortly phoenix original name mozilla firefox project failed gain momentum success latter however demand increased mail client go work minotaur revived new name thunderbird migrated new toolkit developed firefox team significant work thunderbird restarted announcement version 1.5 onward main mozilla suite would designed around separate applications using new toolkit contrasts previous all-in-one approach allowing users mix match mozilla applications alternatives original mozilla suite continues developed seamonkey december 23 2004 project lightning announced tightly integrated calendar functionality scheduling tasks etc thunderbird lightning support full range calendar mechanisms protocols supported mozilla calendar infrastructure modern post-0.2 sunbird october 11 2006 qualcomm mozilla foundation announced future versions eudora based upon technology platform open source mozilla thunderbird email program project code-named penelope late 2006 debian rebranded thunderbird icedove due trademark copyright reasons second product rebranded july 26 2007 mozilla foundation announced thunderbird would developed independent organization mozilla corporation subsidiary foundation focusing mozilla firefox development september 17 2007 mozilla foundation announced funding new internet communications initiative dr. david ascher activestate purpose initiative develop internet communications software based thunderbird product code brand february 19 2008 mozilla messaging started operations subsidiary mozilla foundation responsible development email similar communications initial focus upcoming version thunderbird 3 alpha preview releases thunderbird 3 codenamed shredder april 4 2011 mozilla messaging merged mozilla labs group mozilla foundation july 6 2012 confidential memo jb piacentino thunderbird managing director mozilla leaked published techcrunch memo indicated mozilla would moving team project development new features would left community memo slated release july 9 2012 subsequent article executive chair mozilla mitchell baker stated mozilla decision make transition thunderbird new release governance model november 25 2014 kent james volunteer-led thunderbird council announced thunderbird blog active contributors thunderbird gathered mozilla office toronto discussed future application decided staff required working full-time thunderbird thunderbird team release stable reliable product make progress features frequently requested community december 1 2015 mitchell baker suggested company-wide memo thunderbird uncoupled firefox infrastructure referred thunderbird tax firefox said believe thunderbird potential industry-wide impact firefox mozilla remains interested role thunderbird seeking assistance help development may 9 2017 philipp kewisch announced mozilla foundation continue serve legal fiscal home thunderbird project thunderbird migrate mozilla corporation infrastructure separating operational aspects project interim/beta versions thunderbird 57 58 released late 2017 began make changes influenced firefox quantum including new photon user interface despite removal firefox quantum support xul-based legacy add-ons favor webextensions stable/esr release thunderbird 60 mid-2018 continued support although require updates support webextensions except themes 2018 according mozilla work underway planned support thunderbird 63 webextensions continue somewhat support legacy addons thunderbird development releases occur three stages called beta earlybird daily correspond firefox beta aurora nightly stages release dates gecko versions exactly firefox example firefox 7 thunderbird 7 released september 27 2011 based gecko 7.0", + "neighbors": [ + 81, + 95, + 107, + 134, + 258, + 277, + 306, + 312, + 351, + 427, + 491, + 509, + 515, + 528, + 582, + 585, + 617, + 620, + 623, + 646, + 713, + 734, + 782, + 796, + 813, + 869, + 886, + 910, + 959, + 961, + 1003, + 1120, + 1138, + 1166, + 1210, + 1228, + 1232, + 1249, + 1278, + 1280, + 1302, + 1318, + 1339, + 1369, + 1376, + 1384, + 1395, + 1407, + 1423, + 1443, + 1538, + 1539, + 1558, + 1563 + ], + "mask": "Test" + }, + { + "node_id": 1605, + "label": 3, + "text": "Motorola_68000_series:motorola 68000 series motorola 68000 series also termed 680x0 m68000 m68k 68k family 32-bit cisc microprocessors 1980s early 1990s popular personal computers workstations primary competitors intel x86 microprocessors well known processors powering early apple macintosh commodore amiga sinclair ql atari st sega genesis mega drive several others although modern desktop computers based processors 68000 series derivative processors still widely used embedded systems motorola ceased development 68000 series architecture 1994 replacing powerpc architecture developed conjunction ibm apple computer part aim alliance 68010 68020 68030 68040 68060 68000 line processors used variety systems modern high-end texas instruments calculators ti-89 ti-92 voyage 200 lines members palm pilot series run palm os 1.x 4.x os 5.x arm-based even radiation-hardened versions critical control systems space shuttle however became well known processors powering desktop computers apple macintosh commodore amiga sinclair ql atari st several others 68000 also processor choice 1980s unix workstations servers firms sun microsystems next silicon graphics sgi 68000 version cp/m called cp/m-68k initially proposed atari st operating system atari chose atari tos instead also perhaps significantly first several versions adobe postscript interpreters 68000-based 68000 apple laserwriter laserwriter plus clocked faster version used macintosh computers fast 68030 later postscript interpreters including standard resolution laserwriter iintx iif iig also 300 dpi higher resolution laserwriter pro 600 series usually 600 dpi limited 300 dpi minimum ram installed high resolution linotronic imagesetters 200ps 1500+ dpi 300ps 2500+ dpi thereafter adobe generally preferred risc processor competitors postscript clones already gone riscs often amd 29000-series early 68000-based adobe postscript interpreters hardware named cold war-era u.s. rockets missiles atlas redstone etc today systems either end-of-line case atari using different processors case macintosh amiga sun sgi since platforms peak market share 1980s original manufacturers either longer support operating system hardware business however gnu/linux netbsd openbsd operating systems still include support 68000 processors 68000 processors also used sega genesis mega drive snk neo geo consoles main cpu consoles sega saturn used 68000 audio processing i/o tasks atari jaguar included 68000 intended basic system control input processing due jaguar unusual assortment heterogeneous processors also frequently used running game logic many arcade boards also used 68000 processors including boards capcom snk sega microcontrollers derived 68000 family used huge variety applications example cpu32 coldfire microcontrollers manufactured millions automotive engine controllers many proprietary video editing systems used 68000 processors category name macrosystem casablanca black box easy use graphic interface 1997 intended amateur hobby videographer market also worth noting earlier bigger professional counterpart called draco 1995 groundbreaking quantel paintbox series early based 24-bit paint effects system originally released 1981 lifetime used nearly entire range 68000 family processors sole exception 68060 never implemented design another contender video arena abekas 8150 dve system used 680ec30 trinity play later renamed globecaster uses several 68030s bosch fgs-4000/4500 video graphics system manufactured robert bosch corporation later bts 1983 used 68000 main processor drove several others perform 3d animation computer could easily apply gouraud phong shading run modified motorola versados operating system people familiar pdp-11 vax usually feel comfortable 68000 exception split general-purpose registers specialized data address registers 68000 architecture many ways 32-bit pdp-11 orthogonal instruction set many processors came e.g. 8080 e.g. x86 typically possible combine operations freely operands rather restricted using certain addressing modes certain instructions property made programming relatively easy humans also made easier write code generators compilers 68000 instruction set divided following broad categories 68050 though one point project within motorola odd-numbered releases always reactions issues raised within prior even numbered part hence generally expected 68050 would reduced 68040 power consumption thus heat dissipation improved exception handling fpu used smaller feature size optimized microcode line program use instructions many optimizations included 68060 part design goals number reasons likely 68060 development intel 80486 progressing quickly motorola assumed would 68060 demanding project 68050 cancelled early development also revision 68060 motorola process shifting away 68000 88k processor lines new powerpc business 68070 never developed would revised 68060 likely superior fpu pipelining widely speculated upon usenet motorola mainly used even numbers major revisions cpu core 68000 68020 68040 68060 68010 revised version 68000 minor modifications core likewise 68030 revised 68020 powerful features none significant enough classify major upgrade core cpu 68070 designation licensed somewhat slower version 16/32-bit 68000 basic dma controller i\u00b2c host on-chip serial port 68070 used main cpu philips cd-i cpu however produced philips officially part motorola 680x0 lineup 4th-generation 68060 shared features intel p5 microarchitecture personal computers xt/370 at/370 pc-based ibm-compatible mainframes included two modified motorola 68000 processors custom microcode emulate s/370 mainframe instructions mainline 68000 processors demise 68000 family used extent microcontroller embedded microprocessor versions chips include ones listed i.e cpu32 aka 68330 coldfire quicc dragonball advent fpga technology international team hardware developers re-created 68000 many enhancements fpga core core known 68080 used vampire-branded amiga accelerators 1980s early 1990s 68000 widely used desktop computers mainly competed intel x86 architecture used ibm pc compatibles generation 1 68000 cpus primarily competed 16-bit 8086 8088 80286 generation 2 competed 80386 first 32-bit x86 processor generation 3 80486 fourth generation competed p5 pentium line nearly widely used predecessors since much old 68000 marketplace either defunct nearly case atari next converting newer architectures powerpc macintosh amiga sparc sun mips silicon graphics sgi dozens processor architectures currently successful embedded systems microcontrollers much simpler smaller cheaper 68000 others relatively sophisticated capable running complex software embedded versions 68000 often compete processors derived powerpc arm mips superh architectures among others", + "neighbors": [ + 85, + 134, + 193, + 210, + 224, + 270, + 271, + 322, + 331, + 388, + 529, + 643, + 681, + 738, + 805, + 868, + 907, + 979, + 1009, + 1016, + 1022, + 1100, + 1143, + 1147, + 1174, + 1220, + 1263, + 1398, + 1421, + 1518, + 1632 + ], + "mask": "Test" + }, + { + "node_id": 1606, + "label": 1, + "text": "Entity\u2013relationship_model:entity\u2013relationship model entity\u2013relationship model er model describes interrelated things interest specific domain knowledge basic er model composed entity types classify things interest specifies relationships exist entities instances entity types software engineering er model commonly formed represent things business needs remember order perform business processes consequently er model becomes abstract data model defines data information structure implemented database typically relational database entity\u2013relationship modeling developed database design peter chen published 1976 paper however variants idea existed previously er models show super subtype entities connected generalization-specialization relationships er model used also specification domain-specific ontologies entity\u2013relationship model usually result systematic analysis define describe important processes area business define business processes presents business data schema graphical form usually drawn graphical form boxes entities connected lines relationships express associations dependencies entities er model also expressed verbal form example one building may divided zero apartments one apartment located one building entities may characterized relationships also additional properties attributes include identifiers called primary keys diagrams created represent attributes well entities relationships may called entity-attribute-relationship diagrams rather entity\u2013relationship models er model typically implemented database simple relational database implementation row table represents one instance entity type field table represents attribute type relational database relationship entities implemented storing primary key one entity pointer foreign key table another entity tradition er/data models built two three levels abstraction note conceptual-logical-physical hierarchy used kinds specification different three schema approach software engineering first stage information system design uses models requirements analysis describe information needs type information stored database data modeling technique used describe ontology i.e overview classifications used terms relationships certain area interest case design information system based database conceptual data model later stage usually called logical design mapped logical data model relational model turn mapped physical model physical design note sometimes phases referred physical design entity may defined thing capable independent existence uniquely identified entity abstraction complexities domain speak entity normally speak aspect real world distinguished aspects real world entity thing exists either physically logically entity may physical object house car exist physically event house sale car service concept customer transaction order exist logically\u2014as concept although term entity one commonly used following chen really distinguish entity entity-type entity-type category entity strictly speaking instance given entity-type usually many instances entity-type term entity-type somewhat cumbersome people tend use term entity synonym term entities thought nouns examples computer employee song mathematical theorem etc relationship captures entities related one another relationships thought verbs linking two nouns examples owns relationship company computer supervises relationship employee department performs relationship artist song proves relationship mathematician conjecture etc model linguistic aspect described utilized declarative database query language errol mimics natural language constructs errol semantics implementation based reshaped relational algebra rra relational algebra adapted entity\u2013relationship model captures linguistic aspect entities relationships attributes examples employee entity might social security number ssn attribute proved relationship may date attribute every entity unless weak entity must minimal set uniquely identifying attributes called entity primary key entity\u2013relationship diagrams n't show single entities single instances relations rather show entity sets entities entity type relationship sets relationships relationship type examples particular song entity collection songs database entity set eaten relationship child lunch single relationship set child-lunch relationships database relationship set words relationship set corresponds relation mathematics relationship corresponds member relation certain cardinality constraints relationship sets may indicated well chen proposed following rules thumb mapping natural language descriptions er diagrams english chinese er diagrams peter chen physical view show data actually stored chen original paper gives example relationship roles describes relationship marriage two roles husband wife person plays role husband marriage relationship another person plays role wife marriage words nouns surprise naming things requires noun chen terminology also applied earlier ideas lines arrows crow's-feet diagrams owes earlier bachman diagrams chen relationship diagrams another common extension chen model name relationships roles verbs phrases also become prevalent name roles phrases owner owned correct nouns case owner possession thus person plays role owner car plays role possession rather person plays role owner etc use nouns direct benefit generating physical implementations semantic models person two relationships car possible generate names owner_person driver_person immediately meaningful modifications original specification beneficial chen described look-across cardinalities aside barker\u2013ellis notation used oracle designer uses same-side minimum cardinality analogous optionality role look-across maximum cardinality crows foot merise elmasri navathe others preference same-side roles minimum maximum cardinalities recent researchers feinerer dullea et al shown coherent applied n-ary relationships order greater 2 dullea et al one reads 'look across notation used uml effectively represent semantics participation constraints imposed relationships degree higher binary feinerer says problems arise operate look-across semantics used uml associations hartmann investigates situation shows different transformations fail although reduction mentioned spurious two diagrams 3.4 3.5 fact also see next pages look-across interpretation introduces several difficulties prevent extension simple mechanisms binary n-ary associations attributes drawn ovals connected line exactly one entity relationship set cardinality constraints expressed follows attributes often omitted clutter diagram diagram techniques often list entity attributes within rectangles drawn entity sets related diagramming convention techniques crow foot notation beginning dates back article gordon everest 1976 used barker notation structured systems analysis design method ssadm information technology engineering crow foot diagrams represent entities boxes relationships lines boxes different shapes ends lines represent relative cardinality relationship crow foot notation used consultancy practice caci many consultants caci including richard barker subsequently moved oracle uk developed early versions oracle case tools introducing notation wider audience notation relationships attributes necessary relationships promoted entities right example necessary capture artist performed song new entity performance introduced attributes reflecting time place relationship artist song becomes indirect relationship via performance artist-performs-performance performance-features-song three symbols used represent cardinality symbols used pairs represent four types cardinality entity may relationship inner component notation represents minimum outer component represents maximum using modeled database users encounter two well known issues returned results mean something results assumed query author first 'fan trap occurs master table links multiple tables one-to-many relationship issue derives name way model looks drawn entity\u2013relationship diagram linked tables 'fan master table type model looks similar star schema type model used data warehouses trying calculate sums aggregates using standard sql master table unexpected incorrect results solution either adjust model sql issue occurs mostly databases decision support systems software queries systems sometimes includes specific methods handling issue second issue 'chasm trap chasm trap occurs model suggests existence relationship entity types pathway exist certain entity occurrences example building one-or-more rooms hold zero-or-more computers one would expect able query model see computers building however computers currently assigned room repair somewhere else shown list another relation building computers needed capture computers building last modelling issue result failure capture relationships exist real world model see entity-relationship modelling 2 details semantic model model concepts sometimes called platform independent model intensional model latest since carnap well known extensional model one maps elements particular methodology technology thus platform specific model uml specification explicitly states associations class models extensional fact self-evident considering extensive array additional adornments provided specification provided prior candidate semantic modelling languages uml data modeling notation part 2 peter chen father er modeling said seminal paper original 1976 article chen explicitly contrasts entity\u2013relationship diagrams record modelling techniques several authors also support chen program chen accord philosophic theoretical traditions time ancient greek philosophers socrates plato aristotle 428 bc modern epistemology semiotics logic peirce frege russell plato associates knowledge apprehension unchanging forms forms according socrates roughly speaking archetypes abstract representations many types things properties relationships one another", + "neighbors": [ + 87, + 154, + 161, + 429, + 903, + 1095, + 1324 + ], + "mask": "Validation" + }, + { + "node_id": 1607, + "label": 4, + "text": "Hping:hping hping free packet generator analyzer tcp/ip protocol distributed salvatore sanfilippo also known antirez one type tester network security one de facto tools security auditing testing firewalls networks used exploit idle scan scanning technique also invented hping author implemented nmap security scanner new version hping hping3 scriptable using tcl language implements engine string based human readable description tcp/ip packets programmer write scripts related low level tcp/ip packet manipulation analysis short time like tools used computer security hping useful system administrators hackers", + "neighbors": [ + 117, + 379, + 405, + 703, + 711, + 796, + 993, + 1138 + ], + "mask": "Test" + }, + { + "node_id": 1608, + "label": 3, + "text": "Hardware_acceleration:hardware acceleration computing hardware acceleration use computer hardware specially made perform functions efficiently possible software running general-purpose transformation data routine computed calculated purely software running generic cpu purely custom-made hardware mix operation computed faster application-specific hardware designed programmed compute operation specified software performed general-purpose computer processor approach advantages disadvantages implementation computing tasks hardware decrease latency increase throughput known hardware acceleration typical advantages software include rapid development leading faster times market lower non-recurring engineering costs heightened portability ease updating features patching bugs cost overhead compute general operations advantages hardware include speedup reduced power consumption lower latency increased parallelism bandwidth better utilization area functional components available integrated circuit cost lower ability update designs etched onto silicon higher costs functional verification times market hierarchy digital computing systems ranging general-purpose processors fully customized hardware tradeoff flexibility efficiency efficiency increasing orders magnitude given application implemented higher hierarchy hierarchy includes general-purpose processors cpus specialized processors gpus fixed-function implemented field-programmable gate arrays fpgas fixed-function implemented application-specific integrated circuit asics hardware acceleration advantageous performance practical functions fixed updates needed software solutions advent reprogrammable logic devices fpgas restriction hardware acceleration fully fixed algorithms eased since 2010 allowing hardware acceleration applied problem domains requiring modification algorithms processing control flow integrated circuits created perform arbitrary operations analog digital signals often computing signals digital interpreted binary number data computer hardware software operate information binary representation perform computing accomplished calculating boolean functions bits input outputting result output device downstream storage processing either software hardware compute computable function custom hardware offers higher performance per watt functions specified software hardware description languages hdls verilog vhdl model semantics software synthesize design netlist programmed fpga composed logic gates application-specific integrated circuit vast majority software-based computing occurs machines implementing von neumann architecture collectively known stored-program computers computer programs stored data executed processors typically one cpu cores processors must fetch decode instructions well data operands memory part instruction cycle execute instructions constituting software program relying common cache code data leads von neumann bottleneck fundamental limitation throughput software processors implementing von neumann architecture even modified harvard architecture instructions data separate caches memory hierarchy overhead decoding instruction opcodes multiplexing available execution units microprocessor microcontroller leading low circuit utilization intel hyper-threading technology provides simultaneous multithreading exploiting under-utilization available processor functional units instruction level parallelism different hardware threads hardware execution units general rely von neumann modified harvard architectures need perform instruction fetch decode steps instruction cycle incur stages overhead needed calculations specified register transfer level rtl hardware design time circuit area costs would incurred instruction fetch decoding stages reclaimed put uses reclamation saves time power circuit area computation reclaimed resources used increased parallel computation functions communication memory well increased input/output capabilities comes opportunity cost less general-purpose utility greater rtl customization hardware designs allows emerging architectures in-memory computing transport triggered architectures tta networks-on-chip noc benefit increased locality data execution context thereby reducing computing communication latency modules functional units custom hardware limited parallel processing capability area logic blocks available integrated circuit die therefore hardware much free offer massive parallelism software general-purpose processors offering possibility implementing parallel random-access machine pram model common build multicore manycore processing units microprocessor ip core schematics single fpga asic similarly specialized functional units composed parallel digital signal processing without embedded processor ip core therefore hardware acceleration often employed repetitive fixed tasks involving little conditional branching especially large amounts data nvidia cuda line gpus implemented device mobility increased relative performance specific acceleration protocols required new metricizations considering characteristics physical hardware dimensions power consumption operations throughput summarized three categories task efficiency implementation efficiency flexibility appropriate metrics consider area hardware along corresponding operations throughput energy consumed suppose wish compute sum formula_1 integers assuming large integers available codice_1 large enough hold sum done software specifying c++ constexpr int n 20 constexpr int two_to_the_n 1 \u00ab n bignum array_sum const std :array int two_to_the_n ints algorithm runs linear time formula_2 big notation hardware sufficient area chip calculation parallelized take 20 time steps using prefix sum algorithm algorithm requires logarithmic time formula_3 formula_4 space in-place algorithm parameter int n 20 parameter int two_to_the_n 1 \u00ab n function int array_sum endfunction example takes advantage greater parallel resources available application-specific hardware software general-purpose computing paradigms architectures hardware acceleration applied stream processing examples hardware acceleration include bit blit acceleration functionality graphics processing units gpus use memristors accelerating neural networks regular expression hardware acceleration spam control server industry intended prevent regular expression denial service redos attacks hardware performs acceleration may part general-purpose cpu separate unit second case referred hardware accelerator often specifically 3d accelerator cryptographic accelerator etc traditionally processors sequential instructions executed one one designed run general purpose algorithms controlled instruction fetch example moving temporary results register file hardware accelerators improve execution specific algorithm allowing greater concurrency specific datapaths temporary variables reducing overhead instruction control fetch-decode-execute cycle modern processors multi-core often feature parallel single-instruction multiple data simd units even hardware acceleration still yields benefits hardware acceleration suitable computation-intensive algorithm executed frequently task program depending upon granularity hardware acceleration vary small functional unit large functional block like motion estimation mpeg-2", + "neighbors": [ + 51, + 53, + 61, + 76, + 85, + 86, + 105, + 111, + 123, + 127, + 193, + 206, + 208, + 210, + 212, + 224, + 227, + 230, + 265, + 268, + 270, + 271, + 272, + 280, + 282, + 300, + 314, + 331, + 335, + 340, + 346, + 352, + 355, + 362, + 375, + 379, + 388, + 429, + 445, + 457, + 460, + 508, + 528, + 544, + 589, + 591, + 611, + 643, + 659, + 681, + 719, + 737, + 752, + 776, + 803, + 821, + 834, + 846, + 847, + 907, + 917, + 937, + 980, + 984, + 989, + 994, + 1009, + 1013, + 1016, + 1052, + 1081, + 1099, + 1111, + 1113, + 1125, + 1138, + 1159, + 1174, + 1188, + 1219, + 1220, + 1222, + 1256, + 1272, + 1284, + 1290, + 1324, + 1351, + 1372, + 1398, + 1422, + 1461, + 1469, + 1503, + 1505, + 1507, + 1518, + 1525, + 1549, + 1552, + 1557, + 1572, + 1632 + ], + "mask": "Validation" + }, + { + "node_id": 1609, + "label": 9, + "text": "List_of_Lisp-family_programming_languages:list lisp-family programming languages functional programming language lisp second-oldest high-level programming language direct descendants closely related dialects still widespread use today language fortran older one year lisp like fortran changed lot since early days many dialects existed history today widely known general-purpose lisp dialects common lisp scheme", + "neighbors": [ + 27, + 46, + 56, + 134, + 173, + 194, + 203, + 251, + 292, + 308, + 313, + 332, + 347, + 360, + 383, + 391, + 392, + 446, + 447, + 454, + 488, + 501, + 506, + 509, + 536, + 565, + 579, + 601, + 649, + 653, + 693, + 753, + 756, + 787, + 795, + 828, + 831, + 919, + 929, + 934, + 947, + 961, + 978, + 987, + 990, + 1010, + 1021, + 1066, + 1076, + 1118, + 1119, + 1123, + 1138, + 1173, + 1180, + 1207, + 1213, + 1245, + 1251, + 1277, + 1298, + 1301, + 1315, + 1319, + 1375, + 1385, + 1389, + 1402, + 1404, + 1413, + 1430, + 1466, + 1477, + 1516, + 1536, + 1588, + 1632, + 1633 + ], + "mask": "Test" + }, + { + "node_id": 1610, + "label": 2, + "text": "TSX-Plus:tsx-plus tsx-plus multi-user operating system pdp-11/lsi-11 series computers developed h computer systems inc. based dec rt-11 single-user real-time operating system tsx-plus installs top rt-11 system highly configurable tunable due constraints memory management system pdp-11/lsi-11 entire operating system core must occupy 40 kibibytes memory maximum possible 4 mebibytes physical memory actually installed machines mandated 22-bit address space despite limitations tsx-plus actually able service 30 simultaneous users still maintaining decent response times although usually never used 8 simultaneous users software included wp package named lex-11 spreadsheet saturn software machine slowed considerably 8 students wanted use word-processing package time also decision-table language called ncc manchester worked well tsx plus system popular 1980s although major number clones latest version tsx-plus tcp/ip support system still use supported", + "neighbors": [ + 1, + 9, + 37, + 58, + 64, + 99, + 134, + 170, + 171, + 187, + 322, + 413, + 465, + 477, + 583, + 664, + 728, + 754, + 779, + 797, + 860, + 891, + 941, + 961, + 966, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1138, + 1155, + 1187, + 1202, + 1224, + 1301, + 1398, + 1415, + 1441, + 1474, + 1494, + 1530, + 1546, + 1578, + 1616, + 1631 + ], + "mask": "Validation" + }, + { + "node_id": 1611, + "label": 0, + "text": "United_Nations_Multilingual_Terminology_Database:united nations multilingual terminology database united nations multilingual terminology database unterm linguistic tool translates terminology nomenclature used within united nations un six official languages un arabic chinese english french russian spanish database contains 85,000 words updated daily database maintained terminology reference section documentation division department general assembly conference management headquarters new york city database put internet order facilitate understanding work un public access intranet un secretariat", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1612, + "label": 3, + "text": "Finders_Keepers_(1985_video_game):finders keepers 1985 video game finders keepers computer game written david jones first game magic knight series published mastertronic label zx spectrum amstrad cpc msx commodore 64 commodore 16 1985 published united kingdom budget price \u00a31.99 zx spectrum sold 117,000 copies across 8-bit formats 330,000 copies making mastertronic second best-selling original game bmx racers magic knight sent castle spriteland king ibsisima order find special present princess germintrude magic knight successful quest may proved worthy joining famous polygon table reference mythical round table legends king arthur gameplay finders keepers markedly different magic knight games essentially graphic adventures platform elements finders keepers basically platform game maze sections hero starts king throne room transported via teleporter castle castle made two types playing area flick-screen rooms manner platform game two large scrolling mazes zx spectrum amstrad cpc msx cold upper maze slimey lower maze commodore 64 consist castle gardens castle dungeons additional part gameplay ability collect objects found rooms mazes scattered around castle sell money objects combine react create object higher value example 'bar lead 'philosophers stone react create 'bar gold amount money magic knight carrying market value inventory displayed on-screen buying selling objects done various traders live castle castle spriteland full dangerous creatures inhabit many rooms well mazes collision saps magic knight strength loses strength loses one four lives zzap 64 impressed game described little masterpiece another quality product mastertronic given 90 overall rating finders keepers followed-up three magic knight games spellbound published 1985 knight tyme published 1986 stormbringer published 1987", + "neighbors": [ + 823, + 1260 + ], + "mask": "Test" + }, + { + "node_id": 1613, + "label": 2, + "text": "Task_View:task view task view task switcher virtual desktop system introduced windows 10 among first features new windows 10 task view allows user quickly locate open window quickly hide windows show desktop manage windows across multiple monitors virtual desktops clicking task view button taskbar swiping left side screen displays open windows allows users switch switch multiple workspaces first previewed september 30 2014 windows 10 press event downtown san francisco similar effects used operating systems windows 3.0 first introduced window switcher 1990 using users could see flattened view open windows every version windows since also provided window switching functionality windows vista windows 7 provide additional feature called windows flip 3d broadly similar purpose flip 3d allows user flip open windows 3d perspective downside method front window covers significant portion windows unlike mission control macos hand allows user see contents front window difficult mission control especially user large number windows open vista desktop window manager exposes public api allows application access thumbnail representations flip3d uses number third party add-ons able provide mission control-like functionality vista third party applications emcee desktop organizer provide mission control like organization similar windows visual stacks support windows 8 immersive apps microsoft intellipoint software microsoft mice feature similar mission control also works live images windows rather static representations additionally several freeware windows applications exist emulate functionality mission control compiz kwin compositing window managers systems using x window system include plugins similar mission control scale plugin compiz present windows effect kwin skippy also performs similar functions mission control starting version 3.0 gnome desktop environment gained new mode called overview used launch applications manage workspaces mode windows scaled arranged mission control-like fashion quick switching chrome os window overview mode shows thumbnail open windows available pressing 'window switcher key swiping 3 fingers trackpad windows overview mode closed clicking associated close button selected clicking window thumbnail also closes overview mode brings selected window foreground classic legacy macintosh systems free finder workspaces offers functionality similar spaces mission control macos allows user quickly locate open window quickly hide windows show desktop manage windows across multiple monitors virtual desktops activated f3 key f9 older keyboards apple magic mouse multi-touch trackpads activated pulling trackpad three four fingers mission control redesigned feature extensively show running desktops", + "neighbors": [ + 26, + 66, + 79, + 93, + 148, + 153, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 920, + 961, + 989, + 1025, + 1035, + 1092, + 1098, + 1109, + 1138, + 1151, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1461, + 1506, + 1531, + 1533, + 1545, + 1547, + 1561, + 1589, + 1620 + ], + "mask": "Test" + }, + { + "node_id": 1614, + "label": 8, + "text": "Groovle:groovle groovle web search site offered customers ability customise home page underlying service provided google company owned operated entirely independently december 2009 google lost court case claimed groovle domain similar control passed zak muscovitch attorney groovle stated case people use google people appreciate google people love google ... think people appreciate little guy takes giant wins", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1615, + "label": 0, + "text": "Question_answering:question answering question answering qa computer science discipline within fields information retrieval natural language processing nlp concerned building systems automatically answer questions posed humans natural language question answering implementation usually computer program may construct answers querying structured database knowledge information usually knowledge base commonly question answering systems pull answers unstructured collection natural language documents examples natural language document collections used question answering systems include question answering research attempts deal wide range question types including fact list definition hypothetical semantically constrained cross-lingual questions two early question answering systems baseball lunar baseball answered questions us baseball league period one year lunar turn answered questions geological analysis rocks returned apollo moon missions question answering systems effective chosen domains fact lunar demonstrated lunar science convention 1971 able answer 90 questions domain posed people untrained system restricted-domain question answering systems developed following years common feature systems core database knowledge system hand-written experts chosen domain language abilities baseball lunar used techniques similar eliza doctor first chatterbot programs shrdlu highly successful question-answering program developed terry winograd late 1960s early 1970s simulated operation robot toy world blocks world offered possibility asking robot questions state world strength system choice specific domain simple world rules physics easy encode computer program 1970s knowledge bases developed targeted narrower domains knowledge question answering systems developed interface expert systems produced repeatable valid responses questions within area knowledge expert systems closely resembled modern question answering systems except internal architecture expert systems rely heavily expert-constructed organized knowledge bases whereas many modern question answering systems rely statistical processing large unstructured natural language text corpus 1970s 1980s saw development comprehensive theories computational linguistics led development ambitious projects text comprehension question answering one example system unix consultant uc developed robert wilensky u.c berkeley late 1980s system answered questions pertaining unix operating system comprehensive hand-crafted knowledge base domain aimed phrasing answer accommodate various types users another project lilog text-understanding system operated domain tourism information german city systems developed uc lilog projects never went past stage simple demonstrations helped development theories computational linguistics reasoning recently specialized natural language question answering systems developed eagli health life scientists wolfram alpha online computational knowledge engine answers factual queries directly computing answer externally sourced curated data 2001 question answering systems typically included question classifier module determines type question type answer multiagent question-answering architecture proposed domain represented agent tries answer questions taking account specific knowledge meta\u2013agent controls cooperation question answering agents chooses relevant answer question answering dependent good search corpus without documents containing answer little question answering system thus makes sense larger collection sizes generally lend well better question answering performance unless question domain orthogonal collection notion data redundancy massive collections web means nuggets information likely phrased many different ways differing contexts documents leading two benefits question answering systems rely heavily automated reasoning number question answering systems designed prolog logic programming language associated artificial intelligence information retrieval open domain question answering system aims returning answer response user question returned answer form short texts rather list relevant documents system uses combination techniques computational linguistics information retrieval knowledge representation finding answers system takes natural language question input rather set keywords example national day china sentence transformed query logical form input form natural language question makes system user-friendly harder implement various question types system identify correct one order give sensible answer assigning question type question crucial task entire answer extraction process relies finding correct question type hence correct answer type keyword extraction first step identifying input question type cases clear words indicate question type directly i.e many words tell system answers type person location number respectively example word indicates answer type date pos part-of-speech tagging syntactic parsing techniques also used determine answer type case subject chinese national day predicate adverbial modifier therefore answer type date unfortunately interrogative words like give clear answer types words represent one type situations like words question need considered first thing find words indicate meaning question lexical dictionary wordnet used understanding context question type identified information retrieval system used find set documents containing correct key words tagger np/verb group chunker used verify whether correct entities relations mentioned found documents questions named-entity recogniser used find relevant person location names retrieved documents relevant paragraphs selected ranking vector space model used strategy classifying candidate answers check answer correct type determined question type analysis stage inference technique also used validate candidate answers score given candidates according number question words contains close words candidate closer better answer translated compact meaningful representation parsing previous example expected output answer 1st oct. recently open source math-aware question answering system based ask platypus wikidata published system takes english hindi natural language question input returns mathematical formula retrieved wikidata succinct answer resulting formula translated computable form allowing user insert values variables names values variables common constants retrieved wikidata available claimed system outperforms commercial computational mathematical knowledge engine test set question answering systems extended recent years encompass additional domains knowledge example systems developed automatically answer temporal geospatial questions questions definition terminology biographical questions multilingual questions questions content audio images video current question answering research topics include ibm question answering system watson defeated two greatest jeopardy champions brad rutter ken jennings significant margin facebook research made drqa system available open source license system used open domain question answering using wikipedia knowledge source", + "neighbors": [ + 14, + 159, + 282, + 307, + 368, + 372, + 429, + 453, + 662, + 733, + 824, + 832, + 883, + 885, + 978, + 1007, + 1062, + 1096, + 1128, + 1142, + 1209, + 1440, + 1465, + 1486 + ], + "mask": "Test" + }, + { + "node_id": 1616, + "label": 2, + "text": "Virtual_memory:virtual memory computing virtual memory also virtual storage memory management technique provides idealized abstraction storage resources actually available given machine creates illusion users large main memory computer operating system using combination hardware software maps memory addresses used program called virtual addresses physical addresses computer memory main storage seen process task appears contiguous address space collection contiguous segments operating system manages virtual address spaces assignment real memory virtual memory address translation hardware cpu often referred memory management unit mmu automatically translates virtual addresses physical addresses software within operating system may extend capabilities provide virtual address space exceed capacity real memory thus reference memory physically present computer primary benefits virtual memory include freeing applications manage shared memory space increased security due memory isolation able conceptually use memory might physically available using technique paging virtual memory makes application programming easier hiding fragmentation physical memory delegating kernel burden managing memory hierarchy eliminating need program handle overlays explicitly process run dedicated address space obviating need relocate program code access memory relative addressing memory virtualization considered generalization concept virtual memory virtual memory integral part modern computer architecture implementations usually require hardware support typically form memory management unit built cpu necessary emulators virtual machines employ hardware support increase performance virtual memory implementations consequently older operating systems mainframes 1960s personal computers early mid-1980s e.g. dos generally virtual memory functionality though notable exceptions mainframes 1960s include operating system apple lisa example personal computer operating system 1980s features virtual memory 1960s early 70s computer memory expensive introduction virtual memory provided ability software systems large memory demands run computers less real memory savings provided strong incentive switch virtual memory systems additional capability providing virtual address spaces added another level security reliability thus making virtual memory even attractive market place modern operating systems support virtual memory also run process dedicated address space program thus appears sole access virtual memory however older operating systems os/vs1 os/vs2 svs even modern ones ibm single address space operating systems run processes single address space composed virtualized memory embedded systems special-purpose computer systems require fast and/or consistent response times may opt use virtual memory due decreased determinism virtual memory systems trigger unpredictable traps may produce unwanted unpredictable delays response input especially trap requires data read main memory secondary memory hardware translate virtual addresses physical addresses typically requires significant chip area implement chips used embedded systems include hardware another reason systems n't use virtual memory 1940s 1950s larger programs contain logic managing primary secondary storage overlaying virtual memory therefore introduced extend primary memory make extension easy possible programmers use allow multiprogramming multitasking many early systems divided memory multiple programs without virtual memory early models pdp-10 via registers concept virtual memory first developed german physicist fritz-rudolf g\u00fcntsch technische universit\u00e4t berlin 1956 doctoral thesis logical design digital computer multiple asynchronous rotating drums automatic high speed memory operation described machine 6 100-word blocks primary core memory address space 1,000 100-word blocks hardware automatically moving blocks primary memory secondary drum memory paging first implemented university manchester way extend atlas computer working memory combining 16,384 words primary core memory additional 98,304 words secondary drum memory first atlas commissioned 1962 working prototypes paging developed 1959 1961 burroughs corporation independently released first commercial computer virtual memory b5000 segmentation rather paging virtual memory could implemented mainstream operating systems many problems addressed dynamic address translation required expensive difficult-to-build specialized hardware initial implementations slowed access memory slightly worries new system-wide algorithms utilizing secondary storage would less effective previously used application-specific algorithms 1969 debate virtual memory commercial computers ibm research team led david sayre showed virtual memory overlay system consistently worked better best manually controlled systems throughout 1970s ibm 370 series running virtual-storage based operating systems provided means business users migrate multiple older systems fewer powerful mainframes improved price/performance first minicomputer introduce virtual memory norwegian nord-1 1970s minicomputers implemented virtual memory notably vax models running vms virtual memory introduced x86 architecture protected mode intel 80286 processor segment swapping technique scaled poorly larger segment sizes intel 80386 introduced paging support underneath existing segmentation layer enabling page fault exception chain exceptions without double fault however loading segment descriptors expensive operation causing operating system designers rely strictly paging rather combination paging segmentation nearly current implementations virtual memory divide virtual address space pages blocks contiguous virtual memory addresses pages contemporary systems usually least 4 kilobytes size systems large virtual address ranges amounts real memory generally use larger page sizes page tables used translate virtual addresses seen application physical addresses used hardware process instructions hardware handles specific translation often known memory management unit entry page table holds flag indicating whether corresponding page real memory real memory page table entry contain real memory address page stored reference made page hardware page table entry page indicates currently real memory hardware raises page fault exception invoking paging supervisor component operating system systems one page table whole system separate page tables application segment tree page tables large segments combination one page table different applications running time use different parts single range virtual addresses multiple page segment tables multiple virtual address spaces concurrent applications separate page tables redirect different real addresses earlier systems smaller real memory sizes sds 940 used page registers instead page tables memory address translation part operating system creates manages page tables hardware raises page fault exception paging supervisor accesses secondary storage returns page virtual address resulted page fault updates page tables reflect physical location virtual address tells translation mechanism restart request physical memory already use paging supervisor must free page primary storage hold swapped-in page supervisor uses one variety page replacement algorithms least recently used determine page free operating systems memory areas pinned never swapped secondary storage terms used locked fixed wired pages example interrupt mechanisms rely array pointers handlers i/o completion page fault pages containing pointers code invoke pageable interrupt-handling would become far complex time-consuming particularly case page fault interruptions hence part page table structures pageable pages may pinned short periods time others may pinned long periods time still others may need permanently pinned example ibm operating systems system/370 successor systems term fixed pages may long-term fixed may short-term fixed may unfixed i.e. pageable system control structures often long-term fixed measured wall-clock time i.e. time measured seconds rather time measured fractions one second whereas i/o buffers usually short-term fixed usually measured significantly less wall-clock time possibly tens milliseconds indeed os special facility fast fixing short-term fixed data buffers fixing performed without resorting time-consuming supervisor call instruction multics used term wired openvms windows refer pages temporarily made nonpageable i/o buffers locked simply nonpageable never pageable os/vs1 similar oses parts systems memory managed virtual-real mode called v=r mode every virtual address corresponds real address mode used interrupt mechanisms paging supervisor page tables older systems application programs using non-standard i/o management example ibm z/os 3 modes virtual-virtual virtual-real virtual-fixed paging page stealing used problem called thrashing occur computer spends unsuitably large amount time transferring pages backing store hence slowing useful work task working set minimum set pages memory order make useful progress thrashing occurs insufficient memory available store working sets active programs adding real memory simplest response improving application design scheduling memory usage help another solution reduce number active tasks system reduces demand real memory swapping entire working set one processes systems burroughs b5500 use segmentation instead paging dividing virtual address spaces variable-length segments virtual address consists segment number offset within segment intel 80286 supports similar segmentation scheme option rarely used segmentation paging used together dividing segment pages systems memory structure multics ibm system/38 usually paging-predominant segmentation providing memory protection intel 80386 later ia-32 processors segments reside 32-bit linear paged address space segments moved space pages page main memory providing two levels virtual memory operating systems instead using paging early non-hardware-assisted x86 virtualization solutions combined paging segmentation x86 paging offers two protection domains whereas vmm guest os guest applications stack needs three difference paging segmentation systems memory division segmentation visible user processes part memory model semantics hence instead memory looks like single large space structured multiple spaces difference important consequences segment page variable length simple way lengthen address space segmentation provide single-level memory model differentiation process memory file system consists list segments files mapped process potential address space mechanisms provided calls mmap win32 mapviewoffile inter-file pointers work mapping files semi-arbitrary places multics file segment multi-segment file mapped segment address space files always mapped segment boundary file linkage section contain pointers attempt load pointer register make indirect reference causes trap unresolved pointer contains indication name segment pointer refers offset within segment handler trap maps segment address space puts segment number pointer changes tag field pointer longer causes trap returns code trap occurred re-executing instruction caused trap eliminates need linker completely works different processes map file different places private address spaces operating systems provide swapping entire address spaces addition whatever facilities paging segmentation occurs os writes pages segments currently real memory swap files swap-in os reads back data swap files automatically read back pages paged time swap operation ibm mvs os/vs2 release 2 z/os provides marking address space unswappable pin pages address space done duration job entering name eligible main program program properties table unswappable flag addition privileged code temporarily make address space unswappable using sysevent supervisor call instruction svc certain changes address space properties require os swap swap back using sysevent transwap", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 76, + 85, + 99, + 105, + 108, + 123, + 127, + 134, + 142, + 170, + 171, + 185, + 193, + 206, + 210, + 212, + 224, + 225, + 230, + 265, + 270, + 271, + 272, + 314, + 322, + 331, + 335, + 340, + 347, + 353, + 359, + 373, + 380, + 387, + 388, + 412, + 434, + 445, + 457, + 460, + 465, + 484, + 508, + 583, + 589, + 643, + 650, + 659, + 664, + 719, + 720, + 721, + 723, + 752, + 754, + 776, + 797, + 803, + 821, + 846, + 884, + 891, + 907, + 925, + 937, + 940, + 946, + 954, + 961, + 966, + 980, + 984, + 994, + 996, + 1009, + 1011, + 1012, + 1013, + 1016, + 1022, + 1024, + 1035, + 1040, + 1049, + 1052, + 1053, + 1054, + 1057, + 1063, + 1081, + 1111, + 1113, + 1125, + 1138, + 1174, + 1181, + 1188, + 1193, + 1197, + 1202, + 1213, + 1219, + 1222, + 1224, + 1234, + 1256, + 1272, + 1284, + 1290, + 1301, + 1304, + 1363, + 1379, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1469, + 1474, + 1505, + 1507, + 1518, + 1525, + 1530, + 1546, + 1557, + 1578, + 1610, + 1629, + 1632, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1617, + "label": 8, + "text": "Sarvega:sarvega sarvega intel-owned company provided xml appliances intel purchase announced aug. 17th 2005 company brought intel software services group ssg global 1000 organizations using sarvega xpe switches include fujitsu health care supplier mt sinai hospital systems reactivity westbridge technology sarvega also trying establish security appliances product developing maintaining safety policy settings xml appliance", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1618, + "label": 4, + "text": "Allway_Sync:allway sync allway sync backup file synchronization software allows backing synchronizing files different drives different media cd dvd flash zip remote server various versions users freeware version requested buy pro version use software commercial purpose synchronize 40,000 files 30-day period pro version exactly functionality free version", + "neighbors": [ + 272, + 326, + 494, + 1138, + 1289, + 1634 + ], + "mask": "Validation" + }, + { + "node_id": 1619, + "label": 2, + "text": "Nokia_E7-00:nokia e7-00 nokia e7-00 also known nokia e7 business-oriented qwerty smartphone nokia nokia eseries announced nokia world september 2010 together nokia c6-01 nokia c7 started shipping february 2011 second phone nokia n8 running symbian^3 operating system compared nokia n8 fixed mass storage 16gb without memory card slot fm transmitter less advanced camera extended depth field instead autofocus n8 e90 like nokia n8 comes hdmi-out connector non-user-replaceable battery smaller e90 keyboard spring mechanism nokia n97 mini like n8 anodized aluminium casing different bulkier heavier e90 compared nokia n97 mini e90 e7-00 multitouch capacitive touchscreen unlike n8 n97 mini e90 e7-00 active-matrix oled amoled clearblack technology slightly lower resolution e90 vlasta berka general manager nokia singapore malaysia brunei talked trend users using smartphones business parliament finland bought 200 e7s spring 2011 late april 2012 50 phones serviced warranty fixed os update e7 battery user-removable although unofficial online tutorials replace battery exist", + "neighbors": [ + 3, + 21, + 162, + 238, + 253, + 264, + 270, + 309, + 337, + 359, + 484, + 527, + 603, + 619, + 622, + 707, + 726, + 1018, + 1020, + 1117, + 1203, + 1314, + 1422, + 1493, + 1522, + 1529 + ], + "mask": "Validation" + }, + { + "node_id": 1620, + "label": 2, + "text": "Windows_Mixed_Reality:windows mixed reality windows mixed reality mixed reality platform introduced part windows 10 operating system provides holographic mixed reality experiences compatible head-mounted displays flagship device microsoft hololens announced windows 10 next chapter press event january 21 2015 provides mixed reality experience live presentation physical real-world elements incorporated virtual elements referred holograms microsoft perceived exist together shared environment variant windows augmented reality computers augment real-world physical environment virtual elements windows mixed reality features augmented-reality operating environment universal windows platform app run platform also used virtual reality headsets designed use windows 10 fall creators update built specifications implemented part windows mixed reality lack support holographic experiences premier device windows mixed reality microsoft hololens smart-glasses headset cordless self-contained windows 10 computer running windows 10 holographic uses various sensors high-definition stereoscopic 3d optical head-mounted display spatial sound allow augmented reality applications natural user interface user interacts gaze voice hand gestures codenamed project baraboo hololens development five years announcement 2015 conceived earlier original pitch made late 2007 would become kinect technology platform microsoft targeted hololens release windows 10 timeframe microsoft hololens development edition begin shipping march 30 2016 available application developers united states canada list price us 3000 although development edition considered consumer-ready hardware february 2016 microsoft set time frame consumer availability hololens hololens chief inventor alex kipman stating hololens consumer release market ready companies samsung electronics asus expressed interest working microsoft produce mixed-reality products based hololens intel made direct competitor called project alloy system called merged reality however cancelled september 22 2017 october 2016 hardware event microsoft announced multiple oems would release virtual reality headsets windows holographic platform based microsoft reference designs enabling room-scale virtual reality without external sensors components january 2017 prototypes presented consumer electronics show release later year microsoft later announced planned release development kits headsets game developers conference devices would supported windows 10 creators update game developers conference 2017 microsoft stated intended support windows mixed reality headsets xbox one 2018 specifically noting capabilities then-upcoming xbox one x hardware revision company later stated initially focusing pc platforms first wanted focus wireless vr solutions consoles october 2017 microsoft officially launched windows mixed reality lineup third-party headsets use windows 10 fall creators update including launch lineup headsets acer dell hp lenovo future products asus samsung officially referred windows mixed reality immersive headsets unlike hololens devices compatible virtual reality software underlying ecosystem referred windows mixed reality regardless experience immersive headsets feature integrated motion tracking eschewing standalone sensors contain cameras used track handheld motion controller accessories may bundled headset distributed optional accessories immersive headsets currently compatible mixed reality software obtained microsoft store universal apps software using steam virtual reality platform used htc vive ability run desktop software added windows 10 may 2019 update microsoft classifies minimum recommended system requirements windows mixed reality windows mixed reality pcs 60 fps windows mixed reality ultra pcs 90 fps minimum requirements specify intel core i5-7200u better laptops 8 gb ram intel hd graphics 620 better directx 12 support usb 3.0 hdmi displayport connections bluetooth 4.0 support controllers verge noted users wo n't need high-end gaming pc meet recommendations mixed reality portal universal windows platform app serves front-end windows mixed reality features 3d environment users explore customize application shortcuts virtual desktops feature originally launched one environment cliff house second skyloft added april 2018 update", + "neighbors": [ + 26, + 28, + 66, + 79, + 93, + 148, + 153, + 211, + 262, + 268, + 278, + 295, + 312, + 326, + 336, + 344, + 412, + 433, + 435, + 485, + 521, + 558, + 574, + 615, + 638, + 662, + 689, + 705, + 791, + 801, + 865, + 907, + 920, + 961, + 989, + 1025, + 1035, + 1068, + 1092, + 1098, + 1109, + 1138, + 1151, + 1177, + 1212, + 1247, + 1261, + 1328, + 1338, + 1346, + 1363, + 1370, + 1417, + 1428, + 1461, + 1502, + 1506, + 1531, + 1533, + 1545, + 1547, + 1555, + 1561, + 1589, + 1613, + 1621, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1621, + "label": 2, + "text": "Microsoft_Silverlight:microsoft silverlight microsoft silverlight simply silverlight deprecated application framework writing running rich internet applications similar adobe flash plugin silverlight still available browsers early versions silverlight focused streaming media later versions supported multimedia graphics animation game developers support cli languages development tools silverlight also one two application development platforms windows phone web pages use silverlight run windows phone windows mobile versions internet explorer silverlight plugin internet explorer platforms initial launch 2007 reviewers compared product adobe flash according statowl.com microsoft silverlight penetration 64.2 may 2011 usage july 2010 53.6 whereas market leader adobe flash installed 95.3 browsers java supported 76.5 browsers support plugins mutually exclusive one system support three web sites require browser plugin silverlight used provide video streaming nbc coverage 2008 summer olympics beijing 2010 winter olympics vancouver 2008 conventions major united states political parties silverlight also used amazon video netflix instant video streaming services netflix said tech blog 2013 since microsoft announced silverlight end-of-life would moving html5 video industry observers announcing death silverlight early 2011 internally even proponents technology thought extensible application markup language concept bad idea start 2012 microsoft deprecated silverlight html5 windows 8 late beginning 2015 clear microsoft official position future silverlight technology july 2015 microsoft blog post finally clarified matters ... encourage companies using silverlight media begin transition dash/mse/cenc/eme based designs microsoft set overall support end date silverlight 5 october 2021 support ie7-8 removed 2014 2016 depending os support ie9-11 last late 2021 depending os though sic support lifecycle underlying browsers whichever shorter silverlight plugin available microsoft edge supported google chrome since september 2015 firefox since march 2017. fewer 0.1 sites used silverlight 5.3 used adobe flash 2.4 used java silverlight provides retained mode graphics system similar windows presentation foundation wpf integrates multimedia graphics animations interactivity single run-time environment silverlight applications user interfaces declared extensible application markup language xaml programmed using subset .net framework xaml used marking vector graphics animations silverlight also used create windows sidebar gadgets windows vista silverlight supports h.264 video advanced audio coding windows media video wmv windows media audio wma mpeg layer iii mp3 media content across supported browsers without requiring windows media player windows media player activex control windows media browser plug-ins windows media video 9 implementation society motion picture television engineers smpte vc-1 standard silverlight also supports vc-1 video according end user license agreement vc-1 h.264 licensed personal non-commercial use consumer silverlight makes possible dynamically load extensible markup language xml content manipulated document object model dom interface technique consistent conventional ajax techniques silverlight exposes downloader object used download content like scripts media assets data may required application version 2 programming logic written .net language including derivatives common dynamic programming languages like ironruby ironpython free software implementation abandoned named moonlight developed novell cooperation microsoft released bring silverlight versions 1 2 functionality linux freebsd open source platforms although linux distributions include citing redistribution patent concerns however may 2012 moonlight abandoned lack popularity course five years microsoft released five versions varying platform support first version released 2007 fifth final major version may 8 2012 compatible later versions internet explorer web browser microsoft windows except windows rt operating systems safari apple macos mobile devices using windows mobile symbian series 60 platforms cross platform mozilla firefox support silverlight removed firefox 52 released march 2017 mozilla removed support npapi plugins bringing in-line removal npapi plugin support google chrome silverlight requires x86 processor streaming simd extensions sse support supported processors include intel pentium iii amd athlon xp newer amd durons following table presents availability compatibility matrix silverlight versions various operating systems web browsers support opera promised since may 3 2007 david storey chief web opener opera revealed microsoft poster mix conference shown opera integration part silverlight 1.1 however opera never officially supported silverlight linux freebsd functionality available via moonlight pipelight though projects discontinued moonlight available major linux distributions support firefox konqueror opera browsers provided obtained novell miguel de icaza expressed interest working developers operating systems bsd solaris browsers konqueror webkit opera ensure moonlight works fine systems availability moonlight version 1.0 freebsd announced march 2009 since reported actually work current version moonlight 4 preview 1 officially work new versions firefox newer 3.x gnu/linux-based operating systems however installed unofficial way example using add-on compatibility reporter add-on firefox 11 works correctly installed noted moonlight project abandoned may 2012 browser plugin named pipelight used provide silverlight access pipelight requires browser support npapi plugins newer versions firefox chrome opera dropped 2018 pipelight project discontinued silverlight available android ios prevalent operating systems mobile market silverlight primary development environment windows phone based silverlight 4 previous versions windows mobile first community technology preview ctp windows mobile 6 expected second quarter 2008 still officially announced microsoft stopped focusing bringing silverlight windows mobile 6.x nokia announced plans make silverlight mobile available s60 symbian os well series 40 devices nokia internet tablets later sold business microsoft sells android tablets sell alcatel-lucent branded smartphones silverlight mobile supports silverlight 2 content .net languages silverlight windows phone 7.5 based silverlight 4 silverlight applications could written .net programming language development tools used .net languages work silverlight provided target silverlight coreclr hosting application instead .net framework clr microsoft positioned microsoft expression blend companion tool visual studio design silverlight user interface applications visual studio used develop debug silverlight applications create silverlight projects let compiler target coreclr visual studio requires silverlight tools visual studio silverlight control zip format file extension .xap containing list one .net managed assemblies .dll files along appmanifest.xaml file containing list along entry point class assembly hosted html file using object tag example silverlight project contains silverlight.js createsilverlight.js files initializes silverlight plug-in use html pages xaml file ui code-behind files application code silverlight applications debugged manner similar asp.net applications visual studio clr remote cross platform debugging feature used debug silverlight applications running different platform well conjunction release silverlight 2 eclipse added development tool option april 2007 pc world report suggested microsoft intended release certain parts silverlight source code open source software week later sam ramji director platform technology strategy microsoft contradicted rumors confirming company plans open silverlight controls ship silverlight available microsoft public license part separate project known silverlight toolkit silverlight proprietary nature concern competition since may harm open nature world wide web advocates free software also concerned silverlight could another example microsoft embrace extend extinguish strategy microsoft silverlight adobe flash proprietary flash file formats publicly documented standards silverlight silverlight like web technologies uses patent-encumbered audio video codecs mono team abandoned development moonlight free open-source implementation silverlight 1 2 runtimes development discontinued 2012 due poor acceptance silverlight restrictions imposed microsoft project officially supported microsoft agreement novell made not-publicly-available additional specifications access silverlight base class library apis binary codecs test cases available mono team covenant novell granted exclusive access also specified conditions incompatible licensing covers free open source software examples specifically required software must obtained directly novell intermediate recipient must licensed gplv3 similar license free software proponents criticized covenant silverlight criticised living cross-platform operating system compatibility promises especially linux systems compared extensive support apple microsoft desktops internet explorer firefox chrome although microsoft officially collaborating moonlight project bruce chizen ceo adobe systems sells competing proprietary flash platform questioned commitment microsoft keep silverlight platform compatible os besides windows concerns based examples history said microsoft launched products promises ongoing cross-platform compatibility longer apply example internet explorer unix windows media player mac 2007 california several u.s. states asked district judge extend microsoft antitrust case settlement another five years citing number concerns including fear microsoft could use next version windows 'tilt playing field toward silverlight new adobe flash competitor says seattle post-intelligencer article final judgment motion extended settlement two years november 2009 reasons unrelated silverlight", + "neighbors": [ + 14, + 28, + 66, + 85, + 134, + 246, + 268, + 337, + 435, + 472, + 503, + 521, + 527, + 538, + 653, + 662, + 670, + 686, + 689, + 815, + 961, + 1018, + 1050, + 1068, + 1084, + 1101, + 1138, + 1161, + 1177, + 1189, + 1190, + 1228, + 1251, + 1264, + 1298, + 1332, + 1417, + 1428, + 1502, + 1508, + 1536, + 1547, + 1555, + 1582, + 1620, + 1625 + ], + "mask": "Test" + }, + { + "node_id": 1622, + "label": 2, + "text": "MirOS_Licence:miros licence miros licence free content licence software free cultural works graphical literal musical \u2026 originated miros project publications isc license used openbsd perceived problems wording america centric strong roots ucb bsd licence historical permission notice disclaimer focus modern explicit legible language usability european except uk specifically german authors hindering adoption authors legislations permissive \u201c bsd/mit-style \u201d licence another novelty licence specified kind copyrightable work start meets open source definition debian free software guidelines also open knowledge definition fact approved okfn long osi licence seen formal legal review listed ifross \u2019 licence centre webpages free software foundation formally added licence either free software licence free documentation license pages software directory category license accepted free content license according free cultural works definition", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1623, + "label": 4, + "text": "IT_risk_management:risk management risk management application risk management methods information technology order manage risk i.e onlyinclude risk management considered component wider enterprise risk management system establishment maintenance continuous update information security management system isms provide strong indication company using systematic approach identification assessment management information security risks different methodologies proposed manage risks divided processes steps /onlyinclude according risk framework encompasses negative impact operations service delivery bring destruction reduction value organization also benefit enabling risk associated missing opportunities use technology enable enhance business project management aspects like overspending late delivery adverse business impact risk strictly tied uncertainty decision theory applied manage risk science i.e rationally making choices uncertainty generally speaking risk product likelihood times impact risk likelihood impact measure risk determined product threat vulnerability asset values current risk management framework risk would tik framework process risk management ongoing iterative process must repeated indefinitely business environment constantly changing new threats vulnerabilities emerge every day choice countermeasures controls used manage risks must strike balance productivity cost effectiveness countermeasure value informational asset protected onlyinclude certified information systems auditor review manual 2006 produced isaca international professional association focused governance provides following definition risk management risk management process identifying vulnerabilities threats information resources used organization achieving business objectives deciding countermeasures take reducing risk acceptable level based value information resource organization /onlyinclude risk management process allows managers balance operational economic costs protective measures achieve gains mission capability protecting systems data support organizations \u2019 missions process unique environment indeed pervades decision-making areas daily lives head organizational unit must ensure organization capabilities needed accomplish mission mission owners must determine security capabilities systems must provide desired level mission support face real world threats organizations tight budgets security therefore security spending must reviewed thoroughly management decisions well-structured risk management methodology used effectively help management identify appropriate controls providing mission-essential security capabilities risk management world quite complex multi faced activity lot relations complex activities picture right shows relationships different related terms american national information assurance training education center defines risk management field organizations many others comprehensive enterprise risk management erm place four objective categories addressed according committee sponsoring organizations treadway commission coso according risk framework isaca risk transversal four categories risk managed framework enterprise risk management risk appetite risk sensitivity whole enterprise guide risk management process erm provide context business objectives risk management whilst methodology describe specific methods nevertheless specify several processes constitute generic framework need followed processes may broken sub-processes may combined sequence may change risk management exercise must carry processes one form another following table compares processes foreseen three leading standards isaca risk framework recent risk practitioner-guide compares risk iso 27005 term methodology means organized set principles rules drive action particular field knowledge overall comparison illustrated following table due probabilistic nature need cost benefit analysis risks managed following process according nist sp 800-30 divided following steps effective risk management must totally integrated systems development life cycle information risk analysis conducted applications computer installations networks systems development undertaken using structured methodologies step first step iso iso/iec 27005 framework elementary activities foreseen first sub process risk assessment according nist sp 800-30 step implies acquisition relevant information organization determination basic criteria purpose scope boundaries risk management activities organization charge risk management activities purpose usually compliance legal requirements provide evidence due diligence supporting isms certified scope incident reporting plan business continuity plan another area application certification product criteria include risk evaluation risk acceptance impact evaluation criteria conditioned establishing scope boundaries organization studied mission values structure strategy locations cultural environment constraints budgetary cultural political technical organization collected documented guide next steps set organization charge risk management foreseen partially fulfilling requirement provide resources needed establish implement operate monitor review maintain improve isms main roles inside organization risk management recurrent activity deals analysis planning implementation control monitoring implemented measurements enforced security policy contrary risk assessment executed discrete time points e.g year demand etc \u2013 performance next assessment provides temporary view assessed risks parameterizing entire risk management process view relationship risk management risk assessment depicted figure adopted octave risk assessment often conducted one iteration first high-level assessment identify high risks iterations detailed analysis major risks risks according national information assurance training education center risk assessment field risk assessment receives input output previous step context establishment output list assessed risks prioritized according risk evaluation criteria process divided following steps following table compares iso 27005 processes risk framework processes iso/iec 27002:2005 code practice information security management recommends following examined risk assessment risk identification states could cause potential loss following identified output sub process made two methods risk assessment information security field quantitative qualitative purely quantitative risk assessment mathematical calculation based security metrics asset system application risk scenario taking consideration different risk factors single loss expectancy sle determined considering probability occurrence given period basis example annual rate occurrence aro annualized loss expectancy determined product aro x sle important point values assets considered involved assets value directly affected resource example consider risk scenario laptop theft threat consider value data related asset contained computer reputation liability company assets deriving lost availability confidentiality data could involved easy understand intangible assets data reputation liability worth much physical resources risk laptop hardware example intangible asset value huge easy evaluate consideration pure quantitative approach qualitative risk assessment three five steps evaluation high low performed organization requires risk assessment performed relatively short time meet small budget significant quantity relevant data available persons performing assessment n't sophisticated mathematical financial risk assessment expertise required qualitative risk assessment performed shorter period time less data qualitative risk assessments typically performed interviews sample personnel relevant groups within organization charged security asset assessed qualitative risk assessments descriptive versus measurable usually qualitative classification done followed quantitative evaluation highest risks compared costs security measures risk estimation input output risk analysis split following steps output list risks value levels assigned documented risk register risks arising security threats adversary attacks may particularly difficult estimate difficulty made worse least system connected internet adversary intent capability may attack physical closeness access necessary initial models proposed problem risk estimation generally three values given asset one loss one cia properties confidentiality integrity availability risk evaluation process receives input output risk analysis process compares risk level risk acceptance criteria prioritise risk list risk treatment indications determine likelihood future adverse event threats system must conjunction potential vulnerabilities controls place system impact refers magnitude harm could caused threat \u2019 exercise vulnerability level impact governed potential mission impacts produces relative value assets resources affected e.g. criticality sensitivity system components data risk assessment methodology encompasses nine primary steps risk mitigation second process according sp 800-30 third according iso 27005 risk management involves prioritizing evaluating implementing appropriate risk-reducing controls recommended risk assessment process elimination risk usually impractical close impossible responsibility senior management functional business managers use least-cost approach implement appropriate controls decrease mission risk acceptable level minimal adverse impact organization \u2019 resources mission risk treatment process aim selecting security measures risk produce risk treatment plan output process residual risks subject acceptance management list select appropriate security measures single organization choose appropriate one according business strategy constraints environment circumstances choice rational documented importance accepting risk costly reduce high led fact risk acceptance considered separate process risk transfer apply risk high impact easy reduce significantly likelihood means security controls insurance premium compared mitigation costs eventually evaluating mixed strategy partially treat risk another option outsource risk somebody efficient manage risk risk avoidance describe action ways conducting business changed avoid risk occurrence example choice storing sensitive information customers avoidance risk customer data stolen residual risks i.e risk remaining risk treatment decision taken estimated ensure sufficient protection achieved residual risk unacceptable risk treatment process iterated risk mitigation systematic methodology used senior management reduce mission risk risk mitigation achieved following risk mitigation options address greatest risks strive sufficient risk mitigation lowest cost minimal impact mission capabilities suggestion contained risk communication horizontal process interacts bidirectionally processes risk management purpose establish common understanding aspect risk among organization stakeholder establishing common understanding important since influences decisions taken risk reduction overview method specifically designed process presents comprehensible overview coherence risks measures residual risks achieve common understanding risk management ongoing never ending process within process implemented security measures regularly monitored reviewed ensure work planned changes environment rendered ineffective business requirements vulnerabilities threats change time regular audits scheduled conducted independent party i.e somebody control responsible implementations daily management isms security controls validated technical controls possible complex systems tested verified hardest part validate people knowledge procedural controls effectiveness real application daily business security procedures vulnerability assessment internal external penetration test instruments verifying status security controls information technology security audit organizational procedural control aim evaluating security systems organization evolving quite rapidly risk management cope changes change authorization risk evaluation affected systems processes periodically review risks mitigation actions monitoring system events according security monitoring strategy incident response plan security validation metrics fundamental activities assure optimal level security obtained important monitor new vulnerabilities apply procedural technical security controls like regularly updating software evaluate kinds controls deal zero-day attacks attitude involved people benchmark best practice follow seminars professional associations sector factors assure state art organization risk management practice effective risk management must totally integrated sdlc system \u2019 sdlc five phases initiation development acquisition implementation operation maintenance disposal risk management methodology regardless sdlc phase assessment conducted risk management iterative process performed major phase sdlc nist sp 800-64 devoted topic early integration security sdlc enables agencies maximize return investment security programs guide focuses information security components sdlc first descriptions key security roles responsibilities needed information system developments provided second sufficient information sdlc provided allow person unfamiliar sdlc process understand relationship information security sdlc document integrates security steps linear sequential a.k.a waterfall sdlc five-step sdlc cited document example one method development intended mandate methodology lastly sp 800-64 provides insight projects initiatives clearly defined sdlc-based developments service-oriented architectures cross-organization projects facility developments security incorporated information systems acquisition development maintenance implementing effective security practices following areas information systems security begins incorporating security requirements process new application system enhancement security designed system beginning security requirements presented vendor requirements phase product purchase formal testing done determine whether product meets required security specifications prior purchasing product correct processing applications essential order prevent errors mitigate loss unauthorized modification misuse information effective coding techniques include validating input output data protecting message integrity using encryption checking processing errors creating activity logs applied properly cryptographic controls provide effective mechanisms protecting confidentiality authenticity integrity information institution develop policies use encryption including proper key management disk encryption one way protect data rest data transit protected alteration unauthorized viewing using ssl certificates issued certificate authority implemented public key infrastructure system files used applications must protected order ensure integrity stability application using source code repositories version control extensive testing production back-off plans appropriate access program code effective measures used protect application files security development support processes essential part comprehensive quality assurance production control process would usually involve training continuous oversight experienced staff applications need monitored patched technical vulnerabilities procedures applying patches include evaluating patches determine appropriateness whether successfully removed case negative impact risk management scientific methodology criticized shallow major risk management programmes large organizations mandated us federal information security management act criticized avoiding complexity accompanies formal probabilistic model risks uncertainty risk management looks like process attempts guess rather formally predict future basis statistical evidence highly subjective assessing value assets likelihood threats occurrence significance impact however better way deal subject emerged quite hard list methods least partially support risk management process efforts direction done enisa report classified different methods regarding completeness free availability tool support result factor analysis information risk fair main document introduction factor analysis information risk fair risk management insight llc november 2006 outline methods lack rigorous definition risk factors fair another methodology deal risk management complements existing methodologies fair good acceptance mainly open group isaca isaca developed methodology called risk address various kind related risks chiefly security related risks integrated cobit general framework manage risk broader concept risk methodologies encompasses negative impact operations service delivery bring destruction reduction value organization also benefit\\value enabling risk associated missing opportunities use technology enable enhance business project management aspects like overspending late delivery adverse business impact build security initiative homeland security department united states cites fair initiative build security collaborative effort provides practices tools guidelines rules principles resources software developers architects security practitioners use build security software every phase development chiefly address secure coding 2016 threat sketch launched abbreviated cyber security risk assessment specifically small organizations methodology uses real options forecast prioritize fixed list high-level threats number standards risk risk management description see main article", + "neighbors": [ + 103, + 379, + 600, + 800, + 1015 + ], + "mask": "Train" + }, + { + "node_id": 1624, + "label": 4, + "text": "Logjam_(computer_security):logjam computer security logjam security vulnerability diffie\u2013hellman key exchange ranging 512-bit us export-grade 1024-bit keys discovered group computer scientists publicly reported may 20 2015 diffie\u2013hellman key exchange depends security presumed difficulty solving discrete logarithm problem authors took advantage fact number field sieve algorithm generally effective method finding discrete logarithms consists four large computational steps first three depend order group g specific number whose finite log desired results first three steps precomputed saved used solve discrete log problem prime group relatively short time vulnerability known early 1992 turns much internet traffic uses one handful groups order 1024 bits less one approach enabled vulnerability authors demonstrated using man-in-the-middle network attacker downgrade transport layer security tls connection use 512-bit dh export-grade cryptography allowing read exchanged data inject data connection affects https smtps imaps protocols among others authors needed several thousand cpu cores week precompute data single 512-bit prime done however individual logarithms could solved minute using two 18-core intel xeon cpus cve id cve-2015-4000 authors also estimated feasibility attack 1024-bit diffie\u2013hellman primes design many diffie\u2013hellman implementations use pregenerated prime field considered secure since discrete log problem still considered hard big-enough primes even group known reused researchers calculated cost creating logjam precomputation one 1024-bit prime hundreds millions usd noted well within range fy2012 10.5 billion u.s. consolidated cryptologic program includes nsa reuse primes generating precomputation one prime would break two-thirds vpns quarter ssh servers globally researchers noted attack fits claims leaked nsa papers nsa able break much current cryptography recommend using primes 2048 bits defense switching elliptic-curve diffie\u2013hellman ecdh claims pratical implications attack however disputed security researchers eyal ronen adi shamir paper critical review imperfect forward secrecy", + "neighbors": [ + 88, + 172, + 235, + 260, + 261, + 319, + 533, + 539, + 542, + 554, + 692, + 800, + 826, + 858, + 1003, + 1089, + 1240, + 1330, + 1331, + 1452, + 1534, + 1597 + ], + "mask": "Test" + }, + { + "node_id": 1625, + "label": 2, + "text": "Windows_Driver_Frameworks:windows driver frameworks windows driver frameworks wdf formerly windows driver foundation set microsoft tools libraries aid creation device drivers windows 2000 later versions windows complements windows driver model abstracting away much boilerplate complexity writing windows drivers wdf consists kernel-mode driver framework kmdf user-mode driver framework umdf individual frameworks provide new object-oriented programming model windows driver development primary goals wdf conceptual scalability reduced duplication enabling developers apply concepts across different driver types reducing code overhead required drivers differs markedly windows driver model wdm requires driver developers fully familiar many complex technical details write basic driver part key achieving conceptual scalability kmdf umdf use opt-in model model allows developer extend override default behavior canonical good driver contrast windows driver model depends driver writer implement aspects driver behavior three types wdf drivers wdf also includes set static verification tools use driver writers tools examine driver code common errors and/or simulate code driver order identify problems difficult detect difficult test bold yes means introduced version windows", + "neighbors": [ + 28, + 268, + 412, + 435, + 472, + 521, + 670, + 689, + 815, + 1050, + 1068, + 1138, + 1177, + 1287, + 1417, + 1428, + 1502, + 1547, + 1582, + 1620, + 1621 + ], + "mask": "Test" + }, + { + "node_id": 1626, + "label": 9, + "text": "Polymorphism_(computer_science):polymorphism computer science programming languages type theory polymorphism provision single interface entities different types use single symbol represent multiple different types commonly recognised major classes polymorphism interest polymorphic type systems developed significantly 1960s practical implementations beginning appear end decade ad hoc polymorphism parametric polymorphism originally described christopher strachey fundamental concepts programming languages listed two main classes polymorphism ad hoc polymorphism feature algol 68 parametric polymorphism core feature ml type system 1985 paper peter wegner luca cardelli introduced term inclusion polymorphism model subtypes inheritance citing simula first programming language implement christopher strachey chose term ad hoc polymorphism refer polymorphic functions applied arguments different types behave differently depending type argument applied also known function overloading operator overloading term ad hoc context intended pejorative refers simply fact type polymorphism fundamental feature type system pascal delphi example codice_1 functions seem work generically various types looking invocations considered two entirely distinct functions compiler intents purposes dynamically typed languages situation complex correct function needs invoked might determinable run time implicit type conversion also defined form polymorphism referred coercion polymorphism parametric polymorphism allows function data type written generically handle values uniformly without depending type parametric polymorphism way make language expressive still maintaining full static type-safety concept parametric polymorphism applies data types functions function evaluate applied values different types known polymorphic function data type appear generalized type e.g list elements arbitrary type designated polymorphic data type like generalized type specializations made parametric polymorphism ubiquitous functional programming often simply referred polymorphism following example haskell shows parameterized list data type two parametrically polymorphic functions parametric polymorphism also available several object-oriented languages instance templates c++ name generics c java john c. reynolds later jean-yves girard formally developed notion polymorphism extension lambda calculus called polymorphic lambda calculus system f parametrically polymorphic function necessarily restricted working shape data instead value leading concept parametricity languages employ idea subtyping also called subtype polymorphism inclusion polymorphism restrict range types used particular case polymorphism languages subtyping allows function written take object certain type also work correctly passed object belongs type subtype according liskov substitution principle type relation sometimes written conversely said supertype \u2014written subtype polymorphism usually resolved dynamically see following example make cats dogs subtypes animals procedure codice_2 accepts animal also work correctly subtype passed another example number rational integer types number rational number integer function written take number work equally well passed integer rational passed number actual type object hidden clients black box accessed via object identity fact number type abstract may even possible get hands object whose most-derived type number see abstract data type abstract class particular kind type hierarchy known\u2014especially context scheme programming language\u2014as numerical tower usually contains many types object-oriented programming languages offer subtype polymorphism using subclassing also known inheritance typical implementations class contains called virtual table \u2014a table functions implement polymorphic part class interface\u2014and object contains pointer vtable class consulted whenever polymorphic method called mechanism example goes popular object systems however common lisp object system provide multiple dispatch method calls polymorphic arguments interaction parametric polymorphism subtyping leads concepts variance bounded quantification row polymorphism similar distinct concept subtyping deals structural types allows usage values whose types certain properties without losing remaining type information related concept polytypism data type genericity polytypic function general polymorphic function though one provide fixed ad hoc cases specific data types ad hoc combinator absent polymorphism distinguished implementation selected statically compile time dynamically run time typically via virtual function known respectively static dispatch dynamic dispatch corresponding forms polymorphism accordingly called static polymorphism dynamic polymorphism static polymorphism executes faster dynamic dispatch overhead requires additional compiler support static polymorphism allows greater static analysis compilers notably optimization source code analysis tools human readers programmers dynamic polymorphism flexible slower\u2014for example dynamic polymorphism allows duck typing dynamically linked library may operate objects without knowing full type static polymorphism typically occurs ad hoc polymorphism parametric polymorphism whereas dynamic polymorphism usual subtype polymorphism however possible achieve static polymorphism subtyping sophisticated use template metaprogramming namely curiously recurring template pattern", + "neighbors": [ + 78, + 246, + 378, + 447, + 538, + 567, + 579, + 820, + 948, + 1120, + 1221, + 1324, + 1389, + 1430, + 1437, + 1636 + ], + "mask": "Train" + }, + { + "node_id": 1627, + "label": 4, + "text": "Code_signing:code signing code signing process digitally signing executables scripts confirm software author guarantee code altered corrupted since signed process employs use cryptographic hash validate authenticity integrity code signing provide several valuable features common use code signing provide security deploying programming languages also used help prevent namespace conflicts almost every code signing implementation provide sort digital signature mechanism verify identity author build system checksum verify object modified also used provide versioning information object store meta data object efficacy code signing authentication mechanism software depends security underpinning signing keys public key infrastructure pki technologies integrity system relies publishers securing private keys unauthorized access keys stored software general-purpose computers susceptible compromise therefore secure best practice store keys secure tamper-proof cryptographic hardware devices known hardware security modules hsms many code signing implementations provide way sign code using system involving pair keys one public one private similar process employed tls ssh example case .net developer uses private key sign libraries executables time build key unique developer group sometimes per application object developer either generate key obtain one trusted certificate authority ca code signing particularly valuable distributed environments source given piece code may immediately evident example java applets activex controls active web browser scripting code another important usage safely provide updates patches existing software windows mac os x linux distributions provide updates using code signing ensure possible others maliciously distribute code via patch system allows receiving operating system verify update legitimate even update delivered third parties physical media disks code signing used windows mac os x authenticate software first run ensuring software maliciously tampered third-party distributor download site form code signing used linux platform decentralized nature package manager predominant mode distribution forms software updates patches well open-source model allowing direct inspection source code desired debian-based linux distributions among others validate downloaded packages using public key cryptography public key used authenticate code signature traceable back trusted root authority ca preferably using secure public key infrastructure pki ensure code trusted comes stated source explicitly particular private key ca provides root trust level able assign trust others proxy user trusts ca user presumably trust legitimacy code signed key generated ca one proxies many operating systems frameworks contain built-in trust one existing cas entrust datacard verisign/symantec digicert comodo godaddy globalsign also commonplace large organizations implement private ca internal organization provides features public cas trusted within organization model developers choose provide self-generated key scenario user would normally obtain public key fashion directly developer verify object first time many code signing systems store public key inside signature software frameworks oss check code signature executing allow choose trust developer point first run application developer provide similar system including public keys installer key used ensure subsequent objects need run upgrades plugins another application verified coming developer time-stamping designed circumvent trust warning appear case expired certificate effect time-stamping extends code trust beyond validity period certificate event certificate revoked due compromise specific date time compromising event become part revocation record case time-stamping helps establish whether code signed certificate compromised developers need sign ios tvos apps running real device uploading app store needed prove developer owns valid apple developer id application needs valid profile certificate run devices like security measure code signing defeated users tricked running unsigned code even running code refuses validate system remains secure long private key remains private also important note code signing protect end user malicious activity unintentional software bugs software author \u2014 merely ensures software modified anyone author sometimes sandbox systems accept certificates false time-stamp excess usage ram ibm lotus notes pki signing code release 1 client server software execution control lists control levels access data environment file system permitted given users individual design elements including active items scripts actions agents always signed using editor id file includes editor domain public keys core templates mail template signed dedicated id held lotus template development team microsoft implements form code signing based authenticode provided microsoft tested drivers since drivers run kernel destabilize system open system security holes reason microsoft tests drivers submitted whql program driver passed microsoft signs version driver safe 32-bit systems installing drivers validated microsoft possible accepting allow installation prompt warning user code unsigned .net managed code additional mechanism called strong name signing uses public/private keys sha-1 hash opposed certificates however microsoft discourages reliance strong name signing replacement authenticode context consumer devices games consoles unsigned code often used refer application signed cryptographic key normally required software accepted executed console games signed secret key designed console maker game load console several methods get unsigned code execute include software exploits use modchip technique known swap trick running softmod may initially seem obvious simply copying signed application onto another dvd allow boot xbox reason xbox executable file xbe contains media-type flag specifies type media xbe bootable nearly xbox software set executable boot factory produced discs simply copying executable burnable media enough stop execution software however since executable signed simply changing value flag possible alters signature executable causing fail validation checked proliferation connected devices required ability identify authenticate devices ability applies area internet things iot iot requires devices trusted iot code signing software release process ensures integrity iot device software firmware updates defends risks associated tampering device code embedded device credentialing enables control manufacturing process high technology products protects unauthorized production counterfeits together code signing technology ensures physical authenticity authenticity integrity code possess time manufacture use digital birth certificate subsequent upgrades code validation time product lifecycle creating new dimension code signing elevating security awareness need maintain private signing keys secured within dedicated protected environment establish root trust entire system given prevalence malware advanced persistent threats apts many software vendors providers online services enterprise organizations manufacturers high-technology iot devices pressure increase security high technology manufacturing code signing process", + "neighbors": [ + 88, + 99, + 165, + 198, + 359, + 716, + 818, + 961, + 1266, + 1292, + 1325, + 1373, + 1379, + 1417, + 1452, + 1534 + ], + "mask": "Test" + }, + { + "node_id": 1628, + "label": 3, + "text": "Brooks's_law:brooks law brooks law observation software project management according adding human resources late software project makes later coined fred brooks 1975 book mythical man-month according brooks incremental person added project makes take less time similar general law diminishing returns economics according brooks law outrageous oversimplification captures general rule brooks points main factors explain works way key points brooks law allow exceptions open door possible solutions first point note brooks law applies projects already late projects brought back kept control people added earlier process also important determine project really late schedule originally overly optimistic scheduling mistakes account large number late projects correcting schedule best way meaningful reliable time frame project completion quantity quality role people added project also must taken consideration one simple way circumvent law overrun project add people needed way extra capacity compensates training communication overhead good programmers specialists added less overhead training people added tasks related project example quality assurance documentation given task clear ramp time minimized modern practices continuous integration test-driven development iterative development significantly reduce inter-developer communication overhead thus allow better scalability new tools software development documentation also help minimize ramp time making simpler new programmers get involved work design patterns simplify distribution work entire team part within framework provided pattern design pattern defines rules programmers follow simplifies communication use standard language provides consistency scalability finally good segmentation helps minimizing communication overhead team members smaller sub-problems solved smaller team top-level team responsible systems integration method work segmentation problem must done correctly first place done incorrectly make problem worse better impeding communication programmers working parts problem actually closely coupled even project plan decreed way finish project invert brooks law bermuda plan 90 developers removed send bermuda remaining 10 complete software", + "neighbors": [], + "mask": "Validation" + }, + { + "node_id": 1629, + "label": 3, + "text": "IBM_System/38:ibm system/38 system/38 minicomputer midrange computer server platform manufactured sold ibm corporation system offered number innovative features brainchild frank soltis glenn henry ibm announced system/38 1978 developed code-name pacific made commercially available august 1979 system/38 oriented toward multi-user system environment typical system handled dozen several dozen terminals midrange predecessors system/38 included system/3 system/32 system/34 system/38 offered capacity previous system/34 system/38 chronologically preceded system/36 successor system/34 system/38 nearly called system/380 as/400 nearly called system/40 system/38 superseded as/400 also supported system/36 data programs fairly large extent exceptions as/400 primarily re-marketing system/38 updates operating system including luxurious non-trivial expansion source object names 8 new 10 characters maximum s/38 programs 'observability intact source code embedded within compiled binary executive expense larger compiled object sizes still run as/400 successor systems restore option incorporates recompile back-version source however proprietary vendor application libraries objects compiled without 'observability required original vendor replacement consequent expense upgrading as/400 pricing time tiered exact software priced based upon model speed capacity system installed upon as/400 evolved iseries turn evolved system although 'evolution include significant enhancements hardware operating system capabilities name change usually considered evolution marketing system/38 legacy lives enterprise-class ibm power systems series superseded system 2008 run ibm well aix linux contrast competing proprietary computing architectures early 1980s wang vs hewlett packard hp 3000 long discontinued without compatible upgrade path ibm 5381 system unit contained processor main memory disk storage diskette magazine drive system console keyboard display 5381 available model 100 model 200 ibm 5382 system unit physically identical 5381 powerful processors memory disk storage 5382 available models 300 400 500 600 700 hindsight system/38 architecture probably demanding hardware era first launched struggled overhead software operating system consumed almost 60 mb disk vast sum time leading wags suggest pre-announce code name series pacific actually acronym meaning performance ai n't critical function complete system included central processing unit 512k 768k 1024k 1280k 1536k bytes main storage included memory management unit supporting demand paging used system software implement single-level store architecture system/38 console included keyboard display screen 16 lines 64 characters inconsistent locally attached 5250 terminals either 12x40 24x80 depending model keyboard used system operator entering control language commands diskette magazine drive standard models operating system system/38 called cpf control program facility cpf related ssp operating system ibm system/34 system/36 cpf objects files programs message queues user profiles libraries system/38 also distinction first commercially available ibm midrange computer database management system dbms integrated operating system operational control language system/38 called cl control language cl programs similar concept shell scripts could compiled executed natively system/38 48-bit addressing unique time novel integrated database system system/38 also security built part architecture object library could access controlled user-by-user basis continued expanded throughout as/400 iseries computer lines system/38 descendants commercial computers ever use machine interface architecture isolate application software operating system hardware dependencies including details address size register size compilers system/38 successors generate code high-level instruction set originally called mi machine interface renamed timi technology independent machine interface as/400 mi/timi virtual instruction set instruction set underlying cpu unlike virtual-machine architectures virtual instructions interpreted runtime see p-code machine mi/timi instructions never interpreted constitute intermediate compile time step translated processor instruction set final compilation step mi/timi instructions stored within final program object addition executable machine instructions program moved processor one native instruction set processor another native instruction set mi/timi instructions re-translated native instruction set new machine program executed first time new machine result possible program originally developed system/38 run current ibm hardware without ever recompiled capability allowed as/400 migrate cisc complex instruction set computer risc reduced instruction set computer 1990s mi/timi instructions existed compiled program relatively simple re-translation created new program native new hardware 1986 system/38 announced support distributed data management architecture ddm middleware context distributed system software layer lies operating system applications distributed data management architecture defines environment sharing data enabled system/38 programs create manage access record-oriented files remote system/36 system/38 ibm mainframe systems running cics also allowed programs remote system/36 system/38 computers create manage access files system/38 languages supported system/38 included rpg iii cobol basic pl/i decades later software originally dismissed critics momentary aberration runs better ever many thousands modern iseries ibm/i systems within commercial government enterprises types sizes ibm sold estimated 20,000 system/38s within first five years availability according articles published industry magazines news 34/38 midrange computing although billed minicomputer s/38 much expensive ibm established best-selling system/34 replacement system/36 equal importance difficulty upgrading say system/34 s/38 although machines similarities twinax peripherals rpg programming languages reality different ibm tacitly acknowledged bringing system/36 \u2013 upgraded system/34 \u2013 launch s/38 marketplace ibm thus found three overlapping incompatible ranges system/34/36 system/38 mainframe /360 architecture system/38 originally designed replace digital equipment corporation time one ibm main competitors able exploit offering wide range products based single architecture ibm counter 9370 'baby mainframe commercial failure", + "neighbors": [ + 134, + 270, + 292, + 322, + 349, + 388, + 412, + 429, + 590, + 1217, + 1224, + 1457, + 1535, + 1616 + ], + "mask": "Validation" + }, + { + "node_id": 1630, + "label": 8, + "text": "Common_Base_Event:common base event common base event cbe ibm implementation web services distributed management wsdm event format standard ibm also implemented common event infrastructure unified set apis infrastructure creation transmission persistence distribution wide range business system network common base event formatted events", + "neighbors": [], + "mask": "Test" + }, + { + "node_id": 1631, + "label": 2, + "text": "Hobbyist_operating_system_development:hobbyist operating system development hobbyist operating system development one involved technical options computer hobbyist definition hobby operating system sometimes vague developer view developers fun learning also seen users view users using toy defined operating system n't big user base development begin existing resources like kernel operating system bootloader also made completely scratch development platform could bare hardware machine nature operating system developed tested virtual machine since hobbyist must claim ownership adapting complex system ever-changing needs technical terrain much enthusiasm common amongst many different groups attracted operating system development elements operating system development include c programming language frequently used hobby operating system programming well assembly language though languages used well use assembly language common small systems especially based eight bit microprocessors mos technology 6502 family zilog z-80 systems lack available resources small output size low-level efficiency hobby operating systems use command-line interface simple text user interface due ease development advanced hobby operating systems may graphical user interface example atheos hobby operating system graphical interface written entirely one programmer section predominantly x86 oriented term bios basic input/output system refers firmware initialises computer hardware provisions load operating system bios also sets standard interface several low-level device drivers boot time bios resources often used hobbyist operating systems especially written 16-bit x86 machines many hobby operating systems developers lack time write complex low level drivers simply want get writing software system soon possible commonly used bios functions videobios disk services used video cards disk drives vary significantly different machines specialised drivers often difficult write use bios uncommon operating systems operate protected mode long mode system must switch back real mode bios drivers run", + "neighbors": [ + 1, + 9, + 22, + 37, + 42, + 55, + 58, + 64, + 78, + 85, + 99, + 134, + 170, + 171, + 185, + 234, + 265, + 306, + 322, + 353, + 380, + 387, + 434, + 465, + 583, + 650, + 664, + 720, + 721, + 754, + 797, + 884, + 891, + 954, + 961, + 966, + 996, + 1011, + 1012, + 1024, + 1040, + 1049, + 1053, + 1054, + 1063, + 1138, + 1202, + 1224, + 1301, + 1304, + 1391, + 1394, + 1398, + 1415, + 1441, + 1456, + 1530, + 1546, + 1578, + 1610, + 1637 + ], + "mask": "Test" + }, + { + "node_id": 1632, + "label": 3, + "text": "VAX:vax vax discontinued instruction set architecture isa developed digital equipment corporation dec mid-1970s vax-11/780 introduced october 25 1977 first range popular influential computers implementing architecture 32-bit system complex instruction set computer cisc architecture based dec earlier pdp-11 vax virtual address extension designed extend replace dec various programmed data processor pdp isas vax architecture primary features virtual addressing example demand paged virtual memory orthogonal instruction set vax perceived quintessential cisc isa large number assembly-language-programmer-friendly addressing modes machine instructions highly orthogonal architecture instructions complex operations queue insertion deletion polynomial evaluation historically one studied commented-on isa computer history vax succeeded dec alpha instruction set architecture name vax originated acronym virtual address extension vax seen 32-bit extension older 16-bit pdp-11 prime computer early adopter virtual memory manage larger address space early versions vax processor implement compatibility mode emulates many pdp-11 instructions giving 11 vax-11 highlight compatibility later versions offloaded compatibility mode less used cisc instructions emulation operating system software vax instruction set designed powerful orthogonal introduced many programs written assembly language programmer-friendly instruction set important time programs written higher-level language instruction set became less visible ones much concerned compiler writers one unusual aspect vax instruction set presence register masks start subprogram arbitrary bit patterns specify control passed subprogram registers preserved since register masks form data embedded within executable code make linear parsing machine code difficult complicate optimization techniques applied machine code native vax operating system digital vax/vms renamed openvms 1991 early 1992 ported alpha modified comply posix standards branded compliant xpg4 x/open consortium vax architecture openvms operating system engineered concurrently take maximum advantage initial implementation vaxcluster facility vax operating systems included various releases bsd unix 4.3bsd ultrix-32 vaxeln xinu recently netbsd openbsd supported various vax models work done porting linux vax architecture openbsd discontinued support architecture september 2016 first vax model sold vax-11/780 introduced october 25 1977 digital equipment corporation annual meeting shareholders bill strecker c. gordon bell doctoral student carnegie mellon university responsible architecture many different models different prices performance levels capacities subsequently created vax superminicomputers popular early 1980s vax-11/780 used standard cpu benchmarks initially described one-mips machine performance equivalent ibm system/360 ran one mips system/360 implementations previously de facto performance standards actual number instructions executed 1 second 500,000 led complaints marketing exaggeration result definition vax mips speed vax-11/780 computer performing 27 vax mips would run program roughly 27 times faster vax-11/780 within digital community term vup vax unit performance common term mips compare well across different architectures related term cluster vups informally used describe aggregate performance vaxcluster performance vax-11/780 still serves baseline metric brl-cad benchmark performance analysis suite included brl-cad solid modeling software distribution vax-11/780 included subordinate stand-alone lsi-11 computer performed microcode load booting diagnostic functions parent computer dropped subsequent vax models enterprising vax-11/780 users could therefore run three different digital equipment corporation operating systems vms vax processor hard drives either rsx-11s rt-11 lsi-11 single density single drive floppy disk vax went many different implementations original vax 11/780 implemented ttl filled four-by-five-foot cabinet single cpu cpu implementations consisted multiple ecl gate array macrocell array chips included vax 8600 8800 superminis finally vax 9000 mainframe class machines cpu implementations consisted multiple mosfet custom chips included 8100 8200 class machines vax 11-730 725 low-end machines built using bit-slice components microvax represented major transition within vax family time design yet possible implement full vax architecture single vlsi chip even vlsi chips later done v-11 cpu vax 8200/8300 instead microvax first vax implementation move complex vax instructions packed decimal related opcodes emulation software partitioning substantially reduced amount microcode required referred microvax architecture microvax alu registers implemented single gate-array chip rest machine control conventional logic full vlsi microprocessor implementation microvax architecture arrived microvax ii 78032 dc333 cpu 78132 dc335 fpu 78032 first microprocessor on-board memory management unit microvax ii based single quad-sized processor board carried processor chips ran microvms ultrix-32 operating systems machine featured 1 mb on-board memory q22-bus interface dma transfers microvax ii succeeded many microvax models much improved performance memory vlsi vax processors followed form v-11 cvax cvax soc system chip single-chip cvax rigel mariah nvax implementations vax microprocessors extended architecture inexpensive workstations later also supplanted high-end vax models wide range platforms mainframe workstation using one architecture unique computer industry time sundry graphics etched onto cvax microprocessor die phrase cvax ... care enough steal best etched broken russian play hallmark cards slogan intended message soviet engineers known purloining dec computers military applications reverse engineering chip design dec product offerings vax architecture eventually superseded risc technology 1989 dec introduced range workstations servers ran ultrix decstation decsystem respectively based processors implemented mips architecture 1992 dec introduced risc instruction set architecture alpha axp later renamed alpha alpha-based microprocessor decchip 21064 high performance 64-bit design capable running openvms august 2000 compaq announced remaining vax models would discontinued end year 2005 manufacturing vax computers ceased old systems remain widespread use stromasys charon-vax simh software-based vax emulators remain available vax virtual memory divided four sections one gigabyte context addressing 2 bytes size vms p0 used user process space p1 process stack s0 operating system s1 reserved vax four hardware implemented privilege modes vax supports many addressing modes literal register postincrement predecrement register deferred postincrement deferred predecrement deferred displacement byte word long displacement byte word long deferred also indexed may combined many immediate mode synonymous program counter pc postincrement many addressing modes could use program counter also r15 instead registers provided easy generation position-independent code pc-relative addressing vax also load effective address instructions access memory compute address used first vax-based system vax-11/780 member vax-11 family high-end vax 8600 replaced vax-11/780 october 1984 joined entry-level microvax minicomputers vaxstation workstations mid-1980s microvax superseded vax 4000 vax 8000 superseded vax 6000 late 1980s mainframe-class vax 9000 introduced early 1990s fault-tolerant vaxft introduced alpha compatible vax 7000/10000 variant various vax-based systems sold vaxserver cancelled systems include bvax high-end ecl-based vax two ecl-based vax models argonaut raven raven cancelled 1990 vax known gemini also cancelled fall-back case lsi-based scorpio failed never shipped number vax clones authorized unauthorized produced examples include", + "neighbors": [ + 51, + 61, + 76, + 85, + 86, + 123, + 127, + 134, + 142, + 206, + 210, + 212, + 224, + 230, + 270, + 271, + 272, + 308, + 314, + 322, + 331, + 352, + 388, + 443, + 457, + 460, + 465, + 506, + 508, + 529, + 564, + 579, + 589, + 643, + 659, + 719, + 739, + 752, + 803, + 821, + 846, + 901, + 907, + 937, + 941, + 946, + 957, + 966, + 980, + 984, + 994, + 1002, + 1009, + 1013, + 1016, + 1022, + 1052, + 1072, + 1081, + 1111, + 1113, + 1125, + 1130, + 1132, + 1138, + 1174, + 1207, + 1213, + 1217, + 1219, + 1256, + 1272, + 1274, + 1290, + 1301, + 1398, + 1421, + 1499, + 1503, + 1505, + 1507, + 1518, + 1519, + 1523, + 1525, + 1538, + 1557, + 1578, + 1605, + 1608, + 1609, + 1616 + ], + "mask": "Test" + }, + { + "node_id": 1633, + "label": 9, + "text": "Programming_language_implementation:programming language implementation programming language implementation system executing computer programs two general approaches programming language implementation notice compiler directly execute program ultimately order execute program via compilation must translated form serve input interpreter directly hardware piece computer hardware interpret programming language directly language called machine code so-called native code compiler one compiles program machine code actual compilation often separated multiple passes like code generation often assembler language translator generating native code linking loading execution compiler given high level language produces another high level language called translator source source translation often useful add extensions existing languages exploit good portable implementation language example c simplifying development many combinations interpretation compilation possible many modern programming language implementations include elements example smalltalk programming language conventionally implemented compilation bytecode either interpreted compiled virtual machine popular ways use jit aot compiler compilation implementation strategy copied many languages since smalltalk pioneered every programming language requires abstract machines bridge gap high level language low level real machine", + "neighbors": [ + 27, + 46, + 65, + 87, + 117, + 176, + 194, + 207, + 216, + 251, + 292, + 302, + 306, + 308, + 313, + 332, + 373, + 392, + 446, + 447, + 454, + 506, + 509, + 536, + 565, + 567, + 579, + 649, + 653, + 682, + 753, + 786, + 787, + 919, + 929, + 934, + 940, + 947, + 978, + 1021, + 1037, + 1044, + 1059, + 1118, + 1119, + 1123, + 1146, + 1173, + 1207, + 1221, + 1225, + 1231, + 1233, + 1235, + 1245, + 1251, + 1264, + 1277, + 1298, + 1311, + 1315, + 1319, + 1372, + 1375, + 1389, + 1413, + 1430, + 1466, + 1516, + 1588, + 1609 + ], + "mask": "Test" + }, + { + "node_id": 1634, + "label": 4, + "text": "Super_Flexible:super flexible super flexible file synchronizer backup file synchronization software allows backing synchronizing files different drives different media cd dvd flash zip remote server", + "neighbors": [ + 272, + 494, + 528, + 961, + 1138, + 1289, + 1452, + 1618 + ], + "mask": "Validation" + }, + { + "node_id": 1635, + "label": 4, + "text": "Aaron_Swartz:aaron swartz aaron hillel swartz november 8 1986january 11 2013 american computer programmer entrepreneur writer political organizer internet hacktivist involved development web feed format rss markdown publishing format organization creative commons website framework web.py co-founder social news site reddit given title co-founder combinator owner paul graham formation bug inc. merger swartz project infogami company run alexis ohanian steve huffman swartz work also focused civic awareness activism helped launch progressive change campaign committee 2009 learn effective online activism 2010 became research fellow harvard university safra research lab institutional corruption directed lawrence lessig founded online group demand progress known campaign stop online piracy act 2011 swartz arrested massachusetts institute technology mit police state breaking-and-entering charges connecting computer mit network unmarked unlocked closet setting download academic journal articles systematically jstor using guest user account issued mit federal prosecutors later charged two counts wire fraud eleven violations computer fraud abuse act carrying cumulative maximum penalty 1 million fines 35 years prison asset forfeiture restitution supervised release swartz declined plea bargain would served six months federal prison two days prosecution rejected counter-offer swartz found dead brooklyn apartment hanged 2013 swartz inducted posthumously internet hall fame swartz born highland park illinois suburb chicago eldest son jewish parents susan robert swartz brother noah benjamin father founded software firm mark williams company swartz immersed study computers programming internet internet culture attended north shore country day school small private school near chicago 9th grade swartz left high school 10th grade enrolled courses chicago area college 1999 13 years old created website theinfo.org collaborative online library theinfo.org made swartz winner arsdigita prize given young people create useful educational collaborative noncommercial websites age 14 became member working group authored rss 1.0 web syndication specification swartz attended stanford university dropped first year swartz first year stanford applied combinator first summer founders program proposing work startup called infogami designed flexible content management system allow creation rich visually interesting websites form wiki structured data working infogami co-founder simon carstensen summer 2005 aaron opted return stanford choosing instead continue develop seek funding infogami part work infogami swartz created web.py web application framework unhappy available systems python programming language early fall 2005 swartz worked fellow co-founders another nascent y-combinator firm reddit rewrite reddit lisp codebase using python web.py although infogami platform abandoned bug acquired infogami software used support internet archive open library project web.py web framework used basis many projects swartz many others infogami failed find funding y-combinator organizers suggested infogami merge reddit november 2005 resulting formation new firm bug devoted promoting products result merger swartz given title co-founder reddit although projects initially struggled gain traction reddit began make large gains popularity 2005 2006 october 2006 based largely success reddit bug acquired cond\u00e9 nast publications owner wired magazine swartz moved company san francisco work wired swartz found office life uncongenial ultimately left company september 2007 swartz joined infogami co-founder simon carstensen launch new firm jottit another attempt create another markdown driven content management system python 2008 swartz founded watchdog.net good government site teeth aggregate visualize data politicians year wrote widely circulated guerilla open access manifesto december 27 2010 swartz filed freedom information act foia request learn treatment chelsea manning alleged source wikileaks 2008 swartz downloaded 2.7 million federal court documents stored pacer public access court electronic records database managed administrative office united states courts huffington post characterized actions way swartz downloaded public court documents pacer system effort make available outside expensive service move drew attention fbi ultimately decided press charges documents fact public pacer charging 8 cents per page information carl malamud founded nonprofit group public.resource.org contended free federal documents covered copyright fees plowed back courts finance technology system ran budget surplus 150 million according court reports reported new york times pacer used technology designed bygone days screechy telephone modems ... putting nation legal system behind wall cash kludge malamud appealed fellow activists urging visit one 17 libraries conducting free trial pacer system download court documents send public distribution reading malamud call action swartz used perl computer script running amazon cloud servers download documents using credentials belonging sacramento library september 4 20 2008 accessed documents uploaded cloud computing service released documents malamud organization september 29 2008 gpo suspended free trial pending evaluation program swartz actions subsequently investigated fbi case closed two months charges filed swartz learned details investigation result filing foia request fbi described response usual mess confusions shows fbi lack sense humor pacer still charges per page customers using firefox option saving documents free public access plug-in called recap 2013 memorial swartz malamud recalled work pacer brought millions u.s. district court records behind pacer pay wall said found full privacy violations including medical records names minor children confidential informants malamud penned detailed account collaboration swartz pacer project essay appears website writing ars technica timothy lee later made use documents obtained swartz co-creator recap offered insight discrepancies reporting much data swartz downloaded back-of-the-envelope calculation days offsite crawl shut swartz guessed got around 25 percent documents pacer new york times similarly reported swartz downloaded estimated 20 percent entire database based facts swartz downloaded 2.7 million documents pacer time contained 500 million lee concluded swartz downloaded less one percent database 2009 wanting learn effective activism swartz helped launch progressive change campaign committee wrote blog spend days experimenting new ways get progressive policies enacted progressive politicians elected swartz led first activism event career progressive change campaign committee delivering thousands honor kennedy petition signatures massachusetts legislators asking fulfill former senator ted kennedy last wish appointing senator vote health care reform 2010 swartz co-founded demand progress political advocacy group organizes people online take action contacting congress leaders funding pressure tactics spreading word civil liberties government reform issues academic year 2010\u201311 swartz conducted research studies political corruption lab fellow harvard university edmond j. safra research lab institutional corruption author cory doctorow novel homeland drew advice swartz setting protagonist could use information available voters create grass-roots anti-establishment political campaign afterword novel swartz wrote political hacktivist tools used anyone motivated talented enough ... change system ... let know help swartz involved campaign prevent passage stop online piracy act sopa sought combat internet copyright violations criticized basis would made easier u.s. government shut web sites accused violating copyright would placed intolerable burdens internet providers following defeat bill swartz keynote speaker f2c freedom connect 2012 event washington d.c. may 21 2012 speech titled stopped sopa informed audience added fight everyone made hero story everyone took job save crucial freedom referring series protests bill numerous websites described electronic frontier foundation biggest internet history 115,000 sites altering webpages swartz also presented topic event organized thoughtworks swartz participated wikipedia august 2003 2006 ran unsuccessfully wikimedia foundation board trustees 2006 swartz wrote analysis wikipedia articles written concluded bulk actual content comes tens thousands occasional contributors outsiders made contributions site core group 500 1,000 regular editors tend correct spelling formatting errors according swartz formatters aid contributors way around conclusions based analysis edit histories several randomly selected articles contradicted opinion wikipedia co-founder jimmy wales believed core group regular editors providing content thousands others contributed formatting issues swartz came conclusions counting total number characters added editor particular article wales counted total number edits aaron swartz noted knowledge produced public universities financed us government graduate students released free public instead copyrighted benefits given authors privatized locked for-profit corporations invest public works instead earned billions us dollars year private publishers since publications repackaged academic databases university libraries pay thousands dollars subscribe students access content swartz used full text scholarly online databases jstor accessed mit network order download books journals etc produced thanks public funds paid money collected taxpayers according state federal authorities swartz used jstor digital repository download large number academic journal articles mit computer network course weeks late 2010 early 2011 time swartz research fellow harvard university provided jstor account visitors mit open campus authorized access jstor network authorities said swartz downloaded documents laptop connected networking switch controlled-access wiring closet mit door closet kept unlocked according press reports discovered video camera placed room film swartz swartz computer left untouched video captured swartz download stopped swartz identified rather pursue civil lawsuit june 2011 reached settlement wherein surrendered downloaded data september 25 2010 ip address 18.55.6.215 part mit network began sending hundreds pdf download requests per minute affecting performance entire jstor site prompted block ip address morning another ip address also within mit network began sending jstor pdf download requests resulting temporary full block firewall level mit servers entire 18.0.0.0/8 range email sent mit describing situation email sent september 29 2010 one jstor employee wrote mit july 30 2013 jstor released 300 partially redacted documents provided incriminating evidence aaron swartz documents originally sent united states attorney office response subpoenas case united states v. aaron swartz following images excerpts 3,461-page pdf document night january 6 2011 swartz arrested near harvard campus mit police united states secret service agent arraigned cambridge district court two state charges breaking entering intent commit felony july 11 2011 swartz indicted federal grand jury charges wire fraud computer fraud unlawfully obtaining information protected computer recklessly damaging protected computer november 17 2011 swartz indicted middlesex county superior court grand jury state charges breaking entering intent grand larceny unauthorized access computer network december 16 2011 state prosecutors filed notice dropping two original charges charges listed november 17 2011 indictment dropped march 8 2012 according spokesperson middlesex county prosecutor state charges dropped permit federal prosecution headed stephen p. heymann supported evidence provided secret service agent michael s. pickett proceed unimpeded september 12 2012 federal prosecutors filed superseding indictment adding nine felony counts increased swartz maximum criminal exposure 50 years imprisonment 1 million fines plea negotiations swartz attorneys prosecutors offered recommend sentence six months low-security prison swartz would plead guilty 13 federal crimes swartz lead attorney rejected deal opting instead trial prosecutors would forced justify pursuit swartz federal prosecution involved characterized numerous critics former nixon white house counsel john dean overcharging 13-count indictment overzealous prosecution alleged computer crimes brought former u.s. attorney massachusetts carmen ortiz swartz died suicide january 11 2013 death federal prosecutors dropped charges december 4 2013 due freedom information act suit investigations editor wired magazine several documents related case released secret service including video swartz entering mit network closet evening january 11 2013 swartz found dead brooklyn apartment partner taren stinebrickner-kauffman spokeswoman new york medical examiner reported hanged suicide note found swartz family partner created memorial website issued statement saying used prodigious skills programmer technologist enrich make internet world fairer better place days swartz funeral lawrence lessig eulogized friend sometime-client essay prosecutor bully decried disproportionality swartz prosecution said question government needs answer necessary aaron swartz labeled 'felon 18 months negotiations willing accept cory doctorow wrote aaron unbeatable combination political insight technical skill intelligence people issues think could revolutionized american worldwide politics legacy may still yet swartz funeral services held january 15 2013 central avenue synagogue highland park illinois tim berners-lee creator world wide web delivered eulogy day wall street journal published story based part interview stinebrickner-kauffman told journal swartz lacked money pay trial hard ... make part life go public asking help also distressed said two friends subpoenaed longer believed mit would try stop prosecution several memorials followed soon afterward january 19 hundreds attended memorial cooper union speakers included stinebrickner-kauffman open source advocate doc searls creative commons glenn otis brown journalist quinn norton roy singham thoughtworks david segal demand progress january 24 memorial internet archive speakers including stinebrickner-kauffman alex stamos brewster kahle carl malamud february 4 memorial held cannon house office building capitol hill speakers memorial included senator ron wyden representatives darrell issa alan grayson jared polis lawmakers attendance included senator elizabeth warren representatives zoe lofgren jan schakowsky memorial also took place march 12 mit media lab swartz family recommended givewell donations memory organization swartz admired collaborated sole beneficiary january 12 2013 swartz family partner issued statement criticizing prosecutors mit speaking son funeral january 15 robert swartz said aaron killed government mit betrayed basic principles tom dolan husband u.s. attorney massachusetts carmen ortiz whose office prosecuted swartz case replied criticism swartz family truly incredible son obit blame others death make mention 6-month offer comment triggered criticism esquire writer charlie pierce replied glibness husband defenders toss 'mere six months federal prison low-security indication something seriously whack way prosecutors think days mit maintains open-campus policy along open network two days swartz death mit president l. rafael reif commissioned professor hal abelson lead analysis mit options decisions relating swartz legal struggles help guide fact-finding stage review mit created website community members could suggest questions issues review address swartz attorneys requested pretrial discovery documents made public move mit opposed swartz allies criticized mit opposition releasing evidence without redactions july 26 2013 abelson panel submitted 182-page report mit president l. rafael reif authorized public release july 30 panel reported mit supported charges swartz cleared institution wrongdoing however report also noted despite mit advocacy open access culture institutional level beyond university never extended support swartz report revealed example mit considered possibility issuing public statement position case statement never materialized huffington post reported ortiz faced significant backlash pursuing case swartz including petition white house fired news outlets reported similarly reuters news agency called swartz online icon help ed make virtual mountain information freely available public including estimated 19 million pages federal court documents associated press ap reported swartz case highlights society uncertain evolving view treat people break computer systems share data enrich make available others jstor lawyer former u.s. attorney southern district new york mary jo white asked lead prosecutor drop charges discussed editor hrag vartanian hyperallergic brooklyn new york muralist bamn means necessary created mural swartz swartz amazing human fought tirelessly right free open internet artist explained much 'reddit guy speaking april 17 2013 yuval noah harari described swartz first martyr freedom information movement aaron swartz legacy reported strengthening open access scholarship movement illinois home state swartz influence led state university faculties adopt policies favor open access january 13 2013 members anonymous hacked two websites mit domain replacing tributes swartz called members internet community use death rallying point open access movement banner included list demands improvements u.s. copyright system along swartz guerilla open access manifesto night january 18 2013 mit e-mail system taken offline ten hours january 22 e-mail sent mit redirected hackers aush0k tibitximer korea advanced institute science technology traffic mit redirected computer harvard university publishing statement headed r.i.p aaron swartz text 2009 posting swartz accompanied chiptunes version star-spangled banner mit regained full control seven hours early hours january 26 2013 u.s sentencing commission website ussc.gov hacked anonymous home page replaced embedded youtube video anonymous operation last resort video statement said swartz faced impossible choice hacker downloaded hundreds thousands scientific-journal articles swiss publisher website republished open web swartz honor week first anniversary death swartz death 50,000 people signed online petition white house calling removal ortiz overreach case aaron swartz similar petition submitted calling prosecutor stephen heymann firing january 2015 two years swartz death white house declined petitions august 3 2013 swartz posthumously inducted internet hall fame hackathon held swartz memory around date birthday 2013 weekend november 8\u201310 2013 inspired swartz work life second annual hackathon held least 16 cities around world preliminary topics worked 2013 aaron swartz hackathon privacy software tools transparency activism access legal fixes low-cost book scanner january 2014 lawrence lessig led walk across new hampshire honor swartz rallying campaign finance reform 2017 turkish-dutch artist ahmet \u00f6\u011f\u00fct commemorated swartz work entitled information power people depicting bust long-time supporter open access swartz wrote guerilla open access manifesto supporters swartz responded news death effort called pdftribute promote open access january 12 eva vivalt development economist world bank began posting academic articles online using hashtag pdftribute tribute swartz scholars posted links works story aaron swartz exposed topic open access scientific publications wider audiences wake aaron swartz many institutions personalities campaigned open access scientific knowledge swartz death prompted calls open access scholarly data e.g. open science data think computer foundation center information technology policy citp princeton university announced scholarships awarded memory aaron swartz 2013 swartz posthumously awarded american library association james madison award outspoken advocate public participation government unrestricted access peer-reviewed scholarly articles march editor editorial board journal library administration resigned en masse citing dispute journal publisher routledge one board member wrote crisis conscience publishing journal open access death aaron swartz 2002 swartz stated died wanted contents hard drives made publicly available coalition consortium launched european research council continues fight aaron swartz make available 2020 scientific publications financed member states coalition several members u.s. house representatives \u2013 republican darrell issa democrats jared polis zoe lofgren \u2013 house judiciary committee raised questions regarding government handling case calling charges ridiculous trumped polis said swartz martyr whose death illustrated need congress limit discretion federal prosecutors speaking memorial swartz capitol hill issa said massachusetts democratic senator elizabeth warren issued statement saying aaron advocacy internet freedom social justice wall street reform demonstrated ... power ideas ... letter attorney general eric holder texas republican senator john cornyn asked basis u.s. attorney district massachusetts conclude office conduct 'appropriate prosecution mr. swartz way retaliation exercise rights citizen freedom information act issa chairs house committee oversight government reform announced would investigate justice department actions prosecuting swartz statement huffington post praised swartz work toward open government free access people issa investigation garnered bipartisan support january 28 2013 issa ranking committee member elijah cummings published letter u.s. attorney general holder questioning federal prosecutors filed superseding indictment february 20 wbur reported ortiz expected testify upcoming oversight committee hearing office handling swartz case february 22 associate deputy attorney general steven reich conducted briefing congressional staffers involved investigation told swartz guerilla open access manifesto played role prosecutorial decision-making congressional staffers left briefing believing prosecutors thought swartz convicted felony carrying least short prison sentence order justify filed case first place excoriating department justice department vengeance stinebrickner-kauffman told guardian doj erred relying swartz guerilla open access manifesto accurate indication beliefs 2010 longer single issue activist said lots things healthcare climate change money politics march 6 holder testified senate judiciary committee case good use prosecutorial discretion stinebrickner-kauffman issued statement reply repeating amplifying claims prosecutorial misconduct public documents wrote reveal prosecutor stephen heymann instructed secret service seize hold evidence without warrant ... lied judge fact written briefs ... withheld exculpatory evidence ... year violating legal ethical obligations turn evidence defense march 22 senator al franken wrote holder letter expressing concerns writing charging young man like mr. swartz federal offenses punishable 35 years federal imprisonment seems remarkably aggressive \u2013 particularly appears one principal aggrieved parties ... support criminal prosecution 2013 rep. zoe lofgren d-calif. introduced bill aaron law exclude terms service violations 1986 computer fraud abuse act wire fraud statute lawrence lessig wrote bill critically important change ... cfaa hook government bullying ... law would remove hook single line longer would felony breach contract professor orin kerr specialist nexus computer law criminal law wrote arguing precisely sort reform act years aclu called reform cfaa remove dangerously broad criminalization online activity eff mounted campaign reforms lessig inaugural chair lecture furman professor law leadership entitled aaron laws law justice digital age dedicated lecture swartz aaron law bill stalled committee brian knappenberger alleges due oracle corporation financial interest maintaining status quo fair access science technology research act fastr bill would mandate earlier public release taxpayer-funded research fastr described aaron law senator ron wyden d-ore. senator john cornyn r-tex introduced senate version 2013 2015 bill introduced house reps. zoe lofgren d-calif. mike doyle d-pa. kevin yoder r-kans. senator wyden wrote bill fastr act provides access taxpayer funded research never hidden behind paywall legislation passed helped prompt motion toward open access part us administration shortly bill original introduction office science technology policy directed federal agency 100 million annual conduct research development expenditures develop plan support increased public access results research funded federal government swartz featured received dedications numerous art work 2013 kenneth goldsmith dedicated printing internet exhibition swartz fate aaron swartz also featured conservative filmmaker dinesh d'souza 2014 documentary wherein d'souza compares swartz prosecution conviction violating campaign finance laws alleges cases exemplify selective overzealous prosecution also dedicated biographical films aaron january 11 2014 marking first anniversary death preview released internet boy story aaron swartz documentary swartz nsa sopa film officially released january 2014 sundance film festival democracy covered release documentary well swartz life legal case sprawling interview director brian knappenberger swartz father brother attorney documentary released creative commons license debuted theaters on-demand june 2014 mashable called documentary powerful homage aaron swartz debut sundance received standing ovation mashable printed help experts internet boy makes clear argument swartz unjustly became victim rights freedoms stood hollywood reporter described heartbreaking story tech wunderkind persecuted us government must-see anyone knows enough care way laws govern information transfer digital age october 2014 killswitch film featuring aaron swartz well lawrence lessig tim wu edward snowden received world premiere woodstock film festival award best editing film focuses swartz role advocating internet freedoms february 2015 killswitch invited screen capitol visitor center washington d.c. congressman alan grayson event held eve federal communications commission historic decision net neutrality congressman grayson lawrence lessig free press ceo craig aaron spoke swartz fight behalf free open internet event congressman grayson states killswitch one honest accounts battle control internet \u2013 access information richard von busack metro silicon valley writes killswitch lapidary use found footage side atomic caf\u00e9 fred swegles orange county register remarks anyone values unfettered access online information apt captivated killswitch gripping fast-paced documentary kathy gill geekwire asserts killswitch much dry recitation technical history director ali akbarzadeh producer jeff horn writer chris dollar created human-centered story large part connection comes lessig relationship swartz patriot web independent biographical film aaron swartz written directed darius burke set released august 2019 amazon film limited video demand release december 2017 reelhouse january 2018 pivotshare another biographical film swartz think aaron developed hbo films swartz identified cofounder reddit title source controversy merger infogami reddit swartz became co-owner director parent company bug inc. along reddit cofounders steve huffman alexis ohanian swartz referred cofounder press investor paul graham recommended merger ohanian describes co-owner", + "neighbors": [ + 14, + 16, + 488, + 611, + 897, + 919, + 1225, + 1232, + 1246, + 1465, + 1582 + ], + "mask": "Test" + }, + { + "node_id": 1636, + "label": 9, + "text": "Reference_(computer_science):reference computer science computer science reference value enables program indirectly access particular datum variable value record computer memory storage device reference said refer datum accessing datum called dereferencing reference reference distinct datum typically references data stored memory given system reference implemented physical address data stored memory storage device reason reference often erroneously confused pointer address said point data however reference may also implemented ways offset difference datum address fixed base address index array abstractly handle broadly networking references may network addresses urls concept reference must confused values keys identifiers uniquely identify data item give access non-trivial lookup operation table data structure references widely used programming especially efficiently pass large mutable data arguments procedures share data among various uses particular reference may point variable record contains references data idea basis indirect addressing many linked data structures linked lists references cause significant complexity program partially due possibility dangling wild references partially topology data references directed graph whose analysis quite complicated references increase flexibility objects stored allocated passed areas code long one access reference data one access data data need moved also make sharing data different code areas easier keeps reference mechanism references varying implementation fundamental programming language feature common nearly modern programming languages even languages support direct use references internal implicit use example call reference calling convention implemented either explicit implicit use references pointers primitive due intimate relationship underlying hardware one powerful efficient types references however also due relationship pointers require strong understanding programmer details memory architecture pointers store memory location address instead value directly inappropriate use pointers lead undefined behavior program particularly due dangling pointers wild pointers smart pointers opaque data structures act like pointers accessed particular methods handle abstract reference may represented various ways common example file handles file data structure c standard i/o library used abstract file content usually represents file requesting lock file specific position within file content reading file distributed computing reference may contain address identifier may also include embedded specification network protocols used locate access referenced object way information encoded serialized thus example wsdl description remote web service viewed form reference includes complete specification locate bind particular web service reference live distributed object another example complete specification construct small software component called proxy subsequently engage peer-to-peer interaction local machine may gain access data replicated exists weakly consistent message stream cases reference includes full set instructions recipe access data sense serves purpose identifier address memory generally reference considered piece data allows unique retrieval another piece data includes primary keys databases keys associative array set keys k set data objects well-defined single-valued function k \u222a null defines type reference null image key referring anything meaningful alternative representation function directed graph called reachability graph datum represented vertex edge u v datum u refers datum v maximum out-degree one graphs valuable garbage collection used separate accessible inaccessible objects many data structures large complex objects composed smaller objects objects typically stored one two ways internal storage usually efficient space cost references dynamic allocation metadata time cost associated dereferencing reference allocating memory smaller objects internal storage also enhances locality reference keeping different parts large object close together memory however variety situations external storage preferred languages java smalltalk python scheme support internal storage languages objects uniformly accessed references assembly languages first languages used typical express references using either raw memory addresses indexes tables work somewhat tricky use address tells nothing value points even large interpret information encoded program logic result misinterpretations occur incorrect programs causing bewildering errors one earliest opaque references lisp language cons cell simply record containing two references lisp objects including possibly cons cells simple structure commonly used build singly linked lists also used build simple binary trees so-called dotted lists terminate null reference value another early language fortran explicit representation references use implicitly call-by-reference calling semantics pointer still one popular types references today similar assembly representation raw address except carries static datatype used compile-time ensure data refers misinterpreted however c weak type system violated using casts explicit conversions various pointer types pointer types integers misinterpretation still possible difficult successor c++ tried increase type safety pointers new cast operators smart pointers standard library still retained ability circumvent safety mechanisms compatibility number popular mainstream languages today eiffel java c visual basic adopted much opaque type reference usually referred simply reference references types like c pointers indicating interpret data reference typesafe interpreted raw address unsafe conversions permitted fortran reference best thought alias another object scalar variable row column array syntax dereference reference manipulate contents referent directly fortran references null languages references facilitate processing dynamic structures linked lists queues trees settings concept mutable variables data modified often makes implicit use references standard ml ocaml many functional languages values persistent modified assignment assignable reference cells serve unavoidable purposes mutable references imperative languages make capability modified explicit reference cells hold value given polymorphic type codice_1 codice_2 replaced type value pointed mutable references pointed different objects lifetime example permits building circular data structures reference cell functionally equivalent array length 1 preserve safety efficient implementations references type-cast ml pointer arithmetic performed important note functional paradigm many structures would represented using pointers language like c represented using facilities powerful algebraic datatype mechanism programmer able enjoy certain properties guarantee immutability programming even though compiler often uses machine pointers hood languages like perl support symbolic references string values contain names variables value regular reference dereferenced perl considers symbolic reference gives variable name given value php similar feature form codice_3 syntax many object oriented languages make extensive use references may use references access assign objects references also used function/method calls message passing reference counts frequently used perform garbage collection unused objects", + "neighbors": [ + 14, + 78, + 306, + 347, + 378, + 392, + 429, + 436, + 491, + 505, + 551, + 579, + 684, + 737, + 820, + 873, + 919, + 1225, + 1227, + 1235, + 1415, + 1416, + 1418, + 1430, + 1437, + 1465, + 1477, + 1491, + 1508, + 1626 + ], + "mask": "Test" + }, + { + "node_id": 1637, + "label": 6, + "text": "Synthetic_file_system:synthetic file system computer science synthetic file system pseudo file system hierarchical interface non-file objects appear regular files tree disk-based long-term-storage file system non-file objects may accessed system calls utility programs regular files directories common term regular files non-file objects node benefit synthetic file systems well known file system semantics reused universal easily implementable approach interprocess communication clients use file system perform simple file operations nodes implement complex message encoding passing methods aspects protocol engineering operations common file utilities used even scripting quite easy commonly known everything file generally regarded originated unix unix-world commonly special filesystem mounted /proc filesystem implemented within kernel publishes information processes process directory named process id containing detailed information process status open files memory maps mounts etc /proc first appeared unix 8th edition functionality greatly expanded plan 9 bell labs /sys filesystem linux complements /proc providing lot non-process related detailed information in-kernel status userspace traditional unix systems locate information sysctl calls obexfs fuse-based filesystem provides access obex objects via filesystem applications work remote objects via obex protocol simply local files plan 9 bell labs operating system family concept 9p synthetic filesystem used generic ipc method contrary operating systems plan 9 design heavily distributed os worlds many often large libraries frameworks common things plan 9 encapsulates fileservers important benefit applications much simpler services run network platform agnostic reside virtually host platform network virtually kind network long fileserver mounted application plan 9 drives concept expansively operating system services e.g hardware access networking stack presented fileservers way trivial use resources remotely e.g one host directly accessing another host block devices network interfaces without need additional protocols implementations 9p file system protocol also exists many systems environments debugging embedded systems even system-on-chip soc devices widely known difficult several protocols implemented provide direct access in-chip devices tend proprietary complex hard handle based 9p plan 9 network filesystem studies suggest using synthetic filesystems universal access scheme information major benefit 9p simple quite easy implement hardware easily used virtually kind network serial link internet major argument using synthetic filesystems might flexibility easy access service-oriented architectures noticeable number applications use scheme overall overhead code resource consumption maintenance work reduced significantly many general arguments soas also apply arguments synthetic filesystems include fact filesytem semantics may fit application scenarios example complex remote procedure calls many parameters tend hard map filesystem schemes may require application redesign", + "neighbors": [ + 1, + 9, + 34, + 37, + 40, + 55, + 58, + 63, + 64, + 99, + 134, + 170, + 171, + 187, + 222, + 233, + 278, + 295, + 322, + 326, + 334, + 349, + 358, + 413, + 438, + 465, + 477, + 495, + 524, + 553, + 557, + 558, + 570, + 583, + 664, + 723, + 728, + 754, + 797, + 860, + 887, + 891, + 892, + 900, + 908, + 912, + 922, + 941, + 942, + 961, + 966, + 982, + 997, + 1011, + 1012, + 1024, + 1027, + 1040, + 1049, + 1056, + 1064, + 1097, + 1104, + 1124, + 1138, + 1155, + 1157, + 1187, + 1201, + 1202, + 1224, + 1234, + 1252, + 1283, + 1301, + 1322, + 1381, + 1398, + 1415, + 1441, + 1445, + 1459, + 1474, + 1494, + 1530, + 1546, + 1565, + 1578, + 1616, + 1631 + ], + "mask": "Test" + }, + { + "node_id": 1638, + "label": 2, + "text": "Crypto_API_(Linux):crypto api linux crypto api cryptography framework linux kernel various parts kernel deal cryptography ipsec dm-crypt introduced kernel version 2.5.45 since expanded include essentially popular block ciphers hash functions many platforms provide hardware acceleration aes encryption expose programs extension instruction set architecture isa various chipsets e.g aes instruction set x86 sort implementation program kernel-mode user-space may utilize features directly platforms arm kirkwood sheevaplug amd geode processors however implemented isa extensions accessible kernel-mode drivers order user-mode applications utilize encryption openssl gnutls take advantage acceleration must interface kernel", + "neighbors": [ + 85, + 134, + 213, + 219, + 265, + 267, + 294, + 305, + 327, + 346, + 400, + 401, + 542, + 571, + 630, + 650, + 688, + 720, + 725, + 736, + 752, + 897, + 935, + 986, + 1060, + 1102, + 1105, + 1197, + 1202, + 1208, + 1241, + 1252, + 1278, + 1313, + 1351, + 1357, + 1360, + 1391, + 1415, + 1456, + 1468, + 1524, + 1526, + 1558, + 1602 + ], + "mask": "Test" + } +] \ No newline at end of file